Event-Based $H_\\infty $ State Estimation for Time-Varying Stochastic Dynamical Networks With State- and Disturbance-Dependent Noises.

Science.gov (United States)

Sheng, Li; Wang, Zidong; Zou, Lei; Alsaadi, Fuad E

2017-10-01

In this paper, the event-based finite-horizon H ∞ state estimation problem is investigated for a class of discrete time-varying stochastic dynamical networks with state- and disturbance-dependent noises [also called (x,v) -dependent noises]. An event-triggered scheme is proposed to decrease the frequency of the data transmission between the sensors and the estimator, where the signal is transmitted only when certain conditions are satisfied. The purpose of the problem addressed is to design a time-varying state estimator in order to estimate the network states through available output measurements. By employing the completing-the-square technique and the stochastic analysis approach, sufficient conditions are established to ensure that the error dynamics of the state estimation satisfies a prescribed H ∞ performance constraint over a finite horizon. The desired estimator parameters can be designed via solving coupled backward recursive Riccati difference equations. Finally, a numerical example is exploited to demonstrate the effectiveness of the developed state estimation scheme.

Delay-dependent exponential stability for neural networks with discrete and distributed time-varying delays

International Nuclear Information System (INIS)

Zhu Xunlin; Wang Youyi

2009-01-01

This Letter studies the exponential stability for a class of neural networks (NNs) with both discrete and distributed time-varying delays. Under weaker assumptions on the activation functions, by defining a more general type of Lyapunov functionals and developing a new convex combination technique, new less conservative and less complex stability criteria are established to guarantee the global exponential stability of the discussed NNs. The obtained conditions are dependent on both discrete and distributed delays, are expressed in terms of linear matrix inequalities (LMIs), and contain fewer decision variables. Numerical examples are given to illustrate the effectiveness and the less conservatism of the proposed conditions.

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...

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 ...

Improved Criteria on Delay-Dependent Stability for Discrete-Time Neural Networks with Interval Time-Varying Delays

Directory of Open Access Journals (Sweden)

O. M. Kwon

2012-01-01

