Analysis of Acoustoelastic Systems Using Modal Bond Graphs

1990 ◽  
Vol 112 (1) ◽  
pp. 108-115 ◽  
Author(s):  
B. Samanta ◽  
A. Mukherjee
Keyword(s):  
System Dynamics ◽  
Natural Frequencies ◽  
Bond Graph ◽  
Bond Graphs ◽  
Two Stage ◽  
Modal Decomposition ◽  
Second Stage ◽  
Wide Range ◽  
Modal Truncation

A procedure is presented to study the dynamics of acoustoelastic systems within the framework of bond graph technique. The substructures, acoustic and structural, are modeled individually in form of bond graphs that are coupled through suitable elements satisfying the conditions at the interfaces. From this bond graph a second stage modal decomposition is performed to represent the overall system in yet another bond graph that can be analyzed to obtain the overall system dynamics. The scope for two-stage modal truncation makes the procedure suitable for analyzing acoustoelastic systems that are “stiff” in nature due to the wide range of their natural frequencies. The procedure is illustrated by suitable examples.

Open Systems Formulation and Gaining Insight Using Lagrangian Bond Graphs

2000 ◽  
Author(s):  
Robin C. Redfield
Keyword(s):  
System Dynamics ◽  
Open Systems ◽  
Classical Method ◽  
System Modeling ◽  
Bond Graph ◽  
Small Scale ◽  
Bond Graphs ◽  
Model Modification ◽  
System Equations ◽  
Insight Into

Abstract Models of a small-scale water rocket are developed as an example of open system modeling by both the bond graph approach and a more classical method. One goal of the development is to determine the benefits of the bond graph approach into affording insight into the system dynamics. Both modeling approaches yield equivalent differential equations as they should, while the bond graph approach yields significantly more insight into the system dynamics. If a modeling goal is to simply find the system equations and predict behavior, the classical approach may be more expeditious. If insight and ease of model modification are desired, the bond graph technique is probably the better choice. But then you have to learn it!

scholarly journals Bond graph modelling of the cardiac action potential: implications for drift and non-unique steady states

2018 ◽  
Vol 474 (2214) ◽  
pp. 20180106 ◽  
Author(s):  
Michael Pan ◽  
Peter J. Gawthrop ◽  
Kenneth Tran ◽  
Joseph Cursons ◽  
Edmund J. Crampin
Keyword(s):  
Action Potential ◽  
Conservation Laws ◽  
Cardiac Electrophysiology ◽  
Bond Graph ◽  
Steady States ◽  
Cardiac Action Potential ◽  
Bond Graphs ◽  
Charge Conservation ◽  
Cardiac Action ◽  
Wide Range

Mathematical models of cardiac action potentials have become increasingly important in the study of heart disease and pharmacology, but concerns linger over their robustness during long periods of simulation, in particular due to issues such as model drift and non-unique steady states. Previous studies have linked these to violation of conservation laws, but only explored those issues with respect to charge conservation in specific models. Here, we propose a general and systematic method of identifying conservation laws hidden in models of cardiac electrophysiology by using bond graphs, and develop a bond graph model of the cardiac action potential to study long-term behaviour. Bond graphs provide an explicit energy-based framework for modelling physical systems, which makes them well suited for examining conservation within electrophysiological models. We find that the charge conservation laws derived in previous studies are examples of the more general concept of a ‘conserved moiety’. Conserved moieties explain model drift and non-unique steady states, generalizing the results from previous studies. The bond graph approach provides a rigorous method to check for drift and non-unique steady states in a wide range of cardiac action potential models, and can be extended to examine behaviours of other excitable systems.

Lagrangian Bond Graphs for Solid Continuum Dynamics Modeling

