Comparison of the performance of the activPAL Professional physical activity logger to a discrete accelerometer-based activity monitor.

PubMed

Godfrey, A; Culhane, K M; Lyons, G M

2007-10-01

The aim of this study was to assess the accuracy of the 'activPAL Professional' physical activity logger by comparing its output to that of a proven discrete accelerometer-based activity monitor during extended measurements on healthy subjects while performing activities of daily living (ADL). Ten healthy adults, with unrestricted mobility, wore both the activPAL and the discrete dual accelerometer (Analog Devices ADXL202)-based activity monitor that recorded in synchronization with each other. The accelerometer derived data were then compared to that generated by the activPAL and a complete statistical and error analysis was performed using a Matlab program. This program determined trunk and thigh inclination angles to distinguish between sitting/lying, standing and stepping for the discrete accelerometer device and amount of time spent on each activity. Analysis was performed on a second-by-second basis and then categorized at 15s intervals in direct comparison with the activPAL generated data. Of the total time monitored (approximately 60 h) the detection accuracies for static and dynamic activities were approximately 98%. In a population of healthy adults, the data obtained from the activPAL Professional physical activity logger for both static and dynamic activities showed a close match to a proven discrete accelerometer data with an offset of approximately 2% between the two systems.

Problem of two-level hierarchical minimax program control the final state of regional social and economic system in the presence of risks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Shorikov, A. F., E-mail: afshorikov@mail.ru

This article discusses a discrete-time dynamical system consisting of a set a controllable objects (region and forming it municipalities). The dynamics each of these is described by the corresponding vector nonlinear discrete-time recurrent vector equations and its control system consist from two levels: basic (control level I) that is dominating and subordinate level (control level II). Both levels have different criterions of functioning and united a priori by determined informational and control connections defined in advance. In this paper we study the problem of optimization of guaranteed result for program control by the final state of regional social and economicmore » system in the presence of risks. For this problem we proposed in this work an economical and mathematical model of two-level hierarchical minimax program control the final state of regional social and economic system in the presence of risks and the general scheme for its solving.« less

Problem of two-level hierarchical minimax program control the final state of regional social and economic system with incomplete information

NASA Astrophysics Data System (ADS)

Shorikov, A. F.

2016-12-01

In this article we consider a discrete-time dynamical system consisting of a set a controllable objects (region and forming it municipalities). The dynamics each of these is described by the corresponding linear or nonlinear discrete-time recurrent vector relations and its control system consist from two levels: basic level (control level I) that is dominating level and auxiliary level (control level II) that is subordinate level. Both levels have different criterions of functioning and united by information and control connections which defined in advance. In this article we study the problem of optimization of guaranteed result for program control by the final state of regional social and economic system in the presence of risks vectors. For this problem we propose a mathematical model in the form of two-level hierarchical minimax program control problem of the final states of this system with incomplete information and the general scheme for its solving.

Cooperative Networked Control of Dynamical Peer-to-Peer Vehicle Systems

DTIC Science & Technology

2007-12-28

dynamic deployment and task allocation;verification and hybrid systems; and information management for cooperative control. The activity of the...32 5.3 Decidability Results on Discrete and Hybrid Systems ...... .................. 33 5.4 Switched Systems...solved. Verification and hybrid systems. The program has produced significant advances in the theory of hybrid input-output automata, (HIOA) and the

WavePacket: A Matlab package for numerical quantum dynamics. I: Closed quantum systems and discrete variable representations

NASA Astrophysics Data System (ADS)

Schmidt, Burkhard; Lorenz, Ulf

2017-04-01

WavePacket is an open-source program package for the numerical simulation of quantum-mechanical dynamics. It can be used to solve time-independent or time-dependent linear Schrödinger and Liouville-von Neumann-equations in one or more dimensions. Also coupled equations can be treated, which allows to simulate molecular quantum dynamics beyond the Born-Oppenheimer approximation. Optionally accounting for the interaction with external electric fields within the semiclassical dipole approximation, WavePacket can be used to simulate experiments involving tailored light pulses in photo-induced physics or chemistry. The graphical capabilities allow visualization of quantum dynamics 'on the fly', including Wigner phase space representations. Being easy to use and highly versatile, WavePacket is well suited for the teaching of quantum mechanics as well as for research projects in atomic, molecular and optical physics or in physical or theoretical chemistry. The present Part I deals with the description of closed quantum systems in terms of Schrödinger equations. The emphasis is on discrete variable representations for spatial discretization as well as various techniques for temporal discretization. The upcoming Part II will focus on open quantum systems and dimension reduction; it also describes the codes for optimal control of quantum dynamics. The present work introduces the MATLAB version of WavePacket 5.2.1 which is hosted at the Sourceforge platform, where extensive Wiki-documentation as well as worked-out demonstration examples can be found.

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

PubMed

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.

Adaptive dynamic programming for finite-horizon optimal control of discrete-time nonlinear systems with ε-error bound.

PubMed

Wang, Fei-Yue; Jin, Ning; Liu, Derong; Wei, Qinglai

2011-01-01

In this paper, we study the finite-horizon optimal control problem for discrete-time nonlinear systems using the adaptive dynamic programming (ADP) approach. The idea is to use an iterative ADP algorithm to obtain the optimal control law which makes the performance index function close to the greatest lower bound of all performance indices within an ε-error bound. The optimal number of control steps can also be obtained by the proposed ADP algorithms. A convergence analysis of the proposed ADP algorithms in terms of performance index function and control policy is made. In order to facilitate the implementation of the iterative ADP algorithms, neural networks are used for approximating the performance index function, computing the optimal control policy, and modeling the nonlinear system. Finally, two simulation examples are employed to illustrate the applicability of the proposed method.

Image compression system and method having optimized quantization tables

NASA Technical Reports Server (NTRS)

Ratnakar, Viresh (Inventor); Livny, Miron (Inventor)

1998-01-01

A digital image compression preprocessor for use in a discrete cosine transform-based digital image compression device is provided. The preprocessor includes a gathering mechanism for determining discrete cosine transform statistics from input digital image data. A computing mechanism is operatively coupled to the gathering mechanism to calculate a image distortion array and a rate of image compression array based upon the discrete cosine transform statistics for each possible quantization value. A dynamic programming mechanism is operatively coupled to the computing mechanism to optimize the rate of image compression array against the image distortion array such that a rate-distortion-optimal quantization table is derived. In addition, a discrete cosine transform-based digital image compression device and a discrete cosine transform-based digital image compression and decompression system are provided. Also, a method for generating a rate-distortion-optimal quantization table, using discrete cosine transform-based digital image compression, and operating a discrete cosine transform-based digital image compression and decompression system are provided.

A Polyhedral Outer-approximation, Dynamic-discretization optimization solver, 1.x

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bent, Rusell; Nagarajan, Harsha; Sundar, Kaarthik

2017-09-25

In this software, we implement an adaptive, multivariate partitioning algorithm for solving mixed-integer nonlinear programs (MINLP) to global optimality. The algorithm combines ideas that exploit the structure of convex relaxations to MINLPs and bound tightening procedures

Different-Level Simultaneous Minimization Scheme for Fault Tolerance of Redundant Manipulator Aided with Discrete-Time Recurrent Neural Network

PubMed Central

Jin, Long; Liao, Bolin; Liu, Mei; Xiao, Lin; Guo, Dongsheng; Yan, Xiaogang

2017-01-01

By incorporating the physical constraints in joint space, a different-level simultaneous minimization scheme, which takes both the robot kinematics and robot dynamics into account, is presented and investigated for fault-tolerant motion planning of redundant manipulator in this paper. The scheme is reformulated as a quadratic program (QP) with equality and bound constraints, which is then solved by a discrete-time recurrent neural network. Simulative verifications based on a six-link planar redundant robot manipulator substantiate the efficacy and accuracy of the presented acceleration fault-tolerant scheme, the resultant QP and the corresponding discrete-time recurrent neural network. PMID:28955217

Time Warp Operating System, Version 2.5.1

NASA Technical Reports Server (NTRS)

Bellenot, Steven F.; Gieselman, John S.; Hawley, Lawrence R.; Peterson, Judy; Presley, Matthew T.; Reiher, Peter L.; Springer, Paul L.; Tupman, John R.; Wedel, John J., Jr.; Wieland, Frederick P.;

The Solar Dynamics Observatory Education and Public Outreach Program: The First Years

NASA Astrophysics Data System (ADS)

Wawro, M.; Drobnes, E.; van Doren, A.; Scherrer, D. K.

2010-12-01

The Solar Dynamics Observatory (SDO) Education and Public Outreach (E/PO) program began as a series of discrete programs implemented by each of the instrument teams and has evolved into a well-rounded program with a full suite of national and international programs: student, teacher, and journalist workshops, international research programs, family programs, etc. In this presentation, we provide an overview of our philosophy and approach and of some of the programs developed and implemented prior to launch. In conclusion we will summarize our successes, our failures, our lessons learned, and present guiding principles in the hope that future missions will use our platform as a guide to build upon for future programs, incorporating their own content to enhance the public's appreciation of the science that NASA does and its benefit to society.

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

PubMed

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.

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

PubMed

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.

A biologically inspired neural network for dynamic programming.

PubMed

Francelin Romero, R A; Kacpryzk, J; Gomide, F

2001-12-01

An artificial neural network with a two-layer feedback topology and generalized recurrent neurons, for solving nonlinear discrete dynamic optimization problems, is developed. A direct method to assign the weights of neural networks is presented. The method is based on Bellmann's Optimality Principle and on the interchange of information which occurs during the synaptic chemical processing among neurons. The neural network based algorithm is an advantageous approach for dynamic programming due to the inherent parallelism of the neural networks; further it reduces the severity of computational problems that can occur in methods like conventional methods. Some illustrative application examples are presented to show how this approach works out including the shortest path and fuzzy decision making problems.

Nonlinear Light Dynamics in Multi-Core Structures

DTIC Science & Technology

2017-02-27

be generated in continuous- discrete optical media such as multi-core optical fiber or waveguide arrays; localisation dynamics in a continuous... discrete nonlinear system. Detailed theoretical analysis is presented of the existence and stability of the discrete -continuous light bullets using a very...and pulse compression using wave collapse (self-focusing) energy localisation dynamics in a continuous- discrete nonlinear system, as implemented in a

DynamO: a free O(N) general event-driven molecular dynamics simulator.

PubMed

Bannerman, M N; Sargant, R; Lue, L

2011-11-30

Molecular dynamics algorithms for systems of particles interacting through discrete or "hard" potentials are fundamentally different to the methods for continuous or "soft" potential systems. Although many software packages have been developed for continuous potential systems, software for discrete potential systems based on event-driven algorithms are relatively scarce and specialized. We present DynamO, a general event-driven simulation package, which displays the optimal O(N) asymptotic scaling of the computational cost with the number of particles N, rather than the O(N) scaling found in most standard algorithms. DynamO provides reference implementations of the best available event-driven algorithms. These techniques allow the rapid simulation of both complex and large (>10(6) particles) systems for long times. The performance of the program is benchmarked for elastic hard sphere systems, homogeneous cooling and sheared inelastic hard spheres, and equilibrium Lennard-Jones fluids. This software and its documentation are distributed under the GNU General Public license and can be freely downloaded from http://marcusbannerman.co.uk/dynamo. Copyright © 2011 Wiley Periodicals, Inc.

Rocket ascent G-limited moment-balanced optimization program (RAGMOP)

NASA Technical Reports Server (NTRS)

Lyons, J. T.; Woltosz, W. S.; Abercrombie, G. E.; Gottlieb, R. G.

1972-01-01

This document describes the RAGMOP (Rocket Ascent G-limited Momentbalanced Optimization Program) computer program for parametric ascent trajectory optimization. RAGMOP computes optimum polynomial-form attitude control histories, launch azimuth, engine burn-time, and gross liftoff weight for space shuttle type vehicles using a search-accelerated, gradient projection parameter optimization technique. The trajectory model available in RAGMOP includes a rotating oblate earth model, the option of input wind tables, discrete and/or continuous throttling for the purposes of limiting the thrust acceleration and/or the maximum dynamic pressure, limitation of the structural load indicators (the product of dynamic pressure with angle-of-attack and sideslip angle), and a wide selection of intermediate and terminal equality constraints.

An Interactive Tool for Discrete Phase Analysis in Two-Phase Flows

NASA Technical Reports Server (NTRS)

Dejong, Frederik J.; Thoren, Stephen J.

1993-01-01

Under a NASA MSFC SBIR Phase 1 effort an interactive software package has been developed for the analysis of discrete (particulate) phase dynamics in two-phase flows in which the discrete phase does not significantly affect the continuous phase. This package contains a Graphical User Interface (based on the X Window system and the Motif tool kit) coupled to a particle tracing program, which allows the user to interactively set up and run a case for which a continuous phase grid and flow field are available. The software has been applied to a solid rocket motor problem, to demonstrate its ease of use and its suitability for problems of engineering interest, and has been delivered to NASA Marshall Space Flight Center.

Space station dynamics, attitude control and momentum management

NASA Technical Reports Server (NTRS)

Sunkel, John W.; Singh, Ramen P.; Vengopal, Ravi

1989-01-01

The Space Station Attitude Control System software test-bed provides a rigorous environment for the design, development and functional verification of GN and C algorithms and software. The approach taken for the simulation of the vehicle dynamics and environmental models using a computationally efficient algorithm is discussed. The simulation includes capabilities for docking/berthing dynamics, prescribed motion dynamics associated with the Mobile Remote Manipulator System (MRMS) and microgravity disturbances. The vehicle dynamics module interfaces with the test-bed through the central Communicator facility which is in turn driven by the Station Control Simulator (SCS) Executive. The Communicator addresses issues such as the interface between the discrete flight software and the continuous vehicle dynamics, and multi-programming aspects such as the complex flow of control in real-time programs. Combined with the flight software and redundancy management modules, the facility provides a flexible, user-oriented simulation platform.

Paintbrush of Discovery: Using Java Applets to Enhance Mathematics Education

ERIC Educational Resources Information Center

Eason, Ray; Heath, Garrett

2004-01-01

This article addresses the enhancement of the learning environment by using Java applets in the mathematics classroom. Currently, the first year mathematics program at the United States Military Academy involves one semester of modeling with discrete dynamical systems (DDS). Several faculty members from the Academy have integrated Java applets…

Welfare Reform when Recipients Are Forward-Looking

ERIC Educational Resources Information Center

Swann, Christopher A.

2005-01-01

By studying recipients of aid under the Temporary Assistance for Needy Families (TANF) welfare scheme, the effect of time limits of welfare schemes on forward looking recipients is assessed using a discrete-choice dynamic programming framework model. The policy simulations for the preferred specification of utility reveal that two year time limits…

Dynamical quantum phase transitions in discrete time crystals

NASA Astrophysics Data System (ADS)

Kosior, Arkadiusz; Sacha, Krzysztof

2018-05-01

Discrete time crystals are related to nonequilibrium dynamics of periodically driven quantum many-body systems where the discrete time-translation symmetry of the Hamiltonian is spontaneously broken into another discrete symmetry. Recently, the concept of phase transitions has been extended to nonequilibrium dynamics of time-independent systems induced by a quantum quench, i.e., a sudden change of some parameter of the Hamiltonian. There, the return probability of a system to the ground state reveals singularities in time which are dubbed dynamical quantum phase transitions. We show that the quantum quench in a discrete time crystal leads to dynamical quantum phase transitions where the return probability of a periodically driven system to a Floquet eigenstate before the quench reveals singularities in time. It indicates that dynamical quantum phase transitions are not restricted to time-independent systems and can be also observed in systems that are periodically driven. We discuss how the phenomenon can be observed in ultracold atomic gases.

Logic integer programming models for signaling networks.

PubMed

Haus, Utz-Uwe; Niermann, Kathrin; Truemper, Klaus; Weismantel, Robert

2009-05-01

We propose a static and a dynamic approach to model biological signaling networks, and show how each can be used to answer relevant biological questions. For this, we use the two different mathematical tools of Propositional Logic and Integer Programming. The power of discrete mathematics for handling qualitative as well as quantitative data has so far not been exploited in molecular biology, which is mostly driven by experimental research, relying on first-order or statistical models. The arising logic statements and integer programs are analyzed and can be solved with standard software. For a restricted class of problems the logic models reduce to a polynomial-time solvable satisfiability algorithm. Additionally, a more dynamic model enables enumeration of possible time resolutions in poly-logarithmic time. Computational experiments are included.

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

NASA Astrophysics Data System (ADS)

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.

Joint Chance-Constrained Dynamic Programming

NASA Technical Reports Server (NTRS)

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.

Analysis of Structures with Rotating, Flexible Substructures Applied to Rotorcraft Aeroelasticity in GRASP (General Rotorcraft Aeromechanical Stability Program),

DTIC Science & Technology

1987-01-01

two nodes behave identically. In GRASP, these constraints are entirely invisible from the user’s point of view. GRASP (Recall that the Levi - Civita ...virtual rotation GRASP is the first program implementing a new methodWl( = Levi -Ciudta symbol op for dynamic analysis of structures, parts of which may...natural coordinatization of sis for this methodology, which incorporates body flexibility components. with the large discrete motions previously

Non-Lipschitz Dynamics Approach to Discrete Event Systems

NASA Technical Reports Server (NTRS)

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.

Pluralistic Programming and Radio Diversity: A Review and a Proposal.

ERIC Educational Resources Information Center

Jassem, Harvey C.; And Others

Of all the mass media, radio is the most abundant, both in terms of the number of radio stations in operation and the number of radio receivers in use. Unfortunately, given the dynamics of a competitive market and the Federal Communications Commission's reluctance to interfere with a licensee's discretion in the choice of format, format…

Multiscale modeling of dislocation-precipitate interactions in Fe: From molecular dynamics to discrete dislocations.

PubMed

Lehtinen, Arttu; Granberg, Fredric; Laurson, Lasse; Nordlund, Kai; Alava, Mikko J

2016-01-01

The stress-driven motion of dislocations in crystalline solids, and thus the ensuing plastic deformation process, is greatly influenced by the presence or absence of various pointlike defects such as precipitates or solute atoms. These defects act as obstacles for dislocation motion and hence affect the mechanical properties of the material. Here we combine molecular dynamics studies with three-dimensional discrete dislocation dynamics simulations in order to model the interaction between different kinds of precipitates and a 1/2〈111〉{110} edge dislocation in BCC iron. We have implemented immobile spherical precipitates into the ParaDis discrete dislocation dynamics code, with the dislocations interacting with the precipitates via a Gaussian potential, generating a normal force acting on the dislocation segments. The parameters used in the discrete dislocation dynamics simulations for the precipitate potential, the dislocation mobility, shear modulus, and dislocation core energy are obtained from molecular dynamics simulations. We compare the critical stresses needed to unpin the dislocation from the precipitate in molecular dynamics and discrete dislocation dynamics simulations in order to fit the two methods together and discuss the variety of the relevant pinning and depinning mechanisms.

Terminal Dynamics Approach to Discrete Event Systems

NASA Technical Reports Server (NTRS)

Zak, Michail; Meyers, Ronald

1995-01-01

This paper presents and discusses a mathematical formalism for simulation of discrete event dynamic (DED)-a special type of 'man-made' systems to serve specific purposes of information processing. The main objective of this work is to demonstrate that the mathematical formalism for DED can be based upon a terminal model of Newtonian dynamics which allows one to relax Lipschitz conditions at some discrete points.!.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Khrennikov, Andrei; Volovich, Yaroslav

We analyze dynamical consequences of a conjecture that there exists a fundamental (indivisible) quant of time. In particular we study the problem of discrete energy levels of hydrogen atom. We are able to reconstruct potential which in discrete time formalism leads to energy levels of unperturbed hydrogen atom. We also consider linear energy levels of quantum harmonic oscillator and show how they are produced in the discrete time formalism. More generally, we show that in discrete time formalism finite motion in central potential leads to discrete energy spectrum, the property which is common for quantum mechanical theory. Thus deterministic (butmore » discrete time{exclamation_point}) dynamics is compatible with discrete energy levels.« less

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

NASA Astrophysics Data System (ADS)

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.

Optimization of Shipboard Manning Levels Using Imprint Pro Forces Module

DTIC Science & Technology

2015-09-01

NPS-OR-15-008 NAVAL POSTGRADUATE SCHOOL MONTEREY, CALIFORNIA OPTIMIZATION OF SHIPBOARD MANNING LEVELS USING IMPRINT PRO...Optimization of Shipboard Manning Levels Using IMPRINT Pro Forces Module 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER...ABSTRACT The Improved Performance Research Integration Tool ( IMPRINT ) is a dynamic, stochastic, discrete-event modeling tool used to develop a model

Largenet2: an object-oriented programming library for simulating large adaptive networks.

PubMed

Zschaler, Gerd; Gross, Thilo

2013-01-15

The largenet2 C++ library provides an infrastructure for the simulation of large dynamic and adaptive networks with discrete node and link states. The library is released as free software. It is available at http://biond.github.com/largenet2. Largenet2 is licensed under the Creative Commons Attribution-NonCommercial 3.0 Unported License. gerd@biond.org

Stability of Dynamical Systems with Discontinuous Motions:

NASA Astrophysics Data System (ADS)

Michel, Anthony N.; Hou, Ling

In this paper we present a stability theory for discontinuous dynamical systems (DDS): continuous-time systems whose motions are not necessarily continuous with respect to time. We show that this theory is not only applicable in the analysis of DDS, but also in the analysis of continuous dynamical systems (continuous-time systems whose motions are continuous with respect to time), discrete-time dynamical systems (systems whose motions are defined at discrete points in time) and hybrid dynamical systems (HDS) (systems whose descriptions involve simultaneously continuous-time and discrete-time). We show that the stability results for DDS are in general less conservative than the corresponding well-known classical Lyapunov results for continuous dynamical systems and discrete-time dynamical systems. Although the DDS stability results are applicable to general dynamical systems defined on metric spaces (divorced from any kind of description by differential equations, or any other kinds of equations), we confine ourselves to finite-dimensional dynamical systems defined by ordinary differential equations and difference equations, to make this paper as widely accessible as possible. We present only sample results, namely, results for uniform asymptotic stability in the large.

Dynamics of column stability with partial end restraints

NASA Technical Reports Server (NTRS)

Gregory, Peyton B.

1990-01-01

The dynamic behavior of columns with partial end restraints and loads consisting of a dead load and a pulsating load are investigated. The differential equation is solved using a lumped impulse recurrence formula relative to time coupled with a finite difference discretization along the member length. A computer program is written from which the first critical frequencies are found as a function of end stiffness. The case of a pinned ended column compares very well with the exact solution. Also, the natural frequency and buckling load formulas are derived for equal and unequal end restraints.

An interactive approach based on a discrete differential evolution algorithm for a class of integer bilevel programming problems

NASA Astrophysics Data System (ADS)

Li, Hong; Zhang, Li; Jiao, Yong-Chang

2016-07-01

This paper presents an interactive approach based on a discrete differential evolution algorithm to solve a class of integer bilevel programming problems, in which integer decision variables are controlled by an upper-level decision maker and real-value or continuous decision variables are controlled by a lower-level decision maker. Using the Karush--Kuhn-Tucker optimality conditions in the lower-level programming, the original discrete bilevel formulation can be converted into a discrete single-level nonlinear programming problem with the complementarity constraints, and then the smoothing technique is applied to deal with the complementarity constraints. Finally, a discrete single-level nonlinear programming problem is obtained, and solved by an interactive approach. In each iteration, for each given upper-level discrete variable, a system of nonlinear equations including the lower-level variables and Lagrange multipliers is solved first, and then a discrete nonlinear programming problem only with inequality constraints is handled by using a discrete differential evolution algorithm. Simulation results show the effectiveness of the proposed approach.

On the Importance of the Dynamics of Discretizations

NASA Technical Reports Server (NTRS)

Sweby, Peter K.; Yee, H. C.; Rai, ManMohan (Technical Monitor)

1995-01-01

It has been realized recently that the discrete maps resulting from numerical discretizations of differential equations can possess asymptotic dynamical behavior quite different from that of the original systems. This is the case not only for systems of Ordinary Differential Equations (ODEs) but in a more complicated manner for Partial Differential Equations (PDEs) used to model complex physics. The impact of the modified dynamics may be mild and even not observed for some numerical methods. For other classes of discretizations the impact may be pronounced, but not always obvious depending on the nonlinear model equations, the time steps, the grid spacings and the initial conditions. Non-convergence or convergence to periodic solutions might be easily recognizable but convergence to incorrect but plausible solutions may not be so obvious - even for discretized parameters within the linearized stability constraint. Based on our past four years of research, we will illustrate some of the pathology of the dynamics of discretizations, its possible impact and the usage of these schemes for model nonlinear ODEs, convection-diffusion equations and grid adaptations.

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

PubMed

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.

Discrete-Time Stable Generalized Self-Learning Optimal Control With Approximation Errors.

PubMed

Wei, Qinglai; Li, Benkai; Song, Ruizhuo

2018-04-01

In this paper, a generalized policy iteration (GPI) algorithm with approximation errors is developed for solving infinite horizon optimal control problems for nonlinear systems. The developed stable GPI algorithm provides a general structure of discrete-time iterative adaptive dynamic programming algorithms, by which most of the discrete-time reinforcement learning algorithms can be described using the GPI structure. It is for the first time that approximation errors are explicitly considered in the GPI algorithm. The properties of the stable GPI algorithm with approximation errors are analyzed. The admissibility of the approximate iterative control law can be guaranteed if the approximation errors satisfy the admissibility criteria. The convergence of the developed algorithm is established, which shows that the iterative value function is convergent to a finite neighborhood of the optimal performance index function, if the approximate errors satisfy the convergence criterion. Finally, numerical examples and comparisons are presented.

Intergenerational Long-Term Effects of Preschool - Structural Estimates from a Discrete Dynamic Programming Model*

PubMed Central

Heckman, James J.; Raut, Lakshmi K.

2015-01-01

This paper formulates a structural dynamic programming model of preschool investment choices of altruistic parents and then empirically estimates the structural parameters of the model using the NLSY79 data. The paper finds that preschool investment significantly boosts cognitive and non-cognitive skills, which enhance earnings and school outcomes. It also finds that a standard Mincer earnings function, by omitting measures of non-cognitive skills on the right-hand side, overestimates the rate of return to schooling. From the estimated equilibrium Markov process, the paper studies the nature of within generation earnings distribution, intergenerational earnings mobility, and schooling mobility. The paper finds that a tax-financed free preschool program for the children of poor socioeconomic status generates positive net gains to the society in terms of average earnings, higher intergenerational earnings mobility, and schooling mobility. PMID:26709326

Quasi-Optimal Elimination Trees for 2D Grids with Singularities

DOE PAGES

Paszyńska, A.; Paszyński, M.; Jopek, K.; ...

2015-01-01

We consmore » truct quasi-optimal elimination trees for 2D finite element meshes with singularities. These trees minimize the complexity of the solution of the discrete system. The computational cost estimates of the elimination process model the execution of the multifrontal algorithms in serial and in parallel shared-memory executions. Since the meshes considered are a subspace of all possible mesh partitions, we call these minimizers quasi-optimal. We minimize the cost functionals using dynamic programming. Finding these minimizers is more computationally expensive than solving the original algebraic system. Nevertheless, from the insights provided by the analysis of the dynamic programming minima, we propose a heuristic construction of the elimination trees that has cost O N e log ⁡ N e , where N e is the number of elements in the mesh. We show that this heuristic ordering has similar computational cost to the quasi-optimal elimination trees found with dynamic programming and outperforms state-of-the-art alternatives in our numerical experiments.« less

Quasi-Optimal Elimination Trees for 2D Grids with Singularities

DOE Office of Scientific and Technical Information (OSTI.GOV)

Paszyńska, A.; Paszyński, M.; Jopek, K.

We consmore » truct quasi-optimal elimination trees for 2D finite element meshes with singularities. These trees minimize the complexity of the solution of the discrete system. The computational cost estimates of the elimination process model the execution of the multifrontal algorithms in serial and in parallel shared-memory executions. Since the meshes considered are a subspace of all possible mesh partitions, we call these minimizers quasi-optimal. We minimize the cost functionals using dynamic programming. Finding these minimizers is more computationally expensive than solving the original algebraic system. Nevertheless, from the insights provided by the analysis of the dynamic programming minima, we propose a heuristic construction of the elimination trees that has cost O N e log ⁡ N e , where N e is the number of elements in the mesh. We show that this heuristic ordering has similar computational cost to the quasi-optimal elimination trees found with dynamic programming and outperforms state-of-the-art alternatives in our numerical experiments.« less

Discrete Time-Crystalline Order in Cavity and Circuit QED Systems

NASA Astrophysics Data System (ADS)

Gong, Zongping; Hamazaki, Ryusuke; Ueda, Masahito

2018-01-01

Discrete time crystals are a recently proposed and experimentally observed out-of-equilibrium dynamical phase of Floquet systems, where the stroboscopic dynamics of a local observable repeats itself at an integer multiple of the driving period. We address this issue in a driven-dissipative setup, focusing on the modulated open Dicke model, which can be implemented by cavity or circuit QED systems. In the thermodynamic limit, we employ semiclassical approaches and find rich dynamical phases on top of the discrete time-crystalline order. In a deep quantum regime with few qubits, we find clear signatures of a transient discrete time-crystalline behavior, which is absent in the isolated counterpart. We establish a phenomenology of dissipative discrete time crystals by generalizing the Landau theory of phase transitions to Floquet open systems.

Counting and classifying attractors in high dimensional dynamical systems.

PubMed

Bagley, R J; Glass, L

1996-12-07

Randomly connected Boolean networks have been used as mathematical models of neural, genetic, and immune systems. A key quantity of such networks is the number of basins of attraction in the state space. The number of basins of attraction changes as a function of the size of the network, its connectivity and its transition rules. In discrete networks, a simple count of the number of attractors does not reveal the combinatorial structure of the attractors. These points are illustrated in a reexamination of dynamics in a class of random Boolean networks considered previously by Kauffman. We also consider comparisons between dynamics in discrete networks and continuous analogues. A continuous analogue of a discrete network may have a different number of attractors for many different reasons. Some attractors in discrete networks may be associated with unstable dynamics, and several different attractors in a discrete network may be associated with a single attractor in the continuous case. Special problems in determining attractors in continuous systems arise when there is aperiodic dynamics associated with quasiperiodicity of deterministic chaos.

Clipping in neurocontrol by adaptive dynamic programming.

PubMed

Fairbank, Michael; Prokhorov, Danil; Alonso, Eduardo

2014-10-01

In adaptive dynamic programming, neurocontrol, and reinforcement learning, the objective is for an agent to learn to choose actions so as to minimize a total cost function. In this paper, we show that when discretized time is used to model the motion of the agent, it can be very important to do clipping on the motion of the agent in the final time step of the trajectory. By clipping, we mean that the final time step of the trajectory is to be truncated such that the agent stops exactly at the first terminal state reached, and no distance further. We demonstrate that when clipping is omitted, learning performance can fail to reach the optimum, and when clipping is done properly, learning performance can improve significantly. The clipping problem we describe affects algorithms that use explicit derivatives of the model functions of the environment to calculate a learning gradient. These include backpropagation through time for control and methods based on dual heuristic programming. However, the clipping problem does not significantly affect methods based on heuristic dynamic programming, temporal differences learning, or policy-gradient learning algorithms.

The ultimatum game: Discrete vs. continuous offers

NASA Astrophysics Data System (ADS)

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.

Distinct Functional Modules for Discrete and Rhythmic Forelimb Movements in the Mouse Motor Cortex.

PubMed

Hira, Riichiro; Terada, Shin-Ichiro; Kondo, Masashi; Matsuzaki, Masanori

2015-09-30

Movements of animals are composed of two fundamental dynamics: discrete and rhythmic movements. Although the movements with distinct dynamics are thought to be differently processed in the CNS, it is unclear how they are represented in the cerebral cortex. Here, we investigated the cortical representation of movement dynamics by developing prolonged transcranial optogenetic stimulation (pTOS) using awake, channelrhodopsin-2 transgenic mice. We found two domains that induced discrete forelimb movements in the forward and backward directions, and these sandwiched a domain that generated rhythmic forelimb movements. The forward discrete movement had an intrinsic velocity profile and the rhythmic movement had an intrinsic oscillation frequency. Each of the forward discrete and rhythmic domains possessed intracortical synaptic connections within its own domain, independently projected to the spinal cord, and weakened the neuronal activity and movement induction of the other domain. pTOS-induced movements were also classified as ethologically relevant movements. Forepaw-to-mouth movement was mapped in a part of the forward discrete domain, while locomotion-like movement was in a part of the rhythmic domain. Interestingly, photostimulation of the rhythmic domain resulted in a nonrhythmic, continuous lever-pull movement when a lever was present. The motor cortex possesses functional modules for distinct movement dynamics, and these can adapt to environmental constraints for purposeful movements. Significance statement: Animal behavior has discrete and rhythmic components, such as reaching and locomotion. It is unclear how these movements with distinct dynamics are represented in the cerebral cortex. We investigated the dynamics of movements induced by long-duration transcranial photostimulation on the dorsal cortex of awake channelrhodopsin-2 transgenic mice. We found two domains causing forward and backward discrete forelimb movements and a domain for rhythmic forelimb movements. A domain for forward discrete movement and a domain for rhythmic movement mutually weakened neuronal activity and movement size. The photostimulation of the rhythmic domain also induced nonrhythmic, lever-pull movement, when the lever was present. Thus, the motor cortex has functional modules with distinct dynamics, and each module retains flexibility for adaptation to different environments. Copyright © 2015 the authors 0270-6474/15/3513311-12$15.00/0.

Discrete dynamic modeling of cellular signaling networks.

PubMed

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.

Analyzing neuronal networks using discrete-time dynamics

NASA Astrophysics Data System (ADS)

Ahn, Sungwoo; Smith, Brian H.; Borisyuk, Alla; Terman, David

2010-05-01

We develop mathematical techniques for analyzing detailed Hodgkin-Huxley like models for excitatory-inhibitory neuronal networks. Our strategy for studying a given network is to first reduce it to a discrete-time dynamical system. The discrete model is considerably easier to analyze, both mathematically and computationally, and parameters in the discrete model correspond directly to parameters in the original system of differential equations. While these networks arise in many important applications, a primary focus of this paper is to better understand mechanisms that underlie temporally dynamic responses in early processing of olfactory sensory information. The models presented here exhibit several properties that have been described for olfactory codes in an insect’s Antennal Lobe. These include transient patterns of synchronization and decorrelation of sensory inputs. By reducing the model to a discrete system, we are able to systematically study how properties of the dynamics, including the complex structure of the transients and attractors, depend on factors related to connectivity and the intrinsic and synaptic properties of cells within the network.

Discretization chaos - Feedback control and transition to chaos

NASA Technical Reports Server (NTRS)

Grantham, Walter J.; Athalye, Amit M.

1990-01-01

Problems in the design of feedback controllers for chaotic dynamical systems are considered theoretically, focusing on two cases where chaos arises only when a nonchaotic continuous-time system is discretized into a simpler discrete-time systems (exponential discretization and pseudo-Euler integration applied to Lotka-Volterra competition and prey-predator systems). Numerical simulation results are presented in extensive graphs and discussed in detail. It is concluded that care must be taken in applying standard dynamical-systems methods to control systems that may be discontinuous or nondifferentiable.

TOWARDS A MULTI-SCALE AGENT-BASED PROGRAMMING LANGUAGE METHODOLOGY

PubMed Central

Somogyi, Endre; Hagar, Amit; Glazier, James A.

2017-01-01

Living tissues are dynamic, heterogeneous compositions of objects, including molecules, cells and extra-cellular materials, which interact via chemical, mechanical and electrical process and reorganize via transformation, birth, death and migration processes. Current programming language have difficulty describing the dynamics of tissues because: 1: Dynamic sets of objects participate simultaneously in multiple processes, 2: Processes may be either continuous or discrete, and their activity may be conditional, 3: Objects and processes form complex, heterogeneous relationships and structures, 4: Objects and processes may be hierarchically composed, 5: Processes may create, destroy and transform objects and processes. Some modeling languages support these concepts, but most cannot translate models into executable simulations. We present a new hybrid executable modeling language paradigm, the Continuous Concurrent Object Process Methodology (CCOPM) which naturally expresses tissue models, enabling users to visually create agent-based models of tissues, and also allows computer simulation of these models. PMID:29282379

TOWARDS A MULTI-SCALE AGENT-BASED PROGRAMMING LANGUAGE METHODOLOGY.

PubMed

Somogyi, Endre; Hagar, Amit; Glazier, James A

2016-12-01

Living tissues are dynamic, heterogeneous compositions of objects , including molecules, cells and extra-cellular materials, which interact via chemical, mechanical and electrical process and reorganize via transformation, birth, death and migration processes . Current programming language have difficulty describing the dynamics of tissues because: 1: Dynamic sets of objects participate simultaneously in multiple processes, 2: Processes may be either continuous or discrete, and their activity may be conditional, 3: Objects and processes form complex, heterogeneous relationships and structures, 4: Objects and processes may be hierarchically composed, 5: Processes may create, destroy and transform objects and processes. Some modeling languages support these concepts, but most cannot translate models into executable simulations. We present a new hybrid executable modeling language paradigm, the Continuous Concurrent Object Process Methodology ( CCOPM ) which naturally expresses tissue models, enabling users to visually create agent-based models of tissues, and also allows computer simulation of these models.

Inflated speedups in parallel simulations via malloc()

NASA Technical Reports Server (NTRS)

Nicol, David M.

1990-01-01

Discrete-event simulation programs make heavy use of dynamic memory allocation in order to support simulation's very dynamic space requirements. When programming in C one is likely to use the malloc() routine. However, a parallel simulation which uses the standard Unix System V malloc() implementation may achieve an overly optimistic speedup, possibly superlinear. An alternate implementation provided on some (but not all systems) can avoid the speedup anomaly, but at the price of significantly reduced available free space. This is especially severe on most parallel architectures, which tend not to support virtual memory. It is shown how a simply implemented user-constructed interface to malloc() can both avoid artificially inflated speedups, and make efficient use of the dynamic memory space. The interface simply catches blocks on the basis of their size. The problem is demonstrated empirically, and the effectiveness of the solution is shown both empirically and analytically.

Quantization of systems with temporally varying discretization. II. Local evolution moves

NASA Astrophysics Data System (ADS)

Höhn, Philipp A.

2014-10-01

Several quantum gravity approaches and field theory on an evolving lattice involve a discretization changing dynamics generated by evolution moves. Local evolution moves in variational discrete systems (1) are a generalization of the Pachner evolution moves of simplicial gravity models, (2) update only a small subset of the dynamical data, (3) change the number of kinematical and physical degrees of freedom, and (4) generate a dynamical (or canonical) coarse graining or refining of the underlying discretization. To systematically explore such local moves and their implications in the quantum theory, this article suitably expands the quantum formalism for global evolution moves, constructed in Paper I [P. A. Höhn, "Quantization of systems with temporally varying discretization. I. Evolving Hilbert spaces," J. Math. Phys. 55, 083508 (2014); e-print arXiv:1401.6062 [gr-qc

Adaptive feedback synchronisation of complex dynamical network with discrete-time communications and delayed nodes

NASA Astrophysics Data System (ADS)

Wang, Tong; Ding, Yongsheng; Zhang, Lei; Hao, Kuangrong

2016-08-01

This paper considered the synchronisation of continuous complex dynamical networks with discrete-time communications and delayed nodes. The nodes in the dynamical networks act in the continuous manner, while the communications between nodes are discrete-time; that is, they communicate with others only at discrete time instants. The communication intervals in communication period can be uncertain and variable. By using a piecewise Lyapunov-Krasovskii function to govern the characteristics of the discrete communication instants, we investigate the adaptive feedback synchronisation and a criterion is derived to guarantee the existence of the desired controllers. The globally exponential synchronisation can be achieved by the controllers under the updating laws. Finally, two numerical examples including globally coupled network and nearest-neighbour coupled networks are presented to demonstrate the validity and effectiveness of the proposed control scheme.

Blade loss transient dynamics analysis, volume 2. Task 2: Theoretical and analytical development. Task 3: Experimental verification

NASA Technical Reports Server (NTRS)

Gallardo, V. C.; Storace, A. S.; Gaffney, E. F.; Bach, L. J.; Stallone, M. J.

1981-01-01

The component element method was used to develop a transient dynamic analysis computer program which is essentially based on modal synthesis combined with a central, finite difference, numerical integration scheme. The methodology leads to a modular or building-block technique that is amenable to computer programming. To verify the analytical method, turbine engine transient response analysis (TETRA), was applied to two blade-out test vehicles that had been previously instrumented and tested. Comparison of the time dependent test data with those predicted by TETRA led to recommendations for refinement or extension of the analytical method to improve its accuracy and overcome its shortcomings. The development of working equations, their discretization, numerical solution scheme, the modular concept of engine modelling, the program logical structure and some illustrated results are discussed. The blade-loss test vehicles (rig full engine), the type of measured data, and the engine structural model are described.

Nonintegrable semidiscrete Hirota equation: gauge-equivalent structures and dynamical properties.

PubMed

Ma, Li-Yuan; Zhu, Zuo-Nong

2014-09-01

In this paper, we investigate nonintegrable semidiscrete Hirota equations, including the nonintegrable semidiscrete Hirota(-) equation and the nonintegrable semidiscrete Hirota(+) equation. We focus on the topics on gauge-equivalent structures and dynamical behaviors for the two nonintegrable semidiscrete equations. By using the concept of the prescribed discrete curvature, we show that, under the discrete gauge transformations, the nonintegrable semidiscrete Hirota(-) equation and the nonintegrable semidiscrete Hirota(+) equation are, respectively, gauge equivalent to the nonintegrable generalized semidiscrete modified Heisenberg ferromagnet equation and the nonintegrable generalized semidiscrete Heisenberg ferromagnet equation. We prove that the two discrete gauge transformations are reversible. We study the dynamical properties for the two nonintegrable semidiscrete Hirota equations. The exact spatial period solutions of the two nonintegrable semidiscrete Hirota equations are obtained through the constructions of period orbits of the stationary discrete Hirota equations. We discuss the topic regarding whether the spatial period property of the solution to the nonintegrable semidiscrete Hirota equation is preserved to that of the corresponding gauge-equivalent nonintegrable semidiscrete equations under the action of discrete gauge transformation. By using the gauge equivalent, we obtain the exact solutions to the nonintegrable generalized semidiscrete modified Heisenberg ferromagnet equation and the nonintegrable generalized semidiscrete Heisenberg ferromagnet equation. We also give the numerical simulations for the stationary discrete Hirota equations. We find that their dynamics are much richer than the ones of stationary discrete nonlinear Schrödinger equations.

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

PubMed

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.

Attractors for discrete periodic dynamical systems

Treesearch

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

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

ERIC Educational Resources Information Center

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)

Stochastic modeling and simulation of reaction-diffusion system with Hill function dynamics.

PubMed

Chen, Minghan; Li, Fei; Wang, Shuo; Cao, Young

2017-03-14

Stochastic simulation of reaction-diffusion systems presents great challenges for spatiotemporal biological modeling and simulation. One widely used framework for stochastic simulation of reaction-diffusion systems is reaction diffusion master equation (RDME). Previous studies have discovered that for the RDME, when discretization size approaches zero, reaction time for bimolecular reactions in high dimensional domains tends to infinity. In this paper, we demonstrate that in the 1D domain, highly nonlinear reaction dynamics given by Hill function may also have dramatic change when discretization size is smaller than a critical value. Moreover, we discuss methods to avoid this problem: smoothing over space, fixed length smoothing over space and a hybrid method. Our analysis reveals that the switch-like Hill dynamics reduces to a linear function of discretization size when the discretization size is small enough. The three proposed methods could correctly (under certain precision) simulate Hill function dynamics in the microscopic RDME system.

Biomolecular Programming of Discrete Nanomaterials for Sensors, Templates and Mimics of Natural Nanoscale Assemblies

DTIC Science & Technology

2016-10-17

AFRL-AFOSR-VA-TR-2016-0343 BIOMOLECULAR PROGRAMMING OF DISCRETE NANOMATERIALS FOR SENSORS, TEMPLATES AND MIMICS OF NATURAL NANOSCALE ASSEMBLIES...Performance 3. DATES COVERED (From - To) 01 Jun 2011 to 31 May 2016 4. TITLE AND SUBTITLE BIOMOLECULAR PROGRAMMING OF DISCRETE NANOMATERIALS FOR SENSORS

Peridynamics with LAMMPS : a user guide.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lehoucq, Richard B.; Silling, Stewart Andrew; Plimpton, Steven James

2008-01-01

Peridynamics is a nonlocal formulation of continuum mechanics. The discrete peridynamic model has the same computational structure as a molecular dynamic model. This document details the implementation of a discrete peridynamic model within the LAMMPS molecular dynamic code. This document provides a brief overview of the peridynamic model of a continuum, then discusses how the peridynamic model is discretized, and overviews the LAMMPS implementation. A nontrivial example problem is also included.

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

NASA Astrophysics Data System (ADS)

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.

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

PubMed Central

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. PMID:26263006

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

PubMed

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.

Solving a discrete model of the lac operon using Z3

NASA Astrophysics Data System (ADS)

Gutierrez, Natalia A.

2014-05-01

A discrete model for the Lcac Operon is solved using the SMT-solver Z3. Traditionally the Lac Operon is formulated in a continuous math model. This model is a system of ordinary differential equations. Here, it was considerated as a discrete model, based on a Boolean red. The biological problem of Lac Operon is enunciated as a problem of Boolean satisfiability, and it is solved using an STM-solver named Z3. Z3 is a powerful solver that allows understanding the basic dynamic of the Lac Operon in an easier and more efficient way. The multi-stability of the Lac Operon can be easily computed with Z3. The code that solves the Boolean red can be written in Python language or SMT-Lib language. Both languages were used in local version of the program as online version of Z3. For future investigations it is proposed to solve the Boolean red of Lac Operon using others SMT-solvers as cvc4, alt-ergo, mathsat and yices.

An interface for the direct coupling of small liquid samples to AMS

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ognibene, T. J.; Thomas, A. T.; Daley, P. F.

We describe the moving wire interface attached to the 1-MV AMS system at LLNL’s Center for Accelerator Mass Spectrometry for the analysis of nonvolatile liquid samples as either discrete drops or from the direct output of biochemical separatory instrumentation, such as high-performance liquid chromatography (HPLC). Discrete samples containing at least a few 10 s of nanograms of carbon and as little as 50 zmol 14C can be measured with a 3–5% precision in a few minutes. The dynamic range of our system spans approximately 3 orders in magnitude. Sample to sample memory is minimized by the use of fresh targetsmore » for each discrete sample or by minimizing the amount of carbon present in a peak generated by an HPLC containing a significant amount of 14C. As a result, liquid sample AMS provides a new technology to expand our biomedical AMS program by enabling the capability to measure low-level biochemicals in extremely small samples that would otherwise be inaccessible.« less

An interface for the direct coupling of small liquid samples to AMS

DOE PAGES

Ognibene, T. J.; Thomas, A. T.; Daley, P. F.; ...

2015-05-28

We describe the moving wire interface attached to the 1-MV AMS system at LLNL’s Center for Accelerator Mass Spectrometry for the analysis of nonvolatile liquid samples as either discrete drops or from the direct output of biochemical separatory instrumentation, such as high-performance liquid chromatography (HPLC). Discrete samples containing at least a few 10 s of nanograms of carbon and as little as 50 zmol 14C can be measured with a 3–5% precision in a few minutes. The dynamic range of our system spans approximately 3 orders in magnitude. Sample to sample memory is minimized by the use of fresh targetsmore » for each discrete sample or by minimizing the amount of carbon present in a peak generated by an HPLC containing a significant amount of 14C. As a result, liquid sample AMS provides a new technology to expand our biomedical AMS program by enabling the capability to measure low-level biochemicals in extremely small samples that would otherwise be inaccessible.« less

FLOW FIELD IN SUPERSONIC MIXED-COMPRESSION INLETS AT ANGLE OF ATTACK USING THE THREE DIMENSIONAL METHOD OF CHARACTERISTICS WITH DISCRETE SHOCK WAVE FITTING

NASA Technical Reports Server (NTRS)

Bishop, A. R.

1994-01-01

This computer program calculates the flow field in the supersonic portion of a mixed-compression aircraft inlet at non-zero angle of attack. This approach is based on the method of characteristics for steady three-dimensional flow. The results of this program agree with those produced by the two-dimensional method of characteristics when axisymmetric flow fields are calculated. Except in regions of high viscous interaction and boundary layer removal, the results agree well with experimental data obtained for threedimensional flow fields. The flow field in a variety of axisymmetric mixed compression inlets can be calculated using this program. The bow shock wave and the internal shock wave system are calculated using a discrete shock wave fitting procedure. The internal flow field can be calculated either with or without the discrete fitting of the internal shock wave system. The influence of molecular transport can be included in the calculation of the external flow about the forebody and in the calculation of the internal flow when internal shock waves are not discretely fitted. The viscous and thermal diffussion effects are included by treating them as correction terms in the method of characteristics procedure. Dynamic viscosity is represented by Sutherland's law and thermal conductivity is represented as a quadratic function of temperature. The thermodynamic model used is that of a thermally and calorically perfect gas. The program assumes that the cowl lip is contained in a constant plane and that the centerbody contour and cowl contour are smooth and have continuous first partial derivatives. This program cannot calculate subsonic flow, the external flow field if the bow shock wave does not exist entirely around the forebody, or the internal flow field if the bow flow field is injected into the annulus. Input to the program consists of parameters to control execution, to define the geometry, and the vehicle orientation. Output consists of a list of parameters used, solution planes, and a description of the shock waves. This program is written in FORTRAN IV for batch execution and has been implemented on a CDC 6000 series machine with a central memory requirement of 110K (octal) of 60 bit words when it is overlayed. This flow analysis program was developed in 1978.

Microstructural comparison of the kinematics of discrete and continuum dislocations models

NASA Astrophysics Data System (ADS)

Sandfeld, Stefan; Po, Giacomo

2015-12-01

The Continuum Dislocation Dynamics (CDD) theory and the Discrete Dislocation Dynamics (DDD) method are compared based on concise mathematical formulations of the coarse graining of discrete data. A numerical tool for converting from a discrete to a continuum representation of a given dislocation configuration is developed, which allows to directly compare both simulation approaches based on continuum quantities (e.g. scalar density, geometrically necessary densities, mean curvature). Investigating the evolution of selected dislocation configurations within analytically given velocity fields for both DDD and CDD reveals that CDD contains a surprising number of important microstructural details.

Differential results integrated with continuous and discrete gravity measurements between nearby stations

NASA Astrophysics Data System (ADS)

Xu, Weimin; Chen, Shi; Lu, Hongyan

2016-04-01

Integrated gravity is an efficient way in studying spatial and temporal characteristics of the dynamics and tectonics. Differential measurements based on the continuous and discrete gravity observations shows highly competitive in terms of both efficiency and precision with single result. The differential continuous gravity variation between the nearby stations, which is based on the observation of Scintrex g-Phone relative gravimeters in every single station. It is combined with the repeated mobile relative measurements or absolute results to study the regional integrated gravity changes. Firstly we preprocess the continuous records by Tsoft software, and calculate the theoretical earth tides and ocean tides by "MT80TW" program through high precision tidal parameters from "WPARICET". The atmospheric loading effects and complex drift are strictly considered in the procedure. Through above steps we get the continuous gravity in every station and we can calculate the continuous gravity variation between nearby stations, which is called the differential continuous gravity changes. Then the differential results between related stations is calculated based on the repeated gravity measurements, which are carried out once or twice every year surrounding the gravity stations. Hence we get the discrete gravity results between the nearby stations. Finally, the continuous and discrete gravity results are combined in the same related stations, including the absolute gravity results if necessary, to get the regional integrated gravity changes. This differential gravity results is more accurate and effective in dynamical monitoring, regional hydrologic effects studying, tectonic activity and other geodynamical researches. The time-frequency characteristics of continuous gravity results are discussed to insure the accuracy and efficiency in the procedure.

Flight Dynamics and Control of a Morphing UAV: Bio inspired by Natural Fliers

DTIC Science & Technology

2017-02-17

Approved for public release: distribution unlimited. IV Modelling and Sizing Tornado Vortex Lattice Method (VLM) was used for aerodynamic prediction... Tornado is a Vortex Lattice Method software programmed in MATLAB; it was selected due to its fast solving time and ability to be controlled through...custom MATLAB scripts. Tornado VLM models the wing as thin sheet of discrete vortices and computes the pressure and force distributions around the

A toolbox for discrete modelling of cell signalling dynamics.

PubMed

Paterson, Yasmin Z; Shorthouse, David; Pleijzier, Markus W; Piterman, Nir; Bendtsen, Claus; Hall, Benjamin A; Fisher, Jasmin

2018-06-18

In an age where the volume of data regarding biological systems exceeds our ability to analyse it, many researchers are looking towards systems biology and computational modelling to help unravel the complexities of gene and protein regulatory networks. In particular, the use of discrete modelling allows generation of signalling networks in the absence of full quantitative descriptions of systems, which are necessary for ordinary differential equation (ODE) models. In order to make such techniques more accessible to mainstream researchers, tools such as the BioModelAnalyzer (BMA) have been developed to provide a user-friendly graphical interface for discrete modelling of biological systems. Here we use the BMA to build a library of discrete target functions of known canonical molecular interactions, translated from ordinary differential equations (ODEs). We then show that these BMA target functions can be used to reconstruct complex networks, which can correctly predict many known genetic perturbations. This new library supports the accessibility ethos behind the creation of BMA, providing a toolbox for the construction of complex cell signalling models without the need for extensive experience in computer programming or mathematical modelling, and allows for construction and simulation of complex biological systems with only small amounts of quantitative data.

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Shorikov, A. F., E-mail: afshorikov@mail.ru

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 terminalmore » approach process with incomplete information and give a general scheme for its solving.« less

Nonlinear dynamic macromodeling techniques for audio systems

NASA Astrophysics Data System (ADS)

Ogrodzki, Jan; Bieńkowski, Piotr

2015-09-01

This paper develops a modelling method and a models identification technique for the nonlinear dynamic audio systems. Identification is performed by means of a behavioral approach based on a polynomial approximation. This approach makes use of Discrete Fourier Transform and Harmonic Balance Method. A model of an audio system is first created and identified and then it is simulated in real time using an algorithm of low computational complexity. The algorithm consists in real time emulation of the system response rather than in simulation of the system itself. The proposed software is written in Python language using object oriented programming techniques. The code is optimized for a multithreads environment.

Human dynamic orientation model applied to motion simulation. M.S. Thesis

NASA Technical Reports Server (NTRS)

Borah, J. D.

1976-01-01

The Ormsby model of dynamic orientation, in the form of a discrete time computer program was used to predict non-visually induced sensations during an idealized coordinated aircraft turn. To predict simulation fidelity, the Ormsby model was used to assign penalties for incorrect attitude and angular rate perceptions. It was determined that a three rotational degree of freedom simulation should remain faithful to attitude perception even at the expense of incorrect angular rate sensations. Implementing this strategy, a simulation profile for the idealized turn was designed for a Link GAT-1 trainer. A simple optokinetic display was added to improve the fidelity of roll rate sensations.

A dynamically adaptive multigrid algorithm for the incompressible Navier-Stokes equations: Validation and model problems

NASA Technical Reports Server (NTRS)

Thompson, C. P.; Leaf, G. K.; Vanrosendale, J.

1991-01-01

An algorithm is described for the solution of the laminar, incompressible Navier-Stokes equations. The basic algorithm is a multigrid based on a robust, box-based smoothing step. Its most important feature is the incorporation of automatic, dynamic mesh refinement. This algorithm supports generalized simple domains. The program is based on a standard staggered-grid formulation of the Navier-Stokes equations for robustness and efficiency. Special grid transfer operators were introduced at grid interfaces in the multigrid algorithm to ensure discrete mass conservation. Results are presented for three models: the driven-cavity, a backward-facing step, and a sudden expansion/contraction.

An application of different dioids in public key cryptography

DOE Office of Scientific and Technical Information (OSTI.GOV)

Durcheva, Mariana I., E-mail: mdurcheva66@gmail.com

2014-11-18

Dioids provide a natural framework for analyzing a broad class of discrete event dynamical systems such as the design and analysis of bus and railway timetables, scheduling of high-throughput industrial processes, solution of combinatorial optimization problems, the analysis and improvement of flow systems in communication networks. They have appeared in several branches of mathematics such as functional analysis, optimization, stochastic systems and dynamic programming, tropical geometry, fuzzy logic. In this paper we show how to involve dioids in public key cryptography. The main goal is to create key – exchange protocols based on dioids. Additionally the digital signature scheme ismore » presented.« less

Single step optimization of manipulator maneuvers with variable structure control

NASA Technical Reports Server (NTRS)

Chen, N.; Dwyer, T. A. W., III

1987-01-01

One step ahead optimization has been recently proposed for spacecraft attitude maneuvers as well as for robot manipulator maneuvers. Such a technique yields a discrete time control algorithm implementable as a sequence of state-dependent, quadratic programming problems for acceleration optimization. Its sensitivity to model accuracy, for the required inversion of the system dynamics, is shown in this paper to be alleviated by a fast variable structure control correction, acting between the sampling intervals of the slow one step ahead discrete time acceleration command generation algorithm. The slow and fast looping concept chosen follows that recently proposed for optimal aiming strategies with variable structure control. Accelerations required by the VSC correction are reserved during the slow one step ahead command generation so that the ability to overshoot the sliding surface is guaranteed.

The Relationship between Self-Assembly and Conformal Mappings

NASA Astrophysics Data System (ADS)

Duque, Carlos; Santangelo, Christian

The isotropic growth of a thin sheet has been used as a way to generate programmed shapes through controlled buckling. We discuss how conformal mappings, which are transformations that locally preserve angles, provide a way to quantify the area growth needed to produce a particular shape. A discrete version of the conformal map can be constructed from circle packings, which are maps between packings of circles whose contact network is preserved. This provides a link to the self-assembly of particles on curved surfaces. We performed simulations of attractive particles on a curved surface using molecular dynamics. The resulting particle configurations were used to generate the corresponding discrete conformal map, allowing us to quantify the degree of area distortion required to produce a particular shape by finding particle configurations that minimize the area distortion.

Convergence of the standard RLS method and UDUT factorisation of covariance matrix for solving the algebraic Riccati equation of the DLQR via heuristic approximate dynamic programming

NASA Astrophysics Data System (ADS)

Moraes Rêgo, Patrícia Helena; Viana da Fonseca Neto, João; Ferreira, Ernesto M.

2015-08-01

The main focus of this article is to present a proposal to solve, via UDUT factorisation, the convergence and numerical stability problems that are related to the covariance matrix ill-conditioning of the recursive least squares (RLS) approach for online approximations of the algebraic Riccati equation (ARE) solution associated with the discrete linear quadratic regulator (DLQR) problem formulated in the actor-critic reinforcement learning and approximate dynamic programming context. The parameterisations of the Bellman equation, utility function and dynamic system as well as the algebra of Kronecker product assemble a framework for the solution of the DLQR problem. The condition number and the positivity parameter of the covariance matrix are associated with statistical metrics for evaluating the approximation performance of the ARE solution via RLS-based estimators. The performance of RLS approximators is also evaluated in terms of consistence and polarisation when associated with reinforcement learning methods. The used methodology contemplates realisations of online designs for DLQR controllers that is evaluated in a multivariable dynamic system model.

Fractional discrete-time consensus models for single- and double-summator dynamics

NASA Astrophysics Data System (ADS)

Wyrwas, Małgorzata; Mozyrska, Dorota; Girejko, Ewa

2018-04-01

The leader-following consensus problem of fractional-order multi-agent discrete-time systems is considered. In the systems, interactions between opinions are defined like in Krause and Cucker-Smale models but the memory is included by taking the fractional-order discrete-time operator on the left-hand side of the nonlinear systems. In this paper, we investigate fractional-order models of opinions for the single- and double-summator dynamics of discrete-time by analytical methods as well as by computer simulations. The necessary and sufficient conditions for the leader-following consensus are formulated by proposing a consensus control law for tracking the virtual leader.

Computing with dynamical systems based on insulator-metal-transition oscillators

NASA Astrophysics Data System (ADS)

Parihar, Abhinav; Shukla, Nikhil; Jerry, Matthew; Datta, Suman; Raychowdhury, Arijit

2017-04-01

In this paper, we review recent work on novel computing paradigms using coupled oscillatory dynamical systems. We explore systems of relaxation oscillators based on linear state transitioning devices, which switch between two discrete states with hysteresis. By harnessing the dynamics of complex, connected systems, we embrace the philosophy of "let physics do the computing" and demonstrate how complex phase and frequency dynamics of such systems can be controlled, programmed, and observed to solve computationally hard problems. Although our discussion in this paper is limited to insulator-to-metallic state transition devices, the general philosophy of such computing paradigms can be translated to other mediums including optical systems. We present the necessary mathematical treatments necessary to understand the time evolution of these systems and demonstrate through recent experimental results the potential of such computational primitives.

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

PubMed

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

2011-07-20

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

Predicting Flows of Rarefied Gases

NASA Technical Reports Server (NTRS)

LeBeau, Gerald J.; Wilmoth, Richard G.

2005-01-01

DSMC Analysis Code (DAC) is a flexible, highly automated, easy-to-use computer program for predicting flows of rarefied gases -- especially flows of upper-atmospheric, propulsion, and vented gases impinging on spacecraft surfaces. DAC implements the direct simulation Monte Carlo (DSMC) method, which is widely recognized as standard for simulating flows at densities so low that the continuum-based equations of computational fluid dynamics are invalid. DAC enables users to model complex surface shapes and boundary conditions quickly and easily. The discretization of a flow field into computational grids is automated, thereby relieving the user of a traditionally time-consuming task while ensuring (1) appropriate refinement of grids throughout the computational domain, (2) determination of optimal settings for temporal discretization and other simulation parameters, and (3) satisfaction of the fundamental constraints of the method. In so doing, DAC ensures an accurate and efficient simulation. In addition, DAC can utilize parallel processing to reduce computation time. The domain decomposition needed for parallel processing is completely automated, and the software employs a dynamic load-balancing mechanism to ensure optimal parallel efficiency throughout the simulation.

Effective Hamiltonian for travelling discrete breathers

NASA Astrophysics Data System (ADS)

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.

Quantum Stat Mech in a Programmable Spin Chain of Trapped Ions

NASA Astrophysics Data System (ADS)

Monroe, Christopher

2017-04-01

Trapped atomic ions are a versatile and very clean platform for the quantum programming of interacting spin models and the study of quantum nonequilibrium phenomena. When spin-dependent optical dipole forces are applied to a collection of trapped ions, an effective long-range quantum magnetic interaction arises, with reconfigurable and tunable graphs. Following earlier work on many-body spectroscopy and quench dynamics, we have recently studied many body non-thermalization processes in this system. Frustrated Hamiltonian dynamics can lead to prethermalization, and by adding programmable disorder between the sites, we have observed the phenomenon of many body localization (MBL). Finally, by applying a periodically driven Floquet Hamiltonian tempered by MBL, we report the observation of a discrete ``time crystal'' in the stable appearance of a subharmonic response of the system to the periodic drive. This work is supported by the ARO Atomic Physics Program, the AFOSR MURI on Quantum Measurement and Verification, the IARPA LogiQ Program, and the NSF Physics Frontier Center at JQI.

Transfer of dipolar gas through the discrete localized mode.

PubMed

Bai, Xiao-Dong; Zhang, Ai-Xia; Xue, Ju-Kui

2013-12-01

By considering the discrete nonlinear Schrödinger model with dipole-dipole interactions for dipolar condensate, the existence, the types, the stability, and the dynamics of the localized modes in a nonlinear lattice are discussed. It is found that the contact interaction and the dipole-dipole interactions play important roles in determining the existence, the type, and the stability of the localized modes. Because of the coupled effects of the contact interaction and the dipole-dipole interactions, rich localized modes and their stability nature can exist: when the contact interaction is larger and the dipole-dipole interactions is smaller, a discrete bright breather occurs. In this case, while the on-site interaction can stabilize the discrete breather, the dipole-dipole interactions will destabilize the discrete breather; when both the contact interaction and the dipole-dipole interactions are larger, a discrete kink appears. In this case, both the on-site interaction and the dipole-dipole interactions can stabilize the discrete kink, but the discrete kink is more unstable than the ordinary discrete breather. The predicted results provide a deep insight into the dynamics of blocking, filtering, and transfer of the norm in nonlinear lattices for dipolar condensates.

Threshold virus dynamics with impulsive antiretroviral drug effects

PubMed Central

Lou, Jie; Lou, Yijun; Wu, Jianhong

2013-01-01

The purposes of this paper are twofold: to develop a rigorous approach to analyze the threshold behaviors of nonlinear virus dynamics models with impulsive drug effects and to examine the feasibility of virus clearance following the Manuals of National AIDS Free Antiviral Treatment in China. An impulsive system of differential equations is developed to describe the within-host virus dynamics of both wild-type and drug-resistant strains when a combination of antiretroviral drugs is used to induce instantaneous drug effects at a sequence of dosing times equally spaced while drug concentrations decay exponentially after the dosing time. Threshold parameters are derived using the basic reproduction number of periodic epidemic models, and are used to depict virus clearance/persistence scenarios using the theory of asymptotic periodic systems and the persistence theory of discrete dynamical systems. Numerical simulations using model systems parametrized in terms of the antiretroviral therapy recommended in the aforementioned Manuals illustrate the theoretical threshold virus dynamics, and examine conditions under which the impulsive antiretroviral therapy leads to treatment success. In particular, our results show that only the drug-resistant strain can dominate (the first-line treatment program guided by the Manuals) or both strains may be rapidly eliminated (the second-line treatment program), thus the work indicates the importance of implementing the second-line treatment program as soon as possible. PMID:21987085

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

PubMed

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.

Engine Structures Modeling Software System (ESMOSS)

NASA Technical Reports Server (NTRS)

1991-01-01

Engine Structures Modeling Software System (ESMOSS) is the development of a specialized software system for the construction of geometric descriptive and discrete analytical models of engine parts, components, and substructures which can be transferred to finite element analysis programs such as NASTRAN. The NASA Lewis Engine Structures Program is concerned with the development of technology for the rational structural design and analysis of advanced gas turbine engines with emphasis on advanced structural analysis, structural dynamics, structural aspects of aeroelasticity, and life prediction. Fundamental and common to all of these developments is the need for geometric and analytical model descriptions at various engine assembly levels which are generated using ESMOSS.

Secure Hashing of Dynamic Hand Signatures Using Wavelet-Fourier Compression with BioPhasor Mixing and [InlineEquation not available: see fulltext.] Discretization

NASA Astrophysics Data System (ADS)

Wai Kuan, Yip; Teoh, Andrew B. J.; Ngo, David C. L.

2006-12-01

We introduce a novel method for secure computation of biometric hash on dynamic hand signatures using BioPhasor mixing and[InlineEquation not available: see fulltext.] 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[InlineEquation not available: see fulltext.] 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[InlineEquation not available: see fulltext.] and[InlineEquation not available: see fulltext.] for random and skilled forgeries for stolen token (worst case) scenario, and[InlineEquation not available: see fulltext.] for both forgeries in the genuine token (optimal) scenario.

A discrete mechanics framework for real time virtual surgical simulations with application to virtual laparoscopic nephrectomy.

PubMed

Zhou, Xiangmin; Zhang, Nan; Sha, Desong; Shen, Yunhe; Tamma, Kumar K; Sweet, Robert

2009-01-01

The inability to render realistic soft-tissue behavior in real time has remained a barrier to face and content aspects of validity for many virtual reality surgical training systems. Biophysically based models are not only suitable for training purposes but also for patient-specific clinical applications, physiological modeling and surgical planning. When considering the existing approaches for modeling soft tissue for virtual reality surgical simulation, the computer graphics-based approach lacks predictive capability; the mass-spring model (MSM) based approach lacks biophysically realistic soft-tissue dynamic behavior; and the finite element method (FEM) approaches fail to meet the real-time requirement. The present development stems from physics fundamental thermodynamic first law; for a space discrete dynamic system directly formulates the space discrete but time continuous governing equation with embedded material constitutive relation and results in a discrete mechanics framework which possesses a unique balance between the computational efforts and the physically realistic soft-tissue dynamic behavior. We describe the development of the discrete mechanics framework with focused attention towards a virtual laparoscopic nephrectomy application.

Discrete and continuous dynamics modeling of a mass moving on a flexible structure

NASA Technical Reports Server (NTRS)

Herman, Deborah Ann

1992-01-01

A general discrete methodology for modeling the dynamics of a mass that moves on the surface of a flexible structure is developed. This problem was motivated by the Space Station/Mobile Transporter system. A model reduction approach is developed to make the methodology applicable to large structural systems. To validate the discrete methodology, continuous formulations are also developed. Three different systems are examined: (1) simply-supported beam, (2) free-free beam, and (3) free-free beam with two points of contact between the mass and the flexible beam. In addition to validating the methodology, parametric studies were performed to examine how the system's physical properties affect its dynamics.

A Vertically Lagrangian Finite-Volume Dynamical Core for Global Models

NASA Technical Reports Server (NTRS)

Lin, Shian-Jiann

2003-01-01

A finite-volume dynamical core with a terrain-following Lagrangian control-volume discretization is described. The vertically Lagrangian discretization reduces the dimensionality of the physical problem from three to two with the resulting dynamical system closely resembling that of the shallow water dynamical system. The 2D horizontal-to-Lagrangian-surface transport and dynamical processes are then discretized using the genuinely conservative flux-form semi-Lagrangian algorithm. Time marching is split- explicit, with large-time-step for scalar transport, and small fractional time step for the Lagrangian dynamics, which permits the accurate propagation of fast waves. A mass, momentum, and total energy conserving algorithm is developed for mapping the state variables periodically from the floating Lagrangian control-volume to an Eulerian terrain-following coordinate for dealing with physical parameterizations and to prevent severe distortion of the Lagrangian surfaces. Deterministic baroclinic wave growth tests and long-term integrations using the Held-Suarez forcing are presented. Impact of the monotonicity constraint is discussed.

Fixed interval smoothing with discrete measurements.

NASA Technical Reports Server (NTRS)

Bierman, G. J.

1972-01-01

Smoothing equations for a linear continuous dynamic system with linear discrete measurements, derived from the discrete results of Rauch, Tung, and Striebel (1965), (R-T-S), are used to extend, through recursive updating, the previously published results of Bryson and Frazier (1963), (B-F), and yield a modified Bryson and Frazier, (M-B-F), algorithm. A comparison of the (M-B-F) and (R-T-S) algorithms leads to the conclusion that the former is to be preferred because it entails less computation, less storage, and less instability. It is felt that the presented (M-B-F) smoothing algorithm is a practical mechanization and should be of value in smoothing discretely observed dynamic linear systems.

Experimental transonic steady state and unsteady pressure measurements on a supercritical wing during flutter and forced discrete frequency oscillations

NASA Technical Reports Server (NTRS)

Piette, Douglas S.; Cazier, Frank W., Jr.

1989-01-01

Present flutter analysis methods do not accurately predict the flutter speeds in the transonic flow region for wings with supercritical airfoils. Aerodynamic programs using computational fluid dynamic (CFD) methods are being developed, but these programs need to be verified before they can be used with confidence. A wind tunnel test was performed to obtain all types of data necessary for correlating with CFD programs to validate them for use on high aspect ratio wings. The data include steady state and unsteady aerodynamic measurements on a nominal stiffness wing and a wing four times that stiffness. There is data during forced oscillations and during flutter at several angles of attack, Mach numbers, and tunnel densities.

A logic-based method for integer programming

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hooker, J.; Natraj, N.R.

1994-12-31

We propose a logic-based approach to integer programming that replaces traditional branch-and-cut techniques with logical analogs. Integer variables are regarded as atomic propositions. The constraints give rise to logical formulas that are analogous to separating cuts. No continuous relaxation is used. Rather, the cuts are selected so that they can be easily solved as a discrete relaxation. (In fact, defining a relaxation and generating cuts are best seen as the same problem.) We experiment with relaxations that have a k-tree structure and can be solved by nonserial dynamic programming. We also present logic-based analogs of facet-defining cuts, Chv{acute a}tal rank,more » etc. We conclude with some preliminary computational results.« less

Numerical, analytical, experimental study of fluid dynamic forces in seals

NASA Technical Reports Server (NTRS)

Shapiro, William; Artiles, Antonio; Aggarwal, Bharat; Walowit, Jed; Athavale, Mahesh M.; Preskwas, Andrzej J.

1992-01-01

NASA/Lewis Research Center is sponsoring a program for providing computer codes for analyzing and designing turbomachinery seals for future aerospace and engine systems. The program is made up of three principal components: (1) the development of advanced three dimensional (3-D) computational fluid dynamics codes, (2) the production of simpler two dimensional (2-D) industrial codes, and (3) the development of a knowledge based system (KBS) that contains an expert system to assist in seal selection and design. The first task has been to concentrate on cylindrical geometries with straight, tapered, and stepped bores. Improvements have been made by adoption of a colocated grid formulation, incorporation of higher order, time accurate schemes for transient analysis and high order discretization schemes for spatial derivatives. This report describes the mathematical formulations and presents a variety of 2-D results, including labyrinth and brush seal flows. Extensions of 3-D are presently in progress.

Error bounds of adaptive dynamic programming algorithms for solving undiscounted optimal control problems.

PubMed

Liu, Derong; Li, Hongliang; Wang, Ding

2015-06-01

In this paper, we establish error bounds of adaptive dynamic programming algorithms for solving undiscounted infinite-horizon optimal control problems of discrete-time deterministic nonlinear systems. We consider approximation errors in the update equations of both value function and control policy. We utilize a new assumption instead of the contraction assumption in discounted optimal control problems. We establish the error bounds for approximate value iteration based on a new error condition. Furthermore, we also establish the error bounds for approximate policy iteration and approximate optimistic policy iteration algorithms. It is shown that the iterative approximate value function can converge to a finite neighborhood of the optimal value function under some conditions. To implement the developed algorithms, critic and action neural networks are used to approximate the value function and control policy, respectively. Finally, a simulation example is given to demonstrate the effectiveness of the developed algorithms.

Principles of Discrete Time Mechanics

NASA Astrophysics Data System (ADS)

Jaroszkiewicz, George

2014-04-01

1. Introduction; 2. The physics of discreteness; 3. The road to calculus; 4. Temporal discretization; 5. Discrete time dynamics architecture; 6. Some models; 7. Classical cellular automata; 8. The action sum; 9. Worked examples; 10. Lee's approach to discrete time mechanics; 11. Elliptic billiards; 12. The construction of system functions; 13. The classical discrete time oscillator; 14. Type 2 temporal discretization; 15. Intermission; 16. Discrete time quantum mechanics; 17. The quantized discrete time oscillator; 18. Path integrals; 19. Quantum encoding; 20. Discrete time classical field equations; 21. The discrete time Schrodinger equation; 22. The discrete time Klein-Gordon equation; 23. The discrete time Dirac equation; 24. Discrete time Maxwell's equations; 25. The discrete time Skyrme model; 26. Discrete time quantum field theory; 27. Interacting discrete time scalar fields; 28. Space, time and gravitation; 29. Causality and observation; 30. Concluding remarks; Appendix A. Coherent states; Appendix B. The time-dependent oscillator; Appendix C. Quaternions; Appendix D. Quantum registers; References; Index.

Opening up closure. Semiotics across scales

PubMed

Lemke

2000-01-01

The dynamic emergence of new levels of organization in complex systems is related to the semiotic reorganization of discrete/continuous variety at the level below as continuous/discrete meaning for the level above. In this view both the semiotic and the dynamic closure of system levels is reopened to allow the development and evolution of greater complexity.

Nonlocal continuous models for forced vibration analysis of two- and three-dimensional ensembles of single-walled carbon nanotubes

NASA Astrophysics Data System (ADS)

Kiani, Keivan

2014-06-01

Novel nonlocal discrete and continuous models are proposed for dynamic analysis of two- and three-dimensional ensembles of single-walled carbon nanotubes (SWCNTs). The generated extra van der Waals forces between adjacent SWCNTs due to their lateral motions are evaluated via Lennard-Jones potential function. Using a nonlocal Rayleigh beam model, the discrete and continuous models are developed for both two- and three-dimensional ensembles of SWCNTs acted upon by transverse dynamic loads. The capabilities of the proposed continuous models in capturing the vibration behavior of SWCNTs ensembles are then examined through various numerical simulations. A reasonably good agreement between the results of the continuous models and those of the discrete ones is also reported. The effects of the applied load frequency, intertube spaces, and small-scale parameter on the transverse dynamic responses of both two- and three-dimensional ensembles of SWCNTs are explained. The proposed continuous models would be very useful for dynamic analyses of large populated ensembles of SWCNTs whose discrete models suffer from both computational efforts and labor costs.

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

PubMed

Gan, Xiao; Albert, Réka

2018-04-01

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

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

NASA Astrophysics Data System (ADS)

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.

Kink dynamics in a topological φ4 lattice

NASA Astrophysics Data System (ADS)

Adib, A. B.; Almeida, C. A. S.

2001-09-01

Recently proposed was a discretization for nonlinear Klein-Gordon field theories in which the resulting lattice preserves the topological (Bogomol'nyi) lower bound on the kink energy and, as a consequence, has no Peierls-Nabarro barrier even for large spatial discretizations (h~1.0). It was then suggested that these ``topological discrete systems'' are a natural choice for the numerical study of continuum kink dynamics. Giving particular emphasis to the φ4 theory, we numerically investigate kink-antikink scattering and breather formation in these topological lattices. Our results indicate that, even though these systems are quite accurate for studying free kinks in coarse lattices, for legitimate dynamical kink problems the accuracy is rather restricted to fine lattices (h~0.1). We suggest that this fact is related to the breaking of the Bogomol'nyi bound during the kink-antikink interaction, where the field profile loses its static property as required by the Bogomol'nyi argument. We conclude, therefore, that these lattices are not suitable for the study of more general kink dynamics, since a standard discretization is simpler and has effectively the same accuracy for such resolutions.

STITCHER: Dynamic assembly of likely amyloid and prion β-structures from secondary structure predictions

PubMed Central

Bryan, Allen W; O’Donnell, Charles W; Menke, Matthew; Cowen, Lenore J; Lindquist, Susan; Berger, Bonnie

2012-01-01

The supersecondary structure of amyloids and prions, proteins of intense clinical and biological interest, are difficult to determine by standard experimental or computational means. In addition, significant conformational heterogeneity is known or suspected to exist in many amyloid fibrils. Previous work has demonstrated that probability-based prediction of discrete β-strand pairs can offer insight into these structures. Here, we devise a system of energetic rules that can be used to dynamically assemble these discrete β-strand pairs into complete amyloid β-structures. The STITCHER algorithm progressively ‘stitches’ strand-pairs into full β-sheets based on a novel free-energy model, incorporating experimentally observed amino-acid side-chain stacking contributions, entropic estimates, and steric restrictions for amyloidal parallel β-sheet construction. A dynamic program computes the top 50 structures and returns both the highest scoring structure and a consensus structure taken by polling this list for common discrete elements. Putative structural heterogeneity can be inferred from sequence regions that compose poorly. Predictions show agreement with experimental models of Alzheimer’s amyloid beta peptide and the Podospora anserina Het-s prion. Predictions of the HET-s homolog HET-S also reflect experimental observations of poor amyloid formation. We put forward predicted structures for the yeast prion Sup35, suggesting N-terminal structural stability enabled by tyrosine ladders, and C-terminal heterogeneity. Predictions for the Rnq1 prion and alpha-synuclein are also given, identifying a similar mix of homogenous and heterogeneous secondary structure elements. STITCHER provides novel insight into the energetic basis of amyloid structure, provides accurate structure predictions, and can help guide future experimental studies. Proteins 2012. © 2011 Wiley Periodicals, Inc. PMID:22095906

STITCHER: Dynamic assembly of likely amyloid and prion β-structures from secondary structure predictions.

PubMed

Bryan, Allen W; O'Donnell, Charles W; Menke, Matthew; Cowen, Lenore J; Lindquist, Susan; Berger, Bonnie

2012-02-01

The supersecondary structure of amyloids and prions, proteins of intense clinical and biological interest, are difficult to determine by standard experimental or computational means. In addition, significant conformational heterogeneity is known or suspected to exist in many amyloid fibrils. Previous work has demonstrated that probability-based prediction of discrete β-strand pairs can offer insight into these structures. Here, we devise a system of energetic rules that can be used to dynamically assemble these discrete β-strand pairs into complete amyloid β-structures. The STITCHER algorithm progressively 'stitches' strand-pairs into full β-sheets based on a novel free-energy model, incorporating experimentally observed amino-acid side-chain stacking contributions, entropic estimates, and steric restrictions for amyloidal parallel β-sheet construction. A dynamic program computes the top 50 structures and returns both the highest scoring structure and a consensus structure taken by polling this list for common discrete elements. Putative structural heterogeneity can be inferred from sequence regions that compose poorly. Predictions show agreement with experimental models of Alzheimer's amyloid beta peptide and the Podospora anserina Het-s prion. Predictions of the HET-s homolog HET-S also reflect experimental observations of poor amyloid formation. We put forward predicted structures for the yeast prion Sup35, suggesting N-terminal structural stability enabled by tyrosine ladders, and C-terminal heterogeneity. Predictions for the Rnq1 prion and alpha-synuclein are also given, identifying a similar mix of homogenous and heterogeneous secondary structure elements. STITCHER provides novel insight into the energetic basis of amyloid structure, provides accurate structure predictions, and can help guide future experimental studies. Copyright © 2011 Wiley Periodicals, Inc.

State transformations and Hamiltonian structures for optimal control in discrete systems

NASA Astrophysics Data System (ADS)

Sieniutycz, S.

2006-04-01

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

Observability of discretized partial differential equations

NASA Technical Reports Server (NTRS)

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.

Discrete-time pilot model. [human dynamics and digital simulation

NASA Technical Reports Server (NTRS)

Cavalli, D.

1978-01-01

Pilot behavior is considered as a discrete-time process where the decision making has a sequential nature. This model differs from both the quasilinear model which follows from classical control theory and from the optimal control model which considers the human operator as a Kalman estimator-predictor. An additional factor considered is that the pilot's objective may not be adequately formulated as a quadratic cost functional to be minimized, but rather as a more fuzzy measure of the closeness with which the aircraft follows a reference trajectory. All model parameters, in the digital program simulating the pilot's behavior, were successfully compared in terms of standard-deviation and performance with those of professional pilots in IFR configuration. The first practical application of the model was in the study of its performance degradation when the aircraft model static margin decreases.

Determining Trajectory of Triboelectrically Charged Particles, Using Discrete Element Modeling

NASA Technical Reports Server (NTRS)

2008-01-01

The Kennedy Space Center (KSC) Electrostatics and Surface Physics Laboratory is participating in an Innovative Partnership Program (IPP) project with an industry partner to modify a commercial off-the-shelf simulation software product to treat the electrodynamics of particulate systems. Discrete element modeling (DEM) is a numerical technique that can track the dynamics of particle systems. This technique, which was introduced in 1979 for analysis of rock mechanics, was recently refined to include the contact force interaction of particles with arbitrary surfaces and moving machinery. In our work, we endeavor to incorporate electrostatic forces into the DEM calculations to enhance the fidelity of the software and its applicability to (1) particle processes, such as electrophotography, that are greatly affected by electrostatic forces, (2) grain and dust transport, and (3) the study of lunar and Martian regoliths.

Disease-induced mortality in density-dependent discrete-time S-I-S epidemic models.

PubMed

Franke, John E; Yakubu, Abdul-Aziz

2008-12-01

The dynamics of simple discrete-time epidemic models without disease-induced mortality are typically characterized by global transcritical bifurcation. We prove that in corresponding models with disease-induced mortality a tiny number of infectious individuals can drive an otherwise persistent population to extinction. Our model with disease-induced mortality supports multiple attractors. In addition, we use a Ricker recruitment function in an SIS model and obtained a three component discrete Hopf (Neimark-Sacker) cycle attractor coexisting with a fixed point attractor. The basin boundaries of the coexisting attractors are fractal in nature, and the example exhibits sensitive dependence of the long-term disease dynamics on initial conditions. Furthermore, we show that in contrast to corresponding models without disease-induced mortality, the disease-free state dynamics do not drive the disease dynamics.

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

NASA Technical Reports Server (NTRS)

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.

International Neural Network Society Annual Meeting (1994) Held in San Diego, California on 5-9 June 1994. Volume 1

DTIC Science & Technology

1994-06-09

Ethics and the Soul 1-221 P. Werbos A Net Program for Natural Language Comprehension 1-863 J. Weiss Applications Oral ANN Design of Image Processing...Controlling Nonlinear Dynamic Systems Using Neuro-Fuzzy Networks 1-787 E. Teixera, G. Laforga, H. Azevedo Neural Fuzzy Logics as a Tool for Design Ecological ...Discrete Neural Network 11-466 Z. Cheng-fu Representation of Number A Theory of Mathematical Modeling 11-479 J. Cristofano An Ecological Approach to

Optimal Trajectories Generation in Robotic Fiber Placement Systems

NASA Astrophysics Data System (ADS)

Gao, Jiuchun; Pashkevich, Anatol; Caro, Stéphane

2017-06-01

The paper proposes a methodology for optimal trajectories generation in robotic fiber placement systems. A strategy to tune the parameters of the optimization algorithm at hand is also introduced. The presented technique transforms the original continuous problem into a discrete one where the time-optimal motions are generated by using dynamic programming. The developed strategy for the optimization algorithm tuning allows essentially reducing the computing time and obtaining trajectories satisfying industrial constraints. Feasibilities and advantages of the proposed methodology are confirmed by an application example.

Characterization of Pump-Induced Acoustics in Space Launch System Main Propulsion System Liquid Hydrogen Feedline Using Airflow Test Data

NASA Technical Reports Server (NTRS)

Eberhart, C. J.; Snellgrove, L. M.; Zoladz, T. F.

2015-01-01

High intensity acoustic edgetones located upstream of the RS-25 Low Pressure Fuel Turbo Pump (LPFTP) were previously observed during Space Launch System (STS) airflow testing of a model Main Propulsion System (MPS) liquid hydrogen (LH2) feedline mated to a modified LPFTP. MPS hardware has been adapted to mitigate the problematic edgetones as part of the Space Launch System (SLS) program. A follow-on airflow test campaign has subjected the adapted hardware to tests mimicking STS-era airflow conditions, and this manuscript describes acoustic environment identification and characterization born from the latest test results. Fluid dynamics responsible for driving discrete excitations were well reproduced using legacy hardware. The modified design was found insensitive to high intensity edgetone-like discretes over the bandwidth of interest to SLS MPS unsteady environments. Rather, the natural acoustics of the test article were observed to respond in a narrowband-random/mixed discrete manner to broadband noise thought generated by the flow field. The intensity of these responses were several orders of magnitude reduced from those driven by edgetones.

A computational framework for prime implicants identification in noncoherent dynamic systems.

PubMed

Di Maio, Francesco; Baronchelli, Samuele; Zio, Enrico

2015-01-01

Dynamic reliability methods aim at complementing the capability of traditional static approaches (e.g., event trees [ETs] and fault trees [FTs]) by accounting for the system dynamic behavior and its interactions with the system state transition process. For this, the system dynamics is here described by a time-dependent model that includes the dependencies with the stochastic transition events. In this article, we present a novel computational framework for dynamic reliability analysis whose objectives are i) accounting for discrete stochastic transition events and ii) identifying the prime implicants (PIs) of the dynamic system. The framework entails adopting a multiple-valued logic (MVL) to consider stochastic transitions at discretized times. Then, PIs are originally identified by a differential evolution (DE) algorithm that looks for the optimal MVL solution of a covering problem formulated for MVL accident scenarios. For testing the feasibility of the framework, a dynamic noncoherent system composed of five components that can fail at discretized times has been analyzed, showing the applicability of the framework to practical cases. © 2014 Society for Risk Analysis.

A comparison of washout filters using a human dynamic orientation model. M.S. Thesis

NASA Technical Reports Server (NTRS)

Riedel, S. A.

1977-01-01

The Ormsby model of human dynamic orientation, a discrete time computer program, was used to provide a vestibular explanation for observed differences between two washout schemes. These washout schemes, a linear washout and a nonlinear washout, were subjectively evaluated. It was found that the linear washout presented false rate cues, causing pilots to rate the simulation fidelity of the linear scheme much lower than the nonlinear scheme. By inputting these motion histories into the Ormsby model, it was shown that the linear filter causes discontinuities in the pilot's perceived angular velocity, resulting in the sensation of an anomalous rate cue. This phenomenon does not occur with the use of the nonlinear filter.

A discrete geometric approach for simulating the dynamics of thin viscous threads

DOE Office of Scientific and Technical Information (OSTI.GOV)

Audoly, B., E-mail: audoly@lmm.jussieu.fr; Clauvelin, N.; Brun, P.-T.

We present a numerical model for the dynamics of thin viscous threads based on a discrete, Lagrangian formulation of the smooth equations. The model makes use of a condensed set of coordinates, called the centerline/spin representation: the kinematic constraints linking the centerline's tangent to the orientation of the material frame is used to eliminate two out of three degrees of freedom associated with rotations. Based on a description of twist inspired from discrete differential geometry and from variational principles, we build a full-fledged discrete viscous thread model, which includes in particular a discrete representation of the internal viscous stress. Consistencymore » of the discrete model with the classical, smooth equations for thin threads is established formally. Our numerical method is validated against reference solutions for steady coiling. The method makes it possible to simulate the unsteady behavior of thin viscous threads in a robust and efficient way, including the combined effects of inertia, stretching, bending, twisting, large rotations and surface tension.« less

High-Efficiency High-Resolution Global Model Developments at the NASA Goddard Data Assimilation Office

NASA Technical Reports Server (NTRS)

Lin, Shian-Jiann; Atlas, Robert (Technical Monitor)

2002-01-01

The Data Assimilation Office (DAO) has been developing a new generation of ultra-high resolution General Circulation Model (GCM) that is suitable for 4-D data assimilation, numerical weather predictions, and climate simulations. These three applications have conflicting requirements. For 4-D data assimilation and weather predictions, it is highly desirable to run the model at the highest possible spatial resolution (e.g., 55 km or finer) so as to be able to resolve and predict socially and economically important weather phenomena such as tropical cyclones, hurricanes, and severe winter storms. For climate change applications, the model simulations need to be carried out for decades, if not centuries. To reduce uncertainty in climate change assessments, the next generation model would also need to be run at a fine enough spatial resolution that can at least marginally simulate the effects of intense tropical cyclones. Scientific problems (e.g., parameterization of subgrid scale moist processes) aside, all three areas of application require the model's computational performance to be dramatically improved as compared to the previous generation. In this talk, I will present the current and future developments of the "finite-volume dynamical core" at the Data Assimilation Office. This dynamical core applies modem monotonicity preserving algorithms and is genuinely conservative by construction, not by an ad hoc fixer. The "discretization" of the conservation laws is purely local, which is clearly advantageous for resolving sharp gradient flow features. In addition, the local nature of the finite-volume discretization also has a significant advantage on distributed memory parallel computers. Together with a unique vertically Lagrangian control volume discretization that essentially reduces the dimension of the computational problem from three to two, the finite-volume dynamical core is very efficient, particularly at high resolutions. I will also present the computational design of the dynamical core using a hybrid distributed-shared memory programming paradigm that is portable to virtually any of today's high-end parallel super-computing clusters.

High-Efficiency High-Resolution Global Model Developments at the NASA Goddard Data Assimilation Office

NASA Technical Reports Server (NTRS)

Lin, Shian-Jiann; Atlas, Robert (Technical Monitor)

2002-01-01

The Data Assimilation Office (DAO) has been developing a new generation of ultra-high resolution General Circulation Model (GCM) that is suitable for 4-D data assimilation, numerical weather predictions, and climate simulations. These three applications have conflicting requirements. For 4-D data assimilation and weather predictions, it is highly desirable to run the model at the highest possible spatial resolution (e.g., 55 kin or finer) so as to be able to resolve and predict socially and economically important weather phenomena such as tropical cyclones, hurricanes, and severe winter storms. For climate change applications, the model simulations need to be carried out for decades, if not centuries. To reduce uncertainty in climate change assessments, the next generation model would also need to be run at a fine enough spatial resolution that can at least marginally simulate the effects of intense tropical cyclones. Scientific problems (e.g., parameterization of subgrid scale moist processes) aside, all three areas of application require the model's computational performance to be dramatically improved as compared to the previous generation. In this talk, I will present the current and future developments of the "finite-volume dynamical core" at the Data Assimilation Office. This dynamical core applies modem monotonicity preserving algorithms and is genuinely conservative by construction, not by an ad hoc fixer. The "discretization" of the conservation laws is purely local, which is clearly advantageous for resolving sharp gradient flow features. In addition, the local nature of the finite-volume discretization also has a significant advantage on distributed memory parallel computers. Together with a unique vertically Lagrangian control volume discretization that essentially reduces the dimension of the computational problem from three to two, the finite-volume dynamical core is very efficient, particularly at high resolutions. I will also present the computational design of the dynamical core using a hybrid distributed- shared memory programming paradigm that is portable to virtually any of today's high-end parallel super-computing clusters.

Discrete Dynamics Lab

NASA Astrophysics Data System (ADS)

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.

Reversing the irreversible: From limit cycles to emergent time symmetry

NASA Astrophysics Data System (ADS)

Cortês, Marina; Smolin, Lee

2018-01-01

In 1979 Penrose hypothesized that the arrows of time are explained by the hypothesis that the fundamental laws are time irreversible [R. Penrose, in General Relativity: An Einstein Centenary Survey (1979)]. That is, our reversible laws, such as the standard model and general relativity are effective, and emerge from an underlying fundamental theory which is time irreversible. In [M. Cortês and L. Smolin, Phys. Rev. D 90, 084007 (2014), 10.1103/PhysRevD.90.084007; 90, 044035 (2014), 10.1103/PhysRevD.90.044035; 93, 084039 (2016), 10.1103/PhysRevD.93.084039] we put forward a research program aiming at realizing just this. The aim is to find a fundamental description of physics above the Planck scale, based on irreversible laws, from which will emerge the apparently reversible dynamics we observe on intermediate scales. Here we continue that program and note that a class of discrete dynamical systems are known to exhibit this very property: they have an underlying discrete irreversible evolution, but in the long term exhibit the properties of a time reversible system, in the form of limit cycles. We connect this to our original model proposal in [M. Cortês and L. Smolin, Phys. Rev. D 90, 084007 (2014), 10.1103/PhysRevD.90.084007], and show that the behaviors obtained there can be explained in terms of the same phenomenon: the attraction of the system to a basin of limit cycles, where the dynamics appears to be time reversible. Further than that, we show that our original models exhibit the very same feature: the emergence of quasiparticle excitations obtained in the earlier work in the space-time description is an expression of the system's convergence to limit cycles when seen in the causal set description.

Discrete breathers for a discrete nonlinear Schrödinger ring coupled to a central site.

PubMed

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.

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

PubMed

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.

The Role of Twinning Deformation on the Hardening Response of Polycrystalline Magnesium from Discrete Dislocation Dynamics Simulations

DTIC Science & Technology

2015-01-01

polycrystalline magnesium (Mg) was studied using three-dimensional discrete dislocation dynamics ( DDD ). A systematic interaction model between dislocations...and f1012g tension twin boundaries (TBs) was proposed and introduced into the DDD framework. In addition, a nominal grain boundary (GB) model based...dynamics ( DDD ). A systematic interaction model between dislocations and f10 12g tension twin boundaries (TBs) was proposed and introduced into the DDD

ADAM: Analysis of Discrete Models of Biological Systems Using Computer Algebra

PubMed Central

2011-01-01

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

Josephson junction in the quantum mesoscopic electric circuits with charge discreteness

NASA Astrophysics Data System (ADS)

Pahlavani, H.

2018-04-01

A quantum mesoscopic electrical LC-circuit with charge discreteness including a Josephson junction is considered and a nonlinear Hamiltonian that describing the dynamic of such circuit is introduced. The quantum dynamical behavior (persistent current probability) is studied in the charge and phase regimes by numerical solution approaches. The time evolution of charge and current, number-difference and the bosonic phase and also the energy spectrum of a quantum mesoscopic electric LC-circuit with charge discreteness that coupled with a Josephson junction device are investigated. We show the role of the coupling energy and the electrostatic Coulomb energy of the Josephson junction in description of the quantum behavior and the spectral properties of a quantum mesoscopic electrical LC-circuits with charge discreteness.

A Surrogate Technique for Investigating Deterministic Dynamics in Discrete Human Movement.

PubMed

Taylor, Paul G; Small, Michael; Lee, Kwee-Yum; Landeo, Raul; O'Meara, Damien M; Millett, Emma L

2016-10-01

Entropy is an effective tool for investigation of human movement variability. However, before applying entropy, it can be beneficial to employ analyses to confirm that observed data are not solely the result of stochastic processes. This can be achieved by contrasting observed data with that produced using surrogate methods. Unlike continuous movement, no appropriate method has been applied to discrete human movement. This article proposes a novel surrogate method for discrete movement data, outlining the processes for determining its critical values. The proposed technique reliably generated surrogates for discrete joint angle time series, destroying fine-scale dynamics of the observed signal, while maintaining macro structural characteristics. Comparison of entropy estimates indicated observed signals had greater regularity than surrogates and were not only the result of stochastic but also deterministic processes. The proposed surrogate method is both a valid and reliable technique to investigate determinism in other discrete human movement time series.

The SDO Education and Outreach (E/PO) Program: Changing Perceptions One Program at a Time

NASA Technical Reports Server (NTRS)

Drobnes, E.; Littleton, A.; Pesnell, W. D.; Buhr, S.; Beck, K.; Durscher, R.; Hill, S.; McCaffrey, M.; McKenzie, D. E.; Myers, D.;

Hybrid discrete-time neural networks.

PubMed

Cao, Hongjun; Ibarz, Borja

2010-11-13

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

Verifying detailed fluctuation relations for discrete feedback-controlled quantum dynamics

NASA Astrophysics Data System (ADS)

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.

Improved Discretization of Grounding Lines and Calving Fronts using an Embedded-Boundary Approach in BISICLES

NASA Astrophysics Data System (ADS)

Martin, D. F.; Cornford, S. L.; Schwartz, P.; Bhalla, A.; Johansen, H.; Ng, E.

2017-12-01

Correctly representing grounding line and calving-front dynamics is of fundamental importance in modeling marine ice sheets, since the configuration of these interfaces exerts a controlling influence on the dynamics of the ice sheet. Traditional ice sheet models have struggled to correctly represent these regions without very high spatial resolution. We have developed a front-tracking discretization for grounding lines and calving fronts based on the Chombo embedded-boundary cut-cell framework. This promises better representation of these interfaces vs. a traditional stair-step discretization on Cartesian meshes like those currently used in the block-structured AMR BISICLES code. The dynamic adaptivity of the BISICLES model complements the subgrid-scale discretizations of this scheme, producing a robust approach for tracking the evolution of these interfaces. Also, the fundamental discontinuous nature of flow across grounding lines is respected by mathematically treating it as a material phase change. We present examples of this approach to demonstrate its effectiveness.

New scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times

NASA Astrophysics Data System (ADS)

Kia, Hamidreza; Ghodsypour, Seyed Hassan; Davoudpour, Hamid

2017-09-01

In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent setup times is studied. The objective of the problem is minimization of mean flow time and mean tardiness. A 0-1 mixed integer model of the problem is formulated. Since the problem is NP-hard, four new composite dispatching rules are proposed to solve it by applying genetic programming framework and choosing proper operators. Furthermore, a discrete-event simulation model is made to examine the performances of scheduling rules considering four new heuristic rules and the six adapted heuristic rules from the literature. It is clear from the experimental results that composite dispatching rules that are formed from genetic programming have a better performance in minimization of mean flow time and mean tardiness than others.

Strong dynamics and lattice gauge theory

NASA Astrophysics Data System (ADS)

Schaich, David

In this dissertation I use lattice gauge theory to study models of electroweak symmetry breaking that involve new strong dynamics. Electroweak symmetry breaking (EWSB) is the process by which elementary particles acquire mass. First proposed in the 1960s, this process has been clearly established by experiments, and can now be considered a law of nature. However, the physics underlying EWSB is still unknown, and understanding it remains a central challenge in particle physics today. A natural possibility is that EWSB is driven by the dynamics of some new, strongly-interacting force. Strong interactions invalidate the standard analytical approach of perturbation theory, making these models difficult to study. Lattice gauge theory is the premier method for obtaining quantitatively-reliable, nonperturbative predictions from strongly-interacting theories. In this approach, we replace spacetime by a regular, finite grid of discrete sites connected by links. The fields and interactions described by the theory are likewise discretized, and defined on the lattice so that we recover the original theory in continuous spacetime on an infinitely large lattice with sites infinitesimally close together. The finite number of degrees of freedom in the discretized system lets us simulate the lattice theory using high-performance computing. Lattice gauge theory has long been applied to quantum chromodynamics, the theory of strong nuclear interactions. Using lattice gauge theory to study dynamical EWSB, as I do in this dissertation, is a new and exciting application of these methods. Of particular interest is non-perturbative lattice calculation of the electroweak S parameter. Experimentally S ≈ -0.15(10), which tightly constrains dynamical EWSB. On the lattice, I extract S from the momentum-dependence of vector and axial-vector current correlators. I created and applied computer programs to calculate these correlators and analyze them to determine S. I also calculated the masses and other properties of the new particles predicted by these theories. I find S ≳ 0.1 in the specific theories I study. Although this result still disagrees with experiment, it is much closer to the experimental value than is the conventional wisdom S ≳ 0.3. These results encourage further lattice studies to search for experimentally viable strongly-interacting theories of EWSB.

Complex discrete dynamics from simple continuous population models.

PubMed

Gamarra, Javier G P; Solé, Ricard V

2002-05-01

Nonoverlapping generations have been classically modelled as difference equations in order to account for the discrete nature of reproductive events. However, other events such as resource consumption or mortality are continuous and take place in the within-generation time. We have realistically assumed a hybrid ODE bidimensional model of resources and consumers with discrete events for reproduction. Numerical and analytical approaches showed that the resulting dynamics resembles a Ricker map, including the doubling route to chaos. Stochastic simulations with a handling-time parameter for indirect competition of juveniles may affect the qualitative behaviour of the model.

Multiple coupled landscapes and non-adiabatic dynamics with applications to self-activating genes.

PubMed

Chen, Cong; Zhang, Kun; Feng, Haidong; Sasai, Masaki; Wang, Jin

2015-11-21

Many physical, chemical and biochemical systems (e.g. electronic dynamics and gene regulatory networks) are governed by continuous stochastic processes (e.g. electron dynamics on a particular electronic energy surface and protein (gene product) synthesis) coupled with discrete processes (e.g. hopping among different electronic energy surfaces and on and off switching of genes). One can also think of the underlying dynamics as the continuous motion on a particular landscape and discrete hoppings among different landscapes. The main difference of such systems from the intra-landscape dynamics alone is the emergence of the timescale involved in transitions among different landscapes in addition to the timescale involved in a particular landscape. The adiabatic limit when inter-landscape hoppings are fast compared to continuous intra-landscape dynamics has been studied both analytically and numerically, but the analytical treatment of the non-adiabatic regime where the inter-landscape hoppings are slow or comparable to continuous intra-landscape dynamics remains challenging. In this study, we show that there exists mathematical mapping of the dynamics on 2(N) discretely coupled N continuous dimensional landscapes onto one single landscape in 2N dimensional extended continuous space. On this 2N dimensional landscape, eddy current emerges as a sign of non-equilibrium non-adiabatic dynamics and plays an important role in system evolution. Many interesting physical effects such as the enhancement of fluctuations, irreversibility, dissipation and optimal kinetics emerge due to non-adiabaticity manifested by the eddy current illustrated for an N = 1 self-activator. We further generalize our theory to the N-gene network with multiple binding sites and multiple synthesis rates for discretely coupled non-equilibrium stochastic physical and biological systems.

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

ERIC Educational Resources Information Center

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

Application of Dynamic Analysis in Semi-Analytical Finite Element Method.

PubMed

Liu, Pengfei; Xing, Qinyan; Wang, Dawei; Oeser, Markus

2017-08-30

Analyses of dynamic responses are significantly important for the design, maintenance and rehabilitation of asphalt pavement. In order to evaluate the dynamic responses of asphalt pavement under moving loads, a specific computational program, SAFEM, was developed based on a semi-analytical finite element method. This method is three-dimensional and only requires a two-dimensional FE discretization by incorporating Fourier series in the third dimension. In this paper, the algorithm to apply the dynamic analysis to SAFEM was introduced in detail. Asphalt pavement models under moving loads were built in the SAFEM and commercial finite element software ABAQUS to verify the accuracy and efficiency of the SAFEM. The verification shows that the computational accuracy of SAFEM is high enough and its computational time is much shorter than ABAQUS. Moreover, experimental verification was carried out and the prediction derived from SAFEM is consistent with the measurement. Therefore, the SAFEM is feasible to reliably predict the dynamic response of asphalt pavement under moving loads, thus proving beneficial to road administration in assessing the pavement's state.

On Revenue-Optimal Dynamic Auctions for Bidders with Interdependent Values

NASA Astrophysics Data System (ADS)

Constantin, Florin; Parkes, David C.

In a dynamic market, being able to update one's value based on information available to other bidders currently in the market can be critical to having profitable transactions. This is nicely captured by the model of interdependent values (IDV): a bidder's value can explicitly depend on the private information of other bidders. In this paper we present preliminary results about the revenue properties of dynamic auctions for IDV bidders. We adopt a computational approach to design single-item revenue-optimal dynamic auctions with known arrivals and departures but (private) signals that arrive online. In leveraging a characterization of truthful auctions, we present a mixed-integer programming formulation of the design problem. Although a discretization is imposed on bidder signals the solution is a mechanism applicable to continuous signals. The formulation size grows exponentially in the dependence of bidders' values on other bidders' signals. We highlight general properties of revenue-optimal dynamic auctions in a simple parametrized example and study the sensitivity of prices and revenue to model parameters.

Evaluating the Effectiveness of Two Commonly Used Discrete Trial Procedures for Teaching Receptive Discrimination to Young Children with Autism Spectrum Disorders

ERIC Educational Resources Information Center

Gutierrez, Anibal, Jr.; Hale, Melissa N.; O'Brien, Heather A.; Fischer, Aaron J.; Durocher, Jennifer S.; Alessandri, Michael

2009-01-01

Discrete trial teaching procedures have been demonstrated to be effective in teaching a variety of important skills for children with autism spectrum disorders (ASD). Although all discrete trial programs are based in the principles of applied behavior analysis, some variability exists between programs with regards to the precise teaching…

Direction with Discretion: Reading Recovery as an Example of Balancing Top-Down Policy and Bottom-Up Decision-Making.

ERIC Educational Resources Information Center

Scharer, Patricia L.; Zajano, Nancy C.

Educational policy analysts have recognized the need for an educational policy that combines the merits of "top-down" mandates with "bottom-up" teacher discretion. This paper describes the Reading Recovery program as an example of an educational program that balances top-down direction and bottom-up discretion by: (1) providing an overall…

A method for solution of the Euler-Bernoulli beam equation in flexible-link robotic systems

NASA Technical Reports Server (NTRS)

Tzes, Anthony P.; Yurkovich, Stephen; Langer, F. Dieter

1989-01-01

An efficient numerical method for solving the partial differential equation (PDE) governing the flexible manipulator control dynamics is presented. A finite-dimensional model of the equation is obtained through discretization in both time and space coordinates by using finite-difference approximations to the PDE. An expert program written in the Macsyma symbolic language is utilized in order to embed the boundary conditions into the program, accounting for a mass carried at the tip of the manipulator. The advantages of the proposed algorithm are many, including the ability to (1) include any distributed actuation term in the partial differential equation, (2) provide distributed sensing of the beam displacement, (3) easily modify the boundary conditions through an expert program, and (4) modify the structure for running under a multiprocessor environment.

INTERDISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY: Estimating Topology of Discrete Dynamical Networks

NASA Astrophysics Data System (ADS)

Guo, Shu-Juan; Fu, Xin-Chu

2010-07-01

In this paper, by applying Lasalle's invariance principle and some results about the trace of a matrix, we propose a method for estimating the topological structure of a discrete dynamical network based on the dynamical evolution of the network. The network concerned can be directed or undirected, weighted or unweighted, and the local dynamics of each node can be nonidentical. The connections among the nodes can be all unknown or partially known. Finally, two examples, including a Hénon map and a central network, are illustrated to verify the theoretical results.

On discrete control of nonlinear systems with applications to robotics

NASA Technical Reports Server (NTRS)

Eslami, Mansour

1989-01-01

Much progress has been reported in the areas of modeling and control of nonlinear dynamic systems in a continuous-time framework. From implementation point of view, however, it is essential to study these nonlinear systems directly in a discrete setting that is amenable for interfacing with digital computers. But to develop discrete models and discrete controllers for a nonlinear system such as robot is a nontrivial task. Robot is also inherently a variable-inertia dynamic system involving additional complications. Not only the computer-oriented models of these systems must satisfy the usual requirements for such models, but these must also be compatible with the inherent capabilities of computers and must preserve the fundamental physical characteristics of continuous-time systems such as the conservation of energy and/or momentum. Preliminary issues regarding discrete systems in general and discrete models of a typical industrial robot that is developed with full consideration of the principle of conservation of energy are presented. Some research on the pertinent tactile information processing is reviewed. Finally, system control methods and how to integrate these issues in order to complete the task of discrete control of a robot manipulator are also reviewed.

Nonlinear wave propagation in discrete and continuous systems

NASA Astrophysics Data System (ADS)

Rothos, V. M.

2016-09-01

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

Real-time discrete suboptimal control for systems with input and state delays: Experimental tests on a dehydration process.

PubMed

Rodríguez-Guerrero, Liliam; Santos-Sánchez, Omar-Jacobo; Cervantes-Escorcia, Nicolás; Romero, Hugo

2017-11-01

This article presents a suboptimal control strategy with finite horizon for affine nonlinear discrete systems with both state and input delays. The Dynamic Programming Approach is used to obtain the suboptimal control sequence, but in order to avoid the computation of the Bellman functional, a numerical approximation of this function is proposed in every step. The feasibility of our proposal is demonstrated via an experimental test on a dehydration process and the obtained results show a good performance and behavior of this process. Then in order to demonstrate the benefits of using this kind of control strategy, the results are compared with a non optimal control strategy, particularly with respect to results produced by an industrial Proportional Integral Derivative (PID) Honeywell controller, which is tuned using the Ziegler-Nichols method. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

On optimal control of linear systems in the presence of multiplicative noise

NASA Technical Reports Server (NTRS)

Joshi, S. M.

1976-01-01

This correspondence considers the problem of optimal regulator design for discrete time linear systems subjected to white state-dependent and control-dependent noise in addition to additive white noise in the input and the observations. A pseudo-deterministic problem is first defined in which multiplicative and additive input disturbances are present, but noise-free measurements of the complete state vector are available. This problem is solved via discrete dynamic programming. Next is formulated the problem in which the number of measurements is less than that of the state variables and the measurements are contaminated with state-dependent noise. The inseparability of control and estimation is brought into focus, and an 'enforced separation' solution is obtained via heuristic reasoning in which the control gains are shown to be the same as those in the pseudo-deterministic problem. An optimal linear state estimator is given in order to implement the controller.

The Hungtsaiping landslide:A kinematic model based on morphology

NASA Astrophysics Data System (ADS)

Huang, W.-K.; Chu, H.-K.; Lo, C.-M.; Lin, M.-L.

2012-04-01

A large and deep-seated landslide at Hungtsaiping was triggered by the 7.3 magnitude 1999 Chi-Chi earthquake. Extensive site investigations of the landslide were conducted including field reconnaissance, geophysical exploration, borehole logs, and laboratory experiments. Thick colluvium was found around the landslide area and indicated the occurrence of a large ancient landslide. This study presents the catastrophic landslide event which occurred during the Chi-Chi earthquake. The mechanism of the 1999 landslide which cannot be revealed by the underground exploration data alone, is clarified. This research include investigations of the landslide kinematic process and the deposition geometry. A 3D discrete element method (program), PFC3D, was used to model the kinematic process that led to the landslide. The proposed procedure enables a rational and efficient way to simulate the landslide dynamic process. Key word: Hungtsaiping catastrophic landslide, kinematic process, deposition geometry, discrete element method

LQR-Based Optimal Distributed Cooperative Design for Linear Discrete-Time Multiagent Systems.

PubMed

Zhang, Huaguang; Feng, Tao; Liang, Hongjing; Luo, Yanhong

2017-03-01

In this paper, a novel linear quadratic regulator (LQR)-based optimal distributed cooperative design method is developed for synchronization control of general linear discrete-time multiagent systems on a fixed, directed graph. Sufficient conditions are derived for synchronization, which restrict the graph eigenvalues into a bounded circular region in the complex plane. The synchronizing speed issue is also considered, and it turns out that the synchronizing region reduces as the synchronizing speed becomes faster. To obtain more desirable synchronizing capacity, the weighting matrices are selected by sufficiently utilizing the guaranteed gain margin of the optimal regulators. Based on the developed LQR-based cooperative design framework, an approximate dynamic programming technique is successfully introduced to overcome the (partially or completely) model-free cooperative design for linear multiagent systems. Finally, two numerical examples are given to illustrate the effectiveness of the proposed design methods.

Analysis of Tire Tractive Performance on Deformable Terrain by Finite Element-Discrete Element Method

NASA Astrophysics Data System (ADS)

Nakashima, Hiroshi; Takatsu, Yuzuru

The goal of this study is to develop a practical and fast simulation tool for soil-tire interaction analysis, where finite element method (FEM) and discrete element method (DEM) are coupled together, and which can be realized on a desktop PC. We have extended our formerly proposed dynamic FE-DE method (FE-DEM) to include practical soil-tire system interaction, where not only the vertical sinkage of a tire, but also the travel of a driven tire was considered. Numerical simulation by FE-DEM is stable, and the relationships between variables, such as load-sinkage and sinkage-travel distance, and the gross tractive effort and running resistance characteristics, are obtained. Moreover, the simulation result is accurate enough to predict the maximum drawbar pull for a given tire, once the appropriate parameter values are provided. Therefore, the developed FE-DEM program can be applied with sufficient accuracy to interaction problems in soil-tire systems.

Some Classes of Imperfect Information Finite State-Space Stochastic Games with Finite-Dimensional Solutions

DOE Office of Scientific and Technical Information (OSTI.GOV)

McEneaney, William M.

2004-08-15

Stochastic games under imperfect information are typically computationally intractable even in the discrete-time/discrete-state case considered here. We consider a problem where one player has perfect information.A function of a conditional probability distribution is proposed as an information state.In the problem form here, the payoff is only a function of the terminal state of the system,and the initial information state is either linear ora sum of max-plus delta functions.When the initial information state belongs to these classes, its propagation is finite-dimensional.The state feedback value function is also finite-dimensional,and obtained via dynamic programming,but has a nonstandard form due to the necessity ofmore » an expanded state variable.Under a saddle point assumption,Certainty Equivalence is obtained and the proposed function is indeed an information state.« less

Stability analysis of the Euler discretization for SIR epidemic model

DOE Office of Scientific and Technical Information (OSTI.GOV)

Suryanto, Agus

2014-06-19

In this paper we consider a discrete SIR epidemic model obtained by the Euler method. For that discrete model, existence of disease free equilibrium and endemic equilibrium is established. Sufficient conditions on the local asymptotical stability of both disease free equilibrium and endemic equilibrium are also derived. It is found that the local asymptotical stability of the existing equilibrium is achieved only for a small time step size h. If h is further increased and passes the critical value, then both equilibriums will lose their stability. Our numerical simulations show that a complex dynamical behavior such as bifurcation or chaosmore » phenomenon will appear for relatively large h. Both analytical and numerical results show that the discrete SIR model has a richer dynamical behavior than its continuous counterpart.« less

RINGMesh: A programming library for developing mesh-based geomodeling applications

NASA Astrophysics Data System (ADS)

Pellerin, Jeanne; Botella, Arnaud; Bonneau, François; Mazuyer, Antoine; Chauvin, Benjamin; Lévy, Bruno; Caumon, Guillaume

2017-07-01

RINGMesh is a C++ open-source programming library for manipulating discretized geological models. It is designed to ease the development of applications and workflows that use discretized 3D models. It is neither a geomodeler, nor a meshing software. RINGMesh implements functionalities to read discretized surface-based or volumetric structural models and to check their validity. The models can be then exported in various file formats. RINGMesh provides data structures to represent geological structural models, either defined by their discretized boundary surfaces, and/or by discretized volumes. A programming interface allows to develop of new geomodeling methods, and to plug in external software. The goal of RINGMesh is to help researchers to focus on the implementation of their specific method rather than on tedious tasks common to many applications. The documented code is open-source and distributed under the modified BSD license. It is available at https://www.ring-team.org/index.php/software/ringmesh.

AFMPB: An adaptive fast multipole Poisson-Boltzmann solver for calculating electrostatics in biomolecular systems

NASA Astrophysics Data System (ADS)

Lu, Benzhuo; Cheng, Xiaolin; Huang, Jingfang; McCammon, J. Andrew

2010-06-01

A Fortran program package is introduced for rapid evaluation of the electrostatic potentials and forces in biomolecular systems modeled by the linearized Poisson-Boltzmann equation. The numerical solver utilizes a well-conditioned boundary integral equation (BIE) formulation, a node-patch discretization scheme, a Krylov subspace iterative solver package with reverse communication protocols, and an adaptive new version of fast multipole method in which the exponential expansions are used to diagonalize the multipole-to-local translations. The program and its full description, as well as several closely related libraries and utility tools are available at http://lsec.cc.ac.cn/~lubz/afmpb.html and a mirror site at http://mccammon.ucsd.edu/. This paper is a brief summary of the program: the algorithms, the implementation and the usage. Program summaryProgram title: AFMPB: Adaptive fast multipole Poisson-Boltzmann solver Catalogue identifier: AEGB_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEGB_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: GPL 2.0 No. of lines in distributed program, including test data, etc.: 453 649 No. of bytes in distributed program, including test data, etc.: 8 764 754 Distribution format: tar.gz Programming language: Fortran Computer: Any Operating system: Any RAM: Depends on the size of the discretized biomolecular system Classification: 3 External routines: Pre- and post-processing tools are required for generating the boundary elements and for visualization. Users can use MSMS ( http://www.scripps.edu/~sanner/html/msms_home.html) for pre-processing, and VMD ( http://www.ks.uiuc.edu/Research/vmd/) for visualization. Sub-programs included: An iterative Krylov subspace solvers package from SPARSKIT by Yousef Saad ( http://www-users.cs.umn.edu/~saad/software/SPARSKIT/sparskit.html), and the fast multipole methods subroutines from FMMSuite ( http://www.fastmultipole.org/). Nature of problem: Numerical solution of the linearized Poisson-Boltzmann equation that describes electrostatic interactions of molecular systems in ionic solutions. Solution method: A novel node-patch scheme is used to discretize the well-conditioned boundary integral equation formulation of the linearized Poisson-Boltzmann equation. Various Krylov subspace solvers can be subsequently applied to solve the resulting linear system, with a bounded number of iterations independent of the number of discretized unknowns. The matrix-vector multiplication at each iteration is accelerated by the adaptive new versions of fast multipole methods. The AFMPB solver requires other stand-alone pre-processing tools for boundary mesh generation, post-processing tools for data analysis and visualization, and can be conveniently coupled with different time stepping methods for dynamics simulation. Restrictions: Only three or six significant digits options are provided in this version. Unusual features: Most of the codes are in Fortran77 style. Memory allocation functions from Fortran90 and above are used in a few subroutines. Additional comments: The current version of the codes is designed and written for single core/processor desktop machines. Check http://lsec.cc.ac.cn/~lubz/afmpb.html and http://mccammon.ucsd.edu/ for updates and changes. Running time: The running time varies with the number of discretized elements ( N) in the system and their distributions. In most cases, it scales linearly as a function of N.

Dynamic ambulance reallocation for the reduction of ambulance response times using system status management.

PubMed

Lam, Sean Shao Wei; Zhang, Ji; Zhang, Zhong Cheng; Oh, Hong Choon; Overton, Jerry; Ng, Yih Yng; Ong, Marcus Eng Hock

2015-02-01

Dynamically reassigning ambulance deployment locations throughout a day to balance ambulance availability and demands can be effective in reducing response times. The objectives of this study were to model dynamic ambulance allocation plans in Singapore based on the system status management (SSM) strategy and to evaluate the dynamic deployment plans using a discrete event simulation (DES) model. The geographical information system-based analysis and mathematical programming were used to develop the dynamic ambulance deployment plans for SSM based on ambulance calls data from January 1, 2011, to June 30, 2011. A DES model that incorporated these plans was used to compare the performance of the dynamic SSM strategy against static reallocation policies under various demands and travel time uncertainties. When the deployment plans based on the SSM strategy were followed strictly, the DES model showed that the geographical information system-based plans resulted in approximately 13-second reduction in the median response times compared to the static reallocation policy, whereas the mathematical programming-based plans resulted in approximately a 44-second reduction. The response times and coverage performances were still better than the static policy when reallocations happened for only 60% of all the recommended moves. Dynamically reassigning ambulance deployment locations based on the SSM strategy can result in superior response times and coverage performance compared to static reallocation policies even when the dynamic plans were not followed strictly. Copyright © 2014 Elsevier Inc. All rights reserved.

A PLUG-AND-PLAY ARCHITECTURE FOR PROBABILISTIC PROGRAMMING

DTIC Science & Technology

2017-04-01

programs that use discrete numerical distributions, but even then, the space of possible outcomes may be uncountable (as a solution can be infinite...also identify conditions guaranteeing that all possible outcomes are finite (and then the probability space is discrete ). 2.2.2 The PlogiQL...and not determined at runtime. Nevertheless, the PRAiSE team plans to extend their solution to support numerical (continuous or discrete

Parallel Performance of Linear Solvers and Preconditioners

DTIC Science & Technology

2014-01-01

are produced by a discrete dislocation dynamics ( DDD ) simulation and change with each timestep of the DDD simulation as the dislocation structure...evolves. However, the coefficient—or stiffness matrix— remains constant during the DDD simulation and some expensive matrix factorizations only occur once...discrete dislocation dynamics ( DDD ) simulations. This can be achieved by coupling a DDD simulator for bulk material (Arsenlis et al., 2007) to a

Method for distributed agent-based non-expert simulation of manufacturing process behavior

DOEpatents

Ivezic, Nenad; Potok, Thomas E.

2004-11-30

A method for distributed agent based non-expert simulation of manufacturing process behavior on a single-processor computer comprises the steps of: object modeling a manufacturing technique having a plurality of processes; associating a distributed agent with each the process; and, programming each the agent to respond to discrete events corresponding to the manufacturing technique, wherein each discrete event triggers a programmed response. The method can further comprise the step of transmitting the discrete events to each agent in a message loop. In addition, the programming step comprises the step of conditioning each agent to respond to a discrete event selected from the group consisting of a clock tick message, a resources received message, and a request for output production message.

From Classical to Quantum: New Canonical Tools for the Dynamics of Gravity

NASA Astrophysics Data System (ADS)

Höhn, P. A.

2012-05-01

In a gravitational context, canonical methods offer an intuitive picture of the dynamics and simplify an identification of the degrees of freedom. Nevertheless, extracting dynamical information from background independent approaches to quantum gravity is a highly non-trivial challenge. In this thesis, the conundrum of (quantum) gravitational dynamics is approached from two different directions by means of new canonical tools. This thesis is accordingly divided into two parts: In the first part, a general canonical formalism for discrete systems featuring a variational action principle is developed which is equivalent to the covariant formulation following directly from the action. This formalism can handle evolving phase spaces and is thus appropriate for describing evolving lattices. Attention will be devoted to a characterization of the constraints, symmetries and degrees of freedom appearing in such discrete systems which, in the case of evolving phase spaces, is time step dependent. The advantage of this formalism is that it does not depend on the particular discretization and, hence, is suitable for coarse graining procedures. This formalism is applicable to discrete mechanics, lattice field theories and discrete gravity models---underlying some approaches to quantum gravity---and, furthermore, may prove useful for numerical imple mentations. For concreteness, these new tools are employed to formulate Regge Calculus canonically as a theory of the dynamics of discrete hypersurfaces in discrete spacetimes, thereby removing a longstanding obstacle to connecting covariant simplicial gravity models with canonical frameworks. This result is interesting in view of several background independent approaches to quantum gravity. In addition, perturbative expansions around symmetric background solutions of Regge Calculus are studied up to second order. Background gauge modes generically become propagating at second order as a consequence of a symmetry breaking. In the second part of this thesis, the paradigm of relational dynamics is considered. Dynamical observables in gravity are relational. Unfortunately, their construction and evaluation is notoriously difficult, especially in the quantum theory. An effective canonical framework is devised which permits to evaluate the semiclassical relational dynamics of constrained quantum systems by sidestepping technical problems associated with explicit constructions of physical Hilbert spaces. This effective approach is well-geared for addressing the concept of relational evolution in general quantum cosmological models since it (i) allows to depart from idealized relational `clock references’ and, instead, to employ generic degrees of freedom as imperfect relational `clocks’, (ii) enables one to systematically switch between different such `clocks’ and (iii) yields a consistent (temporally) local time evolution with transient observables so long as semiclassicality holds. These techniques are illustrated by toy models and, finally, are applied to a non-integrable cosmological model. It is argued that relational evolution is generically only a transient and semiclassical phenomenon

Discrete virus infection model of hepatitis B virus.

PubMed

Zhang, Pengfei; Min, Lequan; Pian, Jianwei

2015-01-01

In 1996 Nowak and his colleagues proposed a differential equation virus infection model, which has been widely applied in the study for the dynamics of hepatitis B virus (HBV) infection. Biological dynamics may be described more practically by discrete events rather than continuous ones. Using discrete systems to describe biological dynamics should be reasonable. Based on one revised Nowak et al's virus infection model, this study introduces a discrete virus infection model (DVIM). Two equilibriums of this model, E1 and E2, represents infection free and infection persistent, respectively. Similar to the case of the basic virus infection model, this study deduces a basic virus reproductive number R0 independing on the number of total cells of an infected target organ. A proposed theorem proves that if the basic virus reproductive number R0<1 then the virus free equilibrium E1 is locally stable. The DVIM is more reasonable than an abstract discrete susceptible-infected-recovered model (SIRS) whose basic virus reproductive number R0 is relevant to the number of total cells of the infected target organ. As an application, this study models the clinic HBV DNA data of a patient who was accepted via anti-HBV infection therapy with drug lamivudine. The results show that the numerical simulation is good in agreement with the clinic data.

Stochastic thermodynamics across scales: Emergent inter-attractoral discrete Markov jump process and its underlying continuous diffusion

NASA Astrophysics Data System (ADS)

Santillán, Moisés; Qian, Hong

2013-01-01

We investigate the internal consistency of a recently developed mathematical thermodynamic structure across scales, between a continuous stochastic nonlinear dynamical system, i.e., a diffusion process with Langevin and Fokker-Planck equations, and its emergent discrete, inter-attractoral Markov jump process. We analyze how the system’s thermodynamic state functions, e.g. free energy F, entropy S, entropy production ep, free energy dissipation Ḟ, etc., are related when the continuous system is described with coarse-grained discrete variables. It is shown that the thermodynamics derived from the underlying, detailed continuous dynamics gives rise to exactly the free-energy representation of Gibbs and Helmholtz. That is, the system’s thermodynamic structure is the same as if one only takes a middle road and starts with the natural discrete description, with the corresponding transition rates empirically determined. By natural we mean in the thermodynamic limit of a large system, with an inherent separation of time scales between inter- and intra-attractoral dynamics. This result generalizes a fundamental idea from chemistry, and the theory of Kramers, by incorporating thermodynamics: while a mechanical description of a molecule is in terms of continuous bond lengths and angles, chemical reactions are phenomenologically described by a discrete representation, in terms of exponential rate laws and a stochastic thermodynamics.

Numerical method for solution of systems of non-stationary spatially one-dimensional nonlinear differential equations

NASA Technical Reports Server (NTRS)

Morozov, S. K.; Krasitskiy, O. P.

1978-01-01

A computational scheme and a standard program is proposed for solving systems of nonstationary spatially one-dimensional nonlinear differential equations using Newton's method. The proposed scheme is universal in its applicability and its reduces to a minimum the work of programming. The program is written in the FORTRAN language and can be used without change on electronic computers of type YeS and BESM-6. The standard program described permits the identification of nonstationary (or stationary) solutions to systems of spatially one-dimensional nonlinear (or linear) partial differential equations. The proposed method may be used to solve a series of geophysical problems which take chemical reactions, diffusion, and heat conductivity into account, to evaluate nonstationary thermal fields in two-dimensional structures when in one of the geometrical directions it can take a small number of discrete levels, and to solve problems in nonstationary gas dynamics.

A Neural Dynamic Model Generates Descriptions of Object-Oriented Actions.

PubMed

Richter, Mathis; Lins, Jonas; Schöner, Gregor

2017-01-01

Describing actions entails that relations between objects are discovered. A pervasively neural account of this process requires that fundamental problems are solved: the neural pointer problem, the binding problem, and the problem of generating discrete processing steps from time-continuous neural processes. We present a prototypical solution to these problems in a neural dynamic model that comprises dynamic neural fields holding representations close to sensorimotor surfaces as well as dynamic neural nodes holding discrete, language-like representations. Making the connection between these two types of representations enables the model to describe actions as well as to perceptually ground movement phrases-all based on real visual input. We demonstrate how the dynamic neural processes autonomously generate the processing steps required to describe or ground object-oriented actions. By solving the fundamental problems of neural pointing, binding, and emergent discrete processing, the model may be a first but critical step toward a systematic neural processing account of higher cognition. Copyright © 2017 The Authors. Topics in Cognitive Science published by Wiley Periodicals, Inc. on behalf of Cognitive Science Society.

Stochastic dynamics of time correlation in complex systems with discrete time

NASA Astrophysics Data System (ADS)

Yulmetyev, Renat; Hänggi, Peter; Gafarov, Fail

2000-11-01

In this paper we present the concept of description of random processes in complex systems with discrete time. It involves the description of kinetics of discrete processes by means of the chain of finite-difference non-Markov equations for time correlation functions (TCFs). We have introduced the dynamic (time dependent) information Shannon entropy Si(t) where i=0,1,2,3,..., as an information measure of stochastic dynamics of time correlation (i=0) and time memory (i=1,2,3,...). The set of functions Si(t) constitute the quantitative measure of time correlation disorder (i=0) and time memory disorder (i=1,2,3,...) in complex system. The theory developed started from the careful analysis of time correlation involving dynamics of vectors set of various chaotic states. We examine two stochastic processes involving the creation and annihilation of time correlation (or time memory) in details. We carry out the analysis of vectors' dynamics employing finite-difference equations for random variables and the evolution operator describing their natural motion. The existence of TCF results in the construction of the set of projection operators by the usage of scalar product operation. Harnessing the infinite set of orthogonal dynamic random variables on a basis of Gram-Shmidt orthogonalization procedure tends to creation of infinite chain of finite-difference non-Markov kinetic equations for discrete TCFs and memory functions (MFs). The solution of the equations above thereof brings to the recurrence relations between the TCF and MF of senior and junior orders. This offers new opportunities for detecting the frequency spectra of power of entropy function Si(t) for time correlation (i=0) and time memory (i=1,2,3,...). The results obtained offer considerable scope for attack on stochastic dynamics of discrete random processes in a complex systems. Application of this technique on the analysis of stochastic dynamics of RR intervals from human ECG's shows convincing evidence for a non-Markovian phenomemena associated with a peculiarities in short- and long-range scaling. This method may be of use in distinguishing healthy from pathologic data sets based in differences in these non-Markovian properties.

Recursive multibody dynamics and discrete-time optimal control

NASA Technical Reports Server (NTRS)

Deleuterio, G. M. T.; Damaren, C. J.

1989-01-01

A recursive algorithm is developed for the solution of the simulation dynamics problem for a chain of rigid bodies. Arbitrary joint constraints are permitted, that is, joints may allow translational and/or rotational degrees of freedom. The recursive procedure is shown to be identical to that encountered in a discrete-time optimal control problem. For each relevant quantity in the multibody dynamics problem, there exists an analog in the context of optimal control. The performance index that is minimized in the control problem is identified as Gibbs' function for the chain of bodies.

Geometry and dynamics in the fractional discrete Fourier transform.

PubMed

Wolf, Kurt Bernardo; Krötzsch, Guillermo

2007-03-01

The N x N Fourier matrix is one distinguished element within the group U(N) of all N x N unitary matrices. It has the geometric property of being a fourth root of unity and is close to the dynamics of harmonic oscillators. The dynamical correspondence is exact only in the N-->infinity contraction limit for the integral Fourier transform and its fractional powers. In the finite-N case, several options have been considered in the literature. We compare their fidelity in reproducing the classical harmonic motion of discrete coherent states.

Discretized Streams: A Fault-Tolerant Model for Scalable Stream Processing

DTIC Science & Technology

2012-12-14

Discretized Streams: A Fault-Tolerant Model for Scalable Stream Processing Matei Zaharia Tathagata Das Haoyuan Li Timothy Hunter Scott Shenker Ion...SUBTITLE Discretized Streams: A Fault-Tolerant Model for Scalable Stream Processing 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER...time. However, current programming models for distributed stream processing are relatively low-level often leaving the user to worry about consistency of

Dynamics of embryonic stem cell differentiation inferred from single-cell transcriptomics show a series of transitions through discrete cell states

PubMed Central

Jang, Sumin; Choubey, Sandeep; Furchtgott, Leon; Zou, Ling-Nan; Doyle, Adele; Menon, Vilas; Loew, Ethan B; Krostag, Anne-Rachel; Martinez, Refugio A; Madisen, Linda; Levi, Boaz P; Ramanathan, Sharad

2017-01-01

The complexity of gene regulatory networks that lead multipotent cells to acquire different cell fates makes a quantitative understanding of differentiation challenging. Using a statistical framework to analyze single-cell transcriptomics data, we infer the gene expression dynamics of early mouse embryonic stem (mES) cell differentiation, uncovering discrete transitions across nine cell states. We validate the predicted transitions across discrete states using flow cytometry. Moreover, using live-cell microscopy, we show that individual cells undergo abrupt transitions from a naïve to primed pluripotent state. Using the inferred discrete cell states to build a probabilistic model for the underlying gene regulatory network, we further predict and experimentally verify that these states have unique response to perturbations, thus defining them functionally. Our study provides a framework to infer the dynamics of differentiation from single cell transcriptomics data and to build predictive models of the gene regulatory networks that drive the sequence of cell fate decisions during development. DOI: http://dx.doi.org/10.7554/eLife.20487.001 PMID:28296635

Single-crossover recombination in discrete time.

PubMed

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

2010-05-01

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

A network of discrete events for the representation and analysis of diffusion dynamics.

PubMed

Pintus, Alberto M; Pazzona, Federico G; Demontis, Pierfranco; Suffritti, Giuseppe B

2015-11-14

We developed a coarse-grained description of the phenomenology of diffusive processes, in terms of a space of discrete events and its representation as a network. Once a proper classification of the discrete events underlying the diffusive process is carried out, their transition matrix is calculated on the basis of molecular dynamics data. This matrix can be represented as a directed, weighted network where nodes represent discrete events, and the weight of edges is given by the probability that one follows the other. The structure of this network reflects dynamical properties of the process of interest in such features as its modularity and the entropy rate of nodes. As an example of the applicability of this conceptual framework, we discuss here the physics of diffusion of small non-polar molecules in a microporous material, in terms of the structure of the corresponding network of events, and explain on this basis the diffusivity trends observed. A quantitative account of these trends is obtained by considering the contribution of the various events to the displacement autocorrelation function.

Gap discrete breathers in strained boron nitride

NASA Astrophysics Data System (ADS)

Barani, Elham; Korznikova, Elena A.; Chetverikov, Alexander P.; Zhou, Kun; Dmitriev, Sergey V.

2017-11-01

Linear and nonlinear dynamics of hexagonal boron nitride (h-BN) lattice is studied by means of molecular dynamics simulations with the use of the Tersoff interatomic potentials. It is found that sufficiently large homogeneous elastic strain along zigzag direction opens a wide gap in the phonon spectrum. Extended vibrational mode with boron and nitrogen sublattices vibrating in-plane as a whole in strained h-BN has frequency within the phonon gap. This fact suggests that a nonlinear spatially localized vibrational mode with frequencies in the phonon gap, called discrete breather (also often termed as intrinsic localized mode), can be excited. Properties of the gap discrete breathers in strained h-BN are contrasted with that for analogous vibrational mode found earlier in strained graphene. It is found that h-BN modeled with the Tersoff potentials does not support transverse discrete breathers.

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

PubMed

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.

Reduced-order dynamic output feedback control of uncertain discrete-time Markov jump linear systems

NASA Astrophysics Data System (ADS)

Morais, Cecília F.; Braga, Márcio F.; Oliveira, Ricardo C. L. F.; Peres, Pedro L. D.

2017-11-01

This paper deals with the problem of designing reduced-order robust dynamic output feedback controllers for discrete-time Markov jump linear systems (MJLS) with polytopic state space matrices and uncertain transition probabilities. Starting from a full order, mode-dependent and polynomially parameter-dependent dynamic output feedback controller, sufficient linear matrix inequality based conditions are provided for the existence of a robust reduced-order dynamic output feedback stabilising controller with complete, partial or none mode dependency assuring an upper bound to the ? or the ? norm of the closed-loop system. The main advantage of the proposed method when compared to the existing approaches is the fact that the dynamic controllers are exclusively expressed in terms of the decision variables of the problem. In other words, the matrices that define the controller realisation do not depend explicitly on the state space matrices associated with the modes of the MJLS. As a consequence, the method is specially suitable to handle order reduction or cluster availability constraints in the context of ? or ? dynamic output feedback control of discrete-time MJLS. Additionally, as illustrated by means of numerical examples, the proposed approach can provide less conservative results than other conditions in the literature.

Modeling the Bullying Prevention Program Preferences of Educators: A Discrete Choice Conjoint Experiment

ERIC Educational Resources Information Center

Cunningham, Charles E.; Vaillancourt, Tracy; Rimas, Heather; Deal, Ken; Cunningham, Lesley; Short, Kathy; Chen, Yvonne

2009-01-01

We used discrete choice conjoint analysis to model the bullying prevention program preferences of educators. Using themes from computerized decision support lab focus groups (n = 45 educators), we composed 20 three-level bullying prevention program design attributes. Each of 1,176 educators completed 25 choice tasks presenting experimentally…

Nonlinear Maps for Design of Discrete Time Models of Neuronal Network Dynamics

DTIC Science & Technology

2016-02-29

Performance/Technic~ 02-01-2016- 02-29-2016 4. TITLE AND SUBTITLE Sa. CONTRACT NUMBER Nonlinear Maps for Design of Discrete -Time Models of Neuronal...neuronal model in the form of difference equations that generates neuronal states in discrete moments of time. In this approach, time step can be made...propose to use modern DSP ideas to develop new efficient approaches to the design of such discrete -time models for studies of large-scale neuronal

Noise Propagation and Uncertainty Quantification in Hybrid Multiphysics Models: Initiation and Reaction Propagation in Energetic Materials

DTIC Science & Technology

2016-05-23

general model for heterogeneous granular media under compaction and (ii) the lack of a reliable multiscale discrete -to-continuum framework for...dynamics. These include a continuum- discrete model of heat dissipation/diffusion and a continuum- discrete model of compaction of a granular material with...the lack of a general model for het- erogeneous granular media under compac- tion and (ii) the lack of a reliable multi- scale discrete -to-continuum

Nonlinear Maps for Design of Discrete-Time Models of Neuronal Network Dynamics

DTIC Science & Technology

2016-03-31

2016 Performance/Technic~ 03-01-2016- 03-31-2016 4. TITLE AND SUBTITLE Sa. CONTRACT NUMBER Nonlinear Maps for Design of Discrete -Time Models of...simulations is to design a neuronal model in the form of difference equations that generates neuronal states in discrete moments of time. In this...responsive tiring patterns. We propose to use modern DSP ideas to develop new efficient approaches to the design of such discrete -time models for

Reflectionless Discrete Schrödinger Operators are Spectrally Atypical

NASA Astrophysics Data System (ADS)

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.

Near Optimal Event-Triggered Control of Nonlinear Discrete-Time Systems Using Neurodynamic Programming.

PubMed

Sahoo, Avimanyu; Xu, Hao; Jagannathan, Sarangapani

2016-09-01

This paper presents an event-triggered near optimal control of uncertain nonlinear discrete-time systems. Event-driven neurodynamic programming (NDP) is utilized to design the control policy. A neural network (NN)-based identifier, with event-based state and input vectors, is utilized to learn the system dynamics. An actor-critic framework is used to learn the cost function and the optimal control input. The NN weights of the identifier, the critic, and the actor NNs are tuned aperiodically once every triggered instant. An adaptive event-trigger condition to decide the trigger instants is derived. Thus, a suitable number of events are generated to ensure a desired accuracy of approximation. A near optimal performance is achieved without using value and/or policy iterations. A detailed analysis of nontrivial inter-event times with an explicit formula to show the reduction in computation is also derived. The Lyapunov technique is used in conjunction with the event-trigger condition to guarantee the ultimate boundedness of the closed-loop system. The simulation results are included to verify the performance of the controller. The net result is the development of event-driven NDP.

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

DTIC Science & Technology

2010-09-19

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

Discrete Dislocation Dynamics Simulations of Twin Size-Effects in Magnesium

DTIC Science & Technology

2015-01-01

deformation induced softening. Over the past two decades, discrete dislocation dynamics ( DDD ) has been one of the most efficient methods to capture...14] and intermittent behavior [15] of the FCC and BCC materials. More recently, DDD simulations of Mg investigated a number of important effects...plays an important and sometimes dominant role in the mechanical behavior of both single crystals and polycrystals. As a result, such DDD simulations

Prediction of Flutter Boundary Using Flutter Margin for The Discrete-Time System

NASA Astrophysics Data System (ADS)

Dwi Saputra, Angga; Wibawa Purabaya, R.

2018-04-01

Flutter testing in a wind tunnel is generally conducted at subcritical speeds to avoid damages. Hence, The flutter speed has to be predicted from the behavior some of its stability criteria estimated against the dynamic pressure or flight speed. Therefore, it is quite important for a reliable flutter prediction method to estimates flutter boundary. This paper summarizes the flutter testing of a wing cantilever model in a wind tunnel. The model has two degree of freedom; they are bending and torsion modes. The flutter test was conducted in a subsonic wind tunnel. The dynamic data responses was measured by two accelerometers that were mounted on leading edge and center of wing tip. The measurement was repeated while the wind speed increased. The dynamic responses were used to determine the parameter flutter margin for the discrete-time system. The flutter boundary of the model was estimated using extrapolation of the parameter flutter margin against the dynamic pressure. The parameter flutter margin for the discrete-time system has a better performance for flutter prediction than the modal parameters. A model with two degree freedom and experiencing classical flutter, the parameter flutter margin for the discrete-time system gives a satisfying result in prediction of flutter boundary on subsonic wind tunnel test.

Dynamico-FE: A Structure-Preserving Hydrostatic Dynamical Core

NASA Astrophysics Data System (ADS)

Eldred, Christopher; Dubos, Thomas; Kritsikis, Evaggelos

2017-04-01

It is well known that the inviscid, adiabatic equations of atmospheric motion constitute a non-canonical Hamiltonian system, and therefore posses many important conserved quantities such as as mass, potential vorticity and total energy. In addition, there are also key mimetic properties (such as curl grad = 0) of the underlying continuous vector calculus. Ideally, a dynamical core should have similar properties. A general approach to deriving such structure-preserving numerical schemes has been developed under the frameworks of Hamiltonian methods and mimetic discretizations, and over the past decade, there has been a great deal of work on the development of atmospheric dynamical cores using these techniques. An important example is Dynamico, which conserves mass, potential vorticity and total energy; and possesses additional mimetic properties such as a curl-free pressure gradient. Unfortunately, the underlying finite-difference discretization scheme used in Dynamico has been shown to be inconsistent on general grids. To resolve these accuracy issues, a scheme based on mimetic Galerkin discretizations has been developed that achieves higher-order accuracy while retaining the structure-preserving properties of the existing discretization. This presentation will discuss the new dynamical core, termed Dynamico-FE, and show results from a standard set of test cases on both the plane and the sphere.

DiscML: an R package for estimating evolutionary rates of discrete characters using maximum likelihood.

PubMed

Kim, Tane; Hao, Weilong

2014-09-27

The study of discrete characters is crucial for the understanding of evolutionary processes. Even though great advances have been made in the analysis of nucleotide sequences, computer programs for non-DNA discrete characters are often dedicated to specific analyses and lack flexibility. Discrete characters often have different transition rate matrices, variable rates among sites and sometimes contain unobservable states. To obtain the ability to accurately estimate a variety of discrete characters, programs with sophisticated methodologies and flexible settings are desired. DiscML performs maximum likelihood estimation for evolutionary rates of discrete characters on a provided phylogeny with the options that correct for unobservable data, rate variations, and unknown prior root probabilities from the empirical data. It gives users options to customize the instantaneous transition rate matrices, or to choose pre-determined matrices from models such as birth-and-death (BD), birth-death-and-innovation (BDI), equal rates (ER), symmetric (SYM), general time-reversible (GTR) and all rates different (ARD). Moreover, we show application examples of DiscML on gene family data and on intron presence/absence data. DiscML was developed as a unified R program for estimating evolutionary rates of discrete characters with no restriction on the number of character states, and with flexibility to use different transition models. DiscML is ideal for the analyses of binary (1s/0s) patterns, multi-gene families, and multistate discrete morphological characteristics.

A Flight Control System for Small Unmanned Aerial Vehicle

NASA Astrophysics Data System (ADS)

Tunik, A. A.; Nadsadnaya, O. I.

2018-03-01

The program adaptation of the controller for the flight control system (FCS) of an unmanned aerial vehicle (UAV) is considered. Linearized flight dynamic models depend mainly on the true airspeed of the UAV, which is measured by the onboard air data system. This enables its use for program adaptation of the FCS over the full range of altitudes and velocities, which define the flight operating range. FCS with program adaptation, based on static feedback (SF), is selected. The SF parameters for every sub-range of the true airspeed are determined using the linear matrix inequality approach in the case of discrete systems for synthesis of a suboptimal robust H ∞-controller. The use of the Lagrange interpolation between true airspeed sub-ranges provides continuous adaptation. The efficiency of the proposed approach is shown against an example of the heading stabilization system.

Dynamic profile of health investment and the evolution of elderly health.

PubMed

Lo, Te-Fen; Hsieh, Chee-Ruey

2013-01-01

A considerable number of studies have sought to examine the determinants of elderly health. Nevertheless, few of them incorporate a life-course perspective to analyze the dynamics of transition for both health conditions and their predictors. We utilize a nationally representative longitudinal data set of 4007 Taiwanese aged 60 or over and employ discrete-time duration models to investigate the association between annual mortality and its potential risk factors over a nearly twenty-year period (1989-2007). We place particular emphasis on the inherently dynamic character of Grossman's model, and specifically on how public and private health investment shape the personal health outcome over time. Our results support the hypothesis that depreciation rates depend on personal characteristics. In addition, we find that the dynamic profiles of both public and private health investment significantly influence the elderly mortality. An important implication of our study is that implementing universal health insurance and tobacco control programs are effective channels through which the government improves personal health. Copyright © 2012 Elsevier Ltd. All rights reserved.

Four dimensional imaging of E. coli nucleoid organization and dynamics in living cells

PubMed Central

Fisher, J. K.; Bourniquel, A.; Witz, G.; Weiner, B.; Prentiss, M.; Kleckner, N.

2013-01-01

Visualization of living E. coli nucleoids, defined by HupA-mCherry, reveals a discrete, dynamic helical ellipsoid. Three basic features emerge. (i) Nucleoid density efficiently coalesces into longitudinal bundles, giving a stiff, low DNA density ellipsoid. (ii) This ellipsoid is radially confined within the cell cylinder. Radial confinement gives helical shape and drives and directs global nucleoid dynamics, including sister segregation. (iii) Longitudinal density waves flux back and forth along the nucleoid, with 5–10% of density shifting within 5s, enhancing internal nucleoid mobility. Furthermore, sisters separate end-to-end in sequential discontinuous pulses, each elongating the nucleoid by 5–15%. Pulses occur at 20min intervals, at defined cell cycle times. This progression is mediated by sequential installation and release of programmed tethers, implying cyclic accumulation and relief of intra-nucleoid mechanical stress. These effects could comprise a chromosome-based cell cycle engine. Overall, the presented results suggest a general conceptual framework for bacterial nucleoid morphogenesis and dynamics. PMID:23623305

Nonautonomous discrete bright soliton solutions and interaction management for the Ablowitz-Ladik equation.

PubMed

Yu, Fajun

2015-03-01

We present the nonautonomous discrete bright soliton solutions and their interactions in the discrete Ablowitz-Ladik (DAL) equation with variable coefficients, which possesses complicated wave propagation in time and differs from the usual bright soliton waves. The differential-difference similarity transformation allows us to relate the discrete bright soliton solutions of the inhomogeneous DAL equation to the solutions of the homogeneous DAL equation. Propagation and interaction behaviors of the nonautonomous discrete solitons are analyzed through the one- and two-soliton solutions. We study the discrete snaking behaviors, parabolic behaviors, and interaction behaviors of the discrete solitons. In addition, the interaction management with free functions and dynamic behaviors of these solutions is investigated analytically, which have certain applications in electrical and optical systems.

Evolution of specialization under non-equilibrium population dynamics.

PubMed

Nurmi, Tuomas; Parvinen, Kalle

2013-03-21

We analyze the evolution of specialization in resource utilization in a mechanistically underpinned discrete-time model using the adaptive dynamics approach. We assume two nutritionally equivalent resources that in the absence of consumers grow sigmoidally towards a resource-specific carrying capacity. The consumers use resources according to the law of mass-action with rates involving trade-off. The resulting discrete-time model for the consumer population has over-compensatory dynamics. We illuminate the way non-equilibrium population dynamics affect the evolutionary dynamics of the resource consumption rates, and show that evolution to the trimorphic coexistence of a generalist and two specialists is possible due to asynchronous non-equilibrium population dynamics of the specialists. In addition, various forms of cyclic evolutionary dynamics are possible. Furthermore, evolutionary suicide may occur even without Allee effects and demographic stochasticity. Copyright © 2013 Elsevier Ltd. All rights reserved.

Application of time series discretization using evolutionary programming for classification of precancerous cervical lesions.

PubMed

Acosta-Mesa, Héctor-Gabriel; Rechy-Ramírez, Fernando; Mezura-Montes, Efrén; Cruz-Ramírez, Nicandro; Hernández Jiménez, Rodolfo

2014-06-01

In this work, we present a novel application of time series discretization using evolutionary programming for the classification of precancerous cervical lesions. The approach optimizes the number of intervals in which the length and amplitude of the time series should be compressed, preserving the important information for classification purposes. Using evolutionary programming, the search for a good discretization scheme is guided by a cost function which considers three criteria: the entropy regarding the classification, the complexity measured as the number of different strings needed to represent the complete data set, and the compression rate assessed as the length of the discrete representation. This discretization approach is evaluated using a time series data based on temporal patterns observed during a classical test used in cervical cancer detection; the classification accuracy reached by our method is compared with the well-known times series discretization algorithm SAX and the dimensionality reduction method PCA. Statistical analysis of the classification accuracy shows that the discrete representation is as efficient as the complete raw representation for the present application, reducing the dimensionality of the time series length by 97%. This representation is also very competitive in terms of classification accuracy when compared with similar approaches. Copyright © 2014 Elsevier Inc. All rights reserved.

Variable Weight Fractional Collisions for Multiple Species Mixtures

DTIC Science & Technology

2017-08-28

DISTRIBUTION A: APPROVED FOR PUBLIC RELEASE; DISTRIBUTION UNLIMITED; PA #17517 6 / 21 VARIABLE WEIGHTS FOR DYNAMIC RANGE Continuum to Discrete ...Representation: Many Particles →̃ Continuous Distribution Discretized VDF Yields Vlasov But Collision Integral Still a Problem Particle Methods VDF to Delta...Function Set Collisions between Discrete Velocities But Poorly Resolved Tail (Tail Critical to Inelastic Collisions) Variable Weights Permit Extra DOF in

On the relationship of steady states of continuous and discrete models arising from biology.

PubMed

Veliz-Cuba, Alan; Arthur, Joseph; Hochstetler, Laura; Klomps, Victoria; Korpi, Erikka

2012-12-01

For many biological systems that have been modeled using continuous and discrete models, it has been shown that such models have similar dynamical properties. In this paper, we prove that this happens in more general cases. We show that under some conditions there is a bijection between the steady states of continuous and discrete models arising from biological systems. Our results also provide a novel method to analyze certain classes of nonlinear models using discrete mathematics.

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

ERIC Educational Resources Information Center

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…

75 FR 27644 - Approval and Promulgation of Air Quality Implementation Plans; Texas; Revisions to the Discrete...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-05-18

... Promulgation of Air Quality Implementation Plans; Texas; Revisions to the Discrete Emission Credit Banking and... Rules, Subchapter H--Emissions Banking and Trading, Division 4--Discrete Emission Credit Banking and Trading, referred to elsewhere in this notice as the Discrete Emission Reduction Credit (DERC) Program...

Dynamic mortar finite element method for modeling of shear rupture on frictional rough surfaces

NASA Astrophysics Data System (ADS)

Tal, Yuval; Hager, Bradford H.

2017-09-01

This paper presents a mortar-based finite element formulation for modeling the dynamics of shear rupture on rough interfaces governed by slip-weakening and rate and state (RS) friction laws, focusing on the dynamics of earthquakes. The method utilizes the dual Lagrange multipliers and the primal-dual active set strategy concepts, together with a consistent discretization and linearization of the contact forces and constraints, and the friction laws to obtain a semi-smooth Newton method. The discretization of the RS friction law involves a procedure to condense out the state variables, thus eliminating the addition of another set of unknowns into the system. Several numerical examples of shear rupture on frictional rough interfaces demonstrate the efficiency of the method and examine the effects of the different time discretization schemes on the convergence, energy conservation, and the time evolution of shear traction and slip rate.

Special relativity in a discrete quantum universe

NASA Astrophysics Data System (ADS)

Bisio, Alessandro; D'Ariano, Giacomo Mauro; Perinotti, Paolo

2016-10-01

The hypothesis of a discrete fabric of the universe, the "Planck scale," is always on stage since it solves mathematical and conceptual problems in the infinitely small. However, it clashes with special relativity, which is designed for the continuum. Here, we show how the clash can be overcome within a discrete quantum theory where the evolution of fields is described by a quantum cellular automaton. The reconciliation is achieved by defining the change of observer as a change of representation of the dynamics, without any reference to space-time. We use the relativity principle, i.e., the invariance of dynamics under change of inertial observer, to identify a change of inertial frame with a symmetry of the dynamics. We consider the full group of such symmetries, and recover the usual Lorentz group in the relativistic regime of low energies, while at the Planck scale the covariance is nonlinearly distorted.

Variational Algorithms for Test Particle Trajectories

NASA Astrophysics Data System (ADS)

Ellison, C. Leland; Finn, John M.; Qin, Hong; Tang, William M.

2015-11-01

The theory of variational integration provides a novel framework for constructing conservative numerical methods for magnetized test particle dynamics. The retention of conservation laws in the numerical time advance captures the correct qualitative behavior of the long time dynamics. For modeling the Lorentz force system, new variational integrators have been developed that are both symplectic and electromagnetically gauge invariant. For guiding center test particle dynamics, discretization of the phase-space action principle yields multistep variational algorithms, in general. Obtaining the desired long-term numerical fidelity requires mitigation of the multistep method's parasitic modes or applying a discretization scheme that possesses a discrete degeneracy to yield a one-step method. Dissipative effects may be modeled using Lagrange-D'Alembert variational principles. Numerical results will be presented using a new numerical platform that interfaces with popular equilibrium codes and utilizes parallel hardware to achieve reduced times to solution. This work was supported by DOE Contract DE-AC02-09CH11466.

Three-dimensional discrete-time Lotka-Volterra models with an application to industrial clusters

NASA Astrophysics Data System (ADS)

Bischi, G. I.; Tramontana, F.

2010-10-01

We consider a three-dimensional discrete dynamical system that describes an application to economics of a generalization of the Lotka-Volterra prey-predator model. The dynamic model proposed is used to describe the interactions among industrial clusters (or districts), following a suggestion given by [23]. After studying some local and global properties and bifurcations in bidimensional Lotka-Volterra maps, by numerical explorations we show how some of them can be extended to their three-dimensional counterparts, even if their analytic and geometric characterization becomes much more difficult and challenging. We also show a global bifurcation of the three-dimensional system that has no two-dimensional analogue. Besides the particular economic application considered, the study of the discrete version of Lotka-Volterra dynamical systems turns out to be a quite rich and interesting topic by itself, i.e. from a purely mathematical point of view.

The discrete-time compensated Kalman filter

NASA Technical Reports Server (NTRS)

Lee, W. H.; Athans, M.

1978-01-01

A suboptimal dynamic compensator to be used in conjunction with the ordinary discrete time Kalman filter was derived. The resultant compensated Kalman Filter has the property that steady state bias estimation errors, resulting from modelling errors, were eliminated.

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

NASA Astrophysics Data System (ADS)

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.

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Makarenko, A. V., E-mail: avm.science@mail.ru

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 experiencesmore » 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.« less

Theory of relativistic Brownian motion: the (1+3) -dimensional case.

PubMed

Dunkel, Jörn; Hänggi, Peter

2005-09-01

A theory for (1+3) -dimensional relativistic Brownian motion under the influence of external force fields is put forward. Starting out from a set of relativistically covariant, but multiplicative Langevin equations we describe the relativistic stochastic dynamics of a forced Brownian particle. The corresponding Fokker-Planck equations are studied in the laboratory frame coordinates. In particular, the stochastic integration prescription--i.e., the discretization rule dilemma--is elucidated (prepoint discretization rule versus midpoint discretization rule versus postpoint discretization rule). Remarkably, within our relativistic scheme we find that the postpoint rule (or the transport form) yields the only Fokker-Planck dynamics from which the relativistic Maxwell-Boltzmann statistics is recovered as the stationary solution. The relativistic velocity effects become distinctly more pronounced by going from one to three spatial dimensions. Moreover, we present numerical results for the asymptotic mean-square displacement of a free relativistic Brownian particle moving in 1+3 dimensions.

Nonlinear Boltzmann equation for the homogeneous isotropic case: Minimal deterministic Matlab program

NASA Astrophysics Data System (ADS)

Asinari, Pietro

2010-10-01

The homogeneous isotropic Boltzmann equation (HIBE) is a fundamental dynamic model for many applications in thermodynamics, econophysics and sociodynamics. Despite recent hardware improvements, the solution of the Boltzmann equation remains extremely challenging from the computational point of view, in particular by deterministic methods (free of stochastic noise). This work aims to improve a deterministic direct method recently proposed [V.V. Aristov, Kluwer Academic Publishers, 2001] for solving the HIBE with a generic collisional kernel and, in particular, for taking care of the late dynamics of the relaxation towards the equilibrium. Essentially (a) the original problem is reformulated in terms of particle kinetic energy (exact particle number and energy conservation during microscopic collisions) and (b) the computation of the relaxation rates is improved by the DVM-like correction, where DVM stands for Discrete Velocity Model (ensuring that the macroscopic conservation laws are exactly satisfied). Both these corrections make possible to derive very accurate reference solutions for this test case. Moreover this work aims to distribute an open-source program (called HOMISBOLTZ), which can be redistributed and/or modified for dealing with different applications, under the terms of the GNU General Public License. The program has been purposely designed in order to be minimal, not only with regards to the reduced number of lines (less than 1000), but also with regards to the coding style (as simple as possible). Program summaryProgram title: HOMISBOLTZ Catalogue identifier: AEGN_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEGN_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: GNU General Public License No. of lines in distributed program, including test data, etc.: 23 340 No. of bytes in distributed program, including test data, etc.: 7 635 236 Distribution format: tar.gz Programming language: Tested with Matlab version ⩽6.5. However, in principle, any recent version of Matlab or Octave should work Computer: All supporting Matlab or Octave Operating system: All supporting Matlab or Octave RAM: 300 MBytes Classification: 23 Nature of problem: The problem consists in integrating the homogeneous Boltzmann equation for a generic collisional kernel in case of isotropic symmetry, by a deterministic direct method. Difficulties arise from the multi-dimensionality of the collisional operator and from satisfying the conservation of particle number and energy (momentum is trivial for this test case) as accurately as possible, in order to preserve the late dynamics. Solution method: The solution is based on the method proposed by Aristov (2001) [1], but with two substantial improvements: (a) the original problem is reformulated in terms of particle kinetic energy (this allows one to ensure exact particle number and energy conservation during microscopic collisions) and (b) a DVM-like correction (where DVM stands for Discrete Velocity Model) is adopted for improving the relaxation rates (this allows one to satisfy exactly the conservation laws at macroscopic level, which is particularly important for describing the late dynamics in the relaxation towards the equilibrium). Both these corrections make possible to derive very accurate reference solutions for this test case. Restrictions: The nonlinear Boltzmann equation is extremely challenging from the computational point of view, in particular for deterministic methods, despite the increased computational power of recent hardware. In this work, only the homogeneous isotropic case is considered, for making possible the development of a minimal program (by a simple scripting language) and allowing the user to check the advantages of the proposed improvements beyond Aristov's (2001) method [1]. The initial conditions are supposed parameterized according to a fixed analytical expression, but this can be easily modified. Running time: From minutes to hours (depending on the adopted discretization of the kinetic energy space). For example, on a 64 bit workstation with Intel CoreTM i7-820Q Quad Core CPU at 1.73 GHz and 8 MBytes of RAM, the provided test run (with the corresponding binary data file storing the pre-computed relaxation rates) requires 154 seconds. References:V.V. Aristov, Direct Methods for Solving the Boltzmann Equation and Study of Nonequilibrium Flows, Kluwer Academic Publishers, 2001.

77 FR 49749 - Procedures for Assessment and Collection of Regulatory Fees; Assessment and Collection of...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-08-17

... regulatory fees. Although the Commission has made a number of discrete changes to the regulatory fee program... Commission has made a number of discrete changes to the regulatory fee program since 1994, we have not...

Discrete Tchebycheff orthonormal polynomials and applications

NASA Technical Reports Server (NTRS)

Lear, W. M.

1980-01-01

Discrete Tchebycheff orthonormal polynomials offer a convenient way to make least squares polynomial fits of uniformly spaced discrete data. Computer programs to do so are simple and fast, and appear to be less affected by computer roundoff error, for the higher order fits, than conventional least squares programs. They are useful for any application of polynomial least squares fits: approximation of mathematical functions, noise analysis of radar data, and real time smoothing of noisy data, to name a few.

Estimation of Dynamic Discrete Choice Models by Maximum Likelihood and the Simulated Method of Moments

PubMed Central

Eisenhauer, Philipp; Heckman, James J.; Mosso, Stefano

2015-01-01

We compare the performance of maximum likelihood (ML) and simulated method of moments (SMM) estimation for dynamic discrete choice models. We construct and estimate a simplified dynamic structural model of education that captures some basic features of educational choices in the United States in the 1980s and early 1990s. We use estimates from our model to simulate a synthetic dataset and assess the ability of ML and SMM to recover the model parameters on this sample. We investigate the performance of alternative tuning parameters for SMM. PMID:26494926

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

PubMed

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.

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

NASA Astrophysics Data System (ADS)

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.

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

NASA Astrophysics Data System (ADS)

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.

Application of Dynamic Analysis in Semi-Analytical Finite Element Method

PubMed Central

Oeser, Markus

2017-01-01

Analyses of dynamic responses are significantly important for the design, maintenance and rehabilitation of asphalt pavement. In order to evaluate the dynamic responses of asphalt pavement under moving loads, a specific computational program, SAFEM, was developed based on a semi-analytical finite element method. This method is three-dimensional and only requires a two-dimensional FE discretization by incorporating Fourier series in the third dimension. In this paper, the algorithm to apply the dynamic analysis to SAFEM was introduced in detail. Asphalt pavement models under moving loads were built in the SAFEM and commercial finite element software ABAQUS to verify the accuracy and efficiency of the SAFEM. The verification shows that the computational accuracy of SAFEM is high enough and its computational time is much shorter than ABAQUS. Moreover, experimental verification was carried out and the prediction derived from SAFEM is consistent with the measurement. Therefore, the SAFEM is feasible to reliably predict the dynamic response of asphalt pavement under moving loads, thus proving beneficial to road administration in assessing the pavement’s state. PMID:28867813

Comparing the Discrete and Continuous Logistic Models

ERIC Educational Resources Information Center

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

ORACLS- OPTIMAL REGULATOR ALGORITHMS FOR THE CONTROL OF LINEAR SYSTEMS (CDC VERSION)

NASA Technical Reports Server (NTRS)

Armstrong, E. S.

1994-01-01

This control theory design package, called Optimal Regulator Algorithms for the Control of Linear Systems (ORACLS), was developed to aid in the design of controllers and optimal filters for systems which can be modeled by linear, time-invariant differential and difference equations. Optimal linear quadratic regulator theory, currently referred to as the Linear-Quadratic-Gaussian (LQG) problem, has become the most widely accepted method of determining optimal control policy. Within this theory, the infinite duration time-invariant problems, which lead to constant gain feedback control laws and constant Kalman-Bucy filter gains for reconstruction of the system state, exhibit high tractability and potential ease of implementation. A variety of new and efficient methods in the field of numerical linear algebra have been combined into the ORACLS program, which provides for the solution to time-invariant continuous or discrete LQG problems. The ORACLS package is particularly attractive to the control system designer because it provides a rigorous tool for dealing with multi-input and multi-output dynamic systems in both continuous and discrete form. The ORACLS programming system is a collection of subroutines which can be used to formulate, manipulate, and solve various LQG design problems. The ORACLS program is constructed in a manner which permits the user to maintain considerable flexibility at each operational state. This flexibility is accomplished by providing primary operations, analysis of linear time-invariant systems, and control synthesis based on LQG methodology. The input-output routines handle the reading and writing of numerical matrices, printing heading information, and accumulating output information. The basic vector-matrix operations include addition, subtraction, multiplication, equation, norm construction, tracing, transposition, scaling, juxtaposition, and construction of null and identity matrices. The analysis routines provide for the following computations: the eigenvalues and eigenvectors of real matrices; the relative stability of a given matrix; matrix factorization; the solution of linear constant coefficient vector-matrix algebraic equations; the controllability properties of a linear time-invariant system; the steady-state covariance matrix of an open-loop stable system forced by white noise; and the transient response of continuous linear time-invariant systems. The control law design routines of ORACLS implement some of the more common techniques of time-invariant LQG methodology. For the finite-duration optimal linear regulator problem with noise-free measurements, continuous dynamics, and integral performance index, a routine is provided which implements the negative exponential method for finding both the transient and steady-state solutions to the matrix Riccati equation. For the discrete version of this problem, the method of backwards differencing is applied to find the solutions to the discrete Riccati equation. A routine is also included to solve the steady-state Riccati equation by the Newton algorithms described by Klein, for continuous problems, and by Hewer, for discrete problems. Another routine calculates the prefilter gain to eliminate control state cross-product terms in the quadratic performance index and the weighting matrices for the sampled data optimal linear regulator problem. For cases with measurement noise, duality theory and optimal regulator algorithms are used to calculate solutions to the continuous and discrete Kalman-Bucy filter problems. Finally, routines are included to implement the continuous and discrete forms of the explicit (model-in-the-system) and implicit (model-in-the-performance-index) model following theory. These routines generate linear control laws which cause the output of a dynamic time-invariant system to track the output of a prescribed model. In order to apply ORACLS, the user must write an executive (driver) program which inputs the problem coefficients, formulates and selects the routines to be used to solve the problem, and specifies the desired output. There are three versions of ORACLS source code available for implementation: CDC, IBM, and DEC. The CDC version has been implemented on a CDC 6000 series computer with a central memory of approximately 13K (octal) of 60 bit words. The CDC version is written in FORTRAN IV, was developed in 1978, and last updated in 1989. The IBM version has been implemented on an IBM 370 series computer with a central memory requirement of approximately 300K of 8 bit bytes. The IBM version is written in FORTRAN IV and was generated in 1981. The DEC version has been implemented on a VAX series computer operating under VMS. The VAX version is written in FORTRAN 77 and was generated in 1986.

ORACLS- OPTIMAL REGULATOR ALGORITHMS FOR THE CONTROL OF LINEAR SYSTEMS (DEC VAX VERSION)

NASA Technical Reports Server (NTRS)

Frisch, H.

1994-01-01

This control theory design package, called Optimal Regulator Algorithms for the Control of Linear Systems (ORACLS), was developed to aid in the design of controllers and optimal filters for systems which can be modeled by linear, time-invariant differential and difference equations. Optimal linear quadratic regulator theory, currently referred to as the Linear-Quadratic-Gaussian (LQG) problem, has become the most widely accepted method of determining optimal control policy. Within this theory, the infinite duration time-invariant problems, which lead to constant gain feedback control laws and constant Kalman-Bucy filter gains for reconstruction of the system state, exhibit high tractability and potential ease of implementation. A variety of new and efficient methods in the field of numerical linear algebra have been combined into the ORACLS program, which provides for the solution to time-invariant continuous or discrete LQG problems. The ORACLS package is particularly attractive to the control system designer because it provides a rigorous tool for dealing with multi-input and multi-output dynamic systems in both continuous and discrete form. The ORACLS programming system is a collection of subroutines which can be used to formulate, manipulate, and solve various LQG design problems. The ORACLS program is constructed in a manner which permits the user to maintain considerable flexibility at each operational state. This flexibility is accomplished by providing primary operations, analysis of linear time-invariant systems, and control synthesis based on LQG methodology. The input-output routines handle the reading and writing of numerical matrices, printing heading information, and accumulating output information. The basic vector-matrix operations include addition, subtraction, multiplication, equation, norm construction, tracing, transposition, scaling, juxtaposition, and construction of null and identity matrices. The analysis routines provide for the following computations: the eigenvalues and eigenvectors of real matrices; the relative stability of a given matrix; matrix factorization; the solution of linear constant coefficient vector-matrix algebraic equations; the controllability properties of a linear time-invariant system; the steady-state covariance matrix of an open-loop stable system forced by white noise; and the transient response of continuous linear time-invariant systems. The control law design routines of ORACLS implement some of the more common techniques of time-invariant LQG methodology. For the finite-duration optimal linear regulator problem with noise-free measurements, continuous dynamics, and integral performance index, a routine is provided which implements the negative exponential method for finding both the transient and steady-state solutions to the matrix Riccati equation. For the discrete version of this problem, the method of backwards differencing is applied to find the solutions to the discrete Riccati equation. A routine is also included to solve the steady-state Riccati equation by the Newton algorithms described by Klein, for continuous problems, and by Hewer, for discrete problems. Another routine calculates the prefilter gain to eliminate control state cross-product terms in the quadratic performance index and the weighting matrices for the sampled data optimal linear regulator problem. For cases with measurement noise, duality theory and optimal regulator algorithms are used to calculate solutions to the continuous and discrete Kalman-Bucy filter problems. Finally, routines are included to implement the continuous and discrete forms of the explicit (model-in-the-system) and implicit (model-in-the-performance-index) model following theory. These routines generate linear control laws which cause the output of a dynamic time-invariant system to track the output of a prescribed model. In order to apply ORACLS, the user must write an executive (driver) program which inputs the problem coefficients, formulates and selects the routines to be used to solve the problem, and specifies the desired output. There are three versions of ORACLS source code available for implementation: CDC, IBM, and DEC. The CDC version has been implemented on a CDC 6000 series computer with a central memory of approximately 13K (octal) of 60 bit words. The CDC version is written in FORTRAN IV, was developed in 1978, and last updated in 1986. The IBM version has been implemented on an IBM 370 series computer with a central memory requirement of approximately 300K of 8 bit bytes. The IBM version is written in FORTRAN IV and was generated in 1981. The DEC version has been implemented on a VAX series computer operating under VMS. The VAX version is written in FORTRAN 77 and was generated in 1986.

DCMIP2016: a review of non-hydrostatic dynamical core design and intercomparison of participating models

NASA Astrophysics Data System (ADS)

Ullrich, Paul A.; Jablonowski, Christiane; Kent, James; Lauritzen, Peter H.; Nair, Ramachandran; Reed, Kevin A.; Zarzycki, Colin M.; Hall, David M.; Dazlich, Don; Heikes, Ross; Konor, Celal; Randall, David; Dubos, Thomas; Meurdesoif, Yann; Chen, Xi; Harris, Lucas; Kühnlein, Christian; Lee, Vivian; Qaddouri, Abdessamad; Girard, Claude; Giorgetta, Marco; Reinert, Daniel; Klemp, Joseph; Park, Sang-Hun; Skamarock, William; Miura, Hiroaki; Ohno, Tomoki; Yoshida, Ryuji; Walko, Robert; Reinecke, Alex; Viner, Kevin

2017-12-01

Atmospheric dynamical cores are a fundamental component of global atmospheric modeling systems and are responsible for capturing the dynamical behavior of the Earth's atmosphere via numerical integration of the Navier-Stokes equations. These systems have existed in one form or another for over half of a century, with the earliest discretizations having now evolved into a complex ecosystem of algorithms and computational strategies. In essence, no two dynamical cores are alike, and their individual successes suggest that no perfect model exists. To better understand modern dynamical cores, this paper aims to provide a comprehensive review of 11 non-hydrostatic dynamical cores, drawn from modeling centers and groups that participated in the 2016 Dynamical Core Model Intercomparison Project (DCMIP) workshop and summer school. This review includes a choice of model grid, variable placement, vertical coordinate, prognostic equations, temporal discretization, and the diffusion, stabilization, filters, and fixers employed by each system.

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

PubMed

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.

Spectral analysis of a two-species competition model: Determining the effects of extreme conditions on the color of noise generated from simulated time series

NASA Astrophysics Data System (ADS)

Golinski, M. R.

2006-07-01

Ecologists have observed that environmental noise affects population variance in the logistic equation for one-species growth. Interactions between deterministic and stochastic dynamics in a one-dimensional system result in increased variance in species population density over time. Since natural populations do not live in isolation, the present paper simulates a discrete-time two-species competition model with environmental noise to determine the type of colored population noise generated by extreme conditions in the long-term population dynamics of competing populations. Discrete Fourier analysis is applied to the simulation results and the calculated Hurst exponent ( H) is used to determine how the color of population noise for the two species corresponds to extreme conditions in population dynamics. To interpret the biological meaning of the color of noise generated by the two-species model, the paper determines the color of noise generated by three reference models: (1) A two-dimensional discrete-time white noise model (0⩽ H<1/2); (2) A two-dimensional fractional Brownian motion model (H=1/2); and (3) A two-dimensional discrete-time model with noise for unbounded growth of two uncoupled species (1/2< H⩽1).

Discrete Inverse and State Estimation Problems

NASA Astrophysics Data System (ADS)

Wunsch, Carl

2006-06-01

The problems of making inferences about the natural world from noisy observations and imperfect theories occur in almost all scientific disciplines. This book addresses these problems using examples taken from geophysical fluid dynamics. It focuses on discrete formulations, both static and time-varying, known variously as inverse, state estimation or data assimilation problems. Starting with fundamental algebraic and statistical ideas, the book guides the reader through a range of inference tools including the singular value decomposition, Gauss-Markov and minimum variance estimates, Kalman filters and related smoothers, and adjoint (Lagrange multiplier) methods. The final chapters discuss a variety of practical applications to geophysical flow problems. Discrete Inverse and State Estimation Problems is an ideal introduction to the topic for graduate students and researchers in oceanography, meteorology, climate dynamics, and geophysical fluid dynamics. It is also accessible to a wider scientific audience; the only prerequisite is an understanding of linear algebra. Provides a comprehensive introduction to discrete methods of inference from incomplete information Based upon 25 years of practical experience using real data and models Develops sequential and whole-domain analysis methods from simple least-squares Contains many examples and problems, and web-based support through MIT opencourseware

Assessing the importance of self-regulating mechanisms in diamondback moth population dynamics: application of discrete mathematical models.

PubMed

Nedorezov, Lev V; Löhr, Bernhard L; Sadykova, Dinara L

2008-10-07

The applicability of discrete mathematical models for the description of diamondback moth (DBM) (Plutella xylostella L.) population dynamics was investigated. The parameter values for several well-known discrete time models (Skellam, Moran-Ricker, Hassell, Maynard Smith-Slatkin, and discrete logistic models) were estimated for an experimental time series from a highland cabbage-growing area in eastern Kenya. For all sets of parameters, boundaries of confidence domains were determined. Maximum calculated birth rates varied between 1.086 and 1.359 when empirical values were used for parameter estimation. After fitting of the models to the empirical trajectory, all birth rate values resulted considerably higher (1.742-3.526). The carrying capacity was determined between 13.0 and 39.9DBM/plant, after fitting of the models these values declined to 6.48-9.3, all values well within the range encountered empirically. The application of the Durbin-Watson criteria for comparison of theoretical and experimental population trajectories produced negative correlations with all models. A test of residual value groupings for randomness showed that their distribution is non-stochastic. In consequence, we conclude that DBM dynamics cannot be explained as a result of intra-population self-regulative mechanisms only (=by any of the models tested) and that more comprehensive models are required for the explanation of DBM population dynamics.

On Fitts's and Hooke's laws: simple harmonic movement in upper-limb cyclical aiming.

PubMed

Guiard, Y

1993-03-01

Can discrete, single-shot movements and continuous, cyclical movements be reduced to a single concept? In the classical, computational approach to human motor behaviour, cyclical aimed movement has generally been considered to derive from discrete primitives through a concatenation mechanism. Much importance, accordingly, has been attached to discrete-movement paradigms and to techniques allowing the segmentation of continuous data. An alternative approach, suggested by the nonlinear dynamical systems theory, views discreteness as a limiting case of cyclicity. Although attempts have been made recently to account for discrete movements in dynamical terms, cyclical paradigms have been favoured. The concatenation interpretation of cyclical aimed movement is criticized on the ground that it implies a complete waste of mechanical energy once in every half-cycle. Some kinematic data from a one-dimensional reciprocal (i.e., cyclical) aiming experiment are reported, suggesting that human subjects do save muscular efforts from one movement to the next in upper-limb cyclical aiming. The experiment demonstrated convergence on simple harmonic motion as aiming tolerance was increased, an outcome interpreted with reference to Hooke's law, in terms of the muscles' capability of storing potential, elastic energy across movement reversals. Not only is the concatenation concept problematic for understanding cyclical aimed movements, but the very reality of discrete movements is questionable too. It is pointed out that discrete motor acts of real life are composed of complete cycles, rather than half-cycles.

Dynamical systems model and discrete element simulations of a tapped granular column

NASA Astrophysics Data System (ADS)

Rosato, A. D.; Blackmore, D.; Tricoche, X. M.; Urban, K.; Zuo, L.

2013-06-01

We present an approximate dynamical systems model for the mass center trajectory of a tapped column of N uniform, inelastic, spheres (diameter d), in which collisional energy loss is governed by the Walton-Braun linear loading-unloading soft interaction. Rigorous analysis of the model, akin to the equations for the motion of a single bouncing ball on a vibrating plate, reveals a parameter γ≔2aω2(1+e)/g that gauges the dynamical regimes and their transitions. In particular, we find bifurcations from periodic to chaotic dynamics that depend on frequency ω, amplitude a/d of the tap. Dynamics predicted by the model are also qualitatively observed in discrete element simulations carried out over a broad range of the tap parameters.

Generalised Assignment Matrix Methodology in Linear Programming

ERIC Educational Resources Information Center

Jerome, Lawrence

2012-01-01

Discrete Mathematics instructors and students have long been struggling with various labelling and scanning algorithms for solving many important problems. This paper shows how to solve a wide variety of Discrete Mathematics and OR problems using assignment matrices and linear programming, specifically using Excel Solvers although the same…

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

NASA Technical Reports Server (NTRS)

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.

Reducing Neuronal Networks to Discrete Dynamics

PubMed Central

Terman, David; Ahn, Sungwoo; Wang, Xueying; Just, Winfried

2008-01-01

We consider a general class of purely inhibitory and excitatory-inhibitory neuronal networks, with a general class of network architectures, and characterize the complex firing patterns that emerge. Our strategy for studying these networks is to first reduce them to a discrete model. In the discrete model, each neuron is represented as a finite number of states and there are rules for how a neuron transitions from one state to another. In this paper, we rigorously demonstrate that the continuous neuronal model can be reduced to the discrete model if the intrinsic and synaptic properties of the cells are chosen appropriately. In a companion paper [1], we analyze the discrete model. PMID:18443649

Integrable Semi-discrete Kundu-Eckhaus Equation: Darboux Transformation, Breather, Rogue Wave and Continuous Limit Theory

NASA Astrophysics Data System (ADS)

Zhao, Hai-qiong; Yuan, Jinyun; Zhu, Zuo-nong

2018-02-01

To get more insight into the relation between discrete model and continuous counterpart, a new integrable semi-discrete Kundu-Eckhaus equation is derived from the reduction in an extended Ablowitz-Ladik hierarchy. The integrability of the semi-discrete model is confirmed by showing the existence of Lax pair and infinite number of conservation laws. The dynamic characteristics of the breather and rational solutions have been analyzed in detail for our semi-discrete Kundu-Eckhaus equation to reveal some new interesting phenomena which was not found in continuous one. It is shown that the theory of the discrete system including Lax pair, Darboux transformation and explicit solutions systematically yields their continuous counterparts in the continuous limit.

Perfect discretization of path integrals

NASA Astrophysics Data System (ADS)

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.

Christopher Chang | NREL

Science.gov Websites

transition metal systems, macromolecular dynamics, comparative chemical bonding analysis, electron transfer . Research Interests Dynamics and control on discrete structures, including excited-state transition metal

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

PubMed

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-electrical feedback in facilitating and promoting atrial fibrillation.

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

PubMed Central

Zhang, Henggui

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-electrical feedback in facilitating and promoting atrial fibrillation. PMID:28510575

Generalized Synchronization in AN Array of Nonlinear Dynamic Systems with Applications to Chaotic Cnn

NASA Astrophysics Data System (ADS)

Min, Lequan; Chen, Guanrong

This paper establishes some generalized synchronization (GS) theorems for a coupled discrete array of difference systems (CDADS) and a coupled continuous array of differential systems (CCADS). These constructive theorems provide general representations of GS in CDADS and CCADS. Based on these theorems, one can design GS-driven CDADS and CCADS via appropriate (invertible) transformations. As applications, the results are applied to autonomous and nonautonomous coupled Chen cellular neural network (CNN) CDADS and CCADS, discrete bidirectional Lorenz CNN CDADS, nonautonomous bidirectional Chua CNN CCADS, and nonautonomously bidirectional Chen CNN CDADS and CCADS, respectively. Extensive numerical simulations show their complex dynamic behaviors. These theorems provide new means for understanding the GS phenomena of complex discrete and continuously differentiable networks.

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

PubMed

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.

DEKFIS user's guide: Discrete Extended Kalman Filter/Smoother program for aircraft and rotorcraft data consistency

NASA Technical Reports Server (NTRS)

1979-01-01

The computer program DEKFIS (discrete extended Kalman filter/smoother), formulated for aircraft and helicopter state estimation and data consistency, is described. DEKFIS is set up to pre-process raw test data by removing biases, correcting scale factor errors and providing consistency with the aircraft inertial kinematic equations. The program implements an extended Kalman filter/smoother using the Friedland-Duffy formulation.

Optimal design of supply chain network under uncertainty environment using hybrid analytical and simulation modeling approach

NASA Astrophysics Data System (ADS)

Chiadamrong, N.; Piyathanavong, V.

2017-12-01

Models that aim to optimize the design of supply chain networks have gained more interest in the supply chain literature. Mixed-integer linear programming and discrete-event simulation are widely used for such an optimization problem. We present a hybrid approach to support decisions for supply chain network design using a combination of analytical and discrete-event simulation models. The proposed approach is based on iterative procedures until the difference between subsequent solutions satisfies the pre-determined termination criteria. The effectiveness of proposed approach is illustrated by an example, which shows closer to optimal results with much faster solving time than the results obtained from the conventional simulation-based optimization model. The efficacy of this proposed hybrid approach is promising and can be applied as a powerful tool in designing a real supply chain network. It also provides the possibility to model and solve more realistic problems, which incorporate dynamism and uncertainty.

A symbiotic approach to fluid equations and non-linear flux-driven simulations of plasma dynamics

NASA Astrophysics Data System (ADS)

Halpern, Federico

2017-10-01

The fluid framework is ubiquitous in studies of plasma transport and stability. Typical forms of the fluid equations are motivated by analytical work dating several decades ago, before computer simulations were indispensable, and can be, therefore, not optimal for numerical computation. We demonstrate a new first-principles approach to obtaining manifestly consistent, skew-symmetric fluid models, ensuring internal consistency and conservation properties even in discrete form. Mass, kinetic, and internal energy become quadratic (and always positive) invariants of the system. The model lends itself to a robust, straightforward discretization scheme with inherent non-linear stability. A simpler, drift-ordered form of the equations is obtained, and first results of their numerical implementation as a binary framework for bulk-fluid global plasma simulations are demonstrated. This material is based upon work supported by the U.S. Department of Energy, Office of Science, Office of Fusion Energy Sciences, Theory Program, under Award No. DE-FG02-95ER54309.

Replicator equations, maximal cliques, and graph isomorphism.

PubMed

Pelillo, M

1999-11-15

We present a new energy-minimization framework for the graph isomorphism problem that is based on an equivalent maximum clique formulation. The approach is centered around a fundamental result proved by Motzkin and Straus in the mid-1960s, and recently expanded in various ways, which allows us to formulate the maximum clique problem in terms of a standard quadratic program. The attractive feature of this formulation is that a clear one-to-one correspondence exists between the solutions of the quadratic program and those in the original, combinatorial problem. To solve the program we use the so-called replicator equations--a class of straightforward continuous- and discrete-time dynamical systems developed in various branches of theoretical biology. We show how, despite their inherent inability to escape from local solutions, they nevertheless provide experimental results that are competitive with those obtained using more elaborate mean-field annealing heuristics.

Environmental Performance Information Use by Conservation Agency Staff

NASA Astrophysics Data System (ADS)

Wardropper, Chloe Bradley

2018-04-01

Performance-based conservation has long been recognized as crucial to improving program effectiveness, particularly when environmental conditions are dynamic. Yet few studies have investigated the use of environmental performance information by staff of conservation organizations. This article identifies attitudinal, policy and organizational factors influencing the use of a type of performance information—water quality information—by Soil and Water Conservation District staff in the Upper Mississippi River Basin region. An online survey ( n = 277) revealed a number of important variables associated with greater information use. Variables included employees' prosocial motivation, or the belief that they helped people and natural resources through their job, the perceived trustworthiness of data, the presence of a U.S. Clean Water Act Total Maximum Daily Load standard designation, and staff discretion to prioritize programs locally. Conservation programs that retain motivated staff and provide them the resources and flexibility to plan and evaluate their work with environmental data may increase conservation effectiveness under changing conditions.

Network Science Research Laboratory (NSRL) Discrete Event Toolkit

DTIC Science & Technology

2016-01-01

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

Quantum algorithm for solving some discrete mathematical problems by probing their energy spectra

NASA Astrophysics Data System (ADS)

Wang, Hefeng; Fan, Heng; Li, Fuli

2014-01-01

When a probe qubit is coupled to a quantum register that represents a physical system, the probe qubit will exhibit a dynamical response only when it is resonant with a transition in the system. Using this principle, we propose a quantum algorithm for solving discrete mathematical problems based on the circuit model. Our algorithm has favorable scaling properties in solving some discrete mathematical problems.

Coupling of Coastal Wave Transformation and Computational Fluid Dynamics Models for Seakeeping Analysis

DTIC Science & Technology

2017-04-03

setup in terms of temporal and spatial discretization . The second component was an extension of existing depth-integrated wave models to describe...equations (Abbott, 1976). Discretization schemes involve numerical dispersion and dissipation that distort the true character of the governing equations...represent a leading-order approximation of the Boussinesq-type equations. Tam and Webb (1993) proposed a wavenumber-based discretization scheme to preserve

Application of snakes and dynamic programming optimisation technique in modeling of buildings in informal settlement areas

NASA Astrophysics Data System (ADS)

Rüther, Heinz; Martine, Hagai M.; Mtalo, E. G.

This paper presents a novel approach to semiautomatic building extraction in informal settlement areas from aerial photographs. The proposed approach uses a strategy of delineating buildings by optimising their approximate building contour position. Approximate building contours are derived automatically by locating elevation blobs in digital surface models. Building extraction is then effected by means of the snakes algorithm and the dynamic programming optimisation technique. With dynamic programming, the building contour optimisation problem is realized through a discrete multistage process and solved by the "time-delayed" algorithm, as developed in this work. The proposed building extraction approach is a semiautomatic process, with user-controlled operations linking fully automated subprocesses. Inputs into the proposed building extraction system are ortho-images and digital surface models, the latter being generated through image matching techniques. Buildings are modeled as "lumps" or elevation blobs in digital surface models, which are derived by altimetric thresholding of digital surface models. Initial windows for building extraction are provided by projecting the elevation blobs centre points onto an ortho-image. In the next step, approximate building contours are extracted from the ortho-image by region growing constrained by edges. Approximate building contours thus derived are inputs into the dynamic programming optimisation process in which final building contours are established. The proposed system is tested on two study areas: Marconi Beam in Cape Town, South Africa, and Manzese in Dar es Salaam, Tanzania. Sixty percent of buildings in the study areas have been extracted and verified and it is concluded that the proposed approach contributes meaningfully to the extraction of buildings in moderately complex and crowded informal settlement areas.

Monitoring Active Atmospheres on Uranus and Neptune

NASA Astrophysics Data System (ADS)

Rages, Kathy

2009-07-01

We propose Snapshot observations of Uranus and Neptune to monitor changes in their atmospheres on time scales of weeks and months, as we have been doing for the past seven years. Previous Hubble Space Telescope observations {including previous Snapshot programs 8634, 10170, 10534, and 11156}, together with near-IR images obtained using adaptive optics on the Keck Telescope, reveal both planets to be dynamic worlds which change on time scales ranging from hours to {terrestrial} years. Uranus equinox occurred in December 2007, and the northern hemisphere is becoming fully visible for the first time since the early 1960s. HST observations during the past several years {Hammel et al. 2005, Icarus 175, 284 and references therein} have revealed strongly wavelength-dependent latitudinal structure, the presence of numerous visible-wavelength cloud features in the northern hemisphere, at least one very long-lived discrete cloud in the southern hemisphere, and in 2006 the first clearly defined dark spot seen on Uranus. Long-term ground-based observations {Lockwood and Jerzekiewicz, 2006, Icarus 180, 442; Hammel and Lockwood 2007, Icarus 186, 291} reveal seasonal brightness changes that seem to demand the appearance of a bright northern polar cap within the next few years. Recent HST and Keck observations of Neptune {Sromovsky et al. 2003, Icarus 163, 256 and references therein} show a general increase in activity at south temperate latitudes until 2004, when Neptune returned to a rather Voyager-like appearance with discrete bright spots rather than active latitude bands. Further Snapshot observations of these two dynamic planets will elucidate the nature of long-term changes in their zonal atmospheric bands and clarify the processes of formation, evolution, and dissipation of discrete albedo features.

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Spellings, Matthew; Biointerfaces Institute, University of Michigan, 2800 Plymouth Rd., Ann Arbor, MI 48109; Marson, Ryan L.

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 ismore » a natural extension of classical molecular dynamics and enables rigorous thermodynamic calculations for faceted particles.« less

A biased filter for linear discrete dynamic systems.

NASA Technical Reports Server (NTRS)

Chang, J. W.; Hoerl, A. E.; Leathrum, J. F.

1972-01-01

A recursive estimator, the ridge filter, was developed for the linear discrete dynamic estimation problem. Theorems were established to show that the ridge filter can be, on the average, closer to the expected value of the system state than the Kalman filter. On the other hand, Kalman filter, on the average, is closer to the instantaneous system state than the ridge filter. The ridge filter has been formulated in such a way that the computational features of the Kalman filter are preserved.

Stochastic aspects of one-dimensional discrete dynamical systems: Benford's law.

PubMed

Snyder, M A; Curry, J H; Dougherty, A M

2001-08-01

Benford's law owes its discovery to the "Grubby Pages Hypothesis," a 19th century observation made by Simon Newcomb that the beginning pages of logarithm books were grubbier than the last few pages, implying that scientists referenced the values toward the front of the books more frequently. If a data set satisfies Benford's law, then it's significant digits will have a logarithmic distribution, which favors smaller significant digits. In this article we demonstrate two ways of creating discrete one-dimensional dynamical systems that satisfy Benford's law. We also develop a numerical simulation methodology that we use to study dynamical systems when analytical results are not readily available.

ML-Space: Hybrid Spatial Gillespie and Particle Simulation of Multi-Level Rule-Based Models in Cell Biology.

PubMed

Bittig, Arne T; Uhrmacher, Adelinde M

2017-01-01

Spatio-temporal dynamics of cellular processes can be simulated at different levels of detail, from (deterministic) partial differential equations via the spatial Stochastic Simulation algorithm to tracking Brownian trajectories of individual particles. We present a spatial simulation approach for multi-level rule-based models, which includes dynamically hierarchically nested cellular compartments and entities. Our approach ML-Space combines discrete compartmental dynamics, stochastic spatial approaches in discrete space, and particles moving in continuous space. The rule-based specification language of ML-Space supports concise and compact descriptions of models and to adapt the spatial resolution of models easily.

Discrete element simulation of charging and mixed layer formation in the ironmaking blast furnace

NASA Astrophysics Data System (ADS)

Mitra, Tamoghna; Saxén, Henrik

2016-11-01

The burden distribution in the ironmaking blast furnace plays an important role for the operation as it affects the gas flow distribution, heat and mass transfer, and chemical reactions in the shaft. This work studies certain aspects of burden distribution by small-scale experiments and numerical simulation by the discrete element method (DEM). Particular attention is focused on the complex layer-formation process and the problems associated with estimating the burden layer distribution by burden profile measurements. The formation of mixed layers is studied, and a computational method for estimating the extent of the mixed layer, as well as its voidage, is proposed and applied on the results of the DEM simulations. In studying a charging program and its resulting burden distribution, the mixed layers of coke and pellets were found to show lower voidage than the individual burden layers. The dynamic evolution of the mixed layer during the charging process is also analyzed. The results of the study can be used to gain deeper insight into the complex charging process of the blast furnace, which is useful in the design of new charging programs and for mathematical models that do not consider the full behavior of the particles in the burden layers.

Program For Parallel Discrete-Event Simulation

NASA Technical Reports Server (NTRS)

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.

Budget impact analysis of switching to digital mammography in a population-based breast cancer screening program: a discrete event simulation model.

PubMed

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

2014-01-01

To assess the budgetary impact of switching from screen-film mammography to full-field digital mammography in a population-based breast cancer screening program. 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. 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. 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.

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

PubMed Central

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

A FFT-based formulation for efficient mechanical fields computation in isotropic and anisotropic periodic discrete dislocation dynamics

NASA Astrophysics Data System (ADS)

Bertin, N.; Upadhyay, M. V.; Pradalier, C.; Capolungo, L.

2015-09-01

In this paper, we propose a novel full-field approach based on the fast Fourier transform (FFT) technique to compute mechanical fields in periodic discrete dislocation dynamics (DDD) simulations for anisotropic materials: the DDD-FFT approach. By coupling the FFT-based approach to the discrete continuous model, the present approach benefits from the high computational efficiency of the FFT algorithm, while allowing for a discrete representation of dislocation lines. It is demonstrated that the computational time associated with the new DDD-FFT approach is significantly lower than that of current DDD approaches when large number of dislocation segments are involved for isotropic and anisotropic elasticity, respectively. Furthermore, for fine Fourier grids, the treatment of anisotropic elasticity comes at a similar computational cost to that of isotropic simulation. Thus, the proposed approach paves the way towards achieving scale transition from DDD to mesoscale plasticity, especially due to the method’s ability to incorporate inhomogeneous elasticity.

Parallel Discrete Molecular Dynamics Simulation With Speculation and In-Order Commitment*†

PubMed Central

Khan, Md. Ashfaquzzaman; Herbordt, Martin C.

2011-01-01

Discrete molecular dynamics simulation (DMD) uses simplified and discretized models enabling simulations to advance by event rather than by timestep. DMD is an instance of discrete event simulation and so is difficult to scale: even in this multi-core era, all reported DMD codes are serial. In this paper we discuss the inherent difficulties of scaling DMD and present our method of parallelizing DMD through event-based decomposition. Our method is microarchitecture inspired: speculative processing of events exposes parallelism, while in-order commitment ensures correctness. We analyze the potential of this parallelization method for shared-memory multiprocessors. Achieving scalability required extensive experimentation with scheduling and synchronization methods to mitigate serialization. The speed-up achieved for a variety of system sizes and complexities is nearly 6× on an 8-core and over 9× on a 12-core processor. We present and verify analytical models that account for the achieved performance as a function of available concurrency and architectural limitations. PMID:21822327

Parallel Discrete Molecular Dynamics Simulation With Speculation and In-Order Commitment.

PubMed

Khan, Md Ashfaquzzaman; Herbordt, Martin C

2011-07-20

Discrete molecular dynamics simulation (DMD) uses simplified and discretized models enabling simulations to advance by event rather than by timestep. DMD is an instance of discrete event simulation and so is difficult to scale: even in this multi-core era, all reported DMD codes are serial. In this paper we discuss the inherent difficulties of scaling DMD and present our method of parallelizing DMD through event-based decomposition. Our method is microarchitecture inspired: speculative processing of events exposes parallelism, while in-order commitment ensures correctness. We analyze the potential of this parallelization method for shared-memory multiprocessors. Achieving scalability required extensive experimentation with scheduling and synchronization methods to mitigate serialization. The speed-up achieved for a variety of system sizes and complexities is nearly 6× on an 8-core and over 9× on a 12-core processor. We present and verify analytical models that account for the achieved performance as a function of available concurrency and architectural limitations.

Optimal generalized multistep integration formulae for real-time digital simulation

NASA Technical Reports Server (NTRS)

Moerder, D. D.; Halyo, N.

1985-01-01

The problem of discretizing a dynamical system for real-time digital simulation is considered. Treating the system and its simulation as stochastic processes leads to a statistical characterization of simulator fidelity. A plant discretization procedure based on an efficient matrix generalization of explicit linear multistep discrete integration formulae is introduced, which minimizes a weighted sum of the mean squared steady-state and transient error between the system and simulator outputs.

49 CFR Appendix B to Part 242 - Procedures for Submission and Approval of Conductor Certification Programs

Code of Federal Regulations, 2014 CFR

2014-10-01

... are voluntary or mandatory. Time and circumstances have the capacity to diminish both abstract knowledge and the proper application of that knowledge to discrete events. Time and circumstances also have.... In formulating how it will use the discretion being afforded, each railroad must design its program...

49 CFR Appendix B to Part 242 - Procedures for Submission and Approval of Conductor Certification Programs

Code of Federal Regulations, 2012 CFR

2012-10-01

... are voluntary or mandatory. Time and circumstances have the capacity to diminish both abstract knowledge and the proper application of that knowledge to discrete events. Time and circumstances also have.... In formulating how it will use the discretion being afforded, each railroad must design its program...

49 CFR Appendix B to Part 242 - Procedures for Submission and Approval of Conductor Certification Programs

Code of Federal Regulations, 2013 CFR

2013-10-01

... are voluntary or mandatory. Time and circumstances have the capacity to diminish both abstract knowledge and the proper application of that knowledge to discrete events. Time and circumstances also have.... In formulating how it will use the discretion being afforded, each railroad must design its program...

An Evaluation of Programmed Treatment-integrity Errors during Discrete-trial Instruction

ERIC Educational Resources Information Center

Carroll, Regina A.; Kodak, Tiffany; Fisher, Wayne W.

2013-01-01

This study evaluated the effects of programmed treatment-integrity errors on skill acquisition for children with an autism spectrum disorder (ASD) during discrete-trial instruction (DTI). In Study 1, we identified common treatment-integrity errors that occur during academic instruction in schools. In Study 2, we simultaneously manipulated 3…

Applied Behavior Analysis: Beyond Discrete Trial Teaching

ERIC Educational Resources Information Center

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…

Discrete breathers in graphane: Effect of temperature

DOE Office of Scientific and Technical Information (OSTI.GOV)

Baimova, J. A., E-mail: julia.a.baimova@gmail.com; Murzaev, R. T.; Lobzenko, I. P.

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 eachmore » 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.« less

Discrete Dynamical Modeling.

ERIC Educational Resources Information Center

Sandefur, James T.

1991-01-01

Discussed is the process of translating situations involving changing quantities into mathematical relationships. This process, called dynamical modeling, allows students to learn new mathematics while sharpening their algebraic skills. A description of dynamical systems, problem-solving methods, a graphical analysis, and available classroom…

Discrete Adjoint Sensitivity Analysis of Hybrid Dynamical Systems With Switching [Discrete Adjoint Sensitivity Analysis of Hybrid Dynamical Systems

DOE PAGES

Zhang, Hong; Abhyankar, Shrirang; Constantinescu, Emil; ...

2017-01-24

Sensitivity analysis is an important tool for describing power system dynamic behavior in response to parameter variations. It is a central component in preventive and corrective control applications. The existing approaches for sensitivity calculations, namely, finite-difference and forward sensitivity analysis, require a computational effort that increases linearly with the number of sensitivity parameters. In this paper, we investigate, implement, and test a discrete adjoint sensitivity approach whose computational effort is effectively independent of the number of sensitivity parameters. The proposed approach is highly efficient for calculating sensitivities of larger systems and is consistent, within machine precision, with the function whosemore » sensitivity we are seeking. This is an essential feature for use in optimization applications. Moreover, our approach includes a consistent treatment of systems with switching, such as dc exciters, by deriving and implementing the adjoint jump conditions that arise from state-dependent and time-dependent switchings. The accuracy and the computational efficiency of the proposed approach are demonstrated in comparison with the forward sensitivity analysis approach. In conclusion, this paper focuses primarily on the power system dynamics, but the approach is general and can be applied to hybrid dynamical systems in a broader range of fields.« less

Discrete Adjoint Sensitivity Analysis of Hybrid Dynamical Systems With Switching [Discrete Adjoint Sensitivity Analysis of Hybrid Dynamical Systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhang, Hong; Abhyankar, Shrirang; Constantinescu, Emil

Sensitivity analysis is an important tool for describing power system dynamic behavior in response to parameter variations. It is a central component in preventive and corrective control applications. The existing approaches for sensitivity calculations, namely, finite-difference and forward sensitivity analysis, require a computational effort that increases linearly with the number of sensitivity parameters. In this paper, we investigate, implement, and test a discrete adjoint sensitivity approach whose computational effort is effectively independent of the number of sensitivity parameters. The proposed approach is highly efficient for calculating sensitivities of larger systems and is consistent, within machine precision, with the function whosemore » sensitivity we are seeking. This is an essential feature for use in optimization applications. Moreover, our approach includes a consistent treatment of systems with switching, such as dc exciters, by deriving and implementing the adjoint jump conditions that arise from state-dependent and time-dependent switchings. The accuracy and the computational efficiency of the proposed approach are demonstrated in comparison with the forward sensitivity analysis approach. In conclusion, this paper focuses primarily on the power system dynamics, but the approach is general and can be applied to hybrid dynamical systems in a broader range of fields.« less

Variational symplectic algorithm for guiding center dynamics in the inner magnetosphere

DOE Office of Scientific and Technical Information (OSTI.GOV)

Li Jinxing; Pu Zuyin; Xie Lun

Charged particle dynamics in magnetosphere has temporal and spatial multiscale; therefore, numerical accuracy over a long integration time is required. A variational symplectic integrator (VSI) [H. Qin and X. Guan, Phys. Rev. Lett. 100, 035006 (2008) and H. Qin, X. Guan, and W. M. Tang, Phys. Plasmas 16, 042510 (2009)] for the guiding-center motion of charged particles in general magnetic field is applied to study the dynamics of charged particles in magnetosphere. Instead of discretizing the differential equations of the guiding-center motion, the action of the guiding-center motion is discretized and minimized to obtain the iteration rules for advancing themore » dynamics. The VSI conserves exactly a discrete Lagrangian symplectic structure and has better numerical properties over a long integration time, compared with standard integrators, such as the standard and adaptive fourth order Runge-Kutta (RK4) methods. Applying the VSI method to guiding-center dynamics in the inner magnetosphere, we can accurately calculate the particles'orbits for an arbitrary long simulating time with good conservation property. When a time-independent convection and corotation electric field is considered, the VSI method can give the accurate single particle orbit, while the RK4 method gives an incorrect orbit due to its intrinsic error accumulation over a long integrating time.« less

Discrete Mathematics across the Curriculum, K-12. 1991 Yearbook.

ERIC Educational Resources Information Center

Kenney, Margaret J., Ed.; Hirsch, Christian R., Ed.

This yearbook provides the mathematics education community with specific perceptions about discrete mathematics concerning its importance, its composition at various grade levels, and ideas about how to teach it. Many practical suggestions with respect to the implementation of a discrete mathematics school program are included. A unifying thread…

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

PubMed Central

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

Dynamical error bounds for continuum discretisation via Gauss quadrature rules—A Lieb-Robinson bound approach

DOE Office of Scientific and Technical Information (OSTI.GOV)

Woods, M. P.; Centre for Quantum Technologies, National University of Singapore; QuTech, Delft University of Technology, Lorentzweg 1, 2611 CJ Delft

2016-02-15

Instances of discrete quantum systems coupled to a continuum of oscillators are ubiquitous in physics. Often the continua are approximated by a discrete set of modes. We derive error bounds on expectation values of system observables that have been time evolved under such discretised Hamiltonians. These bounds take on the form of a function of time and the number of discrete modes, where the discrete modes are chosen according to Gauss quadrature rules. The derivation makes use of tools from the field of Lieb-Robinson bounds and the theory of orthonormal polynomials.

Shockwave dynamics: a comparison between stochastic and periodic porous architectures

NASA Astrophysics Data System (ADS)

Branch, Brittany; Ionite, Axinte; Clements, Bradford; Montgomery, David; Schmalzer, Andrew; Patterson, Brian; Mueller, Alexander; Jensen, Brian; Dattelbaum, Dana

Polymeric foams are used extensively as structural supports and load mitigating materials in which they are subjected to compressive loading at a range of strain rates, up to the high strain rates encountered in blast and shockwave loading. To date, there have been few insights into compaction phenomena in porous structures at the mesoscale, and the influence of structure on shockwave localization. Of particular interest is when the properties of the inherent mesoscopic, periodic structure begin to emerge, versus the discrete behavior of the individual cell. Here, we illustrate, for the first time, modulation of shockwave dynamics controlled at micron-length scales in additively manufactured periodic porous structures measured using in situ, time-resolved x-ray phase contrast imaging at the Advanced Photon Source. Further, we demonstrate how the shockwave dynamics in periodic structures differ from stochastic foams of similar density and we conclude that microstructural control in elastomer foams has a dramatic effect on shockwave dynamics and can be tailored towards a variety of applications. Laboratory Directed Research and Development (LDRD) program at Los Alamos National Laboratory (project# 20160103DR) and DOE/NNSA Campaign 2.

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

PubMed

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.

The numerical dynamic for highly nonlinear partial differential equations

NASA Technical Reports Server (NTRS)

Lafon, A.; Yee, H. C.

1992-01-01

Problems associated with the numerical computation of highly nonlinear equations in computational fluid dynamics are set forth and analyzed in terms of the potential ranges of spurious behaviors. A reaction-convection equation with a nonlinear source term is employed to evaluate the effects related to spatial and temporal discretizations. The discretization of the source term is described according to several methods, and the various techniques are shown to have a significant effect on the stability of the spurious solutions. Traditional linearized stability analyses cannot provide the level of confidence required for accurate fluid dynamics computations, and the incorporation of nonlinear analysis is proposed. Nonlinear analysis based on nonlinear dynamical systems complements the conventional linear approach and is valuable in the analysis of hypersonic aerodynamics and combustion phenomena.

Adaptive hybrid simulations for multiscale stochastic reaction networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hepp, Benjamin; Gupta, Ankit; Khammash, Mustafa

2015-01-21

The probability distribution describing the state of a Stochastic Reaction Network (SRN) evolves according to the Chemical Master Equation (CME). It is common to estimate its solution using Monte Carlo methods such as the Stochastic Simulation Algorithm (SSA). In many cases, these simulations can take an impractical amount of computational time. Therefore, many methods have been developed that approximate sample paths of the underlying stochastic process and estimate the solution of the CME. A prominent class of these methods include hybrid methods that partition the set of species and the set of reactions into discrete and continuous subsets. Such amore » partition separates the dynamics into a discrete and a continuous part. Simulating such a stochastic process can be computationally much easier than simulating the exact discrete stochastic process with SSA. Moreover, the quasi-stationary assumption to approximate the dynamics of fast subnetworks can be applied for certain classes of networks. However, as the dynamics of a SRN evolves, these partitions may have to be adapted during the simulation. We develop a hybrid method that approximates the solution of a CME by automatically partitioning the reactions and species sets into discrete and continuous components and applying the quasi-stationary assumption on identifiable fast subnetworks. Our method does not require any user intervention and it adapts to exploit the changing timescale separation between reactions and/or changing magnitudes of copy-numbers of constituent species. We demonstrate the efficiency of the proposed method by considering examples from systems biology and showing that very good approximations to the exact probability distributions can be achieved in significantly less computational time. This is especially the case for systems with oscillatory dynamics, where the system dynamics change considerably throughout the time-period of interest.« less

Adaptive hybrid simulations for multiscale stochastic reaction networks.

PubMed

Hepp, Benjamin; Gupta, Ankit; Khammash, Mustafa

2015-01-21

The probability distribution describing the state of a Stochastic Reaction Network (SRN) evolves according to the Chemical Master Equation (CME). It is common to estimate its solution using Monte Carlo methods such as the Stochastic Simulation Algorithm (SSA). In many cases, these simulations can take an impractical amount of computational time. Therefore, many methods have been developed that approximate sample paths of the underlying stochastic process and estimate the solution of the CME. A prominent class of these methods include hybrid methods that partition the set of species and the set of reactions into discrete and continuous subsets. Such a partition separates the dynamics into a discrete and a continuous part. Simulating such a stochastic process can be computationally much easier than simulating the exact discrete stochastic process with SSA. Moreover, the quasi-stationary assumption to approximate the dynamics of fast subnetworks can be applied for certain classes of networks. However, as the dynamics of a SRN evolves, these partitions may have to be adapted during the simulation. We develop a hybrid method that approximates the solution of a CME by automatically partitioning the reactions and species sets into discrete and continuous components and applying the quasi-stationary assumption on identifiable fast subnetworks. Our method does not require any user intervention and it adapts to exploit the changing timescale separation between reactions and/or changing magnitudes of copy-numbers of constituent species. We demonstrate the efficiency of the proposed method by considering examples from systems biology and showing that very good approximations to the exact probability distributions can be achieved in significantly less computational time. This is especially the case for systems with oscillatory dynamics, where the system dynamics change considerably throughout the time-period of interest.

A dynamic-solver-consistent minimum action method: With an application to 2D Navier-Stokes equations

NASA Astrophysics Data System (ADS)

Wan, Xiaoliang; Yu, Haijun

2017-02-01

This paper discusses the necessity and strategy to unify the development of a dynamic solver and a minimum action method (MAM) for a spatially extended system when employing the large deviation principle (LDP) to study the effects of small random perturbations. A dynamic solver is used to approximate the unperturbed system, and a minimum action method is used to approximate the LDP, which corresponds to solving an Euler-Lagrange equation related to but more complicated than the unperturbed system. We will clarify possible inconsistencies induced by independent numerical approximations of the unperturbed system and the LDP, based on which we propose to define both the dynamic solver and the MAM on the same approximation space for spatial discretization. The semi-discrete LDP can then be regarded as the exact LDP of the semi-discrete unperturbed system, which is a finite-dimensional ODE system. We achieve this methodology for the two-dimensional Navier-Stokes equations using a divergence-free approximation space. The method developed can be used to study the nonlinear instability of wall-bounded parallel shear flows, and be generalized straightforwardly to three-dimensional cases. Numerical experiments are presented.

Perfect discretization of reparametrization invariant path integrals

NASA Astrophysics Data System (ADS)

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.

Modeling and Control of the Cobelli Model as a Personalized Prescriptive Tool for Diabetes Treatment

DTIC Science & Technology

2016-11-05

within the body allow for a more quantified approach in medicine prescription as well as a deeper understanding of the discrete operations of...dynamics within the body allow for a more quantified approach in medicine prescription as well as a deeper understanding of the discrete operations of... discrete value) of the desired output (healthy blood glucose concentration in this project), yi is the ith sample of the measured output, ui is

Discrete Molecular Dynamics Approach to the Study of Disordered and Aggregating Proteins.

PubMed

Emperador, Agustí; Orozco, Modesto

2017-03-14

We present a refinement of the Coarse Grained PACSAB force field for Discrete Molecular Dynamics (DMD) simulations of proteins in aqueous conditions. As the original version, the refined method provides good representation of the structure and dynamics of folded proteins but provides much better representations of a variety of unfolded proteins, including some very large, impossible to analyze by atomistic simulation methods. The PACSAB/DMD method also reproduces accurately aggregation properties, providing good pictures of the structural ensembles of proteins showing a folded core and an intrinsically disordered region. The combination of accuracy and speed makes the method presented here a good alternative for the exploration of unstructured protein systems.

Continuous-time quantum random walks require discrete space

NASA Astrophysics Data System (ADS)

Manouchehri, K.; Wang, J. B.

2007-11-01

Quantum random walks are shown to have non-intuitive dynamics which makes them an attractive area of study for devising quantum algorithms for long-standing open problems as well as those arising in the field of quantum computing. In the case of continuous-time quantum random walks, such peculiar dynamics can arise from simple evolution operators closely resembling the quantum free-wave propagator. We investigate the divergence of quantum walk dynamics from the free-wave evolution and show that, in order for continuous-time quantum walks to display their characteristic propagation, the state space must be discrete. This behavior rules out many continuous quantum systems as possible candidates for implementing continuous-time quantum random walks.

Peridynamics with LAMMPS : a user guide.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lehoucq, Richard B.; Silling, Stewart Andrew; Seleson, Pablo

Peridynamics is a nonlocal extension of classical continuum mechanics. The discrete peridynamic model has the same computational structure as a molecular dynamics model. This document provides a brief overview of the peridynamic model of a continuum, then discusses how the peridynamic model is discretized within LAMMPS. An example problem is also included.

Discrete dynamical laser equation for the critical onset of bistability, entanglement and disappearance

NASA Astrophysics Data System (ADS)

Abdul, M.; Farooq, U.; Akbar, Jehan; Saif, F.

2018-06-01

We transform the semi-classical laser equation for single mode homogeneously broadened lasers to a one-dimensional nonlinear map by using the discrete dynamical approach. The obtained mapping, referred to as laser logistic mapping (LLM), characteristically exhibits convergent, cyclic and chaotic behavior depending on the control parameter. Thus, the so obtained LLM explains stable, bistable, multi-stable, and chaotic solutions for output field intensity. The onset of bistability takes place at a critical value of the effective gain coefficient. The obtained analytical results are confirmed through numerical calculations.

Nonstationary Dynamics Data Analysis with Wavelet-SVD Filtering

NASA Technical Reports Server (NTRS)

Brenner, Marty; Groutage, Dale; Bessette, Denis (Technical Monitor)

2001-01-01

Nonstationary time-frequency analysis is used for identification and classification of aeroelastic and aeroservoelastic dynamics. Time-frequency multiscale wavelet processing generates discrete energy density distributions. The distributions are processed using the singular value decomposition (SVD). Discrete density functions derived from the SVD generate moments that detect the principal features in the data. The SVD standard basis vectors are applied and then compared with a transformed-SVD, or TSVD, which reduces the number of features into more compact energy density concentrations. Finally, from the feature extraction, wavelet-based modal parameter estimation is applied.

H∞ control of combustion in diesel engines using a discrete dynamics model

NASA Astrophysics Data System (ADS)

Hirata, Mitsuo; Ishizuki, Sota; Suzuki, Masayasu

2016-09-01

This paper proposes a control method for combustion in diesel engines using a discrete dynamics model. The proposed two-degree-of-freedom control scheme achieves not only good feedback properties such as disturbance suppression and robust stability but also a good transient response. The method includes a feedforward controller constructed from the inverse model of the plant, and a feedback controller designed by an Hcontrol method, which reduces the effect of the turbocharger lag. The effectiveness of the proposed method is evaluated via numerical simulations.

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

NASA Astrophysics Data System (ADS)

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.

Numerical computation of orbits and rigorous verification of existence of snapback repellers.

PubMed

Peng, Chen-Chang

2007-03-01

In this paper we show how analysis from numerical computation of orbits can be applied to prove the existence of snapback repellers in discrete dynamical systems. That is, we present a computer-assisted method to prove the existence of a snapback repeller of a specific map. The existence of a snapback repeller of a dynamical system implies that it has chaotic behavior [F. R. Marotto, J. Math. Anal. Appl. 63, 199 (1978)]. The method is applied to the logistic map and the discrete predator-prey system.

A discrete model on Sierpinski gasket substrate for a conserved current equation with a conservative noise

NASA Astrophysics Data System (ADS)

Kim, Dae Ho; Kim, Jin Min

2012-09-01

A conserved discrete model on the Sierpinski gasket substrate is studied. The interface width W in the model follows the Family-Vicsek dynamic scaling form with growth exponent β ≈ 0.0542, roughness exponent α ≈ 0.240 and dynamic exponent z ≈ 4.42. They satisfy a scaling relation α + z = 2zrw, where zrw is the random walk exponent of the fractal substrate. Also, they are in a good agreement with the predicted values of a fractional Langevin equation \\frac{\\partial h}{\\partial t}={\

Nonperturbative Treatment of non-Markovian Dynamics of Open Quantum Systems

NASA Astrophysics Data System (ADS)

Tamascelli, D.; Smirne, A.; Huelga, S. F.; Plenio, M. B.

2018-01-01

We identify the conditions that guarantee equivalence of the reduced dynamics of an open quantum system (OQS) for two different types of environments—one a continuous bosonic environment leading to a unitary system-environment evolution and the other a discrete-mode bosonic environment resulting in a system-mode (nonunitary) Lindbladian evolution. Assuming initial Gaussian states for the environments, we prove that the two OQS dynamics are equivalent if both the expectation values and two-time correlation functions of the environmental interaction operators are the same at all times for the two configurations. Since the numerical and analytical description of a discrete-mode environment undergoing a Lindbladian evolution is significantly more efficient than that of a continuous bosonic environment in a unitary evolution, our result represents a powerful, nonperturbative tool to describe complex and possibly highly non-Markovian dynamics. As a special application, we recover and generalize the well-known pseudomodes approach to open-system dynamics.

Linear and nonlinear dynamic analysis by boundary element method. Ph.D. Thesis, 1986 Final Report

NASA Technical Reports Server (NTRS)

Ahmad, Shahid

1991-01-01

An advanced implementation of the direct boundary element method (BEM) applicable to free-vibration, periodic (steady-state) vibration and linear and nonlinear transient dynamic problems involving two and three-dimensional isotropic solids of arbitrary shape is presented. Interior, exterior, and half-space problems can all be solved by the present formulation. For the free-vibration analysis, a new real variable BEM formulation is presented which solves the free-vibration problem in the form of algebraic equations (formed from the static kernels) and needs only surface discretization. In the area of time-domain transient analysis, the BEM is well suited because it gives an implicit formulation. Although the integral formulations are elegant, because of the complexity of the formulation it has never been implemented in exact form. In the present work, linear and nonlinear time domain transient analysis for three-dimensional solids has been implemented in a general and complete manner. The formulation and implementation of the nonlinear, transient, dynamic analysis presented here is the first ever in the field of boundary element analysis. Almost all the existing formulation of BEM in dynamics use the constant variation of the variables in space and time which is very unrealistic for engineering problems and, in some cases, it leads to unacceptably inaccurate results. In the present work, linear and quadratic isoparametric boundary elements are used for discretization of geometry and functional variations in space. In addition, higher order variations in time are used. These methods of analysis are applicable to piecewise-homogeneous materials, such that not only problems of the layered media and the soil-structure interaction can be analyzed but also a large problem can be solved by the usual sub-structuring technique. The analyses have been incorporated in a versatile, general-purpose computer program. Some numerical problems are solved and, through comparisons with available analytical and numerical results, the stability and high accuracy of these dynamic analysis techniques are established.

Fortran programs for the time-dependent Gross-Pitaevskii equation in a fully anisotropic trap

NASA Astrophysics Data System (ADS)

Muruganandam, P.; Adhikari, S. K.

2009-10-01

Here we develop simple numerical algorithms for both stationary and non-stationary solutions of the time-dependent Gross-Pitaevskii (GP) equation describing the properties of Bose-Einstein condensates at ultra low temperatures. In particular, we consider algorithms involving real- and imaginary-time propagation based on a split-step Crank-Nicolson method. In a one-space-variable form of the GP equation we consider the one-dimensional, two-dimensional circularly-symmetric, and the three-dimensional spherically-symmetric harmonic-oscillator traps. In the two-space-variable form we consider the GP equation in two-dimensional anisotropic and three-dimensional axially-symmetric traps. The fully-anisotropic three-dimensional GP equation is also considered. Numerical results for the chemical potential and root-mean-square size of stationary states are reported using imaginary-time propagation programs for all the cases and compared with previously obtained results. Also presented are numerical results of non-stationary oscillation for different trap symmetries using real-time propagation programs. A set of convenient working codes developed in Fortran 77 are also provided for all these cases (twelve programs in all). In the case of two or three space variables, Fortran 90/95 versions provide some simplification over the Fortran 77 programs, and these programs are also included (six programs in all). Program summaryProgram title: (i) imagetime1d, (ii) imagetime2d, (iii) imagetime3d, (iv) imagetimecir, (v) imagetimesph, (vi) imagetimeaxial, (vii) realtime1d, (viii) realtime2d, (ix) realtime3d, (x) realtimecir, (xi) realtimesph, (xii) realtimeaxial Catalogue identifier: AEDU_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEDU_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 122 907 No. of bytes in distributed program, including test data, etc.: 609 662 Distribution format: tar.gz Programming language: FORTRAN 77 and Fortran 90/95 Computer: PC Operating system: Linux, Unix RAM: 1 GByte (i, iv, v), 2 GByte (ii, vi, vii, x, xi), 4 GByte (iii, viii, xii), 8 GByte (ix) Classification: 2.9, 4.3, 4.12 Nature of problem: These programs are designed to solve the time-dependent Gross-Pitaevskii nonlinear partial differential equation in one-, two- or three-space dimensions with a harmonic, circularly-symmetric, spherically-symmetric, axially-symmetric or anisotropic trap. The Gross-Pitaevskii equation describes the properties of a dilute trapped Bose-Einstein condensate. Solution method: The time-dependent Gross-Pitaevskii equation is solved by the split-step Crank-Nicolson method by discretizing in space and time. The discretized equation is then solved by propagation, in either imaginary or real time, over small time steps. The method yields the solution of stationary and/or non-stationary problems. Additional comments: This package consists of 12 programs, see "Program title", above. FORTRAN77 versions are provided for each of the 12 and, in addition, Fortran 90/95 versions are included for ii, iii, vi, viii, ix, xii. For the particular purpose of each program please see the below. Running time: Minutes on a medium PC (i, iv, v, vii, x, xi), a few hours on a medium PC (ii, vi, viii, xii), days on a medium PC (iii, ix). Program summary (1)Title of program: imagtime1d.F Title of electronic file: imagtime1d.tar.gz Catalogue identifier: Program summary URL: Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Distribution format: tar.gz Computers: PC/Linux, workstation/UNIX Maximum RAM memory: 1 GByte Programming language used: Fortran 77 Typical running time: Minutes on a medium PC Unusual features: None Nature of physical problem: This program is designed to solve the time-dependent Gross-Pitaevskii nonlinear partial differential equation in one-space dimension with a harmonic trap. The Gross-Pitaevskii equation describes the properties of a dilute trapped Bose-Einstein condensate. Method of solution: The time-dependent Gross-Pitaevskii equation is solved by the split-step Crank-Nicolson method by discretizing in space and time. The discretized equation is then solved by propagation in imaginary time over small time steps. The method yields the solution of stationary problems. Program summary (2)Title of program: imagtimecir.F Title of electronic file: imagtimecir.tar.gz Catalogue identifier: Program summary URL: Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Distribution format: tar.gz Computers: PC/Linux, workstation/UNIX Maximum RAM memory: 1 GByte Programming language used: Fortran 77 Typical running time: Minutes on a medium PC Unusual features: None Nature of physical problem: This program is designed to solve the time-dependent Gross-Pitaevskii nonlinear partial differential equation in two-space dimensions with a circularly-symmetric trap. The Gross-Pitaevskii equation describes the properties of a dilute trapped Bose-Einstein condensate. Method of solution: The time-dependent Gross-Pitaevskii equation is solved by the split-step Crank-Nicolson method by discretizing in space and time. The discretized equation is then solved by propagation in imaginary time over small time steps. The method yields the solution of stationary problems. Program summary (3)Title of program: imagtimesph.F Title of electronic file: imagtimesph.tar.gz Catalogue identifier: Program summary URL: Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Distribution format: tar.gz Computers: PC/Linux, workstation/UNIX Maximum RAM memory: 1 GByte Programming language used: Fortran 77 Typical running time: Minutes on a medium PC Unusual features: None Nature of physical problem: This program is designed to solve the time-dependent Gross-Pitaevskii nonlinear partial differential equation in three-space dimensions with a spherically-symmetric trap. The Gross-Pitaevskii equation describes the properties of a dilute trapped Bose-Einstein condensate. Method of solution: The time-dependent Gross-Pitaevskii equation is solved by the split-step Crank-Nicolson method by discretizing in space and time. The discretized equation is then solved by propagation in imaginary time over small time steps. The method yields the solution of stationary problems. Program summary (4)Title of program: realtime1d.F Title of electronic file: realtime1d.tar.gz Catalogue identifier: Program summary URL: Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Distribution format: tar.gz Computers: PC/Linux, workstation/UNIX Maximum RAM memory: 2 GByte Programming language used: Fortran 77 Typical running time: Minutes on a medium PC Unusual features: None Nature of physical problem: This program is designed to solve the time-dependent Gross-Pitaevskii nonlinear partial differential equation in one-space dimension with a harmonic trap. The Gross-Pitaevskii equation describes the properties of a dilute trapped Bose-Einstein condensate. Method of solution: The time-dependent Gross-Pitaevskii equation is solved by the split-step Crank-Nicolson method by discretizing in space and time. The discretized equation is then solved by propagation in real time over small time steps. The method yields the solution of stationary and non-stationary problems. Program summary (5)Title of program: realtimecir.F Title of electronic file: realtimecir.tar.gz Catalogue identifier: Program summary URL: Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Distribution format: tar.gz Computers: PC/Linux, workstation/UNIX Maximum RAM memory: 2 GByte Programming language used: Fortran 77 Typical running time: Minutes on a medium PC Unusual features: None Nature of physical problem: This program is designed to solve the time-dependent Gross-Pitaevskii nonlinear partial differential equation in two-space dimensions with a circularly-symmetric trap. The Gross-Pitaevskii equation describes the properties of a dilute trapped Bose-Einstein condensate. Method of solution: The time-dependent Gross-Pitaevskii equation is solved by the split-step Crank-Nicolson method by discretizing in space and time. The discretized equation is then solved by propagation in real time over small time steps. The method yields the solution of stationary and non-stationary problems. Program summary (6)Title of program: realtimesph.F Title of electronic file: realtimesph.tar.gz Catalogue identifier: Program summary URL: Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Distribution format: tar.gz Computers: PC/Linux, workstation/UNIX Maximum RAM memory: 2 GByte Programming language used: Fortran 77 Typical running time: Minutes on a medium PC Unusual features: None Nature of physical problem: This program is designed to solve the time-dependent Gross-Pitaevskii nonlinear partial differential equation in three-space dimensions with a spherically-symmetric trap. The Gross-Pitaevskii equation describes the properties of a dilute trapped Bose-Einstein condensate. Method of solution: The time-dependent Gross-Pitaevskii equation is solved by the split-step Crank-Nicolson method by discretizing in space and time. The discretized equation is then solved by propagation in real time over small time steps. The method yields the solution of stationary and non-stationary problems. Program summary (7)Title of programs: imagtimeaxial.F and imagtimeaxial.f90 Title of electronic file: imagtimeaxial.tar.gz Catalogue identifier: Program summary URL: Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Distribution format: tar.gz Computers: PC/Linux, workstation/UNIX Maximum RAM memory: 2 GByte Programming language used: Fortran 77 and Fortran 90 Typical running time: Few hours on a medium PC Unusual features: None Nature of physical problem: This program is designed to solve the time-dependent Gross-Pitaevskii nonlinear partial differential equation in three-space dimensions with an axially-symmetric trap. The Gross-Pitaevskii equation describes the properties of a dilute trapped Bose-Einstein condensate. Method of solution: The time-dependent Gross-Pitaevskii equation is solved by the split-step Crank-Nicolson method by discretizing in space and time. The discretized equation is then solved by propagation in imaginary time over small time steps. The method yields the solution of stationary problems. Program summary (8)Title of program: imagtime2d.F and imagtime2d.f90 Title of electronic file: imagtime2d.tar.gz Catalogue identifier: Program summary URL: Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Distribution format: tar.gz Computers: PC/Linux, workstation/UNIX Maximum RAM memory: 2 GByte Programming language used: Fortran 77 and Fortran 90 Typical running time: Few hours on a medium PC Unusual features: None Nature of physical problem: This program is designed to solve the time-dependent Gross-Pitaevskii nonlinear partial differential equation in two-space dimensions with an anisotropic trap. The Gross-Pitaevskii equation describes the properties of a dilute trapped Bose-Einstein condensate. Method of solution: The time-dependent Gross-Pitaevskii equation is solved by the split-step Crank-Nicolson method by discretizing in space and time. The discretized equation is then solved by propagation in imaginary time over small time steps. The method yields the solution of stationary problems. Program summary (9)Title of program: realtimeaxial.F and realtimeaxial.f90 Title of electronic file: realtimeaxial.tar.gz Catalogue identifier: Program summary URL: Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Distribution format: tar.gz Computers: PC/Linux, workstation/UNIX Maximum RAM memory: 4 GByte Programming language used: Fortran 77 and Fortran 90 Typical running time Hours on a medium PC Unusual features: None Nature of physical problem: This program is designed to solve the time-dependent Gross-Pitaevskii nonlinear partial differential equation in three-space dimensions with an axially-symmetric trap. The Gross-Pitaevskii equation describes the properties of a dilute trapped Bose-Einstein condensate. Method of solution: The time-dependent Gross-Pitaevskii equation is solved by the split-step Crank-Nicolson method by discretizing in space and time. The discretized equation is then solved by propagation in real time over small time steps. The method yields the solution of stationary and non-stationary problems. Program summary (10)Title of program: realtime2d.F and realtime2d.f90 Title of electronic file: realtime2d.tar.gz Catalogue identifier: Program summary URL: Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Distribution format: tar.gz Computers: PC/Linux, workstation/UNIX Maximum RAM memory: 4 GByte Programming language used: Fortran 77 and Fortran 90 Typical running time: Hours on a medium PC Unusual features: None Nature of physical problem: This program is designed to solve the time-dependent Gross-Pitaevskii nonlinear partial differential equation in two-space dimensions with an anisotropic trap. The Gross-Pitaevskii equation describes the properties of a dilute trapped Bose-Einstein condensate. Method of solution: The time-dependent Gross-Pitaevskii equation is solved by the split-step Crank-Nicolson method by discretizing in space and time. The discretized equation is then solved by propagation in real time over small time steps. The method yields the solution of stationary and non-stationary problems. Program summary (11)Title of program: imagtime3d.F and imagtime3d.f90 Title of electronic file: imagtime3d.tar.gz Catalogue identifier: Program summary URL: Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Distribution format: tar.gz Computers: PC/Linux, workstation/UNIX Maximum RAM memory: 4 GByte Programming language used: Fortran 77 and Fortran 90 Typical running time: Few days on a medium PC Unusual features: None Nature of physical problem: This program is designed to solve the time-dependent Gross-Pitaevskii nonlinear partial differential equation in three-space dimensions with an anisotropic trap. The Gross-Pitaevskii equation describes the properties of a dilute trapped Bose-Einstein condensate. Method of solution: The time-dependent Gross-Pitaevskii equation is solved by the split-step Crank-Nicolson method by discretizing in space and time. The discretized equation is then solved by propagation in imaginary time over small time steps. The method yields the solution of stationary problems. Program summary (12)Title of program: realtime3d.F and realtime3d.f90 Title of electronic file: realtime3d.tar.gz Catalogue identifier: Program summary URL: Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Distribution format: tar.gz Computers: PC/Linux, workstation/UNIX Maximum Ram Memory: 8 GByte Programming language used: Fortran 77 and Fortran 90 Typical running time: Days on a medium PC Unusual features: None Nature of physical problem: This program is designed to solve the time-dependent Gross-Pitaevskii nonlinear partial differential equation in three-space dimensions with an anisotropic trap. The Gross-Pitaevskii equation describes the properties of a dilute trapped Bose-Einstein condensate. Method of solution: The time-dependent Gross-Pitaevskii equation is solved by the split-step Crank-Nicolson method by discretizing in space and time. The discretized equation is then solved by propagation in real time over small time steps. The method yields the solution of stationary and non-stationary problems.

Rigorous embedding of cell dynamics simulations in the Cahn-Hilliard-Cook framework: Imposing stability and isotropy

NASA Astrophysics Data System (ADS)

Sevink, G. J. A.

2015-05-01

We have rigorously analyzed the stability of the efficient cell dynamics simulations (CDS) method by making use of the special properties of the local averaging operator <<*>>-* in matrix form. Besides resolving a theoretical issue that has puzzled many over the past three decades, this analysis has considerable practical value: It relates CDS directly to finite-difference approximations of the Cahn-Hilliard-Cook equations and provides a straightforward recipe for replacing the original two- or three-dimensional (2D or 3D) averaging operators in CDS by an equivalent (in terms of stability) discrete Laplacian with superior isotropy and scaling behavior. As such, we open up a route to suppress the unphysical reflection of the computational grid in CDS results (grid artifacts). We found that proper rescaling of discrete Laplacians, needed to employ them in CDS, is equivalent to introducing a well-chosen time step in CDS. In turn, our analysis provides stability conditions for phase-field simulations based on the Cahn-Hilliard-Cook equations. Subsequently, we have quantitatively compared the isotropy and scaling behavior of several discrete 2D or 3D Laplacians, thereby extending the significance of this work to general field-based methodology. We found that all considered discrete Laplacians have equivalent scaling behavior along the Cartesian directions. In addition, and somewhat surprisingly, known "isotropic" discrete Laplacians, i.e., isotropic up to fourth order in |k | , become quite anisotropic for larger wave vectors, whereas "less isotropic" discrete Laplacians (second order) are only slightly anisotropic on the whole |k | range. We identified a hard limit to the accuracy with which the discrete Laplacian can emulate the two important properties of the optimal (continuum) Laplacian, as an improvement of the isotropy, by introducing additional points to the stencil, will negatively affect the scaling behavior. Within this limitation, the discrete compact Laplacians in the D n Q m class known from lattice hydrodynamics, D 2 Q 9 in 2D and D 3 Q 19 in 3D, are found to be optimal in terms of isotropy. However, by being only slightly anisotropic on the whole range and enabling larger time steps, the discrete Laplacians that relate to the local averaging operator of Oono and Puri (2D) and Shinozaki and Oono (3D) as well as the less familiar 3D discrete B v V Laplacian developed for dynamic density functional theory are valid alternatives.

76 FR 70758 - Notice Pursuant to the National Cooperative Research and Production Act of 1993-Sematech, Inc. D...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-11-15

...; Toshiba Corporation, Yokohama, Japan; Panasonic Semiconductor Discrete Devices Co., Ltd., Kyoto, Japan... and admit program members that only join certain discrete projects and thus only have access to information and intellectual property created under the discrete projects that these lower-tiered members join...

Training Parent Implementation of Discrete-Trial Teaching: Effects on Generalization of Parent Teaching and Child Correct Responding

ERIC Educational Resources Information Center

Lafasakis, Michael; Sturmey, Peter

2007-01-01

Behavioral skills training was used to teach 3 parents to implement discrete-trial teaching with their children with developmental disabilities. Parents learned to implement discrete-trial training, their skills generalized to novel programs, and the children's correct responding increased, suggesting that behavioral skills training is an…

Teach Children with Autism with the Discrete-Trial Approach.

ERIC Educational Resources Information Center

Din, Feng S.; McLaughlin, Donna

This paper discusses the outcomes of a study that investigated whether applying the discrete-trial approach is effective in teaching children with autism to learn functional and pre-academic skills. Participants were four young children with autism (ages 3-4) attending a preschool special education program of an urban public school. Discrete-trial…

Discrete-continuous variable structural synthesis using dual methods

NASA Technical Reports Server (NTRS)

Schmit, L. A.; Fleury, C.

1980-01-01

Approximation concepts and dual methods are extended to solve structural synthesis problems involving a mix of discrete and continuous sizing type of design variables. Pure discrete and pure continuous variable problems can be handled as special cases. The basic mathematical programming statement of the structural synthesis problem is converted into a sequence of explicit approximate primal problems of separable form. These problems are solved by constructing continuous explicit dual functions, which are maximized subject to simple nonnegativity constraints on the dual variables. A newly devised gradient projection type of algorithm called DUAL 1, which includes special features for handling dual function gradient discontinuities that arise from the discrete primal variables, is used to find the solution of each dual problem. Computational implementation is accomplished by incorporating the DUAL 1 algorithm into the ACCESS 3 program as a new optimizer option. The power of the method set forth is demonstrated by presenting numerical results for several example problems, including a pure discrete variable treatment of a metallic swept wing and a mixed discrete-continuous variable solution for a thin delta wing with fiber composite skins.

Experimental analysis of tablet properties for discrete element modeling of an active coating process.

PubMed

Just, Sarah; Toschkoff, Gregor; Funke, Adrian; Djuric, Dejan; Scharrer, Georg; Khinast, Johannes; Knop, Klaus; Kleinebudde, Peter

2013-03-01

Coating of solid dosage forms is an important unit operation in the pharmaceutical industry. In recent years, numerical simulations of drug manufacturing processes have been gaining interest as process analytical technology tools. The discrete element method (DEM) in particular is suitable to model tablet-coating processes. For the development of accurate simulations, information on the material properties of the tablets is required. In this study, the mechanical parameters Young's modulus, coefficient of restitution (CoR), and coefficients of friction (CoF) of gastrointestinal therapeutic systems (GITS) and of active-coated GITS were measured experimentally. The dynamic angle of repose of these tablets in a drum coater was investigated to revise the CoF. The resulting values were used as input data in DEM simulations to compare simulation and experiment. A mean value of Young's modulus of 31.9 MPa was determined by the uniaxial compression test. The CoR was found to be 0.78. For both tablet-steel and tablet-tablet friction, active-coated GITS showed a higher CoF compared with GITS. According to the values of the dynamic angle of repose, the CoF was adjusted to obtain consistent tablet motion in the simulation and in the experiment. On the basis of this experimental characterization, mechanical parameters are integrated into DEM simulation programs to perform numerical analysis of coating processes.

Some Recent Results on Graph Matching,

DTIC Science & Technology

1987-06-01

V. CHVATAL, Tough graphs and Hamiltonian circuits, Discrete Math . 5, 1973, 215-228. [El] J. EDMONDS, Paths, trees and flowers, Canad. J. Math. 17...Theory, Ann. Discrete Math . 29, North-Holland, Amsterdam, 1986. [N] D. NADDEF, Rank of maximum matchings in a graph, Math. Programming 22, 52-70. [NP...Optimization, Ann. Discrete Math . 16, North-Holland, Amsterdam, 1982, 241-260. [P1] M.D. PLUMMER, On n-extendable graphs, Discrete Math . 31, 1980, 201-210

About the discrete-continuous nature of a hematopoiesis model for Chronic Myeloid Leukemia.

PubMed

Gaudiano, Marcos E; Lenaerts, Tom; Pacheco, Jorge M

2016-12-01

Blood of mammals is composed of a variety of cells suspended in a fluid medium known as plasma. Hematopoiesis is the biological process of birth, replication and differentiation of blood cells. Despite of being essentially a stochastic phenomenon followed by a huge number of discrete entities, blood formation has naturally an associated continuous dynamics, because the cellular populations can - on average - easily be described by (e.g.) differential equations. This deterministic dynamics by no means contemplates some important stochastic aspects related to abnormal hematopoiesis, that are especially significant for studying certain blood cancer deceases. For instance, by mere stochastic competition against the normal cells, leukemic cells sometimes do not reach the population thereshold needed to kill the organism. Of course, a pure discrete model able to follow the stochastic paths of billons of cells is computationally impossible. In order to avoid this difficulty, we seek a trade-off between the computationally feasible and the biologically realistic, deriving an equation able to size conveniently both the discrete and continuous parts of a model for hematopoiesis in terrestrial mammals, in the context of Chronic Myeloid Leukemia. Assuming the cancer is originated from a single stem cell inside of the bone marrow, we also deduce a theoretical formula for the probability of non-diagnosis as a function of the mammal average adult mass. In addition, this work cellular dynamics analysis may shed light on understanding Peto's paradox, which is shown here as an emergent property of the discrete-continuous nature of the system. Copyright © 2016 Elsevier Inc. All rights reserved.

A Bell-Curved Based Algorithm for Mixed Continuous and Discrete Structural Optimization

NASA Technical Reports Server (NTRS)

Kincaid, Rex K.; Weber, Michael; Sobieszczanski-Sobieski, Jaroslaw

2001-01-01

An evolutionary based strategy utilizing two normal distributions to generate children is developed to solve mixed integer nonlinear programming problems. This Bell-Curve Based (BCB) evolutionary algorithm is similar in spirit to (mu + mu) evolutionary strategies and evolutionary programs but with fewer parameters to adjust and no mechanism for self adaptation. First, a new version of BCB to solve purely discrete optimization problems is described and its performance tested against a tabu search code for an actuator placement problem. Next, the performance of a combined version of discrete and continuous BCB is tested on 2-dimensional shape problems and on a minimum weight hub design problem. In the latter case the discrete portion is the choice of the underlying beam shape (I, triangular, circular, rectangular, or U).

Comparative Assessment and Decision Support System for Strategic Military Airlift Capability

NASA Technical Reports Server (NTRS)

Salmon, John; Iwata, Curtis; Mavris, Dimitri; Weston, Neil; Fahringer, Philip

2011-01-01

The Lockheed Martin Aeronautics Company has been awarded several programs to modernize the aging C-5 military transport fleet. In order to ensure its continuation amidst budget cuts, it was important to engage the decision makers by providing an environment to analyze the benefits of the modernization program. This paper describes an interface that allows the user to change inputs such as the scenario airfields, take-off conditions, and reliability characteristics. The underlying logistics surrogate model was generated using data from a discrete-event simulation. Various visualizations such as intercontinental flight paths illustrated in 3D, have been created to aid the user in analyzing scenarios and performing comparative assessments for various output logistics metrics. The capability to rapidly and dynamically evaluate and compare scenarios was developed enabling real time strategy exploration and trade-offs.

Extracting, Tracking, and Visualizing Magnetic Flux Vortices in 3D Complex-Valued Superconductor Simulation Data.

PubMed

Guo, Hanqi; Phillips, Carolyn L; Peterka, Tom; Karpeyev, Dmitry; Glatz, Andreas

2016-01-01

We propose a method for the vortex extraction and tracking of superconducting magnetic flux vortices for both structured and unstructured mesh data. In the Ginzburg-Landau theory, magnetic flux vortices are well-defined features in a complex-valued order parameter field, and their dynamics determine electromagnetic properties in type-II superconductors. Our method represents each vortex line (a 1D curve embedded in 3D space) as a connected graph extracted from the discretized field in both space and time. For a time-varying discrete dataset, our vortex extraction and tracking method is as accurate as the data discretization. We then apply 3D visualization and 2D event diagrams to the extraction and tracking results to help scientists understand vortex dynamics and macroscale superconductor behavior in greater detail than previously possible.

Understanding water column and streambed thermal refugia for endangered mussels in the Delaware River

USGS Publications Warehouse

Briggs, Martin A.; Voytek, Emily B.; Day-Lewis, Frederick D.; Rosenberry, Donald O.; Lane, John W.

2013-01-01

Groundwater discharge locations along the upper Delaware River, both discrete bank seeps and diffuse streambed upwelling, may create thermal niche environments that benefit the endangered dwarf wedgemussel (Alasmidonta heterodon). We seek to identify whether discrete or diffuse groundwater inflow is the dominant control on refugia. Numerous springs and seeps were identified at all locations where dwarf wedgemussels still can be found. Infrared imagery and custom high spatial resolution fiber-optic distributed temperature sensors reveal complex thermal dynamics at one of the seeps with a relatively stable, cold groundwater plume extending along the streambed/water-column interface during mid-summer. This plume, primarily fed by a discrete bank seep, was shown through analytical and numerical heat-transport modeling to dominate temperature dynamics in the region of potential habitation by the adult dwarf wedgemussel.

Dynamic Noise and its Role in Understanding Epidemiological Processes

NASA Astrophysics Data System (ADS)

Stollenwerk, Nico; Aguiar, Maíra

2010-09-01

We investigate the role of dynamic noise in understanding epidemiological systems, such as influenza or dengue fever by deriving stochastic ordinary differential equations from markov processes for discrete populations. This approach allows for an easy analysis of dynamical noise transitions between co-existing attractors.

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

PubMed

Sasaki, Ryu

2011-03-28

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

Boutique to Booming: Medicare Managed Care and the Private Path to Policy Change.

PubMed

Kelly, Andrew S

2016-06-01

In 2014, Medicare Advantage (MA) enrollment surpassed 30 percent of eligible beneficiaries. Twenty-five years earlier, enrollment hovered at just 3 percent. The expansion of private Medicare plans presents a puzzling instance of policy change within Medicare-a program long held to be a quintessential case of policy stasis. This article investigates the policy features that made Medicare susceptible to this dramatic policy shift, as well as the processes by which the initial policy change remade the politics of Medicare and solidified the MA program. The first enrollment surge occurred in the absence of a proximate legislative or administrative change. Instead, increased spending and expanded benefits were the result of the interaction of new market dynamics with an existing legislative framework-demonstrating an expansionary form of policy drift. The 1982 Tax Equity and Fiscal Responsibility Act created a policy space that gave the new and lightly controlled managed care industry considerable operational discretion. As the interests of the government's private partners changed in response to new market dynamics, a change occurred in the output and performance of the Medicare managed care program. As enrollment and spending increased, Medicare's politics were remade by the political empowerment of the managed care industry and the creation of a new subconstituency of beneficiaries. Copyright © 2016 by Duke University Press.

The unstaggered extension to GFDL's FV3 dynamical core on the cubed-sphere

NASA Astrophysics Data System (ADS)

Chen, X.; Lin, S. J.; Harris, L.

2017-12-01

Finite-volume schemes have become popular for atmospheric transport since they provide intrinsic mass conservation to constituent species. Many CFD codes use unstaggered discretizations for finite volume methods with an approximate Riemann solver. However, this approach is inefficient for geophysical flows due to the complexity of the Riemann solver. We introduce a Low Mach number Approximate Riemann Solver (LMARS) simplified using assumptions appropriate for atmospheric flows: the wind speed is much slower than the sound speed, weak discontinuities, and locally uniform sound wave velocity. LMARS makes possible a Riemann-solver-based dynamical core comparable in computational efficiency to many current dynamical cores. We will present a 3D finite-volume dynamical core using LMARS in a cubed-sphere geometry with a vertically Lagrangian discretization. Results from standard idealized test cases will be discussed.

Alternation of regular and chaotic dynamics in a simple two-degree-of-freedom system with nonlinear inertial coupling.

PubMed

Sigalov, G; Gendelman, O V; AL-Shudeifat, M A; Manevitch, L I; Vakakis, A F; Bergman, L A

2012-03-01

We show that nonlinear inertial coupling between a linear oscillator and an eccentric rotator can lead to very interesting interchanges between regular and chaotic dynamical behavior. Indeed, we show that this model demonstrates rather unusual behavior from the viewpoint of nonlinear dynamics. Specifically, at a discrete set of values of the total energy, the Hamiltonian system exhibits non-conventional nonlinear normal modes, whose shape is determined by phase locking of rotatory and oscillatory motions of the rotator at integer ratios of characteristic frequencies. Considering the weakly damped system, resonance capture of the dynamics into the vicinity of these modes brings about regular motion of the system. For energy levels far from these discrete values, the motion of the system is chaotic. Thus, the succession of resonance captures and escapes by a discrete set of the normal modes causes a sequence of transitions between regular and chaotic behavior, provided that the damping is sufficiently small. We begin from the Hamiltonian system and present a series of Poincaré sections manifesting the complex structure of the phase space of the considered system with inertial nonlinear coupling. Then an approximate analytical description is presented for the non-conventional nonlinear normal modes. We confirm the analytical results by numerical simulation and demonstrate the alternate transitions between regular and chaotic dynamics mentioned above. The origin of the chaotic behavior is also discussed.

76 FR 44271 - Approval and Promulgation of Implementation Plans; Texas; Revisions to Permits by Rule and...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-07-25

..., 1998, revision creates new section 116.116(f) allowing for the use of Discrete Emission Reduction... allows the use of Discrete Emission Reduction Credits (DERCs) to be used to exceed permit allowables and... credits (called discrete emission reduction credits, or DERCs, in the Texas program) by reducing its...

76 FR 67600 - Approval and Promulgation of Implementation Plans; Texas; Regulations for Control of Air...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-11-02

... July 22, 1998, revision allows for the use of Discrete Emission Reduction Credits (DERC) to exceed... creates a new section at 116.116(f) that allows Discrete Emission Reduction Credits (DERCs) to be used to...-term emission credits (called discrete emission reduction credits, or DERCs, in the Texas program) by...

Dynamic Response-by-Response Models of Matching Behavior in Rhesus Monkeys

ERIC Educational Resources Information Center

Lau, Brian; Glimcher, Paul W.

2005-01-01

We studied the choice behavior of 2 monkeys in a discrete-trial task with reinforcement contingencies similar to those Herrnstein (1961) used when he described the matching law. In each session, the monkeys experienced blocks of discrete trials at different relative-reinforcer frequencies or magnitudes with unsignalled transitions between the…

Discrete Events as Units of Perceived Time

ERIC Educational Resources Information Center

Liverence, Brandon M.; Scholl, Brian J.

2012-01-01

In visual images, we perceive both space (as a continuous visual medium) and objects (that inhabit space). Similarly, in dynamic visual experience, we perceive both continuous time and discrete events. What is the relationship between these units of experience? The most intuitive answer may be similar to the spatial case: time is perceived as an…

Coupled dynamics of a viscoelastically supported infinite string and a number of discrete mechanical systems moving with uniform speed

NASA Astrophysics Data System (ADS)

Roy, Soumyajit; Chakraborty, G.; DasGupta, Anirvan

2018-02-01

The mutual interaction between a number of multi degrees of freedom mechanical systems moving with uniform speed along an infinite taut string supported by a viscoelastic layer has been studied using the substructure synthesis method when base excitations of a common frequency are given to the mechanical systems. The mobility or impedance matrices of the string have been calculated analytically by Fourier transform method as well as wave propagation technique. The above matrices are used to calculate the response of the discrete mechanical systems. Special attention is paid to the contact forces between the discrete and the continuous systems which are estimated by numerical simulation. The effects of phase difference, the distance between the systems and different base excitation amplitudes on the collective behaviour of the mechanical systems are also studied. The present study has relevance to the coupled dynamic problem of more than one railway pantographs and an overhead catenary system where the pantographs are modelled as discrete systems and the catenary is modelled as a taut string supported by continuous viscoelastic layer.

Large-deformation modal coordinates for nonrigid vehicle dynamics

NASA Technical Reports Server (NTRS)

Likins, P. W.; Fleischer, G. E.

1972-01-01

The derivation of minimum-dimension sets of discrete-coordinate and hybrid-coordinate equations of motion of a system consisting of an arbitrary number of hinge-connected rigid bodies assembled in tree topology is presented. These equations are useful for the simulation of dynamical systems that can be idealized as tree-like arrangements of substructures, with each substructure consisting of either a rigid body or a collection of elastically interconnected rigid bodies restricted to small relative rotations at each connection. Thus, some of the substructures represent elastic bodies subjected to small strains or local deformations, but possibly large gross deformations, in the hybrid formulation, distributed coordinates referred to herein as large-deformation modal coordinates, are used for the deformations of these substructures. The equations are in a form suitable for incorporation into one or more computer programs to be used as multipurpose tools in the simulation of spacecraft and other complex electromechanical systems.

Model-Free Adaptive Control for Unknown Nonlinear Zero-Sum Differential Game.

PubMed

Zhong, Xiangnan; He, Haibo; Wang, Ding; Ni, Zhen

2018-05-01

In this paper, we present a new model-free globalized dual heuristic dynamic programming (GDHP) approach for the discrete-time nonlinear zero-sum game problems. First, the online learning algorithm is proposed based on the GDHP method to solve the Hamilton-Jacobi-Isaacs equation associated with optimal regulation control problem. By setting backward one step of the definition of performance index, the requirement of system dynamics, or an identifier is relaxed in the proposed method. Then, three neural networks are established to approximate the optimal saddle point feedback control law, the disturbance law, and the performance index, respectively. The explicit updating rules for these three neural networks are provided based on the data generated during the online learning along the system trajectories. The stability analysis in terms of the neural network approximation errors is discussed based on the Lyapunov approach. Finally, two simulation examples are provided to show the effectiveness of the proposed method.

A plasmonic nanorod that walks on DNA origami

PubMed Central

Zhou, Chao; Duan, Xiaoyang; Liu, Na

2015-01-01

In nano-optics, a formidable challenge remains in precise transport of a single optical nano-object along a programmed and routed path toward a predefined destination. Molecular motors in living cells that can walk directionally along microtubules have been the inspiration for realizing artificial molecular walkers. Here we demonstrate an active plasmonic system, in which a plasmonic nanorod can execute directional, progressive and reverse nanoscale walking on two or three-dimensional DNA origami. Such a walker comprises an anisotropic gold nanorod as its ‘body' and discrete DNA strands as its ‘feet'. Specifically, our walker carries optical information and can in situ optically report its own walking directions and consecutive steps at nanometer accuracy, through dynamic coupling to a plasmonic stator immobilized along its walking track. Our concept will enable a variety of smart nanophotonic platforms for studying dynamic light–matter interaction, which requires controlled motion at the nanoscale well below the optical diffraction limit. PMID:26303016

Probabilistic DHP adaptive critic for nonlinear stochastic control systems.

PubMed

Herzallah, Randa

2013-06-01

Following the recently developed algorithms for fully probabilistic control design for general dynamic stochastic systems (Herzallah & Káarnáy, 2011; Kárný, 1996), this paper presents the solution to the probabilistic dual heuristic programming (DHP) adaptive critic method (Herzallah & Káarnáy, 2011) and randomized control algorithm for stochastic nonlinear dynamical systems. The purpose of the randomized control input design is to make the joint probability density function of the closed loop system as close as possible to a predetermined ideal joint probability density function. This paper completes the previous work (Herzallah & Káarnáy, 2011; Kárný, 1996) by formulating and solving the fully probabilistic control design problem on the more general case of nonlinear stochastic discrete time systems. A simulated example is used to demonstrate the use of the algorithm and encouraging results have been obtained. Copyright © 2013 Elsevier Ltd. All rights reserved.

Continuous analog of multiplicative algebraic reconstruction technique for computed tomography

NASA Astrophysics Data System (ADS)

Tateishi, Kiyoko; Yamaguchi, Yusaku; Abou Al-Ola, Omar M.; Kojima, Takeshi; Yoshinaga, Tetsuya

2016-03-01

We propose a hybrid dynamical system as a continuous analog to the block-iterative multiplicative algebraic reconstruction technique (BI-MART), which is a well-known iterative image reconstruction algorithm for computed tomography. The hybrid system is described by a switched nonlinear system with a piecewise smooth vector field or differential equation and, for consistent inverse problems, the convergence of non-negatively constrained solutions to a globally stable equilibrium is guaranteed by the Lyapunov theorem. Namely, we can prove theoretically that a weighted Kullback-Leibler divergence measure can be a common Lyapunov function for the switched system. We show that discretizing the differential equation by using the first-order approximation (Euler's method) based on the geometric multiplicative calculus leads to the same iterative formula of the BI-MART with the scaling parameter as a time-step of numerical discretization. The present paper is the first to reveal that a kind of iterative image reconstruction algorithm is constructed by the discretization of a continuous-time dynamical system for solving tomographic inverse problems. Iterative algorithms with not only the Euler method but also the Runge-Kutta methods of lower-orders applied for discretizing the continuous-time system can be used for image reconstruction. A numerical example showing the characteristics of the discretized iterative methods is presented.

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

PubMed

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.

Dynamical Localization for Discrete Anderson Dirac Operators

NASA Astrophysics Data System (ADS)

Prado, Roberto A.; de Oliveira, César R.; Carvalho, Silas L.

2017-04-01

We establish dynamical localization for random Dirac operators on the d-dimensional lattice, with d\\in { 1, 2, 3} , in the three usual regimes: large disorder, band edge and 1D. These operators are discrete versions of the continuous Dirac operators and consist in the sum of a discrete free Dirac operator with a random potential. The potential is a diagonal matrix formed by different scalar potentials, which are sequences of independent and identically distributed random variables according to an absolutely continuous probability measure with bounded density and of compact support. We prove the exponential decay of fractional moments of the Green function for such models in each of the above regimes, i.e., (j) throughout the spectrum at larger disorder, (jj) for energies near the band edges at arbitrary disorder and (jjj) in dimension one, for all energies in the spectrum and arbitrary disorder. Dynamical localization in theses regimes follows from the fractional moments method. The result in the one-dimensional regime contrast with one that was previously obtained for 1D Dirac model with Bernoulli potential.

Integrable Floquet dynamics, generalized exclusion processes and "fused" matrix ansatz

NASA Astrophysics Data System (ADS)

Vanicat, Matthieu

2018-04-01

We present a general method for constructing integrable stochastic processes, with two-step discrete time Floquet dynamics, from the transfer matrix formalism. The models can be interpreted as a discrete time parallel update. The method can be applied for both periodic and open boundary conditions. We also show how the stationary distribution can be built as a matrix product state. As an illustration we construct parallel discrete time dynamics associated with the R-matrix of the SSEP and of the ASEP, and provide the associated stationary distributions in a matrix product form. We use this general framework to introduce new integrable generalized exclusion processes, where a fixed number of particles is allowed on each lattice site in opposition to the (single particle) exclusion process models. They are constructed using the fusion procedure of R-matrices (and K-matrices for open boundary conditions) for the SSEP and ASEP. We develop a new method, that we named "fused" matrix ansatz, to build explicitly the stationary distribution in a matrix product form. We use this algebraic structure to compute physical observables such as the correlation functions and the mean particle current.

Dynamic thermal-time model of cold hardiness for dormant grapevine buds

USDA-ARS?s Scientific Manuscript database

Grapevine (Vitis spp.) cold hardiness varies dynamically throughout the dormant season, primarily in response to changes in temperature. We describe development and possible uses of a discrete-dynamic model of bud cold hardiness for three Vitis genotypes. Iterative methods were used to optimize and ...

Discrete bacteria foraging optimization algorithm for graph based problems - a transition from continuous to discrete

NASA Astrophysics Data System (ADS)

Sur, Chiranjib; Shukla, Anupam

2018-03-01

Bacteria Foraging Optimisation Algorithm is a collective behaviour-based meta-heuristics searching depending on the social influence of the bacteria co-agents in the search space of the problem. The algorithm faces tremendous hindrance in terms of its application for discrete problems and graph-based problems due to biased mathematical modelling and dynamic structure of the algorithm. This had been the key factor to revive and introduce the discrete form called Discrete Bacteria Foraging Optimisation (DBFO) Algorithm for discrete problems which exceeds the number of continuous domain problems represented by mathematical and numerical equations in real life. In this work, we have mainly simulated a graph-based road multi-objective optimisation problem and have discussed the prospect of its utilisation in other similar optimisation problems and graph-based problems. The various solution representations that can be handled by this DBFO has also been discussed. The implications and dynamics of the various parameters used in the DBFO are illustrated from the point view of the problems and has been a combination of both exploration and exploitation. The result of DBFO has been compared with Ant Colony Optimisation and Intelligent Water Drops Algorithms. Important features of DBFO are that the bacteria agents do not depend on the local heuristic information but estimates new exploration schemes depending upon the previous experience and covered path analysis. This makes the algorithm better in combination generation for graph-based problems and combination generation for NP hard problems.

Real time optimal guidance of low-thrust spacecraft: an application of nonlinear model predictive control.

PubMed

Arrieta-Camacho, Juan José; Biegler, Lorenz T

2005-12-01

Real time optimal guidance is considered for a class of low thrust spacecraft. In particular, nonlinear model predictive control (NMPC) is utilized for computing the optimal control actions required to transfer a spacecraft from a low Earth orbit to a mission orbit. The NMPC methodology presented is able to cope with unmodeled disturbances. The dynamics of the transfer are modeled using a set of modified equinoctial elements because they do not exhibit singularities for zero inclination and zero eccentricity. The idea behind NMPC is the repeated solution of optimal control problems; at each time step, a new control action is computed. The optimal control problem is solved using a direct method-fully discretizing the equations of motion. The large scale nonlinear program resulting from the discretization procedure is solved using IPOPT--a primal-dual interior point algorithm. Stability and robustness characteristics of the NMPC algorithm are reviewed. A numerical example is presented that encourages further development of the proposed methodology: the transfer from low-Earth orbit to a molniya orbit.

Hypersonic Navier-Stokes Comparisons to Orbiter Flight Data

NASA Technical Reports Server (NTRS)

Candler, Graham V.; Campbell, Charles H.

2010-01-01

During the STS-119 flight of Space Shuttle Discovery, two sets of surface temperature measurements were made. Under the HYTHIRM program3 quantitative thermal images of the windward side of the Orbiter with a were taken. In addition, the Boundary Layer Transition Flight Experiment 4 made thermocouple measurements at discrete locations on the Orbiter wind side. Most of these measurements were made downstream of a surface protuberance designed to trip the boundary layer to turbulent flow. In this paper, we use the US3D computational fluid dynamics code to simulate the Orbiter flow field at conditions corresponding to the STS-119 re-entry. We employ a standard two-temperature, five-species finite-rate model for high-temperature air, and the surface catalysis model of Stewart.1 This work is similar to the analysis of Wood et al . 2 except that we use a different approach for modeling turbulent flow. We use the one-equation Spalart-Allmaras turbulence model8 with compressibility corrections 9 and an approach for tripping the boundary layer at discrete locations. In general, the comparison between the simulations and flight data is remarkably good

Discrete-time online learning control for a class of unknown nonaffine nonlinear systems using reinforcement learning.

PubMed

Yang, Xiong; Liu, Derong; Wang, Ding; Wei, Qinglai

2014-07-01

In this paper, a reinforcement-learning-based direct adaptive control is developed to deliver a desired tracking performance for a class of discrete-time (DT) nonlinear systems with unknown bounded disturbances. We investigate multi-input-multi-output unknown nonaffine nonlinear DT systems and employ two neural networks (NNs). By using Implicit Function Theorem, an action NN is used to generate the control signal and it is also designed to cancel the nonlinearity of unknown DT systems, for purpose of utilizing feedback linearization methods. On the other hand, a critic NN is applied to estimate the cost function, which satisfies the recursive equations derived from heuristic dynamic programming. The weights of both the action NN and the critic NN are directly updated online instead of offline training. By utilizing Lyapunov's direct method, the closed-loop tracking errors and the NN estimated weights are demonstrated to be uniformly ultimately bounded. Two numerical examples are provided to show the effectiveness of the present approach. Copyright © 2014 Elsevier Ltd. All rights reserved.

Derivation and computation of discrete-delay and continuous-delay SDEs in mathematical biology.

PubMed

Allen, Edward J

2014-06-01

Stochastic versions of several discrete-delay and continuous-delay differential equations, useful in mathematical biology, are derived from basic principles carefully taking into account the demographic, environmental, or physiological randomness in the dynamic processes. In particular, stochastic delay differential equation (SDDE) models are derived and studied for Nicholson's blowflies equation, Hutchinson's equation, an SIS epidemic model with delay, bacteria/phage dynamics, and glucose/insulin levels. Computational methods for approximating the SDDE models are described. Comparisons between computational solutions of the SDDEs and independently formulated Monte Carlo calculations support the accuracy of the derivations and of the computational methods.

Equation-free and variable free modeling for complex/multiscale systems. Coarse-grained computation in science and engineering using fine-grained models

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kevrekidis, Ioannis G.

The work explored the linking of modern developing machine learning techniques (manifold learning and in particular diffusion maps) with traditional PDE modeling/discretization/scientific computation techniques via the equation-free methodology developed by the PI. The result (in addition to several PhD degrees, two of them by CSGF Fellows) was a sequence of strong developments - in part on the algorithmic side, linking data mining with scientific computing, and in part on applications, ranging from PDE discretizations to molecular dynamics and complex network dynamics.

Development of dynamic Bayesian models for web application test management

NASA Astrophysics Data System (ADS)

Azarnova, T. V.; Polukhin, P. V.; Bondarenko, Yu V.; Kashirina, I. L.

2018-03-01

The mathematical apparatus of dynamic Bayesian networks is an effective and technically proven tool that can be used to model complex stochastic dynamic processes. According to the results of the research, mathematical models and methods of dynamic Bayesian networks provide a high coverage of stochastic tasks associated with error testing in multiuser software products operated in a dynamically changing environment. Formalized representation of the discrete test process as a dynamic Bayesian model allows us to organize the logical connection between individual test assets for multiple time slices. This approach gives an opportunity to present testing as a discrete process with set structural components responsible for the generation of test assets. Dynamic Bayesian network-based models allow us to combine in one management area individual units and testing components with different functionalities and a direct influence on each other in the process of comprehensive testing of various groups of computer bugs. The application of the proposed models provides an opportunity to use a consistent approach to formalize test principles and procedures, methods used to treat situational error signs, and methods used to produce analytical conclusions based on test results.

Simulation of Healing Threshold in Strain-Induced Inflammation Through a Discrete Informatics Model.

PubMed

Ibrahim, Israr Bin M; Sarma O V, Sanjay; Pidaparti, Ramana M

2018-05-01

Respiratory diseases such as asthma and acute respiratory distress syndrome as well as acute lung injury involve inflammation at the cellular level. The inflammation process is very complex and is characterized by the emergence of cytokines along with other changes in cellular processes. Due to the complexity of the various constituents that makes up the inflammation dynamics, it is necessary to develop models that can complement experiments to fully understand inflammatory diseases. In this study, we developed a discrete informatics model based on cellular automata (CA) approach to investigate the influence of elastic field (stretch/strain) on the dynamics of inflammation and account for probabilistic adaptation based on statistical interpretation of existing experimental data. Our simulation model investigated the effects of low, medium, and high strain conditions on inflammation dynamics. Results suggest that the model is able to indicate the threshold of innate healing of tissue as a response to strain experienced by the tissue. When strain is under the threshold, the tissue is still capable of adapting its structure to heal the damaged part. However, there exists a strain threshold where healing capability breaks down. The results obtained demonstrate that the developed discrete informatics based CA model is capable of modeling and giving insights into inflammation dynamics parameters under various mechanical strain/stretch environments.

Coupled intertwiner dynamics: A toy model for coupling matter to spin foam models

NASA Astrophysics Data System (ADS)

Steinhaus, Sebastian

2015-09-01

The universal coupling of matter and gravity is one of the most important features of general relativity. In quantum gravity, in particular spin foams, matter couplings have been defined in the past, yet the mutual dynamics, in particular if matter and gravity are strongly coupled, are hardly explored, which is related to the definition of both matter and gravitational degrees of freedom on the discretization. However, extracting these mutual dynamics is crucial in testing the viability of the spin foam approach and also establishing connections to other discrete approaches such as lattice gauge theories. Therefore, we introduce a simple two-dimensional toy model for Yang-Mills coupled to spin foams, namely an Ising model coupled to so-called intertwiner models defined for SU (2 )k. The two systems are coupled by choosing the Ising coupling constant to depend on spin labels of the background, as these are interpreted as the edge lengths of the discretization. We coarse grain this toy model via tensor network renormalization and uncover an interesting dynamics: the Ising phase transition temperature turns out to be sensitive to the background configurations and conversely, the Ising model can induce phase transitions in the background. Moreover, we observe a strong coupling of both systems if close to both phase transitions.

Closure measures for coarse-graining of the tent map.

PubMed

Pfante, Oliver; Olbrich, Eckehard; Bertschinger, Nils; Ay, Nihat; Jost, Jürgen

2014-03-01

We quantify the relationship between the dynamics of a time-discrete dynamical system, the tent map T and its iterations T(m), and the induced dynamics at a symbolical level in information theoretical terms. The symbol dynamics, given by a binary string s of length m, is obtained by choosing a partition point [Formula: see text] and lumping together the points [Formula: see text] s.t. T(i)(x) concurs with the i - 1th digit of s-i.e., we apply a so called threshold crossing technique. Interpreting the original dynamics and the symbolic one as different levels, this allows us to quantitatively evaluate and compare various closure measures that have been proposed for identifying emergent macro-levels of a dynamical system. In particular, we can see how these measures depend on the choice of the partition point α. As main benefit of this new information theoretical approach, we get all Markov partitions with full support of the time-discrete dynamical system induced by the tent map. Furthermore, we could derive an example of a Markovian symbol dynamics whose underlying partition is not Markovian at all, and even a whole hierarchy of Markovian symbol dynamics.

Dynamical Approach Study of Spurious Steady-State Numerical Solutions of Nonlinear Differential Equations. 2; Global Asymptotic Behavior of Time Discretizations; 2. Global Asymptotic Behavior of time Discretizations

NASA Technical Reports Server (NTRS)

Yee, H. C.; Sweby, P. K.

1995-01-01

The global asymptotic nonlinear behavior of 1 1 explicit and implicit time discretizations for four 2 x 2 systems of first-order autonomous nonlinear ordinary differential equations (ODES) is analyzed. The objectives are to gain a basic understanding of the difference in the dynamics of numerics between the scalars and systems of nonlinear autonomous ODEs and to set a baseline global asymptotic solution behavior of these schemes for practical computations in computational fluid dynamics. We show how 'numerical' basins of attraction can complement the bifurcation diagrams in gaining more detailed global asymptotic behavior of time discretizations for nonlinear differential equations (DEs). We show how in the presence of spurious asymptotes the basins of the true stable steady states can be segmented by the basins of the spurious stable and unstable asymptotes. One major consequence of this phenomenon which is not commonly known is that this spurious behavior can result in a dramatic distortion and, in most cases, a dramatic shrinkage and segmentation of the basin of attraction of the true solution for finite time steps. Such distortion, shrinkage and segmentation of the numerical basins of attraction will occur regardless of the stability of the spurious asymptotes, and will occur for unconditionally stable implicit linear multistep methods. In other words, for the same (common) steady-state solution the associated basin of attraction of the DE might be very different from the discretized counterparts and the numerical basin of attraction can be very different from numerical method to numerical method. The results can be used as an explanation for possible causes of error, and slow convergence and nonconvergence of steady-state numerical solutions when using the time-dependent approach for nonlinear hyperbolic or parabolic PDES.

Center for Efficient Exascale Discretizations Software Suite

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kolev, Tzanio; Dobrev, Veselin; Tomov, Vladimir

The CEED Software suite is a collection of generally applicable software tools focusing on the following computational motives: PDE discretizations on unstructured meshes, high-order finite element and spectral element methods and unstructured adaptive mesh refinement. All of this software is being developed as part of CEED, a co-design Center for Efficient Exascale Discretizations, within DOE's Exascale Computing Project (ECP) program.

Delay-dependent dynamical analysis of complex-valued memristive neural networks: Continuous-time and discrete-time cases.

PubMed

Wang, Jinling; Jiang, Haijun; Ma, Tianlong; Hu, Cheng

2018-05-01

This paper considers the delay-dependent stability of memristive complex-valued neural networks (MCVNNs). A novel linear mapping function is presented to transform the complex-valued system into the real-valued system. Under such mapping function, both continuous-time and discrete-time MCVNNs are analyzed in this paper. Firstly, when activation functions are continuous but not Lipschitz continuous, an extended matrix inequality is proved to ensure the stability of continuous-time MCVNNs. Furthermore, if activation functions are discontinuous, a discontinuous adaptive controller is designed to acquire its stability by applying Lyapunov-Krasovskii functionals. Secondly, compared with techniques in continuous-time MCVNNs, the Halanay-type inequality and comparison principle are firstly used to exploit the dynamical behaviors of discrete-time MCVNNs. Finally, the effectiveness of theoretical results is illustrated through numerical examples. Copyright © 2018 Elsevier Ltd. All rights reserved.

Discretization of the total magnetic field by the nuclear spin bath in fluorine-doped ZnSe.

PubMed

Zhukov, E A; Kirstein, E; Kopteva, N E; Heisterkamp, F; Yugova, I A; Korenev, V L; Yakovlev, D R; Pawlis, A; Bayer, M; Greilich, A

2018-05-16

The coherent spin dynamics of fluorine donor-bound electrons in ZnSe induced by pulsed optical excitation is studied in a perpendicular applied magnetic field. The Larmor precession frequency serves as a measure for the total magnetic field exerted onto the electron spins and, surprisingly, does not increase linearly with the applied field, but shows a step-like behavior with pronounced plateaus, given by multiples of the laser repetition rate. This discretization occurs by a feedback mechanism in which the electron spins polarize the nuclear spins, which in turn generate a local Overhauser field adjusting the total magnetic field accordingly. Varying the optical excitation power, we can control the plateaus, in agreement with our theoretical model. From this model, we trace the observed discretization to the optically induced Stark field, which causes the dynamic nuclear polarization.

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

NASA Technical Reports Server (NTRS)

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.

A computer-assisted study of pulse dynamics in anisotropic media

NASA Astrophysics Data System (ADS)

Krishnan, J.; Engelborghs, K.; Bär, M.; Lust, K.; Roose, D.; Kevrekidis, I. G.

2001-06-01

This study focuses on the computer-assisted stability analysis of travelling pulse-like structures in spatially periodic heterogeneous reaction-diffusion media. The physical motivation comes from pulse propagation in thin annular domains on a diffusionally anisotropic catalytic surface. The study was performed by computing the travelling pulse-like structures as limit cycles of the spatially discretized PDE, which in turn is performed in two ways: a Newton method based on a pseudospectral discretization of the PDE, and a Newton-Picard method based on a finite difference discretization. Details about the spectra of these modulated pulse-like structures are discussed, including how they may be compared with the spectra of pulses in homogeneous media. The effects of anisotropy on the dynamics of pulses and pulse pairs are studied. Beyond shifting the location of bifurcations present in homogeneous media, anisotropy can also introduce certain new instabilities.

2D discontinuous piecewise linear map: Emergence of fashion cycles.

PubMed

Gardini, L; Sushko, I; Matsuyama, K

2018-05-01

We consider a discrete-time version of the continuous-time fashion cycle model introduced in Matsuyama, 1992. Its dynamics are defined by a 2D discontinuous piecewise linear map depending on three parameters. In the parameter space of the map periodicity, regions associated with attracting cycles of different periods are organized in the period adding and period incrementing bifurcation structures. The boundaries of all the periodicity regions related to border collision bifurcations are obtained analytically in explicit form. We show the existence of several partially overlapping period incrementing structures, that is, a novelty for the considered class of maps. Moreover, we show that if the time-delay in the discrete time formulation of the model shrinks to zero, the number of period incrementing structures tends to infinity and the dynamics of the discrete time fashion cycle model converges to those of continuous-time fashion cycle model.

Cortical Neural Computation by Discrete Results Hypothesis

PubMed Central

Castejon, Carlos; Nuñez, Angel

2016-01-01

One of the most challenging problems we face in neuroscience is to understand how the cortex performs computations. There is increasing evidence that the power of the cortical processing is produced by populations of neurons forming dynamic neuronal ensembles. Theoretical proposals and multineuronal experimental studies have revealed that ensembles of neurons can form emergent functional units. However, how these ensembles are implicated in cortical computations is still a mystery. Although cell ensembles have been associated with brain rhythms, the functional interaction remains largely unclear. It is still unknown how spatially distributed neuronal activity can be temporally integrated to contribute to cortical computations. A theoretical explanation integrating spatial and temporal aspects of cortical processing is still lacking. In this Hypothesis and Theory article, we propose a new functional theoretical framework to explain the computational roles of these ensembles in cortical processing. We suggest that complex neural computations underlying cortical processing could be temporally discrete and that sensory information would need to be quantized to be computed by the cerebral cortex. Accordingly, we propose that cortical processing is produced by the computation of discrete spatio-temporal functional units that we have called “Discrete Results” (Discrete Results Hypothesis). This hypothesis represents a novel functional mechanism by which information processing is computed in the cortex. Furthermore, we propose that precise dynamic sequences of “Discrete Results” is the mechanism used by the cortex to extract, code, memorize and transmit neural information. The novel “Discrete Results” concept has the ability to match the spatial and temporal aspects of cortical processing. We discuss the possible neural underpinnings of these functional computational units and describe the empirical evidence supporting our hypothesis. We propose that fast-spiking (FS) interneuron may be a key element in our hypothesis providing the basis for this computation. PMID:27807408

Cortical Neural Computation by Discrete Results Hypothesis.

PubMed

Castejon, Carlos; Nuñez, Angel

2016-01-01

One of the most challenging problems we face in neuroscience is to understand how the cortex performs computations. There is increasing evidence that the power of the cortical processing is produced by populations of neurons forming dynamic neuronal ensembles. Theoretical proposals and multineuronal experimental studies have revealed that ensembles of neurons can form emergent functional units. However, how these ensembles are implicated in cortical computations is still a mystery. Although cell ensembles have been associated with brain rhythms, the functional interaction remains largely unclear. It is still unknown how spatially distributed neuronal activity can be temporally integrated to contribute to cortical computations. A theoretical explanation integrating spatial and temporal aspects of cortical processing is still lacking. In this Hypothesis and Theory article, we propose a new functional theoretical framework to explain the computational roles of these ensembles in cortical processing. We suggest that complex neural computations underlying cortical processing could be temporally discrete and that sensory information would need to be quantized to be computed by the cerebral cortex. Accordingly, we propose that cortical processing is produced by the computation of discrete spatio-temporal functional units that we have called "Discrete Results" (Discrete Results Hypothesis). This hypothesis represents a novel functional mechanism by which information processing is computed in the cortex. Furthermore, we propose that precise dynamic sequences of "Discrete Results" is the mechanism used by the cortex to extract, code, memorize and transmit neural information. The novel "Discrete Results" concept has the ability to match the spatial and temporal aspects of cortical processing. We discuss the possible neural underpinnings of these functional computational units and describe the empirical evidence supporting our hypothesis. We propose that fast-spiking (FS) interneuron may be a key element in our hypothesis providing the basis for this computation.

Prediction of Vehicle Mobility on Large-Scale Soft-Soil Terrain Maps Using Physics-Based Simulation

DTIC Science & Technology

2016-08-04

soil type. The modeling approach is based on (i) a seamless integration of multibody dynamics and discrete element method (DEM) solvers, and (ii...ensure that the vehicle follows a desired path. The soil is modeled as a Discrete Element Model (DEM) with a general cohesive material model that is

META 2f: Probabilistic, Compositional, Multi-dimension Model-Based Verification (PROMISE)

DTIC Science & Technology

2011-10-01

Equational Logic, Rewriting Logic, and Maude ................................................ 52  5.3  Results and Discussion...and its discrete transitions are left unchanged. However, the differential equations describing the continuous dynamics (in each mode) are replaced by...by replacing hard-to-analyze differential equations by discrete transitions. In principle, predicate and qualitative abstraction can be used on a

Development of a Rolling Dynamic Deflectometer for Continuous Deflection Testing of Pavements

DOT National Transportation Integrated Search

1998-05-01

A rolling dynamic deflectometer (RDD) was developed as a nondestructive method for determining continuous deflection profiles of pavements. Unlike other commonly used pavement testing methods, the RDD performs continuous rather than discrete measurem...

An extension of the OpenModelica compiler for using Modelica models in a discrete event simulation

DOE PAGES

Nutaro, James

2014-11-03

In this article, a new back-end and run-time system is described for the OpenModelica compiler. This new back-end transforms a Modelica model into a module for the adevs discrete event simulation package, thereby extending adevs to encompass complex, hybrid dynamical systems. The new run-time system that has been built within the adevs simulation package supports models with state-events and time-events and that comprise differential-algebraic systems with high index. Finally, although the procedure for effecting this transformation is based on adevs and the Discrete Event System Specification, it can be adapted to any discrete event simulation package.

Solutions of burnt-bridge models for molecular motor transport.

PubMed

Morozov, Alexander Yu; Pronina, Ekaterina; Kolomeisky, Anatoly B; Artyomov, Maxim N

2007-03-01

Transport of molecular motors, stimulated by interactions with specific links between consecutive binding sites (called "bridges"), is investigated theoretically by analyzing discrete-state stochastic "burnt-bridge" models. When an unbiased diffusing particle crosses the bridge, the link can be destroyed ("burned") with a probability p , creating a biased directed motion for the particle. It is shown that for probability of burning p=1 the system can be mapped into a one-dimensional single-particle hopping model along the periodic infinite lattice that allows one to calculate exactly all dynamic properties. For the general case of p<1 a theoretical method is developed and dynamic properties are computed explicitly. Discrete-time and continuous-time dynamics for periodic distribution of bridges and different burning dynamics are analyzed and compared. Analytical predictions are supported by extensive Monte Carlo computer simulations. Theoretical results are applied for analysis of the experiments on collagenase motor proteins.

Detecting dynamical changes in time series by using the Jensen Shannon divergence

NASA Astrophysics Data System (ADS)

Mateos, D. M.; Riveaud, L. E.; Lamberti, P. W.

2017-08-01

Most of the time series in nature are a mixture of signals with deterministic and random dynamics. Thus the distinction between these two characteristics becomes important. Distinguishing between chaotic and aleatory signals is difficult because they have a common wide band power spectrum, a delta like autocorrelation function, and share other features as well. In general, signals are presented as continuous records and require to be discretized for being analyzed. In this work, we introduce different schemes for discretizing and for detecting dynamical changes in time series. One of the main motivations is to detect transitions between the chaotic and random regime. The tools here used here originate from the Information Theory. The schemes proposed are applied to simulated and real life signals, showing in all cases a high proficiency for detecting changes in the dynamics of the associated time series.

Exact Solutions of Burnt-Bridge Models for Molecular Motor Transport

NASA Astrophysics Data System (ADS)

Morozov, Alexander; Pronina, Ekaterina; Kolomeisky, Anatoly; Artyomov, Maxim

2007-03-01

Transport of molecular motors, stimulated by interactions with specific links between consecutive binding sites (called ``bridges''), is investigated theoretically by analyzing discrete-state stochastic ``burnt-bridge'' models. When an unbiased diffusing particle crosses the bridge, the link can be destroyed (``burned'') with a probability p, creating a biased directed motion for the particle. It is shown that for probability of burning p=1 the system can be mapped into one-dimensional single-particle hopping model along the periodic infinite lattice that allows one to calculate exactly all dynamic properties. For general case of p<1 a new theoretical method is developed, and dynamic properties are computed explicitly. Discrete-time and continuous-time dynamics, periodic and random distribution of bridges and different burning dynamics are analyzed and compared. Theoretical predictions are supported by extensive Monte Carlo computer simulations. Theoretical results are applied for analysis of the experiments on collagenase motor proteins.

Solutions of burnt-bridge models for molecular motor transport

NASA Astrophysics Data System (ADS)

Morozov, Alexander Yu.; Pronina, Ekaterina; Kolomeisky, Anatoly B.; Artyomov, Maxim N.

2007-03-01

Transport of molecular motors, stimulated by interactions with specific links between consecutive binding sites (called “bridges”), is investigated theoretically by analyzing discrete-state stochastic “burnt-bridge” models. When an unbiased diffusing particle crosses the bridge, the link can be destroyed (“burned”) with a probability p , creating a biased directed motion for the particle. It is shown that for probability of burning p=1 the system can be mapped into a one-dimensional single-particle hopping model along the periodic infinite lattice that allows one to calculate exactly all dynamic properties. For the general case of p<1 a theoretical method is developed and dynamic properties are computed explicitly. Discrete-time and continuous-time dynamics for periodic distribution of bridges and different burning dynamics are analyzed and compared. Analytical predictions are supported by extensive Monte Carlo computer simulations. Theoretical results are applied for analysis of the experiments on collagenase motor proteins.

On the Discrete Spectrum of the Nonstationary Schrödinger Equation and Multipole Lumps of the Kadomtsev-Petviashvili I Equation

NASA Astrophysics Data System (ADS)

Villarroel, Javier; Ablowitz, Mark J.

The discrete spectrum of the nonstationary Schrödinger equation and localized solutions of the Kadomtsev-Petviashvili-I (KPI) equation are studied via the inverse scattering transform. It is shown that there exist infinitely many real and rationally decaying potentials which correspond to a discrete spectrum whose related eigenfunctions have multiple poles in the spectral parameter. An index or winding number is asssociated with each of these solutions. The resulting localized solutions of KPI behave as collection of individual humps with nonuniform dynamics.

An Empirical Development of Parallelization Guidelines for Time-Driven Simulation

DTIC Science & Technology

1989-12-01

wives, who though not Cub fans, put on a good show during our trip, to waich some games . I would also like to recognize the help of my professors at...program parallelization. in this research effort a Ballistic Missile Defense (BMD) time driven simulation program, developed by DESE Research and...continuously, or continuously with discrete changes superimposed. The distinguishing feature of these simulations is the interaction between discretely

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

PubMed

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

2018-07-01

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

Monitoring the welfare of polar bear populations in a rapidly changing Arctic

USGS Publications Warehouse

Atwood, Todd C.; Duncan, Colleen G.; Patyk, Kelly A.; Sonsthagen, Sarah A.

2017-01-01

Most programs for monitoring the welfare of wildlife populations support efforts aimed at reaching discrete management objectives, like mitigating conflict with humans. While such programs can be effective, their limited scope may preclude systemic evaluations needed for large-scale conservation initiatives, like the recovery of at-risk species. We discuss select categories of metrics that can be used to monitor how polar bears (Ursus maritimus) are responding to the primary threat to their long-term persistence—loss of sea ice habitat due to the unabated rise in atmospheric greenhouse gas (GHG; e.g., CO2) concentrations—that can also provide information on ecosystem function and health. Monitoring key aspects of polar bear population dynamics, spatial behavior, health and resiliency can provide valuable insight into ecosystem state and function, and could be a powerful tool for achieving Arctic conservation objectives, particularly those that have transnational policy implications.

Feed-forward transcriptional programming by nuclear receptors: regulatory principles and therapeutic implications.

PubMed

Sasse, Sarah K; Gerber, Anthony N

2015-01-01

Nuclear receptors (NRs) are widely targeted to treat a range of human diseases. Feed-forward loops are an ancient mechanism through which single cell organisms organize transcriptional programming and modulate gene expression dynamics, but they have not been systematically studied as a regulatory paradigm for NR-mediated transcriptional responses. Here, we provide an overview of the basic properties of feed-forward loops as predicted by mathematical models and validated experimentally in single cell organisms. We review existing evidence implicating feed-forward loops as important in controlling clinically relevant transcriptional responses to estrogens, progestins, and glucocorticoids, among other NR ligands. We propose that feed-forward transcriptional circuits are a major mechanism through which NRs integrate signals, exert temporal control over gene regulation, and compartmentalize client transcriptomes into discrete subunits. Implications for the design and function of novel selective NR ligands are discussed. Copyright © 2014 Elsevier Inc. All rights reserved.

20 CFR 627.903 - Actions which are at the discretion of the Governor.

Code of Federal Regulations, 2010 CFR

2010-04-01

... § 627.903 Actions which are at the discretion of the Governor. (a) Establish a State Human Resource... and management information systems to track the program experience of participants. PY 1993 and...

20 CFR 627.903 - Actions which are at the discretion of the Governor.

Code of Federal Regulations, 2011 CFR

2011-04-01

... § 627.903 Actions which are at the discretion of the Governor. (a) Establish a State Human Resource... and management information systems to track the program experience of participants. PY 1993 and...

Application of the Finite Element Method to Rotary Wing Aeroelasticity

NASA Technical Reports Server (NTRS)

Straub, F. K.; Friedmann, P. P.

1982-01-01

A finite element method for the spatial discretization of the dynamic equations of equilibrium governing rotary-wing aeroelastic problems is presented. Formulation of the finite element equations is based on weighted Galerkin residuals. This Galerkin finite element method reduces algebraic manipulative labor significantly, when compared to the application of the global Galerkin method in similar problems. The coupled flap-lag aeroelastic stability boundaries of hingeless helicopter rotor blades in hover are calculated. The linearized dynamic equations are reduced to the standard eigenvalue problem from which the aeroelastic stability boundaries are obtained. The convergence properties of the Galerkin finite element method are studied numerically by refining the discretization process. Results indicate that four or five elements suffice to capture the dynamics of the blade with the same accuracy as the global Galerkin method.

Efficiency optimization of a fast Poisson solver in beam dynamics simulation

NASA Astrophysics Data System (ADS)

Zheng, Dawei; Pöplau, Gisela; van Rienen, Ursula

2016-01-01

Calculating the solution of Poisson's equation relating to space charge force is still the major time consumption in beam dynamics simulations and calls for further improvement. In this paper, we summarize a classical fast Poisson solver in beam dynamics simulations: the integrated Green's function method. We introduce three optimization steps of the classical Poisson solver routine: using the reduced integrated Green's function instead of the integrated Green's function; using the discrete cosine transform instead of discrete Fourier transform for the Green's function; using a novel fast convolution routine instead of an explicitly zero-padded convolution. The new Poisson solver routine preserves the advantages of fast computation and high accuracy. This provides a fast routine for high performance calculation of the space charge effect in accelerators.

Planning Models for Tuberculosis Control Programs

PubMed Central

Chorba, Ronald W.; Sanders, J. L.

1971-01-01

A discrete-state, discrete-time simulation model of tuberculosis is presented, with submodels of preventive interventions. The model allows prediction of the prevalence of the disease over the simulation period. Preventive and control programs and their optimal budgets may be planned by using the model for cost-benefit analysis: costs are assigned to the program components and disease outcomes to determine the ratio of program expenditures to future savings on medical and socioeconomic costs of tuberculosis. Optimization is achieved by allocating funds in successive increments to alternative program components in simulation and identifying those components that lead to the greatest reduction in prevalence for the given level of expenditure. The method is applied to four hypothetical disease prevalence situations. PMID:4999448

Enhancement of the Logistics Battle Command Model: Architecture Upgrades and Attrition Module Development

DTIC Science & Technology

2017-01-05

module. 15. SUBJECT TERMS Logistics, attrition, discrete event simulation, Simkit, LBC 16. SECURITY CLASSIFICATION OF: Unclassified 17. LIMITATION...stochastics, and discrete event model programmed in Java building largely on the Simkit library. The primary purpose of the LBC model is to support...equations makes them incompatible with the discrete event construct of LBC. Bullard further advances this methodology by developing a stochastic

Discrete-state representation of ion permeation coupled to fast gating in a model of ClC chloride channels: comparison to multi-ion continuous space Brownian dynamics simulations.

PubMed

Coalson, Rob D; Cheng, Mary Hongying

2010-01-28

A discrete-state model of chloride ion motion in a ClC chloride channel is constructed, following a previously developed multi-ion continuous space model of the same system (Cheng, M. H.; Mamonov, A. B.; Dukes, J. W.; Coalson, R. D. J. Phys. Chem. B 2007, 111, 5956) that included a simplistic representation of the fast gate in this channel. The reducibility of the many-body continuous space to the eight discrete-state model considered in the present work is examined in detail by performing three-dimensional Brownian dynamics simulations of each allowed state-to-state transition in order to extract the appropriate rate constant for this process, and then inserting the pairwise rate constants thereby obtained into an appropriate set of kinetic master equations. Experimental properties of interest, including the rate of Cl(-) ion permeation through the open channel and the average rate of closing of the fast gate as a function of bulk Cl(-) ion concentrations in the intracellular and extracellular electrolyte reservoirs are computed. Good agreement is found between the results obtained via the eight discrete-state model versus the multi-ion continuous space model, thereby encouraging continued development of the discrete-state model to include more complex behaviors observed experimentally in these channels.

Hierarchic Extensions in the Static and Dynamic Analysis of Elastic Beams. Ph.D. Thesis, 1990 Final Report, May 1990

NASA Technical Reports Server (NTRS)

Watson, Robert A.

1991-01-01

Approximate solutions of static and dynamic beam problems by the p-version of the finite element method are investigated. Within a hierarchy of engineering beam idealizations, rigorous formulations of the strain and kinetic energies for straight and circular beam elements are presented. These formulations include rotating coordinate system effects and geometric nonlinearities to allow for the evaluation of vertical axis wind turbines, the motivating problem for this research. Hierarchic finite element spaces, based on extensions of the polynomial orders used to approximate the displacement variables, are constructed. The developed models are implemented into a general purpose computer program for evaluation. Quality control procedures are examined for a diverse set of sample problems. These procedures include estimating discretization errors in energy norm and natural frequencies, performing static and dynamic equilibrium checks, observing convergence for qualities of interest, and comparison with more exacting theories and experimental data. It is demonstrated that p-extensions produce exponential rates of convergence in the approximation of strain energy and natural frequencies for the class of problems investigated.

The Clemson University, University Research Initiative Program in Discrete Mathematics and Computational Analysis

DTIC Science & Technology

1990-03-01

Assmus, E. F., and J. D. Key, "Affine and projective planes", to appear in Discrete Math (Special Coding Theory Issue). 5. Assumus, E. F. and J. D...S. Locke, ’The subchromatic number of a graph", Discrete Math . 74 (1989)33-49. 24. Hedetniemi, S. T., and T. V. Wimer, "K-terminal recursive families...34Designs and geometries with Cayley", submitted to Journal of Symbolic Computation. 34. Key, J. D., "Regular sets in geometries", Annals of Discrete Math . 37

Modeling social dimensions of oral health among older adults in urban environments.

PubMed

Metcalf, Sara S; Northridge, Mary E; Widener, Michael J; Chakraborty, Bibhas; Marshall, Stephen E; Lamster, Ira B

2013-10-01

In both developed and developing countries, population aging has attained unprecedented levels. Public health strategies to deliver services in community-based settings are key to enhancing the utilization of preventive care and reducing costs for this segment of the population. Motivated by concerns of inadequate access to oral health care by older adults in urban environments, this article presents a portfolio of systems science models that have been developed on the basis of observations from the ElderSmile preventive screening program operated in northern Manhattan, New York City, by the Columbia University College of Dental Medicine. Using the methodology of system dynamics, models are developed to explore how interpersonal relationships influence older adults' participation in oral health promotion. Feedback mechanisms involving word of mouth about preventive screening opportunities are represented in relation to stocks that change continuously via flows, as well as agents whose states of health care utilization change discretely using stochastic transitions. Agent-based implementations illustrate how social networks and geographic information systems are integrated into dynamic models to reflect heterogeneous and proximity-based patterns of communication and participation in the ElderSmile program. The systems science approach builds shared knowledge among an interdisciplinary research team about the dynamics of access to opportunities for oral health promotion. Using "what if" scenarios to model the effects of program enhancements and policy changes, resources may be effectively leveraged to improve access to preventive and treatment services. Furthermore, since oral health and general health are inextricably linked, the integration of services may improve outcomes and lower costs.

Modeling Social Dimensions of Oral Health Among Older Adults in Urban Environments

PubMed Central

Metcalf, Sara S.; Northridge, Mary E.; Widener, Michael J.; Chakraborty, Bibhas; Marshall, Stephen E.; Lamster, Ira B.

2014-01-01

In both developed and developing countries, population aging has attained unprecedented levels. Public health strategies to deliver services in community-based settings are key to enhancing the utilization of preventive care and reducing costs for this segment of the population. Motivated by concerns of inadequate access to oral health care by older adults in urban environments, this article presents a portfolio of systems science models that have been developed on the basis of observations from the ElderSmile preventive screening program operated in northern Manhattan, New York City, by the Columbia University College of Dental Medicine. Using the methodology of system dynamics, models are developed to explore how interpersonal relationships influence older adults’ participation in oral health promotion. Feedback mechanisms involving word of mouth about preventive screening opportunities are represented in relation to stocks that change continuously via flows, as well as agents whose states of health care utilization change discretely using stochastic transitions. Agent-based implementations illustrate how social networks and geographic information systems are integrated into dynamic models to reflect heterogeneous and proximity-based patterns of communication and participation in the ElderSmile program. The systems science approach builds shared knowledge among an interdisciplinary research team about the dynamics of access to opportunities for oral health promotion. Using “what if” scenarios to model the effects of program enhancements and policy changes, resources may be effectively leveraged to improve access to preventive and treatment services. Furthermore, since oral health and general health are inextricably linked, the integration of services may improve outcomes and lower costs. PMID:24084402

Elucidating Molecular Motion through Structural and Dynamic Filters of Energy-Minimized Conformer Ensembles

PubMed Central

2015-01-01

Complex RNA structures are constructed from helical segments connected by flexible loops that move spontaneously and in response to binding of small molecule ligands and proteins. Understanding the conformational variability of RNA requires the characterization of the coupled time evolution of interconnected flexible domains. To elucidate the collective molecular motions and explore the conformational landscape of the HIV-1 TAR RNA, we describe a new methodology that utilizes energy-minimized structures generated by the program “Fragment Assembly of RNA with Full-Atom Refinement (FARFAR)”. We apply structural filters in the form of experimental residual dipolar couplings (RDCs) to select a subset of discrete energy-minimized conformers and carry out principal component analyses (PCA) to corroborate the choice of the filtered subset. We use this subset of structures to calculate solution T1 and T1ρ relaxation times for 13C spins in multiple residues in different domains of the molecule using two simulation protocols that we previously published. We match the experimental T1 times to within 2% and the T1ρ times to within less than 10% for helical residues. These results introduce a protocol to construct viable dynamic trajectories for RNA molecules that accord well with experimental NMR data and support the notion that the motions of the helical portions of this small RNA can be described by a relatively small number of discrete conformations exchanging over time scales longer than 1 μs. PMID:24479561

Numerical discretization-based estimation methods for ordinary differential equation models via penalized spline smoothing with applications in biomedical research.

PubMed

Wu, Hulin; Xue, Hongqi; Kumar, Arun

2012-06-01

Differential equations are extensively used for modeling dynamics of physical processes in many scientific fields such as engineering, physics, and biomedical sciences. Parameter estimation of differential equation models is a challenging problem because of high computational cost and high-dimensional parameter space. In this article, we propose a novel class of methods for estimating parameters in ordinary differential equation (ODE) models, which is motivated by HIV dynamics modeling. The new methods exploit the form of numerical discretization algorithms for an ODE solver to formulate estimating equations. First, a penalized-spline approach is employed to estimate the state variables and the estimated state variables are then plugged in a discretization formula of an ODE solver to obtain the ODE parameter estimates via a regression approach. We consider three different order of discretization methods, Euler's method, trapezoidal rule, and Runge-Kutta method. A higher-order numerical algorithm reduces numerical error in the approximation of the derivative, which produces a more accurate estimate, but its computational cost is higher. To balance the computational cost and estimation accuracy, we demonstrate, via simulation studies, that the trapezoidal discretization-based estimate is the best and is recommended for practical use. The asymptotic properties for the proposed numerical discretization-based estimators are established. Comparisons between the proposed methods and existing methods show a clear benefit of the proposed methods in regards to the trade-off between computational cost and estimation accuracy. We apply the proposed methods t an HIV study to further illustrate the usefulness of the proposed approaches. © 2012, The International Biometric Society.

Discrete-time infinity control problem with measurement feedback

NASA Technical Reports Server (NTRS)

Stoorvogel, A. A.; Saberi, A.; Chen, B. M.

1992-01-01

The paper is concerned with the discrete-time H(sub infinity) control problem with measurement feedback. The authors extend previous results by having weaker assumptions on the system parameters. The authors also show explicitly the structure of H(sub infinity) controllers. Finally, they show that it is in certain cases possible, without loss of performance, to reduce the dynamical order of the controllers.

Modeling the spatially dynamic distribution of humans in the Oregon (USA) coast range.

Treesearch

Jeffrey D. Kline; David L. Azuma; Alissa Moses

2003-01-01

A common approach to land use change analyses in multidisciplinary landscape-level studies is to delineate discrete forest and non-forest or urban and non-urban land use categories to serve as inputs into sets of integrated sub-models describing socioeconomic and ecological processes. Such discrete land use categories, however, may be inappropriate when the...

The application of the analog signal to discrete time interval converter to the signal conditioner power supplies

NASA Technical Reports Server (NTRS)

Schoenfeld, A. D.; Yu, Y.

1973-01-01

The Analog Signal to Discrete Time Interval Converter microminiaturized module was utilized to control the signal conditioner power supplies. The multi-loop control provides outstanding static and dynamic performance characteristics, exceeding those generally associated with single-loop regulators. Eight converter boards, each containing three independent dc to dc converter, were built, tested, and delivered.

Completing the land resource hierarchy

USDA-ARS?s Scientific Manuscript database

The Land Resource Hierarchy of the NRCS is a hierarchal landscape classification consisting of resource areas which represent both conceptual and spatially discrete landscape units stratifying agency programs and practices. The Land Resource Hierarchy (LRH) scales from discrete points (soil pedon an...

On the dynamic rounding-off in analogue and RF optimal circuit sizing

NASA Astrophysics Data System (ADS)

Kotti, Mouna; Fakhfakh, Mourad; Fino, Maria Helena

2014-04-01

Frequently used approaches to solve discrete multivariable optimisation problems consist of computing solutions using a continuous optimisation technique. Then, using heuristics, the variables are rounded-off to their nearest available discrete values to obtain a discrete solution. Indeed, in many engineering problems, and particularly in analogue circuit design, component values, such as the geometric dimensions of the transistors, the number of fingers in an integrated capacitor or the number of turns in an integrated inductor, cannot be chosen arbitrarily since they have to obey to some technology sizing constraints. However, rounding-off the variables values a posteriori and can lead to infeasible solutions (solutions that are located too close to the feasible solution frontier) or degradation of the obtained results (expulsion from the neighbourhood of a 'sharp' optimum) depending on how the added perturbation affects the solution. Discrete optimisation techniques, such as the dynamic rounding-off technique (DRO) are, therefore, needed to overcome the previously mentioned situation. In this paper, we deal with an improvement of the DRO technique. We propose a particle swarm optimisation (PSO)-based DRO technique, and we show, via some analog and RF-examples, the necessity to implement such a routine into continuous optimisation algorithms.

Unstructured Adaptive Meshes: Bad for Your Memory?

NASA Technical Reports Server (NTRS)

Biswas, Rupak; Feng, Hui-Yu; VanderWijngaart, Rob

2003-01-01

This viewgraph presentation explores the need for a NASA Advanced Supercomputing (NAS) parallel benchmark for problems with irregular dynamical memory access. This benchmark is important and necessary because: 1) Problems with localized error source benefit from adaptive nonuniform meshes; 2) Certain machines perform poorly on such problems; 3) Parallel implementation may provide further performance improvement but is difficult. Some examples of problems which use irregular dynamical memory access include: 1) Heat transfer problem; 2) Heat source term; 3) Spectral element method; 4) Base functions; 5) Elemental discrete equations; 6) Global discrete equations. Nonconforming Mesh and Mortar Element Method are covered in greater detail in this presentation.

Dynamic discrete tomography

NASA Astrophysics Data System (ADS)

Alpers, Andreas; Gritzmann, Peter

2018-03-01

We consider the problem of reconstructing the paths of a set of points over time, where, at each of a finite set of moments in time the current positions of points in space are only accessible through some small number of their x-rays. This particular particle tracking problem, with applications, e.g. in plasma physics, is the basic problem in dynamic discrete tomography. We introduce and analyze various different algorithmic models. In particular, we determine the computational complexity of the problem (and various of its relatives) and derive algorithms that can be used in practice. As a byproduct we provide new results on constrained variants of min-cost flow and matching problems.

Convergence Time towards Periodic Orbits in Discrete Dynamical Systems

PubMed Central

San Martín, Jesús; Porter, Mason A.

2014-01-01

We investigate the convergence towards periodic orbits in discrete dynamical systems. We examine the probability that a randomly chosen point converges to a particular neighborhood of a periodic orbit in a fixed number of iterations, and we use linearized equations to examine the evolution near that neighborhood. The underlying idea is that points of stable periodic orbit are associated with intervals. We state and prove a theorem that details what regions of phase space are mapped into these intervals (once they are known) and how many iterations are required to get there. We also construct algorithms that allow our theoretical results to be implemented successfully in practice. PMID:24736594

Analysis of passive damping in thick composite structures

NASA Technical Reports Server (NTRS)

Saravanos, D. A.

1993-01-01

Computational mechanics for the prediction of damping and other dynamic characteristics in composite structures of general thicknesses and laminations are presented. Discrete layer damping mechanics that account for the representation of interlaminar shear effects in the material are summarized. Finite element based structural mechanics for the analysis of damping are described, and a specialty finite element is developed. Applications illustrate the quality of the discrete layer damping mechanics in predicting the damped dynamic characteristics of composite structures with thicker sections and/or laminate configurations that induce interlaminar shear. The results also illustrate and quantify the significance of interlaminar shear damping in such composite structures.

Effects of automobile steering characteristics on driver/vehicle system performance in discrete maneuvers

NASA Technical Reports Server (NTRS)

Klein, R. H.; Mcruer, D. T.

1975-01-01

A series of discrete maneuver tasks were used to evaluate the effects of steering gain and directional mode dynamic parameters on driver/vehicle responses. The importance and ranking of these parameters were evaluated through changes in subjective driver ratings and performance measures obtained from transient maneuvers such as a double lane change, an emergency lane change, and an unexpected obstacle. The unexpected obstacle maneuver proved more sensitive to individual driver differences than to vehicle differences. Results were based on full scale tests with an experienced test driver evaluating many different dynamic configurations plus seventeen ordinary drivers evaluating six key configurations.

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

NASA Astrophysics Data System (ADS)

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

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

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

NASA Technical Reports Server (NTRS)

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.

Inhomogeneous point-process entropy: An instantaneous measure of complexity in discrete systems

NASA Astrophysics Data System (ADS)

Valenza, Gaetano; Citi, Luca; Scilingo, Enzo Pasquale; Barbieri, Riccardo

2014-05-01

Measures of entropy have been widely used to characterize complexity, particularly in physiological dynamical systems modeled in discrete time. Current approaches associate these measures to finite single values within an observation window, thus not being able to characterize the system evolution at each moment in time. Here, we propose a new definition of approximate and sample entropy based on the inhomogeneous point-process theory. The discrete time series is modeled through probability density functions, which characterize and predict the time until the next event occurs as a function of the past history. Laguerre expansions of the Wiener-Volterra autoregressive terms account for the long-term nonlinear information. As the proposed measures of entropy are instantaneously defined through probability functions, the novel indices are able to provide instantaneous tracking of the system complexity. The new measures are tested on synthetic data, as well as on real data gathered from heartbeat dynamics of healthy subjects and patients with cardiac heart failure and gait recordings from short walks of young and elderly subjects. Results show that instantaneous complexity is able to effectively track the system dynamics and is not affected by statistical noise properties.

Observation of discrete time-crystalline order in a disordered dipolar many-body system

NASA Astrophysics Data System (ADS)

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

2017-03-01

Understanding quantum dynamics away from equilibrium is an outstanding challenge in the modern physical sciences. Out-of-equilibrium systems can display a rich variety of phenomena, including self-organized synchronization and dynamical phase transitions. More recently, advances in the controlled manipulation of isolated many-body systems have enabled detailed studies of non-equilibrium phases in strongly interacting quantum matter; for example, the interplay between periodic driving, disorder and strong interactions has been predicted to result in exotic ‘time-crystalline’ phases, in which a system exhibits temporal correlations at integer multiples of the fundamental driving period, breaking the discrete time-translational symmetry of the underlying drive. Here we report the experimental observation of such discrete time-crystalline order in a driven, disordered ensemble of about one million dipolar spin impurities in diamond at room temperature. We observe long-lived temporal correlations, experimentally identify the phase boundary and find that the temporal order is protected by strong interactions. This order is remarkably stable to perturbations, even in the presence of slow thermalization. Our work opens the door to exploring dynamical phases of matter and controlling interacting, disordered many-body systems.

Age or stage structure? A comparison of dynamic outcomes from discrete age- and stage-structured population models.

PubMed

Wikan, Arild

2012-06-01

Discrete stage-structured density-dependent and discrete age-structured density-dependent population models are considered. Regarding the former, we prove that the model at hand is permanent (i.e., that the population will neither go extinct nor exhibit explosive oscillations) and given density dependent fecundity terms we also show that species with delayed semelparous life histories tend to be more stable than species which possess precocious semelparous life histories. Moreover, our findings together with results obtained from other stage-structured models seem to illustrate a fairly general ecological principle, namely that iteroparous species are more stable than semelparous species. Our analysis of various age-structured models does not necessarily support the conclusions above. In fact, species with precocious life histories now appear to possess better stability properties than species with delayed life histories, especially in the iteroparous case. We also show that there are dynamical outcomes from semelparous age-structured models which we are not able to capture in corresponding stage-structured cases. Finally, both age- and stage-structured population models may generate periodic dynamics of low period (either exact or approximate). The important prerequisite is to assume density-dependent survival probabilities.

A symplectic integration method for elastic filaments

NASA Astrophysics Data System (ADS)

Ladd, Tony; Misra, Gaurav

2009-03-01

Elastic rods are a ubiquitous coarse-grained model of semi-flexible biopolymers such as DNA, actin, and microtubules. The Worm-Like Chain (WLC) is the standard numerical model for semi-flexible polymers, but it is only a linearized approximation to the dynamics of an elastic rod, valid for small deflections; typically the torsional motion is neglected as well. In the standard finite-difference and finite-element formulations of an elastic rod, the continuum equations of motion are discretized in space and time, but it is then difficult to ensure that the Hamiltonian structure of the exact equations is preserved. Here we discretize the Hamiltonian itself, expressed as a line integral over the contour of the filament. This discrete representation of the continuum filament can then be integrated by one of the explicit symplectic integrators frequently used in molecular dynamics. The model systematically approximates the continuum partial differential equations, but has the same level of computational complexity as molecular dynamics and is constraint free. Numerical tests show that the algorithm is much more stable than a finite-difference formulation and can be used for high aspect ratio filaments, such as actin. We present numerical results for the deterministic and stochastic motion of single filaments.

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

NASA Astrophysics Data System (ADS)

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

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

Nonlinear Socio-Ecological Dynamics and First Principles ofCollective Choice Behavior of ``Homo Socialis"

NASA Astrophysics Data System (ADS)

Sonis, M.

Socio-ecological dynamics emerged from the field of Mathematical SocialSciences and opened up avenues for re-examination of classical problems of collective behavior in Social and Spatial sciences. The ``engine" of this collective behavior is the subjective mental evaluation of level of utilities in the future, presenting sets of composite socio-economic-temporal-locational advantages. These dynamics present new laws of collective multi-population behavior which are the meso-level counterparts of the utility optimization individual behavior. The central core of the socio-ecological choice dynamics includes the following first principle of the collective choice behavior of ``Homo Socialis" based on the existence of ``collective consciousness": the choice behavior of ``Homo Socialis" is a collective meso-level choice behavior such that the relative changes in choice frequencies depend on the distribution of innovation alternatives between adopters of innovations. The mathematical basis of the Socio-Ecological Dynamics includes two complementary analytical approaches both based on the use of computer modeling as a theoretical and simulation tool. First approach is the ``continuous approach" --- the systems of ordinary and partial differential equations reflecting the continuous time Volterra ecological formalism in a form of antagonistic and/or cooperative collective hyper-games between different sub-sets of choice alternatives. Second approach is the ``discrete approach" --- systems of difference equations presenting a new branch of the non-linear discrete dynamics --- the Discrete Relative m-population/n-innovations Socio-Spatial Dynamics (Dendrinos and Sonis, 1990). The generalization of the Volterra formalism leads further to the meso-level variational principle of collective choice behavior determining the balance between the resulting cumulative social spatio-temporal interactions among the population of adopters susceptible to the choice alternatives and the cumulative equalization of the power of elites supporting different choice alternatives. This balance governs the dynamic innovation choice process and constitutes the dynamic meso-level counterpart of the micro-economic individual utility maximization principle.

Parametric instability of spinning elastic rings excited by fluctuating space-fixed stiffnesses

NASA Astrophysics Data System (ADS)

Liu, Chunguang; Cooley, Christopher G.; Parker, Robert G.

2017-07-01

This study investigates the vibration of rotating elastic rings that are dynamically excited by an arbitrary number of space-fixed discrete stiffnesses with periodically fluctuating stiffnesses. The rotating, elastic ring is modeled using thin-ring theory with radial and tangential deformations. Primary and combination instability regions are determined in closed-form using the method of multiple scales. The ratio of peak-to-peak fluctuation to average discrete stiffness is used as the perturbation parameter, so the resulting perturbation analysis is not limited to small mean values of discrete stiffnesses. The natural frequencies and vibration modes are determined by discretizing the governing equations using Galerkin's method. Results are demonstrated for compliant gear applications. The perturbation results are validated by direct numerical integration of the equations of motion and Floquet theory. The bandwidths of the instability regions correlate with the fractional strain energy stored in the discrete stiffnesses. For rings with multiple discrete stiffnesses, the phase differences between them can eliminate large amplitude response under certain conditions.

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

PubMed

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 dataset that comes along with the included Butterfly R package. In the included R script, a univariate feature selection method is used for the dimension reduction step, but in the future we wish to use a more powerful multivariate feature reduction method based on neural networks (Kriesel, 2007). A script written in R (designed to run on R studio) accompanies this article that implements this algorithm and is available at http://butterflygeraci.codeplex.com/. For details on the R package or for help installing the software refer to the accompanying document, Supporting Material and Appendix.

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

PubMed

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.

Robust Control Algorithm for a Two Cart System and an Inverted Pendulum

NASA Technical Reports Server (NTRS)

Wilson, Chris L.; Capo-Lugo, Pedro

2011-01-01

The Rectilinear Control System can be used to simulate a launch vehicle during liftoff. Several control schemes have been developed that can control different dynamic models of the rectilinear plant. A robust control algorithm was developed that can control a pendulum to maintain an inverted position. A fluid slosh tank will be attached to the pendulum in order to test robustness in the presence of unknown slosh characteristics. The rectilinear plant consists of a DC motor and three carts mounted in series. Each cart s weight can be adjusted with brass masses and the carts can be coupled with springs. The pendulum is mounted on the first cart and an adjustable air damper can be attached to the third cart if desired. Each cart and the pendulum have a quadrature encoder to determine position. Full state feedback was implemented in order to develop the control algorithm along with a state estimator to determine the velocity states of the system. A MATLAB program was used to convert the state space matrices from continuous time to discrete time. This program also used a desired phase margin and damping ratio to determine the feedback gain matrix that would be used in the LabVIEW program. This experiment will allow engineers to gain a better understanding of liquid propellant slosh dynamics, therefore enabling them to develop more robust control algorithms for launch vehicle systems

A discrete control model of PLANT

NASA Technical Reports Server (NTRS)

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.

Fronts in extended systems of bistable maps coupled via convolutions

NASA Astrophysics Data System (ADS)

Coutinho, Ricardo; Fernandez, Bastien

2004-01-01

An analysis of front dynamics in discrete time and spatially extended systems with general bistable nonlinearity is presented. The spatial coupling is given by the convolution with distribution functions. It allows us to treat in a unified way discrete, continuous or partly discrete and partly continuous diffusive interactions. We prove the existence of fronts and the uniqueness of their velocity. We also prove that the front velocity depends continuously on the parameters of the system. Finally, we show that every initial configuration that is an interface between the stable phases propagates asymptotically with the front velocity.

Qualitative analysis of a discrete thermostatted kinetic framework modeling complex adaptive systems

NASA Astrophysics Data System (ADS)

Bianca, Carlo; Mogno, Caterina

2018-01-01

This paper deals with the derivation of a new discrete thermostatted kinetic framework for the modeling of complex adaptive systems subjected to external force fields (nonequilibrium system). Specifically, in order to model nonequilibrium stationary states of the system, the external force field is coupled to a dissipative term (thermostat). The well-posedness of the related Cauchy problem is investigated thus allowing the new discrete thermostatted framework to be suitable for the derivation of specific models and the related computational analysis. Applications to crowd dynamics and future research directions are also discussed within the paper.

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

NASA Technical Reports Server (NTRS)

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.

Dynamic Models of Insurgent Activity

DTIC Science & Technology

2014-05-19

Martin Short, P. Jeffrey Brantingham, Frederick Schoenberg, George Tita . Self-Exciting Point Process Modeling of Crime, Journal of the American...Mohler, P. J. Brantingham, G. E. Tita . Gang rivalry dynamics via coupled point process networks, Discrete and Continuous Dynamical Systems - Series...8532-2-1 Laura Smith, Andrea Bertozzi, P. Jeffrey Brantingham, George Tita , Matthew Valasik. ADAPTATION OF AN ECOLOGICAL TERRITORIAL MODEL TOSTREET

A large-signal dynamic simulation for the series resonant converter

NASA Technical Reports Server (NTRS)

King, R. J.; Stuart, T. A.

1983-01-01

A simple nonlinear discrete-time dynamic model for the series resonant dc-dc converter is derived using approximations appropriate to most power converters. This model is useful for the dynamic simulation of a series resonant converter using only a desktop calculator. The model is compared with a laboratory converter for a large transient event.

Using Innovative Outliers to Detect Discrete Shifts in Dynamics in Group-Based State-Space Models

ERIC Educational Resources Information Center

Chow, Sy-Miin; Hamaker, Ellen L.; Allaire, Jason C.

2009-01-01

Outliers are typically regarded as data anomalies that should be discarded. However, dynamic or "innovative" outliers can be appropriately utilized to capture unusual but substantively meaningful shifts in a system's dynamics. We extend De Jong and Penzer's 1998 approach for representing outliers in single-subject state-space models to a…

UCAV path planning in the presence of radar-guided surface-to-air missile threats

NASA Astrophysics Data System (ADS)

Zeitz, Frederick H., III

This dissertation addresses the problem of path planning for unmanned combat aerial vehicles (UCAVs) in the presence of radar-guided surface-to-air missiles (SAMs). The radars, collocated with SAM launch sites, operate within the structure of an Integrated Air Defense System (IADS) that permits communication and cooperation between individual radars. The problem is formulated in the framework of the interaction between three sub-systems: the aircraft, the IADS, and the missile. The main features of this integrated model are: The aircraft radar cross section (RCS) depends explicitly on both the aspect and bank angles; hence, the RCS and aircraft dynamics are coupled. The probabilistic nature of IADS tracking is accounted for; namely, the probability that the aircraft has been continuously tracked by the IADS depends on the aircraft RCS and range from the perspective of each radar within the IADS. Finally, the requirement to maintain tracking prior to missile launch and during missile flyout are also modeled. Based on this model, the problem of UCAV path planning is formulated as a minimax optimal control problem, with the aircraft bank angle serving as control. Necessary conditions of optimality for this minimax problem are derived. Based on these necessary conditions, properties of the optimal paths are derived. These properties are used to discretize the dynamic optimization problem into a finite-dimensional, nonlinear programming problem that can be solved numerically. Properties of the optimal paths are also used to initialize the numerical procedure. A homotopy method is proposed to solve the finite-dimensional, nonlinear programming problem, and a heuristic method is proposed to improve the discretization during the homotopy process. Based upon the properties of numerical solutions, a method is proposed for parameterizing and storing information for later recall in flight to permit rapid replanning in response to changing threats. Illustrative examples are presented that confirm the standard flying tactics of "denying range, aspect, and aim," by yielding flight paths that "weave" to avoid long exposures of aspects with large RCS.

Adaptive Observatories for Observing Moving Marine Organisms (Invited)

NASA Astrophysics Data System (ADS)

Bellingham, J. G.; Scholin, C.; Zhang, Y.; Godin, M. A.; Hobson, B.; Frolov, S.

2010-12-01

The ability to characterize the response of small marine organisms to each other, and to their environment, is a demanding observational challenge. Small organisms live in a water reference frame, while existing cable or mooring-based observatories operate in an Earth reference frame. Thus repeated observations from a fixed system observe different populations as currents sweep organisms by the sensors. In contrast, mobile systems are typically optimized for spatial coverage rather than repeated observations of the same water volume. Lagrangian drifters track water mass, but are unable to find or reposition themselves relative to ocean features. We are developing a system capable of finding, following and observing discrete populations of marine organisms over time, leveraging a decade and a half investment in the Autonomous Ocean Sampling Network (AOSN) program. AOSN undertook the development of platforms to enable multi-platform coordinated measurement of ocean properties in the late 1990s, leading to the development of a variety of autonomous underwater vehicles (AUVs) and associated technologies, notably several glider systems, now in common use. Efforts by a number of research groups have focused on methods to employ these networked systems to observe and predict dynamic physical ocean phenomena. For example, periodic large scale field programs in Monterey Bay have progressively integrated these systems with data systems, predictive models, and web-based collaborative portals. We are adapting these approaches to follow and observe the dynamics of marine organisms. Compared to physical processes, the temporal and spatial variability of small marine organisms, particularly micro-organisms, is typical greater. Consequently, while multi-platform observations of physical processes can be coordinated via intermittent communications links from shore, biological observations require a higher degree of adaptability of the observation system in situ. This talk will describe the platform capabilities developed for such observations, the onboard intelligence for finding and observing discrete populations, and the cyberinfrastructure employed to understand and coordinate observations from shore.

Discrete model of the olivo-cerebellar system: structure and dynamics

NASA Astrophysics Data System (ADS)

Maslennikov, O. V.; Nekorkin, V. I.

2012-08-01

We propose a discrete model of the olivo-cerebellar system. The model consists of three layers of interacting elements, namely, inferior olive neurons, Purkinje cells, and deep cerebellar nuclear neurons combined into a structure by axonal connections. Each element of the structure is described by a two-dimensional map with an individual set of parameters for each type of neurons. Dynamic properties of different types of neurons are described and spontaneous and stimulusinduced dynamics of the system is explored. Unlike the previously proposed models, this study takes into account the axonal interaction of neurons of different layers, as well as the interaction of the inferior olive neurons through electrical synapses with the property of plasticity. It is shown that the inclusion of these factors plays a significant role in the formation of spatio-temporal activity of the inferior olive neurons.

Three-dimensional unsteady Euler equations solutions on dynamic grids

NASA Technical Reports Server (NTRS)

Belk, D. M.; Janus, J. M.; Whitfield, D. L.

1985-01-01

A method is presented for solving the three-dimensional unsteady Euler equations on dynamic grids based on flux vector splitting. The equations are cast in curvilinear coordinates and a finite volume discretization is used for handling arbitrary geometries. The discretized equations are solved using an explicit upwind second-order predictor corrector scheme that is stable for a CFL of 2. Characteristic variable boundary conditions are developed and used for unsteady impermeable surfaces and for the far-field boundary. Dynamic-grid results are presented for an oscillating air-foil and for a store separating from a reflection plate. For the cases considered of stores separating from a reflection plate, the unsteady aerodynamic forces on the store are significantly different from forces obtained by steady-state aerodynamics with the body inclination angle changed to account for plunge velocity.

Improved numerical methods for turbulent viscous flows aerothermal modeling program, phase 2

NASA Technical Reports Server (NTRS)

Karki, K. C.; Patankar, S. V.; Runchal, A. K.; Mongia, H. C.

1988-01-01

The details of a study to develop accurate and efficient numerical schemes to predict complex flows are described. In this program, several discretization schemes were evaluated using simple test cases. This assessment led to the selection of three schemes for an in-depth evaluation based on two-dimensional flows. The scheme with the superior overall performance was incorporated in a computer program for three-dimensional flows. To improve the computational efficiency, the selected discretization scheme was combined with a direct solution approach in which the fluid flow equations are solved simultaneously rather than sequentially.

Evaluation of the discrete vortex wake cross flow model using vector computers. Part 1: Theory and application

NASA Technical Reports Server (NTRS)

1979-01-01

The current program had the objective to modify a discrete vortex wake method to efficiently compute the aerodynamic forces and moments on high fineness ratio bodies (f approximately 10.0). The approach is to increase computational efficiency by structuring the program to take advantage of new computer vector software and by developing new algorithms when vector software can not efficiently be used. An efficient program was written and substantial savings achieved. Several test cases were run for fineness ratios up to f = 16.0 and angles of attack up to 50 degrees.

The Micromechanics of the Moving Contact Line

NASA Technical Reports Server (NTRS)

Han, Minsub; Lichter, Seth; Lin, Chih-Yu; Perng, Yeong-Yan

1996-01-01

The proposed research is divided into three components concerned with molecular structure, molecular orientation, and continuum averages of discrete systems. In the experimental program, we propose exploring how changes in interfacial molecular structure generate contact line motion. Rather than rely on the electrostatic and electrokinetic fields arising from the molecules themselves, we augment their interactions by an imposed field at the solid/liquid interface. By controling the field, we can manipulate the molecular structure at the solid/liquid interface. In response to controlled changes in molecular structure, we observe the resultant contact line motion. In the analytical portion of the proposed research we seek to formulate a system of equations governing fluid motion which accounts for the orientation of fluid molecules. In preliminary work, we have focused on describing how molecular orientation affects the forces generated at the moving contact line. Ideally, as assumed above, the discrete behavior of molecules can be averaged into a continuum theory. In the numerical portion of the proposed research, we inquire whether the contact line region is, in fact, large enough to possess a well-defined average. Additionally, we ask what types of behavior distinguish discrete systems from continuum systems. Might the smallness of the contact line region, in itself, lead to behavior different from that in the bulk? Taken together, our proposed research seeks to identify and accurately account for some of the molecular dynamics of the moving contact line, and attempts to formulate a description from which one can compute the forces at the moving contact line.

Cross-Paradigm Simulation Modeling: Challenges and Successes

DTIC Science & Technology

2011-12-01

is also highlighted. 2.1 Discrete-Event Simulation Discrete-event simulation ( DES ) is a modeling method for stochastic, dynamic models where...which almost anything can be coded; models can be incredibly detailed. Most commercial DES software has a graphical interface which allows the user to...results. Although the above definition is the commonly accepted definition of DES , there are two different worldviews that dominate DES modeling today: a

Stochastic Adaptive Estimation and Control.

DTIC Science & Technology

1994-10-26

Marcus, "Language Stability and Stabilizability of Discrete Event Dynamical Systems ," SIAM Journal on Control and Optimization, 31, September 1993...in the hierarchical control of flexible manufacturing systems ; in this problem, the model involves a hybrid process in continuous time whose state is...of the average cost control problem for discrete- time Markov processes. Our exposition covers from finite to Borel state and action spaces and

Modeling and control of operator functional state in a unified framework of fuzzy inference petri nets.

PubMed

Zhang, Jian-Hua; Xia, Jia-Jun; Garibaldi, Jonathan M; Groumpos, Petros P; Wang, Ru-Bin

2017-06-01

In human-machine (HM) hybrid control systems, human operator and machine cooperate to achieve the control objectives. To enhance the overall HM system performance, the discrete manual control task-load by the operator must be dynamically allocated in accordance with continuous-time fluctuation of psychophysiological functional status of the operator, so-called operator functional state (OFS). The behavior of the HM system is hybrid in nature due to the co-existence of discrete task-load (control) variable and continuous operator performance (system output) variable. Petri net is an effective tool for modeling discrete event systems, but for hybrid system involving discrete dynamics, generally Petri net model has to be extended. Instead of using different tools to represent continuous and discrete components of a hybrid system, this paper proposed a method of fuzzy inference Petri nets (FIPN) to represent the HM hybrid system comprising a Mamdani-type fuzzy model of OFS and a logical switching controller in a unified framework, in which the task-load level is dynamically reallocated between the operator and machine based on the model-predicted OFS. Furthermore, this paper used a multi-model approach to predict the operator performance based on three electroencephalographic (EEG) input variables (features) via the Wang-Mendel (WM) fuzzy modeling method. The membership function parameters of fuzzy OFS model for each experimental participant were optimized using artificial bee colony (ABC) evolutionary algorithm. Three performance indices, RMSE, MRE, and EPR, were computed to evaluate the overall modeling accuracy. Experiment data from six participants are analyzed. The results show that the proposed method (FIPN with adaptive task allocation) yields lower breakdown rate (from 14.8% to 3.27%) and higher human performance (from 90.30% to 91.99%). The simulation results of the FIPN-based adaptive HM (AHM) system on six experimental participants demonstrate that the FIPN framework provides an effective way to model and regulate/optimize the OFS in HM hybrid systems composed of continuous-time OFS model and discrete-event switching controller. Copyright © 2017 Elsevier B.V. All rights reserved.

75 FR 27647 - Approval and Promulgation of Air Quality Implementation Plans; Texas; Revisions to the Emission...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-05-18

... taken under parts C and D of the CAA. In a separate rulemaking, EPA is approving the severable Discrete Emission Credit Banking and Trading Program (referred to elsewhere in this notice as the Discrete Emission...

On the Maximum-Weight Clique Problem.

DTIC Science & Technology

1985-06-01

hypergeometric distribution", Discrete Math . 25, 285-287 .* CHVATAL, V. (1983), Linear Programming, W.H. Freeman, New York/San Francisco. COOK, S.A. (1971...Annals Discrete Math . 21, 325-356 GROTSCHEL, M., L. LOVASZ, and A. SCHRIJVER ((1984b), "Relaxations of Vertex Packing", Preprint No. 35...de Grenoble. See also N. Sbihi, "Algorithme de recherche d’un stable de cardinalite maximum dans un graphe sans etoile", Discrete Math . 19 (1980), 53

A study of tumour growth based on stoichiometric principles: a continuous model and its discrete analogue.

PubMed

Saleem, M; Agrawal, Tanuja; Anees, Afzal

2014-01-01

In this paper, we consider a continuous mathematically tractable model and its discrete analogue for the tumour growth. The model formulation is based on stoichiometric principles considering tumour-immune cell interactions in potassium (K (+))-limited environment. Our both continuous and discrete models illustrate 'cancer immunoediting' as a dynamic process having all three phases namely elimination, equilibrium and escape. The stoichiometric principles introduced into the model allow us to study its dynamics with the variation in the total potassium in the surrounding of the tumour region. It is found that an increase in the total potassium may help the patient fight the disease for a longer period of time. This result seems to be in line with the protective role of the potassium against the risk of pancreatic cancer as has been reported by Bravi et al. [Dietary intake of selected micronutrients and risk of pancreatic cancer: An Italian case-control study, Ann. Oncol. 22 (2011), pp. 202-206].

Study on a discrete-time dynamic control model to enhance nitrogen removal with fluctuation of influent in oxidation ditches.

PubMed

Liu, Yanchen; Shi, Hanchang; Shi, Huiming; Wang, Zhiqiang

2010-10-01

The aim of study was proposed a new control model feasible on-line implemented by Programmable Logic Controller (PLC) to enhance nitrogen removal against the fluctuation of influent in Carrousel oxidation ditch. The discrete-time control model was established by confirmation model of operational conditions based on a expert access, which was obtained by a simulation using Activated Sludge Model 2-D (ASM2-D) and Computation Fluid Dynamics (CFD), and discrete-time control model to switch between different operational stages. A full-scale example is provided to demonstrate the feasibility of the proposed operation and the procedure of the control design. The effluent quality was substantially improved, to the extent that it met the new wastewater discharge standards of NH(3)-N<5mg/L and TN<15 mg/L enacted in China throughout a one-day period with fluctuation of influent. Copyright © 2010 Elsevier Ltd. All rights reserved.

Collective coordinates theory for discrete soliton ratchets in the sine-Gordon model

NASA Astrophysics Data System (ADS)

Sánchez-Rey, Bernardo; Quintero, Niurka R.; Cuevas-Maraver, Jesús; Alejo, Miguel A.

2014-10-01

A collective coordinate theory is developed for soliton ratchets in the damped discrete sine-Gordon model driven by a biharmonic force. An ansatz with two collective coordinates, namely the center and the width of the soliton, is assumed as an approximated solution of the discrete nonlinear equation. The dynamical equations of these two collective coordinates, obtained by means of the generalized travelling wave method, explain the mechanism underlying the soliton ratchet and capture qualitatively all the main features of this phenomenon. The numerical simulation of these equations accounts for the existence of a nonzero depinning threshold, the nonsinusoidal behavior of the average velocity as a function of the relative phase between the harmonics of the driver, the nonmonotonic dependence of the average velocity on the damping, and the existence of nontransporting regimes beyond the depinning threshold. In particular, it provides a good description of the intriguing and complex pattern of subspaces corresponding to different dynamical regimes in parameter space.

Collective coordinates theory for discrete soliton ratchets in the sine-Gordon model.

PubMed

Sánchez-Rey, Bernardo; Quintero, Niurka R; Cuevas-Maraver, Jesús; Alejo, Miguel A

2014-10-01

A collective coordinate theory is developed for soliton ratchets in the damped discrete sine-Gordon model driven by a biharmonic force. An ansatz with two collective coordinates, namely the center and the width of the soliton, is assumed as an approximated solution of the discrete nonlinear equation. The dynamical equations of these two collective coordinates, obtained by means of the generalized travelling wave method, explain the mechanism underlying the soliton ratchet and capture qualitatively all the main features of this phenomenon. The numerical simulation of these equations accounts for the existence of a nonzero depinning threshold, the nonsinusoidal behavior of the average velocity as a function of the relative phase between the harmonics of the driver, the nonmonotonic dependence of the average velocity on the damping, and the existence of nontransporting regimes beyond the depinning threshold. In particular, it provides a good description of the intriguing and complex pattern of subspaces corresponding to different dynamical regimes in parameter space.

Spectral phase measurement of a Fano resonance using tunable attosecond pulses

PubMed Central

Kotur, M.; Guénot, D.; Jiménez-Galán, Á; Kroon, D.; Larsen, E. W.; Louisy, M.; Bengtsson, S.; Miranda, M.; Mauritsson, J.; Arnold, C. L.; Canton, S. E.; Gisselbrecht, M.; Carette, T.; Dahlström, J. M.; Lindroth, E.; Maquet, A.; Argenti, L.; Martín, F.; L'Huillier, A.

2016-01-01

Electron dynamics induced by resonant absorption of light is of fundamental importance in nature and has been the subject of countless studies in many scientific areas. Above the ionization threshold of atomic or molecular systems, the presence of discrete states leads to autoionization, which is an interference between two quantum paths: direct ionization and excitation of the discrete state coupled to the continuum. Traditionally studied with synchrotron radiation, the probability for autoionization exhibits a universal Fano intensity profile as a function of excitation energy. However, without additional phase information, the full temporal dynamics cannot be recovered. Here we use tunable attosecond pulses combined with weak infrared radiation in an interferometric setup to measure not only the intensity but also the phase variation of the photoionization amplitude across an autoionization resonance in argon. The phase variation can be used as a fingerprint of the interactions between the discrete state and the ionization continua, indicating a new route towards monitoring electron correlations in time. PMID:26887682

A study of tumour growth based on stoichiometric principles: a continuous model and its discrete analogue

PubMed Central

Saleem, M.; Agrawal, Tanuja; Anees, Afzal

2014-01-01

In this paper, we consider a continuous mathematically tractable model and its discrete analogue for the tumour growth. The model formulation is based on stoichiometric principles considering tumour-immune cell interactions in potassium (K +)-limited environment. Our both continuous and discrete models illustrate ‘cancer immunoediting’ as a dynamic process having all three phases namely elimination, equilibrium and escape. The stoichiometric principles introduced into the model allow us to study its dynamics with the variation in the total potassium in the surrounding of the tumour region. It is found that an increase in the total potassium may help the patient fight the disease for a longer period of time. This result seems to be in line with the protective role of the potassium against the risk of pancreatic cancer as has been reported by Bravi et al. [Dietary intake of selected micronutrients and risk of pancreatic cancer: An Italian case-control study, Ann. Oncol. 22 (2011), pp. 202–206]. PMID:24963981

A VLF-based technique in applications to digital control of nonlinear hybrid multirate systems

NASA Astrophysics Data System (ADS)

Vassilyev, Stanislav; Ulyanov, Sergey; Maksimkin, Nikolay

2017-01-01

In this paper, a technique for rigorous analysis and design of nonlinear multirate digital control systems on the basis of the reduction method and sublinear vector Lyapunov functions is proposed. The control system model under consideration incorporates continuous-time dynamics of the plant and discrete-time dynamics of the controller and takes into account uncertainties of the plant, bounded disturbances, nonlinear characteristics of sensors and actuators. We consider a class of multirate systems where the control update rate is slower than the measurement sampling rates and periodic non-uniform sampling is admitted. The proposed technique does not use the preliminary discretization of the system, and, hence, allows one to eliminate the errors associated with the discretization and improve the accuracy of analysis. The technique is applied to synthesis of digital controller for a flexible spacecraft in the fine stabilization mode and decentralized controller for a formation of autonomous underwater vehicles. Simulation results are provided to validate the good performance of the designed controllers.

Structured Overlapping Grid Simulations of Contra-rotating Open Rotor Noise

NASA Technical Reports Server (NTRS)

Housman, Jeffrey A.; Kiris, Cetin C.

2015-01-01

Computational simulations using structured overlapping grids with the Launch Ascent and Vehicle Aerodynamics (LAVA) solver framework are presented for predicting tonal noise generated by a contra-rotating open rotor (CROR) propulsion system. A coupled Computational Fluid Dynamics (CFD) and Computational AeroAcoustics (CAA) numerical approach is applied. Three-dimensional time-accurate hybrid Reynolds Averaged Navier-Stokes/Large Eddy Simulation (RANS/LES) CFD simulations are performed in the inertial frame, including dynamic moving grids, using a higher-order accurate finite difference discretization on structured overlapping grids. A higher-order accurate free-stream preserving metric discretization with discrete enforcement of the Geometric Conservation Law (GCL) on moving curvilinear grids is used to create an accurate, efficient, and stable numerical scheme. The aeroacoustic analysis is based on a permeable surface Ffowcs Williams-Hawkings (FW-H) approach, evaluated in the frequency domain. A time-step sensitivity study was performed using only the forward row of blades to determine an adequate time-step. The numerical approach is validated against existing wind tunnel measurements.

Dynamics and Control of Flexible Space Vehicles

NASA Technical Reports Server (NTRS)

Likins, P. W.

1970-01-01

The purpose of this report is twofold: (1) to survey the established analytic procedures for the simulation of controlled flexible space vehicles, and (2) to develop in detail methods that employ a combination of discrete and distributed ("modal") coordinates, i.e., the hybrid-coordinate methods. Analytic procedures are described in three categories: (1) discrete-coordinate methods, (2) hybrid-coordinate methods, and (3) vehicle normal-coordinate methods. Each of these approaches is described and analyzed for its advantages and disadvantages, and each is found to have an area of applicability. The hybrid-coordinate method combines the efficiency of the vehicle normal-coordinate method with the versatility of the discrete-coordinate method, and appears to have the widest range of practical application. The results in this report have practical utility in two areas: (1) complex digital computer simulation of flexible space vehicles of arbitrary configuration subject to realistic control laws, and (2) preliminary control system design based on transfer functions for linearized models of dynamics and control laws.

Nonlinear dynamic range transformation in visual communication channels.

PubMed

Alter-Gartenberg, R

1996-01-01

The article evaluates nonlinear dynamic range transformation in the context of the end-to-end continuous-input/discrete processing/continuous-display imaging process. Dynamic range transformation is required when we have the following: (i) the wide dynamic range encountered in nature is compressed into the relatively narrow dynamic range of the display, particularly for spatially varying irradiance (e.g., shadow); (ii) coarse quantization is expanded to the wider dynamic range of the display; and (iii) nonlinear tone scale transformation compensates for the correction in the camera amplifier.

Reduced-order model for dynamic optimization of pressure swing adsorption processes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Agarwal, A.; Biegler, L.; Zitney, S.

2007-01-01

Over the past decades, pressure swing adsorption (PSA) processes have been widely used as energy-efficient gas and liquid separation techniques, especially for high purity hydrogen purification from refinery gases. The separation processes are based on solid-gas equilibrium and operate under periodic transient conditions. Models for PSA processes are therefore multiple instances of partial differential equations (PDEs) in time and space with periodic boundary conditions that link the processing steps together. The solution of this coupled stiff PDE system is governed by steep concentrations and temperature fronts moving with time. As a result, the optimization of such systems for either designmore » or operation represents a significant computational challenge to current differential algebraic equation (DAE) optimization techniques and nonlinear programming algorithms. Model reduction is one approach to generate cost-efficient low-order models which can be used as surrogate models in the optimization problems. The study develops a reduced-order model (ROM) based on proper orthogonal decomposition (POD), which is a low-dimensional approximation to a dynamic PDE-based model. Initially, a representative ensemble of solutions of the dynamic PDE system is constructed by solving a higher-order discretization of the model using the method of lines, a two-stage approach that discretizes the PDEs in space and then integrates the resulting DAEs over time. Next, the ROM method applies the Karhunen-Loeve expansion to derive a small set of empirical eigenfunctions (POD modes) which are used as basis functions within a Galerkin's projection framework to derive a low-order DAE system that accurately describes the dominant dynamics of the PDE system. The proposed method leads to a DAE system of significantly lower order, thus replacing the one obtained from spatial discretization before and making optimization problem computationally-efficient. The method has been applied to the dynamic coupled PDE-based model of a two-bed four-step PSA process for separation of hydrogen from methane. Separate ROMs have been developed for each operating step with different POD modes for each of them. A significant reduction in the order of the number of states has been achieved. The gas-phase mole fraction, solid-state loading and temperature profiles from the low-order ROM and from the high-order simulations have been compared. Moreover, the profiles for a different set of inputs and parameter values fed to the same ROM were compared with the accurate profiles from the high-order simulations. Current results indicate the proposed ROM methodology as a promising surrogate modeling technique for cost-effective optimization purposes. Moreover, deviations from the ROM for different set of inputs and parameters suggest that a recalibration of the model is required for the optimization studies. Results for these will also be presented with the aforementioned results.« less

Vegetation dynamics

Treesearch

Sammy L. King; Terry J. Antrobus; Sarah Billups

2000-01-01

A disturbance can be defined as "any relatively discrete event in time that disrupts ecosystem, community, or population structure and changes resources, substrate availability, or the physical environment" (Pickett and White 1985). Vegetation dynamics are a function of the temporal and spatial patterns of the disturbance regime. Natural disturbance regimes...

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jankovsky, Zachary Kyle; Denman, Matthew R.

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 themore » 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.« less

A hierarchical dislocation-grain boundary interaction model based on 3D discrete dislocation dynamics and molecular dynamics

NASA Astrophysics Data System (ADS)

Gao, Yuan; Zhuang, Zhuo; You, XiaoChuan

2011-04-01

We develop a new hierarchical dislocation-grain boundary (GB) interaction model to predict the mechanical behavior of polycrystalline metals at micro and submicro scales by coupling 3D Discrete Dislocation Dynamics (DDD) simulation with the Molecular Dynamics (MD) simulation. At the microscales, the DDD simulations are responsible for capturing the evolution of dislocation structures; at the nanoscales, the MD simulations are responsible for obtaining the GB energy and ISF energy which are then transferred hierarchically to the DDD level. In the present model, four kinds of dislocation-GB interactions, i.e. transmission, absorption, re-emission and reflection, are all considered. By this methodology, the compression of a Cu micro-sized bi-crystal pillar is studied. We investigate the characteristic mechanical behavior of the bi-crystal compared with that of the single-crystal. Moreover, the comparison between the present penetrable model of GB and the conventional impenetrable model also shows the accuracy and efficiency of the present model.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chen, Hang, E-mail: hangchen@mit.edu; Thill, Peter; Cao, Jianshu

In biochemical systems, intrinsic noise may drive the system switch from one stable state to another. We investigate how kinetic switching between stable states in a bistable network is influenced by dynamic disorder, i.e., fluctuations in the rate coefficients. Using the geometric minimum action method, we first investigate the optimal transition paths and the corresponding minimum actions based on a genetic toggle switch model in which reaction coefficients draw from a discrete probability distribution. For the continuous probability distribution of the rate coefficient, we then consider two models of dynamic disorder in which reaction coefficients undergo different stochastic processes withmore » the same stationary distribution. In one, the kinetic parameters follow a discrete Markov process and in the other they follow continuous Langevin dynamics. We find that regulation of the parameters modulating the dynamic disorder, as has been demonstrated to occur through allosteric control in bistable networks in the immune system, can be crucial in shaping the statistics of optimal transition paths, transition probabilities, and the stationary probability distribution of the network.« less

Efficient and stable exponential time differencing Runge-Kutta methods for phase field elastic bending energy models

NASA Astrophysics Data System (ADS)

Wang, Xiaoqiang; Ju, Lili; Du, Qiang

2016-07-01

The Willmore flow formulated by phase field dynamics based on the elastic bending energy model has been widely used to describe the shape transformation of biological lipid vesicles. In this paper, we develop and investigate some efficient and stable numerical methods for simulating the unconstrained phase field Willmore dynamics and the phase field Willmore dynamics with fixed volume and surface area constraints. The proposed methods can be high-order accurate and are completely explicit in nature, by combining exponential time differencing Runge-Kutta approximations for time integration with spectral discretizations for spatial operators on regular meshes. We also incorporate novel linear operator splitting techniques into the numerical schemes to improve the discrete energy stability. In order to avoid extra numerical instability brought by use of large penalty parameters in solving the constrained phase field Willmore dynamics problem, a modified augmented Lagrange multiplier approach is proposed and adopted. Various numerical experiments are performed to demonstrate accuracy and stability of the proposed methods.

Macroscopic damping model for structural dynamics with random polycrystalline configurations

NASA Astrophysics Data System (ADS)

Yang, Yantao; Cui, Junzhi; Yu, Yifan; Xiang, Meizhen

2018-06-01

In this paper the macroscopic damping model for dynamical behavior of the structures with random polycrystalline configurations at micro-nano scales is established. First, the global motion equation of a crystal is decomposed into a set of motion equations with independent single degree of freedom (SDOF) along normal discrete modes, and then damping behavior is introduced into each SDOF motion. Through the interpolation of discrete modes, the continuous representation of damping effects for the crystal is obtained. Second, from energy conservation law the expression of the damping coefficient is derived, and the approximate formula of damping coefficient is given. Next, the continuous damping coefficient for polycrystalline cluster is expressed, the continuous dynamical equation with damping term is obtained, and then the concrete damping coefficients for a polycrystalline Cu sample are shown. Finally, by using statistical two-scale homogenization method, the macroscopic homogenized dynamical equation containing damping term for the structures with random polycrystalline configurations at micro-nano scales is set up.

Boolean dynamics of genetic regulatory networks inferred from microarray time series data

DOE PAGES

Martin, Shawn; Zhang, Zhaoduo; Martino, Anthony; ...

2007-01-31

Methods available for the inference of genetic regulatory networks strive to produce a single network, usually by optimizing some quantity to fit the experimental observations. In this paper we investigate the possibility that multiple networks can be inferred, all resulting in similar dynamics. This idea is motivated by theoretical work which suggests that biological networks are robust and adaptable to change, and that the overall behavior of a genetic regulatory network might be captured in terms of dynamical basins of attraction. We have developed and implemented a method for inferring genetic regulatory networks for time series microarray data. Our methodmore » first clusters and discretizes the gene expression data using k-means and support vector regression. We then enumerate Boolean activation–inhibition networks to match the discretized data. In conclusion, the dynamics of the Boolean networks are examined. We have tested our method on two immunology microarray datasets: an IL-2-stimulated T cell response dataset and a LPS-stimulated macrophage response dataset. In both cases, we discovered that many networks matched the data, and that most of these networks had similar dynamics.« less

A Multiscale Model for Virus Capsid Dynamics

PubMed Central

Chen, Changjun; Saxena, Rishu; Wei, Guo-Wei

2010-01-01

Viruses are infectious agents that can cause epidemics and pandemics. The understanding of virus formation, evolution, stability, and interaction with host cells is of great importance to the scientific community and public health. Typically, a virus complex in association with its aquatic environment poses a fabulous challenge to theoretical description and prediction. In this work, we propose a differential geometry-based multiscale paradigm to model complex biomolecule systems. In our approach, the differential geometry theory of surfaces and geometric measure theory are employed as a natural means to couple the macroscopic continuum domain of the fluid mechanical description of the aquatic environment from the microscopic discrete domain of the atomistic description of the biomolecule. A multiscale action functional is constructed as a unified framework to derive the governing equations for the dynamics of different scales. We show that the classical Navier-Stokes equation for the fluid dynamics and Newton's equation for the molecular dynamics can be derived from the least action principle. These equations are coupled through the continuum-discrete interface whose dynamics is governed by potential driven geometric flows. PMID:20224756

Tracking vortices in superconductors: Extracting singularities from a discretized complex scalar field evolving in time

DOE PAGES

Phillips, Carolyn L.; Guo, Hanqi; Peterka, Tom; ...

2016-02-19

In type-II superconductors, the dynamics of magnetic flux vortices determine their transport properties. In the Ginzburg-Landau theory, vortices correspond to topological defects in the complex order parameter field. Earlier, we introduced a method for extracting vortices from the discretized complex order parameter field generated by a large-scale simulation of vortex matter. With this method, at a fixed time step, each vortex [simplistically, a one-dimensional (1D) curve in 3D space] can be represented as a connected graph extracted from the discretized field. Here we extend this method as a function of time as well. A vortex now corresponds to a 2Dmore » space-time sheet embedded in 4D space time that can be represented as a connected graph extracted from the discretized field over both space and time. Vortices that interact by merging or splitting correspond to disappearance and appearance of holes in the connected graph in the time direction. This method of tracking vortices, which makes no assumptions about the scale or behavior of the vortices, can track the vortices with a resolution as good as the discretization of the temporally evolving complex scalar field. In addition, even details of the trajectory between time steps can be reconstructed from the connected graph. With this form of vortex tracking, the details of vortex dynamics in a model of a superconducting materials can be understood in greater detail than previously possible.« less

[Development of New Mathematical Methodology in Air Traffic Control for the Analysis of Hybrid Systems

NASA Technical Reports Server (NTRS)

Hermann, Robert

1997-01-01

The aim of this research is to develop new mathematical methodology for the analysis of hybrid systems of the type involved in Air Traffic Control (ATC) problems. Two directions of investigation were initiated. The first used the methodology of nonlinear generalized functions, whose mathematical foundations were initiated by Colombeau and developed further by Oberguggenberger; it has been extended to apply to ordinary differential. Systems of the type encountered in control in joint work with the PI and M. Oberguggenberger. This involved a 'mixture' of 'continuous' and 'discrete' methodology. ATC clearly involves mixtures of two sorts of mathematical problems: (1) The 'continuous' dynamics of a standard control type described by ordinary differential equations (ODE) of the form: {dx/dt = f(x, u)} and (2) the discrete lattice dynamics involved of cellular automata. Most of the CA literature involves a discretization of a partial differential equation system of the type encountered in physics problems (e.g. fluid and gas problems). Both of these directions requires much thinking and new development of mathematical fundamentals before they may be utilized in the ATC work. Rather than consider CA as 'discretization' of PDE systems, I believe that the ATC applications will require a completely different and new mathematical methodology, a sort of discrete analogue of jet bundles and/or the sheaf-theoretic techniques to topologists. Here too, I have begun work on virtually 'virgin' mathematical ground (at least from an 'applied' point of view) which will require considerable preliminary work.

Alcohol impairment of performance on steering and discrete tasks in a driving simulator

DOT National Transportation Integrated Search

1974-12-01

In this program a simplified laboratory simulator was developed to test two types of tasks used in driving on the open road: a continuous "steering task" to regulate against gust induced disturbances and an intermittent "discrete response task" requi...

A Note on Discrete Mathematics and Calculus.

ERIC Educational Resources Information Center

O'Reilly, Thomas J.

1987-01-01

Much of the current literature on the topic of discrete mathematics and calculus during the first two years of an undergraduate mathematics curriculum is cited. A relationship between the recursive integration formulas and recursively defined polynomials is described. A Pascal program is included. (Author/RH)

Lyapunov spectrum of the separated flow around the NACA 0012 airfoil and its dependence on numerical discretization

NASA Astrophysics Data System (ADS)

Fernandez, P.; Wang, Q.

2017-12-01

We investigate the impact of numerical discretization on the Lyapunov spectrum of separated flow simulations. The two-dimensional chaotic flow around the NACA 0012 airfoil at a low Reynolds number and large angle of attack is considered to that end. Time, space and accuracy-order refinement studies are performed to examine each of these effects separately. Numerical results show that the time discretization has a small impact on the dynamics of the system, whereas the spatial discretization can dramatically change them. Also, the finite-time Lyapunov exponents associated to unstable modes are shown to be positively skewed, and quasi-homoclinic tangencies are observed in the attractor of the system. The implications of these results on flow physics and sensitivity analysis of chaotic flows are discussed.

Rigidity, Criticality and Prethermalization of Discrete Time Crystals

NASA Astrophysics Data System (ADS)

Yao, Norman

2017-04-01

Despite being forbidden in equilibrium, spontaneous breaking of time translation symmetry can occur in periodically driven, Floquet systems with discrete time-translation symmetry. The period of the resulting discrete time crystal (DTC) is quantized to an integer multiple of the drive period, arising from a combination of collective synchronization and many body localization. In this talk, I will describe a simple model for a one dimensional discrete time crystal which explicitly reveals the rigidity of the emergent oscillations as the drive is varied. I will analyze the properties of the dynamical phase transition where the time crystal melts into a trivial Floquet insulator. Effects of long-range interactions and pre-thermalization will be considered in the context of recent DTC realizations in trapped ions and solid-state spins.

Dynamics of nonautonomous discrete rogue wave solutions for an Ablowitz-Musslimani equation with PT-symmetric potential.

PubMed

Yu, Fajun

2017-02-01

Starting from a discrete spectral problem, we derive a hierarchy of nonlinear discrete equations which include the Ablowitz-Ladik (AL) equation. We analytically study the discrete rogue-wave (DRW) solutions of AL equation with three free parameters. The trajectories of peaks and depressions of profiles for the first- and second-order DRWs are produced by means of analytical and numerical methods. In particular, we study the solutions with dispersion in parity-time ( PT) symmetric potential for Ablowitz-Musslimani equation. And we consider the non-autonomous DRW solutions, parameters controlling and their interactions with variable coefficients, and predict the long-living rogue wave solutions. Our results might provide useful information for potential applications of synthetic PT symmetric systems in nonlinear optics and condensed matter physics.

Partition-based discrete-time quantum walks

NASA Astrophysics Data System (ADS)

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

2018-04-01

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

Dynamical Localization for Discrete and Continuous Random Schrödinger Operators

NASA Astrophysics Data System (ADS)

Germinet, F.; De Bièvre, S.

We show for a large class of random Schrödinger operators Ho on and on that dynamical localization holds, i.e. that, with probability one, for a suitable energy interval I and for q a positive real, Here ψ is a function of sufficiently rapid decrease, and PI(Ho) is the spectral projector of Ho corresponding to the interval I. The result is obtained through the control of the decay of the eigenfunctions of Ho and covers, in the discrete case, the Anderson tight-binding model with Bernoulli potential (dimension ν = 1) or singular potential (ν > 1), and in the continuous case Anderson as well as random Landau Hamiltonians.

Simulation Model for Scenario Optimization of the Ready-Mix Concrete Delivery Problem

NASA Astrophysics Data System (ADS)

Galić, Mario; Kraus, Ivan

2016-12-01

This paper introduces a discrete simulation model for solving routing and network material flow problems in construction projects. Before the description of the model a detailed literature review is provided. The model is verified using a case study of solving the ready-mix concrete network flow and routing problem in metropolitan area in Croatia. Within this study real-time input parameters were taken into account. Simulation model is structured in Enterprise Dynamics simulation software and Microsoft Excel linked with Google Maps. The model is dynamic, easily managed and adjustable, but also provides good estimation for minimization of costs and realization time in solving discrete routing and material network flow problems.

Dynamics of non-stationary processes that follow the maximum of the Rényi entropy principle.

PubMed

Shalymov, Dmitry S; Fradkov, Alexander L

2016-01-01

We propose dynamics equations which describe the behaviour of non-stationary processes that follow the maximum Rényi entropy principle. The equations are derived on the basis of the speed-gradient principle originated in the control theory. The maximum of the Rényi entropy principle is analysed for discrete and continuous cases, and both a discrete random variable and probability density function (PDF) are used. We consider mass conservation and energy conservation constraints and demonstrate the uniqueness of the limit distribution and asymptotic convergence of the PDF for both cases. The coincidence of the limit distribution of the proposed equations with the Rényi distribution is examined.

Dynamics of non-stationary processes that follow the maximum of the Rényi entropy principle

PubMed Central

2016-01-01

We propose dynamics equations which describe the behaviour of non-stationary processes that follow the maximum Rényi entropy principle. The equations are derived on the basis of the speed-gradient principle originated in the control theory. The maximum of the Rényi entropy principle is analysed for discrete and continuous cases, and both a discrete random variable and probability density function (PDF) are used. We consider mass conservation and energy conservation constraints and demonstrate the uniqueness of the limit distribution and asymptotic convergence of the PDF for both cases. The coincidence of the limit distribution of the proposed equations with the Rényi distribution is examined. PMID:26997886

Solving protein structures using short-distance cross-linking constraints as a guide for discrete molecular dynamics simulations

PubMed Central

Brodie, Nicholas I.; Popov, Konstantin I.; Petrotchenko, Evgeniy V.; Dokholyan, Nikolay V.; Borchers, Christoph H.

2017-01-01

We present an integrated experimental and computational approach for de novo protein structure determination in which short-distance cross-linking data are incorporated into rapid discrete molecular dynamics (DMD) simulations as constraints, reducing the conformational space and achieving the correct protein folding on practical time scales. We tested our approach on myoglobin and FK506 binding protein—models for α helix–rich and β sheet–rich proteins, respectively—and found that the lowest-energy structures obtained were in agreement with the crystal structure, hydrogen-deuterium exchange, surface modification, and long-distance cross-linking validation data. Our approach is readily applicable to other proteins with unknown structures. PMID:28695211

Solving protein structures using short-distance cross-linking constraints as a guide for discrete molecular dynamics simulations.

PubMed

Brodie, Nicholas I; Popov, Konstantin I; Petrotchenko, Evgeniy V; Dokholyan, Nikolay V; Borchers, Christoph H

2017-07-01

We present an integrated experimental and computational approach for de novo protein structure determination in which short-distance cross-linking data are incorporated into rapid discrete molecular dynamics (DMD) simulations as constraints, reducing the conformational space and achieving the correct protein folding on practical time scales. We tested our approach on myoglobin and FK506 binding protein-models for α helix-rich and β sheet-rich proteins, respectively-and found that the lowest-energy structures obtained were in agreement with the crystal structure, hydrogen-deuterium exchange, surface modification, and long-distance cross-linking validation data. Our approach is readily applicable to other proteins with unknown structures.

Domain decomposition methods in computational fluid dynamics

NASA Technical Reports Server (NTRS)

Gropp, William D.; Keyes, David E.

1991-01-01

The divide-and-conquer paradigm of iterative domain decomposition, or substructuring, has become a practical tool in computational fluid dynamic applications because of its flexibility in accommodating adaptive refinement through locally uniform (or quasi-uniform) grids, its ability to exploit multiple discretizations of the operator equations, and the modular pathway it provides towards parallelism. These features are illustrated on the classic model problem of flow over a backstep using Newton's method as the nonlinear iteration. Multiple discretizations (second-order in the operator and first-order in the preconditioner) and locally uniform mesh refinement pay dividends separately, and they can be combined synergistically. Sample performance results are included from an Intel iPSC/860 hypercube implementation.

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

PubMed

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.

Aeroservoelastic and Structural Dynamics Research on Smart Structures Conducted at NASA Langley Research Center

NASA Technical Reports Server (NTRS)

McGowan, Anna-Maria Rivas; Wilkie, W. Keats; Moses, Robert W.; Lake, Renee C.; Florance, Jennifer Pinkerton; Wieseman, Carol D.; Reaves, Mercedes C.; Taleghani, Barmac K.; Mirick, Paul H.; Wilbur, Mathew L.

1997-01-01

An overview of smart structures research currently underway at the NASA Langley Research Center in the areas of aeroservoelasticity and structural dynamics is presented. Analytical and experimental results, plans, potential technology pay-offs, and challenges are discussed. The goal of this research is to develop the enabling technologies to actively and passively control aircraft and rotorcraft vibration and loads using smart devices. These enabling technologies and related research efforts include developing experimentally-validated finite element and aeroservoelastic modeling techniques; conducting bench experimental tests to assess feasibility and understand system trade-offs; and conducting large-scale wind tunnel tests to demonstrate system performance. The key aeroservoelastic applications of this research include: active twist control of rotor blades using interdigitated electrode piezoelectric composites and active control of flutter, and gust and buffeting responses using discrete piezoelectric patches. In addition, NASA Langley is an active participant in the DARPA/Air Force Research Laboratory/NASA/Northrop Grumman Smart Wing program which is assessing aerodynamic performance benefits using smart materials.

Distributed Optimal Consensus Control for Multiagent Systems With Input Delay.

PubMed

Zhang, Huaipin; Yue, Dong; Zhao, Wei; Hu, Songlin; Dou, Chunxia; Huaipin Zhang; Dong Yue; Wei Zhao; Songlin Hu; Chunxia Dou; Hu, Songlin; Zhang, Huaipin; Dou, Chunxia; Yue, Dong; Zhao, Wei

2018-06-01

This paper addresses the problem of distributed optimal consensus control for a continuous-time heterogeneous linear multiagent system subject to time varying input delays. First, by discretization and model transformation, the continuous-time input-delayed system is converted into a discrete-time delay-free system. Two delicate performance index functions are defined for these two systems. It is shown that the performance index functions are equivalent and the optimal consensus control problem of the input-delayed system can be cast into that of the delay-free system. Second, by virtue of the Hamilton-Jacobi-Bellman (HJB) equations, an optimal control policy for each agent is designed based on the delay-free system and a novel value iteration algorithm is proposed to learn the solutions to the HJB equations online. The proposed adaptive dynamic programming algorithm is implemented on the basis of a critic-action neural network (NN) structure. Third, it is proved that local consensus errors of the two systems and weight estimation errors of the critic-action NNs are uniformly ultimately bounded while the approximated control policies converge to their target values. Finally, two simulation examples are presented to illustrate the effectiveness of the developed method.

Phylogenetic Factor Analysis.

PubMed

Tolkoff, Max R; Alfaro, Michael E; Baele, Guy; Lemey, Philippe; Suchard, Marc A

2018-05-01

Phylogenetic comparative methods explore the relationships between quantitative traits adjusting for shared evolutionary history. This adjustment often occurs through a Brownian diffusion process along the branches of the phylogeny that generates model residuals or the traits themselves. For high-dimensional traits, inferring all pair-wise correlations within the multivariate diffusion is limiting. To circumvent this problem, we propose phylogenetic factor analysis (PFA) that assumes a small unknown number of independent evolutionary factors arise along the phylogeny and these factors generate clusters of dependent traits. Set in a Bayesian framework, PFA provides measures of uncertainty on the factor number and groupings, combines both continuous and discrete traits, integrates over missing measurements and incorporates phylogenetic uncertainty with the help of molecular sequences. We develop Gibbs samplers based on dynamic programming to estimate the PFA posterior distribution, over 3-fold faster than for multivariate diffusion and a further order-of-magnitude more efficiently in the presence of latent traits. We further propose a novel marginal likelihood estimator for previously impractical models with discrete data and find that PFA also provides a better fit than multivariate diffusion in evolutionary questions in columbine flower development, placental reproduction transitions and triggerfish fin morphometry.

Dilution jet mixing program, phase 3

NASA Technical Reports Server (NTRS)

Srinivasan, R.; Coleman, E.; Myers, G.; White, C.

1985-01-01

The main objectives for the NASA Jet Mixing Phase 3 program were: extension of the data base on the mixing of single sided rows of jets in a confined cross flow to discrete slots, including streamlined, bluff, and angled injections; quantification of the effects of geometrical and flow parameters on penetration and mixing of multiple rows of jets into a confined flow; investigation of in-line, staggered, and dissimilar hole configurations; and development of empirical correlations for predicting temperature distributions for discrete slots and multiple rows of dilution holes.

Dynamics of a Tapped Granular Column

NASA Astrophysics Data System (ADS)

Rosato, Anthony; Blackmore, Denis; Zuo, Luo; Hao, Wu; Horntrop, David

2015-11-01

We consider the behavior of a column of spheres subjected to a time-dependent vertical taps. Of interest are various dynamical properties, such as the motion of its mass center, its response to taps of different intensities and forms, and the effect of system size and material properties. The interplay between diverse time and length scales are the key contributors to the column's evolving dynamics. Soft sphere discrete element simulations were conducted over a very wide parameter space to obtain a portrait of column behavior as embodied by the collective dynamics of the mass center motion. Results compared favorably with a derived reduced-order paradigm of the mass center motion (surprisingly analogous to that for a single bouncing ball on an oscillating plate) with respect to dynamical regimes and their transitions. A continuum model obtained from a system of Newtonian equations, as a locally averaged limit in the transport mode along trajectories is described, and a numerical solution protocol for a one-dimensional system is outlined. Typical trajectories and density evolution profiles are shown. We conclude with a discussion of our investigations to relate predictions of the continuum and reduced dynamical systems models with discrete simulations.

Galaxy Redshifts from Discrete Optimization of Correlation Functions

NASA Astrophysics Data System (ADS)

Lee, Benjamin C. G.; Budavári, Tamás; Basu, Amitabh; Rahman, Mubdi

2016-12-01

We propose a new method of constraining the redshifts of individual extragalactic sources based on celestial coordinates and their ensemble statistics. Techniques from integer linear programming (ILP) are utilized to optimize simultaneously for the angular two-point cross- and autocorrelation functions. Our novel formalism introduced here not only transforms the otherwise hopelessly expensive, brute-force combinatorial search into a linear system with integer constraints but also is readily implementable in off-the-shelf solvers. We adopt Gurobi, a commercial optimization solver, and use Python to build the cost function dynamically. The preliminary results on simulated data show potential for future applications to sky surveys by complementing and enhancing photometric redshift estimators. Our approach is the first application of ILP to astronomical analysis.

Modeling of tool path for the CNC sheet cutting machines

NASA Astrophysics Data System (ADS)

Petunin, Aleksandr A.

2015-11-01

In the paper the problem of tool path optimization for CNC (Computer Numerical Control) cutting machines is considered. The classification of the cutting techniques is offered. We also propose a new classification of toll path problems. The tasks of cost minimization and time minimization for standard cutting technique (Continuous Cutting Problem, CCP) and for one of non-standard cutting techniques (Segment Continuous Cutting Problem, SCCP) are formalized. We show that the optimization tasks can be interpreted as discrete optimization problem (generalized travel salesman problem with additional constraints, GTSP). Formalization of some constraints for these tasks is described. For the solution GTSP we offer to use mathematical model of Prof. Chentsov based on concept of a megalopolis and dynamic programming.

A discrete mechanics approach to dislocation dynamics in BCC crystals

NASA Astrophysics Data System (ADS)

Ramasubramaniam, A.; Ariza, M. P.; Ortiz, M.

2007-03-01

A discrete mechanics approach to modeling the dynamics of dislocations in BCC single crystals is presented. Ideas are borrowed from discrete differential calculus and algebraic topology and suitably adapted to crystal lattices. In particular, the extension of a crystal lattice to a CW complex allows for convenient manipulation of forms and fields defined over the crystal. Dislocations are treated within the theory as energy-minimizing structures that lead to locally lattice-invariant but globally incompatible eigendeformations. The discrete nature of the theory eliminates the need for regularization of the core singularity and inherently allows for dislocation reactions and complicated topological transitions. The quantization of slip to integer multiples of the Burgers' vector leads to a large integer optimization problem. A novel approach to solving this NP-hard problem based on considerations of metastability is proposed. A numerical example that applies the method to study the emanation of dislocation loops from a point source of dilatation in a large BCC crystal is presented. The structure and energetics of BCC screw dislocation cores, as obtained via the present formulation, are also considered and shown to be in good agreement with available atomistic studies. The method thus provides a realistic avenue for mesoscale simulations of dislocation based crystal plasticity with fully atomistic resolution.

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

PubMed

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.

Parallel Stochastic discrete event simulation of calcium dynamics in neuron.

PubMed

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.

Distinct timing mechanisms produce discrete and continuous movements.

PubMed

Huys, Raoul; Studenka, Breanna E; Rheaume, Nicole L; Zelaznik, Howard N; Jirsa, Viktor K

2008-04-25

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

Comparison of some optimal control methods for the design of turbine blades

NASA Technical Reports Server (NTRS)

Desilva, B. M. E.; Grant, G. N. C.

1977-01-01

This paper attempts a comparative study of some numerical methods for the optimal control design of turbine blades whose vibration characteristics are approximated by Timoshenko beam idealizations with shear and incorporating simple boundary conditions. The blade was synthesized using the following methods: (1) conjugate gradient minimization of the system Hamiltonian in function space incorporating penalty function transformations, (2) projection operator methods in a function space which includes the frequencies of vibration and the control function, (3) epsilon-technique penalty function transformation resulting in a highly nonlinear programming problem, (4) finite difference discretization of the state equations again resulting in a nonlinear program, (5) second variation methods with complex state differential equations to include damping effects resulting in systems of inhomogeneous matrix Riccatti equations some of which are stiff, (6) quasi-linear methods based on iterative linearization of the state and adjoint equation. The paper includes a discussion of some substantial computational difficulties encountered in the implementation of these techniques together with a resume of work presently in progress using a differential dynamic programming approach.

Local immunization program for susceptible-infected-recovered network epidemic model

NASA Astrophysics Data System (ADS)

Wu, Qingchu; Lou, Yijun

2016-02-01

The immunization strategies through contact tracing on the susceptible-infected-recovered framework in social networks are modelled to evaluate the cost-effectiveness of information-based vaccination programs with particular focus on the scenario where individuals belonging to a specific set can get vaccinated due to the vaccine shortages and other economic or humanity constraints. By using the block heterogeneous mean-field approach, a series of discrete-time dynamical models is formulated and the condition for epidemic outbreaks can be established which is shown to be not only dependent on the network structure but also closely related to the immunization control parameters. Results show that increasing the immunization strength can effectively raise the epidemic threshold, which is different from the predictions obtained through the susceptible-infected-susceptible network framework, where epidemic threshold is independent of the vaccination strength. Furthermore, a significant decrease of vaccine use to control the infectious disease is observed for the local vaccination strategy, which shows the promising applications of the local immunization programs to disease control while calls for accurate local information during the process of disease outbreak.

Observation of discrete time-crystalline order in a disordered dipolar many-body system

PubMed Central

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

2017-01-01

Understanding quantum dynamics away from equilibrium is an outstanding challenge in the modern physical sciences. It is well known that out-of-equilibrium systems can display a rich array of phenomena, ranging from self-organized synchronization to dynamical phase transitions1,2. More recently, advances in the controlled manipulation of isolated many-body systems have enabled detailed studies of non-equilibrium phases in strongly interacting quantum matter3–6. As a particularly striking example, the interplay of periodic driving, disorder, and strong interactions has recently been predicted to result in exotic “time-crystalline” phases7, which spontaneously break the discrete time-translation symmetry of the underlying drive8–11. Here, we report the experimental observation of such discrete time-crystalline order in a driven, disordered ensemble of ~ 106 dipolar spin impurities in diamond at room-temperature12–14. We observe long-lived temporal correlations at integer multiples of the fundamental driving period, experimentally identify the phase boundary and find that the temporal order is protected by strong interactions; this order is remarkably stable against perturbations, even in the presence of slow thermalization15,16. Our work opens the door to exploring dynamical phases of matter and controlling interacting, disordered many-body systems17–19. PMID:28277511

Nucleation and growth of Y2O3 nanoparticles in a RF-ICTP reactor: a discrete sectional study based on CFD simulation supported with experiments

NASA Astrophysics Data System (ADS)

Dhamale, G. D.; Tak, A. K.; Mathe, V. L.; Ghorui, S.

2018-06-01

Synthesis of yttria (Y2O3) nanoparticles in an atmospheric pressure radiofrequency inductively coupled thermal plasma (RF-ICTP) reactor has been investigated using the discrete-sectional (DS) model of particle nucleation and growth with argon as the plasma gas. Thermal and fluid dynamic information necessary for the investigation have been extracted through rigorous computational fluid dynamic (CFD) study of the system with coupled electromagnetic equations under the extended field approach. The theoretical framework has been benchmarked against published data first, and then applied to investigate the nucleation and growth process of yttrium oxide nanoparticles in the plasma reactor using the discrete-sectional (DS) model. While a variety of nucleation and growth mechanisms are suggested in literature, the study finds that the theory of homogeneous nucleation fits well with the features observed experimentally. Significant influences of the feed rate and quench rate on the distribution of particles sizes are observed. Theoretically obtained size distribution of the particles agrees well with that observed in the experiment. Different thermo-fluid dynamic environments with varied quench rates, encountered by the propagating vapor front inside the reactor under different operating conditions are found to be primarily responsible for variations in the width of the size distribution.

Multidimensional discrete compactons in nonlinear Schrödinger lattices with strong nonlinearity management

DOE Office of Scientific and Technical Information (OSTI.GOV)

D'Ambroise, J.; Salerno, M.; Kevrekidis, P. G.

The existence of multidimensional lattice compactons in the discrete nonlinear Schrödinger equation in the presence of fast periodic time modulations of the nonlinearity is demonstrated. By averaging over the period of the fast modulations, an effective averaged dynamical equation arises with coupling constants involving Bessel functions of the first and zeroth kinds. We show that these terms allow one to solve, at this averaged level, for exact discrete compacton solution configurations in the corresponding stationary equation. We focus on seven types of compacton solutions. Single-site and vortex solutions are found to be always stable in the parametric regimes we examined.more » We also found that other solutions such as double-site in- and out-of-phase, four-site symmetric and antisymmetric, and a five-site compacton solution are found to have regions of stability and instability in two-dimensional parametric planes, involving variations of the strength of the coupling and of the nonlinearity. We also explore the time evolution of the solutions and compare the dynamics according to the averaged equations with those of the original dynamical system. Finally, the possible observation of compactons in Bose-Einstein condensates loaded in a deep two-dimensional optical lattice with interactions modulated periodically in time is also discussed.« less

Multidimensional discrete compactons in nonlinear Schrödinger lattices with strong nonlinearity management

DOE PAGES

D'Ambroise, J.; Salerno, M.; Kevrekidis, P. G.; ...

2015-11-19

The existence of multidimensional lattice compactons in the discrete nonlinear Schrödinger equation in the presence of fast periodic time modulations of the nonlinearity is demonstrated. By averaging over the period of the fast modulations, an effective averaged dynamical equation arises with coupling constants involving Bessel functions of the first and zeroth kinds. We show that these terms allow one to solve, at this averaged level, for exact discrete compacton solution configurations in the corresponding stationary equation. We focus on seven types of compacton solutions. Single-site and vortex solutions are found to be always stable in the parametric regimes we examined.more » We also found that other solutions such as double-site in- and out-of-phase, four-site symmetric and antisymmetric, and a five-site compacton solution are found to have regions of stability and instability in two-dimensional parametric planes, involving variations of the strength of the coupling and of the nonlinearity. We also explore the time evolution of the solutions and compare the dynamics according to the averaged equations with those of the original dynamical system. Finally, the possible observation of compactons in Bose-Einstein condensates loaded in a deep two-dimensional optical lattice with interactions modulated periodically in time is also discussed.« less

Variational coarse-graining procedure for dynamic homogenization

NASA Astrophysics Data System (ADS)

Liu, Chenchen; Reina, Celia

2017-07-01

We present a variational coarse-graining framework for heterogeneous media in the spirit of FE2 methods, that allows for a seamless transition from the traditional static scenario to dynamic loading conditions, while being applicable to general material behavior as well as to discrete or continuous representations of the material and its deformation, e.g., finite element discretizations or atomistic systems. The method automatically delivers the macroscopic equations of motion together with the generalization of Hill's averaging relations to the dynamic setting. These include the expression of the macroscopic stresses and linear momentum as a function of the microscopic fields. We further demonstrate with a proof of concept example, that the proposed theoretical framework can be used to perform multiscale numerical simulations. The results are compared with standard single-scale finite element simulations, showcasing the capability of the method to capture the dispersive nature of the medium in the range of frequencies permitted by the multiscale strategy.

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chen, Yuanlong; Huang, Tingwen; Huang, Yu, E-mail: stshyu@mail.sysu.edu.cn

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 Zoumore » [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.« less

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

PubMed

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.

The dynamics and control of large flexible space structures. Part A: Discrete model and modal control

NASA Technical Reports Server (NTRS)

Bainum, P. M.; Sellappan, R.

1978-01-01

Attitude control techniques for the pointing and stabilization of very large, inherently flexible spacecraft systems were investigated. The attitude dynamics and control of a long, homogeneous flexible beam whose center of mass is assumed to follow a circular orbit was analyzed. First order effects of gravity gradient were included. A mathematical model which describes the system rotations and deflections within the orbital plane was developed by treating the beam as a number of discretized mass particles connected by massless, elastic structural elements. The uncontrolled dynamics of the system are simulated and, in addition, the effects of the control devices were considered. The concept of distributed modal control, which provides a means for controlling a system mode independently of all other modes, was examined. The effect of varying the number of modes in the model as well as the number and location of the control devices were also considered.

Optimal region of latching activity in an adaptive Potts model for networks of neurons

NASA Astrophysics Data System (ADS)

Abdollah-nia, Mohammad-Farshad; Saeedghalati, Mohammadkarim; Abbassian, Abdolhossein

2012-02-01

In statistical mechanics, the Potts model is a model for interacting spins with more than two discrete states. Neural networks which exhibit features of learning and associative memory can also be modeled by a system of Potts spins. A spontaneous behavior of hopping from one discrete attractor state to another (referred to as latching) has been proposed to be associated with higher cognitive functions. Here we propose a model in which both the stochastic dynamics of Potts models and an adaptive potential function are present. A latching dynamics is observed in a limited region of the noise(temperature)-adaptation parameter space. We hence suggest noise as a fundamental factor in such alternations alongside adaptation. From a dynamical systems point of view, the noise-adaptation alternations may be the underlying mechanism for multi-stability in attractor-based models. An optimality criterion for realistic models is finally inferred.

An opinion-driven behavioral dynamics model for addictive behaviors

NASA Astrophysics Data System (ADS)

Moore, Thomas W.; Finley, Patrick D.; Apelberg, Benjamin J.; Ambrose, Bridget K.; Brodsky, Nancy S.; Brown, Theresa J.; Husten, Corinne; Glass, Robert J.

2015-04-01

We present a model of behavioral dynamics that combines a social network-based opinion dynamics model with behavioral mapping. The behavioral component is discrete and history-dependent to represent situations in which an individual's behavior is initially driven by opinion and later constrained by physiological or psychological conditions that serve to maintain the behavior. Individuals are modeled as nodes in a social network connected by directed edges. Parameter sweeps illustrate model behavior and the effects of individual parameters and parameter interactions on model results. Mapping a continuous opinion variable into a discrete behavioral space induces clustering on directed networks. Clusters provide targets of opportunity for influencing the network state; however, the smaller the network the greater the stochasticity and potential variability in outcomes. This has implications both for behaviors that are influenced by close relationships verses those influenced by societal norms and for the effectiveness of strategies for influencing those behaviors.

The discrete dynamics of symmetric competition in the plane.

PubMed

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.

Divergence compensation for hardware-in-the-loop simulation of stiffness-varying discrete contact in space

NASA Astrophysics Data System (ADS)

Qi, Chenkun; Zhao, Xianchao; Gao, Feng; Ren, Anye; Hu, Yan

2016-11-01

The hardware-in-the-loop (HIL) contact simulation for flying objects in space is challenging due to the divergence caused by the time delay. In this study, a divergence compensation approach is proposed for the stiffness-varying discrete contact. The dynamic response delay of the motion simulator and the force measurement delay are considered. For the force measurement delay, a phase lead based force compensation approach is used. For the dynamic response delay of the motion simulator, a response error based force compensation approach is used, where the compensation force is obtained from the real-time identified contact stiffness and real-time measured position response error. The dynamic response model of the motion simulator is not required. The simulations and experiments show that the simulation divergence can be compensated effectively and satisfactorily by using the proposed approach.

Principles of dynamical modularity in biological regulatory networks

PubMed Central

Deritei, Dávid; Aird, William C.; Ercsey-Ravasz, Mária; Regan, Erzsébet Ravasz

2016-01-01

Intractable diseases such as cancer are associated with breakdown in multiple individual functions, which conspire to create unhealthy phenotype-combinations. An important challenge is to decipher how these functions are coordinated in health and disease. We approach this by drawing on dynamical systems theory. We posit that distinct phenotype-combinations are generated by interactions among robust regulatory switches, each in control of a discrete set of phenotypic outcomes. First, we demonstrate the advantage of characterizing multi-switch regulatory systems in terms of their constituent switches by building a multiswitch cell cycle model which points to novel, testable interactions critical for early G2/M commitment to division. Second, we define quantitative measures of dynamical modularity, namely that global cell states are discrete combinations of switch-level phenotypes. Finally, we formulate three general principles that govern the way coupled switches coordinate their function. PMID:26979940

Polynomial algebra of discrete models in systems biology.

PubMed

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

2010-07-01

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

Modeling and 2-D discrete simulation of dislocation dynamics for plastic deformation of metal

NASA Astrophysics Data System (ADS)

Liu, Juan; Cui, Zhenshan; Ou, Hengan; Ruan, Liqun

2013-05-01

Two methods are employed in this paper to investigate the dislocation evolution during plastic deformation of metal. One method is dislocation dynamic simulation of two-dimensional discrete dislocation dynamics (2D-DDD), and the other is dislocation dynamics modeling by means of nonlinear analysis. As screw dislocation is prone to disappear by cross-slip, only edge dislocation is taken into account in simulation. First, an approach of 2D-DDD is used to graphically simulate and exhibit the collective motion of a large number of discrete dislocations. In the beginning, initial grains are generated in the simulation cells according to the mechanism of grain growth and the initial dislocation is randomly distributed in grains and relaxed under the internal stress. During the simulation process, the externally imposed stress, the long range stress contribution of all dislocations and the short range stress caused by the grain boundaries are calculated. Under the action of these forces, dislocations begin to glide, climb, multiply, annihilate and react with each other. Besides, thermal activation process is included. Through the simulation, the distribution of dislocation and the stress-strain curves can be obtained. On the other hand, based on the classic dislocation theory, the variation of the dislocation density with time is described by nonlinear differential equations. Finite difference method (FDM) is used to solve the built differential equations. The dislocation evolution at a constant strain rate is taken as an example to verify the rationality of the model.

A computer program for the calculation of the flow field in supersonic mixed-compression inlets at angle of attack using the three-dimensional method of characteristics with discrete shock wave fitting

NASA Technical Reports Server (NTRS)

Vadyak, J.; Hoffman, J. D.; Bishop, A. R.

1978-01-01

The calculation procedure is based on the method of characteristics for steady three-dimensional flow. The bow shock wave and the internal shock wave system were computed using a discrete shock wave fitting procedure. The general structure of the computer program is discussed, and a brief description of each subroutine is given. All program input parameters are defined, and a brief discussion on interpretation of the output is provided. A number of sample cases, complete with data deck listings, are presented.

BWM*: A Novel, Provable, Ensemble-based Dynamic Programming Algorithm for Sparse Approximations of Computational Protein Design.

PubMed

Jou, Jonathan D; Jain, Swati; Georgiev, Ivelin S; Donald, Bruce R

2016-06-01

Sparse energy functions that ignore long range interactions between residue pairs are frequently used by protein design algorithms to reduce computational cost. Current dynamic programming algorithms that fully exploit the optimal substructure produced by these energy functions only compute the GMEC. This disproportionately favors the sequence of a single, static conformation and overlooks better binding sequences with multiple low-energy conformations. Provable, ensemble-based algorithms such as A* avoid this problem, but A* cannot guarantee better performance than exhaustive enumeration. We propose a novel, provable, dynamic programming algorithm called Branch-Width Minimization* (BWM*) to enumerate a gap-free ensemble of conformations in order of increasing energy. Given a branch-decomposition of branch-width w for an n-residue protein design with at most q discrete side-chain conformations per residue, BWM* returns the sparse GMEC in O([Formula: see text]) time and enumerates each additional conformation in merely O([Formula: see text]) time. We define a new measure, Total Effective Search Space (TESS), which can be computed efficiently a priori before BWM* or A* is run. We ran BWM* on 67 protein design problems and found that TESS discriminated between BWM*-efficient and A*-efficient cases with 100% accuracy. As predicted by TESS and validated experimentally, BWM* outperforms A* in 73% of the cases and computes the full ensemble or a close approximation faster than A*, enumerating each additional conformation in milliseconds. Unlike A*, the performance of BWM* can be predicted in polynomial time before running the algorithm, which gives protein designers the power to choose the most efficient algorithm for their particular design problem.

Exploration Supply Chain Simulation

NASA Technical Reports Server (NTRS)

2008-01-01

The Exploration Supply Chain Simulation project was chartered by the NASA Exploration Systems Mission Directorate to develop a software tool, with proper data, to quantitatively analyze supply chains for future program planning. This tool is a discrete-event simulation that uses the basic supply chain concepts of planning, sourcing, making, delivering, and returning. This supply chain perspective is combined with other discrete or continuous simulation factors. Discrete resource events (such as launch or delivery reviews) are represented as organizational functional units. Continuous resources (such as civil service or contractor program functions) are defined as enabling functional units. Concepts of fixed and variable costs are included in the model to allow the discrete events to interact with cost calculations. The definition file is intrinsic to the model, but a blank start can be initiated at any time. The current definition file is an Orion Ares I crew launch vehicle. Parameters stretch from Kennedy Space Center across and into other program entities (Michaud Assembly Facility, Aliant Techsystems, Stennis Space Center, Johnson Space Center, etc.) though these will only gain detail as the file continues to evolve. The Orion Ares I file definition in the tool continues to evolve, and analysis from this tool is expected in 2008. This is the first application of such business-driven modeling to a NASA/government-- aerospace contractor endeavor.

A Re-programmable Platform for Dynamic Burn-in Test of Xilinx Virtexll 3000 FPGA for Military and Aerospace Applications

NASA Technical Reports Server (NTRS)

Roosta, Ramin; Wang, Xinchen; Sadigursky, Michael; Tracton, Phil

2004-01-01

Field Programmable Gate Arrays (FPGA) have played increasingly important roles in military and aerospace applications. Xilinx SRAM-based FPGAs have been extensively used in commercial applications. They have been used less frequently in space flight applications due to their susceptibility to single-event upsets. Reliability of these devices in space applications is a concern that has not been addressed. The objective of this project is to design a fully programmable hardware/software platform that allows (but is not limited to) comprehensive static/dynamic burn-in test of Virtex-II 3000 FPGAs, at speed test and SEU test. Conventional methods test very few discrete AC parameters (primarily switching) of a given integrated circuit. This approach will test any possible configuration of the FPGA and any associated performance parameters. It allows complete or partial re-programming of the FPGA and verification of the program by using read back followed by dynamic test. Designers have full control over which functional elements of the FPGA to stress. They can completely simulate all possible types of configurations/functions. Another benefit of this platform is that it allows collecting information on elevation of the junction temperature as a function of gate utilization, operating frequency and functionality. A software tool has been implemented to demonstrate the various features of the system. The software consists of three major parts: the parallel interface driver, main system procedure and a graphical user interface (GUI).

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

PubMed

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.

Finding the Missing Physics: Simulating Polydisperse Polymer Melts

NASA Astrophysics Data System (ADS)

Rorrer, Nichoals; Dorgan, John

2014-03-01

A Monte Carlo algorithm has been developed to model polydisperse polymer melts. For the first time, this enables the specification of a predetermined molecular weight distribution for lattice based simulations. It is demonstrated how to map an arbitrary probability distributions onto a discrete number of chains residing on an fcc lattice. The resulting algorithm is able to simulate a wide variety of behaviors for polydisperse systems including confinement effects, shear flow, and parabolic flow. The dynamic version of the algorithm accurately captures Rouse dynamics for short polymer chains, and reptation-like dynamics for longer chain lengths.1 When polydispersity is introduced, smaller Rouse times and broadened the transition between different scaling regimes are observed. Rouse times also decrease under confinement for both polydisperse and monodisperse systems and chain length dependent migration effects are observed. The steady-state version of the algorithm enables the simulation of flow and when polydisperse systems are subject to parabolic (Poiseulle) flow, a migration phenomenon based on chain length is again present. These and other phenomena highlight the importance of including polydispersity in obtaining physically realistic simulations of polymeric melts. 1. Dorgan, J.R.; Rorrer, N.A.; Maupin, C.M., Macromolecules 2012, 45(21), 8833-8840. Work funded by the Fluid Dynamics program of the National Science Foundation under grant CBET-1067707.

Video modeling to train staff to implement discrete-trial instruction.

PubMed

Catania, Cynthia N; Almeida, Daniel; Liu-Constant, Brian; DiGennaro Reed, Florence D

2009-01-01

Three new direct-service staff participated in a program that used a video model to train target skills needed to conduct a discrete-trial session. Percentage accuracy in completing a discrete-trial teaching session was evaluated using a multiple baseline design across participants. During baseline, performances ranged from a mean of 12% to 63% accuracy. During video modeling, there was an immediate increase in accuracy to a mean of 98%, 85%, and 94% for each participant. Performance during maintenance and generalization probes remained at high levels. Results suggest that video modeling can be an effective technique to train staff to conduct discrete-trial sessions.

Fractional Programming for Communication Systems—Part II: Uplink Scheduling via Matching

NASA Astrophysics Data System (ADS)

Shen, Kaiming; Yu, Wei

2018-05-01

This two-part paper develops novel methodologies for using fractional programming (FP) techniques to design and optimize communication systems. Part I of this paper proposes a new quadratic transform for FP and treats its application for continuous optimization problems. In this Part II of the paper, we study discrete problems, such as those involving user scheduling, which are considerably more difficult to solve. Unlike the continuous problems, discrete or mixed discrete-continuous problems normally cannot be recast as convex problems. In contrast to the common heuristic of relaxing the discrete variables, this work reformulates the original problem in an FP form amenable to distributed combinatorial optimization. The paper illustrates this methodology by tackling the important and challenging problem of uplink coordinated multi-cell user scheduling in wireless cellular systems. Uplink scheduling is more challenging than downlink scheduling, because uplink user scheduling decisions significantly affect the interference pattern in nearby cells. Further, the discrete scheduling variable needs to be optimized jointly with continuous variables such as transmit power levels and beamformers. The main idea of the proposed FP approach is to decouple the interaction among the interfering links, thereby permitting a distributed and joint optimization of the discrete and continuous variables with provable convergence. The paper shows that the well-known weighted minimum mean-square-error (WMMSE) algorithm can also be derived from a particular use of FP; but our proposed FP-based method significantly outperforms WMMSE when discrete user scheduling variables are involved, both in term of run-time efficiency and optimizing results.

Mesh and Time-Step Independent Computational Fluid Dynamics (CFD) Solutions

ERIC Educational Resources Information Center

Nijdam, Justin J.

2013-01-01

A homework assignment is outlined in which students learn Computational Fluid Dynamics (CFD) concepts of discretization, numerical stability and accuracy, and verification in a hands-on manner by solving physically realistic problems of practical interest to engineers. The students solve a transient-diffusion problem numerically using the common…

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ng, B

This survey gives an overview of popular generative models used in the modeling of stochastic temporal systems. In particular, this survey is organized into two parts. The first part discusses the discrete-time representations of dynamic Bayesian networks and dynamic relational probabilistic models, while the second part discusses the continuous-time representation of continuous-time Bayesian networks.