Modelling of switching systems in bond graphs using the concept of switched power junctions

Modelling of switching systems using bond graph is a research issue. There have been many proposals in this context. However, there are many issues that need consideration. This paper proposes the concept of switched power junctions that is a generalisation of the conventional junction concept in bond graph modelling. This approach removes most of the difficulties associated with other methodologies. This method ensures that causality remains invariant during mode switching thus keeping the state vector and its dimension time invariant. Further, the switched power junction displays all feasible system modes at the same time on the same graph. This concept is further illustrated through simulation using examples of switching systems in the electrical domain.     

Bond graph approach as analysis tool in thermofluid model library conception

The bond graph is a modelling and simulation tool, providing many possibilities. A methodology based on causal and behavioral bond graph analysis to build a dynamic icon model library in continuous thermofluid process is presented. The developed approach is implemented using SYMBOLS software and applied to a complex steam generator installation. The methodology given as assistant tool, is proposed so that the industrial designer can easily build a thermofluid model of most technological processes.     

Some network thermodynamic models of coupled,dynamic physiological systems

A network thermodynamic method is presented which utilizes SPICE2, a computer program for simulating nonlinear electrical circuits, to model and simulate a number of nonlinear, dynamic physiological systems. Ordinary circuit diagrams are presented along with bond graph representations to facilitate translation into the simulation language. Examples discussed are a compartmental model of sodium flow in frog skin, coupled salt and volume flow in kidney proximal tubule and a cancer chemotherapeutic agent's permeation and metabolism in a cancer cell.     

Modelling and Passivity Based Control of switched systems from bond graph formalism: Application to multicellular converters

This paper addresses the modelling and control of switched systems with Boolean inputs. A generalization of Passivity Based Control (PBC) is proposed and fitted to bond graph formalism. The state equations of the equivalent average model are first deduced from the original bond graph using the notion of commutation cells and then interpreted according to Port Controlled Hamiltonian formalism. The whole approach is presented in a formal way. This method is then applied on a multicellular serial converter, which is widespread in power systems and of growing interest. The application of PBC associated to a modelling approach using commutation cells on a non-trivial example shows its efficiency to determine a generic controller, the number of elementary cells being considered as a parameter.     

Rank one chaos in a switch-controlled Chua's circuit

In this paper, we study the existence of strange attractors in a switch-controlled Chua's circuit. This circuit is obtained from the original Chua's circuit by adding externally controlled switches to it in such a way to modulate the system state variables. This investigation is conducted from the perspective of a recent chaos theory of rank one maps. The externally controlled switches are used for the purposes of realizing the general settings of the theory. Both synchronous and asynchronous switch control schemes providing periodic kicks in various directions are investigated, and their effects on the resulting chaotic attractors are discussed. The results of the numerical simulations presented are in close agreement with the expectations of the theory.     

Synthesizing antipodal chaotic waveforms

Chaotic waveforms are natural information carriers since a correspondence can be established between the symbolic dynamics of a chaotic oscillator and the symbols of a message. Message symbols can be efficiently encoded in a chaotic waveform by applying vanishingly small perturbations to an oscillator to guide its symbolic dynamics to follow a desired course. Recently, two chaotic hybrid dynamical systems were shown to have matched filters enabling robust reception of chaotic communication waveforms in the presence of noise. The first of these, the exact shift oscillator, produces waveforms with desirable properties similar to antipodal signaling, but a physical implementation may be difficult to control using small perturbations. The second oscillator, the exact folded-band oscillator, produces less optimal waveforms but is more easily controlled. Here we introduce a method for generating waveforms of the exact shift oscillator by summing waveforms from a bank of easily controlled exact folded-band oscillators. We show that any solution of the exact shift oscillator can be so constructed using only three folded-band oscillators. Thus, this scheme allows us to realize the advantages of both chaotic systems while overcoming their individual disadvantages, thereby enabling practical chaos communications.     

Three-axis platform simulation: Bond graph and Lagrangian approach

A bond graph model is derived for the geometric constraints of a three-axis flight table. Gimbal dynamics are easily added even in asymmetrical and unbalanced cases. A method is introduced to make the local dependent inertias computable. The bond graph compares favourably to the Lagrangian approach as to modelling effort and accessibility of intermediate variables as well as having computational advantages.     

Theory and application of antenna arrays : M.T. Ma. 413 pages, 171 figures, 6x9 in., John Wiley,New York, 1974. Price, $22.50.

The theory of transient operations of synchronous machines—the so called two-reaction theory—was developed during the years 1926–1938. Doherty, Nickle and Park made the first efforts to find a complete theory. The problem then was solved by Kron for a general rotating electrical machine. In this paper the two-axis-model-machine is described using a bond graph. An example is given in which state-space-equations and output-equations are derived from the bond graph. A power-conserving transformation between the electrical quantities of the armature windings of the model machine and those of the real three phase armature windings is developed. This transformation is shown as a displacement modulated transformer structure which is central to the bond graph model.     

A Bond Graph Description of U-Tube Steam Generator Dynamics