1994 ◽  
Vol 116 (2) ◽  
pp. 178-192 ◽  
Author(s):  
E. P. Fahrenthold ◽  
J. D. Wargo
Keyword(s):  
Finite Element ◽  
Bond Graph ◽  
Dynamics Modeling ◽  
Bond Graphs ◽  
Element Discretization ◽  
Large Order ◽  
Wide Range ◽  
Bond Graph Modeling ◽  
Continuum Dynamics ◽  
Fixed Bond

The limitations of existing continuum bond graph modeling techniques have effectively precluded their use in large order problems, where nonrepetitive graph structures and causal patterns are normally present. As a result, despite extensive publication of bond graph models for continuous systems simulations, bond graph methods have not offered a viable alternative to finite element analysis for the vast majority of practical problems. However, a new modeling approach combining Lagrangian (mass fixed) bond graphs with a selected finite element discretization scheme allows for direct simulation of a wide range of large order solid continuum dynamics problems. With appropriate modifications, including the use of Eulerian (space fixed) bond graphs, the method may be extended to include fluid dynamics modeling.

Bond Graph Modeling of a Two-Stage Pressure Relief Valve

2013 ◽  
Vol 135 (4) ◽  
Author(s):  
Osama Gad
Keyword(s):  
Mathematical Model ◽  
Graph Model ◽  
Bond Graph ◽  
Fluid Power ◽  
Pressure Relief Valve ◽  
System Component ◽  
Bond Graphs ◽  
Relief Valve ◽  
Two Stage ◽  
Pressure Relief

This study examined the use of bond graphs for the modeling and simulation of a fluid power system component. A new method is presented for creating the bond graph model, based upon a previously developed mathematical model. A nonlinear dynamic bond graph model for a two-stage pressure relief valve has been developed in this paper. Bond graph submodels were constructed considering each element of the studied valve assembly. The overall bond graph model of the valve was developed by combining these submodels using junction structures. Causality was then assigned in order to obtain a computational model, which could be simulated. The simulation results of the causal bond graph model were compared with those of a mathematical model, which had been also developed in this paper based on the same assumptions. The results were found to correlate very well both in the shape of the curves, magnitude, and response times. The causal bond graph model was verified experimentally in the dynamic mode of operation. As a result of comparison, bond graphs can quickly and accurately model the dynamics in a fluid power control system component. During the simulation study, it was found that nonlinearity occur due to three factors: changes in pressure, which cause nonlinear velocity changes of the flow rate; changes in the throttling area of the valve restriction, which usually changes nonlinearly; and changes in the discharge coefficient of the throttling area of the valve restriction, which does not remain constant.

An Enhanced Two Stage MMSE Equalizer for Coded FBMC/OQAM Systems

2019 ◽  
Vol 10 (1) ◽  
pp. 69-82 ◽  
Author(s):  
Mohammad Rizk Assaf ◽  
Abdel-Nasser Assimi
Keyword(s):  
Error Propagation ◽  
Channel Model ◽  
Error Correcting Codes ◽  
Two Stage ◽  
Probability Of Error ◽  
Second Stage ◽  
Different Types ◽  
Mmse Equalizer ◽  
And Performance ◽  
Ici Cancellation

In this article, the authors investigate the enhanced two stage MMSE (TS-MMSE) equalizer in bit-interleaved coded FBMC/OQAM system which gives a tradeoff between complexity and performance, since error correcting codes limits error propagation, so this allows the equalizer to remove not only ICI but also ISI in the second stage. The proposed equalizer has shown less design complexity compared to the other MMSE equalizers. The obtained results show that the probability of error is improved where SNR gain reaches 2 dB measured at BER compared with ICI cancellation for different types of modulation schemes and ITU Vehicular B channel model. Some simulation results are provided to illustrate the effectiveness of the proposed equalizer.

scholarly journals Vibration of Rotating and Revolving Planet Rings with Discrete and Partially Distributed Stiffnesses