Full Text Available The purpose of this paper is to investigate the delay-dependent stability analysis for discrete-time neural networks with interval time-varying delays. Based on Lyapunov method, improved delay-dependent criteria for the stability of the networks are derived in terms of linear matrix inequalities (LMIs by constructing a suitable Lyapunov-Krasovskii functional and utilizing reciprocally convex approach. Also, a new activation condition which has not been considered in the literature is proposed and utilized for derivation of stability criteria. Two numerical examples are given to illustrate the effectiveness of the proposed method.

An algebra of discrete event processes

Science.gov (United States)

Heymann, Michael; Meyer, George

1991-01-01

This report deals with an algebraic framework for modeling and control of discrete event processes. The report consists of two parts. The first part is introductory, and consists of a tutorial survey of the theory of concurrency in the spirit of Hoare's CSP, and an examination of the suitability of such an algebraic framework for dealing with various aspects of discrete event control. To this end a new concurrency operator is introduced and it is shown how the resulting framework can be applied. It is further shown that a suitable theory that deals with the new concurrency operator must be developed. In the second part of the report the formal algebra of discrete event control is developed. At the present time the second part of the report is still an incomplete and occasionally tentative working paper.

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.

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.

Discretely Integrated Condition Event (DICE) Simulation for Pharmacoeconomics.

Science.gov (United States)

Caro, J Jaime

2016-07-01

Several decision-analytic modeling techniques are in use for pharmacoeconomic analyses. Discretely integrated condition event (DICE) simulation is proposed as a unifying approach that has been deliberately designed to meet the modeling requirements in a straightforward transparent way, without forcing assumptions (e.g., only one transition per cycle) or unnecessary complexity. At the core of DICE are conditions that represent aspects that persist over time. They have levels that can change and many may coexist. Events reflect instantaneous occurrences that may modify some conditions or the timing of other events. The conditions are discretely integrated with events by updating their levels at those times. Profiles of determinant values allow for differences among patients in the predictors of the disease course. Any number of valuations (e.g., utility, cost, willingness-to-pay) of conditions and events can be applied concurrently in a single run. A DICE model is conveniently specified in a series of tables that follow a consistent format and the simulation can be implemented fully in MS Excel, facilitating review and validation. DICE incorporates both state-transition (Markov) models and non-resource-constrained discrete event simulation in a single formulation; it can be executed as a cohort or a microsimulation; and deterministically or stochastically.

Global Robust Stability of Switched Interval Neural Networks with Discrete and Distributed Time-Varying Delays of Neural Type

Directory of Open Access Journals (Sweden)

Huaiqin Wu

2012-01-01

Full Text Available By combing the theories of the switched systems and the interval neural networks, the mathematics model of the switched interval neural networks with discrete and distributed time-varying delays of neural type is presented. A set of the interval parameter uncertainty neural networks with discrete and distributed time-varying delays of neural type are used as the individual subsystem, and an arbitrary switching rule is assumed to coordinate the switching between these networks. By applying the augmented Lyapunov-Krasovskii functional approach and linear matrix inequality (LMI techniques, a delay-dependent criterion is achieved to ensure to such switched interval neural networks to be globally asymptotically robustly stable in terms of LMIs. The unknown gain matrix is determined by solving this delay-dependent LMIs. Finally, an illustrative example is given to demonstrate the validity of the theoretical results.

A delay-dependent LMI approach to dynamics analysis of discrete-time recurrent neural networks with time-varying delays

International Nuclear Information System (INIS)

Song, Qiankun; Wang, Zidong

2007-01-01

In this Letter, the analysis problem for the existence and stability of periodic solutions is investigated for a class of general discrete-time recurrent neural networks with time-varying delays. For the neural networks under study, a generalized activation function is considered, and the traditional assumptions on the boundedness, monotony and differentiability of the activation functions are removed. By employing the latest free-weighting matrix method, an appropriate Lyapunov-Krasovskii functional is constructed and several sufficient conditions are established to ensure the existence, uniqueness, and globally exponential stability of the periodic solution for the addressed neural network. The conditions are dependent on both the lower bound and upper bound of the time-varying time delays. Furthermore, the conditions are expressed in terms of the linear matrix inequalities (LMIs), which can be checked numerically using the effective LMI toolbox in MATLAB. Two simulation examples are given to show the effectiveness and less conservatism of the proposed criteria

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.

A mathematical approach for evaluating Markov models in continuous time without discrete-event simulation.

Science.gov (United States)

van Rosmalen, Joost; Toy, Mehlika; O'Mahony, James F

2013-08-01

Markov models are a simple and powerful tool for analyzing the health and economic effects of health care interventions. These models are usually evaluated in discrete time using cohort analysis. The use of discrete time assumes that changes in health states occur only at the end of a cycle period. Discrete-time Markov models only approximate the process of disease progression, as clinical events typically occur in continuous time. The approximation can yield biased cost-effectiveness estimates for Markov models with long cycle periods and if no half-cycle correction is made. The purpose of this article is to present an overview of methods for evaluating Markov models in continuous time. These methods use mathematical results from stochastic process theory and control theory. The methods are illustrated using an applied example on the cost-effectiveness of antiviral therapy for chronic hepatitis B. The main result is a mathematical solution for the expected time spent in each state in a continuous-time Markov model. It is shown how this solution can account for age-dependent transition rates and discounting of costs and health effects, and how the concept of tunnel states can be used to account for transition rates that depend on the time spent in a state. The applied example shows that the continuous-time model yields more accurate results than the discrete-time model but does not require much computation time and is easily implemented. In conclusion, continuous-time Markov models are a feasible alternative to cohort analysis and can offer several theoretical and practical advantages.

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...

Program For Parallel Discrete-Event Simulation

Science.gov (United States)

Beckman, Brian C.; Blume, Leo R.; Geiselman, John S.; Presley, Matthew T.; Wedel, John J., Jr.; Bellenot, Steven F.; Diloreto, Michael; Hontalas, Philip J.; Reiher, Peter L.; Weiland, Frederick P.

1991-01-01

User does not have to add any special logic to aid in synchronization. Time Warp Operating System (TWOS) computer program is special-purpose operating system designed to support parallel discrete-event simulation. Complete implementation of Time Warp mechanism. Supports only simulations and other computations designed for virtual time. Time Warp Simulator (TWSIM) subdirectory contains sequential simulation engine interface-compatible with TWOS. TWOS and TWSIM written in, and support simulations in, C programming language.

Robust stability analysis for Markovian jumping interval neural networks with discrete and distributed time-varying delays

International Nuclear Information System (INIS)

Balasubramaniam, P.; Lakshmanan, S.; Manivannan, A.

2012-01-01

Highlights: ► Robust stability analysis for Markovian jumping interval neural networks is considered. ► Both linear fractional and interval uncertainties are considered. ► A new LKF is constructed with triple integral terms. ► MATLAB LMI control toolbox is used to validate theoretical results. ► Numerical examples are given to illustrate the effectiveness of the proposed method. - Abstract: This paper investigates robust stability analysis for Markovian jumping interval neural networks with discrete and distributed time-varying delays. The parameter uncertainties are assumed to be bounded in given compact sets. The delay is assumed to be time-varying and belong to a given interval, which means that the lower and upper bounds of interval time-varying delays are available. Based on the new Lyapunov–Krasovskii functional (LKF), some inequality techniques and stochastic stability theory, new delay-dependent stability criteria have been obtained in terms of linear matrix inequalities (LMIs). Finally, two numerical examples are given to illustrate the less conservative and effectiveness of our theoretical results.

Speeding Up Network Simulations Using Discrete Time

OpenAIRE

Lucas, Aaron; Armbruster, Benjamin

2013-01-01

We develop a way of simulating disease spread in networks faster at the cost of some accuracy. Instead of a discrete event simulation (DES) we use a discrete time simulation. This aggregates events into time periods. We prove a bound on the accuracy attained. We also discuss the choice of step size and do an analytical comparison of the computational costs. Our error bound concept comes from the theory of numerical methods for SDEs and the basic proof structure comes from the theory of numeri...

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

Non-fragile ?-? control for discrete-time stochastic nonlinear systems under event-triggered protocols

Science.gov (United States)

Sun, Ying; Ding, Derui; Zhang, Sunjie; Wei, Guoliang; Liu, Hongjian

2018-07-01

In this paper, the non-fragile ?-? control problem is investigated for a class of discrete-time stochastic nonlinear systems under event-triggered communication protocols, which determine whether the measurement output should be transmitted to the controller or not. The main purpose of the addressed problem is to design an event-based output feedback controller subject to gain variations guaranteeing the prescribed disturbance attenuation level described by the ?-? performance index. By utilizing the Lyapunov stability theory combined with S-procedure, a sufficient condition is established to guarantee both the exponential mean-square stability and the ?-? performance for the closed-loop system. In addition, with the help of the orthogonal decomposition, the desired controller parameter is obtained in terms of the solution to certain linear matrix inequalities. Finally, a simulation example is exploited to demonstrate the effectiveness of the proposed event-based controller design scheme.

Network Science Research Laboratory (NSRL) Discrete Event Toolkit

Science.gov (United States)

2016-01-01

ARL-TR-7579 ● JAN 2016 US Army Research Laboratory Network Science Research Laboratory (NSRL) Discrete Event Toolkit by...Laboratory (NSRL) Discrete Event Toolkit by Theron Trout and Andrew J Toth Computational and Information Sciences Directorate, ARL...Research Laboratory (NSRL) Discrete Event Toolkit 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S) Theron Trout

Discrete Event Simulation Computers can be used to simulate the ...

Indian Academy of Sciences (India)

IAS Admin

people who use computers every moment of their waking lives, others even ... How is discrete event simulation different from other kinds of simulation? ... time, energy consumption .... Schedule the CustomerDeparture event for this customer.

Study on time-varying velocity measurement with self-mixing laser diode based on Discrete Chirp-Fourier Transform

International Nuclear Information System (INIS)

Zhang Zhaoyun; Gao Yang; Zhao Xinghai; Zhao Xiang

2011-01-01

Laser's optical output power and frequency are modulated when the optical beam is back-scattered into the active cavity of the laser. By signal processing, the Doppler frequency can be acquired, and the target's velocity can be calculated. Based on these properties, an interferometry velocity sensor can be designed. When target move in time-varying velocity mode, it is difficult to extract the target's velocity. Time-varying velocity measurement by self-mixing laser diode is explored. A mathematics model was proposed for the time-varying velocity (invariable acceleration) measurement by self-mixing laser diode. Based on this model, a Discrete Chirp-Fourier Transform (DCFT) method was applied, DCFT is analogous to DFT. We show that when the signal length N is prime, the magnitudes of all the side lobes are 1, whereas the magnitudes of the main lobe is √N, And the coordinates of the main lobe shows the target's velocity and acceleration information. The simulation results prove the validity of the algorithm even in the situation of low SNR when N is prime.

Synchronization of autonomous objects in discrete event simulation

Science.gov (United States)

Rogers, Ralph V.

1990-01-01

Autonomous objects in event-driven discrete event simulation offer the potential to combine the freedom of unrestricted movement and positional accuracy through Euclidean space of time-driven models with the computational efficiency of event-driven simulation. The principal challenge to autonomous object implementation is object synchronization. The concept of a spatial blackboard is offered as a potential methodology for synchronization. The issues facing implementation of a spatial blackboard are outlined and discussed.

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

Use cases of discrete event simulation. Appliance and research

Energy Technology Data Exchange (ETDEWEB)

Bangsow, Steffen (ed.)

2012-11-01

Use Cases of Discrete Event Simulation. Includes case studies from various important industries such as automotive, aerospace, robotics, production industry. Written by leading experts in the field. Over the last decades Discrete Event Simulation has conquered many different application areas. This trend is, on the one hand, driven by an ever wider use of this technology in different fields of science and on the other hand by an incredibly creative use of available software programs through dedicated experts. This book contains articles from scientists and experts from 10 countries. They illuminate the width of application of this technology and the quality of problems solved using Discrete Event Simulation. Practical applications of simulation dominate in the present book. The book is aimed to researchers and students who deal in their work with Discrete Event Simulation and which want to inform them about current applications. By focusing on discrete event simulation, this book can also serve as an inspiration source for practitioners for solving specific problems during their work. Decision makers who deal with the question of the introduction of discrete event simulation for planning support and optimization this book provides a contribution to the orientation, what specific problems could be solved with the help of Discrete Event Simulation within the organization.

On H∞ Fault Estimator Design for Linear Discrete Time-Varying Systems under Unreliable Communication Link

Directory of Open Access Journals (Sweden)

Yueyang Li

2014-01-01

Full Text Available This paper investigates the H∞ fixed-lag fault estimator design for linear discrete time-varying (LDTV systems with intermittent measurements, which is described by a Bernoulli distributed random variable. Through constructing a novel partially equivalent dynamic system, the fault estimator design is converted into a deterministic quadratic minimization problem. By applying the innovation reorganization technique and the projection formula in Krein space, a necessary and sufficient condition is obtained for the existence of the estimator. The parameter matrices of the estimator are derived by recursively solving two standard Riccati equations. An illustrative example is provided to show the effectiveness and applicability of the proposed algorithm.

Disaster Response Modeling Through Discrete-Event Simulation

Science.gov (United States)

Wang, Jeffrey; Gilmer, Graham

2012-01-01

Organizations today are required to plan against a rapidly changing, high-cost environment. This is especially true for first responders to disasters and other incidents, where critical decisions must be made in a timely manner to save lives and resources. Discrete-event simulations enable organizations to make better decisions by visualizing complex processes and the impact of proposed changes before they are implemented. A discrete-event simulation using Simio software has been developed to effectively analyze and quantify the imagery capabilities of domestic aviation resources conducting relief missions. This approach has helped synthesize large amounts of data to better visualize process flows, manage resources, and pinpoint capability gaps and shortfalls in disaster response scenarios. Simulation outputs and results have supported decision makers in the understanding of high risk locations, key resource placement, and the effectiveness of proposed improvements.

Use Cases of Discrete Event Simulation Appliance and Research

CERN Document Server

2012-01-01

Over the last decades Discrete Event Simulation has conquered many different application areas. This trend is, on the one hand, driven by an ever wider use of this technology in different fields of science and on the other hand by an incredibly creative use of available software programs through dedicated experts. This book contains articles from scientists and experts from 10 countries. They illuminate the width of application of this technology and the quality of problems solved using Discrete Event Simulation. Practical applications of simulation dominate in the present book.   The book is aimed to researchers and students who deal in their work with Discrete Event Simulation and which want to inform them about current applications. By focusing on discrete event simulation, this book can also serve as an inspiration source for practitioners for solving specific problems during their work. Decision makers who deal with the question of the introduction of discrete event simulation for planning support and o...

Parallel discrete event simulation using shared memory

Science.gov (United States)

Reed, Daniel A.; Malony, Allen D.; Mccredie, Bradley D.

1988-01-01

With traditional event-list techniques, evaluating a detailed discrete-event simulation-model can often require hours or even days of computation time. By eliminating the event list and maintaining only sufficient synchronization to ensure causality, parallel simulation can potentially provide speedups that are linear in the numbers of processors. A set of shared-memory experiments, using the Chandy-Misra distributed-simulation algorithm, to simulate networks of queues is presented. Parameters of the study include queueing network topology and routing probabilities, number of processors, and assignment of network nodes to processors. These experiments show that Chandy-Misra distributed simulation is a questionable alternative to sequential-simulation of most queueing network models.

Stability analysis of Markovian jumping stochastic Cohen—Grossberg neural networks with discrete and distributed time varying delays

International Nuclear Information System (INIS)

Ali, M. Syed

2014-01-01

In this paper, the global asymptotic stability problem of Markovian jumping stochastic Cohen—Grossberg neural networks with discrete and distributed time-varying delays (MJSCGNNs) is considered. A novel LMI-based stability criterion is obtained by constructing a new Lyapunov functional to guarantee the asymptotic stability of MJSCGNNs. Our results can be easily verified and they are also less restrictive than previously known criteria and can be applied to Cohen—Grossberg neural networks, recurrent neural networks, and cellular neural networks. Finally, the proposed stability conditions are demonstrated with numerical examples

Statistical and Probabilistic Extensions to Ground Operations' Discrete Event Simulation Modeling

Science.gov (United States)

Trocine, Linda; Cummings, Nicholas H.; Bazzana, Ashley M.; Rychlik, Nathan; LeCroy, Kenneth L.; Cates, Grant R.

2010-01-01

NASA's human exploration initiatives will invest in technologies, public/private partnerships, and infrastructure, paving the way for the expansion of human civilization into the solar system and beyond. As it is has been for the past half century, the Kennedy Space Center will be the embarkation point for humankind's journey into the cosmos. Functioning as a next generation space launch complex, Kennedy's launch pads, integration facilities, processing areas, launch and recovery ranges will bustle with the activities of the world's space transportation providers. In developing this complex, KSC teams work through the potential operational scenarios: conducting trade studies, planning and budgeting for expensive and limited resources, and simulating alternative operational schemes. Numerous tools, among them discrete event simulation (DES), were matured during the Constellation Program to conduct such analyses with the purpose of optimizing the launch complex for maximum efficiency, safety, and flexibility while minimizing life cycle costs. Discrete event simulation is a computer-based modeling technique for complex and dynamic systems where the state of the system changes at discrete points in time and whose inputs may include random variables. DES is used to assess timelines and throughput, and to support operability studies and contingency analyses. It is applicable to any space launch campaign and informs decision-makers of the effects of varying numbers of expensive resources and the impact of off nominal scenarios on measures of performance. In order to develop representative DES models, methods were adopted, exploited, or created to extend traditional uses of DES. The Delphi method was adopted and utilized for task duration estimation. DES software was exploited for probabilistic event variation. A roll-up process was used, which was developed to reuse models and model elements in other less - detailed models. The DES team continues to innovate and expand

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

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.

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

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

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...

Fixed-time synchronization of memristor-based BAM neural networks with time-varying discrete delay.

Science.gov (United States)

Chen, Chuan; Li, Lixiang; Peng, Haipeng; Yang, Yixian

2017-12-01

This paper is devoted to studying the fixed-time synchronization of memristor-based BAM neural networks (MBAMNNs) with discrete delay. Fixed-time synchronization means that synchronization can be achieved in a fixed time for any initial values of the considered systems. In the light of the double-layer structure of MBAMNNs, we design two similar feedback controllers. Based on Lyapunov stability theories, several criteria are established to guarantee that the drive and response MBAMNNs can realize synchronization in a fixed time. In particular, by changing the parameters of controllers, this fixed time can be adjusted to some desired value in advance, irrespective of the initial values of MBAMNNs. Numerical simulations are included to validate the derived results. Copyright © 2017 Elsevier Ltd. All rights reserved.

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

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

An Advanced Simulation Framework for Parallel Discrete-Event Simulation

Science.gov (United States)

Li, P. P.; Tyrrell, R. Yeung D.; Adhami, N.; Li, T.; Henry, H.

1994-01-01

Discrete-event simulation (DEVS) users have long been faced with a three-way trade-off of balancing execution time, model fidelity, and number of objects simulated. Because of the limits of computer processing power the analyst is often forced to settle for less than desired performances in one or more of these areas.

Synchronous Parallel Emulation and Discrete Event Simulation System with Self-Contained Simulation Objects and Active Event Objects

Science.gov (United States)

Steinman, Jeffrey S. (Inventor)

1998-01-01

The present invention is embodied in a method of performing object-oriented simulation and a system having inter-connected processor nodes operating in parallel to simulate mutual interactions of a set of discrete simulation objects distributed among the nodes as a sequence of discrete events changing state variables of respective simulation objects so as to generate new event-defining messages addressed to respective ones of the nodes. The object-oriented simulation is performed at each one of the nodes by assigning passive self-contained simulation objects to each one of the nodes, responding to messages received at one node by generating corresponding active event objects having user-defined inherent capabilities and individual time stamps and corresponding to respective events affecting one of the passive self-contained simulation objects of the one node, restricting the respective passive self-contained simulation objects to only providing and receiving information from die respective active event objects, requesting information and changing variables within a passive self-contained simulation object by the active event object, and producing corresponding messages specifying events resulting therefrom by the active event objects.

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

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

Parallel discrete event simulation: A shared memory approach

Science.gov (United States)

Reed, Daniel A.; Malony, Allen D.; Mccredie, Bradley D.

1987-01-01

With traditional event list techniques, evaluating a detailed discrete event simulation model can often require hours or even days of computation time. Parallel simulation mimics the interacting servers and queues of a real system by assigning each simulated entity to a processor. By eliminating the event list and maintaining only sufficient synchronization to insure causality, parallel simulation can potentially provide speedups that are linear in the number of processors. A set of shared memory experiments is presented using the Chandy-Misra distributed simulation algorithm to simulate networks of queues. Parameters include queueing network topology and routing probabilities, number of processors, and assignment of network nodes to processors. These experiments show that Chandy-Misra distributed simulation is a questionable alternative to sequential simulation of most queueing network models.

Parallel Stochastic discrete event simulation of calcium dynamics in neuron.

Science.gov (United States)

Ishlam Patoary, Mohammad Nazrul; Tropper, Carl; McDougal, Robert A; Zhongwei, Lin; Lytton, William W

2017-09-26

The intra-cellular calcium signaling pathways of a neuron depends on both biochemical reactions and diffusions. Some quasi-isolated compartments (e.g. spines) are so small and calcium concentrations are so low that one extra molecule diffusing in by chance can make a nontrivial difference in its concentration (percentage-wise). These rare events can affect dynamics discretely in such way that they cannot be evaluated by a deterministic simulation. Stochastic models of such a system provide a more detailed understanding of these systems than existing deterministic models because they capture their behavior at a molecular level. Our research focuses on the development of a high performance parallel discrete event simulation environment, Neuron Time Warp (NTW), which is intended for use in the parallel simulation of stochastic reaction-diffusion systems such as intra-calcium signaling. NTW is integrated with NEURON, a simulator which is widely used within the neuroscience community. We simulate two models, a calcium buffer and a calcium wave model. The calcium buffer model is employed in order to verify the correctness and performance of NTW by comparing it to a serial deterministic simulation in NEURON. We also derived a discrete event calcium wave model from a deterministic model using the stochastic IP3R structure.

Process algebra with timing : real time and discrete time

NARCIS (Netherlands)

Baeten, J.C.M.; Middelburg, C.A.; Bergstra, J.A.; Ponse, A.J.; Smolka, S.A.

2001-01-01

We present real time and discrete time versions of ACP with absolute timing and relative timing. The starting-point is a new real time version with absolute timing, called ACPsat, featuring urgent actions and a delay operator. The discrete time versions are conservative extensions of the discrete

Process algebra with timing: Real time and discrete time

NARCIS (Netherlands)

Baeten, J.C.M.; Middelburg, C.A.

1999-01-01

We present real time and discrete time versions of ACP with absolute timing and relative timing. The startingpoint is a new real time version with absolute timing, called ACPsat , featuring urgent actions and a delay operator. The discrete time versions are conservative extensions of the discrete

Discrete events simulation of a route with traffic lights through automated control in real time

Directory of Open Access Journals (Sweden)

Rodrigo César Teixeira Baptista

2013-03-01

Full Text Available This paper presents the integration and communication in real-time of a discrete event simulation model with an automatic control system. The simulation model of an intersection with roads having traffic lights was built in the Arena environment. The integration and communication have been made via network, and the control system was operated by a programmable logic controller. Scenarios were simulated for the free, regular and congested traffic situations. The results showed the average number of vehicles that entered in the system and that were retained and also the total average time of the crossing of the vehicles on the road. In general, the model allowed evaluating the behavior of the traffic in each of the ways and the commands from the controller to activation and deactivation of the traffic lights.

Asynchronous discrete event schemes for PDEs

Science.gov (United States)

Stone, D.; Geiger, S.; Lord, G. J.

2017-08-01

A new class of asynchronous discrete-event simulation schemes for advection-diffusion-reaction equations is introduced, based on the principle of allowing quanta of mass to pass through faces of a (regular, structured) Cartesian finite volume grid. The timescales of these events are linked to the flux on the face. The resulting schemes are self-adaptive, and local in both time and space. Experiments are performed on realistic physical systems related to porous media flow applications, including a large 3D advection diffusion equation and advection diffusion reaction systems. The results are compared to highly accurate reference solutions where the temporal evolution is computed with exponential integrator schemes using the same finite volume discretisation. This allows a reliable estimation of the solution error. Our results indicate a first order convergence of the error as a control parameter is decreased, and we outline a framework for analysis.

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.

A discrete event simulation model for evaluating time delays in a pipeline network

Energy Technology Data Exchange (ETDEWEB)

Spricigo, Deisi; Muggiati, Filipe V.; Lueders, Ricardo; Neves Junior, Flavio [Federal University of Technology of Parana (UTFPR), Curitiba, PR (Brazil)

2009-07-01

Currently in the oil industry the logistic chain stands out as a strong candidate to obtain highest profit, since recent studies have pointed out to a cost reduction by adoption of better policies for distribution of oil derivatives, particularly those where pipelines are used to transport products. Although there are models to represent transfers of oil derivatives in pipelines, they are quite complex and computationally burden. In this paper, we are interested on models that are less detailed in terms of fluid dynamics but provide more information about operational decisions in a pipeline network. We propose a discrete event simulation model in ARENA that allows simulating a pipeline network based on average historical data. Time delays for transferring different products can be evaluated through different routes. It is considered that transport operations follow a historical behavior and average time delays can thus be estimated within certain bounds. Due to its stochastic nature, time quantities are characterized by average and dispersion measures. This allows comparing different operational scenarios for product transportation. Simulation results are compared to data obtained from a real world pipeline network and different scenarios of production and demand are analyzed. (author)

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

The impact of interoperability of electronic health records on ambulatory physician practices: a discrete-event simulation study

Directory of Open Access Journals (Sweden)

Yuan Zhou

2014-02-01

Full Text Available Background The effect of health information technology (HIT on efficiency and workload among clinical and nonclinical staff has been debated, with conflicting evidence about whether electronic health records (EHRs increase or decrease effort. None of this paper to date, however, examines the effect of interoperability quantitatively using discrete event simulation techniques.Objective To estimate the impact of EHR systems with various levels of interoperability on day-to-day tasks and operations of ambulatory physician offices.Methods Interviews and observations were used to collect workflow data from 12 adult primary and specialty practices. A discrete event simulation model was constructed to represent patient flows and clinical and administrative tasks of physicians and staff members.Results High levels of EHR interoperability were associated with reduced time spent by providers on four tasks: preparing lab reports, requesting lab orders, prescribing medications, and writing referrals. The implementation of an EHR was associated with less time spent by administrators but more time spent by physicians, compared with time spent at paper-based practices. In addition, the presence of EHRs and of interoperability did not significantly affect the time usage of registered nurses or the total visit time and waiting time of patients.Conclusion This paper suggests that the impact of using HIT on clinical and nonclinical staff work efficiency varies, however, overall it appears to improve time efficiency more for administrators than for physicians and nurses.

Manufacturing plant performance evaluation by discrete event simulation

International Nuclear Information System (INIS)

Rosli Darmawan; Mohd Rasid Osman; Rosnah Mohd Yusuff; Napsiah Ismail; Zulkiflie Leman

2002-01-01

A case study was conducted to evaluate the performance of a manufacturing plant using discrete event simulation technique. The study was carried out on animal feed production plant. Sterifeed plant at Malaysian Institute for Nuclear Technology Research (MINT), Selangor, Malaysia. The plant was modelled base on the actual manufacturing activities recorded by the operators. The simulation was carried out using a discrete event simulation software. The model was validated by comparing the simulation results with the actual operational data of the plant. The simulation results show some weaknesses with the current plant design and proposals were made to improve the plant performance. (Author)

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.

ANALYSIS OF INPATIENT HOSPITAL STAFF MENTAL WORKLOAD BY MEANS OF DISCRETE-EVENT SIMULATION

Science.gov (United States)

2016-03-24

ANALYSIS OF INPATIENT HOSPITAL STAFF MENTAL WORKLOAD BY MEANS OF DISCRETE -EVENT SIMULATION...in the United States. AFIT-ENV-MS-16-M-166 ANALYSIS OF INPATIENT HOSPITAL STAFF MENTAL WORKLOAD BY MEANS OF DISCRETE -EVENT SIMULATION...UNLIMITED. AFIT-ENV-MS-16-M-166 ANALYSIS OF INPATIENT HOSPITAL STAFF MENTAL WORKLOAD BY MEANS OF DISCRETE -EVENT SIMULATION Erich W

A Novel Finite-Sum Inequality-Based Method for Robust H∞ Control of Uncertain Discrete-Time Takagi-Sugeno Fuzzy Systems With Interval-Like Time-Varying Delays.

Science.gov (United States)

Zhang, Xian-Ming; Han, Qing-Long; Ge, Xiaohua

2017-09-22

This paper is concerned with the problem of robust H∞ control of an uncertain discrete-time Takagi-Sugeno fuzzy system with an interval-like time-varying delay. A novel finite-sum inequality-based method is proposed to provide a tighter estimation on the forward difference of certain Lyapunov functional, leading to a less conservative result. First, an auxiliary vector function is used to establish two finite-sum inequalities, which can produce tighter bounds for the finite-sum terms appearing in the forward difference of the Lyapunov functional. Second, a matrix-based quadratic convex approach is employed to equivalently convert the original matrix inequality including a quadratic polynomial on the time-varying delay into two boundary matrix inequalities, which delivers a less conservative bounded real lemma (BRL) for the resultant closed-loop system. Third, based on the BRL, a novel sufficient condition on the existence of suitable robust H∞ fuzzy controllers is derived. Finally, two numerical examples and a computer-simulated truck-trailer system are provided to show the effectiveness of the obtained results.

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.

Running Parallel Discrete Event Simulators on Sierra

Energy Technology Data Exchange (ETDEWEB)

Barnes, P. D. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Jefferson, D. R. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

2015-12-03

In this proposal we consider porting the ROSS/Charm++ simulator and the discrete event models that run under its control so that they run on the Sierra architecture and make efficient use of the Volta GPUs.

Implementation of Tree and Butterfly Barriers with Optimistic Time Management Algorithms for Discrete Event Simulation

Science.gov (United States)

Rizvi, Syed S.; Shah, Dipali; Riasat, Aasia

The Time Wrap algorithm [3] offers a run time recovery mechanism that deals with the causality errors. These run time recovery mechanisms consists of rollback, anti-message, and Global Virtual Time (GVT) techniques. For rollback, there is a need to compute GVT which is used in discrete-event simulation to reclaim the memory, commit the output, detect the termination, and handle the errors. However, the computation of GVT requires dealing with transient message problem and the simultaneous reporting problem. These problems can be dealt in an efficient manner by the Samadi's algorithm [8] which works fine in the presence of causality errors. However, the performance of both Time Wrap and Samadi's algorithms depends on the latency involve in GVT computation. Both algorithms give poor latency for large simulation systems especially in the presence of causality errors. To improve the latency and reduce the processor ideal time, we implement tree and butterflies barriers with the optimistic algorithm. Our analysis shows that the use of synchronous barriers such as tree and butterfly with the optimistic algorithm not only minimizes the GVT latency but also minimizes the processor idle time.

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

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.

Synchronization of Markovian jumping stochastic complex networks with distributed time delays and probabilistic interval discrete time-varying delays

International Nuclear Information System (INIS)

Li Hongjie; Yue Dong

2010-01-01

The paper investigates the synchronization stability problem for a class of complex dynamical networks with Markovian jumping parameters and mixed time delays. The complex networks consist of m modes and the networks switch from one mode to another according to a Markovian chain with known transition probability. The mixed time delays are composed of discrete and distributed delays, the discrete time delay is assumed to be random and its probability distribution is known a priori. In terms of the probability distribution of the delays, the new type of system model with probability-distribution-dependent parameter matrices is proposed. Based on the stochastic analysis techniques and the properties of the Kronecker product, delay-dependent synchronization stability criteria in the mean square are derived in the form of linear matrix inequalities which can be readily solved by using the LMI toolbox in MATLAB, the solvability of derived conditions depends on not only the size of the delay, but also the probability of the delay-taking values in some intervals. Finally, a numerical example is given to illustrate the feasibility and effectiveness of the proposed method.

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

The dynamics of discrete populations and series of events

CERN Document Server

Hopcraft, Keith Iain; Ridley, Kevin D

2014-01-01

IntroductionReferencesStatistical PreliminariesIntroductionProbability DistributionsMoment-Generating FunctionsDiscrete ProcessesSeries of EventsSummaryFurther ReadingMarkovian Population ProcessesIntroductionBirths and DeathsImmigration and the Poisson ProcessThe Effect of MeasurementCorrelation of CountsSummaryFurther ReadingThe Birth-Death-Immigration ProcessIntroductionRate Equations for the ProcessEquation for the Generating FunctionGeneral Time-Dependent SolutionFluctuation Characteristics of a Birth-Death-Immigration PopulationSampling and Measurement ProcessesCorrelation of CountsSumma

An Explicit MOT-TD-VIE Solver for Time Varying Media

KAUST Repository

Sayed, Sadeed Bin

2016-03-15

An explicit marching on-in-time (MOT) scheme for solving the time domain electric field integral equation enforced on volumes with time varying dielectric permittivity is proposed. Unknowns of the integral equation and the constitutive relation, i.e., flux density and field intensity, are discretized using full and half Schaubert-Wilton-Glisson functions in space. Temporal interpolation is carried out using band limited approximate prolate spherical wave functions. The discretized coupled system of integral equation and constitutive relation is integrated in time using a PE(CE)m type linear multistep scheme. Unlike the existing MOT methods, the resulting explicit MOT scheme allows for straightforward incorporation of the time variation in the dielectric permittivity.

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.

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)

Discrete Event Simulation of Distributed Team Communication

Science.gov (United States)

2012-03-22

performs, and auditory information that is provided through multiple audio devices with speech response. This paper extends previous discrete event workload...2008, pg. 1) notes that “Architecture modeling furnishes abstrac- tions for use in managing complexities, allowing engineers to visualise the proposed

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.

Discrete event simulation tool for analysis of qualitative models of continuous processing systems

Science.gov (United States)

Malin, Jane T. (Inventor); Basham, Bryan D. (Inventor); Harris, Richard A. (Inventor)

1990-01-01

An artificial intelligence design and qualitative modeling tool is disclosed for creating computer models and simulating continuous activities, functions, and/or behavior using developed discrete event techniques. Conveniently, the tool is organized in four modules: library design module, model construction module, simulation module, and experimentation and analysis. The library design module supports the building of library knowledge including component classes and elements pertinent to a particular domain of continuous activities, functions, and behavior being modeled. The continuous behavior is defined discretely with respect to invocation statements, effect statements, and time delays. The functionality of the components is defined in terms of variable cluster instances, independent processes, and modes, further defined in terms of mode transition processes and mode dependent processes. Model construction utilizes the hierarchy of libraries and connects them with appropriate relations. The simulation executes a specialized initialization routine and executes events in a manner that includes selective inherency of characteristics through a time and event schema until the event queue in the simulator is emptied. The experimentation and analysis module supports analysis through the generation of appropriate log files and graphics developments and includes the ability of log file comparisons.

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.

fixedTimeEvents: An R package for the distribution of distances between discrete events in fixed time

Directory of Open Access Journals (Sweden)

Kristian Hovde Liland

2016-01-01

Full Text Available When a series of Bernoulli trials occur within a fixed time frame or limited space, it is often interesting to assess if the successful outcomes have occurred completely at random, or if they tend to group together. One example, in genetics, is detecting grouping of genes within a genome. Approximations of the distribution of successes are possible, but they become inaccurate for small sample sizes. In this article, we describe the exact distribution of time between random, non-overlapping successes in discrete time of fixed length. A complete description of the probability mass function, the cumulative distribution function, mean, variance and recurrence relation is included. We propose an associated test for the over-representation of short distances and illustrate the methodology through relevant examples. The theory is implemented in an R package including probability mass, cumulative distribution, quantile function, random number generator, simulation functions, and functions for testing.

Optimization of Operations Resources via Discrete Event Simulation Modeling

Science.gov (United States)

Joshi, B.; Morris, D.; White, N.; Unal, R.

1996-01-01

The resource levels required for operation and support of reusable launch vehicles are typically defined through discrete event simulation modeling. Minimizing these resources constitutes an optimization problem involving discrete variables and simulation. Conventional approaches to solve such optimization problems involving integer valued decision variables are the pattern search and statistical methods. However, in a simulation environment that is characterized by search spaces of unknown topology and stochastic measures, these optimization approaches often prove inadequate. In this paper, we have explored the applicability of genetic algorithms to the simulation domain. Genetic algorithms provide a robust search strategy that does not require continuity and differentiability of the problem domain. The genetic algorithm successfully minimized the operation and support activities for a space vehicle, through a discrete event simulation model. The practical issues associated with simulation optimization, such as stochastic variables and constraints, were also taken into consideration.

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).

Space-Time Discrete KPZ Equation

Science.gov (United States)

Cannizzaro, G.; Matetski, K.

2018-03-01

We study a general family of space-time discretizations of the KPZ equation and show that they converge to its solution. The approach we follow makes use of basic elements of the theory of regularity structures (Hairer in Invent Math 198(2):269-504, 2014) as well as its discrete counterpart (Hairer and Matetski in Discretizations of rough stochastic PDEs, 2015. arXiv:1511.06937). Since the discretization is in both space and time and we allow non-standard discretization for the product, the methods mentioned above have to be suitably modified in order to accommodate the structure of the models under study.

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.

Discrete event model-based simulation for train movement on a single-line railway

International Nuclear Information System (INIS)

Xu Xiao-Ming; Li Ke-Ping; Yang Li-Xing

2014-01-01

The aim of this paper is to present a discrete event model-based approach to simulate train movement with the considered energy-saving factor. We conduct extensive case studies to show the dynamic characteristics of the traffic flow and demonstrate the effectiveness of the proposed approach. The simulation results indicate that the proposed discrete event model-based simulation approach is suitable for characterizing the movements of a group of trains on a single railway line with less iterations and CPU time. Additionally, some other qualitative and quantitative characteristics are investigated. In particular, because of the cumulative influence from the previous trains, the following trains should be accelerated or braked frequently to control the headway distance, leading to more energy consumption. (general)

Discrete event command and control for networked teams with multiple missions

Science.gov (United States)

Lewis, Frank L.; Hudas, Greg R.; Pang, Chee Khiang; Middleton, Matthew B.; McMurrough, Christopher

2009-05-01

During mission execution in military applications, the TRADOC Pamphlet 525-66 Battle Command and Battle Space Awareness capabilities prescribe expectations that networked teams will perform in a reliable manner under changing mission requirements, varying resource availability and reliability, and resource faults. In this paper, a Command and Control (C2) structure is presented that allows for computer-aided execution of the networked team decision-making process, control of force resources, shared resource dispatching, and adaptability to change based on battlefield conditions. A mathematically justified networked computing environment is provided called the Discrete Event Control (DEC) Framework. DEC has the ability to provide the logical connectivity among all team participants including mission planners, field commanders, war-fighters, and robotic platforms. The proposed data management tools are developed and demonstrated on a simulation study and an implementation on a distributed wireless sensor network. The results show that the tasks of multiple missions are correctly sequenced in real-time, and that shared resources are suitably assigned to competing tasks under dynamically changing conditions without conflicts and bottlenecks.

Visual Data-Analytics of Large-Scale Parallel Discrete-Event Simulations

Energy Technology Data Exchange (ETDEWEB)

Ross, Caitlin; Carothers, Christopher D.; Mubarak, Misbah; Carns, Philip; Ross, Robert; Li, Jianping Kelvin; Ma, Kwan-Liu

2016-11-13

Parallel discrete-event simulation (PDES) is an important tool in the codesign of extreme-scale systems because PDES provides a cost-effective way to evaluate designs of highperformance computing systems. Optimistic synchronization algorithms for PDES, such as Time Warp, allow events to be processed without global synchronization among the processing elements. A rollback mechanism is provided when events are processed out of timestamp order. Although optimistic synchronization protocols enable the scalability of large-scale PDES, the performance of the simulations must be tuned to reduce the number of rollbacks and provide an improved simulation runtime. To enable efficient large-scale optimistic simulations, one has to gain insight into the factors that affect the rollback behavior and simulation performance. We developed a tool for ROSS model developers that gives them detailed metrics on the performance of their large-scale optimistic simulations at varying levels of simulation granularity. Model developers can use this information for parameter tuning of optimistic simulations in order to achieve better runtime and fewer rollbacks. In this work, we instrument the ROSS optimistic PDES framework to gather detailed statistics about the simulation engine. We have also developed an interactive visualization interface that uses the data collected by the ROSS instrumentation to understand the underlying behavior of the simulation engine. The interface connects real time to virtual time in the simulation and provides the ability to view simulation data at different granularities. We demonstrate the usefulness of our framework by performing a visual analysis of the dragonfly network topology model provided by the CODES simulation framework built on top of ROSS. The instrumentation needs to minimize overhead in order to accurately collect data about the simulation performance. To ensure that the instrumentation does not introduce unnecessary overhead, we perform a

Vector-field statistics for the analysis of time varying clinical gait data.

Science.gov (United States)

Donnelly, C J; Alexander, C; Pataky, T C; Stannage, K; Reid, S; Robinson, M A

2017-01-01

In clinical settings, the time varying analysis of gait data relies heavily on the experience of the individual(s) assessing these biological signals. Though three dimensional kinematics are recognised as time varying waveforms (1D), exploratory statistical analysis of these data are commonly carried out with multiple discrete or 0D dependent variables. In the absence of an a priori 0D hypothesis, clinicians are at risk of making type I and II errors in their analyis of time varying gait signatures in the event statistics are used in concert with prefered subjective clinical assesment methods. The aim of this communication was to determine if vector field waveform statistics were capable of providing quantitative corroboration to practically significant differences in time varying gait signatures as determined by two clinically trained gait experts. The case study was a left hemiplegic Cerebral Palsy (GMFCS I) gait patient following a botulinum toxin (BoNT-A) injection to their left gastrocnemius muscle. When comparing subjective clinical gait assessments between two testers, they were in agreement with each other for 61% of the joint degrees of freedom and phases of motion analysed. For tester 1 and tester 2, they were in agreement with the vector-field analysis for 78% and 53% of the kinematic variables analysed. When the subjective analyses of tester 1 and tester 2 were pooled together and then compared to the vector-field analysis, they were in agreement for 83% of the time varying kinematic variables analysed. These outcomes demonstrate that in principle, vector-field statistics corroborates with what a team of clinical gait experts would classify as practically meaningful pre- versus post time varying kinematic differences. The potential for vector-field statistics to be used as a useful clinical tool for the objective analysis of time varying clinical gait data is established. Future research is recommended to assess the usefulness of vector-field analyses

Density perturbations due to the inhomogeneous discrete spatial structure of space-time

International Nuclear Information System (INIS)

Wolf, C.

1998-01-01

For the case that space-time permits an inhomogeneous discrete spatial structure due to varying gravitational fields or a foam-like structure of space-time, it is demonstrated that thermodynamic reasoning implies that matter-density perturbations will arise in the early universe

Discrete-Time LPV Current Control of an Induction Motor

DEFF Research Database (Denmark)

Bendtsen, Jan Dimon; Trangbæk, Klaus

2003-01-01

In this paper we apply a new method for gain-scheduled output feedback control of nonlinear systems to current control of an induction motor. The method relies on recently developed controller synthesis results for linear parameter-varying (LPV) systems, where the controller synthesis is formulated...... as a set of linear matrix inequalities with full-block multipliers. A standard nonlinear model of the motor is constructed and written on LPV form. We then show that, although originally developed in continuous time, the controller synthesis results can be applied to a discrete-time model as well without...... further complications. The synthesis method is applied to the model, yielding an LPV discrete-time controller. Finally, the efficiency of the control scheme is validated via simulations as well as on the actual induction motor, both in open-loop current control and when an outer speed control loop...

Discrete event simulation: Modeling simultaneous complications and outcomes

NARCIS (Netherlands)

Quik, E.H.; Feenstra, T.L.; Krabbe, P.F.M.

2012-01-01

OBJECTIVES: To present an effective and elegant model approach to deal with specific characteristics of complex modeling. METHODS: A discrete event simulation (DES) model with multiple complications and multiple outcomes that each can occur simultaneously was developed. In this DES model parameters,

A mean-variance frontier in discrete and continuous time

OpenAIRE

Bekker, Paul A.

2004-01-01

The paper presents a mean-variance frontier based on dynamic frictionless investment strategies in continuous time. The result applies to a finite number of risky assets whose price process is given by multivariate geometric Brownian motion with deterministically varying coefficients. The derivation is based on the solution for the frontier in discrete time. Using the same multiperiod framework as Li and Ng (2000), I provide an alternative derivation and an alternative formulation of the solu...

Discrete Event Simulation Model of the Polaris 2.1 Gamma Ray Imaging Radiation Detection Device

Science.gov (United States)

2016-06-01

release; distribution is unlimited DISCRETE EVENT SIMULATION MODEL OF THE POLARIS 2.1 GAMMA RAY IMAGING RADIATION DETECTION DEVICE by Andres T...ONLY (Leave blank) 2. REPORT DATE June 2016 3. REPORT TYPE AND DATES COVERED Master’s thesis 4. TITLE AND SUBTITLE DISCRETE EVENT SIMULATION MODEL...modeled. The platform, Simkit, was utilized to create a discrete event simulation (DES) model of the Polaris. After carefully constructing the DES

Memorized discrete systems and time-delay

CERN Document Server

Luo, Albert C J

2017-01-01

This book examines discrete dynamical systems with memory—nonlinear systems that exist extensively in biological organisms and financial and economic organizations, and time-delay systems that can be discretized into the memorized, discrete dynamical systems. It book further discusses stability and bifurcations of time-delay dynamical systems that can be investigated through memorized dynamical systems as well as bifurcations of memorized nonlinear dynamical systems, discretization methods of time-delay systems, and periodic motions to chaos in nonlinear time-delay systems. The book helps readers find analytical solutions of MDS, change traditional perturbation analysis in time-delay systems, detect motion complexity and singularity in MDS; and determine stability, bifurcation, and chaos in any time-delay system.

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.

The cost of conservative synchronization in parallel discrete event simulations

Science.gov (United States)

Nicol, David M.

1990-01-01

The performance of a synchronous conservative parallel discrete-event simulation protocol is analyzed. The class of simulation models considered is oriented around a physical domain and possesses a limited ability to predict future behavior. A stochastic model is used to show that as the volume of simulation activity in the model increases relative to a fixed architecture, the complexity of the average per-event overhead due to synchronization, event list manipulation, lookahead calculations, and processor idle time approach the complexity of the average per-event overhead of a serial simulation. The method is therefore within a constant factor of optimal. The analysis demonstrates that on large problems--those for which parallel processing is ideally suited--there is often enough parallel workload so that processors are not usually idle. The viability of the method is also demonstrated empirically, showing how good performance is achieved on large problems using a thirty-two node Intel iPSC/2 distributed memory multiprocessor.

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…

Discrete event simulation as an ergonomic tool to predict workload exposures during systems design

NARCIS (Netherlands)

Perez, J.; Looze, M.P. de; Bosch, T.; Neumann, W.P.

2014-01-01

This methodological paper presents a novel approach to predict operator's mechanical exposure and fatigue accumulation in discrete event simulations. A biomechanical model of work-cycle loading is combined with a discrete event simulation model which provides work cycle patterns over the shift

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

Fermion systems in discrete space-time

International Nuclear Information System (INIS)

Finster, Felix

2007-01-01

Fermion systems in discrete space-time are introduced as a model for physics on the Planck scale. We set up a variational principle which describes a non-local interaction of all fermions. This variational principle is symmetric under permutations of the discrete space-time points. We explain how for minimizers of the variational principle, the fermions spontaneously break this permutation symmetry and induce on space-time a discrete causal structure

Fermion systems in discrete space-time

Energy Technology Data Exchange (ETDEWEB)

Finster, Felix [NWF I - Mathematik, Universitaet Regensburg, 93040 Regensburg (Germany)

2007-05-15

Fermion systems in discrete space-time are introduced as a model for physics on the Planck scale. We set up a variational principle which describes a non-local interaction of all fermions. This variational principle is symmetric under permutations of the discrete space-time points. We explain how for minimizers of the variational principle, the fermions spontaneously break this permutation symmetry and induce on space-time a discrete causal structure.

Fermion Systems in Discrete Space-Time

OpenAIRE

Finster, Felix

2006-01-01

Fermion systems in discrete space-time are introduced as a model for physics on the Planck scale. We set up a variational principle which describes a non-local interaction of all fermions. This variational principle is symmetric under permutations of the discrete space-time points. We explain how for minimizers of the variational principle, the fermions spontaneously break this permutation symmetry and induce on space-time a discrete causal structure.

Fermion systems in discrete space-time

Science.gov (United States)

Finster, Felix

2007-05-01

Fermion systems in discrete space-time are introduced as a model for physics on the Planck scale. We set up a variational principle which describes a non-local interaction of all fermions. This variational principle is symmetric under permutations of the discrete space-time points. We explain how for minimizers of the variational principle, the fermions spontaneously break this permutation symmetry and induce on space-time a discrete causal structure.

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

Discrete event simulation of the Defense Waste Processing Facility (DWPF) analytical laboratory

International Nuclear Information System (INIS)

Shanahan, K.L.

1992-02-01

A discrete event simulation of the Savannah River Site (SRS) Defense Waste Processing Facility (DWPF) analytical laboratory has been constructed in the GPSS language. It was used to estimate laboratory analysis times at process analytical hold points and to study the effect of sample number on those times. Typical results are presented for three different simultaneous representing increasing levels of complexity, and for different sampling schemes. Example equipment utilization time plots are also included. SRS DWPF laboratory management and chemists found the simulations very useful for resource and schedule planning

Time-Discrete Higher-Order ALE Formulations: Stability

KAUST Repository

Bonito, Andrea; Kyza, Irene; Nochetto, Ricardo H.

2013-01-01

on the stability of the PDE but may influence that of a discrete scheme. We examine this critical issue for higher-order time stepping without space discretization. We propose time-discrete discontinuous Galerkin (dG) numerical schemes of any order for a time

SPEEDES - A multiple-synchronization environment for parallel discrete-event simulation

Science.gov (United States)

Steinman, Jeff S.

1992-01-01

Synchronous Parallel Environment for Emulation and Discrete-Event Simulation (SPEEDES) is a unified parallel simulation environment. It supports multiple-synchronization protocols without requiring users to recompile their code. When a SPEEDES simulation runs on one node, all the extra parallel overhead is removed automatically at run time. When the same executable runs in parallel, the user preselects the synchronization algorithm from a list of options. SPEEDES currently runs on UNIX networks and on the California Institute of Technology/Jet Propulsion Laboratory Mark III Hypercube. SPEEDES also supports interactive simulations. Featured in the SPEEDES environment is a new parallel synchronization approach called Breathing Time Buckets. This algorithm uses some of the conservative techniques found in Time Bucket synchronization, along with the optimism that characterizes the Time Warp approach. A mathematical model derived from first principles predicts the performance of Breathing Time Buckets. Along with the Breathing Time Buckets algorithm, this paper discusses the rules for processing events in SPEEDES, describes the implementation of various other synchronization protocols supported by SPEEDES, describes some new ones for the future, discusses interactive simulations, and then gives some performance results.

Powering stochastic reliability models by discrete event simulation

DEFF Research Database (Denmark)

Kozine, Igor; Wang, Xiaoyun

2012-01-01

it difficult to find a solution to the problem. The power of modern computers and recent developments in discrete-event simulation (DES) software enable to diminish some of the drawbacks of stochastic models. In this paper we describe the insights we have gained based on using both Markov and DES models...

Event-based state estimation for a class of complex networks with time-varying delays: A comparison principle approach

Energy Technology Data Exchange (ETDEWEB)

Zhang, Wenbing [Department of Mathematics, Yangzhou University, Yangzhou 225002 (China); Wang, Zidong [Department of Computer Science, Brunel University London, Uxbridge, Middlesex, UB8 3PH (United Kingdom); Liu, Yurong, E-mail: yrliu@yzu.edu.cn [Department of Mathematics, Yangzhou University, Yangzhou 225002 (China); Communication Systems and Networks (CSN) Research Group, Faculty of Engineering, King Abdulaziz University, Jeddah 21589 (Saudi Arabia); Ding, Derui [Shanghai Key Lab of Modern Optical System, Department of Control Science and Engineering, University of Shanghai for Science and Technology, Shanghai 200093 (China); Alsaadi, Fuad E. [Communication Systems and Networks (CSN) Research Group, Faculty of Engineering, King Abdulaziz University, Jeddah 21589 (Saudi Arabia)

2017-01-05

The paper is concerned with the state estimation problem for a class of time-delayed complex networks with event-triggering communication protocol. A novel event generator function, which is dependent not only on the measurement output but also on a predefined positive constant, is proposed with hope to reduce the communication burden. A new concept of exponentially ultimate boundedness is provided to quantify the estimation performance. By means of the comparison principle, some sufficient conditions are obtained to guarantee that the estimation error is exponentially ultimately bounded, and then the estimator gains are obtained in terms of the solution of certain matrix inequalities. Furthermore, a rigorous proof is proposed to show that the designed triggering condition is free of the Zeno behavior. Finally, a numerical example is given to illustrate the effectiveness of the proposed event-based estimator. - Highlights: • An event-triggered estimator is designed for complex networks with time-varying delays. • A novel event generator function is proposed to reduce the communication burden. • The comparison principle is utilized to derive the sufficient conditions. • The designed triggering condition is shown to be free of the Zeno behavior.

Modeling Anti-Air Warfare With Discrete Event Simulation and Analyzing Naval Convoy Operations

Science.gov (United States)

2016-06-01

W., & Scheaffer, R. L. (2008). Mathematical statistics with applications . Belmont, CA: Cengage Learning. 118 THIS PAGE INTENTIONALLY LEFT BLANK...WARFARE WITH DISCRETE EVENT SIMULATION AND ANALYZING NAVAL CONVOY OPERATIONS by Ali E. Opcin June 2016 Thesis Advisor: Arnold H. Buss Co...REPORT DATE June 2016 3. REPORT TYPE AND DATES COVERED Master’s thesis 4. TITLE AND SUBTITLE MODELING ANTI-AIR WARFARE WITH DISCRETE EVENT

Discrete event simulation of the ATLAS second level trigger

International Nuclear Information System (INIS)

Vermeulen, J.C.; Dankers, R.J.; Hunt, S.; Harris, F.; Hortnagl, C.; Erasov, A.; Bogaerts, A.

1998-01-01

Discrete event simulation is applied for determining the computing and networking resources needed for the ATLAS second level trigger. This paper discusses the techniques used and some of the results obtained so far for well defined laboratory configurations and for the full system

Multiple-event probability in general-relativistic quantum mechanics. II. A discrete model

International Nuclear Information System (INIS)

Mondragon, Mauricio; Perez, Alejandro; Rovelli, Carlo

2007-01-01

We introduce a simple quantum mechanical model in which time and space are discrete and periodic. These features avoid the complications related to continuous-spectrum operators and infinite-norm states. The model provides a tool for discussing the probabilistic interpretation of generally covariant quantum systems, without the confusion generated by spurious infinities. We use the model to illustrate the formalism of general-relativistic quantum mechanics, and to test the definition of multiple-event probability introduced in a companion paper [Phys. Rev. D 75, 084033 (2007)]. We consider a version of the model with unitary time evolution and a version without unitary time evolution

Application of Discrete Event Simulation in Mine Production Forecast

African Journals Online (AJOL)

Application of Discrete Event Simulation in Mine Production Forecast. Felix Adaania Kaba, Victor Amoako Temeng, Peter Arroja Eshun. Abstract. Mine production forecast is pertinent to mining as it serves production goals for a production period. Perseus Mining Ghana Limited (PMGL), Ayanfuri, deterministically forecasts ...

Discrete-Time Systems

Indian Academy of Sciences (India)

We also describe discrete-time systems in terms of difference ... A more modern alternative, especially for larger systems, is to convert ... In other words, ..... picture?) State-variable equations are also called state-space equations because the ...

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.

Symmetries in discrete-time mechanics

International Nuclear Information System (INIS)

Khorrami, M.

1996-01-01

Based on a general formulation for discrete-time quantum mechanics, introduced by M. Khorrami (Annals Phys. 224 (1995), 101), symmetries in discrete-time quantum mechanics are investigated. It is shown that any classical continuous symmetry leads to a conserved quantity in classical mechanics, as well as quantum mechanics. The transformed wave function, however, has the correct evolution if and only if the symmetry is nonanomalous. Copyright copyright 1996 Academic Press, Inc

A non-orthogonal decomposition of flows into discrete events

Science.gov (United States)

Boxx, Isaac; Lewalle, Jacques

1998-11-01

This work is based on the formula for the inverse Hermitian wavelet transform. A signal can be interpreted as a (non-unique) superposition of near-singular, partially overlapping events arising from Dirac functions and/or its derivatives combined with diffusion.( No dynamics implied: dimensionless diffusion is related to the definition of the analyzing wavelets.) These events correspond to local maxima of spectral energy density. We successfully fitted model events of various orders on a succession of fields, ranging from elementary signals to one-dimensional hot-wire traces. We document edge effects, event overlap and its implications on the algorithm. The interpretation of the discrete singularities as flow events (such as coherent structures) and the fundamental non-uniqueness of the decomposition are discussed. The dynamics of these events will be examined in the companion paper.

Discrete event simulations for glycolysis pathway and energy balance

NARCIS (Netherlands)

Zwieten, van D.A.J.; Rooda, J.E.; Armbruster, H.D.; Nagy, J.D.

2010-01-01

In this report, the biological network of the glycolysis pathway has been modeled using discrete event models (DEMs). The most important feature of this pathway is that energy is released. To create a stable steady-state system an energy molecule equilibrating enzyme and metabolic reactions have

Discrete Event Simulation of Patient Admissions to a Neurovascular Unit

Directory of Open Access Journals (Sweden)

S. Hahn-Goldberg

2014-01-01

Full Text Available Evidence exists that clinical outcomes improve for stroke patients admitted to specialized Stroke Units. The Toronto Western Hospital created a Neurovascular Unit (NVU using beds from general internal medicine, Neurology and Neurosurgery to care for patients with stroke and acute neurovascular conditions. Using patient-level data for NVU-eligible patients, a discrete event simulation was created to study changes in patient flow and length of stay pre- and post-NVU implementation. Varying patient volumes and resources were tested to determine the ideal number of beds under various conditions. In the first year of operation, the NVU admitted 507 patients, over 66% of NVU-eligible patient volumes. With the introduction of the NVU, length of stay decreased by around 8%. Scenario testing showed that the current level of 20 beds is sufficient for accommodating the current demand and would continue to be sufficient with an increase in demand of up to 20%.

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

Local and global dynamics of Ramsey model: From continuous to discrete time.

Science.gov (United States)

Guzowska, Malgorzata; Michetti, Elisabetta

2018-05-01

The choice of time as a discrete or continuous variable may radically affect equilibrium stability in an endogenous growth model with durable consumption. In the continuous-time Ramsey model [F. P. Ramsey, Econ. J. 38(152), 543-559 (1928)], the steady state is locally saddle-path stable with monotonic convergence. However, in the discrete-time version, the steady state may be unstable or saddle-path stable with monotonic or oscillatory convergence or periodic solutions [see R.-A. Dana et al., Handbook on Optimal Growth 1 (Springer, 2006) and G. Sorger, Working Paper No. 1505 (2015)]. When this occurs, the discrete-time counterpart of the continuous-time model is not consistent with the initial framework. In order to obtain a discrete-time Ramsey model preserving the main properties of the continuous-time counterpart, we use a general backward and forward discretisation as initially proposed by Bosi and Ragot [Theor. Econ. Lett. 2(1), 10-15 (2012)]. The main result of the study here presented is that, with this hybrid discretisation method, fixed points and local dynamics do not change. For what it concerns global dynamics, i.e., long-run behavior for initial conditions taken on the state space, we mainly perform numerical analysis with the main scope of comparing both qualitative and quantitative evolution of the two systems, also varying some parameters of interest.

Discrete-Event Execution Alternatives on General Purpose Graphical Processing Units

International Nuclear Information System (INIS)

Perumalla, Kalyan S.

2006-01-01

Graphics cards, traditionally designed as accelerators for computer graphics, have evolved to support more general-purpose computation. General Purpose Graphical Processing Units (GPGPUs) are now being used as highly efficient, cost-effective platforms for executing certain simulation applications. While most of these applications belong to the category of time-stepped simulations, little is known about the applicability of GPGPUs to discrete event simulation (DES). Here, we identify some of the issues and challenges that the GPGPU stream-based interface raises for DES, and present some possible approaches to moving DES to GPGPUs. Initial performance results on simulation of a diffusion process show that DES-style execution on GPGPU runs faster than DES on CPU and also significantly faster than time-stepped simulations on either CPU or GPGPU.

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...

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.

Event-Triggered Asynchronous Guaranteed Cost Control for Markov Jump Discrete-Time Neural Networks With Distributed Delay and Channel Fading.

Science.gov (United States)

Yan, Huaicheng; Zhang, Hao; Yang, Fuwen; Zhan, Xisheng; Peng, Chen

2017-08-18

This paper is concerned with the guaranteed cost control problem for a class of Markov jump discrete-time neural networks (NNs) with event-triggered mechanism, asynchronous jumping, and fading channels. The Markov jump NNs are introduced to be close to reality, where the modes of the NNs and guaranteed cost controller are determined by two mutually independent Markov chains. The asynchronous phenomenon is considered, which increases the difficulty of designing required mode-dependent controller. The event-triggered mechanism is designed by comparing the relative measurement error with the last triggered state at the process of data transmission, which is used to eliminate dispensable transmission and reduce the networked energy consumption. In addition, the signal fading is considered for the effect of signal reflection and shadow in wireless networks, which is modeled by the novel Rice fading models. Some novel sufficient conditions are obtained to guarantee that the closed-loop system reaches a specified cost value under the designed jumping state feedback control law in terms of linear matrix inequalities. Finally, some simulation results are provided to illustrate the effectiveness of the proposed method.

Template-Based Estimation of Time-Varying Tempo

Directory of Open Access Journals (Sweden)

Peeters Geoffroy

2007-01-01

Full Text Available We present a novel approach to automatic estimation of tempo over time. This method aims at detecting tempo at the tactus level for percussive and nonpercussive audio. The front-end of our system is based on a proposed reassigned spectral energy flux for the detection of musical events. The dominant periodicities of this flux are estimated by a proposed combination of discrete Fourier transform and frequency-mapped autocorrelation function. The most likely meter, beat, and tatum over time are then estimated jointly using proposed meter/beat subdivision templates and a Viterbi decoding algorithm. The performances of our system have been evaluated on four different test sets among which three were used during the ISMIR 2004 tempo induction contest. The performances obtained are close to the best results of this contest.

It's Deja Vu All over Again: Using Multiple-Spell Discrete-Time Survival Analysis.

Science.gov (United States)

Willett, John B.; Singer, Judith D.

1995-01-01

The multiple-spell discrete-time survival analysis method is introduced and illustrated using longitudinal data on exit from and reentry into the teaching profession. The method is applicable to many educational problems involving the sequential occurrence of disparate events or episodes. (SLD)

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...

Discrete event simulation of Maglev transport considering traffic waves

Directory of Open Access Journals (Sweden)

Moo Hyun Cha

2014-10-01

Full Text Available A magnetically levitated vehicle (Maglev system is under commercialization as a new transportation system in Korea. The Maglev is operated by an unmanned automatic control system. Therefore, the plan of train operation should be carefully established and validated in advance. In general, when making a train operation plan, statistically predicted traffic data is used. However, a traffic wave often occurs in real train service, and demand-driven simulation technology is required to review a train operation plan and service quality considering traffic waves. We propose a method and model to simulate Maglev operation considering continuous demand changes. For this purpose, we employed a discrete event model that is suitable for modeling the behavior of railway passenger transportation. We modeled the system hierarchically using discrete event system specification (DEVS formalism. In addition, through implementation and an experiment using the DEVSim++ simulation environment, we tested the feasibility of the proposed model. Our experimental results also verified that our demand-driven simulation technology can be used for a priori review of train operation plans and strategies.

Examining Passenger Flow Choke Points at Airports Using Discrete Event Simulation

Science.gov (United States)

Brown, Jeremy R.; Madhavan, Poomima

2011-01-01

The movement of passengers through an airport quickly, safely, and efficiently is the main function of the various checkpoints (check-in, security. etc) found in airports. Human error combined with other breakdowns in the complex system of the airport can disrupt passenger flow through the airport leading to lengthy waiting times, missing luggage and missed flights. In this paper we present a model of passenger flow through an airport using discrete event simulation that will provide a closer look into the possible reasons for breakdowns and their implications for passenger flow. The simulation is based on data collected at Norfolk International Airport (ORF). The primary goal of this simulation is to present ways to optimize the work force to keep passenger flow smooth even during peak travel times and for emergency preparedness at ORF in case of adverse events. In this simulation we ran three different scenarios: real world, increased check-in stations, and multiple waiting lines. Increased check-in stations increased waiting time and instantaneous utilization. while the multiple waiting lines decreased both the waiting time and instantaneous utilization. This simulation was able to show how different changes affected the passenger flow through the airport.

Exponential stability result for discrete-time stochastic fuzzy uncertain neural networks

International Nuclear Information System (INIS)

Mathiyalagan, K.; Sakthivel, R.; Marshal Anthoni, S.

2012-01-01

This Letter addresses the stability analysis problem for a class of uncertain discrete-time stochastic fuzzy neural networks (DSFNNs) with time-varying delays. By constructing a new Lyapunov–Krasovskii functional combined with the free weighting matrix technique, a new set of delay-dependent sufficient conditions for the robust exponential stability of the considered DSFNNs is established in terms of Linear Matrix Inequalities (LMIs). Finally, numerical examples with simulation results are provided to illustrate the applicability and usefulness of the obtained theory. -- Highlights: ► Applications of neural networks require the knowledge of dynamic behaviors. ► Exponential stability of discrete-time stochastic fuzzy neural networks is studied. ► Linear matrix inequality optimization approach is used to obtain the result. ► Delay-dependent stability criterion is established in terms of LMIs. ► Examples with simulation are provided to show the effectiveness of the result.

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.

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.

Robust stability of uncertain Markovian jumping Cohen-Grossberg neural networks with mixed time-varying delays

International Nuclear Information System (INIS)

Sheng Li; Yang Huizhong

2009-01-01

This paper considers the robust stability of a class of uncertain Markovian jumping Cohen-Grossberg neural networks (UMJCGNNs) with mixed time-varying delays. The parameter uncertainties are norm-bounded and the mixed time-varying delays comprise discrete and distributed time delays. Based on the Lyapunov stability theory and linear matrix inequality (LMI) technique, some robust stability conditions guaranteeing the global robust convergence of the equilibrium point are derived. An example is given to show the effectiveness of the proposed results.

Semiclassical expanding discrete space-times

International Nuclear Information System (INIS)

Cobb, W.K.; Smalley, L.L.

1981-01-01

Given the close ties between general relativity and geometry one might reasonably expect that quantum effects associated with gravitation might also be tied to the geometry of space-time, namely, to some sort of discreteness in space-time itself. In particular it is supposed that space-time consists of a discrete lattice of points rather than the usual continuum. Since astronomical evidence seems to suggest that the universe is expanding, the lattice must also expand. Some of the implications of such a model are that the proton should presently be stable, and the universe should be closed although the mechanism for closure is quantum mechanical. (author)

Discrete-time modelling of musical instruments

International Nuclear Information System (INIS)

Vaelimaeki, Vesa; Pakarinen, Jyri; Erkut, Cumhur; Karjalainen, Matti

2006-01-01

This article describes physical modelling techniques that can be used for simulating musical instruments. The methods are closely related to digital signal processing. They discretize the system with respect to time, because the aim is to run the simulation using a computer. The physics-based modelling methods can be classified as mass-spring, modal, wave digital, finite difference, digital waveguide and source-filter models. We present the basic theory and a discussion on possible extensions for each modelling technique. For some methods, a simple model example is chosen from the existing literature demonstrating a typical use of the method. For instance, in the case of the digital waveguide modelling technique a vibrating string model is discussed, and in the case of the wave digital filter technique we present a classical piano hammer model. We tackle some nonlinear and time-varying models and include new results on the digital waveguide modelling of a nonlinear string. Current trends and future directions in physical modelling of musical instruments are discussed

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

Continuous time modelling with individually varying time intervals for oscillating and non-oscillating processes.

Science.gov (United States)

Voelkle, Manuel C; Oud, Johan H L

2013-02-01

When designing longitudinal studies, researchers often aim at equal intervals. In practice, however, this goal is hardly ever met, with different time intervals between assessment waves and different time intervals between individuals being more the rule than the exception. One of the reasons for the introduction of continuous time models by means of structural equation modelling has been to deal with irregularly spaced assessment waves (e.g., Oud & Delsing, 2010). In the present paper we extend the approach to individually varying time intervals for oscillating and non-oscillating processes. In addition, we show not only that equal intervals are unnecessary but also that it can be advantageous to use unequal sampling intervals, in particular when the sampling rate is low. Two examples are provided to support our arguments. In the first example we compare a continuous time model of a bivariate coupled process with varying time intervals to a standard discrete time model to illustrate the importance of accounting for the exact time intervals. In the second example the effect of different sampling intervals on estimating a damped linear oscillator is investigated by means of a Monte Carlo simulation. We conclude that it is important to account for individually varying time intervals, and encourage researchers to conceive of longitudinal studies with different time intervals within and between individuals as an opportunity rather than a problem. © 2012 The British Psychological Society.

On discrete models of space-time

International Nuclear Information System (INIS)

Horzela, A.; Kempczynski, J.; Kapuscik, E.; Georgia Univ., Athens, GA; Uzes, Ch.

1992-02-01

Analyzing the Einstein radiolocation method we come to the conclusion that results of any measurement of space-time coordinates should be expressed in terms of rational numbers. We show that this property is Lorentz invariant and may be used in the construction of discrete models of space-time different from the models of the lattice type constructed in the process of discretization of continuous models. (author)

A time-varying subjective quality model for mobile streaming videos with stalling events

Science.gov (United States)

Ghadiyaram, Deepti; Pan, Janice; Bovik, Alan C.

2015-09-01

Over-the-top mobile video streaming is invariably influenced by volatile network conditions which cause playback interruptions (stalling events), thereby impairing users' quality of experience (QoE). Developing models that can accurately predict users' QoE could enable the more efficient design of quality-control protocols for video streaming networks that reduce network operational costs while still delivering high-quality video content to the customers. Existing objective models that predict QoE are based on global video features, such as the number of stall events and their lengths, and are trained and validated on a small pool of ad hoc video datasets, most of which are not publicly available. The model we propose in this work goes beyond previous models as it also accounts for the fundamental effect that a viewer's recent level of satisfaction or dissatisfaction has on their overall viewing experience. In other words, the proposed model accounts for and adapts to the recency, or hysteresis effect caused by a stall event in addition to accounting for the lengths, frequency of occurrence, and the positions of stall events - factors that interact in a complex way to affect a user's QoE. On the recently introduced LIVE-Avvasi Mobile Video Database, which consists of 180 distorted videos of varied content that are afflicted solely with over 25 unique realistic stalling events, we trained and validated our model to accurately predict the QoE, attaining standout QoE prediction performance.

Partition-based discrete-time quantum walks

Science.gov (United States)

Konno, Norio; Portugal, Renato; Sato, Iwao; Segawa, Etsuo

2018-04-01

We introduce a family of discrete-time quantum walks, called two-partition model, based on two equivalence-class partitions of the computational basis, which establish the notion of local dynamics. This family encompasses most versions of unitary discrete-time quantum walks driven by two local operators studied in literature, such as the coined model, Szegedy's model, and the 2-tessellable staggered model. We also analyze the connection of those models with the two-step coined model, which is driven by the square of the evolution operator of the standard discrete-time coined walk. We prove formally that the two-step coined model, an extension of Szegedy model for multigraphs, and the two-tessellable staggered model are unitarily equivalent. Then, selecting one specific model among those families is a matter of taste not generality.

Discrete-Event Simulation Unmasks the Quantum Cheshire Cat

Science.gov (United States)

Michielsen, Kristel; Lippert, Thomas; Raedt, Hans De

2017-05-01

It is shown that discrete-event simulation accurately reproduces the experimental data of a single-neutron interferometry experiment [T. Denkmayr {\\sl et al.}, Nat. Commun. 5, 4492 (2014)] and provides a logically consistent, paradox-free, cause-and-effect explanation of the quantum Cheshire cat effect without invoking the notion that the neutron and its magnetic moment separate. Describing the experimental neutron data using weak-measurement theory is shown to be useless for unravelling the quantum Cheshire cat effect.

The Impact of Inpatient Boarding on ED Efficiency: A Discrete-Event Simulation Study

OpenAIRE

Bair, Aaron E.; Song, Wheyming T.; Chen, Yi-Chun; Morris, Beth A.

2009-01-01

In this study, a discrete-event simulation approach was used to model Emergency Department’s (ED) patient flow to investigate the effect of inpatient boarding on the ED efficiency in terms of the National Emergency Department Crowding Scale (NEDOCS) score and the rate of patients who leave without being seen (LWBS). The decision variable in this model was the boarder-released-ratio defined as the ratio of admitted patients whose boarding time is zero to all admitted patients. Our analysis sho...

Online Estimation of Time-Varying Volatility Using a Continuous-Discrete LMS Algorithm

Directory of Open Access Journals (Sweden)

Jacques Oksman

2008-09-01

Full Text Available The following paper addresses a problem of inference in financial engineering, namely, online time-varying volatility estimation. The proposed method is based on an adaptive predictor for the stock price, built from an implicit integration formula. An estimate for the current volatility value which minimizes the mean square prediction error is calculated recursively using an LMS algorithm. The method is then validated on several synthetic examples as well as on real data. Throughout the illustration, the proposed method is compared with both UKF and offline volatility estimation.

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.

Optimized Parallel Discrete Event Simulation (PDES) for High Performance Computing (HPC) Clusters

National Research Council Canada - National Science Library

Abu-Ghazaleh, Nael

2005-01-01

The aim of this project was to study the communication subsystem performance of state of the art optimistic simulator Synchronous Parallel Environment for Emulation and Discrete-Event Simulation (SPEEDES...

Discrete-Time Nonlinear Control of VSC-HVDC System

Directory of Open Access Journals (Sweden)

TianTian Qian

2015-01-01

Full Text Available Because VSC-HVDC is a kind of strong nonlinear, coupling, and multi-input multioutput (MIMO system, its control problem is always attracting much attention from scholars. And a lot of papers have done research on its control strategy in the continuous-time domain. But the control system is implemented through the computer discrete sampling in practical engineering. It is necessary to study the mathematical model and control algorithm in the discrete-time domain. The discrete mathematical model based on output feedback linearization and discrete sliding mode control algorithm is proposed in this paper. And to ensure the effectiveness of the control system in the quasi sliding mode state, the fast output sampling method is used in the output feedback. The results from simulation experiment in MATLAB/SIMULINK prove that the proposed discrete control algorithm can make the VSC-HVDC system have good static, dynamic, and robust characteristics in discrete-time domain.

Discrete event simulation and virtual reality use in industry: new opportunities and future trends

OpenAIRE

Turner, Christopher; Hutabarat, Windo; Oyekan, John; Tiwari, Ashutosh

2016-01-01

This paper reviews the area of combined discrete event simulation (DES) and virtual reality (VR) use within industry. While establishing a state of the art for progress in this area, this paper makes the case for VR DES as the vehicle of choice for complex data analysis through interactive simulation models, highlighting both its advantages and current limitations. This paper reviews active research topics such as VR and DES real-time integration, communication protocols,...

Mapping of uncertainty relations between continuous and discrete time.

Science.gov (United States)

Chiuchiù, Davide; Pigolotti, Simone

2018-03-01

Lower bounds on fluctuations of thermodynamic currents depend on the nature of time, discrete or continuous. To understand the physical reason, we compare current fluctuations in discrete-time Markov chains and continuous-time master equations. We prove that current fluctuations in the master equations are always more likely, due to random timings of transitions. This comparison leads to a mapping of the moments of a current between discrete and continuous time. We exploit this mapping to obtain uncertainty bounds. Our results reduce the quests for uncertainty bounds in discrete and continuous time to a single problem.

Impulsive stabilization and impulsive synchronization of discrete-time delayed neural networks.

Science.gov (United States)

Chen, Wu-Hua; Lu, Xiaomei; Zheng, Wei Xing

2015-04-01

This paper investigates the problems of impulsive stabilization and impulsive synchronization of discrete-time delayed neural networks (DDNNs). Two types of DDNNs with stabilizing impulses are studied. By introducing the time-varying Lyapunov functional to capture the dynamical characteristics of discrete-time impulsive delayed neural networks (DIDNNs) and by using a convex combination technique, new exponential stability criteria are derived in terms of linear matrix inequalities. The stability criteria for DIDNNs are independent of the size of time delay but rely on the lengths of impulsive intervals. With the newly obtained stability results, sufficient conditions on the existence of linear-state feedback impulsive controllers are derived. Moreover, a novel impulsive synchronization scheme for two identical DDNNs is proposed. The novel impulsive synchronization scheme allows synchronizing two identical DDNNs with unknown delays. Simulation results are given to validate the effectiveness of the proposed criteria of impulsive stabilization and impulsive synchronization of DDNNs. Finally, an application of the obtained impulsive synchronization result for two identical chaotic DDNNs to a secure communication scheme is presented.

Can discrete event simulation be of use in modelling major depression?

Science.gov (United States)

Le Lay, Agathe; Despiegel, Nicolas; François, Clément; Duru, Gérard

2006-12-05

Depression is among the major contributors to worldwide disease burden and adequate modelling requires a framework designed to depict real world disease progression as well as its economic implications as closely as possible. In light of the specific characteristics associated with depression (multiple episodes at varying intervals, impact of disease history on course of illness, sociodemographic factors), our aim was to clarify to what extent "Discrete Event Simulation" (DES) models provide methodological benefits in depicting disease evolution. We conducted a comprehensive review of published Markov models in depression and identified potential limits to their methodology. A model based on DES principles was developed to investigate the benefits and drawbacks of this simulation method compared with Markov modelling techniques. The major drawback to Markov models is that they may not be suitable to tracking patients' disease history properly, unless the analyst defines multiple health states, which may lead to intractable situations. They are also too rigid to take into consideration multiple patient-specific sociodemographic characteristics in a single model. To do so would also require defining multiple health states which would render the analysis entirely too complex. We show that DES resolve these weaknesses and that its flexibility allow patients with differing attributes to move from one event to another in sequential order while simultaneously taking into account important risk factors such as age, gender, disease history and patients attitude towards treatment, together with any disease-related events (adverse events, suicide attempt etc.). DES modelling appears to be an accurate, flexible and comprehensive means of depicting disease progression compared with conventional simulation methodologies. Its use in analysing recurrent and chronic diseases appears particularly useful compared with Markov processes.

Quadratic Term Structure Models in Discrete Time

OpenAIRE

Marco Realdon

2006-01-01

This paper extends the results on quadratic term structure models in continuos time to the discrete time setting. The continuos time setting can be seen as a special case of the discrete time one. Recursive closed form solutions for zero coupon bonds are provided even in the presence of multiple correlated underlying factors. Pricing bond options requires simple integration. Model parameters may well be time dependent without scuppering such tractability. Model estimation does not require a r...

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

A continuous-time/discrete-time mixed audio-band sigma delta ADC

International Nuclear Information System (INIS)

Liu Yan; Hua Siliang; Wang Donghui; Hou Chaohuan

2011-01-01

This paper introduces a mixed continuous-time/discrete-time, single-loop, fourth-order, 4-bit audio-band sigma delta ADC that combines the benefits of continuous-time and discrete-time circuits, while mitigating the challenges associated with continuous-time design. Measurement results show that the peak SNR of this ADC reaches 100 dB and the total power consumption is less than 30 mW. (semiconductor integrated circuits)

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.

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.

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

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

Developing Flexible Discrete Event Simulation Models in an Uncertain Policy Environment

Science.gov (United States)

Miranda, David J.; Fayez, Sam; Steele, Martin J.

2011-01-01

On February 1st, 2010 U.S. President Barack Obama submitted to Congress his proposed budget request for Fiscal Year 2011. This budget included significant changes to the National Aeronautics and Space Administration (NASA), including the proposed cancellation of the Constellation Program. This change proved to be controversial and Congressional approval of the program's official cancellation would take many months to complete. During this same period an end-to-end discrete event simulation (DES) model of Constellation operations was being built through the joint efforts of Productivity Apex Inc. (PAl) and Science Applications International Corporation (SAIC) teams under the guidance of NASA. The uncertainty in regards to the Constellation program presented a major challenge to the DES team, as to: continue the development of this program-of-record simulation, while at the same time remain prepared for possible changes to the program. This required the team to rethink how it would develop it's model and make it flexible enough to support possible future vehicles while at the same time be specific enough to support the program-of-record. This challenge was compounded by the fact that this model was being developed through the traditional DES process-orientation which lacked the flexibility of object-oriented approaches. The team met this challenge through significant pre-planning that led to the "modularization" of the model's structure by identifying what was generic, finding natural logic break points, and the standardization of interlogic numbering system. The outcome of this work resulted in a model that not only was ready to be easily modified to support any future rocket programs, but also a model that was extremely structured and organized in a way that facilitated rapid verification. This paper discusses in detail the process the team followed to build this model and the many advantages this method provides builders of traditional process-oriented discrete

Discrete-Time LPV Current Control of an Induction Motor

DEFF Research Database (Denmark)

Bendtsen, Jan Dimon; Trangbæk, Klaus

2001-01-01

In this paper we apply a new method for gain-scheduled output feedback control of nonlinear systems to current control of an induction motor. The method relies on recently developed controller synthesis results for linear parameter-varying (LPV) systems, where the controller synthesis is formulated...... without further complications. The synthesis method is applied to the model, yielding an LPV discrete-time controller. Finally, the efficiency of the control scheme is validated via simulations as well as experimentally on the actual induction motor, both in open-loop current control and when an outer...... speed control loop is closed around the current loop...

Discrete-Time LPV Current Control of an Induction Motor

DEFF Research Database (Denmark)

Bendtsen, Jan Dimon; Trangbæk, Klaus

2003-01-01

In this paper we apply a new method for gain-scheduled output feedback control of nonlinear systems to current control of an induction motor. The method relies on recently developed controller synthesis results for linear parameter-varying (LPV) systems, where the controller synthesis is formulated...... further complications. The synthesis method is applied to the model, yielding an LPV discrete-time controller. Finally, the efficiency of the control scheme is validated via simulations as well as on the actual induction motor, both in open-loop current control and when an outer speed control loop...... is closed around the current loop....

The Effect of Haptic Guidance on Learning a Hybrid Rhythmic-Discrete Motor Task.

Science.gov (United States)

Marchal-Crespo, Laura; Bannwart, Mathias; Riener, Robert; Vallery, Heike

2015-01-01

Bouncing a ball with a racket is a hybrid rhythmic-discrete motor task, combining continuous rhythmic racket movements with discrete impact events. Rhythmicity is exceptionally important in motor learning, because it underlies fundamental movements such as walking. Studies suggested that rhythmic and discrete movements are governed by different control mechanisms at different levels of the Central Nervous System. The aim of this study is to evaluate the effect of fixed/fading haptic guidance on learning to bounce a ball to a desired apex in virtual reality with varying gravity. Changing gravity changes dominance of rhythmic versus discrete control: The higher the value of gravity, the more rhythmic the task; lower values reduce the bouncing frequency and increase dwell times, eventually leading to a repetitive discrete task that requires initiation and termination, resembling target-oriented reaching. Although motor learning in the ball-bouncing task with varying gravity has been studied, the effect of haptic guidance on learning such a hybrid rhythmic-discrete motor task has not been addressed. We performed an experiment with thirty healthy subjects and found that the most effective training condition depended on the degree of rhythmicity: Haptic guidance seems to hamper learning of continuous rhythmic tasks, but it seems to promote learning for repetitive tasks that resemble discrete movements.

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.

Behavior coordination of mobile robotics using supervisory control of fuzzy discrete event systems.

Science.gov (United States)

Jayasiri, Awantha; Mann, George K I; Gosine, Raymond G

2011-10-01

In order to incorporate the uncertainty and impreciseness present in real-world event-driven asynchronous systems, fuzzy discrete event systems (DESs) (FDESs) have been proposed as an extension to crisp DESs. In this paper, first, we propose an extension to the supervisory control theory of FDES by redefining fuzzy controllable and uncontrollable events. The proposed supervisor is capable of enabling feasible uncontrollable and controllable events with different possibilities. Then, the extended supervisory control framework of FDES is employed to model and control several navigational tasks of a mobile robot using the behavior-based approach. The robot has limited sensory capabilities, and the navigations have been performed in several unmodeled environments. The reactive and deliberative behaviors of the mobile robotic system are weighted through fuzzy uncontrollable and controllable events, respectively. By employing the proposed supervisory controller, a command-fusion-type behavior coordination is achieved. The observability of fuzzy events is incorporated to represent the sensory imprecision. As a systematic analysis of the system, a fuzzy-state-based controllability measure is introduced. The approach is implemented in both simulation and real time. A performance evaluation is performed to quantitatively estimate the validity of the proposed approach over its counterparts.

Research on Adaptive Neural Network Control System Based on Nonlinear U-Model with Time-Varying Delay

Directory of Open Access Journals (Sweden)

Fengxia Xu

2014-01-01

Full Text Available U-model can approximate a large class of smooth nonlinear time-varying delay system to any accuracy by using time-varying delay parameters polynomial. This paper proposes a new approach, namely, U-model approach, to solving the problems of analysis and synthesis for nonlinear systems. Based on the idea of discrete-time U-model with time-varying delay, the identification algorithm of adaptive neural network is given for the nonlinear model. Then, the controller is designed by using the Newton-Raphson formula and the stability analysis is given for the closed-loop nonlinear systems. Finally, illustrative examples are given to show the validity and applicability of the obtained results.

Advanced discrete-time control designs and applications

CERN Document Server

Abidi, Khalid

2015-01-01

This book covers a wide spectrum of systems such as linear and nonlinear multivariable systems as well as control problems such as disturbance, uncertainty and time-delays. The purpose of this book is to provide researchers and practitioners a manual for the design and application of advanced discrete-time controllers.  The book presents six different control approaches depending on the type of system and control problem. The first and second approaches are based on Sliding Mode control (SMC) theory and are intended for linear systems with exogenous disturbances. The third and fourth approaches are based on adaptive control theory and are aimed at linear/nonlinear systems with periodically varying parametric uncertainty or systems with input delay. The fifth approach is based on Iterative learning control (ILC) theory and is aimed at uncertain linear/nonlinear systems with repeatable tasks and the final approach is based on fuzzy logic control (FLC) and is intended for highly uncertain systems with heuristi...

Desktop Modeling and Simulation: Parsimonious, yet Effective Discrete-Event Simulation Analysis

Science.gov (United States)

Bradley, James R.

2012-01-01

This paper evaluates how quickly students can be trained to construct useful discrete-event simulation models using Excel The typical supply chain used by many large national retailers is described, and an Excel-based simulation model is constructed of it The set of programming and simulation skills required for development of that model are then determined we conclude that six hours of training are required to teach the skills to MBA students . The simulation presented here contains all fundamental functionallty of a simulation model, and so our result holds for any discrete-event simulation model. We argue therefore that Industry workers with the same technical skill set as students having completed one year in an MBA program can be quickly trained to construct simulation models. This result gives credence to the efficacy of Desktop Modeling and Simulation whereby simulation analyses can be quickly developed, run, and analyzed with widely available software, namely Excel.

Discrete-time optimal control and games on large intervals

CERN Document Server

Zaslavski, Alexander J

2017-01-01

Devoted to the structure of approximate solutions of discrete-time optimal control problems and approximate solutions of dynamic discrete-time two-player zero-sum games, this book presents results on properties of approximate solutions in an interval that is independent lengthwise, for all sufficiently large intervals. Results concerning the so-called turnpike property of optimal control problems and zero-sum games in the regions close to the endpoints of the time intervals are the main focus of this book. The description of the structure of approximate solutions on sufficiently large intervals and its stability will interest graduate students and mathematicians in optimal control and game theory, engineering, and economics. This book begins with a brief overview and moves on to analyze the structure of approximate solutions of autonomous nonconcave discrete-time optimal control Lagrange problems.Next the structures of approximate solutions of autonomous discrete-time optimal control problems that are discret...

Simulating continuous-time Hamiltonian dynamics by way of a discrete-time quantum walk

International Nuclear Information System (INIS)

Schmitz, A.T.; Schwalm, W.A.

2016-01-01

Much effort has been made to connect the continuous-time and discrete-time quantum walks. We present a method for making that connection for a general graph Hamiltonian on a bigraph. Furthermore, such a scheme may be adapted for simulating discretized quantum models on a quantum computer. A coin operator is found for the discrete-time quantum walk which exhibits the same dynamics as the continuous-time evolution. Given the spectral decomposition of the graph Hamiltonian and certain restrictions, the discrete-time evolution is solved for explicitly and understood at or near important values of the parameters. Finally, this scheme is connected to past results for the 1D chain. - Highlights: • A discrete-time quantum walk is purposed which approximates a continuous-time quantum walk. • The purposed quantum walk could be used to simulate Hamiltonian dynamics on a quantum computer. • Given the spectra decomposition of the Hamiltonian, the quantum walk is solved explicitly. • The method is demonstrated and connected to previous work done on the 1D chain.

Discrete event simulation for exploring strategies: an urban water management case.

Science.gov (United States)

Huang, Dong-Bin; Scholz, Roland W; Gujer, Willi; Chitwood, Derek E; Loukopoulos, Peter; Schertenleib, Roland; Siegrist, Hansruedi

2007-02-01

This paper presents a model structure aimed at offering an overview of the various elements of a strategy and exploring their multidimensional effects through time in an efficient way. It treats a strategy as a set of discrete events planned to achieve a certain strategic goal and develops a new form of causal networks as an interfacing component between decision makers and environment models, e.g., life cycle inventory and material flow models. The causal network receives a strategic plan as input in a discrete manner and then outputs the updated parameter sets to the subsequent environmental models. Accordingly, the potential dynamic evolution of environmental systems caused by various strategies can be stepwise simulated. It enables a way to incorporate discontinuous change in models for environmental strategy analysis, and enhances the interpretability and extendibility of a complex model by its cellular constructs. It is exemplified using an urban water management case in Kunming, a major city in Southwest China. By utilizing the presented method, the case study modeled the cross-scale interdependencies of the urban drainage system and regional water balance systems, and evaluated the effectiveness of various strategies for improving the situation of Dianchi Lake.

Robust outer synchronization between two nonlinear complex networks with parametric disturbances and mixed time-varying delays

Science.gov (United States)

Zhang, Chuan; Wang, Xingyuan; Luo, Chao; Li, Junqiu; Wang, Chunpeng

2018-03-01

In this paper, we focus on the robust outer synchronization problem between two nonlinear complex networks with parametric disturbances and mixed time-varying delays. Firstly, a general complex network model is proposed. Besides the nonlinear couplings, the network model in this paper can possess parametric disturbances, internal time-varying delay, discrete time-varying delay and distributed time-varying delay. Then, according to the robust control strategy, linear matrix inequality and Lyapunov stability theory, several outer synchronization protocols are strictly derived. Simple linear matrix controllers are designed to driver the response network synchronize to the drive network. Additionally, our results can be applied on the complex networks without parametric disturbances. Finally, by utilizing the delayed Lorenz chaotic system as the dynamics of all nodes, simulation examples are given to demonstrate the effectiveness of our theoretical results.

Can discrete event simulation be of use in modelling major depression?

Directory of Open Access Journals (Sweden)

François Clément

2006-12-01

Full Text Available Abstract Background Depression is among the major contributors to worldwide disease burden and adequate modelling requires a framework designed to depict real world disease progression as well as its economic implications as closely as possible. Objectives In light of the specific characteristics associated with depression (multiple episodes at varying intervals, impact of disease history on course of illness, sociodemographic factors, our aim was to clarify to what extent "Discrete Event Simulation" (DES models provide methodological benefits in depicting disease evolution. Methods We conducted a comprehensive review of published Markov models in depression and identified potential limits to their methodology. A model based on DES principles was developed to investigate the benefits and drawbacks of this simulation method compared with Markov modelling techniques. Results The major drawback to Markov models is that they may not be suitable to tracking patients' disease history properly, unless the analyst defines multiple health states, which may lead to intractable situations. They are also too rigid to take into consideration multiple patient-specific sociodemographic characteristics in a single model. To do so would also require defining multiple health states which would render the analysis entirely too complex. We show that DES resolve these weaknesses and that its flexibility allow patients with differing attributes to move from one event to another in sequential order while simultaneously taking into account important risk factors such as age, gender, disease history and patients attitude towards treatment, together with any disease-related events (adverse events, suicide attempt etc.. Conclusion DES modelling appears to be an accurate, flexible and comprehensive means of depicting disease progression compared with conventional simulation methodologies. Its use in analysing recurrent and chronic diseases appears particularly useful

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 Event Simulation for the Analysis of Artillery Fired Projectiles from Shore

Science.gov (United States)

2017-06-01

model. 2.1 Discrete Event Simulation with Simkit Simkit is a library of classes and interfaces, written in Java , that support ease of implemen- tation...Simkit allows simulation modelers to break complex systems into components through a framework of Listener Event Graph Objects (LEGOs), described in...Classes A disadvantage to using Java Enum Types is the inability to change the values of Enum Type parameters while conducting a designed experiment

Discrete event simulation of crop operations in sweet pepper in support of work method innovation

NARCIS (Netherlands)

Ooster, van 't Bert; Aantjes, Wiger; Melamed, Z.

2017-01-01

Greenhouse Work Simulation, GWorkS, is a model that simulates crop operations in greenhouses for the purpose of analysing work methods. GWorkS is a discrete event model that approaches reality as a discrete stochastic dynamic system. GWorkS was developed and validated using cut-rose as a case

Analyzing time-ordered event data with missed observations.

Science.gov (United States)

Dokter, Adriaan M; van Loon, E Emiel; Fokkema, Wimke; Lameris, Thomas K; Nolet, Bart A; van der Jeugd, Henk P

2017-09-01

A common problem with observational datasets is that not all events of interest may be detected. For example, observing animals in the wild can difficult when animals move, hide, or cannot be closely approached. We consider time series of events recorded in conditions where events are occasionally missed by observers or observational devices. These time series are not restricted to behavioral protocols, but can be any cyclic or recurring process where discrete outcomes are observed. Undetected events cause biased inferences on the process of interest, and statistical analyses are needed that can identify and correct the compromised detection processes. Missed observations in time series lead to observed time intervals between events at multiples of the true inter-event time, which conveys information on their detection probability. We derive the theoretical probability density function for observed intervals between events that includes a probability of missed detection. Methodology and software tools are provided for analysis of event data with potential observation bias and its removal. The methodology was applied to simulation data and a case study of defecation rate estimation in geese, which is commonly used to estimate their digestive throughput and energetic uptake, or to calculate goose usage of a feeding site from dropping density. Simulations indicate that at a moderate chance to miss arrival events ( p  = 0.3), uncorrected arrival intervals were biased upward by up to a factor 3, while parameter values corrected for missed observations were within 1% of their true simulated value. A field case study shows that not accounting for missed observations leads to substantial underestimates of the true defecation rate in geese, and spurious rate differences between sites, which are introduced by differences in observational conditions. These results show that the derived methodology can be used to effectively remove observational biases in time-ordered event

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...

Core discrete event simulation model for the evaluation of health care technologies in major depressive disorder.

Science.gov (United States)

Vataire, Anne-Lise; Aballéa, Samuel; Antonanzas, Fernando; Roijen, Leona Hakkaart-van; Lam, Raymond W; McCrone, Paul; Persson, Ulf; Toumi, Mondher

2014-03-01

A review of existing economic models in major depressive disorder (MDD) highlighted the need for models with longer time horizons that also account for heterogeneity in treatment pathways between patients. A core discrete event simulation model was developed to estimate health and cost outcomes associated with alternative treatment strategies. This model simulated short- and long-term clinical events (partial response, remission, relapse, recovery, and recurrence), adverse events, and treatment changes (titration, switch, addition, and discontinuation) over up to 5 years. Several treatment pathways were defined on the basis of fictitious antidepressants with three levels of efficacy, tolerability, and price (low, medium, and high) from first line to third line. The model was populated with input data from the literature for the UK setting. Model outputs include time in different health states, quality-adjusted life-years (QALYs), and costs from National Health Service and societal perspectives. The codes are open source. Predicted costs and QALYs from this model are within the range of results from previous economic evaluations. The largest cost components from the payer perspective were physician visits and hospitalizations. Key parameters driving the predicted costs and QALYs were utility values, effectiveness, and frequency of physician visits. Differences in QALYs and costs between two strategies with different effectiveness increased approximately twofold when the time horizon increased from 1 to 5 years. The discrete event simulation model can provide a more comprehensive evaluation of different therapeutic options in MDD, compared with existing Markov models, and can be used to compare a wide range of health care technologies in various groups of patients with MDD. Copyright © 2014 International Society for Pharmacoeconomics and Outcomes Research (ISPOR). Published by Elsevier Inc. All rights reserved.

A receding horizon scheme for discrete-time polytopic linear parameter varying systems in networked architectures

International Nuclear Information System (INIS)

Franzè, Giuseppe; Lucia, Walter; Tedesco, Francesco

2014-01-01

This paper proposes a Model Predictive Control (MPC) strategy to address regulation problems for constrained polytopic Linear Parameter Varying (LPV) systems subject to input and state constraints in which both plant measurements and command signals in the loop are sent through communication channels subject to time-varying delays (Networked Control System (NCS)). The results here proposed represent a significant extension to the LPV framework of a recent Receding Horizon Control (RHC) scheme developed for the so-called robust case. By exploiting the parameter availability, the pre-computed sequences of one- step controllable sets inner approximations are less conservative than the robust counterpart. The resulting framework guarantees asymptotic stability and constraints fulfilment regardless of plant uncertainties and time-delay occurrences. Finally, experimental results on a laboratory two-tank test-bed show the effectiveness of the proposed approach

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.

Determining the significance of associations between two series of discrete events : bootstrap methods /

Energy Technology Data Exchange (ETDEWEB)

Niehof, Jonathan T.; Morley, Steven K.

2012-01-01

We review and develop techniques to determine associations between series of discrete events. The bootstrap, a nonparametric statistical method, allows the determination of the significance of associations with minimal assumptions about the underlying processes. We find the key requirement for this method: one of the series must be widely spaced in time to guarantee the theoretical applicability of the bootstrap. If this condition is met, the calculated significance passes a reasonableness test. We conclude with some potential future extensions and caveats on the applicability of these methods. The techniques presented have been implemented in a Python-based software toolkit.

Modeling Temporal Processes in Early Spacecraft Design: Application of Discrete-Event Simulations for Darpa's F6 Program

Science.gov (United States)

Dubos, Gregory F.; Cornford, Steven

2012-01-01

While the ability to model the state of a space system over time is essential during spacecraft operations, the use of time-based simulations remains rare in preliminary design. The absence of the time dimension in most traditional early design tools can however become a hurdle when designing complex systems whose development and operations can be disrupted by various events, such as delays or failures. As the value delivered by a space system is highly affected by such events, exploring the trade space for designs that yield the maximum value calls for the explicit modeling of time.This paper discusses the use of discrete-event models to simulate spacecraft development schedule as well as operational scenarios and on-orbit resources in the presence of uncertainty. It illustrates how such simulations can be utilized to support trade studies, through the example of a tool developed for DARPA's F6 program to assist the design of "fractionated spacecraft".

Evaluation of a proposed optimization method for discrete-event simulation models

Directory of Open Access Journals (Sweden)

Alexandre Ferreira de Pinho

2012-12-01

Full Text Available Optimization methods combined with computer-based simulation have been utilized in a wide range of manufacturing applications. However, in terms of current technology, these methods exhibit low performance levels which are only able to manipulate a single decision variable at a time. Thus, the objective of this article is to evaluate a proposed optimization method for discrete-event simulation models based on genetic algorithms which exhibits more efficiency in relation to computational time when compared to software packages on the market. It should be emphasized that the variable's response quality will not be altered; that is, the proposed method will maintain the solutions' effectiveness. Thus, the study draws a comparison between the proposed method and that of a simulation instrument already available on the market and has been examined in academic literature. Conclusions are presented, confirming the proposed optimization method's efficiency.

Stagewise pseudo-value regression for time-varying effects on the cumulative incidence

DEFF Research Database (Denmark)

Zöller, Daniela; Schmidtmann, Irene; Weinmann, Arndt

2016-01-01

In a competing risks setting, the cumulative incidence of an event of interest describes the absolute risk for this event as a function of time. For regression analysis, one can either choose to model all competing events by separate cause-specific hazard models or directly model the association...... for time-varying effects. This is implemented by coupling variable selection between the grid times, but determining estimates separately. The effect estimates are regularized to also allow for model fitting with a low to moderate number of observations. This technique is illustrated in an application...

Physical models on discrete space and time

International Nuclear Information System (INIS)

Lorente, M.

1986-01-01

The idea of space and time quantum operators with a discrete spectrum has been proposed frequently since the discovery that some physical quantities exhibit measured values that are multiples of fundamental units. This paper first reviews a number of these physical models. They are: the method of finite elements proposed by Bender et al; the quantum field theory model on discrete space-time proposed by Yamamoto; the finite dimensional quantum mechanics approach proposed by Santhanam et al; the idea of space-time as lattices of n-simplices proposed by Kaplunovsky et al; and the theory of elementary processes proposed by Weizsaecker and his colleagues. The paper then presents a model proposed by the authors and based on the (n+1)-dimensional space-time lattice where fundamental entities interact among themselves 1 to 2n in order to build up a n-dimensional cubic lattice as a ground field where the physical interactions take place. The space-time coordinates are nothing more than the labelling of the ground field and take only discrete values. 11 references

Synchronization of nonidentical chaotic neural networks with leakage delay and mixed time-varying delays

Directory of Open Access Journals (Sweden)

Cao Jinde

2011-01-01

Full Text Available Abstract In this paper, an integral sliding mode control approach is presented to investigate synchronization of nonidentical chaotic neural networks with discrete and distributed time-varying delays as well as leakage delay. By considering a proper sliding surface and constructing Lyapunov-Krasovskii functional, as well as employing a combination of the free-weighting matrix method, Newton-Leibniz formulation and inequality technique, a sliding mode controller is designed to achieve the asymptotical synchronization of the addressed nonidentical neural networks. Moreover, a sliding mode control law is also synthesized to guarantee the reachability of the specified sliding surface. The provided conditions are expressed in terms of linear matrix inequalities, and are dependent on the discrete and distributed time delays as well as leakage delay. A simulation example is given to verify the theoretical results.

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.

Time-varying BRDFs.

Science.gov (United States)

Sun, Bo; Sunkavalli, Kalyan; Ramamoorthi, Ravi; Belhumeur, Peter N; Nayar, Shree K

2007-01-01

The properties of virtually all real-world materials change with time, causing their bidirectional reflectance distribution functions (BRDFs) to be time varying. However, none of the existing BRDF models and databases take time variation into consideration; they represent the appearance of a material at a single time instance. In this paper, we address the acquisition, analysis, modeling, and rendering of a wide range of time-varying BRDFs (TVBRDFs). We have developed an acquisition system that is capable of sampling a material's BRDF at multiple time instances, with each time sample acquired within 36 sec. We have used this acquisition system to measure the BRDFs of a wide range of time-varying phenomena, which include the drying of various types of paints (watercolor, spray, and oil), the drying of wet rough surfaces (cement, plaster, and fabrics), the accumulation of dusts (household and joint compound) on surfaces, and the melting of materials (chocolate). Analytic BRDF functions are fit to these measurements and the model parameters' variations with time are analyzed. Each category exhibits interesting and sometimes nonintuitive parameter trends. These parameter trends are then used to develop analytic TVBRDF models. The analytic TVBRDF models enable us to apply effects such as paint drying and dust accumulation to arbitrary surfaces and novel materials.

A Monte Carlo study of time-aggregation in continuous-time and discrete-time parametric hazard models.

NARCIS (Netherlands)

Hofstede, ter F.; Wedel, M.

1998-01-01

This study investigates the effects of time aggregation in discrete and continuous-time hazard models. A Monte Carlo study is conducted in which data are generated according to various continuous and discrete-time processes, and aggregated into daily, weekly and monthly intervals. These data are

Teleradiology system analysis using a discrete event-driven block-oriented network simulator

Science.gov (United States)

Stewart, Brent K.; Dwyer, Samuel J., III

1992-07-01

Performance evaluation and trade-off analysis are the central issues in the design of communication networks. Simulation plays an important role in computer-aided design and analysis of communication networks and related systems, allowing testing of numerous architectural configurations and fault scenarios. We are using the Block Oriented Network Simulator (BONeS, Comdisco, Foster City, CA) software package to perform discrete, event- driven Monte Carlo simulations in capacity planning, tradeoff analysis and evaluation of alternate architectures for a high-speed, high-resolution teleradiology project. A queuing network model of the teleradiology system has been devise, simulations executed and results analyzed. The wide area network link uses a switched, dial-up N X 56 kbps inverting multiplexer where the number of digital voice-grade lines (N) can vary from one (DS-0) through 24 (DS-1). The proposed goal of such a system is 200 films (2048 X 2048 X 12-bit) transferred between a remote and local site in an eight hour period with a mean delay time less than five minutes. It is found that: (1) the DS-1 service limit is around 100 films per eight hour period with a mean delay time of 412 +/- 39 seconds, short of the goal stipulated above; (2) compressed video teleconferencing can be run simultaneously with image data transfer over the DS-1 wide area network link without impacting the performance of the described teleradiology system; (3) there is little sense in upgrading to a higher bandwidth WAN link like DS-2 or DS-3 for the current system; and (4) the goal of transmitting 200 films in an eight hour period with a mean delay time less than five minutes can be achieved simply if the laser printer interface is updated from the current DR-11W interface to a much faster SCSI interface.

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.

Continuous- and Discrete-Time Stimulus Sequences for High Stimulus Rate Paradigm in Evoked Potential Studies

Directory of Open Access Journals (Sweden)

Tao Wang

2013-01-01

Full Text Available To obtain reliable transient auditory evoked potentials (AEPs from EEGs recorded using high stimulus rate (HSR paradigm, it is critical to design the stimulus sequences of appropriate frequency properties. Traditionally, the individual stimulus events in a stimulus sequence occur only at discrete time points dependent on the sampling frequency of the recording system and the duration of stimulus sequence. This dependency likely causes the implementation of suboptimal stimulus sequences, sacrificing the reliability of resulting AEPs. In this paper, we explicate the use of continuous-time stimulus sequence for HSR paradigm, which is independent of the discrete electroencephalogram (EEG recording system. We employ simulation studies to examine the applicability of the continuous-time stimulus sequences and the impacts of sampling frequency on AEPs in traditional studies using discrete-time design. Results from these studies show that the continuous-time sequences can offer better frequency properties and improve the reliability of recovered AEPs. Furthermore, we find that the errors in the recovered AEPs depend critically on the sampling frequencies of experimental systems, and their relationship can be fitted using a reciprocal function. As such, our study contributes to the literature by demonstrating the applicability and advantages of continuous-time stimulus sequences for HSR paradigm and by revealing the relationship between the reliability of AEPs and sampling frequencies of the experimental systems when discrete-time stimulus sequences are used in traditional manner for the HSR paradigm.

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

Discrete time and continuous time dynamic mean-variance analysis

OpenAIRE

Reiss, Ariane

1999-01-01

Contrary to static mean-variance analysis, very few papers have dealt with dynamic mean-variance analysis. Here, the mean-variance efficient self-financing portfolio strategy is derived for n risky assets in discrete and continuous time. In the discrete setting, the resulting portfolio is mean-variance efficient in a dynamic sense. It is shown that the optimal strategy for n risky assets may be dominated if the expected terminal wealth is constrained to exactly attain a certain goal instead o...

Using discrete event simulation to change from a functional layout to a cellular layout in an auto parts industry

Directory of Open Access Journals (Sweden)

Thiago Buselato Maurício

2015-07-01

Full Text Available This paper presents a discrete event simulation employed in a Brazilian automotive company. There was a huge waste caused by one family scrap. It was believed one reason was the company functional layout. In this case, changing from current to cellular layout, employee synergy and knowledge about this family would increase. Due to the complexity for dimensioning a new cellular layout, mainly because of batch size and client’s demand variation. In this case, discrete event simulation was used, which made possible to introduce those effects improving accuracy in final results. This accuracy will be shown by comparing results obtained with simulation and without it (as company used to do. To conclude, cellular layout was responsible for increasing 15% of productivity, reducing lead-time in 7 days and scrap in 15% for this family.

Discrete event dynamic system (DES)-based modeling for dynamic material flow in the pyroprocess

International Nuclear Information System (INIS)

Lee, Hyo Jik; Kim, Kiho; Kim, Ho Dong; Lee, Han Soo

2011-01-01

A modeling and simulation methodology was proposed in order to implement the dynamic material flow of the pyroprocess. Since the static mass balance provides the limited information on the material flow, it is hard to predict dynamic behavior according to event. Therefore, a discrete event system (DES)-based model named, PyroFlow, was developed at the Korea Atomic Energy Research Institute (KAERI). PyroFlow is able to calculate dynamic mass balance and also show various dynamic operational results in real time. By using PyroFlow, it is easy to rapidly predict unforeseeable results, such as throughput in unit process, accumulated product in buffer and operation status. As preliminary simulations, bottleneck analyses in the pyroprocess were carried out and consequently it was presented that operation strategy had influence on the productivity of the pyroprocess.

Developing a discrete event simulation model for university student shuttle buses

Science.gov (United States)

Zulkepli, Jafri; Khalid, Ruzelan; Nawawi, Mohd Kamal Mohd; Hamid, Muhammad Hafizan

2017-11-01

Providing shuttle buses for university students to attend their classes is crucial, especially when their number is large and the distances between their classes and residential halls are far. These factors, in addition to the non-optimal current bus services, typically require the students to wait longer which eventually opens a space for them to complain. To considerably reduce the waiting time, providing the optimal number of buses to transport them from location to location and the effective route schedules to fulfil the students' demand at relevant time ranges are thus important. The optimal bus number and schedules are to be determined and tested using a flexible decision platform. This paper thus models the current services of student shuttle buses in a university using a Discrete Event Simulation approach. The model can flexibly simulate whatever changes configured to the current system and report its effects to the performance measures. How the model was conceptualized and formulated for future system configurations are the main interest of this paper.

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.

On synchronized regions of discrete-time complex dynamical networks

International Nuclear Information System (INIS)

Duan Zhisheng; Chen Guanrong

2011-01-01

In this paper, the local synchronization of discrete-time complex networks is studied. First, it is shown that for any natural number n, there exists a discrete-time network which has at least left floor n/2 right floor +1 disconnected synchronized regions for local synchronization, which implies the possibility of intermittent synchronization behaviors. Different from the continuous-time networks, the existence of an unbounded synchronized region is impossible for discrete-time networks. The convexity of the synchronized regions is also characterized based on the stability of a class of matrix pencils, which is useful for enlarging the stability region so as to improve the network synchronizability.

The problem with time in mixed continuous/discrete time modelling

NARCIS (Netherlands)

Rovers, K.C.; Kuper, Jan; Smit, Gerardus Johannes Maria

The design of cyber-physical systems requires the use of mixed continuous time and discrete time models. Current modelling tools have problems with time transformations (such as a time delay) or multi-rate systems. We will present a novel approach that implements signals as functions of time,

Delay-Dependent Stability Criteria of Uncertain Periodic Switched Recurrent Neural Networks with Time-Varying Delays

Directory of Open Access Journals (Sweden)

Xing Yin

2011-01-01

uncertain periodic switched recurrent neural networks with time-varying delays. When uncertain discrete-time recurrent neural network is a periodic system, it is expressed as switched neural network for the finite switching state. Based on the switched quadratic Lyapunov functional approach (SQLF and free-weighting matrix approach (FWM, some linear matrix inequality criteria are found to guarantee the delay-dependent asymptotical stability of these systems. Two examples illustrate the exactness of the proposed criteria.

Robust stability analysis of Takagi—Sugeno uncertain stochastic fuzzy recurrent neural networks with mixed time-varying delays

International Nuclear Information System (INIS)

Ali, M. Syed

2011-01-01

In this paper, the global stability of Takagi—Sugeno (TS) uncertain stochastic fuzzy recurrent neural networks with discrete and distributed time-varying delays (TSUSFRNNs) is considered. A novel LMI-based stability criterion is obtained by using Lyapunov functional theory to guarantee the asymptotic stability of TSUSFRNNs. The proposed stability conditions are demonstrated through numerical examples. Furthermore, the supplementary requirement that the time derivative of time-varying delays must be smaller than one is removed. Comparison results are demonstrated to show that the proposed method is more able to guarantee the widest stability region than the other methods available in the existing literature. (general)

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

Discrete-time rewards model-checked

NARCIS (Netherlands)

Larsen, K.G.; Andova, S.; Niebert, Peter; Hermanns, H.; Katoen, Joost P.

2003-01-01

This paper presents a model-checking approach for analyzing discrete-time Markov reward models. For this purpose, the temporal logic probabilistic CTL is extended with reward constraints. This allows to formulate complex measures – involving expected as well as accumulated rewards – in a precise and

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-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),.

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.

Conditions for extinction events in chemical reaction networks with discrete state spaces.

Science.gov (United States)

Johnston, Matthew D; Anderson, David F; Craciun, Gheorghe; Brijder, Robert

2018-05-01

We study chemical reaction networks with discrete state spaces and present sufficient conditions on the structure of the network that guarantee the system exhibits an extinction event. The conditions we derive involve creating a modified chemical reaction network called a domination-expanded reaction network and then checking properties of this network. Unlike previous results, our analysis allows algorithmic implementation via systems of equalities and inequalities and suggests sequences of reactions which may lead to extinction events. We apply the results to several networks including an EnvZ-OmpR signaling pathway in Escherichia coli.

U.S. Marine Corps Communication-Electronics School Training Process: Discrete-Event Simulation and Lean Options

National Research Council Canada - National Science Library

Neu, Charles R; Davenport, Jon; Smith, William R

2007-01-01

This paper uses discrete-event simulation modeling, inventory-reduction, and process improvement concepts to identify and analyze possibilities for improving the training continuum at the Marine Corps...

Modeling crowd behavior based on the discrete-event multiagent approach

OpenAIRE

Лановой, Алексей Феликсович; Лановой, Артем Алексеевич

2014-01-01

The crowd is a temporary, relatively unorganized group of people, who are in close physical contact with each other. Individual behavior of human outside the crowd is determined by many factors, associated with his intellectual activities, but inside the crowd the man loses his identity and begins to obey more simple laws of behavior.One of approaches to the construction of multi-level model of the crowd using discrete-event multiagent approach was described in the paper.Based on this analysi...

Humans can integrate feedback of discrete events in their sensorimotor control of a robotic hand.

Science.gov (United States)

Cipriani, Christian; Segil, Jacob L; Clemente, Francesco; ff Weir, Richard F; Edin, Benoni

2014-11-01

Providing functionally effective sensory feedback to users of prosthetics is a largely unsolved challenge. Traditional solutions require high band-widths for providing feedback for the control of manipulation and yet have been largely unsuccessful. In this study, we have explored a strategy that relies on temporally discrete sensory feedback that is technically simple to provide. According to the Discrete Event-driven Sensory feedback Control (DESC) policy, motor tasks in humans are organized in phases delimited by means of sensory encoded discrete mechanical events. To explore the applicability of DESC for control, we designed a paradigm in which healthy humans operated an artificial robot hand to lift and replace an instrumented object, a task that can readily be learned and mastered under visual control. Assuming that the central nervous system of humans naturally organizes motor tasks based on a strategy akin to DESC, we delivered short-lasting vibrotactile feedback related to events that are known to forcefully affect progression of the grasp-lift-and-hold task. After training, we determined whether the artificial feedback had been integrated with the sensorimotor control by introducing short delays and we indeed observed that the participants significantly delayed subsequent phases of the task. This study thus gives support to the DESC policy hypothesis. Moreover, it demonstrates that humans can integrate temporally discrete sensory feedback while controlling an artificial hand and invites further studies in which inexpensive, noninvasive technology could be used in clever ways to provide physiologically appropriate sensory feedback in upper limb prosthetics with much lower band-width requirements than with traditional solutions.

Rational solutions of the discrete time Toda lattice and the alternate discrete Painleve II equation

International Nuclear Information System (INIS)

Common, Alan K; Hone, Andrew N W

2008-01-01

The Yablonskii-Vorob'ev polynomials y n (t), which are defined by a second-order bilinear differential-difference equation, provide rational solutions of the Toda lattice. They are also polynomial tau-functions for the rational solutions of the second Painleve equation (P II ). Here we define two-variable polynomials Y n (t, h) on a lattice with spacing h, by considering rational solutions of the discrete time Toda lattice as introduced by Suris. These polynomials are shown to have many properties that are analogous to those of the Yablonskii-Vorob'ev polynomials, to which they reduce when h = 0. They also provide rational solutions for a particular discretization of P II , namely the so-called alternate discrete P II , and this connection leads to an expression in terms of the Umemura polynomials for the third Painleve equation (P III ). It is shown that the Baecklund transformation for the alternate discrete Painleve equation is a symplectic map, and the shift in time is also symplectic. Finally we present a Lax pair for the alternate discrete P II , which recovers Jimbo and Miwa's Lax pair for P II in the continuum limit h → 0

A New Time-varying Concept of Risk in a Changing Climate

Science.gov (United States)

Sarhadi, Ali; Ausín, María Concepción; Wiper, Michael P.

2016-10-01

In a changing climate arising from anthropogenic global warming, the nature of extreme climatic events is changing over time. Existing analytical stationary-based risk methods, however, assume multi-dimensional extreme climate phenomena will not significantly vary over time. To strengthen the reliability of infrastructure designs and the management of water systems in the changing environment, multidimensional stationary risk studies should be replaced with a new adaptive perspective. The results of a comparison indicate that current multi-dimensional stationary risk frameworks are no longer applicable to projecting the changing behaviour of multi-dimensional extreme climate processes. Using static stationary-based multivariate risk methods may lead to undesirable consequences in designing water system infrastructures. The static stationary concept should be replaced with a flexible multi-dimensional time-varying risk framework. The present study introduces a new multi-dimensional time-varying risk concept to be incorporated in updating infrastructure design strategies under changing environments arising from human-induced climate change. The proposed generalized time-varying risk concept can be applied for all stochastic multi-dimensional systems that are under the influence of changing environments.

A New Time-varying Concept of Risk in a Changing Climate.

Science.gov (United States)

Sarhadi, Ali; Ausín, María Concepción; Wiper, Michael P

2016-10-20

In a changing climate arising from anthropogenic global warming, the nature of extreme climatic events is changing over time. Existing analytical stationary-based risk methods, however, assume multi-dimensional extreme climate phenomena will not significantly vary over time. To strengthen the reliability of infrastructure designs and the management of water systems in the changing environment, multidimensional stationary risk studies should be replaced with a new adaptive perspective. The results of a comparison indicate that current multi-dimensional stationary risk frameworks are no longer applicable to projecting the changing behaviour of multi-dimensional extreme climate processes. Using static stationary-based multivariate risk methods may lead to undesirable consequences in designing water system infrastructures. The static stationary concept should be replaced with a flexible multi-dimensional time-varying risk framework. The present study introduces a new multi-dimensional time-varying risk concept to be incorporated in updating infrastructure design strategies under changing environments arising from human-induced climate change. The proposed generalized time-varying risk concept can be applied for all stochastic multi-dimensional systems that are under the influence of changing environments.

Discrete event simulation and the resultant data storage system response in the operational mission environment of Jupiter-Saturn /Voyager/ spacecraft

Science.gov (United States)

Mukhopadhyay, A. K.

1978-01-01

The Data Storage Subsystem Simulator (DSSSIM) simulating (by ground software) occurrence of discrete events in the Voyager mission is described. Functional requirements for Data Storage Subsystems (DSS) simulation are discussed, and discrete event simulation/DSSSIM processing is covered. Four types of outputs associated with a typical DSSSIM run are presented, and DSSSIM limitations and constraints are outlined.

Averaged multivalued solutions and time discretization for conservation laws

International Nuclear Information System (INIS)

Brenier, Y.

1985-01-01

It is noted that the correct shock solutions can be approximated by averaging in some sense the multivalued solution given by the method of characteristics for the nonlinear scalar conservation law (NSCL). A time discretization for the NSCL equation based on this principle is considered. An equivalent analytical formulation is shown to lead quite easily to a convergence result, and a third formulation is introduced which can be generalized for the systems of conservation laws. Various numerical schemes are constructed from the proposed time discretization. The first family of schemes is obtained by using a spatial grid and projecting the results of the time discretization. Many known schemes are then recognized (mainly schemes by Osher, Roe, and LeVeque). A second way to discretize leads to a particle scheme without space grid, which is very efficient (at least in the scalar case). Finally, a close relationship between the proposed method and the Boltzmann type schemes is established. 14 references

Time-Discrete Higher-Order ALE Formulations: Stability

KAUST Repository

Bonito, Andrea

2013-01-01

Arbitrary Lagrangian Eulerian (ALE) formulations deal with PDEs on deformable domains upon extending the domain velocity from the boundary into the bulk with the purpose of keeping mesh regularity. This arbitrary extension has no effect on the stability of the PDE but may influence that of a discrete scheme. We examine this critical issue for higher-order time stepping without space discretization. We propose time-discrete discontinuous Galerkin (dG) numerical schemes of any order for a time-dependent advection-diffusion-model problem in moving domains, and study their stability properties. The analysis hinges on the validity of the Reynold\\'s identity for dG. Exploiting the variational structure and assuming exact integration, we prove that our conservative and nonconservative dG schemes are equivalent and unconditionally stable. The same results remain true for piecewise polynomial ALE maps of any degree and suitable quadrature that guarantees the validity of the Reynold\\'s identity. This approach generalizes the so-called geometric conservation law to higher-order methods. We also prove that simpler Runge-Kutta-Radau methods of any order are conditionally stable, that is, subject to a mild ALE constraint on the time steps. Numerical experiments corroborate and complement our theoretical results. © 2013 Society for Industrial and Applied Mathematics.

Stability Analysis of Continuous-Time and Discrete-Time Quaternion-Valued Neural Networks With Linear Threshold Neurons.

Science.gov (United States)

Chen, Xiaofeng; Song, Qiankun; Li, Zhongshan; Zhao, Zhenjiang; Liu, Yurong

2018-07-01

This paper addresses the problem of stability for continuous-time and discrete-time quaternion-valued neural networks (QVNNs) with linear threshold neurons. Applying the semidiscretization technique to the continuous-time QVNNs, the discrete-time analogs are obtained, which preserve the dynamical characteristics of their continuous-time counterparts. Via the plural decomposition method of quaternion, homeomorphic mapping theorem, as well as Lyapunov theorem, some sufficient conditions on the existence, uniqueness, and global asymptotical stability of the equilibrium point are derived for the continuous-time QVNNs and their discrete-time analogs, respectively. Furthermore, a uniform sufficient condition on the existence, uniqueness, and global asymptotical stability of the equilibrium point is obtained for both continuous-time QVNNs and their discrete-time version. Finally, two numerical examples are provided to substantiate the effectiveness of the proposed results.

Discrete time-crystalline order in black diamond

Science.gov (United States)

Zhou, Hengyun; Choi, Soonwon; Choi, Joonhee; Landig, Renate; Kucsko, Georg; Isoya, Junichi; Jelezko, Fedor; Onoda, Shinobu; Sumiya, Hitoshi; Khemani, Vedika; von Keyserlingk, Curt; Yao, Norman; Demler, Eugene; Lukin, Mikhail D.

2017-04-01

The interplay of periodic driving, disorder, and strong interactions has recently been predicted to result in exotic ``time-crystalline'' phases, which spontaneously break the discrete time-translation symmetry of the underlying drive. Here, we report the experimental observation of such discrete time-crystalline order in a driven, disordered ensemble of 106 dipolar spin impurities in diamond at room-temperature. We observe long-lived temporal correlations at integer multiples of the fundamental driving period, experimentally identify the phase boundary and find that the temporal order is protected by strong interactions; this order is remarkably stable against perturbations, even in the presence of slow thermalization. Our work opens the door to exploring dynamical phases of matter and controlling interacting, disordered many-body systems.

Discrete-Event Simulation with Agents for Modeling of Dynamic Asymmetric Threats in Maritime Security

National Research Council Canada - National Science Library

Ng, Chee W

2007-01-01

.... Discrete-event simulation (DES) was used to simulate a typical port-security, local, waterside-threat response model and to test the adaptive response of asymmetric threats in reaction to port-security procedures, while a multi-agent system (MAS...

Application of process monitoring to anomaly detection in nuclear material processing systems via system-centric event interpretation of data from multiple sensors of varying reliability

International Nuclear Information System (INIS)

Garcia, Humberto E.; Simpson, Michael F.; Lin, Wen-Chiao; Carlson, Reed B.; Yoo, Tae-Sic

2017-01-01

Highlights: • Process monitoring can strengthen nuclear safeguards and material accountancy. • Assessment is conducted at a system-centric level to improve safeguards effectiveness. • Anomaly detection is improved by integrating process and operation relationships. • Decision making is benefited from using sensor and event sequence information. • Formal framework enables optimization of sensor and data processing resources. - Abstract: In this paper, we apply an advanced safeguards approach and associated methods for process monitoring to a hypothetical nuclear material processing system. The assessment regarding the state of the processing facility is conducted at a system-centric level formulated in a hybrid framework. This utilizes architecture for integrating both time- and event-driven data and analysis for decision making. While the time-driven layers of the proposed architecture encompass more traditional process monitoring methods based on time series data and analysis, the event-driven layers encompass operation monitoring methods based on discrete event data and analysis. By integrating process- and operation-related information and methodologies within a unified framework, the task of anomaly detection is greatly improved. This is because decision-making can benefit from not only known time-series relationships among measured signals but also from known event sequence relationships among generated events. This available knowledge at both time series and discrete event layers can then be effectively used to synthesize observation solutions that optimally balance sensor and data processing requirements. The application of the proposed approach is then implemented on an illustrative monitored system based on pyroprocessing and results are discussed.

Pattern formation in individual-based systems with time-varying parameters

Science.gov (United States)

Ashcroft, Peter; Galla, Tobias

2013-12-01

We study the patterns generated in finite-time sweeps across symmetry-breaking bifurcations in individual-based models. Similar to the well-known Kibble-Zurek scenario of defect formation, large-scale patterns are generated when model parameters are varied slowly, whereas fast sweeps produce a large number of small domains. The symmetry breaking is triggered by intrinsic noise, originating from the discrete dynamics at the microlevel. Based on a linear-noise approximation, we calculate the characteristic length scale of these patterns. We demonstrate the applicability of this approach in a simple model of opinion dynamics, a model in evolutionary game theory with a time-dependent fitness structure, and a model of cell differentiation. Our theoretical estimates are confirmed in simulations. In further numerical work, we observe a similar phenomenon when the symmetry-breaking bifurcation is triggered by population growth.

Discrete-event simulation for the design and evaluation of physical protection systems

International Nuclear Information System (INIS)

Jordan, S.E.; Snell, M.K.; Madsen, M.M.; Smith, J.S.; Peters, B.A.

1998-01-01

This paper explores the use of discrete-event simulation for the design and control of physical protection systems for fixed-site facilities housing items of significant value. It begins by discussing several modeling and simulation activities currently performed in designing and analyzing these protection systems and then discusses capabilities that design/analysis tools should have. The remainder of the article then discusses in detail how some of these new capabilities have been implemented in software to achieve a prototype design and analysis tool. The simulation software technology provides a communications mechanism between a running simulation and one or more external programs. In the prototype security analysis tool, these capabilities are used to facilitate human-in-the-loop interaction and to support a real-time connection to a virtual reality (VR) model of the facility being analyzed. This simulation tool can be used for both training (in real-time mode) and facility analysis and design (in fast mode)

Observer-based output feedback control of networked control systems with non-uniform sampling and time-varying delay

Science.gov (United States)

Meng, Su; Chen, Jie; Sun, Jian

2017-10-01

This paper investigates the problem of observer-based output feedback control for networked control systems with non-uniform sampling and time-varying transmission delay. The sampling intervals are assumed to vary within a given interval. The transmission delay belongs to a known interval. A discrete-time model is first established, which contains time-varying delay and norm-bounded uncertainties coming from non-uniform sampling intervals. It is then converted to an interconnection of two subsystems in which the forward channel is delay-free. The scaled small gain theorem is used to derive the stability condition for the closed-loop system. Moreover, the observer-based output feedback controller design method is proposed by utilising a modified cone complementary linearisation algorithm. Finally, numerical examples illustrate the validity and superiority of the proposed method.

A Generic Discrete-Event Simulation Model for Outpatient Clinics in a Large Public Hospital

Directory of Open Access Journals (Sweden)

Waressara Weerawat

2013-01-01

Full Text Available The orthopedic outpatient department (OPD ward in a large Thai public hospital is modeled using Discrete-Event Stochastic (DES simulation. Key Performance Indicators (KPIs are used to measure effects across various clinical operations during different shifts throughout the day. By considering various KPIs such as wait times to see doctors, percentage of patients who can see a doctor within a target time frame, and the time that the last patient completes their doctor consultation, bottlenecks are identified and resource-critical clinics can be prioritized. The simulation model quantifies the chronic, high patient congestion that is prevalent amongst Thai public hospitals with very high patient-to-doctor ratios. Our model can be applied across five different OPD wards by modifying the model parameters. Throughout this work, we show how DES models can be used as decision-support tools for hospital management.

Multiplexing real-time timed events

NARCIS (Netherlands)

Holenderski, M.J.; Cools, W.A.; Bril, R.J.; Lukkien, J.J.

2009-01-01

This paper presents the design and implementation of RELTEQ, a timed event management algorithm based on relative event times, supporting long event interarrival time, long lifetime of the event queue, no drift and low overhead. It is targeted at embedded operating systems. RELTEQ has been conceived

Discrete-Time Filter Synthesis using Product of Gegenbauer Polynomials

OpenAIRE

N. Stojanovic; N. Stamenkovic; I. Krstic

2016-01-01

A new approximation to design continuoustime and discrete-time low-pass filters, presented in this paper, based on the product of Gegenbauer polynomials, provides the ability of more flexible adjustment of passband and stopband responses. The design is achieved taking into account a prescribed specification, leading to a better trade-off among the magnitude and group delay responses. Many well-known continuous-time and discrete-time transitional filter based on the classical polynomial approx...

Extreme events as foundation of Levy walks with varying velocity

International Nuclear Information System (INIS)

Kutner, Ryszard

2002-01-01

In this work we study the role of extreme events [E.W. Montroll, B.J. West, in: J.L. Lebowitz, E.W. Montrell (Eds.), Fluctuation Phenomena, SSM, vol. VII, North-Holland, Amsterdam, 1979, p. 63; J.-P. Bouchaud, M. Potters, Theory of Financial Risks from Statistical Physics to Risk Management, Cambridge University Press, Cambridge, 2001; D. Sornette, Critical Phenomena in Natural Sciences. Chaos, Fractals, Selforganization and Disorder: Concepts and Tools, Springer, Berlin, 2000] in determining the scaling properties of Levy walks with varying velocity. This model is an extension of the well-known Levy walks one [J. Klafter, G. Zumofen, M.F. Shlesinger, in M.F. Shlesinger, G.M. Zaslavsky, U. Frisch (Eds.), Levy Flights and Related Topics ion Physics, Lecture Notes in Physics, vol. 450, Springer, Berlin, 1995, p. 196; G. Zumofen, J. Klafter, M.F. Shlesinger, in: R. Kutner, A. Pekalski, K. Sznajd-Weron (Eds.), Anomalous Diffusion. From Basics to Applications, Lecture Note in Physics, vol. 519, Springer, Berlin, 1999, p. 15] introduced in the context of chaotic dynamics where a fixed value of the walker velocity is assumed for simplicity. Such an extension seems to be necessary when the open and/or complex system is studied. The model of Levy walks with varying velocity is spanned on two coupled velocity-temporal hierarchies: the first one consisting of velocities and the second of corresponding time intervals which the walker spends between the successive turning points. Both these hierarchical structures are characterized by their own self-similar dimensions. The extreme event, which can appear within a given time interval, is defined as a single random step of the walker having largest length. By finding power-laws which describe the time-dependence of this displacement and its statistics we obtained two independent diffusion exponents, which are related to the above-mentioned dimensions and which characterize the extreme event kinetics. In this work we show the

Markov modeling and discrete event simulation in health care: a systematic comparison.

Science.gov (United States)

Standfield, Lachlan; Comans, Tracy; Scuffham, Paul

2014-04-01

The aim of this study was to assess if the use of Markov modeling (MM) or discrete event simulation (DES) for cost-effectiveness analysis (CEA) may alter healthcare resource allocation decisions. A systematic literature search and review of empirical and non-empirical studies comparing MM and DES techniques used in the CEA of healthcare technologies was conducted. Twenty-two pertinent publications were identified. Two publications compared MM and DES models empirically, one presented a conceptual DES and MM, two described a DES consensus guideline, and seventeen drew comparisons between MM and DES through the authors' experience. The primary advantages described for DES over MM were the ability to model queuing for limited resources, capture individual patient histories, accommodate complexity and uncertainty, represent time flexibly, model competing risks, and accommodate multiple events simultaneously. The disadvantages of DES over MM were the potential for model overspecification, increased data requirements, specialized expensive software, and increased model development, validation, and computational time. Where individual patient history is an important driver of future events an individual patient simulation technique like DES may be preferred over MM. Where supply shortages, subsequent queuing, and diversion of patients through other pathways in the healthcare system are likely to be drivers of cost-effectiveness, DES modeling methods may provide decision makers with more accurate information on which to base resource allocation decisions. Where these are not major features of the cost-effectiveness question, MM remains an efficient, easily validated, parsimonious, and accurate method of determining the cost-effectiveness of new healthcare interventions.

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.

Comparative Study of Aircraft Boarding Strategies Using Cellular Discrete Event Simulation

Directory of Open Access Journals (Sweden)

Shafagh Jafer

2017-11-01

Full Text Available Time is crucial in the airlines industry. Among all factors contributing to an aircraft turnaround time; passenger boarding delays is the most challenging one. Airlines do not have control over the behavior of passengers; thus, focusing their effort on reducing passenger boarding time through implementing efficient boarding strategies. In this work, we attempt to use cellular Discrete-Event System Specification (Cell-DEVS modeling and simulation to provide a comprehensive evaluation of aircraft boarding strategies. We have developed a simulation benchmark consisting of eight boarding strategies including Back-to-Front; Window Middle Aisle; Random; Zone Rotate; Reverse Pyramid; Optimal; Optimal Practical; and Efficient. Our simulation models are scalable and adaptive; providing a powerful analysis apparatus for investigating any existing or yet to be discovered boarding strategy. We explain the details of our models and present the results both visually and numerically to evaluate the eight implemented boarding strategies. We also compare our results with other studies that have used different modeling techniques; reporting nearly identical performance results. The simulations revealed that Window Middle Aisle provides the least boarding delay; with a small fraction of time difference compared to the optimal strategy. The results of this work could highly benefit the commercial airlines industry by optimizing and reducing passenger boarding delays.

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.

A SAS-based solution to evaluate study design efficiency of phase I pediatric oncology trials via discrete event simulation.

Science.gov (United States)

Barrett, Jeffrey S; Jayaraman, Bhuvana; Patel, Dimple; Skolnik, Jeffrey M

2008-06-01

Previous exploration of oncology study design efficiency has focused on Markov processes alone (probability-based events) without consideration for time dependencies. Barriers to study completion include time delays associated with patient accrual, inevaluability (IE), time to dose limiting toxicities (DLT) and administrative and review time. Discrete event simulation (DES) can incorporate probability-based assignment of DLT and IE frequency, correlated with cohort in the case of DLT, with time-based events defined by stochastic relationships. A SAS-based solution to examine study efficiency metrics and evaluate design modifications that would improve study efficiency is presented. Virtual patients are simulated with attributes defined from prior distributions of relevant patient characteristics. Study population datasets are read into SAS macros which select patients and enroll them into a study based on the specific design criteria if the study is open to enrollment. Waiting times, arrival times and time to study events are also sampled from prior distributions; post-processing of study simulations is provided within the decision macros and compared across designs in a separate post-processing algorithm. This solution is examined via comparison of the standard 3+3 decision rule relative to the "rolling 6" design, a newly proposed enrollment strategy for the phase I pediatric oncology setting.

The remarkable discreteness of being

Indian Academy of Sciences (India)

Life is a discrete, stochastic phenomenon: for a biological organism, the time of the two most important events of its life (reproduction and death) is random and these events change the number of individuals of the species by single units. These facts can have surprising, counterintuitive consequences. I review here three ...

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)

Discrete-event simulation of nuclear-waste transport in geologic sites subject to disruptive events. Final report

International Nuclear Information System (INIS)

Aggarwal, S.; Ryland, S.; Peck, R.

1980-01-01

This report outlines a methodology to study the effects of disruptive events on nuclear waste material in stable geologic sites. The methodology is based upon developing a discrete events model that can be simulated on the computer. This methodology allows a natural development of simulation models that use computer resources in an efficient manner. Accurate modeling in this area depends in large part upon accurate modeling of ion transport behavior in the storage media. Unfortunately, developments in this area are not at a stage where there is any consensus on proper models for such transport. Consequently, our work is directed primarily towards showing how disruptive events can be properly incorporated in such a model, rather than as a predictive tool at this stage. When and if proper geologic parameters can be determined, then it would be possible to use this as a predictive model. Assumptions and their bases are discussed, and the mathematical and computer model are described

QUALITY THROUGH INTEGRATION OF PRODUCTION AND SHOP FLOOR MANAGEMENT BY DISCRETE EVENT SIMULATION

Directory of Open Access Journals (Sweden)

Zoran Mirović

2007-06-01

Full Text Available With the intention to integrate strategic and tactical decision making and develop the capability of plans and schedules reconfiguration and synchronization in a very short cycle time many firms have proceeded to the adoption of ERP and Advanced Planning and Scheduling (APS technologies. The final goal is a purposeful scheduling system that guide in the right direction the current, high priority needs of the shop floor while remaining consistent with long-term production plans. The difference, and the power, of Discrete-Event Simulation (DES is its ability to mimic dynamic manufacturing systems, consisting of complex structures, and many heterogeneous interacting components. This paper describes such an integrated system (ERP/APS/DES and draw attention to the essential role of simulation based scheduling within it.

Discrete Event Modeling and Simulation-Driven Engineering for the ATLAS Data Acquisition Network

CERN Document Server

Bonaventura, Matias Alejandro; The ATLAS collaboration; Castro, Rodrigo Daniel

2016-01-01

We present an iterative and incremental development methodology for simulation models in network engineering projects. Driven by the DEVS (Discrete Event Systems Specification) formal framework for modeling and simulation we assist network design, test, analysis and optimization processes. A practical application of the methodology is presented for a case study in the ATLAS particle physics detector, the largest scientific experiment built by man where scientists around the globe search for answers about the origins of the universe. The ATLAS data network convey real-time information produced by physics detectors as beams of particles collide. The produced sub-atomic evidences must be filtered and recorded for further offline scrutiny. Due to the criticality of the transported data, networks and applications undergo careful engineering processes with stringent quality of service requirements. A tight project schedule imposes time pressure on design decisions, while rapid technology evolution widens the palett...

Application of discrete event simulation to MRS design

International Nuclear Information System (INIS)

Bali, M.; Standley, W.

1993-01-01

The application of discrete event simulation to the Monitored, Retrievable Storage (MRS) material handling operations supported the MRS conceptual design effort and established a set of tools for use during MRS detail design and license application. The effort to develop a design analysis tool to support the MRS project started in 1991. The MRS simulation has so far identified potential savings and suggested methods of improving operations to enhance throughput. Immediately, simulation aided the MRS conceptual design effort through the investigation of alternative cask handling operations and the sizing and sharing of expensive equipment. The simulation also helped analyze the operability of the current design of MRS under various waste acceptance scenarios. Throughout the simulation effort, the model development and experimentation resulted in early identification and resolution of several design and operational issues

Holographic cinematography of time-varying reflecting and time-varying phase objects using a Nd:YAG laser

Science.gov (United States)

Decker, A. J.

1982-01-01

The use of a Nd:YAG laser to record holographic motion pictures of time-varying reflecting objects and time-varying phase objects is discussed. Sample frames from both types of holographic motion pictures are presented. The holographic system discussed is intended for three-dimensional flow visualization of the time-varying flows that occur in jet-engine components.

Discrete event simulation model of sudden cardiac death predicts high impact of preventive interventions.

Science.gov (United States)

Andreev, Victor P; Head, Trajen; Johnson, Neil; Deo, Sapna K; Daunert, Sylvia; Goldschmidt-Clermont, Pascal J

2013-01-01

Sudden Cardiac Death (SCD) is responsible for at least 180,000 deaths a year and incurs an average cost of $286 billion annually in the United States alone. Herein, we present a novel discrete event simulation model of SCD, which quantifies the chains of events associated with the formation, growth, and rupture of atheroma plaques, and the subsequent formation of clots, thrombosis and on-set of arrhythmias within a population. The predictions generated by the model are in good agreement both with results obtained from pathological examinations on the frequencies of three major types of atheroma, and with epidemiological data on the prevalence and risk of SCD. These model predictions allow for identification of interventions and importantly for the optimal time of intervention leading to high potential impact on SCD risk reduction (up to 8-fold reduction in the number of SCDs in the population) as well as the increase in life expectancy.

Long-time behaviour of discretizations of the simple pendulum equation

Energy Technology Data Exchange (ETDEWEB)

Cieslinski, Jan L [Uniwersytet w Bialymstoku, Wydzial Fizyki, ul. Lipowa 41, 15-424 Bialystok (Poland); Ratkiewicz, Boguslaw [Doctoral Studies, Wydzial Fizyki, Uniwersytet Adama Mickiewicza, Poznan (Poland)], E-mail: janek@alpha.uwb.edu.pl, E-mail: bograt@poczta.onet.pl

2009-03-13

We compare several discretizations of the simple pendulum equation in a series of numerical experiments. The stress is put on the long-time behaviour. The chosen numerical schemes are either symplectic maps or integrable (energy-preserving) maps, or both. Therefore, they preserve qualitative features of solutions (such as periodicity). We describe characteristic periodic time dependences of numerical estimates of the period and the amplitude, and explain them as systematic numerical by-effects produced by any method. Finally, we propose a new numerical scheme which is a modification of the discrete gradient method. This modified discrete gradient method preserves (almost exactly) the period of small oscillations for any time step.

Long-time behaviour of discretizations of the simple pendulum equation

International Nuclear Information System (INIS)

Cieslinski, Jan L; Ratkiewicz, Boguslaw

2009-01-01

We compare several discretizations of the simple pendulum equation in a series of numerical experiments. The stress is put on the long-time behaviour. The chosen numerical schemes are either symplectic maps or integrable (energy-preserving) maps, or both. Therefore, they preserve qualitative features of solutions (such as periodicity). We describe characteristic periodic time dependences of numerical estimates of the period and the amplitude, and explain them as systematic numerical by-effects produced by any method. Finally, we propose a new numerical scheme which is a modification of the discrete gradient method. This modified discrete gradient method preserves (almost exactly) the period of small oscillations for any time step

On the application of Discrete Time Optimal Control Concepts to ...

African Journals Online (AJOL)

On the application of Discrete Time Optimal Control Concepts to Economic Problems. ... Journal of the Nigerian Association of Mathematical Physics ... Abstract. An extension of the use of the maximum principle to solve Discrete-time Optimal Control Problems (DTOCP), in which the state equations are in the form of general ...

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.

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.

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)

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.

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

Advances in Discrete-Event Simulation for MSL Command Validation

Science.gov (United States)

Patrikalakis, Alexander; O'Reilly, Taifun

2013-01-01

In the last five years, the discrete event simulator, SEQuence GENerator (SEQGEN), developed at the Jet Propulsion Laboratory to plan deep-space missions, has greatly increased uplink operations capacity to deal with increasingly complicated missions. In this paper, we describe how the Mars Science Laboratory (MSL) project makes full use of an interpreted environment to simulate change in more than fifty thousand flight software parameters and conditional command sequences to predict the result of executing a conditional branch in a command sequence, and enable the ability to warn users whenever one or more simulated spacecraft states change in an unexpected manner. Using these new SEQGEN features, operators plan more activities in one sol than ever before.

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)

A Discrete-Event Simulation Model for Evaluating Air Force Reusable Military Launch Vehicle Post-Landing Operations

National Research Council Canada - National Science Library

Martindale, Michael

2006-01-01

The purpose of this research was to develop a discrete-event computer simulation model of the post-landing vehicle recoveoperations to allow the Air Force Research Laboratory, Air Vehicles Directorate...

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.

Discrete-Time Filter Synthesis using Product of Gegenbauer Polynomials

Directory of Open Access Journals (Sweden)

N. Stojanovic

2016-09-01

Full Text Available A new approximation to design continuoustime and discrete-time low-pass filters, presented in this paper, based on the product of Gegenbauer polynomials, provides the ability of more flexible adjustment of passband and stopband responses. The design is achieved taking into account a prescribed specification, leading to a better trade-off among the magnitude and group delay responses. Many well-known continuous-time and discrete-time transitional filter based on the classical polynomial approximations(Chebyshev, Legendre, Butterworth are shown to be a special cases of proposed approximation method.

Discrete event simulation in an artificial intelligence environment: Some examples

International Nuclear Information System (INIS)

Roberts, D.J.; Farish, T.

1991-01-01

Several Los Alamos National Laboratory (LANL) object-oriented discrete-event simulation efforts have been completed during the past three years. One of these systems has been put into production and has a growing customer base. Another (started two years earlier than the first project) was completed but has not yet been used. This paper will describe these simulation projects. Factors which were pertinent to the success of the one project, and to the failure of the second project will be discussed (success will be measured as the extent to which the simulation model was used as originally intended). 5 figs

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.

Neutron fluctuations in a medium randomly varying in time

International Nuclear Information System (INIS)

Lenard, Pal; Imre, Pazsit

2005-01-01

The master equation approach, which has traditionally been used for the calculation of neutron fluctuations in zero power systems with constant parameters, is extended to a case when the parameters of the system change randomly in time. We consider a forward type master equation for the probability distribution of the number of particles in a multiplying system whose properties jump randomly between two discrete states, both with and without an external source. The first two factorial moments are calculated, including the covariance. This model can be considered the unification of stochastic methods that were used either in a constant multiplying medium via the master equation technique, or in a fluctuating medium via the Langevin technique. In contrast to these methods, the one presented here can calculate the inherent noise in time-varying systems. The results obtained show a much richer characteristics of the zero power noise than that in constant systems. Even the concept of criticality has to be given a probabilistic interpretation. The asymptotic behaviour of the variance will be also qualitatively different from that in constant systems. The covariance of the neutron number in a subcritical system with a source, and the corresponding power spectrum, shows both the inherent and parametrically induced noise components. The results are relevant in medium power subcritical systems where the zero power noise is still significant, but they also have a bearing on all types of branching processes, such as evolution of biological systems, spreading of epidemics etc., which are set in a time-varying environment. (authors)

Neutron fluctuations in a medium randomly varying in time

Energy Technology Data Exchange (ETDEWEB)

Lenard, Pal [KFKI Atomic Energy Research Institute, Budapest (Hungary); Imre, Pazsit [Chalmers Univ. of Technology, Dept. of Nuclear Engineering, SE, Goteborg (Sweden)

2005-07-01

The master equation approach, which has traditionally been used for the calculation of neutron fluctuations in zero power systems with constant parameters, is extended to a case when the parameters of the system change randomly in time. We consider a forward type master equation for the probability distribution of the number of particles in a multiplying system whose properties jump randomly between two discrete states, both with and without an external source. The first two factorial moments are calculated, including the covariance. This model can be considered the unification of stochastic methods that were used either in a constant multiplying medium via the master equation technique, or in a fluctuating medium via the Langevin technique. In contrast to these methods, the one presented here can calculate the inherent noise in time-varying systems. The results obtained show a much richer characteristics of the zero power noise than that in constant systems. Even the concept of criticality has to be given a probabilistic interpretation. The asymptotic behaviour of the variance will be also qualitatively different from that in constant systems. The covariance of the neutron number in a subcritical system with a source, and the corresponding power spectrum, shows both the inherent and parametrically induced noise components. The results are relevant in medium power subcritical systems where the zero power noise is still significant, but they also have a bearing on all types of branching processes, such as evolution of biological systems, spreading of epidemics etc., which are set in a time-varying environment. (authors)

Can time be a discrete dynamical variable

International Nuclear Information System (INIS)

Lee, T.D.

1983-01-01

The possibility that time can be regarded as a discrete dynamical variable is examined through all phases of mechanics: from classical mechanics to nonrelativistic quantum mechanics, and to relativistic quantum field theories. (orig.)

Parisian ruin for the dual risk process in discrete-time

OpenAIRE

Palmowski, Zbigniew; Ramsden, Lewis; Papaioannou, Apostolos D.

2017-01-01

In this paper we consider the Parisian ruin probabilities for the dual risk model in a discrete-time setting. By exploiting the strong Markov property of the risk process we derive a recursive expression for the fnite-time Parisian ruin probability, in terms of classic discrete-time dual ruin probabilities. Moreover, we obtain an explicit expression for the corresponding infnite-time Parisian ruin probability as a limiting case. In order to obtain more analytic results, we employ a conditioni...

The effect of medical trainees on pediatric emergency department flow: a discrete event simulation modeling study.

Science.gov (United States)

Genuis, Emerson D; Doan, Quynh

2013-11-01

Providing patient care and medical education are both important missions of teaching hospital emergency departments (EDs). With medical school enrollment rising, and ED crowding becoming an increasing prevalent issue, it is important for both pediatric EDs (PEDs) and general EDs to find a balance between these two potentially competing goals. The objective was to determine how the number of trainees in a PED affects patient wait time, total ED length of stay (LOS), and rates of patients leaving without being seen (LWBS) for PED patients overall and stratified by acuity level as defined by the Pediatric Canadian Triage and Acuity Scale (CTAS) using discrete event simulation (DES) modeling. A DES model of an urban tertiary care PED, which receives approximately 40,000 visits annually, was created and validated. Thirteen different trainee schedules, which ranged from averaging zero to six trainees per shift, were input into the DES model and the outcome measures were determined using the combined output of five model iterations. An increase in LOS of approximately 7 minutes was noted to be associated with each additional trainee per attending emergency physician working in the PED. The relationship between the number of trainees and wait time varied with patients' level of acuity and with the degree of PED utilization. Patient wait time decreased as the number of trainees increased for low-acuity visits and when the PED was not operating at full capacity. With rising numbers of trainees, the PED LWBS rate decreased in the whole department and in the CTAS 4 and 5 patient groups, but it rose in patients triaged CTAS 3 or higher. A rising numbers of trainees was not associated with any change to flow outcomes for CTAS 1 patients. The results of this study demonstrate that trainees in PEDs have an impact mainly on patient LOS and that the effect on wait time differs between patients presenting with varying degrees of acuity. These findings will assist PEDs in finding a

Soundness of Timed-Arc Workflow Nets in Discrete and Continuous-Time Semantics

DEFF Research Database (Denmark)

Mateo, Jose Antonio; Srba, Jiri; Sørensen, Mathias Grund

2015-01-01

Analysis of workflow processes with quantitative aspectslike timing is of interest in numerous time-critical applications. We suggest a workflow model based on timed-arc Petri nets and studythe foundational problems of soundness and strong (time-bounded) soundness.We first consider the discrete-t...

Analysis of manufacturing based on object oriented discrete event simulation

Directory of Open Access Journals (Sweden)

Eirik Borgen

1990-01-01

Full Text Available This paper describes SIMMEK, a computer-based tool for performing analysis of manufacturing systems, developed at the Production Engineering Laboratory, NTH-SINTEF. Its main use will be in analysis of job shop type of manufacturing. But certain facilities make it suitable for FMS as well as a production line manufacturing. This type of simulation is very useful in analysis of any types of changes that occur in a manufacturing system. These changes may be investments in new machines or equipment, a change in layout, a change in product mix, use of late shifts, etc. The effects these changes have on for instance the throughput, the amount of VIP, the costs or the net profit, can be analysed. And this can be done before the changes are made, and without disturbing the real system. Simulation takes into consideration, unlike other tools for analysis of manufacturing systems, uncertainty in arrival rates, process and operation times, and machine availability. It also shows the interaction effects a job which is late in one machine, has on the remaining machines in its route through the layout. It is these effects that cause every production plan not to be fulfilled completely. SIMMEK is based on discrete event simulation, and the modeling environment is object oriented. The object oriented models are transformed by an object linker into data structures executable by the simulation kernel. The processes of the entity objects, i.e. the products, are broken down to events and put into an event list. The user friendly graphical modeling environment makes it possible for end users to build models in a quick and reliable way, using terms from manufacturing. Various tests and a check of model logic are helpful functions when testing validity of the models. Integration with software packages, with business graphics and statistical functions, is convenient in the result presentation phase.

Discrete time analysis of a repairable machine

OpenAIRE

Alfa, Attahiru Sule; Castro, I. T.

2002-01-01

We consider, in discrete time, a single machine system that operates for a period of time represented by a general distribution. This machine is subject to failures during operations and the occurrence of these failures depends on how many times the machine has previously failed. Some failures are repairable and the repair times may or may not depend on the number of times the machine was previously repaired. Repair times also have a general distribution. The operating times...

The Scalp Time-Varying Networks of N170: Reference, Latency, and Information Flow

Directory of Open Access Journals (Sweden)

Yin Tian

2018-04-01

Full Text Available Using the scalp time-varying network method, the present study is the first to investigate the temporal influence of the reference on N170, a negative event-related potential component (ERP appeared about 170 ms that is elicited by facial recognition, in the network levels. Two kinds of scalp electroencephalogram (EEG references, namely, AR (average of all recording channels and reference electrode standardization technique (REST, were comparatively investigated via the time-varying processing of N170. Results showed that the latency and amplitude of N170 were significantly different between REST and AR, with the former being earlier and smaller. In particular, the information flow from right temporal-parietal P8 to left P7 in the time-varying network was earlier in REST than that in AR, and this phenomenon was reproduced by simulation, in which the performance of REST was closer to the true case at source level. These findings indicate that reference plays a crucial role in ERP data interpretation, and importantly, the newly developed approximate zero-reference REST would be a superior choice for precise evaluation of the scalp spatio-temporal changes relating to various cognitive events.

Time-delay analyzer with continuous discretization

International Nuclear Information System (INIS)

Bayatyan, G.L.; Darbinyan, K.T.; Mkrtchyan, K.K.; Stepanyan, S.S.

1988-01-01

A time-delay analyzer is described which when triggered by a start pulse of adjustable duration performs continuous discretization of the analyzed signal within nearly 22 ns time intervals, the recording in a memory unit with following slow read-out of the information to the computer and its processing. The time-delay analyzer consists of four CAMAC-VECTOR systems of unit width. With its help one can separate comparatively short, small-amplitude rare signals against the background of quasistationary noise processes. 4 refs.; 3 figs

Observer-based adaptive control of chaos in nonlinear discrete-time systems using time-delayed state feedback

International Nuclear Information System (INIS)

Goharrizi, Amin Yazdanpanah; Khaki-Sedigh, Ali; Sepehri, Nariman

2009-01-01

A new approach to adaptive control of chaos in a class of nonlinear discrete-time-varying systems, using a delayed state feedback scheme, is presented. It is discussed that such systems can show chaotic behavior as their parameters change. A strategy is employed for on-line calculation of the Lyapunov exponents that will be used within an adaptive scheme that decides on the control effort to suppress the chaotic behavior once detected. The scheme is further augmented with a nonlinear observer for estimation of the states that are required by the controller but are hard to measure. Simulation results for chaotic control problem of Jin map are provided to show the effectiveness of the proposed scheme.

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...

Time-aggregation effects on the baseline of continuous-time and discrete-time hazard models

NARCIS (Netherlands)

ter Hofstede, F.; Wedel, M.

In this study we reinvestigate the effect of time-aggregation for discrete- and continuous-time hazard models. We reanalyze the results of a previous Monte Carlo study by ter Hofstede and Wedel (1998), in which the effects of time-aggregation on the parameter estimates of hazard models were

Comparative Effectiveness of Tacrolimus-Based Steroid Sparing versus Steroid Maintenance Regimens in Kidney Transplantation: Results from Discrete Event Simulation.

Science.gov (United States)

Desai, Vibha C A; Ferrand, Yann; Cavanaugh, Teresa M; Kelton, Christina M L; Caro, J Jaime; Goebel, Jens; Heaton, Pamela C

2017-10-01

Corticosteroids used as immunosuppressants to prevent acute rejection (AR) and graft loss (GL) following kidney transplantation are associated with serious cardiovascular and other adverse events. Evidence from short-term randomized controlled trials suggests that many patients on a tacrolimus-based immunosuppressant regimen can withdraw from steroids without increased AR or GL risk. To measure the long-term tradeoff between GL and adverse events for a heterogeneous-risk population and determine the optimal timing of steroid withdrawal. A discrete event simulation was developed including, as events, AR, GL, myocardial infarction (MI), stroke, cytomegalovirus, and new onset diabetes mellitus (NODM), among others. Data from the United States Renal Data System were used to estimate event-specific parametric regressions, which accounted for steroid-sparing regimen (avoidance, early 7-d withdrawal, 6-mo withdrawal, 12-mo withdrawal, and maintenance) as well as patients' demographics, immunologic risks, and comorbidities. Regression-equation results were used to derive individual time-to-event Weibull distributions, used, in turn, to simulate the course of patients over 20 y. Patients on steroid avoidance or an early-withdrawal regimen were more likely to experience AR (45.9% to 55.0% v. 33.6%, P events and other outcomes with no worsening of AR or GL rates compared with steroid maintenance.

Performance of discrete heat engines and heat pumps in finite time

Science.gov (United States)

Feldmann; Kosloff

2000-05-01

The performance in finite time of a discrete heat engine with internal friction is analyzed. The working fluid of the engine is composed of an ensemble of noninteracting two level systems. External work is applied by changing the external field and thus the internal energy levels. The friction induces a minimal cycle time. The power output of the engine is optimized with respect to time allocation between the contact time with the hot and cold baths as well as the adiabats. The engine's performance is also optimized with respect to the external fields. By reversing the cycle of operation a heat pump is constructed. The performance of the engine as a heat pump is also optimized. By varying the time allocation between the adiabats and the contact time with the reservoir a universal behavior can be identified. The optimal performance of the engine when the cold bath is approaching absolute zero is studied. It is found that the optimal cooling rate converges linearly to zero when the temperature approaches absolute zero.

Exponential stability of continuous-time and discrete-time bidirectional associative memory networks with delays

International Nuclear Information System (INIS)

Liang Jinling; Cao Jinde

2004-01-01

First, convergence of continuous-time Bidirectional Associative Memory (BAM) neural networks are studied. By using Lyapunov functionals and some analysis technique, the delay-independent sufficient conditions are obtained for the networks to converge exponentially toward the equilibrium associated with the constant input sources. Second, discrete-time analogues of the continuous-time BAM networks are formulated and studied. It is shown that the convergence characteristics of the continuous-time systems are preserved by the discrete-time analogues without any restriction imposed on the uniform discretionary step size. An illustrative example is given to demonstrate the effectiveness of the obtained results

Stability analysis for discrete-time stochastic memristive neural networks with both leakage and probabilistic delays.

Science.gov (United States)

Liu, Hongjian; Wang, Zidong; Shen, Bo; Huang, Tingwen; Alsaadi, Fuad E

2018-06-01

This paper is concerned with the globally exponential stability problem for a class of discrete-time stochastic memristive neural networks (DSMNNs) with both leakage delays as well as probabilistic time-varying delays. For the probabilistic delays, a sequence of Bernoulli distributed random variables is utilized to determine within which intervals the time-varying delays fall at certain time instant. The sector-bounded activation function is considered in the addressed DSMNN. By taking into account the state-dependent characteristics of the network parameters and choosing an appropriate Lyapunov-Krasovskii functional, some sufficient conditions are established under which the underlying DSMNN is globally exponentially stable in the mean square. The derived conditions are made dependent on both the leakage and the probabilistic delays, and are therefore less conservative than the traditional delay-independent criteria. A simulation example is given to show the effectiveness of the proposed stability criterion. Copyright © 2018 Elsevier Ltd. All rights reserved.

Extreme events as foundation of Lévy walks with varying velocity

Science.gov (United States)

Kutner, Ryszard

2002-11-01

In this work we study the role of extreme events [E.W. Montroll, B.J. West, in: J.L. Lebowitz, E.W. Montrell (Eds.), Fluctuation Phenomena, SSM, vol. VII, North-Holland, Amsterdam, 1979, p. 63; J.-P. Bouchaud, M. Potters, Theory of Financial Risks from Statistical Physics to Risk Management, Cambridge University Press, Cambridge, 2001; D. Sornette, Critical Phenomena in Natural Sciences. Chaos, Fractals, Selforganization and Disorder: Concepts and Tools, Springer, Berlin, 2000] in determining the scaling properties of Lévy walks with varying velocity. This model is an extension of the well-known Lévy walks one [J. Klafter, G. Zumofen, M.F. Shlesinger, in M.F. Shlesinger, G.M. Zaslavsky, U. Frisch (Eds.), Lévy Flights and Related Topics ion Physics, Lecture Notes in Physics, vol. 450, Springer, Berlin, 1995, p. 196; G. Zumofen, J. Klafter, M.F. Shlesinger, in: R. Kutner, A. Pȩkalski, K. Sznajd-Weron (Eds.), Anomalous Diffusion. From Basics to Applications, Lecture Note in Physics, vol. 519, Springer, Berlin, 1999, p. 15] introduced in the context of chaotic dynamics where a fixed value of the walker velocity is assumed for simplicity. Such an extension seems to be necessary when the open and/or complex system is studied. The model of Lévy walks with varying velocity is spanned on two coupled velocity-temporal hierarchies: the first one consisting of velocities and the second of corresponding time intervals which the walker spends between the successive turning points. Both these hierarchical structures are characterized by their own self-similar dimensions. The extreme event, which can appear within a given time interval, is defined as a single random step of the walker having largest length. By finding power-laws which describe the time-dependence of this displacement and its statistics we obtained two independent diffusion exponents, which are related to the above-mentioned dimensions and which characterize the extreme event kinetics. In this work we show the

Nonlinear systems time-varying parameter estimation: Application to induction motors

Energy Technology Data Exchange (ETDEWEB)

Kenne, Godpromesse [Laboratoire d' Automatique et d' Informatique Appliquee (LAIA), Departement de Genie Electrique, IUT FOTSO Victor, Universite de Dschang, B.P. 134 Bandjoun (Cameroon); Ahmed-Ali, Tarek [Ecole Nationale Superieure des Ingenieurs des Etudes et Techniques d' Armement (ENSIETA), 2 Rue Francois Verny, 29806 Brest Cedex 9 (France); Lamnabhi-Lagarrigue, F. [Laboratoire des Signaux et Systemes (L2S), C.N.R.S-SUPELEC, Universite Paris XI, 3 Rue Joliot Curie, 91192 Gif-sur-Yvette (France); Arzande, Amir [Departement Energie, Ecole Superieure d' Electricite-SUPELEC, 3 Rue Joliot Curie, 91192 Gif-sur-Yvette (France)

2008-11-15

In this paper, an algorithm for time-varying parameter estimation for a large class of nonlinear systems is presented. The proof of the convergence of the estimates to their true values is achieved using Lyapunov theories and does not require that the classical persistent excitation condition be satisfied by the input signal. Since the induction motor (IM) is widely used in several industrial sectors, the algorithm developed is potentially useful for adjusting the controller parameters of variable speed drives. The method proposed is simple and easily implementable in real-time. The application of this approach to on-line estimation of the rotor resistance of IM shows a rapidly converging estimate in spite of measurement noise, discretization effects, parameter uncertainties (e.g. inaccuracies on motor inductance values) and modeling inaccuracies. The robustness analysis for this IM application also revealed that the proposed scheme is insensitive to the stator resistance variations within a wide range. The merits of the proposed algorithm in the case of on-line time-varying rotor resistance estimation are demonstrated via experimental results in various operating conditions of the induction motor. The experimental results obtained demonstrate that the application of the proposed algorithm to update on-line the parameters of an adaptive controller (e.g. IM and synchronous machines adaptive control) can improve the efficiency of the industrial process. The other interesting features of the proposed method include fault detection/estimation and adaptive control of IM and synchronous machines. (author)

Coordination Frictions and Job Heterogeneity: A Discrete Time Analysis

DEFF Research Database (Denmark)

Kennes, John; Le Maire, Christian Daniel

This paper develops and extends a dynamic, discrete time, job to worker matching model in which jobs are heterogeneous in equilibrium. The key assumptions of this economic environment are (i) matching is directed and (ii) coordination frictions lead to heterogeneous local labor markets. We de- rive...... a number of new theoretical results, which are essential for the empirical application of this type of model to matched employer-employee microdata. First, we o¤er a robust equilibrium concept in which there is a continu- ous dispersion of job productivities and wages. Second, we show that our model can...... of these results preserve the essential tractability of the baseline model with aggregate shocks. Therefore, we o¤er a parsimonious, general equilibrium framework in which to study the process by which the contin- uous dispersion of wages and productivities varies over the business cycle for a large population...

New Delay-Dependent Stability Criteria for Uncertain Neutral Systems with Mixed Time-Varying Delays and Nonlinear Perturbations

Directory of Open Access Journals (Sweden)

Hamid Reza Karimi

2009-01-01

Full Text Available The problem of stability analysis for a class of neutral systems with mixed time-varying neutral, discrete and distributed delays and nonlinear parameter perturbations is addressed. By introducing a novel Lyapunov-Krasovskii functional and combining the descriptor model transformation, the Leibniz-Newton formula, some free-weighting matrices, and a suitable change of variables, new sufficient conditions are established for the stability of the considered system, which are neutral-delay-dependent, discrete-delay-range-dependent, and distributed-delay-dependent. The conditions are presented in terms of linear matrix inequalities (LMIs and can be efficiently solved using convex programming techniques. Two numerical examples are given to illustrate the efficiency of the proposed method.

Using simulation to interpret a discrete time survival model in a complex biological system: fertility and lameness in dairy cows.

Directory of Open Access Journals (Sweden)

Christopher D Hudson

Full Text Available The ever-growing volume of data routinely collected and stored in everyday life presents researchers with a number of opportunities to gain insight and make predictions. This study aimed to demonstrate the usefulness in a specific clinical context of a simulation-based technique called probabilistic sensitivity analysis (PSA in interpreting the results of a discrete time survival model based on a large dataset of routinely collected dairy herd management data. Data from 12,515 dairy cows (from 39 herds were used to construct a multilevel discrete time survival model in which the outcome was the probability of a cow becoming pregnant during a given two day period of risk, and presence or absence of a recorded lameness event during various time frames relative to the risk period amongst the potential explanatory variables. A separate simulation model was then constructed to evaluate the wider clinical implications of the model results (i.e. the potential for a herd's incidence rate of lameness to influence its overall reproductive performance using PSA. Although the discrete time survival analysis revealed some relatively large associations between lameness events and risk of pregnancy (for example, occurrence of a lameness case within 14 days of a risk period was associated with a 25% reduction in the risk of the cow becoming pregnant during that risk period, PSA revealed that, when viewed in the context of a realistic clinical situation, a herd's lameness incidence rate is highly unlikely to influence its overall reproductive performance to a meaningful extent in the vast majority of situations. Construction of a simulation model within a PSA framework proved to be a very useful additional step to aid contextualisation of the results from a discrete time survival model, especially where the research is designed to guide on-farm management decisions at population (i.e. herd rather than individual level.

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

A theory of Markovian time-inconsistent stochastic control in discrete time

DEFF Research Database (Denmark)

Bjork, Tomas; Murgoci, Agatha

2014-01-01

We develop a theory for a general class of discrete-time stochastic control problems that, in various ways, are time-inconsistent in the sense that they do not admit a Bellman optimality principle. We attack these problems by viewing them within a game theoretic framework, and we look for subgame...

Random vs. Combinatorial Methods for Discrete Event Simulation of a Grid Computer Network

Science.gov (United States)

Kuhn, D. Richard; Kacker, Raghu; Lei, Yu

2010-01-01

This study compared random and t-way combinatorial inputs of a network simulator, to determine if these two approaches produce significantly different deadlock detection for varying network configurations. Modeling deadlock detection is important for analyzing configuration changes that could inadvertently degrade network operations, or to determine modifications that could be made by attackers to deliberately induce deadlock. Discrete event simulation of a network may be conducted using random generation, of inputs. In this study, we compare random with combinatorial generation of inputs. Combinatorial (or t-way) testing requires every combination of any t parameter values to be covered by at least one test. Combinatorial methods can be highly effective because empirical data suggest that nearly all failures involve the interaction of a small number of parameters (1 to 6). Thus, for example, if all deadlocks involve at most 5-way interactions between n parameters, then exhaustive testing of all n-way interactions adds no additional information that would not be obtained by testing all 5-way interactions. While the maximum degree of interaction between parameters involved in the deadlocks clearly cannot be known in advance, covering all t-way interactions may be more efficient than using random generation of inputs. In this study we tested this hypothesis for t = 2, 3, and 4 for deadlock detection in a network simulation. Achieving the same degree of coverage provided by 4-way tests would have required approximately 3.2 times as many random tests; thus combinatorial methods were more efficient for detecting deadlocks involving a higher degree of interactions. The paper reviews explanations for these results and implications for modeling and simulation.

On the mixed discretization of the time domain magnetic field integral equation

KAUST Repository

Ulku, Huseyin Arda

2012-09-01

Time domain magnetic field integral equation (MFIE) is discretized using divergence-conforming Rao-Wilton-Glisson (RWG) and curl-conforming Buffa-Christiansen (BC) functions as spatial basis and testing functions, respectively. The resulting mixed discretization scheme, unlike the classical scheme which uses RWG functions as both basis and testing functions, is proper: Testing functions belong to dual space of the basis functions. Numerical results demonstrate that the marching on-in-time (MOT) solution of the mixed discretized MFIE yields more accurate results than that of classically discretized MFIE. © 2012 IEEE.

Flow time analysis of load management late arrival discrete time queueing system with dual service rate using hypo geometrical distribution

International Nuclear Information System (INIS)

Shah, S.A.; Shah, W.; Shaikh, F.K.

2012-01-01

Flow time analysis is a powerful concept to analyze the flow time of any arriving customer in any system at any instant. A load management mechanism can be employed very effectively in any queueing system by utilizing a system which provides probability of dual service rate. In this paper, we develop and demonstrate the flow and service processes transition diagram to determine the flow time of a customer in a load management late arrival state dependent finite discrete time queueing system with dual service rate where customers are hypo geometrically distributed. We compute the probability mass function of each starting state and total probability mass function. The obtained analytical results are validated with simulation results for varying values of arrival and service probabilities. (author)

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

Discrete and continuous time dynamic mean-variance analysis

OpenAIRE

Reiss, Ariane

1999-01-01

Contrary to static mean-variance analysis, very few papers have dealt with dynamic mean-variance analysis. Here, the mean-variance efficient self-financing portfolio strategy is derived for n risky assets in discrete and continuous time. In the discrete setting, the resulting portfolio is mean-variance efficient in a dynamic sense. It is shown that the optimal strategy for n risky assets may be dominated if the expected terminal wealth is constrained to exactly attain a certain goal instead o...

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.

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....

Reliable Decentralized Control of Fuzzy Discrete-Event Systems and a Test Algorithm.

Science.gov (United States)

Liu, Fuchun; Dziong, Zbigniew

2013-02-01

A framework for decentralized control of fuzzy discrete-event systems (FDESs) has been recently presented to guarantee the achievement of a given specification under the joint control of all local fuzzy supervisors. As a continuation, this paper addresses the reliable decentralized control of FDESs in face of possible failures of some local fuzzy supervisors. Roughly speaking, for an FDES equipped with n local fuzzy supervisors, a decentralized supervisor is called k-reliable (1 ≤ k ≤ n) provided that the control performance will not be degraded even when n - k local fuzzy supervisors fail. A necessary and sufficient condition for the existence of k-reliable decentralized supervisors of FDESs is proposed by introducing the notions of M̃uc-controllability and k-reliable coobservability of fuzzy language. In particular, a polynomial-time algorithm to test the k-reliable coobservability is developed by a constructive methodology, which indicates that the existence of k-reliable decentralized supervisors of FDESs can be checked with a polynomial complexity.

Parameter Estimation of a Closed Loop Coupled Tank Time Varying System using Recursive Methods

International Nuclear Information System (INIS)

Basir, Siti Nora; Yussof, Hanafiah; Shamsuddin, Syamimi; Selamat, Hazlina; Zahari, Nur Ismarrubie

2013-01-01

This project investigates the direct identification of closed loop plant using discrete-time approach. The uses of Recursive Least Squares (RLS), Recursive Instrumental Variable (RIV) and Recursive Instrumental Variable with Centre-Of-Triangle (RIV + COT) in the parameter estimation of closed loop time varying system have been considered. The algorithms were applied in a coupled tank system that employs covariance resetting technique where the time of parameter changes occur is unknown. The performances of all the parameter estimation methods, RLS, RIV and RIV + COT were compared. The estimation of the system whose output was corrupted with white and coloured noises were investigated. Covariance resetting technique successfully executed when the parameters change. RIV + COT gives better estimates than RLS and RIV in terms of convergence and maximum overshoot

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.

Rainfall timing and runoff: The influence of the criterion for rain event separation

OpenAIRE

Molina-Sanchis, Isabel; Lázaro, Roberto; Arnau-Rosalén, Eva; Calvo-Cases, Adolfo

2016-01-01

Rain is not uniform in time and space in semiarid areas and its distribution is very important for the runoff process. Hydrological studies usually divide rainfall into events. However, defining rain events is complicated, and rain characteristics vary depending on how the events are delimited. Choosing a minimum inter-event time (MIT) is a commonly used criterion. Our hypothesis is that there will be an optimal MIT that explains the maximum part of the variance of the runoff, with time to ru...

Zhang neural network for online solution of time-varying convex quadratic program subject to time-varying linear-equality constraints

International Nuclear Information System (INIS)

Zhang Yunong; Li Zhan

2009-01-01

In this Letter, by following Zhang et al.'s method, a recurrent neural network (termed as Zhang neural network, ZNN) is developed and analyzed for solving online the time-varying convex quadratic-programming problem subject to time-varying linear-equality constraints. Different from conventional gradient-based neural networks (GNN), such a ZNN model makes full use of the time-derivative information of time-varying coefficient. The resultant ZNN model is theoretically proved to have global exponential convergence to the time-varying theoretical optimal solution of the investigated time-varying convex quadratic program. Computer-simulation results further substantiate the effectiveness, efficiency and novelty of such ZNN model and method.

Evolutionary paths, applications and future development of discrete event simulation systems; Simulazione a eventi discreti: nuove linee di sviluppo e applicazioni

Energy Technology Data Exchange (ETDEWEB)

Garetti, M. [Milan Politecnico, Milan (Italy). Dipt. di Economia e Produzione; Bartolotta, A.

2000-10-01

The state of the art of discrete event simulation tools is presented with special reference to the application to the manufacturing systems area. After presenting the basics of discrete event computer simulation, the different steps to be followed for the successful use of simulation are defined and discussed. The evolution of software packages for discrete event simulation is also presented, highlighting main technological changes. Finally the future development lines of simulation are outlined. [Italian] Viene presentato lo stato dell'arte della simulazione a eventi discreti. Dopo una breve descrizione della tecnica della simulazione e della sua evoluzione, con un particolare riguardo alla simulazione dei sistemi produttivi, sono descritte le fasi della procedura da seguire per condurre unostudio di simulazione e i possibili approcci per la costruzione del modello. Viene infine descritta l'evoluzione dei principali pacchetti software di simulazione esistenti sul mercato.

Dynamics of a two-dimensional discrete-time SIS model

Directory of Open Access Journals (Sweden)

Jaime H. Barrera

2012-04-01

Full Text Available We analyze a two-dimensional discrete-time SIS model with a non-constant total population. Our goal is to determine the interaction between the total population, the susceptible class and the infective class, and the implications this may have for the disease dynamics. Utilizing a constant recruitment rate in the susceptible class, it is possible to assume the existence of an asymptotic limiting equation, which enables us to reduce the system of, two-equations into a single, dynamically equivalent equation. In this case, we are able to demonstrate the global stability of the disease-free and the endemic equilibria when the basic reproductive number (Ro is less than one and greater than one, respectively. When we consider a non-constant recruitment rate, the total population bifurcates as we vary the birth rate and the death rate. Using computer simulations, we observe different behavior among the infective class and the total population, and possibly, the occurrence of a strange attractor.

Nonparametric volatility density estimation for discrete time models

NARCIS (Netherlands)

Es, van Bert; Spreij, P.J.C.; Zanten, van J.H.

2005-01-01

We consider discrete time models for asset prices with a stationary volatility process. We aim at estimating the multivariate density of this process at a set of consecutive time instants. A Fourier-type deconvolution kernel density estimator based on the logarithm of the squared process is proposed

A discrete-time adaptive control scheme for robot manipulators

Science.gov (United States)

Tarokh, M.

1990-01-01

A discrete-time model reference adaptive control scheme is developed for trajectory tracking of robot manipulators. The scheme utilizes feedback, feedforward, and auxiliary signals, obtained from joint angle measurement through simple expressions. Hyperstability theory is utilized to derive the adaptation laws for the controller gain matrices. It is shown that trajectory tracking is achieved despite gross robot parameter variation and uncertainties. The method offers considerable design flexibility and enables the designer to improve the performance of the control system by adjusting free design parameters. The discrete-time adaptation algorithm is extremely simple and is therefore suitable for real-time implementation. Simulations and experimental results are given to demonstrate the performance of the scheme.

A Framework for the Optimization of Discrete-Event Simulation Models

Science.gov (United States)

Joshi, B. D.; Unal, R.; White, N. H.; Morris, W. D.

1996-01-01

With the growing use of computer modeling and simulation, in all aspects of engineering, the scope of traditional optimization has to be extended to include simulation models. Some unique aspects have to be addressed while optimizing via stochastic simulation models. The optimization procedure has to explicitly account for the randomness inherent in the stochastic measures predicted by the model. This paper outlines a general purpose framework for optimization of terminating discrete-event simulation models. The methodology combines a chance constraint approach for problem formulation, together with standard statistical estimation and analyses techniques. The applicability of the optimization framework is illustrated by minimizing the operation and support resources of a launch vehicle, through a simulation model.

Time-varying Crash Risk

DEFF Research Database (Denmark)

Christoffersen, Peter; Feunoua, Bruno; Jeon, Yoontae

We estimate a continuous-time model with stochastic volatility and dynamic crash probability for the S&P 500 index and find that market illiquidity dominates other factors in explaining the stock market crash risk. While the crash probability is time-varying, its dynamic depends only weakly on re...

Neutron fluctuations in a multiplying medium randomly varying in time

Energy Technology Data Exchange (ETDEWEB)

Pal, L. [KFKI Atomic Energy Research Inst., Budapest (Hungary); Pazsit, I. [Chalmers Univ. of Technology, Goeteborg (Sweden). Dept. of Nuclear Engineering

2006-07-15

The master equation approach, which has traditionally been used for the calculation of neutron fluctuations in multiplying systems with constant parameters, is extended to a case when the parameters of the system change randomly in time. A forward type master equation is considered for the case of a multiplying system whose properties jump randomly between two discrete states, both with and without a stationary external source. The first two factorial moments are calculated, including the covariance. This model can be considered as the unification of stochastic methods that were used either in a constant multiplying medium via the master equation technique, or in a fluctuating medium via the Langevin technique. The results obtained show a much richer characteristic of the zero power noise than that in constant systems. The results are relevant in medium power subcritical nuclear systems where the zero power noise is still significant, but they also have a bearing on all types of branching processes, such as evolution of biological systems, spreading of epidemics etc, which are set in a time-varying environment.

Neutron fluctuations in a multiplying medium randomly varying in time

International Nuclear Information System (INIS)

Pal, L.; Pazsit, I.

2006-01-01

The master equation approach, which has traditionally been used for the calculation of neutron fluctuations in multiplying systems with constant parameters, is extended to a case when the parameters of the system change randomly in time. A forward type master equation is considered for the case of a multiplying system whose properties jump randomly between two discrete states, both with and without a stationary external source. The first two factorial moments are calculated, including the covariance. This model can be considered as the unification of stochastic methods that were used either in a constant multiplying medium via the master equation technique, or in a fluctuating medium via the Langevin technique. The results obtained show a much richer characteristic of the zero power noise than that in constant systems. The results are relevant in medium power subcritical nuclear systems where the zero power noise is still significant, but they also have a bearing on all types of branching processes, such as evolution of biological systems, spreading of epidemics etc, which are set in a time-varying environment

Events in time: Basic analysis of Poisson data

International Nuclear Information System (INIS)

Engelhardt, M.E.

1994-09-01

The report presents basic statistical methods for analyzing Poisson data, such as the member of events in some period of time. It gives point estimates, confidence intervals, and Bayesian intervals for the rate of occurrence per unit of time. It shows how to compare subsets of the data, both graphically and by statistical tests, and how to look for trends in time. It presents a compound model when the rate of occurrence varies randomly. Examples and SAS programs are given

Events in time: Basic analysis of Poisson data

Energy Technology Data Exchange (ETDEWEB)

Engelhardt, M.E.

1994-09-01

The report presents basic statistical methods for analyzing Poisson data, such as the member of events in some period of time. It gives point estimates, confidence intervals, and Bayesian intervals for the rate of occurrence per unit of time. It shows how to compare subsets of the data, both graphically and by statistical tests, and how to look for trends in time. It presents a compound model when the rate of occurrence varies randomly. Examples and SAS programs are given.

Discrete-Time Local Value Iteration Adaptive Dynamic Programming: Admissibility and Termination Analysis.

Science.gov (United States)

Wei, Qinglai; Liu, Derong; Lin, Qiao

In this paper, a novel local value iteration adaptive dynamic programming (ADP) algorithm is developed to solve infinite horizon optimal control problems for discrete-time nonlinear systems. The focuses of this paper are to study admissibility properties and the termination criteria of discrete-time local value iteration ADP algorithms. In the discrete-time local value iteration ADP algorithm, the iterative value functions and the iterative control laws are both updated in a given subset of the state space in each iteration, instead of the whole state space. For the first time, admissibility properties of iterative control laws are analyzed for the local value iteration ADP algorithm. New termination criteria are established, which terminate the iterative local ADP algorithm with an admissible approximate optimal control law. Finally, simulation results are given to illustrate the performance of the developed algorithm.In this paper, a novel local value iteration adaptive dynamic programming (ADP) algorithm is developed to solve infinite horizon optimal control problems for discrete-time nonlinear systems. The focuses of this paper are to study admissibility properties and the termination criteria of discrete-time local value iteration ADP algorithms. In the discrete-time local value iteration ADP algorithm, the iterative value functions and the iterative control laws are both updated in a given subset of the state space in each iteration, instead of the whole state space. For the first time, admissibility properties of iterative control laws are analyzed for the local value iteration ADP algorithm. New termination criteria are established, which terminate the iterative local ADP algorithm with an admissible approximate optimal control law. Finally, simulation results are given to illustrate the performance of the developed algorithm.

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.

From discrete-time models to continuous-time, asynchronous modeling of financial markets

NARCIS (Netherlands)

Boer, Katalin; Kaymak, Uzay; Spiering, Jaap

2007-01-01

Most agent-based simulation models of financial markets are discrete-time in nature. In this paper, we investigate to what degree such models are extensible to continuous-time, asynchronous modeling of financial markets. We study the behavior of a learning market maker in a market with information

From Discrete-Time Models to Continuous-Time, Asynchronous Models of Financial Markets

NARCIS (Netherlands)

K. Boer-Sorban (Katalin); U. Kaymak (Uzay); J. Spiering (Jaap)

2006-01-01

textabstractMost agent-based simulation models of financial markets are discrete-time in nature. In this paper, we investigate to what degree such models are extensible to continuous-time, asynchronous modelling of financial markets. We study the behaviour of a learning market maker in a market with

Nonstochastic Analysis of Manufacturing Systems Using Timed-Event Graphs

DEFF Research Database (Denmark)

Hulgaard, Henrik; Amon, Tod

1996-01-01

Using automated methods to analyze the temporal behavior ofmanufacturing systems has proven to be essential and quite beneficial.Popular methodologies include Queueing networks, Markov chains,simulation techniques, and discrete event systems (such as Petrinets). These methodologies are primarily...

Construction of Discrete Time Shadow Price

International Nuclear Information System (INIS)

Rogala, Tomasz; Stettner, Lukasz

2015-01-01

In the paper expected utility from consumption over finite time horizon for discrete time markets with bid and ask prices and strictly concave utility function is considered. The notion of weak shadow price, i.e. an illiquid price, depending on the portfolio, under which the model without bid and ask price is equivalent to the model with bid and ask price is introduced. Existence and the form of weak shadow price is shown. Using weak shadow price usual (called in the paper strong) shadow price is then constructed

A Scalable GVT Estimation Algorithm for PDES: Using Lower Bound of Event-Bulk-Time

Directory of Open Access Journals (Sweden)

Yong Peng

2015-01-01

Full Text Available Global Virtual Time computation of Parallel Discrete Event Simulation is crucial for conducting fossil collection and detecting the termination of simulation. The triggering condition of GVT computation in typical approaches is generally based on the wall-clock time or logical time intervals. However, the GVT value depends on the timestamps of events rather than the wall-clock time or logical time intervals. Therefore, it is difficult for the existing approaches to select appropriate time intervals to compute the GVT value. In this study, we propose a scalable GVT estimation algorithm based on Lower Bound of Event-Bulk-Time, which triggers the computation of the GVT value according to the number of processed events. In order to calculate the number of transient messages, our algorithm employs Event-Bulk to record the messages sent and received by Logical Processes. To eliminate the performance bottleneck, we adopt an overlapping computation approach to distribute the workload of GVT computation to all worker-threads. We compare our algorithm with the fast asynchronous GVT algorithm using PHOLD benchmark on the shared memory machine. Experimental results indicate that our algorithm has a light overhead and shows higher speedup and accuracy of GVT computation than the fast asynchronous GVT algorithm.

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.

Study of selected phenotype switching strategies in time varying environment

Energy Technology Data Exchange (ETDEWEB)

Horvath, Denis, E-mail: horvath.denis@gmail.com [Centre of Interdisciplinary Biosciences, Institute of Physics, Faculty of Science, P.J. Šafárik University in Košice, Jesenná 5, 040 01 Košice (Slovakia); Brutovsky, Branislav, E-mail: branislav.brutovsky@upjs.sk [Department of Biophysics, Institute of Physics, P.J. Šafárik University in Košice, Jesenná 5, 040 01 Košice (Slovakia)

2016-03-22

Population heterogeneity plays an important role across many research, as well as the real-world, problems. The population heterogeneity relates to the ability of a population to cope with an environment change (or uncertainty) preventing its extinction. However, this ability is not always desirable as can be exemplified by an intratumor heterogeneity which positively correlates with the development of resistance to therapy. Causation of population heterogeneity is therefore in biology and medicine an intensively studied topic. In this paper the evolution of a specific strategy of population diversification, the phenotype switching, is studied at a conceptual level. The presented simulation model studies evolution of a large population of asexual organisms in a time-varying environment represented by a stochastic Markov process. Each organism disposes with a stochastic or nonlinear deterministic switching strategy realized by discrete-time models with evolvable parameters. We demonstrate that under rapidly varying exogenous conditions organisms operate in the vicinity of the bet-hedging strategy, while the deterministic patterns become relevant as the environmental variations are less frequent. Statistical characterization of the steady state regimes of the populations is done using the Hellinger and Kullback–Leibler functional distances and the Hamming distance. - Highlights: • Relation between phenotype switching and environment is studied. • The Markov chain Monte Carlo based model is developed. • Stochastic and deterministic strategies of phenotype switching are utilized. • Statistical measures of the dynamic heterogeneity reveal universal properties. • The results extend to higher lattice dimensions.

Study of selected phenotype switching strategies in time varying environment

International Nuclear Information System (INIS)

Horvath, Denis; Brutovsky, Branislav

2016-01-01

Population heterogeneity plays an important role across many research, as well as the real-world, problems. The population heterogeneity relates to the ability of a population to cope with an environment change (or uncertainty) preventing its extinction. However, this ability is not always desirable as can be exemplified by an intratumor heterogeneity which positively correlates with the development of resistance to therapy. Causation of population heterogeneity is therefore in biology and medicine an intensively studied topic. In this paper the evolution of a specific strategy of population diversification, the phenotype switching, is studied at a conceptual level. The presented simulation model studies evolution of a large population of asexual organisms in a time-varying environment represented by a stochastic Markov process. Each organism disposes with a stochastic or nonlinear deterministic switching strategy realized by discrete-time models with evolvable parameters. We demonstrate that under rapidly varying exogenous conditions organisms operate in the vicinity of the bet-hedging strategy, while the deterministic patterns become relevant as the environmental variations are less frequent. Statistical characterization of the steady state regimes of the populations is done using the Hellinger and Kullback–Leibler functional distances and the Hamming distance. - Highlights: • Relation between phenotype switching and environment is studied. • The Markov chain Monte Carlo based model is developed. • Stochastic and deterministic strategies of phenotype switching are utilized. • Statistical measures of the dynamic heterogeneity reveal universal properties. • The results extend to higher lattice dimensions.

Combining Latin Hypercube Designs and Discrete Event Simulation in a Study of a Surgical Unit

DEFF Research Database (Denmark)

Dehlendorff, Christian; Andersen, Klaus Kaae; Kulahci, Murat

Summary form given only:In this article experiments on a discrete event simulation model for an orthopedic surgery are considered. The model is developed as part of a larger project in co-operation with Copenhagen University Hospital in Gentofte. Experiments on the model are performed by using...... Latin hypercube designs. The parameter set consists of system settings such as use of preparation room for sedation and the number of operating rooms, as well as management decisions such as staffing, size of the recovery room and the number of simultaneously active operating rooms. Sensitivity analysis...... and optimization combined with meta-modeling are employed in search for optimal setups. The primary objective in this article is to minimize time spent by the patients in the system. The overall long-term objective for the orthopedic surgery unit is to minimize time lost during the pre- and post operation...

Alternative to dead reckoning for model state quantisation when migrating to a quantised discrete

CSIR Research Space (South Africa)

Duvenhage, A

2008-06-01

Full Text Available Some progress has recently been made on migrating an existing distributed parallel discrete time simulator to a quantised discrete event architecture. The migration is done to increase the scale of the real-time simulations supported...

The use of discrete-event simulation modelling to improve radiation therapy planning processes.

Science.gov (United States)

Werker, Greg; Sauré, Antoine; French, John; Shechter, Steven

2009-07-01

The planning portion of the radiation therapy treatment process at the British Columbia Cancer Agency is efficient but nevertheless contains room for improvement. The purpose of this study is to show how a discrete-event simulation (DES) model can be used to represent this complex process and to suggest improvements that may reduce the planning time and ultimately reduce overall waiting times. A simulation model of the radiation therapy (RT) planning process was constructed using the Arena simulation software, representing the complexities of the system. Several types of inputs feed into the model; these inputs come from historical data, a staff survey, and interviews with planners. The simulation model was validated against historical data and then used to test various scenarios to identify and quantify potential improvements to the RT planning process. Simulation modelling is an attractive tool for describing complex systems, and can be used to identify improvements to the processes involved. It is possible to use this technique in the area of radiation therapy planning with the intent of reducing process times and subsequent delays for patient treatment. In this particular system, reducing the variability and length of oncologist-related delays contributes most to improving the planning time.

Discretization of space and time in wave mechanics: the validity limit

OpenAIRE

Roatta , Luca

2017-01-01

Assuming that space and time can only have discrete values, it is shown that wave mechanics must necessarily have a specific applicability limit: in a discrete context, unlike in a continuous one, frequencies can not have arbitrarily high values.

Discrete event simulation for petroleum transfers involving harbors, refineries and pipelines

Energy Technology Data Exchange (ETDEWEB)

Martins, Marcella S.R.; Lueders, Ricardo; Delgado, Myriam R.B.S. [Universidade Tecnologica Federal do Parana (UTFPR), Curitiba, PR (Brazil)

2009-07-01

Nowadays a great effort has been spent by companies to improve their logistics in terms of programming of events that affect production and distribution of products. In this case, simulation can be a valuable tool for evaluating different behaviors. The objective of this work is to build a discrete event simulation model for scheduling of operational activities in complexes containing one harbor and two refineries interconnected by a pipeline infrastructure. The model was developed in Arena package, based on three sub-models that control pier allocation, loading of tanks, and transfers to refineries through pipelines. Preliminary results obtained for a given control policy, show that profit can be calculated by taking into account many parameters such as oil costs on ships, pier using, over-stay of ships and interface costs. Such problem has already been considered in the literature but using different strategies. All these factors should be considered in a real-world operation where decision making tools are necessary to obtain high returns. (author)

The large discretization step method for time-dependent partial differential equations

Science.gov (United States)

Haras, Zigo; Taasan, Shlomo

1995-01-01

A new method for the acceleration of linear and nonlinear time dependent calculations is presented. It is based on the Large Discretization Step (LDS) approximation, defined in this work, which employs an extended system of low accuracy schemes to approximate a high accuracy discrete approximation to a time dependent differential operator. Error bounds on such approximations are derived. These approximations are efficiently implemented in the LDS methods for linear and nonlinear hyperbolic equations, presented here. In these algorithms the high and low accuracy schemes are interpreted as the same discretization of a time dependent operator on fine and coarse grids, respectively. Thus, a system of correction terms and corresponding equations are derived and solved on the coarse grid to yield the fine grid accuracy. These terms are initialized by visiting the fine grid once in many coarse grid time steps. The resulting methods are very general, simple to implement and may be used to accelerate many existing time marching schemes.

DeMO: An Ontology for Discrete-event Modeling and Simulation

Science.gov (United States)

Silver, Gregory A; Miller, John A; Hybinette, Maria; Baramidze, Gregory; York, William S

2011-01-01

Several fields have created ontologies for their subdomains. For example, the biological sciences have developed extensive ontologies such as the Gene Ontology, which is considered a great success. Ontologies could provide similar advantages to the Modeling and Simulation community. They provide a way to establish common vocabularies and capture knowledge about a particular domain with community-wide agreement. Ontologies can support significantly improved (semantic) search and browsing, integration of heterogeneous information sources, and improved knowledge discovery capabilities. This paper discusses the design and development of an ontology for Modeling and Simulation called the Discrete-event Modeling Ontology (DeMO), and it presents prototype applications that demonstrate various uses and benefits that such an ontology may provide to the Modeling and Simulation community. PMID:22919114

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

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)

Stable cycling in discrete-time genetic models.

OpenAIRE

Hastings, A

1981-01-01

Examples of stable cycling are discussed for two-locus, two-allele, deterministic, discrete-time models with constant fitnesses. The cases that cycle were found by using numerical techniques to search for stable Hopf bifurcations. One consequence of the results is that apparent cases of directional selection may be due to stable cycling.

Stable cycling in discrete-time genetic models.

Science.gov (United States)

Hastings, A

1981-11-01

Examples of stable cycling are discussed for two-locus, two-allele, deterministic, discrete-time models with constant fitnesses. The cases that cycle were found by using numerical techniques to search for stable Hopf bifurcations. One consequence of the results is that apparent cases of directional selection may be due to stable cycling.

Synchronization of a Class of Memristive Stochastic Bidirectional Associative Memory Neural Networks with Mixed Time-Varying Delays via Sampled-Data Control

Directory of Open Access Journals (Sweden)

Manman Yuan

2018-01-01

Full Text Available The paper addresses the issue of synchronization of memristive bidirectional associative memory neural networks (MBAMNNs with mixed time-varying delays and stochastic perturbation via a sampled-data controller. First, we propose a new model of MBAMNNs with mixed time-varying delays. In the proposed approach, the mixed delays include time-varying distributed delays and discrete delays. Second, we design a new method of sampled-data control for the stochastic MBAMNNs. Traditional control methods lack the capability of reflecting variable synaptic weights. In this paper, the methods are carefully designed to confirm the synchronization processes are suitable for the feather of the memristor. Third, sufficient criteria guaranteeing the synchronization of the systems are derived based on the derive-response concept. Finally, the effectiveness of the proposed mechanism is validated with numerical experiments.

Time-discrete higher order ALE formulations: a priori error analysis

KAUST Repository

Bonito, Andrea

2013-03-16

We derive optimal a priori error estimates for discontinuous Galerkin (dG) time discrete schemes of any order applied to an advection-diffusion model defined on moving domains and written in the Arbitrary Lagrangian Eulerian (ALE) framework. Our estimates hold without any restrictions on the time steps for dG with exact integration or Reynolds\\' quadrature. They involve a mild restriction on the time steps for the practical Runge-Kutta-Radau methods of any order. The key ingredients are the stability results shown earlier in Bonito et al. (Time-discrete higher order ALE formulations: stability, 2013) along with a novel ALE projection. Numerical experiments illustrate and complement our theoretical results. © 2013 Springer-Verlag Berlin Heidelberg.

Discrete time process algebra and the semantics of SDL

NARCIS (Netherlands)

J.A. Bergstra; C.A. Middelburg; Y.S. Usenko (Yaroslav)

1998-01-01

htmlabstractWe present an extension of discrete time process algebra with relative timing where recursion, propositional signals and conditions, a counting process creation operator, and the state operator are combined. Except the counting process creation operator, which subsumes the original

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.

Parrondo's game using a discrete-time quantum walk

International Nuclear Information System (INIS)

Chandrashekar, C.M.; Banerjee, Subhashish

2011-01-01

We present a new form of a Parrondo game using discrete-time quantum walk on a line. The two players A and B with different quantum coins operators, individually losing the game can develop a strategy to emerge as joint winners by using their coins alternatively, or in combination for each step of the quantum walk evolution. We also present a strategy for a player A (B) to have a winning probability more than player B (A). Significance of the game strategy in information theory and physical applications are also discussed. - Highlights: → Novel form of Parrondo's game on a single particle discrete-time quantum walk. → Strategies for players to emerge as individual winners or as joint winners. → General framework for controlling and using quantum walk with multiple coins. → Strategies can be used in algorithms and situations involving directed motion.

Discrete-time bidirectional associative memory neural networks with variable delays

International Nuclear Information System (INIS)

Liang Jinling; Cao Jinde; Ho, Daniel W.C.

2005-01-01

Based on the linear matrix inequality (LMI), some sufficient conditions are presented in this Letter for the existence, uniqueness and global exponential stability of the equilibrium point of discrete-time bidirectional associative memory (BAM) neural networks with variable delays. Some of the stability criteria obtained in this Letter are delay-dependent, and some of them are delay-independent, they are less conservative than the ones reported so far in the literature. Furthermore, the results provide one more set of easily verified criteria for determining the exponential stability of discrete-time BAM neural networks

Discrete-time bidirectional associative memory neural networks with variable delays

Science.gov (United States)

Liang, variable delays [rapid communication] J.; Cao, J.; Ho, D. W. C.

2005-02-01

Based on the linear matrix inequality (LMI), some sufficient conditions are presented in this Letter for the existence, uniqueness and global exponential stability of the equilibrium point of discrete-time bidirectional associative memory (BAM) neural networks with variable delays. Some of the stability criteria obtained in this Letter are delay-dependent, and some of them are delay-independent, they are less conservative than the ones reported so far in the literature. Furthermore, the results provide one more set of easily verified criteria for determining the exponential stability of discrete-time BAM neural networks.

The impact of inpatient boarding on ED efficiency: a discrete-event simulation study.

Science.gov (United States)

Bair, Aaron E; Song, Wheyming T; Chen, Yi-Chun; Morris, Beth A

2010-10-01

In this study, a discrete-event simulation approach was used to model Emergency Department's (ED) patient flow to investigate the effect of inpatient boarding on the ED efficiency in terms of the National Emergency Department Crowding Scale (NEDOCS) score and the rate of patients who leave without being seen (LWBS). The decision variable in this model was the boarder-released-ratio defined as the ratio of admitted patients whose boarding time is zero to all admitted patients. Our analysis shows that the Overcrowded(+) (a NEDOCS score over 100) ratio decreased from 88.4% to 50.4%, and the rate of LWBS patients decreased from 10.8% to 8.4% when the boarder-released-ratio changed from 0% to 100%. These results show that inpatient boarding significantly impacts both the NEDOCS score and the rate of LWBS patient and this analysis provides a quantification of the impact of boarding on emergency department patient crowding.

Simultaneous Robust Fault and State Estimation for Linear Discrete-Time Uncertain Systems

Directory of Open Access Journals (Sweden)

Feten Gannouni

2017-01-01

Full Text Available We consider the problem of robust simultaneous fault and state estimation for linear uncertain discrete-time systems with unknown faults which affect both the state and the observation matrices. Using transformation of the original system, a new robust proportional integral filter (RPIF having an error variance with an optimized guaranteed upper bound for any allowed uncertainty is proposed to improve robust estimation of unknown time-varying faults and to improve robustness against uncertainties. In this study, the minimization problem of the upper bound of the estimation error variance is formulated as a convex optimization problem subject to linear matrix inequalities (LMI for all admissible uncertainties. The proportional and the integral gains are optimally chosen by solving the convex optimization problem. Simulation results are given in order to illustrate the performance of the proposed filter, in particular to solve the problem of joint fault and state estimation.

Approximation-Based Discrete-Time Adaptive Position Tracking Control for Interior Permanent Magnet Synchronous Motors.

Science.gov (United States)

Yu, Jinpeng; Shi, Peng; Yu, Haisheng; Chen, Bing; Lin, Chong

2015-07-01

This paper considers the problem of discrete-time adaptive position tracking control for a interior permanent magnet synchronous motor (IPMSM) based on fuzzy-approximation. Fuzzy logic systems are used to approximate the nonlinearities of the discrete-time IPMSM drive system which is derived by direct discretization using Euler method, and a discrete-time fuzzy position tracking controller is designed via backstepping approach. In contrast to existing results, the advantage of the scheme is that the number of the adjustable parameters is reduced to two only and the problem of coupling nonlinearity can be overcome. It is shown that the proposed discrete-time fuzzy controller can guarantee the tracking error converges to a small neighborhood of the origin and all the signals are bounded. Simulation results illustrate the effectiveness and the potentials of the theoretic results obtained.

Tolerable Time-Varying Overflow on Grass-Covered Slopes

Directory of Open Access Journals (Sweden)

Steven A. Hughes

2015-03-01

Full Text Available Engineers require estimates of tolerable overtopping limits for grass-covered levees, dikes, and embankments that might experience steady overflow. Realistic tolerance estimates can be used for both resilient design and risk assessment. A simple framework is developed for estimating tolerable overtopping on grass-covered slopes caused by slowly-varying (in time overtopping discharge (e.g., events like storm surges or river flood waves. The framework adapts the well-known Hewlett curves of tolerable limiting velocity as a function of overflow duration. It has been hypothesized that the form of the Hewlett curves suggests that the grass erosion process is governed by the flow work on the slope above a critical threshold velocity (referred to as excess work, and the tolerable erosional limit is reached when the cumulative excess work exceeds a given value determined from the time-dependent Hewlett curves. The cumulative excess work is expressed in terms of overflow discharge above a critical discharge that slowly varies in time, similar to a discharge hydrograph. The methodology is easily applied using forecast storm surge hydrographs at specific locations where wave action is minimal. For preliminary planning purposes, when storm surge hydrographs are unavailable, hypothetical equations for the water level and overflow discharge hydrographs are proposed in terms of the values at maximum overflow and the total duration of overflow. An example application is given to illustrate use of the methodology.

Centralized and decentralized global outer-synchronization of asymmetric recurrent time-varying neural network by data-sampling.

Science.gov (United States)

Lu, Wenlian; Zheng, Ren; Chen, Tianping

2016-03-01

In this paper, we discuss outer-synchronization of the asymmetrically connected recurrent time-varying neural networks. By using both centralized and decentralized discretization data sampling principles, we derive several sufficient conditions based on three vector norms to guarantee that the difference of any two trajectories starting from different initial values of the neural network converges to zero. The lower bounds of the common time intervals between data samples in centralized and decentralized principles are proved to be positive, which guarantees exclusion of Zeno behavior. A numerical example is provided to illustrate the efficiency of the theoretical results. Copyright © 2015 Elsevier Ltd. All rights reserved.

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....

Sampled-data and discrete-time H2 optimal control

NARCIS (Netherlands)

Trentelman, Harry L.; Stoorvogel, Anton A.

1993-01-01

This paper deals with the sampled-data H2 optimal control problem. Given a linear time-invariant continuous-time system, the problem of minimizing the H2 performance over all sampled-data controllers with a fixed sampling period can be reduced to a pure discrete-time H2 optimal control problem. This

Comparison of discrete event simulation tools in an academic environment

Directory of Open Access Journals (Sweden)

Mario Jadrić

2014-12-01

Full Text Available A new research model for simulation software evaluation is proposed consisting of three main categories of criteria: modeling and simulation capabilities of the explored tools, and tools’ input/output analysis possibilities, all with respective sub-criteria. Using the presented model, two discrete event simulation tools are evaluated in detail using the task-centred scenario. Both tools (Arena and ExtendSim were used for teaching discrete event simulation in preceding academic years. With the aim to inspect their effectiveness and to help us determine which tool is more suitable for students i.e. academic purposes, we used a simple simulation model of entities competing for limited resources. The main goal was to measure subjective (primarily attitude and objective indicators while using the tools when the same simulation scenario is given. The subjects were first year students of Master studies in Information Management at the Faculty of Economics in Split taking a course in Business Process Simulations (BPS. In a controlled environment – in a computer lab, two groups of students were given detailed, step-by-step instructions for building models using both tools - first using ExtendSim then Arena or vice versa. Subjective indicators (students’ attitudes were collected using an online survey completed immediately upon building each model. Subjective indicators primarily include students’ personal estimations of Arena and ExtendSim capabilities/features for model building, model simulation and result analysis. Objective indicators were measured using specialised software that logs information on user's behavior while performing a particular task on their computer such as distance crossed by mouse during model building, the number of mouse clicks, usage of the mouse wheel and speed achieved. The results indicate that ExtendSim is well preferred comparing to Arena with regards to subjective indicators while the objective indicators are

Continuous and Discrete-Time Optimal Controls for an Isolated Signalized Intersection

Directory of Open Access Journals (Sweden)

Jiyuan Tan

2017-01-01

Full Text Available A classical control problem for an isolated oversaturated intersection is revisited with a focus on the optimal control policy to minimize total delay. The difference and connection between existing continuous-time planning models and recently proposed discrete-time planning models are studied. A gradient descent algorithm is proposed to convert the optimal control plan of the continuous-time model to the plan of the discrete-time model in many cases. Analytic proof and numerical tests for the algorithm are also presented. The findings shed light on the links between two kinds of models.

Analysis and identification of time-invariant systems, time-varying systems, and multi-delay systems using orthogonal hybrid functions theory and algorithms with Matlab

CERN Document Server

Deb, Anish; Sarkar, Gautam

2016-01-01

This book introduces a new set of orthogonal hybrid functions (HF) which approximates time functions in a piecewise linear manner which is very suitable for practical applications. The book presents an analysis of different systems namely, time-invariant system, time-varying system, multi-delay systems---both homogeneous and non-homogeneous type- and the solutions are obtained in the form of discrete samples. The book also investigates system identification problems for many of the above systems. The book is spread over 15 chapters and contains 180 black and white figures, 18 colour figures, 85 tables and 56 illustrative examples. MATLAB codes for many such examples are included at the end of the book.

Modeling a Million-Node Slim Fly Network Using Parallel Discrete-Event Simulation

Energy Technology Data Exchange (ETDEWEB)

Wolfe, Noah; Carothers, Christopher; Mubarak, Misbah; Ross, Robert; Carns, Philip

2016-05-15

As supercomputers close in on exascale performance, the increased number of processors and processing power translates to an increased demand on the underlying network interconnect. The Slim Fly network topology, a new lowdiameter and low-latency interconnection network, is gaining interest as one possible solution for next-generation supercomputing interconnect systems. In this paper, we present a high-fidelity Slim Fly it-level model leveraging the Rensselaer Optimistic Simulation System (ROSS) and Co-Design of Exascale Storage (CODES) frameworks. We validate our Slim Fly model with the Kathareios et al. Slim Fly model results provided at moderately sized network scales. We further scale the model size up to n unprecedented 1 million compute nodes; and through visualization of network simulation metrics such as link bandwidth, packet latency, and port occupancy, we get an insight into the network behavior at the million-node scale. We also show linear strong scaling of the Slim Fly model on an Intel cluster achieving a peak event rate of 36 million events per second using 128 MPI tasks to process 7 billion events. Detailed analysis of the underlying discrete-event simulation performance shows that a million-node Slim Fly model simulation can execute in 198 seconds on the Intel cluster.

Using a discrete-event simulation to balance ambulance availability and demand in static deployment systems.

Science.gov (United States)

Wu, Ching-Han; Hwang, Kevin P

2009-12-01

To improve ambulance response time, matching ambulance availability with the emergency demand is crucial. To maintain the standard of 90% of response times within 9 minutes, the authors introduce a discrete-event simulation method to estimate the threshold for expanding the ambulance fleet when demand increases and to find the optimal dispatching strategies when provisional events create temporary decreases in ambulance availability. The simulation model was developed with information from the literature. Although the development was theoretical, the model was validated on the emergency medical services (EMS) system of Tainan City. The data are divided: one part is for model development, and the other for validation. For increasing demand, the effect was modeled on response time when call arrival rates increased. For temporary availability decreases, the authors simulated all possible alternatives of ambulance deployment in accordance with the number of out-of-routine-duty ambulances and the durations of three types of mass gatherings: marathon races (06:00-10:00 hr), rock concerts (18:00-22:00 hr), and New Year's Eve parties (20:00-01:00 hr). Statistical analysis confirmed that the model reasonably represented the actual Tainan EMS system. The response-time standard could not be reached when the incremental ratio of call arrivals exceeded 56%, which is the threshold for the Tainan EMS system to expand its ambulance fleet. When provisional events created temporary availability decreases, the Tainan EMS system could spare at most two ambulances from the standard configuration, except between 20:00 and 01:00, when it could spare three. The model also demonstrated that the current Tainan EMS has two excess ambulances that could be dropped. The authors suggest dispatching strategies to minimize the response times in routine daily emergencies. Strategies of capacity management based on this model improved response times. The more ambulances that are out of routine duty

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)

When to use discrete event simulation (DES) for the economic evaluation of health technologies? A review and critique of the costs and benefits of DES.

Science.gov (United States)

Karnon, Jonathan; Haji Ali Afzali, Hossein

2014-06-01

Modelling in economic evaluation is an unavoidable fact of life. Cohort-based state transition models are most common, though discrete event simulation (DES) is increasingly being used to implement more complex model structures. The benefits of DES relate to the greater flexibility around the implementation and population of complex models, which may provide more accurate or valid estimates of the incremental costs and benefits of alternative health technologies. The costs of DES relate to the time and expertise required to implement and review complex models, when perhaps a simpler model would suffice. The costs are not borne solely by the analyst, but also by reviewers. In particular, modelled economic evaluations are often submitted to support reimbursement decisions for new technologies, for which detailed model reviews are generally undertaken on behalf of the funding body. This paper reports the results from a review of published DES-based economic evaluations. Factors underlying the use of DES were defined, and the characteristics of applied models were considered, to inform options for assessing the potential benefits of DES in relation to each factor. Four broad factors underlying the use of DES were identified: baseline heterogeneity, continuous disease markers, time varying event rates, and the influence of prior events on subsequent event rates. If relevant, individual-level data are available, representation of the four factors is likely to improve model validity, and it is possible to assess the importance of their representation in individual cases. A thorough model performance evaluation is required to overcome the costs of DES from the users' perspective, but few of the reviewed DES models reported such a process. More generally, further direct, empirical comparisons of complex models with simpler models would better inform the benefits of DES to implement more complex models, and the circumstances in which such benefits are most likely.

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

Filtering of Discrete-Time Switched Neural Networks Ensuring Exponential Dissipative and $l_{2}$ - $l_{\\infty }$ Performances.

Science.gov (United States)

Choi, Hyun Duck; Ahn, Choon Ki; Karimi, Hamid Reza; Lim, Myo Taeg

2017-10-01

This paper studies delay-dependent exponential dissipative and l 2 - l ∞ filtering problems for discrete-time switched neural networks (DSNNs) including time-delayed states. By introducing a novel discrete-time inequality, which is a discrete-time version of the continuous-time Wirtinger-type inequality, we establish new sets of linear matrix inequality (LMI) criteria such that discrete-time filtering error systems are exponentially stable with guaranteed performances in the exponential dissipative and l 2 - l ∞ senses. The design of the desired exponential dissipative and l 2 - l ∞ filters for DSNNs can be achieved by solving the proposed sets of LMI conditions. Via numerical simulation results, we show the validity of the desired discrete-time filter design approach.

A participative and facilitative conceptual modelling framework for discrete event simulation studies in healthcare

OpenAIRE

Kotiadis, Kathy; Tako, Antuela; Vasilakis, Christos

2014-01-01

Existing approaches to conceptual modelling (CM) in discrete-event simulation do not formally support the participation of a group of stakeholders. Simulation in healthcare can benefit from stakeholder participation as it makes possible to share multiple views and tacit knowledge from different parts of the system. We put forward a framework tailored to healthcare that supports the interaction of simulation modellers with a group of stakeholders to arrive at a common conceptual model. The fra...

Real-time frequency-to-time mapping based on spectrally-discrete chromatic dispersion.

Science.gov (United States)

Dai, Yitang; Li, Jilong; Zhang, Ziping; Yin, Feifei; Li, Wangzhe; Xu, Kun

2017-07-10

Traditional photonics-assisted real-time Fourier transform (RTFT) usually suffers from limited chromatic dispersion, huge volume, or large time delay and attendant loss. In this paper we propose frequency-to-time mapping (FTM) by spectrally-discrete dispersion to increase frequency sensitivity greatly. The novel media has periodic ON/OFF intensity frequency response while quadratic phase distribution along disconnected channels, which de-chirps matched optical input to repeated Fourier-transform-limited output. Real-time FTM is then obtained within each period. Since only discrete phase retardation rather than continuously-changed true time delay is required, huge equivalent dispersion is then available by compact device. Such FTM is theoretically analyzed, and implementation by cascaded optical ring resonators is proposed. After a numerical example, our theory is demonstrated by a proof-of-concept experiment, where a single loop containing 0.5-meters-long fiber is used. FTM under 400-MHz unambiguous bandwidth and 25-MHz resolution is reported. Highly-sensitive and linear mapping is achieved with 6.25 ps/MHz, equivalent to ~4.6 × 10 4 -km standard single mode fiber. Extended instantaneous bandwidth is expected by ring cascading. Our proposal may provide a promising method for real-time, low-latency Fourier transform.

Stability analysis of implicit time discretizations for the Compton-scattering Fokker-Planck equation

International Nuclear Information System (INIS)

Densmore, Jeffery D.; Warsa, James S.; Lowrie, Robert B.; Morel, Jim E.

2009-01-01

The Fokker-Planck equation is a widely used approximation for modeling the Compton scattering of photons in high energy density applications. In this paper, we perform a stability analysis of three implicit time discretizations for the Compton-Scattering Fokker-Planck equation. Specifically, we examine (i) a Semi-Implicit (SI) scheme that employs backward-Euler differencing but evaluates temperature-dependent coefficients at their beginning-of-time-step values, (ii) a Fully Implicit (FI) discretization that instead evaluates temperature-dependent coefficients at their end-of-time-step values, and (iii) a Linearized Implicit (LI) scheme, which is developed by linearizing the temperature dependence of the FI discretization within each time step. Our stability analysis shows that the FI and LI schemes are unconditionally stable and cannot generate oscillatory solutions regardless of time-step size, whereas the SI discretization can suffer from instabilities and nonphysical oscillations for sufficiently large time steps. With the results of this analysis, we present time-step limits for the SI scheme that prevent undesirable behavior. We test the validity of our stability analysis and time-step limits with a set of numerical examples.

Stability analysis of implicit time discretizations for the Compton-scattering Fokker-Planck equation

Energy Technology Data Exchange (ETDEWEB)

Densmore, Jeffery D [Los Alamos National Laboratory; Warsa, James S [Los Alamos National Laboratory; Lowrie, Robert B [Los Alamos National Laboratory; Morel, Jim E [TEXAS A& M UNIV

2008-01-01

The Fokker-Planck equation is a widely used approximation for modeling the Compton scattering of photons in high energy density applications. In this paper, we perform a stability analysis of three implicit time discretizations for the Compton-Scattering Fokker-Planck equation. Specifically, we examine (i) a Semi-Implicit (SI) scheme that employs backward-Euler differencing but evaluates temperature-dependent coefficients at their beginning-of-time-step values, (ii) a Fully Implicit (FI) discretization that instead evaluates temperature-dependent coefficients at their end-of-time-step values, and (iii) a Linearized Implicit (LI) scheme, which is developed by linearizing the temperature dependence of the FI discretization within each time step. Our stability analysis shows that the FI and LI schemes are unconditionally stable and cannot generate oscillatory solutions regardless of time-step size, whereas the SI discretization can suffer from instabilities and nonphysical oscillations for sufficiently large time steps. With the results of this analysis, we present time-step limits for the SI scheme that prevent undesirable behavior. We test the validity of our stability analysis and time-step limits with a set of numerical examples.

Stability analysis of implicit time discretizations for the Compton-scattering Fokker-Planck equation

Science.gov (United States)

Densmore, Jeffery D.; Warsa, James S.; Lowrie, Robert B.; Morel, Jim E.

2009-09-01

The Fokker-Planck equation is a widely used approximation for modeling the Compton scattering of photons in high energy density applications. In this paper, we perform a stability analysis of three implicit time discretizations for the Compton-Scattering Fokker-Planck equation. Specifically, we examine (i) a Semi-Implicit (SI) scheme that employs backward-Euler differencing but evaluates temperature-dependent coefficients at their beginning-of-time-step values, (ii) a Fully Implicit (FI) discretization that instead evaluates temperature-dependent coefficients at their end-of-time-step values, and (iii) a Linearized Implicit (LI) scheme, which is developed by linearizing the temperature dependence of the FI discretization within each time step. Our stability analysis shows that the FI and LI schemes are unconditionally stable and cannot generate oscillatory solutions regardless of time-step size, whereas the SI discretization can suffer from instabilities and nonphysical oscillations for sufficiently large time steps. With the results of this analysis, we present time-step limits for the SI scheme that prevent undesirable behavior. We test the validity of our stability analysis and time-step limits with a set of numerical examples.

Design of 2D time-varying vector fields.

Science.gov (United States)

Chen, Guoning; Kwatra, Vivek; Wei, Li-Yi; Hansen, Charles D; Zhang, Eugene

2012-10-01

Design of time-varying vector fields, i.e., vector fields that can change over time, has a wide variety of important applications in computer graphics. Existing vector field design techniques do not address time-varying vector fields. In this paper, we present a framework for the design of time-varying vector fields, both for planar domains as well as manifold surfaces. Our system supports the creation and modification of various time-varying vector fields with desired spatial and temporal characteristics through several design metaphors, including streamlines, pathlines, singularity paths, and bifurcations. These design metaphors are integrated into an element-based design to generate the time-varying vector fields via a sequence of basis field summations or spatial constrained optimizations at the sampled times. The key-frame design and field deformation are also introduced to support other user design scenarios. Accordingly, a spatial-temporal constrained optimization and the time-varying transformation are employed to generate the desired fields for these two design scenarios, respectively. We apply the time-varying vector fields generated using our design system to a number of important computer graphics applications that require controllable dynamic effects, such as evolving surface appearance, dynamic scene design, steerable crowd movement, and painterly animation. Many of these are difficult or impossible to achieve via prior simulation-based methods. In these applications, the time-varying vector fields have been applied as either orientation fields or advection fields to control the instantaneous appearance or evolving trajectories of the dynamic effects.

Parallel discrete-event simulation of FCFS stochastic queueing networks

Science.gov (United States)

Nicol, David M.

1988-01-01

Physical systems are inherently parallel. Intuition suggests that simulations of these systems may be amenable to parallel execution. The parallel execution of a discrete-event simulation requires careful synchronization of processes in order to ensure the execution's correctness; this synchronization can degrade performance. Largely negative results were recently reported in a study which used a well-known synchronization method on queueing network simulations. Discussed here is a synchronization method (appointments), which has proven itself to be effective on simulations of FCFS queueing networks. The key concept behind appointments is the provision of lookahead. Lookahead is a prediction on a processor's future behavior, based on an analysis of the processor's simulation state. It is shown how lookahead can be computed for FCFS queueing network simulations, give performance data that demonstrates the method's effectiveness under moderate to heavy loads, and discuss performance tradeoffs between the quality of lookahead, and the cost of computing lookahead.

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.

Using discrete-event simulation in strategic capacity planning for an outpatient physical therapy service.

Science.gov (United States)

Rau, Chi-Lun; Tsai, Pei-Fang Jennifer; Liang, Sheau-Farn Max; Tan, Jhih-Cian; Syu, Hong-Cheng; Jheng, Yue-Ling; Ciou, Ting-Syuan; Jaw, Fu-Shan

2013-12-01

This study uses a simulation model as a tool for strategic capacity planning for an outpatient physical therapy clinic in Taipei, Taiwan. The clinic provides a wide range of physical treatments, with 6 full-time therapists in each session. We constructed a discrete-event simulation model to study the dynamics of patient mixes with realistic treatment plans, and to estimate the practical capacity of the physical therapy room. The changes in time-related and space-related performance measurements were used to evaluate the impact of various strategies on the capacity of the clinic. The simulation results confirmed that the clinic is extremely patient-oriented, with a bottleneck occurring at the traction units for Intermittent Pelvic Traction (IPT), with usage at 58.9 %. Sensitivity analysis showed that attending to more patients would significantly increase the number of patients staying for overtime sessions. We found that pooling the therapists produced beneficial results. The average waiting time per patient could be reduced by 45 % when we pooled 2 therapists. We found that treating up to 12 new patients per session had no significantly negative impact on returning patients. Moreover, we found that the average waiting time for new patients decreased if they were given priority over returning patients when called by the therapists.

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.

Simulation of land use evolution by discrete events method: Application to “la chaîne des puys” from XV to XVIII Century

OpenAIRE

Y. Michelin; C. Poix

1998-01-01

By using a discrete event method, simulation of land use evolution has been applied to a landscape model of “la ChaÎne des Puys” (French Massif Central) during along period (XV–XVIII centuries). The indications concerning the evolution of land use are in conformity with the observation of actual situations but the dynamic changes are faster than in actual facts. In spite of limitations due to necessary simplifications, it is now established that the discrete event method is efficient to simu...

The existence and global attractivity of almost periodic sequence solution of discrete-time neural networks

International Nuclear Information System (INIS)

Huang Zhenkun; Wang Xinghua; Gao Feng

2006-01-01

In this Letter, we discuss discrete-time analogue of a continuous-time cellular neural network. Sufficient conditions are obtained for the existence of a unique almost periodic sequence solution which is globally attractive. Our results demonstrate dynamics of the formulated discrete-time analogue as mathematical models for the continuous-time cellular neural network in almost periodic case. Finally, a computer simulation illustrates the suitability of our discrete-time analogue as numerical algorithms in simulating the continuous-time cellular neural network conveniently

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

A paradigm for discrete physics

International Nuclear Information System (INIS)

Noyes, H.P.; McGoveran, D.; Etter, T.; Manthey, M.J.; Gefwert, C.

1987-01-01

An example is outlined for constructing a discrete physics using as a starting point the insight from quantum physics that events are discrete, indivisible and non-local. Initial postulates are finiteness, discreteness, finite computability, absolute nonuniqueness (i.e., homogeneity in the absence of specific cause) and additivity

Synchronization criterion for Lur'e type complex dynamical networks with time-varying delay

International Nuclear Information System (INIS)

Ji, D.H.; Park, Ju H.; Yoo, W.J.; Won, S.C.; Lee, S.M.

2010-01-01

In this Letter, the synchronization problem for a class of complex dynamical networks in which every identical node is a Lur'e system with time-varying delay is considered. A delay-dependent synchronization criterion is derived for the synchronization of complex dynamical network that represented by Lur'e system with sector restricted nonlinearities. The derived criterion is a sufficient condition for absolute stability of error dynamics between the each nodes and the isolated node. Using a convex representation of the nonlinearity for error dynamics, the stability condition based on the discretized Lyapunov-Krasovskii functional is obtained via LMI formulation. The proposed delay-dependent synchronization criterion is less conservative than the existing ones. The effectiveness of our work is verified through numerical examples.

Non-fragile observer design for discrete-time genetic regulatory networks with randomly occurring uncertainties

International Nuclear Information System (INIS)

Banu, L Jarina; Balasubramaniam, P

2015-01-01

This paper investigates the problem of non-fragile observer design for a class of discrete-time genetic regulatory networks (DGRNs) with time-varying delays and randomly occurring uncertainties. A non-fragile observer is designed, for estimating the true concentration of mRNAs and proteins from available measurement outputs. One important feature of the results obtained that are reported here is that the parameter uncertainties are assumed to be random and their probabilities of occurrence are known a priori. On the basis of the Lyapunov–Krasovskii functional approach and using a convex combination technique, a delay-dependent estimation criterion is established for DGRNs in terms of linear matrix inequalities (LMIs) that can be efficiently solved using any available LMI solver. Finally numerical examples are provided to substantiate the theoretical results. (paper)

Discretization of space and time: determining the values of minimum length and minimum time

OpenAIRE

Roatta , Luca

2017-01-01

Assuming that space and time can only have discrete values, we obtain the expression of the minimum length and the minimum time interval. These values are found to be exactly coincident with the Planck's length and the Planck's time but for the presence of h instead of ħ .

Design of 2D Time-Varying Vector Fields

KAUST Repository

Chen, Guoning

2012-10-01

Design of time-varying vector fields, i.e., vector fields that can change over time, has a wide variety of important applications in computer graphics. Existing vector field design techniques do not address time-varying vector fields. In this paper, we present a framework for the design of time-varying vector fields, both for planar domains as well as manifold surfaces. Our system supports the creation and modification of various time-varying vector fields with desired spatial and temporal characteristics through several design metaphors, including streamlines, pathlines, singularity paths, and bifurcations. These design metaphors are integrated into an element-based design to generate the time-varying vector fields via a sequence of basis field summations or spatial constrained optimizations at the sampled times. The key-frame design and field deformation are also introduced to support other user design scenarios. Accordingly, a spatial-temporal constrained optimization and the time-varying transformation are employed to generate the desired fields for these two design scenarios, respectively. We apply the time-varying vector fields generated using our design system to a number of important computer graphics applications that require controllable dynamic effects, such as evolving surface appearance, dynamic scene design, steerable crowd movement, and painterly animation. Many of these are difficult or impossible to achieve via prior simulation-based methods. In these applications, the time-varying vector fields have been applied as either orientation fields or advection fields to control the instantaneous appearance or evolving trajectories of the dynamic effects. © 1995-2012 IEEE.

Design of 2D Time-Varying Vector Fields

KAUST Repository

Chen, Guoning; Kwatra, Vivek; Wei, Li-Yi; Hansen, Charles D.; Zhang, Eugene

2012-01-01

Design of time-varying vector fields, i.e., vector fields that can change over time, has a wide variety of important applications in computer graphics. Existing vector field design techniques do not address time-varying vector fields. In this paper, we present a framework for the design of time-varying vector fields, both for planar domains as well as manifold surfaces. Our system supports the creation and modification of various time-varying vector fields with desired spatial and temporal characteristics through several design metaphors, including streamlines, pathlines, singularity paths, and bifurcations. These design metaphors are integrated into an element-based design to generate the time-varying vector fields via a sequence of basis field summations or spatial constrained optimizations at the sampled times. The key-frame design and field deformation are also introduced to support other user design scenarios. Accordingly, a spatial-temporal constrained optimization and the time-varying transformation are employed to generate the desired fields for these two design scenarios, respectively. We apply the time-varying vector fields generated using our design system to a number of important computer graphics applications that require controllable dynamic effects, such as evolving surface appearance, dynamic scene design, steerable crowd movement, and painterly animation. Many of these are difficult or impossible to achieve via prior simulation-based methods. In these applications, the time-varying vector fields have been applied as either orientation fields or advection fields to control the instantaneous appearance or evolving trajectories of the dynamic effects. © 1995-2012 IEEE.

A discrete event modelling framework for simulation of long-term outcomes of sequential treatment strategies for ankylosing spondylitis

NARCIS (Netherlands)

A. Tran-Duy (An); A. Boonen (Annelies); M.A.F.J. van de Laar (Mart); A. Franke (Andre); J.L. Severens (Hans)

2011-01-01

textabstractObjective: To develop a modelling framework which can simulate long-term quality of life, societal costs and cost-effectiveness as affected by sequential drug treatment strategies for ankylosing spondylitis (AS). Methods: Discrete event simulation paradigm was selected for model

A discrete event modelling framework for simulation of long-term outcomes of sequential treatment strategies for ankylosing spondylitis

NARCIS (Netherlands)

Tran-Duy, A.; Boonen, A.; Laar, M.A.F.J.; Franke, A.C.; Severens, J.L.

2011-01-01

Objective To develop a modelling framework which can simulate long-term quality of life, societal costs and cost-effectiveness as affected by sequential drug treatment strategies for ankylosing spondylitis (AS). Methods Discrete event simulation paradigm was selected for model development. Drug

Global Stability of Polytopic Linear Time-Varying Dynamic Systems under Time-Varying Point Delays and Impulsive Controls

Directory of Open Access Journals (Sweden)

M. de la Sen

2010-01-01

Full Text Available This paper investigates the stability properties of a class of dynamic linear systems possessing several linear time-invariant parameterizations (or configurations which conform a linear time-varying polytopic dynamic system with a finite number of time-varying time-differentiable point delays. The parameterizations may be timevarying and with bounded discontinuities and they can be subject to mixed regular plus impulsive controls within a sequence of time instants of zero measure. The polytopic parameterization for the dynamics associated with each delay is specific, so that (q+1 polytopic parameterizations are considered for a system with q delays being also subject to delay-free dynamics. The considered general dynamic system includes, as particular cases, a wide class of switched linear systems whose individual parameterizations are timeinvariant which are governed by a switching rule. However, the dynamic system under consideration is viewed as much more general since it is time-varying with timevarying delays and the bounded discontinuous changes of active parameterizations are generated by impulsive controls in the dynamics and, at the same time, there is not a prescribed set of candidate potential parameterizations.

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.

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.

Disease Extinction Versus Persistence in Discrete-Time Epidemic Models.

Science.gov (United States)

van den Driessche, P; Yakubu, Abdul-Aziz

2018-04-12

We focus on discrete-time infectious disease models in populations that are governed by constant, geometric, Beverton-Holt or Ricker demographic equations, and give a method for computing the basic reproduction number, [Formula: see text]. When [Formula: see text] and the demographic population dynamics are asymptotically constant or under geometric growth (non-oscillatory), we prove global asymptotic stability of the disease-free equilibrium of the disease models. Under the same demographic assumption, when [Formula: see text], we prove uniform persistence of the disease. We apply our theoretical results to specific discrete-time epidemic models that are formulated for SEIR infections, cholera in humans and anthrax in animals. Our simulations show that a unique endemic equilibrium of each of the three specific disease models is asymptotically stable whenever [Formula: see text].

Efficient rare-event simulation for multiple jump events in regularly varying random walks and compound Poisson processes

NARCIS (Netherlands)

B. Chen (Bohan); J. Blanchet; C.H. Rhee (Chang-Han); A.P. Zwart (Bert)

2017-01-01

textabstractWe propose a class of strongly efficient rare event simulation estimators for random walks and compound Poisson processes with a regularly varying increment/jump-size distribution in a general large deviations regime. Our estimator is based on an importance sampling strategy that hinges

Discrete time population dynamics of a two-stage species with recruitment and capture

International Nuclear Information System (INIS)

Ladino, Lilia M.; Mammana, Cristiana; Michetti, Elisabetta; Valverde, Jose C.

2016-01-01

This work models and analyzes the dynamics of a two-stage species with recruitment and capture factors. It arises from the discretization of a previous model developed by Ladino and Valverde (2013), which represents a progress in the knowledge of the dynamics of exploited populations. Although the methods used here are related to the study of discrete-time systems and are different from those related to continuous version, the results are similar in both the discrete and the continuous case what confirm the skill in the selection of the factors to design the model. Unlike for the continuous-time case, for the discrete-time one some (non-negative) parametric constraints are derived from the biological significance of the model and become fundamental for the proofs of such results. Finally, numerical simulations show different scenarios of dynamics related to the analytical results which confirm the validity of the model.

State estimation for discrete-time Markovian jumping neural networks with mixed mode-dependent delays

International Nuclear Information System (INIS)

Liu Yurong; Wang Zidong; Liu Xiaohui

2008-01-01

In this Letter, we investigate the state estimation problem for a new class of discrete-time neural networks with Markovian jumping parameters as well as mode-dependent mixed time-delays. The parameters of the discrete-time neural networks are subject to the switching from one mode to another at different times according to a Markov chain, and the mixed time-delays consist of both discrete and distributed delays that are dependent on the Markovian jumping mode. New techniques are developed to deal with the mixed time-delays in the discrete-time setting, and a novel Lyapunov-Krasovskii functional is put forward to reflect the mode-dependent time-delays. Sufficient conditions are established in terms of linear matrix inequalities (LMIs) that guarantee the existence of the state estimators. We show that both the existence conditions and the explicit expression of the desired estimator can be characterized in terms of the solution to an LMI. A numerical example is exploited to show the usefulness of the derived LMI-based conditions

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.

Discrete simulations of spatio-temporal dynamics of small water bodies under varied stream flow discharges

Science.gov (United States)

Daya Sagar, B. S.

2005-01-01

Spatio-temporal patterns of small water bodies (SWBs) under the influence of temporally varied stream flow discharge are simulated in discrete space by employing geomorphologically realistic expansion and contraction transformations. Cascades of expansion-contraction are systematically performed by synchronizing them with stream flow discharge simulated via the logistic map. Templates with definite characteristic information are defined from stream flow discharge pattern as the basis to model the spatio-temporal organization of randomly situated surface water bodies of various sizes and shapes. These spatio-temporal patterns under varied parameters (λs) controlling stream flow discharge patterns are characterized by estimating their fractal dimensions. At various λs, nonlinear control parameters, we show the union of boundaries of water bodies that traverse the water body and non-water body spaces as geomorphic attractors. The computed fractal dimensions of these attractors are 1.58, 1.53, 1.78, 1.76, 1.84, and 1.90, respectively, at λs of 1, 2, 3, 3.46, 3.57, and 3.99. These values are in line with general visual observations.

Discrete simulations of spatio-temporal dynamics of small water bodies under varied stream flow discharges

Directory of Open Access Journals (Sweden)

B. S. Daya Sagar

2005-01-01

Full Text Available Spatio-temporal patterns of small water bodies (SWBs under the influence of temporally varied stream flow discharge are simulated in discrete space by employing geomorphologically realistic expansion and contraction transformations. Cascades of expansion-contraction are systematically performed by synchronizing them with stream flow discharge simulated via the logistic map. Templates with definite characteristic information are defined from stream flow discharge pattern as the basis to model the spatio-temporal organization of randomly situated surface water bodies of various sizes and shapes. These spatio-temporal patterns under varied parameters (λs controlling stream flow discharge patterns are characterized by estimating their fractal dimensions. At various λs, nonlinear control parameters, we show the union of boundaries of water bodies that traverse the water body and non-water body spaces as geomorphic attractors. The computed fractal dimensions of these attractors are 1.58, 1.53, 1.78, 1.76, 1.84, and 1.90, respectively, at λs of 1, 2, 3, 3.46, 3.57, and 3.99. These values are in line with general visual observations.

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

Time varying voltage combustion control and diagnostics sensor

Science.gov (United States)

Chorpening, Benjamin T [Morgantown, WV; Thornton, Jimmy D [Morgantown, WV; Huckaby, E David [Morgantown, WV; Fincham, William [Fairmont, WV

2011-04-19

A time-varying voltage is applied to an electrode, or a pair of electrodes, of a sensor installed in a fuel nozzle disposed adjacent the combustion zone of a continuous combustion system, such as of the gas turbine engine type. The time-varying voltage induces a time-varying current in the flame which is measured and used to determine flame capacitance using AC electrical circuit analysis. Flame capacitance is used to accurately determine the position of the flame from the sensor and the fuel/air ratio. The fuel and/or air flow rate (s) is/are then adjusted to provide reduced flame instability problems such as flashback, combustion dynamics and lean blowout, as well as reduced emissions. The time-varying voltage may be an alternating voltage and the time-varying current may be an alternating current.

A Discrete Events Delay Differential System Model for Transmission of Vancomycin-Resistant Enterococcus (VRE) in Hospitals

Science.gov (United States)

2010-09-19

estimated directly form the surveillance data Infection control measures were implemented in the form of health care worker hand - hygiene before and after...hospital infections , is used to motivate possibilities of modeling nosocomial infec- tion dynamics. This is done in the context of hospital monitoring and...model development. Key Words: Delay equations, discrete events, nosocomial infection dynamics, surveil- lance data, inverse problems, parameter

Local inertial oscillations in the surface ocean generated by time-varying winds

Science.gov (United States)

Chen, Shengli; Polton, Jeff A.; Hu, Jianyu; Xing, Jiuxing

2015-12-01

A new relationship is presented to give a review study on the evolution of inertial oscillations in the surface ocean locally generated by time-varying wind stress. The inertial oscillation is expressed as the superposition of a previous oscillation and a newly generated oscillation, which depends upon the time-varying wind stress. This relationship is employed to investigate some idealized wind change events. For a wind series varying temporally with different rates, the induced inertial oscillation is dominated by the wind with the greatest variation. The resonant wind, which rotates anti-cyclonically at the local inertial frequency with time, produces maximal amplitude of inertial oscillations, which grows monotonically. For the wind rotating at non-inertial frequencies, the responses vary periodically, with wind injecting inertial energy when it is in phase with the currents, but removing inertial energy when it is out of phase. The wind rotating anti-cyclonically with time is much more favorable to generate inertial oscillations than the cyclonic rotating wind. The wind with a frequency closer to the inertial frequency generates stronger inertial oscillations. For a diurnal wind, the induced inertial oscillation is dependent on latitude and is most significant at 30 °. This relationship is also applied to examine idealized moving cyclones. The inertial oscillation is much stronger on the right-hand side of the cyclone path than on the left-hand side (in the northern hemisphere). This is due to the wind being anti-cyclonic with time on the right-hand side, but cyclonic on the other side. The inertial oscillation varies with the cyclone translation speed. The optimal translation speed generating the greatest inertial oscillations is 2 m/s at the latitude of 10 ° and gradually increases to 6 m/s at the latitude of 30 °.

A discrete classical space-time could require 6 extra-dimensions

Science.gov (United States)

Guillemant, Philippe; Medale, Marc; Abid, Cherifa

2018-01-01

We consider a discrete space-time in which conservation laws are computed in such a way that the density of information is kept bounded. We use a 2D billiard as a toy model to compute the uncertainty propagation in ball positions after every shock and the corresponding loss of phase information. Our main result is the computation of a critical time step above which billiard calculations are no longer deterministic, meaning that a multiverse of distinct billiard histories begins to appear, caused by the lack of information. Then, we highlight unexpected properties of this critical time step and the subsequent exponential evolution of the number of histories with time, to observe that after certain duration all billiard states could become possible final states, independent of initial conditions. We conclude that if our space-time is really a discrete one, one would need to introduce extra-dimensions in order to provide supplementary constraints that specify which history should be played.

Quantum circuit dynamics via path integrals: Is there a classical action for discrete-time paths?

Science.gov (United States)

Penney, Mark D.; Enshan Koh, Dax; Spekkens, Robert W.

2017-07-01

It is straightforward to compute the transition amplitudes of a quantum circuit using the sum-over-paths methodology when the gates in the circuit are balanced, where a balanced gate is one for which all non-zero transition amplitudes are of equal magnitude. Here we consider the question of whether, for such circuits, the relative phases of different discrete-time paths through the configuration space can be defined in terms of a classical action, as they are for continuous-time paths. We show how to do so for certain kinds of quantum circuits, namely, Clifford circuits where the elementary systems are continuous-variable systems or discrete systems of odd-prime dimension. These types of circuit are distinguished by having phase-space representations that serve to define their classical counterparts. For discrete systems, the phase-space coordinates are also discrete variables. We show that for each gate in the generating set, one can associate a symplectomorphism on the phase-space and to each of these one can associate a generating function, defined on two copies of the configuration space. For discrete systems, the latter association is achieved using tools from algebraic geometry. Finally, we show that if the action functional for a discrete-time path through a sequence of gates is defined using the sum of the corresponding generating functions, then it yields the correct relative phases for the path-sum expression. These results are likely to be relevant for quantizing physical theories where time is fundamentally discrete, characterizing the classical limit of discrete-time quantum dynamics, and proving complexity results for quantum circuits.

Electrical resistance imaging of a time-varying interface in stratified flows using an unscented Kalman filter

International Nuclear Information System (INIS)

Ijaz, Umer Zeeshan; Khambampati, Anil Kumar; Kim, Kyung Youn; Chung, Soon Il; Kim, Sin

2008-01-01

In this paper, we estimate a time-varying interfacial boundary in stratified flows of two immiscible liquids using electrical resistance tomography. The interfacial boundary is approximated with front points spaced discretely along the interface. The design variables to be estimated are the locations of the front points, which are varying with the moving interface. The inverse problem is treated as a stochastic nonlinear state estimation problem with the nonstationary phase boundary (state) being estimated with the aid of an unscented Kalman filter. Numerical experiments are performed to evaluate the performance of an unscented Kalman filter. Specifically, a detailed analysis has been done on the effect of the number of front points and contrast ratio on the reconstruction performance. The reconstruction results show that an unscented Kalman filter is better suited for estimation in comparison to the conventional extended Kalman filter

Study on the Variation of Groundwater Level under Time-varying Recharge

Science.gov (United States)

Wu, Ming-Chang; Hsieh, Ping-Cheng

2017-04-01

The slopes of the suburbs come to important areas by focusing on the work of soil and water conservation in recent years. The water table inside the aquifer is affected by rainfall, geology and topography, which will result in the change of groundwater discharge and water level. Currently, the way to obtain water table information is to set up the observation wells; however, owing to that the cost of equipment and the wells excavated is too expensive, we develop a mathematical model instead, which might help us to simulate the groundwater level variation. In this study, we will discuss the groundwater level change in a sloping unconfined aquifer with impermeable bottom under time-varying rainfall events. Referring to Child (1971), we employ the Boussinesq equation as the governing equation, and apply the General Integral Transforms Method (GITM) to analyzing the groundwater level after linearizing the Boussinesq equation. After comparing the solution with Verhoest & Troch (2000) and Bansal & Das (2010), we get satisfactory results. To sum up, we have presented an alternative approach to solve the linearized Boussinesq equation for the response of groundwater level in a sloping unconfined aquifer. The present analytical results combine the effect of bottom slope and the time-varying recharge pattern on the water table fluctuations. Owing to the limitation and difficulty of measuring the groundwater level directly, we develop such a mathematical model that we can predict or simulate the variation of groundwater level affected by any rainfall events in advance.

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.

Performance Analysis of Cloud Computing Architectures Using Discrete Event Simulation

Science.gov (United States)

Stocker, John C.; Golomb, Andrew M.

2011-01-01

Cloud computing offers the economic benefit of on-demand resource allocation to meet changing enterprise computing needs. However, the flexibility of cloud computing is disadvantaged when compared to traditional hosting in providing predictable application and service performance. Cloud computing relies on resource scheduling in a virtualized network-centric server environment, which makes static performance analysis infeasible. We developed a discrete event simulation model to evaluate the overall effectiveness of organizations in executing their workflow in traditional and cloud computing architectures. The two part model framework characterizes both the demand using a probability distribution for each type of service request as well as enterprise computing resource constraints. Our simulations provide quantitative analysis to design and provision computing architectures that maximize overall mission effectiveness. We share our analysis of key resource constraints in cloud computing architectures and findings on the appropriateness of cloud computing in various applications.

Quality Improvement With Discrete Event Simulation: A Primer for Radiologists.

Science.gov (United States)

Booker, Michael T; O'Connell, Ryan J; Desai, Bhushan; Duddalwar, Vinay A

2016-04-01

The application of simulation software in health care has transformed quality and process improvement. Specifically, software based on discrete-event simulation (DES) has shown the ability to improve radiology workflows and systems. Nevertheless, despite the successful application of DES in the medical literature, the power and value of simulation remains underutilized. For this reason, the basics of DES modeling are introduced, with specific attention to medical imaging. In an effort to provide readers with the tools necessary to begin their own DES analyses, the practical steps of choosing a software package and building a basic radiology model are discussed. In addition, three radiology system examples are presented, with accompanying DES models that assist in analysis and decision making. Through these simulations, we provide readers with an understanding of the theory, requirements, and benefits of implementing DES in their own radiology practices. Copyright © 2016 American College of Radiology. All rights reserved.

Displacement in the parameter space versus spurious solution of discretization with large time step

International Nuclear Information System (INIS)

Mendes, Eduardo; Letellier, Christophe

2004-01-01

In order to investigate a possible correspondence between differential and difference equations, it is important to possess discretization of ordinary differential equations. It is well known that when differential equations are discretized, the solution thus obtained depends on the time step used. In the majority of cases, such a solution is considered spurious when it does not resemble the expected solution of the differential equation. This often happens when the time step taken into consideration is too large. In this work, we show that, even for quite large time steps, some solutions which do not correspond to the expected ones are still topologically equivalent to solutions of the original continuous system if a displacement in the parameter space is considered. To reduce such a displacement, a judicious choice of the discretization scheme should be made. To this end, a recent discretization scheme, based on the Lie expansion of the original differential equations, proposed by Monaco and Normand-Cyrot will be analysed. Such a scheme will be shown to be sufficient for providing an adequate discretization for quite large time steps compared to the pseudo-period of the underlying dynamics

Zak Phase in Discrete-Time Quantum Walks

OpenAIRE

Puentes, G.; Santillán, O.

2015-01-01

We report on a simple scheme that may present a non-trivial geometric Zak phase ($\\Phi_{Zak}$) structure, which is based on a discrete-time quantum walk architecture. By detecting the Zak phase difference between two trajectories connecting adjacent Dirac points where the quasi-energy gap closes for opposite values of quasi-momentum ($k$), it is possible to identify geometric invariants. These geometric invariants correspond to $|\\Phi_{Zak}^{+(-)}-\\Phi_{Zak}^{-(+)}|=\\pi$ and $|\\Phi_{Zak}^{+(-...

A Parallel Framework with Block Matrices of a Discrete Fourier Transform for Vector-Valued Discrete-Time Signals

Directory of Open Access Journals (Sweden)

Pablo Soto-Quiros

2015-01-01

Full Text Available This paper presents a parallel implementation of a kind of discrete Fourier transform (DFT: the vector-valued DFT. The vector-valued DFT is a novel tool to analyze the spectra of vector-valued discrete-time signals. This parallel implementation is developed in terms of a mathematical framework with a set of block matrix operations. These block matrix operations contribute to analysis, design, and implementation of parallel algorithms in multicore processors. In this work, an implementation and experimental investigation of the mathematical framework are performed using MATLAB with the Parallel Computing Toolbox. We found that there is advantage to use multicore processors and a parallel computing environment to minimize the high execution time. Additionally, speedup increases when the number of logical processors and length of the signal increase.

Quantum cosmology based on discrete Feynman paths

International Nuclear Information System (INIS)

Chew, Geoffrey F.

2002-01-01

Although the rules for interpreting local quantum theory imply discretization of process, Lorentz covariance is usually regarded as precluding time quantization. Nevertheless a time-discretized quantum representation of redshifting spatially-homogeneous universe may be based on discrete-step Feynman paths carrying causal Lorentz-invariant action--paths that not only propagate the wave function but provide a phenomenologically-promising elementary-particle Hilbert-space basis. In a model under development, local path steps are at Planck scale while, at a much larger ''wave-function scale'', global steps separate successive wave-functions. Wave-function spacetime is but a tiny fraction of path spacetime. Electromagnetic and gravitational actions are ''at a distance'' in Wheeler-Feynman sense while strong (color) and weak (isospin) actions, as well as action of particle motion, are ''local'' in a sense paralleling the action of local field theory. ''Nonmaterial'' path segments and ''trivial events'' collaborate to define energy and gravity. Photons coupled to conserved electric charge enjoy privileged model status among elementary fermions and vector bosons. Although real path parameters provide no immediate meaning for ''measurement'', the phase of the complex wave function allows significance for ''information'' accumulated through ''gentle'' electromagnetic events involving charged matter and ''soft'' photons. Through its soft-photon content the wave function is an ''information reservoir''

Supervisor Localization: A Top-Down Approach to Distributed Control of Discrete-Event Systems

International Nuclear Information System (INIS)

Cai, K.; Wonham, W. M.

2009-01-01

A purely distributed control paradigm is proposed for discrete-event systems (DES). In contrast to control by one or more external supervisors, distributed control aims to design built-in strategies for individual agents. First a distributed optimal nonblocking control problem is formulated. To solve it, a top-down localization procedure is developed which systematically decomposes an external supervisor into local controllers while preserving optimality and nonblockingness. An efficient localization algorithm is provided to carry out the computation, and an automated guided vehicles (AGV) example presented for illustration. Finally, the 'easiest' and 'hardest' boundary cases of localization are discussed.

Discrete-Slots Models of Visual Working-Memory Response Times

Science.gov (United States)

Donkin, Christopher; Nosofsky, Robert M.; Gold, Jason M.; Shiffrin, Richard M.

2014-01-01

Much recent research has aimed to establish whether visual working memory (WM) is better characterized by a limited number of discrete all-or-none slots or by a continuous sharing of memory resources. To date, however, researchers have not considered the response-time (RT) predictions of discrete-slots versus shared-resources models. To complement the past research in this field, we formalize a family of mixed-state, discrete-slots models for explaining choice and RTs in tasks of visual WM change detection. In the tasks under investigation, a small set of visual items is presented, followed by a test item in 1 of the studied positions for which a change judgment must be made. According to the models, if the studied item in that position is retained in 1 of the discrete slots, then a memory-based evidence-accumulation process determines the choice and the RT; if the studied item in that position is missing, then a guessing-based accumulation process operates. Observed RT distributions are therefore theorized to arise as probabilistic mixtures of the memory-based and guessing distributions. We formalize an analogous set of continuous shared-resources models. The model classes are tested on individual subjects with both qualitative contrasts and quantitative fits to RT-distribution data. The discrete-slots models provide much better qualitative and quantitative accounts of the RT and choice data than do the shared-resources models, although there is some evidence for “slots plus resources” when memory set size is very small. PMID:24015956

Finite-Horizon $H_\\infty $ Consensus for Multiagent Systems With Redundant Channels via An Observer-Type Event-Triggered Scheme.

Science.gov (United States)

Xu, Wenying; Wang, Zidong; Ho, Daniel W C

2018-05-01

This paper is concerned with the finite-horizon consensus problem for a class of discrete time-varying multiagent systems with external disturbances and missing measurements. To improve the communication reliability, redundant channels are introduced and the corresponding protocol is constructed for the information transmission over redundant channels. An event-triggered scheme is adopted to determine whether the information of agents should be transmitted to their neighbors. Subsequently, an observer-type event-triggered control protocol is proposed based on the latest received neighbors' information. The purpose of the addressed problem is to design a time-varying controller based on the observed information to achieve the consensus performance in a finite horizon. By utilizing a constrained recursive Riccati difference equation approach, some sufficient conditions are obtained to guarantee the consensus performance, and the controller parameters are also designed. Finally, a numerical example is provided to demonstrate the desired reliability of redundant channels and the effectiveness of the event-triggered control protocol.

Power System Event Ranking Using a New Linear Parameter-Varying Modeling with a Wide Area Measurement System-Based Approach

Directory of Open Access Journals (Sweden)

Mohammad Bagher Abolhasani Jabali

2017-07-01

Full Text Available Detecting critical power system events for Dynamic Security Assessment (DSA is required for reliability improvement. The approach proposed in this paper investigates the effects of events on dynamic behavior during nonlinear system response while common approaches use steady-state conditions after events. This paper presents some new and enhanced indices for event ranking based on time-domain simulation and polytopic linear parameter-varying (LPV modeling of a power system. In the proposed approach, a polytopic LPV representation is generated via linearization about some points of the nonlinear dynamic behavior of power system using wide-area measurement system (WAMS concepts and then event ranking is done based on the frequency response of the system models on the vertices. Therefore, the nonlinear behaviors of the system in the time of fault occurrence are considered for events ranking. The proposed algorithm is applied to a power system using nonlinear simulation. The comparison of the results especially in different fault conditions shows the advantages of the proposed approach and indices.

Strong Stability Preserving Property of the Deferred Correction Time Discretization

National Research Council Canada - National Science Library

Liu, Yuan; Shu, Chi-Wang; Zhang, Mengping

2007-01-01

In this paper, we study the strong stability preserving "SSP" property of a class of deferred correction time discretization methods, for solving the method-of-lines schemes approximating hyperbolic...

Recursive smoothers for hidden discrete-time Markov chains

Directory of Open Access Journals (Sweden)

Lakhdar Aggoun

2005-01-01

Full Text Available We consider a discrete-time Markov chain observed through another Markov chain. The proposed model extends models discussed by Elliott et al. (1995. We propose improved recursive formulae to update smoothed estimates of processes related to the model. These recursive estimates are used to update the parameter of the model via the expectation maximization (EM algorithm.

Cycles of a discrete time bipolar artificial neural network

International Nuclear Information System (INIS)

Cheng Suisun; Chen, J.-S.; Yueh, W.-C.

2009-01-01

A discrete time bipolar neural network depending on two parameters is studied. It is observed that its dynamical behaviors can be classified into six cases. For each case, the long time behaviors can be summarized in terms of fixed points, periodic points, basin of attractions, and related initial distributions. Mathematical reasons are supplied for these observations and applications in cellular automata are illustrated.

Quantum circuit dynamics via path integrals: Is there a classical action for discrete-time paths?

International Nuclear Information System (INIS)

Penney, Mark D; Koh, Dax Enshan; Spekkens, Robert W

2017-01-01

It is straightforward to compute the transition amplitudes of a quantum circuit using the sum-over-paths methodology when the gates in the circuit are balanced, where a balanced gate is one for which all non-zero transition amplitudes are of equal magnitude. Here we consider the question of whether, for such circuits, the relative phases of different discrete-time paths through the configuration space can be defined in terms of a classical action, as they are for continuous-time paths. We show how to do so for certain kinds of quantum circuits, namely, Clifford circuits where the elementary systems are continuous-variable systems or discrete systems of odd-prime dimension. These types of circuit are distinguished by having phase-space representations that serve to define their classical counterparts. For discrete systems, the phase-space coordinates are also discrete variables. We show that for each gate in the generating set, one can associate a symplectomorphism on the phase-space and to each of these one can associate a generating function, defined on two copies of the configuration space. For discrete systems, the latter association is achieved using tools from algebraic geometry. Finally, we show that if the action functional for a discrete-time path through a sequence of gates is defined using the sum of the corresponding generating functions, then it yields the correct relative phases for the path-sum expression. These results are likely to be relevant for quantizing physical theories where time is fundamentally discrete, characterizing the classical limit of discrete-time quantum dynamics, and proving complexity results for quantum circuits. (paper)

Timed arrays wideband and time varying antenna arrays

CERN Document Server

Haupt, Randy L

2015-01-01

Introduces timed arrays and design approaches to meet the new high performance standards The author concentrates on any aspect of an antenna array that must be viewed from a time perspective. The first chapters briefly introduce antenna arrays and explain the difference between phased and timed arrays. Since timed arrays are designed for realistic time-varying signals and scenarios, the book also reviews wideband signals, baseband and passband RF signals, polarization and signal bandwidth. Other topics covered include time domain, mutual coupling, wideband elements, and dispersion. The auth

Time dependence linear transport III convergence of the discrete ordinate method

International Nuclear Information System (INIS)

Wilson, D.G.

1983-01-01

In this paper the uniform pointwise convergence of the discrete ordinate method for weak and strong solutions of the time dependent, linear transport equation posed in a multidimensional, rectangular parallelepiped with partially reflecting walls is established. The first result is that a sequence of discrete ordinate solutions converges uniformly on the quadrature points to a solution of the continuous problem provided that the corresponding sequence of truncation errors for the solution of the continuous problem converges to zero in the same manner. The second result is that continuity of the solution with respect to the velocity variables guarantees that the truncation erros in the quadrature formula go the zero and hence that the discrete ordinate approximations converge to the solution of the continuous problem as the discrete ordinate become dense. An existence theory for strong solutions of the the continuous problem follows as a result

Patient flow improvement for an ophthalmic specialist outpatient clinic with aid of discrete event simulation and design of experiment.

Science.gov (United States)

Pan, Chong; Zhang, Dali; Kon, Audrey Wan Mei; Wai, Charity Sue Lea; Ang, Woo Boon

2015-06-01

Continuous improvement in process efficiency for specialist outpatient clinic (SOC) systems is increasingly being demanded due to the growth of the patient population in Singapore. In this paper, we propose a discrete event simulation (DES) model to represent the patient and information flow in an ophthalmic SOC system in the Singapore National Eye Centre (SNEC). Different improvement strategies to reduce the turnaround time for patients in the SOC were proposed and evaluated with the aid of the DES model and the Design of Experiment (DOE). Two strategies for better patient appointment scheduling and one strategy for dilation-free examination are estimated to have a significant impact on turnaround time for patients. One of the improvement strategies has been implemented in the actual SOC system in the SNEC with promising improvement reported.

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

Analysis of Time Discretization and its Effect on Simulation Processes

Directory of Open Access Journals (Sweden)

Gilbert-Rainer Gillich

2006-10-01

Full Text Available The paper presents the influence of time discretization on the results of simulations of technical systems. In this sense the systems are mod-eled using the SciLab/SCICOS environment, using different time inter-vals. Ulterior the processes are simulated and the results are com-pared.

Evolution of colloidal dispersions in novel time-varying optical potentials

Science.gov (United States)

Koss, Brian Alan

Optical traps use forces exerted by a tightly focused light beam to trap objects from tens of nanometers to tens of micrometers in size. Since their introduction in 1986, optical tweezers have become very useful to biology, chemistry, and soft condensed-matter physics. Work presented here, promises to advance optical tweezers not only in fundamental scientific research, but also in applications outside of the laboratory and into the mainstream of miniaturized manufacturing and diagnostics. By providing unprecedented access to the mesoscopic world, a new generation of optical traps, called Dynamic Holographic Optical Tweezers (HOTs) offers revolutionary new opportunities for fundamental and applied research. To demonstrate this technique, HOTs will be used to pump particles via a new method of transport called Optical Peristalsis (OP). OP is efficient method for transporting mesoscopic objects in three dimensions using short repetitive sequences of holographic optical trapping patterns. Transport in this process is analogous to peristaltic pumping, with the configurations of optical traps mimicking states of a peristaltic pump. While not limited to the deterministic particle transport, OP, can also be a platform to investigate the stochastic limit of particle transport. Advances in recent years have demonstrated that a variety of time-varying perturbations can induce drift in a diffusive system without exerting an overall force. Among these, are thermal ratchet models in which the system is subjected to time-varying energy landscapes that break spatiotemporal symmetry and thereby induce drift. Typically, the potential energy landscape is chosen to be the sawtooth potential. This work describes an alternate class of symmetric thermal ratchet models, that are not sawtooth, and demonstrates their efficacy in biasing the diffusion of colloidal spheres in both the stochastic and deterministic limits. Unlike previous models, each state in this thermal ratchet consists of

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.

A dynamic discretization method for reliability inference in Dynamic Bayesian Networks

International Nuclear Information System (INIS)

Zhu, Jiandao; Collette, Matthew

2015-01-01

The material and modeling parameters that drive structural reliability analysis for marine structures are subject to a significant uncertainty. This is especially true when time-dependent degradation mechanisms such as structural fatigue cracking are considered. Through inspection and monitoring, information such as crack location and size can be obtained to improve these parameters and the corresponding reliability estimates. Dynamic Bayesian Networks (DBNs) are a powerful and flexible tool to model dynamic system behavior and update reliability and uncertainty analysis with life cycle data for problems such as fatigue cracking. However, a central challenge in using DBNs is the need to discretize certain types of continuous random variables to perform network inference while still accurately tracking low-probability failure events. Most existing discretization methods focus on getting the overall shape of the distribution correct, with less emphasis on the tail region. Therefore, a novel scheme is presented specifically to estimate the likelihood of low-probability failure events. The scheme is an iterative algorithm which dynamically partitions the discretization intervals at each iteration. Through applications to two stochastic crack-growth example problems, the algorithm is shown to be robust and accurate. Comparisons are presented between the proposed approach and existing methods for the discretization problem. - Highlights: • A dynamic discretization method is developed for low-probability events in DBNs. • The method is compared to existing approaches on two crack growth problems. • The method is shown to improve on existing methods for low-probability events

Discrete time modelization of human pilot behavior

Science.gov (United States)

Cavalli, D.; Soulatges, D.

1975-01-01

This modelization starts from the following hypotheses: pilot's behavior is a time discrete process, he can perform only one task at a time and his operating mode depends on the considered flight subphase. Pilot's behavior was observed using an electro oculometer and a simulator cockpit. A FORTRAN program has been elaborated using two strategies. The first one is a Markovian process in which the successive instrument readings are governed by a matrix of conditional probabilities. In the second one, strategy is an heuristic process and the concepts of mental load and performance are described. The results of the two aspects have been compared with simulation data.

New results on global exponential dissipativity analysis of memristive inertial neural networks with distributed time-varying delays.

Science.gov (United States)

Zhang, Guodong; Zeng, Zhigang; Hu, Junhao

2018-01-01

This paper is concerned with the global exponential dissipativity of memristive inertial neural networks with discrete and distributed time-varying delays. By constructing appropriate Lyapunov-Krasovskii functionals, some new sufficient conditions ensuring global exponential dissipativity of memristive inertial neural networks are derived. Moreover, the globally exponential attractive sets and positive invariant sets are also presented here. In addition, the new proposed results here complement and extend the earlier publications on conventional or memristive neural network dynamical systems. Finally, numerical simulations are given to illustrate the effectiveness of obtained results. Copyright © 2017 Elsevier Ltd. All rights reserved.

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

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

Generation and monitoring of discrete stable random processes using multiple immigration population models

Energy Technology Data Exchange (ETDEWEB)

Matthews, J O; Hopcraft, K I; Jakeman, E [Applied Mathematics Division, School of Mathematical Sciences, University of Nottingham, Nottingham, NG7 2RD (United Kingdom)

2003-11-21

Some properties of classical population processes that comprise births, deaths and multiple immigrations are investigated. The rates at which the immigrants arrive can be tailored to produce a population whose steady state fluctuations are described by a pre-selected distribution. Attention is focused on the class of distributions with a discrete stable law, which have power-law tails and whose moments and autocorrelation function do not exist. The separate problem of monitoring and characterizing the fluctuations is studied, analysing the statistics of individuals that leave the population. The fluctuations in the size of the population are transferred to the times between emigrants that form an intermittent time series of events. The emigrants are counted with a detector of finite dynamic range and response time. This is modelled through clipping the time series or saturating it at an arbitrary but finite level, whereupon its moments and correlation properties become finite. Distributions for the time to the first counted event and for the time between events exhibit power-law regimes that are characteristic of the fluctuations in population size. The processes provide analytical models with which properties of complex discrete random phenomena can be explored, and in addition provide generic means by which random time series encompassing a wide range of intermittent and other discrete random behaviour may be generated.

Generation and monitoring of discrete stable random processes using multiple immigration population models

International Nuclear Information System (INIS)

Matthews, J O; Hopcraft, K I; Jakeman, E

2003-01-01

Some properties of classical population processes that comprise births, deaths and multiple immigrations are investigated. The rates at which the immigrants arrive can be tailored to produce a population whose steady state fluctuations are described by a pre-selected distribution. Attention is focused on the class of distributions with a discrete stable law, which have power-law tails and whose moments and autocorrelation function do not exist. The separate problem of monitoring and characterizing the fluctuations is studied, analysing the statistics of individuals that leave the population. The fluctuations in the size of the population are transferred to the times between emigrants that form an intermittent time series of events. The emigrants are counted with a detector of finite dynamic range and response time. This is modelled through clipping the time series or saturating it at an arbitrary but finite level, whereupon its moments and correlation properties become finite. Distributions for the time to the first counted event and for the time between events exhibit power-law regimes that are characteristic of the fluctuations in population size. The processes provide analytical models with which properties of complex discrete random phenomena can be explored, and in addition provide generic means by which random time series encompassing a wide range of intermittent and other discrete random behaviour may be generated

Modification of the SAS4A Safety Analysis Code for Integration with the ADAPT Discrete Dynamic Event Tree Framework.

Energy Technology Data Exchange (ETDEWEB)

Jankovsky, Zachary Kyle [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Denman, Matthew R. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

2017-05-01

It is difficult to assess the consequences of a transient in a sodium-cooled fast reactor (SFR) using traditional probabilistic risk assessment (PRA) methods, as numerous safety-related sys- tems have passive characteristics. Often there is significant dependence on the value of con- tinuous stochastic parameters rather than binary success/failure determinations. One form of dynamic PRA uses a system simulator to represent the progression of a transient, tracking events through time in a discrete dynamic event tree (DDET). In order to function in a DDET environment, a simulator must have characteristics that make it amenable to changing physical parameters midway through the analysis. The SAS4A SFR system analysis code did not have these characteristics as received. This report describes the code modifications made to allow dynamic operation as well as the linking to a Sandia DDET driver code. A test case is briefly described to demonstrate the utility of the changes.

Single Versus Multiple Events Error Potential Detection in a BCI-Controlled Car Game With Continuous and Discrete Feedback.

Science.gov (United States)

Kreilinger, Alex; Hiebel, Hannah; Müller-Putz, Gernot R

2016-03-01

This work aimed to find and evaluate a new method for detecting errors in continuous brain-computer interface (BCI) applications. Instead of classifying errors on a single-trial basis, the new method was based on multiple events (MEs) analysis to increase the accuracy of error detection. In a BCI-driven car game, based on motor imagery (MI), discrete events were triggered whenever subjects collided with coins and/or barriers. Coins counted as correct events, whereas barriers were errors. This new method, termed ME method, combined and averaged the classification results of single events (SEs) and determined the correctness of MI trials, which consisted of event sequences instead of SEs. The benefit of this method was evaluated in an offline simulation. In an online experiment, the new method was used to detect erroneous MI trials. Such MI trials were discarded and could be repeated by the users. We found that, even with low SE error potential (ErrP) detection rates, feasible accuracies can be achieved when combining MEs to distinguish erroneous from correct MI trials. Online, all subjects reached higher scores with error detection than without, at the cost of longer times needed for completing the game. Findings suggest that ErrP detection may become a reliable tool for monitoring continuous states in BCI applications when combining MEs. This paper demonstrates a novel technique for detecting errors in online continuous BCI applications, which yields promising results even with low single-trial detection rates.

A new time-adaptive discrete bionic wavelet transform for enhancing speech from adverse noise environment

Science.gov (United States)

Palaniswamy, Sumithra; Duraisamy, Prakash; Alam, Mohammad Showkat; Yuan, Xiaohui

2012-04-01

Automatic speech processing systems are widely used in everyday life such as mobile communication, speech and speaker recognition, and for assisting the hearing impaired. In speech communication systems, the quality and intelligibility of speech is of utmost importance for ease and accuracy of information exchange. To obtain an intelligible speech signal and one that is more pleasant to listen, noise reduction is essential. In this paper a new Time Adaptive Discrete Bionic Wavelet Thresholding (TADBWT) scheme is proposed. The proposed technique uses Daubechies mother wavelet to achieve better enhancement of speech from additive non- stationary noises which occur in real life such as street noise and factory noise. Due to the integration of human auditory system model into the wavelet transform, bionic wavelet transform (BWT) has great potential for speech enhancement which may lead to a new path in speech processing. In the proposed technique, at first, discrete BWT is applied to noisy speech to derive TADBWT coefficients. Then the adaptive nature of the BWT is captured by introducing a time varying linear factor which updates the coefficients at each scale over time. This approach has shown better performance than the existing algorithms at lower input SNR due to modified soft level dependent thresholding on time adaptive coefficients. The objective and subjective test results confirmed the competency of the TADBWT technique. The effectiveness of the proposed technique is also evaluated for speaker recognition task under noisy environment. The recognition results show that the TADWT technique yields better performance when compared to alternate methods specifically at lower input SNR.

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.

Scaled Bilateral Teleoperation Using Discrete-Time Sliding-Mode Controller

NARCIS (Netherlands)

Khan, S.; Sabanovic, A.; Nergiz, A.O.

2009-01-01

In this paper, the design of a discrete-time sliding-mode controller based on Lyapunov theory is presented along with a robust disturbance observer and is applied to a piezostage for high-precision motion. A linear model of a piezostage was used with nominal parameters to compensate the disturbance

First-order discrete Faddeev gravity at strongly varying fields

Science.gov (United States)

Khatsymovsky, V. M.

2017-11-01

We consider the Faddeev formulation of general relativity (GR), which can be characterized by a kind of d-dimensional tetrad (typically d = 10) and a non-Riemannian connection. This theory is invariant w.r.t. the global, but not local, rotations in the d-dimensional space. There can be configurations with a smooth or flat metric, but with the tetrad that changes abruptly at small distances, a kind of “antiferromagnetic” structure. Previously, we discussed a first-order representation for the Faddeev gravity, which uses the orthogonal connection in the d-dimensional space as an independent variable. Using the discrete form of this formulation, we considered the spectrum of (elementary) area. This spectrum turns out to be physically reasonable just on a classical background with large connection like rotations by π, that is, with such an “antiferromagnetic” structure. In the discrete first-order Faddeev gravity, we consider such a structure with periodic cells and large connection and strongly changing tetrad field inside the cell. We show that this system in the continuum limit reduces to a generalization of the Faddeev system. The action is a sum of related actions of the Faddeev type and is still reduced to the GR action.

Mediation analysis with time varying exposures and mediators.

Science.gov (United States)

VanderWeele, Tyler J; Tchetgen Tchetgen, Eric J

2017-06-01

In this paper we consider causal mediation analysis when exposures and mediators vary over time. We give non-parametric identification results, discuss parametric implementation, and also provide a weighting approach to direct and indirect effects based on combining the results of two marginal structural models. We also discuss how our results give rise to a causal interpretation of the effect estimates produced from longitudinal structural equation models. When there are time-varying confounders affected by prior exposure and mediator, natural direct and indirect effects are not identified. However, we define a randomized interventional analogue of natural direct and indirect effects that are identified in this setting. The formula that identifies these effects we refer to as the "mediational g-formula." When there is no mediation, the mediational g-formula reduces to Robins' regular g-formula for longitudinal data. When there are no time-varying confounders affected by prior exposure and mediator values, then the mediational g-formula reduces to a longitudinal version of Pearl's mediation formula. However, the mediational g-formula itself can accommodate both mediation and time-varying confounders and constitutes a general approach to mediation analysis with time-varying exposures and mediators.

A PC-based discrete event simulation model of the civilian radioactive waste management system

International Nuclear Information System (INIS)

Airth, G.L.; Joy, D.S.; Nehls, J.W.

1992-01-01

This paper discusses a System Simulation Model which has been developed for the Department of Energy to simulate the movement of individual waste packages (spent fuel assemblies and fuel containers) through the Civilian Radioactive Waste Management System (CRWMS). A discrete event simulation language, GPSS/PC, which runs on an IBM/PC and operates under DOS 5.0, mathematically represents the movement and processing of radioactive waste packages through the CRWMS and the interaction of these packages with the equipment in the various facilities. The major features of the System Simulation Model are: the ability to reference characteristics of the different types of radioactive waste (age, burnup, etc.) in order to make operational and/or system design decisions, the ability to place stochastic variations on operational parameters such as processing time and equipment outages, and the ability to include a rigorous simulation of the transportation system. Output from the model includes the numbers, types, and characteristics of waste packages at selected points in the CRWMS and the extent to which various resources will be utilized in order to transport, process, and emplace the waste

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.

Simple dead-time corrections for discrete time series of non-Poisson data

International Nuclear Information System (INIS)

Larsen, Michael L; Kostinski, Alexander B

2009-01-01

The problem of dead time (instrumental insensitivity to detectable events due to electronic or mechanical reset time) is considered. Most existing algorithms to correct for event count errors due to dead time implicitly rely on Poisson counting statistics of the underlying phenomena. However, when the events to be measured are clustered in time, the Poisson statistics assumption results in underestimating both the true event count and any statistics associated with count variability; the 'busiest' part of the signal is partially missed. Using the formalism associated with the pair-correlation function, we develop first-order correction expressions for the general case of arbitrary counting statistics. The results are verified through simulation of a realistic clustering scenario

DROpS: an object of learning in computer simulation of discrete events

Directory of Open Access Journals (Sweden)

Hugo Alves Silva Ribeiro

2015-09-01

Full Text Available This work presents the “Realistic Dynamics Of Simulated Operations” (DROpS, the name given to the dynamics using the “dropper” device as an object of teaching and learning. The objective is to present alternatives for professors teaching content related to simulation of discrete events to graduate students in production engineering. The aim is to enable students to develop skills related to data collection, modeling, statistical analysis, and interpretation of results. This dynamic has been developed and applied to the students by placing them in a situation analogous to a real industry, where various concepts related to computer simulation were discussed, allowing the students to put these concepts into practice in an interactive manner, thus facilitating learning

Discrete-time BAM neural networks with variable delays

Science.gov (United States)

Liu, Xin-Ge; Tang, Mei-Lan; Martin, Ralph; Liu, Xin-Bi

2007-07-01

This Letter deals with the global exponential stability of discrete-time bidirectional associative memory (BAM) neural networks with variable delays. Using a Lyapunov functional, and linear matrix inequality techniques (LMI), we derive a new delay-dependent exponential stability criterion for BAM neural networks with variable delays. As this criterion has no extra constraints on the variable delay functions, it can be applied to quite general BAM neural networks with a broad range of time delay functions. It is also easy to use in practice. An example is provided to illustrate the theoretical development.

Discrete-time BAM neural networks with variable delays

International Nuclear Information System (INIS)

Liu Xinge; Tang Meilan; Martin, Ralph; Liu Xinbi

2007-01-01

This Letter deals with the global exponential stability of discrete-time bidirectional associative memory (BAM) neural networks with variable delays. Using a Lyapunov functional, and linear matrix inequality techniques (LMI), we derive a new delay-dependent exponential stability criterion for BAM neural networks with variable delays. As this criterion has no extra constraints on the variable delay functions, it can be applied to quite general BAM neural networks with a broad range of time delay functions. It is also easy to use in practice. An example is provided to illustrate the theoretical development

A Class of Prediction-Correction Methods for Time-Varying Convex Optimization

Science.gov (United States)

Simonetto, Andrea; Mokhtari, Aryan; Koppel, Alec; Leus, Geert; Ribeiro, Alejandro

2016-09-01

This paper considers unconstrained convex optimization problems with time-varying objective functions. We propose algorithms with a discrete time-sampling scheme to find and track the solution trajectory based on prediction and correction steps, while sampling the problem data at a constant rate of $1/h$, where $h$ is the length of the sampling interval. The prediction step is derived by analyzing the iso-residual dynamics of the optimality conditions. The correction step adjusts for the distance between the current prediction and the optimizer at each time step, and consists either of one or multiple gradient steps or Newton steps, which respectively correspond to the gradient trajectory tracking (GTT) or Newton trajectory tracking (NTT) algorithms. Under suitable conditions, we establish that the asymptotic error incurred by both proposed methods behaves as $O(h^2)$, and in some cases as $O(h^4)$, which outperforms the state-of-the-art error bound of $O(h)$ for correction-only methods in the gradient-correction step. Moreover, when the characteristics of the objective function variation are not available, we propose approximate gradient and Newton tracking algorithms (AGT and ANT, respectively) that still attain these asymptotical error bounds. Numerical simulations demonstrate the practical utility of the proposed methods and that they improve upon existing techniques by several orders of magnitude.

Using Discrete Event Simulation for Programming Model Exploration at Extreme-Scale: Macroscale Components for the Structural Simulation Toolkit (SST).

Energy Technology Data Exchange (ETDEWEB)

Wilke, Jeremiah J [Sandia National Laboratories (SNL-CA), Livermore, CA (United States); Kenny, Joseph P. [Sandia National Laboratories (SNL-CA), Livermore, CA (United States)

2015-02-01

Discrete event simulation provides a powerful mechanism for designing and testing new extreme- scale programming models for high-performance computing. Rather than debug, run, and wait for results on an actual system, design can first iterate through a simulator. This is particularly useful when test beds cannot be used, i.e. to explore hardware or scales that do not yet exist or are inaccessible. Here we detail the macroscale components of the structural simulation toolkit (SST). Instead of depending on trace replay or state machines, the simulator is architected to execute real code on real software stacks. Our particular user-space threading framework allows massive scales to be simulated even on small clusters. The link between the discrete event core and the threading framework allows interesting performance metrics like call graphs to be collected from a simulated run. Performance analysis via simulation can thus become an important phase in extreme-scale programming model and runtime system design via the SST macroscale components.

Dynamics of continuous-time bidirectional associative memory neural networks with impulses and their discrete counterparts

International Nuclear Information System (INIS)

Huo Haifeng; Li Wantong

2009-01-01

This paper is concerned with the global stability characteristics of a system of equations modelling the dynamics of continuous-time bidirectional associative memory neural networks with impulses. Sufficient conditions which guarantee the existence of a unique equilibrium and its exponential stability of the networks are obtained. For the goal of computation, discrete-time analogues of the corresponding continuous-time bidirectional associative memory neural networks with impulses are also formulated and studied. Our results show that the above continuous-time and discrete-time systems with impulses preserve the dynamics of the networks without impulses when we make some modifications and impose some additional conditions on the systems, the convergence characteristics dynamics of the networks are preserved by both continuous-time and discrete-time systems with some restriction imposed on the impulse effect.

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.

Assessment of bidirectional influences between family relationships and adolescent problem behavior: Discrete versus continuous time analysis

NARCIS (Netherlands)

Delsing, M.J.M.H.; Oud, J.H.L.; Bruyn, E.E.J. De

2005-01-01

In family research, bidirectional influences between the family and the individual are usually analyzed in discrete time. Results from discrete time analysis, however, have been shown to be highly dependent on the length of the observation interval. Continuous time analysis using stochastic

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.

Mixed Discretization of the Time Domain MFIE at Low Frequencies

KAUST Repository

Ulku, Huseyin Arda; Bogaert, Ignace; Cools, Kristof; Andriulli, Francesco Paolo; Bagci, Hakan

2017-01-01

stems from the classical MOT scheme’s failure to predict the correct scaling of the current’s Helmholtz components for large time steps. A recently proposed mixed discretization strategy is used to alleviate the inaccuracy problem by restoring

Time-discrete higher order ALE formulations: a priori error analysis

KAUST Repository

Bonito, Andrea; Kyza, Irene; Nochetto, Ricardo H.

2013-01-01

We derive optimal a priori error estimates for discontinuous Galerkin (dG) time discrete schemes of any order applied to an advection-diffusion model defined on moving domains and written in the Arbitrary Lagrangian Eulerian (ALE) framework. Our

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.

Non-equilibrium effects of core-cooling and time-dependent internal heating on mantle flush events

Directory of Open Access Journals (Sweden)

D. A. Yuen

1995-01-01

Full Text Available We have examined the non-equilibrium effects of core-cooling and time-dependent internal-heating on the thermal evolution of the Earth's mantle and on mantle flush events caused by the two major phase transitions. Both two- and three-dimensional models have been employed. The mantle viscosity responds to the secular cooling through changes in the averaged temperature field. A viscosity which decreases algebraically with the average temperature has been considered. The time-dependent internal-heating is prescribed to decrease exponentially with a single decay time. We have studied the thermal histories with initial Rayleigh numbers between 2 x 107 and 108 . Flush events, driven by the non-equilibrium forcings, are much more dramatic than those produced by the equilibrium boundary conditions and constant internal heating. Multiple flush events are found under non-equilibrium conditions in which there is very little internal heating or very fast decay rates of internal-heating. Otherwise, the flush events take place in a relatively continuous fashion. Prior to massive flush events small-scale percolative structures appear in the 3D temperature fields. Time-dependent signatures, such as the surface heat flux, also exhibits high frequency oscillatory patterns prior to massive flush events. These two observations suggest that the flush event may be a self-organized critical phenomenon. The Nusselt number as a function of the time-varying Ra does not follow the Nusselt vs. Rayleigh number power-law relationship based on equilibrium (constant temperature boundary conditions. Instead Nu(t may vary non-monotonically with time because of the mantle flush events. Convective processes in the mantle operate quite differently under non-equilibrium conditions from its behaviour under the usual equilibrium situations.

Neural Network Based Finite-Time Stabilization for Discrete-Time Markov Jump Nonlinear Systems with Time Delays

Directory of Open Access Journals (Sweden)

Fei Chen

2013-01-01

Full Text Available This paper deals with the finite-time stabilization problem for discrete-time Markov jump nonlinear systems with time delays and norm-bounded exogenous disturbance. The nonlinearities in different jump modes are parameterized by neural networks. Subsequently, a linear difference inclusion state space representation for a class of neural networks is established. Based on this, sufficient conditions are derived in terms of linear matrix inequalities to guarantee stochastic finite-time boundedness and stochastic finite-time stabilization of the closed-loop system. A numerical example is illustrated to verify the efficiency of the proposed technique.

Remaining useful life estimation for deteriorating systems with time-varying operational conditions and condition-specific failure zones

Directory of Open Access Journals (Sweden)

Li Qi

2016-06-01

Full Text Available Dynamic time-varying operational conditions pose great challenge to the estimation of system remaining useful life (RUL for the deteriorating systems. This paper presents a method based on probabilistic and stochastic approaches to estimate system RUL for periodically monitored degradation processes with dynamic time-varying operational conditions and condition-specific failure zones. The method assumes that the degradation rate is influenced by specific operational condition and moreover, the transition between different operational conditions plays the most important role in affecting the degradation process. These operational conditions are assumed to evolve as a discrete-time Markov chain (DTMC. The failure thresholds are also determined by specific operational conditions and described as different failure zones. The 2008 PHM Conference Challenge Data is utilized to illustrate our method, which contains mass sensory signals related to the degradation process of a commercial turbofan engine. The RUL estimation method using the sensor measurements of a single sensor was first developed, and then multiple vital sensors were selected through a particular optimization procedure in order to increase the prediction accuracy. The effectiveness and advantages of the proposed method are presented in a comparison with existing methods for the same dataset.

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…

Equilibrium and response properties of the integrate-and-fire neuron in discrete time

Directory of Open Access Journals (Sweden)