Abstract: This paper proposes the designing direct adaptive
neural controller to apply for a class of a nonlinear pendulum
dynamic system. The radial basis function (RBF) neural adaptive
controller is robust in presence of external and internal uncertainties.
Both the effectiveness of the controller and robustness against
disturbances are importance of this paper. The simulation results
show the promising performance of the proposed controller.
Abstract: In this paper, we consider the nonlinear delay dynamic system
xΔ(t) = p(t)f1(y(t)), yΔ(t) = −q(t)f2(x(t − τ )).
We obtain some necessary and sufficient conditions for the existence of nonoscillatory solutions with special asymptotic properties of the system. We generalize the known results in the literature. One example is given to illustrate the results.
Abstract: A mixed method by combining a Eigen algorithm and improved pade approximations is proposed for reducing the order of the large-scale dynamic systems. The most dominant Eigen value of both original and reduced order systems remain same in this method. The proposed method guarantees stability of the reduced model if the original high-order system is stable and is comparable in quality with the other well known existing order reduction methods. The superiority of the proposed method is shown through examples taken from the literature.
Abstract: Dynamic systems, which in mathematical point of view are those governed by differential equations, are much more difficult to study and to predict their behavior in comparison with static systems which are governed by algebraic equations. Economical systems such as market are among complicated dynamic systems. This paper tries to adopt a very simple mathematical model for market and to study effect of supply and demand function on behavior of the market while the supply side experiences a lag due to production restrictions.
Abstract: Due to simplicity and low cost, rotordynamic system is often modeled by using lumped parameters. Recently, finite elements have been used to model rotordynamic system as it offers higher accuracy. However, it involves high degrees of freedom. In some applications such as control design, this requires higher cost. For this reason, various model reduction methods have been proposed. This work demonstrates the quality of model reduction of rotor-bearing-support system through substructuring. The quality of the model reduction is evaluated by comparing some first natural frequencies, modal damping ratio, critical speeds, and response of both the full system and the reduced system. The simulation shows that the substructuring is proven adequate to reduce finite element rotor model in the frequency range of interest as long as the number and the location of master nodes are determined appropriately. However, the reduction is less accurate in an unstable or nearly-unstable system.
Abstract: The significance of environmental protection is wellknown in today's world. The execution of any program depends on sufficient knowledge and required familiarity with environment and its pollutants. Taking advantage of a systematic method, as a new science, in environmental planning can solve many problems. In this article, air pollution in Tehran and its relationship with health and population growth have been analyzed using dynamic systems. Firstly, by using casual loops, the relationship between the parameters effective on air pollution in Tehran were taken into consideration, then these casual loops were turned into flow diagrams [6], and finally, they were simulated using the software Vensim [16]in order to conclude what the effect of each parameter will be on air pollution in Tehran in the next 10 years, how changing of one or more parameters influences other parameters, and which parameter among all other parameters requires to be controlled more.
Abstract: The optimal control is one of the possible controllers
for a dynamic system, having a linear quadratic regulator and using
the Pontryagin-s principle or the dynamic programming method .
Stochastic disturbances may affect the coefficients (multiplicative
disturbances) or the equations (additive disturbances), provided that
the shocks are not too great . Nevertheless, this approach encounters
difficulties when uncertainties are very important or when the probability
calculus is of no help with very imprecise data. The fuzzy
logic contributes to a pragmatic solution of such a problem since it
operates on fuzzy numbers. A fuzzy controller acts as an artificial
decision maker that operates in a closed-loop system in real time.
This contribution seeks to explore the tracking problem and control
of dynamic macroeconomic models using a fuzzy learning algorithm.
A two inputs - single output (TISO) fuzzy model is applied to the
linear fluctuation model of Phillips and to the nonlinear growth model
of Goodwin.
Abstract: Economic models are complex dynamic systems with a lot of uncertainties and fuzzy data. Conventional modeling approaches using well known methods and techniques cannot provide realistic and satisfactory answers to today-s challenging economic problems. Qualitative modeling using fuzzy logic and intelligent system theories can be used to model macroeconomic models. Fuzzy Cognitive maps (FCM) is a new method been used to model the dynamic behavior of complex systems. For the first time FCMs and the Mamdani Model of Intelligent control is used to model macroeconomic models. This new model is referred as the Mamdani Rule-Based Fuzzy Cognitive Map (MBFCM) and provides the academic and research community with a new promising integrated advanced computational model. A new economic model is developed for a qualitative approach to Macroeconomic modeling. Fuzzy Controllers for such models are designed. Simulation results for an economic scenario are provided and extensively discussed
Abstract: Modeling of complex dynamic systems, which are
very complicated to establish mathematical models, requires new and
modern methodologies that will exploit the existing expert
knowledge, human experience and historical data. Fuzzy cognitive
maps are very suitable, simple, and powerful tools for simulation and
analysis of these kinds of dynamic systems. However, human experts
are subjective and can handle only relatively simple fuzzy cognitive
maps; therefore, there is a need of developing new approaches for an
automated generation of fuzzy cognitive maps using historical data.
In this study, a new learning algorithm, which is called Big Bang-Big
Crunch, is proposed for the first time in literature for an automated
generation of fuzzy cognitive maps from data. Two real-world
examples; namely a process control system and radiation therapy
process, and one synthetic model are used to emphasize the
effectiveness and usefulness of the proposed methodology.
Abstract: The authors present an algorithm for order reduction of linear time invariant dynamic systems using the combined advantages of the eigen spectrum analysis and the error minimization by particle swarm optimization technique. Pole centroid and system stiffness of both original and reduced order systems remain same in this method to determine the poles, whereas zeros are synthesized by minimizing the integral square error in between the transient responses of original and reduced order models using particle swarm optimization technique, pertaining to a unit step input. It is shown that the algorithm has several advantages, e.g. the reduced order models retain the steady-state value and stability of the original system. The algorithm is illustrated with the help of two numerical examples and the results are compared with the other existing techniques.
Abstract: There are three possible effects of Special Theory of
Relativity (STR) on a thermodynamic system. Planck and Einstein
looked upon this process as isobaric; on the other hand Ott saw it as
an adiabatic process. However plenty of logical reasons show that the
process is isotherm. Our phenomenological consideration
demonstrates that the temperature is invariant with Lorenz
transformation. In that case process is isotherm, so volume and
pressure are Lorentz covariant. If the process is isotherm the Boyles
law is Lorentz invariant. Also equilibrium constant and Gibbs energy,
activation energy, enthalpy entropy and extent of the reaction became
Lorentz invariant.
Abstract: Modeling and simulation of biochemical reactions is of great interest in the context of system biology. The central dogma of this re-emerging area states that it is system dynamics and organizing principles of complex biological phenomena that give rise to functioning and function of cells. Cell functions, such as growth, division, differentiation and apoptosis are temporal processes, that can be understood if they are treated as dynamic systems. System biology focuses on an understanding of functional activity from a system-wide perspective and, consequently, it is defined by two hey questions: (i) how do the components within a cell interact, so as to bring about its structure and functioning? (ii) How do cells interact, so as to develop and maintain higher levels of organization and functions? In recent years, wet-lab biologists embraced mathematical modeling and simulation as two essential means toward answering the above questions. The credo of dynamics system theory is that the behavior of a biological system is given by the temporal evolution of its state. Our understanding of the time behavior of a biological system can be measured by the extent to which a simulation mimics the real behavior of that system. Deviations of a simulation indicate either limitations or errors in our knowledge. The aim of this paper is to summarize and review the main conceptual frameworks in which models of biochemical networks can be developed. In particular, we review the stochastic molecular modelling approaches, by reporting the principal conceptualizations suggested by A. A. Markov, P. Langevin, A. Fokker, M. Planck, D. T. Gillespie, N. G. van Kampfen, and recently by D. Wilkinson, O. Wolkenhauer, P. S. Jöberg and by the author.
Abstract: The concept of order reduction by least-squares moment matching and generalised least-squares methods has been extended about a general point ?a?, to obtain the reduced order models for linear, time-invariant dynamic systems. Some heuristic criteria have been employed for selecting the linear shift point ?a?, based upon the means (arithmetic, harmonic and geometric) of real parts of the poles of high order system. It is shown that the resultant model depends critically on the choice of linear shift point ?a?. The validity of the criteria is illustrated by solving a numerical example and the results are compared with the other existing techniques.
Abstract: Both the minimum energy consumption and
smoothness, which is quantified as a function of jerk, are generally
needed in many dynamic systems such as the automobile and the
pick-and-place robot manipulator that handles fragile equipments.
Nevertheless, many researchers come up with either solely
concerning on the minimum energy consumption or minimum jerk
trajectory. This research paper proposes a simple yet very interesting
relationship between the minimum direct and indirect jerks
approaches in designing the time-dependent system yielding an
alternative optimal solution. Extremal solutions for the cost functions
of direct and indirect jerks are found using the dynamic optimization
methods together with the numerical approximation. This is to allow
us to simulate and compare visually and statistically the time history
of control inputs employed by minimum direct and indirect jerk
designs. By considering minimum indirect jerk problem, the
numerical solution becomes much easier and yields to the similar
results as minimum direct jerk problem.
Abstract: In most cases, it is considerably difficult to directly measure structural vibration with a lot of sensors because of complex
geometry, time and equipment cost. For this reason, this paper deals
with the problem of locating sensors on a plate model by four advanced sensor placement optimization (S.P.O) techniques. It also
suggests the evaluation index representing the characteristic of orthogonal between each of natural modes. The index value provides the assistance to selecting of proper S.P.O technique and optimal
positions for monitoring of dynamic systems without the experiment.
Abstract: Both the minimum energy consumption and
smoothness, which is quantified as a function of jerk, are generally
needed in many dynamic systems such as the automobile and the
pick-and-place robot manipulator that handles fragile equipments.
Nevertheless, many researchers come up with either solely
concerning on the minimum energy consumption or minimum jerk
trajectory. This research paper considers the indirect minimum Jerk
method for higher order differential equation in dynamics
optimization proposes a simple yet very interesting indirect jerks
approaches in designing the time-dependent system yielding an
alternative optimal solution. Extremal solutions for the cost functions
of indirect jerks are found using the dynamic optimization methods
together with the numerical approximation. This case considers the
linear equation of a simple system, for instance, mass, spring and
damping. The simple system uses two mass connected together by
springs. The boundary initial is defined the fix end time and end
point. The higher differential order is solved by Galerkin-s methods
weight residual. As the result, the 6th higher differential order shows
the faster solving time.
Abstract: This paper presents an indirect adaptive stabilization
scheme for first-order continuous-time systems under saturated input
which is described by a sigmoidal function. The singularities are
avoided through a modification scheme for the estimated plant
parameter vector so that its associated Sylvester matrix is guaranteed
to be non-singular and then the estimated plant model is controllable.
The modification mechanism involves the use of a hysteresis
switching function. An alternative hybrid scheme, whose estimated
parameters are updated at sampling instants is also given to solve a
similar adaptive stabilization problem. Such a scheme also uses
hysteresis switching for modification of the parameter estimates so as
to ensure the controllability of the estimated plant model.
Abstract: In the context of channel coding, the Generalized Belief Propagation (GBP) is an iterative algorithm used to recover the transmission bits sent through a noisy channel. To ensure a reliable transmission, we apply a map on the bits, that is called a code. This code induces artificial correlations between the bits to send, and it can be modeled by a graph whose nodes are the bits and the edges are the correlations. This graph, called Tanner graph, is used for most of the decoding algorithms like Belief Propagation or Gallager-B. The GBP is based on a non unic transformation of the Tanner graph into a so called region-graph. A clear advantage of the GBP over the other algorithms is the freedom in the construction of this graph. In this article, we explain a particular construction for specific graph topologies that involves relevant performance of the GBP. Moreover, we investigate the behavior of the GBP considered as a dynamic system in order to understand the way it evolves in terms of the time and in terms of the noise power of the channel. To this end we make use of classical measures and we introduce a new measure called the hyperspheres method that enables to know the size of the attractors.
Abstract: The authors present an optimization algorithm for order reduction and its application for the determination of the relative mapping errors of linear time invariant dynamic systems by the simplified models. These relative mapping errors are expressed by means of the relative integral square error criterion, which are determined for both unit step and impulse inputs. The reduction algorithm is based on minimization of the integral square error by particle swarm optimization technique pertaining to a unit step input. The algorithm is simple and computer oriented. It is shown that the algorithm has several advantages, e.g. the reduced order models retain the steady-state value and stability of the original system. Two numerical examples are solved to illustrate the superiority of the algorithm over some existing methods.
Abstract: This article describes a Web pages automatic filtering system. It is an open and dynamic system based on multi agents architecture. This system is built up by a set of agents having each a quite precise filtering task of to carry out (filtering process broken up into several elementary treatments working each one a partial solution). New criteria can be added to the system without stopping its execution or modifying its environment. We want to show applicability and adaptability of the multi-agents approach to the networks information automatic filtering. In practice, most of existing filtering systems are based on modular conception approaches which are limited to centralized applications which role is to resolve static data flow problems. Web pages filtering systems are characterized by a data flow which varies dynamically.