WorldWideScience

Sample records for discrete dynamic programming

  1. SPATIAL SEARCH IN COMMERCIAL FISHING: A DISCRETE CHOICE DYNAMIC PROGRAMMING APPROACH

    OpenAIRE

    Smith, Martin D.; Provencher, Bill

    2003-01-01

    We specify a discrete choice dynamic programming model of commercial fishing participation and location choices. This approach allows us to examine how fishermen collect information about resource abundance and whether their behavior is forward-looking.

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

    Science.gov (United States)

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

    2017-07-01

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

  3. Discrete Globalised Dual Heuristic Dynamic Programming in Control of the Two-Wheeled Mobile Robot

    OpenAIRE

    Marcin Szuster; Zenon Hendzel

    2014-01-01

    Network-based control systems have been emerging technologies in the control of nonlinear systems over the past few years. This paper focuses on the implementation of the approximate dynamic programming algorithm in the network-based tracking control system of the two-wheeled mobile robot, Pioneer 2-DX. The proposed discrete tracking control system consists of the globalised dual heuristic dynamic programming algorithm, the PD controller, the supervisory term, and an additional control signal...

  4. Discrete Time McKean–Vlasov Control Problem: A Dynamic Programming Approach

    Energy Technology Data Exchange (ETDEWEB)

    Pham, Huyên, E-mail: pham@math.univ-paris-diderot.fr; Wei, Xiaoli, E-mail: tyswxl@gmail.com [Laboratoire de Probabilités et Modèles Aléatoires, CNRS, UMR 7599, Université Paris Diderot (France)

    2016-12-15

    We consider the stochastic optimal control problem of nonlinear mean-field systems in discrete time. We reformulate the problem into a deterministic control problem with marginal distribution as controlled state variable, and prove that dynamic programming principle holds in its general form. We apply our method for solving explicitly the mean-variance portfolio selection and the multivariate linear-quadratic McKean–Vlasov control problem.

  5. Discrete Time McKean–Vlasov Control Problem: A Dynamic Programming Approach

    International Nuclear Information System (INIS)

    Pham, Huyên; Wei, Xiaoli

    2016-01-01

    We consider the stochastic optimal control problem of nonlinear mean-field systems in discrete time. We reformulate the problem into a deterministic control problem with marginal distribution as controlled state variable, and prove that dynamic programming principle holds in its general form. We apply our method for solving explicitly the mean-variance portfolio selection and the multivariate linear-quadratic McKean–Vlasov control problem.

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

  7. Taylor O(h³) Discretization of ZNN Models for Dynamic Equality-Constrained Quadratic Programming With Application to Manipulators.

    Science.gov (United States)

    Liao, Bolin; Zhang, Yunong; Jin, Long

    2016-02-01

    In this paper, a new Taylor-type numerical differentiation formula is first presented to discretize the continuous-time Zhang neural network (ZNN), and obtain higher computational accuracy. Based on the Taylor-type formula, two Taylor-type discrete-time ZNN models (termed Taylor-type discrete-time ZNNK and Taylor-type discrete-time ZNNU models) are then proposed and discussed to perform online dynamic equality-constrained quadratic programming. For comparison, Euler-type discrete-time ZNN models (called Euler-type discrete-time ZNNK and Euler-type discrete-time ZNNU models) and Newton iteration, with interesting links being found, are also presented. It is proved herein that the steady-state residual errors of the proposed Taylor-type discrete-time ZNN models, Euler-type discrete-time ZNN models, and Newton iteration have the patterns of O(h(3)), O(h(2)), and O(h), respectively, with h denoting the sampling gap. Numerical experiments, including the application examples, are carried out, of which the results further substantiate the theoretical findings and the efficacy of Taylor-type discrete-time ZNN models. Finally, the comparisons with Taylor-type discrete-time derivative model and other Lagrange-type discrete-time ZNN models for dynamic equality-constrained quadratic programming substantiate the superiority of the proposed Taylor-type discrete-time ZNN models once again.

  8. Discrete dynamics versus analytic dynamics

    DEFF Research Database (Denmark)

    Toxværd, Søren

    2014-01-01

    For discrete classical Molecular dynamics obtained by the “Verlet” algorithm (VA) with the time increment h there exists a shadow Hamiltonian H˜ with energy E˜(h) , for which the discrete particle positions lie on the analytic trajectories for H˜ . Here, we proof that there, independent...... of such an analytic analogy, exists an exact hidden energy invariance E * for VA dynamics. The fact that the discrete VA dynamics has the same invariances as Newtonian dynamics raises the question, which of the formulations that are correct, or alternatively, the most appropriate formulation of classical dynamics....... In this context the relation between the discrete VA dynamics and the (general) discrete dynamics investigated by Lee [Phys. Lett. B122, 217 (1983)] is presented and discussed....

  9. Discrete Globalised Dual Heuristic Dynamic Programming in Control of the Two-Wheeled Mobile Robot

    Directory of Open Access Journals (Sweden)

    Marcin Szuster

    2014-01-01

    Full Text Available Network-based control systems have been emerging technologies in the control of nonlinear systems over the past few years. This paper focuses on the implementation of the approximate dynamic programming algorithm in the network-based tracking control system of the two-wheeled mobile robot, Pioneer 2-DX. The proposed discrete tracking control system consists of the globalised dual heuristic dynamic programming algorithm, the PD controller, the supervisory term, and an additional control signal. The structure of the supervisory term derives from the stability analysis realised using the Lyapunov stability theorem. The globalised dual heuristic dynamic programming algorithm consists of two structures: the actor and the critic, realised in a form of neural networks. The actor generates the suboptimal control law, while the critic evaluates the realised control strategy by approximation of value function from the Bellman’s equation. The presented discrete tracking control system works online, the neural networks’ weights adaptation process is realised in every iteration step, and the neural networks preliminary learning procedure is not required. The performance of the proposed control system was verified by a series of computer simulations and experiments realised using the wheeled mobile robot Pioneer 2-DX.

  10. Discrete Dynamics Lab

    Science.gov (United States)

    Wuensche, Andrew

    DDLab is interactive graphics software for creating, visualizing, and analyzing many aspects of Cellular Automata, Random Boolean Networks, and Discrete Dynamical Networks in general and studying their behavior, both from the time-series perspective — space-time patterns, and from the state-space perspective — attractor basins. DDLab is relevant to research, applications, and education in the fields of complexity, self-organization, emergent phenomena, chaos, collision-based computing, neural networks, content addressable memory, genetic regulatory networks, dynamical encryption, generative art and music, and the study of the abstract mathematical/physical/dynamical phenomena in their own right.

  11. Adaptive dynamic programming for discrete-time linear quadratic regulation based on multirate generalised policy iteration

    Science.gov (United States)

    Chun, Tae Yoon; Lee, Jae Young; Park, Jin Bae; Choi, Yoon Ho

    2018-06-01

    In this paper, we propose two multirate generalised policy iteration (GPI) algorithms applied to discrete-time linear quadratic regulation problems. The proposed algorithms are extensions of the existing GPI algorithm that consists of the approximate policy evaluation and policy improvement steps. The two proposed schemes, named heuristic dynamic programming (HDP) and dual HDP (DHP), based on multirate GPI, use multi-step estimation (M-step Bellman equation) at the approximate policy evaluation step for estimating the value function and its gradient called costate, respectively. Then, we show that these two methods with the same update horizon can be considered equivalent in the iteration domain. Furthermore, monotonically increasing and decreasing convergences, so called value iteration (VI)-mode and policy iteration (PI)-mode convergences, are proved to hold for the proposed multirate GPIs. Further, general convergence properties in terms of eigenvalues are also studied. The data-driven online implementation methods for the proposed HDP and DHP are demonstrated and finally, we present the results of numerical simulations performed to verify the effectiveness of the proposed methods.

  12. Value Iteration Adaptive Dynamic Programming for Optimal Control of Discrete-Time Nonlinear Systems.

    Science.gov (United States)

    Wei, Qinglai; Liu, Derong; Lin, Hanquan

    2016-03-01

    In this paper, a value iteration adaptive dynamic programming (ADP) algorithm is developed to solve infinite horizon undiscounted optimal control problems for discrete-time nonlinear systems. The present value iteration ADP algorithm permits an arbitrary positive semi-definite function to initialize the algorithm. A novel convergence analysis is developed to guarantee that the iterative value function converges to the optimal performance index function. Initialized by different initial functions, it is proven that the iterative value function will be monotonically nonincreasing, monotonically nondecreasing, or nonmonotonic and will converge to the optimum. In this paper, for the first time, the admissibility properties of the iterative control laws are developed for value iteration algorithms. It is emphasized that new termination criteria are established to guarantee the effectiveness of the iterative control laws. Neural networks are used to approximate the iterative value function and compute the iterative control law, respectively, for facilitating the implementation of the iterative ADP algorithm. Finally, two simulation examples are given to illustrate the performance of the present method.

  13. Adaptive Dynamic Programming for Discrete-Time Zero-Sum Games.

    Science.gov (United States)

    Wei, Qinglai; Liu, Derong; Lin, Qiao; Song, Ruizhuo

    2018-04-01

    In this paper, a novel adaptive dynamic programming (ADP) algorithm, called "iterative zero-sum ADP algorithm," is developed to solve infinite-horizon discrete-time two-player zero-sum games of nonlinear systems. The present iterative zero-sum ADP algorithm permits arbitrary positive semidefinite functions to initialize the upper and lower iterations. A novel convergence analysis is developed to guarantee the upper and lower iterative value functions to converge to the upper and lower optimums, respectively. When the saddle-point equilibrium exists, it is emphasized that both the upper and lower iterative value functions are proved to converge to the optimal solution of the zero-sum game, where the existence criteria of the saddle-point equilibrium are not required. If the saddle-point equilibrium does not exist, the upper and lower optimal performance index functions are obtained, respectively, where the upper and lower performance index functions are proved to be not equivalent. Finally, simulation results and comparisons are shown to illustrate the performance of the present method.

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

    KAUST Repository

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

    2011-01-01

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

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

    International Nuclear Information System (INIS)

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

    2014-01-01

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

  16. Discrete-Time Nonzero-Sum Games for Multiplayer Using Policy-Iteration-Based Adaptive Dynamic Programming Algorithms.

    Science.gov (United States)

    Zhang, Huaguang; Jiang, He; Luo, Chaomin; Xiao, Geyang

    2017-10-01

    In this paper, we investigate the nonzero-sum games for a class of discrete-time (DT) nonlinear systems by using a novel policy iteration (PI) adaptive dynamic programming (ADP) method. The main idea of our proposed PI scheme is to utilize the iterative ADP algorithm to obtain the iterative control policies, which not only ensure the system to achieve stability but also minimize the performance index function for each player. This paper integrates game theory, optimal control theory, and reinforcement learning technique to formulate and handle the DT nonzero-sum games for multiplayer. First, we design three actor-critic algorithms, an offline one and two online ones, for the PI scheme. Subsequently, neural networks are employed to implement these algorithms and the corresponding stability analysis is also provided via the Lyapunov theory. Finally, a numerical simulation example is presented to demonstrate the effectiveness of our proposed approach.

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

    KAUST Repository

    Kouramas, K.I.

    2011-08-01

    This work presents a new algorithm for solving the explicit/multi- parametric model predictive control (or mp-MPC) problem for linear, time-invariant discrete-time systems, based on dynamic programming and multi-parametric programming techniques. The algorithm features two key steps: (i) a dynamic programming step, in which the mp-MPC problem is decomposed into a set of smaller subproblems in which only the current control, state variables, and constraints are considered, and (ii) a multi-parametric programming step, in which each subproblem is solved as a convex multi-parametric programming problem, to derive the control variables as an explicit function of the states. The key feature of the proposed method is that it overcomes potential limitations of previous methods for solving multi-parametric programming problems with dynamic programming, such as the need for global optimization for each subproblem of the dynamic programming step. © 2011 Elsevier Ltd. All rights reserved.

  18. Ensemble simulations with discrete classical dynamics

    DEFF Research Database (Denmark)

    Toxværd, Søren

    2013-01-01

    For discrete classical Molecular dynamics (MD) obtained by the "Verlet" algorithm (VA) with the time increment $h$ there exist a shadow Hamiltonian $\\tilde{H}$ with energy $\\tilde{E}(h)$, for which the discrete particle positions lie on the analytic trajectories for $\\tilde{H}$. $\\tilde......{E}(h)$ is employed to determine the relation with the corresponding energy, $E$ for the analytic dynamics with $h=0$ and the zero-order estimate $E_0(h)$ of the energy for discrete dynamics, appearing in the literature for MD with VA. We derive a corresponding time reversible VA algorithm for canonical dynamics...

  19. Causal Dynamics of Discrete Surfaces

    Directory of Open Access Journals (Sweden)

    Pablo Arrighi

    2014-03-01

    Full Text Available We formalize the intuitive idea of a labelled discrete surface which evolves in time, subject to two natural constraints: the evolution does not propagate information too fast; and it acts everywhere the same.

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

  1. Attractors for discrete periodic dynamical systems

    Science.gov (United States)

    John E. Franke; James F. Selgrade

    2003-01-01

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

  2. Chaos for Discrete Dynamical System

    Directory of Open Access Journals (Sweden)

    Lidong Wang

    2013-01-01

    Full Text Available We prove that a dynamical system is chaotic in the sense of Martelli and Wiggins, when it is a transitive distributively chaotic in a sequence. Then, we give a sufficient condition for the dynamical system to be chaotic in the strong sense of Li-Yorke. We also prove that a dynamical system is distributively chaotic in a sequence, when it is chaotic in the strong sense of Li-Yorke.

  3. Discrete dynamics in transitional economies

    Directory of Open Access Journals (Sweden)

    J. Barkley Rosser, Jr.

    1998-01-01

    Full Text Available This paper traces the transition from planned command socialism to market capitalism and the accompanying complex non-linear dynamics involved. Long wave chaotic hysteretic investment cycles emerge under socialism leading to crisis and breakdown. Macroeconomic collapse occurs with bifurcations of coordination structures during transition. During recovery, transitional cobweb labor market dynamics exhibit chaos, fractal basin boundaries between coexisting non-chaotic attractors, discontinuous phase transitions, strange attractors, and cascades of infinitely many period-doubling bifurcations.

  4. Output-Feedback Control of Unknown Linear Discrete-Time Systems With Stochastic Measurement and Process Noise via Approximate Dynamic Programming.

    Science.gov (United States)

    Wang, Jun-Sheng; Yang, Guang-Hong

    2017-07-25

    This paper studies the optimal output-feedback control problem for unknown linear discrete-time systems with stochastic measurement and process noise. A dithered Bellman equation with the innovation covariance matrix is constructed via the expectation operator given in the form of a finite summation. On this basis, an output-feedback-based approximate dynamic programming method is developed, where the terms depending on the innovation covariance matrix are available with the aid of the innovation covariance matrix identified beforehand. Therefore, by iterating the Bellman equation, the resulting value function can converge to the optimal one in the presence of the aforementioned noise, and the nearly optimal control laws are delivered. To show the effectiveness and the advantages of the proposed approach, a simulation example and a velocity control experiment on a dc machine are employed.

  5. A Discrete Dynamical Model of Signed Partitions

    Directory of Open Access Journals (Sweden)

    G. Chiaselotti

    2013-01-01

    Full Text Available We use a discrete dynamical model with three evolution rules in order to analyze the structure of a partially ordered set of signed integer partitions whose main properties are actually not known. This model is related to the study of some extremal combinatorial sum problems.

  6. Geometric phases in discrete dynamical systems

    Energy Technology Data Exchange (ETDEWEB)

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

    2016-10-14

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

  7. Discrete dynamic modeling of cellular signaling networks.

    Science.gov (United States)

    Albert, Réka; Wang, Rui-Sheng

    2009-01-01

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

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

  9. Chaos of discrete dynamical systems in complete metric spaces

    International Nuclear Information System (INIS)

    Shi Yuming; Chen Guanrong

    2004-01-01

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

  10. The endogenous grid method for discrete-continuous dynamic choice models with (or without) taste shocks

    DEFF Research Database (Denmark)

    Iskhakov, Fedor; Jørgensen, Thomas H.; Rust, John

    2017-01-01

    We present a fast and accurate computational method for solving and estimating a class of dynamic programming models with discrete and continuous choice variables. The solution method we develop for structural estimation extends the endogenous grid-point method (EGM) to discrete-continuous (DC) p...

  11. A scheme for designing extreme multistable discrete dynamical ...

    Indian Academy of Sciences (India)

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

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

  13. Discrete Localized States and Localization Dynamics in Discrete Nonlinear Schrödinger Equations

    DEFF Research Database (Denmark)

    Christiansen, Peter Leth; Gaididei, Yu.B.; Mezentsev, V.K.

    1996-01-01

    Dynamics of two-dimensional discrete structures is studied in the framework of the generalized two-dimensional discrete nonlinear Schrodinger equation. The nonlinear coupling in the form of the Ablowitz-Ladik nonlinearity is taken into account. Stability properties of the stationary solutions...

  14. Rich dynamics of discrete delay ecological models

    International Nuclear Information System (INIS)

    Peng Mingshu

    2005-01-01

    We study multiple bifurcations and chaotic behavior of a discrete delay ecological model. New form of chaos for the 2-D map is observed: the combination of potential period doubling and reverse period-doubling leads to cascading bubbles

  15. Discrete modeling considerations in multiphase fluid dynamics

    International Nuclear Information System (INIS)

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

    1988-01-01

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

  16. Discretization model for nonlinear dynamic analysis of three dimensional structures

    International Nuclear Information System (INIS)

    Hayashi, Y.

    1982-12-01

    A discretization model for nonlinear dynamic analysis of three dimensional structures is presented. The discretization is achieved through a three dimensional spring-mass system and the dynamic response obtained by direct integration of the equations of motion using central diferences. First the viability of the model is verified through the analysis of homogeneous linear structures and then its performance in the analysis of structures subjected to impulsive or impact loads, taking into account both geometrical and physical nonlinearities is evaluated. (Author) [pt

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

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

  19. Geometric methods for discrete dynamical systems

    CERN Document Server

    Easton, Robert W

    1998-01-01

    This book looks at dynamics as an iteration process where the output of a function is fed back as an input to determine the evolution of an initial state over time. The theory examines errors which arise from round-off in numerical simulations, from the inexactness of mathematical models used to describe physical processes, and from the effects of external controls. The author provides an introduction accessible to beginning graduate students and emphasizing geometric aspects of the theory. Conley''s ideas about rough orbits and chain-recurrence play a central role in the treatment. The book will be a useful reference for mathematicians, scientists, and engineers studying this field, and an ideal text for graduate courses in dynamical systems.

  20. Discrete Control Processes, Dynamic Games and Multicriterion Control Problems

    Directory of Open Access Journals (Sweden)

    Dumitru Lozovanu

    2002-07-01

    Full Text Available The discrete control processes with state evaluation in time of dynamical system is considered. A general model of control problems with integral-time cost criterion by a trajectory is studied and a general scheme for solving such classes of problems is proposed. In addition the game-theoretical and multicriterion models for control problems are formulated and studied.

  1. Fractal sets generated by chemical reactions discrete chaotic dynamics

    International Nuclear Information System (INIS)

    Gontar, V.; Grechko, O.

    2007-01-01

    Fractal sets composed by the parameters values of difference equations derived from chemical reactions discrete chaotic dynamics (DCD) and corresponding to the sequences of symmetrical patterns were obtained in this work. Examples of fractal sets with the corresponding symmetrical patterns have been presented

  2. Switching dynamics in reaction networks induced by molecular discreteness

    International Nuclear Information System (INIS)

    Togashi, Yuichi; Kaneko, Kunihiko

    2007-01-01

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

  3. Discrete Opinion Dynamics on Online Social Networks

    Science.gov (United States)

    Hu, Yan-Li; Bai, Liang; Zhang, Wei-Ming

    2013-01-01

    This paper focuses on the dynamics of binary opinions {+1, -1} on online social networks consisting of heterogeneous actors. In our model, actors update their opinions under the interplay of social influence and self- affirmation, which leads to rich dynamical behaviors on online social networks. We find that the opinion leading to the consensus features an advantage of the initially weighted fraction based on actors' strength over the other, instead of the population. For the role of specific actors, the consensus converges towards the opinion that a small fraction of high-strength actors hold, and individual diversity of self-affirmation slows down the ordering process of consensus. These indicate that high-strength actors play an essential role in opinion formation with strong social influence as well as high persistence. Further investigations show that the initial fraction of high-strength actors to dominate the evolution depends on the heterogeneity of the strength distribution, and less high-strength actors are needed in the case of a smaller exponent of power-law distribution of actors' strength. Our study provides deep insights into the role of social influence and self-affirmation on opinion formation on online social networks.

  4. Discrete Opinion Dynamics on Online Social Networks

    International Nuclear Information System (INIS)

    Hu Yan-Li; Bai Liang; Zhang Wei-Ming

    2013-01-01

    This paper focuses on the dynamics of binary opinions {+1, −1} on online social networks consisting of heterogeneous actors. In our model, actors update their opinions under the interplay of social influence and self- affirmation, which leads to rich dynamical behaviors on online social networks. We find that the opinion leading to the consensus features an advantage of the initially weighted fraction based on actors' strength over the other, instead of the population. For the role of specific actors, the consensus converges towards the opinion that a small fraction of high-strength actors hold, and individual diversity of self-affirmation slows down the ordering process of consensus. These indicate that high-strength actors play an essential role in opinion formation with strong social influence as well as high persistence. Further investigations show that the initial fraction of high-strength actors to dominate the evolution depends on the heterogeneity of the strength distribution, and less high-strength actors are needed in the case of a smaller exponent of power-law distribution of actors' strength. Our study provides deep insights into the role of social influence and self-affirmation on opinion formation on online social networks. (general)

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

    Directory of Open Access Journals (Sweden)

    SERGIY KOZERENKO

    2016-04-01

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

  6. Critical bifurcation surfaces of 3D discrete dynamics

    Directory of Open Access Journals (Sweden)

    Michael Sonis

    2000-01-01

    Full Text Available This paper deals with the analytical representation of bifurcations of each 3D discrete dynamics depending on the set of bifurcation parameters. The procedure of bifurcation analysis proposed in this paper represents the 3D elaboration and specification of the general algorithm of the n-dimensional linear bifurcation analysis proposed by the author earlier. It is proven that 3D domain of asymptotic stability (attraction of the fixed point for a given 3D discrete dynamics is bounded by three critical bifurcation surfaces: the divergence, flip and flutter surfaces. The analytical construction of these surfaces is achieved with the help of classical Routh–Hurvitz conditions of asymptotic stability. As an application the adjustment process proposed by T. Puu for the Cournot oligopoly model is considered in detail.

  7. Dynamic nonlinear interaction of elastic plates on discrete supports

    International Nuclear Information System (INIS)

    Coutinho, A.L.G.A.; Landau, L.; Lima, E.C.P. de; Ebecken, N.F.F.

    1984-01-01

    A study on the dynamic nonlinear interaction of elastic plates using the finite element method is presented. The elastic plate is discretized by 4-node isoparametric Mindlin elements. The constitutive relation of the discrete supports can be any nonlinear curve given by pairs of force-displacement points. The nonlinear behaviour is represented by the overlay approach. This model also allows the simulation of a progressive decrease on the supports stiffnesses during load cycles. The dynamic nonlinear incremental movement equations are integrated by the Newmark implicit operator. Two alternatives for the incremental-iterative formulation are compared. The paper ends with a discussion of the advantages and limitations of the presented numerical models. (Author) [pt

  8. Lattice fluid dynamics from perfect discretizations of continuum flows

    International Nuclear Information System (INIS)

    Katz, E.; Wiese, U.

    1998-01-01

    We use renormalization group methods to derive equations of motion for large scale variables in fluid dynamics. The large scale variables are averages of the underlying continuum variables over cubic volumes and naturally exist on a lattice. The resulting lattice dynamics represents a perfect discretization of continuum physics, i.e., grid artifacts are completely eliminated. Perfect equations of motion are derived for static, slow flows of incompressible, viscous fluids. For Hagen-Poiseuille flow in a channel with a square cross section the equations reduce to a perfect discretization of the Poisson equation for the velocity field with Dirichlet boundary conditions. The perfect large scale Poisson equation is used in a numerical simulation and is shown to represent the continuum flow exactly. For nonsquare cross sections one can use a numerical iterative procedure to derive flow equations that are approximately perfect. copyright 1998 The American Physical Society

  9. Discrete Cosserat Approach for Multi-Section Soft Robots Dynamics

    OpenAIRE

    Renda, Federico; Boyer, Frederic; Dias, Jorge; Seneviratne, Lakmal

    2017-01-01

    In spite of recent progress, soft robotics still suffers from a lack of unified modeling framework. Nowadays, the most adopted model for the design and control of soft robots is the piece-wise constant curvature model, with its consolidated benefits and drawbacks. In this work, an alternative model for multisection soft robots dynamics is presented based on a discrete Cosserat approach, which, not only takes into account shear and torsional deformations, essentials to cope with out-of-plane e...

  10. Discrete ergodic Jacobi matrices: Spectral properties and Quantum dynamical bounds

    OpenAIRE

    Han, Rui

    2017-01-01

    In this thesis we study discrete quasiperiodic Jacobi operators as well as ergodic operators driven by more general zero topological entropy dynamics. Such operators are deeply connected to physics (quantum Hall effect and graphene) and have enjoyed great attention from mathematics (e.g. several of Simon’s problems). The thesis has two main themes. First, to study spectral properties of quasiperiodic Jacobi matrices, in particular when off-diagonal sampling function has non-zero winding numbe...

  11. Introduction to dynamic programming

    CERN Document Server

    Cooper, Leon; Rodin, E Y

    1981-01-01

    Introduction to Dynamic Programming provides information pertinent to the fundamental aspects of dynamic programming. This book considers problems that can be quantitatively formulated and deals with mathematical models of situations or phenomena that exists in the real world.Organized into 10 chapters, this book begins with an overview of the fundamental components of any mathematical optimization model. This text then presents the details of the application of dynamic programming to variational problems. Other chapters consider the application of dynamic programming to inventory theory, Mark

  12. Discrete dynamic modeling of T cell survival signaling networks

    Science.gov (United States)

    Zhang, Ranran

    2009-03-01

    Biochemistry-based frameworks are often not applicable for the modeling of heterogeneous regulatory systems that are sparsely documented in terms of quantitative information. As an alternative, qualitative models assuming a small set of discrete states are gaining acceptance. This talk will present a discrete dynamic model of the signaling network responsible for the survival and long-term competence of cytotoxic T cells in the blood cancer T-LGL leukemia. We integrated the signaling pathways involved in normal T cell activation and the known deregulations of survival signaling in leukemic T-LGL, and formulated the regulation of each network element as a Boolean (logic) rule. Our model suggests that the persistence of two signals is sufficient to reproduce all known deregulations in leukemic T-LGL. It also indicates the nodes whose inactivity is necessary and sufficient for the reversal of the T-LGL state. We have experimentally validated several model predictions, including: (i) Inhibiting PDGF signaling induces apoptosis in leukemic T-LGL. (ii) Sphingosine kinase 1 and NFκB are essential for the long-term survival of T cells in T-LGL leukemia. (iii) T box expressed in T cells (T-bet) is constitutively activated in the T-LGL state. The model has identified potential therapeutic targets for T-LGL leukemia and can be used for generating long-term competent CTL necessary for tumor and cancer vaccine development. The success of this model, and of other discrete dynamic models, suggests that the organization of signaling networks has an determining role in their dynamics. Reference: R. Zhang, M. V. Shah, J. Yang, S. B. Nyland, X. Liu, J. K. Yun, R. Albert, T. P. Loughran, Jr., Network Model of Survival Signaling in LGL Leukemia, PNAS 105, 16308-16313 (2008).

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

    Science.gov (United States)

    Cliff, E. M.

    1975-01-01

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

  14. Experiments of reconstructing discrete atmospheric dynamic models from data (I)

    Science.gov (United States)

    Lin, Zhenshan; Zhu, Yanyu; Deng, Ziwang

    1995-03-01

    In this paper, we give some experimental results of our study in reconstructing discrete atmospheric dynamic models from data. After a great deal of numerical experiments, we found that the logistic map, x n + 1 = 1- μx {2/n}, could be used in monthly mean temperature prediction when it was approaching the chaotic region, and its predictive results were in reverse states to the practical data. This means that the nonlinear developing behavior of the monthly mean temperature system is bifurcating back into the critical chaotic states from the chaotic ones.

  15. Design of Experiment Using Simulation of a Discrete Dynamical System

    Directory of Open Access Journals (Sweden)

    Mašek Jan

    2016-12-01

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

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

  17. Markov Decision Processes Discrete Stochastic Dynamic Programming

    CERN Document Server

    Puterman, Martin L

    2005-01-01

    The Wiley-Interscience Paperback Series consists of selected books that have been made more accessible to consumers in an effort to increase global appeal and general circulation. With these new unabridged softcover volumes, Wiley hopes to extend the lives of these works by making them available to future generations of statisticians, mathematicians, and scientists. "This text is unique in bringing together so many results hitherto found only in part in other texts and papers. . . . The text is fairly self-contained, inclusive of some basic mathematical results needed, and provides a rich diet

  18. Exact wave packet decoherence dynamics in a discrete spectrum environment

    International Nuclear Information System (INIS)

    Tu, Matisse W Y; Zhang Weimin

    2008-01-01

    We find an exact analytical solution of the reduced density matrix from the Feynman-Vernon influence functional theory for a wave packet in an environment containing a few discrete modes. We obtain two intrinsic energy scales relating to the time scales of the system and the environment. The different relationship between these two scales alters the overall form of the solution of the system. We also introduce a decoherence measure for a single wave packet which is defined as the ratio of Schroedinger uncertainty over the delocalization extension of the wave packet and characterizes the time-evolution behaviour of the off-diagonal reduced density matrix element. We utilize the exact solution and the decoherence measure to study the wave packet decoherence dynamics. We further demonstrate how the dynamical diffusion of the wave packet leads to non-Markovian decoherence in such a microscopic environment.

  19. The discrete dynamics of symmetric competition in the plane.

    Science.gov (United States)

    Jiang, H; Rogers, T D

    1987-01-01

    We consider the generalized Lotka-Volterra two-species system xn + 1 = xn exp(r1(1 - xn) - s1yn) yn + 1 = yn exp(r2(1 - yn) - s2xn) originally proposed by R. M. May as a model for competitive interaction. In the symmetric case that r1 = r2 and s1 = s2, a region of ultimate confinement is found and the dynamics therein are described in some detail. The bifurcations of periodic points of low period are studied, and a cascade of period-doubling bifurcations is indicated. Within the confinement region, a parameter region is determined for the stable Hopf bifurcation of a pair of symmetrically placed period-two points, which imposes a second component of oscillation near the stable cycles. It is suggested that the symmetric competitive model contains much of the dynamical complexity to be expected in any discrete two-dimensional competitive model.

  20. Dual Dynamic Programming - DDP

    International Nuclear Information System (INIS)

    Velasquez Bermudez, Jesus M

    1998-01-01

    Objections are presented to the mathematical formulation of the denominated Dual Dynamic programming-PDD that is the theoretical base of several computational model available for the optimal formulation of interconnected hydrothermal systems

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

  2. A modified discrete element model for sea ice dynamics

    Institute of Scientific and Technical Information of China (English)

    LI Baohui; LI Hai; LIU Yu; WANG Anliang; JI Shunying

    2014-01-01

    Considering the discontinuous characteristics of sea ice on various scales, a modified discrete element mod-el (DEM) for sea ice dynamics is developed based on the granular material rheology. In this modified DEM, a soft sea ice particle element is introduced as a self-adjustive particle size function. Each ice particle can be treated as an assembly of ice floes, with its concentration and thickness changing to variable sizes un-der the conservation of mass. In this model, the contact forces among ice particles are calculated using a viscous-elastic-plastic model, while the maximum shear forces are described with the Mohr-Coulomb fric-tion law. With this modified DEM, the ice flow dynamics is simulated under the drags of wind and current in a channel of various widths. The thicknesses, concentrations and velocities of ice particles are obtained, and then reasonable dynamic process is analyzed. The sea ice dynamic process is also simulated in a vortex wind field. Taking the influence of thermodynamics into account, this modified DEM will be improved in the future work.

  3. Nonparametric Identification and Estimation of Finite Mixture Models of Dynamic Discrete Choices

    OpenAIRE

    Hiroyuki Kasahara; Katsumi Shimotsu

    2006-01-01

    In dynamic discrete choice analysis, controlling for unobserved heterogeneity is an important issue, and finite mixture models provide flexible ways to account for unobserved heterogeneity. This paper studies nonparametric identifiability of type probabilities and type-specific component distributions in finite mixture models of dynamic discrete choices. We derive sufficient conditions for nonparametric identification for various finite mixture models of dynamic discrete choices used in appli...

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

  5. Dynamic generation of light states with discrete symmetries

    Science.gov (United States)

    Cordero, S.; Nahmad-Achar, E.; Castaños, O.; López-Peña, R.

    2018-01-01

    A dynamic procedure is established within the generalized Tavis-Cummings model to generate light states with discrete point symmetries, given by the cyclic group Cn. We consider arbitrary dipolar coupling strengths of the atoms with a one-mode electromagnetic field in a cavity. The method uses mainly the matter-field entanglement properties of the system, which can be extended to any number of three-level atoms. An initial state constituted by the superposition of two states with definite total excitation numbers, |ψ〉 M1,and |ψ〉 M 2, is considered. It can be generated by the proper selection of the time of flight of an atom passing through the cavity. We demonstrate that the resulting Husimi function of the light is invariant under cyclic point transformations of order n =| M1-M2| .

  6. Formal methods for discrete-time dynamical systems

    CERN Document Server

    Belta, Calin; Aydin Gol, Ebru

    2017-01-01

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

  7. Multistability and complex dynamics in a simple discrete economic model

    International Nuclear Information System (INIS)

    Peng Mingshu; Jiang Zhonghao; Jiang Xiaoxia; Hu Jiping; Qu Youli

    2009-01-01

    In this paper, we will propose a generalized Cournot duopoly model with Z 2 symmetry. We demonstrate that cost functions incorporating an interfirm externality lead to a system of couple one-dimensional maps. In the situation where agents take turns, we find in an analytic way that there coexist multiple unstable/stable period-2 cycles or synchronized/asynchronized periodic orbits. Coupling one-dimension chaos can be observed. In a more general situation, where agents move simultaneously, a closer analysis reveals some well-known local bifurcations and global bifurcations which typically occur in two-parameter families of two-dimensional discrete time dynamical systems, including codimension-one (fold-, flip-, Neimark-Sacker-) bifurcations, codimension-two (fold/flip, 1:2 resonance, 1:3 resonance and 1:4 resonance) bifurcations, and hetero-clinic, homo-clinic bifurcations, etc. Multistability, including the coexistence of synchronized/asynchronized solutions are also discussed.

  8. A spectral approach for discrete dislocation dynamics simulations of nanoindentation

    Science.gov (United States)

    Bertin, Nicolas; Glavas, Vedran; Datta, Dibakar; Cai, Wei

    2018-07-01

    We present a spectral approach to perform nanoindentation simulations using three-dimensional nodal discrete dislocation dynamics. The method relies on a two step approach. First, the contact problem between an indenter of arbitrary shape and an isotropic elastic half-space is solved using a spectral iterative algorithm, and the contact pressure is fully determined on the half-space surface. The contact pressure is then used as a boundary condition of the spectral solver to determine the resulting stress field produced in the simulation volume. In both stages, the mechanical fields are decomposed into Fourier modes and are efficiently computed using fast Fourier transforms. To further improve the computational efficiency, the method is coupled with a subcycling integrator and a special approach is devised to approximate the displacement field associated with surface steps. As a benchmark, the method is used to compute the response of an elastic half-space using different types of indenter. An example of a dislocation dynamics nanoindentation simulation with complex initial microstructure is presented.

  9. Constant pressure and temperature discrete-time Langevin molecular dynamics

    Energy Technology Data Exchange (ETDEWEB)

    Grønbech-Jensen, Niels [Department of Mechanical and Aerospace Engineering, University of California, Davis, California 95616 (United States); Department of Mathematics, University of California, Davis, California 95616 (United States); Farago, Oded [Department of Biomedical Engineering, Ben Gurion University of the Negev, Be' er Sheva 84105 (Israel); Ilse Katz Institute for Nanoscale Science and Technology, Ben Gurion University of the Negev, Be' er Sheva 84105 (Israel)

    2014-11-21

    We present a new and improved method for simultaneous control of temperature and pressure in molecular dynamics simulations with periodic boundary conditions. The thermostat-barostat equations are built on our previously developed stochastic thermostat, which has been shown to provide correct statistical configurational sampling for any time step that yields stable trajectories. Here, we extend the method and develop a set of discrete-time equations of motion for both particle dynamics and system volume in order to seek pressure control that is insensitive to the choice of the numerical time step. The resulting method is simple, practical, and efficient. The method is demonstrated through direct numerical simulations of two characteristic model systems—a one-dimensional particle chain for which exact statistical results can be obtained and used as benchmarks, and a three-dimensional system of Lennard-Jones interacting particles simulated in both solid and liquid phases. The results, which are compared against the method of Kolb and Dünweg [J. Chem. Phys. 111, 4453 (1999)], show that the new method behaves according to the objective, namely that acquired statistical averages and fluctuations of configurational measures are accurate and robust against the chosen time step applied to the simulation.

  10. A discrete dislocation dynamics model of creeping single crystals

    Science.gov (United States)

    Rajaguru, M.; Keralavarma, S. M.

    2018-04-01

    Failure by creep is a design limiting issue for metallic materials used in several high temperature applications. Current theoretical models of creep are phenomenological with little connection to the underlying microscopic mechanisms. In this paper, a bottom-up simulation framework based on the discrete dislocation dynamics method is presented for dislocation creep aided by the diffusion of vacancies, known to be the rate controlling mechanism at high temperature and stress levels. The time evolution of the creep strain and the dislocation microstructure in a periodic unit cell of a nominally infinite single crystal is simulated using the kinetic Monte Carlo method, together with approximate constitutive laws formulated for the rates of thermal activation of dislocations over local pinning obstacles. The deformation of the crystal due to dislocation glide between individual thermal activation events is simulated using a standard dislocation dynamics algorithm, extended to account for constant stress periodic boundary conditions. Steady state creep conditions are obtained in the simulations with the predicted creep rates as a function of stress and temperature in good agreement with experimentally reported values. Arrhenius scaling of the creep rates as a function of temperature and power-law scaling with the applied stress are also reproduced, with the values of the power-law exponents in the high stress regime in good agreement with experiments.

  11. Pathwise dynamic programming

    NARCIS (Netherlands)

    Bender, Christian; Gärtner, Christian; Schweizer, Nikolaus

    2017-01-01

    We present a novel method for deriving tight Monte Carlo confidence intervals for solutions of stochastic dynamic programming equations. Taking some approximate solution to the equation as an input, we construct pathwise recursions with a known bias. Suitably coupling the recursions for lower and

  12. An implicit finite element method for discrete dynamic fracture

    Energy Technology Data Exchange (ETDEWEB)

    Gerken, Jobie M. [Colorado State Univ., Fort Collins, CO (United States)

    1999-12-01

    A method for modeling the discrete fracture of two-dimensional linear elastic structures with a distribution of small cracks subject to dynamic conditions has been developed. The foundation for this numerical model is a plane element formulated from the Hu-Washizu energy principle. The distribution of small cracks is incorporated into the numerical model by including a small crack at each element interface. The additional strain field in an element adjacent to this crack is treated as an externally applied strain field in the Hu-Washizu energy principle. The resulting stiffness matrix is that of a standard plane element. The resulting load vector is that of a standard plane element with an additional term that includes the externally applied strain field. Except for the crack strain field equations, all terms of the stiffness matrix and load vector are integrated symbolically in Maple V so that fully integrated plane stress and plane strain elements are constructed. The crack strain field equations are integrated numerically. The modeling of dynamic behavior of simple structures was demonstrated within acceptable engineering accuracy. In the model of axial and transverse vibration of a beam and the breathing mode of vibration of a thin ring, the dynamic characteristics were shown to be within expected limits. The models dominated by tensile forces (the axially loaded beam and the pressurized ring) were within 0.5% of the theoretical values while the shear dominated model (the transversely loaded beam) is within 5% of the calculated theoretical value. The constant strain field of the tensile problems can be modeled exactly by the numerical model. The numerical results should therefore, be exact. The discrepancies can be accounted for by errors in the calculation of frequency from the numerical results. The linear strain field of the transverse model must be modeled by a series of constant strain elements. This is an approximation to the true strain field, so some

  13. Discretization-induced delays and their role in the dynamics

    International Nuclear Information System (INIS)

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

    2008-01-01

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

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

  15. Signatures of discrete breathers in coherent state quantum dynamics

    International Nuclear Information System (INIS)

    Igumenshchev, Kirill; Ovchinnikov, Misha; Prezhdo, Oleg; Maniadis, Panagiotis

    2013-01-01

    In classical mechanics, discrete breathers (DBs) – a spatial time-periodic localization of energy – are predicted in a large variety of nonlinear systems. Motivated by a conceptual bridging of the DB phenomena in classical and quantum mechanical representations, we study their signatures in the dynamics of a quantum equivalent of a classical mechanical point in phase space – a coherent state. In contrast to the classical point that exhibits either delocalized or localized motion, the coherent state shows signatures of both localized and delocalized behavior. The transition from normal to local modes have different characteristics in quantum and classical perspectives. Here, we get an insight into the connection between classical and quantum perspectives by analyzing the decomposition of the coherent state into system's eigenstates, and analyzing the spacial distribution of the wave-function density within these eigenstates. We find that the delocalized and localized eigenvalue components of the coherent state are separated by a mixed region, where both kinds of behavior can be observed. Further analysis leads to the following observations. Considered as a function of coupling, energy eigenstates go through avoided crossings between tunneling and non-tunneling modes. The dominance of tunneling modes in the high nonlinearity region is compromised by the appearance of new types of modes – high order tunneling modes – that are similar to the tunneling modes but have attributes of non-tunneling modes. Certain types of excitations preferentially excite higher order tunneling modes, allowing one to study their properties. Since auto-correlation functions decrease quickly in highly nonlinear systems, short-time dynamics are sufficient for modeling quantum DBs. This work provides a foundation for implementing modern semi-classical methods to model quantum DBs, bridging classical and quantum mechanical signatures of DBs, and understanding spectroscopic experiments

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

  17. Integrated information in discrete dynamical systems: motivation and theoretical framework.

    Directory of Open Access Journals (Sweden)

    David Balduzzi

    2008-06-01

    Full Text Available This paper introduces a time- and state-dependent measure of integrated information, phi, which captures the repertoire of causal states available to a system as a whole. Specifically, phi quantifies how much information is generated (uncertainty is reduced when a system enters a particular state through causal interactions among its elements, above and beyond the information generated independently by its parts. Such mathematical characterization is motivated by the observation that integrated information captures two key phenomenological properties of consciousness: (i there is a large repertoire of conscious experiences so that, when one particular experience occurs, it generates a large amount of information by ruling out all the others; and (ii this information is integrated, in that each experience appears as a whole that cannot be decomposed into independent parts. This paper extends previous work on stationary systems and applies integrated information to discrete networks as a function of their dynamics and causal architecture. An analysis of basic examples indicates the following: (i phi varies depending on the state entered by a network, being higher if active and inactive elements are balanced and lower if the network is inactive or hyperactive. (ii phi varies for systems with identical or similar surface dynamics depending on the underlying causal architecture, being low for systems that merely copy or replay activity states. (iii phi varies as a function of network architecture. High phi values can be obtained by architectures that conjoin functional specialization with functional integration. Strictly modular and homogeneous systems cannot generate high phi because the former lack integration, whereas the latter lack information. Feedforward and lattice architectures are capable of generating high phi but are inefficient. (iv In Hopfield networks, phi is low for attractor states and neutral states, but increases if the networks

  18. Integrated information in discrete dynamical systems: motivation and theoretical framework.

    Science.gov (United States)

    Balduzzi, David; Tononi, Giulio

    2008-06-13

    This paper introduces a time- and state-dependent measure of integrated information, phi, which captures the repertoire of causal states available to a system as a whole. Specifically, phi quantifies how much information is generated (uncertainty is reduced) when a system enters a particular state through causal interactions among its elements, above and beyond the information generated independently by its parts. Such mathematical characterization is motivated by the observation that integrated information captures two key phenomenological properties of consciousness: (i) there is a large repertoire of conscious experiences so that, when one particular experience occurs, it generates a large amount of information by ruling out all the others; and (ii) this information is integrated, in that each experience appears as a whole that cannot be decomposed into independent parts. This paper extends previous work on stationary systems and applies integrated information to discrete networks as a function of their dynamics and causal architecture. An analysis of basic examples indicates the following: (i) phi varies depending on the state entered by a network, being higher if active and inactive elements are balanced and lower if the network is inactive or hyperactive. (ii) phi varies for systems with identical or similar surface dynamics depending on the underlying causal architecture, being low for systems that merely copy or replay activity states. (iii) phi varies as a function of network architecture. High phi values can be obtained by architectures that conjoin functional specialization with functional integration. Strictly modular and homogeneous systems cannot generate high phi because the former lack integration, whereas the latter lack information. Feedforward and lattice architectures are capable of generating high phi but are inefficient. (iv) In Hopfield networks, phi is low for attractor states and neutral states, but increases if the networks are optimized

  19. Dynamic programming for QFD in PES optimization

    Energy Technology Data Exchange (ETDEWEB)

    Sorrentino, R. [Mediterranean Univ. of Reggio Calabria, Reggio Calabria (Italy). Dept. of Computer Science and Electrical Technology

    2008-07-01

    Quality function deployment (QFD) is a method for linking the needs of the customer with design, development, engineering, manufacturing, and service functions. In the electric power industry, QFD is used to help designers concentrate on the most important technical attributes to develop better electrical services. Most optimization approaches used in QFD analysis have been based on integer or linear programming. These approaches perform well in certain circumstances, but there are problems that hinder their practical use. This paper proposed an approach to optimize Power and Energy Systems (PES). A dynamic programming approach was used along with an extended House of Quality to gather information. Dynamic programming was used to allocate the limited resources to the technical attributes. The approach integrated dynamic programming into the electrical service design process. The dynamic programming approach did not require the full relationship curve between technical attributes and customer satisfaction, or the relationship between technical attributes and cost. It only used a group of discrete points containing information about customer satisfaction, technical attributes, and the cost to find the optimal product design. Therefore, it required less time and resources than other approaches. At the end of the optimization process, the value of each technical attribute, the related cost, and the overall customer satisfaction were obtained at the same time. It was concluded that compared with other optimization methods, the dynamic programming method requires less information and the optimal results are more relevant. 21 refs., 2 tabs., 2 figs.

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

  1. Stochastic control theory dynamic programming principle

    CERN Document Server

    Nisio, Makiko

    2015-01-01

    This book offers a systematic introduction to the optimal stochastic control theory via the dynamic programming principle, which is a powerful tool to analyze control problems. First we consider completely observable control problems with finite horizons. Using a time discretization we construct a nonlinear semigroup related to the dynamic programming principle (DPP), whose generator provides the Hamilton–Jacobi–Bellman (HJB) equation, and we characterize the value function via the nonlinear semigroup, besides the viscosity solution theory. When we control not only the dynamics of a system but also the terminal time of its evolution, control-stopping problems arise. This problem is treated in the same frameworks, via the nonlinear semigroup. Its results are applicable to the American option price problem. Zero-sum two-player time-homogeneous stochastic differential games and viscosity solutions of the Isaacs equations arising from such games are studied via a nonlinear semigroup related to DPP (the min-ma...

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

    Science.gov (United States)

    Gannon, Gerald E.; Martelli, Mario U.

    2001-01-01

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

  3. Discrete breathers dynamic in a model for DNA chain with a finite stacking enthalpy

    Science.gov (United States)

    Gninzanlong, Carlos Lawrence; Ndjomatchoua, Frank Thomas; Tchawoua, Clément

    2018-04-01

    The nonlinear dynamics of a homogeneous DNA chain based on site-dependent finite stacking and pairing enthalpies is studied. A new variant of extended discrete nonlinear Schrödinger equation describing the dynamics of modulated wave is derived. The regions of discrete modulational instability of plane carrier waves are studied, and it appears that these zones depend strongly on the phonon frequency of Fourier's mode. The staggered/unstaggered discrete breather (SDB/USDB) is obtained straightforwardly without the staggering transformation, and it is demonstrated that SDBs are less unstable than USDB. The instability of discrete multi-humped SDB/USDB solution does not depend on the number of peaks of the discrete breather (DB). By using the concept of Peierls-Nabarro energy barrier, it appears that the low-frequency DBs are more mobile.

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

    Directory of Open Access Journals (Sweden)

    Baogui Xin

    2015-04-01

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

  5. Dynamics of breathers in discrete nonlinear Schrodinger models

    DEFF Research Database (Denmark)

    Christiansen, Peter Leth; Johansson, Magnus; Aubry, Serge

    1998-01-01

    We review some recent results concerning the existence and stability of spatially localized and temporally quasiperiodic (non-stationary) excitations in discrete nonlinear Schrodinger (DNLS) models. In two dimensions, we show the existence of linearly stable, stationary and non-stationary localized...

  6. Modeling of Macroeconomics by a Novel Discrete Nonlinear Fractional Dynamical System

    Directory of Open Access Journals (Sweden)

    Zhenhua Hu

    2013-01-01

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

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

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

    International Nuclear Information System (INIS)

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

    2010-12-01

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

  9. Hybrid Semantics of Stochastic Programs with Dynamic Reconfiguration

    Directory of Open Access Journals (Sweden)

    Alberto Policriti

    2009-10-01

    Full Text Available We begin by reviewing a technique to approximate the dynamics of stochastic programs --written in a stochastic process algebra-- by a hybrid system, suitable to capture a mixed discrete/continuous evolution. In a nutshell, the discrete dynamics is kept stochastic while the continuous evolution is given in terms of ODEs, and the overall technique, therefore, naturally associates a Piecewise Deterministic Markov Process with a stochastic program. The specific contribution in this work consists in an increase of the flexibility of the translation scheme, obtained by allowing a dynamic reconfiguration of the degree of discreteness/continuity of the semantics. We also discuss the relationships of this approach with other hybrid simulation strategies for biochemical systems.

  10. A scheme for designing extreme multistable discrete dynamical ...

    Indian Academy of Sciences (India)

    PRIYANKA CHAKRABORTY

    2017-08-21

    Aug 21, 2017 ... tems [12,13], in neuron dynamics [14], in climate dynamics [15–18], in social systems [19,20] etc. A multistable dynamical system is one that possesses a large number of asymptotic stable states for a fixed set of parameters depending on initial conditions. Triv- ial multistability of a system can be considered ...

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2014-11-18

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

  12. Theoretical foundation for jung's “Mandala Symbolism” based on discrete chaotic dynamics of interacting neurons

    Directory of Open Access Journals (Sweden)

    V. Gontar

    2000-01-01

    Full Text Available Based on discrete chaotic dynamics algorithms different patterns in a form of mandalas have been generated. This fact gives us the possibility to make a link between mechanism of biochemical reaction dynamics undergoing in brain resulted to the brain creativity process in form of mandalas. Obtained patterns can be related to the space distributed chemicals according to the law of extended principle of maximum entropy, consideration of the information exchange during biochemical transformations, mass conservation law and discrete chaotic dynamics principles.

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

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

  15. Stochastic integer programming by dynamic programming

    NARCIS (Netherlands)

    Lageweg, B.J.; Lenstra, J.K.; Rinnooy Kan, A.H.G.; Stougie, L.; Ermoliev, Yu.; Wets, R.J.B.

    1988-01-01

    Stochastic integer programming is a suitable tool for modeling hierarchical decision situations with combinatorial features. In continuation of our work on the design and analysis of heuristics for such problems, we now try to find optimal solutions. Dynamic programming techniques can be used to

  16. Positive dynamical systems in discrete time theory, models, and applications

    CERN Document Server

    Krause, Ulrich

    2015-01-01

    This book provides a systematic, rigorous and self-contained treatment of positive dynamical systems. A dynamical system is positive when all relevant variables of a systemare nonnegative in a natural way. This is in biology, demography or economics, where the levels of populations or prices of goods are positive. The principle also finds application in electrical engineering, physics and computer sciences.

  17. Extinction dynamics of a discrete population in an oasis.

    Science.gov (United States)

    Berti, Stefano; Cencini, Massimo; Vergni, Davide; Vulpiani, Angelo

    2015-07-01

    Understanding the conditions ensuring the persistence of a population is an issue of primary importance in population biology. The first theoretical approach to the problem dates back to the 1950s with the Kierstead, Slobodkin, and Skellam (KiSS) model, namely a continuous reaction-diffusion equation for a population growing on a patch of finite size L surrounded by a deadly environment with infinite mortality, i.e., an oasis in a desert. The main outcome of the model is that only patches above a critical size allow for population persistence. Here we introduce an individual-based analog of the KiSS model to investigate the effects of discreteness and demographic stochasticity. In particular, we study the average time to extinction both above and below the critical patch size of the continuous model and investigate the quasistationary distribution of the number of individuals for patch sizes above the critical threshold.

  18. A study of the dynamics of a discrete auroral arc

    International Nuclear Information System (INIS)

    Marklund, G.; Sandahl, I.; Opgenoorth, H.

    1981-06-01

    High resolution electric field and particle data, obtained by the S23L1 rocket crossing over a discrete prebreakup arc in January 1979, are studied in coordination with ground observations in order to clarify the electrodynamics of the arc and its surroundings. Height-integrated conductivities have been calculated from the particle data, including the ionization effect of precipitating protons, and assuming a steady state balance between ion production and recombination losses. High resolution optical information of arc location relative to the rocket permitted a check of the validity of this assumption for each fluxtube passed by the rocket. Another check was provided by a comparison between calculated and observed electron densities along the rocket trajectory. (author)

  19. Navier-Stokes Dynamics by a Discrete Boltzmann Model

    Science.gov (United States)

    Rubinstein, Robet

    2010-01-01

    This work investigates the possibility of particle-based algorithms for the Navier-Stokes equations and higher order continuum approximations of the Boltzmann equation; such algorithms would generalize the well-known Pullin scheme for the Euler equations. One such method is proposed in the context of a discrete velocity model of the Boltzmann equation. Preliminary results on shock structure are consistent with the expectation that the shock should be much broader than the near discontinuity predicted by the Pullin scheme, yet narrower than the prediction of the Boltzmann equation. We discuss the extension of this essentially deterministic method to a stochastic particle method that, like DSMC, samples the distribution function rather than resolving it completely.

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

  1. The magnetic flux dynamics in the critical state of one-dimensional discrete superconductor

    International Nuclear Information System (INIS)

    Ginzburg, S.L.; Nakin, A.V.; Savitskaya, N.E.

    2006-01-01

    We give a theoretical description of avalanche-like dynamics of magnetic flux in the critical state of discrete superconductors using a one-dimensional model of a multijunction SQUID. We show that the system under consideration demonstrates the self-organized criticality. The avalanches of vortices manifest themselves as jumps of the total magnetic flux in the sample. The sizes of these jumps have a power-law distribution. We argue that similarities in the behavior of discrete and usual type-II superconductors allows to extend our results for description of avalanche-like dynamics in type-II superconductors with strong pinning

  2. Application of network methods for understanding evolutionary dynamics in discrete habitats.

    Science.gov (United States)

    Greenbaum, Gili; Fefferman, Nina H

    2017-06-01

    In populations occupying discrete habitat patches, gene flow between habitat patches may form an intricate population structure. In such structures, the evolutionary dynamics resulting from interaction of gene-flow patterns with other evolutionary forces may be exceedingly complex. Several models describing gene flow between discrete habitat patches have been presented in the population-genetics literature; however, these models have usually addressed relatively simple settings of habitable patches and have stopped short of providing general methodologies for addressing nontrivial gene-flow patterns. In the last decades, network theory - a branch of discrete mathematics concerned with complex interactions between discrete elements - has been applied to address several problems in population genetics by modelling gene flow between habitat patches using networks. Here, we present the idea and concepts of modelling complex gene flows in discrete habitats using networks. Our goal is to raise awareness to existing network theory applications in molecular ecology studies, as well as to outline the current and potential contribution of network methods to the understanding of evolutionary dynamics in discrete habitats. We review the main branches of network theory that have been, or that we believe potentially could be, applied to population genetics and molecular ecology research. We address applications to theoretical modelling and to empirical population-genetic studies, and we highlight future directions for extending the integration of network science with molecular ecology. © 2017 John Wiley & Sons Ltd.

  3. Introduction to stochastic dynamic programming

    CERN Document Server

    Ross, Sheldon M; Lukacs, E

    1983-01-01

    Introduction to Stochastic Dynamic Programming presents the basic theory and examines the scope of applications of stochastic dynamic programming. The book begins with a chapter on various finite-stage models, illustrating the wide range of applications of stochastic dynamic programming. Subsequent chapters study infinite-stage models: discounting future returns, minimizing nonnegative costs, maximizing nonnegative returns, and maximizing the long-run average return. Each of these chapters first considers whether an optimal policy need exist-providing counterexamples where appropriate-and the

  4. Dynamic Programming Foundations and Principles

    CERN Document Server

    Sniedovich, Moshe

    2010-01-01

    Focusing on the modeling and solution of deterministic multistage decision problems, this book looks at dynamic programming as a problem-solving optimization method. With over 400 useful references, this edition discusses the dynamic programming analysis of a problem, illustrates the rationale behind this analysis, and clarifies the theoretical grounds that justify the rationale. It also explains the meaning and role of the concept of state in dynamic programming, examines the purpose and function of the principle of optimality, and outlines solution strategies for problems defiant of conventi

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

    International Nuclear Information System (INIS)

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

    2013-01-01

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

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

    Directory of Open Access Journals (Sweden)

    S. M. Sohel Rana

    2015-09-01

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

  7. Dynamic modeling method for infrared smoke based on enhanced discrete phase model

    Science.gov (United States)

    Zhang, Zhendong; Yang, Chunling; Zhang, Yan; Zhu, Hongbo

    2018-03-01

    The dynamic modeling of infrared (IR) smoke plays an important role in IR scene simulation systems and its accuracy directly influences the system veracity. However, current IR smoke models cannot provide high veracity, because certain physical characteristics are frequently ignored in fluid simulation; simplifying the discrete phase as a continuous phase and ignoring the IR decoy missile-body spinning. To address this defect, this paper proposes a dynamic modeling method for IR smoke, based on an enhanced discrete phase model (DPM). A mathematical simulation model based on an enhanced DPM is built and a dynamic computing fluid mesh is generated. The dynamic model of IR smoke is then established using an extended equivalent-blackbody-molecule model. Experiments demonstrate that this model realizes a dynamic method for modeling IR smoke with higher veracity.

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

    Science.gov (United States)

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

    2015-01-01

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

  9. Dynamic programming models and applications

    CERN Document Server

    Denardo, Eric V

    2003-01-01

    Introduction to sequential decision processes covers use of dynamic programming in studying models of resource allocation, methods for approximating solutions of control problems in continuous time, production control, more. 1982 edition.

  10. Joint Chance-Constrained Dynamic Programming

    Science.gov (United States)

    Ono, Masahiro; Kuwata, Yoshiaki; Balaram, J. Bob

    2012-01-01

    This paper presents a novel dynamic programming algorithm with a joint chance constraint, which explicitly bounds the risk of failure in order to maintain the state within a specified feasible region. A joint chance constraint cannot be handled by existing constrained dynamic programming approaches since their application is limited to constraints in the same form as the cost function, that is, an expectation over a sum of one-stage costs. We overcome this challenge by reformulating the joint chance constraint into a constraint on an expectation over a sum of indicator functions, which can be incorporated into the cost function by dualizing the optimization problem. As a result, the primal variables can be optimized by a standard dynamic programming, while the dual variable is optimized by a root-finding algorithm that converges exponentially. Error bounds on the primal and dual objective values are rigorously derived. We demonstrate the algorithm on a path planning problem, as well as an optimal control problem for Mars entry, descent and landing. The simulations are conducted using a real terrain data of Mars, with four million discrete states at each time step.

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

    Science.gov (United States)

    Winkel, Brian

    2012-01-01

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

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

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

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

  15. IT0: Discrete Math and Programming Logic Topics as a Hybrid Alternative to CS0

    Science.gov (United States)

    Martin, Nancy L.

    2015-01-01

    This paper describes the development of a hybrid introductory course for students in their first or second year of an information systems technologies degree program at a large Midwestern university. The course combines topics from discrete mathematics and programming logic and design, a unique twist on most introductory courses. The objective of…

  16. Track Dynamics Program

    Science.gov (United States)

    1978-10-01

    8 Track Bushing Research, . . . . . . . . . . . * . . . 8 Advanced frack Concept Development ..... . . . . . 9 TECHNICAL DISCUSSION...machine design effort was conducted. The design which was developed has separate servocontrolled hydraulic actuators to apply radial...back bending-but, in the order and magnitude of the way the torsional stress is incurred in service. This suggests a programable, hydraulically actuated

  17. Asymptotic behavior of dynamical and control systems under perturbation and discretization

    CERN Document Server

    Grüne, Lars

    2002-01-01

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

  18. A discrete force allocation algorithm for modelling wind turbines in computational fluid dynamics

    DEFF Research Database (Denmark)

    Réthoré, Pierre-Elouan; Sørensen, Niels N.

    2012-01-01

    at the position of the wind turbine rotor to estimate correctly the power production and the rotor loading. The method proposed in this paper solves this issue by spreading the force on the direct neighbouring cells and applying an equivalent pressure jump at the cell faces. This can potentially open......This paper describes an algorithm for allocating discrete forces in computational fluid dynamics (CFD). Discrete forces are useful in wind energy CFD. They are used as an approximation of the wind turbine blades’ action on the wind (actuator disc/line), to model forests and to model turbulent...

  19. Dynamic Programming and Graph Algorithms in Computer Vision*

    Science.gov (United States)

    Felzenszwalb, Pedro F.; Zabih, Ramin

    2013-01-01

    Optimization is a powerful paradigm for expressing and solving problems in a wide range of areas, and has been successfully applied to many vision problems. Discrete optimization techniques are especially interesting, since by carefully exploiting problem structure they often provide non-trivial guarantees concerning solution quality. In this paper we briefly review dynamic programming and graph algorithms, and discuss representative examples of how these discrete optimization techniques have been applied to some classical vision problems. We focus on the low-level vision problem of stereo; the mid-level problem of interactive object segmentation; and the high-level problem of model-based recognition. PMID:20660950

  20. Secure Dynamic Program Repartitioning

    DEFF Research Database (Denmark)

    Hansen, Rene Rydhoff; Probst, Christian

    2005-01-01

    Secure program partitioning has been introduced as a language-based technique to allow the distribution of data and computation across mutualy untrusted hosts, while at the same time guaranteeing the protection of confidential data. Programs that have been annotated with security types......, but the partitioning compiler becomes a part of the network and can recompile applications, thus alowing hosts to enter or leave the framework. We contend that this setting is superior to static partitioning, since it allows redistribution of data and computations. This is especialy beneficial if the new host alows...... data and computations to better fulfil the trust requirements of the users. Erasure Policies ensure that the original host of the redistributed data or computation does not store the data any longer....

  1. Discrete opinion dynamics on networks based on social influence

    International Nuclear Information System (INIS)

    Hu Haibo; Wang Xiaofan

    2009-01-01

    A model of opinion dynamics based on social influence on networks was studied. The opinion of each agent can have integer values i = 1, 2, ..., I and opinion exchanges are restricted to connected agents. It was found that for any I ≥ 2 and self-confidence parameter 0 ≤ u i ) of the population that hold a given opinion i is a martingale, and the fraction q i of opinion i will gradually converge to (q i ). The tendency can slow down with the increase of degree assortativity of networks. When u is degree dependent, (q i ) does not possess the martingale property, however q i still converges to it. In both cases for a finite network the states of all agents will finally reach consensus. Further if there exist stubborn persons in the population whose opinions do not change over time, it was found that for degree-independent constant u, both q i and (q i ) will converge to fixed proportions which only depend on the distribution of initial obstinate persons, and naturally the final equilibrium state will be the coexistence of diverse opinions held by the stubborn people. The analytical results were verified by numerical simulations on Barabasi-Albert (BA) networks. The model highlights the influence of high-degree agents on the final consensus or coexistence state and captures some realistic features of the diffusion of opinions in social networks

  2. Discrete Adjoint-Based Design Optimization of Unsteady Turbulent Flows on Dynamic Unstructured Grids

    Science.gov (United States)

    Nielsen, Eric J.; Diskin, Boris; Yamaleev, Nail K.

    2009-01-01

    An adjoint-based methodology for design optimization of unsteady turbulent flows on dynamic unstructured grids is described. The implementation relies on an existing unsteady three-dimensional unstructured grid solver capable of dynamic mesh simulations and discrete adjoint capabilities previously developed for steady flows. The discrete equations for the primal and adjoint systems are presented for the backward-difference family of time-integration schemes on both static and dynamic grids. The consistency of sensitivity derivatives is established via comparisons with complex-variable computations. The current work is believed to be the first verified implementation of an adjoint-based optimization methodology for the true time-dependent formulation of the Navier-Stokes equations in a practical computational code. Large-scale shape optimizations are demonstrated for turbulent flows over a tiltrotor geometry and a simulated aeroelastic motion of a fighter jet.

  3. Dynamical barrier for the formation of solitary waves in discrete lattices

    International Nuclear Information System (INIS)

    Kevrekidis, P.G.; Espinola-Rocha, J.A.; Drossinos, Y.; Stefanov, A.

    2008-01-01

    We consider the problem of the existence of a dynamical barrier of 'mass' that needs to be excited on a lattice site to lead to the formation and subsequent persistence of localized modes for a nonlinear Schroedinger lattice. We contrast the existence of a dynamical barrier with its absence in the static theory of localized modes in one spatial dimension. We suggest an energetic criterion that provides a sufficient, but not necessary, condition on the amplitude of a single-site initial condition required to form a solitary wave. We show that this effect is not one-dimensional by considering its two-dimensional analog. The existence of a sufficient condition for the excitation of localized modes in the non-integrable, discrete, nonlinear Schroedinger equation is compared to the dynamics of excitations in the integrable, both discrete and continuum, version of the nonlinear Schroedinger equation

  4. Dynamical barrier for the formation of solitary waves in discrete lattices

    Energy Technology Data Exchange (ETDEWEB)

    Kevrekidis, P.G. [Department of Mathematics and Statistics, University of Massachusetts, Amherst, MA 01003 (United States)], E-mail: kevrekid@math.umass.edu; Espinola-Rocha, J.A. [Department of Mathematics and Statistics, University of Massachusetts, Amherst, MA 01003 (United States); Drossinos, Y. [European Commission, Joint Research Centre, I-21020 Ispra (Vatican City State, Holy See,) (Italy); School of Mechanical and Systems Engineering, University of Newcastle upon Tyne, Newcastle upon Tyne NE1 7RU (United Kingdom); Stefanov, A. [Department of Mathematics, University of Kansas, 1460 Jayhawk Blvd., Lawrence, KS 66045-7523 (United States)

    2008-03-24

    We consider the problem of the existence of a dynamical barrier of 'mass' that needs to be excited on a lattice site to lead to the formation and subsequent persistence of localized modes for a nonlinear Schroedinger lattice. We contrast the existence of a dynamical barrier with its absence in the static theory of localized modes in one spatial dimension. We suggest an energetic criterion that provides a sufficient, but not necessary, condition on the amplitude of a single-site initial condition required to form a solitary wave. We show that this effect is not one-dimensional by considering its two-dimensional analog. The existence of a sufficient condition for the excitation of localized modes in the non-integrable, discrete, nonlinear Schroedinger equation is compared to the dynamics of excitations in the integrable, both discrete and continuum, version of the nonlinear Schroedinger equation.

  5. Verifying detailed fluctuation relations for discrete feedback-controlled quantum dynamics

    Science.gov (United States)

    Camati, Patrice A.; Serra, Roberto M.

    2018-04-01

    Discrete quantum feedback control consists of a managed dynamics according to the information acquired by a previous measurement. Energy fluctuations along such dynamics satisfy generalized fluctuation relations, which are useful tools to study the thermodynamics of systems far away from equilibrium. Due to the practical challenge to assess energy fluctuations in the quantum scenario, the experimental verification of detailed fluctuation relations in the presence of feedback control remains elusive. We present a feasible method to experimentally verify detailed fluctuation relations for discrete feedback control quantum dynamics. Two detailed fluctuation relations are developed and employed. The method is based on a quantum interferometric strategy that allows the verification of fluctuation relations in the presence of feedback control. An analytical example to illustrate the applicability of the method is discussed. The comprehensive technique introduced here can be experimentally implemented at a microscale with the current technology in a variety of experimental platforms.

  6. Possibility/Necessity-Based Probabilistic Expectation Models for Linear Programming Problems with Discrete Fuzzy Random Variables

    Directory of Open Access Journals (Sweden)

    Hideki Katagiri

    2017-10-01

    Full Text Available This paper considers linear programming problems (LPPs where the objective functions involve discrete fuzzy random variables (fuzzy set-valued discrete random variables. New decision making models, which are useful in fuzzy stochastic environments, are proposed based on both possibility theory and probability theory. In multi-objective cases, Pareto optimal solutions of the proposed models are newly defined. Computational algorithms for obtaining the Pareto optimal solutions of the proposed models are provided. It is shown that problems involving discrete fuzzy random variables can be transformed into deterministic nonlinear mathematical programming problems which can be solved through a conventional mathematical programming solver under practically reasonable assumptions. A numerical example of agriculture production problems is given to demonstrate the applicability of the proposed models to real-world problems in fuzzy stochastic environments.

  7. Discrete opinion dynamics on networks based on social influence

    Energy Technology Data Exchange (ETDEWEB)

    Hu Haibo; Wang Xiaofan [Complex Networks and Control Lab, Shanghai Jiao Tong University, Shanghai 200240 (China)

    2009-06-05

    A model of opinion dynamics based on social influence on networks was studied. The opinion of each agent can have integer values i = 1, 2, ..., I and opinion exchanges are restricted to connected agents. It was found that for any I {>=} 2 and self-confidence parameter 0 {<=} u < 1, when u is a degree-independent constant, the weighted proportion (q{sub i}) of the population that hold a given opinion i is a martingale, and the fraction q{sub i} of opinion i will gradually converge to (q{sub i}). The tendency can slow down with the increase of degree assortativity of networks. When u is degree dependent, (q{sub i}) does not possess the martingale property, however q{sub i} still converges to it. In both cases for a finite network the states of all agents will finally reach consensus. Further if there exist stubborn persons in the population whose opinions do not change over time, it was found that for degree-independent constant u, both q{sub i} and (q{sub i}) will converge to fixed proportions which only depend on the distribution of initial obstinate persons, and naturally the final equilibrium state will be the coexistence of diverse opinions held by the stubborn people. The analytical results were verified by numerical simulations on Barabasi-Albert (BA) networks. The model highlights the influence of high-degree agents on the final consensus or coexistence state and captures some realistic features of the diffusion of opinions in social networks.

  8. A necessary condition for dispersal driven growth of populations with discrete patch dynamics.

    Science.gov (United States)

    Guiver, Chris; Packman, David; Townley, Stuart

    2017-07-07

    We revisit the question of when can dispersal-induced coupling between discrete sink populations cause overall population growth? Such a phenomenon is called dispersal driven growth and provides a simple explanation of how dispersal can allow populations to persist across discrete, spatially heterogeneous, environments even when individual patches are adverse or unfavourable. For two classes of mathematical models, one linear and one non-linear, we provide necessary conditions for dispersal driven growth in terms of the non-existence of a common linear Lyapunov function, which we describe. Our approach draws heavily upon the underlying positive dynamical systems structure. Our results apply to both discrete- and continuous-time models. The theory is illustrated with examples and both biological and mathematical conclusions are drawn. Copyright © 2017 The Authors. Published by Elsevier Ltd.. All rights reserved.

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2016-10-15

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

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

    Science.gov (United States)

    Schutte, Anne R; Spencer, John P

    2007-04-01

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

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

    Directory of Open Access Journals (Sweden)

    L. Brim

    2011-09-01

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

  12. The Expected Loss in the Discretization of Multistage Stochastic Programming Problems - Estimation and Convergence Rate

    Czech Academy of Sciences Publication Activity Database

    Šmíd, Martin

    2009-01-01

    Roč. 165, č. 1 (2009), s. 29-45 ISSN 0254-5330 R&D Projects: GA ČR GA402/04/1294 Institutional research plan: CEZ:AV0Z10750506 Keywords : multistage stochastic programming problems * approximation * discretization * Monte Carlo Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 0.961, year: 2009 http://library.utia.cas.cz/separaty/2008/E/smid-the expected loss in the discretization of multistage stochastic programming problems - estimation and convergence rate.pdf

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

  14. Discrete kink dynamics in hydrogen-bonded chains: The two-component model

    DEFF Research Database (Denmark)

    Karpan, V.M.; Zolotaryuk, Yaroslav; Christiansen, Peter Leth

    2004-01-01

    We study discrete topological solitary waves (kinks and antikinks) in two nonlinear diatomic chain models that describe the collective dynamics of proton transfers in one-dimensional hydrogen-bonded networks. The essential ingredients of the models are (i) a realistic (anharmonic) ion-proton inte......We study discrete topological solitary waves (kinks and antikinks) in two nonlinear diatomic chain models that describe the collective dynamics of proton transfers in one-dimensional hydrogen-bonded networks. The essential ingredients of the models are (i) a realistic (anharmonic) ion...... chain subject to a substrate with two optical bands), both providing a bistability of the hydrogen-bonded proton. Exact two-component (kink and antikink) discrete solutions for these models are found numerically. We compare the soliton solutions and their properties in both the one- (when the heavy ions...... principal differences, like a significant difference in the stability switchings behavior for the kinks and the antikinks. Water-filled carbon nanotubes are briefly discussed as possible realistic systems, where topological discrete (anti)kink states might exist....

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

    Directory of Open Access Journals (Sweden)

    S. M. Sohel Rana

    2015-06-01

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

  16. Granular contact dynamics using mathematical programming methods

    DEFF Research Database (Denmark)

    Krabbenhoft, K.; Lyamin, A. V.; Huang, J.

    2012-01-01

    granular contact dynamics formulation uses an implicit time discretization, thus allowing for large time steps. Moreover, in the limit of an infinite time step, the general dynamic formulation reduces to a static formulation that is useful in simulating common quasi-static problems such as triaxial tests...... is developed and it is concluded that the associated sliding rule, in the context of granular contact dynamics, may be viewed as an artifact of the time discretization and that the use of an associated flow rule at the particle scale level generally is physically acceptable. (C) 2012 Elsevier Ltd. All rights...

  17. Estimation of flow stress of radiation induced F/M steels using molecular dynamics and discrete dislocation dynamics approach

    International Nuclear Information System (INIS)

    More, Ameya; Dutta, B.K.; Durgaprasad, P.V.; Arya, A.K.

    2012-01-01

    Fe-Cr based Ferritic/Martensitic (F/M) steels are the candidate structural materials for future fusion reactors. In this work, a multi-scale approach comprising atomistic Molecular Dynamics (MD) simulations and Discrete Dislocation Dynamics (DDD) simulations are used to model the effect of irradiation dose on the flow stress of F/M steels. At the atomic scale, molecular dynamics simulations are used to study the dislocation interaction with irradiation induced defects, i.e. voids and He bubbles. Whereas, the DDD simulations are used to estimate the change in flow stress of the material as a result of irradiation hardening. (author)

  18. Adaptive dynamic programming with applications in optimal control

    CERN Document Server

    Liu, Derong; Wang, Ding; Yang, Xiong; Li, Hongliang

    2017-01-01

    This book covers the most recent developments in adaptive dynamic programming (ADP). The text begins with a thorough background review of ADP making sure that readers are sufficiently familiar with the fundamentals. In the core of the book, the authors address first discrete- and then continuous-time systems. Coverage of discrete-time systems starts with a more general form of value iteration to demonstrate its convergence, optimality, and stability with complete and thorough theoretical analysis. A more realistic form of value iteration is studied where value function approximations are assumed to have finite errors. Adaptive Dynamic Programming also details another avenue of the ADP approach: policy iteration. Both basic and generalized forms of policy-iteration-based ADP are studied with complete and thorough theoretical analysis in terms of convergence, optimality, stability, and error bounds. Among continuous-time systems, the control of affine and nonaffine nonlinear systems is studied using the ADP app...

  19. SEWER NETWORK DISCHARGE OPTIMIZATION USING THE DYNAMIC PROGRAMMING

    Directory of Open Access Journals (Sweden)

    Viorel MINZU

    2015-12-01

    Full Text Available It is necessary to adopt an optimal control that allows an efficient usage of the existing sewer networks, in order to avoid the building of new retention facilities. The main objective of the control action is to minimize the overflow volume of a sewer network. This paper proposes a method to apply a solution obtained by discrete dynamic programming through a realistic closed loop system.

  20. 3D Discrete Dislocation Dynamics: Influence of Segment Mobility on Critical Shear Stress

    Czech Academy of Sciences Publication Activity Database

    Záležák, Tomáš; Dlouhý, Antonín

    2015-01-01

    Roč. 128, č. 4 (2015), s. 654-656 ISSN 0587-4246. [ISPMA 13 - International Symposium on Physics of Materials /13./. Praha, 31.08.2014-04.09.2014] R&D Projects: GA MŠk(CZ) EE2.3.20.0214; GA ČR(CZ) GA14-22834S Institutional support: RVO:68081723 Keywords : metal matrix composites * discrete dislocation dynamics * high temperature creep Subject RIV: JG - Metallurgy Impact factor: 0.525, year: 2015

  1. DOMINO, Coupling of Discrete Ordinate Program DOT with Monte-Carlo Program MORSE

    International Nuclear Information System (INIS)

    1974-01-01

    1 - Nature of physical problem solved: DOMINO is a general purpose code for coupling discrete ordinates and Monte Carlo radiation transport calculations. 2 - Method of solution: DOMINO transforms the angular flux as a function of energy group, mesh interval and discrete angle into current and subsequently into normalized probability distributions. 3 - Restrictions on the complexity of the problem: The discrete ordinates calculation is limited to an r-z geometry

  2. Development of three-dimensional program based on Monte Carlo and discrete ordinates bidirectional coupling method

    International Nuclear Information System (INIS)

    Han Jingru; Chen Yixue; Yuan Longjun

    2013-01-01

    The Monte Carlo (MC) and discrete ordinates (SN) are the commonly used methods in the design of radiation shielding. Monte Carlo method is able to treat the geometry exactly, but time-consuming in dealing with the deep penetration problem. The discrete ordinate method has great computational efficiency, but it is quite costly in computer memory and it suffers from ray effect. Single discrete ordinates method or single Monte Carlo method has limitation in shielding calculation for large complex nuclear facilities. In order to solve the problem, the Monte Carlo and discrete ordinates bidirectional coupling method is developed. The bidirectional coupling method is implemented in the interface program to transfer the particle probability distribution of MC and angular flux of discrete ordinates. The coupling method combines the advantages of MC and SN. The test problems of cartesian and cylindrical coordinate have been calculated by the coupling methods. The calculation results are performed with comparison to MCNP and TORT and satisfactory agreements are obtained. The correctness of the program is proved. (authors)

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

    Science.gov (United States)

    Gan, Xiao; Albert, Réka

    2018-04-01

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

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

    Science.gov (United States)

    Gan, Xiao; Albert, Réka

    2018-04-01

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

  5. Estimation of system parameters in discrete dynamical systems from time series

    International Nuclear Information System (INIS)

    Palaniyandi, P.; Lakshmanan, M.

    2005-01-01

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

  6. CROSAT: A digital computer program for statistical-spectral analysis of two discrete time series

    International Nuclear Information System (INIS)

    Antonopoulos Domis, M.

    1978-03-01

    The program CROSAT computes directly from two discrete time series auto- and cross-spectra, transfer and coherence functions, using a Fast Fourier Transform subroutine. Statistical analysis of the time series is optional. While of general use the program is constructed to be immediately compatible with the ICL 4-70 and H316 computers at AEE Winfrith, and perhaps with minor modifications, with any other hardware system. (author)

  7. Generalized Second-Order Parametric Optimality Conditions in Semiinfinite Discrete Minmax Fractional Programming and Second-Order Univexity

    Directory of Open Access Journals (Sweden)

    Ram Verma

    2016-02-01

    Full Text Available This paper deals with mainly establishing numerous sets of generalized second order paramertic sufficient optimality conditions for a semiinfinite discrete minmax fractional programming problem, while the results on semiinfinite discrete minmax fractional programming problem achieved based on some partitioning schemes under various types of generalized second order univexity assumptions. 

  8. Discrete Adjoint-Based Design for Unsteady Turbulent Flows On Dynamic Overset Unstructured Grids

    Science.gov (United States)

    Nielsen, Eric J.; Diskin, Boris

    2012-01-01

    A discrete adjoint-based design methodology for unsteady turbulent flows on three-dimensional dynamic overset unstructured grids is formulated, implemented, and verified. The methodology supports both compressible and incompressible flows and is amenable to massively parallel computing environments. The approach provides a general framework for performing highly efficient and discretely consistent sensitivity analysis for problems involving arbitrary combinations of overset unstructured grids which may be static, undergoing rigid or deforming motions, or any combination thereof. General parent-child motions are also accommodated, and the accuracy of the implementation is established using an independent verification based on a complex-variable approach. The methodology is used to demonstrate aerodynamic optimizations of a wind turbine geometry, a biologically-inspired flapping wing, and a complex helicopter configuration subject to trimming constraints. The objective function for each problem is successfully reduced and all specified constraints are satisfied.

  9. Periodic Properties of 1D FE Discrete Models in High Frequency Dynamics

    Directory of Open Access Journals (Sweden)

    A. Żak

    2016-01-01

    Full Text Available Finite element discrete models of various engineering 1D structures may be considered as structures of certain periodic characteristics. The source of this periodicity comes from the discontinuity of stress/strain field between the elements. This behaviour remains unnoticeable, when low frequency dynamics of these structures is investigated. At high frequency regimes, however, its influence may be strong enough to dominate calculated structural responses distorting or even falsifying them completely. In this paper, certain computational aspects of structural periodicity of 1D FE discrete models are discussed by the authors. In this discussion, the authors focus their attention on an exemplary problem of 1D rod modelled according to the elementary theory.

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

    Science.gov (United States)

    Salceanu, Paul L

    2011-07-01

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

  11. Minimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy Heuristic

    Science.gov (United States)

    2014-01-01

    Berth allocation is the forefront operation performed when ships arrive at a port and is a critical task in container port optimization. Minimizing the time ships spend at berths constitutes an important objective of berth allocation problems. This study focuses on the discrete dynamic berth allocation problem (discrete DBAP), which aims to minimize total service time, and proposes an iterated greedy (IG) algorithm to solve it. The proposed IG algorithm is tested on three benchmark problem sets. Experimental results show that the proposed IG algorithm can obtain optimal solutions for all test instances of the first and second problem sets and outperforms the best-known solutions for 35 out of 90 test instances of the third problem set. PMID:25295295

  12. Minimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy Heuristic

    Directory of Open Access Journals (Sweden)

    Shih-Wei Lin

    2014-01-01

    Full Text Available Berth allocation is the forefront operation performed when ships arrive at a port and is a critical task in container port optimization. Minimizing the time ships spend at berths constitutes an important objective of berth allocation problems. This study focuses on the discrete dynamic berth allocation problem (discrete DBAP, which aims to minimize total service time, and proposes an iterated greedy (IG algorithm to solve it. The proposed IG algorithm is tested on three benchmark problem sets. Experimental results show that the proposed IG algorithm can obtain optimal solutions for all test instances of the first and second problem sets and outperforms the best-known solutions for 35 out of 90 test instances of the third problem set.

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

    Science.gov (United States)

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

    2014-03-01

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

  14. GPU accelerated Discrete Element Method (DEM) molecular dynamics for conservative, faceted particle simulations

    Energy Technology Data Exchange (ETDEWEB)

    Spellings, Matthew [Chemical Engineering, University of Michigan, 2800 Plymouth Rd., Ann Arbor, MI 48109 (United States); Biointerfaces Institute, University of Michigan, 2800 Plymouth Rd., Ann Arbor, MI 48109 (United States); Marson, Ryan L. [Materials Science & Engineering, University of Michigan, 2300 Hayward St., Ann Arbor, MI 48109 (United States); Biointerfaces Institute, University of Michigan, 2800 Plymouth Rd., Ann Arbor, MI 48109 (United States); Anderson, Joshua A. [Chemical Engineering, University of Michigan, 2800 Plymouth Rd., Ann Arbor, MI 48109 (United States); Biointerfaces Institute, University of Michigan, 2800 Plymouth Rd., Ann Arbor, MI 48109 (United States); Glotzer, Sharon C., E-mail: sglotzer@umich.edu [Chemical Engineering, University of Michigan, 2800 Plymouth Rd., Ann Arbor, MI 48109 (United States); Materials Science & Engineering, University of Michigan, 2300 Hayward St., Ann Arbor, MI 48109 (United States); Biointerfaces Institute, University of Michigan, 2800 Plymouth Rd., Ann Arbor, MI 48109 (United States)

    2017-04-01

    Faceted shapes, such as polyhedra, are commonly found in systems of nanoscale, colloidal, and granular particles. Many interesting physical phenomena, like crystal nucleation and growth, vacancy motion, and glassy dynamics are challenging to model in these systems because they require detailed dynamical information at the individual particle level. Within the granular materials community the Discrete Element Method has been used extensively to model systems of anisotropic particles under gravity, with friction. We provide an implementation of this method intended for simulation of hard, faceted nanoparticles, with a conservative Weeks–Chandler–Andersen (WCA) interparticle potential, coupled to a thermodynamic ensemble. This method is a natural extension of classical molecular dynamics and enables rigorous thermodynamic calculations for faceted particles.

  15. Discrete Mathematics

    DEFF Research Database (Denmark)

    Sørensen, John Aasted

    2011-01-01

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

  16. A study on discrete event dynamic model for nuclear operations of main feed water pump

    International Nuclear Information System (INIS)

    Bae, J. C.; Choi, J. I.

    2000-01-01

    A major objective of the study is to propose a supervisory control algorithm based on the discrete event dynamic system (DEDS) model and apply it to the automation of nuclear operations. The study is motivated by the suitability of the DEDS model for simulation of man-made control action and the potential of the DEDS based supervisory control algorithm for enhanced licensibility, when implemented in nuclear plants, through design transparency due to strong analytic backgrounds. The DEDS model can analytically show the robust stability of the proposed supervisory controller providing design transparency for enhanced licensibility when implemented in nuclear operations

  17. Dynamical Properties of Discrete-Time Background Neural Networks with Uniform Firing Rate

    Directory of Open Access Journals (Sweden)

    Min Wan

    2013-01-01

    Full Text Available The dynamics of a discrete-time background network with uniform firing rate and background input is investigated. The conditions for stability are firstly derived. An invariant set is then obtained so that the nondivergence of the network can be guaranteed. In the invariant set, it is proved that all trajectories of the network starting from any nonnegative value will converge to a fixed point under some conditions. In addition, bifurcation and chaos are discussed. It is shown that the network can engender bifurcation and chaos with the increase of background input. The computations of Lyapunov exponents confirm the chaotic behaviors.

  18. 3D Discrete Dislocation Dynamics Applied to Interactions between Dislocation Walls and Particles

    Czech Academy of Sciences Publication Activity Database

    Záležák, Tomáš; Dlouhý, Antonín

    2012-01-01

    Roč. 122, č. 3 (2012), s. 450-452 ISSN 0587-4246. [International Symposium on Physics of Materials /12./ - ISPMA 12. Prague, 04.09.2011-08.09.2011] R&D Projects: GA ČR GD106/09/H035; GA ČR GA202/09/2073; GA MŠk OC 162 Institutional research plan: CEZ:AV0Z20410507 Keywords : 3D discrete dislocation dynamics * tilt boundary * migration * diffusion * pecipitation hardening Subject RIV: JG - Metallurgy Impact factor: 0.531, year: 2012

  19. Recent Progress in Discrete Dislocation Dynamics and Its Applications to Micro Plasticity

    KAUST Repository

    Po, Giacomo; Mohamed, Mamdouh S.; Crosby, Tamer; Erel, Can; El-Azab, Anter; Ghoniem, Nasr

    2014-01-01

    We present a self-contained review of the discrete dislocation dynamics (DDD) method for the numerical investigation of plasticity in crystals, focusing on recent development and implementation progress. The review covers the theoretical foundations of DDD within the framework of incompatible elasticity, its numerical implementation via the nodal method, the extension of the method to finite domains and several implementation details. Applications of the method to current topics in micro-plasticity are presented, including the size effects in nano-indentation, the evolution of the dislocation microstructure in persistent slip bands, and the phenomenon of dislocation avalanches in micro-pillar compression.

  20. Crystallographic fatigue crack growth in a polycrystal: simulations based on FEM and discrete dislocation dynamics

    International Nuclear Information System (INIS)

    Bertolino, G.; Sauzay, M.; Bertolino, G.; Doquet, V.

    2003-01-01

    An attempt to model the variability of short cracks development in high-cycle fatigue is made by coupling finite element calculations of the stresses ahead of a microcrack in a polycrystal with simulations of crack growth along slip planes based on discrete dislocations dynamics. The model predicts a large scatter in growth rates related to the roughness of the crack path. It also describes the influence of the mean grain size and the fact that overloads may suppress the endurance limit by allowing arrested cracks to cross the grain boundaries. (authors)

  1. Evaluating the Dynamics of Aircraft Crew Skill Development by Using the Results of Discrete Exercise Marking

    Directory of Open Access Journals (Sweden)

    Lešinskis Aloizs

    2017-08-01

    Full Text Available Aircraft crew training corresponds to the interactive learning models of sensorimotor skill acquisition, and the dynamics of skill acquirement can be approximated by the exponential trend. A model of 5-grade assessment of separate exercises is offered. It helps to calculate a resulting evaluation, in accordance with which the progress level of a discrete exercise is evaluated. Such an evaluation forms one of the points for the analytical construction of a learning curve using the Gaussian method. Possible applications of the learning curve are covered.

  2. Recent Progress in Discrete Dislocation Dynamics and Its Applications to Micro Plasticity

    KAUST Repository

    Po, Giacomo

    2014-09-27

    We present a self-contained review of the discrete dislocation dynamics (DDD) method for the numerical investigation of plasticity in crystals, focusing on recent development and implementation progress. The review covers the theoretical foundations of DDD within the framework of incompatible elasticity, its numerical implementation via the nodal method, the extension of the method to finite domains and several implementation details. Applications of the method to current topics in micro-plasticity are presented, including the size effects in nano-indentation, the evolution of the dislocation microstructure in persistent slip bands, and the phenomenon of dislocation avalanches in micro-pillar compression.

  3. Dynamics of a discrete geotropic sensor subject to rotation-induced gravity compensation

    Energy Technology Data Exchange (ETDEWEB)

    Silver, I.L.

    1976-01-01

    A clinostat achieves gravity compensation by providing circular rotation with uniform speed, about a horizontal axis. The dynamics of an assumed, discrete and free-moving subcellular gravity receptor, subject to clinostat rotation, is analyzed. The results imply that there is an optimum rotation rate; higher speeds result in circular motions with diameters more comparable to thermal noise fluctuations, but with greater linear velocities due to increasing centrifugal forces. An optimizing function is proposed. The nucleolus and mitochondrion is chosen as a gravity receptor for illustrating the use of this theory. The characteristics of their clinostat-induced motions are incorporated with experimental results on Avena plant shoots in an illustrative example.

  4. Dynamic covalent gels assembled from small molecules:from discrete gelators to dynamic covalent polymers

    Institute of Scientific and Technical Information of China (English)

    Jian-Yong Zhang; Li-Hua Zeng; Juan Feng

    2017-01-01

    Dynamic covalent chemistry has emerged recently to be a powerful tool to construct functional materials.This article reviews the progress in the research and development of dynamic covalent chemistry in gels assembled from small molecules.First dynamic covalent reactions used in gels are reviewed to understand the dynamic covalent bonding.Afterwards the catalogues of dynamic covalent gels are reviewed according to the nature of gelators and the interactions between gelators.Dynamic covalent bonding can be involved to form low molecular weight gelators.Low molecular weight molecules with multiple functional groups react to form dynamic covalent cross-linked polymers and act as gelators.Two catalogues of gels show different properties arising from their different structures.This review aims to illustrate the structure-property relationships of these dynamic covalent gels.

  5. Fluid dynamics computer programs for NERVA turbopump

    Science.gov (United States)

    Brunner, J. J.

    1972-01-01

    During the design of the NERVA turbopump, numerous computer programs were developed for the analyses of fluid dynamic problems within the machine. Program descriptions, example cases, users instructions, and listings for the majority of these programs are presented.

  6. Intensive Research Program on Advances in Nonsmooth Dynamics 2016

    CERN Document Server

    Jeffrey, Mike; Lázaro, J; Olm, Josep

    2017-01-01

    This volume contains extended abstracts outlining selected talks and other selected presentations given by participants throughout the "Intensive Research Program on Advances in Nonsmooth Dynamics 2016", held at the Centre de Recerca Matemàtica (CRM) in Barcelona from February 1st to April 29th, 2016. They include brief research articles reporting new results, descriptions of preliminary work or open problems, and outlines of prominent discussion sessions. The articles are all the result of direct collaborations initiated during the research program. The topic is the theory and applications of Nonsmooth Dynamics. This includes systems involving elements of: impacting, switching, on/off control, hybrid discrete-continuous dynamics, jumps in physical properties, and many others. Applications include: electronics, climate modeling, life sciences, mechanics, ecology, and more. Numerous new results are reported concerning the dimensionality and robustness of nonsmooth models, shadowing variables, numbers of limit...

  7. Complex dynamics of a delayed discrete neural network of two nonidentical neurons

    Energy Technology Data Exchange (ETDEWEB)

    Chen, Yuanlong [Mathematics Department, GuangDong University of Finance, Guangzhou 510521 (China); Huang, Tingwen [Mathematics Department, Texas A and M University at Qatar, P. O. Box 23874, Doha (Qatar); Huang, Yu, E-mail: stshyu@mail.sysu.edu.cn [Mathematics Department, Sun Yat-Sen University, Guangzhou 510275, People' s Republic China (China)

    2014-03-15

    In this paper, we discover that a delayed discrete Hopfield neural network of two nonidentical neurons with self-connections and no self-connections can demonstrate chaotic behaviors. To this end, we first transform the model, by a novel way, into an equivalent system which has some interesting properties. Then, we identify the chaotic invariant set for this system and show that the dynamics of this system within this set is topologically conjugate to the dynamics of the full shift map with two symbols. This confirms chaos in the sense of Devaney. Our main results generalize the relevant results of Huang and Zou [J. Nonlinear Sci. 15, 291–303 (2005)], Kaslik and Balint [J. Nonlinear Sci. 18, 415–432 (2008)] and Chen et al. [Sci. China Math. 56(9), 1869–1878 (2013)]. We also give some numeric simulations to verify our theoretical results.

  8. Individual chaos implies collective chaos for weakly mixing discrete dynamical systems

    International Nuclear Information System (INIS)

    Liao Gongfu; Ma Xianfeng; Wang Lidong

    2007-01-01

    Let X be a metric space (X,f) a discrete dynamical system, where f:X->X is a continuous function. Let f-bar denote the natural extension of f to the space of all non-empty compact subsets of X endowed with Hausdorff metric induced by d. In this paper we investigate some dynamical properties of f and f-bar . It is proved that f is weakly mixing (mixing) if and only if f-bar is weakly mixing (mixing, respectively). From this, we deduce that weak-mixing of f implies transitivity of f-bar , further, if f is mixing or weakly mixing, then chaoticity of f (individual chaos) implies chaoticity of f-bar (collective chaos) and if X is a closed interval then f-bar is chaotic (in the sense of Devaney) if and only if f is weakly mixing

  9. Complex dynamics of a delayed discrete neural network of two nonidentical neurons

    International Nuclear Information System (INIS)

    Chen, Yuanlong; Huang, Tingwen; Huang, Yu

    2014-01-01

    In this paper, we discover that a delayed discrete Hopfield neural network of two nonidentical neurons with self-connections and no self-connections can demonstrate chaotic behaviors. To this end, we first transform the model, by a novel way, into an equivalent system which has some interesting properties. Then, we identify the chaotic invariant set for this system and show that the dynamics of this system within this set is topologically conjugate to the dynamics of the full shift map with two symbols. This confirms chaos in the sense of Devaney. Our main results generalize the relevant results of Huang and Zou [J. Nonlinear Sci. 15, 291–303 (2005)], Kaslik and Balint [J. Nonlinear Sci. 18, 415–432 (2008)] and Chen et al. [Sci. China Math. 56(9), 1869–1878 (2013)]. We also give some numeric simulations to verify our theoretical results

  10. Complex dynamics of a delayed discrete neural network of two nonidentical neurons.

    Science.gov (United States)

    Chen, Yuanlong; Huang, Tingwen; Huang, Yu

    2014-03-01

    In this paper, we discover that a delayed discrete Hopfield neural network of two nonidentical neurons with self-connections and no self-connections can demonstrate chaotic behaviors. To this end, we first transform the model, by a novel way, into an equivalent system which has some interesting properties. Then, we identify the chaotic invariant set for this system and show that the dynamics of this system within this set is topologically conjugate to the dynamics of the full shift map with two symbols. This confirms chaos in the sense of Devaney. Our main results generalize the relevant results of Huang and Zou [J. Nonlinear Sci. 15, 291-303 (2005)], Kaslik and Balint [J. Nonlinear Sci. 18, 415-432 (2008)] and Chen et al. [Sci. China Math. 56(9), 1869-1878 (2013)]. We also give some numeric simulations to verify our theoretical results.

  11. Analysis of discrete and continuous distributions of ventilatory time constants from dynamic computed tomography

    International Nuclear Information System (INIS)

    Doebrich, Marcus; Markstaller, Klaus; Karmrodt, Jens; Kauczor, Hans-Ulrich; Eberle, Balthasar; Weiler, Norbert; Thelen, Manfred; Schreiber, Wolfgang G

    2005-01-01

    In this study, an algorithm was developed to measure the distribution of pulmonary time constants (TCs) from dynamic computed tomography (CT) data sets during a sudden airway pressure step up. Simulations with synthetic data were performed to test the methodology as well as the influence of experimental noise. Furthermore the algorithm was applied to in vivo data. In five pigs sudden changes in airway pressure were imposed during dynamic CT acquisition in healthy lungs and in a saline lavage ARDS model. The fractional gas content in the imaged slice (FGC) was calculated by density measurements for each CT image. Temporal variations of the FGC were analysed assuming a model with a continuous distribution of exponentially decaying time constants. The simulations proved the feasibility of the method. The influence of experimental noise could be well evaluated. Analysis of the in vivo data showed that in healthy lungs ventilation processes can be more likely characterized by discrete TCs whereas in ARDS lungs continuous distributions of TCs are observed. The temporal behaviour of lung inflation and deflation can be characterized objectively using the described new methodology. This study indicates that continuous distributions of TCs reflect lung ventilation mechanics more accurately compared to discrete TCs

  12. Dynamics in discrete two-dimensional nonlinear Schrödinger equations in the presence of point defects

    DEFF Research Database (Denmark)

    Christiansen, Peter Leth; Gaididei, Yuri Borisovich; Rasmussen, Kim

    1996-01-01

    The dynamics of two-dimensional discrete structures is studied in the framework of the generalized two-dimensional discrete nonlinear Schrodinger equation. The nonlinear coupling in the form of the Ablowitz-Ladik nonlinearity and point impurities is taken into account. The stability properties...... of the stationary solutions are examined. The essential importance of the existence of stable immobile solitons in the two-dimensional dynamics of the traveling pulses is demonstrated. The typical scenario of the two-dimensional quasicollapse of a moving intense pulse represents the formation of standing trapped...... narrow spikes. The influence of the point impurities on this dynamics is also investigated....

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

    Directory of Open Access Journals (Sweden)

    V. Gontar

    1997-01-01

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

  14. Criteria for prioritization of HIV programs in Viet Nam: a discrete choice experiment

    Directory of Open Access Journals (Sweden)

    Ali Safarnejad

    2017-11-01

    Full Text Available Abstract Background With the decline in funding for Viet Nam’s response to the HIV epidemic, there is a need for evidence on the criteria to guide the prioritization of HIV programs. There is a gap in the research on the relative importance of multiple criteria for prioritizing a package of interventions. This study elicits preferences and the trade-offs made between different HIV programs by relevant stakeholders and decision-makers in Viet Nam. It also pays attention to how differences in social and professional characteristics of stakeholders and their agency affiliations shape preferences for HIV program criteria in Viet Nam. Methods This study uses self-explicated ranking and discrete choice experiments to determine the relative importance of five criteria - effectiveness, feasibility, cost-effectiveness, rate of investment and prevention/treatment investment ratio - to stakeholders when they evaluate and select hypothetical HIV programs. The study includes 69 participants from government, civil society, and international development partners. Results Results of the discrete choice experiment show that overall the feasibility criterion is ranked highest in importance to the participants when choosing a hypothetical HIV program, followed by sustainability, treatment to prevention spending ratio, and effectiveness. The participant’s work in management, programming, or decision-making has a significant effect on the importance of some criteria to the participant. In the self-explicated ranking effectiveness is the most important criterion and the cost-effectiveness criterion ranks low in importance across all groups. Conclusions This study has shown that the preferred HIV program in Viet Nam is feasible, front-loaded for sustainability, has a higher proportion of investment on prevention, saves more lives and prevents more infections. Similarities in government and civil society rankings of criteria can create common grounds for future

  15. Criteria for prioritization of HIV programs in Viet Nam: a discrete choice experiment.

    Science.gov (United States)

    Safarnejad, Ali; Pavlova, Milena; Son, Vo Hai; Phuong, Huynh Lan; Groot, Wim

    2017-11-13

    With the decline in funding for Viet Nam's response to the HIV epidemic, there is a need for evidence on the criteria to guide the prioritization of HIV programs. There is a gap in the research on the relative importance of multiple criteria for prioritizing a package of interventions. This study elicits preferences and the trade-offs made between different HIV programs by relevant stakeholders and decision-makers in Viet Nam. It also pays attention to how differences in social and professional characteristics of stakeholders and their agency affiliations shape preferences for HIV program criteria in Viet Nam. This study uses self-explicated ranking and discrete choice experiments to determine the relative importance of five criteria - effectiveness, feasibility, cost-effectiveness, rate of investment and prevention/treatment investment ratio - to stakeholders when they evaluate and select hypothetical HIV programs. The study includes 69 participants from government, civil society, and international development partners. Results of the discrete choice experiment show that overall the feasibility criterion is ranked highest in importance to the participants when choosing a hypothetical HIV program, followed by sustainability, treatment to prevention spending ratio, and effectiveness. The participant's work in management, programming, or decision-making has a significant effect on the importance of some criteria to the participant. In the self-explicated ranking effectiveness is the most important criterion and the cost-effectiveness criterion ranks low in importance across all groups. This study has shown that the preferred HIV program in Viet Nam is feasible, front-loaded for sustainability, has a higher proportion of investment on prevention, saves more lives and prevents more infections. Similarities in government and civil society rankings of criteria can create common grounds for future policy dialogues between stakeholders. Innovative models of planning should

  16. Multiobjective Two-Stage Stochastic Programming Problems with Interval Discrete Random Variables

    Directory of Open Access Journals (Sweden)

    S. K. Barik

    2012-01-01

    Full Text Available Most of the real-life decision-making problems have more than one conflicting and incommensurable objective functions. In this paper, we present a multiobjective two-stage stochastic linear programming problem considering some parameters of the linear constraints as interval type discrete random variables with known probability distribution. Randomness of the discrete intervals are considered for the model parameters. Further, the concepts of best optimum and worst optimum solution are analyzed in two-stage stochastic programming. To solve the stated problem, first we remove the randomness of the problem and formulate an equivalent deterministic linear programming model with multiobjective interval coefficients. Then the deterministic multiobjective model is solved using weighting method, where we apply the solution procedure of interval linear programming technique. We obtain the upper and lower bound of the objective function as the best and the worst value, respectively. It highlights the possible risk involved in the decision-making tool. A numerical example is presented to demonstrate the proposed solution procedure.

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

    Science.gov (United States)

    Catozzi, S; Sepulchre, J-A

    2017-08-01

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

  18. Discrete Mathematics

    DEFF Research Database (Denmark)

    Sørensen, John Aasted

    2010-01-01

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

  19. Discrete Mathematics

    DEFF Research Database (Denmark)

    Sørensen, John Aasted

    2010-01-01

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

  20. Numerical simulations of granular dynamics: I. Hard-sphere discrete element method and tests

    Science.gov (United States)

    Richardson, Derek C.; Walsh, Kevin J.; Murdoch, Naomi; Michel, Patrick

    2011-03-01

    We present a new particle-based (discrete element) numerical method for the simulation of granular dynamics, with application to motions of particles on small solar system body and planetary surfaces. The method employs the parallel N-body tree code pkdgrav to search for collisions and compute particle trajectories. Collisions are treated as instantaneous point-contact events between rigid spheres. Particle confinement is achieved by combining arbitrary combinations of four provided wall primitives, namely infinite plane, finite disk, infinite cylinder, and finite cylinder, and degenerate cases of these. Various wall movements, including translation, oscillation, and rotation, are supported. We provide full derivations of collision prediction and resolution equations for all geometries and motions. Several tests of the method are described, including a model granular “atmosphere” that achieves correct energy equipartition, and a series of tumbler simulations that show the expected transition from tumbling to centrifuging as a function of rotation rate.

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

    Science.gov (United States)

    Aftab, Muhammad Saleheen; Shafiq, Muhammad

    2015-11-01

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

  2. Equilibrium Model of Discrete Dynamic Supply Chain Network with Random Demand and Advertisement Strategy

    Directory of Open Access Journals (Sweden)

    Guitao Zhang

    2014-01-01

    Full Text Available The advertisement can increase the consumers demand; therefore it is one of the most important marketing strategies in the operations management of enterprises. This paper aims to analyze the impact of advertising investment on a discrete dynamic supply chain network which consists of suppliers, manufactures, retailers, and demand markets associated at different tiers under random demand. The impact of advertising investment will last several planning periods besides the current period due to delay effect. Based on noncooperative game theory, variational inequality, and Lagrange dual theory, the optimal economic behaviors of the suppliers, the manufactures, the retailers, and the consumers in the demand markets are modeled. In turn, the supply chain network equilibrium model is proposed and computed by modified project contraction algorithm with fixed step. The effectiveness of the model is illustrated by numerical examples, and managerial insights are obtained through the analysis of advertising investment in multiple periods and advertising delay effect among different periods.

  3. High temperature dislocation processes in precipitation hardened crystals investigated by a 3D discrete dislocation dynamics

    Czech Academy of Sciences Publication Activity Database

    Záležák, Tomáš; Svoboda, Jiří; Dlouhý, Antonín

    2017-01-01

    Roč. 97, OCT (2017), s. 1-23 ISSN 0749-6419 R&D Projects: GA ČR(CZ) GA14-22834S; GA ČR(CZ) GA202/09/2073; GA ČR(CZ) GD106/09/H035; GA MŠk(CZ) EE2.3.20.0214; GA MŠk OC 162 EU Projects: European Commission(XE) 309916 - Z-ULTRA Institutional support: RVO:68081723 Keywords : 3D discrete dislocation dynamics * Dislocations * Strengthening mechanisms * Low angle grain boundaries * Particulate reinforced material Subject RIV: JI - Composite Materials OBOR OECD: Composites (including laminates, reinforced plastics, cermets, combined natural and synthetic fibre fabrics Impact factor: 5.702, year: 2016

  4. Neimark-Sacker bifurcations and evidence of chaos in a discrete dynamical model of walkers

    International Nuclear Information System (INIS)

    Rahman, Aminur; Blackmore, Denis

    2016-01-01

    Bouncing droplets on a vibrating fluid bath can exhibit wave-particle behavior, such as being propelled by interacting with its own wave field. These droplets seem to walk across the bath, and thus are dubbed walkers. Experiments have shown that walkers can exhibit exotic dynamical behavior indicative of chaos. While the integro-differential models developed for these systems agree well with the experiments, they are difficult to analyze mathematically. In recent years, simpler discrete dynamical models have been derived and studied numerically. The numerical simulations of these models show evidence of exotic dynamics such as period doubling bifurcations, Neimark–Sacker (N–S) bifurcations, and even chaos. For example, in [1], based on simulations Gilet conjectured the existence of a supercritical N-S bifurcation as the damping factor in his one- dimensional path model. We prove Gilet’s conjecture and more; in fact, both supercritical and subcritical (N-S) bifurcations are produced by separately varying the damping factor and wave-particle coupling for all eigenmode shapes. Then we compare our theoretical results with some previous and new numerical simulations, and find complete qualitative agreement. Furthermore, evidence of chaos is shown by numerically studying a global bifurcation.

  5. Fashion cycle dynamics in a model with endogenous discrete evolution of heterogeneous preferences

    Science.gov (United States)

    Naimzada, A. K.; Pireddu, M.

    2018-05-01

    We propose a discrete-time exchange economy evolutionary model, in which two groups of agents are characterized by different preference structures. The reproduction level of a group is related to its attractiveness degree, which depends on the social visibility level, determined by the consumption choices of the agents in that group. The attractiveness of a group is initially increasing with its visibility level, but it becomes decreasing when its visibility exceeds a given threshold value, due to a congestion effect. Thanks to the combined action of the price mechanism and of the share updating rule, the model is able to reproduce the recurrent dynamic behavior typical of the fashion cycle, presenting booms and busts both in the agents' consumption choices and in the population shares. More precisely, we investigate the existence of equilibria and their stability, and we perform a qualitative bifurcation analysis on varying the parameter describing the group's heterogeneity degree. From a global viewpoint, we detect, among others, multistability phenomena in which the group coexistence is dynamic, either regular or irregular, and the fashion cycle occurs. The existence of complex dynamics is proven via the method of the turbulent maps, working with homoclinic orbits. Finally, we provide a social and economic interpretation of the main scenarios.

  6. Bureaucratic discretion and alternative teacher certification: understanding program variation in Missouri.

    Directory of Open Access Journals (Sweden)

    Ethan B. Heinen

    2007-06-01

    Full Text Available Alternative teacher certification literature has contributed significantly to our understanding of this approach to teacher preparation. However, this literature has more often than not treated alternative teacher certification programs (ATCPs as a black box, thus ignoring program heterogeneity. The present study examines how and why five ATCPs in Missouri have evolved in different ways. To understand this variation and its potential significance for researchers and practitioners, we use political science literature on bureaucratic discretion to understand programs' varied responses within the same state policy context. Using a multiple case study design, we present two key findings. First, external factors such as the state's regulatory approach, programs' relationships with school districts, and programs' relationship with external partners shape program coordinators' perceptions of their discretionary authority. Second, within an environment of limited regulation, programs responded to these external factors in ways that shaped programs in dramatically different ways. These approaches ranged from formal partnerships with large urban school districts and philanthropic funders to alternative certification programs that were at least partially blended with existing undergraduate and post baccalaureate teacher preparation programs. In our discussion, we explore how state attempts to widen the discretionary space between the rules may have allowed external interests (e.g., school districts, and external funders to backfill that space in ways that limit the potential for programs to provide high quality preparation experiences. This study explores these consequences and trade offs in order to inform policy makers and practitioners who are concerned with fostering innovative and creative ways to prepare high quality teachers.

  7. A new discrete dynamic model of ABA-induced stomatal closure predicts key feedback loops.

    Directory of Open Access Journals (Sweden)

    Réka Albert

    2017-09-01

    Full Text Available Stomata, microscopic pores in leaf surfaces through which water loss and carbon dioxide uptake occur, are closed in response to drought by the phytohormone abscisic acid (ABA. This process is vital for drought tolerance and has been the topic of extensive experimental investigation in the last decades. Although a core signaling chain has been elucidated consisting of ABA binding to receptors, which alleviates negative regulation by protein phosphatases 2C (PP2Cs of the protein kinase OPEN STOMATA 1 (OST1 and ultimately results in activation of anion channels, osmotic water loss, and stomatal closure, over 70 additional components have been identified, yet their relationships with each other and the core components are poorly elucidated. We integrated and processed hundreds of disparate observations regarding ABA signal transduction responses underlying stomatal closure into a network of 84 nodes and 156 edges and, as a result, established those relationships, including identification of a 36-node, strongly connected (feedback-rich component as well as its in- and out-components. The network's domination by a feedback-rich component may reflect a general feature of rapid signaling events. We developed a discrete dynamic model of this network and elucidated the effects of ABA plus knockout or constitutive activity of 79 nodes on both the outcome of the system (closure and the status of all internal nodes. The model, with more than 1024 system states, is far from fully determined by the available data, yet model results agree with existing experiments in 82 cases and disagree in only 17 cases, a validation rate of 75%. Our results reveal nodes that could be engineered to impact stomatal closure in a controlled fashion and also provide over 140 novel predictions for which experimental data are currently lacking. Noting the paucity of wet-bench data regarding combinatorial effects of ABA and internal node activation, we experimentally confirmed

  8. A new discrete dynamic model of ABA-induced stomatal closure predicts key feedback loops.

    Science.gov (United States)

    Albert, Réka; Acharya, Biswa R; Jeon, Byeong Wook; Zañudo, Jorge G T; Zhu, Mengmeng; Osman, Karim; Assmann, Sarah M

    2017-09-01

    Stomata, microscopic pores in leaf surfaces through which water loss and carbon dioxide uptake occur, are closed in response to drought by the phytohormone abscisic acid (ABA). This process is vital for drought tolerance and has been the topic of extensive experimental investigation in the last decades. Although a core signaling chain has been elucidated consisting of ABA binding to receptors, which alleviates negative regulation by protein phosphatases 2C (PP2Cs) of the protein kinase OPEN STOMATA 1 (OST1) and ultimately results in activation of anion channels, osmotic water loss, and stomatal closure, over 70 additional components have been identified, yet their relationships with each other and the core components are poorly elucidated. We integrated and processed hundreds of disparate observations regarding ABA signal transduction responses underlying stomatal closure into a network of 84 nodes and 156 edges and, as a result, established those relationships, including identification of a 36-node, strongly connected (feedback-rich) component as well as its in- and out-components. The network's domination by a feedback-rich component may reflect a general feature of rapid signaling events. We developed a discrete dynamic model of this network and elucidated the effects of ABA plus knockout or constitutive activity of 79 nodes on both the outcome of the system (closure) and the status of all internal nodes. The model, with more than 1024 system states, is far from fully determined by the available data, yet model results agree with existing experiments in 82 cases and disagree in only 17 cases, a validation rate of 75%. Our results reveal nodes that could be engineered to impact stomatal closure in a controlled fashion and also provide over 140 novel predictions for which experimental data are currently lacking. Noting the paucity of wet-bench data regarding combinatorial effects of ABA and internal node activation, we experimentally confirmed several predictions

  9. Neutrophil programming dynamics and its disease relevance.

    Science.gov (United States)

    Ran, Taojing; Geng, Shuo; Li, Liwu

    2017-11-01

    Neutrophils are traditionally considered as first responders to infection and provide antimicrobial host defense. However, recent advances indicate that neutrophils are also critically involved in the modulation of host immune environments by dynamically adopting distinct functional states. Functionally diverse neutrophil subsets are increasingly recognized as critical components mediating host pathophysiology. Despite its emerging significance, molecular mechanisms as well as functional relevance of dynamically programmed neutrophils remain to be better defined. The increasing complexity of neutrophil functions may require integrative studies that address programming dynamics of neutrophils and their pathophysiological relevance. This review aims to provide an update on the emerging topics of neutrophil programming dynamics as well as their functional relevance in diseases.

  10. Program to solve the multigroup discrete ordinates transport equation in (x,y,z) geometry

    International Nuclear Information System (INIS)

    Lathrop, K.D.

    1976-04-01

    Numerical formulations and programming algorithms are given for the THREETRAN computer program which solves the discrete ordinates, multigroup transport equation in (x,y,z) geometry. An efficient, flexible, and general data-handling strategy is derived to make use of three hierarchies of storage: small core memory, large core memory, and disk file. Data management, input instructions, and sample problem output are described. A six-group, S 4 , 18 502 mesh point, 2 800 zone, k/sub eff/ calculation of the ZPPR-4 critical assembly required 144 min of CDC-7600 time to execute to a convergence tolerance of 5 x 10 -4 and gave results in good qualitative agreement with experiment and other calculations. 6 references

  11. The Repeated School-to-Work Transition: Evidence from a Dynamic Programming Model

    DEFF Research Database (Denmark)

    Nielsen, Helena Skyt

    by youths after high school graduation. It is assumed that the decision is taken year by year, and it is analyzed in a discrete choice dynamic programming model. In this forward-looking behavioral model, it is shown that a small bonus would remove interruptions of the educational careers just after high...

  12. A dynamic programming approach for optimizing train speed profiles with speed restrictions and passage points

    DEFF Research Database (Denmark)

    Haahr, Jørgen Thorlund; Pisinger, David; Sabbaghian, Mohammad

    2017-01-01

    This paper considers a novel solution method for generating improved train speed profiles with reduced energy consumption. The solution method makes use of a time-space graph formulation which can be solved through Dynamic Programming. Instead of using uniform discretization of time and space...

  13. Discrete element modeling of triggered slip in faults with granular gouge: application to dynamic earthquake triggering

    International Nuclear Information System (INIS)

    Ferdowsi, B.

    2014-01-01

    Recent seismological observations based on new, more sensitive instrumentation show that seismic waves radiated from large earthquakes can trigger other earthquakes globally. This phenomenon is called dynamic earthquake triggering and is well-documented for over 30 of the largest earthquakes worldwide. Granular materials are at the core of mature earthquake faults and play a key role in fault triggering by exhibiting a rich nonlinear response to external perturbations. The stick-slip dynamics in sheared granular layers is analogous to the seismic cycle for earthquake fault systems. In this research effort, we characterize the macroscopic scale statistics and the grain-scale mechanisms of triggered slip in sheared granular layers. We model the granular fault gouge using three dimensional discrete element method simulations. The modeled granular system is put into stick-slip dynamics by applying a conning pressure and a shear load. The dynamic triggering is simulated by perturbing the spontaneous stick-slip dynamics using an external vibration applied to the boundary of the layer. The influences of the triggering consist in a frictional weakening during the vibration interval, a clock advance of the next expected large slip event and long term effects in the form of suppression and recovery of the energy released from the granular layer. Our study suggests that above a critical amplitude, vibration causes a significant clock advance of large slip events. We link this clock advance to a major decline in the slipping contact ratio as well as a decrease in shear modulus and weakening of the granular gouge layer. We also observe that shear vibration is less effective in perturbing the stick-slip dynamics of the granular layer. Our study suggests that in order to have an effective triggering, the input vibration must also explore the granular layer at length scales about or less than the average grain size. The energy suppression and the subsequent recovery and increased

  14. Analyzing the Mixing Dynamics of an Industrial Batch Bin Blender via Discrete Element Modeling Method

    Directory of Open Access Journals (Sweden)

    Maitraye Sen

    2017-04-01

    Full Text Available A discrete element model (DEM has been developed for an industrial batch bin blender in which three different types of materials are mixed. The mixing dynamics have been evaluated from a model-based study with respect to the blend critical quality attributes (CQAs which are relative standard deviation (RSD and segregation intensity. In the actual industrial setup, a sensor mounted on the blender lid is used to determine the blend composition in this region. A model-based analysis has been used to understand the mixing efficiency in the other zones inside the blender and to determine if the data obtained near the blender-lid region are able to provide a good representation of the overall blend quality. Sub-optimal mixing zones have been identified and other potential sampling locations have been investigated in order to obtain a good approximation of the blend variability. The model has been used to study how the mixing efficiency can be improved by varying the key processing parameters, i.e., blender RPM/speed, fill level/volume and loading order. Both segregation intensity and RSD reduce at a lower fill level and higher blender RPM and are a function of the mixing time. This work demonstrates the use of a model-based approach to improve process knowledge regarding a pharmaceutical mixing process. The model can be used to acquire qualitative information about the influence of different critical process parameters and equipment geometry on the mixing dynamics.

  15. Dynamic induced softening in frictional granular materials investigated by discrete-element-method simulation

    Science.gov (United States)

    Lemrich, Laure; Carmeliet, Jan; Johnson, Paul A.; Guyer, Robert; Jia, Xiaoping

    2017-12-01

    A granular system composed of frictional glass beads is simulated using the discrete element method. The intergrain forces are based on the Hertz contact law in the normal direction with frictional tangential force. The damping due to collision is also accounted for. Systems are loaded at various stresses and their quasistatic elastic moduli are characterized. Each system is subjected to an extensive dynamic testing protocol by measuring the resonant response to a broad range of ac drive amplitudes and frequencies via a set of diagnostic strains. The system, linear at small ac drive amplitudes, has resonance frequencies that shift downward (i.e., modulus softening) with increased ac drive amplitude. Detailed testing shows that the slipping contact ratio does not contribute significantly to this dynamic modulus softening, but the coordination number is strongly correlated to this reduction. This suggests that the softening arises from the extended structural change via break and remake of contacts during the rearrangement of bead positions driven by the ac amplitude.

  16. Experimental Investigation and Discrete Element Modelling of Composite Hollow Spheres Subjected to Dynamic Fracture

    Directory of Open Access Journals (Sweden)

    Arthur Coré

    2017-01-01

    Full Text Available This paper deals with the characterization and the numerical modelling of the collapse of composite hollow spherical structures developed to absorb energy during high velocity impacts. The structure is composed of hollow spheres (ϕ=2–30 mm made of epoxy resin and mineral powder. First of all, quasi-static and dynamic (v=5 mm·min−1 to v=2 m·s−1 compression tests are conducted at room temperature on a single sphere to study energy dissipation mechanisms. Fracture of the material appears to be predominant. A numerical model based on the discrete element method is investigated to simulate the single sphere crushing. The stress-strain-time relationship of the material based on the Ree-Eyring law is numerically implemented. The DEM modelling takes naturally into account the dynamic fracture and the crack path computed is close to the one observed experimentally in uniaxial compression. Eventually, high velocity impacts (v>100 m·s−1 of a hollow sphere on a rigid surface are conducted with an air cannon. The numerical results are in good agreement with the experimental data and demonstrate the ability of the present model to correctly describe the mechanical behavior of brittle materials at high strain rate.

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

  18. Discrete meso-element simulation of the failure behavior of short-fiber composites under dynamic loading

    International Nuclear Information System (INIS)

    Liu Wenyan; Tang, Z.P.; Liu Yunxin

    2000-01-01

    In recent years, more attention has been paid to a better understanding of the failure behavior and mechanism of heterogeneous materials at the meso-scale level. In this paper, the crack initiation and development in epoxy composites reinforced with short steel fibers under dynamic loading were simulated and analyzed with the 2D Discrete Meso-Element Dynamic Method. Results show that the damage process depends greatly on the binding property between matrix and fibers

  19. Discrete two-sex models of population dynamics: On modelling the mating function

    Science.gov (United States)

    Bessa-Gomes, Carmen; Legendre, Stéphane; Clobert, Jean

    2010-09-01

    Although sexual reproduction has long been a central subject of theoretical ecology, until recently its consequences for population dynamics were largely overlooked. This is now changing, and many studies have addressed this issue, showing that when the mating system is taken into account, the population dynamics depends on the relative abundance of males and females, and is non-linear. Moreover, sexual reproduction increases the extinction risk, namely due to the Allee effect. Nevertheless, different studies have identified diverse potential consequences, depending on the choice of mating function. In this study, we investigate the consequences of three alternative mating functions that are frequently used in discrete population models: the minimum; the harmonic mean; and the modified harmonic mean. We consider their consequences at three levels: on the probability that females will breed; on the presence and intensity of the Allee effect; and on the extinction risk. When we consider the harmonic mean, the number of times the individuals of the least abundant sex mate exceeds their mating potential, which implies that with variable sex-ratios the potential reproductive rate is no longer under the modeller's control. Consequently, the female breeding probability exceeds 1 whenever the sex-ratio is male-biased, which constitutes an obvious problem. The use of the harmonic mean is thus only justified if we think that this parameter should be re-defined in order to represent the females' breeding rate and the fact that females may reproduce more than once per breeding season. This phenomenon buffers the Allee effect, and reduces the extinction risk. However, when we consider birth-pulse populations, such a phenomenon is implausible because the number of times females can reproduce per birth season is limited. In general, the minimum or modified harmonic mean mating functions seem to be more suitable for assessing the impact of mating systems on population dynamics.

  20. Secure Hashing of Dynamic Hand Signatures Using Wavelet-Fourier Compression with BioPhasor Mixing and Discretization

    Directory of Open Access Journals (Sweden)

    Wai Kuan Yip

    2007-01-01

    Full Text Available We introduce a novel method for secure computation of biometric hash on dynamic hand signatures using BioPhasor mixing and discretization. The use of BioPhasor as the mixing process provides a one-way transformation that precludes exact recovery of the biometric vector from compromised hashes and stolen tokens. In addition, our user-specific discretization acts both as an error correction step as well as a real-to-binary space converter. We also propose a new method of extracting compressed representation of dynamic hand signatures using discrete wavelet transform (DWT and discrete fourier transform (DFT. Without the conventional use of dynamic time warping, the proposed method avoids storage of user's hand signature template. This is an important consideration for protecting the privacy of the biometric owner. Our results show that the proposed method could produce stable and distinguishable bit strings with equal error rates (EERs of and for random and skilled forgeries for stolen token (worst case scenario, and for both forgeries in the genuine token (optimal scenario.

  1. IMA’s 2014-2015 Annual Thematic Program on Discrete Structures: Analysis and Applications

    CERN Document Server

    Madiman, Mokshay; Werner, Elisabeth

    2017-01-01

    This volume presents some of the research topics discussed at the 2014-2015 Annual Thematic Program Discrete Structures: Analysis and Applications at the Institute of Mathematics and its Applications during the Spring 2015 where geometric analysis, convex geometry and concentration phenomena were the focus. Leading experts have written surveys of research problems, making state of the art results more conveniently and widely available. The volume is organized into two parts. Part I contains those contributions that focus primarily on problems motivated by probability theory, while Part II contains those contributions that focus primarily on problems motivated by convex geometry and geometric analysis. This book will be of use to those who research convex geometry, geometric analysis and probability directly or apply such methods in other fields.

  2. Dynamics and elastic interactions of the discrete multi-dark soliton solutions for the Kaup-Newell lattice equation

    Science.gov (United States)

    Liu, Nan; Wen, Xiao-Yong

    2018-03-01

    Under consideration in this paper is the Kaup-Newell (KN) lattice equation which is an integrable discretization of the KN equation. Infinitely, many conservation laws and discrete N-fold Darboux transformation (DT) for this system are constructed and established based on its Lax representation. Via the resulting N-fold DT, the discrete multi-dark soliton solutions in terms of determinants are derived from non-vanishing background. Propagation and elastic interaction structures of such solitons are shown graphically. Overtaking interaction phenomena between/among the two, three and four solitons are discussed. Numerical simulations are used to explore their dynamical behaviors of such multi-dark solitons. Numerical results show that their evolutions are stable against a small noise. Results in this paper might be helpful for understanding the propagation of nonlinear Alfvén waves in plasmas.

  3. Flow Dynamics of green sand in the DISAMATIC moulding process using Discrete element method (DEM)

    International Nuclear Information System (INIS)

    Hovad, E; Walther, J H; Thorborg, J; Hattel, J H; Larsen, P

    2015-01-01

    The DISAMATIC casting process production of sand moulds is simulated with DEM (discrete element method). The main purpose is to simulate the dynamics of the flow of green sand, during the production of the sand mould with DEM. The sand shot is simulated, which is the first stage of the DISAMATIC casting process. Depending on the actual casting geometry the mould can be geometrically quite complex involving e.g. shadowing effects and this is directly reflected in the sand flow during the moulding process. In the present work a mould chamber with “ribs” at the walls is chosen as a baseline geometry to emulate some of these important conditions found in the real moulding process. The sand flow is simulated with the DEM and compared with corresponding video footages from the interior of the chamber during the moulding process. The effect of the rolling resistance and the static friction coefficient is analysed and discussed in relation to the experimental findings. (paper)

  4. Physiological modules for generating discrete and rhythmic movements: action identification by a dynamic recurrent neural network.

    Science.gov (United States)

    Bengoetxea, Ana; Leurs, Françoise; Hoellinger, Thomas; Cebolla, Ana M; Dan, Bernard; McIntyre, Joseph; Cheron, Guy

    2014-01-01

    In this study we employed a dynamic recurrent neural network (DRNN) in a novel fashion to reveal characteristics of control modules underlying the generation of muscle activations when drawing figures with the outstretched arm. We asked healthy human subjects to perform four different figure-eight movements in each of two workspaces (frontal plane and sagittal plane). We then trained a DRNN to predict the movement of the wrist from information in the EMG signals from seven different muscles. We trained different instances of the same network on a single movement direction, on all four movement directions in a single movement plane, or on all eight possible movement patterns and looked at the ability of the DRNN to generalize and predict movements for trials that were not included in the training set. Within a single movement plane, a DRNN trained on one movement direction was not able to predict movements of the hand for trials in the other three directions, but a DRNN trained simultaneously on all four movement directions could generalize across movement directions within the same plane. Similarly, the DRNN was able to reproduce the kinematics of the hand for both movement planes, but only if it was trained on examples performed in each one. As we will discuss, these results indicate that there are important dynamical constraints on the mapping of EMG to hand movement that depend on both the time sequence of the movement and on the anatomical constraints of the musculoskeletal system. In a second step, we injected EMG signals constructed from different synergies derived by the PCA in order to identify the mechanical significance of each of these components. From these results, one can surmise that discrete-rhythmic movements may be constructed from three different fundamental modules, one regulating the co-activation of all muscles over the time span of the movement and two others elliciting patterns of reciprocal activation operating in orthogonal directions.

  5. A discrete particle model reproducing collective dynamics of a bee swarm.

    Science.gov (United States)

    Bernardi, Sara; Colombi, Annachiara; Scianna, Marco

    2018-02-01

    In this article, we present a microscopic discrete mathematical model describing collective dynamics of a bee swarm. More specifically, each bee is set to move according to individual strategies and social interactions, the former involving the desire to reach a target destination, the latter accounting for repulsive/attractive stimuli and for alignment processes. The insects tend in fact to remain sufficiently close to the rest of the population, while avoiding collisions, and they are able to track and synchronize their movement to the flight of a given set of neighbors within their visual field. The resulting collective behavior of the bee cloud therefore emerges from non-local short/long-range interactions. Differently from similar approaches present in the literature, we here test different alignment mechanisms (i.e., based either on an Euclidean or on a topological neighborhood metric), which have an impact also on the other social components characterizing insect behavior. A series of numerical realizations then shows the phenomenology of the swarm (in terms of pattern configuration, collective productive movement, and flight synchronization) in different regions of the space of free model parameters (i.e., strength of attractive/repulsive forces, extension of the interaction regions). In this respect, constraints in the possible variations of such coefficients are here given both by reasonable empirical observations and by analytical results on some stability characteristics of the defined pairwise interaction kernels, which have to assure a realistic crystalline configuration of the swarm. An analysis of the effect of unconscious random fluctuations of bee dynamics is also provided. Copyright © 2018 Elsevier Ltd. All rights reserved.

  6. Discrete dynamic event tree modeling and analysis of nuclear power plant crews for safety assessment

    International Nuclear Information System (INIS)

    Mercurio, D.

    2011-01-01

    Current Probabilistic Risk Assessment (PRA) and Human Reliability Analysis (HRA) methodologies model the evolution of accident sequences in Nuclear Power Plants (NPPs) mainly based on Logic Trees. The evolution of these sequences is a result of the interactions between the crew and plant; in current PRA methodologies, simplified models of these complex interactions are used. In this study, the Accident Dynamic Simulator (ADS), a modeling framework based on the Discrete Dynamic Event Tree (DDET), has been used for the simulation of crew-plant interactions during potential accident scenarios in NPPs. In addition, an operator/crew model has been developed to treat the response of the crew to the plant. The 'crew model' is made up of three operators whose behavior is guided by a set of rules-of-behavior (which represents the knowledge and training of the operators) coupled with written and mental procedures. In addition, an approach for addressing the crew timing variability in DDETs has been developed and implemented based on a set of HRA data from a simulator study. Finally, grouping techniques were developed and applied to the analysis of the scenarios generated by the crew-plant simulation. These techniques support the post-simulation analysis by grouping similar accident sequences, identifying the key contributing events, and quantifying the conditional probability of the groups. These techniques are used to characterize the context of the crew actions in order to obtain insights for HRA. The model has been applied for the analysis of a Small Loss Of Coolant Accident (SLOCA) event for a Pressurized Water Reactor (PWR). The simulation results support an improved characterization of the performance conditions or context of operator actions, which can be used in an HRA, in the analysis of the reliability of the actions. By providing information on the evolution of system indications, dynamic of cues, crew timing in performing procedure steps, situation

  7. Rule of Thumb and Dynamic Programming

    NARCIS (Netherlands)

    Lettau, M.; Uhlig, H.F.H.V.S.

    1995-01-01

    This paper studies the relationships between learning about rules of thumb (represented by classifier systems) and dynamic programming. Building on a result about Markovian stochastic approximation algorithms, we characterize all decision functions that can be asymptotically obtained through

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

    International Nuclear Information System (INIS)

    Leyendecker, Sigrid; Betsch, Peter; Steinmann, Paul

    2008-01-01

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

  9. Dynamic Programming: An Introduction by Example

    Science.gov (United States)

    Zietz, Joachim

    2007-01-01

    The author introduces some basic dynamic programming techniques, using examples, with the help of the computer algebra system "Maple". The emphasis is on building confidence and intuition for the solution of dynamic problems in economics. To integrate the material better, the same examples are used to introduce different techniques. One covers the…

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

  11. Guidelines for dynamic international programs

    International Nuclear Information System (INIS)

    Gold, M.A.

    1993-01-01

    Matters of global concern-deforestation, global warming, biodiversity loss, sustainable development, fuelwood crises, watershed destruction, and large-scale flooding-frequently involve forests and natural resources. In the future, university students will enter a global setting that more than ever depends on a strong knowledge of international issues. USA land-grant universities are attempting to prepare students for this challenge by improving their international programs including forestry. To improve university programs, several factors will need to be addressed and are discussed, with examples, in this article: commitment of the faculty; program specialization; geographic specialization; reward systems for international contributions; international collaboration; recycled dollars within the university; active teaching programs; research; extention and outreach; language training; international faculty; travel grants; twinning relationships with sister institutions; selective in pursuit of international development assistance; and study centers. 6 refs

  12. Evaluating Dynamic Analysis Techniques for Program Comprehension

    NARCIS (Netherlands)

    Cornelissen, S.G.M.

    2009-01-01

    Program comprehension is an essential part of software development and software maintenance, as software must be sufficiently understood before it can be properly modified. One of the common approaches in getting to understand a program is the study of its execution, also known as dynamic analysis.

  13. Minimax terminal approach problem in two-level hierarchical nonlinear discrete-time dynamical system

    Energy Technology Data Exchange (ETDEWEB)

    Shorikov, A. F., E-mail: afshorikov@mail.ru [Ural Federal University, 19 S. Mira, Ekaterinburg, 620002, Russia Institute of Mathematics and Mechanics, Ural Branch of Russian Academy of Sciences, 16 S. Kovalevskaya, Ekaterinburg, 620990 (Russian Federation)

    2015-11-30

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

  14. Hybrid Differential Dynamic Programming with Stochastic Search

    Science.gov (United States)

    Aziz, Jonathan; Parker, Jeffrey; Englander, Jacob

    2016-01-01

    Differential dynamic programming (DDP) has been demonstrated as a viable approach to low-thrust trajectory optimization, namely with the recent success of NASAs Dawn mission. The Dawn trajectory was designed with the DDP-based Static Dynamic Optimal Control algorithm used in the Mystic software. Another recently developed method, Hybrid Differential Dynamic Programming (HDDP) is a variant of the standard DDP formulation that leverages both first-order and second-order state transition matrices in addition to nonlinear programming (NLP) techniques. Areas of improvement over standard DDP include constraint handling, convergence properties, continuous dynamics, and multi-phase capability. DDP is a gradient based method and will converge to a solution nearby an initial guess. In this study, monotonic basin hopping (MBH) is employed as a stochastic search method to overcome this limitation, by augmenting the HDDP algorithm for a wider search of the solution space.

  15. Electro-mechanical dynamics of spiral waves in a discrete 2D model of human atrial tissue.

    Science.gov (United States)

    Brocklehurst, Paul; Ni, Haibo; Zhang, Henggui; Ye, Jianqiao

    2017-01-01

    We investigate the effect of mechano-electrical feedback and atrial fibrillation induced electrical remodelling (AFER) of cellular ion channel properties on the dynamics of spiral waves in a discrete 2D model of human atrial tissue. The tissue electro-mechanics are modelled using the discrete element method (DEM). Millions of bonded DEM particles form a network of coupled atrial cells representing 2D cardiac tissue, allowing simulations of the dynamic behaviour of electrical excitation waves and mechanical contraction in the tissue. In the tissue model, each cell is modelled by nine particles, accounting for the features of individual cellular geometry; and discrete inter-cellular spatial arrangement of cells is also considered. The electro-mechanical model of a human atrial single-cell was constructed by strongly coupling the electrophysiological model of Colman et al. to the mechanical myofilament model of Rice et al., with parameters modified based on experimental data. A stretch-activated channel was incorporated into the model to simulate the mechano-electrical feedback. In order to investigate the effect of mechano-electrical feedback on the dynamics of spiral waves, simulations of spiral waves were conducted in both the electromechanical model and the electrical-only model in normal and AFER conditions, to allow direct comparison of the results between the models. Dynamics of spiral waves were characterized by tracing their tip trajectories, stability, excitation frequencies and meandering range of tip trajectories. It was shown that the developed DEM method provides a stable and efficient model of human atrial tissue with considerations of the intrinsically discrete and anisotropic properties of the atrial tissue, which are challenges to handle in traditional continuum mechanics models. This study provides mechanistic insights into the complex behaviours of spiral waves and the genesis of atrial fibrillation by showing an important role of the mechano

  16. Electro-mechanical dynamics of spiral waves in a discrete 2D model of human atrial tissue.

    Directory of Open Access Journals (Sweden)

    Paul Brocklehurst

    Full Text Available We investigate the effect of mechano-electrical feedback and atrial fibrillation induced electrical remodelling (AFER of cellular ion channel properties on the dynamics of spiral waves in a discrete 2D model of human atrial tissue. The tissue electro-mechanics are modelled using the discrete element method (DEM. Millions of bonded DEM particles form a network of coupled atrial cells representing 2D cardiac tissue, allowing simulations of the dynamic behaviour of electrical excitation waves and mechanical contraction in the tissue. In the tissue model, each cell is modelled by nine particles, accounting for the features of individual cellular geometry; and discrete inter-cellular spatial arrangement of cells is also considered. The electro-mechanical model of a human atrial single-cell was constructed by strongly coupling the electrophysiological model of Colman et al. to the mechanical myofilament model of Rice et al., with parameters modified based on experimental data. A stretch-activated channel was incorporated into the model to simulate the mechano-electrical feedback. In order to investigate the effect of mechano-electrical feedback on the dynamics of spiral waves, simulations of spiral waves were conducted in both the electromechanical model and the electrical-only model in normal and AFER conditions, to allow direct comparison of the results between the models. Dynamics of spiral waves were characterized by tracing their tip trajectories, stability, excitation frequencies and meandering range of tip trajectories. It was shown that the developed DEM method provides a stable and efficient model of human atrial tissue with considerations of the intrinsically discrete and anisotropic properties of the atrial tissue, which are challenges to handle in traditional continuum mechanics models. This study provides mechanistic insights into the complex behaviours of spiral waves and the genesis of atrial fibrillation by showing an important role of

  17. Discrete dynamical model of mechanisms determining the relations of biodiversity and stability at different levels of organization of living matter

    OpenAIRE

    Kabalyants, Petr; Nosov, Konstantin; Bespalov, Yuri

    2017-01-01

    The paper aims at building the model of relations of biodiversity and stability at different levels of organization of living matter with the use of discrete dynamical models. The relations revealed in the study are illustrated by case studies of zooplankton community of the eutrophicated lake and the colorimetric parameters of the microalgae community of phytobenthos and phytoperiphyton. The results offer: (1) new approaches to estimating the risk of mass development of toxic cyanobacteria i...

  18. Elucidation of amyloid beta-protein oligomerization mechanisms: discrete molecular dynamics study.

    Science.gov (United States)

    Urbanc, B; Betnel, M; Cruz, L; Bitan, G; Teplow, D B

    2010-03-31

    Oligomers of amyloid beta-protein (Abeta) play a central role in the pathology of Alzheimer's disease. Of the two predominant Abeta alloforms, Abeta(1-40) and Abeta(1-42), Abeta(1-42) is more strongly implicated in the disease. We elucidated the structural characteristics of oligomers of Abeta(1-40) and Abeta(1-42) and their Arctic mutants, [E22G]Abeta(1-40) and [E22G]Abeta(1-42). We simulated oligomer formation using discrete molecular dynamics (DMD) with a four-bead protein model, backbone hydrogen bonding, and residue-specific interactions due to effective hydropathy and charge. For all four peptides under study, we derived the characteristic oligomer size distributions that were in agreement with prior experimental findings. Unlike Abeta(1-40), Abeta(1-42) had a high propensity to form paranuclei (pentameric or hexameric) structures that could self-associate into higher-order oligomers. Neither of the Arctic mutants formed higher-order oligomers, but [E22G]Abeta(1-40) formed paranuclei with a similar propensity to that of Abeta(1-42). Whereas the best agreement with the experimental data was obtained when the charged residues were modeled as solely hydrophilic, further assembly from spherical oligomers into elongated protofibrils was induced by nonzero electrostatic interactions among the charged residues. Structural analysis revealed that the C-terminal region played a dominant role in Abeta(1-42) oligomer formation whereas Abeta(1-40) oligomerization was primarily driven by intermolecular interactions among the central hydrophobic regions. The N-terminal region A2-F4 played a prominent role in Abeta(1-40) oligomerization but did not contribute to the oligomerization of Abeta(1-42) or the Arctic mutants. The oligomer structure of both Arctic peptides resembled Abeta(1-42) more than Abeta(1-40), consistent with their potentially more toxic nature.

  19. Numerical modeling of the dynamic behavior of structures under impact with a discrete elements / finite elements coupling

    International Nuclear Information System (INIS)

    Rousseau, J.

    2009-07-01

    That study focuses on concrete structures submitted to impact loading and is aimed at predicting local damage in the vicinity of an impact zone as well as the global response of the structure. The Discrete Element Method (DEM) seems particularly well suited in this context for modeling fractures. An identification process of DEM material parameters from macroscopic data (Young's modulus, compressive and tensile strength, fracture energy, etc.) will first be presented for the purpose of enhancing reproducibility and reliability of the simulation results with DE samples of various sizes. Then, a particular interaction, between concrete and steel elements, was developed for the simulation of reinforced concrete. The discrete elements method was validated on quasi-static and dynamic tests carried out on small samples of concrete and reinforced concrete. Finally, discrete elements were used to simulate impacts on reinforced concrete slabs in order to confront the results with experimental tests. The modeling of a large structure by means of DEM may lead to prohibitive computation times. A refined discretization becomes required in the vicinity of the impact, while the structure may be modeled using a coarse FE mesh further from the impact area, where the material behaves elastically. A coupled discrete-finite element approach is thus proposed: the impact zone is modeled by means of DE and elastic FE are used on the rest of the structure. An existing method for 3D finite elements was extended to shells. This new method was then validated on many quasi-static and dynamic tests. The proposed approach is then applied to an impact on a concrete structure in order to validate the coupled method and compare computation times. (author)

  20. Optimization of Algorithms Using Extensions of Dynamic Programming

    KAUST Repository

    AbouEisha, Hassan M.

    2017-04-09

    We study and answer questions related to the complexity of various important problems such as: multi-frontal solvers of hp-adaptive finite element method, sorting and majority. We advocate the use of dynamic programming as a viable tool to study optimal algorithms for these problems. The main approach used to attack these problems is modeling classes of algorithms that may solve this problem using a discrete model of computation then defining cost functions on this discrete structure that reflect different complexity measures of the represented algorithms. As a last step, dynamic programming algorithms are designed and used to optimize those models (algorithms) and to obtain exact results on the complexity of the studied problems. The first part of the thesis presents a novel model of computation (element partition tree) that represents a class of algorithms for multi-frontal solvers along with cost functions reflecting various complexity measures such as: time and space. It then introduces dynamic programming algorithms for multi-stage and bi-criteria optimization of element partition trees. In addition, it presents results based on optimal element partition trees for famous benchmark meshes such as: meshes with point and edge singularities. New improved heuristics for those benchmark meshes were ob- tained based on insights of the optimal results found by our algorithms. The second part of the thesis starts by introducing a general problem where different problems can be reduced to and show how to use a decision table to model such problem. We describe how decision trees and decision tests for this table correspond to adaptive and non-adaptive algorithms for the original problem. We present exact bounds on the average time complexity of adaptive algorithms for the eight elements sorting problem. Then bounds on adaptive and non-adaptive algorithms for a variant of the majority problem are introduced. Adaptive algorithms are modeled as decision trees whose depth

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

    Science.gov (United States)

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

    2014-06-19

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

  2. Dynamic analysis program for frame structure

    International Nuclear Information System (INIS)

    Ando, Kozo; Chiba, Toshio

    1975-01-01

    A general purpose computer program named ISTRAN/FD (Isub(HI) STRucture ANalysis/Frame structure, Dynamic analysis) has been developed for dynamic analysis of three-dimensional frame structures. This program has functions of free vibration analysis, seismic response analysis, graphic display by plotter and CRT, etc. This paper introduces ISTRAN/FD; examples of its application are shown with various problems : idealization of the cantilever, dynamic analysis of the main tower of the suspension bridge, three-dimensional vibration in the plate girder bridge, seismic response in the boiler steel structure, and dynamic properties of the underground LNG tank. In this last example, solid elements, in addition to beam elements, are especially used for the analysis. (auth.)

  3. Many-Body Quantum Spin Dynamics with Monte Carlo Trajectories on a Discrete Phase Space

    Directory of Open Access Journals (Sweden)

    J. Schachenmayer

    2015-02-01

    Full Text Available Interacting spin systems are of fundamental relevance in different areas of physics, as well as in quantum information science and biology. These spin models represent the simplest, yet not fully understood, manifestation of quantum many-body systems. An important outstanding problem is the efficient numerical computation of dynamics in large spin systems. Here, we propose a new semiclassical method to study many-body spin dynamics in generic spin lattice models. The method is based on a discrete Monte Carlo sampling in phase space in the framework of the so-called truncated Wigner approximation. Comparisons with analytical and numerically exact calculations demonstrate the power of the technique. They show that it correctly reproduces the dynamics of one- and two-point correlations and spin squeezing at short times, thus capturing entanglement. Our results open the possibility to study the quantum dynamics accessible to recent experiments in regimes where other numerical methods are inapplicable.

  4. Planar multibody dynamics formulation, programming and applications

    CERN Document Server

    Nikravesh, Parviz E

    2007-01-01

    Introduction Multibody Mechanical Systems Types of Analyses Methods of Formulation Computer Programming Application Examples Unit System Remarks Preliminaries Reference Axes Scalars and Vectors Matrices Vector, Array, and Matrix Differentiation Equations and Expressions Remarks Problems Fundamentals of Kinematics A Particle Kinematics of a Rigid Body Definitions Remarks Problems Fundamentals of Dynamics Newton's Laws of Motion Dynamics of a Body Force Elements Applied Forces Reaction Force Remarks Problems Point-Coordinates: Kinematics Multipoint

  5. Configuring Airspace Sectors with Approximate Dynamic Programming

    Science.gov (United States)

    Bloem, Michael; Gupta, Pramod

    2010-01-01

    In response to changing traffic and staffing conditions, supervisors dynamically configure airspace sectors by assigning them to control positions. A finite horizon airspace sector configuration problem models this supervisor decision. The problem is to select an airspace configuration at each time step while considering a workload cost, a reconfiguration cost, and a constraint on the number of control positions at each time step. Three algorithms for this problem are proposed and evaluated: a myopic heuristic, an exact dynamic programming algorithm, and a rollouts approximate dynamic programming algorithm. On problem instances from current operations with only dozens of possible configurations, an exact dynamic programming solution gives the optimal cost value. The rollouts algorithm achieves costs within 2% of optimal for these instances, on average. For larger problem instances that are representative of future operations and have thousands of possible configurations, excessive computation time prohibits the use of exact dynamic programming. On such problem instances, the rollouts algorithm reduces the cost achieved by the heuristic by more than 15% on average with an acceptable computation time.

  6. Dynamic Optimization of a Polymer Flooding Process Based on Implicit Discrete Maximum Principle

    Directory of Open Access Journals (Sweden)

    Yang Lei

    2012-01-01

    Full Text Available Polymer flooding is one of the most important technologies for enhanced oil recovery (EOR. In this paper, an optimal control model of distributed parameter systems (DPSs for polymer injection strategies is established, which involves the performance index as maximum of the profit, the governing equations as the fluid flow equations of polymer flooding, and some inequality constraints as polymer concentration and injection amount limitation. The optimal control model is discretized by full implicit finite-difference method. To cope with the discrete optimal control problem (OCP, the necessary conditions for optimality are obtained through application of the calculus of variations and Pontryagin’s discrete maximum principle. A modified gradient method with new adjoint construction is proposed for the computation of optimal injection strategies. The numerical results of an example illustrate the effectiveness of the proposed method.

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

    Science.gov (United States)

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

    2018-01-01

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

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

  9. Numerical investigations on flow dynamics of prismatic granular materials using the discrete element method

    Science.gov (United States)

    Hancock, W.; Weatherley, D.; Wruck, B.; Chitombo, G. P.

    2012-04-01

    The flow dynamics of granular materials is of broad interest in both the geosciences (e.g. landslides, fault zone evolution, and brecchia pipe formation) and many engineering disciplines (e.g chemical engineering, food sciences, pharmaceuticals and materials science). At the interface between natural and human-induced granular media flow, current underground mass-mining methods are trending towards the induced failure and subsequent gravitational flow of large volumes of broken rock, a method known as cave mining. Cave mining relies upon the undercutting of a large ore body, inducement of fragmentation of the rock and subsequent extraction of ore from below, via hopper-like outlets. Design of such mines currently relies upon a simplified kinematic theory of granular flow in hoppers, known as the ellipsoid theory of mass movement. This theory assumes that the zone of moving material grows as an ellipsoid above the outlet of the silo. The boundary of the movement zone is a shear band and internal to the movement zone, the granular material is assumed to have a uniformly high bulk porosity compared with surrounding stagnant regions. There is however, increasing anecdotal evidence and field measurements suggesting this theory fails to capture the full complexity of granular material flow within cave mines. Given the practical challenges obstructing direct measurement of movement both in laboratory experiments and in-situ, the Discrete Element Method (DEM [1]) is a popular alternative to investigate granular media flow. Small-scale DEM studies (c.f. [3] and references therein) have confirmed that movement within DEM silo flow models matches that predicted by ellipsoid theory, at least for mono-disperse granular material freely outflowing at a constant rate. A major draw-back of these small-scale DEM studies is that the initial bulk porosity of the simulated granular material is significantly higher than that of broken, prismatic rock. In this investigation, more

  10. Adolescent values for immunisation programs in Australia: A discrete choice experiment.

    Directory of Open Access Journals (Sweden)

    Bing Wang

    Full Text Available The importance of adolescent engagement in health decisions and public health programs such as immunisation is becoming increasingly recognised. Understanding adolescent preferences and further identifying barriers and facilitators for immunisation acceptance is critical to the success of adolescent immunisation programs. This study applied a discrete choice experiment (DCE to assess vaccination preferences in adolescents.This study was conducted as a cross-sectional, national online survey in Australian adolescents. The DCE survey evaluated adolescent vaccination preferences. Six attributes were assessed including disease severity, target for protection, price, location of vaccination provision, potential side effects and vaccine delivery method. A mixed logit model was used to analyse DCE data.This survey was conducted between December 2014 and January 2015. Of 800 adolescents aged 15 to 19 years, stronger preferences were observed overall for: vaccination in the case of a life threatening illness (p<0.001, lower price vaccinations (p<0.001, mild but common side effects (p = 0.004, delivery via a skin patch (p<0.001 and being administered by a family practitioner (p<0.001. Participants suggested that they and their families would be willing to pay AU$394.28 (95%CI: AU$348.40 to AU$446.92 more for a vaccine targeting a life threatening illness than a mild-moderate illness, AU$37.94 (95%CI: AU$19.22 to AU$57.39 more for being vaccinated at a family practitioner clinic than a council immunisation clinic, AU$23.01 (95%CI: AU$7.12 to AU$39.24 more for common but mild and resolving side effects compared to rare but serious side effects, and AU$51.80 (95%CI: AU$30.42 to AU$73.70 more for delivery via a skin patch than injection.Consideration of adolescent preferences may result in improved acceptance of, engagement in and uptake of immunisation programs targeted for this age group.

  11. Approximate Dynamic Programming in Tracking Control of a Robotic Manipulator

    Directory of Open Access Journals (Sweden)

    Marcin Szuster

    2016-02-01

    Full Text Available This article focuses on the implementation of an approximate dynamic programming algorithm in the discrete tracking control system of the three-degrees of freedom Scorbot-ER 4pc robotic manipulator. The controlled system is included in an articulated robots group which uses rotary joints to access their work space. The main part of the control system is a dual heuristic dynamic programming algorithm that consists of two structures designed in the form of neural networks: an actor and a critic. The actor generates the suboptimal control law while the critic approximates the difference of the value function from Bellman's equation with respect to the state. The residual elements of the control system are the PD controller, the supervisory term and an additional control signal. The structure of the supervisory term derives from the stability analysis performed using the Lyapunov stability theorem. The control system works online, the neural networks' weights-adaptation procedure is performed in every iteration step, and the neural networks' preliminary learning process is not required. The performance of the control system was verified by a series of computer simulations and experiments performed using the Scorbot-ER 4pc robotic manipulator.

  12. The Dynamic Geometrisation of Computer Programming

    Science.gov (United States)

    Sinclair, Nathalie; Patterson, Margaret

    2018-01-01

    The goal of this paper is to explore dynamic geometry environments (DGE) as a type of computer programming language. Using projects created by secondary students in one particular DGE, we analyse the extent to which the various aspects of computational thinking--including both ways of doing things and particular concepts--were evident in their…

  13. A Dynamic Programming Approach to Constrained Portfolios

    DEFF Research Database (Denmark)

    Kraft, Holger; Steffensen, Mogens

    2013-01-01

    This paper studies constrained portfolio problems that may involve constraints on the probability or the expected size of a shortfall of wealth or consumption. Our first contribution is that we solve the problems by dynamic programming, which is in contrast to the existing literature that applies...

  14. Quantum optical device accelerating dynamic programming

    OpenAIRE

    Grigoriev, D.; Kazakov, A.; Vakulenko, S.

    2005-01-01

    In this paper we discuss analogue computers based on quantum optical systems accelerating dynamic programming for some computational problems. These computers, at least in principle, can be realized by actually existing devices. We estimate an acceleration in resolving of some NP-hard problems that can be obtained in such a way versus deterministic computers

  15. Microsoft Dynamics NAV 7 programming cookbook

    CERN Document Server

    Raul, Rakesh

    2013-01-01

    Written in the style of a cookbook. Microsoft Dynamics NAV 7 Programming Cookbook is full of recipes to help you get the job done.If you are a junior / entry-level NAV developer then the first half of the book is designed primarily for you. You may or may not have any experience programming. It focuses on the basics of NAV programming.If you are a mid-level NAV developer, you will find these chapters explain how to think outside of the NAV box when building solutions. There are also recipes that senior developers will find useful.

  16. Efficient dynamic optimization of logic programs

    Science.gov (United States)

    Laird, Phil

    1992-01-01

    A summary is given of the dynamic optimization approach to speed up learning for logic programs. The problem is to restructure a recursive program into an equivalent program whose expected performance is optimal for an unknown but fixed population of problem instances. We define the term 'optimal' relative to the source of input instances and sketch an algorithm that can come within a logarithmic factor of optimal with high probability. Finally, we show that finding high-utility unfolding operations (such as EBG) can be reduced to clause reordering.

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

  18. Discrete kink dynamics in hydrogen-bonded chains: The one-component model

    DEFF Research Database (Denmark)

    Karpan, V. M.; Zolotaryuk, Yaroslav; Christiansen, Peter Leth

    2002-01-01

    "parabola-constant" approximation of the double-Morse potential is suggested and studied analytically. The dependence of the Peierls-Nabarro potential on the system parameters is studied. Discrete traveling-wave solutions of a narrow permanent profile are shown to exist, depending on the anharmonicity...

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

  20. Parental Preferences for the Organization of Preschool Vaccination Programs Including Financial Incentives: A Discrete Choice Experiment

    Directory of Open Access Journals (Sweden)

    Darren Flynn PhD

    2017-05-01

    Full Text Available Objective: To establish preferences of parents and guardians of preschool children for the organization of preschool vaccination services, including financial incentives. Design: An online discrete choice experiment. Participants: Parents and guardians of preschool children (up to age 5 years who were (n = 259 and were not (n = 262 classified as at high risk of incompletely vaccinating their children. High risk of incomplete vaccination was defined as any of the following: aged less than 20 years, single parents, living in one of the 20% most deprived areas in England, had a preschool child with a disability, or had more than three children. Main Outcome Measures: Participant preferences expressed as positive (utility or negative (disutility on eight attributes and levels describing the organization of preschool vaccination programs. Results: There was no difference in preference for parental financial incentives compared to no incentive in parents “not at high risk” of incomplete vaccination. Parents who were “at high risk” expressed utility for cash incentives. Parents “at high risk” of incomplete vaccination expressed utility for information on the risks and benefits of vaccinations to be provided as numbers rather than charts or pictures. Both groups preferred universally available, rather than targeted, incentives. Utility was identified for shorter waiting times, and there were variable preferences for who delivered vaccinations. Conclusions: Cash incentives for preschool vaccinations in England would be welcomed by parents who are “at high risk” of incompletely vaccinating their children. Further work is required on the optimal mode and form of presenting probabilistic information on vaccination to parents/guardians, including preferences on mandatory vaccination schemes.

  1. Large-scale hydropower system optimization using dynamic programming and object-oriented programming: the case of the Northeast China Power Grid.

    Science.gov (United States)

    Li, Ji-Qing; Zhang, Yu-Shan; Ji, Chang-Ming; Wang, Ai-Jing; Lund, Jay R

    2013-01-01

    This paper examines long-term optimal operation using dynamic programming for a large hydropower system of 10 reservoirs in Northeast China. Besides considering flow and hydraulic head, the optimization explicitly includes time-varying electricity market prices to maximize benefit. Two techniques are used to reduce the 'curse of dimensionality' of dynamic programming with many reservoirs. Discrete differential dynamic programming (DDDP) reduces the search space and computer memory needed. Object-oriented programming (OOP) and the ability to dynamically allocate and release memory with the C++ language greatly reduces the cumulative effect of computer memory for solving multi-dimensional dynamic programming models. The case study shows that the model can reduce the 'curse of dimensionality' and achieve satisfactory results.

  2. Dynamics of rotating and vibrating thin hemispherical shell with mass and damping imperfections and parametrically driven by discrete electrodes

    CSIR Research Space (South Africa)

    Shatalov, M

    2009-05-01

    Full Text Available stream_source_info Shatalov2_2009.pdf.txt stream_content_type text/plain stream_size 22572 Content-Encoding UTF-8 stream_name Shatalov2_2009.pdf.txt Content-Type text/plain; charset=UTF-8 1 DYNAMICS OF ROTATING... AND VIBRATING THIN HEMISPHERICAL SHELL WITH MASS AND DAMPING IMPERFECTIONS AND PARAMETRICALLY DRIVEN BY DISCRETE ELECTRODES Michael Shatalov1,2 and Charlotta Coetzee2 1Sensor Science and Technology (SST) of CSIR Material Science and Manufacturing (MSM...

  3. The effects of host-feeding on stability of discrete-time host-parasitoid population dynamic models.

    Science.gov (United States)

    Emerick, Brooks; Singh, Abhyudai

    2016-02-01

    Discrete-time models are the traditional approach for capturing population dynamics of a host-parasitoid system. Recent work has introduced a semi-discrete framework for obtaining model update functions that connect host-parasitoid population levels from year-to-year. In particular, this framework uses differential equations to describe the host-parasitoid interaction during the time of year when they come in contact, allowing specific behaviors to be mechanistically incorporated. We use the semi-discrete approach to study the effects of host-feeding, which occurs when a parasitoid consumes a potential host larva without ovipositing. We find that host-feeding by itself cannot stabilize the system, and both populations exhibit behavior similar to the Nicholson-Bailey model. However, when combined with stabilizing mechanisms such as density-dependent host mortality, host-feeding contracts the region of parameter space that allows for a stable host-parasitoid equilibrium. In contrast, when combined with a density-dependent parasitoid attack rate, host-feeding expands the non-zero equilibrium stability region. Our results show that host-feeding causes inefficiency in the parasitoid population, which yields a higher population of hosts per generation. This suggests that host-feeding may have limited long-term impact in terms of suppressing host levels for biological control applications. Copyright © 2015 Elsevier Inc. All rights reserved.

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

  5. An analysis of numerical convergence in discrete velocity gas dynamics for internal flows

    Science.gov (United States)

    Sekaran, Aarthi; Varghese, Philip; Goldstein, David

    2018-07-01

    The Discrete Velocity Method (DVM) for solving the Boltzmann equation has significant advantages in the modeling of non-equilibrium and near equilibrium flows as compared to other methods in terms of reduced statistical noise, faster solutions and the ability to handle transient flows. Yet the DVM performance for rarefied flow in complex, small-scale geometries, in microelectromechanical (MEMS) devices for instance, is yet to be studied in detail. The present study focuses on the performance of the DVM for locally large Knudsen number flows of argon around sharp corners and other sources for discontinuities in the distribution function. Our analysis details the nature of the solution for some benchmark cases and introduces the concept of solution convergence for the transport terms in the discrete velocity Boltzmann equation. The limiting effects of the velocity space discretization are also investigated and the constraints on obtaining a robust, consistent solution are derived. We propose techniques to maintain solution convergence and demonstrate the implementation of a specific strategy and its effect on the fidelity of the solution for some benchmark cases.

  6. Extending the Capabilities of the Mooring Analysis Program: A Survey of Dynamic Mooring Line Theories for Integration into FAST: Preprint

    Energy Technology Data Exchange (ETDEWEB)

    Masciola, M.; Jonkman, J.; Robertson, A.

    2014-03-01

    Techniques to model dynamic mooring lines come in various forms. The most widely used models include either a heuristic representation of the physics (such as a Lumped-Mass, LM, system), a Finite-Element Analysis (FEA) discretization of the lines (discretized in space), or a Finite-Difference (FD) model (which is discretized in both space and time). In this paper, we explore the features of the various models, weigh the advantages of each, and propose a plan for implementing one dynamic mooring line model into the open-source Mooring Analysis Program (MAP). MAP is currently used as a module for the FAST offshore wind turbine computer-aided engineering (CAE) tool to model mooring systems quasi-statically, although dynamic mooring capabilities are desired. Based on the exploration in this manuscript, the lumped-mass representation is selected for implementation in MAP based on its simplicity, computational cost, and ability to provide similar physics captured by higher-order models.

  7. Application of an efficient Bayesian discretization method to biomedical data

    Directory of Open Access Journals (Sweden)

    Gopalakrishnan Vanathi

    2011-07-01

    Full Text Available Abstract Background Several data mining methods require data that are discrete, and other methods often perform better with discrete data. We introduce an efficient Bayesian discretization (EBD method for optimal discretization of variables that runs efficiently on high-dimensional biomedical datasets. The EBD method consists of two components, namely, a Bayesian score to evaluate discretizations and a dynamic programming search procedure to efficiently search the space of possible discretizations. We compared the performance of EBD to Fayyad and Irani's (FI discretization method, which is commonly used for discretization. Results On 24 biomedical datasets obtained from high-throughput transcriptomic and proteomic studies, the classification performances of the C4.5 classifier and the naïve Bayes classifier were statistically significantly better when the predictor variables were discretized using EBD over FI. EBD was statistically significantly more stable to the variability of the datasets than FI. However, EBD was less robust, though not statistically significantly so, than FI and produced slightly more complex discretizations than FI. Conclusions On a range of biomedical datasets, a Bayesian discretization method (EBD yielded better classification performance and stability but was less robust than the widely used FI discretization method. The EBD discretization method is easy to implement, permits the incorporation of prior knowledge and belief, and is sufficiently fast for application to high-dimensional data.

  8. A novel condition for stable nonlinear sampled-data models using higher-order discretized approximations with zero dynamics.

    Science.gov (United States)

    Zeng, Cheng; Liang, Shan; Xiang, Shuwen

    2017-05-01

    Continuous-time systems are usually modelled by the form of ordinary differential equations arising from physical laws. However, the use of these models in practice and utilizing, analyzing or transmitting these data from such systems must first invariably be discretized. More importantly, for digital control of a continuous-time nonlinear system, a good sampled-data model is required. This paper investigates the new consistency condition which is weaker than the previous similar results presented. Moreover, given the stability of the high-order approximate model with stable zero dynamics, the novel condition presented stabilizes the exact sampled-data model of the nonlinear system for sufficiently small sampling periods. An insightful interpretation of the obtained results can be made in terms of the stable sampling zero dynamics, and the new consistency condition is surprisingly associated with the relative degree of the nonlinear continuous-time system. Our controller design, based on the higher-order approximate discretized model, extends the existing methods which mainly deal with the Euler approximation. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

  9. Alfvénic Dynamics and Fine Structuring of Discrete Auroral Arcs: Swarm and e-POP Observations

    Science.gov (United States)

    Miles, D.; Mann, I. R.; Pakhotin, I.; Burchill, J. K.; Howarth, A. D.; Knudsen, D. J.; Wallis, D. D.; Yau, A. W.; Lysak, R. L.

    2017-12-01

    The electrodynamics associated with dual discrete arc aurora with anti-parallel flow along the arcs were observed nearly simultaneously by the enhanced Polar Outflow Probe (e-POP) and the Swarm A and C spacecraft. Auroral imaging from e-POP reveal 1-10 km structuring of the arcs, which move and evolve on second timescales and confound the traditional single-spacecraft field-aligned current algorithms. High-cadence magnetic data from e-POP shows 1-10 Hz, presumably Alfvénic perturbations co-incident with and at the same scale size as the observed dynamic auroral fine structures. High-cadence electric and magnetic field data from Swarm A reveals non-stationary electrodynamics involving reflected and interfering Alfvén waves and signatures of modulation consistent with trapping in the Ionospheric Alfvén Resonator (IAR). Together, these observations suggest a role for Alfven waves, perhaps also the IAR, in discrete arc dynamics on 0.2 - 10s timescales and 1-10 km spatial scales.

  10. Markdown Optimization via Approximate Dynamic Programming

    Directory of Open Access Journals (Sweden)

    Cos?gun

    2013-02-01

    Full Text Available We consider the markdown optimization problem faced by the leading apparel retail chain. Because of substitution among products the markdown policy of one product affects the sales of other products. Therefore, markdown policies for product groups having a significant crossprice elasticity among each other should be jointly determined. Since the state space of the problem is very huge, we use Approximate Dynamic Programming. Finally, we provide insights on the behavior of how each product price affects the markdown policy.

  11. Sandia Dynamic Materials Program Strategic Plan.

    Energy Technology Data Exchange (ETDEWEB)

    Flicker, Dawn Gustine [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Benage, John F. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Desjarlais, Michael P. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Knudson, Marcus D. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Leifeste, Gordon T. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Lemke, Raymond W. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Mattsson, Thomas [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Wise, Jack L. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

    2017-05-01

    Materials in nuclear and conventional weapons can reach multi-megabar pressures and 1000s of degree temperatures on timescales ranging from microseconds to nanoseconds. Understanding the response of complex materials under these conditions is important for designing and assessing changes to nuclear weapons. In the next few decades, a major concern will be evaluating the behavior of aging materials and remanufactured components. The science to enable the program to underwrite decisions quickly and confidently on use, remanufacturing, and replacement of these materials will be critical to NNSA’s new Stockpile Responsiveness Program. Material response is also important for assessing the risks posed by adversaries or proliferants. Dynamic materials research, which refers to the use of high-speed experiments to produce extreme conditions in matter, is an important part of NNSA’s Stockpile Stewardship Program.

  12. Dynamic programming algorithms for biological sequence comparison.

    Science.gov (United States)

    Pearson, W R; Miller, W

    1992-01-01

    Efficient dynamic programming algorithms are available for a broad class of protein and DNA sequence comparison problems. These algorithms require computer time proportional to the product of the lengths of the two sequences being compared [O(N2)] but require memory space proportional only to the sum of these lengths [O(N)]. Although the requirement for O(N2) time limits use of the algorithms to the largest computers when searching protein and DNA sequence databases, many other applications of these algorithms, such as calculation of distances for evolutionary trees and comparison of a new sequence to a library of sequence profiles, are well within the capabilities of desktop computers. In particular, the results of library searches with rapid searching programs, such as FASTA or BLAST, should be confirmed by performing a rigorous optimal alignment. Whereas rapid methods do not overlook significant sequence similarities, FASTA limits the number of gaps that can be inserted into an alignment, so that a rigorous alignment may extend the alignment substantially in some cases. BLAST does not allow gaps in the local regions that it reports; a calculation that allows gaps is very likely to extend the alignment substantially. Although a Monte Carlo evaluation of the statistical significance of a similarity score with a rigorous algorithm is much slower than the heuristic approach used by the RDF2 program, the dynamic programming approach should take less than 1 hr on a 386-based PC or desktop Unix workstation. For descriptive purposes, we have limited our discussion to methods for calculating similarity scores and distances that use gap penalties of the form g = rk. Nevertheless, programs for the more general case (g = q+rk) are readily available. Versions of these programs that run either on Unix workstations, IBM-PC class computers, or the Macintosh can be obtained from either of the authors.

  13. Using Difference Equation to Model Discrete-time Behavior in System Dynamics Modeling

    NARCIS (Netherlands)

    Hesan, R.; Ghorbani, A.; Dignum, M.V.

    2014-01-01

    In system dynamics modeling, differential equations have been used as the basic mathematical operator. Using difference equation to build system dynamics models instead of differential equation, can be insightful for studying small organizations or systems with micro behavior. In this paper we

  14. Modeling of light dynamic cone penetration test - Panda 3 ® in granular material by using 3D Discrete element method

    Science.gov (United States)

    Tran, Quoc Anh; Chevalier, Bastien; Benz, Miguel; Breul, Pierre; Gourvès, Roland

    2017-06-01

    The recent technological developments made on the light dynamic penetration test Panda 3 ® provide a dynamic load-penetration curve σp - sp for each impact. This curve is influenced by the mechanical and physical properties of the investigated granular media. In order to analyze and exploit the load-penetration curve, a numerical model of penetration test using 3D Discrete Element Method is proposed for reproducing tests in dynamic conditions in granular media. All parameters of impact used in this model have at first been calibrated by respecting mechanical and geometrical properties of the hammer and the rod. There is a good agreement between experimental results and the ones obtained from simulations in 2D or 3D. After creating a sample, we will simulate the Panda 3 ®. It is possible to measure directly the dynamic load-penetration curve occurring at the tip for each impact. Using the force and acceleration measured in the top part of the rod, it is possible to separate the incident and reflected waves and then calculate the tip's load-penetration curve. The load-penetration curve obtained is qualitatively similar with that obtained by experimental tests. In addition, the frequency analysis of the measured signals present also a good compliance with that measured in reality when the tip resistance is qualitatively similar.

  15. Attractors of relaxation discrete-time systems with chaotic dynamics on a fast time scale

    International Nuclear Information System (INIS)

    Maslennikov, Oleg V.; Nekorkin, Vladimir I.

    2016-01-01

    In this work, a new type of relaxation systems is considered. Their prominent feature is that they comprise two distinct epochs, one is slow regular motion and another is fast chaotic motion. Unlike traditionally studied slow-fast systems that have smooth manifolds of slow motions in the phase space and fast trajectories between them, in this new type one observes, apart the same geometric objects, areas of transient chaos. Alternating periods of slow regular motions and fast chaotic ones as well as transitions between them result in a specific chaotic attractor with chaos on a fast time scale. We formulate basic properties of such attractors in the framework of discrete-time systems and consider several examples. Finally, we provide an important application of such systems, the neuronal electrical activity in the form of chaotic spike-burst oscillations.

  16. A hybrid Bayesian network approach for trade-offs between environmental flows and agricultural water using dynamic discretization

    Science.gov (United States)

    Xue, Jie; Gui, Dongwei; Lei, Jiaqiang; Sun, Huaiwei; Zeng, Fanjiang; Feng, Xinlong

    2017-12-01

    Agriculture and the eco-environment are increasingly competing for water. The extension of intensive farmland for ensuring food security has resulted in excessive water exploitation by agriculture. Consequently, this has led to a lack of water supply in natural ecosystems. This paper proposes a trade-off framework to coordinate the water-use conflict between agriculture and the eco-environment, based on economic compensation for irrigation stakeholders. A hybrid Bayesian network (HBN) is developed to implement the framework, including: (a) agricultural water shortage assessments after meeting environmental flows; (b) water-use tradeoff analysis between agricultural irrigation and environmental flows using the HBN; and (c) quantification of the agricultural economic compensation for different irrigation stakeholders. The constructed HBN is computed by dynamic discretization, which is a more robust and accurate propagation algorithm than general static discretization. A case study of the Qira oasis area in Northwest China demonstrates that the water trade-off based on economic compensation depends on the available water supply and environmental flows at different levels. Agricultural irrigation water extracted for grain crops should be preferentially guaranteed to ensure food security, in spite of higher economic compensation in other cash crops' irrigation for water coordination. Updating water-saving engineering and adopting drip irrigation technology in agricultural facilities after satisfying environmental flows would greatly relieve agricultural water shortage and save the economic compensation for different irrigation stakeholders. The approach in this study can be easily applied in water-stressed areas worldwide for dealing with water competition.

  17. Investigation of dynamics of discrete framed structures by a numerical wave-based method and an analytical homogenization approach

    Directory of Open Access Journals (Sweden)

    Changwei Zhou

    2017-02-01

    Full Text Available In this article, the analytical homogenization method of periodic discrete media (HPDM and the numerical condensed wave finite element method (CWFEM are employed to study the longitudinal and transverse vibrations of framed structures. The valid frequency range of the HPDM is re-evaluated using the wave propagation feature identified by the CWFEM. The relative error of the wavenumber by the HPDM compared to that by the CWFEM is illustrated in functions of frequency and scale ratio. A parametric study on the thickness of the structure is carried out where the dispersion relation and the relative error are given for three different thicknesses. The dynamics of a finite structure such as natural frequency and forced response are also investigated using the HPDM and the CWFEM.

  18. Discrete optimization

    CERN Document Server

    Parker, R Gary

    1988-01-01

    This book treats the fundamental issues and algorithmic strategies emerging as the core of the discipline of discrete optimization in a comprehensive and rigorous fashion. Following an introductory chapter on computational complexity, the basic algorithmic results for the two major models of polynomial algorithms are introduced--models using matroids and linear programming. Further chapters treat the major non-polynomial algorithms: branch-and-bound and cutting planes. The text concludes with a chapter on heuristic algorithms.Several appendixes are included which review the fundamental ideas o

  19. Automated Flight Routing Using Stochastic Dynamic Programming

    Science.gov (United States)

    Ng, Hok K.; Morando, Alex; Grabbe, Shon

    2010-01-01

    Airspace capacity reduction due to convective weather impedes air traffic flows and causes traffic congestion. This study presents an algorithm that reroutes flights in the presence of winds, enroute convective weather, and congested airspace based on stochastic dynamic programming. A stochastic disturbance model incorporates into the reroute design process the capacity uncertainty. A trajectory-based airspace demand model is employed for calculating current and future airspace demand. The optimal routes minimize the total expected traveling time, weather incursion, and induced congestion costs. They are compared to weather-avoidance routes calculated using deterministic dynamic programming. The stochastic reroutes have smaller deviation probability than the deterministic counterpart when both reroutes have similar total flight distance. The stochastic rerouting algorithm takes into account all convective weather fields with all severity levels while the deterministic algorithm only accounts for convective weather systems exceeding a specified level of severity. When the stochastic reroutes are compared to the actual flight routes, they have similar total flight time, and both have about 1% of travel time crossing congested enroute sectors on average. The actual flight routes induce slightly less traffic congestion than the stochastic reroutes but intercept more severe convective weather.

  20. Runway Scheduling Using Generalized Dynamic Programming

    Science.gov (United States)

    Montoya, Justin; Wood, Zachary; Rathinam, Sivakumar

    2011-01-01

    A generalized dynamic programming method for finding a set of pareto optimal solutions for a runway scheduling problem is introduced. The algorithm generates a set of runway fight sequences that are optimal for both runway throughput and delay. Realistic time-based operational constraints are considered, including miles-in-trail separation, runway crossings, and wake vortex separation. The authors also model divergent runway takeoff operations to allow for reduced wake vortex separation. A modeled Dallas/Fort Worth International airport and three baseline heuristics are used to illustrate preliminary benefits of using the generalized dynamic programming method. Simulated traffic levels ranged from 10 aircraft to 30 aircraft with each test case spanning 15 minutes. The optimal solution shows a 40-70 percent decrease in the expected delay per aircraft over the baseline schedulers. Computational results suggest that the algorithm is promising for real-time application with an average computation time of 4.5 seconds. For even faster computation times, two heuristics are developed. As compared to the optimal, the heuristics are within 5% of the expected delay per aircraft and 1% of the expected number of runway operations per hour ad can be 100x faster.

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

  2. Effect of discrete wires on the implosion dynamics of wire array Z pinches

    International Nuclear Information System (INIS)

    Lebedev, S. V.; Beg, F. N.; Bland, S. N.; Chittenden, J. P.; Dangor, A. E.; Haines, M. G.; Kwek, K. H.; Pikuz, S. A.; Shelkovenko, T. A.

    2001-01-01

    A phenomenological model of wire array Z-pinch implosions, based on the analysis of experimental data obtained on the mega-ampere generator for plasma implosion experiments (MAGPIE) generator [I. H. Mitchell , Rev. Sci. Instrum. 67, 1533 (1996)], is described. The data show that during the first ∼80% of the implosion the wire cores remain stationary in their initial positions, while the coronal plasma is continuously jetting from the wire cores to the array axis. This phase ends by the formation of gaps in the wire cores, which occurs due to the nonuniformity of the ablation rate along the wires. The final phase of the implosion starting at this time occurs as a rapid snowplow-like implosion of the radially distributed precursor plasma, previously injected in the interior of the array. The density distribution of the precursor plasma, being peaked on the array axis, could be a key factor providing stability of the wire array implosions operating in the regime of discrete wires. The modified ''initial'' conditions for simulations of wire array Z-pinch implosions with one-dimension (1D) and two-dimensions (2D) in the r--z plane, radiation-magnetohydrodynamic (MHD) codes, and a possible scaling to a larger drive current are discussed

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

  4. Markov state modeling and dynamical coarse-graining via discrete relaxation path sampling.

    Science.gov (United States)

    Fačkovec, B; Vanden-Eijnden, E; Wales, D J

    2015-07-28

    A method is derived to coarse-grain the dynamics of complex molecular systems to a Markov jump process (MJP) describing how the system jumps between cells that fully partition its state space. The main inputs are relaxation times for each pair of cells, which are shown to be robust with respect to positioning of the cell boundaries. These relaxation times can be calculated via molecular dynamics simulations performed in each cell separately and are used in an efficient estimator for the rate matrix of the MJP. The method is illustrated through applications to Sinai billiards and a cluster of Lennard-Jones discs.

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

  6. Speciation dynamics of metals in dispersion of nanoparticles with discrete distribution of charged binding sites.

    Science.gov (United States)

    Polyakov, Pavel D; Duval, Jérôme F L

    2014-02-07

    We report a comprehensive theory to evaluate the kinetics of complex formation between metal ions and charged spherical nanoparticles. The latter consist of an ion-impermeable core surrounded by a soft shell layer characterized by a discrete axisymmetric 2D distribution of charged sites that bind metal ions. The theory explicitly integrates the conductive diffusion of metal ions from bulk solution toward the respective locations of the reactive sites within the particle shell volume. The kinetic constant k for outer-sphere nanoparticle-metal association is obtained from the sum of the contributions stemming from all reactive sites, each evaluated from the corresponding incoming flux of metal ions derived from steady-state Poisson-Nernst-Planck equations. Illustrations are provided to capture the basic intertwined impacts of particle size, overall particle charge, spatial heterogeneity in site distribution, type of particle (hard, core-shell or porous) and concentration of the background electrolyte on k. As a limit, k converges with predictions from previously reported analytical expressions derived for porous particles with low and high charge density, cases that correspond to coulombic and mean-field (smeared-out) electrostatic treatments, respectively. The conditions underlying the applicability of these latter approaches are rigorously identified in terms of (i) the extent of overlap between electric double layers around charged neighbouring sites, and (ii) the magnitude of the intraparticulate metal concentration gradient. For the first time, the proposed theory integrates the differentiated impact of the local potential around the charged binding sites amidst the overall particle field, together with that of the so-far discarded intraparticulate flux of metal ions.

  7. Trivial dynamics in discrete-time systems: carrying simplex and translation arcs

    Science.gov (United States)

    Niu, Lei; Ruiz-Herrera, Alfonso

    2018-06-01

    In this paper we show that the dynamical behavior in (first octant) of the classical Kolmogorov systems of competitive type admitting a carrying simplex can be sometimes determined completely by the number of fixed points on the boundary and the local behavior around them. Roughly speaking, T has trivial dynamics (i.e. the omega limit set of any orbit is a connected set contained in the set of fixed points) provided T has exactly four hyperbolic nontrivial fixed points in with local attractors on the carrying simplex and local repellers on the carrying simplex; and there exists a unique hyperbolic fixed point in Int. Our results are applied to some classical models including the Leslie–Gower models, Atkinson-Allen systems and Ricker maps.

  8. Noise Induced Dissipation in Discrete-Time Classical and Quantum Dynamical Systems

    OpenAIRE

    Wolowski, Lech

    2004-01-01

    We introduce a new characteristics of chaoticity of classical and quantum dynamical systems by defining the notion of the dissipation time which enables us to test how the system responds to the noise and in particular to measure the speed at which an initially closed, conservative system converges to the equilibrium when subjected to noisy (stochastic) perturbations. We prove fast dissipation result for classical Anosov systems and ...

  9. Analysis of farmers' willingness to participate in pasture grazing programs: Results from a discrete choice experiment with German dairy farmers.

    Science.gov (United States)

    Danne, M; Musshoff, O

    2017-09-01

    Over the last decades, the usage of pasture for grazing of dairy cows has decreased considerably. Pasture grazing programs initiated by dairy companies try to counteract this trend. The present paper investigates farmers' willingness to participate in such grazing programs. A special aim was to quantify the price premiums farmers require for program participation and to identify determinants influencing the premium level. The empirical analysis is based on a discrete choice experiment with 293 German dairy farmers. Models are estimated in terms of willingness to accept. It was found that farmers have no substantial preference for whether the pasture grazing program is financed by the food industry, a governmental scheme, or the dairy company. However, an extension of the annual or daily grazing period results in a decreasing willingness of farmers to participate in a pasture grazing program. In addition, farmers decline the option of a feeding standard prescribing the use of only green fodder when offered an alternative program that merely reduces the amount of concentrated feed or maize silage in the diet. Farmers' with an aversion toward program participation have a significant higher price demand for fulfilling the program requirements. Furthermore, the required price premiums increase with growing milk yields and a greater number of cows kept on the farm. However, if the availability of pasture is high, farmers are more likely to participate. The estimated price premiums and factors influencing farmers' willingness to participate found by this study should be considered by dairies and policymakers to gain insights into the design of possible pasture grazing programs from the perspective of farmers. Thereby, paying price premiums to farmers may increase the attractiveness of pasture grazing, which could finally result in an extended usage of pasture grazing. Copyright © 2017 American Dairy Science Association. Published by Elsevier Inc. All rights reserved.

  10. Development of parallel 3D discrete ordinates transport program on JASMIN framework

    International Nuclear Information System (INIS)

    Cheng, T.; Wei, J.; Shen, H.; Zhong, B.; Deng, L.

    2015-01-01

    A parallel 3D discrete ordinates radiation transport code JSNT-S is developed, aiming at simulating real-world radiation shielding and reactor physics applications in a reasonable time. Through the patch-based domain partition algorithm, the memory requirement is shared among processors and a space-angle parallel sweeping algorithm is developed based on data-driven algorithm. Acceleration methods such as partial current rebalance are implemented. The correctness is proved through the VENUS-3 and other benchmark models. In the radiation shielding calculation of the Qinshan-II reactor pressure vessel model with 24.3 billion DoF, only 88 seconds is required and the overall parallel efficiency of 44% is achieved on 1536 CPU cores. (author)

  11. Synchronization Control for a Class of Discrete-Time Dynamical Networks With Packet Dropouts: A Coding-Decoding-Based Approach.

    Science.gov (United States)

    Wang, Licheng; Wang, Zidong; Han, Qing-Long; Wei, Guoliang

    2017-09-06

    The synchronization control problem is investigated for a class of discrete-time dynamical networks with packet dropouts via a coding-decoding-based approach. The data is transmitted through digital communication channels and only the sequence of finite coded signals is sent to the controller. A series of mutually independent Bernoulli distributed random variables is utilized to model the packet dropout phenomenon occurring in the transmissions of coded signals. The purpose of the addressed synchronization control problem is to design a suitable coding-decoding procedure for each node, based on which an efficient decoder-based control protocol is developed to guarantee that the closed-loop network achieves the desired synchronization performance. By applying a modified uniform quantization approach and the Kronecker product technique, criteria for ensuring the detectability of the dynamical network are established by means of the size of the coding alphabet, the coding period and the probability information of packet dropouts. Subsequently, by resorting to the input-to-state stability theory, the desired controller parameter is obtained in terms of the solutions to a certain set of inequality constraints which can be solved effectively via available software packages. Finally, two simulation examples are provided to demonstrate the effectiveness of the obtained results.

  12. Automation of the driving using the dynamic programming; Automatisierung des Treibens mittels diskreter dynamischer Programmierung

    Energy Technology Data Exchange (ETDEWEB)

    Yang, Zongru; Buerger, Sebastian; Lohmann, Boris [Technische Univ. Muenchen, Garching (Germany). Lehrstuhl fuer Regelungstechnik

    2009-07-01

    Driving is a metal forming process throughout hammering in cold state. It can create almost any 2D and 3D metal sheets using universal tools. During driving, many parameters of the tools and the sheets affect the forming process, which inhibits a complete automation. In this paper, a model based control for a 2D driving process is proposed. The process of stretching L-shaped metal sheets is analytically modelled. Three phases, namely hybrid deformations, material flow as well as springback and inverse bending, describe the deformation process at one stroke. This results in a nonlinear (non-affine), time-discrete state space model. A model predictive controller (MPC) is then designed to determine the optimal control inputs at every time step. Thereby, an objective function that describes the costs from a start angle to an end condition is minimized by means of discrete dynamic programming (DDP). (orig.)

  13. Three-dimensional poor man's Navier-Stokes equation: a discrete dynamical system exhibiting k(-5/3) inertial subrange energy scaling.

    Science.gov (United States)

    McDonough, J M

    2009-06-01

    Outline of the derivation and mathematical and physical interpretations are presented for a discrete dynamical system known as the "poor man's Navier-Stokes equation." Numerical studies demonstrate that velocity fields produced by this dynamical system are similar to those seen in laboratory experiments and in detailed simulations, and they lead to scaling for the turbulence kinetic energy spectrum in accord with Kolmogorov K41 theory.

  14. Pareto optimization in algebraic dynamic programming.

    Science.gov (United States)

    Saule, Cédric; Giegerich, Robert

    2015-01-01

    Pareto optimization combines independent objectives by computing the Pareto front of its search space, defined as the set of all solutions for which no other candidate solution scores better under all objectives. This gives, in a precise sense, better information than an artificial amalgamation of different scores into a single objective, but is more costly to compute. Pareto optimization naturally occurs with genetic algorithms, albeit in a heuristic fashion. Non-heuristic Pareto optimization so far has been used only with a few applications in bioinformatics. We study exact Pareto optimization for two objectives in a dynamic programming framework. We define a binary Pareto product operator [Formula: see text] on arbitrary scoring schemes. Independent of a particular algorithm, we prove that for two scoring schemes A and B used in dynamic programming, the scoring scheme [Formula: see text] correctly performs Pareto optimization over the same search space. We study different implementations of the Pareto operator with respect to their asymptotic and empirical efficiency. Without artificial amalgamation of objectives, and with no heuristics involved, Pareto optimization is faster than computing the same number of answers separately for each objective. For RNA structure prediction under the minimum free energy versus the maximum expected accuracy model, we show that the empirical size of the Pareto front remains within reasonable bounds. Pareto optimization lends itself to the comparative investigation of the behavior of two alternative scoring schemes for the same purpose. For the above scoring schemes, we observe that the Pareto front can be seen as a composition of a few macrostates, each consisting of several microstates that differ in the same limited way. We also study the relationship between abstract shape analysis and the Pareto front, and find that they extract information of a different nature from the folding space and can be meaningfully combined.

  15. Quantized Hamilton dynamics describes quantum discrete breathers in a simple way

    International Nuclear Information System (INIS)

    Igumenshchev, Kirill; Prezhdo, Oleg

    2011-01-01

    We study the localization of energy in a nonlinear coupled system, exhibiting so-called breather modes, using quantized Hamilton dynamics (QHD). Already at the lowest order, which is only twice as complex as classical mechanics, this simple semiclassical method incorporates quantum-mechanical effects. The transition between the localized and delocalized regimes is instantaneous in classical mechanics, while it is gradual due to tunneling in both quantum mechanics and QHD. In contrast to classical mechanics, which predicts an abrupt appearance of breathers, quantum mechanics and QHD show an alternation of localized and delocalized behavior in the transient region. QHD includes zero-point energy that is reflected in a shifted energy asymptote for the localized states, providing another improvement on the classical perspective. By detailed analysis of the distribution and transfer of energy within classical mechanics, QHD, and quantum dynamics, we conclude that QHD is an efficient approach that accounts for moderate quantum effects and can be used to identify quantum breathers in large nonlinear systems.

  16. Implementing a Dynamic Street-Children's Program: Successes and ...

    African Journals Online (AJOL)

    dynamic street children's program in Mzuzu Malawi – using a developmental ... dynamics of parentchild, parent-parent and child-parent-environment; life-events; ... of child and adolescent development, and how they can influence the child's ...

  17. Analysis of dynamic enhancement of natural convection cooling by a discrete vibrating plate

    Energy Technology Data Exchange (ETDEWEB)

    Florio, L.A.; Harnoy, A. [New Jersey Institute of Technology, Department of Mechanical Engineering, Newark, NJ (United States)

    2006-12-15

    A dynamic means of locally enhancing laminar natural convection cooling in a vertical channel through the localized application of fluid oscillations is numerically investigated. The two-dimensional system considered for these purposes is a vertical channel with a small transversely oscillating plate placed near a constant heat flux channel wall. The flow and heat transfer in the system resulting from the combined effects of the natural convection and the oscillating plate were determined. The results indicate that for displacement amplitudes of at least one-third of the mean spacing and with dimensionless frequencies (Re/{radical}(Gr)) of at least 2{pi}, the local heat transfer coefficient can be enhanced by as much as 41%. (orig.)

  18. The Dynamics of the Discrete Ultimatum Game and the Role of the Expectation Level

    Directory of Open Access Journals (Sweden)

    Lili Deng

    2016-01-01

    Full Text Available We have studied evolutionary ultimatum game with spatially arranged players, who have choice between the two kinds of strategies (named greedy and altruist. The strategies in the ultimatum game here are described by p(i and a(i, that is, the probability of offering i to himself and the accepting probability when receiving i. By using computer simulations with C++ builder, we have provided the dynamics of the greedy and altruistic strategies and found that the proportion evolution of the “greedy” strategy for different initial cases is approximately 60%. Furthermore, the explanations for the interesting phenomenon are presented from different aspects. In addition, we illustrate that the factor of the expectation level (aspiration level in the updating rule plays an important role in the promotion of altruistic behaviors.

  19. Convergence of Sample Path Optimal Policies for Stochastic Dynamic Programming

    National Research Council Canada - National Science Library

    Fu, Michael C; Jin, Xing

    2005-01-01

    .... These results have practical implications for Monte Carlo simulation-based solution approaches to stochastic dynamic programming problems where it is impractical to extract the explicit transition...

  20. A Case Study on Air Combat Decision Using Approximated Dynamic Programming

    Directory of Open Access Journals (Sweden)

    Yaofei Ma

    2014-01-01

    Full Text Available As a continuous state space problem, air combat is difficult to be resolved by traditional dynamic programming (DP with discretized state space. The approximated dynamic programming (ADP approach is studied in this paper to build a high performance decision model for air combat in 1 versus 1 scenario, in which the iterative process for policy improvement is replaced by mass sampling from history trajectories and utility function approximating, leading to high efficiency on policy improvement eventually. A continuous reward function is also constructed to better guide the plane to find its way to “winner” state from any initial situation. According to our experiments, the plane is more offensive when following policy derived from ADP approach other than the baseline Min-Max policy, in which the “time to win” is reduced greatly but the cumulated probability of being killed by enemy is higher. The reason is analyzed in this paper.

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

  2. Dynamic soil-structure interaction analysis based on discretized Green function

    International Nuclear Information System (INIS)

    Muto, K.; Kobayashi, T.; Nakahara, M.

    1983-01-01

    In the seismic design of massive and rigid structure such as a nuclear reactor building, it is important to evaluate the dynamic interaction effect between soil and structure. The authors developed an advanced and practical method to evaluate the interaction effect between the soil which is considered to be semi-infinite elastic medium, and the structure in which flexibility is considered. In this report, this method is applied to a seismic analysis of the full size BWR Mark I type reactor building. For horizontal input earthquake, the vibrational degrees of freedom shall be considered both horizontal and vertical as the rocking response occurs because of the overturning moment caused by the building's horizontal response. The results of earthquake response analysis show that the floors deform in-place and the response acceleration at the center of the floor is larger than that of at the side wall. The response spectra also differ each other even if on the same floor because of the in-place deformation of the floor slab. It means that in analytical modeling of the reactor building, multi-stick model considering deformation of floor slab is required instead of single-stick model. The ratio of the peak acceleration response of the roof floor to the input earthquake is about 2.5. (orig./HP)

  3. Solutions Stability of Initial Boundary Problem, Modeling of Dynamics of Some Discrete Continuum Mechanical System

    Directory of Open Access Journals (Sweden)

    D. A. Eliseev

    2015-01-01

    Full Text Available The solution stability of an initial boundary problem for a linear hybrid system of differential equations, which models the rotation of a rigid body with two elastic rods located in the same plane is studied in the paper. To an axis passing through the mass center of the rigid body perpendicularly to the rods location plane is applied the stabilizing moment proportional to the angle of the system rotation, derivative of the angle, integral of the angle. The external moment provides a feedback. A method of studying the behavior of solutions of the initial boundary problem is proposed. This method allows to exclude from the hybrid system of differential equations partial differential equations, which describe the dynamics of distributed elements of a mechanical system. It allows us to build one equation for an angle of the system rotation. Its characteristic equation defines the stability of solutions of all the system. In the space of feedback-coefficients the areas that provide the asymptotic stability of solutions of the initial boundary problem are built up.

  4. Budget Impact Analysis of Switching to Digital Mammography in a Population-Based Breast Cancer Screening Program: A Discrete Event Simulation Model

    Science.gov (United States)

    Comas, Mercè; Arrospide, Arantzazu; Mar, Javier; Sala, Maria; Vilaprinyó, Ester; Hernández, Cristina; Cots, Francesc; Martínez, Juan; Castells, Xavier

    2014-01-01

    Objective To assess the budgetary impact of switching from screen-film mammography to full-field digital mammography in a population-based breast cancer screening program. Methods A discrete-event simulation model was built to reproduce the breast cancer screening process (biennial mammographic screening of women aged 50 to 69 years) combined with the natural history of breast cancer. The simulation started with 100,000 women and, during a 20-year simulation horizon, new women were dynamically entered according to the aging of the Spanish population. Data on screening were obtained from Spanish breast cancer screening programs. Data on the natural history of breast cancer were based on US data adapted to our population. A budget impact analysis comparing digital with screen-film screening mammography was performed in a sample of 2,000 simulation runs. A sensitivity analysis was performed for crucial screening-related parameters. Distinct scenarios for recall and detection rates were compared. Results Statistically significant savings were found for overall costs, treatment costs and the costs of additional tests in the long term. The overall cost saving was 1,115,857€ (95%CI from 932,147 to 1,299,567) in the 10th year and 2,866,124€ (95%CI from 2,492,610 to 3,239,638) in the 20th year, representing 4.5% and 8.1% of the overall cost associated with screen-film mammography. The sensitivity analysis showed net savings in the long term. Conclusions Switching to digital mammography in a population-based breast cancer screening program saves long-term budget expense, in addition to providing technical advantages. Our results were consistent across distinct scenarios representing the different results obtained in European breast cancer screening programs. PMID:24832200

  5. Spatial cluster detection using dynamic programming

    Directory of Open Access Journals (Sweden)

    Sverchkov Yuriy

    2012-03-01

    Full Text Available Abstract Background The task of spatial cluster detection involves finding spatial regions where some property deviates from the norm or the expected value. In a probabilistic setting this task can be expressed as finding a region where some event is significantly more likely than usual. Spatial cluster detection is of interest in fields such as biosurveillance, mining of astronomical data, military surveillance, and analysis of fMRI images. In almost all such applications we are interested both in the question of whether a cluster exists in the data, and if it exists, we are interested in finding the most accurate characterization of the cluster. Methods We present a general dynamic programming algorithm for grid-based spatial cluster detection. The algorithm can be used for both Bayesian maximum a-posteriori (MAP estimation of the most likely spatial distribution of clusters and Bayesian model averaging over a large space of spatial cluster distributions to compute the posterior probability of an unusual spatial clustering. The algorithm is explained and evaluated in the context of a biosurveillance application, specifically the detection and identification of Influenza outbreaks based on emergency department visits. A relatively simple underlying model is constructed for the purpose of evaluating the algorithm, and the algorithm is evaluated using the model and semi-synthetic test data. Results When compared to baseline methods, tests indicate that the new algorithm can improve MAP estimates under certain conditions: the greedy algorithm we compared our method to was found to be more sensitive to smaller outbreaks, while as the size of the outbreaks increases, in terms of area affected and proportion of individuals affected, our method overtakes the greedy algorithm in spatial precision and recall. The new algorithm performs on-par with baseline methods in the task of Bayesian model averaging. Conclusions We conclude that the dynamic

  6. Computational Fluid Dynamics-Discrete Element Method (CFD-DEM) Study of Mass-Transfer Mechanisms in Riser Flow.

    Science.gov (United States)

    Carlos Varas, Álvaro E; Peters, E A J F; Kuipers, J A M

    2017-05-17

    We report a computational fluid dynamics-discrete element method (CFD-DEM) simulation study on the interplay between mass transfer and a heterogeneous catalyzed chemical reaction in cocurrent gas-particle flows as encountered in risers. Slip velocity, axial gas dispersion, gas bypassing, and particle mixing phenomena have been evaluated under riser flow conditions to study the complex system behavior in detail. The most important factors are found to be directly related to particle cluster formation. Low air-to-solids flux ratios lead to more heterogeneous systems, where the cluster formation is more pronounced and mass transfer more influenced. Falling clusters can be partially circumvented by the gas phase, which therefore does not fully interact with the cluster particles, leading to poor gas-solid contact efficiencies. Cluster gas-solid contact efficiencies are quantified at several gas superficial velocities, reaction rates, and dilution factors in order to gain more insight regarding the influence of clustering phenomena on the performance of riser reactors.

  7. Complex dynamics of a stochastic discrete modified Leslie-Gower predator-prey model with Michaelis-Menten type prey harvesting

    Directory of Open Access Journals (Sweden)

    A. Elhassanein

    2014-06-01

    Full Text Available This paper introduced a stochastic discretized version of the modified Leslie-Gower predator-prey model with Michaelis-Menten type prey harvesting. The dynamical behavior of the proposed model was investigated. The existence and stability of the equilibria of the skeleton were studied. Numerical simulations were employed to show the model's complex dynamics by means of the largest Lyapunov exponents, bifurcations, time series diagrams and phase portraits. The effects of noise intensity on its dynamics and the intermittency phenomenon were also discussed via simulation.

  8. Uncertainty Modeling and Robust Output Feedback Control of Nonlinear Discrete Systems: A Mathematical Programming Approach

    Directory of Open Access Journals (Sweden)

    Olav Slupphaug

    2001-01-01

    Full Text Available We present a mathematical programming approach to robust control of nonlinear systems with uncertain, possibly time-varying, parameters. The uncertain system is given by different local affine parameter dependent models in different parts of the state space. It is shown how this representation can be obtained from a nonlinear uncertain system by solving a set of continuous linear semi-infinite programming problems, and how each of these problems can be solved as a (finite series of ordinary linear programs. Additionally, the system representation includes control- and state constraints. The controller design method is derived from Lyapunov stability arguments and utilizes an affine parameter dependent quadratic Lyapunov function. The controller has a piecewise affine output feedback structure, and the design amounts to finding a feasible solution to a set of linear matrix inequalities combined with one spectral radius constraint on the product of two positive definite matrices. A local solution approach to this nonconvex feasibility problem is proposed. Complexity of the design method and some special cases such as state- feedback are discussed. Finally, an application of the results is given by proposing an on-line computationally feasible algorithm for constrained nonlinear state- feedback model predictive control with robust stability.

  9. Design and validation of a dynamic discrete event stochastic simulation model of mastitis control in dairy herds.

    Science.gov (United States)

    Allore, H G; Schruben, L W; Erb, H N; Oltenacu, P A

    1998-03-01

    A dynamic stochastic simulation model for discrete events, SIMMAST, was developed to simulate the effect of mastitis on the composition of the bulk tank milk of dairy herds. Intramammary infections caused by Streptococcus agalactiae, Streptococcus spp. other than Strep. agalactiae, Staphylococcus aureus, and coagulase-negative staphylococci were modeled as were the milk, fat, and protein test day solutions for individual cows, which accounted for the fixed effects of days in milk, age at calving, season of calving, somatic cell count (SCC), and random effects of test day, cow yield differences from herdmates, and autocorrelated errors. Probabilities for the transitions among various states of udder health (uninfected or subclinically or clinically infected) were calculated to account for exposure, heifer infection, spontaneous recovery, lactation cure, infection or cure during the dry period, month of lactation, parity, within-herd yields, and the number of quarters with clinical intramammary infection in the previous and current lactations. The stochastic simulation model was constructed using estimates from the literature and also using data from 164 herds enrolled with Quality Milk Promotion Services that each had bulk tank SCC between 500,000 and 750,000/ml. Model parameters and outputs were validated against a separate data file of 69 herds from the Northeast Dairy Herd Improvement Association, each with a bulk tank SCC that was > or = 500,000/ml. Sensitivity analysis was performed on all input parameters for control herds. Using the validated stochastic simulation model, the control herds had a stable time average bulk tank SCC between 500,000 and 750,000/ml.

  10. Approximate Dynamic Programming Solving the Curses of Dimensionality

    CERN Document Server

    Powell, Warren B

    2011-01-01

    Praise for the First Edition "Finally, a book devoted to dynamic programming and written using the language of operations research (OR)! This beautiful book fills a gap in the libraries of OR specialists and practitioners."-Computing Reviews This new edition showcases a focus on modeling and computation for complex classes of approximate dynamic programming problems Understanding approximate dynamic programming (ADP) is vital in order to develop practical and high-quality solutions to complex industrial problems, particularly when those problems involve making decisions in the presence of unce

  11. Advances in discrete differential geometry

    CERN Document Server

    2016-01-01

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

  12. Stochastic dynamic programming model for optimal resource ...

    Indian Academy of Sciences (India)

    M Bhuvaneswari

    2018-04-11

    Apr 11, 2018 ... handover in VANET; because of high dynamics in net- work topology, collaboration ... containers, doctors, nurses, cash and stocks. Similarly, ... GTBA does not take the resource types and availability into consideration.

  13. Dynamic Programming Algorithms in Speech Recognition

    Directory of Open Access Journals (Sweden)

    Titus Felix FURTUNA

    2008-01-01

    Full Text Available In a system of speech recognition containing words, the recognition requires the comparison between the entry signal of the word and the various words of the dictionary. The problem can be solved efficiently by a dynamic comparison algorithm whose goal is to put in optimal correspondence the temporal scales of the two words. An algorithm of this type is Dynamic Time Warping. This paper presents two alternatives for implementation of the algorithm designed for recognition of the isolated words.

  14. Environmental/dynamic mechanical equipment qualification and dynamic electrical equipment qualification program (EDQP)

    International Nuclear Information System (INIS)

    Hunter, J.A.

    1984-01-01

    Equipment qualification research is being conducted to investigate acceptable criteria, requirements, and methodologies for the dynamic (including seismic) and environmental qualification of mechanical equipment and for the dynamic (including seismic) qualification of electrical equipment. The program is organized into three elements: (1) General Research, (2) Environmental Research, and (3) Dynamic Research. This paper presents the highlights of the results to date in these three elements of the program

  15. Dynamic programming approach to optimization of approximate decision rules

    KAUST Repository

    Amin, Talha M.; Chikalov, Igor; Moshkov, Mikhail; Zielosko, Beata

    2013-01-01

    This paper is devoted to the study of an extension of dynamic programming approach which allows sequential optimization of approximate decision rules relative to the length and coverage. We introduce an uncertainty measure R(T) which is the number

  16. Dynamic Programming Approach for Exact Decision Rule Optimization

    KAUST Repository

    Amin, Talha M.; Chikalov, Igor; Moshkov, Mikhail; Zielosko, Beata

    2013-01-01

    This chapter is devoted to the study of an extension of dynamic programming approach that allows sequential optimization of exact decision rules relative to the length and coverage. It contains also results of experiments with decision tables from

  17. Discrete Mathematics

    DEFF Research Database (Denmark)

    Sørensen, John Aasted

    2011-01-01

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

  18. Digital Discretion

    DEFF Research Database (Denmark)

    Busch, Peter Andre; Zinner Henriksen, Helle

    2018-01-01

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

  19. Modeling of fluid injection and withdrawal induced fault activation using discrete element based hydro-mechanical and dynamic coupled simulator

    Science.gov (United States)

    Yoon, Jeoung Seok; Zang, Arno; Zimmermann, Günter; Stephansson, Ove

    2016-04-01

    Operation of fluid injection into and withdrawal from the subsurface for various purposes has been known to induce earthquakes. Such operations include hydraulic fracturing for shale gas extraction, hydraulic stimulation for Enhanced Geothermal System development and waste water disposal. Among these, several damaging earthquakes have been reported in the USA in particular in the areas of high-rate massive amount of wastewater injection [1] mostly with natural fault systems. Oil and gas production have been known to induce earthquake where pore fluid pressure decreases in some cases by several tens of Mega Pascal. One recent seismic event occurred in November 2013 near Azle, Texas where a series of earthquakes began along a mapped ancient fault system [2]. It was studied that a combination of brine production and waste water injection near the fault generated subsurface pressures sufficient to induced earthquakes on near-critically stressed faults. This numerical study aims at investigating the occurrence mechanisms of such earthquakes induced by fluid injection [3] and withdrawal by using hydro-geomechanical coupled dynamic simulator (Itasca's Particle Flow Code 2D). Generic models are setup to investigate the sensitivity of several parameters which include fault orientation, frictional properties, distance from the injection well to the fault, amount of fluid withdrawal around the injection well, to the response of the fault systems and the activation magnitude. Fault slip movement over time in relation to the diffusion of pore pressure is analyzed in detail. Moreover, correlations between the spatial distribution of pore pressure change and the locations of induced seismic events and fault slip rate are investigated. References [1] Keranen KM, Weingarten M, Albers GA, Bekins BA, Ge S, 2014. Sharp increase in central Oklahoma seismicity since 2008 induced by massive wastewater injection, Science 345, 448, DOI: 10.1126/science.1255802. [2] Hornbach MJ, DeShon HR

  20. An Improved Dynamic Programming Decomposition Approach for Network Revenue Management

    OpenAIRE

    Dan Zhang

    2011-01-01

    We consider a nonlinear nonseparable functional approximation to the value function of a dynamic programming formulation for the network revenue management (RM) problem with customer choice. We propose a simultaneous dynamic programming approach to solve the resulting problem, which is a nonlinear optimization problem with nonlinear constraints. We show that our approximation leads to a tighter upper bound on optimal expected revenue than some known bounds in the literature. Our approach can ...

  1. Dynamic Programming Approaches for the Traveling Salesman Problem with Drone

    OpenAIRE

    Bouman, Paul; Agatz, Niels; Schmidt, Marie

    2017-01-01

    markdownabstractA promising new delivery model involves the use of a delivery truck that collaborates with a drone to make deliveries. Effectively combining a drone and a truck gives rise to a new planning problem that is known as the Traveling Salesman Problem with Drone (TSP-D). This paper presents an exact solution approach for the TSP-D based on dynamic programming and present experimental results of different dynamic programming based heuristics. Our numerical experiments show that our a...

  2. Dynamic Performance Tuning Supported by Program Specification

    Directory of Open Access Journals (Sweden)

    Eduardo César

    2002-01-01

    Full Text Available Performance analysis and tuning of parallel/distributed applications are very difficult tasks for non-expert programmers. It is necessary to provide tools that automatically carry out these tasks. These can be static tools that carry out the analysis on a post-mortem phase or can tune the application on the fly. Both kind of tools have their target applications. Static automatic analysis tools are suitable for stable application while dynamic tuning tools are more appropriate to applications with dynamic behaviour. In this paper, we describe KappaPi as an example of a static automatic performance analysis tool, and also a general environment based on parallel patterns for developing and dynamically tuning parallel/distributed applications.

  3. INDDGO: Integrated Network Decomposition & Dynamic programming for Graph Optimization

    Energy Technology Data Exchange (ETDEWEB)

    Groer, Christopher S [ORNL; Sullivan, Blair D [ORNL; Weerapurage, Dinesh P [ORNL

    2012-10-01

    It is well-known that dynamic programming algorithms can utilize tree decompositions to provide a way to solve some \\emph{NP}-hard problems on graphs where the complexity is polynomial in the number of nodes and edges in the graph, but exponential in the width of the underlying tree decomposition. However, there has been relatively little computational work done to determine the practical utility of such dynamic programming algorithms. We have developed software to construct tree decompositions using various heuristics and have created a fast, memory-efficient dynamic programming implementation for solving maximum weighted independent set. We describe our software and the algorithms we have implemented, focusing on memory saving techniques for the dynamic programming. We compare the running time and memory usage of our implementation with other techniques for solving maximum weighted independent set, including a commercial integer programming solver and a semi-definite programming solver. Our results indicate that it is possible to solve some instances where the underlying decomposition has width much larger than suggested by the literature. For certain types of problems, our dynamic programming code runs several times faster than these other methods.

  4. Dynamic Learning Objects to Teach Java Programming Language

    Science.gov (United States)

    Narasimhamurthy, Uma; Al Shawkani, Khuloud

    2010-01-01

    This article describes a model for teaching Java Programming Language through Dynamic Learning Objects. The design of the learning objects was based on effective learning design principles to help students learn the complex topic of Java Programming. Visualization was also used to facilitate the learning of the concepts. (Contains 1 figure and 2…

  5. Proving deadlock freedom of logic programs with dynamic scheduling

    NARCIS (Netherlands)

    E. Marchiori; F. Teusink (Frank)

    1996-01-01

    textabstractIn increasingly many logic programming systems, the Prolog left to right selection rule has been replaced with dynamic selection rules, that select an atom of a query among those satisfying suitable conditions. These conditions describe the form of the arguments of every program

  6. Lattice dynamics of NaI studied by inelastic neutron scattering: absence of thermally induced discrete breathers

    Czech Academy of Sciences Publication Activity Database

    Kempa, Martin; Ondrejkovič, Petr; Bourges, P.; Márton, Pavel; Hlinka, Jiří

    2014-01-01

    Roč. 89, č. 5 (2014), "054308-1"-"054308-5" ISSN 1098-0121 R&D Projects: GA ČR GPP204/11/P404 Institutional support: RVO:68378271 Keywords : NaI * alkali halides * inelastic neutron scattering * discrete breathers Subject RIV: BM - Solid Matter Physics ; Magnetism Impact factor: 3.736, year: 2014

  7. Approximate probabilistic cellular automata for the dynamics of single-species populations under discrete logisticlike growth with and without weak Allee effects.

    Science.gov (United States)

    Mendonça, J Ricardo G; Gevorgyan, Yeva

    2017-05-01

    We investigate one-dimensional elementary probabilistic cellular automata (PCA) whose dynamics in first-order mean-field approximation yields discrete logisticlike growth models for a single-species unstructured population with nonoverlapping generations. Beginning with a general six-parameter model, we find constraints on the transition probabilities of the PCA that guarantee that the ensuing approximations make sense in terms of population dynamics and classify the valid combinations thereof. Several possible models display a negative cubic term that can be interpreted as a weak Allee factor. We also investigate the conditions under which a one-parameter PCA derived from the more general six-parameter model can generate valid population growth dynamics. Numerical simulations illustrate the behavior of some of the PCA found.

  8. Nonlinear beam dynamics experimental program at SPEAR

    International Nuclear Information System (INIS)

    Tran, P.; Pellegrini, C.; Cornacchia, M.; Lee, M.; Corbett, W.

    1995-01-01

    Since nonlinear effects can impose strict performance limitations on modern colliders and storage rings, future performance improvements depend on further understanding of nonlinear beam dynamics. Experimental studies of nonlinear beam motion in three-dimensional space have begun in SPEAR using turn-by-turn transverse and longitudinal phase-space monitors. This paper presents preliminary results from an on-going experiment in SPEAR

  9. A new 2D segmentation method based on dynamic programming applied to computer aided detection in mammography

    International Nuclear Information System (INIS)

    Timp, Sheila; Karssemeijer, Nico

    2004-01-01

    Mass segmentation plays a crucial role in computer-aided diagnosis (CAD) systems for classification of suspicious regions as normal, benign, or malignant. In this article we present a robust and automated segmentation technique--based on dynamic programming--to segment mass lesions from surrounding tissue. In addition, we propose an efficient algorithm to guarantee resulting contours to be closed. The segmentation method based on dynamic programming was quantitatively compared with two other automated segmentation methods (region growing and the discrete contour model) on a dataset of 1210 masses. For each mass an overlap criterion was calculated to determine the similarity with manual segmentation. The mean overlap percentage for dynamic programming was 0.69, for the other two methods 0.60 and 0.59, respectively. The difference in overlap percentage was statistically significant. To study the influence of the segmentation method on the performance of a CAD system two additional experiments were carried out. The first experiment studied the detection performance of the CAD system for the different segmentation methods. Free-response receiver operating characteristics analysis showed that the detection performance was nearly identical for the three segmentation methods. In the second experiment the ability of the classifier to discriminate between malignant and benign lesions was studied. For region based evaluation the area A z under the receiver operating characteristics curve was 0.74 for dynamic programming, 0.72 for the discrete contour model, and 0.67 for region growing. The difference in A z values obtained by the dynamic programming method and region growing was statistically significant. The differences between other methods were not significant

  10. Modelling of windmill induction generators in dynamic simulation programs

    DEFF Research Database (Denmark)

    Akhmatov, Vladislav; Knudsen, Hans

    1999-01-01

    with and without a model of the mechanical shaft. The reason for the discrepancies are explained, and it is shown that the phenomenon is due partly to the presence of DC offset currents in the induction machine stator, and partly to the mechanical shaft system of the wind turbine and the generator rotor......For AC networks with large amounts of induction generators-in case of e.g. windmills-the paper demonstrates a significant discrepancy in the simulated voltage recovery after faults in weak networks, when comparing result obtained with dynamic stability programs and transient programs, respectively....... It is shown that it is possible to include a transient model in dynamic stability programs and thus obtain correct results also in dynamic stability programs. A mechanical model of the shaft system has also been included in the generator model...

  11. Complex Dynamics on the Routes to Chaos in a Discrete Predator-Prey System with Crowley-Martin Type Functional Response

    Directory of Open Access Journals (Sweden)

    Huayong Zhang

    2018-01-01

    Full Text Available We present in this paper an investigation on a discrete predator-prey system with Crowley-Martin type functional response to know its complex dynamics on the routes to chaos which are induced by bifurcations. Via application of the center manifold theorem and bifurcation theorems, occurrence conditions for flip bifurcation and Neimark-Sacker bifurcation are determined, respectively. Numerical simulations are performed, on the one hand, verifying the theoretical results and, on the other hand, revealing new interesting dynamical behaviors of the discrete predator-prey system, including period-doubling cascades, period-2, period-3, period-4, period-5, period-6, period-7, period-8, period-9, period-11, period-13, period-15, period-16, period-20, period-22, period-24, period-30, and period-34 orbits, invariant cycles, chaotic attractors, sub-flip bifurcation, sub-(inverse Neimark-Sacker bifurcation, chaotic interior crisis, chaotic band, sudden disappearance of chaotic dynamics and abrupt emergence of chaos, and intermittent periodic behaviors. Moreover, three-dimensional bifurcation diagrams are utilized to study the transition between flip bifurcation and Neimark-Sacker bifurcation, and a critical case between the two bifurcations is found. This critical bifurcation case is a combination of flip bifurcation and Neimark-Sacker bifurcation, showing the nonlinear characteristics of both bifurcations.

  12. A Decision Tool that Combines Discrete Event Software Process Models with System Dynamics Pieces for Software Development Cost Estimation and Analysis

    Science.gov (United States)

    Mizell, Carolyn Barrett; Malone, Linda

    2007-01-01

    The development process for a large software development project is very complex and dependent on many variables that are dynamic and interrelated. Factors such as size, productivity and defect injection rates will have substantial impact on the project in terms of cost and schedule. These factors can be affected by the intricacies of the process itself as well as human behavior because the process is very labor intensive. The complex nature of the development process can be investigated with software development process models that utilize discrete event simulation to analyze the effects of process changes. The organizational environment and its effects on the workforce can be analyzed with system dynamics that utilizes continuous simulation. Each has unique strengths and the benefits of both types can be exploited by combining a system dynamics model and a discrete event process model. This paper will demonstrate how the two types of models can be combined to investigate the impacts of human resource interactions on productivity and ultimately on cost and schedule.

  13. Programming Cells for Dynamic Assembly of Inorganic Nano-Objects with Spatiotemporal Control.

    Science.gov (United States)

    Wang, Xinyu; Pu, Jiahua; An, Bolin; Li, Yingfeng; Shang, Yuequn; Ning, Zhijun; Liu, Yi; Ba, Fang; Zhang, Jiaming; Zhong, Chao

    2018-04-01

    Programming living cells to organize inorganic nano-objects (NOs) in a spatiotemporally precise fashion would advance new techniques for creating ordered ensembles of NOs and new bio-abiotic hybrid materials with emerging functionalities. Bacterial cells often grow in cellular communities called biofilms. Here, a strategy is reported for programming dynamic biofilm formation for the synchronized assembly of discrete NOs or hetero-nanostructures on diverse interfaces in a dynamic, scalable, and hierarchical fashion. By engineering Escherichia coli to sense blue light and respond by producing biofilm curli fibers, biofilm formation is spatially controlled and the patterned NOs' assembly is simultaneously achieved. Diverse and complex fluorescent quantum dot patterns with a minimum patterning resolution of 100 µm are demonstrated. By temporally controlling the sequential addition of NOs into the culture, multilayered heterostructured thin films are fabricated through autonomous layer-by-layer assembly. It is demonstrated that biologically dynamic self-assembly can be used to advance a new repertoire of nanotechnologies and materials with increasing complexity that would be otherwise challenging to produce. © 2018 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

  14. Program packages for dynamics systems analysis and design

    International Nuclear Information System (INIS)

    Athani, V.V.

    1976-01-01

    The development of computer program packages for dynamic system analysis and design are reported. The purpose of developing these program packages is to take the burden of writing computer programs off the mind of the system engineer and to enable him to concentrate on his main system analysis and design work. Towards this end, four standard computer program packages have been prepared : (1) TFANA - starting from system transfer function this program computes transient response, frequency response, root locus and stability by Routh Hurwitz criterion, (2) TFSYN - classical synthesis using algebraic method of Shipley, (3) MODANA - starting from state equations of the system this program computes solution of state equations, controllability, observability and stability, (4) OPTCON - This program obtains solutions of (i) linear regulator problem, (ii) servomechanism problems and (iii) problem of pole placement. The paper describes these program packages with the help of flowcharts and illustrates their use with the help of examples. (author)

  15. Discrete Lorentzian quantum gravity

    NARCIS (Netherlands)

    Loll, R.

    2000-01-01

    Just as for non-abelian gauge theories at strong coupling, discrete lattice methods are a natural tool in the study of non-perturbative quantum gravity. They have to reflect the fact that the geometric degrees of freedom are dynamical, and that therefore also the lattice theory must be formulated

  16. Macroscopic reality and the dynamical reduction program

    International Nuclear Information System (INIS)

    Ghirardi, G.C.

    1995-10-01

    With reference to recently proposed theoretical models accounting for reduction in terms of a unified dynamics governing all physical processes, we analyze the problem of working out a worldview accommodating our knowledge about natural phenomena. We stress the relevant conceptual differences between the considered models and standard quantum mechanics. In spite of the fact that both theories describe individual physical systems within a genuine Hilbert space framework, the nice features of spontaneous reduction theories drastically limit the class of states which are dynamically stable. This allows one to work out a description of the world in terms of a mass density function in ordinary configuration space. A topology based on this function and differing radically from the one characterizing the Hilbert space is introduced and in terms of it the idea of similarity of macroscopic situations is made precise. Finally it is shown how the formalism and the proposed interpretation yield a natural criterion for establishing the psychophysical parallelism. The conclusion is that, within the considered theoretical models and at the nonrelativistic level, one can satisfy all sensible requirements for a consistent, unified, and objective description of reality at the macroscopic level. (author). 16 refs

  17. Macroscopic reality and the dynamical reduction program

    Energy Technology Data Exchange (ETDEWEB)

    Ghirardi, G C

    1995-10-01

    With reference to recently proposed theoretical models accounting for reduction in terms of a unified dynamics governing all physical processes, we analyze the problem of working out a worldview accommodating our knowledge about natural phenomena. We stress the relevant conceptual differences between the considered models and standard quantum mechanics. In spite of the fact that both theories describe individual physical systems within a genuine Hilbert space framework, the nice features of spontaneous reduction theories drastically limit the class of states which are dynamically stable. This allows one to work out a description of the world in terms of a mass density function in ordinary configuration space. A topology based on this function and differing radically from the one characterizing the Hilbert space is introduced and in terms of it the idea of similarity of macroscopic situations is made precise. Finally it is shown how the formalism and the proposed interpretation yield a natural criterion for establishing the psychophysical parallelism. The conclusion is that, within the considered theoretical models and at the nonrelativistic level, one can satisfy all sensible requirements for a consistent, unified, and objective description of reality at the macroscopic level. (author). 16 refs.

  18. The application of dynamic programming in production planning

    Science.gov (United States)

    Wu, Run

    2017-05-01

    Nowadays, with the popularity of the computers, various industries and fields are widely applying computer information technology, which brings about huge demand for a variety of application software. In order to develop software meeting various needs with most economical cost and best quality, programmers must design efficient algorithms. A superior algorithm can not only soul up one thing, but also maximize the benefits and generate the smallest overhead. As one of the common algorithms, dynamic programming algorithms are used to solving problems with some sort of optimal properties. When solving problems with a large amount of sub-problems that needs repetitive calculations, the ordinary sub-recursive method requires to consume exponential time, and dynamic programming algorithm can reduce the time complexity of the algorithm to the polynomial level, according to which we can conclude that dynamic programming algorithm is a very efficient compared to other algorithms reducing the computational complexity and enriching the computational results. In this paper, we expound the concept, basic elements, properties, core, solving steps and difficulties of the dynamic programming algorithm besides, establish the dynamic programming model of the production planning problem.

  19. A Hybrid Dynamic Programming for Solving Fixed Cost Transportation with Discounted Mechanism

    Directory of Open Access Journals (Sweden)

    Farhad Ghassemi Tari

    2016-01-01

    Full Text Available The problem of allocating different types of vehicles for transporting a set of products from a manufacturer to its depots/cross docks, in an existing transportation network, to minimize the total transportation costs, is considered. The distribution network involves a heterogeneous fleet of vehicles, with a variable transportation cost and a fixed cost in which a discount mechanism is applied on the fixed part of the transportation costs. It is assumed that the number of available vehicles is limited for some types. A mathematical programming model in the form of the discrete nonlinear optimization model is proposed. A hybrid dynamic programming algorithm is developed for finding the optimal solution. To increase the computational efficiency of the solution algorithm, several concepts and routines, such as the imbedded state routine, surrogate constraint concept, and bounding schemes, are incorporated in the dynamic programming algorithm. A real world case problem is selected and solved by the proposed solution algorithm, and the optimal solution is obtained.

  20. Stochastic Dynamic Programming for Three-Echelon Inventory System of Limited Shelf Life Products

    Directory of Open Access Journals (Sweden)

    Galal Noha M.

    2016-01-01

    Full Text Available Coordination of inventory decisions within the supply chain is one of the major determinants of its competitiveness in the global market. Products with limited shelf life impose additional challenges in managing the inventory across the supply chain because of the additional wastage costs incurred in case of being stored beyond product’s useful life. This paper presents a stochastic dynamic programming model for inventory replenishment in a serial multi-echelon distribution supply chain. The model considers uncertain stationary discrete demand at the retailer and zero lead time. The objective is to minimize expected total costs across the supply chain echelons, while maintaining a preset service level. The results illustrate that a cost saving of around 17% is achievable due to coordinating inventory decisions across the supply chain.

  1. Are facial expressions of emotion produced by categorical affect programs or dynamically driven by appraisal?

    Science.gov (United States)

    Scherer, Klaus R; Ellgring, Heiner

    2007-02-01

    The different assumptions made by discrete and componential emotion theories about the nature of the facial expression of emotion and the underlying mechanisms are reviewed. Explicit and implicit predictions are derived from each model. It is argued that experimental expression-production paradigms rather than recognition studies are required to critically test these differential predictions. Data from a large-scale actor portrayal study are reported to demonstrate the utility of this approach. The frequencies with which 12 professional actors use major facial muscle actions individually and in combination to express 14 major emotions show little evidence for emotion-specific prototypical affect programs. Rather, the results encourage empirical investigation of componential emotion model predictions of dynamic configurations of appraisal-driven adaptive facial actions. (c) 2007 APA, all rights reserved.

  2. Policy Gradient Adaptive Dynamic Programming for Data-Based Optimal Control.

    Science.gov (United States)

    Luo, Biao; Liu, Derong; Wu, Huai-Ning; Wang, Ding; Lewis, Frank L

    2017-10-01

    The model-free optimal control problem of general discrete-time nonlinear systems is considered in this paper, and a data-based policy gradient adaptive dynamic programming (PGADP) algorithm is developed to design an adaptive optimal controller method. By using offline and online data rather than the mathematical system model, the PGADP algorithm improves control policy with a gradient descent scheme. The convergence of the PGADP algorithm is proved by demonstrating that the constructed Q -function sequence converges to the optimal Q -function. Based on the PGADP algorithm, the adaptive control method is developed with an actor-critic structure and the method of weighted residuals. Its convergence properties are analyzed, where the approximate Q -function converges to its optimum. Computer simulation results demonstrate the effectiveness of the PGADP-based adaptive control method.

  3. Approximate dynamic programming solving the curses of dimensionality

    CERN Document Server

    Powell, Warren B

    2007-01-01

    Warren B. Powell, PhD, is Professor of Operations Research and Financial Engineering at Princeton University, where he is founder and Director of CASTLE Laboratory, a research unit that works with industrial partners to test new ideas found in operations research. The recipient of the 2004 INFORMS Fellow Award, Dr. Powell has authored over 100 refereed publications on stochastic optimization, approximate dynamic programming, and dynamic resource management.

  4. Dynamic electricity pricing—Which programs do consumers prefer?

    International Nuclear Information System (INIS)

    Dütschke, Elisabeth; Paetz, Alexandra-Gwyn

    2013-01-01

    Dynamic pricing is being discussed as one method of demand side management (DSM) which could be crucial for integrating more renewable energy sources into the electricity system. At the same time, there have been very few analyses of consumer preferences in this regard: Which type of pricing program are consumers most likely to choose and why? This paper sheds some light on these issues based on two empirical studies from Germany: (1) A questionnaire study including a conjoint analysis-design and (2) A field experiment with test-residents of a smart home laboratory. The results show that consumers are open to dynamic pricing, but prefer simple programs to complex and highly dynamic ones; smart home technologies including demand automation are seen as a prerequisite for DSM. The study provides some indications that consumers might be more willing to accept more dynamic pricing programs if they have the chance to experience in practice how these can be managed in everyday life. At the same time, the individual and societal advantages of such programs are not obvious to consumers. For this reason, any market roll-out will need to be accompanied by convincing communication and information campaigns to ensure that these advantages are perceived. - Highlights: • Little is known about consumer preferences on dynamic pricing. • Two studies are conducted to analyze this topic. • A survey shows that consumers without experience prefer conventional programs. • Test residents of a smart home were more open to dynamic pricing. • They also prefer well-structured programs

  5. Step by step parallel programming method for molecular dynamics code

    International Nuclear Information System (INIS)

    Orii, Shigeo; Ohta, Toshio

    1996-07-01

    Parallel programming for a numerical simulation program of molecular dynamics is carried out with a step-by-step programming technique using the two phase method. As a result, within the range of a certain computing parameters, it is found to obtain parallel performance by using the level of parallel programming which decomposes the calculation according to indices of do-loops into each processor on the vector parallel computer VPP500 and the scalar parallel computer Paragon. It is also found that VPP500 shows parallel performance in wider range computing parameters. The reason is that the time cost of the program parts, which can not be reduced by the do-loop level of the parallel programming, can be reduced to the negligible level by the vectorization. After that, the time consuming parts of the program are concentrated on less parts that can be accelerated by the do-loop level of the parallel programming. This report shows the step-by-step parallel programming method and the parallel performance of the molecular dynamics code on VPP500 and Paragon. (author)

  6. A three dimensional discrete dislocation dynamics modelling of the early cycles of fatigue in an austenitic stainless steel 316L: dislocation microstructure and damage analysis

    International Nuclear Information System (INIS)

    Depres, Ch.

    2005-01-01

    A numerical code modelling the collective behaviour of dislocations at a mesoscopic scale (Discrete Dislocation Dynamics code) is used to analyse the cyclic plasticity that occurs in surface grains of an AISI 316L stainless steel, in order to understand the plastic mechanism involved in crack initiation in fatigue. Firstly, the analyses of both the formation and the evolution of the dislocation microstructures show the crucial role of cross-slip played in the strain localization in the form of slip bands. As the cycling proceeds, the slip bands exhibit well-organized dislocation arrangements that substitute to dislocation tangles, involving specific interaction mechanisms between primary and deviate systems. Secondly, both the surface displacements generated by plastic slip and the distortion energy induced by the dislocation microstructure have been analysed. We find that an irreversible surface relief in the form of extrusion/intrusion can be induced by cyclic slip of dislocations. The number of cycles for the crack initiation follows a Manson-Coffin type law. The analyses of the concentration of the distortion energy and its repartition in the slip bands show that beneficial energetic zones may be present at the very beginning of the cycling, and that mode-II crack propagation in the surface grains results from a succession of micro-crack initiations along primary slip plane, which is facilitated by various effects (stress concentration due to surface relief, environment effects...). Finally, a dislocation-based model for cyclic plasticity is proposed from Discrete Dislocation Dynamics results. (author)

  7. Training New Instructors to Implement Discrete Trial Teaching Strategies with Children with Autism in a Community-Based Intervention Program

    Science.gov (United States)

    Downs, Andrew; Downs, Robyn Conley

    2013-01-01

    The effects of training and supervision on instructor knowledge and performance of discrete trial teaching (DTT) within three domains (DTT Technical Skills; Work Session Preparation/Conclusion; and Student Engagement/Management) were examined in this study. Eight undergraduate student instructors received an 8-[hour] training in DTT and support…

  8. Fast and Cache-Oblivious Dynamic Programming with Local Dependencies

    DEFF Research Database (Denmark)

    Bille, Philip; Stöckel, Morten

    2012-01-01

    are widely used in bioinformatics to compare DNA and protein sequences. These problems can all be solved using essentially the same dynamic programming scheme over a two-dimensional matrix, where each entry depends locally on at most 3 neighboring entries. We present a simple, fast, and cache......-oblivious algorithm for this type of local dynamic programming suitable for comparing large-scale strings. Our algorithm outperforms the previous state-of-the-art solutions. Surprisingly, our new simple algorithm is competitive with a complicated, optimized, and tuned implementation of the best cache-aware algorithm...

  9. A short note on dynamic programming in a band.

    Science.gov (United States)

    Gibrat, Jean-François

    2018-06-15

    Third generation sequencing technologies generate long reads that exhibit high error rates, in particular for insertions and deletions which are usually the most difficult errors to cope with. The only exact algorithm capable of aligning sequences with insertions and deletions is a dynamic programming algorithm. In this note, for the sake of efficiency, we consider dynamic programming in a band. We show how to choose the band width in function of the long reads' error rates, thus obtaining an [Formula: see text] algorithm in space and time. We also propose a procedure to decide whether this algorithm, when applied to semi-global alignments, provides the optimal score. We suggest that dynamic programming in a band is well suited to the problem of aligning long reads between themselves and can be used as a core component of methods for obtaining a consensus sequence from the long reads alone. The function implementing the dynamic programming algorithm in a band is available, as a standalone program, at: https://forgemia.inra.fr/jean-francois.gibrat/BAND_DYN_PROG.git.

  10. Discrete mechanics

    CERN Document Server

    Caltagirone, Jean-Paul

    2014-01-01

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

  11. Discrete mechanics

    International Nuclear Information System (INIS)

    Lee, T.D.

    1985-01-01

    This paper reviews the role of time throughout all phases of mechanics: classical mechanics, non-relativistic quantum mechanics, and relativistic quantum theory. As an example of the relativistic quantum field theory, the case of a massless scalar field interacting with an arbitrary external current is discussed. The comparison between the new discrete theory and the usual continuum formalism is presented. An example is given of a two-dimensional random lattice and its duel. The author notes that there is no evidence that the discrete mechanics is more appropriate than the usual continuum mechanics

  12. A Dynamic Programming Algorithm for the k-Haplotyping Problem

    Institute of Scientific and Technical Information of China (English)

    Zhen-ping Li; Ling-yun Wu; Yu-ying Zhao; Xiang-sun Zhang

    2006-01-01

    The Minimum Fragments Removal (MFR) problem is one of the haplotyping problems: given a set of fragments, remove the minimum number of fragments so that the resulting fragments can be partitioned into k classes of non-conflicting subsets. In this paper, we formulate the k-MFR problem as an integer linear programming problem, and develop a dynamic programming approach to solve the k-MFR problem for both the gapless and gap cases.

  13. Effect of the CTL proliferation program on virus dynamics

    DEFF Research Database (Denmark)

    Wodarz, Dominik; Thomsen, Allan Randrup

    2005-01-01

    Experiments have established that CTLs do not require continuous antigenic stimulation for expansion. Instead, responses develop by a process of programmed proliferation which involves approximately 7-10 antigen-independent cell divisions, the generation of effector cells and the differentiation...... virus loads and thus acute symptoms. The reason is that the programmed divisions are independent from antigenic stimulation, and an increase in virus load does not speed up the rate of CTL expansion. We hypothesize that the 7-10 programmed divisions observed in vivo represent an optimal solution...... into memory cells. The effect of this program on the infection dynamics and the advantages gained by the program have, however, not been explored yet. We investigate this with mathematical models. We find that more programmed divisions can make virus clearance more efficient because CTL division continues...

  14. A note on dynamic programming in accounts receivable management

    NARCIS (Netherlands)

    Dirickx, Y.M.I.; Kistner, K.-P.

    1982-01-01

    The paper considers a dynamic programming formulation of the accounts receivable problem for single outstanding amounts. An optimal collection policy can be computed efficiently by invoking a “planning horizon” result that determines a time period beyond which the decision process cannot extend. The

  15. PACE: A dynamic programming algorithm for hardware/software partitioning

    DEFF Research Database (Denmark)

    Knudsen, Peter Voigt; Madsen, Jan

    1996-01-01

    This paper presents the PACE partitioning algorithm which is used in the LYCOS co-synthesis system for partitioning control/dataflow graphs into hardware and software parts. The algorithm is a dynamic programming algorithm which solves both the problem of minimizing system execution time...

  16. Dynamic Programming Approach for Exact Decision Rule Optimization

    KAUST Repository

    Amin, Talha

    2013-01-01

    This chapter is devoted to the study of an extension of dynamic programming approach that allows sequential optimization of exact decision rules relative to the length and coverage. It contains also results of experiments with decision tables from UCI Machine Learning Repository. © Springer-Verlag Berlin Heidelberg 2013.

  17. Dynamic Frames Based Verification Method for Concurrent Java Programs

    NARCIS (Netherlands)

    Mostowski, Wojciech

    2016-01-01

    In this paper we discuss a verification method for concurrent Java programs based on the concept of dynamic frames. We build on our earlier work that proposes a new, symbolic permission system for concurrent reasoning and we provide the following new contributions. First, we describe our approach

  18. Optimum workforce-size model using dynamic programming approach

    African Journals Online (AJOL)

    This paper presents an optimum workforce-size model which determines the minimum number of excess workers (overstaffing) as well as the minimum total recruitment cost during a specified planning horizon. The model is an extension of other existing dynamic programming models for manpower planning in the sense ...

  19. The Functional Programming Language R and the Paradigm of Dynamic Scientific Programming

    NARCIS (Netherlands)

    Trancón y Widemann, B.; Bolz, C.F.; Grelck, C.; Loidl, H.-W.; Peña, R.

    2013-01-01

    R is an environment and functional programming language for statistical data analysis and visualization. Largely unknown to the functional programming community, it is popular and influential in many empirical sciences. Due to its integrated combination of dynamic and reflective scripting on one

  20. Discrete-State Stochastic Models of Calcium-Regulated Calcium Influx and Subspace Dynamics Are Not Well-Approximated by ODEs That Neglect Concentration Fluctuations

    Science.gov (United States)

    Weinberg, Seth H.; Smith, Gregory D.

    2012-01-01

    Cardiac myocyte calcium signaling is often modeled using deterministic ordinary differential equations (ODEs) and mass-action kinetics. However, spatially restricted “domains” associated with calcium influx are small enough (e.g., 10−17 liters) that local signaling may involve 1–100 calcium ions. Is it appropriate to model the dynamics of subspace calcium using deterministic ODEs or, alternatively, do we require stochastic descriptions that account for the fundamentally discrete nature of these local calcium signals? To address this question, we constructed a minimal Markov model of a calcium-regulated calcium channel and associated subspace. We compared the expected value of fluctuating subspace calcium concentration (a result that accounts for the small subspace volume) with the corresponding deterministic model (an approximation that assumes large system size). When subspace calcium did not regulate calcium influx, the deterministic and stochastic descriptions agreed. However, when calcium binding altered channel activity in the model, the continuous deterministic description often deviated significantly from the discrete stochastic model, unless the subspace volume is unrealistically large and/or the kinetics of the calcium binding are sufficiently fast. This principle was also demonstrated using a physiologically realistic model of calmodulin regulation of L-type calcium channels introduced by Yue and coworkers. PMID:23509597

  1. Observability of discretized partial differential equations

    Science.gov (United States)

    Cohn, Stephen E.; Dee, Dick P.

    1988-01-01

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

  2. Optimal Operation of Radial Distribution Systems Using Extended Dynamic Programming

    DEFF Research Database (Denmark)

    Lopez, Juan Camilo; Vergara, Pedro P.; Lyra, Christiano

    2018-01-01

    An extended dynamic programming (EDP) approach is developed to optimize the ac steady-state operation of radial electrical distribution systems (EDS). Based on the optimality principle of the recursive Hamilton-Jacobi-Bellman equations, the proposed EDP approach determines the optimal operation o...... approach is illustrated using real-scale systems and comparisons with commercial programming solvers. Finally, generalizations to consider other EDS operation problems are also discussed.......An extended dynamic programming (EDP) approach is developed to optimize the ac steady-state operation of radial electrical distribution systems (EDS). Based on the optimality principle of the recursive Hamilton-Jacobi-Bellman equations, the proposed EDP approach determines the optimal operation...... of the EDS by setting the values of the controllable variables at each time period. A suitable definition for the stages of the problem makes it possible to represent the optimal ac power flow of radial EDS as a dynamic programming problem, wherein the 'curse of dimensionality' is a minor concern, since...

  3. Discrete Routh reduction

    International Nuclear Information System (INIS)

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

    2006-01-01

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

  4. Defect induced intermittency in the transit time dynamics generates 1/f noise in a trimer described by the discrete nonlinear Schroedinger equation

    International Nuclear Information System (INIS)

    Pando L, C.L.; Doedel, E.J.

    2006-08-01

    We investigate the nonlinear dynamics in a trimer, described by the one-dimensional discrete nonlinear Schrodinger equation (DNLSE), with periodic boundary conditions in the presence of a single on-site defect. We make use of numerical continuation to study different families of stationary and periodic solutions, which allows us to consider suitable perturbations. Taking into account a Poincare section, we are able to study the dynamics in both a thin stochastic layer solution and a global stochasticity solution. We find that the time series of the transit times, the time intervals to traverse some suitable sets in phase space, generate 1/f noise for both stochastic solutions. In the case of the thin stochastic layer solution, we find that transport between two almost invariant sets along with intermittency in small and large time scales are relevant features of the dynamics. These results are reflected in the behaviour of the standard map with suitable parameters. In both chaotic solutions, the distribution of transit times has a maximum and a tail with exponential decay in spite of the presence of long-range correlations in the time series. We motivate our study by considering a ring of weakly-coupled Bose-Einstein condensates (BEC) with attractive interactions, where inversion of populations between two spatially symmetric sites and phase locking take place in both chaotic solutions. (author)

  5. A discrete electromechanical model for human cardiac tissue: effects of stretch-activated currents and stretch conditions on restitution properties and spiral wave dynamics.

    Science.gov (United States)

    Weise, Louis D; Panfilov, Alexander V

    2013-01-01

    We introduce an electromechanical model for human cardiac tissue which couples a biophysical model of cardiac excitation (Tusscher, Noble, Noble, Panfilov, 2006) and tension development (adjusted Niederer, Hunter, Smith, 2006 model) with a discrete elastic mass-lattice model. The equations for the excitation processes are solved with a finite difference approach, and the equations of the mass-lattice model are solved using Verlet integration. This allows the coupled problem to be solved with high numerical resolution. Passive mechanical properties of the mass-lattice model are described by a generalized Hooke's law for finite deformations (Seth material). Active mechanical contraction is initiated by changes of the intracellular calcium concentration, which is a variable of the electrical model. Mechanical deformation feeds back on the electrophysiology via stretch-activated ion channels whose conductivity is controlled by the local stretch of the medium. We apply the model to study how stretch-activated currents affect the action potential shape, restitution properties, and dynamics of spiral waves, under constant stretch, and dynamic stretch caused by active mechanical contraction. We find that stretch conditions substantially affect these properties via stretch-activated currents. In constantly stretched medium, we observe a substantial decrease in conduction velocity, and an increase of action potential duration; whereas, with dynamic stretch, action potential duration is increased only slightly, and the conduction velocity restitution curve becomes biphasic. Moreover, in constantly stretched medium, we find an increase of the core size and period of a spiral wave, but no change in rotation dynamics; in contrast, in the dynamically stretching medium, we observe spiral drift. Our results may be important to understand how altered stretch conditions affect the heart's functioning.

  6. A discrete electromechanical model for human cardiac tissue: effects of stretch-activated currents and stretch conditions on restitution properties and spiral wave dynamics.

    Directory of Open Access Journals (Sweden)

    Louis D Weise

    Full Text Available We introduce an electromechanical model for human cardiac tissue which couples a biophysical model of cardiac excitation (Tusscher, Noble, Noble, Panfilov, 2006 and tension development (adjusted Niederer, Hunter, Smith, 2006 model with a discrete elastic mass-lattice model. The equations for the excitation processes are solved with a finite difference approach, and the equations of the mass-lattice model are solved using Verlet integration. This allows the coupled problem to be solved with high numerical resolution. Passive mechanical properties of the mass-lattice model are described by a generalized Hooke's law for finite deformations (Seth material. Active mechanical contraction is initiated by changes of the intracellular calcium concentration, which is a variable of the electrical model. Mechanical deformation feeds back on the electrophysiology via stretch-activated ion channels whose conductivity is controlled by the local stretch of the medium. We apply the model to study how stretch-activated currents affect the action potential shape, restitution properties, and dynamics of spiral waves, under constant stretch, and dynamic stretch caused by active mechanical contraction. We find that stretch conditions substantially affect these properties via stretch-activated currents. In constantly stretched medium, we observe a substantial decrease in conduction velocity, and an increase of action potential duration; whereas, with dynamic stretch, action potential duration is increased only slightly, and the conduction velocity restitution curve becomes biphasic. Moreover, in constantly stretched medium, we find an increase of the core size and period of a spiral wave, but no change in rotation dynamics; in contrast, in the dynamically stretching medium, we observe spiral drift. Our results may be important to understand how altered stretch conditions affect the heart's functioning.

  7. The formulation of dynamical contact problems with friction in the case of systems of rigid bodies and general discrete mechanical systems—Painlevé and Kane paradoxes revisited

    Science.gov (United States)

    Charles, Alexandre; Ballard, Patrick

    2016-08-01

    The dynamics of mechanical systems with a finite number of degrees of freedom (discrete mechanical systems) is governed by the Lagrange equation which is a second-order differential equation on a Riemannian manifold (the configuration manifold). The handling of perfect (frictionless) unilateral constraints in this framework (that of Lagrange's analytical dynamics) was undertaken by Schatzman and Moreau at the beginning of the 1980s. A mathematically sound and consistent evolution problem was obtained, paving the road for many subsequent theoretical investigations. In this general evolution problem, the only reaction force which is involved is a generalized reaction force, consistently with the virtual power philosophy of Lagrange. Surprisingly, such a general formulation was never derived in the case of frictional unilateral multibody dynamics. Instead, the paradigm of the Coulomb law applying to reaction forces in the real world is generally invoked. So far, this paradigm has only enabled to obtain a consistent evolution problem in only some very few specific examples and to suggest numerical algorithms to produce computational examples (numerical modeling). In particular, it is not clear what is the evolution problem underlying the computational examples. Moreover, some of the few specific cases in which this paradigm enables to write down a precise evolution problem are known to show paradoxes: the Painlevé paradox (indeterminacy) and the Kane paradox (increase in kinetic energy due to friction). In this paper, we follow Lagrange's philosophy and formulate the frictional unilateral multibody dynamics in terms of the generalized reaction force and not in terms of the real-world reaction force. A general evolution problem that governs the dynamics is obtained for the first time. We prove that all the solutions are dissipative; that is, this new formulation is free of Kane paradox. We also prove that some indeterminacy of the Painlevé paradox is fixed in this

  8. Synthesizing Dynamic Programming Algorithms from Linear Temporal Logic Formulae

    Science.gov (United States)

    Rosu, Grigore; Havelund, Klaus

    2001-01-01

    The problem of testing a linear temporal logic (LTL) formula on a finite execution trace of events, generated by an executing program, occurs naturally in runtime analysis of software. We present an algorithm which takes an LTL formula and generates an efficient dynamic programming algorithm. The generated algorithm tests whether the LTL formula is satisfied by a finite trace of events given as input. The generated algorithm runs in linear time, its constant depending on the size of the LTL formula. The memory needed is constant, also depending on the size of the formula.

  9. GLOBEC (Global Ocean Ecosystems Dynamics: Northwest Atlantic program

    Science.gov (United States)

    1991-01-01

    The specific objective of the meeting was to plan an experiment in the Northwestern Atlantic to study the marine ecosystem and its role, together with that of climate and physical dynamics, in determining fisheries recruitment. The underlying focus of the GLOBEC initiative is to understand the marine ecosystem as it related to marine living resources and to understand how fluctuation in these resources are driven by climate change and exploitation. In this sense the goal is a solid scientific program to provide basic information concerning major fisheries stocks and the environment that sustains them. The plan is to attempt to reach this understanding through a multidisciplinary program that brings to bear new techniques as disparate as numerical fluid dynamic models of ocean circulation, molecular biology and modern acoustic imaging. The effort will also make use of the massive historical data sets on fisheries and the state of the climate in a coordinated manner.

  10. Adaptive Dynamic Programming for Control Algorithms and Stability

    CERN Document Server

    Zhang, Huaguang; Luo, Yanhong; Wang, Ding

    2013-01-01

    There are many methods of stable controller design for nonlinear systems. In seeking to go beyond the minimum requirement of stability, Adaptive Dynamic Programming for Control approaches the challenging topic of optimal control for nonlinear systems using the tools of  adaptive dynamic programming (ADP). The range of systems treated is extensive; affine, switched, singularly perturbed and time-delay nonlinear systems are discussed as are the uses of neural networks and techniques of value and policy iteration. The text features three main aspects of ADP in which the methods proposed for stabilization and for tracking and games benefit from the incorporation of optimal control methods: • infinite-horizon control for which the difficulty of solving partial differential Hamilton–Jacobi–Bellman equations directly is overcome, and  proof provided that the iterative value function updating sequence converges to the infimum of all the value functions obtained by admissible control law sequences; • finite-...

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

  12. Using discrete-time mathematical programming to optimise the extraction rate of a durable non-renewable resource with a single primary supplier

    Directory of Open Access Journals (Sweden)

    Albert Corominas

    Full Text Available A non-linear discrete-time mathematical program model is proposed to determining the optimal extraction policy for a single primary supplier of a durable non-renewable resource, such as gemstones or some metals. Karush, Kuhn and Tucker conditions allow obtaining analytic solutions and general properties of them in some specific settings. Moreover, provided that the objective function (i.e., the discounted value of the incomes throughout the planning horizon is concave, the model can be easily solved, even using standard commercial solver. However, the analysis of the solutions obtained for different assumptions of the values of the parameters show that the optimal extraction policies and the corresponding prices do not exhibit a general shape. Keywords: Durable non-renewable resources, Single primary supplier, Non-linear programming

  13. Optimization of a pump-pipe system by dynamic programming

    DEFF Research Database (Denmark)

    Vidal, Rene Victor Valqui; Ferreira, Jose S.

    1984-01-01

    In this paper the problem of minimizing the total cost of a pump-pipe system in series is considered. The route of the pipeline and the number of pumping stations are known. The optimization will then consist in determining the control variables, diameter and thickness of the pipe and the size of...... of the pumps. A general mathematical model is formulated and Dynamic Programming is used to find an optimal solution....

  14. Systems and methods for interpolation-based dynamic programming

    KAUST Repository

    Rockwood, Alyn

    2013-01-03

    Embodiments of systems and methods for interpolation-based dynamic programming. In one embodiment, the method includes receiving an object function and a set of constraints associated with the objective function. The method may also include identifying a solution on the objective function corresponding to intersections of the constraints. Additionally, the method may include generating an interpolated surface that is in constant contact with the solution. The method may also include generating a vector field in response to the interpolated surface.

  15. Dynamic Programming Approach for Construction of Association Rule Systems

    KAUST Repository

    Alsolami, Fawaz

    2016-11-18

    In the paper, an application of dynamic programming approach for optimization of association rules from the point of view of knowledge representation is considered. The association rule set is optimized in two stages, first for minimum cardinality and then for minimum length of rules. Experimental results present cardinality of the set of association rules constructed for information system and lower bound on minimum possible cardinality of rule set based on the information obtained during algorithm work as well as obtained results for length.

  16. Systems and methods for interpolation-based dynamic programming

    KAUST Repository

    Rockwood, Alyn

    2013-01-01

    Embodiments of systems and methods for interpolation-based dynamic programming. In one embodiment, the method includes receiving an object function and a set of constraints associated with the objective function. The method may also include identifying a solution on the objective function corresponding to intersections of the constraints. Additionally, the method may include generating an interpolated surface that is in constant contact with the solution. The method may also include generating a vector field in response to the interpolated surface.

  17. DYNAMIC PROGRAMMING – EFFICIENT TOOL FOR POWER SYSTEM EXPANSION PLANNING

    Directory of Open Access Journals (Sweden)

    SIMO A.

    2015-03-01

    Full Text Available The paper isfocusing on dynamic programming use for power system expansion planning (EP – transmission network (TNEP and distribution network (DNEP. The EP problem has been approached from the retrospective and prospective point of view. To achieve this goal, the authors are developing two software-tools in Matlab environment. Two techniques have been tackled: particle swarm optimization (PSO and genetic algorithms (GA. The case study refers to Test 25 buses test power system developed within the Power Systems Department.

  18. Dynamic Programming Approach for Construction of Association Rule Systems

    KAUST Repository

    Alsolami, Fawaz; Amin, Talha M.; Chikalov, Igor; Moshkov, Mikhail; Zielosko, Beata

    2016-01-01

    In the paper, an application of dynamic programming approach for optimization of association rules from the point of view of knowledge representation is considered. The association rule set is optimized in two stages, first for minimum cardinality and then for minimum length of rules. Experimental results present cardinality of the set of association rules constructed for information system and lower bound on minimum possible cardinality of rule set based on the information obtained during algorithm work as well as obtained results for length.

  19. An Approximate Dynamic Programming Mode for Optimal MEDEVAC Dispatching

    Science.gov (United States)

    2015-03-26

    over the myopic policy. This indicates the ADP policy is efficiently managing resources by 28 not immediately sending the nearest available MEDEVAC...DISPATCHING THESIS Presented to the Faculty Department of Operational Sciences Graduate School of Engineering and Management Air Force Institute of Technology...medical evacuation (MEDEVAC) dispatch policies. To solve the MDP, we apply an ap- proximate dynamic programming (ADP) technique. The problem of deciding

  20. Approximate Dynamic Programming Based on High Dimensional Model Representation

    Czech Academy of Sciences Publication Activity Database

    Pištěk, Miroslav

    2013-01-01

    Roč. 49, č. 5 (2013), s. 720-737 ISSN 0023-5954 R&D Projects: GA ČR(CZ) GAP102/11/0437 Institutional support: RVO:67985556 Keywords : approximate dynamic programming * Bellman equation * approximate HDMR minimization * trust region problem Subject RIV: BC - Control Systems Theory Impact factor: 0.563, year: 2013 http://library.utia.cas.cz/separaty/2013/AS/pistek-0399560.pdf

  1. Boolean network identification from perturbation time series data combining dynamics abstraction and logic programming.

    Science.gov (United States)

    Ostrowski, M; Paulevé, L; Schaub, T; Siegel, A; Guziolowski, C

    2016-11-01

    Boolean networks (and more general logic models) are useful frameworks to study signal transduction across multiple pathways. Logic models can be learned from a prior knowledge network structure and multiplex phosphoproteomics data. However, most efficient and scalable training methods focus on the comparison of two time-points and assume that the system has reached an early steady state. In this paper, we generalize such a learning procedure to take into account the time series traces of phosphoproteomics data in order to discriminate Boolean networks according to their transient dynamics. To that end, we identify a necessary condition that must be satisfied by the dynamics of a Boolean network to be consistent with a discretized time series trace. Based on this condition, we use Answer Set Programming to compute an over-approximation of the set of Boolean networks which fit best with experimental data and provide the corresponding encodings. Combined with model-checking approaches, we end up with a global learning algorithm. Our approach is able to learn logic models with a true positive rate higher than 78% in two case studies of mammalian signaling networks; for a larger case study, our method provides optimal answers after 7min of computation. We quantified the gain in our method predictions precision compared to learning approaches based on static data. Finally, as an application, our method proposes erroneous time-points in the time series data with respect to the optimal learned logic models. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

  2. An algorithm for the solution of dynamic linear programs

    Science.gov (United States)

    Psiaki, Mark L.

    1989-01-01

    The algorithm's objective is to efficiently solve Dynamic Linear Programs (DLP) by taking advantage of their special staircase structure. This algorithm constitutes a stepping stone to an improved algorithm for solving Dynamic Quadratic Programs, which, in turn, would make the nonlinear programming method of Successive Quadratic Programs more practical for solving trajectory optimization problems. The ultimate goal is to being trajectory optimization solution speeds into the realm of real-time control. The algorithm exploits the staircase nature of the large constraint matrix of the equality-constrained DLPs encountered when solving inequality-constrained DLPs by an active set approach. A numerically-stable, staircase QL factorization of the staircase constraint matrix is carried out starting from its last rows and columns. The resulting recursion is like the time-varying Riccati equation from multi-stage LQR theory. The resulting factorization increases the efficiency of all of the typical LP solution operations over that of a dense matrix LP code. At the same time numerical stability is ensured. The algorithm also takes advantage of dynamic programming ideas about the cost-to-go by relaxing active pseudo constraints in a backwards sweeping process. This further decreases the cost per update of the LP rank-1 updating procedure, although it may result in more changes of the active set that if pseudo constraints were relaxed in a non-stagewise fashion. The usual stability of closed-loop Linear/Quadratic optimally-controlled systems, if it carries over to strictly linear cost functions, implies that the saving due to reduced factor update effort may outweigh the cost of an increased number of updates. An aerospace example is presented in which a ground-to-ground rocket's distance is maximized. This example demonstrates the applicability of this class of algorithms to aerospace guidance. It also sheds light on the efficacy of the proposed pseudo constraint relaxation

  3. Perfect discretization of path integrals

    International Nuclear Information System (INIS)

    Steinhaus, Sebastian

    2012-01-01

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

  4. Perfect discretization of path integrals

    Science.gov (United States)

    Steinhaus, Sebastian

    2012-05-01

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

  5. A dynamic programming approach to missing data estimation using neural networks

    CSIR Research Space (South Africa)

    Nelwamondo, FV

    2013-01-01

    Full Text Available method where dynamic programming is not used. This paper also suggests a different way of formulating a missing data problem such that the dynamic programming is applicable to estimate the missing data....

  6. Programming Unconventional Computers: Dynamics, Development, Self-Reference

    Directory of Open Access Journals (Sweden)

    Susan Stepney

    2012-10-01

    Full Text Available Classical computing has well-established formalisms for specifying, refining, composing, proving, and otherwise reasoning about computations. These formalisms have matured over the past 70 years or so. Unconventional Computing includes the use of novel kinds of substrates–from black holes and quantum effects, through to chemicals, biomolecules, even slime moulds–to perform computations that do not conform to the classical model. Although many of these unconventional substrates can be coerced into performing classical computation, this is not how they “naturally” compute. Our ability to exploit unconventional computing is partly hampered by a lack of corresponding programming formalisms: we need models for building, composing, and reasoning about programs that execute in these substrates. What might, say, a slime mould programming language look like? Here I outline some of the issues and properties of these unconventional substrates that need to be addressed to find “natural” approaches to programming them. Important concepts include embodied real values, processes and dynamical systems, generative systems and their meta-dynamics, and embodied self-reference.

  7. Perfect discretization of path integrals

    OpenAIRE

    Steinhaus, Sebastian

    2011-01-01

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

  8. Steady states and outbreaks of two-phase nonlinear age-structured model of population dynamics with discrete time delay.

    Science.gov (United States)

    Akimenko, Vitalii; Anguelov, Roumen

    2017-12-01

    In this paper we study the nonlinear age-structured model of a polycyclic two-phase population dynamics including delayed effect of population density growth on the mortality. Both phases are modelled as a system of initial boundary values problem for semi-linear transport equation with delay and initial problem for nonlinear delay ODE. The obtained system is studied both theoretically and numerically. Three different regimes of population dynamics for asymptotically stable states of autonomous systems are obtained in numerical experiments for the different initial values of population density. The quasi-periodical travelling wave solutions are studied numerically for the autonomous system with the different values of time delays and for the system with oscillating death rate and birth modulus. In both cases it is observed three types of travelling wave solutions: harmonic oscillations, pulse sequence and single pulse.

  9. Discrete gradients in discrete classical mechanics

    International Nuclear Information System (INIS)

    Renna, L.

    1987-01-01

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

  10. A program for dynamic noise investigations of reactor systems

    International Nuclear Information System (INIS)

    Antonov, N.A.; Yaneva, N.B.

    1980-01-01

    A stochastic process analysis in nuclear reactors is used for the state diagnosis and dynamic characteristic investigation of the reactor system. A program DENSITY adapted and tested on an IBM 360 ES type computer is developed. The program is adjusted for fast processing of long series exploiting a relatively small memory. The testing procedure is discussed and the method of the periodic sequences corresponding to characteristic reactivity perturbations of the reactor systems is considered. The program is written for calculating the auto-power spectral density and the cross-power spectral density, as well as the coherence function of stationary statistical time series using the advantages of the fast Fourier transformation. In particular, it is shown that the multi-frequency binary sequences are very useful with respect to the signal-to-noise ratio and the frequency distribution in view of the frequency reactor test

  11. Optimal use of data in parallel tempering simulations for the construction of discrete-state Markov models of biomolecular dynamics.

    Science.gov (United States)

    Prinz, Jan-Hendrik; Chodera, John D; Pande, Vijay S; Swope, William C; Smith, Jeremy C; Noé, Frank

    2011-06-28

    Parallel tempering (PT) molecular dynamics simulations have been extensively investigated as a means of efficient sampling of the configurations of biomolecular systems. Recent work has demonstrated how the short physical trajectories generated in PT simulations of biomolecules can be used to construct the Markov models describing biomolecular dynamics at each simulated temperature. While this approach describes the temperature-dependent kinetics, it does not make optimal use of all available PT data, instead estimating the rates at a given temperature using only data from that temperature. This can be problematic, as some relevant transitions or states may not be sufficiently sampled at the temperature of interest, but might be readily sampled at nearby temperatures. Further, the comparison of temperature-dependent properties can suffer from the false assumption that data collected from different temperatures are uncorrelated. We propose here a strategy in which, by a simple modification of the PT protocol, the harvested trajectories can be reweighted, permitting data from all temperatures to contribute to the estimated kinetic model. The method reduces the statistical uncertainty in the kinetic model relative to the single temperature approach and provides estimates of transition probabilities even for transitions not observed at the temperature of interest. Further, the method allows the kinetics to be estimated at temperatures other than those at which simulations were run. We illustrate this method by applying it to the generation of a Markov model of the conformational dynamics of the solvated terminally blocked alanine peptide.

  12. 77 FR 19408 - Dynamic Mobility Applications and Data Capture Management Programs; Notice of Public Meeting

    Science.gov (United States)

    2012-03-30

    ... DEPARTMENT OF TRANSPORTATION Dynamic Mobility Applications and Data Capture Management Programs... stakeholders an update on the Data Capture and Management (DCM) and Dynamic Mobility Applications (DMA... critical issues designed to garner stakeholder feedback. About the Dynamic Mobility Application and Data...

  13. Management Optimization of Saguling Reservoir with Bellman Dynamic Programming and “Du Couloir” Iterative Method

    Directory of Open Access Journals (Sweden)

    Mariana Marselina

    2016-08-01

    Full Text Available The increasingly growth of population and industry sector have lead to an enhanced demand for electrical energy. One of the electricity providers in the area of Java-Madura Bali (Jamali is Saguling Reservoir. Saguling Reservoir is one of the three reservoirs that stem the flow of Citarum River in advance of to Jatiluhur and Cirata Reservoir. The average electricity production of Saguling Reservoir was 2,334,318.138 MWh/year in the period of 1986-2014. The water intake of Saguling Reservoir is the upstream Citarum Watershed with an area of 2340.88 km2 which also serves as the irrigation, inland fisheries, recreation, and other activities. An effort to improve the function of Saguling Reservoir in producing electrical energy is by optimizing the reservoir management. The optimization of Saguling Reservoir management in this study refers to Government Regulation No. 37/2010 on Dam/Reservoir Article 44 which states that the system of reservoir management consisting of the operation system in dry years, normal years, and wet years. In this research, the determination of the trajectory guideline in Saguling operation was divided in dry, normal and wet years. Trajectory guideline was conducted based on the electricity price of turbine inflow that various in every month. The determination of the trajectory guideline in various electricity price was done by using Program Dynamic Bellman (PD Bellman and “Du Couloir” iterative method which the objective to optimize the gain from electricity production. and “Du Couloir” iterative method was development of PD Bellman that can calculate the value of gain with a smaller discretization until 0,1 juta m3 effectively where PD Bellman just calculate until 10 million m3.  Smaller discretization can give maximum benefit from electricity production and the trajectory guideline will be closer to trajectory actual so optimization of Saguling operation will be achieved.

  14. Discrete transforms

    CERN Document Server

    Firth, Jean M

    1992-01-01

    The analysis of signals and systems using transform methods is a very important aspect of the examination of processes and problems in an increasingly wide range of applications. Whereas the initial impetus in the development of methods appropriate for handling discrete sets of data occurred mainly in an electrical engineering context (for example in the design of digital filters), the same techniques are in use in such disciplines as cardiology, optics, speech analysis and management, as well as in other branches of science and engineering. This text is aimed at a readership whose mathematical background includes some acquaintance with complex numbers, linear differen­ tial equations, matrix algebra, and series. Specifically, a familiarity with Fourier series (in trigonometric and exponential forms) is assumed, and an exposure to the concept of a continuous integral transform is desirable. Such a background can be expected, for example, on completion of the first year of a science or engineering degree cour...

  15. Development and demonstration program for dynamic nuclear materials control

    International Nuclear Information System (INIS)

    Augustson, R.H.; Baron, N.; Ford, R.F.; Ford, W.; Hagen, J.; Li, T.K.; Marshall, R.S.; Reams, V.S.; Severe, W.R.; Shirk, D.G.

    1978-01-01

    A significant portion of the Los Alamos Scientific Laboratory Safeguards Program is directed toward the development and demonstration of dynamic nuclear materials control. The building chosen for the demonstration system is the new Plutonium Processing Facility in Los Alamos, which houses such operations as metal-to-oxide conversion, fuel pellet fabrication, and scrap recovery. A DYnamic MAterials Control (DYMAC) system is currently being installed in the facility as an integral part of the processing operation. DYMAC is structured around interlocking unit-process accounting areas. It relies heavily on nondestructive assay measurements made in the process line to draw dynamic material balances in near real time. In conjunction with the nondestructive assay instrumentation, process operators use interactive terminals to transmit additional accounting and process information to a dedicated computer. The computer verifies and organizes the incoming data, immediately updates the inventory records, monitors material in transit using elapsed time, and alerts the Nuclear Materials Officer in the event that material balances exceed the predetermined action limits. DYMAC is part of the United States safeguards system under control of the facility operator. Because of its advanced features, the system will present a new set of inspection conditions to the IAEA, whose response is the subject of a study being sponsored by the US-IAEA Technical Assistance Program. The central issue is how the IAEA can use the increased capabilities of such a system and still maintain independent verification

  16. A dynamic approach to environmental compliance decisions in U.S. Electricity Market: The Acid Rain Program revisited

    International Nuclear Information System (INIS)

    Hancevic, Pedro Ignacio

    2017-01-01

    The Acid Rain Program (ARP) was implemented in 1995. Since then, coal-fired boilers have had to choose among three main compliance alternatives: purchase pollution permits; switch to an alternative lower-sulfur coal; or adopt a scrubber. This decision problem is driven by the evolution of several economic variables and is revised when significant changes (to prices, quality of inputs, output level, technology, transport costs, regulations, among others) occur. Using a structural dynamic discrete choice model, I recover cost parameters and use them to evaluate two different counterfactual policies. The results confirm there is a trade-off between fuel switching and scrubbing costs (with the latter having a higher investment cost and a lower variable cost), and also the existence of regional heterogeneity. Finally, the ARP implied cost savings of approximately $4.7 billions if compared to a uniform emission rate standard and $14.8 billions if compared to compulsory scrubbing for the 1995–2005 period. - Highlights: • With the cap-and-trade system of the ARP boilers had three main compliance options. • Purchase allowances; retrofit the boiler to burn low-sulfur coal; adopt scrubbers. • We develop and estimate a rigorous structural dynamic discrete choice model. • Trade-off between fuel switching and scrubbing (capital versus operating costs). • Cost savings from the ARP were substantial if compared to previous regulations.

  17. Musical structure analysis using similarity matrix and dynamic programming

    Science.gov (United States)

    Shiu, Yu; Jeong, Hong; Kuo, C.-C. Jay

    2005-10-01

    Automatic music segmentation and structure analysis from audio waveforms based on a three-level hierarchy is examined in this research, where the three-level hierarchy includes notes, measures and parts. The pitch class profile (PCP) feature is first extracted at the note level. Then, a similarity matrix is constructed at the measure level, where a dynamic time warping (DTW) technique is used to enhance the similarity computation by taking the temporal distortion of similar audio segments into account. By processing the similarity matrix, we can obtain a coarse-grain music segmentation result. Finally, dynamic programming is applied to the coarse-grain segments so that a song can be decomposed into several major parts such as intro, verse, chorus, bridge and outro. The performance of the proposed music structure analysis system is demonstrated for pop and rock music.

  18. Quasicontinuum analysis of dislocation-coherent twin boundary interaction to provide local rules to discrete dislocation dynamics

    Science.gov (United States)

    Tran, H.-S.; Tummala, H.; Duchene, L.; Pardoen, T.; Fivel, M.; Habraken, A. M.

    2017-10-01

    The interaction of a pure screw dislocation with a Coherent Twin Boundary Σ3 in copper was studied using the Quasicontinuum method. Coherent Twin Boundary behaves as a strong barrier to dislocation glide and prohibits slip transmission across the boundary. Dislocation pileup modifies the stress field at its intersection with the Grain Boundary (GB). A methodology to estimate the strength of the barrier for a dislocation to slip across CTB is proposed. A screw dislocation approaching the boundary from one side either propagates into the adjacent twin grain by cutting through the twin boundary or is stopped and increases the dislocation pileup amplitude at the GB. Quantitative estimation of the critical stress for transmission was performed using the virial stress computed by Quasicontinuum method. The transmission mechanism and critical stress are in line with the literature. Such information can be used as input for dislocation dynamic simulations for a better modeling of grain boundaries.

  19. Nuclear Power Plant Cyber Security Discrete Dynamic Event Tree Analysis (LDRD 17-0958) FY17 Report

    Energy Technology Data Exchange (ETDEWEB)

    Wheeler, Timothy A. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Denman, Matthew R. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Williams, R. A. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Martin, Nevin [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Jankovsky, Zachary Kyle [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

    2017-09-01

    Instrumentation and control of nuclear power is transforming from analog to modern digital assets. These control systems perform key safety and security functions. This transformation is occurring in new plant designs as well as in the existing fleet of plants as the operation of those plants is extended to 60 years. This transformation introduces new and unknown issues involving both digital asset induced safety issues and security issues. Traditional nuclear power risk assessment tools and cyber security assessment methods have not been modified or developed to address the unique nature of cyber failure modes and of cyber security threat vulnerabilities. iii This Lab-Directed Research and Development project has developed a dynamic cyber-risk in- formed tool to facilitate the analysis of unique cyber failure modes and the time sequencing of cyber faults, both malicious and non-malicious, and impose those cyber exploits and cyber faults onto a nuclear power plant accident sequence simulator code to assess how cyber exploits and cyber faults could interact with a plants digital instrumentation and control (DI&C) system and defeat or circumvent a plants cyber security controls. This was achieved by coupling an existing Sandia National Laboratories nuclear accident dynamic simulator code with a cyber emulytics code to demonstrate real-time simulation of cyber exploits and their impact on automatic DI&C responses. Studying such potential time-sequenced cyber-attacks and their risks (i.e., the associated impact and the associated degree of difficulty to achieve the attack vector) on accident management establishes a technical risk informed framework for developing effective cyber security controls for nuclear power.

  20. DEGAS: Dynamic Exascale Global Address Space Programming Environments

    Energy Technology Data Exchange (ETDEWEB)

    Demmel, James [Univ. of California, Berkeley, CA (United States)

    2018-02-23

    The Dynamic, Exascale Global Address Space programming environment (DEGAS) project will develop the next generation of programming models and runtime systems to meet the challenges of Exascale computing. The Berkeley part of the project concentrated on communication-optimal code generation to optimize speed and energy efficiency by reducing data movement. Our work developed communication lower bounds, and/or communication avoiding algorithms (that either meet the lower bound, or do much less communication than their conventional counterparts) for a variety of algorithms, including linear algebra, machine learning and genomics. The Berkeley part of the project concentrated on communication-optimal code generation to optimize speed and energy efficiency by reducing data movement. Our work developed communication lower bounds, and/or communication avoiding algorithms (that either meet the lower bound, or do much less communication than their conventional counterparts) for a variety of algorithms, including linear algebra, machine learning and genomics.

  1. Dynamics of the public concern and risk communication program implementation.

    Science.gov (United States)

    Zaryabova, Victoria; Israel, Michel

    2015-09-01

    The public concern about electromagnetic field (EMF) exposure varies due to different reasons. A part of them are connected with the better and higher quality of information that people receive from science, media, Internet, social networks, industry, but others are based on good communication programs performed by the responsible institutions, administration and persons. Especially, in Bulgaria, public concern follows interesting changes, some of them in correlation with the European processes of concern, but others following the economic and political processes in the country. Here, we analyze the dynamics of the public concern over the last 10 years. Our explanation of the decrease of the people's complaints against EMF exposure from base stations for mobile communication is as a result of our risk communication program that is in implementation for >10 years.

  2. P-Adic Analog of Navier–Stokes Equations: Dynamics of Fluid’s Flow in Percolation Networks (from Discrete Dynamics with Hierarchic Interactions to Continuous Universal Scaling Model

    Directory of Open Access Journals (Sweden)

    Klaudia Oleschko

    2017-04-01

    Full Text Available Recently p-adic (and, more generally, ultrametric spaces representing tree-like networks of percolation, and as a special case of capillary patterns in porous media, started to be used to model the propagation of fluids (e.g., oil, water, oil-in-water, and water-in-oil emulsion. The aim of this note is to derive p-adic dynamics described by fractional differential operators (Vladimirov operators starting with discrete dynamics based on hierarchically-structured interactions between the fluids’ volumes concentrated at different levels of the percolation tree and coming to the multiscale universal topology of the percolating nets. Similar systems of discrete hierarchic equations were widely applied to modeling of turbulence. However, in the present work this similarity is only formal since, in our model, the trees are real physical patterns with a tree-like topology of capillaries (or fractures in random porous media (not cascade trees, as in the case of turbulence, which we will be discussed elsewhere for the spinner flowmeter commonly used in the petroleum industry. By going to the “continuous limit” (with respect to the p-adic topology we represent the dynamics on the tree-like configuration space as an evolutionary nonlinear p-adic fractional (pseudo- differential equation, the tree-like analog of the Navier–Stokes equation. We hope that our work helps to come closer to a nonlinear equation solution, taking into account the scaling, hierarchies, and formal derivations, imprinted from the similar properties of the real physical world. Once this coupling is resolved, the more problematic question of information scaling in industrial applications will be achieved.

  3. Discrete mathematics with applications

    CERN Document Server

    Koshy, Thomas

    2003-01-01

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

  4. Discrete and computational geometry

    CERN Document Server

    Devadoss, Satyan L

    2011-01-01

    Discrete geometry is a relatively new development in pure mathematics, while computational geometry is an emerging area in applications-driven computer science. Their intermingling has yielded exciting advances in recent years, yet what has been lacking until now is an undergraduate textbook that bridges the gap between the two. Discrete and Computational Geometry offers a comprehensive yet accessible introduction to this cutting-edge frontier of mathematics and computer science. This book covers traditional topics such as convex hulls, triangulations, and Voronoi diagrams, as well as more recent subjects like pseudotriangulations, curve reconstruction, and locked chains. It also touches on more advanced material, including Dehn invariants, associahedra, quasigeodesics, Morse theory, and the recent resolution of the Poincaré conjecture. Connections to real-world applications are made throughout, and algorithms are presented independently of any programming language. This richly illustrated textbook also fe...

  5. TIMEX: a time-dependent explicit discrete ordinates program for the solution of multigroup transport equations with delayed neutrons

    International Nuclear Information System (INIS)

    Hill, T.R.; Reed, W.H.

    1976-01-01

    TIMEX solves the time-dependent, one-dimensional multigroup transport equation with delayed neutrons in plane, cylindrical, spherical, and two-angle plane geometries. Both regular and adjoint, inhomogeneous and homogeneous problems subject to vacuum, reflective, periodic, white, albedo or inhomogeneous boundary flux conditions are solved. General anisotropic scattering is allowed and anisotropic inhomogeneous sources are permitted. The discrete ordinates approximation for the angular variable is used with the diamond (central) difference approximation for the angular extrapolation in curved geometries. A linear discontinuous finite element representation for the angular flux in each spatial mesh cell is used. The time variable is differenced by an explicit technique that is unconditionally stable so that arbitrarily large time steps can be taken. Because no iteration is performed the method is exceptionally fast in terms of computing time per time step. Two acceleration methods, exponential extrapolation and rebalance, are utilized to improve the accuracy of the time differencing scheme. Variable dimensioning is used so that any combination of problem parameters leading to a container array less than MAXCOR can be accommodated. The running time for TIMEX is highly problem-dependent, but varies almost linearly with the total number of unknowns and time steps. Provision is made for creation of standard interface output files for angular fluxes and angle-integrated fluxes. Five interface units (use of interface units is optional), five output units, and two system input/output units are required. A large bulk memory is desirable, but may be replaced by disk, drum, or tape storage. 13 tables, 9 figures

  6. Development of nonlinear dynamic analysis program for nuclear piping systems

    International Nuclear Information System (INIS)

    Kamichika, Ryoichi; Izawa, Masahiro; Yamadera, Masao

    1980-01-01

    In the design for nuclear power piping, pipe-whip protection shall be considered in order to keep the function of safety related system even when postulated piping rupture occurs. This guideline was shown in U.S. Regulatory Guide 1.46 for the first time and has been applied in Japanese nuclear power plants. In order to analyze the dynamic behavior followed by pipe rupture, nonlinear analysis is required for the piping system including restraints which play the role of an energy absorber. REAPPS (Rupture Effective Analysis of Piping Systems) has been developed for this purpose. This program can be applied to general piping systems having branches etc. Pre- and post- processors are prepared in this program in order to easily input the data for the piping engineer and show the results optically by use of a graphic display respectively. The piping designer can easily solve many problems in his daily work by use of this program. This paper describes about the theoretical background and functions of this program and shows some examples. (author)

  7. Evaluation of Electric Power Procurement Strategies by Stochastic Dynamic Programming

    Science.gov (United States)

    Saisho, Yuichi; Hayashi, Taketo; Fujii, Yasumasa; Yamaji, Kenji

    In deregulated electricity markets, the role of a distribution company is to purchase electricity from the wholesale electricity market at randomly fluctuating prices and to provide it to its customers at a given fixed price. Therefore the company has to take risk stemming from the uncertainties of electricity prices and/or demand fluctuation instead of the customers. The way to avoid the risk is to make a bilateral contact with generating companies or install its own power generation facility. This entails the necessity to develop a certain method to make an optimal strategy for electric power procurement. In such a circumstance, this research has the purpose for proposing a mathematical method based on stochastic dynamic programming and additionally considering the characteristics of the start-up cost of electric power generation facility to evaluate strategies of combination of the bilateral contract and power auto-generation with its own facility for procuring electric power in deregulated electricity market. In the beginning we proposed two approaches to solve the stochastic dynamic programming, and they are a Monte Carlo simulation method and a finite difference method to derive the solution of a partial differential equation of the total procurement cost of electric power. Finally we discussed the influences of the price uncertainty on optimal strategies of power procurement.

  8. A mathematical programming approach for sequential clustering of dynamic networks

    Science.gov (United States)

    Silva, Jonathan C.; Bennett, Laura; Papageorgiou, Lazaros G.; Tsoka, Sophia

    2016-02-01

    A common analysis performed on dynamic networks is community structure detection, a challenging problem that aims to track the temporal evolution of network modules. An emerging area in this field is evolutionary clustering, where the community structure of a network snapshot is identified by taking into account both its current state as well as previous time points. Based on this concept, we have developed a mixed integer non-linear programming (MINLP) model, SeqMod, that sequentially clusters each snapshot of a dynamic network. The modularity metric is used to determine the quality of community structure of the current snapshot and the historical cost is accounted for by optimising the number of node pairs co-clustered at the previous time point that remain so in the current snapshot partition. Our method is tested on social networks of interactions among high school students, college students and members of the Brazilian Congress. We show that, for an adequate parameter setting, our algorithm detects the classes that these students belong more accurately than partitioning each time step individually or by partitioning the aggregated snapshots. Our method also detects drastic discontinuities in interaction patterns across network snapshots. Finally, we present comparative results with similar community detection methods for time-dependent networks from the literature. Overall, we illustrate the applicability of mathematical programming as a flexible, adaptable and systematic approach for these community detection problems. Contribution to the Topical Issue "Temporal Network Theory and Applications", edited by Petter Holme.

  9. Efficient Scheduling of Scientific Workflows with Energy Reduction Using Novel Discrete Particle Swarm Optimization and Dynamic Voltage Scaling for Computational Grids

    Directory of Open Access Journals (Sweden)

    M. Christobel

    2015-01-01

    Full Text Available One of the most significant and the topmost parameters in the real world computing environment is energy. Minimizing energy imposes benefits like reduction in power consumption, decrease in cooling rates of the computing processors, provision of a green environment, and so forth. In fact, computation time and energy are directly proportional to each other and the minimization of computation time may yield a cost effective energy consumption. Proficient scheduling of Bag-of-Tasks in the grid environment ravages in minimum computation time. In this paper, a novel discrete particle swarm optimization (DPSO algorithm based on the particle’s best position (pbDPSO and global best position (gbDPSO is adopted to find the global optimal solution for higher dimensions. This novel DPSO yields better schedule with minimum computation time compared to Earliest Deadline First (EDF and First Come First Serve (FCFS algorithms which comparably reduces energy. Other scheduling parameters, such as job completion ratio and lateness, are also calculated and compared with EDF and FCFS. An energy improvement of up to 28% was obtained when Makespan Conservative Energy Reduction (MCER and Dynamic Voltage Scaling (DVS were used in the proposed DPSO algorithm.

  10. Efficient Scheduling of Scientific Workflows with Energy Reduction Using Novel Discrete Particle Swarm Optimization and Dynamic Voltage Scaling for Computational Grids

    Science.gov (United States)

    Christobel, M.; Tamil Selvi, S.; Benedict, Shajulin

    2015-01-01

    One of the most significant and the topmost parameters in the real world computing environment is energy. Minimizing energy imposes benefits like reduction in power consumption, decrease in cooling rates of the computing processors, provision of a green environment, and so forth. In fact, computation time and energy are directly proportional to each other and the minimization of computation time may yield a cost effective energy consumption. Proficient scheduling of Bag-of-Tasks in the grid environment ravages in minimum computation time. In this paper, a novel discrete particle swarm optimization (DPSO) algorithm based on the particle's best position (pbDPSO) and global best position (gbDPSO) is adopted to find the global optimal solution for higher dimensions. This novel DPSO yields better schedule with minimum computation time compared to Earliest Deadline First (EDF) and First Come First Serve (FCFS) algorithms which comparably reduces energy. Other scheduling parameters, such as job completion ratio and lateness, are also calculated and compared with EDF and FCFS. An energy improvement of up to 28% was obtained when Makespan Conservative Energy Reduction (MCER) and Dynamic Voltage Scaling (DVS) were used in the proposed DPSO algorithm. PMID:26075296

  11. Discrete Curvatures and Discrete Minimal Surfaces

    KAUST Repository

    Sun, Xiang

    2012-01-01

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

  12. Three-dimensional interactive Molecular Dynamics program for the study of defect dynamics in crystals

    Science.gov (United States)

    Patriarca, M.; Kuronen, A.; Robles, M.; Kaski, K.

    2007-01-01

    The study of crystal defects and the complex processes underlying their formation and time evolution has motivated the development of the program ALINE for interactive molecular dynamics experiments. This program couples a molecular dynamics code to a Graphical User Interface and runs on a UNIX-X11 Window System platform with the MOTIF library, which is contained in many standard Linux releases. ALINE is written in C, thus giving the user the possibility to modify the source code, and, at the same time, provides an effective and user-friendly framework for numerical experiments, in which the main parameters can be interactively varied and the system visualized in various ways. We illustrate the main features of the program through some examples of detection and dynamical tracking of point-defects, linear defects, and planar defects, such as stacking faults in lattice-mismatched heterostructures. Program summaryTitle of program:ALINE Catalogue identifier:ADYJ_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADYJ_v1_0 Program obtainable from: CPC Program Library, Queen University of Belfast, N. Ireland Computer for which the program is designed and others on which it has been tested: Computers:DEC ALPHA 300, Intel i386 compatible computers, G4 Apple Computers Installations:Laboratory of Computational Engineering, Helsinki University of Technology, Helsinki, Finland Operating systems under which the program has been tested:True64 UNIX, Linux-i386, Mac OS X 10.3 and 10.4 Programming language used:Standard C and MOTIF libraries Memory required to execute with typical data:6 Mbytes but may be larger depending on the system size No. of lines in distributed program, including test data, etc.:16 901 No. of bytes in distributed program, including test data, etc.:449 559 Distribution format:tar.gz Nature of physical problem:Some phenomena involving defects take place inside three-dimensional crystals at times which can be hardly predicted. For this reason they are

  13. Dynamic electricity pricing for electric vehicles using stochastic programming

    International Nuclear Information System (INIS)

    Soares, João; Ghazvini, Mohammad Ali Fotouhi; Borges, Nuno; Vale, Zita

    2017-01-01

    Electric Vehicles (EVs) are an important source of uncertainty, due to their variable demand, departure time and location. In smart grids, the electricity demand can be controlled via Demand Response (DR) programs. Smart charging and vehicle-to-grid seem highly promising methods for EVs control. However, high capital costs remain a barrier to implementation. Meanwhile, incentive and price-based schemes that do not require high level of control can be implemented to influence the EVs' demand. Having effective tools to deal with the increasing level of uncertainty is increasingly important for players, such as energy aggregators. This paper formulates a stochastic model for day-ahead energy resource scheduling, integrated with the dynamic electricity pricing for EVs, to address the challenges brought by the demand and renewable sources uncertainty. The two-stage stochastic programming approach is used to obtain the optimal electricity pricing for EVs. A realistic case study projected for 2030 is presented based on Zaragoza network. The results demonstrate that it is more effective than the deterministic model and that the optimal pricing is preferable. This study indicates that adequate DR schemes like the proposed one are promising to increase the customers' satisfaction in addition to improve the profitability of the energy aggregation business. - Highlights: • A stochastic model for energy scheduling tackling several uncertainty sources. • A two-stage stochastic programming is used to tackle the developed model. • Optimal EV electricity pricing seems to improve the profits. • The propose results suggest to increase the customers' satisfaction.

  14. Supporting scalable Bayesian networks using configurable discretizer actuators

    CSIR Research Space (South Africa)

    Osunmakinde, I

    2009-04-01

    Full Text Available The authors propose a generalized model with configurable discretizer actuators as a solution to the problem of the discretization of massive numerical datasets. Their solution is based on a concurrent distribution of the actuators and uses dynamic...

  15. BEST-4, Fuel Cycle and Cost Optimization for Discrete Power Levels

    International Nuclear Information System (INIS)

    1973-01-01

    1 - Nature of physical problem solved: Determination of optimal power strategy for a fuel cycle, for discrete power levels and n temporal stages, taking into account replacement energy costs and de-rating. 2 - Method of solution: Dynamic programming. 3 - Restrictions on the complexity of the problem: Restrictions may arise from number of power levels and temporal stages, due to machine limitations

  16. Reinforcement learning for partially observable dynamic processes: adaptive dynamic programming using measured output data.

    Science.gov (United States)

    Lewis, F L; Vamvoudakis, Kyriakos G

    2011-02-01

    Approximate dynamic programming (ADP) is a class of reinforcement learning methods that have shown their importance in a variety of applications, including feedback control of dynamical systems. ADP generally requires full information about the system internal states, which is usually not available in practical situations. In this paper, we show how to implement ADP methods using only measured input/output data from the system. Linear dynamical systems with deterministic behavior are considered herein, which are systems of great interest in the control system community. In control system theory, these types of methods are referred to as output feedback (OPFB). The stochastic equivalent of the systems dealt with in this paper is a class of partially observable Markov decision processes. We develop both policy iteration and value iteration algorithms that converge to an optimal controller that requires only OPFB. It is shown that, similar to Q -learning, the new methods have the important advantage that knowledge of the system dynamics is not needed for the implementation of these learning algorithms or for the OPFB control. Only the order of the system, as well as an upper bound on its "observability index," must be known. The learned OPFB controller is in the form of a polynomial autoregressive moving-average controller that has equivalent performance with the optimal state variable feedback gain.

  17. Dynamic Power Management for Portable Hybrid Power-Supply Systems Utilizing Approximate Dynamic Programming

    Directory of Open Access Journals (Sweden)

    Jooyoung Park

    2015-05-01

    Full Text Available Recently, the optimization of power flows in portable hybrid power-supply systems (HPSSs has become an important issue with the advent of a variety of mobile systems and hybrid energy technologies. In this paper, a control strategy is considered for dynamically managing power flows in portable HPSSs employing batteries and supercapacitors. Our dynamic power management strategy utilizes the concept of approximate dynamic programming (ADP. ADP methods are important tools in the fields of stochastic control and machine learning, and the utilization of these tools for practical engineering problems is now an active and promising research field. We propose an ADP-based procedure based on optimization under constraints including the iterated Bellman inequalities, which can be solved by convex optimization carried out offline, to find the optimal power management rules for portable HPSSs. The effectiveness of the proposed procedure is tested through dynamic simulations for smartphone workload scenarios, and simulation results show that the proposed strategy can successfully cope with uncertain workload demands.

  18. Hamiltonian-Driven Adaptive Dynamic Programming for Continuous Nonlinear Dynamical Systems.

    Science.gov (United States)

    Yang, Yongliang; Wunsch, Donald; Yin, Yixin

    2017-08-01

    This paper presents a Hamiltonian-driven framework of adaptive dynamic programming (ADP) for continuous time nonlinear systems, which consists of evaluation of an admissible control, comparison between two different admissible policies with respect to the corresponding the performance function, and the performance improvement of an admissible control. It is showed that the Hamiltonian can serve as the temporal difference for continuous-time systems. In the Hamiltonian-driven ADP, the critic network is trained to output the value gradient. Then, the inner product between the critic and the system dynamics produces the value derivative. Under some conditions, the minimization of the Hamiltonian functional is equivalent to the value function approximation. An iterative algorithm starting from an arbitrary admissible control is presented for the optimal control approximation with its convergence proof. The implementation is accomplished by a neural network approximation. Two simulation studies demonstrate the effectiveness of Hamiltonian-driven ADP.

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

  20. Discrete Curvatures and Discrete Minimal Surfaces

    KAUST Repository

    Sun, Xiang

    2012-06-01

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

  1. Optimization of decision rules based on dynamic programming approach

    KAUST Repository

    Zielosko, Beata

    2014-01-14

    This chapter is devoted to the study of an extension of dynamic programming approach which allows optimization of approximate decision rules relative to the length and coverage. We introduce an uncertainty measure that is the difference between number of rows in a given decision table and the number of rows labeled with the most common decision for this table divided by the number of rows in the decision table. We fix a threshold γ, such that 0 ≤ γ < 1, and study so-called γ-decision rules (approximate decision rules) that localize rows in subtables which uncertainty is at most γ. Presented algorithm constructs a directed acyclic graph Δ γ T which nodes are subtables of the decision table T given by pairs "attribute = value". The algorithm finishes the partitioning of a subtable when its uncertainty is at most γ. The chapter contains also results of experiments with decision tables from UCI Machine Learning Repository. © 2014 Springer International Publishing Switzerland.

  2. Estimating Arrhenius parameters using temperature programmed molecular dynamics

    International Nuclear Information System (INIS)

    Imandi, Venkataramana; Chatterjee, Abhijit

    2016-01-01

    Kinetic rates at different temperatures and the associated Arrhenius parameters, whenever Arrhenius law is obeyed, are efficiently estimated by applying maximum likelihood analysis to waiting times collected using the temperature programmed molecular dynamics method. When transitions involving many activated pathways are available in the dataset, their rates may be calculated using the same collection of waiting times. Arrhenius behaviour is ascertained by comparing rates at the sampled temperatures with ones from the Arrhenius expression. Three prototype systems with corrugated energy landscapes, namely, solvated alanine dipeptide, diffusion at the metal-solvent interphase, and lithium diffusion in silicon, are studied to highlight various aspects of the method. The method becomes particularly appealing when the Arrhenius parameters can be used to find rates at low temperatures where transitions are rare. Systematic coarse-graining of states can further extend the time scales accessible to the method. Good estimates for the rate parameters are obtained with 500-1000 waiting times.

  3. Estimating Arrhenius parameters using temperature programmed molecular dynamics

    Energy Technology Data Exchange (ETDEWEB)

    Imandi, Venkataramana; Chatterjee, Abhijit, E-mail: abhijit@che.iitb.ac.in [Department of Chemical Engineering, Indian Institute of Technology Bombay, Mumbai 400076 (India)

    2016-07-21

    Kinetic rates at different temperatures and the associated Arrhenius parameters, whenever Arrhenius law is obeyed, are efficiently estimated by applying maximum likelihood analysis to waiting times collected using the temperature programmed molecular dynamics method. When transitions involving many activated pathways are available in the dataset, their rates may be calculated using the same collection of waiting times. Arrhenius behaviour is ascertained by comparing rates at the sampled temperatures with ones from the Arrhenius expression. Three prototype systems with corrugated energy landscapes, namely, solvated alanine dipeptide, diffusion at the metal-solvent interphase, and lithium diffusion in silicon, are studied to highlight various aspects of the method. The method becomes particularly appealing when the Arrhenius parameters can be used to find rates at low temperatures where transitions are rare. Systematic coarse-graining of states can further extend the time scales accessible to the method. Good estimates for the rate parameters are obtained with 500-1000 waiting times.

  4. The sequence relay selection strategy based on stochastic dynamic programming

    Science.gov (United States)

    Zhu, Rui; Chen, Xihao; Huang, Yangchao

    2017-07-01

    Relay-assisted (RA) network with relay node selection is a kind of effective method to improve the channel capacity and convergence performance. However, most of the existing researches about the relay selection did not consider the statically channel state information and the selection cost. This shortage limited the performance and application of RA network in practical scenarios. In order to overcome this drawback, a sequence relay selection strategy (SRSS) was proposed. And the performance upper bound of SRSS was also analyzed in this paper. Furthermore, in order to make SRSS more practical, a novel threshold determination algorithm based on the stochastic dynamic program (SDP) was given to work with SRSS. Numerical results are also presented to exhibit the performance of SRSS with SDP.

  5. Approximate dynamic programming approaches for appointment scheduling with patient preferences.

    Science.gov (United States)

    Li, Xin; Wang, Jin; Fung, Richard Y K

    2018-04-01

    During the appointment booking process in out-patient departments, the level of patient satisfaction can be affected by whether or not their preferences can be met, including the choice of physicians and preferred time slot. In addition, because the appointments are sequential, considering future possible requests is also necessary for a successful appointment system. This paper proposes a Markov decision process model for optimizing the scheduling of sequential appointments with patient preferences. In contrast to existing models, the evaluation of a booking decision in this model focuses on the extent to which preferences are satisfied. Characteristics of the model are analysed to develop a system for formulating booking policies. Based on these characteristics, two types of approximate dynamic programming algorithms are developed to avoid the curse of dimensionality. Experimental results suggest directions for further fine-tuning of the model, as well as improving the efficiency of the two proposed algorithms. Copyright © 2018 Elsevier B.V. All rights reserved.

  6. Design and Analysis of Decision Rules via Dynamic Programming

    KAUST Repository

    Amin, Talha M.

    2017-04-24

    The areas of machine learning, data mining, and knowledge representation have many different formats used to represent information. Decision rules, amongst these formats, are the most expressive and easily-understood by humans. In this thesis, we use dynamic programming to design decision rules and analyze them. The use of dynamic programming allows us to work with decision rules in ways that were previously only possible for brute force methods. Our algorithms allow us to describe the set of all rules for a given decision table. Further, we can perform multi-stage optimization by repeatedly reducing this set to only contain rules that are optimal with respect to selected criteria. One way that we apply this study is to generate small systems with short rules by simulating a greedy algorithm for the set cover problem. We also compare maximum path lengths (depth) of deterministic and non-deterministic decision trees (a non-deterministic decision tree is effectively a complete system of decision rules) with regards to Boolean functions. Another area of advancement is the presentation of algorithms for constructing Pareto optimal points for rules and rule systems. This allows us to study the existence of “totally optimal” decision rules (rules that are simultaneously optimal with regards to multiple criteria). We also utilize Pareto optimal points to compare and rate greedy heuristics with regards to two criteria at once. Another application of Pareto optimal points is the study of trade-offs between cost and uncertainty which allows us to find reasonable systems of decision rules that strike a balance between length and accuracy.

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

    CERN Document Server

    Lozovanu, Dmitrii

    2014-01-01

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

  8. Quasicanonical structure of optimal control in constrained discrete systems

    Science.gov (United States)

    Sieniutycz, S.

    2003-06-01

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

  9. 3D discrete angiogenesis dynamic model and stochastic simulation for the assessment of blood perfusion coefficient and impact on heat transfer between nanoparticles and malignant tumors.

    Science.gov (United States)

    Yifat, Jonathan; Gannot, Israel

    2015-03-01

    Early detection of malignant tumors plays a crucial role in the survivability chances of the patient. Therefore, new and innovative tumor detection methods are constantly searched for. Tumor-specific magnetic-core nano-particles can be used with an alternating magnetic field to detect and treat tumors by hyperthermia. For the analysis of the method effectiveness, the bio-heat transfer between the nanoparticles and the tissue must be carefully studied. Heat diffusion in biological tissue is usually analyzed using the Pennes Bio-Heat Equation, where blood perfusion plays an important role. Malignant tumors are known to initiate an angiogenesis process, where endothelial cell migration from neighboring vasculature eventually leads to the formation of a thick blood capillary network around them. This process allows the tumor to receive its extensive nutrition demands and evolve into a more progressive and potentially fatal tumor. In order to assess the effect of angiogenesis on the bio-heat transfer problem, we have developed a discrete stochastic 3D model & simulation of tumor-induced angiogenesis. The model elaborates other angiogenesis models by providing high resolution 3D stochastic simulation, capturing of fine angiogenesis morphological features, effects of dynamic sprout thickness functions, and stochastic parent vessel generator. We show that the angiogenesis realizations produced are well suited for numerical bio-heat transfer analysis. Statistical study on the angiogenesis characteristics was derived using Monte Carlo simulations. According to the statistical analysis, we provide analytical expression for the blood perfusion coefficient in the Pennes equation, as a function of several parameters. This updated form of the Pennes equation could be used for numerical and analytical analyses of the proposed detection and treatment method. Copyright © 2014 Elsevier Inc. All rights reserved.

  10. Dynamic Line Rating Oncor Electric Delivery Smart Grid Program

    Energy Technology Data Exchange (ETDEWEB)

    Johnson, Justin; Smith, Cale; Young, Mike; Donohoo, Ken; Owen, Ross; Clark, Eddit; Espejo, Raul; Aivaliotis, Sandy; Stelmak, Ron; Mohr, Ron; Barba, Cristian; Gonzalez, Guillermo; Malkin, Stuart; Dimitrova, Vessela; Ragsdale, Gary; Mitchem, Sean; Jeirath, Nakul; Loomis, Joe; Trevino, Gerardo; Syracuse, Steve; Hurst, Neil; Mereness, Matt; Johnson, Chad; Bivens, Carrie

    2013-05-04

    Electric transmission lines are the lifeline of the electric utility industry, delivering its product from source to consumer. This critical infrastructure is often constrained such that there is inadequate capacity on existing transmission lines to efficiently deliver the power to meet demand in certain areas or to transport energy from high-generation areas to high-consumption regions. When this happens, the cost of the energy rises; more costly sources of power are used to meet the demand or the system operates less reliably. These economic impacts are known as congestion, and they can amount to substantial dollars for any time frame of reference: hour, day or year. There are several solutions to the transmission constraint problem, including: construction of new generation, construction of new transmission facilities, rebuilding and reconductoring of existing transmission assets, and Dynamic Line Rating (DLR). All of these options except DLR are capital intensive, have long lead times and often experience strong public and regulatory opposition. The Smart Grid Demonstration Program (SGDP) project co-funded by the Department of Energy (DOE) and Oncor Electric Delivery Company developed and deployed the most extensive and advanced DLR installation to demonstrate that DLR technology is capable of resolving many transmission capacity constraint problems with a system that is reliable, safe and very cost competitive. The SGDP DLR deployment is the first application of DLR technology to feed transmission line real-time dynamic ratings directly into the system operation’s State Estimator and load dispatch program, which optimizes the matching of generation with load demand on a security, reliability and economic basis. The integrated Dynamic Line Rating (iDLR)1 collects transmission line parameters at remote locations on the lines, calculates the real-time line rating based on the equivalent conductor temperature, ambient temperature and influence of wind and solar

  11. Connecting grain-scale physics to macroscopic granular flow behavior using discrete contact-dynamics simulations, centrifuge experiments, and continuum modeling

    Science.gov (United States)

    Reitz, Meredith; Stark, Colin; Hung, Chi-Yao; Smith, Breannan; Grinspin, Eitan; Capart, Herve; Li, Liming; Crone, Timothy; Hsu, Leslie; Ling, Hoe

    2014-05-01

    A complete theoretical understanding of geophysical granular flow is essential to the reliable assessment of landslide and debris flow hazard and for the design of mitigation strategies, but several key challenges remain. Perhaps the most basic is a general treatment of the processes of internal energy dissipation, which dictate the runout velocity and the shape and scale of the affected area. Currently, dissipation is best described by macroscopic, empirical friction coefficients only indirectly related to the grain-scale physics. Another challenge is describing the forces exerted at the boundaries of the flow, which dictate the entrainment of further debris and the erosion of cohesive surfaces. While the granular effects on these boundary forces have been shown to be large compared to predictions from continuum approximations, the link between granular effects and erosion or entrainment rates has not been settled. Here we present preliminary results of a multi-disciplinary study aimed at improving our understanding of granular flow energy dissipation and boundary forces, through an effort to connect grain-scale physics to macroscopic behaviors. Insights into grain-scale force distributions and energy dissipation mechanisms are derived from discrete contact-dynamics simulations. Macroscopic erosion and flow behaviors are documented from a series of granular flow experiments, in which a rotating drum half-filled with grains is placed within a centrifuge payload, in order to drive effective gravity levels up to ~100g and approach the forces present in natural systems. A continuum equation is used to characterize the flowing layer depth and velocity resulting from the force balance between the down-slope pull of gravity and the friction at the walls. In this presentation we will focus on the effect of granular-specific physics such as force chain networks and grain-grain collisions, derived from the contact dynamics simulations. We will describe our efforts to

  12. THE EXISTENCE OF THE STABILIZING SOLUTION OF THE RICCATI EQUATION ARISING IN DISCRETE-TIME STOCHASTIC ZERO SUM LQ DYNAMIC GAMES WITH PERIODIC COEFFICIENTS

    Directory of Open Access Journals (Sweden)

    Vasile Dr ̆agan

    2017-06-01

    Full Text Available We investigate the problem for solving a discrete-time periodic gen- eralized Riccati equation with an indefinite sign of the quadratic term. A necessary condition for the existence of bounded and stabilizing solution of the discrete-time Riccati equation with an indefinite quadratic term is derived. The stabilizing solution is positive semidefinite and satisfies the introduced sign conditions. The proposed condition is illustrated via a numerical example.

  13. Frequency Domain Computer Programs for Prediction and Analysis of Rail Vehicle Dynamics : Volume 1. Technical Report

    Science.gov (United States)

    1975-12-01

    Frequency domain computer programs developed or acquired by TSC for the analysis of rail vehicle dynamics are described in two volumes. Volume I defines the general analytical capabilities required for computer programs applicable to single rail vehi...

  14. The X-Ray Pebble Recirculation Experiment (X-PREX): Facility Description, Preliminary Discrete Element Method Simulation Validation Studies, and Future Test Program

    International Nuclear Information System (INIS)

    Laufer, Michael R.; Bickel, Jeffrey E.; Buster, Grant C.; Krumwiede, David L.; Peterson, Per F.

    2014-01-01

    This paper presents a facility description, preliminary results, and future test program of the new X-Ray Pebble Recirculation Experiment (X-PREX), which is now operational and being used to collect data on the behavior of slow dense granular flows relevant to pebble bed reactor core designs. The X-PREX facility uses digital x-ray tomography methods to track both the translational and rotational motion of spherical pebbles, which provides unique experimental results that can be used to validate discrete element method (DEM) simulations of pebble motion. The validation effort supported by the X-PREX facility provides a means to build confidence in analysis of pebble bed configuration and residence time distributions that impact the neutronics, thermal hydraulics, and safety analysis of pebble bed reactor cores. Preliminary experimental and DEM simulation results are reported for silo drainage, a classical problem in the granular flow literature, at several hopper angles. These studies include conventional converging and novel diverging geometries that provide additional flexibility in the design of pebble bed reactor cores. Excellent agreement is found between the X-PREX experimental and DEM simulation results. Finally, this paper discusses additional studies in progress relevant to the design and analysis of pebble bed reactor cores including pebble recirculation in cylindrical core geometries and evaluation of forces on shut down blades inserted directly into a packed pebble bed. (author)

  15. Comparing the Discrete and Continuous Logistic Models

    Science.gov (United States)

    Gordon, Sheldon P.

    2008-01-01

    The solutions of the discrete logistic growth model based on a difference equation and the continuous logistic growth model based on a differential equation are compared and contrasted. The investigation is conducted using a dynamic interactive spreadsheet. (Contains 5 figures.)

  16. Reactor dynamics calculations

    International Nuclear Information System (INIS)

    Devooght, J.; Lefvert, T.; Stankiewiez, J.

    1981-01-01

    This chapter deals with the work done in reactor dynamics within the Coordinated Research Program on Transport Theory and Advanced Reactor Calculations by three groups in Belgium, Poland, Sweden and Italy. Discretization methods in diffusion theory, collision probability methods in time-dependent neutron transport and singular perturbation method are represented in this paper

  17. General Purpose Fortran Program for Discrete-Ordinate-Method Radiative Transfer in Scattering and Emitting Layered Media: An Update of DISORT

    Science.gov (United States)

    Tsay, Si-Chee; Stamnes, Knut; Wiscombe, Warren; Laszlo, Istvan; Einaudi, Franco (Technical Monitor)

    2000-01-01

    This update reports a state-of-the-art discrete ordinate algorithm for monochromatic unpolarized radiative transfer in non-isothermal, vertically inhomogeneous, but horizontally homogeneous media. The physical processes included are Planckian thermal emission, scattering with arbitrary phase function, absorption, and surface bidirectional reflection. The system may be driven by parallel or isotropic diffuse radiation incident at the top boundary, as well as by internal thermal sources and thermal emission from the boundaries. Radiances, fluxes, and mean intensities are returned at user-specified angles and levels. DISORT has enjoyed considerable popularity in the atmospheric science and other communities since its introduction in 1988. Several new DISORT features are described in this update: intensity correction algorithms designed to compensate for the 8-M forward-peak scaling and obtain accurate intensities even in low orders of approximation; a more general surface bidirectional reflection option; and an exponential-linear approximation of the Planck function allowing more accurate solutions in the presence of large temperature gradients. DISORT has been designed to be an exemplar of good scientific software as well as a program of intrinsic utility. An extraordinary effort has been made to make it numerically well-conditioned, error-resistant, and user-friendly, and to take advantage of robust existing software tools. A thorough test suite is provided to verify the program both against published results, and for consistency where there are no published results. This careful attention to software design has been just as important in DISORT's popularity as its powerful algorithmic content.

  18. Finite discrete field theory

    International Nuclear Information System (INIS)

    Souza, Manoelito M. de

    1997-01-01

    We discuss the physical meaning and the geometric interpretation of implementation in classical field theories. The origin of infinities and other inconsistencies in field theories is traced to fields defined with support on the light cone; a finite and consistent field theory requires a light-cone generator as the field support. Then, we introduce a classical field theory with support on the light cone generators. It results on a description of discrete (point-like) interactions in terms of localized particle-like fields. We find the propagators of these particle-like fields and discuss their physical meaning, properties and consequences. They are conformally invariant, singularity-free, and describing a manifestly covariant (1 + 1)-dimensional dynamics in a (3 = 1) spacetime. Remarkably this conformal symmetry remains even for the propagation of a massive field in four spacetime dimensions. We apply this formalism to Classical electrodynamics and to the General Relativity Theory. The standard formalism with its distributed fields is retrieved in terms of spacetime average of the discrete field. Singularities are the by-products of the averaging process. This new formalism enlighten the meaning and the problem of field theory, and may allow a softer transition to a quantum theory. (author)

  19. Dynamic programming approach to optimization of approximate decision rules

    KAUST Repository

    Amin, Talha

    2013-02-01

    This paper is devoted to the study of an extension of dynamic programming approach which allows sequential optimization of approximate decision rules relative to the length and coverage. We introduce an uncertainty measure R(T) which is the number of unordered pairs of rows with different decisions in the decision table T. For a nonnegative real number β, we consider β-decision rules that localize rows in subtables of T with uncertainty at most β. Our algorithm constructs a directed acyclic graph Δβ(T) which nodes are subtables of the decision table T given by systems of equations of the kind "attribute = value". This algorithm finishes the partitioning of a subtable when its uncertainty is at most β. The graph Δβ(T) allows us to describe the whole set of so-called irredundant β-decision rules. We can describe all irredundant β-decision rules with minimum length, and after that among these rules describe all rules with maximum coverage. We can also change the order of optimization. The consideration of irredundant rules only does not change the results of optimization. This paper contains also results of experiments with decision tables from UCI Machine Learning Repository. © 2012 Elsevier Inc. All rights reserved.

  20. Dynamic programming approach for partial decision rule optimization

    KAUST Repository

    Amin, Talha

    2012-10-04

    This paper is devoted to the study of an extension of dynamic programming approach which allows optimization of partial decision rules relative to the length or coverage. We introduce an uncertainty measure J(T) which is the difference between number of rows in a decision table T and number of rows with the most common decision for T. For a nonnegative real number γ, we consider γ-decision rules (partial decision rules) that localize rows in subtables of T with uncertainty at most γ. Presented algorithm constructs a directed acyclic graph Δ γ(T) which nodes are subtables of the decision table T given by systems of equations of the kind "attribute = value". This algorithm finishes the partitioning of a subtable when its uncertainty is at most γ. The graph Δ γ(T) allows us to describe the whole set of so-called irredundant γ-decision rules. We can optimize such set of rules according to length or coverage. This paper contains also results of experiments with decision tables from UCI Machine Learning Repository.

  1. Optimization of control poison management by dynamic programming

    International Nuclear Information System (INIS)

    Ponzoni Filho, P.

    1974-01-01

    A dynamic programming approach was used to optimize the poison distribution in the core of a nuclear power plant between reloading. This method was applied to a 500 M We PWR subject to two different fuel management policies. The beginning of a stage is marked by a fuel management decision. The state vector of the system is defined by the burnups in the three fuel zones of the core. The change of the state vector is computed in several time steps. A criticality conserving poison management pattern is chosen at the beginning of each step. The burnups at the end of a step are obtained by means of depletion calculations, assuming constant neutron distribution during the step. The violation of burnup and power peaking constraints during the step eliminates the corresponding end states. In the case of identical end states, all except that which produced the largest amount of energy, are eliminated. Among the several end states one is selected for the subsequent stage, when it is subjected to a fuel management decision. This selection is based on an optimally criterion previously chosen, such as: discharged fuel burnup maximization, energy generation cost minimization, etc. (author)

  2. Dynamic programming approach for partial decision rule optimization

    KAUST Repository

    Amin, Talha M.; Chikalov, Igor; Moshkov, Mikhail; Zielosko, Beata

    2012-01-01

    This paper is devoted to the study of an extension of dynamic programming approach which allows optimization of partial decision rules relative to the length or coverage. We introduce an uncertainty measure J(T) which is the difference between number of rows in a decision table T and number of rows with the most common decision for T. For a nonnegative real number γ, we consider γ-decision rules (partial decision rules) that localize rows in subtables of T with uncertainty at most γ. Presented algorithm constructs a directed acyclic graph Δ γ(T) which nodes are subtables of the decision table T given by systems of equations of the kind "attribute = value". This algorithm finishes the partitioning of a subtable when its uncertainty is at most γ. The graph Δ γ(T) allows us to describe the whole set of so-called irredundant γ-decision rules. We can optimize such set of rules according to length or coverage. This paper contains also results of experiments with decision tables from UCI Machine Learning Repository.

  3. Replacement model of city bus: A dynamic programming approach

    Science.gov (United States)

    Arifin, Dadang; Yusuf, Edhi

    2017-06-01

    This paper aims to develop a replacement model of city bus vehicles operated in Bandung City. This study is driven from real cases encountered by the Damri Company in the efforts to improve services to the public. The replacement model propounds two policy alternatives: First, to maintain or keep the vehicles, and second is to replace them with new ones taking into account operating costs, revenue, salvage value, and acquisition cost of a new vehicle. A deterministic dynamic programming approach is used to solve the model. The optimization process was heuristically executed using empirical data of Perum Damri. The output of the model is to determine the replacement schedule and the best policy if the vehicle has passed the economic life. Based on the results, the technical life of the bus is approximately 20 years old, while the economic life is an average of 9 (nine) years. It means that after the bus is operated for 9 (nine) years, managers should consider the policy of rejuvenation.

  4. Lymph node segmentation by dynamic programming and active contours.

    Science.gov (United States)

    Tan, Yongqiang; Lu, Lin; Bonde, Apurva; Wang, Deling; Qi, Jing; Schwartz, Lawrence H; Zhao, Binsheng

    2018-03-03

    Enlarged lymph nodes are indicators of cancer staging, and the change in their size is a reflection of treatment response. Automatic lymph node segmentation is challenging, as the boundary can be unclear and the surrounding structures complex. This work communicates a new three-dimensional algorithm for the segmentation of enlarged lymph nodes. The algorithm requires a user to draw a region of interest (ROI) enclosing the lymph node. Rays are cast from the center of the ROI, and the intersections of the rays and the boundary of the lymph node form a triangle mesh. The intersection points are determined by dynamic programming. The triangle mesh initializes an active contour which evolves to low-energy boundary. Three radiologists independently delineated the contours of 54 lesions from 48 patients. Dice coefficient was used to evaluate the algorithm's performance. The mean Dice coefficient between computer and the majority vote results was 83.2%. The mean Dice coefficients between the three radiologists' manual segmentations were 84.6%, 86.2%, and 88.3%. The performance of this segmentation algorithm suggests its potential clinical value for quantifying enlarged lymph nodes. © 2018 American Association of Physicists in Medicine.

  5. Mimetic discretization methods

    CERN Document Server

    Castillo, Jose E

    2013-01-01

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

  6. Automatic sleep staging using empirical mode decomposition, discrete wavelet transform, time-domain, and nonlinear dynamics features of heart rate variability signals.

    Science.gov (United States)

    Ebrahimi, Farideh; Setarehdan, Seyed-Kamaledin; Ayala-Moyeda, Jose; Nazeran, Homer

    2013-10-01

    The conventional method for sleep staging is to analyze polysomnograms (PSGs) recorded in a sleep lab. The electroencephalogram (EEG) is one of the most important signals in PSGs but recording and analysis of this signal presents a number of technical challenges, especially at home. Instead, electrocardiograms (ECGs) are much easier to record and may offer an attractive alternative for home sleep monitoring. The heart rate variability (HRV) signal proves suitable for automatic sleep staging. Thirty PSGs from the Sleep Heart Health Study (SHHS) database were used. Three feature sets were extracted from 5- and 0.5-min HRV segments: time-domain features, nonlinear-dynamics features and time-frequency features. The latter was achieved by using empirical mode decomposition (EMD) and discrete wavelet transform (DWT) methods. Normalized energies in important frequency bands of HRV signals were computed using time-frequency methods. ANOVA and t-test were used for statistical evaluations. Automatic sleep staging was based on HRV signal features. The ANOVA followed by a post hoc Bonferroni was used for individual feature assessment. Most features were beneficial for sleep staging. A t-test was used to compare the means of extracted features in 5- and 0.5-min HRV segments. The results showed that the extracted features means were statistically similar for a small number of features. A separability measure showed that time-frequency features, especially EMD features, had larger separation than others. There was not a sizable difference in separability of linear features between 5- and 0.5-min HRV segments but separability of nonlinear features, especially EMD features, decreased in 0.5-min HRV segments. HRV signal features were classified by linear discriminant (LD) and quadratic discriminant (QD) methods. Classification results based on features from 5-min segments surpassed those obtained from 0.5-min segments. The best result was obtained from features using 5-min HRV

  7. Practical method for generation expansion planning based on the dynamic programming. Dynamic programming ni motozuku dengen keikaku shuho

    Energy Technology Data Exchange (ETDEWEB)

    Tanabe, R.; Yasuda, K.; Yokoyama, R. (Tokyo Metropolitan Univ., Tokyo (Japan))

    1992-05-20

    To supply cheap, high-reliable and a planty of the electricity is an important task of the electric supply system because the requirement for the electricity is rapidly increased in Japan. In order to solve this problem, the authors of the paper are developing a most suitable practical method based on algorithm, according to which the generation expansion planning is divided into two problems: the optimal generation mix and the optimal generation construction process and the two problems are solved respectively. But there are some bad points in the method, for example, there are only approximative practical restriction of the capacity of single machine and the existing electric supply etc., because the optimal generation mix is determined on the basis of non-linear planning. So, in the present paper, the electric supply support system is practically constructed while proposing an unified generation expansion planning based on the dynamic programming that is possible to consider these restrictions strictly and the usefullness of the method is inspected. 12 refs., 7 figs., 5 tabs.

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

  9. Geometry and Hamiltonian mechanics on discrete spaces

    International Nuclear Information System (INIS)

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

    2004-01-01

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

  10. Discrete exterior geometry approach to structure-preserving discretization of distributed-parameter port-Hamiltonian systems

    NARCIS (Netherlands)

    Seslija, Marko; van der Schaft, Arjan; Scherpen, Jacquelien M.A.

    This paper addresses the issue of structure-preserving discretization of open distributed-parameter systems with Hamiltonian dynamics. Employing the formalism of discrete exterior calculus, we introduce a simplicial Dirac structure as a discrete analogue of the Stokes-Dirac structure and demonstrate

  11. A discrete exterior approach to structure-preserving discretization of distributed-parameter port-Hamiltonian systems

    NARCIS (Netherlands)

    Seslija, Marko; Scherpen, Jacquelien M.A.; van der Schaft, Arjan

    2011-01-01

    This paper addresses the issue of structure-preserving discretization of open distributed-parameter systems with Hamiltonian dynamics. Employing the formalism of discrete exterior calculus, we introduce simplicial Dirac structures as discrete analogues of the Stokes-Dirac structure and demonstrate

  12. Skin tumor area extraction using an improved dynamic programming approach.

    Science.gov (United States)

    Abbas, Qaisar; Celebi, M E; Fondón García, Irene

    2012-05-01

    Border (B) description of melanoma and other pigmented skin lesions is one of the most important tasks for the clinical diagnosis of dermoscopy images using the ABCD rule. For an accurate description of the border, there must be an effective skin tumor area extraction (STAE) method. However, this task is complicated due to uneven illumination, artifacts present in the lesions and smooth areas or fuzzy borders of the desired regions. In this paper, a novel STAE algorithm based on improved dynamic programming (IDP) is presented. The STAE technique consists of the following four steps: color space transform, pre-processing, rough tumor area detection and refinement of the segmented area. The procedure is performed in the CIE L(*) a(*) b(*) color space, which is approximately uniform and is therefore related to dermatologist's perception. After pre-processing the skin lesions to reduce artifacts, the DP algorithm is improved by introducing a local cost function, which is based on color and texture weights. The STAE method is tested on a total of 100 dermoscopic images. In order to compare the performance of STAE with other state-of-the-art algorithms, various statistical measures based on dermatologist-drawn borders are utilized as a ground truth. The proposed method outperforms the others with a sensitivity of 96.64%, a specificity of 98.14% and an error probability of 5.23%. The results demonstrate that this STAE method by IDP is an effective solution when compared with other state-of-the-art segmentation techniques. The proposed method can accurately extract tumor borders in dermoscopy images. © 2011 John Wiley & Sons A/S.

  13. The NASA Computational Fluid Dynamics (CFD) program - Building technology to solve future challenges

    Science.gov (United States)

    Richardson, Pamela F.; Dwoyer, Douglas L.; Kutler, Paul; Povinelli, Louis A.

    1993-01-01

    This paper presents the NASA Computational Fluid Dynamics program in terms of a strategic vision and goals as well as NASA's financial commitment and personnel levels. The paper also identifies the CFD program customers and the support to those customers. In addition, the paper discusses technical emphasis and direction of the program and some recent achievements. NASA's Ames, Langley, and Lewis Research Centers are the research hubs of the CFD program while the NASA Headquarters Office of Aeronautics represents and advocates the program.

  14. A user's guide to the Flexible Spacecraft Dynamics and Control Program

    Science.gov (United States)

    Fedor, J. V.

    1984-01-01

    A guide to the use of the Flexible Spacecraft Dynamics Program (FSD) is presented covering input requirements, control words, orbit generation, spacecraft description and simulation options, and output definition. The program can be used in dynamics and control analysis as well as in orbit support of deployment and control of spacecraft. The program is applicable to inertially oriented spinning, Earth oriented or gravity gradient stabilized spacecraft. Internal and external environmental effects can be simulated.

  15. Discrete anti-gravity

    International Nuclear Information System (INIS)

    Noyes, H.P.; Starson, S.

    1991-03-01

    Discrete physics, because it replaces time evolution generated by the energy operator with a global bit-string generator (program universe) and replaces ''fields'' with the relativistic Wheeler-Feynman ''action at a distance,'' allows the consistent formulation of the concept of signed gravitational charge for massive particles. The resulting prediction made by this version of the theory is that free anti-particles near the surface of the earth will ''fall'' up with the same acceleration that the corresponding particles fall down. So far as we can see, no current experimental information is in conflict with this prediction of our theory. The experiment crusis will be one of the anti-proton or anti-hydrogen experiments at CERN. Our prediction should be much easier to test than the small effects which those experiments are currently designed to detect or bound. 23 refs

  16. Quantum chaos on discrete graphs

    International Nuclear Information System (INIS)

    Smilansky, Uzy

    2007-01-01

    Adapting a method developed for the study of quantum chaos on quantum (metric) graphs (Kottos and Smilansky 1997 Phys. Rev. Lett. 79 4794, Kottos and Smilansky 1999 Ann. Phys., NY 274 76), spectral ζ functions and trace formulae for discrete Laplacians on graphs are derived. This is achieved by expressing the spectral secular equation in terms of the periodic orbits of the graph and obtaining functions which belong to the class of ζ functions proposed originally by Ihara (1966 J. Mat. Soc. Japan 18 219) and expanded by subsequent authors (Stark and Terras 1996 Adv. Math. 121 124, Kotani and Sunada 2000 J. Math. Sci. Univ. Tokyo 7 7). Finally, a model of 'classical dynamics' on the discrete graph is proposed. It is analogous to the corresponding classical dynamics derived for quantum graphs (Kottos and Smilansky 1997 Phys. Rev. Lett. 79 4794, Kottos and Smilansky 1999 Ann. Phys., NY 274 76). (fast track communication)

  17. Duality for discrete integrable systems

    International Nuclear Information System (INIS)

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

    2005-01-01

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

  18. Discrete tomography in neutron radiography

    International Nuclear Information System (INIS)

    Kuba, Attila; Rodek, Lajos; Kiss, Zoltan; Rusko, Laszlo; Nagy, Antal; Balasko, Marton

    2005-01-01

    Discrete tomography (DT) is an imaging technique for reconstructing discrete images from their projections using the knowledge that the object to be reconstructed contains only a few homogeneous materials characterized by known discrete absorption values. One of the main reasons for applying DT is that we will hopefully require relatively few projections. Using discreteness and some a priori information (such as an approximate shape of the object) we can apply two DT methods in neutron imaging by reducing the problem to an optimization task. The first method is a special one because it is only suitable if the object is composed of cylinders and sphere shapes. The second method is a general one in the sense that it can be used for reconstructing objects of any shape. Software was developed and physical experiments performed in order to investigate the effects of several reconstruction parameters: the number of projections, noise levels, and complexity of the object to be reconstructed. We give a summary of the experimental results and make a comparison of the results obtained using a classical reconstruction technique (FBP). The programs we developed are available in our DT reconstruction program package DIRECT

  19. Thermodynamic framework for discrete optimal control in multiphase flow systems

    Science.gov (United States)

    Sieniutycz, Stanislaw

    1999-08-01

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

  20. Spatially localized, temporally quasiperiodic, discrete nonlinear excitations

    International Nuclear Information System (INIS)

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

    1995-01-01

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

  1. Discrete breathers in graphane: Effect of temperature

    Energy Technology Data Exchange (ETDEWEB)

    Baimova, J. A., E-mail: julia.a.baimova@gmail.com [Russian Academy of Sciences, Institute of Metal Physics, Ural Branch (Russian Federation); Murzaev, R. T.; Lobzenko, I. P.; Dmitriev, S. V. [Russian Academy of Sciences, Institute for Metals Superplasticity Problems (Russian Federation); Zhou, Kun [Nanyang Technological University, School of Mechanical and Aerospace Engineering (Singapore)

    2016-05-15

    The discrete breathers in graphane in thermodynamic equilibrium in the temperature range 50–600 K are studied by molecular dynamics simulation. A discrete breather is a hydrogen atom vibrating along the normal to a sheet of graphane at a high amplitude. As was found earlier, the lifetime of a discrete breather at zero temperature corresponds to several tens of thousands of vibrations. The effect of temperature on the decay time of discrete breathers and the probability of their detachment from a sheet of graphane are studied in this work. It is shown that closely spaced breathers can exchange energy with each other at zero temperature. The data obtained suggest that thermally activated discrete breathers can be involved in the dehydrogenation of graphane, which is important for hydrogen energetics.

  2. Evolutionary programming for goal-driven dynamic planning

    Science.gov (United States)

    Vaccaro, James M.; Guest, Clark C.; Ross, David O.

    2002-03-01

    Many complex artificial intelligence (IA) problems are goal- driven in nature and the opportunity exists to realize the benefits of a goal-oriented solution. In many cases, such as in command and control, a goal-oriented approach may be the only option. One of many appropriate applications for such an approach is War Gaming. War Gaming is an important tool for command and control because it provides a set of alternative courses of actions so that military leaders can contemplate their next move in the battlefield. For instance, when making decisions that save lives, it is necessary to completely understand the consequences of a given order. A goal-oriented approach provides a slowly evolving tractably reasoned solution that inherently follows one of the principles of war: namely concentration on the objective. Future decision-making will depend not only on the battlefield, but also on a virtual world where military leaders can wage wars and determine their options by playing computer war games much like the real world. The problem with these games is that the built-in AI does not learn nor adapt and many times cheats, because the intelligent player has access to all the information, while the user has access to limited information provided on a display. These games are written for the purpose of entertainment and actions are calculated a priori and off-line, and are made prior or during their development. With these games getting more sophisticated in structure and less domain specific in scope, there needs to be a more general intelligent player that can adapt and learn in case the battlefield situations or the rules of engagement change. One such war game that might be considered is Risk. Risk incorporates the principles of war, is a top-down scalable model, and provides a good application for testing a variety of goal- oriented AI approaches. By integrating a goal-oriented hybrid approach, one can develop a program that plays the Risk game effectively and move

  3. An energy management for series hybrid electric vehicle using improved dynamic programming

    Science.gov (United States)

    Peng, Hao; Yang, Yaoquan; Liu, Chunyu

    2018-02-01

    With the increasing numbers of hybrid electric vehicle (HEV), management for two energy sources, engine and battery, is more and more important to achieve the minimum fuel consumption. This paper introduces several working modes of series hybrid electric vehicle (SHEV) firstly and then describes the mathematical model of main relative components in SHEV. On the foundation of this model, dynamic programming is applied to distribute energy of engine and battery on the platform of matlab and acquires less fuel consumption compared with traditional control strategy. Besides, control rule recovering energy in brake profiles is added into dynamic programming, so shorter computing time is realized by improved dynamic programming and optimization on algorithm.

  4. Testing Object-Oriented Programs using Dynamic Aspects and Non-Determinism

    DEFF Research Database (Denmark)

    Achenbach, Michael; Ostermann, Klaus

    2010-01-01

    decisions exposing private data. We present an approach that both improves the expressiveness of test cases using non-deterministic choice and reduces design modifications using dynamic aspect-oriented programming techniques. Non-deterministic choice facilitates local definitions of multiple executions...... without parameterization or generation of tests. It also eases modelling naturally non-deterministic program features like IO or multi-threading in integration tests. Dynamic AOP facilitates powerful design adaptations without exposing test features, keeping the scope of these adaptations local to each...... test. We also combine non-determinism and dynamic aspects in a new approach to testing multi-threaded programs using co-routines....

  5. Physical models and numerical methods of the reactor dynamic computer program RETRAN

    International Nuclear Information System (INIS)

    Kamelander, G.; Woloch, F.; Sdouz, G.; Koinig, H.

    1984-03-01

    This report describes the physical models and the numerical methods of the reactor dynamic code RETRAN simulating reactivity transients in Light-Water-Reactors. The neutron-physical part of RETRAN bases on the two-group-diffusion equations which are solved by discretization similar to the TWIGL-method. An exponential transformation is applied and the inner iterations are accelerated by a coarse-mesh-rebalancing procedure. The thermo-hydraulic model approximates the equation of state by a built-in steam-water-table and disposes of options for the calculation of heat-conduction coefficients and heat transfer coefficients. (Author) [de

  6. A dynamic regrouping based sequential dynamic programming algorithm for unit commitment of combined heat and power systems

    DEFF Research Database (Denmark)

    Rong, Aiying; Hakonen, Henri; Lahdelma, Risto

    2009-01-01

    efficiency of the plants. We introduce in this paper the DRDP-RSC algorithm, which is a dynamic regrouping based dynamic programming (DP) algorithm based on linear relaxation of the ON/OFF states of the units, sequential commitment of units in small groups. Relaxed states of the plants are used to reduce...... the dimension of the UC problem and dynamic regrouping is used to improve the solution quality. Numerical results based on real-life data sets show that this algorithm is efficient and optimal or near-optimal solutions with very small optimality gap are obtained....

  7. The ultimatum game: Discrete vs. continuous offers

    Science.gov (United States)

    Dishon-Berkovits, Miriam; Berkovits, Richard

    2014-09-01

    In many experimental setups in social-sciences, psychology and economy the subjects are requested to accept or dispense monetary compensation which is usually given in discrete units. Using computer and mathematical modeling we show that in the framework of studying the dynamics of acceptance of proposals in the ultimatum game, the long time dynamics of acceptance of offers in the game are completely different for discrete vs. continuous offers. For discrete values the dynamics follow an exponential behavior. However, for continuous offers the dynamics are described by a power-law. This is shown using an agent based computer simulation as well as by utilizing an analytical solution of a mean-field equation describing the model. These findings have implications to the design and interpretation of socio-economical experiments beyond the ultimatum game.

  8. Effective Hamiltonian for travelling discrete breathers

    Science.gov (United States)

    MacKay, Robert S.; Sepulchre, Jacques-Alexandre

    2002-05-01

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

  9. Optimization of Algorithms Using Extensions of Dynamic Programming

    KAUST Repository

    AbouEisha, Hassan M.

    2017-01-01

    of the thesis presents a novel model of computation (element partition tree) that represents a class of algorithms for multi-frontal solvers along with cost functions reflecting various complexity measures such as: time and space. It then introduces dynamic

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

  11. The apolipoprotein L family of programmed cell death and immunity genes rapidly evolved in primates at discrete sites of host-pathogen interactions.

    Science.gov (United States)

    Smith, Eric E; Malik, Harmit S

    2009-05-01

    Apolipoprotein L1 (APOL1) is a human protein that confers immunity to Trypanosoma brucei infections but can be countered by a trypanosome-encoded antagonist SRA. APOL1 belongs to a family of programmed cell death genes whose proteins can initiate host apoptosis or autophagic death. We report here that all six members of the APOL gene family (APOL1-6) present in humans have rapidly evolved in simian primates. APOL6, furthermore, shows evidence of an adaptive sweep during recent human evolution. In each APOL gene tested, we found rapidly evolving codons in or adjacent to the SRA-interacting protein domain (SID), which is the domain of APOL1 that interacts with SRA. In APOL6, we also found a rapidly changing 13-amino-acid cluster in the membrane-addressing domain (MAD), which putatively functions as a pH sensor and regulator of cell death. We predict that APOL genes are antagonized by pathogens by at least two distinct mechanisms: SID antagonists, which include SRA, that interact with the SID of various APOL proteins, and MAD antagonists that interact with the MAD hinge base of APOL6. These antagonists either block or prematurely cause APOL-mediated programmed cell death of host cells to benefit the infecting pathogen. These putative interactions must occur inside host cells, in contrast to secreted APOL1 that trafficks to the trypanosome lysosome. Hence, the dynamic APOL gene family appears to be an important link between programmed cell death of host cells and immunity to pathogens.

  12. Discretion and Disproportionality

    Directory of Open Access Journals (Sweden)

    Jason A. Grissom

    2015-12-01

    Full Text Available Students of color are underrepresented in gifted programs relative to White students, but the reasons for this underrepresentation are poorly understood. We investigate the predictors of gifted assignment using nationally representative, longitudinal data on elementary students. We document that even among students with high standardized test scores, Black students are less likely to be assigned to gifted services in both math and reading, a pattern that persists when controlling for other background factors, such as health and socioeconomic status, and characteristics of classrooms and schools. We then investigate the role of teacher discretion, leveraging research from political science suggesting that clients of government services from traditionally underrepresented groups benefit from diversity in the providers of those services, including teachers. Even after conditioning on test scores and other factors, Black students indeed are referred to gifted programs, particularly in reading, at significantly lower rates when taught by non-Black teachers, a concerning result given the relatively low incidence of assignment to own-race teachers among Black students.

  13. Program participation, labor force dynamics, and accepted wage rates

    DEFF Research Database (Denmark)

    Munch, Jakob Roland; Skipper, Lars

    2008-01-01

    We apply a recently suggested econometric approach to measure the effects of active labor market programs on employment, unemployment, and wage histories among participants. We find that participation in most of these training programs produces an initial locking-in effect and for some even a lower...

  14. WHAMSE: a program for three-dimensional nonlinear structural dynamics

    International Nuclear Information System (INIS)

    Belytschko, T.; Tsay, C.S.

    1982-02-01

    WHAMSE is a computer program for the nonlinear, transient analysis of structures. The formulation includes both geometric and material nonlinearities, so problems with large displacements and elastic-plastic behavior can be treated. Explicit time integration is used, so the program is most suitable for implusive loads. Energy balance calculations are provided to check numerical stability. The mass matrix is lumped. A finite element format is used for the description of the problem geometry, so the program is quite versatile in treating complex engineering structures. The following elements are included: a triangular element for thin plates and shells, a beam element, a spring element and a rigid body. Mesh generation features are provided to simplify program input. Other features of the program are: (1) a restart capability; (2) a variety of output options, such as printer plots or CALCOMP plots of selected time histories, picture (snapshot) output, and CALCOMP plots of the undeformed and deformed structure

  15. Basal friction evolution and crevasse distribution during the surge of Basin 3, Austfonna ice-cap - offline coupling between a continuum ice dynamic model and a discrete element model

    Science.gov (United States)

    Gong, Yongmei; Zwinger, Thomas; Åström, Jan; Gladstone, Rupert; Schellenberger, Thomas; Altena, Bas; Moore, John

    2017-04-01

    The outlet glacier at Basin 3, Austfonna ice-cap entered its active surge phase in autumn 2012. We assess the evolution of the basal friction during the surge through inverse modelling of basal friction coefficients using recent velocity observation from 2012 to 2014 in a continuum ice dynamic model Elmer/ice. The obtained basal friction coefficient distributions at different time instances are further used as a boundary condition in a discrete element model (HiDEM) that is capable of computing fracturing of ice. The inverted basal friction coefficient evolution shows a gradual 'unplugging' of the stagnant frontal area and northwards and inland expansion of the fast flowing region in the southern basin. The validation between the modeled crevasses distribution and the satellite observation in August 2013 shows a good agreement in shear zones inland and at the frontal area. Crevasse distributions of the summer before and after the glacier reached its maximum velocity in January 2013 (August 2012 and August 2014, respectively) are also evaluated. Previous studies suggest the triggering and development of the surge are linked to surface melt water penetrating through ice to form an efficient basal hydrology system thereby triggering a hydro- thermodynamic feedback. This preliminary offline coupling between a continuum ice dynamic model and a discrete element model will give a hint on future model development of linking supra-glacial to sub-glacial hydrology system.

  16. An optimal maintenance policy for machine replacement problem using dynamic programming

    OpenAIRE

    Mohsen Sadegh Amalnik; Morteza Pourgharibshahi

    2017-01-01

    In this article, we present an acceptance sampling plan for machine replacement problem based on the backward dynamic programming model. Discount dynamic programming is used to solve a two-state machine replacement problem. We plan to design a model for maintenance by consid-ering the quality of the item produced. The purpose of the proposed model is to determine the optimal threshold policy for maintenance in a finite time horizon. We create a decision tree based on a sequential sampling inc...

  17. Dynamics and Determinants of Supplemental Nutrition Assistance Program Participation from 2008 to 2012

    OpenAIRE

    James Mabli; Thomas Godfrey; Nancy Wemmerus; Joshua Leftin; Stephen Tordella

    2014-01-01

    Mathematica nutrition experts recently conducted research on the dynamics and determinants of Supplemental Nutrition Assistance Program (SNAP) participation. A study examines SNAP participation dynamics between October 2008 and December 2012. In particular, it describes patterns of SNAP entry, length of time on the program, and re-entry for policy-relevant subgroups, and discusses how these patterns have changed over time. This work was conducted in conjunction with an analysis presented on t...

  18. Hybrid Approximate Dynamic Programming Approach for Dynamic Optimal Energy Flow in the Integrated Gas and Power Systems

    DEFF Research Database (Denmark)

    Shuai, Hang; Ai, Xiaomeng; Wen, Jinyu

    2017-01-01

    This paper proposes a hybrid approximate dynamic programming (ADP) approach for the multiple time-period optimal power flow in integrated gas and power systems. ADP successively solves Bellman's equation to make decisions according to the current state of the system. So, the updated near future...

  19. Computational Performance Analysis of Nonlinear Dynamic Systems using Semi-infinite Programming

    Directory of Open Access Journals (Sweden)

    Tor A. Johansen

    2001-01-01

    Full Text Available For nonlinear systems that satisfy certain regularity conditions it is shown that upper and lower bounds on the performance (cost function can be computed using linear or quadratic programming. The performance conditions derived from Hamilton-Jacobi inequalities are formulated as linear inequalities defined pointwise by discretizing the state-space when assuming a linearly parameterized class of functions representing the candidate performance bounds. Uncertainty with respect to some system parameters can be incorporated by also gridding the parameter set. In addition to performance analysis, the method can also be used to compute Lyapunov functions that guarantees uniform exponential stability.

  20. Dark energy from discrete spacetime.

    Directory of Open Access Journals (Sweden)

    Aaron D Trout

    Full Text Available Dark energy accounts for most of the matter-energy content of our universe, yet current theories of its origin rely on radical physical assumptions such as the holographic principle or controversial anthropic arguments. We give a better motivated explanation for dark energy, claiming that it arises from a small negative scalar-curvature present even in empty spacetime. The vacuum has this curvature because spacetime is fundamentally discrete and there are more ways for a discrete geometry to have negative curvature than positive. We explicitly compute this effect using a variant of the well known dynamical-triangulations (DT model for quantum gravity. Our model predicts a time-varying non-zero cosmological constant with a current value, [Formula: see text] in natural units, in agreement with observation. This calculation is made possible by a novel characterization of the possible DT action values combined with numerical evidence concerning their degeneracies.

  1. Dark energy from discrete spacetime.

    Science.gov (United States)

    Trout, Aaron D

    2013-01-01

    Dark energy accounts for most of the matter-energy content of our universe, yet current theories of its origin rely on radical physical assumptions such as the holographic principle or controversial anthropic arguments. We give a better motivated explanation for dark energy, claiming that it arises from a small negative scalar-curvature present even in empty spacetime. The vacuum has this curvature because spacetime is fundamentally discrete and there are more ways for a discrete geometry to have negative curvature than positive. We explicitly compute this effect using a variant of the well known dynamical-triangulations (DT) model for quantum gravity. Our model predicts a time-varying non-zero cosmological constant with a current value, [Formula: see text] in natural units, in agreement with observation. This calculation is made possible by a novel characterization of the possible DT action values combined with numerical evidence concerning their degeneracies.

  2. Bellman’s GAP—a language and compiler for dynamic programming in sequence analysis

    Science.gov (United States)

    Sauthoff, Georg; Möhl, Mathias; Janssen, Stefan; Giegerich, Robert

    2013-01-01

    Motivation: Dynamic programming is ubiquitous in bioinformatics. Developing and implementing non-trivial dynamic programming algorithms is often error prone and tedious. Bellman’s GAP is a new programming system, designed to ease the development of bioinformatics tools based on the dynamic programming technique. Results: In Bellman’s GAP, dynamic programming algorithms are described in a declarative style by tree grammars, evaluation algebras and products formed thereof. This bypasses the design of explicit dynamic programming recurrences and yields programs that are free of subscript errors, modular and easy to modify. The declarative modules are compiled into C++ code that is competitive to carefully hand-crafted implementations. This article introduces the Bellman’s GAP system and its language, GAP-L. It then demonstrates the ease of development and the degree of re-use by creating variants of two common bioinformatics algorithms. Finally, it evaluates Bellman’s GAP as an implementation platform of ‘real-world’ bioinformatics tools. Availability: Bellman’s GAP is available under GPL license from http://bibiserv.cebitec.uni-bielefeld.de/bellmansgap. This Web site includes a repository of re-usable modules for RNA folding based on thermodynamics. Contact: robert@techfak.uni-bielefeld.de Supplementary information: Supplementary data are available at Bioinformatics online PMID:23355290

  3. Bellman's GAP--a language and compiler for dynamic programming in sequence analysis.

    Science.gov (United States)

    Sauthoff, Georg; Möhl, Mathias; Janssen, Stefan; Giegerich, Robert

    2013-03-01

    Dynamic programming is ubiquitous in bioinformatics. Developing and implementing non-trivial dynamic programming algorithms is often error prone and tedious. Bellman's GAP is a new programming system, designed to ease the development of bioinformatics tools based on the dynamic programming technique. In Bellman's GAP, dynamic programming algorithms are described in a declarative style by tree grammars, evaluation algebras and products formed thereof. This bypasses the design of explicit dynamic programming recurrences and yields programs that are free of subscript errors, modular and easy to modify. The declarative modules are compiled into C++ code that is competitive to carefully hand-crafted implementations. This article introduces the Bellman's GAP system and its language, GAP-L. It then demonstrates the ease of development and the degree of re-use by creating variants of two common bioinformatics algorithms. Finally, it evaluates Bellman's GAP as an implementation platform of 'real-world' bioinformatics tools. Bellman's GAP is available under GPL license from http://bibiserv.cebitec.uni-bielefeld.de/bellmansgap. This Web site includes a repository of re-usable modules for RNA folding based on thermodynamics.

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

  5. Discrete breathers for a discrete nonlinear Schrödinger ring coupled to a central site.

    Science.gov (United States)

    Jason, Peter; Johansson, Magnus

    2016-01-01

    We examine the existence and properties of certain discrete breathers for a discrete nonlinear Schrödinger model where all but one site are placed in a ring and coupled to the additional central site. The discrete breathers we focus on are stationary solutions mainly localized on one or a few of the ring sites and possibly also the central site. By numerical methods, we trace out and study the continuous families the discrete breathers belong to. Our main result is the discovery of a split bifurcation at a critical value of the coupling between neighboring ring sites. Below this critical value, families form closed loops in a certain parameter space, implying that discrete breathers with and without central-site occupation belong to the same family. Above the split bifurcation the families split up into several separate ones, which bifurcate with solutions with constant ring amplitudes. For symmetry reasons, the families have different properties below the split bifurcation for even and odd numbers of sites. It is also determined under which conditions the discrete breathers are linearly stable. The dynamics of some simpler initial conditions that approximate the discrete breathers are also studied and the parameter regimes where the dynamics remain localized close to the initially excited ring site are related to the linear stability of the exact discrete breathers.

  6. Optimal blood glucose level control using dynamic programming based on minimal Bergman model

    Science.gov (United States)

    Rettian Anggita Sari, Maria; Hartono

    2018-03-01

    The purpose of this article is to simulate the glucose dynamic and the insulin kinetic of diabetic patient. The model used in this research is a non-linear Minimal Bergman model. Optimal control theory is then applied to formulate the problem in order to determine the optimal dose of insulin in the treatment of diabetes mellitus such that the glucose level is in the normal range for some specific time range. The optimization problem is solved using dynamic programming. The result shows that dynamic programming is quite reliable to represent the interaction between glucose and insulin levels in diabetes mellitus patient.

  7. Dynamics of WIC Program Participation by Infants and Children, 2001 to 2003. Final Report

    Science.gov (United States)

    Castner, Laura; Mabli, James; Sykes, Julie

    2009-01-01

    The Special Supplemental Nutrition Program for Women, Infants, and Children (WIC) provides nutritious foods that promote the health of low-income pregnant women, new mothers, infants, and preschool children. This study examines WIC participation dynamics of infants and children from 2001 to 2003 using the Survey of Income and Program Participation…

  8. Baecklund transformations for discrete Painleve equations: Discrete PII-PV

    International Nuclear Information System (INIS)

    Sakka, A.; Mugan, U.

    2006-01-01

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

  9. The Solar Dynamics Observatory (SDO) Education and Outreach (E/PO) Program: Changing Perceptions One Program at a Time

    Science.gov (United States)

    Drobnes, Emilie; Littleton, A.; Pesnell, William D.; Beck, K.; Buhr, S.; Durscher, R.; Hill, S.; McCaffrey, M.; McKenzie, D. E.; Myers, D.; hide

    2013-01-01

    We outline the context and overall philosophy for the combined Solar Dynamics Observatory (SDO) Education and Public Outreach (E/PO) program, present a brief overview of all SDO E/PO programs along with more detailed highlights of a few key programs, followed by a review of our results to date, conclude a summary of the successes, failures, and lessons learned, which future missions can use as a guide, while incorporating their own content to enhance the public's knowledge and appreciation of science and technology as well as its benefit to society.

  10. Discrete Gabor transform and discrete Zak transform

    NARCIS (Netherlands)

    Bastiaans, M.J.; Namazi, N.M.; Matthews, K.

    1996-01-01

    Gabor's expansion of a discrete-time signal into a set of shifted and modulated versions of an elementary signal or synthesis window is introduced, along with the inverse operation, i.e. the Gabor transform, which uses an analysis window that is related to the synthesis window and with the help of

  11. Discrete Mathematics Re "Tooled."

    Science.gov (United States)

    Grassl, Richard M.; Mingus, Tabitha T. Y.

    1999-01-01

    Indicates the importance of teaching discrete mathematics. Describes how the use of technology can enhance the teaching and learning of discrete mathematics. Explorations using Excel, Derive, and the TI-92 proved how preservice and inservice teachers experienced a new dimension in problem solving and discovery. (ASK)

  12. Numerical simulation of particle dynamics in storage rings using BETACOOL program

    International Nuclear Information System (INIS)

    Meshkov, I.N.; Pivin, R.V.; Sidorin, A.O.; Smirnov, A.V.; Trubnikov, G.V.

    2006-01-01

    BETACOOL program developed by JINR electron cooling group is a kit of algorithms based on common format of input and output files. The program is oriented to simulation of the ion beam dynamics in a storage ring in the presence of cooling and heating effects. The version presented in this report includes three basic algorithms: simulation of rms parameters of the ion distribution function evolution in time, simulation of the distribution function evolution using Monte-Carlo method and tracking algorithm based on molecular dynamics technique. General processes to be investigated with the program are intrabeam scattering in the ion beam, electron cooling, interaction with residual gas and internal target

  13. Homogenization of discrete media

    International Nuclear Information System (INIS)

    Pradel, F.; Sab, K.

    1998-01-01

    Material such as granular media, beam assembly are easily seen as discrete media. They look like geometrical points linked together thanks to energetic expressions. Our purpose is to extend discrete kinematics to the one of an equivalent continuous material. First we explain how we build the localisation tool for periodic materials according to estimated continuum medium type (classical Cauchy, and Cosserat media). Once the bridge built between discrete and continuum media, we exhibit its application over two bidimensional beam assembly structures : the honey comb and a structural reinforced variation. The new behavior is then applied for the simple plan shear problem in a Cosserat continuum and compared with the real discrete solution. By the mean of this example, we establish the agreement of our new model with real structures. The exposed method has a longer range than mechanics and can be applied to every discrete problems like electromagnetism in which relationship between geometrical points can be summed up by an energetic function. (orig.)

  14. Discrete density of states

    International Nuclear Information System (INIS)

    Aydin, Alhun; Sisman, Altug

    2016-01-01

    By considering the quantum-mechanically minimum allowable energy interval, we exactly count number of states (NOS) and introduce discrete density of states (DOS) concept for a particle in a box for various dimensions. Expressions for bounded and unbounded continua are analytically recovered from discrete ones. Even though substantial fluctuations prevail in discrete DOS, they're almost completely flattened out after summation or integration operation. It's seen that relative errors of analytical expressions of bounded/unbounded continua rapidly decrease for high NOS values (weak confinement or high energy conditions), while the proposed analytical expressions based on Weyl's conjecture always preserve their lower error characteristic. - Highlights: • Discrete density of states considering minimum energy difference is proposed. • Analytical DOS and NOS formulas based on Weyl conjecture are given. • Discrete DOS and NOS functions are examined for various dimensions. • Relative errors of analytical formulas are much better than the conventional ones.

  15. Discrete density of states

    Energy Technology Data Exchange (ETDEWEB)

    Aydin, Alhun; Sisman, Altug, E-mail: sismanal@itu.edu.tr

    2016-03-22

    By considering the quantum-mechanically minimum allowable energy interval, we exactly count number of states (NOS) and introduce discrete density of states (DOS) concept for a particle in a box for various dimensions. Expressions for bounded and unbounded continua are analytically recovered from discrete ones. Even though substantial fluctuations prevail in discrete DOS, they're almost completely flattened out after summation or integration operation. It's seen that relative errors of analytical expressions of bounded/unbounded continua rapidly decrease for high NOS values (weak confinement or high energy conditions), while the proposed analytical expressions based on Weyl's conjecture always preserve their lower error characteristic. - Highlights: • Discrete density of states considering minimum energy difference is proposed. • Analytical DOS and NOS formulas based on Weyl conjecture are given. • Discrete DOS and NOS functions are examined for various dimensions. • Relative errors of analytical formulas are much better than the conventional ones.

  16. Discrete control systems

    CERN Document Server

    Okuyama, Yoshifumi

    2014-01-01

    Discrete Control Systems establishes a basis for the analysis and design of discretized/quantized control systemsfor continuous physical systems. Beginning with the necessary mathematical foundations and system-model descriptions, the text moves on to derive a robust stability condition. To keep a practical perspective on the uncertain physical systems considered, most of the methods treated are carried out in the frequency domain. As part of the design procedure, modified Nyquist–Hall and Nichols diagrams are presented and discretized proportional–integral–derivative control schemes are reconsidered. Schemes for model-reference feedback and discrete-type observers are proposed. Although single-loop feedback systems form the core of the text, some consideration is given to multiple loops and nonlinearities. The robust control performance and stability of interval systems (with multiple uncertainties) are outlined. Finally, the monograph describes the relationship between feedback-control and discrete ev...

  17. Discrete repulsive oscillator wavefunctions

    International Nuclear Information System (INIS)

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

    2009-01-01

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

  18. Discrete Element Modeling

    Energy Technology Data Exchange (ETDEWEB)

    Morris, J; Johnson, S

    2007-12-03

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

  19. Applied geometry and discrete mathematics

    CERN Document Server

    Sturm; Gritzmann, Peter; Sturmfels, Bernd

    1991-01-01

    This volume, published jointly with the Association for Computing Machinery, comprises a collection of research articles celebrating the occasion of Victor Klee's sixty-fifth birthday in September 1990. During his long career, Klee has made contributions to a wide variety of areas, such as discrete and computational geometry, convexity, combinatorics, graph theory, functional analysis, mathematical programming and optimization, and theoretical computer science. In addition, Klee made important contributions to mathematics education, mathematical methods in economics and the decision sciences, applications of discrete mathematics in the biological and social sciences, and the transfer of knowledge from applied mathematics to industry. In honor of Klee's achievements, this volume presents more than forty papers on topics related to Klee's research. While the majority of the papers are research articles, a number of survey articles are also included. Mirroring the breadth of Klee's mathematical contributions, th...

  20. Discrete mathematics using a computer

    CERN Document Server

    Hall, Cordelia

    2000-01-01

    Several areas of mathematics find application throughout computer science, and all students of computer science need a practical working understanding of them. These core subjects are centred on logic, sets, recursion, induction, relations and functions. The material is often called discrete mathematics, to distinguish it from the traditional topics of continuous mathematics such as integration and differential equations. The central theme of this book is the connection between computing and discrete mathematics. This connection is useful in both directions: • Mathematics is used in many branches of computer science, in applica­ tions including program specification, datastructures,design and analysis of algorithms, database systems, hardware design, reasoning about the correctness of implementations, and much more; • Computers can help to make the mathematics easier to learn and use, by making mathematical terms executable, making abstract concepts more concrete, and through the use of software tools su...

  1. Perfect discretization of reparametrization invariant path integrals

    International Nuclear Information System (INIS)

    Bahr, Benjamin; Dittrich, Bianca; Steinhaus, Sebastian

    2011-01-01

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

  2. Perfect discretization of reparametrization invariant path integrals

    Science.gov (United States)

    Bahr, Benjamin; Dittrich, Bianca; Steinhaus, Sebastian

    2011-05-01

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

  3. Transient dynamic and inelastic analysis of shells of revolution - a survey of programs

    International Nuclear Information System (INIS)

    Svalbonas, V.

    1976-01-01

    Advances in the limits of structural use in the aerospace and nuclear power industries over the past years have increased the requirements upon the applicable analytical computer programs to include accurate capabilities for inelastic and transient dynamic analyses. In many minds, however, this advanced capability is unequivocally linked with the large scale, general purpose, finite element programs. This idea is also combined with the view that such analyses are therefore prohibitively expensive and should be relegated to the 'last resort' classification. While this, in the general sense, may indeed be the case, if the user needs only to analyze structures falling into limited categories, however, he may find that a variety of smaller special purpose programs are available which do not put an undue strain upon his resources. One such structural category is shells of revolution. This survey of programs concentrates upon the analytical tools which have been developed predominantly for shells of revolution. The survey is subdivided into three parts: (a) consideration of programs for transient dynamic analysis; (b) consideration of programs for inelastic analysis and finally; (c) consideration of programs capable of dynamic plasticity analysis. In each part, programs based upon finite difference, finite element, and numerical integration methods are considered. The programs are compared on the basis of analytical capabilities, and ease of idealization and use. In each part of the survey sample problems are utilized to exemplify the state-of-the-art. (Auth.)

  4. Applied Behavior Analysis: Beyond Discrete Trial Teaching

    Science.gov (United States)

    Steege, Mark W.; Mace, F. Charles; Perry, Lora; Longenecker, Harold

    2007-01-01

    We discuss the problem of autism-specific special education programs representing themselves as Applied Behavior Analysis (ABA) programs when the only ABA intervention employed is Discrete Trial Teaching (DTT), and often for limited portions of the school day. Although DTT has many advantages to recommend its use, it is not well suited to teach…

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

  6. A discrete control model of PLANT

    Science.gov (United States)

    Mitchell, C. M.

    1985-01-01

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

  7. A stochastic programming approach to manufacturing flow control

    OpenAIRE

    Haurie, Alain; Moresino, Francesco

    2012-01-01

    This paper proposes and tests an approximation of the solution of a class of piecewise deterministic control problems, typically used in the modeling of manufacturing flow processes. This approximation uses a stochastic programming approach on a suitably discretized and sampled system. The method proceeds through two stages: (i) the Hamilton-Jacobi-Bellman (HJB) dynamic programming equations for the finite horizon continuous time stochastic control problem are discretized over a set of sample...

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

  9. A comparison of the lattice discrete particle method to the finite-element method and the K&C material model for simulating the static and dynamic response of concrete.

    Energy Technology Data Exchange (ETDEWEB)

    Smith, Jovanca J.; Bishop, Joseph E.

    2013-11-01

    This report summarizes the work performed by the graduate student Jovanca Smith during a summer internship in the summer of 2012 with the aid of mentor Joe Bishop. The projects were a two-part endeavor that focused on the use of the numerical model called the Lattice Discrete Particle Model (LDPM). The LDPM is a discrete meso-scale model currently used at Northwestern University and the ERDC to model the heterogeneous quasi-brittle material, concrete. In the first part of the project, LDPM was compared to the Karagozian and Case Concrete Model (K&C) used in Presto, an explicit dynamics finite-element code, developed at Sandia National Laboratories. In order to make this comparison, a series of quasi-static numerical experiments were performed, namely unconfined uniaxial compression tests on four varied cube specimen sizes, three-point bending notched experiments on three proportional specimen sizes, and six triaxial compression tests on a cylindrical specimen. The second part of this project focused on the application of LDPM to simulate projectile perforation on an ultra high performance concrete called CORTUF. This application illustrates the strengths of LDPM over traditional continuum models.

  10. Do Developmental Mathematics Programs Have a Causal Impact on Student Retention? An Application of Discrete-Time Survival and Regression-Discontinuity Analysis

    Science.gov (United States)

    Lesik, Sally A.

    2007-01-01

    The impact of academic programs--such as developmental mathematics programs--on student retention, has been a controversial topic for administrators, policy makers, and faculty in higher education. Despite deep interest in the effectiveness of these programs in retaining students, scholars have been unable to determine whether such programs have a…

  11. Discrete Calculus by Analogy

    CERN Document Server

    Izadi, F A; Bagirov, G

    2009-01-01

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

  12. A Case for Dynamic Reverse-code Generation to Debug Non-deterministic Programs

    Directory of Open Access Journals (Sweden)

    Jooyong Yi

    2013-09-01

    Full Text Available Backtracking (i.e., reverse execution helps the user of a debugger to naturally think backwards along the execution path of a program, and thinking backwards makes it easy to locate the origin of a bug. So far backtracking has been implemented mostly by state saving or by checkpointing. These implementations, however, inherently do not scale. Meanwhile, a more recent backtracking method based on reverse-code generation seems promising because executing reverse code can restore the previous states of a program without state saving. In the literature, there can be found two methods that generate reverse code: (a static reverse-code generation that pre-generates reverse code through static analysis before starting a debugging session, and (b dynamic reverse-code generation that generates reverse code by applying dynamic analysis on the fly during a debugging session. In particular, we espoused the latter one in our previous work to accommodate non-determinism of a program caused by e.g., multi-threading. To demonstrate the usefulness of our dynamic reverse-code generation, this article presents a case study of various backtracking methods including ours. We compare the memory usage of various backtracking methods in a simple but nontrivial example, a bounded-buffer program. In the case of non-deterministic programs such as this bounded-buffer program, our dynamic reverse-code generation outperforms the existing backtracking methods in terms of memory efficiency.

  13. BEAMPATH: a program library for beam dynamics simulation in linear accelerators

    International Nuclear Information System (INIS)

    Batygin, Y.K.

    1992-01-01

    A structured programming technique was used to develop software for space charge dominated beams investigation in linear accelerators. The method includes hierarchical program design using program independent modules and a flexible combination of modules to provide a most effective version of structure for every specific case of simulation. A modular program BEAMPATH was developed for 2D and 3D particle-in-cell simulation of beam dynamics in a structure containing RF gaps, radio-frequency quadrupoles (RFQ), multipole lenses, waveguides, bending magnets and solenoids. (author) 5 refs.; 2 figs

  14. Is Fitts' law continuous in discrete aiming?

    Directory of Open Access Journals (Sweden)

    Rita Sleimen-Malkoun

    Full Text Available The lawful continuous linear relation between movement time and task difficulty (i.e., index of difficulty; ID in a goal-directed rapid aiming task (Fitts' law has been recently challenged in reciprocal performance. Specifically, a discontinuity was observed at critical ID and was attributed to a transition between two distinct dynamic regimes that occurs with increasing difficulty. In the present paper, we show that such a discontinuity is also present in discrete aiming when ID is manipulated via target width (experiment 1 but not via target distance (experiment 2. Fitts' law's discontinuity appears, therefore, to be a suitable indicator of the underlying functional adaptations of the neuro-muscular-skeletal system to task properties/requirements, independently of reciprocal or discrete nature of the task. These findings open new perspectives to the study of dynamic regimes involved in discrete aiming and sensori-motor mechanisms underlying the speed-accuracy trade-off.

  15. Endocardium and Epicardium Segmentation in MR Images Based on Developed Otsu and Dynamic Programming

    Directory of Open Access Journals (Sweden)

    Shengzhou XU

    2014-03-01

    Full Text Available In order to accurately extract the endocardium and epicardium of the left ventricle from cardiac magnetic resonance (MR images, a method based on developed Otsu and dynamic programming has been proposed. First, regions with high gray value are divided into several left ventricle candidate regions by the developed Otsu algorithm, which based on constraining the search range of the ideal segmentation threshold. Then, left ventricular blood pool is selected from the candidate regions and its convex hull is found out as the endocardium. The epicardium is derived by applying dynamic programming method to find a closed path with minimum local cost. The local cost function of the dynamic programming method consists of two factors: boundary gradient and shape features. In order to improve the accuracy of segmentation, a non-maxima gradient suppression technique is adopted to get the boundary gradient. The experimental result of 138 MR images show that the method proposed has high accuracy and robustness.

  16. Compatible Spatial Discretizations for Partial Differential Equations

    Energy Technology Data Exchange (ETDEWEB)

    Arnold, Douglas, N, ed.

    2004-11-25

    simulations. + Identification and design of compatible spatial discretizations of PDEs, their classification, analysis, and relations. + Relationships between different compatible spatial discretization methods and concepts which have been developed; + Impact of compatible spatial discretizations upon physical fidelity, verification and validation of simulations, especially in large-scale, multiphysics settings. + How solvers address the demands placed upon them by compatible spatial discretizations. This report provides information about the program and abstracts of all the presentations.

  17. Computationally efficient dynamic modeling of robot manipulators with multiple flexible-links using acceleration-based discrete time transfer matrix method

    DEFF Research Database (Denmark)

    Zhang, Xuping; Sørensen, Rasmus; RahbekIversen, Mathias

    2018-01-01

    This paper presents a novel and computationally efficient modeling method for the dynamics of flexible-link robot manipulators. In this method, a robot manipulator is decomposed into components/elements. The component/element dynamics is established using Newton–Euler equations, and then is linea......This paper presents a novel and computationally efficient modeling method for the dynamics of flexible-link robot manipulators. In this method, a robot manipulator is decomposed into components/elements. The component/element dynamics is established using Newton–Euler equations......, and then is linearized based on the acceleration-based state vector. The transfer matrices for each type of components/elements are developed, and used to establish the system equations of a flexible robot manipulator by concatenating the state vector from the base to the end-effector. With this strategy, the size...... manipulators, and only involves calculating and transferring component/element dynamic equations that have small size. The numerical simulations and experimental testing of flexible-link manipulators are conducted to validate the proposed methodologies....

  18. Reflectionless discrete Schr\\"odinger operators are spectrally atypical

    OpenAIRE

    VandenBoom, Tom

    2017-01-01

    We prove that, if an isospectral torus contains a discrete Schr\\"odinger operator with nonconstant potential, the shift dynamics on that torus cannot be minimal. Consequently, we specify a generic sense in which finite unions of nondegenerate closed intervals having capacity one are not the spectrum of any reflectionless discrete Schr\\"odinger operator. We also show that the only reflectionless discrete Schr\\"odinger operators having zero, one, or two spectral gaps are periodic.

  19. Reflectionless Discrete Schrödinger Operators are Spectrally Atypical

    Science.gov (United States)

    VandenBoom, Tom

    2017-12-01

    We prove that, if an isospectral torus contains a discrete Schrödinger operator with nonconstant potential, the shift dynamics on that torus cannot be minimal. Consequently, we specify a generic sense in which finite unions of nondegenerate closed intervals having capacity one are not the spectrum of any reflectionless discrete Schrödinger operator. We also show that the only reflectionless discrete Schrödinger operators having zero, one, or two spectral gaps are periodic.

  20. Finite Discrete Gabor Analysis

    DEFF Research Database (Denmark)

    Søndergaard, Peter Lempel

    2007-01-01

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