2020 ◽  
Vol 11 (1) ◽  
pp. 127
Author(s):  
Fuchun Yang ◽  
Dianrui Wang
Keyword(s):  
High Speed ◽  
Differential Operators ◽  
Natural Frequencies ◽  
Rotation Speed ◽  
Distribution Area ◽  
Vibration Modes ◽  
Governing Equations ◽  
Vibration Properties ◽  
Wide Range ◽  
Forced Responses

Vibration properties of high-speed rotating and revolving planet rings with discrete and partially distributed stiffnesses were studied. The governing equations were obtained by Hamilton’s principle based on a rotating frame on the ring. The governing equations were cast in matrix differential operators and discretized, using Galerkin’s method. The eigenvalue problem was dealt with state space matrix, and the natural frequencies and vibration modes were computed in a wide range of rotation speed. The properties of natural frequencies and vibration modes with rotation speed were studied for free planet rings and planet rings with discrete and partially distributed stiffnesses. The influences of several parameters on the vibration properties of planet rings were also investigated. Finally, the forced responses of planet rings resulted from the excitation of rotating and revolving movement were studied. The results show that the revolving movement not only affects the free vibration of planet rings but results in excitation to the rings. Partially distributed stiffness changes the vibration modes heavily compared to the free planet ring. Each vibration mode comprises several nodal diameter components instead of a single component for a free planet ring. The distribution area and the number of partially distributed stiffnesses mainly affect the high-order frequencies. The forced responses caused by revolving movement are nonlinear and vary with a quasi-period of rotating speed, and the responses in the regions supported by partially distributed stiffnesses are suppressed.

Personalised attraction recommendation for enhancing topic diversity and accuracy

2021 ◽  
pp. 016555152199980
Author(s):  
Yuanyuan Lin ◽  
Chao Huang ◽  
Wei Yao ◽  
Yifei Shao
Keyword(s):  
Real World ◽  
Information Overload ◽  
Two Stage ◽  
Misclassification Cost ◽  
Second Stage ◽  
Low Visibility ◽  
Recommendation Diversity ◽  
Optimisation Model ◽  
Definition Of ◽  
Improved Methods

Attraction recommendation plays an important role in tourism, such as solving information overload problems and recommending proper attractions to users. Currently, most recommendation methods are dedicated to improving the accuracy of recommendations. However, recommendation methods only focusing on accuracy tend to recommend popular items that are often purchased by users, which results in a lack of diversity and low visibility of non-popular items. Hence, many studies have suggested the importance of recommendation diversity and proposed improved methods, but there is room for improvement. First, the definition of diversity for different items requires consideration for domain characteristics. Second, the existing algorithms for improving diversity sacrifice the accuracy of recommendations. Therefore, the article utilises the topic ‘features of attractions’ to define the calculation method of recommendation diversity. We developed a two-stage optimisation model to enhance recommendation diversity while maintaining the accuracy of recommendations. In the first stage, an optimisation model considering topic diversity is proposed to increase recommendation diversity and generate candidate attractions. In the second stage, we propose a minimisation misclassification cost optimisation model to balance recommendation diversity and accuracy. To assess the performance of the proposed method, experiments are conducted with real-world travel data. The results indicate that the proposed two-stage optimisation model can significantly improve the diversity and accuracy of recommendations.

scholarly journals Two-stage multi-tasking transform framework for large-scale many-objective optimization problems

2021 ◽  
Author(s):  
Lu Chen ◽  
Handing Wang ◽  
Wenping Ma
Keyword(s):  
Large Scale ◽  
Original Problem ◽  
Optimization Problems ◽  
Reference Points ◽  
Optimization Strategy ◽  
Two Stage ◽  
Decision Space ◽  
Second Stage ◽  
Decision Variables ◽  
Objective Space