Bond graph methods are used to derive a nonlinear model of a U-tube steam generator like those used in pressurized water reactor (PWR) power plants. A major advantage of bond graph modeling is the ease with which different subsystem models can be interconnected; this feature is demonstrated in the steam generator modeling. Individual models of primary water cooling, generator tube heat capacity, secondary and downcomer fluid mass and energy flows, the feedwater supply system, and the main steam control valve are developed. The complete bond graph model is validated using data from a test reactor steam generator.     

基于系统动力学的新兴绿色产业链价值增值研究

运用系统动力学方法并以新兴绿色产业为模拟对象,建立新兴绿色产业链价值增值的系统流图和系统动力学模型,应用Vensim PLE对模型进行仿真模拟,构建仿真模型对新兴绿色产业链价值增值进行仿真预测,进而对新兴绿色产业链价值增值的影响因素进行分析,为新兴绿色产业的培育及发展决策提供参考。     

Real-time dynamic modeling of hydrogen PEMFCs

A control-oriented dynamic model of proton exchange membrane fuel cells (PEMFCs) has been developed in this paper. It aims to generate system dynamics with real-time performance for the micro-chip controller design. A unified bond graph approach was employed that integrates physical and chemical domains in the fuel cell operation, including fluid dynamics, heat transfer, and electrochemistry effects. In this paper, two major bond graphs, one for thermofluids, the other for the electrochemical system, were constructed. They are inter-connected to interpret the highly nonlinear transport and reaction system dynamics. The nonlinear simulation on a personal computer (PC) is about four times faster than the realistic operation. A step response test shows that the start-up time of an example PEMFC is about 5 s from ambient conditions. Further frequency-response test in the operation region shows that the bandwidth is near 2 rad/s.     

Bond graph fluid line models for inclusion with dynamic systems simulations

A procedure is presented whereby the control volume equations for one-dimensional, compressible gas dynamics are cast into first-order, state variable form. These equations are interpreted using causal bond graphs. The resulting bond graph is shown to reduce to the classic I-C chain under acoustic constraints and to a more recently developed model of low speed thermal energy transport subject to associated constraints.Through example it is demonstrated that the control volume bond graph is easily coupled to an overall system model and thus can be digitally simulated as part of the overall nonlinear state space representation. The result is that a very accurate gas dynamic model can be coupled with an overall dynamic system model without requiring a prohibitively large number of equations.     

由高频正弦波振荡器的仿真谈Multisim仿真软件在“高频电子线路”教学中的应用

本文结合高频正弦波振荡器电路的仿真实例说明了仿真软件在高频电子线路教学中的应用,阐述了在高频电子线路教学过程中引入Multisim仿真软件对提高教学质量,激发学生学习兴趣的积极意义。     

Bond graph formulation of an optimal control problem for linear time invariant systems

A recent communication has proposed a conjectural procedure for representing a category of optimal control problems in bond graph language [W. Marquis-Favre, B. Chereji, D. Thomasset, S. Scavarda, Bond graph representation of an optimal control problem: the dc motor example, in: ICBGM’05 International Conference of Bond Graph Modelling and Simulation, New Orleans, USA, January 23-27, 2005, pp. 239-244]. This paper aims at providing a fundamental theory for proving the effectiveness of this procedure. The class of problem that the procedure can deal with has been extended. Its application was formerly restricted to linear time invariant siso system. The systems considered now are linear time invariant mimo systems. The optimization objective is the minimization of dissipation and input. The developments concerning the optimal control problem are based on the Pontryagin maximum principle and the proof of the effectiveness of the procedure makes a broad use of the port-Hamiltonian concept. As a result, the bond graph representation of the given optimization problem enables the analytical system, which provides the optimal solution, to be derived. The work presented in this paper is the first step in research with perspectives towards formulating dynamic optimization problems in bond graph and, towards coupling this formulation with a sizing methodology using bond graph language and a state-space inverse model approach. This sizing methodology, however, is not the topic of this paper and thus is not presented here.     

Electronic circuit implementation of the chaotic Rulkov neuron model

Numerical integration is the most common and straightforward approach in computational neuroscience for the study of biological neuron models based on ordinary differential equations. For some purposes, numerical simulations are not enough due to the multiple bottlenecks in computer architectures. However, when electronic circuits are used to simulate in real time large arrays of coupled neurons, the simulations are much faster than the computer simulations. We present here an electronic implementation of a map-based neuron model, a chaotic Rulkov neuron model, that can be easily transferred on a large scale integration circuit and thus provide a framework for the simulation of large networks of neurons. The Rulkov model is a map-based neuron model that has a surprising abundance of features, such as periodic and chaotic spiking and bursting. The discrete time dynamics allows to tune the time scale of the circuit to the needs of the specific application. Since the circuit described here only uses 18 MOS transistors, it offers new perspectives for building large networks of neurons in a single device. This is very relevant for the analysis of large networks of coupled neurons in order to investigate its dynamics over the network and its synchronization properties.     

A new approach for constrained chaos synchronization with application to secure data communication

