Exterior difference systems and invariance properties of discrete mechanics

International Nuclear Information System (INIS)

Xie Zheng; Xie Duanqiang; Li Hongbo

2008-01-01

Invariance properties describe the fundamental physical laws in discrete mechanics. Can those properties be described in a geometric way? We investigate an exterior difference system called the discrete Euler-Lagrange system, whose solution has one-to-one correspondence with solutions of discrete Euler-Lagrange equations, and use it to define the first integrals. The preservation of the discrete symplectic form along the discrete Hamilton phase flows and the discrete Noether's theorem is also described in the language of difference forms

A Baecklund transformation between two integrable discrete hungry systems

International Nuclear Information System (INIS)

Fukuda, Akiko; Yamamoto, Yusaku; Iwasaki, Masashi; Ishiwata, Emiko; Nakamura, Yoshimasa

2011-01-01

The discrete hungry Toda (dhToda) equation and the discrete hungry Lotka-Volterra (dhLV) system are known as integrable discrete hungry systems. In this Letter, through finding the LR transformations associated with the dhToda equation and the dhLV system, we present a Baecklund transformation between these integrable systems.

A Baecklund transformation between two integrable discrete hungry systems

Energy Technology Data Exchange (ETDEWEB)

Fukuda, Akiko, E-mail: j1409704@ed.kagu.tus.ac.j [Department of Mathematical Information Science, Graduate School of Science, Tokyo University of Science, 1-3 Kagurazaka, Shinjuku-ku, Tokyo 162-8601 (Japan); Yamamoto, Yusaku [Graduate School of System Informatics, Kobe University, 1-1 Rokkodai-cho, Nada-ku, Kobe 657-8501 (Japan); Iwasaki, Masashi [Department of Informatics and Environmental Science, Kyoto Prefectural University, 1-5, Nakaragi-cho, Shimogamo, Sakyo-ku, Kyoto 606-8522 (Japan); Ishiwata, Emiko [Department of Mathematical Information Science, Tokyo University of Science, 1-3 Kagurazaka, Shinjuku-ku, Tokyo 162-8601 (Japan); Nakamura, Yoshimasa [Graduate School of Informatics, Kyoto University, Yoshida-Honmachi, Sakyo-ku, Kyoto 606-8501 (Japan)

2011-01-17

The discrete hungry Toda (dhToda) equation and the discrete hungry Lotka-Volterra (dhLV) system are known as integrable discrete hungry systems. In this Letter, through finding the LR transformations associated with the dhToda equation and the dhLV system, we present a Baecklund transformation between these integrable systems.

Generalized Detectability for Discrete Event Systems

Science.gov (United States)

Shu, Shaolong; Lin, Feng

2011-01-01

In our previous work, we investigated detectability of discrete event systems, which is defined as the ability to determine the current and subsequent states of a system based on observation. For different applications, we defined four types of detectabilities: (weak) detectability, strong detectability, (weak) periodic detectability, and strong periodic detectability. In this paper, we extend our results in three aspects. (1) We extend detectability from deterministic systems to nondeterministic systems. Such a generalization is necessary because there are many systems that need to be modeled as nondeterministic discrete event systems. (2) We develop polynomial algorithms to check strong detectability. The previous algorithms are based on observer whose construction is of exponential complexity, while the new algorithms are based on a new automaton called detector. (3) We extend detectability to D-detectability. While detectability requires determining the exact state of a system, D-detectability relaxes this requirement by asking only to distinguish certain pairs of states. With these extensions, the theory on detectability of discrete event systems becomes more applicable in solving many practical problems. PMID:21691432

Hopf Bifurcation Analysis for a Stochastic Discrete-Time Hyperchaotic System

Directory of Open Access Journals (Sweden)

Jie Ran

2015-01-01

Full Text Available The dynamics of a discrete-time hyperchaotic system and the amplitude control of Hopf bifurcation for a stochastic discrete-time hyperchaotic system are investigated in this paper. Numerical simulations are presented to exhibit the complex dynamical behaviors in the discrete-time hyperchaotic system. Furthermore, the stochastic discrete-time hyperchaotic system with random parameters is transformed into its equivalent deterministic system with the orthogonal polynomial theory of discrete random function. In addition, the dynamical features of the discrete-time hyperchaotic system with random disturbances are obtained through its equivalent deterministic system. By using the Hopf bifurcation conditions of the deterministic discrete-time system, the specific conditions for the existence of Hopf bifurcation in the equivalent deterministic system are derived. And the amplitude control with random intensity is discussed in detail. Finally, the feasibility of the control method is demonstrated by numerical simulations.

Darboux and binary Darboux transformations for discrete integrable systems I. Discrete potential KdV equation

International Nuclear Information System (INIS)

Shi, Ying; Zhang, Da-jun; Nimmo, Jonathan J C

2014-01-01

The Hirota–Miwa equation can be written in ‘nonlinear’ form in two ways: the discrete KP equation and, by using a compatible continuous variable, the discrete potential KP equation. For both systems, we consider the Darboux and binary Darboux transformations, expressed in terms of the continuous variable, and obtain exact solutions in Wronskian and Grammian form. We discuss reductions of both systems to the discrete KdV and discrete potential KdV equation, respectively, and exploit this connection to find the Darboux and binary Darboux transformations and exact solutions of these equations. (paper)

Discrete-time inverse optimal control for nonlinear systems

CERN Document Server

Sanchez, Edgar N

2013-01-01

Discrete-Time Inverse Optimal Control for Nonlinear Systems proposes a novel inverse optimal control scheme for stabilization and trajectory tracking of discrete-time nonlinear systems. This avoids the need to solve the associated Hamilton-Jacobi-Bellman equation and minimizes a cost functional, resulting in a more efficient controller. Design More Efficient Controllers for Stabilization and Trajectory Tracking of Discrete-Time Nonlinear Systems The book presents two approaches for controller synthesis: the first based on passivity theory and the second on a control Lyapunov function (CLF). Th

Geometric phases in discrete dynamical systems

Energy Technology Data Exchange (ETDEWEB)

Cartwright, Julyan H.E., E-mail: julyan.cartwright@csic.es [Instituto Andaluz de Ciencias de la Tierra, CSIC–Universidad de Granada, E-18100 Armilla, Granada (Spain); Instituto Carlos I de Física Teórica y Computacional, Universidad de Granada, E-18071 Granada (Spain); Piro, Nicolas, E-mail: nicolas.piro@epfl.ch [École Polytechnique Fédérale de Lausanne (EPFL), 1015 Lausanne (Switzerland); Piro, Oreste, E-mail: piro@imedea.uib-csic.es [Departamento de Física, Universitat de les Illes Balears, E-07122 Palma de Mallorca (Spain); Tuval, Idan, E-mail: ituval@imedea.uib-csic.es [Mediterranean Institute for Advanced Studies, CSIC–Universitat de les Illes Balears, E-07190 Mallorca (Spain)

2016-10-14

In order to study the behaviour of discrete dynamical systems under adiabatic cyclic variations of their parameters, we consider discrete versions of adiabatically-rotated rotators. Parallelling the studies in continuous systems, we generalize the concept of geometric phase to discrete dynamics and investigate its presence in these rotators. For the rotated sine circle map, we demonstrate an analytical relationship between the geometric phase and the rotation number of the system. For the discrete version of the rotated rotator considered by Berry, the rotated standard map, we further explore this connection as well as the role of the geometric phase at the onset of chaos. Further into the chaotic regime, we show that the geometric phase is also related to the diffusive behaviour of the dynamical variables and the Lyapunov exponent. - Highlights: • We extend the concept of geometric phase to maps. • For the rotated sine circle map, we demonstrate an analytical relationship between the geometric phase and the rotation number. • For the rotated standard map, we explore the role of the geometric phase at the onset of chaos. • We show that the geometric phase is related to the diffusive behaviour of the dynamical variables and the Lyapunov exponent.

Analysis hierarchical model for discrete event systems

Science.gov (United States)

Ciortea, E. M.

2015-11-01

The This paper presents the hierarchical model based on discrete event network for robotic systems. Based on the hierarchical approach, Petri network is analysed as a network of the highest conceptual level and the lowest level of local control. For modelling and control of complex robotic systems using extended Petri nets. Such a system is structured, controlled and analysed in this paper by using Visual Object Net ++ package that is relatively simple and easy to use, and the results are shown as representations easy to interpret. The hierarchical structure of the robotic system is implemented on computers analysed using specialized programs. Implementation of hierarchical model discrete event systems, as a real-time operating system on a computer network connected via a serial bus is possible, where each computer is dedicated to local and Petri model of a subsystem global robotic system. Since Petri models are simplified to apply general computers, analysis, modelling, complex manufacturing systems control can be achieved using Petri nets. Discrete event systems is a pragmatic tool for modelling industrial systems. For system modelling using Petri nets because we have our system where discrete event. To highlight the auxiliary time Petri model using transport stream divided into hierarchical levels and sections are analysed successively. Proposed robotic system simulation using timed Petri, offers the opportunity to view the robotic time. Application of goods or robotic and transmission times obtained by measuring spot is obtained graphics showing the average time for transport activity, using the parameters sets of finished products. individually.

Stabilization of discrete-time LTI positive systems

Directory of Open Access Journals (Sweden)

Krokavec Dušan

2017-12-01

Full Text Available The paper mitigates the existing conditions reported in the previous literature for control design of discrete-time linear positive systems. Incorporating an associated structure of linear matrix inequalities, combined with the Lyapunov inequality guaranteing asymptotic stability of discrete-time positive system structures, new conditions are presented with which the state-feedback controllers and the system state observers can be designed. Associated solutions of the proposed design conditions are illustrated by numerical illustrative examples.

Variational discretization of the nonequilibrium thermodynamics of simple systems

Science.gov (United States)

Gay-Balmaz, François; Yoshimura, Hiroaki

2018-04-01

In this paper, we develop variational integrators for the nonequilibrium thermodynamics of simple closed systems. These integrators are obtained by a discretization of the Lagrangian variational formulation of nonequilibrium thermodynamics developed in (Gay-Balmaz and Yoshimura 2017a J. Geom. Phys. part I 111 169–93 Gay-Balmaz and Yoshimura 2017b J. Geom. Phys. part II 111 194–212) and thus extend the variational integrators of Lagrangian mechanics, to include irreversible processes. In the continuous setting, we derive the structure preserving property of the flow of such systems. This property is an extension of the symplectic property of the flow of the Euler–Lagrange equations. In the discrete setting, we show that the discrete flow solution of our numerical scheme verifies a discrete version of this property. We also present the regularity conditions which ensure the existence of the discrete flow. We finally illustrate our discrete variational schemes with the implementation of an example of a simple and closed system.

Chaos of discrete dynamical systems in complete metric spaces

International Nuclear Information System (INIS)

Shi Yuming; Chen Guanrong

2004-01-01

This paper is concerned with chaos of discrete dynamical systems in complete metric spaces. Discrete dynamical systems governed by continuous maps in general complete metric spaces are first discussed, and two criteria of chaos are then established. As a special case, two corresponding criteria of chaos for discrete dynamical systems in compact subsets of metric spaces are obtained. These results have extended and improved the existing relevant results of chaos in finite-dimensional Euclidean spaces

Discrete-time control system design with applications

CERN Document Server

Rabbath, C A

2014-01-01

This book presents practical techniques of discrete-time control system design. In general, the design techniques lead to low-order dynamic compensators that ensure satisfactory closed-loop performance for a wide range of sampling rates. The theory is given in the form of theorems, lemmas, and propositions. The design of the control systems is presented as step-by-step procedures and algorithms. The proposed feedback control schemes are applied to well-known dynamic system models. This book also discusses: Closed-loop performance of generic models of mobile robot and airborne pursuer dynamic systems under discrete-time feedback control with limited computing capabilities Concepts of discrete-time models and sampled-data models of continuous-time systems, for both single- and dual-rate operation Local versus global digital redesign Optimal, closed-loop digital redesign methods Plant input mapping design Generalized holds and samplers for use in feedback control loops, Numerical simulation of fixed-point arithm...

Duality for discrete integrable systems

International Nuclear Information System (INIS)

Quispel, G R W; Capel, H W; Roberts, J A G

2005-01-01

A new class of discrete dynamical systems is introduced via a duality relation for discrete dynamical systems with a number of explicitly known integrals. The dual equation can be defined via the difference of an arbitrary linear combination of integrals and its upshifted version. We give an example of an integrable mapping with two parameters and four integrals leading to a (four-dimensional) dual mapping with four parameters and two integrals. We also consider a more general class of higher-dimensional mappings arising via a travelling-wave reduction from the (integrable) MKdV partial-difference equation. By differencing the trace of the monodromy matrix we obtain a class of novel dual mappings which is shown to be integrable as level-set-dependent versions of the original ones

Control of Discrete-Event Systems Automata and Petri Net Perspectives

CERN Document Server

Silva, Manuel; Schuppen, Jan

2013-01-01

Control of Discrete-event Systems provides a survey of the most important topics in the discrete-event systems theory with particular focus on finite-state automata, Petri nets and max-plus algebra. Coverage ranges from introductory material on the basic notions and definitions of discrete-event systems to more recent results. Special attention is given to results on supervisory control, state estimation and fault diagnosis of both centralized and distributed/decentralized systems developed in the framework of the Distributed Supervisory Control of Large Plants (DISC) project. Later parts of the text are devoted to the study of congested systems though fluidization, an over approximation allowing a much more efficient study of observation and control problems of timed Petri nets. Finally, the max-plus algebraic approach to the analysis and control of choice-free systems is also considered. Control of Discrete-event Systems provides an introduction to discrete-event systems for readers that are not familiar wi...

An extended discrete gradient formula for oscillatory Hamiltonian systems

International Nuclear Information System (INIS)

Liu Kai; Shi Wei; Wu Xinyuan

2013-01-01

In this paper, incorporating the idea of the discrete gradient method into the extended Runge–Kutta–Nyström integrator, we derive and analyze an extended discrete gradient formula for the oscillatory Hamiltonian system with the Hamiltonian H(p,q)= 1/2 p T p+ 1/2 q T Mq+U(q), where q:R→R d represents generalized positions, p:R→R d represents generalized momenta and M is an element of R dxd is a symmetric and positive semi-definite matrix. The solution of this system is a nonlinear oscillator. Basically, many nonlinear oscillatory mechanical systems with a partitioned Hamiltonian function lend themselves to this approach. The extended discrete gradient formula presented in this paper exactly preserves the energy H(p, q). We derive some properties of the new formula. The convergence is analyzed for the implicit schemes based on the discrete gradient formula, and it turns out that the convergence of the implicit schemes based on the extended discrete gradient formula is independent of ‖M‖, which is a significant property for the oscillatory Hamiltonian system. Thus, it transpires that a larger step size can be chosen for the new energy-preserving schemes than that for the traditional discrete gradient methods when applied to the oscillatory Hamiltonian system. Illustrative examples show the competence and efficiency of the new schemes in comparison with the traditional discrete gradient methods in the scientific literature. (paper)

Modeling and simulation of discrete event systems

CERN Document Server

Choi, Byoung Kyu

2013-01-01

Computer modeling and simulation (M&S) allows engineers to study and analyze complex systems. Discrete-event system (DES)-M&S is used in modern management, industrial engineering, computer science, and the military. As computer speeds and memory capacity increase, so DES-M&S tools become more powerful and more widely used in solving real-life problems. Based on over 20 years of evolution within a classroom environment, as well as on decades-long experience in developing simulation-based solutions for high-tech industries, Modeling and Simulation of Discrete-Event Systems is the only book on

A Family of Integrable Rational Semi-Discrete Systems and Its Reduction

International Nuclear Information System (INIS)

Xu Xixiang

2010-01-01

Within framework of zero curvature representation theory, a family of integrahle rational semi-discrete systems is derived from a matrix spectral problem. The Hamiltonian forms of obtained semi-discrete systems are constructed by means of the discrete trace identity. The Liouville integrability for the obtained family is demonstrated. In the end, a reduced family of obtained semi-discrete systems and its Hamiltonian form are worked out. (general)

Nonlinear integrodifferential equations as discrete systems

Science.gov (United States)

Tamizhmani, K. M.; Satsuma, J.; Grammaticos, B.; Ramani, A.

1999-06-01

We analyse a class of integrodifferential equations of the `intermediate long wave' (ILW) type. We show that these equations can be formally interpreted as discrete, differential-difference systems. This allows us to link equations of this type with previous results of ours involving differential-delay equations and, on the basis of this, propose new integrable equations of ILW type. Finally, we extend this approach to pure difference equations and propose ILW forms for the discrete lattice KdV equation.

How to discretize differential systems in a systematic way

International Nuclear Information System (INIS)

Murata, M; Satsuma, J; Ramani, A; Grammaticos, B

2010-01-01

We present a systematic approach to the construction of discrete analogues for differential systems. Our method is tailored to first-order differential equations and relies on a formal linearization, followed by a Pade-like rational approximation of an exponential evolution operator. We apply our method to a host of systems for which there exist discretization results obtained by what we call the 'intuitive' method and compare the discretizations obtained. A discussion of our method as compared to one of the Mickens is also presented. Finally we apply our method to a system of coupled Riccati equations with emphasis on the preservation of the integrable character of the differential system.

Attractors for discrete periodic dynamical systems

Science.gov (United States)

John E. Franke; James F. Selgrade

2003-01-01

A mathematical framework is introduced to study attractors of discrete, nonautonomous dynamical systems which depend periodically on time. A structure theorem for such attractors is established which says that the attractor of a time-periodic dynamical system is the unin of attractors of appropriate autonomous maps. If the nonautonomous system is a perturbation of an...

Reducing pressure oscillations in discrete fluid power systems

DEFF Research Database (Denmark)

Hansen, Anders Hedegaard; Pedersen, Henrik Clemmensen

2016-01-01

Discrete fluid power systems featuring transmission lines inherently include pressure oscillations. Experimental verification of a discrete fluid power power take off system for wave energy converters has shown the cylinder pressure to oscillate as force shifts are performed. This article investi...... investigates how cylinder pressure oscillations may be reduced by shaping the valve opening trajectory without the need for closed loop pressure feedback. Furthermore the energy costs of reducing pressure oscillations are investigated....

Globally asymptotically stable analysis in a discrete time eco-epidemiological system

International Nuclear Information System (INIS)

Hu, Zengyun; Teng, Zhidong; Zhang, Tailei; Zhou, Qiming; Chen, Xi

2017-01-01

Highlights: • Dynamical behaviors of a discrete time eco-epidemiological system are discussed. • Global asymptotical stability of this system is obtained by an iteration scheme which can be expended to general dimensional discrete system. • More complex dynamical behaviors are obtained by numerical simulations. - Abstract: In this study, the dynamical behaviors of a discrete time eco-epidemiological system are discussed. The local stability, bifurcation and chaos are obtained. Moreover, the global asymptotical stability of this system is explored by an iteration scheme. The numerical simulations illustrate the theoretical results and exhibit the complex dynamical behaviors such as flip bifurcation, Hopf bifurcation and chaotic dynamical behaviors. Our main results provide an efficient method to analyze the global asymptotical stability for general three dimensional discrete systems.

Discrete event systems diagnosis and diagnosability

CERN Document Server

Sayed-Mouchaweh, Moamar

2014-01-01

Discrete Event Systems: Diagnosis and Diagnosability addresses the problem of fault diagnosis of Discrete Event Systems (DES). This book provides the basic techniques and approaches necessary for the design of an efficient fault diagnosis system for a wide range of modern engineering applications. The different techniques and approaches are classified according to several criteria such as: modeling tools (Automata, Petri nets) that is used to construct the model; the information (qualitative based on events occurrences and/or states outputs, quantitative based on signal processing and data analysis) that is needed to analyze and achieve the diagnosis; the decision structure (centralized, decentralized) that is required to achieve the diagnosis. The goal of this classification is to select the efficient method to achieve the fault diagnosis according to the application constraints. This book focuses on the centralized and decentralized event based diagnosis approaches using formal language and automata as mode...

Modelling a reliability system governed by discrete phase-type distributions

International Nuclear Information System (INIS)

Ruiz-Castro, Juan Eloy; Perez-Ocon, Rafael; Fernandez-Villodre, Gemma

2008-01-01

We present an n-system with one online unit and the others in cold standby. There is a repairman. When the online fails it goes to repair, and instantaneously a standby unit becomes the online one. The operational and repair times follow discrete phase-type distributions. Given that any discrete distribution defined on the positive integers is a discrete phase-type distribution, the system can be considered a general one. A model with unlimited number of units is considered for approximating a system with a great number of units. We show that the process that governs the system is a quasi-birth-and-death process. For this system, performance reliability measures; the up and down periods, and the involved costs are calculated in a matrix and algorithmic form. We show that the discrete case is not a trivial case of the continuous one. The results given in this paper have been implemented computationally with Matlab

Modelling a reliability system governed by discrete phase-type distributions

Energy Technology Data Exchange (ETDEWEB)

Ruiz-Castro, Juan Eloy [Departamento de Estadistica e Investigacion Operativa, Universidad de Granada, 18071 Granada (Spain)], E-mail: jeloy@ugr.es; Perez-Ocon, Rafael [Departamento de Estadistica e Investigacion Operativa, Universidad de Granada, 18071 Granada (Spain)], E-mail: rperezo@ugr.es; Fernandez-Villodre, Gemma [Departamento de Estadistica e Investigacion Operativa, Universidad de Granada, 18071 Granada (Spain)

2008-11-15

We present an n-system with one online unit and the others in cold standby. There is a repairman. When the online fails it goes to repair, and instantaneously a standby unit becomes the online one. The operational and repair times follow discrete phase-type distributions. Given that any discrete distribution defined on the positive integers is a discrete phase-type distribution, the system can be considered a general one. A model with unlimited number of units is considered for approximating a system with a great number of units. We show that the process that governs the system is a quasi-birth-and-death process. For this system, performance reliability measures; the up and down periods, and the involved costs are calculated in a matrix and algorithmic form. We show that the discrete case is not a trivial case of the continuous one. The results given in this paper have been implemented computationally with Matlab.

Modeling of Macroeconomics by a Novel Discrete Nonlinear Fractional Dynamical System

Directory of Open Access Journals (Sweden)

Zhenhua Hu

2013-01-01

Full Text Available We propose a new nonlinear economic system with fractional derivative. According to the Jumarie’s definition of fractional derivative, we obtain a discrete fractional nonlinear economic system. Three variables, the gross domestic production, inflation, and unemployment rate, are considered by this nonlinear system. Based on the concrete macroeconomic data of USA, the coefficients of this nonlinear system are estimated by the method of least squares. The application of discrete fractional economic model with linear and nonlinear structure is shown to illustrate the efficiency of modeling the macroeconomic data with discrete fractional dynamical system. The empirical study suggests that the nonlinear discrete fractional dynamical system can describe the actual economic data accurately and predict the future behavior more reasonably than the linear dynamic system. The method proposed in this paper can be applied to investigate other macroeconomic variables of more states.

Discrete modelling of drapery systems

Science.gov (United States)

Thoeni, Klaus; Giacomini, Anna

2016-04-01

Drapery systems are an efficient and cost-effective measure in preventing and controlling rockfall hazards on rock slopes. The simplest form consists of a row of ground anchors along the top of the slope connected to a horizontal support cable from which a wire mesh is suspended down the face of the slope. Such systems are generally referred to as simple or unsecured draperies (Badger and Duffy 2012). Variations such as secured draperies, where a pattern of ground anchors is incorporated within the field of the mesh, and hybrid systems, where the upper part of an unsecured drapery is elevated to intercept rockfalls originating upslope of the installation, are becoming more and more popular. This work presents a discrete element framework for simulation of unsecured drapery systems and its variations. The numerical model is based on the classical discrete element method (DEM) and implemented into the open-source framework YADE (Šmilauer et al., 2010). The model takes all relevant interactions between block, drapery and slope into account (Thoeni et al., 2014) and was calibrated and validated based on full-scale experiments (Giacomini et al., 2012).The block is modelled as a rigid clump made of spherical particles which allows any shape to be approximated. The drapery is represented by a set of spherical particle with remote interactions. The behaviour of the remote interactions is governed by the constitutive behaviour of the wire and generally corresponds to a piecewise linear stress-strain relation (Thoeni et al., 2013). The same concept is used to model wire ropes. The rock slope is represented by rigid triangular elements where material properties (e.g., normal coefficient of restitution, friction angle) are assigned to each triangle. The capabilities of the developed model to simulate drapery systems and estimate the residual hazard involved with such systems is shown. References Badger, T.C., Duffy, J.D. (2012) Drapery systems. In: Turner, A.K., Schuster R

About several classes of bi-orthogonal polynomials and discrete integrable systems

International Nuclear Information System (INIS)

Chang, Xiang-Ke; Chen, Xiao-Min; Hu, Xing-Biao; Tam, Hon-Wah

2015-01-01

By introducing some special bi-orthogonal polynomials, we derive the so-called discrete hungry quotient-difference (dhQD) algorithm and a system related to the QD-type discrete hungry Lotka–Volterra (QD-type dhLV) system, together with their Lax pairs. These two known equations can be regarded as extensions of the QD algorithm. When this idea is applied to a higher analogue of the discrete-time Toda (HADT) equation and the quotient–quotient-difference (QQD) scheme proposed by Spicer, Nijhoff and van der Kamp, two extended systems are constructed. We call these systems the hungry forms of the higher analogue discrete-time Toda (hHADT) equation and the quotient-quotient-difference (hQQD) scheme, respectively. In addition, the corresponding Lax pairs are provided. (paper)

Local bounds preserving stabilization for continuous Galerkin discretization of hyperbolic systems

Science.gov (United States)

Mabuza, Sibusiso; Shadid, John N.; Kuzmin, Dmitri

2018-05-01

The objective of this paper is to present a local bounds preserving stabilized finite element scheme for hyperbolic systems on unstructured meshes based on continuous Galerkin (CG) discretization in space. A CG semi-discrete scheme with low order artificial dissipation that satisfies the local extremum diminishing (LED) condition for systems is used to discretize a system of conservation equations in space. The low order artificial diffusion is based on approximate Riemann solvers for hyperbolic conservation laws. In this case we consider both Rusanov and Roe artificial diffusion operators. In the Rusanov case, two designs are considered, a nodal based diffusion operator and a local projection stabilization operator. The result is a discretization that is LED and has first order convergence behavior. To achieve high resolution, limited antidiffusion is added back to the semi-discrete form where the limiter is constructed from a linearity preserving local projection stabilization operator. The procedure follows the algebraic flux correction procedure usually used in flux corrected transport algorithms. To further deal with phase errors (or terracing) common in FCT type methods, high order background dissipation is added to the antidiffusive correction. The resulting stabilized semi-discrete scheme can be discretized in time using a wide variety of time integrators. Numerical examples involving nonlinear scalar Burgers equation, and several shock hydrodynamics simulations for the Euler system are considered to demonstrate the performance of the method. For time discretization, Crank-Nicolson scheme and backward Euler scheme are utilized.

Non-Lipschitz Dynamics Approach to Discrete Event Systems

Science.gov (United States)

Zak, M.; Meyers, R.

1995-01-01

This paper presents and discusses a mathematical formalism for simulation of discrete event dynamics (DED) - a special type of 'man- made' system designed to aid specific areas of information processing. A main objective is to demonstrate that the mathematical formalism for DED can be based upon the terminal model of Newtonian dynamics which allows one to relax Lipschitz conditions at some discrete points.

Adaptive Control and Function Projective Synchronization in 2D Discrete-Time Chaotic Systems

International Nuclear Information System (INIS)

Li Yin; Chen Yong; Li Biao

2009-01-01

This study addresses the adaptive control and function projective synchronization problems between 2D Rulkov discrete-time system and Network discrete-time system. Based on backstepping design with three controllers, a systematic, concrete and automatic scheme is developed to investigate the function projective synchronization of discrete-time chaotic systems. In addition, the adaptive control function is applied to achieve the state synchronization of two discrete-time systems. Numerical results demonstrate the effectiveness of the proposed control scheme.

Applications of exterior difference systems to variations in discrete mechanics

International Nuclear Information System (INIS)

Xie Zheng; Li Hongbo

2008-01-01

In discrete mechanics, difference equations describe the fundamental physical laws and exhibit many geometric properties. Can these equations be obtained in a geometric way? Using some techniques in exterior difference systems, we investigate the discrete variational problem. As an application, we give a positive answer to the above question for the discrete Newton's, Euler-Lagrange, and Hamilton's equations

Quasicanonical structure of optimal control in constrained discrete systems

Science.gov (United States)

Sieniutycz, S.

2003-06-01

This paper considers discrete processes governed by difference rather than differential equations for the state transformation. The basic question asked is if and when Hamiltonian canonical structures are possible in optimal discrete systems. Considering constrained discrete control, general optimization algorithms are derived that constitute suitable theoretical and computational tools when evaluating extremum properties of constrained physical models. The mathematical basis of the general theory is the Bellman method of dynamic programming (DP) and its extension in the form of the so-called Carathéodory-Boltyanski (CB) stage criterion which allows a variation of the terminal state that is otherwise fixed in the Bellman's method. Two relatively unknown, powerful optimization algorithms are obtained: an unconventional discrete formalism of optimization based on a Hamiltonian for multistage systems with unconstrained intervals of holdup time, and the time interval constrained extension of the formalism. These results are general; namely, one arrives at: the discrete canonical Hamilton equations, maximum principles, and (at the continuous limit of processes with free intervals of time) the classical Hamilton-Jacobi theory along with all basic results of variational calculus. Vast spectrum of applications of the theory is briefly discussed.

Sampled Data Systems Passivity and Discrete Port-Hamiltonian Systems

NARCIS (Netherlands)

Stramigioli, Stefano; Secchi, Cristian; Schaft, Arjan J. van der; Fantuzzi, Cesare

2005-01-01

In this paper, we present a novel way to approach the interconnection of a continuous and a discrete time physical system. This is done in a way which preserves passivity of the coupled system independently of the sampling time T. This strategy can be used both in the field of telemanipulation, for

Control of discrete-event systems with modular or distributed structure

Czech Academy of Sciences Publication Activity Database

Komenda, Jan; van Schuppen, J. H.

2007-01-01

Roč. 388, č. 3 (2007), s. 199-226 ISSN 0304-3975 R&D Projects: GA AV ČR(CZ) KJB100190609 Institutional research plan: CEZ:AV0Z10190503 Keywords : supervisory control * modular discrete-event system * distributed discrete-event system Subject RIV: BA - General Mathematics Impact factor: 0.735, year: 2007

Modelling and real-time simulation of continuous-discrete systems in mechatronics

Energy Technology Data Exchange (ETDEWEB)

Lindow, H. [Rostocker, Magdeburg (Germany)

1996-12-31

This work presents a methodology for simulation and modelling of systems with continuous - discrete dynamics. It derives hybrid discrete event models from Lagrange`s equations of motion. This method combines continuous mechanical, electrical and thermodynamical submodels on one hand with discrete event models an the other hand into a hybrid discrete event model. This straight forward software development avoids numeric overhead.

ADAM: analysis of discrete models of biological systems using computer algebra.

Science.gov (United States)

Hinkelmann, Franziska; Brandon, Madison; Guang, Bonny; McNeill, Rustin; Blekherman, Grigoriy; Veliz-Cuba, Alan; Laubenbacher, Reinhard

2011-07-20

Many biological systems are modeled qualitatively with discrete models, such as probabilistic Boolean networks, logical models, Petri nets, and agent-based models, to gain a better understanding of them. The computational complexity to analyze the complete dynamics of these models grows exponentially in the number of variables, which impedes working with complex models. There exist software tools to analyze discrete models, but they either lack the algorithmic functionality to analyze complex models deterministically or they are inaccessible to many users as they require understanding the underlying algorithm and implementation, do not have a graphical user interface, or are hard to install. Efficient analysis methods that are accessible to modelers and easy to use are needed. We propose a method for efficiently identifying attractors and introduce the web-based tool Analysis of Dynamic Algebraic Models (ADAM), which provides this and other analysis methods for discrete models. ADAM converts several discrete model types automatically into polynomial dynamical systems and analyzes their dynamics using tools from computer algebra. Specifically, we propose a method to identify attractors of a discrete model that is equivalent to solving a system of polynomial equations, a long-studied problem in computer algebra. Based on extensive experimentation with both discrete models arising in systems biology and randomly generated networks, we found that the algebraic algorithms presented in this manuscript are fast for systems with the structure maintained by most biological systems, namely sparseness and robustness. For a large set of published complex discrete models, ADAM identified the attractors in less than one second. Discrete modeling techniques are a useful tool for analyzing complex biological systems and there is a need in the biological community for accessible efficient analysis tools. ADAM provides analysis methods based on mathematical algorithms as a web

Dense time discretization technique for verification of real time systems

International Nuclear Information System (INIS)

Makackas, Dalius; Miseviciene, Regina

2016-01-01

Verifying the real-time system there are two different models to control the time: discrete and dense time based models. This paper argues a novel verification technique, which calculates discrete time intervals from dense time in order to create all the system states that can be reached from the initial system state. The technique is designed for real-time systems specified by a piece-linear aggregate approach. Key words: real-time system, dense time, verification, model checking, piece-linear aggregate

Discrete Mathematics

DEFF Research Database (Denmark)

Sørensen, John Aasted

2011-01-01

The objectives of Discrete Mathematics (IDISM2) are: The introduction of the mathematics needed for analysis, design and verification of discrete systems, including the application within programming languages for computer systems. Having passed the IDISM2 course, the student will be able...... to accomplish the following: -Understand and apply formal representations in discrete mathematics. -Understand and apply formal representations in problems within discrete mathematics. -Understand methods for solving problems in discrete mathematics. -Apply methods for solving problems in discrete mathematics......; construct a finite state machine for a given application. Apply these concepts to new problems. The teaching in Discrete Mathematics is a combination of sessions with lectures and students solving problems, either manually or by using Matlab. Furthermore a selection of projects must be solved and handed...

On various integrable discretizations of a general two-component Volterra system

International Nuclear Information System (INIS)

Babalic, Corina N; Carstea, A S

2013-01-01

We present two integrable discretizations of a general differential–difference bicomponent Volterra system. The results are obtained by discretizing directly the corresponding Hirota bilinear equations in two different ways. Multisoliton solutions are presented together with a new discrete form of Lotka–Volterra equation obtained by an alternative bilinearization. (paper)

Discrete-time Calogero-Moser system and Lagrangian 1-form structure

International Nuclear Information System (INIS)

Yoo-Kong, Sikarin; Lobb, Sarah; Nijhoff, Frank

2011-01-01

We study the Lagrange formalism of the (rational) Calogero-Moser (CM) system, both in discrete time and continuous time, as a first example of a Lagrangian 1-form structure in the sense of the recent paper (Lobb and Nijhoff 2009 J. Phys. A: Math. Theor.42 454013). The discrete-time model of the CM system was established some time ago arising as a pole reduction of a semi-discrete version of the Kadomtsev-Petviashvili (KP) equation, and was shown to lead to an exactly integrable correspondence (multivalued map). In this paper, we present the full KP solution based on the commutativity of the discrete-time flows in the two discrete KP variables. The compatibility of the corresponding Lax matrices is shown to lead directly to the relevant closure relation on the level of the Lagrangians. Performing successive continuum limits on both the level of the KP equation and the level of the CM system, we establish the proper Lagrangian 1-form structure for the continuum case of the CM model. We use the example of the three-particle case to elucidate the implementation of the novel least-action principle, which was presented in Lobb and Nijhoff (2009), for the simpler case of Lagrangian 1-forms. (paper)

Hierarchical Discrete Event Supervisory Control of Aircraft Propulsion Systems

Science.gov (United States)

Yasar, Murat; Tolani, Devendra; Ray, Asok; Shah, Neerav; Litt, Jonathan S.

2004-01-01

This paper presents a hierarchical application of Discrete Event Supervisory (DES) control theory for intelligent decision and control of a twin-engine aircraft propulsion system. A dual layer hierarchical DES controller is designed to supervise and coordinate the operation of two engines of the propulsion system. The two engines are individually controlled to achieve enhanced performance and reliability, necessary for fulfilling the mission objectives. Each engine is operated under a continuously varying control system that maintains the specified performance and a local discrete-event supervisor for condition monitoring and life extending control. A global upper level DES controller is designed for load balancing and overall health management of the propulsion system.

Discretization of Stationary Solutions of Stochastic Systems Driven by Fractional Brownian Motion

International Nuclear Information System (INIS)

Garrido-Atienza, Maria J.; Kloeden, Peter E.; Neuenkirch, Andreas

2009-01-01

In this article we study the behavior of dissipative systems with additive fractional noise of any Hurst parameter. Under a one-sided dissipative Lipschitz condition on the drift the continuous stochastic system is shown to have a unique stationary solution, which pathwise attracts all other solutions. The same holds for the discretized stochastic system, if the drift-implicit Euler method is used for the discretization. Moreover, the unique stationary solution of the drift-implicit Euler scheme converges to the unique stationary solution of the original system as the stepsize of the discretization decreases

Quantization of systems with temporally varying discretization. I. Evolving Hilbert spaces

International Nuclear Information System (INIS)

Höhn, Philipp A.

2014-01-01

A temporally varying discretization often features in discrete gravitational systems and appears in lattice field theory models subject to a coarse graining or refining dynamics. To better understand such discretization changing dynamics in the quantum theory, an according formalism for constrained variational discrete systems is constructed. While this paper focuses on global evolution moves and, for simplicity, restricts to flat configuration spaces R N , a Paper II [P. A. Höhn, “Quantization of systems with temporally varying discretization. II. Local evolution moves,” J. Math. Phys., e-print http://arxiv.org/abs/arXiv:1401.7731 [gr-qc].] discusses local evolution moves. In order to link the covariant and canonical picture, the dynamics of the quantum states is generated by propagators which satisfy the canonical constraints and are constructed using the action and group averaging projectors. This projector formalism offers a systematic method for tracing and regularizing divergences in the resulting state sums. Non-trivial coarse graining evolution moves lead to non-unitary, and thus irreversible, projections of physical Hilbert spaces and Dirac observables such that these concepts become evolution move dependent on temporally varying discretizations. The formalism is illustrated in a toy model mimicking a “creation from nothing.” Subtleties arising when applying such a formalism to quantum gravity models are discussed

DEVS representation of dynamical systems - Event-based intelligent control. [Discrete Event System Specification

Science.gov (United States)

Zeigler, Bernard P.

1989-01-01

It is shown how systems can be advantageously represented as discrete-event models by using DEVS (discrete-event system specification), a set-theoretic formalism. Such DEVS models provide a basis for the design of event-based logic control. In this control paradigm, the controller expects to receive confirming sensor responses to its control commands within definite time windows determined by its DEVS model of the system under control. The event-based contral paradigm is applied in advanced robotic and intelligent automation, showing how classical process control can be readily interfaced with rule-based symbolic reasoning systems.

Influence of discretization method on the digital control system performance

Directory of Open Access Journals (Sweden)

Futás József

2003-12-01

Full Text Available The design of control system can be divided into two steps. First the process or plant have to be convert into mathematical model form, so that its behavior can be analyzed. Then an appropriate controller have to be design in order to get the desired response of the controlled system. In the continuous time domain the system is represented by differential equations. Replacing a continuous system into discrete time form is always an approximation of the continuous system. The different discretization methods give different digital controller performance. The methods presented on the paper are Step Invariant or Zero Order Hold (ZOH Method, Matched Pole-Zero Method, Backward difference Method and Bilinear transformation. The above mentioned discretization methods are used in developing PI position controller of a dc motor. The motor model was converted by the ZOH method. The performances of the different methods are compared and the results are presented.

Discrete-time sliding mode control for MR vehicle suspension system

Energy Technology Data Exchange (ETDEWEB)

Sohn, J W; Choi, S B [Smart Structures and Systems Laboratory, Department of Mechanical Engineering, Inha University, Incheon 402-751 (Korea, Republic of); Wereley, N M [Smart Structures Laboratory, Department of Aerospace Engineering, University of Maryland, College Park, MD 20742 (United States)], E-mail: seungbok@inha.ac.kr

2009-02-01

This paper presents control performance of a full-vehicle suspension system featuring magnetorheological (MR) dampers via a discrete-time sliding mode control algorithm (DSMC). A cylindrical MR damper is designed by incorporating Bingham model of the MR fluid and the field-dependent damping characteristics of the MR damper are evaluated. A full-vehicle suspension model installed with independent four MR dampers is constructed and the governing equations which include vertical, pitch and roll motion are derived. A discrete-time control model is established with considering system uncertainties and a discrete-time sliding mode controller which has inherent robustness to model uncertainty and external disturbance is formulated. Vibration control performances under bump excitation are evaluated and presented.

Discrete-time sliding mode control for MR vehicle suspension system

International Nuclear Information System (INIS)

Sohn, J W; Choi, S B; Wereley, N M

2009-01-01

This paper presents control performance of a full-vehicle suspension system featuring magnetorheological (MR) dampers via a discrete-time sliding mode control algorithm (DSMC). A cylindrical MR damper is designed by incorporating Bingham model of the MR fluid and the field-dependent damping characteristics of the MR damper are evaluated. A full-vehicle suspension model installed with independent four MR dampers is constructed and the governing equations which include vertical, pitch and roll motion are derived. A discrete-time control model is established with considering system uncertainties and a discrete-time sliding mode controller which has inherent robustness to model uncertainty and external disturbance is formulated. Vibration control performances under bump excitation are evaluated and presented.

Extinction in Two-Species Nonlinear Discrete Competitive System

Directory of Open Access Journals (Sweden)

Liqiong Pu

2016-01-01

Full Text Available We propose a nonlinear discrete system of two species with the effect of toxic substances. By constructing a suitable Lyapunov-type function, we obtain the sufficient conditions which guarantee that one of the components will be driven to extinction while the other will be globally attractive with any positive solution of a discrete equation. Two examples together with their numerical simulations illustrate the feasibility of our main results. The results not only improve but also complement some known results.

Continuous limit of discrete systems with long-range interaction

International Nuclear Information System (INIS)

Tarasov, Vasily E

2006-01-01

Discrete systems with long-range interactions are considered. Continuous medium models as continuous limit of discrete chain system are defined. Long-range interactions of chain elements that give the fractional equations for the medium model are discussed. The chain equations of motion with long-range interaction are mapped into the continuum equation with the Riesz fractional derivative. We formulate the consistent definition of continuous limit for the systems with long-range interactions. In this paper, we consider a wide class of long-range interactions that give fractional medium equations in the continuous limit. The power-law interaction is a special case of this class

GDSCalc: A Web-Based Application for Evaluating Discrete Graph Dynamical Systems.

Science.gov (United States)

Elmeligy Abdelhamid, Sherif H; Kuhlman, Chris J; Marathe, Madhav V; Mortveit, Henning S; Ravi, S S

2015-01-01

Discrete dynamical systems are used to model various realistic systems in network science, from social unrest in human populations to regulation in biological networks. A common approach is to model the agents of a system as vertices of a graph, and the pairwise interactions between agents as edges. Agents are in one of a finite set of states at each discrete time step and are assigned functions that describe how their states change based on neighborhood relations. Full characterization of state transitions of one system can give insights into fundamental behaviors of other dynamical systems. In this paper, we describe a discrete graph dynamical systems (GDSs) application called GDSCalc for computing and characterizing system dynamics. It is an open access system that is used through a web interface. We provide an overview of GDS theory. This theory is the basis of the web application; i.e., an understanding of GDS provides an understanding of the software features, while abstracting away implementation details. We present a set of illustrative examples to demonstrate its use in education and research. Finally, we compare GDSCalc with other discrete dynamical system software tools. Our perspective is that no single software tool will perform all computations that may be required by all users; tools typically have particular features that are more suitable for some tasks. We situate GDSCalc within this space of software tools.

Cryptanalysis of a discrete-time synchronous chaotic encryption system

International Nuclear Information System (INIS)

Arroyo, David; Alvarez, Gonzalo; Li Shujun; Li Chengqing; Nunez, Juana

2008-01-01

Recently a chaotic cryptosystem based on discrete-time synchronization has been proposed. Some weaknesses of that new encryption system are addressed and exploited in order to successfully cryptanalyze the system

Stabilization and tracking controller for a class of nonlinear discrete-time systems

International Nuclear Information System (INIS)

Sharma, B.B.; Kar, I.N.

2011-01-01

Highlights: → We present recursive design of stabilizing controller for nonlinear discrete-time systems. → Problem of stabilizing and tracking control of single link manipulator system is addressed. → We extend the proposed results to output tracking problems. → The proposed methodology is applied satisfactorily to discrete-time chaotic maps. - Abstract: In this paper, stabilization and tracking control problem for parametric strict feedback class of discrete time systems is addressed. Recursive design of control function based on contraction theory framework is proposed instead of traditional Lyapunov based method. Explicit structure of controller is derived for the addressed class of nonlinear discrete-time systems. Conditions for exponential stability of system states are derived in terms of controller parameters. At each stage of recursive procedure a specific structure of Jacobian matrix is ensured so as to satisfy conditions of stability. The closed loop dynamics in this case remains nonlinear in nature. The proposed algorithm establishes global stability results in quite a simple manner as it does not require formulation of error dynamics. Problem of stabilization and output tracking control in case of single link manipulator system with actuator dynamics is analyzed using the proposed strategy. The proposed results are further extended to stabilization of discrete time chaotic systems. Numerical simulations presented in the end show the effectiveness of the proposed approach.

Discrete Model Reference Adaptive Control System for Automatic Profiling Machine

Directory of Open Access Journals (Sweden)

Peng Song

2012-01-01

Full Text Available Automatic profiling machine is a movement system that has a high degree of parameter variation and high frequency of transient process, and it requires an accurate control in time. In this paper, the discrete model reference adaptive control system of automatic profiling machine is discussed. Firstly, the model of automatic profiling machine is presented according to the parameters of DC motor. Then the design of the discrete model reference adaptive control is proposed, and the control rules are proven. The results of simulation show that adaptive control system has favorable dynamic performances.

Stationary solutions and self-trapping in discrete quadratic nonlinear systems

DEFF Research Database (Denmark)

Bang, Ole; Christiansen, Peter Leth; Clausen, Carl A. Balslev

1998-01-01

We consider the simplest equations describing coupled quadratic nonlinear (chi((2))) systems, which each consists of a fundamental mode resonantly interacting with its second harmonic. Such discrete equations apply, e.g., to optics, where they can describe arrays of chi((2)) waveguides...... the nonintegrable dimer reduce to the discrete nonlinear Schrodinger (DNLS) equation with two degrees of freedom, which is integrable. We show how the stationary solutions to the two systems correspond to each other and how the self-trapped DNLS solutions gradually develop chaotic dynamics in the chi((2)) system...

Lyapunov equation for infinite-dimensional discrete bilinear systems

International Nuclear Information System (INIS)

Costa, O.L.V.; Kubrusly, C.S.

1991-03-01

Mean-square stability for discrete systems requires that uniform convergence is preserved between input and state correlation sequences. Such a convergence preserving property holds for an infinite-dimensional bilinear system if and only if the associate Lyapunov equation has a unique strictly positive solution. (author)

On Generating Discrete Integrable Systems via Lie Algebras and Commutator Equations

International Nuclear Information System (INIS)

Zhang Yu-Feng; Tam, Honwah

2016-01-01

In the paper, we introduce the Lie algebras and the commutator equations to rewrite the Tu-d scheme for generating discrete integrable systems regularly. By the approach the various loop algebras of the Lie algebra A_1 are defined so that the well-known Toda hierarchy and a novel discrete integrable system are obtained, respectively. A reduction of the later hierarchy is just right the famous Ablowitz–Ladik hierarchy. Finally, via two different enlarging Lie algebras of the Lie algebra A_1, we derive two resulting differential-difference integrable couplings of the Toda hierarchy, of course, they are all various discrete expanding integrable models of the Toda hierarchy. When the introduced spectral matrices are higher degrees, the way presented in the paper is more convenient to generate discrete integrable equations than the Tu-d scheme by using the software Maple. (paper)

Control of Discrete Event Systems

NARCIS (Netherlands)

Smedinga, Rein

1989-01-01

Systemen met discrete gebeurtenissen spelen in vele gebieden een rol. In dit proefschrift staat de volgorde van gebeurtenissen centraal en worden tijdsaspecten buiten beschouwing gelaten. In dat geval kunnen systemen met discrete gebeurtenissen goed worden gemodelleerd door gebruik te maken van

Generalized Synchronization of Time-Delayed Discrete Systems

International Nuclear Information System (INIS)

Jing Jianyi; Min Lequan

2009-01-01

This paper establishes two theorems for two time-delayed (chaotic) discrete systems to achieve time-delayed generalized synchronization (TDGS). These two theorems uncover the general forms of two TDGS systems via a prescribed transformation. As examples, we convert the Lorenz three-dimensional chaotic map to an equal time-delayed system as the driving system, and construct the TDGS driven systems according to the Theorems 1 and 2. Numerical simulations demonstrate the effectiveness of the proposed theorems. (interdisciplinary physics and related areas of science and technology)

User interface to an ICAI system that teaches discrete math

OpenAIRE

Calcote, Roy Keith.; Howard, Richard Anthony

1990-01-01

Approved for public release; distribution is unlimited. The main thrust of this thesis is the design of a usable Intelligent Computer Aided Instruction (ICAI) user interface that does not use a natural language processor and runs on a personal computer. Discrete Mathematics is the knowledge domain for this project and the Discrete Math Tutor (DMT) is the name of the tutoring system. The DMT will allow the average student to benefit from a tutoring system now and not have to wait until the ...

The discrete hungry Lotka Volterra system and a new algorithm for computing matrix eigenvalues

Science.gov (United States)

Fukuda, Akiko; Ishiwata, Emiko; Iwasaki, Masashi; Nakamura, Yoshimasa

2009-01-01

The discrete hungry Lotka-Volterra (dhLV) system is a generalization of the discrete Lotka-Volterra (dLV) system which stands for a prey-predator model in mathematical biology. In this paper, we show that (1) some invariants exist which are expressed by dhLV variables and are independent from the discrete time and (2) a dhLV variable converges to some positive constant or zero as the discrete time becomes sufficiently large. Some characteristic polynomial is then factorized with the help of the dhLV system. The asymptotic behaviour of the dhLV system enables us to design an algorithm for computing complex eigenvalues of a certain band matrix.

The discrete hungry Lotka–Volterra system and a new algorithm for computing matrix eigenvalues

International Nuclear Information System (INIS)

Fukuda, Akiko; Ishiwata, Emiko; Iwasaki, Masashi; Nakamura, Yoshimasa

2009-01-01

The discrete hungry Lotka–Volterra (dhLV) system is a generalization of the discrete Lotka–Volterra (dLV) system which stands for a prey–predator model in mathematical biology. In this paper, we show that (1) some invariants exist which are expressed by dhLV variables and are independent from the discrete time and (2) a dhLV variable converges to some positive constant or zero as the discrete time becomes sufficiently large. Some characteristic polynomial is then factorized with the help of the dhLV system. The asymptotic behaviour of the dhLV system enables us to design an algorithm for computing complex eigenvalues of a certain band matrix

On periodic orbits in discrete-time cascade systems

Directory of Open Access Journals (Sweden)

Huimin Li

2006-01-01

Full Text Available We present some results on existence, minimum period, number of periodic orbits, and stability of periodic orbits in discrete-time cascade systems. Some examples are presented to illustrate these results.

Projective Synchronization of Chaotic Discrete Dynamical Systems via Linear State Error Feedback Control

Directory of Open Access Journals (Sweden)

Baogui Xin

2015-04-01

Full Text Available A projective synchronization scheme for a kind of n-dimensional discrete dynamical system is proposed by means of a linear feedback control technique. The scheme consists of master and slave discrete dynamical systems coupled by linear state error variables. A kind of novel 3-D chaotic discrete system is constructed, to which the test for chaos is applied. By using the stability principles of an upper or lower triangular matrix, two controllers for achieving projective synchronization are designed and illustrated with the novel systems. Lastly some numerical simulations are employed to validate the effectiveness of the proposed projective synchronization scheme.

Global consensus for discrete-time competitive systems

International Nuclear Information System (INIS)

Shih, C.-W.; Tseng, J.-P.

2009-01-01

Grossberg established a remarkable convergence theorem for a class of competitive systems without knowing and using Lyapunov function for the systems. We present the parallel investigations for the discrete-time version of the Grossberg's model. Through developing an extended component-competing analysis for the coupled system, without knowing a Lyapunov function and applying the LaSalle's invariance principle, the global pattern formation or the so-called global consensus for the system can be achieved. A numerical simulation is performed to illustrate the present theory.

Adaptive control of discrete-time chaotic systems: a fuzzy control approach

International Nuclear Information System (INIS)

Feng Gang; Chen Guanrong

2005-01-01

This paper discusses adaptive control of a class of discrete-time chaotic systems from a fuzzy control approach. Using the T-S model of discrete-time chaotic systems, an adaptive control algorithm is developed based on some conventional adaptive control techniques. The resulting adaptively controlled chaotic system is shown to be globally stable, and its robustness is discussed. A simulation example of the chaotic Henon map control is finally presented, to illustrate an application and the performance of the proposed control algorithm

Direct output feedback control of discrete-time systems

International Nuclear Information System (INIS)

Lin, C.C.; Chung, L.L.; Lu, K.H.

1993-01-01

An optimal direct output feedback control algorithm is developed for discrete-time systems with the consideration of time delay in control force action. Optimal constant output feedback gains are obtained through variational process such that certain prescribed quadratic performance index is minimized. Discrete-time control forces are then calculated from the multiplication of output measurements by these pre-calculated feedback gains. According to the proposed algorithm, structural system is assured to remain stable even in the presence of time delay. The number of sensors and controllers may be very small as compared with the dimension of states. Numerical results show that direct velocity feedback control is more sensitive to time delay than state feedback but, is still quite effective in reducing the dynamic responses under earthquake excitation. (author)

Nonlinear wave propagation in discrete and continuous systems

Science.gov (United States)

Rothos, V. M.

2016-09-01

In this review we try to capture some of the recent excitement induced by a large volume of theoretical and computational studies addressing nonlinear Schrödinger models (discrete and continuous) and the localized structures that they support. We focus on some prototypical structures, namely the breather solutions and solitary waves. In particular, we investigate the bifurcation of travelling wave solution in Discrete NLS system applying dynamical systems methods. Next, we examine the combined effects of cubic and quintic terms of the long range type in the dynamics of a double well potential. The relevant bifurcations, the stability of the branches and their dynamical implications are examined both in the reduced (ODE) and in the full (PDE) setting. We also offer an outlook on interesting possibilities for future work on this theme.

Traveling waves in the discrete fast buffered bistable system.

Science.gov (United States)

Tsai, Je-Chiang; Sneyd, James

2007-11-01

We study the existence and uniqueness of traveling wave solutions of the discrete buffered bistable equation. Buffered excitable systems are used to model, among other things, the propagation of waves of increased calcium concentration, and discrete models are often used to describe the propagation of such waves across multiple cells. We derive necessary conditions for the existence of waves, and, under some restrictive technical assumptions, we derive sufficient conditions. When the wave exists it is unique and stable.

Comments on `A discrete optimal control problem for descriptor systems'

DEFF Research Database (Denmark)

Ravn, Hans

1990-01-01

In the above-mentioned work (see ibid., vol.34, p.177-81 (1989)), necessary and sufficient optimality conditions are derived for a discrete-time optimal problem, as well as other specific cases of implicit and explicit dynamic systems. The commenter corrects a mistake and demonstrates that there ......In the above-mentioned work (see ibid., vol.34, p.177-81 (1989)), necessary and sufficient optimality conditions are derived for a discrete-time optimal problem, as well as other specific cases of implicit and explicit dynamic systems. The commenter corrects a mistake and demonstrates...

State transformations and Hamiltonian structures for optimal control in discrete systems

Science.gov (United States)

Sieniutycz, S.

2006-04-01

Preserving usual definition of Hamiltonian H as the scalar product of rates and generalized momenta we investigate two basic classes of discrete optimal control processes governed by the difference rather than differential equations for the state transformation. The first class, linear in the time interval θ, secures the constancy of optimal H and satisfies a discrete Hamilton-Jacobi equation. The second class, nonlinear in θ, does not assure the constancy of optimal H and satisfies only a relationship that may be regarded as an equation of Hamilton-Jacobi type. The basic question asked is if and when Hamilton's canonical structures emerge in optimal discrete systems. For a constrained discrete control, general optimization algorithms are derived that constitute powerful theoretical and computational tools when evaluating extremum properties of constrained physical systems. The mathematical basis is Bellman's method of dynamic programming (DP) and its extension in the form of the so-called Carathéodory-Boltyanski (CB) stage optimality criterion which allows a variation of the terminal state that is otherwise fixed in Bellman's method. For systems with unconstrained intervals of the holdup time θ two powerful optimization algorithms are obtained: an unconventional discrete algorithm with a constant H and its counterpart for models nonlinear in θ. We also present the time-interval-constrained extension of the second algorithm. The results are general; namely, one arrives at: discrete canonical equations of Hamilton, maximum principles, and (at the continuous limit of processes with free intervals of time) the classical Hamilton-Jacobi theory, along with basic results of variational calculus. A vast spectrum of applications and an example are briefly discussed with particular attention paid to models nonlinear in the time interval θ.

A Review of Fuzzy Logic and Neural Network Based Intelligent Control Design for Discrete-Time Systems

Directory of Open Access Journals (Sweden)

Yiming Jiang

2016-01-01

Full Text Available Over the last few decades, the intelligent control methods such as fuzzy logic control (FLC and neural network (NN control have been successfully used in various applications. The rapid development of digital computer based control systems requires control signals to be calculated in a digital or discrete-time form. In this background, the intelligent control methods developed for discrete-time systems have drawn great attentions. This survey aims to present a summary of the state of the art of the design of FLC and NN-based intelligent control for discrete-time systems. For discrete-time FLC systems, numerous remarkable design approaches are introduced and a series of efficient methods to deal with the robustness, stability, and time delay of FLC discrete-time systems are recommended. Techniques for NN-based intelligent control for discrete-time systems, such as adaptive methods and adaptive dynamic programming approaches, are also reviewed. Overall, this paper is devoted to make a brief summary for recent progresses in FLC and NN-based intelligent control design for discrete-time systems as well as to present our thoughts and considerations of recent trends and potential research directions in this area.

Simulation of interim spent fuel storage system with discrete event model

International Nuclear Information System (INIS)

Yoon, Wan Ki; Song, Ki Chan; Lee, Jae Sol; Park, Hyun Soo

1989-01-01

This paper describes dynamic simulation of the spent fuel storage system which is described by statistical discrete event models. It visualizes flow and queue of system over time, assesses the operational performance of the system activities and establishes the system components and streams. It gives information on system organization and operation policy with reference to the design. System was tested and analyzed over a number of critical parameters to establish the optimal system. Workforce schedule and resources with long processing time dominate process. A combination of two workforce shifts a day and two cooling pits gives the optimal solution of storage system. Discrete system simulation is an useful tool to get information on optimal design and operation of the storage system. (Author)

A semi-discrete integrable multi-component coherently coupled nonlinear Schrödinger system

International Nuclear Information System (INIS)

Zhao, Hai-qiong; Yuan, Jinyun

2016-01-01

A new integrable semi-discrete version is proposed for the multi-component coherently coupled nonlinear Schrödinger equation. The integrability of the semi-discrete system is confirmed by existence of Lax pair and infinite number of conservation laws. With the aid of gauge transformations, explicit formulas for N -fold Darboux transformations are derived whereby some physically important solutions of the system are presented. Furthermore, the theory of the semi-discrete system including Lax pair, Darboux transformations, exact solutions and infinite number of conservation laws are shown for their continuous counterparts in the continuous limit. (paper)

Thermodynamic modeling, energy equipartition, and nonconservation of entropy for discrete-time dynamical systems

Directory of Open Access Journals (Sweden)

Chellaboina Vijaysekhar

2005-01-01

Full Text Available We develop thermodynamic models for discrete-time large-scale dynamical systems. Specifically, using compartmental dynamical system theory, we develop energy flow models possessing energy conservation, energy equipartition, temperature equipartition, and entropy nonconservation principles for discrete-time, large-scale dynamical systems. Furthermore, we introduce a new and dual notion to entropy; namely, ectropy, as a measure of the tendency of a dynamical system to do useful work and grow more organized, and show that conservation of energy in an isolated thermodynamic system necessarily leads to nonconservation of ectropy and entropy. In addition, using the system ectropy as a Lyapunov function candidate, we show that our discrete-time, large-scale thermodynamic energy flow model has convergent trajectories to Lyapunov stable equilibria determined by the system initial subsystem energies.

MARKOV GRAPHS OF ONE–DIMENSIONAL DYNAMICAL SYSTEMS AND THEIR DISCRETE ANALOGUES AND THEIR DISCRETE ANALOGUES

Directory of Open Access Journals (Sweden)

SERGIY KOZERENKO

2016-04-01

Full Text Available One feature of the famous Sharkovsky’s theorem is that it can be proved using digraphs of a special type (the so–called Markov graphs. The most general definition assigns a Markov graph to every continuous map from the topological graph to itself. We show that this definition is too broad, i.e. every finite digraph can be viewed as a Markov graph of some one–dimensional dynamical system on a tree. We therefore consider discrete analogues of Markov graphs for vertex maps on combinatorial trees and characterize all maps on trees whose discrete Markov graphs are of the following types: complete, complete bipartite, the disjoint union of cycles, with every arc being a loop.

Function Projective Synchronization in Discrete-Time Chaotic System with Uncertain Parameters

International Nuclear Information System (INIS)

Chen Yong; Li Xin

2009-01-01

The function projective synchronization of discrete-time chaotic systems is presented. Based on backstepping design with three controllers, a systematic, concrete and automatic scheme is developed to investigate function projective synchronization (FPS) of discrete-time chaotic systems with uncertain parameters. With the aid of symbolic-numeric computation, we use the proposed scheme to illustrate FPS between two identical 3D Henon-like maps with uncertain parameters. Numeric simulations are used to verify the effectiveness of our scheme. (general)

Discretizing LTI Descriptor (Regular Differential Input Systems with Consistent Initial Conditions

Directory of Open Access Journals (Sweden)

Athanasios D. Karageorgos

2010-01-01

Full Text Available A technique for discretizing efficiently the solution of a Linear descriptor (regular differential input system with consistent initial conditions, and Time-Invariant coefficients (LTI is introduced and fully discussed. Additionally, an upper bound for the error ‖x¯(kT−x¯k‖ that derives from the procedure of discretization is also provided. Practically speaking, we are interested in such kind of systems, since they are inherent in many physical, economical and engineering phenomena.

Discrete Mathematics

DEFF Research Database (Denmark)

Sørensen, John Aasted

2010-01-01

The introduction of the mathematics needed for analysis, design and verification of discrete systems, including applications within programming languages for computer systems. Course sessions and project work. Semester: Spring 2010 Ectent: 5 ects Class size: 18......The introduction of the mathematics needed for analysis, design and verification of discrete systems, including applications within programming languages for computer systems. Course sessions and project work. Semester: Spring 2010 Ectent: 5 ects Class size: 18...

Discrete Mathematics

DEFF Research Database (Denmark)

Sørensen, John Aasted

2010-01-01

The introduction of the mathematics needed for analysis, design and verification of discrete systems, including applications within programming languages for computer systems. Course sessions and project work. Semester: Autumn 2010 Ectent: 5 ects Class size: 15......The introduction of the mathematics needed for analysis, design and verification of discrete systems, including applications within programming languages for computer systems. Course sessions and project work. Semester: Autumn 2010 Ectent: 5 ects Class size: 15...

A representation theorem for linear discrete-space systems

Directory of Open Access Journals (Sweden)

Sandberg Irwin W.

1998-01-01

Full Text Available The cornerstone of the theory of discrete-time single-input single-output linear systems is the idea that every such system has an input–output map H that can be represented by a convolution or the familiar generalization of a convolution. This thinking involves an oversight which is corrected in this note by adding an additional term to the representation.

A Lie algebraic condition for exponential stability of discrete hybrid systems and application to hybrid synchronization.

Science.gov (United States)

Zhao, Shouwei

2011-06-01

A Lie algebraic condition for global exponential stability of linear discrete switched impulsive systems is presented in this paper. By considering a Lie algebra generated by all subsystem matrices and impulsive matrices, when not all of these matrices are Schur stable, we derive new criteria for global exponential stability of linear discrete switched impulsive systems. Moreover, simple sufficient conditions in terms of Lie algebra are established for the synchronization of nonlinear discrete systems using a hybrid switching and impulsive control. As an application, discrete chaotic system's synchronization is investigated by the proposed method.

Hybrid modelling in discrete-event control system design

NARCIS (Netherlands)

Beek, van D.A.; Rooda, J.E.; Gordijn, S.H.F.; Borne, P.

1996-01-01

Simulation-based testing of discrete-event control systems can be advantageous. There is, however, a considerable difference between languages for real-time control and simulation languages. The Chi language, presented in this paper, is suited to specification and simulation of real-time control

Adaptive Event-Triggered Control Based on Heuristic Dynamic Programming for Nonlinear Discrete-Time Systems.

Science.gov (United States)

Dong, Lu; Zhong, Xiangnan; Sun, Changyin; He, Haibo

2017-07-01

This paper presents the design of a novel adaptive event-triggered control method based on the heuristic dynamic programming (HDP) technique for nonlinear discrete-time systems with unknown system dynamics. In the proposed method, the control law is only updated when the event-triggered condition is violated. Compared with the periodic updates in the traditional adaptive dynamic programming (ADP) control, the proposed method can reduce the computation and transmission cost. An actor-critic framework is used to learn the optimal event-triggered control law and the value function. Furthermore, a model network is designed to estimate the system state vector. The main contribution of this paper is to design a new trigger threshold for discrete-time systems. A detailed Lyapunov stability analysis shows that our proposed event-triggered controller can asymptotically stabilize the discrete-time systems. Finally, we test our method on two different discrete-time systems, and the simulation results are included.

Autonomous learning by simple dynamical systems with a discrete-time formulation

Science.gov (United States)

Bilen, Agustín M.; Kaluza, Pablo

2017-05-01

We present a discrete-time formulation for the autonomous learning conjecture. The main feature of this formulation is the possibility to apply the autonomous learning scheme to systems in which the errors with respect to target functions are not well-defined for all times. This restriction for the evaluation of functionality is a typical feature in systems that need a finite time interval to process a unit piece of information. We illustrate its application on an artificial neural network with feed-forward architecture for classification and a phase oscillator system with synchronization properties. The main characteristics of the discrete-time formulation are shown by constructing these systems with predefined functions.

Applied discrete-time queues

CERN Document Server

Alfa, Attahiru S

2016-01-01

This book introduces the theoretical fundamentals for modeling queues in discrete-time, and the basic procedures for developing queuing models in discrete-time. There is a focus on applications in modern telecommunication systems. It presents how most queueing models in discrete-time can be set up as discrete-time Markov chains. Techniques such as matrix-analytic methods (MAM) that can used to analyze the resulting Markov chains are included. This book covers single node systems, tandem system and queueing networks. It shows how queues with time-varying parameters can be analyzed, and illustrates numerical issues associated with computations for the discrete-time queueing systems. Optimal control of queues is also covered. Applied Discrete-Time Queues targets researchers, advanced-level students and analysts in the field of telecommunication networks. It is suitable as a reference book and can also be used as a secondary text book in computer engineering and computer science. Examples and exercises are includ...

Stochastic ℋ∞ Finite-Time Control of Discrete-Time Systems with Packet Loss

Directory of Open Access Journals (Sweden)

Yingqi Zhang

2012-01-01

Full Text Available This paper investigates the stochastic finite-time stabilization and ℋ∞ control problem for one family of linear discrete-time systems over networks with packet loss, parametric uncertainties, and time-varying norm-bounded disturbance. Firstly, the dynamic model description studied is given, which, if the packet dropout is assumed to be a discrete-time homogenous Markov process, the class of discrete-time linear systems with packet loss can be regarded as Markovian jump systems. Based on Lyapunov function approach, sufficient conditions are established for the resulting closed-loop discrete-time system with Markovian jumps to be stochastic ℋ∞ finite-time boundedness and then state feedback controllers are designed to guarantee stochastic ℋ∞ finite-time stabilization of the class of stochastic systems. The stochastic ℋ∞ finite-time boundedness criteria can be tackled in the form of linear matrix inequalities with a fixed parameter. As an auxiliary result, we also give sufficient conditions on the robust stochastic stabilization of the class of linear systems with packet loss. Finally, simulation examples are presented to illustrate the validity of the developed scheme.

Robust performance results for discrete-time systems

Directory of Open Access Journals (Sweden)

Mahmoud Magdi S.

1997-01-01

Full Text Available The problems of robust performance and feedback control synthesis for a class of linear discrete-time systems with time-varying parametric uncertainties are addressed in this paper. The uncertainties are bound and have a linear matrix fractional form. Based on the concept of strongly robust H ∞ -performance criterion, results of robust stability and performance are developed and expressed in easily computable linear matrix inequalities. Synthesis of robust feedback controllers is carried out for several system models of interest.

The inverse problem of the calculus of variations for discrete systems

Science.gov (United States)

Barbero-Liñán, María; Farré Puiggalí, Marta; Ferraro, Sebastián; Martín de Diego, David

2018-05-01

We develop a geometric version of the inverse problem of the calculus of variations for discrete mechanics and constrained discrete mechanics. The geometric approach consists of using suitable Lagrangian and isotropic submanifolds. We also provide a transition between the discrete and the continuous problems and propose variationality as an interesting geometric property to take into account in the design and computer simulation of numerical integrators for constrained systems. For instance, nonholonomic mechanics is generally non variational but some special cases admit an alternative variational description. We apply some standard nonholonomic integrators to such an example to study which ones conserve this property.

New block matrix spectral problem and Hamiltonian structure of the discrete integrable coupling system

Energy Technology Data Exchange (ETDEWEB)

Yu Fajun [College of Maths and Systematic Science, Shenyang Normal University, Shenyang 110034 (China)], E-mail: yufajun888@163.com

2008-06-09

In [W.X. Ma, J. Phys. A: Math. Theor. 40 (2007) 15055], Prof. Ma gave a beautiful result (a discrete variational identity). In this Letter, based on a discrete block matrix spectral problem, a new hierarchy of Lax integrable lattice equations with four potentials is derived. By using of the discrete variational identity, we obtain Hamiltonian structure of the discrete soliton equation hierarchy. Finally, an integrable coupling system of the soliton equation hierarchy and its Hamiltonian structure are obtained through the discrete variational identity.

New block matrix spectral problem and Hamiltonian structure of the discrete integrable coupling system

International Nuclear Information System (INIS)

Yu Fajun

2008-01-01

In [W.X. Ma, J. Phys. A: Math. Theor. 40 (2007) 15055], Prof. Ma gave a beautiful result (a discrete variational identity). In this Letter, based on a discrete block matrix spectral problem, a new hierarchy of Lax integrable lattice equations with four potentials is derived. By using of the discrete variational identity, we obtain Hamiltonian structure of the discrete soliton equation hierarchy. Finally, an integrable coupling system of the soliton equation hierarchy and its Hamiltonian structure are obtained through the discrete variational identity

Discrete repulsive oscillator wavefunctions

International Nuclear Information System (INIS)

Munoz, Carlos A; Rueda-Paz, Juvenal; Wolf, Kurt Bernardo

2009-01-01

For the study of infinite discrete systems on phase space, the three-dimensional Lorentz algebra and group, so(2,1) and SO(2,1), provide a discrete model of the repulsive oscillator. Its eigenfunctions are found in the principal irreducible representation series, where the compact generator-that we identify with the position operator-has the infinite discrete spectrum of the integers Z, while the spectrum of energies is a double continuum. The right- and left-moving wavefunctions are given by hypergeometric functions that form a Dirac basis for l 2 (Z). Under contraction, the discrete system limits to the well-known quantum repulsive oscillator. Numerical computations of finite approximations raise further questions on the use of Dirac bases for infinite discrete systems.

A systematic method for constructing time discretizations of integrable lattice systems: local equations of motion

International Nuclear Information System (INIS)

Tsuchida, Takayuki

2010-01-01

We propose a new method for discretizing the time variable in integrable lattice systems while maintaining the locality of the equations of motion. The method is based on the zero-curvature (Lax pair) representation and the lowest-order 'conservation laws'. In contrast to the pioneering work of Ablowitz and Ladik, our method allows the auxiliary dependent variables appearing in the stage of time discretization to be expressed locally in terms of the original dependent variables. The time-discretized lattice systems have the same set of conserved quantities and the same structures of the solutions as the continuous-time lattice systems; only the time evolution of the parameters in the solutions that correspond to the angle variables is discretized. The effectiveness of our method is illustrated using examples such as the Toda lattice, the Volterra lattice, the modified Volterra lattice, the Ablowitz-Ladik lattice (an integrable semi-discrete nonlinear Schroedinger system) and the lattice Heisenberg ferromagnet model. For the modified Volterra lattice, we also present its ultradiscrete analogue.

Synchronization of discrete-time hyperchaotic systems: An application in communications

International Nuclear Information System (INIS)

Aguilar-Bustos, A.Y.; Cruz-Hernandez, C.

2009-01-01

In this paper, the synchronization problem of discrete-time complex dynamics is presented. In particular, we use the model-matching approach from nonlinear control theory to synchronize two unidirectionally coupled discrete-time hyperchaotic systems. A potential application to secure/private communication of confidential information is also given. By using different (hyperchaotic) encryption schemes with a single and two transmission channels, we show that output synchronization of hyperchaotic maps is indeed suitable for encryption, transmission, and decryption of information.

On the Complete Integrability of Nonlinear Dynamical Systems on Discrete Manifolds within the Gradient-Holonomic Approach

International Nuclear Information System (INIS)

Prykarpatsky, Yarema A.; Bogolubov, Nikolai N. Jr.; Prykarpatsky, Anatoliy K.; Samoylenko, Valeriy H.

2010-12-01

A gradient-holonomic approach for the Lax type integrability analysis of differential-discrete dynamical systems is devised. The asymptotical solutions to the related Lax equation are studied and the related gradient identity is stated. The integrability of a discrete nonlinear Schroedinger type dynamical system is treated in detail. The integrability of a generalized Riemann type discrete hydrodynamical system is discussed. (author)

Discrete-Event Simulation

Directory of Open Access Journals (Sweden)

Prateek Sharma

2015-04-01

Full Text Available Abstract Simulation can be regarded as the emulation of the behavior of a real-world system over an interval of time. The process of simulation relies upon the generation of the history of a system and then analyzing that history to predict the outcome and improve the working of real systems. Simulations can be of various kinds but the topic of interest here is one of the most important kind of simulation which is Discrete-Event Simulation which models the system as a discrete sequence of events in time. So this paper aims at introducing about Discrete-Event Simulation and analyzing how it is beneficial to the real world systems.

Constructing New Discrete Integrable Coupling System for Soliton Equation by Kronecker Product

International Nuclear Information System (INIS)

Yu Fajun; Zhang Hongqing

2008-01-01

It is shown that the Kronecker product can be applied to constructing new discrete integrable coupling system of soliton equation hierarchy in this paper. A direct application to the fractional cubic Volterra lattice spectral problem leads to a novel integrable coupling system of soliton equation hierarchy. It is also indicated that the study of discrete integrable couplings by using the Kronecker product is an efficient and straightforward method. This method can be used generally

Modular Control of Discrete-Event Systems with Coalgebra

Czech Academy of Sciences Publication Activity Database

Komenda, Jan; van Schuppen, J. H.

2008-01-01

Roč. 53, č. 2 (2008), s. 447-460 ISSN 0018-9286 R&D Projects: GA AV ČR(CZ) KJB100190609 Institutional research plan: CEZ:AV0Z10190503 Keywords : discrete-event systems * modular supervisory control * coalgebra Subject RIV: BA - General Mathematics Impact factor: 3.293, year: 2008

Image compression-encryption algorithms by combining hyper-chaotic system with discrete fractional random transform

Science.gov (United States)

Gong, Lihua; Deng, Chengzhi; Pan, Shumin; Zhou, Nanrun

2018-07-01

Based on hyper-chaotic system and discrete fractional random transform, an image compression-encryption algorithm is designed. The original image is first transformed into a spectrum by the discrete cosine transform and the resulting spectrum is compressed according to the method of spectrum cutting. The random matrix of the discrete fractional random transform is controlled by a chaotic sequence originated from the high dimensional hyper-chaotic system. Then the compressed spectrum is encrypted by the discrete fractional random transform. The order of DFrRT and the parameters of the hyper-chaotic system are the main keys of this image compression and encryption algorithm. The proposed algorithm can compress and encrypt image signal, especially can encrypt multiple images once. To achieve the compression of multiple images, the images are transformed into spectra by the discrete cosine transform, and then the spectra are incised and spliced into a composite spectrum by Zigzag scanning. Simulation results demonstrate that the proposed image compression and encryption algorithm is of high security and good compression performance.

Mei symmetry and conservation laws of discrete nonholonomic dynamical systems with regular and irregular lattices

International Nuclear Information System (INIS)

Zhao Gang-Ling; Chen Li-Qun; Fu Jing-Li; Hong Fang-Yu

2013-01-01

In this paper, Noether symmetry and Mei symmetry of discrete nonholonomic dynamical systems with regular and the irregular lattices are investigated. Firstly, the equations of motion of discrete nonholonomic systems are introduced for regular and irregular lattices. Secondly, for cases of the two lattices, based on the invariance of the Hamiltomian functional under the infinitesimal transformation of time and generalized coordinates, we present the quasi-extremal equation, the discrete analogues of Noether identity, Noether theorems, and the Noether conservation laws of the systems. Thirdly, in cases of the two lattices, we study the Mei symmetry in which we give the discrete analogues of the criterion, the theorem, and the conservative laws of Mei symmetry for the systems. Finally, an example is discussed for the application of the results

Discrete integrable systems and hodograph transformations arising from motions of discrete plane curves

International Nuclear Information System (INIS)

Feng Baofeng; Maruno, Ken-ichi; Inoguchi, Jun-ichi; Kajiwara, Kenji; Ohta, Yasuhiro

2011-01-01

We consider integrable discretizations of some soliton equations associated with the motions of plane curves: the Wadati-Konno-Ichikawa elastic beam equation, the complex Dym equation and the short pulse equation. They are related to the modified KdV or the sine-Gordon equations by the hodograph transformations. Based on the observation that the hodograph transformations are regarded as the Euler-Lagrange transformations of the curve motions, we construct the discrete analogues of the hodograph transformations, which yield integrable discretizations of those soliton equations. (paper)

Indirect adaptive control of discrete chaotic systems

International Nuclear Information System (INIS)

Salarieh, Hassan; Shahrokhi, Mohammad

2007-01-01

In this paper an indirect adaptive control algorithm is proposed to stabilize the fixed points of discrete chaotic systems. It is assumed that the functionality of the chaotic dynamics is known but the system parameters are unknown. This assumption is usually applicable to many chaotic systems, such as the Henon map, logistic and many other nonlinear maps. Using the recursive-least squares technique, the system parameters are identified and based on the feedback linearization method an adaptive controller is designed for stabilizing the fixed points, or unstable periodic orbits of the chaotic maps. The stability of the proposed scheme has been shown and the effectiveness of the control algorithm has been demonstrated through computer simulations

Advances in discrete differential geometry

CERN Document Server

2016-01-01

This is one of the first books on a newly emerging field of discrete differential geometry and an excellent way to access this exciting area. It surveys the fascinating connections between discrete models in differential geometry and complex analysis, integrable systems and applications in computer graphics. The authors take a closer look at discrete models in differential geometry and dynamical systems. Their curves are polygonal, surfaces are made from triangles and quadrilaterals, and time is discrete. Nevertheless, the difference between the corresponding smooth curves, surfaces and classical dynamical systems with continuous time can hardly be seen. This is the paradigm of structure-preserving discretizations. Current advances in this field are stimulated to a large extent by its relevance for computer graphics and mathematical physics. This book is written by specialists working together on a common research project. It is about differential geometry and dynamical systems, smooth and discrete theories, ...

System for Automatic Generation of Examination Papers in Discrete Mathematics

Science.gov (United States)

Fridenfalk, Mikael

2013-01-01

A system was developed for automatic generation of problems and solutions for examinations in a university distance course in discrete mathematics and tested in a pilot experiment involving 200 students. Considering the success of such systems in the past, particularly including automatic assessment, it should not take long before such systems are…

Stabilisation of discrete-time polynomial fuzzy systems via a polynomial lyapunov approach

Science.gov (United States)

Nasiri, Alireza; Nguang, Sing Kiong; Swain, Akshya; Almakhles, Dhafer

2018-02-01

This paper deals with the problem of designing a controller for a class of discrete-time nonlinear systems which is represented by discrete-time polynomial fuzzy model. Most of the existing control design methods for discrete-time fuzzy polynomial systems cannot guarantee their Lyapunov function to be a radially unbounded polynomial function, hence the global stability cannot be assured. The proposed control design in this paper guarantees a radially unbounded polynomial Lyapunov functions which ensures global stability. In the proposed design, state feedback structure is considered and non-convexity problem is solved by incorporating an integrator into the controller. Sufficient conditions of stability are derived in terms of polynomial matrix inequalities which are solved via SOSTOOLS in MATLAB. A numerical example is presented to illustrate the effectiveness of the proposed controller.

Thermodynamic framework for discrete optimal control in multiphase flow systems

Science.gov (United States)

Sieniutycz, Stanislaw

1999-08-01

Bellman's method of dynamic programming is used to synthesize diverse optimization approaches to active (work producing) and inactive (entropy generating) multiphase flow systems. Thermal machines, optimally controlled unit operations, nonlinear heat conduction, spontaneous relaxation processes, and self-propagating wave fronts are all shown to satisfy a discrete Hamilton-Jacobi-Bellman equation and a corresponding discrete optimization algorithm of Pontryagin's type, with the maximum principle for a Hamiltonian. The extremal structures are always canonical. A common unifying criterion is set for all considered systems, which is the criterion of a minimum generated entropy. It is shown that constraints can modify the entropy functionals in a different way for each group of the processes considered; thus the resulting structures of these functionals may differ significantly. Practical conclusions are formulated regarding the energy savings and energy policy in optimally controlled systems.

Avoidance of Pressure Oscillations in Discrete Fluid Power Systems with Transmission Lines - An Analytical Approach

DEFF Research Database (Denmark)

Hansen, Anders Hedegaard; Pedersen, Henrik C.

2014-01-01

Discrete fluid power technology attracts great attention because it enables energy efficiency and robust system architectures. However, the discrete nature of this technology naturally brings shifting phenomenons into the picture. For fluid power system the relative high inductance of fluid...

Multivariable controller for discrete stochastic amplitude-constrained systems

Directory of Open Access Journals (Sweden)

Hannu T. Toivonen

1983-04-01

Full Text Available A sub-optimal multivariable controller for discrete stochastic amplitude-constrained systems is presented. In the approach the regulator structure is restricted to the class of linear saturated feedback laws. The stationary covariances of the controlled system are evaluated by approximating the stationary probability distribution of the state by a gaussian distribution. An algorithm for minimizing a quadratic loss function is given, and examples are presented to illustrate the performance of the sub-optimal controller.

Control of the formation of projective synchronisation in lower-dimensional discrete-time systems

International Nuclear Information System (INIS)

Chee, C.Y.; Xu Daolin

2003-01-01

Projective synchronisation was recently observed in partially linear discrete-time systems. The scaling factor that characterises the behaviour of projective synchronisation is however unpredictable. In order to manipulate the ultimate state of the synchronisation, a control algorithm based on Schur-Chon stability criteria is proposed to direct the scaling factor onto any predestined value. In the numerical experiment, we illustrate the application on two chaotic discrete-time systems

Out-of-order parallel discrete event simulation for electronic system-level design

CERN Document Server

Chen, Weiwei

2014-01-01

This book offers readers a set of new approaches and tools a set of tools and techniques for facing challenges in parallelization with design of embedded systems.? It provides an advanced parallel simulation infrastructure for efficient and effective system-level model validation and development so as to build better products in less time.? Since parallel discrete event simulation (PDES) has the potential to exploit the underlying parallel computational capability in today's multi-core simulation hosts, the author begins by reviewing the parallelization of discrete event simulation, identifyin

Time Discretization Techniques

KAUST Repository

Gottlieb, S.; Ketcheson, David I.

2016-01-01

The time discretization of hyperbolic partial differential equations is typically the evolution of a system of ordinary differential equations obtained by spatial discretization of the original problem. Methods for this time evolution include

A New Approach to Rational Discrete-Time Approximations to Continuous-Time Fractional-Order Systems

OpenAIRE

Matos , Carlos; Ortigueira , Manuel ,

2012-01-01

Part 10: Signal Processing; International audience; In this paper a new approach to rational discrete-time approximations to continuous fractional-order systems of the form 1/(sα+p) is proposed. We will show that such fractional-order LTI system can be decomposed into sub-systems. One has the classic behavior and the other is similar to a Finite Impulse Response (FIR) system. The conversion from continuous-time to discrete-time systems will be done using the Laplace transform inversion integr...

Logical Discrete Event Systems in a trace theory based setting

NARCIS (Netherlands)

Smedinga, R.

1993-01-01

Discrete event systems can be modelled using a triple consisting of some alphabet (representing the events that might occur), and two trace sets (sets of possible strings) denoting the possible behaviour and the completed tasks of the system. Using this definition we are able to formulate and solve

Invariant set computation for constrained uncertain discrete-time systems

NARCIS (Netherlands)

Athanasopoulos, N.; Bitsoris, G.

2010-01-01

In this article a novel approach to the determination of polytopic invariant sets for constrained discrete-time linear uncertain systems is presented. First, the problem of stabilizing a prespecified initial condition set in the presence of input and state constraints is addressed. Second, the

Observer-based hyperchaos synchronization in cascaded discrete-time systems

International Nuclear Information System (INIS)

Grassi, Giuseppe

2009-01-01

This paper deals with the observer-based synchronization in a cascade connection of hyperchaotic discrete-time systems. The paper demonstrates that exact synchronization in finite time is achievable between pairs of drive-response systems using only a scalar synchronizing signal. This 'propagated synchronization' starts from the innermost drive-response system pair and propagates toward the outermost drive-system pair. Choosing the drive-system input to be an information signal (encrypted via an arbitrary encryption function) yields a potential application of this architecture in chaos-based communications.

The discrete adjoint method for parameter identification in multibody system dynamics.

Science.gov (United States)

Lauß, Thomas; Oberpeilsteiner, Stefan; Steiner, Wolfgang; Nachbagauer, Karin

2018-01-01

The adjoint method is an elegant approach for the computation of the gradient of a cost function to identify a set of parameters. An additional set of differential equations has to be solved to compute the adjoint variables, which are further used for the gradient computation. However, the accuracy of the numerical solution of the adjoint differential equation has a great impact on the gradient. Hence, an alternative approach is the discrete adjoint method , where the adjoint differential equations are replaced by algebraic equations. Therefore, a finite difference scheme is constructed for the adjoint system directly from the numerical time integration method. The method provides the exact gradient of the discretized cost function subjected to the discretized equations of motion.

Observation of Discrete-Time-Crystal Signatures in an Ordered Dipolar Many-Body System

Science.gov (United States)

Rovny, Jared; Blum, Robert L.; Barrett, Sean E.

2018-05-01

A discrete time crystal (DTC) is a robust phase of driven systems that breaks the discrete time translation symmetry of the driving Hamiltonian. Recent experiments have observed DTC signatures in two distinct systems. Here we show nuclear magnetic resonance observations of DTC signatures in a third, strikingly different system: an ordered spatial crystal. We use a novel DTC echo experiment to probe the coherence of the driven system. Finally, we show that interactions during the pulse of the DTC sequence contribute to the decay of the signal, complicating attempts to measure the intrinsic lifetime of the DTC.

Cryptanalyzing a discrete-time chaos synchronization secure communication system

International Nuclear Information System (INIS)

Alvarez, G.; Montoya, F.; Romera, M.; Pastor, G.

2004-01-01

This paper describes the security weakness of a recently proposed secure communication method based on discrete-time chaos synchronization. We show that the security is compromised even without precise knowledge of the chaotic system used. We also make many suggestions to improve its security in future versions

Complexity of deciding detectability in discrete event systems

Czech Academy of Sciences Publication Activity Database

Masopust, Tomáš

2018-01-01

Roč. 93, July (2018), s. 257-261 ISSN 0005-1098 Institutional support: RVO:67985840 Keywords : discrete event systems * finite automata * detectability Subject RIV: BA - General Mathematics OBOR OECD: Computer science s, information science , bioinformathics (hardware development to be 2.2, social aspect to be 5.8) Impact factor: 5.451, year: 2016 https://www. science direct.com/ science /article/pii/S0005109818301730

Complexity of deciding detectability in discrete event systems

Czech Academy of Sciences Publication Activity Database

Masopust, Tomáš

2018-01-01

Roč. 93, July (2018), s. 257-261 ISSN 0005-1098 Institutional support: RVO:67985840 Keywords : discrete event systems * finite automata * detectability Subject RIV: BA - General Mathematics OBOR OECD: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8) Impact factor: 5.451, year: 2016 https://www.sciencedirect.com/science/article/pii/S0005109818301730

Design of an Optimal Preview Controller for Linear Discrete-Time Descriptor Noncausal Multirate Systems

Directory of Open Access Journals (Sweden)

Mengjuan Cao

2014-01-01

Full Text Available The linear discrete-time descriptor noncausal multirate system is considered for the presentation of a new design approach for optimal preview control. First, according to the characteristics of causal controllability and causal observability, the descriptor noncausal system is constructed into a descriptor causal closed-loop system. Second, by using the characteristics of the causal system and elementary transformation, the descriptor causal closed-loop system is transformed into a normal system. Then, taking advantage of the discrete lifting technique, the normal multirate system is converted to a single-rate system. By making use of the standard preview control method, we construct the descriptor augmented error system. The quadratic performance index for the multirate system is given, which can be changed into one for the single-rate system. In addition, a new single-rate system is obtained, the optimal control law of which is given. Returning to the original system, the optimal preview controller for linear discrete-time descriptor noncausal multirate systems is derived. The stabilizability and detectability of the lifted single-rate system are discussed in detail. The optimal preview control design techniques are illustrated by simulation results for a simple example.

Knowledge network model of the energy consumption in discrete manufacturing system

Science.gov (United States)

Xu, Binzi; Wang, Yan; Ji, Zhicheng

2017-07-01

Discrete manufacturing system generates a large amount of data and information because of the development of information technology. Hence, a management mechanism is urgently required. In order to incorporate knowledge generated from manufacturing data and production experience, a knowledge network model of the energy consumption in the discrete manufacturing system was put forward based on knowledge network theory and multi-granularity modular ontology technology. This model could provide a standard representation for concepts, terms and their relationships, which could be understood by both human and computer. Besides, the formal description of energy consumption knowledge elements (ECKEs) in the knowledge network was also given. Finally, an application example was used to verify the feasibility of the proposed method.

Formal methods for discrete-time dynamical systems

CERN Document Server

Belta, Calin; Aydin Gol, Ebru

2017-01-01

This book bridges fundamental gaps between control theory and formal methods. Although it focuses on discrete-time linear and piecewise affine systems, it also provides general frameworks for abstraction, analysis, and control of more general models. The book is self-contained, and while some mathematical knowledge is necessary, readers are not expected to have a background in formal methods or control theory. It rigorously defines concepts from formal methods, such as transition systems, temporal logics, model checking and synthesis. It then links these to the infinite state dynamical systems through abstractions that are intuitive and only require basic convex-analysis and control-theory terminology, which is provided in the appendix. Several examples and illustrations help readers understand and visualize the concepts introduced throughout the book.

Discrete-Event Simulation

OpenAIRE

Prateek Sharma

2015-01-01

Abstract Simulation can be regarded as the emulation of the behavior of a real-world system over an interval of time. The process of simulation relies upon the generation of the history of a system and then analyzing that history to predict the outcome and improve the working of real systems. Simulations can be of various kinds but the topic of interest here is one of the most important kind of simulation which is Discrete-Event Simulation which models the system as a discrete sequence of ev...

Generalized reciprocity principle for discrete symplectic systems

Directory of Open Access Journals (Sweden)

Julia Elyseeva

2015-12-01

Full Text Available This paper studies transformations for conjoined bases of symplectic difference systems $Y_{i+1}=\\mathcal S_{i}Y_{i}$ with the symplectic coefficient matrices $\\mathcal S_i.$ For an arbitrary symplectic transformation matrix $P_{i}$ we formulate most general sufficient conditions for $\\mathcal S_{i},\\, P_{i}$ which guarantee that $P_{i}$ preserves oscillatory properties of conjoined bases $Y_{i}.$ We present examples which show that our new results extend the applicability of the discrete transformation theory.

Improving the Teaching of Discrete-Event Control Systems Using a LEGO Manufacturing Prototype

Science.gov (United States)

Sanchez, A.; Bucio, J.

2012-01-01

This paper discusses the usefulness of employing LEGO as a teaching-learning aid in a post-graduate-level first course on the control of discrete-event systems (DESs). The final assignment of the course is presented, which asks students to design and implement a modular hierarchical discrete-event supervisor for the coordination layer of a…

Finite Discrete Gabor Analysis

DEFF Research Database (Denmark)

Søndergaard, Peter Lempel

2007-01-01

frequency bands at certain times. Gabor theory can be formulated for both functions on the real line and for discrete signals of finite length. The two theories are largely the same because many aspects come from the same underlying theory of locally compact Abelian groups. The two types of Gabor systems...... can also be related by sampling and periodization. This thesis extends on this theory by showing new results for window construction. It also provides a discussion of the problems associated to discrete Gabor bases. The sampling and periodization connection is handy because it allows Gabor systems...... on the real line to be well approximated by finite and discrete Gabor frames. This method of approximation is especially attractive because efficient numerical methods exists for doing computations with finite, discrete Gabor systems. This thesis presents new algorithms for the efficient computation of finite...

Asymptotic behavior of dynamical and control systems under perturbation and discretization

CERN Document Server

Grüne, Lars

2002-01-01

This book provides an approach to the study of perturbation and discretization effects on the long-time behavior of dynamical and control systems. It analyzes the impact of time and space discretizations on asymptotically stable attracting sets, attractors, asumptotically controllable sets and their respective domains of attractions and reachable sets. Combining robust stability concepts from nonlinear control theory, techniques from optimal control and differential games and methods from nonsmooth analysis, both qualitative and quantitative results are obtained and new algorithms are developed, analyzed and illustrated by examples.

Estimation of system parameters in discrete dynamical systems from time series

International Nuclear Information System (INIS)

Palaniyandi, P.; Lakshmanan, M.

2005-01-01

We propose a simple method to estimate the parameters involved in discrete dynamical systems from time series. The method is based on the concept of controlling chaos by constant feedback. The major advantages of the method are that it needs a minimal number of time series data (either vector or scalar) and is applicable to dynamical systems of any dimension. The method also works extremely well even in the presence of noise in the time series. The method is specifically illustrated by means of logistic and Henon maps

Asymptotical Behaviors of Nonautonomous Discrete Kolmogorov System with Time Lags

Directory of Open Access Journals (Sweden)

Liu Shengqiang

2010-01-01

Full Text Available We discuss a general -species discrete Kolmogorov system with time lags. We build some new results about the sufficient conditions for permanence, extinction, and balancing survival. When applying these results to some Lotka-Volterra systems, we obtain the criteria on harmless delay for the permanence as well as profitless delay for balancing survival.

Asymptotical Behaviors of Nonautonomous Discrete Kolmogorov System with Time Lags

Directory of Open Access Journals (Sweden)

Shengqiang Liu

2010-01-01

Full Text Available We discuss a general n-species discrete Kolmogorov system with time lags. We build some new results about the sufficient conditions for permanence, extinction, and balancing survival. When applying these results to some Lotka-Volterra systems, we obtain the criteria on harmless delay for the permanence as well as profitless delay for balancing survival.

Fuzzy Stabilization for Nonlinear Discrete Ship Steering Stochastic Systems Subject to State Variance and Passivity Constraints

Directory of Open Access Journals (Sweden)

Wen-Jer Chang

2014-01-01

Full Text Available For nonlinear discrete-time stochastic systems, a fuzzy controller design methodology is developed in this paper subject to state variance constraint and passivity constraint. According to fuzzy model based control technique, the nonlinear discrete-time stochastic systems considered in this paper are represented by the discrete-time Takagi-Sugeno fuzzy models with multiplicative noise. Employing Lyapunov stability theory, upper bound covariance control theory, and passivity theory, some sufficient conditions are derived to find parallel distributed compensation based fuzzy controllers. In order to solve these sufficient conditions, an iterative linear matrix inequality algorithm is applied based on the linear matrix inequality technique. Finally, the fuzzy stabilization problem for nonlinear discrete ship steering stochastic systems is investigated in the numerical example to illustrate the feasibility and validity of proposed fuzzy controller design method.

On the discretization of linear fractional representations of LPV systems

NARCIS (Netherlands)

Toth, R.; Lovera, M.; Heuberger, P.S.C.; Corno, M.; Hof, Van den P.M.J.

2012-01-01

Commonly, controllers for linear parameter-varying (LPV) systems are designed in continuous time using a linear fractional representation (LFR) of the plant. However, the resulting controllers are implemented on digital hardware. Furthermore, discrete-time LPV synthesis approaches require a

Bounded Model Checking and Inductive Verification of Hybrid Discrete-Continuous Systems

DEFF Research Database (Denmark)

Becker, Bernd; Behle, Markus; Eisenbrand, Fritz

2004-01-01

We present a concept to signicantly advance the state of the art for bounded model checking (BMC) and inductive verication (IV) of hybrid discrete-continuous systems. Our approach combines the expertise of partners coming from dierent domains, like hybrid systems modeling and digital circuit veri...

Safety Discrete Event Models for Holonic Cyclic Manufacturing Systems

Science.gov (United States)

Ciufudean, Calin; Filote, Constantin

In this paper the expression “holonic cyclic manufacturing systems” refers to complex assembly/disassembly systems or fork/join systems, kanban systems, and in general, to any discrete event system that transforms raw material and/or components into products. Such a system is said to be cyclic if it provides the same sequence of products indefinitely. This paper considers the scheduling of holonic cyclic manufacturing systems and describes a new approach using Petri nets formalism. We propose an approach to frame the optimum schedule of holonic cyclic manufacturing systems in order to maximize the throughput while minimize the work in process. We also propose an algorithm to verify the optimum schedule.

Nonparametric Estimation of Interval Reliability for Discrete-Time Semi-Markov Systems

DEFF Research Database (Denmark)

Georgiadis, Stylianos; Limnios, Nikolaos

2016-01-01

In this article, we consider a repairable discrete-time semi-Markov system with finite state space. The measure of the interval reliability is given as the probability of the system being operational over a given finite-length time interval. A nonparametric estimator is proposed for the interval...

An automatic system for Turkish word recognition using Discrete Wavelet Neural Network based on adaptive entropy

International Nuclear Information System (INIS)

Avci, E.

2007-01-01

In this paper, an automatic system is presented for word recognition using real Turkish word signals. This paper especially deals with combination of the feature extraction and classification from real Turkish word signals. A Discrete Wavelet Neural Network (DWNN) model is used, which consists of two layers: discrete wavelet layer and multi-layer perceptron. The discrete wavelet layer is used for adaptive feature extraction in the time-frequency domain and is composed of Discrete Wavelet Transform (DWT) and wavelet entropy. The multi-layer perceptron used for classification is a feed-forward neural network. The performance of the used system is evaluated by using noisy Turkish word signals. Test results showing the effectiveness of the proposed automatic system are presented in this paper. The rate of correct recognition is about 92.5% for the sample speech signals. (author)

Observability of discretized partial differential equations

Science.gov (United States)

Cohn, Stephen E.; Dee, Dick P.

1988-01-01

It is shown that complete observability of the discrete model used to assimilate data from a linear partial differential equation (PDE) system is necessary and sufficient for asymptotic stability of the data assimilation process. The observability theory for discrete systems is reviewed and applied to obtain simple observability tests for discretized constant-coefficient PDEs. Examples are used to show how numerical dispersion can result in discrete dynamics with multiple eigenvalues, thereby detracting from observability.

A Study of the Use of a Handheld Computer Algebra System in Discrete Mathematics

Science.gov (United States)

Powers, Robert A.; Allison, Dean E.; Grassl, Richard M.

2005-01-01

This study investigated the impact of the TI-92 handheld Computer Algebra System (CAS) on student achievement in a discrete mathematics course. Specifically, the researchers examined the differences between a CAS section and a control section of discrete mathematics on students' in-class examinations. Additionally, they analysed student approaches…

On Stochastic Finite-Time Control of Discrete-Time Fuzzy Systems with Packet Dropout

Directory of Open Access Journals (Sweden)

Yingqi Zhang

2012-01-01

Full Text Available This paper is concerned with the stochastic finite-time stability and stochastic finite-time boundedness problems for one family of fuzzy discrete-time systems over networks with packet dropout, parametric uncertainties, and time-varying norm-bounded disturbance. Firstly, we present the dynamic model description studied, in which the discrete-time fuzzy T-S systems with packet loss can be described by one class of fuzzy Markovian jump systems. Then, the concepts of stochastic finite-time stability and stochastic finite-time boundedness and problem formulation are given. Based on Lyapunov function approach, sufficient conditions on stochastic finite-time stability and stochastic finite-time boundedness are established for the resulting closed-loop fuzzy discrete-time system with Markovian jumps, and state-feedback controllers are designed to ensure stochastic finite-time stability and stochastic finite-time boundedness of the class of fuzzy systems. The stochastic finite-time stability and stochastic finite-time boundedness criteria can be tackled in the form of linear matrix inequalities with a fixed parameter. As an auxiliary result, we also give sufficient conditions on the stochastic stability of the class of fuzzy T-S systems with packet loss. Finally, two illustrative examples are presented to show the validity of the developed methodology.

Discrete event simulation versus conventional system reliability analysis approaches

DEFF Research Database (Denmark)

Kozine, Igor

2010-01-01

Discrete Event Simulation (DES) environments are rapidly developing and appear to be promising tools for building reliability and risk analysis models of safety-critical systems and human operators. If properly developed, they are an alternative to the conventional human reliability analysis models...... and systems analysis methods such as fault and event trees and Bayesian networks. As one part, the paper describes briefly the author’s experience in applying DES models to the analysis of safety-critical systems in different domains. The other part of the paper is devoted to comparing conventional approaches...

Reducing Fatigue Loading Due to Pressure Shift in Discrete Fluid Power Force Systems

DEFF Research Database (Denmark)

Hansen, Anders Hedegaard; Pedersen, Henrik Clemmensen

2016-01-01

power force system. The current paper investigates the correlation between pressure oscillations in the cylinder chambers and valve flow in the manifold. Furthermore, the correlation between the pressure shifting time and the pressure overshoot is investigated. The study therefore focus on how to shape......Discrete Fluid Power Force Systems is one of the topologies gaining focus in the pursuit of lowering energy losses in fluid power transmission systems. The cylinder based Fluid Power Force System considered in this article is constructed with a multi-chamber cylinder, a number of constant pressure...... oscillations in the cylinder chamber, especially for systems with long connections between the cylinder and the valve manifold. Hose pressure oscillations will induce oscillations in the produced piston force. Hence, pressure oscillations may increase the fatigue loading on systems employing a discrete fluid...

Discrete Dynamical Systems Meet the Classic Monkey-and-the-Bananas Problem.

Science.gov (United States)

Gannon, Gerald E.; Martelli, Mario U.

2001-01-01

Presents a solution of the three-sailors-and-the-bananas problem and attempts a generalization. Introduces an interesting way of looking at the mathematics with an idea drawn from discrete dynamical systems. (KHR)

An application of multigrid methods for a discrete elastic model for epitaxial systems

International Nuclear Information System (INIS)

Caflisch, R.E.; Lee, Y.-J.; Shu, S.; Xiao, Y.-X.; Xu, J.

2006-01-01

We apply an efficient and fast algorithm to simulate the atomistic strain model for epitaxial systems, recently introduced by Schindler et al. [Phys. Rev. B 67, 075316 (2003)]. The discrete effects in this lattice statics model are crucial for proper simulation of the influence of strain for thin film epitaxial growth, but the size of the atomistic systems of interest is in general quite large and hence the solution of the discrete elastic equations is a considerable numerical challenge. In this paper, we construct an algebraic multigrid method suitable for efficient solution of the large scale discrete strain model. Using this method, simulations are performed for several representative physical problems, including an infinite periodic step train, a layered nanocrystal, and a system of quantum dots. The results demonstrate the effectiveness and robustness of the method and show that the method attains optimal convergence properties, regardless of the problem size, the geometry and the physical parameters. The effects of substrate depth and of invariance due to traction-free boundary conditions are assessed. For a system of quantum dots, the simulated strain energy density supports the observations that trench formation near the dots provides strain relief

Uniform discretizations: a quantization procedure for totally constrained systems including gravity

Energy Technology Data Exchange (ETDEWEB)

Campiglia, Miguel [Instituto de Fisica, Facultad de Ciencias, Igua 4225, esq. Mataojo, Montevideo (Uruguay); Di Bartolo, Cayetano [Departamento de Fisica, Universidad Simon BolIvar, Aptdo. 89000, Caracas 1080-A (Venezuela); Gambini, Rodolfo [Instituto de Fisica, Facultad de Ciencias, Igua 4225, esq. Mataojo, Montevideo (Uruguay); Pullin, Jorge [Department of Physics and Astronomy, Louisiana State University, Baton Rouge, LA 70803-4001 (United States)

2007-05-15

We present a new method for the quantization of totally constrained systems including general relativity. The method consists in constructing discretized theories that have a well defined and controlled continuum limit. The discrete theories are constraint-free and can be readily quantized. This provides a framework where one can introduce a relational notion of time and that nevertheless approximates in a well defined fashion the theory of interest. The method is equivalent to the group averaging procedure for many systems where the latter makes sense and provides a generalization otherwise. In the continuum limit it can be shown to contain, under certain assumptions, the 'master constraint' of the 'Phoenix project'. It also provides a correspondence principle with the classical theory that does not require to consider the semiclassical limit.

Discrete optimization in architecture extremely modular systems

CERN Document Server

Zawidzki, Machi

2017-01-01

This book is comprised of two parts, both of which explore modular systems: Pipe-Z (PZ) and Truss-Z (TZ), respectively. It presents several methods of creating PZ and TZ structures subjected to discrete optimization. The algorithms presented employ graph-theoretic and heuristic methods. The underlying idea of both systems is to create free-form structures using the minimal number of types of modular elements. PZ is more conceptual, as it forms single-branch mathematical knots with a single type of module. Conversely, TZ is a skeletal system for creating free-form pedestrian ramps and ramp networks among any number of terminals in space. In physical space, TZ uses two types of modules that are mirror reflections of each other. The optimization criteria discussed include: the minimal number of units, maximal adherence to the given guide paths, etc.

Sliding mode control-based linear functional observers for discrete-time stochastic systems

Science.gov (United States)

Singh, Satnesh; Janardhanan, Sivaramakrishnan

2017-11-01

Sliding mode control (SMC) is one of the most popular techniques to stabilise linear discrete-time stochastic systems. However, application of SMC becomes difficult when the system states are not available for feedback. This paper presents a new approach to design a SMC-based functional observer for discrete-time stochastic systems. The functional observer is based on the Kronecker product approach. Existence conditions and stability analysis of the proposed observer are given. The control input is estimated by a novel linear functional observer. This approach leads to a non-switching type of control, thereby eliminating the fundamental cause of chatter. Furthermore, the functional observer is designed in such a way that the effect of process and measurement noise is minimised. Simulation example is given to illustrate and validate the proposed design method.

Symmetric, discrete fractional splines and Gabor systems

DEFF Research Database (Denmark)

Søndergaard, Peter Lempel

2006-01-01

In this paper we consider fractional splines as windows for Gabor frames. We introduce two new types of symmetric, fractional splines in addition to one found by Unser and Blu. For the finite, discrete case we present two families of splines: One is created by sampling and periodizing the continu......In this paper we consider fractional splines as windows for Gabor frames. We introduce two new types of symmetric, fractional splines in addition to one found by Unser and Blu. For the finite, discrete case we present two families of splines: One is created by sampling and periodizing...... the continuous splines, and one is a truly finite, discrete construction. We discuss the properties of these splines and their usefulness as windows for Gabor frames and Wilson bases....

Kato's chaos in set-valued discrete systems

International Nuclear Information System (INIS)

Gu Rongbao

2007-01-01

In this paper, we investigate the relationships between Kato's chaoticity of a dynamical system (X,f) and Kato's chaoticity of the set-valued discrete system (K(X),f-bar ) associated to (X,f), where X is a compact metric space and f:X->X is a continuous map. We show that Kato's chaoticity of (K(X),f-bar ) implies the Kato's chaoticity of (X,f) in general and (X,f) is chaotic in the sense of Kato if and only if (K(X),f-bar ) is Kato chaotic in w e -topology. We also show that Ruelle-Takens' chaoticity implies Kato's chaoticity for a continuous map with a fixed point from a complete metric space without isolated point into itself

Application of discrete function and software control flow to dependability assessment of embedded digital system

International Nuclear Information System (INIS)

Choi, Jong Gyun; Seong, Poong Hyun

2001-01-01

This article describes a combinatorial model for estimating the reliability of the embedded digital system by means of discrete function theory and software control flow. This model includes a coverage model for fault processing mechanisms implemented in digital system. Furthermore, the model considers the interaction between hardware and software. The fault processing mechanisms make it difficult for many types of components in digital system to be treated as binary state, good or bad. The discrete function theory provides a complete analysis of multi-state system as which the digital system can be regarded Through adaptation software control flow to discrete function theory, the HW/SW interaction is considered for estimation of the reliability of digital system. Using this model, we predict the reliability of one board controller in a digital system, Interposing Logic System(ILS), which is installed in YGN nuclear power units 3 and 4. Since the proposed model is general combinatinal model, the simplification of this model becomes a conservative model that treats the system as binary state. Moreover, if information for coverage factor of fault tolerance mechanisms implemented in system through fault injection experiment is obtained, this model can consider detailed interaction of system components

Discrete Displacement Hydraulic Power Take-Off System for the Wavestar Wave Energy Converter

DEFF Research Database (Denmark)

Hansen, Rico Hjerm; Kramer, Morten; Vidal, Enrique

2013-01-01

. This is achieved by using special multi-chambered cylinders, where the different chambers may be connected to the available system pressures using fast on/off valves. Resultantly, a Discrete Displacement Cylinder (DDC) is created, allowing near loss free discrete force control. This paper presents a complete PTO...... system for a 20 float Wavestar based on the DDC. The WEC and PTO is rigorously modeled from incident waves to the electric output to the grid. The resulting model of +600 states is simulated in different irregular seas, showing that power conversion efficiencies above 70% from input power to electrical...

Discrete-Time Biomedical Signal Encryption

Directory of Open Access Journals (Sweden)

Victor Grigoraş

2017-12-01

Full Text Available Chaotic modulation is a strong method of improving communication security. Analog and discrete chaotic systems are presented in actual literature. Due to the expansion of digital communication, discrete-time systems become more efficient and closer to actual technology. The present contribution offers an in-depth analysis of the effects chaos encryption produce on 1D and 2D biomedical signals. The performed simulations show that modulating signals are precisely recovered by the synchronizing receiver if discrete systems are digitally implemented and the coefficients precisely correspond. Channel noise is also applied and its effects on biomedical signal demodulation are highlighted.

Discrete Hamiltonian evolution and quantum gravity

International Nuclear Information System (INIS)

Husain, Viqar; Winkler, Oliver

2004-01-01

We study constrained Hamiltonian systems by utilizing general forms of time discretization. We show that for explicit discretizations, the requirement of preserving the canonical Poisson bracket under discrete evolution imposes strong conditions on both allowable discretizations and Hamiltonians. These conditions permit time discretizations for a limited class of Hamiltonians, which does not include homogeneous cosmological models. We also present two general classes of implicit discretizations which preserve Poisson brackets for any Hamiltonian. Both types of discretizations generically do not preserve first class constraint algebras. Using this observation, we show that time discretization provides a complicated time gauge fixing for quantum gravity models, which may be compared with the alternative procedure of gauge fixing before discretization

An integrable semi-discretization of the Boussinesq equation

International Nuclear Information System (INIS)

Zhang, Yingnan; Tian, Lixin

2016-01-01

Highlights: • A new integrable semi-discretization of the Boussinesq equation is present. • A Bäcklund transformation and a Lax pair for the differential-difference system is derived by using Hirota's bilinear method. • The soliton solutions of 'good' Boussinesq equation and numerical algorithms are investigated. - Abstract: In this paper, we present an integrable semi-discretization of the Boussinesq equation. Different from other discrete analogues, we discretize the ‘time’ variable and get an integrable differential-difference system. Under a standard limitation, the differential-difference system converges to the continuous Boussinesq equation such that the discrete system can be used to design numerical algorithms. Using Hirota's bilinear method, we find a Bäcklund transformation and a Lax pair of the differential-difference system. For the case of ‘good’ Boussinesq equation, we investigate the soliton solutions of its discrete analogue and design numerical algorithms. We find an effective way to reduce the phase shift caused by the discretization. The numerical results coincide with our analysis.

Discrete simulation system based on artificial intelligence methods

Energy Technology Data Exchange (ETDEWEB)

Futo, I; Szeredi, J

1982-01-01

A discrete event simulation system based on the AI language Prolog is presented. The system called t-Prolog extends the traditional possibilities of simulation languages toward automatic problem solving by using backtrack in time and automatic model modification depending on logical deductions. As t-Prolog is an interactive tool, the user has the possibility to interrupt the simulation run to modify the model or to force it to return to a previous state for trying possible alternatives. It admits the construction of goal-oriented or goal-seeking models with variable structure. Models are defined in a restricted version of the first order predicate calculus using Horn clauses. 21 references.

Perfect discretization of reparametrization invariant path integrals

International Nuclear Information System (INIS)

Bahr, Benjamin; Dittrich, Bianca; Steinhaus, Sebastian

2011-01-01

To obtain a well-defined path integral one often employs discretizations. In the case of gravity and reparametrization-invariant systems, the latter of which we consider here as a toy example, discretizations generically break diffeomorphism and reparametrization symmetry, respectively. This has severe implications, as these symmetries determine the dynamics of the corresponding system. Indeed we will show that a discretized path integral with reparametrization-invariance is necessarily also discretization independent and therefore uniquely determined by the corresponding continuum quantum mechanical propagator. We use this insight to develop an iterative method for constructing such a discretized path integral, akin to a Wilsonian RG flow. This allows us to address the problem of discretization ambiguities and of an anomaly-free path integral measure for such systems. The latter is needed to obtain a path integral, that can act as a projector onto the physical states, satisfying the quantum constraints. We will comment on implications for discrete quantum gravity models, such as spin foams.

Perfect discretization of reparametrization invariant path integrals

Science.gov (United States)

Bahr, Benjamin; Dittrich, Bianca; Steinhaus, Sebastian

2011-05-01

To obtain a well-defined path integral one often employs discretizations. In the case of gravity and reparametrization-invariant systems, the latter of which we consider here as a toy example, discretizations generically break diffeomorphism and reparametrization symmetry, respectively. This has severe implications, as these symmetries determine the dynamics of the corresponding system. Indeed we will show that a discretized path integral with reparametrization-invariance is necessarily also discretization independent and therefore uniquely determined by the corresponding continuum quantum mechanical propagator. We use this insight to develop an iterative method for constructing such a discretized path integral, akin to a Wilsonian RG flow. This allows us to address the problem of discretization ambiguities and of an anomaly-free path integral measure for such systems. The latter is needed to obtain a path integral, that can act as a projector onto the physical states, satisfying the quantum constraints. We will comment on implications for discrete quantum gravity models, such as spin foams.

H 2 guaranteed cost control of discrete linear systems

Directory of Open Access Journals (Sweden)

Colmenares W.

2000-01-01

Full Text Available This paper presents necessary and sufficient conditions for the existence of a quadratically stabilizing output feedback controller which also assures H 2 guaranteed cost performance on a discrete linear uncertain system where the uncertainty is of the norm bounded type. The conditions are presented as a collection of linear matrix inequalities.The solution, however requires a search over a scalar parameter space.

Time Span of Discretion and Administrative Work in School Systems: Results of a Pilot Study.

Science.gov (United States)

Allison, Derek J.; Morfitt, Grace

This paper presents findings of a study that utilized Elliott Jaques' theories of organizational depth structure and time span of discretion in administrative work to examine administrators' responsibilities in two Ontario (Canada) school systems. The theory predicts that the time-span of discretion associated with the administrative tasks will…

On constructing optimistic simulation algorithms for the discrete event system specification

International Nuclear Information System (INIS)

Nutaro, James J.

2008-01-01

This article describes a Time Warp simulation algorithm for discrete event models that are described in terms of the Discrete Event System Specification (DEVS). The article shows how the total state transition and total output function of a DEVS atomic model can be transformed into an event processing procedure for a logical process. A specific Time Warp algorithm is constructed around this logical process, and it is shown that the algorithm correctly simulates a DEVS coupled model that consists entirely of interacting atomic models. The simulation algorithm is presented abstractly; it is intended to provide a basis for implementing efficient and scalable parallel algorithms that correctly simulate DEVS models

A discrete control model of PLANT

Science.gov (United States)

Mitchell, C. M.

1985-01-01

A model of the PLANT system using the discrete control modeling techniques developed by Miller is described. Discrete control models attempt to represent in a mathematical form how a human operator might decompose a complex system into simpler parts and how the control actions and system configuration are coordinated so that acceptable overall system performance is achieved. Basic questions include knowledge representation, information flow, and decision making in complex systems. The structure of the model is a general hierarchical/heterarchical scheme which structurally accounts for coordination and dynamic focus of attention. Mathematically, the discrete control model is defined in terms of a network of finite state systems. Specifically, the discrete control model accounts for how specific control actions are selected from information about the controlled system, the environment, and the context of the situation. The objective is to provide a plausible and empirically testable accounting and, if possible, explanation of control behavior.

Discrete gradients in discrete classical mechanics

International Nuclear Information System (INIS)

Renna, L.

1987-01-01

A simple model of discrete classical mechanics is given where, starting from the continuous Hamilton equations, discrete equations of motion are established together with a proper discrete gradient definition. The conservation laws of the total discrete momentum, angular momentum, and energy are demonstrated

Research on a Hierarchical Dynamic Automatic Voltage Control System Based on the Discrete Event-Driven Method

Directory of Open Access Journals (Sweden)

Yong Min

2013-06-01

Full Text Available In this paper, concepts and methods of hybrid control systems are adopted to establish a hierarchical dynamic automatic voltage control (HD-AVC system, realizing the dynamic voltage stability of power grids. An HD-AVC system model consisting of three layers is built based on the hybrid control method and discrete event-driven mechanism. In the Top Layer, discrete events are designed to drive the corresponding control block so as to avoid solving complex multiple objective functions, the power system’s characteristic matrix is formed and the minimum amplitude eigenvalue (MAE is calculated through linearized differential-algebraic equations. MAE is applied to judge the system’s voltage stability and security and construct discrete events. The Middle Layer is responsible for management and operation, which is also driven by discrete events. Control values of the control buses are calculated based on the characteristics of power systems and the sensitivity method. Then control values generate control strategies through the interface block. In the Bottom Layer, various control devices receive and implement the control commands from the Middle Layer. In this way, a closed-loop power system voltage control is achieved. Computer simulations verify the validity and accuracy of the HD-AVC system, and verify that the proposed HD-AVC system is more effective than normal voltage control methods.

Perfect discretization of path integrals

International Nuclear Information System (INIS)

Steinhaus, Sebastian

2012-01-01

In order to obtain a well-defined path integral one often employs discretizations. In the case of General Relativity these generically break diffeomorphism symmetry, which has severe consequences since these symmetries determine the dynamics of the corresponding system. In this article we consider the path integral of reparametrization invariant systems as a toy example and present an improvement procedure for the discretized propagator. Fixed points and convergence of the procedure are discussed. Furthermore we show that a reparametrization invariant path integral implies discretization independence and acts as a projector onto physical states.

Perfect discretization of path integrals

Science.gov (United States)

Steinhaus, Sebastian

2012-05-01

In order to obtain a well-defined path integral one often employs discretizations. In the case of General Relativity these generically break diffeomorphism symmetry, which has severe consequences since these symmetries determine the dynamics of the corresponding system. In this article we consider the path integral of reparametrization invariant systems as a toy example and present an improvement procedure for the discretized propagator. Fixed points and convergence of the procedure are discussed. Furthermore we show that a reparametrization invariant path integral implies discretization independence and acts as a projector onto physical states.

State control of discrete-time linear systems to be bound in state variables by equality constraints

International Nuclear Information System (INIS)

Filasová, Anna; Krokavec, Dušan; Serbák, Vladimír

2014-01-01

The paper is concerned with the problem of designing the discrete-time equivalent PI controller to control the discrete-time linear systems in such a way that the closed-loop state variables satisfy the prescribed equality constraints. Since the problem is generally singular, using standard form of the Lyapunov function and a symmetric positive definite slack matrix, the design conditions are proposed in the form of the enhanced Lyapunov inequality. The results, offering the conditions of the control existence and the optimal performance with respect to the prescribed equality constraints for square discrete-time linear systems, are illustrated with the numerical example to note effectiveness and applicability of the considered approach

Communication scheduling in robust self-triggered MPC for linear discrete-time systems

NARCIS (Netherlands)

Brunner, F.D.; Gommans, T.M.P.; Heemels, W.P.M.H.; Allgöwer, F.

2015-01-01

We consider a networked control system consisting of a physical plant, an actuator, a sensor, and a controller that is connected to the actuator and sensor via a communication network. The plant is described by a linear discrete-time system subject to additive disturbances. In order to reduce the

Controllability of a Class of Bimodal Discrete-Time Piecewise Linear Systems

NARCIS (Netherlands)

Yurtseven, E.; Camlibel, M.K.; Heemels, W.P.M.H.

2013-01-01

In this paper we will provide algebraic necessary and sufficient conditions for the controllability/reachability/null controllability of a class of bimodal discrete-time piecewise linear systems including several instances of interest that are not covered by existing works which focus primarily on

An integrable semi-discretization of the Boussinesq equation

Energy Technology Data Exchange (ETDEWEB)

Zhang, Yingnan, E-mail: ynzhang@njnu.edu.cn [Jiangsu Key Laboratory for NSLSCS, School of Mathematical Sciences, Nanjing Normal University, Nanjing, Jiangsu (China); Tian, Lixin, E-mail: tianlixin@njnu.edu.cn [Jiangsu Key Laboratory for NSLSCS, School of Mathematical Sciences, Nanjing Normal University, Nanjing, Jiangsu (China); Nonlinear Scientific Research Center, Jiangsu University, Zhenjiang, Jiangsu (China)

2016-10-23

Highlights: • A new integrable semi-discretization of the Boussinesq equation is present. • A Bäcklund transformation and a Lax pair for the differential-difference system is derived by using Hirota's bilinear method. • The soliton solutions of 'good' Boussinesq equation and numerical algorithms are investigated. - Abstract: In this paper, we present an integrable semi-discretization of the Boussinesq equation. Different from other discrete analogues, we discretize the ‘time’ variable and get an integrable differential-difference system. Under a standard limitation, the differential-difference system converges to the continuous Boussinesq equation such that the discrete system can be used to design numerical algorithms. Using Hirota's bilinear method, we find a Bäcklund transformation and a Lax pair of the differential-difference system. For the case of ‘good’ Boussinesq equation, we investigate the soliton solutions of its discrete analogue and design numerical algorithms. We find an effective way to reduce the phase shift caused by the discretization. The numerical results coincide with our analysis.

Multiple periodic solutions for a fourth-order discrete Hamiltonian system

Directory of Open Access Journals (Sweden)

Yongkun Li

2010-12-01

Full Text Available By means of a three critical points theorem proposed by Brezis and Nirenberg and a general version of Mountain Pass Theorem, we obtain some multiplicity results for periodic solutions of a fourth-order discrete Hamiltonian system Δ4u(t-2+∇ F(t,u(t=0 for all t∈ Z.

Essential uncontrollability of discrete linear, time-invariant, dynamical systems

Science.gov (United States)

Cliff, E. M.

1975-01-01

The concept of a 'best approximating m-dimensional subspace' for a given set of vectors in n-dimensional whole space is introduced. Such a subspace is easily described in terms of the eigenvectors of an associated Gram matrix. This technique is used to approximate an achievable set for a discrete linear time-invariant dynamical system. This approximation characterizes the part of the state space that may be reached using modest levels of control. If the achievable set can be closely approximated by a proper subspace of the whole space then the system is 'essentially uncontrollable'. The notion finds application in studies of failure-tolerant systems, and in decoupling.

Synchronization Techniques in Parallel Discrete Event Simulation

OpenAIRE

Lindén, Jonatan

2018-01-01

Discrete event simulation is an important tool for evaluating system models in many fields of science and engineering. To improve the performance of large-scale discrete event simulations, several techniques to parallelize discrete event simulation have been developed. In parallel discrete event simulation, the work of a single discrete event simulation is distributed over multiple processing elements. A key challenge in parallel discrete event simulation is to ensure that causally dependent ...

Functional envelope of a non-autonomous discrete system

Directory of Open Access Journals (Sweden)

Barzanouni Ali

2017-11-01

Full Text Available Let (X, F = {fn}n =0∞ be a non-autonomous discrete system by a compact metric space X and continuous maps fn : X → X, n = 0, 1, ....We introduce functional envelope (S(X, G = {Gn}n =0∞, of (X, F = {fn}n =0∞, where S(X is the space of all continuous self maps of X and the map Gn : S(X → S(X is defined by Gn(ϕ = Fn ∘ ϕ, Fn = fn ∘ fn-1 ∘ . . . ∘ f1 ∘ f0. The paper mainly deals with the connection between the properties of a system and the properties of its functional envelope.

Linear quadratic Gaussian balancing for discrete-time infinite-dimensional linear systems

NARCIS (Netherlands)

Opmeer, MR; Curtain, RF

2004-01-01

In this paper, we study the existence of linear quadratic Gaussian (LQG)-balanced realizations for discrete-time infinite-dimensional systems. LQG-balanced realizations are those for which the smallest nonnegative self-adjoint solutions of the control and filter Riccati equations are equal. We show

Discrete mKdV and discrete sine-Gordon flows on discrete space curves

International Nuclear Information System (INIS)

Inoguchi, Jun-ichi; Kajiwara, Kenji; Matsuura, Nozomu; Ohta, Yasuhiro

2014-01-01

In this paper, we consider the discrete deformation of the discrete space curves with constant torsion described by the discrete mKdV or the discrete sine-Gordon equations, and show that it is formulated as the torsion-preserving equidistant deformation on the osculating plane which satisfies the isoperimetric condition. The curve is reconstructed from the deformation data by using the Sym–Tafel formula. The isoperimetric equidistant deformation of the space curves does not preserve the torsion in general. However, it is possible to construct the torsion-preserving deformation by tuning the deformation parameters. Further, it is also possible to make an arbitrary choice of the deformation described by the discrete mKdV equation or by the discrete sine-Gordon equation at each step. We finally show that the discrete deformation of discrete space curves yields the discrete K-surfaces. (paper)

Performance evaluation of block-diagonal preconditioners for the divergence-conforming B-spline discretization of the Stokes system

KAUST Repository

Cô rtes, A.M.A.; Coutinho, A.L.G.A.; Dalcin, L.; Calo, Victor M.

2015-01-01

The recently introduced divergence-conforming B-spline discretizations allow the construction of smooth discrete velocity–pressure pairs for viscous incompressible flows that are at the same time inf-sup stable and pointwise divergence-free. When applied to discretized Stokes equations, these spaces generate a symmetric and indefinite saddle-point linear system. Krylov subspace methods are usually the most efficient procedures to solve such systems. One of such methods, for symmetric systems, is the Minimum Residual Method (MINRES). However, the efficiency and robustness of Krylov subspace methods is closely tied to appropriate preconditioning strategies. For the discrete Stokes system, in particular, block-diagonal strategies provide efficient preconditioners. In this article, we compare the performance of block-diagonal preconditioners for several block choices. We verify how the eigenvalue clustering promoted by the preconditioning strategies affects MINRES convergence. We also compare the number of iterations and wall-clock timings. We conclude that among the building blocks we tested, the strategy with relaxed inner conjugate gradients preconditioned with incomplete Cholesky provided the best results.

Performance evaluation of block-diagonal preconditioners for the divergence-conforming B-spline discretization of the Stokes system

KAUST Repository

Côrtes, A.M.A.

2015-02-20

The recently introduced divergence-conforming B-spline discretizations allow the construction of smooth discrete velocity–pressure pairs for viscous incompressible flows that are at the same time inf-sup stable and pointwise divergence-free. When applied to discretized Stokes equations, these spaces generate a symmetric and indefinite saddle-point linear system. Krylov subspace methods are usually the most efficient procedures to solve such systems. One of such methods, for symmetric systems, is the Minimum Residual Method (MINRES). However, the efficiency and robustness of Krylov subspace methods is closely tied to appropriate preconditioning strategies. For the discrete Stokes system, in particular, block-diagonal strategies provide efficient preconditioners. In this article, we compare the performance of block-diagonal preconditioners for several block choices. We verify how the eigenvalue clustering promoted by the preconditioning strategies affects MINRES convergence. We also compare the number of iterations and wall-clock timings. We conclude that among the building blocks we tested, the strategy with relaxed inner conjugate gradients preconditioned with incomplete Cholesky provided the best results.

Discrete Multiwavelet Critical-Sampling Transform-Based OFDM System over Rayleigh Fading Channels

Directory of Open Access Journals (Sweden)

Sameer A. Dawood

2015-01-01

Full Text Available Discrete multiwavelet critical-sampling transform (DMWCST has been proposed instead of fast Fourier transform (FFT in the realization of the orthogonal frequency division multiplexing (OFDM system. The proposed structure further reduces the level of interference and improves the bandwidth efficiency through the elimination of the cyclic prefix due to the good orthogonality and time-frequency localization properties of the multiwavelet transform. The proposed system was simulated using MATLAB to allow various parameters of the system to be varied and tested. The performance of DMWCST-based OFDM (DMWCST-OFDM was compared with that of the discrete wavelet transform-based OFDM (DWT-OFDM and the traditional FFT-based OFDM (FFT-OFDM over flat fading and frequency-selective fading channels. Results obtained indicate that the performance of the proposed DMWCST-OFDM system achieves significant improvement compared to those of DWT-OFDM and FFT-OFDM systems. DMWCST improves the performance of the OFDM system by a factor of 1.5–2.5 dB and 13–15.5 dB compared with the DWT and FFT, respectively. Therefore the proposed system offers higher data rate in wireless mobile communications.

Adaptive Neural Tracking Control for Discrete-Time Switched Nonlinear Systems with Dead Zone Inputs

Directory of Open Access Journals (Sweden)

Jidong Wang

2017-01-01

Full Text Available In this paper, the adaptive neural controllers of subsystems are proposed for a class of discrete-time switched nonlinear systems with dead zone inputs under arbitrary switching signals. Due to the complicated framework of the discrete-time switched nonlinear systems and the existence of the dead zone, it brings about difficulties for controlling such a class of systems. In addition, the radial basis function neural networks are employed to approximate the unknown terms of each subsystem. Switched update laws are designed while the parameter estimation is invariable until its corresponding subsystem is active. Then, the closed-loop system is stable and all the signals are bounded. Finally, to illustrate the effectiveness of the proposed method, an example is employed.

Geometry and Hamiltonian mechanics on discrete spaces

International Nuclear Information System (INIS)

Talasila, V; Clemente-Gallardo, J; Schaft, A J van der

2004-01-01

Numerical simulation is often crucial for analysing the behaviour of many complex systems which do not admit analytic solutions. To this end, one either converts a 'smooth' model into a discrete (in space and time) model, or models systems directly at a discrete level. The goal of this paper is to provide a discrete analogue of differential geometry, and to define on these discrete models a formal discrete Hamiltonian structure-in doing so we try to bring together various fundamental concepts from numerical analysis, differential geometry, algebraic geometry, simplicial homology and classical Hamiltonian mechanics. For example, the concept of a twisted derivation is borrowed from algebraic geometry for developing a discrete calculus. The theory is applied to a nonlinear pendulum and we compare the dynamics obtained through a discrete modelling approach with the dynamics obtained via the usual discretization procedures. Also an example of an energy-conserving algorithm on a simple harmonic oscillator is presented, and its effect on the Poisson structure is discussed

Consensus of Discrete Multiagent System with Various Time Delays and Environmental Disturbances

Directory of Open Access Journals (Sweden)

Zheping Yan

2014-12-01

Full Text Available In this paper, the consensus problem of discrete multiagent systems with time varying sampling periods is studied. Firstly, with thorough analysis of various delays among agents, the control input of each agent is designed with consideration of sending delay and receiving delay. With construction of discrete dynamics of state error vector, it is proved by applying Halanay inequality that consensus of the system can be reached. Further, the definition of bounded consensus is proposed in the situation where environmental disturbances exist. In order to handle this problem, the Halanay inequality is extended into a more general one with boundedness property. Based on the new Halanay inequality obtained, the boundedness of consensus error is guaranteed. At last, simulation examples are presented to demonstrate the theoretical conclusions.

Model Predictive Control of a Wave Energy Converter with Discrete Fluid Power Power Take-Off System

Directory of Open Access Journals (Sweden)

Anders Hedegaard Hansen

2018-03-01

Full Text Available Wave power extraction algorithms for wave energy converters are normally designed without taking system losses into account leading to suboptimal power extraction. In the current work, a model predictive power extraction algorithm is designed for a discretized power take of system. It is shown how the quantized nature of a discrete fluid power system may be included in a new model predictive control algorithm leading to a significant increase in the harvested power. A detailed investigation of the influence of the prediction horizon and the time step is reported. Furthermore, it is shown how the inclusion of a loss model may increase the energy output. Based on the presented results it is concluded that power extraction algorithms based on model predictive control principles are both feasible and favorable for use in a discrete fluid power power take-off system for point absorber wave energy converters.

General method to find the attractors of discrete dynamic models of biological systems

Science.gov (United States)

Gan, Xiao; Albert, Réka

2018-04-01

Analyzing the long-term behaviors (attractors) of dynamic models of biological networks can provide valuable insight. We propose a general method that can find the attractors of multilevel discrete dynamical systems by extending a method that finds the attractors of a Boolean network model. The previous method is based on finding stable motifs, subgraphs whose nodes' states can stabilize on their own. We extend the framework from binary states to any finite discrete levels by creating a virtual node for each level of a multilevel node, and describing each virtual node with a quasi-Boolean function. We then create an expanded representation of the multilevel network, find multilevel stable motifs and oscillating motifs, and identify attractors by successive network reduction. In this way, we find both fixed point attractors and complex attractors. We implemented an algorithm, which we test and validate on representative synthetic networks and on published multilevel models of biological networks. Despite its primary motivation to analyze biological networks, our motif-based method is general and can be applied to any finite discrete dynamical system.

General method to find the attractors of discrete dynamic models of biological systems.

Science.gov (United States)

Gan, Xiao; Albert, Réka

2018-04-01

Analyzing the long-term behaviors (attractors) of dynamic models of biological networks can provide valuable insight. We propose a general method that can find the attractors of multilevel discrete dynamical systems by extending a method that finds the attractors of a Boolean network model. The previous method is based on finding stable motifs, subgraphs whose nodes' states can stabilize on their own. We extend the framework from binary states to any finite discrete levels by creating a virtual node for each level of a multilevel node, and describing each virtual node with a quasi-Boolean function. We then create an expanded representation of the multilevel network, find multilevel stable motifs and oscillating motifs, and identify attractors by successive network reduction. In this way, we find both fixed point attractors and complex attractors. We implemented an algorithm, which we test and validate on representative synthetic networks and on published multilevel models of biological networks. Despite its primary motivation to analyze biological networks, our motif-based method is general and can be applied to any finite discrete dynamical system.

Energy Cost of Avoiding Pressure Oscillations in a Discrete Fluid Power Force System

DEFF Research Database (Denmark)

Hansen, Anders Hedegaard; Pedersen, Henrik Clemmensen

2015-01-01

In secondary valve controlled discrete fluid power force systems the valve opening trajectory greatly influences the pressure dynamics in the actuator chambers. For discrete fluid power systems featuring hoses of significant length pressure oscillations due to fast valve switching is well......-known. This paper builds upon theoretical findings on how shaping of the valve opening may reduce the cylinder pressure oscillations. The current paper extents the work by implementing the valve opening characteristics reducing the pressure oscillations on a full scale power take-off test-bench for wave energy...... will present measurements comparing pressure dynamics for two valve opening algorithms. In addition the paper will give a theoretical investigation of the energy loss during valve shifting and finally measurements of average power output from the power take-off system in various sea states are compared...

Discrete Curvatures and Discrete Minimal Surfaces

KAUST Repository

Sun, Xiang

2012-06-01

This thesis presents an overview of some approaches to compute Gaussian and mean curvature on discrete surfaces and discusses discrete minimal surfaces. The variety of applications of differential geometry in visualization and shape design leads to great interest in studying discrete surfaces. With the rich smooth surface theory in hand, one would hope that this elegant theory can still be applied to the discrete counter part. Such a generalization, however, is not always successful. While discrete surfaces have the advantage of being finite dimensional, thus easier to treat, their geometric properties such as curvatures are not well defined in the classical sense. Furthermore, the powerful calculus tool can hardly be applied. The methods in this thesis, including angular defect formula, cotangent formula, parallel meshes, relative geometry etc. are approaches based on offset meshes or generalized offset meshes. As an important application, we discuss discrete minimal surfaces and discrete Koenigs meshes.

Less Conservative ℋ∞ Fuzzy Control for Discrete-Time Takagi-Sugeno Systems

Directory of Open Access Journals (Sweden)

Leonardo Amaral Mozelli

2011-01-01

Full Text Available New analysis and control design conditions of discrete-time fuzzy systems are proposed. Using fuzzy Lyapunov's functions and introducing slack variables, less conservative conditions are obtained. The controller guarantees system stabilization and ℋ∞ performance. Numerical tests and a practical experiment in Chua's circuit are presented to show the effectiveness.

Permanence of a predator-prey discrete system with Holling-IV functional response and distributed delays.

Science.gov (United States)

Zhang, X; Wu, Z; Zhou, T

2016-01-01

A predator-prey discrete-time model with Holling-IV functional response and distributed delays is investigated in this paper. By using the comparison theorem of the difference equation and some analysis technique, some sufficient conditions are obtained for the permanence of the discrete predator-prey system. Two examples are given to illustrate the feasibility of the obtained result.

Discrete event systems in dioid algebra and conventional algebra

CERN Document Server

Declerck, Philippe

2013-01-01

This book concerns the use of dioid algebra as (max, +) algebra to treat the synchronization of tasks expressed by the maximum of the ends of the tasks conditioning the beginning of another task - a criterion of linear programming. A classical example is the departure time of a train which should wait for the arrival of other trains in order to allow for the changeover of passengers.The content focuses on the modeling of a class of dynamic systems usually called "discrete event systems" where the timing of the events is crucial. Events are viewed as sudden changes in a process which i

A parametric LTR solution for discrete-time systems

DEFF Research Database (Denmark)

Niemann, Hans Henrik; Jannerup, Ole Erik

1989-01-01

A parametric LTR (loop transfer recovery) solution for discrete-time compensators incorporating filtering observers which achieve exact recovery is presented for both minimum- and non-minimum-phase systems. First the recovery error, which defines the difference between the target loop transfer...... and the full loop transfer function, is manipulated into a general form involving the target loop transfer matrix and the fundamental recovery matrix. A parametric LTR solution based on the recovery matrix is developed. It is shown that the LQR/LTR (linear quadratic Gaussian/loop transfer recovery) solution...

Discrete mechanics

CERN Document Server

Caltagirone, Jean-Paul

2014-01-01

This book presents the fundamental principles of mechanics to re-establish the equations of Discrete Mechanics. It introduces physics and thermodynamics associated to the physical modeling.  The development and the complementarity of sciences lead to review today the old concepts that were the basis for the development of continuum mechanics. The differential geometry is used to review the conservation laws of mechanics. For instance, this formalism requires a different location of vector and scalar quantities in space. The equations of Discrete Mechanics form a system of equations where the H

Evolutionary design of discrete controllers for hybrid mechatronic systems

DEFF Research Database (Denmark)

Dupuis, Jean-Francois; Fan, Zhun; Goodman, Erik

2015-01-01

This paper investigates the issue of evolutionary design of controllers for hybrid mechatronic systems. Finite State Automaton (FSA) is selected as the representation for a discrete controller due to its interpretability, fast execution speed and natural extension to a statechart, which is very...... popular in industrial applications. A case study of a two-tank system is used to demonstrate that the proposed evolutionary approach can lead to a successful design of an FSA controller for the hybrid mechatronic system, represented by a hybrid bond graph. Generalisation of the evolved FSA controller...... of the evolutionary design of controllers for hybrid mechatronic systems. Finally, some important future research directions are pointed out, leading to the major work of the succeeding part of the research....

Generalized Reduction Formula for Discrete Wigner Functions of Multiqubit Systems

Science.gov (United States)

Srinivasan, K.; Raghavan, G.

2018-03-01

Density matrices and Discrete Wigner Functions are equally valid representations of multiqubit quantum states. For density matrices, the partial trace operation is used to obtain the quantum state of subsystems, but an analogous prescription is not available for discrete Wigner Functions. Further, the discrete Wigner function corresponding to a density matrix is not unique but depends on the choice of the quantum net used for its reconstruction. In the present work, we derive a reduction formula for discrete Wigner functions of a general multiqubit state which works for arbitrary quantum nets. These results would be useful for the analysis and classification of entangled states and the study of decoherence purely in a discrete phase space setting and also in applications to quantum computing.

Effective lagrangian description on discrete gauge symmetries

International Nuclear Information System (INIS)

Banks, T.

1989-01-01

We exhibit a simple low-energy lagrangian which describes a system with a discrete remnant of a spontaneously broken continuous gauge symmetry. The lagrangian gives a simple description of the effects ascribed to such systems by Krauss and Wilczek: black holes carry discrete hair and interact with cosmic strings, and wormholes cannot lead to violation of discrete gauge symmetries. (orig.)

Planning "discrete" movements using a continuous system: insights from a dynamic field theory of movement preparation.

Science.gov (United States)

Schutte, Anne R; Spencer, John P

2007-04-01

The timed-initiation paradigm developed by Ghez and colleagues (1997) has revealed two modes of motor planning: continuous and discrete. Continuous responding occurs when targets are separated by less than 60 degrees of spatial angle, and discrete responding occurs when targets are separated by greater than 60 degrees . Although these two modes are thought to reflect the operation of separable strategic planning systems, a new theory of movement preparation, the Dynamic Field Theory, suggests that two modes emerge flexibly from the same system. Experiment 1 replicated continuous and discrete performance using a task modified to allow for a critical test of the single system view. In Experiment 2, participants were allowed to correct their movements following movement initiation (the standard task does not allow corrections). Results showed continuous planning performance at large and small target separations. These results are consistent with the proposal that the two modes reflect the time-dependent "preshaping" of a single planning system.

Spiral patterns near Turing instability in a discrete reaction diffusion system

International Nuclear Information System (INIS)

Li, Meifeng; Han, Bo; Xu, Li; Zhang, Guang

2013-01-01

In this paper, linear stability analysis is applied to an exponential discrete Lotka–Volterra system, which describes the competition between two identical species. Conditions for the Turing instability are obtained and the emergence of spiral patterns is demonstrated by means of numerical simulations in the vicinity of the bifurcation point. Moreover, the impact of crucial system parameters on the stability and coherence of spiral patterns is illustrated on several examples

Discrete Calculus by Analogy

CERN Document Server

Izadi, F A; Bagirov, G

2009-01-01

With its origins stretching back several centuries, discrete calculus is now an increasingly central methodology for many problems related to discrete systems and algorithms. The topics covered here usually arise in many branches of science and technology, especially in discrete mathematics, numerical analysis, statistics and probability theory as well as in electrical engineering, but our viewpoint here is that these topics belong to a much more general realm of mathematics; namely calculus and differential equations because of the remarkable analogy of the subject to this branch of mathemati

Fermion Systems in Discrete Space-Time Exemplifying the Spontaneous Generation of a Causal Structure

Science.gov (United States)

Diethert, A.; Finster, F.; Schiefeneder, D.

As toy models for space-time at the Planck scale, we consider examples of fermion systems in discrete space-time which are composed of one or two particles defined on two up to nine space-time points. We study the self-organization of the particles as described by a variational principle both analytically and numerically. We find an effect of spontaneous symmetry breaking which leads to the emergence of a discrete causal structure.

Process Modeling for Energy Usage in “Smart House” System with a Help of Markov Discrete Chain

Directory of Open Access Journals (Sweden)

Victor Kravets

2016-05-01

Full Text Available Method for evaluating economic efficiency of technical systems using discrete Markov chains modelling illustrated by the system of “Smart house”, consisting, for example, of the three independently functioning elements. Dynamic model of a random power consumption process in the form of a symmetrical state graph of heterogeneous discrete Markov chain is built. The corresponding mathematical model of a random Markov process of power consumption in the “smart house” system in recurrent matrix form is being developed. Technique of statistical determination of probability of random transition elements of the system and the corresponding to the transition probability matrix of the discrete inhomogeneous Markov chain are developed. Statistically determined random transitions of system elements power consumption and the corresponding distribution laws are introduced. The matrix of transition prices, expectations for the possible states of a system price transition and, eventually, the cost of Markov process of power consumption throughout the day.

Lax pair and exact solutions of a discrete coupled system related to coupled KdV and coupled mKdV equations

International Nuclear Information System (INIS)

Liu Ping; Jia Man; Lou Senyue

2007-01-01

A modified Korteweg-de Vries (mKdV) lattice is also found to be a discrete Korteweg-de Vries (KdV) equation in this paper. The Lax pair for the discrete equation is found with the help of the Lax pair for a similar discrete equation. A Lax-integrable coupled extension of the lattice is posed, which is a common discrete version of both the coupled KdV and coupled mKdV systems. Some rational expansions of the Jacobian elliptic, trigonometric and hyperbolic functions are used to construct cnoidal waves, negaton and positon solutions of the discrete coupled system

Decentralized control of discrete-time linear time invariant systems with input saturation

NARCIS (Netherlands)

Deliu, C.; Deliu, Ciprian; Malek, Babak; Roy, Sandip; Saberi, Ali; Stoorvogel, Antonie Arij

We study decentralized stabilization of discrete-time linear time invariant (LTI) systems subject to actuator saturation, using LTI controllers. The requirement of stabilization under both saturation constraints and decentralization impose obvious necessary conditions on the open-loop plant, namely

Decentralized control of discrete-time linear time invariant systems with input saturation

NARCIS (Netherlands)

Deliu, Ciprian; Deliu, C.; Malek, Babak; Roy, Sandip; Saberi, Ali; Stoorvogel, Antonie Arij

2009-01-01

We study decentralized stabilization of discrete time linear time invariant (LTI) systems subject to actuator saturation, using LTI controllers. The requirement of stabilization under both saturation constraints and decentralization impose obvious necessary conditions on the open-loop plant, namely

Model Predictive Control of a Wave Energy Converter with Discrete Fluid Power Power Take-Off System

DEFF Research Database (Denmark)

Hansen, Anders Hedegaard; Asmussen, Magnus Færing; Bech, Michael Møller

2018-01-01

Wave power extraction algorithms for wave energy converters are normally designed without taking system losses into account leading to suboptimal power extraction. In the current work, a model predictive power extraction algorithm is designed for a discretized power take of system. It is shown how...... the quantized nature of a discrete fluid power system may be included in a new model predictive control algorithm leading to a significant increase in the harvested power. A detailed investigation of the influence of the prediction horizon and the time step is reported. Furthermore, it is shown how...

Discrete Painlevé equations from Y-systems

International Nuclear Information System (INIS)

Hone, Andrew N W; Inoue, Rei

2014-01-01

We consider T-systems and Y-systems arising from cluster mutations applied to quivers that have the property of being periodic under a sequence of mutations. The corresponding nonlinear recurrences for cluster variables (coefficient-free T-systems) were described in the work of Fordy and Marsh, who completely classified all such quivers in the case of period 1, and characterized them in terms of the skew-symmetric exchange matrix B that defines the quiver. A broader notion of periodicity in general cluster algebras was introduced by Nakanishi, who also described the corresponding Y-systems, and T-systems with coefficients. A result of Fomin and Zelevinsky says that the coefficient-free T-system provides a solution of the Y-system. In this paper, we show that in general there is a discrepancy between these two systems, in the sense that the solution of the former does not correspond to the general solution of the latter. This discrepancy is removed by introducing additional non-autonomous coefficients into the T-system. In particular, we focus on the period 1 case and show that, when the exchange matrix B is degenerate, discrete Painlevé equations can arise from this construction. This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical devoted to ‘Cluster algebras in mathematical physics’. (paper)

Discrete Second-Order Sliding Mode Adaptive Controller Based on Characteristic Model for Servo Systems

Directory of Open Access Journals (Sweden)

Zhihong Wang

2015-01-01

Full Text Available Considering the varying inertia and load torque in high speed and high accuracy servo systems, a novel discrete second-order sliding mode adaptive controller (DSSMAC based on characteristic model is proposed, and a command observer is also designed. Firstly, the discrete characteristic model of servo systems is established. Secondly, the recursive least square algorithm is adopted to identify time-varying parameters in characteristic model, and the observer is applied to predict the command value of next sample time. Furthermore, the stability of the closed-loop system and the convergence of the observer are analyzed. The experimental results show that the proposed method not only can adapt to varying inertia and load torque, but also has good disturbance rejection ability and robustness to uncertainties.

Principles of discrete time mechanics

CERN Document Server

Jaroszkiewicz, George

2014-01-01

Could time be discrete on some unimaginably small scale? Exploring the idea in depth, this unique introduction to discrete time mechanics systematically builds the theory up from scratch, beginning with the historical, physical and mathematical background to the chronon hypothesis. Covering classical and quantum discrete time mechanics, this book presents all the tools needed to formulate and develop applications of discrete time mechanics in a number of areas, including spreadsheet mechanics, classical and quantum register mechanics, and classical and quantum mechanics and field theories. A consistent emphasis on contextuality and the observer-system relationship is maintained throughout.

Reachability in Biochemical Dynamical Systems by Quantitative Discrete Approximation (extended abstract

Directory of Open Access Journals (Sweden)

L. Brim

2011-09-01

Full Text Available In this paper, a novel computational technique for finite discrete approximation of continuous dynamical systems suitable for a significant class of biochemical dynamical systems is introduced. The method is parameterized in order to affect the imposed level of approximation provided that with increasing parameter value the approximation converges to the original continuous system. By employing this approximation technique, we present algorithms solving the reachability problem for biochemical dynamical systems. The presented method and algorithms are evaluated on several exemplary biological models and on a real case study.

Bifurcation and complex dynamics of a discrete-time predator-prey system

Directory of Open Access Journals (Sweden)

S. M. Sohel Rana

2015-06-01

Full Text Available In this paper, we investigate the dynamics of a discrete-time predator-prey system of Holling-I type in the closed first quadrant R+2. The existence and local stability of positive fixed point of the discrete dynamical system is analyzed algebraically. It is shown that the system undergoes a flip bifurcation and a Neimark-Sacker bifurcation in the interior of R+2 by using bifurcation theory. It has been found that the dynamical behavior of the model is very sensitive to the parameter values and the initial conditions. Numerical simulation results not only show the consistence with the theoretical analysis but also display the new and interesting dynamic behaviors, including phase portraits, period-9, 10, 20-orbits, attracting invariant circle, cascade of period-doubling bifurcation from period-20 leading to chaos, quasi-periodic orbits, and sudden disappearance of the chaotic dynamics and attracting chaotic set. In particular, we observe that when the prey is in chaotic dynamic, the predator can tend to extinction or to a stable equilibrium. The Lyapunov exponents are numerically computed to characterize the complexity of the dynamical behaviors. The analysis and results in this paper are interesting in mathematics and biology.

Design of an optimal preview controller for linear discrete-time descriptor systems with state delay

Science.gov (United States)

Cao, Mengjuan; Liao, Fucheng

2015-04-01

In this paper, the linear discrete-time descriptor system with state delay is studied, and a design method for an optimal preview controller is proposed. First, by using the discrete lifting technique, the original system is transformed into a general descriptor system without state delay in form. Then, taking advantage of the first-order forward difference operator, we construct a descriptor augmented error system, including the state vectors of the lifted system, error vectors, and desired target signals. Rigorous mathematical proofs are given for the regularity, stabilisability, causal controllability, and causal observability of the descriptor augmented error system. Based on these, the optimal preview controller with preview feedforward compensation for the original system is obtained by using the standard optimal regulator theory of the descriptor system. The effectiveness of the proposed method is shown by numerical simulation.

Nuclear facility safeguards systems modeling using discrete event simulation

International Nuclear Information System (INIS)

Engi, D.

1977-01-01

The threat of theft or dispersal of special nuclear material at a nuclear facility is treated by studying the temporal relationships between adversaries having authorized access to the facility (insiders) and safeguards system events by using a GASP IV discrete event simulation. The safeguards system events--detection, assessment, delay, communications, and neutralization--are modeled for the general insider adversary strategy which includes degradation of the safeguards system elements followed by an attempt to steal or disperse special nuclear material. The performance measure used in the analysis is the estimated probability of safeguards system success in countering the adversary based upon a predetermined set of adversary actions. An exemplary problem which includes generated results is presented for a hypothetical nuclear facility. The results illustrate representative information that could be utilized by safeguards decision-makers

Direct Adaptive Control of a Class of Nonlinear Discrete-Time Systems

DEFF Research Database (Denmark)

Bendtsen, Jan Dimon

2004-01-01

In this paper we deal with direct adaptive control of a specific class of discrete-time SISO systems, where the nonlinearities are convex and an upper bound is known. We use a control law based on a linear combination of a set of globally uniformly bounded basis functions with compact support, wh...

Theoretical foundation for the discrete dynamics of physicochemical systems: Chaos, self-organization, time and space in complex systems

Directory of Open Access Journals (Sweden)

V. Gontar

1997-01-01

Full Text Available A new theoretical foundation for the discrete dynamics of physicochemical systems is presented. Based on the analogy between the π-theorem of the theory of dimensionality, the second law of thermodynamics and the stoichiometry of complex physicochemical reactions, basic dynamic equations and an extreme principle were formulated. The meaning of discrete time and space in the proposed equations is discussed. Some results of numerical calculations are presented to demonstrate the potential of the proposed approach to the mathematical simulation of spatiotemporal physicochemical reaction dynamics.

Discrete Curvature Theories and Applications

KAUST Repository

Sun, Xiang

2016-08-25

Discrete Di erential Geometry (DDG) concerns discrete counterparts of notions and methods in di erential geometry. This thesis deals with a core subject in DDG, discrete curvature theories on various types of polyhedral surfaces that are practically important for free-form architecture, sunlight-redirecting shading systems, and face recognition. Modeled as polyhedral surfaces, the shapes of free-form structures may have to satisfy di erent geometric or physical constraints. We study a combination of geometry and physics { the discrete surfaces that can stand on their own, as well as having proper shapes for the manufacture. These proper shapes, known as circular and conical meshes, are closely related to discrete principal curvatures. We study curvature theories that make such surfaces possible. Shading systems of freeform building skins are new types of energy-saving structures that can re-direct the sunlight. From these systems, discrete line congruences across polyhedral surfaces can be abstracted. We develop a new curvature theory for polyhedral surfaces equipped with normal congruences { a particular type of congruences de ned by linear interpolation of vertex normals. The main results are a discussion of various de nitions of normality, a detailed study of the geometry of such congruences, and a concept of curvatures and shape operators associated with the faces of a triangle mesh. These curvatures are compatible with both normal congruences and the Steiner formula. In addition to architecture, we consider the role of discrete curvatures in face recognition. We use geometric measure theory to introduce the notion of asymptotic cones associated with a singular subspace of a Riemannian manifold, which is an extension of the classical notion of asymptotic directions. We get a simple expression of these cones for polyhedral surfaces, as well as convergence and approximation theorems. We use the asymptotic cones as facial descriptors and demonstrate the

On mixing property in set-valued discrete systems

International Nuclear Information System (INIS)

Gu Rongbao; Guo Wenjing

2006-01-01

Let (X,d) be a compact metric space and f:X->X be a continuous map. Let (K(X),H) be the space of all non-empty compact subsets of X endowed with the Hausdorff metric induced by d and f-bar :K(X)->K(X) be the map defined by f-bar (A):{f(a):a-bar A}. In this paper we investigate the relationships between the mixing property of (K(X),f-bar ) and the mixing property of (X,f). In addition, we discuss specification for the set-valued discrete dynamical system (K(X),f-bar )

Robust Moving Horizon H∞ Control of Discrete Time-Delayed Systems with Interval Time-Varying Delays

Directory of Open Access Journals (Sweden)

F. Yıldız Tascikaraoglu

2014-01-01

Full Text Available In this study, design of a delay-dependent type moving horizon state-feedback control (MHHC is considered for a class of linear discrete-time system subject to time-varying state delays, norm-bounded uncertainties, and disturbances with bounded energies. The closed-loop robust stability and robust performance problems are considered to overcome the instability and poor disturbance rejection performance due to the existence of parametric uncertainties and time-delay appeared in the system dynamics. Utilizing a discrete-time Lyapunov-Krasovskii functional, some delay-dependent linear matrix inequality (LMI based conditions are provided. It is shown that if one can find a feasible solution set for these LMI conditions iteratively at each step of run-time, then we can construct a control law which guarantees the closed-loop asymptotic stability, maximum disturbance rejection performance, and closed-loop dissipativity in view of the actuator limitations. Two numerical examples with simulations on a nominal and uncertain discrete-time, time-delayed systems, are presented at the end, in order to demonstrate the efficiency of the proposed method.

Property - preserving convergent sequences of invariant sets for linear discrete - time systems

NARCIS (Netherlands)

Athanasopoulos, N.; Lazar, M.; Bitsoris, G.

2014-01-01

Abstract: New sequences of monotonically increasing sets are introduced, for linear discrete-time systems subject to input and state constraints. The elements of the set sequences are controlled invariant and admissible regions of stabilizability. They are generated from the iterative application of

Polynomial algebra of discrete models in systems biology.

Science.gov (United States)

Veliz-Cuba, Alan; Jarrah, Abdul Salam; Laubenbacher, Reinhard

2010-07-01

An increasing number of discrete mathematical models are being published in Systems Biology, ranging from Boolean network models to logical models and Petri nets. They are used to model a variety of biochemical networks, such as metabolic networks, gene regulatory networks and signal transduction networks. There is increasing evidence that such models can capture key dynamic features of biological networks and can be used successfully for hypothesis generation. This article provides a unified framework that can aid the mathematical analysis of Boolean network models, logical models and Petri nets. They can be represented as polynomial dynamical systems, which allows the use of a variety of mathematical tools from computer algebra for their analysis. Algorithms are presented for the translation into polynomial dynamical systems. Examples are given of how polynomial algebra can be used for the model analysis. alanavc@vt.edu Supplementary data are available at Bioinformatics online.

Controlling the chaotic discrete-Hénon system using a feedforward neural network with an adaptive learning rate

OpenAIRE

GÖKCE, Kürşad; UYAROĞLU, Yılmaz

2013-01-01

This paper proposes a feedforward neural network-based control scheme to control the chaotic trajectories of a discrete-Hénon map in order to stay within an acceptable distance from the stable fixed point. An adaptive learning back propagation algorithm with online training is employed to improve the effectiveness of the proposed method. The simulation study carried in the discrete-Hénon system verifies the validity of the proposed control system.

ON THE ANISOTROPIC NORM OF DISCRETE TIME STOCHASTIC SYSTEMS WITH STATE DEPENDENT NOISE

Directory of Open Access Journals (Sweden)

Isaac Yaesh

2013-01-01

Full Text Available The purpose of this paper is to determine conditions for the bound-edness of the anisotropic norm of discrete-time linear stochastic sys-tems with state dependent noise. It is proved that these conditions canbe expressed in terms of the feasibility of a specific system of matrixinequalities.

Reliable gain-scheduled control of discrete-time systems and its application to CSTR model

Science.gov (United States)

Sakthivel, R.; Selvi, S.; Mathiyalagan, K.; Shi, Y.

2016-10-01

This paper is focused on reliable gain-scheduled controller design for a class of discrete-time systems with randomly occurring nonlinearities and actuator fault. Further, the nonlinearity in the system model is assumed to occur randomly according to a Bernoulli distribution with measurable time-varying probability in real time. The main purpose of this paper is to design a gain-scheduled controller by implementing a probability-dependent Lyapunov function and linear matrix inequality (LMI) approach such that the closed-loop discrete-time system is stochastically stable for all admissible randomly occurring nonlinearities. The existence conditions for the reliable controller is formulated in terms of LMI constraints. Finally, the proposed reliable gain-scheduled control scheme is applied on continuously stirred tank reactor model to demonstrate the effectiveness and applicability of the proposed design technique.

Bifurcation and complex dynamics of a discrete-time predator-prey system involving group defense

Directory of Open Access Journals (Sweden)

S. M. Sohel Rana

2015-09-01

Full Text Available In this paper, we investigate the dynamics of a discrete-time predator-prey system involving group defense. The existence and local stability of positive fixed point of the discrete dynamical system is analyzed algebraically. It is shown that the system undergoes a flip bifurcation and a Neimark-Sacker bifurcation in the interior of R+2 by using bifurcation theory. Numerical simulation results not only show the consistence with the theoretical analysis but also display the new and interesting dynamical behaviors, including phase portraits, period-7, 20-orbits, attracting invariant circle, cascade of period-doubling bifurcation from period-20 leading to chaos, quasi-periodic orbits, and sudden disappearance of the chaotic dynamics and attracting chaotic set. The Lyapunov exponents are numerically computed to characterize the complexity of the dynamical behaviors.

Discrete Wavelet Transform for Fault Locations in Underground Distribution System

Science.gov (United States)

Apisit, C.; Ngaopitakkul, A.

2010-10-01

In this paper, a technique for detecting faults in underground distribution system is presented. Discrete Wavelet Transform (DWT) based on traveling wave is employed in order to detect the high frequency components and to identify fault locations in the underground distribution system. The first peak time obtained from the faulty bus is employed for calculating the distance of fault from sending end. The validity of the proposed technique is tested with various fault inception angles, fault locations and faulty phases. The result is found that the proposed technique provides satisfactory result and will be very useful in the development of power systems protection scheme.

Minimax approach problem with incomplete information for the two-level hierarchical discrete-time dynamical system

Energy Technology Data Exchange (ETDEWEB)

Shorikov, A. F. [Ural Federal University, 19 S. Mira, Ekaterinburg, 620002, Russia and Institute of Mathematics and Mechanics, Ural Division of Russian Academy of Sciences, 16 S. Kovalevskaya, Ekaterinburg, 620990 (Russian Federation)

2014-11-18

We consider a discrete-time dynamical system consisting of three controllable objects. The motions of all objects are given by the corresponding vector linear or convex discrete-time recurrent vector relations, and control system for its has two levels: basic (first or I level) that is dominating and subordinate level (second or II level) and both have different criterions of functioning and united a priori by determined informational and control connections defined in advance. For the dynamical system in question, we propose a mathematical formalization in the form of solving a multistep problem of two-level hierarchical minimax program control over the terminal approach process with incomplete information and give a general scheme for its solution.

A Model of Discrete-Continuum Time for a Simple Physical System

Directory of Open Access Journals (Sweden)

Karimov A. R.

2008-04-01

Full Text Available Proceeding from the assumption that the time flow of an individual object is a real physical value, in the framework of a physical kinetics approach we propose an analogy between time and temperature. The use of such an analogy makes it possible to work out a discrete-continuum model of time for a simple physical system. The possible physical properties of time for the single object and time for the whole system are discussed.

Robust stability and ℋ ∞ -estimation for uncertain discrete systems with state-delay

Directory of Open Access Journals (Sweden)

Mahmoud Magdi S.

2001-01-01

Full Text Available In this paper, we investigate the problems of robust stability and ℋ ∞ -estimation for a class of linear discrete-time systems with time-varying norm-bounded parameter uncertainty and unknown state-delay. We provide complete results for robust stability with prescribed performance measure and establish a version of the discrete Bounded Real Lemma. Then, we design a linear estimator such that the estimation error dynamics is robustly stable with a guaranteed ℋ ∞ -performance irrespective of the parameteric uncertainties and unknown state delays. A numerical example is worked out to illustrate the developed theory.

Perfect discretization of path integrals

OpenAIRE

Steinhaus, Sebastian

2011-01-01

In order to obtain a well-defined path integral one often employs discretizations. In the case of General Relativity these generically break diffeomorphism symmetry, which has severe consequences since these symmetries determine the dynamics of the corresponding system. In this article we consider the path integral of reparametrization invariant systems as a toy example and present an improvement procedure for the discretized propagator. Fixed points and convergence of the procedure are discu...

Discretization-induced delays and their role in the dynamics

International Nuclear Information System (INIS)

Ramani, A; Grammaticos, B; Satsuma, J; Willox, R

2008-01-01

We show that a discretization of a continuous system may entail 'hidden' delays and thus introduce instabilities. In this case, while the continuous system has an attractive fixed point, the instabilities present in the equivalent discrete one may lead to the appearance of a limit cycle. We explain that it is possible, thanks to the proper staggering of the discrete variables, to eliminate the hidden delay. However, in general, other instabilities may appear in the discrete system which can even lead to chaotic behaviour

Discrete Displacement Hydraulic Power Take-Off System for the Wavestar Wave Energy Converter

Directory of Open Access Journals (Sweden)

Enrique Vidal

2013-08-01

Full Text Available The Wavestar Wave Energy Converter (WEC is a multiple absorber concept, consisting of 20 hemisphere shaped floats attached to a single platform. The heart of the Wavestar WEC is the Power Take-Off (PTO system, converting the wave induced motion of the floats into a steady power output to the grid. In the present work, a PTO based on a novel discrete displacement fluid power technology is explored for the Wavestar WEC. Absorption of power from the floats is performed by hydraulic cylinders, supplying power to a common fixed pressure system with accumulators for energy smoothing. The stored pressure energy is converted into electricity at a steady pace by hydraulic motors and generators. The storage, thereby, decouples the complicated process of wave power absorption from power generation. The core for enabling this PTO technology is implementing a near loss-free force control of the energy absorbing cylinders. This is achieved by using special multi-chambered cylinders, where the different chambers may be connected to the available system pressures using fast on/off valves. Resultantly, a Discrete Displacement Cylinder (DDC is created, allowing near loss free discrete force control. This paper presents a complete PTO system for a 20 float Wavestar based on the DDC. The WEC and PTO is rigorously modeled from incident waves to the electric output to the grid. The resulting model of +600 states is simulated in different irregular seas, showing that power conversion efficiencies above 70% from input power to electrical power is achievable for all relevant sea conditions.

A high precision dual feedback discrete control system designed for satellite trajectory simulator

Science.gov (United States)

Liu, Ximin; Liu, Liren; Sun, Jianfeng; Xu, Nan

2005-08-01

Cooperating with the free-space laser communication terminals, the satellite trajectory simulator is used to test the acquisition, pointing, tracking and communicating performances of the terminals. So the satellite trajectory simulator plays an important role in terminal ground test and verification. Using the double-prism, Sun etc in our group designed a satellite trajectory simulator. In this paper, a high precision dual feedback discrete control system designed for the simulator is given and a digital fabrication of the simulator is made correspondingly. In the dual feedback discrete control system, Proportional- Integral controller is used in velocity feedback loop and Proportional- Integral- Derivative controller is used in position feedback loop. In the controller design, simplex method is introduced and an improvement to the method is made. According to the transfer function of the control system in Z domain, the digital fabrication of the simulator is given when it is exposed to mechanism error and moment disturbance. Typically, when the mechanism error is 100urad, the residual standard error of pitching angle, azimuth angle, x-coordinate position and y-coordinate position are 0.49urad, 6.12urad, 4.56urad, 4.09urad respectively. When the moment disturbance is 0.1rad, the residual standard error of pitching angle, azimuth angle, x-coordinate position and y-coordinate position are 0.26urad, 0.22urad, 0.16urad, 0.15urad respectively. The digital fabrication results demonstrate that the dual feedback discrete control system designed for the simulator can achieve the anticipated high precision performance.

Fractional equations of kicked systems and discrete maps

International Nuclear Information System (INIS)

Tarasov, Vasily E; Zaslavsky, George M

2008-01-01

Starting from kicked equations of motion with derivatives of non-integer orders, we obtain 'fractional' discrete maps. These maps are generalizations of well-known universal, standard, dissipative, kicked damped rotator maps. The main property of the suggested fractional maps is a long-term memory. The memory effects in the fractional discrete maps mean that their present state evolution depends on all past states with special forms of weights. These forms are represented by combinations of power-law functions

Discrete event simulation methods applied to advanced importance measures of repairable components in multistate network flow systems

International Nuclear Information System (INIS)

Huseby, Arne B.; Natvig, Bent

2013-01-01

Discrete event models are frequently used in simulation studies to model and analyze pure jump processes. A discrete event model can be viewed as a system consisting of a collection of stochastic processes, where the states of the individual processes change as results of various kinds of events occurring at random points of time. We always assume that each event only affects one of the processes. Between these events the states of the processes are considered to be constant. In the present paper we use discrete event simulation in order to analyze a multistate network flow system of repairable components. In order to study how the different components contribute to the system, it is necessary to describe the often complicated interaction between component processes and processes at the system level. While analytical considerations may throw some light on this, a simulation study often allows the analyst to explore more details. By producing stable curve estimates for the development of the various processes, one gets a much better insight in how such systems develop over time. These methods are particulary useful in the study of advanced importancez measures of repairable components. Such measures can be very complicated, and thus impossible to calculate analytically. By using discrete event simulations, however, this can be done in a very natural and intuitive way. In particular significant differences between the Barlow–Proschan measure and the Natvig measure in multistate network flow systems can be explored

Discrete symmetries and de Sitter spacetime

Energy Technology Data Exchange (ETDEWEB)

Cotăescu, Ion I., E-mail: gpascu@physics.uvt.ro; Pascu, Gabriel, E-mail: gpascu@physics.uvt.ro [West University of Timişoara, V. Pârvan Ave. 4, RO-300223 Timişoara (Romania)

2014-11-24

Aspects of the ambiguity in defining quantum modes on de Sitter spacetime using a commuting system composed only of differential operators are discussed. Discrete symmetries and their actions on the wavefunction in commonly used coordinate charts are reviewed. It is argued that the system of commuting operators can be supplemented by requiring the invariance of the wavefunction to combined discrete symmetries- a criterion which selects a single state out of the α-vacuum family. Two such members of this family are singled out by particular combined discrete symmetries- states between which exists a well-known thermality relation.

Frequency interval balanced truncation of discrete-time bilinear systems

DEFF Research Database (Denmark)

Jazlan, Ahmad; Sreeram, Victor; Shaker, Hamid Reza

2016-01-01

This paper presents the development of a new model reduction method for discrete-time bilinear systems based on the balanced truncation framework. In many model reduction applications, it is advantageous to analyze the characteristics of the system with emphasis on particular frequency intervals...... are the solution to a pair of new generalized Lyapunov equations. The conditions for solvability of these new generalized Lyapunov equations are derived and a numerical solution method for solving these generalized Lyapunov equations is presented. Numerical examples which illustrate the usage of the new...... generalized frequency interval controllability and observability gramians as part of the balanced truncation framework are provided to demonstrate the performance of the proposed method....

Discrete Feature Model (DFM) User Documentation

Energy Technology Data Exchange (ETDEWEB)

Geier, Joel (Clearwater Hardrock Consulting, Corvallis, OR (United States))

2008-06-15

This manual describes the Discrete-Feature Model (DFM) software package for modelling groundwater flow and solute transport in networks of discrete features. A discrete-feature conceptual model represents fractures and other water-conducting features around a repository as discrete conductors surrounded by a rock matrix which is usually treated as impermeable. This approximation may be valid for crystalline rocks such as granite or basalt, which have very low permeability if macroscopic fractures are excluded. A discrete feature is any entity that can conduct water and permit solute transport through bedrock, and can be reasonably represented as a piecewise-planar conductor. Examples of such entities may include individual natural fractures (joints or faults), fracture zones, and disturbed-zone features around tunnels (e.g. blasting-induced fractures or stress-concentration induced 'onion skin' fractures around underground openings). In a more abstract sense, the effectively discontinuous nature of pathways through fractured crystalline bedrock may be idealized as discrete, equivalent transmissive features that reproduce large-scale observations, even if the details of connective paths (and unconnected domains) are not precisely known. A discrete-feature model explicitly represents the fundamentally discontinuous and irregularly connected nature of systems of such systems, by constraining flow and transport to occur only within such features and their intersections. Pathways for flow and solute transport in this conceptualization are a consequence not just of the boundary conditions and hydrologic properties (as with continuum models), but also the irregularity of connections between conductive/transmissive features. The DFM software package described here is an extensible code for investigating problems of flow and transport in geological (natural or human-altered) systems that can be characterized effectively in terms of discrete features. With this

Discrete Feature Model (DFM) User Documentation

International Nuclear Information System (INIS)

Geier, Joel

2008-06-01

This manual describes the Discrete-Feature Model (DFM) software package for modelling groundwater flow and solute transport in networks of discrete features. A discrete-feature conceptual model represents fractures and other water-conducting features around a repository as discrete conductors surrounded by a rock matrix which is usually treated as impermeable. This approximation may be valid for crystalline rocks such as granite or basalt, which have very low permeability if macroscopic fractures are excluded. A discrete feature is any entity that can conduct water and permit solute transport through bedrock, and can be reasonably represented as a piecewise-planar conductor. Examples of such entities may include individual natural fractures (joints or faults), fracture zones, and disturbed-zone features around tunnels (e.g. blasting-induced fractures or stress-concentration induced 'onion skin' fractures around underground openings). In a more abstract sense, the effectively discontinuous nature of pathways through fractured crystalline bedrock may be idealized as discrete, equivalent transmissive features that reproduce large-scale observations, even if the details of connective paths (and unconnected domains) are not precisely known. A discrete-feature model explicitly represents the fundamentally discontinuous and irregularly connected nature of systems of such systems, by constraining flow and transport to occur only within such features and their intersections. Pathways for flow and solute transport in this conceptualization are a consequence not just of the boundary conditions and hydrologic properties (as with continuum models), but also the irregularity of connections between conductive/transmissive features. The DFM software package described here is an extensible code for investigating problems of flow and transport in geological (natural or human-altered) systems that can be characterized effectively in terms of discrete features. With this software, the

Design of a Discrete Tracking Controller for a Magnetic Levitation System: A Nonlinear Rational Model Approach

Directory of Open Access Journals (Sweden)

Fernando Gómez-Salas

2015-01-01

Full Text Available This work proposes a discrete-time nonlinear rational approximate model for the unstable magnetic levitation system. Based on this model and as an application of the input-output linearization technique, a discrete-time tracking control design will be derived using the corresponding classical state space representation of the model. A simulation example illustrates the efficiency of the proposed methodology.

Avoidance of transmission line pressure oscillations in discrete hydraulic systems – by shaping of valve opening characteristics

DEFF Research Database (Denmark)

Hansen, Anders Hedegaard; Pedersen, Henrik C.; Bech, Michael Møller

2015-01-01

The architecture of multi pressure line discrete fluid power force systems imposes rapid pressure shifts in the actuator volumes. These fast shifts between pressure levels often introduce pressure oscillations in the actuator chamber and connecting pipes. The topic of this paper is to perform...... pressure shifts by changing the connection between various fixed pressure lines without introducing significant pressure oscillation. As a case study a discrete force system is utilised is a Power Take Off(PTO) system of a wave energy converter. Four pressure shifting algorithms are proposed...

Discrete Routh reduction

International Nuclear Information System (INIS)

Jalnapurkar, Sameer M; Leok, Melvin; Marsden, Jerrold E; West, Matthew

2006-01-01

This paper develops the theory of Abelian Routh reduction for discrete mechanical systems and applies it to the variational integration of mechanical systems with Abelian symmetry. The reduction of variational Runge-Kutta discretizations is considered, as well as the extent to which symmetry reduction and discretization commute. These reduced methods allow the direct simulation of dynamical features such as relative equilibria and relative periodic orbits that can be obscured or difficult to identify in the unreduced dynamics. The methods are demonstrated for the dynamics of an Earth orbiting satellite with a non-spherical J 2 correction, as well as the double spherical pendulum. The J 2 problem is interesting because in the unreduced picture, geometric phases inherent in the model and those due to numerical discretization can be hard to distinguish, but this issue does not appear in the reduced algorithm, where one can directly observe interesting dynamical structures in the reduced phase space (the cotangent bundle of shape space), in which the geometric phases have been removed. The main feature of the double spherical pendulum example is that it has a non-trivial magnetic term in its reduced symplectic form. Our method is still efficient as it can directly handle the essential non-canonical nature of the symplectic structure. In contrast, a traditional symplectic method for canonical systems could require repeated coordinate changes if one is evoking Darboux' theorem to transform the symplectic structure into canonical form, thereby incurring additional computational cost. Our method allows one to design reduced symplectic integrators in a natural way, despite the non-canonical nature of the symplectic structure

Supervisory control synthesis of discrete-event systems using a coordination scheme

Czech Academy of Sciences Publication Activity Database

Komenda, Jan; Masopust, Tomáš; van Schuppen, J. H.

2012-01-01

Roč. 48, č. 2 (2012), s. 247-254 ISSN 0005-1098 R&D Projects: GA ČR(CZ) GAP103/11/0517; GA ČR GPP202/11/P028 Grant - others:European Commission(XE) EU.ICT.DISC 224498 Institutional research plan: CEZ:AV0Z10190503 Keywords : discrete-event systems * supervisory control * distributed control * closed-loop systems * controllability Subject RIV: BA - General Mathematics Impact factor: 2.919, year: 2012 http://www.sciencedirect.com/science/article/pii/S0005109811005395

Supervisory control synthesis of discrete-event systems using a coordination scheme

Czech Academy of Sciences Publication Activity Database

Komenda, Jan; Masopust, Tomáš; van Schuppen, J. H.

2012-01-01

Roč. 48, č. 2 (2012), s. 247-254 ISSN 0005-1098 R&D Projects: GA ČR(CZ) GAP103/11/0517; GA ČR GPP202/11/P028 Grant - others:European Commission(XE) EU. ICT .DISC 224498 Institutional research plan: CEZ:AV0Z10190503 Keywords : discrete-event systems * supervisory control * distributed control * closed-loop systems * controllability Subject RIV: BA - General Mathematics Impact factor: 2.919, year: 2012 http://www.sciencedirect.com/science/article/pii/S0005109811005395

Design of Experiment Using Simulation of a Discrete Dynamical System

Directory of Open Access Journals (Sweden)

Mašek Jan

2016-12-01

Full Text Available The topic of the presented paper is a promising approach to achieve optimal Design of Experiment (DoE, i.e. spreading of points within a design domain, using a simulation of a discrete dynamical system of interacting particles within an n-dimensional design space. The system of mutually repelling particles represents a physical analogy of the Audze-Eglājs (AE optimization criterion and its periodical modification (PAE, respectively. The paper compares the performance of two approaches to implementation: a single-thread process using the JAVA language environment and a massively parallel solution employing the nVidia CUDA platform.

A simple method of chaos control for a class of chaotic discrete-time systems

International Nuclear Information System (INIS)

Jiang Guoping; Zheng Weixing

2005-01-01

In this paper, a simple method is proposed for chaos control for a class of discrete-time chaotic systems. The proposed method is built upon the state feedback control and the characteristic of ergodicity of chaos. The feedback gain matrix of the controller is designed using a simple criterion, so that control parameters can be selected via the pole placement technique of linear control theory. The new controller has a feature that it only uses the state variable for control and does not require the target equilibrium point in the feedback path. Moreover, the proposed control method cannot only overcome the so-called 'odd eigenvalues number limitation' of delayed feedback control, but also control the chaotic systems to the specified equilibrium points. The effectiveness of the proposed method is demonstrated by a two-dimensional discrete-time chaotic system

Discrete Chebyshev nets and a universal permutability theorem

International Nuclear Information System (INIS)

Schief, W K

2007-01-01

The Pohlmeyer-Lund-Regge system which was set down independently in the contexts of Lagrangian field theories and the relativistic motion of a string and which played a key role in the development of a geometric interpretation of soliton theory is known to appear in a variety of important guises such as the vectorial Lund-Regge equation, the O(4) nonlinear σ-model and the SU(2) chiral model. Here, it is demonstrated that these avatars may be discretized in such a manner that both integrability and equivalence are preserved. The corresponding discretization procedure is geometric and algebraic in nature and based on discrete Chebyshev nets and generalized discrete Lelieuvre formulae. In connection with the derivation of associated Baecklund transformations, it is shown that a generalized discrete Lund-Regge equation may be interpreted as a universal permutability theorem for integrable equations which admit commuting matrix Darboux transformations acting on su(2) linear representations. Three-dimensional coordinate systems and lattices of 'Lund-Regge' type related to particular continuous and discrete Zakharov-Manakov systems are obtained as a by-product of this analysis

Robust uniform persistence in discrete and continuous dynamical systems using Lyapunov exponents.

Science.gov (United States)

Salceanu, Paul L

2011-07-01

This paper extends the work of Salceanu and Smith [12, 13] where Lyapunov exponents were used to obtain conditions for uniform persistence ina class of dissipative discrete-time dynamical systems on the positive orthant of R(m), generated by maps. Here a united approach is taken, for both discrete and continuous time, and the dissipativity assumption is relaxed. Sufficient conditions are given for compact subsets of an invariant part of the boundary of R(m+) to be robust uniform weak repellers. These conditions require Lyapunov exponents be positive on such sets. It is shown how this leads to robust uniform persistence. The results apply to the investigation of robust uniform persistence of the disease in host populations, as shown in an application.

TQ-bifurcations in discrete dynamical systems: Analysis of qualitative rearrangements of the oscillation mode

Energy Technology Data Exchange (ETDEWEB)

Makarenko, A. V., E-mail: avm.science@mail.ru [Constructive Cybernetics Research Group (Russian Federation)

2016-10-15

A new class of bifurcations is defined in discrete dynamical systems, and methods for their diagnostics and the analysis of their properties are presented. The TQ-bifurcations considered are implemented in discrete mappings and are related to the qualitative rearrangement of the shape of trajectories in an extended space of states. Within the demonstration of the main capabilities of the toolkit, an analysis is carried out of a logistic mapping in a domain to the right of the period-doubling limit point. Five critical values of the parameter are found for which the geometric structure of the trajectories of the mapping experiences a qualitative rearrangement. In addition, an analysis is carried out of the so-called “trace map,” which arises in the problems of quantum-mechanical description of various properties of discrete crystalline and quasicrystalline lattices.

A scheme for designing extreme multistable discrete dynamical ...

Indian Academy of Sciences (India)

A scheme for designing extreme multistable discrete dynamical systems ... Abstract. In this paper, we propose a scheme for designing discrete extreme multistable systems coupling two identical dynamical systems. Existence ... Department of Applied Mathematics, University of Calcutta, 92 APC Road, Kolkata 700 009, India ...

Minimum Energy Control of 2D Positive Continuous-Discrete Linear Systems

Directory of Open Access Journals (Sweden)

Kaczorek Tadeusz

2014-09-01

Full Text Available The minimum energy control problem for the 2D positive continuous-discrete linear systems is formulated and solved. Necessary and sufficient conditions for the reachability at the point of the systems are given. Sufficient conditions for the existence of solution to the problem are established. It is shown that if the system is reachable then there exists an optimal input that steers the state from zero boundary conditions to given final state and minimizing the performance index for only one step (q = 1. A procedure for solving of the problem is proposed and illustrated by a numerical example.

Six-component semi-discrete integrable nonlinear Schrödinger system

Science.gov (United States)

Vakhnenko, Oleksiy O.

2018-01-01

We suggest the six-component integrable nonlinear system on a quasi-one-dimensional lattice. Due to its symmetrical form, the general system permits a number of reductions; one of which treated as the semi-discrete integrable nonlinear Schrödinger system on a lattice with three structural elements in the unit cell is considered in considerable details. Besides six truly independent basic field variables, the system is characterized by four concomitant fields whose background values produce three additional types of inter-site resonant interactions between the basic fields. As a result, the system dynamics becomes associated with the highly nonstandard form of Poisson structure. The elementary Poisson brackets between all field variables are calculated and presented explicitly. The richness of system dynamics is demonstrated on the multi-component soliton solution written in terms of properly parameterized soliton characteristics.

An improved harmony search algorithm for synchronization of discrete-time chaotic systems

International Nuclear Information System (INIS)

Santos Coelho, Leandro dos; Andrade Bernert, Diego Luis de

2009-01-01

The harmony search (HS) algorithm is a recently developed meta-heuristic algorithm, and has been very successful in a wide variety of optimization problems. HS was conceptualized using an analogy with music improvisation process where music players improvise the pitches of their instruments to obtain better harmony. The HS algorithm does not require initial values and uses a random search instead of a gradient search, so derivative information is unnecessary. Furthermore, the HS algorithm is simple in concept, few in parameters, easy in implementation, imposes fewer mathematical requirements, and does not require initial value settings of the decision variables. In recent years, the investigation of synchronization and control problem for discrete chaotic systems has attracted much attention, and many possible applications. The tuning of a proportional-integral-derivative (PID) controller based on an improved HS (IHS) algorithm for synchronization of two identical discrete chaotic systems subject the different initial conditions is investigated in this paper. Simulation results of the IHS to determine the PID parameters to synchronization of two Henon chaotic systems are compared with other HS approaches including classical HS and global-best HS. Numerical results reveal that the proposed IHS method is a powerful search and controller design optimization tool for synchronization of chaotic systems.

Discrete Bose-Einstein systems in a box with low adiabatic invariant

International Nuclear Information System (INIS)

Vlad, V.I.; Ionescu-Pallas, N.

2002-03-01

The Bose-Einstein energy spectrum of a quantum gas, confined in a (cubic) box, is discrete and strongly dependent on the box geometry and temperature, for low product of the atomic mass number, A at and the adiabatic invariant, TV 2/3 , i.e. on γ=A at TV 2/3 . Even within the approximation of noninteracting particles in the gas, the calculation of the thermodynamic properties of Bose-Einstein systems turns out to be a difficult mathematical problem. It is solved in the textbooks and most papers by approximating the sums by integrals. The present study compares the total number of particles and the total energy obtained by summing up the exact contributions of the eigenvalues and their weights, for defined values of γ, to the results of the approximate integrals. Then, the passage from sums to integrals is done in a more rigorous manner and better analytical approximations are found. The corrected thermodynamic functions depend on γ. The critical temperature is corrected also in order to describe more accurately the discrete Bose-Einstein systems and their onset of the phase transition. (author)

Computational Techniques for Model Predictive Control of Large-Scale Systems with Continuous-Valued and Discrete-Valued Inputs

Directory of Open Access Journals (Sweden)

Koichi Kobayashi

2013-01-01

Full Text Available We propose computational techniques for model predictive control of large-scale systems with both continuous-valued control inputs and discrete-valued control inputs, which are a class of hybrid systems. In the proposed method, we introduce the notion of virtual control inputs, which are obtained by relaxing discrete-valued control inputs to continuous variables. In online computation, first, we find continuous-valued control inputs and virtual control inputs minimizing a cost function. Next, using the obtained virtual control inputs, only discrete-valued control inputs at the current time are computed in each subsystem. In addition, we also discuss the effect of quantization errors. Finally, the effectiveness of the proposed method is shown by a numerical example. The proposed method enables us to reduce and decentralize the computation load.

Allee effect in a discrete-time predator-prey system

International Nuclear Information System (INIS)

Celik, Canan; Duman, Oktay

2009-01-01

In this paper, we study the stability of a discrete-time predator-prey system with and without Allee effect. By analyzing both systems, we first obtain local stability conditions of the equilibrium points without the Allee effect and then exhibit the impact of the Allee effect on stability when it is imposed on prey population. We also show the stabilizing effect of Allee effect by numerical simulations and verify that when the prey population is subject to an Allee effect, the trajectory of the solutions approximates to the corresponding equilibrium point much faster. Furthermore, for some fixed parameter values satisfying necessary conditions, we show that the corresponding equilibrium point moves from instability to stability under the Allee effect on prey population.

Discrete optimization of isolator locations for vibration isolation systems: An analytical and experimental investigation

Energy Technology Data Exchange (ETDEWEB)

Ponslet, E.R.; Eldred, M.S. [Sandia National Labs., Albuquerque, NM (United States). Structural Dynamics Dept.

1996-05-17

An analytical and experimental study is conducted to investigate the effect of isolator locations on the effectiveness of vibration isolation systems. The study uses isolators with fixed properties and evaluates potential improvements to the isolation system that can be achieved by optimizing isolator locations. Because the available locations for the isolators are discrete in this application, a Genetic Algorithm (GA) is used as the optimization method. The system is modeled in MATLAB{trademark} and coupled with the GA available in the DAKOTA optimization toolkit under development at Sandia National Laboratories. Design constraints dictated by hardware and experimental limitations are implemented through penalty function techniques. A series of GA runs reveal difficulties in the search on this heavily constrained, multimodal, discrete problem. However, the GA runs provide a variety of optimized designs with predicted performance from 30 to 70 times better than a baseline configuration. An alternate approach is also tested on this problem: it uses continuous optimization, followed by rounding of the solution to neighboring discrete configurations. Results show that this approach leads to either infeasible or poor designs. Finally, a number of optimized designs obtained from the GA searches are tested in the laboratory and compared to the baseline design. These experimental results show a 7 to 46 times improvement in vibration isolation from the baseline configuration.

Geometry and Hamiltonian mechanics on discrete spaces

NARCIS (Netherlands)

Talasila, V.; Clemente Gallardo, J.J.; Clemente-Gallardo, J.; van der Schaft, Arjan

2004-01-01

Numerical simulation is often crucial for analysing the behaviour of many complex systems which do not admit analytic solutions. To this end, one either converts a 'smooth' model into a discrete (in space and time) model, or models systems directly at a discrete level. The goal of this paper is to

Baecklund transformations for discrete Painleve equations: Discrete PII-PV

International Nuclear Information System (INIS)

Sakka, A.; Mugan, U.

2006-01-01

Transformation properties of discrete Painleve equations are investigated by using an algorithmic method. This method yields explicit transformations which relates the solutions of discrete Painleve equations, discrete P II -P V , with different values of parameters. The particular solutions which are expressible in terms of the discrete analogue of the classical special functions of discrete Painleve equations can also be obtained from these transformations

Integrals of Motion for Discrete-Time Optimal Control Problems

OpenAIRE

Torres, Delfim F. M.

2003-01-01

We obtain a discrete time analog of E. Noether's theorem in Optimal Control, asserting that integrals of motion associated to the discrete time Pontryagin Maximum Principle can be computed from the quasi-invariance properties of the discrete time Lagrangian and discrete time control system. As corollaries, results for first-order and higher-order discrete problems of the calculus of variations are obtained.

Systemic characterization and evaluation of particle packings as initial sets for discrete element simulations

Science.gov (United States)

Morfa, Carlos Recarey; Cortés, Lucía Argüelles; Farias, Márcio Muniz de; Morales, Irvin Pablo Pérez; Valera, Roberto Roselló; Oñate, Eugenio

2018-07-01

A methodology that comprises several characterization properties for particle packings is proposed in this paper. The methodology takes into account factors such as dimension and shape of particles, space occupation, homogeneity, connectivity and isotropy, among others. This classification and integration of several properties allows to carry out a characterization process to systemically evaluate the particle packings in order to guarantee the quality of the initial meshes in discrete element simulations, in both the micro- and the macroscales. Several new properties were created, and improvements in existing ones are presented. Properties from other disciplines were adapted to be used in the evaluation of particle systems. The methodology allows to easily characterize media at the level of the microscale (continuous geometries—steels, rocks microstructures, etc., and discrete geometries) and the macroscale. A global, systemic and integral system for characterizing and evaluating particle sets, based on fuzzy logic, is presented. Such system allows researchers to have a unique evaluation criterion based on the aim of their research. Examples of applications are shown.

Systemic characterization and evaluation of particle packings as initial sets for discrete element simulations

Science.gov (United States)

Morfa, Carlos Recarey; Cortés, Lucía Argüelles; Farias, Márcio Muniz de; Morales, Irvin Pablo Pérez; Valera, Roberto Roselló; Oñate, Eugenio

2017-10-01

A methodology that comprises several characterization properties for particle packings is proposed in this paper. The methodology takes into account factors such as dimension and shape of particles, space occupation, homogeneity, connectivity and isotropy, among others. This classification and integration of several properties allows to carry out a characterization process to systemically evaluate the particle packings in order to guarantee the quality of the initial meshes in discrete element simulations, in both the micro- and the macroscales. Several new properties were created, and improvements in existing ones are presented. Properties from other disciplines were adapted to be used in the evaluation of particle systems. The methodology allows to easily characterize media at the level of the microscale (continuous geometries—steels, rocks microstructures, etc., and discrete geometries) and the macroscale. A global, systemic and integral system for characterizing and evaluating particle sets, based on fuzzy logic, is presented. Such system allows researchers to have a unique evaluation criterion based on the aim of their research. Examples of applications are shown.

Geometry and Hamiltonian mechanics on discrete spaces

NARCIS (Netherlands)

Talasila, V.; Clemente-Gallardo, J.; Schaft, A.J. van der

2004-01-01

Numerical simulation is often crucial for analysing the behaviour of many complex systems which do not admit analytic solutions. To this end, one either converts a ‘smooth’ model into a discrete (in space and time) model, or models systems directly at a discrete level. The goal of this paper is to

Characterization of the Nencki Affective Picture System by discrete emotional categories (NAPS BE).

Science.gov (United States)

Riegel, Monika; Żurawski, Łukasz; Wierzba, Małgorzata; Moslehi, Abnoss; Klocek, Łukasz; Horvat, Marko; Grabowska, Anna; Michałowski, Jarosław; Jednoróg, Katarzyna; Marchewka, Artur

2016-06-01

The Nencki Affective Picture System (NAPS; Marchewka, Żurawski, Jednoróg, & Grabowska, Behavior Research Methods, 2014) is a standardized set of 1,356 realistic, high-quality photographs divided into five categories (people, faces, animals, objects, and landscapes). NAPS has been primarily standardized along the affective dimensions of valence, arousal, and approach-avoidance, yet the characteristics of discrete emotions expressed by the images have not been investigated thus far. The aim of the present study was to collect normative ratings according to categorical models of emotions. A subset of 510 images from the original NAPS set was selected in order to proportionally cover the whole dimensional affective space. Among these, using three available classification methods, we identified images eliciting distinguishable discrete emotions. We introduce the basic-emotion normative ratings for the Nencki Affective Picture System (NAPS BE), which will allow researchers to control and manipulate stimulus properties specifically for their experimental questions of interest. The NAPS BE system is freely accessible to the scientific community for noncommercial use as supplementary materials to this article.

Distributed-observer-based cooperative control for synchronization of linear discrete-time multi-agent systems.

Science.gov (United States)

Liang, Hongjing; Zhang, Huaguang; Wang, Zhanshan

2015-11-01

This paper considers output synchronization of discrete-time multi-agent systems with directed communication topologies. The directed communication graph contains a spanning tree and the exosystem as its root. Distributed observer-based consensus protocols are proposed, based on the relative outputs of neighboring agents. A multi-step algorithm is presented to construct the observer-based protocols. In light of the discrete-time algebraic Riccati equation and internal model principle, synchronization problem is completed. At last, numerical simulation is provided to verify the effectiveness of the theoretical results. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.

Foundations of a discrete physics

International Nuclear Information System (INIS)

McGoveran, D.; Noyes, P.

1988-01-01

Starting from the principles of finiteness, discreteness, finite computability and absolute nonuniqueness, we develop the ordering operator calculus, a strictly constructive mathematical system having the empirical properties required by quantum mechanical and special relativistic phenomena. We show how to construct discrete distance functions, and both rectangular and spherical coordinate systems(with a discrete version of ''π''). The richest discrete space constructible without a preferred axis and preserving translational and rotational invariance is shown to be a discrete 3-space with the usual symmetries. We introduce a local ordering parameter with local (proper) time-like properties and universal ordering parameters with global (cosmological) time-like properties. Constructed ''attribute velocities'' connect ensembles with attributes that are invariant as the appropriate time-like parameter increases. For each such attribute, we show how to construct attribute velocities which must satisfy the '' relativistic Doppler shift'' and the ''relativistic velocity composition law,'' as well as the Lorentz transformations. By construction, these velocities have finite maximum and minimum values. In the space of all attributes, the minimum of these maximum velocities will predominate in all multiple attribute computations, and hence can be identified as a fundamental limiting velocity, General commutation relations are constructed which under the physical interpretation are shown to reduce to the usual quantum mechanical commutation relations. 50 refs., 18 figs

Optimal Robust Fault Detection for Linear Discrete Time Systems

Directory of Open Access Journals (Sweden)

Nike Liu

2008-01-01

Full Text Available This paper considers robust fault-detection problems for linear discrete time systems. It is shown that the optimal robust detection filters for several well-recognized robust fault-detection problems, such as ℋ−/ℋ∞, ℋ2/ℋ∞, and ℋ∞/ℋ∞ problems, are the same and can be obtained by solving a standard algebraic Riccati equation. Optimal filters are also derived for many other optimization criteria and it is shown that some well-studied and seeming-sensible optimization criteria for fault-detection filter design could lead to (optimal but useless fault-detection filters.

Chaos and its synchronization in two-neuron systems with discrete delays

International Nuclear Information System (INIS)

Zhou Shangbo; Liao Xiaofeng; Yu Juebang; Wong Kwokwo

2004-01-01

It is well known that complex dynamic behaviors exist in time-delayed neural systems. Infinite positive Lyapunov exponents can be found in time-delayed chaotic systems since the dimension of such systems is infinite. However, theoretical and experimental models studied thus far are low dimensional systems with only one positive Lyapunov exponent. Consequently, messages masked by such chaotic systems are shown to be easily extracted in some cases. Therefore, communication system with a higher security level can be design by means of the time-delayed neuron systems. In this paper, we firstly investigate the dynamical behaviors of two-neuron systems with discrete delays. Then, the chaos synchronization in time-delayed neuron system is studied based on the method of designing the coupled system and employing Krasovskii-Lyapunov theory to search the synchronization conditions. Numerical results illustrate the correctness of our theoretical analyses

Fractional-Order Discrete-Time Laguerre Filters: A New Tool for Modeling and Stability Analysis of Fractional-Order LTI SISO Systems

Directory of Open Access Journals (Sweden)

Rafał Stanisławski

2016-01-01

Full Text Available This paper presents new results on modeling and analysis of dynamics of fractional-order discrete-time linear time-invariant single-input single-output (LTI SISO systems by means of new, two-layer, “fractional-order discrete-time Laguerre filters.” It is interesting that the fractionality of the filters at the upper system dynamics layer is directly projected from the lower Laguerre-based approximation layer for the Grünwald-Letnikov difference. A new stability criterion for discrete-time fractional-order Laguerre-based LTI SISO systems is introduced and supplemented with a stability preservation analysis. Both the stability criterion and the stability preservation analysis bring up rather surprising results, which is illustrated with simulation examples.

Switched periodic systems in discrete time: stability and input-output norms

Science.gov (United States)

Bolzern, Paolo; Colaneri, Patrizio

2013-07-01

This paper deals with the analysis of stability and the characterisation of input-output norms for discrete-time periodic switched linear systems. Such systems consist of a network of time-periodic linear subsystems sharing the same state vector and an exogenous switching signal that triggers the jumps between the subsystems. The overall system exhibits a complex dynamic behaviour due to the interplay between the time periodicity of the subsystem parameters and the switching signal. Both arbitrary switching signals and signals satisfying a dwell-time constraint are considered. Linear matrix inequality conditions for stability and guaranteed H2 and H∞ performances are provided. The results heavily rely on the merge of the theory of linear periodic systems and recent developments on switched linear time-invariant systems.

Weak form of Stokes-Dirac structures and geometric discretization of port-Hamiltonian systems

Science.gov (United States)

Kotyczka, Paul; Maschke, Bernhard; Lefèvre, Laurent

2018-05-01

We present the mixed Galerkin discretization of distributed parameter port-Hamiltonian systems. On the prototypical example of hyperbolic systems of two conservation laws in arbitrary spatial dimension, we derive the main contributions: (i) A weak formulation of the underlying geometric (Stokes-Dirac) structure with a segmented boundary according to the causality of the boundary ports. (ii) The geometric approximation of the Stokes-Dirac structure by a finite-dimensional Dirac structure is realized using a mixed Galerkin approach and power-preserving linear maps, which define minimal discrete power variables. (iii) With a consistent approximation of the Hamiltonian, we obtain finite-dimensional port-Hamiltonian state space models. By the degrees of freedom in the power-preserving maps, the resulting family of structure-preserving schemes allows for trade-offs between centered approximations and upwinding. We illustrate the method on the example of Whitney finite elements on a 2D simplicial triangulation and compare the eigenvalue approximation in 1D with a related approach.

Discrete Curvatures and Discrete Minimal Surfaces

KAUST Repository

Sun, Xiang

2012-01-01

This thesis presents an overview of some approaches to compute Gaussian and mean curvature on discrete surfaces and discusses discrete minimal surfaces. The variety of applications of differential geometry in visualization and shape design leads

A NEW STRATEGY FOR IMPROVING FEATURE SETS IN A DISCRETE HMM­BASED HANDWRITING RECOGNITION SYSTEM

NARCIS (Netherlands)

Grandidier, F.; Sabourin, R.; Suen, C.Y.; Gilloux, M.

2004-01-01

In this paper we introduce a new strategy for improving a discrete HMM­based handwriting recognition system, by integrating several information sources from specialized feature sets. For a given system, the basic idea is to keep the most discriminative features, and to replace the others with new

Interactions of Soliton Waves for a Generalized Discrete KdV Equation

International Nuclear Information System (INIS)

Zhou Tong; Zhu Zuo-Nong

2017-01-01

It is well known that soliton interactions in discrete integrable systems often possess new properties which are different from the continuous integrable systems, e.g., we found that there are such discrete solitons in a semidiscrete integrable system (the time variable is continuous and the space one is discrete) that the shorter solitary waves travel faster than the taller ones. Very recently, this kind of soliton was also observed in a full discrete generalized KdV system (the both of time and space variables are discrete) introduced by Kanki et al. In this paper, for the generalized discrete KdV (gdKdV) equation, we describe its richer structures of one-soliton solutions. The interactions of two-soliton waves to the gdKdV equation are studied. Some new features of the soliton interactions are proposed by rigorous theoretical analysis. (paper)

The discrete null space method for the energy-consistent integration of constrained mechanical systems. Part III: Flexible multibody dynamics

International Nuclear Information System (INIS)

Leyendecker, Sigrid; Betsch, Peter; Steinmann, Paul

2008-01-01

In the present work, the unified framework for the computational treatment of rigid bodies and nonlinear beams developed by Betsch and Steinmann (Multibody Syst. Dyn. 8, 367-391, 2002) is extended to the realm of nonlinear shells. In particular, a specific constrained formulation of shells is proposed which leads to the semi-discrete equations of motion characterized by a set of differential-algebraic equations (DAEs). The DAEs provide a uniform description for rigid bodies, semi-discrete beams and shells and, consequently, flexible multibody systems. The constraints may be divided into two classes: (i) internal constraints which are intimately connected with the assumption of rigidity of the bodies, and (ii) external constraints related to the presence of joints in a multibody framework. The present approach thus circumvents the use of rotational variables throughout the whole time discretization, facilitating the design of energy-momentum methods for flexible multibody dynamics. After the discretization has been completed a size-reduction of the discrete system is performed by eliminating the constraint forces. Numerical examples dealing with a spatial slider-crank mechanism and with intersecting shells illustrate the performance of the proposed method

Leader-Following Consensus Stability of Discrete-Time Linear Multiagent Systems with Observer-Based Protocols

Directory of Open Access Journals (Sweden)

Bingbing Xu

2013-01-01

Full Text Available We consider the leader-following consensus problem of discrete-time multiagent systems on a directed communication topology. Two types of distributed observer-based consensus protocols are considered to solve such a problem. The observers involved in the proposed protocols include full-order observer and reduced-order observer, which are used to reconstruct the state variables. Two algorithms are provided to construct the consensus protocols, which are based on the modified discrete-time algebraic Riccati equation and Sylvester equation. In light of graph and matrix theory, some consensus conditions are established. Finally, a numerical example is provided to illustrate the obtained result.

Risk-based design of process systems using discrete-time Bayesian networks

International Nuclear Information System (INIS)

Khakzad, Nima; Khan, Faisal; Amyotte, Paul

2013-01-01

Temporal Bayesian networks have gained popularity as a robust technique to model dynamic systems in which the components' sequential dependency, as well as their functional dependency, cannot be ignored. In this regard, discrete-time Bayesian networks have been proposed as a viable alternative to solve dynamic fault trees without resort to Markov chains. This approach overcomes the drawbacks of Markov chains such as the state-space explosion and the error-prone conversion procedure from dynamic fault tree. It also benefits from the inherent advantages of Bayesian networks such as probability updating. However, effective mapping of the dynamic gates of dynamic fault trees into Bayesian networks while avoiding the consequent huge multi-dimensional probability tables has always been a matter of concern. In this paper, a new general formalism has been developed to model two important elements of dynamic fault tree, i.e., cold spare gate and sequential enforcing gate, with any arbitrary probability distribution functions. Also, an innovative Neutral Dependency algorithm has been introduced to model dynamic gates such as priority-AND gate, thus reducing the dimension of conditional probability tables by an order of magnitude. The second part of the paper is devoted to the application of discrete-time Bayesian networks in the risk assessment and safety analysis of complex process systems. It has been shown how dynamic techniques can effectively be applied for optimal allocation of safety systems to obtain maximum risk reduction.

Energy Optimal Tracking Control with Discrete Fluid Power Systems using Model Predictive Control

DEFF Research Database (Denmark)

Hansen, Anders Hedegaard; Asmussen, Magnus Færing; Bech, Michael Møller

2017-01-01

For Discrete Displacement Cylinder (DDC) drives the control task lies in choosing force level. Hence, which force level to apply and thereby which pressure level each cylinder chambers shall be connected to. The DDC system is inherently a force system why often a force reference is generated...... and compared to a PID like tracking controller combined with a FSA. The results indicate that the energy efficiency of position tracking DDC systems may be improved significantly by using the MPC algorithm....

Adaptive NN tracking control of uncertain nonlinear discrete-time systems with nonaffine dead-zone input.

Science.gov (United States)

Liu, Yan-Jun; Tong, Shaocheng

2015-03-01

In the paper, an adaptive tracking control design is studied for a class of nonlinear discrete-time systems with dead-zone input. The considered systems are of the nonaffine pure-feedback form and the dead-zone input appears nonlinearly in the systems. The contributions of the paper are that: 1) it is for the first time to investigate the control problem for this class of discrete-time systems with dead-zone; 2) there are major difficulties for stabilizing such systems and in order to overcome the difficulties, the systems are transformed into an n-step-ahead predictor but nonaffine function is still existent; and 3) an adaptive compensative term is constructed to compensate for the parameters of the dead-zone. The neural networks are used to approximate the unknown functions in the transformed systems. Based on the Lyapunov theory, it is proven that all the signals in the closed-loop system are semi-globally uniformly ultimately bounded and the tracking error converges to a small neighborhood of zero. Two simulation examples are provided to verify the effectiveness of the control approach in the paper.

Bifurcation Analysis and Chaos Control in a Discrete Epidemic System

Directory of Open Access Journals (Sweden)

Wei Tan

2015-01-01

Full Text Available The dynamics of discrete SI epidemic model, which has been obtained by the forward Euler scheme, is investigated in detail. By using the center manifold theorem and bifurcation theorem in the interior R+2, the specific conditions for the existence of flip bifurcation and Neimark-Sacker bifurcation have been derived. Numerical simulation not only presents our theoretical analysis but also exhibits rich and complex dynamical behavior existing in the case of the windows of period-1, period-3, period-5, period-6, period-7, period-9, period-11, period-15, period-19, period-23, period-34, period-42, and period-53 orbits. Meanwhile, there appears the cascade of period-doubling 2, 4, 8 bifurcation and chaos sets from the fixed point. These results show the discrete model has more richer dynamics compared with the continuous model. The computations of the largest Lyapunov exponents more than 0 confirm the chaotic behaviors of the system x→x+δ[rN(1-N/K-βxy/N-(μ+mx], y→y+δ[βxy/N-(μ+dy]. Specifically, the chaotic orbits at an unstable fixed point are stabilized by using the feedback control method.

Control of discrete event systems modeled as hierarchical state machines

Science.gov (United States)

Brave, Y.; Heymann, M.

1991-01-01

The authors examine a class of discrete event systems (DESs) modeled as asynchronous hierarchical state machines (AHSMs). For this class of DESs, they provide an efficient method for testing reachability, which is an essential step in many control synthesis procedures. This method utilizes the asynchronous nature and hierarchical structure of AHSMs, thereby illustrating the advantage of the AHSM representation as compared with its equivalent (flat) state machine representation. An application of the method is presented where an online minimally restrictive solution is proposed for the problem of maintaining a controlled AHSM within prescribed legal bounds.

Time-dependent switched discrete-time linear systems control and filtering

CERN Document Server

Zhang, Lixian; Shi, Peng; Lu, Qiugang

2016-01-01

This book focuses on the basic control and filtering synthesis problems for discrete-time switched linear systems under time-dependent switching signals. Chapter 1, as an introduction of the book, gives the backgrounds and motivations of switched systems, the definitions of the typical time-dependent switching signals, the differences and links to other types of systems with hybrid characteristics and a literature review mainly on the control and filtering for the underlying systems. By summarizing the multiple Lyapunov-like functions (MLFs) approach in which different requirements on comparisons of Lyapunov function values at switching instants, a series of methodologies are developed for the issues on stability and stabilization, and l2-gain performance or tube-based robustness for l∞ disturbance, respectively, in Chapters 2 and 3. Chapters 4 and 5 are devoted to the control and filtering problems for the time-dependent switched linear systems with either polytopic uncertainties or measurable time-varying...

Identification of parameters of discrete-continuous models

International Nuclear Information System (INIS)

Cekus, Dawid; Warys, Pawel

2015-01-01

In the paper, the parameters of a discrete-continuous model have been identified on the basis of experimental investigations and formulation of optimization problem. The discrete-continuous model represents a cantilever stepped Timoshenko beam. The mathematical model has been formulated and solved according to the Lagrange multiplier formalism. Optimization has been based on the genetic algorithm. The presented proceeding’s stages make the identification of any parameters of discrete-continuous systems possible

Identification of parameters of discrete-continuous models

Energy Technology Data Exchange (ETDEWEB)

Cekus, Dawid, E-mail: cekus@imipkm.pcz.pl; Warys, Pawel, E-mail: warys@imipkm.pcz.pl [Institute of Mechanics and Machine Design Foundations, Czestochowa University of Technology, Dabrowskiego 73, 42-201 Czestochowa (Poland)

2015-03-10

In the paper, the parameters of a discrete-continuous model have been identified on the basis of experimental investigations and formulation of optimization problem. The discrete-continuous model represents a cantilever stepped Timoshenko beam. The mathematical model has been formulated and solved according to the Lagrange multiplier formalism. Optimization has been based on the genetic algorithm. The presented proceeding’s stages make the identification of any parameters of discrete-continuous systems possible.

Mimetic discretization methods

CERN Document Server

Castillo, Jose E

2013-01-01

To help solve physical and engineering problems, mimetic or compatible algebraic discretization methods employ discrete constructs to mimic the continuous identities and theorems found in vector calculus. Mimetic Discretization Methods focuses on the recent mimetic discretization method co-developed by the first author. Based on the Castillo-Grone operators, this simple mimetic discretization method is invariably valid for spatial dimensions no greater than three. The book also presents a numerical method for obtaining corresponding discrete operators that mimic the continuum differential and

Discrete Event Supervisory Control Applied to Propulsion Systems

Science.gov (United States)

Litt, Jonathan S.; Shah, Neerav

2005-01-01

The theory of discrete event supervisory (DES) control was applied to the optimal control of a twin-engine aircraft propulsion system and demonstrated in a simulation. The supervisory control, which is implemented as a finite-state automaton, oversees the behavior of a system and manages it in such a way that it maximizes a performance criterion, similar to a traditional optimal control problem. DES controllers can be nested such that a high-level controller supervises multiple lower level controllers. This structure can be expanded to control huge, complex systems, providing optimal performance and increasing autonomy with each additional level. The DES control strategy for propulsion systems was validated using a distributed testbed consisting of multiple computers--each representing a module of the overall propulsion system--to simulate real-time hardware-in-the-loop testing. In the first experiment, DES control was applied to the operation of a nonlinear simulation of a turbofan engine (running in closed loop using its own feedback controller) to minimize engine structural damage caused by a combination of thermal and structural loads. This enables increased on-wing time for the engine through better management of the engine-component life usage. Thus, the engine-level DES acts as a life-extending controller through its interaction with and manipulation of the engine s operation.

An Integrable Discrete Generalized Nonlinear Schrödinger Equation and Its Reductions

International Nuclear Information System (INIS)

Li Hong-Min; Li Yu-Qi; Chen Yong

2014-01-01

An integrable discrete system obtained by the algebraization of the difference operator is studied. The system is named discrete generalized nonlinear Schrödinger (GNLS) equation, which can be reduced to classical discrete nonlinear Schrödinger (NLS) equation. Furthermore, all of the linear reductions for the discrete GNLS equation are given through the theory of circulant matrices and the discrete NLS equation is obtained by one of the reductions. At the same time, the recursion operator and symmetries of continuous GNLS equation are successfully recovered by its corresponding discrete ones. (general)

Online soft sensor for hybrid systems with mixed continuous and discrete measurements

Czech Academy of Sciences Publication Activity Database

Suzdaleva, Evgenia; Nagy, Ivan

2012-01-01

Roč. 36, č. 10 (2012), s. 294-300 ISSN 0098-1354 R&D Projects: GA MŠk 1M0572; GA TA ČR TA01030123 Grant - others:Skoda Auto, a.s.(CZ) ENS/2009/UTIA Institutional research plan: CEZ:AV0Z10750506 Keywords : online state prediction * hybrid filter * state-space model * mixed data Subject RIV: BC - Control Systems Theory Impact factor: 2.091, year: 2012 http://library.utia.cas.cz/separaty/2011/AS/suzdaleva-online soft sensor for hybrid systems with mixed continuous and discrete measurements.pdf

Guaranteed Cost Finite-Time Control of Discrete-Time Positive Impulsive Switched Systems

Directory of Open Access Journals (Sweden)

Leipo Liu

2018-01-01

Full Text Available This paper considers the guaranteed cost finite-time boundedness of discrete-time positive impulsive switched systems. Firstly, the definition of guaranteed cost finite-time boundedness is introduced. By using the multiple linear copositive Lyapunov function (MLCLF and average dwell time (ADT approach, a state feedback controller is designed and sufficient conditions are obtained to guarantee that the corresponding closed-loop system is guaranteed cost finite-time boundedness (GCFTB. Such conditions can be solved by linear programming. Finally, a numerical example is provided to show the effectiveness of the proposed method.

Enhanced Discrete-Time Scheduler Engine for MBMS E-UMTS System Level Simulator

DEFF Research Database (Denmark)

Pratas, Nuno; Rodrigues, António

2007-01-01

In this paper the design of an E-UMTS system level simulator developed for the study of optimization methods for the MBMS is presented. The simulator uses a discrete event based philosophy, which captures the dynamic behavior of the Radio Network System. This dynamic behavior includes the user...... mobility, radio interfaces and the Radio Access Network. Its given emphasis on the enhancements developed for the simulator core, the Event Scheduler Engine. Two implementations for the Event Scheduler Engine are proposed, one optimized for single core processors and other for multi-core ones....

Effective Hamiltonian for travelling discrete breathers

Science.gov (United States)

MacKay, Robert S.; Sepulchre, Jacques-Alexandre

2002-05-01

Hamiltonian chains of oscillators in general probably do not sustain exact travelling discrete breathers. However solutions which look like moving discrete breathers for some time are not difficult to observe in numerics. In this paper we propose an abstract framework for the description of approximate travelling discrete breathers in Hamiltonian chains of oscillators. The method is based on the construction of an effective Hamiltonian enabling one to describe the dynamics of the translation degree of freedom of moving breathers. Error estimate on the approximate dynamics is also studied. The concept of the Peierls-Nabarro barrier can be made clear in this framework. We illustrate the method with two simple examples, namely the Salerno model which interpolates between the Ablowitz-Ladik lattice and the discrete nonlinear Schrödinger system, and the Fermi-Pasta-Ulam chain.

Localized excitations in discrete nonlinear Schrodinger systems: Effects of nonlocal dispersive interactions and noise

DEFF Research Database (Denmark)

Rasmussen, Kim; Christiansen, Peter Leth; Johansson, Magnus

1998-01-01

A one-dimensional discrete nonlinear Schrodinger (DNLS) model with the power dependence, r(-s) on the distance r, of dispersive interactions is proposed. The stationary states of the system are studied both analytically and numerically. Two kinds of trial functions, exp-like and sech-like are exp...

Passive Fault-tolerant Control of Discrete-time Piecewise Affine Systems against Actuator Faults

DEFF Research Database (Denmark)

Tabatabaeipour, Seyed Mojtaba; Izadi-Zamanabadi, Roozbeh; Bak, Thomas

2012-01-01

In this paper, we propose a new method for passive fault-tolerant control of discrete time piecewise affine systems. Actuator faults are considered. A reliable piecewise linear quadratic regulator (LQR) state feedback is designed such that it can tolerate actuator faults. A sufficient condition f...... is illustrated on a numerical example and a two degree of freedom helicopter....

Modeling energy market dynamics using discrete event system simulation

International Nuclear Information System (INIS)

Gutierrez-Alcaraz, G.; Sheble, G.B.

2009-01-01

This paper proposes the use of Discrete Event System Simulation to study the interactions among fuel and electricity markets and consumers, and the decision-making processes of fuel companies (FUELCOs), generation companies (GENCOs), and consumers in a simple artificial energy market. In reality, since markets can reach a stable equilibrium or fail, it is important to observe how they behave in a dynamic framework. We consider a Nash-Cournot model in which marketers are depicted as Nash-Cournot players that determine supply to meet end-use consumption. Detailed engineering considerations such as transportation network flows are omitted, because the focus is upon the selection and use of appropriate market models to provide answers to policy questions. (author)

On the Solution of the Eigenvalue Assignment Problem for Discrete-Time Systems

Directory of Open Access Journals (Sweden)

El-Sayed M. E. Mostafa

2017-01-01

Full Text Available The output feedback eigenvalue assignment problem for discrete-time systems is considered. The problem is formulated first as an unconstrained minimization problem, where a three-term nonlinear conjugate gradient method is proposed to find a local solution. In addition, a cut to the objective function is included, yielding an inequality constrained minimization problem, where a logarithmic barrier method is proposed for finding the local solution. The conjugate gradient method is further extended to tackle the eigenvalue assignment problem for the two cases of decentralized control systems and control systems with time delay. The performance of the methods is illustrated through various test examples.

Discrete Mathematics

DEFF Research Database (Denmark)

Sørensen, John Aasted

2011-01-01

; construct a finite state machine for a given application. Apply these concepts to new problems. The teaching in Discrete Mathematics is a combination of sessions with lectures and students solving problems, either manually or by using Matlab. Furthermore a selection of projects must be solved and handed...... to accomplish the following: -Understand and apply formal representations in discrete mathematics. -Understand and apply formal representations in problems within discrete mathematics. -Understand methods for solving problems in discrete mathematics. -Apply methods for solving problems in discrete mathematics...... to new problems. Relations and functions: Define a product set; define and apply equivalence relations; construct and apply functions. Apply these concepts to new problems. Natural numbers and induction: Define the natural numbers; apply the principle of induction to verify a selection of properties...

Digital Discretion

DEFF Research Database (Denmark)

Busch, Peter Andre; Zinner Henriksen, Helle

2018-01-01

discretion is suggested to reduce this footprint by influencing or replacing their discretionary practices using ICT. What is less researched is whether digital discretion can cause changes in public policy outcomes, and under what conditions such changes can occur. Using the concept of public service values......This study reviews 44 peer-reviewed articles on digital discretion published in the period from 1998 to January 2017. Street-level bureaucrats have traditionally had a wide ability to exercise discretion stirring debate since they can add their personal footprint on public policies. Digital......, we suggest that digital discretion can strengthen ethical and democratic values but weaken professional and relational values. Furthermore, we conclude that contextual factors such as considerations made by policy makers on the macro-level and the degree of professionalization of street...

Current Density and Continuity in Discretized Models

Science.gov (United States)

Boykin, Timothy B.; Luisier, Mathieu; Klimeck, Gerhard

2010-01-01

Discrete approaches have long been used in numerical modelling of physical systems in both research and teaching. Discrete versions of the Schrodinger equation employing either one or several basis functions per mesh point are often used by senior undergraduates and beginning graduate students in computational physics projects. In studying…

Fault diagnosis for discrete event systems: Modelling and verification

International Nuclear Information System (INIS)

Simeu-Abazi, Zineb; Di Mascolo, Maria; Knotek, Michal

2010-01-01

This paper proposes an effective way for diagnosis of discrete-event systems using a timed-automaton. It is based on the model-checking technique, thanks to time analysis of the timed model. The paper proposes a method to construct all the timed models and details the different steps used to obtain the diagnosis path. A dynamic model with temporal transitions is proposed in order to model the system. By 'dynamical model', we mean an extension of timed automata for which the faulty states are identified. The model of the studied system contains the faultless functioning states and all the faulty states. Our method is based on the backward exploitation of the dynamic model, where all possible reverse paths are searched. The reverse path is the connection of the faulty state to the initial state. The diagnosis method is based on the coherence between the faulty occurrence time and the reverse path length. A real-world batch process is used to demonstrate the modelling steps and the proposed backward time analysis method to reach the diagnosis results.

Synchronous Parallel System for Emulation and Discrete Event Simulation

Science.gov (United States)

Steinman, Jeffrey S. (Inventor)

2001-01-01

A synchronous parallel system for emulation and discrete event simulation having parallel nodes responds to received messages at each node by generating event objects having individual time stamps, stores only the changes to the state variables of the simulation object attributable to the event object and produces corresponding messages. The system refrains from transmitting the messages and changing the state variables while it determines whether the changes are superseded, and then stores the unchanged state variables in the event object for later restoral to the simulation object if called for. This determination preferably includes sensing the time stamp of each new event object and determining which new event object has the earliest time stamp as the local event horizon, determining the earliest local event horizon of the nodes as the global event horizon, and ignoring events whose time stamps are less than the global event horizon. Host processing between the system and external terminals enables such a terminal to query, monitor, command or participate with a simulation object during the simulation process.

Exploring high dimensional data with Butterfly: a novel classification algorithm based on discrete dynamical systems.

Science.gov (United States)

Geraci, Joseph; Dharsee, Moyez; Nuin, Paulo; Haslehurst, Alexandria; Koti, Madhuri; Feilotter, Harriet E; Evans, Ken

2014-03-01

We introduce a novel method for visualizing high dimensional data via a discrete dynamical system. This method provides a 2D representation of the relationship between subjects according to a set of variables without geometric projections, transformed axes or principal components. The algorithm exploits a memory-type mechanism inherent in a certain class of discrete dynamical systems collectively referred to as the chaos game that are closely related to iterative function systems. The goal of the algorithm was to create a human readable representation of high dimensional patient data that was capable of detecting unrevealed subclusters of patients from within anticipated classifications. This provides a mechanism to further pursue a more personalized exploration of pathology when used with medical data. For clustering and classification protocols, the dynamical system portion of the algorithm is designed to come after some feature selection filter and before some model evaluation (e.g. clustering accuracy) protocol. In the version given here, a univariate features selection step is performed (in practice more complex feature selection methods are used), a discrete dynamical system is driven by this reduced set of variables (which results in a set of 2D cluster models), these models are evaluated for their accuracy (according to a user-defined binary classification) and finally a visual representation of the top classification models are returned. Thus, in addition to the visualization component, this methodology can be used for both supervised and unsupervised machine learning as the top performing models are returned in the protocol we describe here. Butterfly, the algorithm we introduce and provide working code for, uses a discrete dynamical system to classify high dimensional data and provide a 2D representation of the relationship between subjects. We report results on three datasets (two in the article; one in the appendix) including a public lung cancer

Spatially localized, temporally quasiperiodic, discrete nonlinear excitations

International Nuclear Information System (INIS)

Cai, D.; Bishop, A.R.; Gronbech-Jensen, N.

1995-01-01

In contrast to the commonly discussed discrete breather, which is a spatially localized, time-periodic solution, we present an exact solution of a discrete nonlinear Schroedinger breather which is a spatially localized, temporally quasiperiodic nonlinear coherent excitation. This breather is a multiple-soliton solution in the sense of the inverse scattering transform. A discrete breather of multiple frequencies is conceptually important in studies of nonlinear lattice systems. We point out that, for this breather, the incommensurability of its frequencies is a discrete lattice effect and these frequencies become commensurate in the continuum limit. To understand the dynamical properties of the breather, we also discuss its stability and its behavior in the presence of an external potential. Finally, we indicate how to obtain an exact N-soliton breather as a discrete generalization of the continuum multiple-soliton solution

Integrable discretizations of the (2+1)-dimensional sinh-Gordon equation

International Nuclear Information System (INIS)

Hu, Xing-Biao; Yu, Guo-Fu

2007-01-01

In this paper, we propose two semi-discrete equations and one fully discrete equation and study them by Hirota's bilinear method. These equations have continuum limits into a system which admits the (2+1)-dimensional generalization of the sinh-Gordon equation. As a result, two integrable semi-discrete versions and one fully discrete version for the sinh-Gordon equation are found. Baecklund transformations, nonlinear superposition formulae, determinant solution and Lax pairs for these discrete versions are presented

Discrete-Time Sliding-Mode Control of Uncertain Systems with Time-Varying Delays via Descriptor Approach

Directory of Open Access Journals (Sweden)

Maode Yan

2008-01-01

Full Text Available This paper considers the problem of robust discrete-time sliding-mode control (DT-SMC design for a class of uncertain linear systems with time-varying delays. By applying a descriptor model transformation and Moon's inequality for bounding cross terms, a delay-dependent sufficient condition for the existence of stable sliding surface is given in terms of linear matrix inequalities (LMIs. Based on this existence condition, the synthesized sliding mode controller can guarantee the sliding-mode reaching condition of the specified discrete-time sliding surface for all admissible uncertainties and time-varying delays. An illustrative example verifies the effectiveness of the proposed method.

A hierarchy of Liouville integrable discrete Hamiltonian equations

Energy Technology Data Exchange (ETDEWEB)

Xu Xixiang [College of Science, Shandong University of Science and Technology, Qingdao 266510 (China)], E-mail: xixiang_xu@yahoo.com.cn

2008-05-12

Based on a discrete four-by-four matrix spectral problem, a hierarchy of Lax integrable lattice equations with two potentials is derived. Two Hamiltonian forms are constructed for each lattice equation in the resulting hierarchy by means of the discrete variational identity. A strong symmetry operator of the resulting hierarchy is given. Finally, it is shown that the resulting lattice equations are all Liouville integrable discrete Hamiltonian systems.

Uniform stability for time-varying infinite-dimensional discrete linear systems

International Nuclear Information System (INIS)

Kubrusly, C.S.

1988-09-01

Stability for time-varying discrete linear systems in a Banach space is investigated. On the one hand, it established a fairly complete collection of necessary and sufficient conditions for uniform asymptotic equistability for input-free systems. This includes uniform and strong power equistability, and uniform and strong l p -equistability, among other technical conditions which also play essential role in stability theory. On other hand, it is shown that uniform asymptotic equistability for input-free systems is equivalent to each of the following concepts of uniform stability for forced systems: l p -input l p -state, c o -input c o -state, bounded-input bounded-state, l p>1 -input bounded-state, c sub (o)-input bounded-state, and convergent-input bounded-state; which are also equivalent to their nonuniform counterparts. For time-varying convergent systems, the above is also equivalent to convergent-input convergent-state stability. The proofs presented here are all ''elementary'' in the sense that they are based essentially only on the Banach-Steinhaus theorem. (autor) [pt

Discrete dynamic modeling of cellular signaling networks.

Science.gov (United States)

Albert, Réka; Wang, Rui-Sheng

2009-01-01

Understanding signal transduction in cellular systems is a central issue in systems biology. Numerous experiments from different laboratories generate an abundance of individual components and causal interactions mediating environmental and developmental signals. However, for many signal transduction systems there is insufficient information on the overall structure and the molecular mechanisms involved in the signaling network. Moreover, lack of kinetic and temporal information makes it difficult to construct quantitative models of signal transduction pathways. Discrete dynamic modeling, combined with network analysis, provides an effective way to integrate fragmentary knowledge of regulatory interactions into a predictive mathematical model which is able to describe the time evolution of the system without the requirement for kinetic parameters. This chapter introduces the fundamental concepts of discrete dynamic modeling, particularly focusing on Boolean dynamic models. We describe this method step-by-step in the context of cellular signaling networks. Several variants of Boolean dynamic models including threshold Boolean networks and piecewise linear systems are also covered, followed by two examples of successful application of discrete dynamic modeling in cell biology.

Discrete Wigner function and quantum-state tomography

Science.gov (United States)

Leonhardt, Ulf

1996-05-01

The theory of discrete Wigner functions and of discrete quantum-state tomography [U. Leonhardt, Phys. Rev. Lett. 74, 4101 (1995)] is studied in more detail guided by the picture of precession tomography. Odd- and even-dimensional systems (angular momenta and spins, bosons, and fermions) are considered separately. Relations between simple number theory and the quantum mechanics of finite-dimensional systems are pointed out. In particular, the multicomplementarity of the precession states distinguishes prime dimensions from composite ones.

Asymptotic stability of discrete-time systems with time-varying delay subject to saturation nonlinearities

International Nuclear Information System (INIS)

Chen, S.-F.

2009-01-01

The asymptotic stability problem for discrete-time systems with time-varying delay subject to saturation nonlinearities is addressed in this paper. In terms of linear matrix inequalities (LMIs), a delay-dependent sufficient condition is derived to ensure the asymptotic stability. A numerical example is given to demonstrate the theoretical results.

Time Discretization Techniques

KAUST Repository

Gottlieb, S.

2016-10-12

The time discretization of hyperbolic partial differential equations is typically the evolution of a system of ordinary differential equations obtained by spatial discretization of the original problem. Methods for this time evolution include multistep, multistage, or multiderivative methods, as well as a combination of these approaches. The time step constraint is mainly a result of the absolute stability requirement, as well as additional conditions that mimic physical properties of the solution, such as positivity or total variation stability. These conditions may be required for stability when the solution develops shocks or sharp gradients. This chapter contains a review of some of the methods historically used for the evolution of hyperbolic PDEs, as well as cutting edge methods that are now commonly used.

Potential effects of the introduction of the discrete address beacon system data link on air/ground information transfer problems

Science.gov (United States)

Grayson, R. L.

1981-01-01

This study of Aviation Safety Reporting System reports suggests that benefits should accure from implementation of discrete address beacon system data link. The phase enhanced terminal information system service is expected to provide better terminal information than present systems by improving currency and accuracy. In the exchange of air traffic control messages, discrete address insures that only the intended recipient receives and acts on a specific message. Visual displays and printer copy of messages should mitigate many of the reported problems associated with voice communications. The problems that remain unaffected include error in addressing the intended recipient and messages whose content is wrong but are otherwise correct as to format and reasonableness.

A discrete model to study reaction-diffusion-mechanics systems.

Science.gov (United States)

Weise, Louis D; Nash, Martyn P; Panfilov, Alexander V

2011-01-01

This article introduces a discrete reaction-diffusion-mechanics (dRDM) model to study the effects of deformation on reaction-diffusion (RD) processes. The dRDM framework employs a FitzHugh-Nagumo type RD model coupled to a mass-lattice model, that undergoes finite deformations. The dRDM model describes a material whose elastic properties are described by a generalized Hooke's law for finite deformations (Seth material). Numerically, the dRDM approach combines a finite difference approach for the RD equations with a Verlet integration scheme for the equations of the mass-lattice system. Using this framework results were reproduced on self-organized pacemaking activity that have been previously found with a continuous RD mechanics model. Mechanisms that determine the period of pacemakers and its dependency on the medium size are identified. Finally it is shown how the drift direction of pacemakers in RDM systems is related to the spatial distribution of deformation and curvature effects.

A discrete model to study reaction-diffusion-mechanics systems.

Directory of Open Access Journals (Sweden)

Louis D Weise

Full Text Available This article introduces a discrete reaction-diffusion-mechanics (dRDM model to study the effects of deformation on reaction-diffusion (RD processes. The dRDM framework employs a FitzHugh-Nagumo type RD model coupled to a mass-lattice model, that undergoes finite deformations. The dRDM model describes a material whose elastic properties are described by a generalized Hooke's law for finite deformations (Seth material. Numerically, the dRDM approach combines a finite difference approach for the RD equations with a Verlet integration scheme for the equations of the mass-lattice system. Using this framework results were reproduced on self-organized pacemaking activity that have been previously found with a continuous RD mechanics model. Mechanisms that determine the period of pacemakers and its dependency on the medium size are identified. Finally it is shown how the drift direction of pacemakers in RDM systems is related to the spatial distribution of deformation and curvature effects.

Discrete linear canonical transform computation by adaptive method.

Science.gov (United States)

Zhang, Feng; Tao, Ran; Wang, Yue

2013-07-29

The linear canonical transform (LCT) describes the effect of quadratic phase systems on a wavefield and generalizes many optical transforms. In this paper, the computation method for the discrete LCT using the adaptive least-mean-square (LMS) algorithm is presented. The computation approaches of the block-based discrete LCT and the stream-based discrete LCT using the LMS algorithm are derived, and the implementation structures of these approaches by the adaptive filter system are considered. The proposed computation approaches have the inherent parallel structures which make them suitable for efficient VLSI implementations, and are robust to the propagation of possible errors in the computation process.

Defense Strategies for Asymmetric Networked Systems with Discrete Components

Directory of Open Access Journals (Sweden)

Nageswara S. V. Rao

2018-05-01

Full Text Available We consider infrastructures consisting of a network of systems, each composed of discrete components. The network provides the vital connectivity between the systems and hence plays a critical, asymmetric role in the infrastructure operations. The individual components of the systems can be attacked by cyber and physical means and can be appropriately reinforced to withstand these attacks. We formulate the problem of ensuring the infrastructure performance as a game between an attacker and a provider, who choose the numbers of the components of the systems and network to attack and reinforce, respectively. The costs and benefits of attacks and reinforcements are characterized using the sum-form, product-form and composite utility functions, each composed of a survival probability term and a component cost term. We present a two-level characterization of the correlations within the infrastructure: (i the aggregate failure correlation function specifies the infrastructure failure probability given the failure of an individual system or network, and (ii the survival probabilities of the systems and network satisfy first-order differential conditions that capture the component-level correlations using multiplier functions. We derive Nash equilibrium conditions that provide expressions for individual system survival probabilities and also the expected infrastructure capacity specified by the total number of operational components. We apply these results to derive and analyze defense strategies for distributed cloud computing infrastructures using cyber-physical models.

Defense Strategies for Asymmetric Networked Systems with Discrete Components.

Science.gov (United States)

Rao, Nageswara S V; Ma, Chris Y T; Hausken, Kjell; He, Fei; Yau, David K Y; Zhuang, Jun

2018-05-03

We consider infrastructures consisting of a network of systems, each composed of discrete components. The network provides the vital connectivity between the systems and hence plays a critical, asymmetric role in the infrastructure operations. The individual components of the systems can be attacked by cyber and physical means and can be appropriately reinforced to withstand these attacks. We formulate the problem of ensuring the infrastructure performance as a game between an attacker and a provider, who choose the numbers of the components of the systems and network to attack and reinforce, respectively. The costs and benefits of attacks and reinforcements are characterized using the sum-form, product-form and composite utility functions, each composed of a survival probability term and a component cost term. We present a two-level characterization of the correlations within the infrastructure: (i) the aggregate failure correlation function specifies the infrastructure failure probability given the failure of an individual system or network, and (ii) the survival probabilities of the systems and network satisfy first-order differential conditions that capture the component-level correlations using multiplier functions. We derive Nash equilibrium conditions that provide expressions for individual system survival probabilities and also the expected infrastructure capacity specified by the total number of operational components. We apply these results to derive and analyze defense strategies for distributed cloud computing infrastructures using cyber-physical models.

Discrete Exterior Calculus Discretization of Incompressible Navier-Stokes Equations

KAUST Repository

Mohamed, Mamdouh S.

2017-05-23

A conservative discretization of incompressible Navier-Stokes equations over surface simplicial meshes is developed using discrete exterior calculus (DEC). Numerical experiments for flows over surfaces reveal a second order accuracy for the developed scheme when using structured-triangular meshes, and first order accuracy otherwise. The mimetic character of many of the DEC operators provides exact conservation of both mass and vorticity, in addition to superior kinetic energy conservation. The employment of barycentric Hodge star allows the discretization to admit arbitrary simplicial meshes. The discretization scheme is presented along with various numerical test cases demonstrating its main characteristics.

Mathematical aspects of the discrete space-time hypothesis

International Nuclear Information System (INIS)

Sardanashvili, G.A.

1979-01-01

A hypothesis of a microcosm space discreteness is considered from the theoretical-mathematical point of view. The type of topological spaces, which formalizes representations on the discrete space-time, is determined. It is explained, how these spaces arise in physical models. The physical task, in which the discrete space could arise as a version of its solution, is considered. It is shown that the discrete structure of space can arise with a certain interaction type in the system, for example, with its considerable self-shielding, which can take place, in particular, in the particles or in the cosmological and astrophysical singularities

Probabilistic Power Flow Method Considering Continuous and Discrete Variables

Directory of Open Access Journals (Sweden)

Xuexia Zhang

2017-04-01

Full Text Available This paper proposes a probabilistic power flow (PPF method considering continuous and discrete variables (continuous and discrete power flow, CDPF for power systems. The proposed method—based on the cumulant method (CM and multiple deterministic power flow (MDPF calculations—can deal with continuous variables such as wind power generation (WPG and loads, and discrete variables such as fuel cell generation (FCG. In this paper, continuous variables follow a normal distribution (loads or a non-normal distribution (WPG, and discrete variables follow a binomial distribution (FCG. Through testing on IEEE 14-bus and IEEE 118-bus power systems, the proposed method (CDPF has better accuracy compared with the CM, and higher efficiency compared with the Monte Carlo simulation method (MCSM.

Discrete-time nonlinear sliding mode controller

African Journals Online (AJOL)

user

Keywords: Discrete-time delay system, Sliding mode control, nonlinear sliding ... of engineering systems such as chemical process control, delay in the actuator ...... instrumentation from Motilal Nehru National Institute of Technology (MNNIT),.

Current density and continuity in discretized models

International Nuclear Information System (INIS)

Boykin, Timothy B; Luisier, Mathieu; Klimeck, Gerhard

2010-01-01

Discrete approaches have long been used in numerical modelling of physical systems in both research and teaching. Discrete versions of the Schroedinger equation employing either one or several basis functions per mesh point are often used by senior undergraduates and beginning graduate students in computational physics projects. In studying discrete models, students can encounter conceptual difficulties with the representation of the current and its divergence because different finite-difference expressions, all of which reduce to the current density in the continuous limit, measure different physical quantities. Understanding these different discrete currents is essential and requires a careful analysis of the current operator, the divergence of the current and the continuity equation. Here we develop point forms of the current and its divergence valid for an arbitrary mesh and basis. We show that in discrete models currents exist only along lines joining atomic sites (or mesh points). Using these results, we derive a discrete analogue of the divergence theorem and demonstrate probability conservation in a purely localized-basis approach.

Discrete Calculus as a Bridge between Scales

Science.gov (United States)

Degiuli, Eric; McElwaine, Jim

2012-02-01

Understanding how continuum descriptions of disordered media emerge from the microscopic scale is a fundamental challenge in condensed matter physics. In many systems, it is necessary to coarse-grain balance equations at the microscopic scale to obtain macroscopic equations. We report development of an exact, discrete calculus, which allows identification of discrete microscopic equations with their continuum equivalent [1]. This allows the application of powerful techniques of calculus, such as the Helmholtz decomposition, the Divergence Theorem, and Stokes' Theorem. We illustrate our results with granular materials. In particular, we show how Newton's laws for a single grain reproduce their continuum equivalent in the calculus. This allows introduction of a discrete Airy stress function, exactly as in the continuum. As an application of the formalism, we show how these results give the natural mean-field variation of discrete quantities, in agreement with numerical simulations. The discrete calculus thus acts as a bridge between discrete microscale quantities and continuous macroscale quantities. [4pt] [1] E. DeGiuli & J. McElwaine, PRE 2011. doi: 10.1103/PhysRevE.84.041310

Switching dynamics in reaction networks induced by molecular discreteness

International Nuclear Information System (INIS)

Togashi, Yuichi; Kaneko, Kunihiko

2007-01-01

To study the fluctuations and dynamics in chemical reaction processes, stochastic differential equations based on the rate equation involving chemical concentrations are often adopted. When the number of molecules is very small, however, the discreteness in the number of molecules cannot be neglected since the number of molecules must be an integer. This discreteness can be important in biochemical reactions, where the total number of molecules is not significantly larger than the number of chemical species. To elucidate the effects of such discreteness, we study autocatalytic reaction systems comprising several chemical species through stochastic particle simulations. The generation of novel states is observed; it is caused by the extinction of some molecular species due to the discreteness in their number. We demonstrate that the reaction dynamics are switched by a single molecule, which leads to the reconstruction of the acting network structure. We also show the strong dependence of the chemical concentrations on the system size, which is caused by transitions to discreteness-induced novel states

Studies of discrete symmetries in a purely leptonic system using the Jagiellonian Positron Emission Tomograph

Directory of Open Access Journals (Sweden)

Moskal P.

2016-01-01

Full Text Available Discrete symmetries such as parity (P, charge-conjugation (C and time reversal (T are of fundamental importance in physics and cosmology. Breaking of charge conjugation symmetry (C and its combination with parity (CP constitute necessary conditions for the existence of the asymmetry between matter and antimatter in the observed Universe. The presently known sources of discrete symmetries violations can account for only a tiny fraction of the excess of matter over antimatter. So far CP and T symmetries violations were observed only for systems involving quarks and they were never reported for the purely leptonic objects. In this article we describe briefly an experimental proposal for the test of discrete symmetries in the decays of positronium atom which is made exclusively of leptons. The experiments are conducted by means of the Jagiellonian Positron Emission Tomograph (J-PET which is constructed from strips of plastic scintillators enabling registration of photons from the positronium annihilation. J-PET tomograph together with the positronium target system enable to measure expectation values for the discrete symmetries odd operators constructed from (i spin vector of the ortho-positronium atom, (ii momentum vectors of photons originating from the decay of positronium, and (iii linear polarization direction of annihilation photons. Linearly polarized positronium will be produced in the highly porous aerogel or polymer targets, exploiting longitudinally polarized positrons emitted by the sodium 22Na isotope. Information about the polarization vector of orthopositronium will be available on the event by event basis and will be reconstructed from the known position of the positron source and the reconstructed position of the orthopositronium annihilation. In 2016 the first tests and calibration runs are planned, and the data collection with high statistics will commence in the year 2017.

How Triage Nurses Use Discretion: a Literature Review

Directory of Open Access Journals (Sweden)

Lars Emil Fagernes Johannessen

2016-02-01

Full Text Available Discretion is quintessential for professional work. This review aims to understand how nurses use discretion when they perform urgency assessments in emergency departments with formalised triage systems—systems that are intended to reduce nurses’ use of discretion. Because little research has dealt explicitly with this topic, this review addresses the discretionary aspects of triage by reinterpreting qualitative studies of how triage nurses perform urgency assessments. The review shows (a how inexhaustive guidelines and a hectic work environment are factors that necessitate nurses’ use of discretion and (b how nurses reason within this discretionary space by relying on their experience and intuition, judging patients according to criteria such as appropriateness and believability, and creating urgency ratings together with their patients. The review also offers a synthesis of the findings’ discretionary aspects and suggests a new interactionist dimension of discretion.Keywords: Triage, discretion, emergency department, meta-ethnography, review, decision-making

Optimization and quantization in gradient symbol systems: a framework for integrating the continuous and the discrete in cognition.

Science.gov (United States)

Smolensky, Paul; Goldrick, Matthew; Mathis, Donald

2014-08-01

Mental representations have continuous as well as discrete, combinatorial properties. For example, while predominantly discrete, phonological representations also vary continuously; this is reflected by gradient effects in instrumental studies of speech production. Can an integrated theoretical framework address both aspects of structure? The framework we introduce here, Gradient Symbol Processing, characterizes the emergence of grammatical macrostructure from the Parallel Distributed Processing microstructure (McClelland, Rumelhart, & The PDP Research Group, 1986) of language processing. The mental representations that emerge, Distributed Symbol Systems, have both combinatorial and gradient structure. They are processed through Subsymbolic Optimization-Quantization, in which an optimization process favoring representations that satisfy well-formedness constraints operates in parallel with a distributed quantization process favoring discrete symbolic structures. We apply a particular instantiation of this framework, λ-Diffusion Theory, to phonological production. Simulations of the resulting model suggest that Gradient Symbol Processing offers a way to unify accounts of grammatical competence with both discrete and continuous patterns in language performance. Copyright © 2013 Cognitive Science Society, Inc.

Finite-Time Stability Analysis of Discrete-Time Linear Singular Systems

Directory of Open Access Journals (Sweden)

Songlin Wo

2014-01-01

Full Text Available The finite-time stability (FTS problem of discrete-time linear singular systems (DTLSS is considered in this paper. A necessary and sufficient condition for FTS is obtained, which can be expressed in terms of matrix inequalities. Then, another form of the necessary and sufficient condition for FTS is also given by using matrix-null space technology. In order to solve the stability problem expediently, a sufficient condition for FTS is given via linear matrix inequality (LMI approach; this condition can be expressed in terms of LMIs. Finally, an illustrating example is also given to show the effectiveness of the proposed method.

Ecological monitoring in a discrete-time prey-predator model.

Science.gov (United States)

Gámez, M; López, I; Rodríguez, C; Varga, Z; Garay, J

2017-09-21

The paper is aimed at the methodological development of ecological monitoring in discrete-time dynamic models. In earlier papers, in the framework of continuous-time models, we have shown how a systems-theoretical methodology can be applied to the monitoring of the state process of a system of interacting populations, also estimating certain abiotic environmental changes such as pollution, climatic or seasonal changes. In practice, however, there may be good reasons to use discrete-time models. (For instance, there may be discrete cycles in the development of the populations, or observations can be made only at discrete time steps.) Therefore the present paper is devoted to the development of the monitoring methodology in the framework of discrete-time models of population ecology. By monitoring we mean that, observing only certain component(s) of the system, we reconstruct the whole state process. This may be necessary, e.g., when in a complex ecosystem the observation of the densities of certain species is impossible, or too expensive. For the first presentation of the offered methodology, we have chosen a discrete-time version of the classical Lotka-Volterra prey-predator model. This is a minimal but not trivial system where the methodology can still be presented. We also show how this methodology can be applied to estimate the effect of an abiotic environmental change, using a component of the population system as an environmental indicator. Although this approach is illustrated in a simplest possible case, it can be easily extended to larger ecosystems with several interacting populations and different types of abiotic environmental effects. Copyright © 2017 Elsevier Ltd. All rights reserved.

The reverse effects of random perturbation on discrete systems for single and multiple population models

International Nuclear Information System (INIS)

Kang, Li; Tang, Sanyi

2016-01-01

Highlights: • The discrete single species and multiple species models with random perturbation are proposed. • The complex dynamics and interesting bifurcation behavior have been investigated. • The reverse effects of random perturbation on discrete systems have been discussed and revealed. • The main results can be applied for pest control and resources management. - Abstract: The natural species are likely to present several interesting and complex phenomena under random perturbations, which have been confirmed by simple mathematical models. The important questions are: how the random perturbations influence the dynamics of the discrete population models with multiple steady states or multiple species interactions? and is there any different effects for single species and multiple species models with random perturbation? To address those interesting questions, we have proposed the discrete single species model with two stable equilibria and the host-parasitoid model with Holling type functional response functions to address how the random perturbation affects the dynamics. The main results indicate that the random perturbation does not change the number of blurred orbits of the single species model with two stable steady states compared with results for the classical Ricker model with same random perturbation, but it can strength the stability. However, extensive numerical investigations depict that the random perturbation does not influence the complexities of the host-parasitoid models compared with the results for the models without perturbation, while it does increase the period of periodic orbits doubly. All those confirm that the random perturbation has a reverse effect on the dynamics of the discrete single and multiple population models, which could be applied in reality including pest control and resources management.

Discrete phase space based on finite fields

International Nuclear Information System (INIS)

Gibbons, Kathleen S.; Hoffman, Matthew J.; Wootters, William K.

2004-01-01

The original Wigner function provides a way of representing in phase space the quantum states of systems with continuous degrees of freedom. Wigner functions have also been developed for discrete quantum systems, one popular version being defined on a 2Nx2N discrete phase space for a system with N orthogonal states. Here we investigate an alternative class of discrete Wigner functions, in which the field of real numbers that labels the axes of continuous phase space is replaced by a finite field having N elements. There exists such a field if and only if N is a power of a prime; so our formulation can be applied directly only to systems for which the state-space dimension takes such a value. Though this condition may seem limiting, we note that any quantum computer based on qubits meets the condition and can thus be accommodated within our scheme. The geometry of our NxN phase space also leads naturally to a method of constructing a complete set of N+1 mutually unbiased bases for the state space

Cross Coursing in Mathematics: Physical Modelling in Differential Equations Crossing to Discrete Dynamical Systems

Science.gov (United States)

Winkel, Brian

2012-01-01

We give an example of cross coursing in which a subject or approach in one course in undergraduate mathematics is used in a completely different course. This situation crosses falling body modelling in an upper level differential equations course into a modest discrete dynamical systems unit of a first-year mathematics course. (Contains 1 figure.)

Hybrid discrete-time neural networks.

Science.gov (United States)

Cao, Hongjun; Ibarz, Borja

2010-11-13

Hybrid dynamical systems combine evolution equations with state transitions. When the evolution equations are discrete-time (also called map-based), the result is a hybrid discrete-time system. A class of biological neural network models that has recently received some attention falls within this category: map-based neuron models connected by means of fast threshold modulation (FTM). FTM is a connection scheme that aims to mimic the switching dynamics of a neuron subject to synaptic inputs. The dynamic equations of the neuron adopt different forms according to the state (either firing or not firing) and type (excitatory or inhibitory) of their presynaptic neighbours. Therefore, the mathematical model of one such network is a combination of discrete-time evolution equations with transitions between states, constituting a hybrid discrete-time (map-based) neural network. In this paper, we review previous work within the context of these models, exemplifying useful techniques to analyse them. Typical map-based neuron models are low-dimensional and amenable to phase-plane analysis. In bursting models, fast-slow decomposition can be used to reduce dimensionality further, so that the dynamics of a pair of connected neurons can be easily understood. We also discuss a model that includes electrical synapses in addition to chemical synapses with FTM. Furthermore, we describe how master stability functions can predict the stability of synchronized states in these networks. The main results are extended to larger map-based neural networks.

Periodic, quasiperiodic and chaotic discrete breathers in a parametrical driven two-dimensional discrete diatomic Klein–Gordon lattice

International Nuclear Information System (INIS)

Quan, Xu; Qiang, Tian

2009-01-01

We study a two-dimensional (2D) diatomic lattice of anharmonic oscillators with only quartic nearest-neighbor interactions, in which discrete breathers (DBs) can be explicitly constructed by an exact separation of their time and space dependence. DBs can stably exist in the 2D discrete diatomic Klein–Gordon lattice with hard and soft on-site potentials. When a parametric driving term is introduced in the factor multiplying the harmonic part of the on-site potential of the system, we can obtain the stable quasiperiodic discrete breathers (QDBs) and chaotic discrete breathers (CDBs) by changing the amplitude of the driver. But the DBs and QDBs with symmetric and anti-symmetric profiles that are centered at a heavy atom are more stable than at a light atom, because the frequencies of the DBs and QDBs centered at a heavy atom are lower than those centered at a light atom

Application of a discrete-energy, discrete-ordinates technique to the study of neutron transport in iron

International Nuclear Information System (INIS)

Ching, J.T.

1975-01-01

An algebraic equivalence between the point-energy and multigroup forms of the Boltzmann transport equation is demonstrated which allows the development of a discrete-energy, discrete-ordinates method for the solution of radiation transport problems. The method utilizes a modified version of a cross section processing scheme devised for the moments method code BMT and the transport equation solution algorithm from the one-dimensional discrete-ordinates transport code ANISN. The combined system, identified as MOMANS, computes fluxes directly from point cross sections in a single operation. In the cross-section processing, the group averaging required for multigroup calculations is replaced by a fast numerical scheme capable of generating a set of transfer cross sections containing all the physical features of interest, thereby increasing the detail in the calculated results. Test calculations in which the discrete-energy method was compared with the multigroup method have shown that for the same energy grid (number of points = number of groups), the discrete-energy method is faster but somewhat less accurate than the multigroup method. However, the accuracy of the discrete-energy method increases rapidly as the spacing between energy points is decreased, approaching that of multigroup calculations. For problems requiring great detail in the energy spectrum the discrete-energy method has therefore proven to be as accurate as, and more economical than, the multigroup technique. This was demonstrated by the application of the method to the study of the transport of neutrons in an iron sphere. Using the capability of the discrete-energy method for rapidly treating changes in cross-section sets, the propagation of neutrons from a 14 MeV source in a 22 cm radius sphere of iron was analyzed for sensitivity to changes in the microscopic scattering mechanisms

Robust Stabilization of Discrete-Time Systems with Time-Varying Delay: An LMI Approach

Directory of Open Access Journals (Sweden)

Valter J. S. Leite

2008-01-01

Full Text Available Sufficient linear matrix inequality (LMI conditions to verify the robust stability and to design robust state feedback gains for the class of linear discrete-time systems with time-varying delay and polytopic uncertainties are presented. The conditions are obtained through parameter-dependent Lyapunov-Krasovskii functionals and use some extra variables, which yield less conservative LMI conditions. Both problems, robust stability analysis and robust synthesis, are formulated as convex problems where all system matrices can be affected by uncertainty. Some numerical examples are presented to illustrate the advantages of the proposed LMI conditions.

Integrable discretization s of derivative nonlinear Schroedinger equations

International Nuclear Information System (INIS)

Tsuchida, Takayuki

2002-01-01

We propose integrable discretizations of derivative nonlinear Schroedinger (DNLS) equations such as the Kaup-Newell equation, the Chen-Lee-Liu equation and the Gerdjikov-Ivanov equation by constructing Lax pairs. The discrete DNLS systems admit the reduction of complex conjugation between two dependent variables and possess bi-Hamiltonian structure. Through transformations of variables and reductions, we obtain novel integrable discretizations of the nonlinear Schroedinger (NLS), modified KdV (mKdV), mixed NLS, matrix NLS, matrix KdV, matrix mKdV, coupled NLS, coupled Hirota, coupled Sasa-Satsuma and Burgers equations. We also discuss integrable discretizations of the sine-Gordon equation, the massive Thirring model and their generalizations. (author)

Performance analysis of chi models using discrete-time probabilistic reward graphs

NARCIS (Netherlands)

Trcka, N.; Georgievska, S.; Markovski, J.; Andova, S.; Vink, de E.P.

2008-01-01

We propose the model of discrete-time probabilistic reward graphs (DTPRGs) for performance analysis of systems exhibiting discrete deterministic time delays and probabilistic behavior, via their interpretation as discrete-time Markov reward chains, full-fledged platform for qualitative and

Distinct timing mechanisms produce discrete and continuous movements.

Directory of Open Access Journals (Sweden)

Raoul Huys

2008-04-01

Full Text Available The differentiation of discrete and continuous movement is one of the pillars of motor behavior classification. Discrete movements have a definite beginning and end, whereas continuous movements do not have such discriminable end points. In the past decade there has been vigorous debate whether this classification implies different control processes. This debate up until the present has been empirically based. Here, we present an unambiguous non-empirical classification based on theorems in dynamical system theory that sets discrete and continuous movements apart. Through computational simulations of representative modes of each class and topological analysis of the flow in state space, we show that distinct control mechanisms underwrite discrete and fast rhythmic movements. In particular, we demonstrate that discrete movements require a time keeper while fast rhythmic movements do not. We validate our computational findings experimentally using a behavioral paradigm in which human participants performed finger flexion-extension movements at various movement paces and under different instructions. Our results demonstrate that the human motor system employs different timing control mechanisms (presumably via differential recruitment of neural subsystems to accomplish varying behavioral functions such as speed constraints.

Symmetries and conserved quantities of discrete wave equation associated with the Ablowitz—Ladik—Lattice system

International Nuclear Information System (INIS)

Fu Jing-Li; He Yu-Fang; Hong Fang-Yu; Song Duan; Fu Hao

2013-01-01

In this paper, we present a new method to obtain the Lie symmetries and conserved quantities of the discrete wave equation with the Ablowitz—Ladik—Lattice equations. Firstly, the wave equation is transformed into a simple difference equation with the Ablowitz—Ladik—Lattice method. Secondly, according to the invariance of the discrete wave equation and the Ablowitz—Ladik—Lattice equations under infinitesimal transformation of dependent and independent variables, we derive the discrete determining equation and the discrete restricted equations. Thirdly, a series of the discrete analogs of conserved quantities, the discrete analogs of Lie groups, and the characteristic equations are obtained for the wave equation. Finally, we study a model of a biological macromolecule chain of mechanical behaviors, the Lie symmetry theory of discrete wave equation with the Ablowitz—Ladik—Lattice method is verified. (general)

Neural networks for tracking of unknown SISO discrete-time nonlinear dynamic systems.

Science.gov (United States)

Aftab, Muhammad Saleheen; Shafiq, Muhammad

2015-11-01

This article presents a Lyapunov function based neural network tracking (LNT) strategy for single-input, single-output (SISO) discrete-time nonlinear dynamic systems. The proposed LNT architecture is composed of two feedforward neural networks operating as controller and estimator. A Lyapunov function based back propagation learning algorithm is used for online adjustment of the controller and estimator parameters. The controller and estimator error convergence and closed-loop system stability analysis is performed by Lyapunov stability theory. Moreover, two simulation examples and one real-time experiment are investigated as case studies. The achieved results successfully validate the controller performance. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.

State-feedback control of fuzzy discrete-event systems.

Science.gov (United States)

Lin, Feng; Ying, Hao

2010-06-01

In a 2002 paper, we combined fuzzy logic with discrete-event systems (DESs) and established an automaton model of fuzzy DESs (FDESs). The model can effectively represent deterministic uncertainties and vagueness, as well as human subjective observation and judgment inherent to many real-world problems, particularly those in biomedicine. We also investigated optimal control of FDESs and applied the results to optimize HIV/AIDS treatments for individual patients. Since then, other researchers have investigated supervisory control problems in FDESs, and several results have been obtained. These results are mostly derived by extending the traditional supervisory control of (crisp) DESs, which are string based. In this paper, we develop state-feedback control of FDESs that is different from the supervisory control extensions. We use state space to describe the system behaviors and use state feedback in control. Both disablement and enforcement are allowed. Furthermore, we study controllability based on the state space and prove that a controller exists if and only if the controlled system behavior is (state-based) controllable. We discuss various properties of the state-based controllability. Aside from novelty, the proposed new framework has the advantages of being able to address a wide range of practical problems that cannot be effectively dealt with by existing approaches. We use the diabetes treatment as an example to illustrate some key aspects of our theoretical results.

Stochastic Kuramoto oscillators with discrete phase states

Science.gov (United States)

Jörg, David J.

2017-09-01

We present a generalization of the Kuramoto phase oscillator model in which phases advance in discrete phase increments through Poisson processes, rendering both intrinsic oscillations and coupling inherently stochastic. We study the effects of phase discretization on the synchronization and precision properties of the coupled system both analytically and numerically. Remarkably, many key observables such as the steady-state synchrony and the quality of oscillations show distinct extrema while converging to the classical Kuramoto model in the limit of a continuous phase. The phase-discretized model provides a general framework for coupled oscillations in a Markov chain setting.

Stochastic Kuramoto oscillators with discrete phase states.

Science.gov (United States)

Jörg, David J

2017-09-01

We present a generalization of the Kuramoto phase oscillator model in which phases advance in discrete phase increments through Poisson processes, rendering both intrinsic oscillations and coupling inherently stochastic. We study the effects of phase discretization on the synchronization and precision properties of the coupled system both analytically and numerically. Remarkably, many key observables such as the steady-state synchrony and the quality of oscillations show distinct extrema while converging to the classical Kuramoto model in the limit of a continuous phase. The phase-discretized model provides a general framework for coupled oscillations in a Markov chain setting.

Single-crossover recombination in discrete time.

Science.gov (United States)

von Wangenheim, Ute; Baake, Ellen; Baake, Michael

2010-05-01

Modelling the process of recombination leads to a large coupled nonlinear dynamical system. Here, we consider a particular case of recombination in discrete time, allowing only for single crossovers. While the analogous dynamics in continuous time admits a closed solution (Baake and Baake in Can J Math 55:3-41, 2003), this no longer works for discrete time. A more general model (i.e. without the restriction to single crossovers) has been studied before (Bennett in Ann Hum Genet 18:311-317, 1954; Dawson in Theor Popul Biol 58:1-20, 2000; Linear Algebra Appl 348:115-137, 2002) and was solved algorithmically by means of Haldane linearisation. Using the special formalism introduced by Baake and Baake (Can J Math 55:3-41, 2003), we obtain further insight into the single-crossover dynamics and the particular difficulties that arise in discrete time. We then transform the equations to a solvable system in a two-step procedure: linearisation followed by diagonalisation. Still, the coefficients of the second step must be determined in a recursive manner, but once this is done for a given system, they allow for an explicit solution valid for all times.

Theoretical Basics of Teaching Discrete Mathematics

Directory of Open Access Journals (Sweden)

Y. A. Perminov

2012-01-01

Full Text Available  The paper deals with the research findings concerning the process of mastering the theoretical basics of discrete mathematics by the students of vocational pedagogic profile. The methodological analysis is based on the subject and functions of the modern discrete mathematics and its role in mathematical modeling and computing. The modern discrete mathematics (i.e. mathematics of the finite type structures plays the important role in modernization of vocational training. It is especially rele- vant to training students for vocational pedagogic qualifications, as in the future they will be responsible for training the middle and the senior level specialists in engineer- ing and technical spheres. Nowadays in different industries, there arise the problems which require for their solving both continual – based on the classical mathematical methods – and discrete modeling. The teaching course of discrete mathematics for the future vocational teachers should be relevant to the target qualification and aimed at mastering the mathematical modeling, systems of computer mathematics and computer technologies. The author emphasizes the fundamental role of mastering the language of algebraic and serial structures, as well as the logical, algorithmic, combinatory schemes dominating in dis- crete mathematics. The guidelines for selecting the content of the course in discrete mathematics are specified. The theoretical findings of the research can be put into practice whilst developing curricula and working programs for bachelors and masters’ training. 

A time-varying extremum-seeking control approach for discrete-time systems with application to model predictive control

NARCIS (Netherlands)

Guay, M.; Beerens, R.; Nijmeijer, H.

2014-01-01

This paper considers the solution of a real-time optimization problem using adaptive extremum seeking control for a class of unknown discrete-time nonlinear systems. It is assumed that the equations describing the dynamics of the nonlinear system and the cost function to be minimized are unknown and

DISCRETION MAGNETIQUE DES MACHINES ELECTRIQUES DE PROPULSION NAVALE

OpenAIRE

Froidurot , Benoît

2002-01-01

For about ten years, electrical machines have been commonly used in naval propulsion systems for civilian applications. This is mainly due to new magnetic materials (magnets...) and power drive electronic, which increase the performances of the machines. This kind of propulsion is planed to be implemented on military ships. However, some constraints of discretion make this propulsion require specific systems for the ship security. This study is then dedicted to the magnetic discretion of nava...

H infinity Integrated Fault Estimation and Fault Tolerant Control of Discrete-time Piecewise Linear Systems

DEFF Research Database (Denmark)

Tabatabaeipour, Seyed Mojtaba; Bak, Thomas

2012-01-01

In this paper we consider the problem of fault estimation and accommodation for discrete time piecewise linear systems. A robust fault estimator is designed to estimate the fault such that the estimation error converges to zero and H∞ performance of the fault estimation is minimized. Then, the es...

Four positive periodic solutions of a discrete time Lotka-Volterra competitive system with harvesting terms

Directory of Open Access Journals (Sweden)

Xinggui Liu

2011-01-01

Full Text Available In this paper, by using Mawhin's continuation theorem of coincidence degree theory, we establish the existence of at least four positive periodic solutions for a discrete time Lotka-Volterra competitive system with harvesting terms. An example is given to illustrate the effectiveness of our results.

Monotone methods for solving a boundary value problem of second order discrete system

Directory of Open Access Journals (Sweden)

Wang Yuan-Ming

1999-01-01

Full Text Available A new concept of a pair of upper and lower solutions is introduced for a boundary value problem of second order discrete system. A comparison result is given. An existence theorem for a solution is established in terms of upper and lower solutions. A monotone iterative scheme is proposed, and the monotone convergence rate of the iteration is compared and analyzed. The numerical results are given.

Discrete Exterior Calculus Discretization of Incompressible Navier-Stokes Equations

KAUST Repository

Mohamed, Mamdouh S.; Hirani, Anil N.; Samtaney, Ravi

2017-01-01

A conservative discretization of incompressible Navier-Stokes equations over surface simplicial meshes is developed using discrete exterior calculus (DEC). Numerical experiments for flows over surfaces reveal a second order accuracy

Engineering applications of discrete-time optimal control

DEFF Research Database (Denmark)

Vidal, Rene Victor Valqui; Ravn, Hans V.

1990-01-01

Many problems of design and operation of engineering systems can be formulated as optimal control problems where time has been discretisized. This is also true even if 'time' is not involved in the formulation of the problem, but rather another one-dimensional parameter. This paper gives a review...... of some well-known and new results in discrete time optimal control methods applicable to practical problem solving within engineering. Emphasis is placed on dynamic programming, the classical maximum principle and generalized versions of the maximum principle for optimal control of discrete time systems...

Discrete and mesoscopic regimes of finite-size wave turbulence

International Nuclear Information System (INIS)

L'vov, V. S.; Nazarenko, S.

2010-01-01

Bounding volume results in discreteness of eigenmodes in wave systems. This leads to a depletion or complete loss of wave resonances (three-wave, four-wave, etc.), which has a strong effect on wave turbulence (WT) i.e., on the statistical behavior of broadband sets of weakly nonlinear waves. This paper describes three different regimes of WT realizable for different levels of the wave excitations: discrete, mesoscopic and kinetic WT. Discrete WT comprises chaotic dynamics of interacting wave 'clusters' consisting of discrete (often finite) number of connected resonant wave triads (or quarters). Kinetic WT refers to the infinite-box theory, described by well-known wave-kinetic equations. Mesoscopic WT is a regime in which either the discrete and the kinetic evolutions alternate or when none of these two types is purely realized. We argue that in mesoscopic systems the wave spectrum experiences a sandpile behavior. Importantly, the mesoscopic regime is realized for a broad range of wave amplitudes which typically spans over several orders on magnitude, and not just for a particular intermediate level.

DISCRETE MATHEMATICS/NUMBER THEORY

OpenAIRE

Mrs. Manju Devi*

2017-01-01

Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather than continuous. In contrast to real numbers that have the property of varying "smoothly", the objects studied in discrete mathematics such as integers, graphs, and statements do not vary smoothly in this way, but have distinct, separated values. Discrete mathematics therefore excludes topics in "continuous mathematics" such as calculus and analysis. Discrete objects can often be enumerated by ...

Discrete coherent and squeezed states of many-qudit systems

International Nuclear Information System (INIS)

Klimov, Andrei B.; Munoz, Carlos; Sanchez-Soto, Luis L.

2009-01-01

We consider the phase space for n identical qudits (each one of dimension d, with d a primer number) as a grid of d n xd n points and use the finite Galois field GF(d n ) to label the corresponding axes. The associated displacement operators permit to define s-parametrized quasidistributions on this grid, with properties analogous to their continuous counterparts. These displacements allow also for the construction of finite coherent states, once a fiducial state is fixed. We take this reference as one eigenstate of the discrete Fourier transform and study the factorization properties of the resulting coherent states. We extend these ideas to include discrete squeezed states, and show their intriguing relation with entangled states of different qudits.

A discrete-time queueing system with changes in the vacation times

Directory of Open Access Journals (Sweden)

Atencia Ivan

2016-06-01

Full Text Available This paper considers a discrete-time queueing system in which an arriving customer can decide to follow a last come first served (LCFS service discipline or to become a negative customer that eliminates the one at service, if any. After service completion, the server can opt for a vacation time or it can remain on duty. Changes in the vacation times as well as their associated distribution are thoroughly studied. An extensive analysis of the system is carried out and, using a probability generating function approach, steady-state performance measures such as the first moments of the busy period of the queue content and of customers delay are obtained. Finally, some numerical examples to show the influence of the parameters on several performance characteristics are given.

Stability Analysis and H∞ Model Reduction for Switched Discrete-Time Time-Delay Systems

Directory of Open Access Journals (Sweden)

Zheng-Fan Liu

2014-01-01

Full Text Available This paper is concerned with the problem of exponential stability and H∞ model reduction of a class of switched discrete-time systems with state time-varying delay. Some subsystems can be unstable. Based on the average dwell time technique and Lyapunov-Krasovskii functional (LKF approach, sufficient conditions for exponential stability with H∞ performance of such systems are derived in terms of linear matrix inequalities (LMIs. For the high-order systems, sufficient conditions for the existence of reduced-order model are derived in terms of LMIs. Moreover, the error system is guaranteed to be exponentially stable and an H∞ error performance is guaranteed. Numerical examples are also given to demonstrate the effectiveness and reduced conservatism of the obtained results.

Homogenous polynomially parameter-dependent H∞ filter designs of discrete-time fuzzy systems.

Science.gov (United States)

Zhang, Huaguang; Xie, Xiangpeng; Tong, Shaocheng

2011-10-01

This paper proposes a novel H(∞) filtering technique for a class of discrete-time fuzzy systems. First, a novel kind of fuzzy H(∞) filter, which is homogenous polynomially parameter dependent on membership functions with an arbitrary degree, is developed to guarantee the asymptotic stability and a prescribed H(∞) performance of the filtering error system. Second, relaxed conditions for H(∞) performance analysis are proposed by using a new fuzzy Lyapunov function and the Finsler lemma with homogenous polynomial matrix Lagrange multipliers. Then, based on a new kind of slack variable technique, relaxed linear matrix inequality-based H(∞) filtering conditions are proposed. Finally, two numerical examples are provided to illustrate the effectiveness of the proposed approach.

Order-disorder transitions in time-discrete mean field systems with memory: a novel approach via nonlinear autoregressive models

International Nuclear Information System (INIS)

Frank, T D; Mongkolsakulvong, S

2015-01-01

In a previous study strongly nonlinear autoregressive (SNAR) models have been introduced as a generalization of the widely-used time-discrete autoregressive models that are known to apply both to Markov and non-Markovian systems. In contrast to conventional autoregressive models, SNAR models depend on process mean values. So far, only linear dependences have been studied. We consider the case in which process mean values can have a nonlinear impact on the processes under consideration. It is shown that such models describe Markov and non-Markovian many-body systems with mean field forces that exhibit a nonlinear impact on single subsystems. We exemplify that such nonlinear dependences can describe order-disorder phase transitions of time-discrete Markovian and non-Markovian many-body systems. The relevant order parameter equations are derived and issues of stability and stationarity are studied. (paper)

Robust self-triggered model predictive control for constrained discrete-time LTI systems based on homothetic tubes

NARCIS (Netherlands)

Aydiner, E.; Brunner, F.D.; Heemels, W.P.M.H.; Allgower, F.

2015-01-01

In this paper we present a robust self-triggered model predictive control (MPC) scheme for discrete-time linear time-invariant systems subject to input and state constraints and additive disturbances. In self-triggered model predictive control, at every sampling instant an optimization problem based

A PC-based discrete tomography imaging software system for assaying radioactive waste containers

International Nuclear Information System (INIS)

Palacios, J.C.; Longoria, L.C.; Santos, J.; Perry, R.T.

2003-01-01

A PC-based discrete tomography imaging software system for assaying radioactive waste containers for use in facilities in Mexico has been developed. The software system consists of three modules: (i) for reconstruction transmission tomography, (ii) for reconstruction emission tomography, and (iii) for simulation tomography. The Simulation Module is an interactive computer program that is used to create simulated databases for input to the Reconstruction Modules. These databases may be used in the absence of physical measurements to insure that the tomographic theoretical models are valid and that the coding accurately describes these models. Simulation may also be used to determine the detection limits of the reconstruction methodology. A description of the system, the theory, and a demonstration of the systems capabilities is provided in the paper. The hardware for this system is currently under development

From Discrete Space-Time to Minkowski Space: Basic Mechanisms, Methods and Perspectives

Science.gov (United States)

Finster, Felix

This survey article reviews recent results on fermion systems in discrete space-time and corresponding systems in Minkowski space. After a basic introduction to the discrete setting, we explain a mechanism of spontaneous symmetry breaking which leads to the emergence of a discrete causal structure. As methods to study the transition between discrete space-time and Minkowski space, we describe a lattice model for a static and isotropic space-time, outline the analysis of regularization tails of vacuum Dirac sea configurations, and introduce a Lorentz invariant action for the masses of the Dirac seas. We mention the method of the continuum limit, which allows to analyze interacting systems. Open problems are discussed.

Discrete modeling considerations in multiphase fluid dynamics

International Nuclear Information System (INIS)

Ransom, V.H.; Ramshaw, J.D.

1988-01-01

The modeling of multiphase flows play a fundamental role in light water reactor safety. The main ingredients in our discrete modeling Weltanschauung are the following considerations: (1) Any physical model must be cast into discrete form for a digital computer. (2) The usual approach of formulating models in differential form and then discretizing them is potentially hazardous. It may be preferable to formulate the model in discrete terms from the outset. (3) Computer time and storage constraints limit the resolution that can be employed in practical calculations. These limits effectively define the physical phenomena, length scales, and time scales which cannot be directly represented in the calculation and therefore must be modeled. This information should be injected into the model formulation process at an early stage. (4) Practical resolution limits are generally so coarse that traditional convergence and truncation-error analyses become irrelevant. (5) A discrete model constitutes a reduced description of a physical system, from which fine-scale details are eliminated. This elimination creates a statistical closure problem. Methods from statistical physics may therefore be useful in the formulation of discrete models. In the present paper we elaborate on these themes and illustrate them with simple examples. 48 refs

CONFIG - Adapting qualitative modeling and discrete event simulation for design of fault management systems

Science.gov (United States)

Malin, Jane T.; Basham, Bryan D.

1989-01-01

CONFIG is a modeling and simulation tool prototype for analyzing the normal and faulty qualitative behaviors of engineered systems. Qualitative modeling and discrete-event simulation have been adapted and integrated, to support early development, during system design, of software and procedures for management of failures, especially in diagnostic expert systems. Qualitative component models are defined in terms of normal and faulty modes and processes, which are defined by invocation statements and effect statements with time delays. System models are constructed graphically by using instances of components and relations from object-oriented hierarchical model libraries. Extension and reuse of CONFIG models and analysis capabilities in hybrid rule- and model-based expert fault-management support systems are discussed.

A Generalized Stability Theorem for Discrete-Time Nonautonomous Chaos System with Applications

Directory of Open Access Journals (Sweden)

Mei Zhang

2015-01-01

Full Text Available Firstly, this study introduces a definition of generalized stability (GST in discrete-time nonautonomous chaos system (DNCS, which is an extension for chaos generalized synchronization. Secondly, a constructive theorem of DNCS has been proposed. As an example, a GST DNCS is constructed based on a novel 4-dimensional discrete chaotic map. Numerical simulations show that the dynamic behaviors of this map have chaotic attractor characteristics. As one application, we design a chaotic pseudorandom number generator (CPRNG based on the GST DNCS. We use the SP800-22 test suite to test the randomness of four 100-key streams consisting of 1,000,000 bits generated by the CPRNG, the RC4 algorithm, the ZUC algorithm, and a 6-dimensional CGS-based CPRNG, respectively. The numerical results show that the randomness performances of the two CPRNGs are promising. In addition, theoretically the key space of the CPRNG is larger than 21116. As another application, this study designs a stream avalanche encryption scheme (SAES in RGB image encryption. The results show that the GST DNCS is able to generate the avalanche effects which are similar to those generated via ideal CPRNGs.

Discrete ambiguities in CP-violating asymmetries in B decays

International Nuclear Information System (INIS)

London, David

1998-01-01

The CP-angles α, β and γ can be extracted from CP-violating asymmetries in the B system, but only up to discrete ambiguities. These discrete ambiguities make it difficult to determine with certainty whether or not new physics is present. I show that, if the condition α+β+γ=π is imposed, there remains a twofold ambiguity in the CP-angle set (α,β,γ), and I discuss ways to cleanly resolve this final discrete ambiguity

Strongly asymmetric discrete Painlevé equations: The additive case

Energy Technology Data Exchange (ETDEWEB)

Grammaticos, B. [IMNC, Université Paris VII and XI, CNRS, UMR 8165, Bât. 440, 91406 Orsay (France); Ramani, A. [Centre de Physique Théorique, Ecole Polytechnique, CNRS, 91128 Palaiseau (France); Tamizhmani, K. M. [Department of Mathematics, Pondicherry University, Kalapet, 605014 Puducherry (India); Tamizhmani, T. [Avvaiyar Government College for Women, 609602 Karaikal (India); Satsuma, J. [Department of Physics and Mathematics, Aoyama Gakuin University, 5-10-1 Fuchinobe, Chuo-ku, Sagamihara-shi 252-5258 (Japan)

2014-05-15

We examine a class of discrete Painlevé equations which present a strong asymmetry. These equations can be written as a system of two equations, the right-hand-sides of which do not have the same functional form. We limit here our investigation to two canonical families of the Quispel-Roberts-Thompson (QRT) classification both of which lead to difference equations. Several new integrable discrete systems are identified.

The Role of Discrete Global Grid Systems in the Global Statistical Geospatial Framework

Science.gov (United States)

Purss, M. B. J.; Peterson, P.; Minchin, S. A.; Bermudez, L. E.

2016-12-01

The United Nations Committee of Experts on Global Geospatial Information Management (UN-GGIM) has proposed the development of a Global Statistical Geospatial Framework (GSGF) as a mechanism for the establishment of common analytical systems that enable the integration of statistical and geospatial information. Conventional coordinate reference systems address the globe with a continuous field of points suitable for repeatable navigation and analytical geometry. While this continuous field is represented on a computer in a digitized and discrete fashion by tuples of fixed-precision floating point values, it is a non-trivial exercise to relate point observations spatially referenced in this way to areal coverages on the surface of the Earth. The GSGF states the need to move to gridded data delivery and the importance of using common geographies and geocoding. The challenges associated with meeting these goals are not new and there has been a significant effort within the geospatial community to develop nested gridding standards to tackle these issues over many years. These efforts have recently culminated in the development of a Discrete Global Grid Systems (DGGS) standard which has been developed under the auspices of Open Geospatial Consortium (OGC). DGGS provide a fixed areal based geospatial reference frame for the persistent location of measured Earth observations, feature interpretations, and modelled predictions. DGGS address the entire planet by partitioning it into a discrete hierarchical tessellation of progressively finer resolution cells, which are referenced by a unique index that facilitates rapid computation, query and analysis. The geometry and location of the cell is the principle aspect of a DGGS. Data integration, decomposition, and aggregation is optimised in the DGGS hierarchical structure and can be exploited for efficient multi-source data processing, storage, discovery, transmission, visualization, computation, analysis, and modelling. During

From street level to system level bureaucracies. How ICT is transforming administrative discretion and constitutional control

NARCIS (Netherlands)

Bovens, M.A.P.; Zouridis, S.

2002-01-01

The use of ICT is rapidly changing the structure of a number of large executive public agencies. They used to be machine bureaucracies in which street level officials exercised ample administrative discretion in dealing with individual clients. This was kept in check by elaborate systems of external

A Computationally Efficient and Robust Implementation of the Continuous-Discrete Extended Kalman Filter

DEFF Research Database (Denmark)

Jørgensen, John Bagterp; Thomsen, Per Grove; Madsen, Henrik

2007-01-01

for nonlinear stochastic continuous-discrete time systems is more than two orders of magnitude faster than a conventional implementation. This is of significance in nonlinear model predictive control applications, statistical process monitoring as well as grey-box modelling of systems described by stochastic......We present a novel numerically robust and computationally efficient extended Kalman filter for state estimation in nonlinear continuous-discrete stochastic systems. The resulting differential equations for the mean-covariance evolution of the nonlinear stochastic continuous-discrete time systems...

Fault detection for discrete-time LPV systems using interval observers

Science.gov (United States)

Zhang, Zhi-Hui; Yang, Guang-Hong

2017-10-01

This paper is concerned with the fault detection (FD) problem for discrete-time linear parameter-varying systems subject to bounded disturbances. A parameter-dependent FD interval observer is designed based on parameter-dependent Lyapunov and slack matrices. The design method is presented by translating the parameter-dependent linear matrix inequalities (LMIs) into finite ones. In contrast to the existing results based on parameter-independent and diagonal Lyapunov matrices, the derived disturbance attenuation, fault sensitivity and nonnegative conditions lead to less conservative LMI characterisations. Furthermore, without the need to design the residual evaluation functions and thresholds, the residual intervals generated by the interval observers are used directly for FD decision. Finally, simulation results are presented for showing the effectiveness and superiority of the proposed method.

Robust Active MPC Synchronization for Two Discrete-Time Chaotic Systems with Bounded Disturbance

Directory of Open Access Journals (Sweden)

Longge Zhang

2017-01-01

Full Text Available This paper proposes a synchronization scheme for two discrete-time chaotic systems with bounded disturbance. By using active control method and imposing some restriction on the error state, the computation of controller’s feedback matrix is converted to the min-max optimization problem. The theoretical results are derived with the aid of predictive model predictive paradigm and linear matrix inequality technique. Two example simulations are performed to show the effectiveness of the designed control method.

Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator

Czech Academy of Sciences Publication Activity Database

Komenda, Jan; Masopust, Tomáš; van Schuppen, J. H.

2011-01-01

Roč. 60, č. 7 (2011), s. 492-502 ISSN 0167-6911 R&D Projects: GA ČR(CZ) GAP103/11/0517; GA ČR(CZ) GPP202/11/P028 Grant - others:European Commission(XE) EU. ICT .DISC 224498 Institutional research plan: CEZ:AV0Z10190503 Keywords : discrete-event system * coordination control * coordinator Subject RIV: BA - General Mathematics Impact factor: 1.222, year: 2011 http://www.sciencedirect.com/science/article/pii/S0167691111000739

Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator

Czech Academy of Sciences Publication Activity Database

Komenda, Jan; Masopust, Tomáš; van Schuppen, J. H.

2011-01-01

Roč. 60, č. 7 (2011), s. 492-502 ISSN 0167-6911 R&D Projects: GA ČR(CZ) GAP103/11/0517; GA ČR(CZ) GPP202/11/P028 Grant - others:European Commission(XE) EU.ICT.DISC 224498 Institutional research plan: CEZ:AV0Z10190503 Keywords : discrete-event system * coordination control * coordinator Subject RIV: BA - General Mathematics Impact factor: 1.222, year: 2011 http://www.sciencedirect.com/science/article/pii/S0167691111000739

Compensatory neurofuzzy model for discrete data classification in biomedical

Science.gov (United States)

Ceylan, Rahime

2015-03-01

Biomedical data is separated to two main sections: signals and discrete data. So, studies in this area are about biomedical signal classification or biomedical discrete data classification. There are artificial intelligence models which are relevant to classification of ECG, EMG or EEG signals. In same way, in literature, many models exist for classification of discrete data taken as value of samples which can be results of blood analysis or biopsy in medical process. Each algorithm could not achieve high accuracy rate on classification of signal and discrete data. In this study, compensatory neurofuzzy network model is presented for classification of discrete data in biomedical pattern recognition area. The compensatory neurofuzzy network has a hybrid and binary classifier. In this system, the parameters of fuzzy systems are updated by backpropagation algorithm. The realized classifier model is conducted to two benchmark datasets (Wisconsin Breast Cancer dataset and Pima Indian Diabetes dataset). Experimental studies show that compensatory neurofuzzy network model achieved 96.11% accuracy rate in classification of breast cancer dataset and 69.08% accuracy rate was obtained in experiments made on diabetes dataset with only 10 iterations.

Failure diagnosis using discrete event models

International Nuclear Information System (INIS)

Sampath, M.; Sengupta, R.; Lafortune, S.; Teneketzis, D.; Sinnamohideen, K.

1994-01-01

We propose a Discrete Event Systems (DES) approach to the failure diagnosis problem. We present a methodology for modeling physical systems in a DES framework. We discuss the notion of diagnosability and present the construction procedure of the diagnoser. Finally, we illustrate our approach using a Heating, Ventilation and Air Conditioning (HVAC) system

Discrete-event system simulation on small and medium enterprises productivity improvement

Science.gov (United States)

Sulistio, J.; Hidayah, N. A.

2017-12-01

Small and medium industries in Indonesia is currently developing. The problem faced by SMEs is the difficulty of meeting growing demand coming into the company. Therefore, SME need an analysis and evaluation on its production process in order to meet all orders. The purpose of this research is to increase the productivity of SMEs production floor by applying discrete-event system simulation. This method preferred because it can solve complex problems die to the dynamic and stochastic nature of the system. To increase the credibility of the simulation, model validated by cooperating the average of two trials, two trials of variance and chi square test. Afterwards, Benferroni method applied to development several alternatives. The article concludes that, the productivity of SMEs production floor increased up to 50% by adding the capacity of dyeing and drying machines.

Discrete Element Modeling

Energy Technology Data Exchange (ETDEWEB)

Morris, J; Johnson, S

2007-12-03

The Distinct Element Method (also frequently referred to as the Discrete Element Method) (DEM) is a Lagrangian numerical technique where the computational domain consists of discrete solid elements which interact via compliant contacts. This can be contrasted with Finite Element Methods where the computational domain is assumed to represent a continuum (although many modern implementations of the FEM can accommodate some Distinct Element capabilities). Often the terms Discrete Element Method and Distinct Element Method are used interchangeably in the literature, although Cundall and Hart (1992) suggested that Discrete Element Methods should be a more inclusive term covering Distinct Element Methods, Displacement Discontinuity Analysis and Modal Methods. In this work, DEM specifically refers to the Distinct Element Method, where the discrete elements interact via compliant contacts, in contrast with Displacement Discontinuity Analysis where the contacts are rigid and all compliance is taken up by the adjacent intact material.

Consensus of discrete-time multi-agent systems with adversaries and time delays

Science.gov (United States)

Wu, Yiming; He, Xiongxiong; Liu, Shuai; Xie, Lihua

2014-05-01

This paper studies the resilient asymptotic consensus problem for discrete-time multi-agent systems in the presence of adversaries and transmission delays. The network is assumed to have ? loyal agents and ? adversarial agents, and each loyal agent in the network has no knowledge of the network topology other than an upper bound on the number of adversarial agents in its neighborhood. For the considered networked system, only locally delayed information is available for each loyal agent, and also the information flow is directed and a control protocol using only local information is designed to guarantee the realization of consensus with respect to communication graph, which satisfies a featured network robustness. Numerical examples are finally given to demonstrate the effectiveness of theoretical results.

Discrete time interval measurement system: fundamentals, resolution and errors in the measurement of angular vibrations

International Nuclear Information System (INIS)

Gómez de León, F C; Meroño Pérez, P A

2010-01-01

The traditional method for measuring the velocity and the angular vibration in the shaft of rotating machines using incremental encoders is based on counting the pulses at given time intervals. This method is generically called the time interval measurement system (TIMS). A variant of this method that we have developed in this work consists of measuring the corresponding time of each pulse from the encoder and sampling the signal by means of an A/D converter as if it were an analog signal, that is to say, in discrete time. For this reason, we have denominated this method as the discrete time interval measurement system (DTIMS). This measurement system provides a substantial improvement in the precision and frequency resolution compared with the traditional method of counting pulses. In addition, this method permits modification of the width of some pulses in order to obtain a mark-phase on every lap. This paper explains the theoretical fundamentals of the DTIMS and its application for measuring the angular vibrations of rotating machines. It also displays the required relationship between the sampling rate of the signal, the number of pulses of the encoder and the rotating velocity in order to obtain the required resolution and to delimit the methodological errors in the measurement

Analysis of queueing system with discrete autoregressive arrivals having DML as marginal distribution

Directory of Open Access Journals (Sweden)

Bindu Abraham

2014-05-01

Full Text Available In this paper we analyze DAR(1/D/s Queue with Discrete Mittag-Leffler [DML(α] as marginal distribution. Simulation study of the sample path of the arrival process is conducted. For this queueing system, the stationary distribution of the system size and the waiting time distribution of an arbitrary packet is obtained with the help of matrix analytic methods and Markov regenerative theory. The quantitative effect of the stationary distribution on system size, waiting time and  the autocorrelation function as well as the parameters of the input traffic is illustrated empirically. The model is applied to a real data on the passenger arrivals at a subway bus terminal in Santiago de Chile and is established that the model well suits this data.

Improved decomposition–coordination and discrete differential dynamic programming for optimization of large-scale hydropower system

International Nuclear Information System (INIS)

Li, Chunlong; Zhou, Jianzhong; Ouyang, Shuo; Ding, Xiaoling; Chen, Lu

2014-01-01

Highlights: • Optimization of large-scale hydropower system in the Yangtze River basin. • Improved decomposition–coordination and discrete differential dynamic programming. • Generating initial solution randomly to reduce generation time. • Proposing relative coefficient for more power generation. • Proposing adaptive bias corridor technology to enhance convergence speed. - Abstract: With the construction of major hydro plants, more and more large-scale hydropower systems are taking shape gradually, which brings up a challenge to optimize these systems. Optimization of large-scale hydropower system (OLHS), which is to determine water discharges or water levels of overall hydro plants for maximizing total power generation when subjecting to lots of constrains, is a high dimensional, nonlinear and coupling complex problem. In order to solve the OLHS problem effectively, an improved decomposition–coordination and discrete differential dynamic programming (IDC–DDDP) method is proposed in this paper. A strategy that initial solution is generated randomly is adopted to reduce generation time. Meanwhile, a relative coefficient based on maximum output capacity is proposed for more power generation. Moreover, an adaptive bias corridor technology is proposed to enhance convergence speed. The proposed method is applied to long-term optimal dispatches of large-scale hydropower system (LHS) in the Yangtze River basin. Compared to other methods, IDC–DDDP has competitive performances in not only total power generation but also convergence speed, which provides a new method to solve the OLHS problem

Near-Capacity Coding for Discrete Multitone Systems with Impulse Noise

Directory of Open Access Journals (Sweden)

Kschischang Frank R

2006-01-01

Full Text Available We consider the design of near-capacity-achieving error-correcting codes for a discrete multitone (DMT system in the presence of both additive white Gaussian noise and impulse noise. Impulse noise is one of the main channel impairments for digital subscriber lines (DSL. One way to combat impulse noise is to detect the presence of the impulses and to declare an erasure when an impulse occurs. In this paper, we propose a coding system based on low-density parity-check (LDPC codes and bit-interleaved coded modulation that is capable of taking advantage of the knowledge of erasures. We show that by carefully choosing the degree distribution of an irregular LDPC code, both the additive noise and the erasures can be handled by a single code, thus eliminating the need for an outer code. Such a system can perform close to the capacity of the channel and for the same redundancy is significantly more immune to the impulse noise than existing methods based on an outer Reed-Solomon (RS code. The proposed method has a lower implementation complexity than the concatenated coding approach.

Explicit/multi-parametric model predictive control (MPC) of linear discrete-time systems by dynamic and multi-parametric programming

KAUST Repository

Kouramas, K.I.; Faí sca, N.P.; Panos, C.; Pistikopoulos, E.N.

2011-01-01

This work presents a new algorithm for solving the explicit/multi- parametric model predictive control (or mp-MPC) problem for linear, time-invariant discrete-time systems, based on dynamic programming and multi-parametric programming techniques

A Discrete Spectral Problem and Related Hierarchy of Discrete Hamiltonian Lattice Equations

International Nuclear Information System (INIS)

Xu Xixiang; Cao Weili

2007-01-01

Staring from a discrete matrix spectral problem, a hierarchy of lattice soliton equations is presented though discrete zero curvature representation. The resulting lattice soliton equations possess non-local Lax pairs. The Hamiltonian structures are established for the resulting hierarchy by the discrete trace identity. Liouville integrability of resulting hierarchy is demonstrated.

Discrete exterior calculus discretization of incompressible Navier–Stokes equations over surface simplicial meshes

KAUST Repository

Mohamed, Mamdouh S.; Hirani, Anil N.; Samtaney, Ravi

2016-01-01

A conservative discretization of incompressible Navier–Stokes equations is developed based on discrete exterior calculus (DEC). A distinguishing feature of our method is the use of an algebraic discretization of the interior product operator and a

Discrete Green’s functions for propagators between complex objects in discrete space-time nonlinear electromagnetics

NARCIS (Netherlands)

Arnold, J.M.; Hon, de B.P.; Graglia, R.D.

2007-01-01

We propose a potential-based form of the FDTD scheme, with potentials driven by sources that are themselves simple dynamical systems. This formulation admits a radiative boundary condition for the discrete-mesh Maxwell's equations in a multiply connected exterior domain, which facilitates

On discrete symmetries for a whole Abelian model

International Nuclear Information System (INIS)

Chauca, J.; Doria, R.

2012-01-01

Considering the whole concept applied to gauge theory a nonlinear abelian model is derived. A next step is to understand on the model properties. At this work, it will be devoted to discrete symmetries. For this, we will work based in two fields reference systems. This whole gauge symmetry allows to be analyzed through different sets which are the constructor basis {D μ ,X i μ } and the physical basis {G μI }. Taking as fields reference system the diagonalized spin-1 sector, P, C, T and PCT symmetries are analyzed. They show that under this systemic model there are conservation laws driven for the parts and for the whole. It develops the meaning of whole-parity, field-parity and so on. However it is the whole symmetry that rules. This means that usually forbidden particles as pseudovector photons can be introduced through such whole abelian system. As result, one notices that the fields whole {G μI } manifest a quanta diversity. It involves particles with different spins, masses and discrete quantum numbers under a same gauge symmetry. It says that without violating PCT symmetry different possibilities on discrete symmetries can be accommodated.

Asymptotic behavior of discrete holomorphic maps z^c, log(z) and discrete Painleve transcedents

OpenAIRE

Agafonov, S. I.

2005-01-01

It is shown that discrete analogs of z^c and log(z) have the same asymptotic behavior as their smooth counterparts. These discrete maps are described in terms of special solutions of discrete Painleve-II equations, asymptotics of these solutions providing the behaviour of discrete z^c and log(z) at infinity.

A Discrete Dynamical System Approach to Pathway Activation Profiles of Signaling Cascades.

Science.gov (United States)

Catozzi, S; Sepulchre, J-A

2017-08-01

In living organisms, cascades of covalent modification cycles are one of the major intracellular signaling mechanisms, allowing to transduce physical or chemical stimuli of the external world into variations of activated biochemical species within the cell. In this paper, we develop a novel method to study the stimulus-response of signaling cascades and overall the concept of pathway activation profile which is, for a given stimulus, the sequence of activated proteins at each tier of the cascade. Our approach is based on a correspondence that we establish between the stationary states of a cascade and pieces of orbits of a 2D discrete dynamical system. The study of its possible phase portraits in function of the biochemical parameters, and in particular of the contraction/expansion properties around the fixed points of this discrete map, as well as their bifurcations, yields a classification of the cascade tiers into three main types, whose biological impact within a signaling network is examined. In particular, our approach enables to discuss quantitatively the notion of cascade amplification/attenuation from this new perspective. The method allows also to study the interplay between forward and "retroactive" signaling, i.e., the upstream influence of an inhibiting drug bound to the last tier of the cascade.

Exactly and quasi-exactly solvable 'discrete' quantum mechanics.

Science.gov (United States)

Sasaki, Ryu

2011-03-28

A brief introduction to discrete quantum mechanics is given together with the main results on various exactly solvable systems. Namely, the intertwining relations, shape invariance, Heisenberg operator solutions, annihilation/creation operators and dynamical symmetry algebras, including the q-oscillator algebra and the Askey-Wilson algebra. A simple recipe to construct exactly and quasi-exactly solvable (QES) Hamiltonians in one-dimensional 'discrete' quantum mechanics is presented. It reproduces all the known Hamiltonians whose eigenfunctions consist of the Askey scheme of hypergeometric orthogonal polynomials of a continuous or a discrete variable. Several new exactly and QES Hamiltonians are constructed. The sinusoidal coordinate plays an essential role.

Geometry of the Borel - de Siebenthal discrete series

DEFF Research Database (Denmark)

Ørsted, Bent; Wolf, Joseph A

Let G0 be a connected, simply connected real simple Lie group. Suppose that G0 has a compact Cartan subgroup T0, so it has discrete series representations. Relative to T0 there is a distinguished positive root system + for which there is a unique noncompact simple root , the “Borel – de Siebenthal...... system”. There is a lot of fascinating geometry associated to the corresponding “Borel – de Siebenthal discrete series” representations of G0. In this paper we explore some of those geometric aspects and we work out the K0–spectra of the Borel – de Siebenthal discrete series representations. This has...

Discretization-dependent model for weakly connected excitable media

Science.gov (United States)

Arroyo, Pedro André; Alonso, Sergio; Weber dos Santos, Rodrigo

2018-03-01

Pattern formation has been widely observed in extended chemical and biological processes. Although the biochemical systems are highly heterogeneous, homogenized continuum approaches formed by partial differential equations have been employed frequently. Such approaches are usually justified by the difference of scales between the heterogeneities and the characteristic spatial size of the patterns. Under different conditions, for example, under weak coupling, discrete models are more adequate. However, discrete models may be less manageable, for instance, in terms of numerical implementation and mesh generation, than the associated continuum models. Here we study a model to approach discreteness which permits the computer implementation on general unstructured meshes. The model is cast as a partial differential equation but with a parameter that depends not only on heterogeneities sizes, as in the case of quasicontinuum models, but also on the discretization mesh. Therefore, we refer to it as a discretization-dependent model. We validate the approach in a generic excitable media that simulates three different phenomena: the propagation of action membrane potential in cardiac tissue, in myelinated axons of neurons, and concentration waves in chemical microemulsions.

Discrete Variational Approach for Modeling Laser-Plasma Interactions

Science.gov (United States)

Reyes, J. Paxon; Shadwick, B. A.

2014-10-01

The traditional approach for fluid models of laser-plasma interactions begins by approximating fields and derivatives on a grid in space and time, leading to difference equations that are manipulated to create a time-advance algorithm. In contrast, by introducing the spatial discretization at the level of the action, the resulting Euler-Lagrange equations have particular differencing approximations that will exactly satisfy discrete versions of the relevant conservation laws. For example, applying a spatial discretization in the Lagrangian density leads to continuous-time, discrete-space equations and exact energy conservation regardless of the spatial grid resolution. We compare the results of two discrete variational methods using the variational principles from Chen and Sudan and Brizard. Since the fluid system conserves energy and momentum, the relative errors in these conserved quantities are well-motivated physically as figures of merit for a particular method. This work was supported by the U. S. Department of Energy under Contract No. DE-SC0008382 and by the National Science Foundation under Contract No. PHY-1104683.

Discrete systems related to the sixth Painleve equation

International Nuclear Information System (INIS)

Ramani, A; Ohta, Y; Grammaticos, B

2006-01-01

We present discrete Painleve equations which can be obtained as contiguity relations of the solutions of the continuous Painleve VI. The derivation is based on the geometry of the affine Weyl group D (1) 4 associated with the bilinear formalism. As an offshoot we also present the contiguity relations of the solutions of the Bureau-Ablowitz-Fokas equation, which is a Miura transformed, 'modified', P VI

Fundamental aspects of brittle damage processes -- discrete systems

International Nuclear Information System (INIS)

Krajcinovic, D.; Lubarda, V.

1993-01-01

The analysis of cooperative brittle processes are performed on simple discrete models admitting closed form solutions. A connection between the damage and fracture mechanics is derived and utilized to illustrate the relation between two theories. The performed analyses suggest that the stress concentrations (direct interaction between defects) represent a second order effect during the hardening part of the response in the case of disordered solids

Fault-tolerant Control of Discrete-time LPV systems using Virtual Actuators and Sensors

DEFF Research Database (Denmark)

Tabatabaeipour, Mojtaba; Stoustrup, Jakob; Bak, Thomas

2015-01-01

This paper proposes a new fault-tolerant control (FTC) method for discrete-time linear parameter varying (LPV) systems using a reconfiguration block. The basic idea of the method is to achieve the FTC goal without re-designing the nominal controller by inserting a reconfiguration block between......, it transforms the output of the controller for the faulty system such that the stability and performance goals are preserved. Input-to-state stabilizing LPV gains of the virtual actuator and sensor are obtained by solving linear matrix inequalities (LMIs). We show that separate design of these gains guarantees....... Finally, the effectiveness of the method is demonstrated via a numerical example and stator current control of an induction motor....

Synchronization Of Parallel Discrete Event Simulations

Science.gov (United States)

Steinman, Jeffrey S.

1992-01-01

Adaptive, parallel, discrete-event-simulation-synchronization algorithm, Breathing Time Buckets, developed in Synchronous Parallel Environment for Emulation and Discrete Event Simulation (SPEEDES) operating system. Algorithm allows parallel simulations to process events optimistically in fluctuating time cycles that naturally adapt while simulation in progress. Combines best of optimistic and conservative synchronization strategies while avoiding major disadvantages. Algorithm processes events optimistically in time cycles adapting while simulation in progress. Well suited for modeling communication networks, for large-scale war games, for simulated flights of aircraft, for simulations of computer equipment, for mathematical modeling, for interactive engineering simulations, and for depictions of flows of information.

Systematization of Accurate Discrete Optimization Methods

Directory of Open Access Journals (Sweden)

V. A. Ovchinnikov

2015-01-01

Full Text Available The object of study of this paper is to define accurate methods for solving combinatorial optimization problems of structural synthesis. The aim of the work is to systemize the exact methods of discrete optimization and define their applicability to solve practical problems.The article presents the analysis, generalization and systematization of classical methods and algorithms described in the educational and scientific literature.As a result of research a systematic presentation of combinatorial methods for discrete optimization described in various sources is given, their capabilities are described and properties of the tasks to be solved using the appropriate methods are specified.

Discrete Data Qualification System and Method Comprising Noise Series Fault Detection

Science.gov (United States)

Fulton, Christopher; Wong, Edmond; Melcher, Kevin; Bickford, Randall

2013-01-01

A Sensor Data Qualification (SDQ) function has been developed that allows the onboard flight computers on NASA s launch vehicles to determine the validity of sensor data to ensure that critical safety and operational decisions are not based on faulty sensor data. This SDQ function includes a novel noise series fault detection algorithm for qualification of the output data from LO2 and LH2 low-level liquid sensors. These sensors are positioned in a launch vehicle s propellant tanks in order to detect propellant depletion during a rocket engine s boost operating phase. This detection capability can prevent the catastrophic situation where the engine operates without propellant. The output from each LO2 and LH2 low-level liquid sensor is a discrete valued signal that is expected to be in either of two states, depending on whether the sensor is immersed (wet) or exposed (dry). Conventional methods for sensor data qualification, such as threshold limit checking, are not effective for this type of signal due to its discrete binary-state nature. To address this data qualification challenge, a noise computation and evaluation method, also known as a noise fault detector, was developed to detect unreasonable statistical characteristics in the discrete data stream. The method operates on a time series of discrete data observations over a moving window of data points and performs a continuous examination of the resulting observation stream to identify the presence of anomalous characteristics. If the method determines the existence of anomalous results, the data from the sensor is disqualified for use by other monitoring or control functions.

Cone-beam tomography with discrete data sets

International Nuclear Information System (INIS)

Barrett, H.H.

1994-01-01

Sufficiently conditions for cone-beam data are well known for the case of continuous data collection along a cone-vortex curve with continuous detectors. These continuous conditions are inadequate for real-world data where discrete vertex geometries and discrete detector arrays are used. In this paper we present a theoretical formulation of cone-beam tomography with arbitrary discrete arrays of detectors and vertices. The theory models the imaging system as a linear continuous-to-discrete mapping and represents the continuous object exactly as a Fourier series. The reconstruction problem is posed as the estimation of some subset of the Fourier coefficients. The main goal of the theory is to determine which Fourier coefficients can be reliably determined from the data delivered by a specific discrete design. A fourier component will be well determined by the data if it satisfies two conditions: it makes a strong contribution to the data, and this contribution is relatively independent of the contribution of other Fourier components. To make these considerations precise, we introduce a concept called the cross-talk matrix. A diagonal element of this matrix measures the strength of a Fourier component in the data, while an off-diagonal element quantifies the dependence or aliasing of two different components. (Author)

Discrete mathematics with applications

CERN Document Server

Koshy, Thomas

2003-01-01

This approachable text studies discrete objects and the relationsips that bind them. It helps students understand and apply the power of discrete math to digital computer systems and other modern applications. It provides excellent preparation for courses in linear algebra, number theory, and modern/abstract algebra and for computer science courses in data structures, algorithms, programming languages, compilers, databases, and computation.* Covers all recommended topics in a self-contained, comprehensive, and understandable format for students and new professionals * Emphasizes problem-solving techniques, pattern recognition, conjecturing, induction, applications of varying nature, proof techniques, algorithm development and correctness, and numeric computations* Weaves numerous applications into the text* Helps students learn by doing with a wealth of examples and exercises: - 560 examples worked out in detail - More than 3,700 exercises - More than 150 computer assignments - More than 600 writing projects*...

A road to practical dielectric elastomer actuators based robotics and mechatronics: discrete actuation

Science.gov (United States)

Plante, Jean-Sébastien; Devita, Lauren M.; Dubowsky, Steven

2007-04-01

Fundamental studies of Dielectric Elastomer Actuators (DEAs) using viscoelastic materials such as VHB 4905/4910 from 3M showed significant advantages at high stretch rates. The film's viscous forces increase actuator life and the short power-on times minimize energy losses through current leakage. This paper presents a design paradigm that exploits these fundamental properties of DEAs called discrete actuation. Discrete actuation uses DEAs at high stretch rates to change the states of robotic or mechatronic systems in discrete steps. Each state of the system is stable and can be maintained without actuator power. Discrete actuation can be used in robotic and mechatronic applications such as manipulation and locomotion. The resolution of such systems increases with the number of discrete states, 10 to 100 being sufficient for many applications. An MRI-guided needle positioning device for cancer treatments and a space exploration robot using hopping for locomotion are presented as examples of this concept.

Discrete and continuous simulation theory and practice

CERN Document Server

Bandyopadhyay, Susmita

2014-01-01

When it comes to discovering glitches inherent in complex systems-be it a railway or banking, chemical production, medical, manufacturing, or inventory control system-developing a simulation of a system can identify problems with less time, effort, and disruption than it would take to employ the original. Advantageous to both academic and industrial practitioners, Discrete and Continuous Simulation: Theory and Practice offers a detailed view of simulation that is useful in several fields of study.This text concentrates on the simulation of complex systems, covering the basics in detail and exploring the diverse aspects, including continuous event simulation and optimization with simulation. It explores the connections between discrete and continuous simulation, and applies a specific focus to simulation in the supply chain and manufacturing field. It discusses the Monte Carlo simulation, which is the basic and traditional form of simulation. It addresses future trends and technologies for simulation, with par...

Discrete PID Tuning Using Artificial Intelligence Techniques

Directory of Open Access Journals (Sweden)

Petr DOLEŽEL

2009-06-01

Full Text Available PID controllers are widely used in industry these days due to their useful properties such as simple tuning or robustness. While they are applicable to many control problems, they can perform poorly in some applications. Highly nonlinear system control with constrained manipulated variable can be mentioned as an example. The point of the paper is to string together convenient qualities of conventional PID control and progressive techniques based on Artificial Intelligence. Proposed control method should deal with even highly nonlinear systems. To be more specific, there is described new method of discrete PID controller tuning in this paper. This method tunes discrete PID controller parameters online through the use of genetic algorithm and neural model of controlled system in order to control successfully even highly nonlinear systems. After method description and some discussion, there is performed control simulation and comparison to one chosen conventional control method.

Discrete exterior calculus discretization of incompressible Navier–Stokes equations over surface simplicial meshes

KAUST Repository

Mohamed, Mamdouh S.

2016-02-11

A conservative discretization of incompressible Navier–Stokes equations is developed based on discrete exterior calculus (DEC). A distinguishing feature of our method is the use of an algebraic discretization of the interior product operator and a combinatorial discretization of the wedge product. The governing equations are first rewritten using the exterior calculus notation, replacing vector calculus differential operators by the exterior derivative, Hodge star and wedge product operators. The discretization is then carried out by substituting with the corresponding discrete operators based on the DEC framework. Numerical experiments for flows over surfaces reveal a second order accuracy for the developed scheme when using structured-triangular meshes, and first order accuracy for otherwise unstructured meshes. By construction, the method is conservative in that both mass and vorticity are conserved up to machine precision. The relative error in kinetic energy for inviscid flow test cases converges in a second order fashion with both the mesh size and the time step.

Discrete exterior calculus discretization of incompressible Navier-Stokes equations over surface simplicial meshes

Science.gov (United States)

Mohamed, Mamdouh S.; Hirani, Anil N.; Samtaney, Ravi

2016-05-01

A conservative discretization of incompressible Navier-Stokes equations is developed based on discrete exterior calculus (DEC). A distinguishing feature of our method is the use of an algebraic discretization of the interior product operator and a combinatorial discretization of the wedge product. The governing equations are first rewritten using the exterior calculus notation, replacing vector calculus differential operators by the exterior derivative, Hodge star and wedge product operators. The discretization is then carried out by substituting with the corresponding discrete operators based on the DEC framework. Numerical experiments for flows over surfaces reveal a second order accuracy for the developed scheme when using structured-triangular meshes, and first order accuracy for otherwise unstructured meshes. By construction, the method is conservative in that both mass and vorticity are conserved up to machine precision. The relative error in kinetic energy for inviscid flow test cases converges in a second order fashion with both the mesh size and the time step.

Direct linearizing transform for three-dimensional discrete integrable systems: the lattice AKP, BKP and CKP equations.

Science.gov (United States)

Fu, Wei; Nijhoff, Frank W

2017-07-01

A unified framework is presented for the solution structure of three-dimensional discrete integrable systems, including the lattice AKP, BKP and CKP equations. This is done through the so-called direct linearizing transform, which establishes a general class of integral transforms between solutions. As a particular application, novel soliton-type solutions for the lattice CKP equation are obtained.

Explicit solutions to the semi-discrete modified KdV equation and motion of discrete plane curves

International Nuclear Information System (INIS)

Inoguchi, Jun-ichi; Kajiwara, Kenji; Matsuura, Nozomu; Ohta, Yasuhiro

2012-01-01

We construct explicit solutions to continuous motion of discrete plane curves described by a semi-discrete potential modified KdV equation. Explicit formulas in terms of the τ function are presented. Bäcklund transformations of the discrete curves are also discussed. We finally consider the continuous limit of discrete motion of discrete plane curves described by the discrete potential modified KdV equation to motion of smooth plane curves characterized by the potential modified KdV equation. (paper)

Model predictive control-based scheduler for repetitive discrete event systems with capacity constraints

Directory of Open Access Journals (Sweden)

Hiroyuki Goto

2013-07-01

Full Text Available A model predictive control-based scheduler for a class of discrete event systems is designed and developed. We focus on repetitive, multiple-input, multiple-output, and directed acyclic graph structured systems on which capacity constraints can be imposed. The target system’s behaviour is described by linear equations in max-plus algebra, referred to as state-space representation. Assuming that the system’s performance can be improved by paying additional cost, we adjust the system parameters and determine control inputs for which the reference output signals can be observed. The main contribution of this research is twofold, 1: For systems with capacity constraints, we derived an output prediction equation as functions of adjustable variables in a recursive form, 2: Regarding the construct for the system’s representation, we improved the structure to accomplish general operations which are essential for adjusting the system parameters. The result of numerical simulation in a later section demonstrates the effectiveness of the developed controller.

Optimization of stochastic discrete systems and control on complex networks computational networks

CERN Document Server

Lozovanu, Dmitrii

2014-01-01

This book presents the latest findings on stochastic dynamic programming models and on solving optimal control problems in networks. It includes the authors' new findings on determining the optimal solution of discrete optimal control problems in networks and on solving game variants of Markov decision problems in the context of computational networks. First, the book studies the finite state space of Markov processes and reviews the existing methods and algorithms for determining the main characteristics in Markov chains, before proposing new approaches based on dynamic programming and combinatorial methods. Chapter two is dedicated to infinite horizon stochastic discrete optimal control models and Markov decision problems with average and expected total discounted optimization criteria, while Chapter three develops a special game-theoretical approach to Markov decision processes and stochastic discrete optimal control problems. In closing, the book's final chapter is devoted to finite horizon stochastic con...

Testing the discreteness of spacetime at low energies

International Nuclear Information System (INIS)

Chardin, G.

1994-01-01

Expected at the Planck scale, the discreteness of spacetime can hardly be tested at such high energies in a foreseable future. However, the Bekenstein relation suggests another approach, based on the study of time-asymmetry. After a brief introduction to discrete physics, the relation between gravitation and discreteness on the one hand, and between gravitation and time-asymmetry on the other was investigated. These relations have led to reconsider the possibility that CP violation in the neutral kaon system, the only known microscopic 'arrow of time', could be attributed to gravitation. The arguments suggesting that 'antigravity' could occur for antimatter and could even be expected in General Relativity itself are summarized. Experimental tests are proposed. (author). 48 refs

Testing the discreteness of spacetime at low energies

Energy Technology Data Exchange (ETDEWEB)

Chardin, G. [CEA Centre d`Etudes de Saclay, 91 - Gif-sur-Yvette (France). Dept. d`Astrophysique, de la Physique des Particules, de la Physique Nucleaire et de l`Instrumentation Associee

1994-12-31

Expected at the Planck scale, the discreteness of spacetime can hardly be tested at such high energies in a foreseable future. However, the Bekenstein relation suggests another approach, based on the study of time-asymmetry. After a brief introduction to discrete physics, the relation between gravitation and discreteness on the one hand, and between gravitation and time-asymmetry on the other was investigated. These relations have led to reconsider the possibility that CP violation in the neutral kaon system, the only known microscopic `arrow of time`, could be attributed to gravitation. The arguments suggesting that `antigravity` could occur for antimatter and could even be expected in General Relativity itself are summarized. Experimental tests are proposed. (author). 48 refs.

LAN attack detection using Discrete Event Systems.

Science.gov (United States)

Hubballi, Neminath; Biswas, Santosh; Roopa, S; Ratti, Ritesh; Nandi, Sukumar

2011-01-01

Address Resolution Protocol (ARP) is used for determining the link layer or Medium Access Control (MAC) address of a network host, given its Internet Layer (IP) or Network Layer address. ARP is a stateless protocol and any IP-MAC pairing sent by a host is accepted without verification. This weakness in the ARP may be exploited by malicious hosts in a Local Area Network (LAN) by spoofing IP-MAC pairs. Several schemes have been proposed in the literature to circumvent these attacks; however, these techniques either make IP-MAC pairing static, modify the existing ARP, patch operating systems of all the hosts etc. In this paper we propose a Discrete Event System (DES) approach for Intrusion Detection System (IDS) for LAN specific attacks which do not require any extra constraint like static IP-MAC, changing the ARP etc. A DES model is built for the LAN under both a normal and compromised (i.e., spoofed request/response) situation based on the sequences of ARP related packets. Sequences of ARP events in normal and spoofed scenarios are similar thereby rendering the same DES models for both the cases. To create different ARP events under normal and spoofed conditions the proposed technique uses active ARP probing. However, this probing adds extra ARP traffic in the LAN. Following that a DES detector is built to determine from observed ARP related events, whether the LAN is operating under a normal or compromised situation. The scheme also minimizes extra ARP traffic by probing the source IP-MAC pair of only those ARP packets which are yet to be determined as genuine/spoofed by the detector. Also, spoofed IP-MAC pairs determined by the detector are stored in tables to detect other LAN attacks triggered by spoofing namely, man-in-the-middle (MiTM), denial of service etc. The scheme is successfully validated in a test bed. Copyright © 2010 ISA. Published by Elsevier Ltd. All rights reserved.

On the complete integrability of the discrete Nahm equations

International Nuclear Information System (INIS)

Murray, M.K.

2000-01-01

The discrete Nahm equations, a system of matrix valued difference equations, arose in the work of Braam and Austin on half-integral mass hyperbolic monopoles. We show that the discrete Nahm equations are completely integrable in a natural sense: to any solution we can associate a spectral curve and a holomorphic line-bundle over the spectral curve, such that the discrete-time DN evolution corresponds to walking in the Jacobian of the spectral curve in a straight line through the line-bundle with steps of a fixed size. Some of the implications for hyperbolic monopoles are also discussed. (orig.)

Time step rescaling recovers continuous-time dynamical properties for discrete-time Langevin integration of nonequilibrium systems.

Science.gov (United States)

Sivak, David A; Chodera, John D; Crooks, Gavin E

2014-06-19

When simulating molecular systems using deterministic equations of motion (e.g., Newtonian dynamics), such equations are generally numerically integrated according to a well-developed set of algorithms that share commonly agreed-upon desirable properties. However, for stochastic equations of motion (e.g., Langevin dynamics), there is still broad disagreement over which integration algorithms are most appropriate. While multiple desiderata have been proposed throughout the literature, consensus on which criteria are important is absent, and no published integration scheme satisfies all desiderata simultaneously. Additional nontrivial complications stem from simulating systems driven out of equilibrium using existing stochastic integration schemes in conjunction with recently developed nonequilibrium fluctuation theorems. Here, we examine a family of discrete time integration schemes for Langevin dynamics, assessing how each member satisfies a variety of desiderata that have been enumerated in prior efforts to construct suitable Langevin integrators. We show that the incorporation of a novel time step rescaling in the deterministic updates of position and velocity can correct a number of dynamical defects in these integrators. Finally, we identify a particular splitting (related to the velocity Verlet discretization) that has essentially universally appropriate properties for the simulation of Langevin dynamics for molecular systems in equilibrium, nonequilibrium, and path sampling contexts.

Modelling machine ensembles with discrete event dynamical system theory

Science.gov (United States)

Hunter, Dan

1990-01-01

Discrete Event Dynamical System (DEDS) theory can be utilized as a control strategy for future complex machine ensembles that will be required for in-space construction. The control strategy involves orchestrating a set of interactive submachines to perform a set of tasks for a given set of constraints such as minimum time, minimum energy, or maximum machine utilization. Machine ensembles can be hierarchically modeled as a global model that combines the operations of the individual submachines. These submachines are represented in the global model as local models. Local models, from the perspective of DEDS theory , are described by the following: a set of system and transition states, an event alphabet that portrays actions that takes a submachine from one state to another, an initial system state, a partial function that maps the current state and event alphabet to the next state, and the time required for the event to occur. Each submachine in the machine ensemble is presented by a unique local model. The global model combines the local models such that the local models can operate in parallel under the additional logistic and physical constraints due to submachine interactions. The global model is constructed from the states, events, event functions, and timing requirements of the local models. Supervisory control can be implemented in the global model by various methods such as task scheduling (open-loop control) or implementing a feedback DEDS controller (closed-loop control).

The Iterative Solution to Discrete-Time H∞ Control Problems for Periodic Systems

Directory of Open Access Journals (Sweden)

Ivan G. Ivanov

2016-03-01

Full Text Available This paper addresses the problem of solving discrete-time H ∞ control problems for periodic systems. The approach for solving such a type of equations is well known in the literature. However, the focus of our research is set on the numerical computation of the stabilizing solution. In particular, two effective methods for practical realization of the known iterative processes are described. Furthermore, a new iterative approach is investigated and applied. On the basis of numerical experiments, we compare the presented methods. A major conclusion is that the new iterative approach is faster than rest of the methods and it uses less RAM memory than other methods.

Optimal control of LQR for discrete time-varying systems with input delays

Science.gov (United States)

Yin, Yue-Zhu; Yang, Zhong-Lian; Yin, Zhi-Xiang; Xu, Feng

2018-04-01

In this work, we consider the optimal control problem of linear quadratic regulation for discrete time-variant systems with single input and multiple input delays. An innovative and simple method to derive the optimal controller is given. The studied problem is first equivalently converted into a problem subject to a constraint condition. Last, with the established duality, the problem is transformed into a static mathematical optimisation problem without input delays. The optimal control input solution to minimise performance index function is derived by solving this optimisation problem with two methods. A numerical simulation example is carried out and its results show that our two approaches are both feasible and very effective.

Robust ∞ Filtering of 2D Roesser Discrete Systems: A Polynomial Approach

Directory of Open Access Journals (Sweden)

Chakir El-Kasri

2012-01-01

procedure for generating conditions for the existence of a 2D discrete filter such that, for all admissible uncertainties, the error system is asymptotically stable, and the ∞ norm of the transfer function from the noise signal to the estimation error is below a prespecified level. These conditions are expressed as parameter-dependent linear matrix inequalities. Using homogeneous polynomially parameter-dependent filters of arbitrary degree on the uncertain parameters, the proposed method extends previous results in the quadratic framework and the linearly parameter-dependent framework, thus reducing its conservatism. Performance of the proposed method, in comparison with that of existing methods, is illustrated by two examples.

Transformation of nonlinear discrete-time system into the extended observer form

Science.gov (United States)

Kaparin, V.; Kotta, Ü.

2018-04-01

The paper addresses the problem of transforming discrete-time single-input single-output nonlinear state equations into the extended observer form, which, besides the input and output, also depends on a finite number of their past values. Necessary and sufficient conditions for the existence of both the extended coordinate and output transformations, solving the problem, are formulated in terms of differential one-forms, associated with the input-output equation, corresponding to the state equations. An algorithm for transformation of state equations into the extended observer form is proposed and illustrated by an example. Moreover, the considered approach is compared with the method of dynamic observer error linearisation, which likewise is intended to enlarge the class of systems transformable into an observer form.

Robust extended Kalman filter of discrete-time Markovian jump nonlinear system under uncertain noise

International Nuclear Information System (INIS)

Zhu, Jin; Park, Jun Hong; Lee, Kwan Soo; Spiryagin, Maksym

2008-01-01

This paper examines the problem of robust extended Kalman filter design for discrete -time Markovian jump nonlinear systems with noise uncertainty. Because of the existence of stochastic Markovian switching, the state and measurement equations of underlying system are subject to uncertain noise whose covariance matrices are time-varying or un-measurable instead of stationary. First, based on the expression of filtering performance deviation, admissible uncertainty of noise covariance matrix is given. Secondly, two forms of noise uncertainty are taken into account: Non- Structural and Structural. It is proved by applying game theory that this filter design is a robust mini-max filter. A numerical example shows the validity of the method

Normal scheme for solving the transport equation independently of spatial discretization

International Nuclear Information System (INIS)

Zamonsky, O.M.

1993-01-01

To solve the discrete ordinates neutron transport equation, a general order nodal scheme is used, where nodes are allowed to have different orders of approximation and the whole system reaches a final order distribution. Independence in the election of system discretization and order of approximation is obtained without loss of accuracy. The final equations and the iterative method to reach a converged order solution were implemented in a two-dimensional computer code to solve monoenergetic, isotropic scattering, external source problems. Two benchmark problems were solved using different automatic selection order methods. Results show accurate solutions without spatial discretization, regardless of the initial selection of distribution order. (author)

Model-Checking Discrete Duration Calculus

DEFF Research Database (Denmark)

Hansen, Michael Reichhardt

1994-01-01