AbstractReal-world optimization applications in complex systems always contain multiple factors to be optimized, which can be formulated as multi-objective optimization problems. These problems have been solved by many evolutionary algorithms like MOEA/D, NSGA-III, and KnEA. However, when the numbers of decision variables and objectives increase, the computation costs of those mentioned algorithms will be unaffordable. To reduce such high computation cost on large-scale many-objective optimization problems, we proposed a two-stage framework. The first stage of the proposed algorithm combines with a multi-tasking optimization strategy and a bi-directional search strategy, where the original problem is reformulated as a multi-tasking optimization problem in the decision space to enhance the convergence. To improve the diversity, in the second stage, the proposed algorithm applies multi-tasking optimization to a number of sub-problems based on reference points in the objective space. In this paper, to show the effectiveness of the proposed algorithm, we test the algorithm on the DTLZ and LSMOP problems and compare it with existing algorithms, and it outperforms other compared algorithms in most cases and shows disadvantage on both convergence and diversity.

scholarly journals A Two-Stage Mono- and Multi-Objective Method for the Optimization of General UPS Parallel Manipulators

Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 543
Author(s):  
Alejandra Ríos ◽  
Eusebio E. Hernández ◽  
S. Ivvan Valdez
Keyword(s):  
Genetic Algorithm ◽  
Performance Metrics ◽  
Tracking Error ◽  
Parallel Manipulators ◽  
Optimization Method ◽  
Statistical Hypothesis ◽  
Two Stage ◽  
Multi Objective ◽  
Second Stage ◽  
Conflicting Objectives

This paper introduces a two-stage method based on bio-inspired algorithms for the design optimization of a class of general Stewart platforms. The first stage performs a mono-objective optimization in order to reach, with sufficient dexterity, a regular target workspace while minimizing the elements’ lengths. For this optimization problem, we compare three bio-inspired algorithms: the Genetic Algorithm (GA), the Particle Swarm Optimization (PSO), and the Boltzman Univariate Marginal Distribution Algorithm (BUMDA). The second stage looks for the most suitable gains of a Proportional Integral Derivative (PID) control via the minimization of two conflicting objectives: one based on energy consumption and the tracking error of a target trajectory. To this effect, we compare two multi-objective algorithms: the Multiobjective Evolutionary Algorithm based on Decomposition (MOEA/D) and Non-dominated Sorting Genetic Algorithm-III (NSGA-III). The main contributions lie in the optimization model, the proposal of a two-stage optimization method, and the findings of the performance of different bio-inspired algorithms for each stage. Furthermore, we show optimized designs delivered by the proposed method and provide directions for the best-performing algorithms through performance metrics and statistical hypothesis tests.

scholarly journals Fast Two-Stage Computation of an Index Policy for Multi-Armed Bandits with Setup Delays

Mathematics ◽  
2020 ◽  
Vol 9 (1) ◽  
pp. 52
Author(s):  
José Niño-Mora
Keyword(s):  
Numerical Study ◽  
Arithmetic Operation ◽  
Bandit Problem ◽  
Index Policy ◽  
Two Stage ◽  
Second Stage ◽  
Whittle Index ◽  
Set Up ◽  
Computing Method ◽  
Special Case

We consider the multi-armed bandit problem with penalties for switching that include setup delays and costs, extending the former results of the author for the special case with no switching delays. A priority index for projects with setup delays that characterizes, in part, optimal policies was introduced by Asawa and Teneketzis in 1996, yet without giving a means of computing it. We present a fast two-stage index computing method, which computes the continuation index (which applies when the project has been set up) in a first stage and certain extra quantities with cubic (arithmetic-operation) complexity in the number of project states and then computes the switching index (which applies when the project is not set up), in a second stage, with quadratic complexity. The approach is based on new methodological advances on restless bandit indexation, which are introduced and deployed herein, being motivated by the limitations of previous results, exploiting the fact that the aforementioned index is the Whittle index of the project in its restless reformulation. A numerical study demonstrates substantial runtime speed-ups of the new two-stage index algorithm versus a general one-stage Whittle index algorithm. The study further gives evidence that, in a multi-project setting, the index policy is consistently nearly optimal.

Sign in / Sign up

Export Citation Format

Share Document