In this paper, a new technique is introduced for chaos secure data communication. In this approach, in addition to the usually used techniques for data encryption, the concept of carrier encryption is introduced to increase the security level of the secure communication scheme. To fulfill this objective, at the transmitting end, two chaotic oscillators are coupled, and a set of inequality time dependent constraints with time dependent bounds is imposed on the generated chaotic signals. Moreover, to increase system complexity and its security level, the imposed set of constraints and their bounds are allowed to be changeable from one time period to another during the transmission process. As a result, the patterns of the generated chaotic signals are completely changed and the chaotic oscillator is completely encrypted. At the receiving end, the newly developed Constrained Smoothed Regularized Least Square (CSRLS) observer is used to synchronize the received constrained chaotic signals and hence retrieve the transmitted data. Using such an approach, the quality of the received information, measured by the Bit Error Rate (BER), is highly improved due to the superior performance of the developed CSRLS observer. The stability of the observer is analyzed, and simulation results are presented to show the efficiency and effectiveness of the proposed secure communication scheme.     

Reduction of models of interacting lumped and distributed systems using bond graphs and repeated modal decomposition

Previous works have shown the usefulness of bond graphs for modeling and simulation of interacting lumped and distributed systems. Frequently, when damping is included in the model, the overall system is “stiff”, possessing widely disparate characteristic times. This makes simulation difficult and time consuming.Bond graphs are used here to represent the interacting lumped and modal dynamics of a system while treating the damping as an external forcing onto the system. By performing a second modal decomposition, a second bond graph model can be formulated where the damping can now be physically represented. The result is a total system model in which the characteristic times can be controlled through elimination of high frequency modes.     

The energetic structure of multi-body dynamic systems

Dynamic systems containing particles and rigid bodies capable of movement in two- or three-dimensions may be represented by equations of motion in several basic forms. In all cases geometric nonlinearities are involved and terms arise in the equations which are difficult to understand and interpret. The equations often conceal the basic structure of the dynamic model of the system since only combinations of parameters and combined effects of various constraints finally appear.In this paper the basic relations for the dynamic elements as well as the transformations among internal forces and velocities are depicted using bond graphs. The energetic structure of the system is thus exhibited in multiport form. This aids in the exploration of alternative equation formulation and in understanding of the assumptions involved in any particular equation set. Further, a bond graph model is easily coupled with nonmechanical dynamic models through force or motion generators.     

Cascade embedding model for knowledge graph inference and retrieval

Knowledge graphs are widely used in retrieval systems, question answering systems (QA), hypothesis generation systems, etc. Representation learning provides a way to mine knowledge graphs to detect missing relations; and translation-based embedding models are a popular form of representation model. Shortcomings of translation-based models however, limits their practicability as knowledge completion algorithms. The proposed model helps to address some of these shortcomings.The similarity between graph structural features of two entities was found to be correlated to the relations of those entities. This correlation can help to solve the problem caused by unbalanced relations and reciprocal relations. We used Node2vec, a graph embedding algorithm, to represent information related to an entity's graph structure, and we introduce a cascade model to incorporate graph embedding with knowledge embedding into a unified framework. The cascade model first refines feature representation in the first two stages (Local Optimization Stage), and then uses backward propagation to optimize parameters of all the stages (Global Optimization Stage). This helps to enhance the knowledge representation of existing translation-based algorithms by taking into account both semantic features and graph features and fusing them to extract more useful information. Besides, different cascade structures are designed to find the optimal solution to the problem of knowledge inference and retrieval.The proposed model was verified using three mainstream knowledge graphs: WIN18, FB15K and BioChem. Experimental results were validated using the hit@10 rate entity prediction task. The proposed model performed better than TransE, giving an average improvement of 2.7% on WN18, 2.3% on FB15k and 28% on BioChem. Improvements were particularly marked where there were problems with unbalanced relations and reciprocal relations. Furthermore, the stepwise-cascade structure is proved to be more effective and significantly outperforms other baselines.     

Finite-time outer-synchronization for complex networks with Markov jump topology via hybrid control and its application to image encryption

This paper investigates the problem of finite-time outer-synchronization for discrete-time complex networks with Markov jump topology in the presence of communication delays and possible information losses and its application to image encryption. A hybrid control, which is subject to both stochastic jumps and deterministic switches, is proposed to realize finite-time and stochastic outer-synchronization for the concerned networks. By utilizing a stochastic Lyapunov functional combined with the average dwell-time method, sufficient conditions are found such that the synchronization error dynamical system is stochastically stable in finite-time. Two numerical examples are presented to illustrate the effectiveness of the proposed method. Finally, the complex network consists of four coupled Lorenz systems are utilized to generate chaotic sequences and a new chaotic image cryptosystem is constructed to transmit encrypted images based on the synchronized drive-response complex networks. Experiments are conducted by using numerical simulation, and the security is analyzed in terms of key space, key sensitivity, histogram distributions, correlation coefficients, information entropy and differential attack measures. The experimental results show that the proposed chaotic image cryptosystem has the advantages of high security against some classical attacks.