Comparing Algorithms for Graph Isomorphism Using Discrete- and Continuous-Time Quantum Random Walks

DOE PAGES

Rudinger, Kenneth; Gamble, John King; Bach, Eric; ...

2013-07-01

Berry and Wang [Phys. Rev. A 83, 042317 (2011)] show numerically that a discrete-time quan- tum random walk of two noninteracting particles is able to distinguish some non-isomorphic strongly regular graphs from the same family. Here we analytically demonstrate how it is possible for these walks to distinguish such graphs, while continuous-time quantum walks of two noninteracting parti- cles cannot. We show analytically and numerically that even single-particle discrete-time quantum random walks can distinguish some strongly regular graphs, though not as many as two-particle noninteracting discrete-time walks. Additionally, we demonstrate how, given the same quantum random walk, subtle di erencesmore » in the graph certi cate construction algorithm can nontrivially im- pact the walk's distinguishing power. We also show that no continuous-time walk of a xed number of particles can distinguish all strongly regular graphs when used in conjunction with any of the graph certi cates we consider. We extend this constraint to discrete-time walks of xed numbers of noninteracting particles for one kind of graph certi cate; it remains an open question as to whether or not this constraint applies to the other graph certi cates we consider.« less

On the Full-Discrete Extended Generalised q-Difference Toda System

NASA Astrophysics Data System (ADS)

Li, Chuanzhong; Meng, Anni

2017-08-01

In this paper, we construct a full-discrete integrable difference equation which is a full-discretisation of the generalised q-Toda equation. Meanwhile its soliton solutions are constructed to show its integrable property. Further the Lax pairs of an extended generalised full-discrete q-Toda hierarchy are also constructed. To show the integrability, the bi-Hamiltonian structure and tau symmetry of the extended full-discrete generalised q-Toda hierarchy are given.

Elegant anti-disturbance control for discrete-time stochastic systems with nonlinearity and multiple disturbances

NASA Astrophysics Data System (ADS)

Wei, Xinjiang; Sun, Shixiang

2018-03-01

An elegant anti-disturbance control (EADC) strategy for a class of discrete-time stochastic systems with both nonlinearity and multiple disturbances, which include the disturbance with partially known information and a sequence of random vectors, is proposed in this paper. A stochastic disturbance observer is constructed to estimate the disturbance with partially known information, based on which, an EADC scheme is proposed by combining pole placement and linear matrix inequality methods. It is proved that the two different disturbances can be rejected and attenuated, and the corresponding desired performances can be guaranteed for discrete-time stochastic systems with known and unknown nonlinear dynamics, respectively. Simulation examples are given to demonstrate the effectiveness of the proposed schemes compared with some existing results.

13 CFR 125.2 - What are SBA's and the procuring agency's responsibilities when providing contracting assistance...

Code of Federal Regulations, 2014 CFR

2014-01-01

... justified); is for construction and seeks to package or consolidate discrete construction projects; or if a... alternatives may include: (A) Breaking up the procurement into smaller discrete procurements, especially construction acquisitions that can be procured as separate projects; (B) Breaking out one or more discrete...

Global exponential stability of positive periodic solution of the n-species impulsive Gilpin-Ayala competition model with discrete and distributed time delays.

PubMed

Zhao, Kaihong

2018-12-01

In this paper, we study the n-species impulsive Gilpin-Ayala competition model with discrete and distributed time delays. The existence of positive periodic solution is proved by employing the fixed point theorem on cones. By constructing appropriate Lyapunov functional, we also obtain the global exponential stability of the positive periodic solution of this system. As an application, an interesting example is provided to illustrate the validity of our main results.

Numerical Evaluation of the "Dual-Kernel Counter-flow" Matric Convolution Integral that Arises in Discrete/Continuous (D/C) Control Theory

NASA Technical Reports Server (NTRS)

Nixon, Douglas D.

2009-01-01

Discrete/Continuous (D/C) control theory is a new generalized theory of discrete-time control that expands the concept of conventional (exact) discrete-time control to create a framework for design and implementation of discretetime control systems that include a continuous-time command function generator so that actuator commands need not be constant between control decisions, but can be more generally defined and implemented as functions that vary with time across sample period. Because the plant/control system construct contains two linear subsystems arranged in tandem, a novel dual-kernel counter-flow convolution integral appears in the formulation. As part of the D/C system design and implementation process, numerical evaluation of that integral over the sample period is required. Three fundamentally different evaluation methods and associated algorithms are derived for the constant-coefficient case. Numerical results are matched against three available examples that have closed-form solutions.

Factor structure and longitudinal measurement invariance of the demand control support model: an evidence from the Swedish Longitudinal Occupational Survey of Health (SLOSH).

PubMed

Chungkham, Holendro Singh; Ingre, Michael; Karasek, Robert; Westerlund, Hugo; Theorell, Töres

2013-01-01

To examine the factor structure and to evaluate the longitudinal measurement invariance of the demand-control-support questionnaire (DCSQ), using the Swedish Longitudinal Occupational Survey of Health (SLOSH). A confirmatory factor analysis (CFA) and multi-group confirmatory factor analysis (MGCFA) models within the framework of structural equation modeling (SEM) have been used to examine the factor structure and invariance across time. Four factors: psychological demand, skill discretion, decision authority and social support, were confirmed by CFA at baseline, with the best fit obtained by removing the item repetitive work of skill discretion. A measurement error correlation (0.42) between work fast and work intensively for psychological demands was also detected. Acceptable composite reliability measures were obtained except for skill discretion (0.68). The invariance of the same factor structure was established, but caution in comparing mean levels of factors over time is warranted as lack of intercept invariance was evident. However, partial intercept invariance was established for work intensively. Our findings indicate that skill discretion and decision authority represent two distinct constructs in the retained model. However removing the item repetitive work along with either work fast or work intensively would improve model fit. Care should also be taken while making comparisons in the constructs across time. Further research should investigate invariance across occupations or socio-economic classes.

Factor Structure and Longitudinal Measurement Invariance of the Demand Control Support Model: An Evidence from the Swedish Longitudinal Occupational Survey of Health (SLOSH)

PubMed Central

Chungkham, Holendro Singh; Ingre, Michael; Karasek, Robert; Westerlund, Hugo; Theorell, Töres

2013-01-01

Objectives To examine the factor structure and to evaluate the longitudinal measurement invariance of the demand-control-support questionnaire (DCSQ), using the Swedish Longitudinal Occupational Survey of Health (SLOSH). Methods A confirmatory factor analysis (CFA) and multi-group confirmatory factor analysis (MGCFA) models within the framework of structural equation modeling (SEM) have been used to examine the factor structure and invariance across time. Results Four factors: psychological demand, skill discretion, decision authority and social support, were confirmed by CFA at baseline, with the best fit obtained by removing the item repetitive work of skill discretion. A measurement error correlation (0.42) between work fast and work intensively for psychological demands was also detected. Acceptable composite reliability measures were obtained except for skill discretion (0.68). The invariance of the same factor structure was established, but caution in comparing mean levels of factors over time is warranted as lack of intercept invariance was evident. However, partial intercept invariance was established for work intensively. Conclusion Our findings indicate that skill discretion and decision authority represent two distinct constructs in the retained model. However removing the item repetitive work along with either work fast or work intensively would improve model fit. Care should also be taken while making comparisons in the constructs across time. Further research should investigate invariance across occupations or socio-economic classes. PMID:23950957

Limitations of discrete-time quantum walk on a one-dimensional infinite chain

NASA Astrophysics Data System (ADS)

Lin, Jia-Yi; Zhu, Xuanmin; Wu, Shengjun

2018-04-01

How well can we manipulate the state of a particle via a discrete-time quantum walk? We show that the discrete-time quantum walk on a one-dimensional infinite chain with coin operators that are independent of the position can only realize product operators of the form eiξ A ⊗1p, which cannot change the position state of the walker. We present a scheme to construct all possible realizations of all the product operators of the form eiξ A ⊗1p. When the coin operators are dependent on the position, we show that the translation operators on the position can not be realized via a DTQW with coin operators that are either the identity operator 1 or the Pauli operator σx.

Discrete differential geometry: The nonplanar quadrilateral mesh

NASA Astrophysics Data System (ADS)

Twining, Carole J.; Marsland, Stephen

2012-06-01

We consider the problem of constructing a discrete differential geometry defined on nonplanar quadrilateral meshes. Physical models on discrete nonflat spaces are of inherent interest, as well as being used in applications such as computation for electromagnetism, fluid mechanics, and image analysis. However, the majority of analysis has focused on triangulated meshes. We consider two approaches: discretizing the tensor calculus, and a discrete mesh version of differential forms. While these two approaches are equivalent in the continuum, we show that this is not true in the discrete case. Nevertheless, we show that it is possible to construct mesh versions of the Levi-Civita connection (and hence the tensorial covariant derivative and the associated covariant exterior derivative), the torsion, and the curvature. We show how discrete analogs of the usual vector integral theorems are constructed in such a way that the appropriate conservation laws hold exactly on the mesh, rather than only as approximations to the continuum limit. We demonstrate the success of our method by constructing a mesh version of classical electromagnetism and discuss how our formalism could be used to deal with other physical models, such as fluids.

Local bounds preserving stabilization for continuous Galerkin discretization of hyperbolic systems

NASA Astrophysics Data System (ADS)

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

2018-05-01

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

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

NASA Astrophysics Data System (ADS)

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

2016-05-01

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

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.

Input-output identification of controlled discrete manufacturing systems

NASA Astrophysics Data System (ADS)

Estrada-Vargas, Ana Paula; López-Mellado, Ernesto; Lesage, Jean-Jacques

2014-03-01

The automated construction of discrete event models from observations of external system's behaviour is addressed. This problem, often referred to as system identification, allows obtaining models of ill-known (or even unknown) systems. In this article, an identification method for discrete event systems (DESs) controlled by a programmable logic controller is presented. The method allows processing a large quantity of observed long sequences of input/output signals generated by the controller and yields an interpreted Petri net model describing the closed-loop behaviour of the automated DESs. The proposed technique allows the identification of actual complex systems because it is sufficiently efficient and well adapted to cope with both the technological characteristics of industrial controllers and data collection requirements. Based on polynomial-time algorithms, the method is implemented as an efficient software tool which constructs and draws the model automatically; an overview of this tool is given through a case study dealing with an automated manufacturing system.

A space-time discretization procedure for wave propagation problems

NASA Technical Reports Server (NTRS)

Davis, Sanford

1989-01-01

Higher order compact algorithms are developed for the numerical simulation of wave propagation by using the concept of a discrete dispersion relation. The dispersion relation is the imprint of any linear operator in space-time. The discrete dispersion relation is derived from the continuous dispersion relation by examining the process by which locally plane waves propagate through a chosen grid. The exponential structure of the discrete dispersion relation suggests an efficient splitting of convective and diffusive terms for dissipative waves. Fourth- and eighth-order convection schemes are examined that involve only three or five spatial grid points. These algorithms are subject to the same restrictions that govern the use of dispersion relations in the constructions of asymptotic expansions to nonlinear evolution equations. A new eighth-order scheme is developed that is exact for Courant numbers of 1, 2, 3, and 4. Examples are given of a pulse and step wave with a small amount of physical diffusion.

7 CFR 1753.80 - Minor construction procedure.

Code of Federal Regulations, 2010 CFR

2010-01-01

... same calendar year is limited to the following amounts for the following discrete categories of minor...) A single minor construction project may be a discrete element of a somewhat larger overall project... placement project. It cannot be a portion, by dividing into smaller segments, of a discrete major...

13 CFR 125.2 - Prime contracting assistance.

Code of Federal Regulations, 2013 CFR

2013-01-01

... participation unlikely; (ii) Seeks to package or consolidate discrete construction projects; or (iii) Meets the... participation unlikely, or if a proposed procurement for construction seeks to package or consolidate discrete... discrete projects. (5) In conjunction with their duties to promote the set-aside of procurements for small...

13 CFR 125.2 - Prime contracting assistance.

Code of Federal Regulations, 2012 CFR

2012-01-01

... participation unlikely; (ii) Seeks to package or consolidate discrete construction projects; or (iii) Meets the... participation unlikely, or if a proposed procurement for construction seeks to package or consolidate discrete... discrete projects. (5) In conjunction with their duties to promote the set-aside of procurements for small...

13 CFR 125.2 - Prime contracting assistance.

Code of Federal Regulations, 2011 CFR

2011-01-01

... participation unlikely; (ii) Seeks to package or consolidate discrete construction projects; or (iii) Meets the... participation unlikely, or if a proposed procurement for construction seeks to package or consolidate discrete... discrete projects. (5) In conjunction with their duties to promote the set-aside of procurements for small...

BioNSi: A Discrete Biological Network Simulator Tool.

PubMed

Rubinstein, Amir; Bracha, Noga; Rudner, Liat; Zucker, Noga; Sloin, Hadas E; Chor, Benny

2016-08-05

Modeling and simulation of biological networks is an effective and widely used research methodology. The Biological Network Simulator (BioNSi) is a tool for modeling biological networks and simulating their discrete-time dynamics, implemented as a Cytoscape App. BioNSi includes a visual representation of the network that enables researchers to construct, set the parameters, and observe network behavior under various conditions. To construct a network instance in BioNSi, only partial, qualitative biological data suffices. The tool is aimed for use by experimental biologists and requires no prior computational or mathematical expertise. BioNSi is freely available at http://bionsi.wix.com/bionsi , where a complete user guide and a step-by-step manual can also be found.

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.

Efficient numerical method for investigating diatomic molecules with single active electron subjected to intense and ultrashort laser fields

NASA Astrophysics Data System (ADS)

Kiss, Gellért Zsolt; Borbély, Sándor; Nagy, Ladislau

2017-12-01

We have presented here an efficient numerical approach for the ab initio numerical solution of the time-dependent Schrödinger Equation describing diatomic molecules, which interact with ultrafast laser pulses. During the construction of the model we have assumed a frozen nuclear configuration and a single active electron. In order to increase efficiency our system was described using prolate spheroidal coordinates, where the wave function was discretized using the finite-element discrete variable representation (FE-DVR) method. The discretized wave functions were efficiently propagated in time using the short-iterative Lanczos algorithm. As a first test we have studied here how the laser induced bound state dynamics in H2+ is influenced by the strength of the driving laser field.

Casing pipe damage detection with optical fiber sensors: a case study in oil well constructions

NASA Astrophysics Data System (ADS)

Zhou, Zhi; He, Jianping; Huang, Minghua; He, Jun; Ou, Jinping; Chen, Genda

2010-04-01

Casing pipes in oil well constructions may suddenly buckle inward as their inside and outside hydrostatic pressure difference increases. For the safety of construction workers and the steady development of oil industries, it is critically important to measure the stress state of a casing pipe. This study develops a rugged, real-time monitoring, and warning system that combines the distributed Brillouin Scattering Time Domain Reflectometry (BOTDR) and the discrete fiber Bragg grating (FBG) measurement. The BOTDR optical fiber sensors were embedded with no optical fiber splice joints in a fiber reinforced polymer (FRP) rebar and the FBG sensors were wrapped in epoxy resins and glass clothes, both installed during the segmental construction of casing pipes. In-situ tests indicate that the proposed sensing system and installation technique can survive the downhole driving process of casing pipes, withstand a harsh service environment, and remain in tact with the casing pipes for compatible strain measurements. The relative error of the measured strains between the distributed and discrete sensors is less than 12%. The FBG sensors successfully measured the maximum horizontal principal stress with a relative error of 6.7% in comparison with a cross multi-pole array acoustic instrument.

Improved treatment of optics in the Lindquist-Wheeler models

NASA Astrophysics Data System (ADS)

Clifton, Timothy; Ferreira, Pedro G.; O'Donnell, Kane

2012-01-01

We consider the optical properties of Lindquist-Wheeler (LW) models of the Universe. These models consist of lattices constructed from regularly arranged discrete masses. They are akin to the Wigner-Seitz construction of solid state physics, and result in a dynamical description of the large-scale Universe in which the global expansion is given by a Friedmann-like equation. We show that if these models are constructed in a particular way then the redshifts of distant objects, as well as the dynamics of the global space-time, can be made to be in good agreement with the homogeneous and isotropic Friedmann-Lemaître-Robertson-Walker (FLRW) solutions of Einstein’s equations, at the level of ≲3% out to z≃2. Angular diameter and luminosity distances, on the other hand, differ from those found in the corresponding FLRW models, while being consistent with the “empty beam” approximation, together with the shearing effects due to the nearest masses. This can be compared with the large deviations found from the corresponding FLRW values obtained in a previous study that considered LW models constructed in a different way. We therefore advocate the improved LW models we consider here as useful constructions that appear to faithfully reproduce both the dynamical and observational properties of space-times containing discrete masses.

An algebraic structure of discrete-time biaffine systems

NASA Technical Reports Server (NTRS)

Tarn, T.-J.; Nonoyama, S.

1979-01-01

New results on the realization of finite-dimensional, discrete-time, internally biaffine systems are presented in this paper. The external behavior of such systems is described by multiaffine functions and the state space is constructed via Nerode equivalence relations. We prove that the state space is an affine space. An algorithm which amounts to choosing a frame for the affine space is presented. Our algorithm reduces in the linear and bilinear case to a generalization of algorithms existing in the literature. Explicit existence criteria for span-canonical realizations as well as an affine isomorphism theorem are given.

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.

Models for discrete-time self-similar vector processes with application to network traffic

NASA Astrophysics Data System (ADS)

Lee, Seungsin; Rao, Raghuveer M.; Narasimha, Rajesh

2003-07-01

The paper defines self-similarity for vector processes by employing the discrete-time continuous-dilation operation which has successfully been used previously by the authors to define 1-D discrete-time stochastic self-similar processes. To define self-similarity of vector processes, it is required to consider the cross-correlation functions between different 1-D processes as well as the autocorrelation function of each constituent 1-D process in it. System models to synthesize self-similar vector processes are constructed based on the definition. With these systems, it is possible to generate self-similar vector processes from white noise inputs. An important aspect of the proposed models is that they can be used to synthesize various types of self-similar vector processes by choosing proper parameters. Additionally, the paper presents evidence of vector self-similarity in two-channel wireless LAN data and applies the aforementioned systems to simulate the corresponding network traffic traces.

Conservative, unconditionally stable discretization methods for Hamiltonian equations, applied to wave motion in lattice equations modeling protein molecules

NASA Astrophysics Data System (ADS)

LeMesurier, Brenton

2012-01-01

A new approach is described for generating exactly energy-momentum conserving time discretizations for a wide class of Hamiltonian systems of DEs with quadratic momenta, including mechanical systems with central forces; it is well-suited in particular to the large systems that arise in both spatial discretizations of nonlinear wave equations and lattice equations such as the Davydov System modeling energetic pulse propagation in protein molecules. The method is unconditionally stable, making it well-suited to equations of broadly “Discrete NLS form”, including many arising in nonlinear optics. Key features of the resulting discretizations are exact conservation of both the Hamiltonian and quadratic conserved quantities related to continuous linear symmetries, preservation of time reversal symmetry, unconditional stability, and respecting the linearity of certain terms. The last feature allows a simple, efficient iterative solution of the resulting nonlinear algebraic systems that retain unconditional stability, avoiding the need for full Newton-type solvers. One distinction from earlier work on conservative discretizations is a new and more straightforward nearly canonical procedure for constructing the discretizations, based on a “discrete gradient calculus with product rule” that mimics the essential properties of partial derivatives. This numerical method is then used to study the Davydov system, revealing that previously conjectured continuum limit approximations by NLS do not hold, but that sech-like pulses related to NLS solitons can nevertheless sometimes arise.

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

NASA Technical Reports Server (NTRS)

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

1990-01-01

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

Discrete-time Quantum Walks via Interchange Framework and Memory in Quantum Evolution

NASA Astrophysics Data System (ADS)

Dimcovic, Zlatko

One of the newer and rapidly developing approaches in quantum computing is based on "quantum walks," which are quantum processes on discrete space that evolve in either discrete or continuous time and are characterized by mixing of components at each step. The idea emerged in analogy with the classical random walks and stochastic techniques, but these unitary processes are very different even as they have intriguing similarities. This thesis is concerned with study of discrete-time quantum walks. The original motivation from classical Markov chains required for discrete-time quantum walks that one adds an auxiliary Hilbert space, unrelated to the one in which the system evolves, in order to be able to mix components in that space and then take the evolution steps accordingly (based on the state in that space). This additional, "coin," space is very often an internal degree of freedom like spin. We have introduced a general framework for construction of discrete-time quantum walks in a close analogy with the classical random walks with memory that is rather different from the standard "coin" approach. In this method there is no need to bring in a different degree of freedom, while the full state of the system is still described in the direct product of spaces (of states). The state can be thought of as an arrow pointing from the previous to the current site in the evolution, representing the one-step memory. The next step is then controlled by a single local operator assigned to each site in the space, acting quite like a scattering operator. This allows us to probe and solve some problems of interest that have not had successful approaches with "coined" walks. We construct and solve a walk on the binary tree, a structure of great interest but until our result without an explicit discrete time quantum walk, due to difficulties in managing coin spaces necessary in the standard approach. Beyond algorithmic interests, the model based on memory allows one to explore effects of history on the quantum evolution and the subtle emergence of classical features as "memory" is explicitly kept for additional steps. We construct and solve a walk with an additional correlation step, finding interesting new features. On the other hand, the fact that the evolution is driven entirely by a local operator, not involving additional spaces, enables us to choose the Fourier transform as an operator completely controlling the evolution. This in turn allows us to combine the quantum walk approach with Fourier transform based techniques, something decidedly not possible in classical computational physics. We are developing a formalism for building networks manageable by walks constructed with this framework, based on the surprising efficiency of our framework in discovering internals of a simple network that we so far solved. Finally, in line with our expectation that the field of quantum walks can take cues from the rich history of development of the classical stochastic techniques, we establish starting points for the work on non-Abelian quantum walks, with a particular quantum-walk analog of the classical "card shuffling," the walk on the permutation group. In summary, this thesis presents a new framework for construction of discrete time quantum walks, employing and exploring memoried nature of unitary evolution. It is applied to fully solving the problems of: A walk on the binary tree and exploration of the quantum-to-classical transition with increased correlation length (history). It is then used for simple network discovery, and to lay the groundwork for analysis of complex networks, based on combined power of efficient exploration of the Hilbert space (as a walk mixing components) and Fourier transformation (since we can choose this for the evolution operator). We hope to establish this as a general technique as its power would be unmatched by any approaches available in the classical computing. We also looked at the promising and challenging prospect of walks on non-Abelian structures by setting up the problem of "quantum card shuffling," a quantum walk on the permutation group. Relation to other work is thoroughly discussed throughout, along with examination of the context of our work and overviews of our current and future work.

Global Discrete Artificial Boundary Conditions for Time-Dependent Wave Propagation

NASA Technical Reports Server (NTRS)

Ryabenkii, V. S.; Tsynkov, S. V.; Turchaninov, V. I.; Bushnell, Dennis M. (Technical Monitor)

2001-01-01

We construct global artificial boundary conditions (ABCs) for the numerical simulation of wave processes on unbounded domains using a special non-deteriorating algorithm that has been developed previously for the long-term computation of wave-radiation solutions. The ABCs are obtained directly for the discrete formulation of the problem; in so doing, neither a rational approximation of 'non-reflecting kernels,' nor discretization of the continuous boundary conditions is required. The extent of temporal nonlocality of the new ABCs appears fixed and limited; in addition, the ABCs can handle artificial boundaries of irregular shape on regular grids with no fitting/adaptation needed and no accuracy loss induced. The non-deteriorating algorithm, which is the core of the new ABCs is inherently three-dimensional, it guarantees temporally uniform grid convergence of the solution driven by a continuously operating source on arbitrarily long time intervals, and provides unimprovable linear computational complexity with respect to the grid dimension. The algorithm is based on the presence of lacunae, i.e., aft fronts of the waves, in wave-type solutions in odd-dimension spaces, It can, in fact, be built as a modification on top of any consistent and stable finite-difference scheme, making its grid convergence uniform in time and at the same time keeping the rate of convergence the same as that of the non-modified scheme. In the paper, we delineate the construction of the global lacunae-based ABCs in the framework of a discretized wave equation. The ABCs are obtained for the most general formulation of the problem that involves radiation of waves by moving sources (e.g., radiation of acoustic waves by a maneuvering aircraft). We also present systematic numerical results that corroborate the theoretical design properties of the ABCs' algorithm.

Global Discrete Artificial Boundary Conditions for Time-Dependent Wave Propagation

NASA Astrophysics Data System (ADS)

Ryaben'kii, V. S.; Tsynkov, S. V.; Turchaninov, V. I.

2001-12-01

We construct global artificial boundary conditions (ABCs) for the numerical simulation of wave processes on unbounded domains using a special nondeteriorating algorithm that has been developed previously for the long-term computation of wave-radiation solutions. The ABCs are obtained directly for the discrete formulation of the problem; in so doing, neither a rational approximation of “nonreflecting kernels” nor discretization of the continuous boundary conditions is required. The extent of temporal nonlocality of the new ABCs appears fixed and limited; in addition, the ABCs can handle artificial boundaries of irregular shape on regular grids with no fitting/adaptation needed and no accuracy loss induced. The nondeteriorating algorithm, which is the core of the new ABCs, is inherently three-dimensional, it guarantees temporally uniform grid convergence of the solution driven by a continuously operating source on arbitrarily long time intervals and provides unimprovable linear computational complexity with respect to the grid dimension. The algorithm is based on the presence of lacunae, i.e., aft fronts of the waves, in wave-type solutions in odd-dimensional spaces. It can, in fact, be built as a modification on top of any consistent and stable finite-difference scheme, making its grid convergence uniform in time and at the same time keeping the rate of convergence the same as that of the unmodified scheme. In this paper, we delineate the construction of the global lacunae-based ABCs in the framework of a discretized wave equation. The ABCs are obtained for the most general formulation of the problem that involves radiation of waves by moving sources (e.g., radiation of acoustic waves by a maneuvering aircraft). We also present systematic numerical results that corroborate the theoretical design properties of the ABC algorithm.

Simulations of incompressible Navier Stokes equations on curved surfaces using discrete exterior calculus

NASA Astrophysics Data System (ADS)

Samtaney, Ravi; Mohamed, Mamdouh; Hirani, Anil

2015-11-01

We present examples of numerical solutions of incompressible flow on 2D curved domains. The Navier-Stokes equations are first rewritten using the exterior calculus notation, replacing vector calculus differential operators by the exterior derivative, Hodge star and wedge product operators. A conservative discretization of Navier-Stokes equations on simplicial meshes is developed based on discrete exterior calculus (DEC). The discretization is then carried out by substituting the corresponding discrete operators based on the DEC framework. By construction, the method is conservative in that both the discrete divergence and circulation are conserved up to machine precision. The relative error in kinetic energy for inviscid flow test cases converges in a second order fashion with both the mesh size and the time step. Numerical examples include Taylor vortices on a sphere, Stuart vortices on a sphere, and flow past a cylinder on domains with varying curvature. Supported by the KAUST Office of Competitive Research Funds under Award No. URF/1/1401-01.

An Improved Method for Real-Time 3D Construction of DTM

NASA Astrophysics Data System (ADS)

Wei, Yi

This paper discusses the real-time optimal construction of DTM by two measures. One is to improve coordinate transformation of discrete points acquired from lidar, after processing a total number of 10000 data points, the formula calculation for transformation costs 0.810s, while the table look-up method for transformation costs 0.188s, indicating that the latter is superior to the former. The other one is to adjust the density of the point cloud acquired from lidar, the certain amount of the data points are used for 3D construction in proper proportion in order to meet different needs for 3D imaging, and ultimately increase efficiency of DTM construction while saving system resources.

Entropy-conservative spatial discretization of the multidimensional quasi-gasdynamic system of equations

NASA Astrophysics Data System (ADS)

Zlotnik, A. A.

2017-04-01

The multidimensional quasi-gasdynamic system written in the form of mass, momentum, and total energy balance equations for a perfect polytropic gas with allowance for a body force and a heat source is considered. A new conservative symmetric spatial discretization of these equations on a nonuniform rectangular grid is constructed (with the basic unknown functions—density, velocity, and temperature—defined on a common grid and with fluxes and viscous stresses defined on staggered grids). Primary attention is given to the analysis of entropy behavior: the discretization is specially constructed so that the total entropy does not decrease. This is achieved via a substantial revision of the standard discretization and applying numerous original features. A simplification of the constructed discretization serves as a conservative discretization with nondecreasing total entropy for the simpler quasi-hydrodynamic system of equations. In the absence of regularizing terms, the results also hold for the Navier-Stokes equations of a viscous compressible heat-conducting gas.

Functional entropy variables: A new methodology for deriving thermodynamically consistent algorithms for complex fluids, with particular reference to the isothermal Navier–Stokes–Korteweg equations

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

Liu, Ju, E-mail: jliu@ices.utexas.edu; Gomez, Hector; Evans, John A.

2013-09-01

We propose a new methodology for the numerical solution of the isothermal Navier–Stokes–Korteweg equations. Our methodology is based on a semi-discrete Galerkin method invoking functional entropy variables, a generalization of classical entropy variables, and a new time integration scheme. We show that the resulting fully discrete scheme is unconditionally stable-in-energy, second-order time-accurate, and mass-conservative. We utilize isogeometric analysis for spatial discretization and verify the aforementioned properties by adopting the method of manufactured solutions and comparing coarse mesh solutions with overkill solutions. Various problems are simulated to show the capability of the method. Our methodology provides a means of constructing unconditionallymore » stable numerical schemes for nonlinear non-convex hyperbolic systems of conservation laws.« less

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.

Classical integrable defects as quasi Bäcklund transformations

NASA Astrophysics Data System (ADS)

Doikou, Anastasia

2016-10-01

We consider the algebraic setting of classical defects in discrete and continuous integrable theories. We derive the ;equations of motion; on the defect point via the space-like and time-like description. We then exploit the structural similarity of these equations with the discrete and continuous Bäcklund transformations. And although these equations are similar they are not exactly the same to the Bäcklund transformations. We also consider specific examples of integrable models to demonstrate our construction, i.e. the Toda chain and the sine-Gordon model. The equations of the time (space) evolution of the defect (discontinuity) degrees of freedom for these models are explicitly derived.

A mass-energy preserving Galerkin FEM for the coupled nonlinear fractional Schrödinger equations

NASA Astrophysics Data System (ADS)

Zhang, Guoyu; Huang, Chengming; Li, Meng

2018-04-01

We consider the numerical simulation of the coupled nonlinear space fractional Schrödinger equations. Based on the Galerkin finite element method in space and the Crank-Nicolson (CN) difference method in time, a fully discrete scheme is constructed. Firstly, we focus on a rigorous analysis of conservation laws for the discrete system. The definitions of discrete mass and energy here correspond with the original ones in physics. Then, we prove that the fully discrete system is uniquely solvable. Moreover, we consider the unconditionally convergent properties (that is to say, we complete the error estimates without any mesh ratio restriction). We derive L2-norm error estimates for the nonlinear equations and L^{∞}-norm error estimates for the linear equations. Finally, some numerical experiments are included showing results in agreement with the theoretical predictions.

Implementation Strategies for Large-Scale Transport Simulations Using Time Domain Particle Tracking

NASA Astrophysics Data System (ADS)

Painter, S.; Cvetkovic, V.; Mancillas, J.; Selroos, J.

2008-12-01

Time domain particle tracking is an emerging alternative to the conventional random walk particle tracking algorithm. With time domain particle tracking, particles are moved from node to node on one-dimensional pathways defined by streamlines of the groundwater flow field or by discrete subsurface features. The time to complete each deterministic segment is sampled from residence time distributions that include the effects of advection, longitudinal dispersion, a variety of kinetically controlled retention (sorption) processes, linear transformation, and temporal changes in groundwater velocities and sorption parameters. The simulation results in a set of arrival times at a monitoring location that can be post-processed with a kernel method to construct mass discharge (breakthrough) versus time. Implementation strategies differ for discrete flow (fractured media) systems and continuous porous media systems. The implementation strategy also depends on the scale at which hydraulic property heterogeneity is represented in the supporting flow model. For flow models that explicitly represent discrete features (e.g., discrete fracture networks), the sampling of residence times along segments is conceptually straightforward. For continuous porous media, such sampling needs to be related to the Lagrangian velocity field. Analytical or semi-analytical methods may be used to approximate the Lagrangian segment velocity distributions in aquifers with low-to-moderate variability, thereby capturing transport effects of subgrid velocity variability. If variability in hydraulic properties is large, however, Lagrangian velocity distributions are difficult to characterize and numerical simulations are required; in particular, numerical simulations are likely to be required for estimating the velocity integral scale as a basis for advective segment distributions. Aquifers with evolving heterogeneity scales present additional challenges. Large-scale simulations of radionuclide transport at two potential repository sites for high-level radioactive waste will be used to demonstrate the potential of the method. The simulations considered approximately 1000 source locations, multiple radionuclides with contrasting sorption properties, and abrupt changes in groundwater velocity associated with future glacial scenarios. Transport pathways linking the source locations to the accessible environment were extracted from discrete feature flow models that include detailed representations of the repository construction (tunnels, shafts, and emplacement boreholes) embedded in stochastically generated fracture networks. Acknowledgment The authors are grateful to SwRI Advisory Committee for Research, the Swedish Nuclear Fuel and Waste Management Company, and Posiva Oy for financial support.

Diagnosis of delay-deadline failures in real time discrete event models.

PubMed

Biswas, Santosh; Sarkar, Dipankar; Bhowal, Prodip; Mukhopadhyay, Siddhartha

2007-10-01

In this paper a method for fault detection and diagnosis (FDD) of real time systems has been developed. A modeling framework termed as real time discrete event system (RTDES) model is presented and a mechanism for FDD of the same has been developed. The use of RTDES framework for FDD is an extension of the works reported in the discrete event system (DES) literature, which are based on finite state machines (FSM). FDD of RTDES models are suited for real time systems because of their capability of representing timing faults leading to failures in terms of erroneous delays and deadlines, which FSM-based ones cannot address. The concept of measurement restriction of variables is introduced for RTDES and the consequent equivalence of states and indistinguishability of transitions have been characterized. Faults are modeled in terms of an unmeasurable condition variable in the state map. Diagnosability is defined and the procedure of constructing a diagnoser is provided. A checkable property of the diagnoser is shown to be a necessary and sufficient condition for diagnosability. The methodology is illustrated with an example of a hydraulic cylinder.

Asymptotic analysis of discrete schemes for non-equilibrium radiation diffusion

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

Cui, Xia, E-mail: cui_xia@iapcm.ac.cn; Yuan, Guang-wei; Shen, Zhi-jun

Motivated by providing well-behaved fully discrete schemes in practice, this paper extends the asymptotic analysis on time integration methods for non-equilibrium radiation diffusion in [2] to space discretizations. Therein studies were carried out on a two-temperature model with Larsen's flux-limited diffusion operator, both the implicitly balanced (IB) and linearly implicit (LI) methods were shown asymptotic-preserving. In this paper, we focus on asymptotic analysis for space discrete schemes in dimensions one and two. First, in construction of the schemes, in contrast to traditional first-order approximations, asymmetric second-order accurate spatial approximations are devised for flux-limiters on boundary, and discrete schemes with second-ordermore » accuracy on global spatial domain are acquired consequently. Then by employing formal asymptotic analysis, the first-order asymptotic-preserving property for these schemes and furthermore for the fully discrete schemes is shown. Finally, with the help of manufactured solutions, numerical tests are performed, which demonstrate quantitatively the fully discrete schemes with IB time evolution indeed have the accuracy and asymptotic convergence as theory predicts, hence are well qualified for both non-equilibrium and equilibrium radiation diffusion. - Highlights: • Provide AP fully discrete schemes for non-equilibrium radiation diffusion. • Propose second order accurate schemes by asymmetric approach for boundary flux-limiter. • Show first order AP property of spatially and fully discrete schemes with IB evolution. • Devise subtle artificial solutions; verify accuracy and AP property quantitatively. • Ideas can be generalized to 3-dimensional problems and higher order implicit schemes.« less

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

NASA Astrophysics Data System (ADS)

Cao, Mengjuan; Liao, Fucheng

2015-04-01

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

Gibbsian Stationary Non-equilibrium States

NASA Astrophysics Data System (ADS)

De Carlo, Leonardo; Gabrielli, Davide

2017-09-01

We study the structure of stationary non-equilibrium states for interacting particle systems from a microscopic viewpoint. In particular we discuss two different discrete geometric constructions. We apply both of them to determine non reversible transition rates corresponding to a fixed invariant measure. The first one uses the equivalence of this problem with the construction of divergence free flows on the transition graph. Since divergence free flows are characterized by cyclic decompositions we can generate families of models from elementary cycles on the configuration space. The second construction is a functional discrete Hodge decomposition for translational covariant discrete vector fields. According to this, for example, the instantaneous current of any interacting particle system on a finite torus can be canonically decomposed in a gradient part, a circulation term and an harmonic component. All the three components are associated with functions on the configuration space. This decomposition is unique and constructive. The stationary condition can be interpreted as an orthogonality condition with respect to an harmonic discrete vector field and we use this decomposition to construct models having a fixed invariant measure.

The multiscale expansions of difference equations in the small lattice spacing regime, and a vicinity and integrability test: I

NASA Astrophysics Data System (ADS)

Santini, Paolo Maria

2010-01-01

We propose an algorithmic procedure (i) to study the 'distance' between an integrable PDE and any discretization of it, in the small lattice spacing epsilon regime, and, at the same time, (ii) to test the (asymptotic) integrability properties of such discretization. This method should provide, in particular, useful and concrete information on how good is any numerical scheme used to integrate a given integrable PDE. The procedure, illustrated on a fairly general ten-parameter family of discretizations of the nonlinear Schrödinger equation, consists of the following three steps: (i) the construction of the continuous multiscale expansion of a generic solution of the discrete system at all orders in epsilon, following Degasperis et al (1997 Physica D 100 187-211) (ii) the application, to such an expansion, of the Degasperis-Procesi (DP) integrability test (Degasperis A and Procesi M 1999 Asymptotic integrability Symmetry and Perturbation Theory, SPT98, ed A Degasperis and G Gaeta (Singapore: World Scientific) pp 23-37 Degasperis A 2001 Multiscale expansion and integrability of dispersive wave equations Lectures given at the Euro Summer School: 'What is integrability?' (Isaac Newton Institute, Cambridge, UK, 13-24 August); Integrability (Lecture Notes in Physics vol 767) ed A Mikhailov (Berlin: Springer)), to test the asymptotic integrability properties of the discrete system and its 'distance' from its continuous limit; (iii) the use of the main output of the DP test to construct infinitely many approximate symmetries and constants of motion of the discrete system, through novel and simple formulas.

Four-level conservative finite-difference schemes for Boussinesq paradigm equation

NASA Astrophysics Data System (ADS)

Kolkovska, N.

2013-10-01

In this paper a two-parametric family of four level conservative finite difference schemes is constructed for the multidimensional Boussinesq paradigm equation. The schemes are explicit in the sense that no inner iterations are needed for evaluation of the numerical solution. The preservation of the discrete energy with this method is proved. The schemes have been numerically tested on one soliton propagation model and two solitons interaction model. The numerical experiments demonstrate that the proposed family of schemes has second order of convergence in space and time steps in the discrete maximal norm.

A New Minimum Trees-Based Approach for Shape Matching with Improved Time Computing: Application to Graphical Symbols Recognition

NASA Astrophysics Data System (ADS)

Franco, Patrick; Ogier, Jean-Marc; Loonis, Pierre; Mullot, Rémy

Recently we have developed a model for shape description and matching. Based on minimum spanning trees construction and specifics stages like the mixture, it seems to have many desirable properties. Recognition invariance in front shift, rotated and noisy shape was checked through median scale tests related to GREC symbol reference database. Even if extracting the topology of a shape by mapping the shortest path connecting all the pixels seems to be powerful, the construction of graph induces an expensive algorithmic cost. In this article we discuss on the ways to reduce time computing. An alternative solution based on image compression concepts is provided and evaluated. The model no longer operates in the image space but in a compact space, namely the Discrete Cosine space. The use of block discrete cosine transform is discussed and justified. The experimental results led on the GREC2003 database show that the proposed method is characterized by a good discrimination power, a real robustness to noise with an acceptable time computing.

Quantum trilogy: discrete Toda, Y-system and chaos

NASA Astrophysics Data System (ADS)

Yamazaki, Masahito

2018-02-01

We discuss a discretization of the quantum Toda field theory associated with a semisimple finite-dimensional Lie algebra or a tamely-laced infinite-dimensional Kac-Moody algebra G, generalizing the previous construction of discrete quantum Liouville theory for the case G  =  A 1. The model is defined on a discrete two-dimensional lattice, whose spatial direction is of length L. In addition we also find a ‘discretized extra dimension’ whose width is given by the rank r of G, which decompactifies in the large r limit. For the case of G  =  A N or AN-1(1) , we find a symmetry exchanging L and N under appropriate spatial boundary conditions. The dynamical time evolution rule of the model is quantizations of the so-called Y-system, and the theory can be well described by the quantum cluster algebra. We discuss possible implications for recent discussions of quantum chaos, and comment on the relation with the quantum higher Teichmüller theory of type A N .

The modified semi-discrete two-dimensional Toda lattice with self-consistent sources

NASA Astrophysics Data System (ADS)

Gegenhasi

2017-07-01

In this paper, we derive the Grammian determinant solutions to the modified semi-discrete two-dimensional Toda lattice equation, and then construct the semi-discrete two-dimensional Toda lattice equation with self-consistent sources via source generation procedure. The algebraic structure of the resulting coupled modified differential-difference equation is clarified by presenting its Grammian determinant solutions and Casorati determinant solutions. As an application of the Grammian determinant and Casorati determinant solution, the explicit one-soliton and two-soliton solution of the modified semi-discrete two-dimensional Toda lattice equation with self-consistent sources are given. We also construct another form of the modified semi-discrete two-dimensional Toda lattice equation with self-consistent sources which is the Bäcklund transformation for the semi-discrete two-dimensional Toda lattice equation with self-consistent sources.

The discrete prolate spheroidal filter as a digital signal processing tool

NASA Technical Reports Server (NTRS)

Mathews, J. D.; Breakall, J. K.; Karawas, G. K.

1983-01-01

The discrete prolate spheriodall (DPS) filter is one of the glass of nonrecursive finite impulse response (FIR) filters. The DPS filter is superior to other filters in this class in that it has maximum energy concentration in the frequency passband and minimum ringing in the time domain. A mathematical development of the DPS filter properties is given, along with information required to construct the filter. The properties of this filter were compared with those of the more commonly used filters of the same class. Use of the DPS filter allows for particularly meaningful statements of data time/frequency resolution cell values. The filter forms an especially useful tool for digital signal processing.

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.

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

PubMed

Liu, Yan-Jun; Tong, Shaocheng

2015-03-01

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

Numerical computation of transonic flows by finite-element and finite-difference methods

NASA Technical Reports Server (NTRS)

Hafez, M. M.; Wellford, L. C.; Merkle, C. L.; Murman, E. M.

1978-01-01

Studies on applications of the finite element approach to transonic flow calculations are reported. Different discretization techniques of the differential equations and boundary conditions are compared. Finite element analogs of Murman's mixed type finite difference operators for small disturbance formulations were constructed and the time dependent approach (using finite differences in time and finite elements in space) was examined.

Data approximation using a blending type spline construction

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

Dalmo, Rune; Bratlie, Jostein

2014-11-18

Generalized expo-rational B-splines (GERBS) is a blending type spline construction where local functions at each knot are blended together by C{sup k}-smooth basis functions. One way of approximating discrete regular data using GERBS is by partitioning the data set into subsets and fit a local function to each subset. Partitioning and fitting strategies can be devised such that important or interesting data points are interpolated in order to preserve certain features. We present a method for fitting discrete data using a tensor product GERBS construction. The method is based on detection of feature points using differential geometry. Derivatives, which aremore » necessary for feature point detection and used to construct local surface patches, are approximated from the discrete data using finite differences.« less

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.

Generalized chaos synchronization theorems for bidirectional differential equations and discrete systems with applications

NASA Astrophysics Data System (ADS)

Ji, Ye; Liu, Ting; Min, Lequan

2008-05-01

Two constructive generalized chaos synchronization (GCS) theorems for bidirectional differential equations and discrete systems are introduced. Using the two theorems, one can construct new chaos systems to make the system variables be in GCS. Five examples are presented to illustrate the effectiveness of the theoretical results.

Finite Volume Element (FVE) discretization and multilevel solution of the axisymmetric heat equation

NASA Astrophysics Data System (ADS)

Litaker, Eric T.

1994-12-01

The axisymmetric heat equation, resulting from a point-source of heat applied to a metal block, is solved numerically; both iterative and multilevel solutions are computed in order to compare the two processes. The continuum problem is discretized in two stages: finite differences are used to discretize the time derivatives, resulting is a fully implicit backward time-stepping scheme, and the Finite Volume Element (FVE) method is used to discretize the spatial derivatives. The application of the FVE method to a problem in cylindrical coordinates is new, and results in stencils which are analyzed extensively. Several iteration schemes are considered, including both Jacobi and Gauss-Seidel; a thorough analysis of these schemes is done, using both the spectral radii of the iteration matrices and local mode analysis. Using this discretization, a Gauss-Seidel relaxation scheme is used to solve the heat equation iteratively. A multilevel solution process is then constructed, including the development of intergrid transfer and coarse grid operators. Local mode analysis is performed on the components of the amplification matrix, resulting in the two-level convergence factors for various combinations of the operators. A multilevel solution process is implemented by using multigrid V-cycles; the iterative and multilevel results are compared and discussed in detail. The computational savings resulting from the multilevel process are then discussed.

Integrable structure in discrete shell membrane theory

PubMed Central

Schief, W. K.

2014-01-01

We present natural discrete analogues of two integrable classes of shell membranes. By construction, these discrete shell membranes are in equilibrium with respect to suitably chosen internal stresses and external forces. The integrability of the underlying equilibrium equations is proved by relating the geometry of the discrete shell membranes to discrete O surface theory. We establish connections with generalized barycentric coordinates and nine-point centres and identify a discrete version of the classical Gauss equation of surface theory. PMID:24808755

Integrable structure in discrete shell membrane theory.

PubMed

Schief, W K

2014-05-08

We present natural discrete analogues of two integrable classes of shell membranes. By construction, these discrete shell membranes are in equilibrium with respect to suitably chosen internal stresses and external forces. The integrability of the underlying equilibrium equations is proved by relating the geometry of the discrete shell membranes to discrete O surface theory. We establish connections with generalized barycentric coordinates and nine-point centres and identify a discrete version of the classical Gauss equation of surface theory.

Upon Generating Discrete Expanding Integrable Models of the Toda Lattice Systems and Infinite Conservation Laws

NASA Astrophysics Data System (ADS)

Zhang, Yufeng; Zhang, Xiangzhi; Wang, Yan; Liu, Jiangen

2017-01-01

With the help of R-matrix approach, we present the Toda lattice systems that have extensive applications in statistical physics and quantum physics. By constructing a new discrete integrable formula by R-matrix, the discrete expanding integrable models of the Toda lattice systems and their Lax pairs are generated, respectively. By following the constructing formula again, we obtain the corresponding (2+1)-dimensional Toda lattice systems and their Lax pairs, as well as their (2+1)-dimensional discrete expanding integrable models. Finally, some conservation laws of a (1+1)-dimensional generalised Toda lattice system and a new (2+1)-dimensional lattice system are generated, respectively.

Essentially Entropic Lattice Boltzmann Model

NASA Astrophysics Data System (ADS)

Atif, Mohammad; Kolluru, Praveen Kumar; Thantanapally, Chakradhar; Ansumali, Santosh

2017-12-01

The entropic lattice Boltzmann model (ELBM), a discrete space-time kinetic theory for hydrodynamics, ensures nonlinear stability via the discrete time version of the second law of thermodynamics (the H theorem). Compliance with the H theorem is numerically enforced in this methodology and involves a search for the maximal discrete path length corresponding to the zero dissipation state by iteratively solving a nonlinear equation. We demonstrate that an exact solution for the path length can be obtained by assuming a natural criterion of negative entropy change, thereby reducing the problem to solving an inequality. This inequality is solved by creating a new framework for construction of Padé approximants via quadrature on appropriate convex function. This exact solution also resolves the issue of indeterminacy in case of nonexistence of the entropic involution step. Since our formulation is devoid of complex mathematical library functions, the computational cost is drastically reduced. To illustrate this, we have simulated a model setup of flow over the NACA-0012 airfoil at a Reynolds number of 2.88 ×106.

A scalable block-preconditioning strategy for divergence-conforming B-spline discretizations of the Stokes problem

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

Cortes, Adriano M.; Dalcin, Lisandro; Sarmiento, Adel F.

The recently introduced divergence-conforming B-spline discretizations allow the construction of smooth discrete velocity–pressure pairs for viscous incompressible flows that are at the same time inf–sup stable and pointwise divergence-free. When applied to the discretized Stokes problem, these spaces generate a symmetric and indefinite saddle-point linear system. The iterative method of choice to solve such system is the Generalized Minimum Residual Method. This method lacks robustness, and one remedy is to use preconditioners. For linear systems of saddle-point type, a large family of preconditioners can be obtained by using a block factorization of the system. In this paper, we show howmore » the nesting of “black-box” solvers and preconditioners can be put together in a block triangular strategy to build a scalable block preconditioner for the Stokes system discretized by divergence-conforming B-splines. Lastly, besides the known cavity flow problem, we used for benchmark flows defined on complex geometries: an eccentric annulus and hollow torus of an eccentric annular cross-section.« less

A scalable block-preconditioning strategy for divergence-conforming B-spline discretizations of the Stokes problem

DOE PAGES

Cortes, Adriano M.; Dalcin, Lisandro; Sarmiento, Adel F.; ...

2016-10-19

The recently introduced divergence-conforming B-spline discretizations allow the construction of smooth discrete velocity–pressure pairs for viscous incompressible flows that are at the same time inf–sup stable and pointwise divergence-free. When applied to the discretized Stokes problem, these spaces generate a symmetric and indefinite saddle-point linear system. The iterative method of choice to solve such system is the Generalized Minimum Residual Method. This method lacks robustness, and one remedy is to use preconditioners. For linear systems of saddle-point type, a large family of preconditioners can be obtained by using a block factorization of the system. In this paper, we show howmore » the nesting of “black-box” solvers and preconditioners can be put together in a block triangular strategy to build a scalable block preconditioner for the Stokes system discretized by divergence-conforming B-splines. Lastly, besides the known cavity flow problem, we used for benchmark flows defined on complex geometries: an eccentric annulus and hollow torus of an eccentric annular cross-section.« less

The arbitrary order mimetic finite difference method for a diffusion equation with a non-symmetric diffusion tensor

NASA Astrophysics Data System (ADS)

Gyrya, V.; Lipnikov, K.

2017-11-01

We present the arbitrary order mimetic finite difference (MFD) discretization for the diffusion equation with non-symmetric tensorial diffusion coefficient in a mixed formulation on general polygonal meshes. The diffusion tensor is assumed to be positive definite. The asymmetry of the diffusion tensor requires changes to the standard MFD construction. We present new approach for the construction that guarantees positive definiteness of the non-symmetric mass matrix in the space of discrete velocities. The numerically observed convergence rate for the scalar quantity matches the predicted one in the case of the lowest order mimetic scheme. For higher orders schemes, we observed super-convergence by one order for the scalar variable which is consistent with the previously published result for a symmetric diffusion tensor. The new scheme was also tested on a time-dependent problem modeling the Hall effect in the resistive magnetohydrodynamics.

The arbitrary order mimetic finite difference method for a diffusion equation with a non-symmetric diffusion tensor

DOE PAGES

Gyrya, V.; Lipnikov, K.

2017-07-18

Here, we present the arbitrary order mimetic finite difference (MFD) discretization for the diffusion equation with non-symmetric tensorial diffusion coefficient in a mixed formulation on general polygonal meshes. The diffusion tensor is assumed to be positive definite. The asymmetry of the diffusion tensor requires changes to the standard MFD construction. We also present new approach for the construction that guarantees positive definiteness of the non-symmetric mass matrix in the space of discrete velocities. The numerically observed convergence rate for the scalar quantity matches the predicted one in the case of the lowest order mimetic scheme. For higher orders schemes, wemore » observed super-convergence by one order for the scalar variable which is consistent with the previously published result for a symmetric diffusion tensor. The new scheme was also tested on a time-dependent problem modeling the Hall effect in the resistive magnetohydrodynamics.« less

The arbitrary order mimetic finite difference method for a diffusion equation with a non-symmetric diffusion tensor

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

Gyrya, V.; Lipnikov, K.

Here, we present the arbitrary order mimetic finite difference (MFD) discretization for the diffusion equation with non-symmetric tensorial diffusion coefficient in a mixed formulation on general polygonal meshes. The diffusion tensor is assumed to be positive definite. The asymmetry of the diffusion tensor requires changes to the standard MFD construction. We also present new approach for the construction that guarantees positive definiteness of the non-symmetric mass matrix in the space of discrete velocities. The numerically observed convergence rate for the scalar quantity matches the predicted one in the case of the lowest order mimetic scheme. For higher orders schemes, wemore » observed super-convergence by one order for the scalar variable which is consistent with the previously published result for a symmetric diffusion tensor. The new scheme was also tested on a time-dependent problem modeling the Hall effect in the resistive magnetohydrodynamics.« less

An algebraic method for constructing stable and consistent autoregressive filters

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

Harlim, John, E-mail: jharlim@psu.edu; Department of Meteorology, the Pennsylvania State University, University Park, PA 16802; Hong, Hoon, E-mail: hong@ncsu.edu

2015-02-15

In this paper, we introduce an algebraic method to construct stable and consistent univariate autoregressive (AR) models of low order for filtering and predicting nonlinear turbulent signals with memory depth. By stable, we refer to the classical stability condition for the AR model. By consistent, we refer to the classical consistency constraints of Adams–Bashforth methods of order-two. One attractive feature of this algebraic method is that the model parameters can be obtained without directly knowing any training data set as opposed to many standard, regression-based parameterization methods. It takes only long-time average statistics as inputs. The proposed method provides amore » discretization time step interval which guarantees the existence of stable and consistent AR model and simultaneously produces the parameters for the AR models. In our numerical examples with two chaotic time series with different characteristics of decaying time scales, we find that the proposed AR models produce significantly more accurate short-term predictive skill and comparable filtering skill relative to the linear regression-based AR models. These encouraging results are robust across wide ranges of discretization times, observation times, and observation noise variances. Finally, we also find that the proposed model produces an improved short-time prediction relative to the linear regression-based AR-models in forecasting a data set that characterizes the variability of the Madden–Julian Oscillation, a dominant tropical atmospheric wave pattern.« less

Chaos control in delayed phase space constructed by the Takens embedding theory

NASA Astrophysics Data System (ADS)

Hajiloo, R.; Salarieh, H.; Alasty, A.

2018-01-01

In this paper, the problem of chaos control in discrete-time chaotic systems with unknown governing equations and limited measurable states is investigated. Using the time-series of only one measurable state, an algorithm is proposed to stabilize unstable fixed points. The approach consists of three steps: first, using Takens embedding theory, a delayed phase space preserving the topological characteristics of the unknown system is reconstructed. Second, a dynamic model is identified by recursive least squares method to estimate the time-series data in the delayed phase space. Finally, based on the reconstructed model, an appropriate linear delayed feedback controller is obtained for stabilizing unstable fixed points of the system. Controller gains are computed using a systematic approach. The effectiveness of the proposed algorithm is examined by applying it to the generalized hyperchaotic Henon system, prey-predator population map, and the discrete-time Lorenz system.

An efficient fully-implicit multislope MUSCL method for multiphase flow with gravity in discrete fractured media

NASA Astrophysics Data System (ADS)

Jiang, Jiamin; Younis, Rami M.

2017-06-01

The first-order methods commonly employed in reservoir simulation for computing the convective fluxes introduce excessive numerical diffusion leading to severe smoothing of displacement fronts. We present a fully-implicit cell-centered finite-volume (CCFV) framework that can achieve second-order spatial accuracy on smooth solutions, while at the same time maintain robustness and nonlinear convergence performance. A novel multislope MUSCL method is proposed to construct the required values at edge centroids in a straightforward and effective way by taking advantage of the triangular mesh geometry. In contrast to the monoslope methods in which a unique limited gradient is used, the multislope concept constructs specific scalar slopes for the interpolations on each edge of a given element. Through the edge centroids, the numerical diffusion caused by mesh skewness is reduced, and optimal second order accuracy can be achieved. Moreover, an improved smooth flux-limiter is introduced to ensure monotonicity on non-uniform meshes. The flux-limiter provides high accuracy without degrading nonlinear convergence performance. The CCFV framework is adapted to accommodate a lower-dimensional discrete fracture-matrix (DFM) model. Several numerical tests with discrete fractured system are carried out to demonstrate the efficiency and robustness of the numerical model.

Attention and working memory: two basic mechanisms for constructing temporal experiences

PubMed Central

Marchetti, Giorgio

2014-01-01

Various kinds of observations show that the ability of human beings to both consciously relive past events – episodic memory – and conceive future events, entails an active process of construction. This construction process also underpins many other important aspects of conscious human life, such as perceptions, language, and conscious thinking. This article provides an explanation of what makes the constructive process possible and how it works. The process mainly relies on attentional activity, which has a discrete and periodic nature, and working memory, which allows for the combination of discrete attentional operations. An explanation is also provided of how past and future events are constructed. PMID:25177305

Performance of discrete heat engines and heat pumps in finite time

PubMed

Feldmann; Kosloff

2000-05-01

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

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.

USMC Inventory Control Using Optimization Modeling and Discrete Event Simulation

DTIC Science & Technology

2016-09-01

release. Distribution is unlimited. USMC INVENTORY CONTROL USING OPTIMIZATION MODELING AND DISCRETE EVENT SIMULATION by Timothy A. Curling...USING OPTIMIZATION MODELING AND DISCRETE EVENT SIMULATION 5. FUNDING NUMBERS 6. AUTHOR(S) Timothy A. Curling 7. PERFORMING ORGANIZATION NAME(S...optimization and discrete -event simulation. This construct can potentially provide an effective means in improving order management decisions. However

GENERIC Integrators: Structure Preserving Time Integration for Thermodynamic Systems

NASA Astrophysics Data System (ADS)

Öttinger, Hans Christian

2018-04-01

Thermodynamically admissible evolution equations for non-equilibrium systems are known to possess a distinct mathematical structure. Within the GENERIC (general equation for the non-equilibrium reversible-irreversible coupling) framework of non-equilibrium thermodynamics, which is based on continuous time evolution, we investigate the possibility of preserving all the structural elements in time-discretized equations. Our approach, which follows Moser's [1] construction of symplectic integrators for Hamiltonian systems, is illustrated for the damped harmonic oscillator. Alternative approaches are sketched.

Efficient Construction of Discrete Adjoint Operators on Unstructured Grids by Using Complex Variables

NASA Technical Reports Server (NTRS)

Nielsen, Eric J.; Kleb, William L.

2005-01-01

A methodology is developed and implemented to mitigate the lengthy software development cycle typically associated with constructing a discrete adjoint solver for aerodynamic simulations. The approach is based on a complex-variable formulation that enables straightforward differentiation of complicated real-valued functions. An automated scripting process is used to create the complex-variable form of the set of discrete equations. An efficient method for assembling the residual and cost function linearizations is developed. The accuracy of the implementation is verified through comparisons with a discrete direct method as well as a previously developed handcoded discrete adjoint approach. Comparisons are also shown for a large-scale configuration to establish the computational efficiency of the present scheme. To ultimately demonstrate the power of the approach, the implementation is extended to high temperature gas flows in chemical nonequilibrium. Finally, several fruitful research and development avenues enabled by the current work are suggested.

Efficient Construction of Discrete Adjoint Operators on Unstructured Grids Using Complex Variables

NASA Technical Reports Server (NTRS)

Nielsen, Eric J.; Kleb, William L.

2005-01-01

A methodology is developed and implemented to mitigate the lengthy software development cycle typically associated with constructing a discrete adjoint solver for aerodynamic simulations. The approach is based on a complex-variable formulation that enables straightforward differentiation of complicated real-valued functions. An automated scripting process is used to create the complex-variable form of the set of discrete equations. An efficient method for assembling the residual and cost function linearizations is developed. The accuracy of the implementation is verified through comparisons with a discrete direct method as well as a previously developed handcoded discrete adjoint approach. Comparisons are also shown for a large-scale configuration to establish the computational efficiency of the present scheme. To ultimately demonstrate the power of the approach, the implementation is extended to high temperature gas flows in chemical nonequilibrium. Finally, several fruitful research and development avenues enabled by the current work are suggested.

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

Multidimensional FEM-FCT schemes for arbitrary time stepping

NASA Astrophysics Data System (ADS)

Kuzmin, D.; Möller, M.; Turek, S.

2003-05-01

The flux-corrected-transport paradigm is generalized to finite-element schemes based on arbitrary time stepping. A conservative flux decomposition procedure is proposed for both convective and diffusive terms. Mathematical properties of positivity-preserving schemes are reviewed. A nonoscillatory low-order method is constructed by elimination of negative off-diagonal entries of the discrete transport operator. The linearization of source terms and extension to hyperbolic systems are discussed. Zalesak's multidimensional limiter is employed to switch between linear discretizations of high and low order. A rigorous proof of positivity is provided. The treatment of non-linearities and iterative solution of linear systems are addressed. The performance of the new algorithm is illustrated by numerical examples for the shock tube problem in one dimension and scalar transport equations in two dimensions.

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

PubMed

Zhou, Yuan; Ancker, Jessica S; Upadhye, Mandar; McGeorge, Nicolette M; Guarrera, Theresa K; Hegde, Sudeep; Crane, Peter W; Fairbanks, Rollin J; Bisantz, Ann M; Kaushal, Rainu; Lin, Li

2013-01-01

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

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.

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.

Model and Algorithm for Substantiating Solutions for Organization of High-Rise Construction Project

NASA Astrophysics Data System (ADS)

Anisimov, Vladimir; Anisimov, Evgeniy; Chernysh, Anatoliy

2018-03-01

In the paper the models and the algorithm for the optimal plan formation for the organization of the material and logistical processes of the high-rise construction project and their financial support are developed. The model is based on the representation of the optimization procedure in the form of a non-linear problem of discrete programming, which consists in minimizing the execution time of a set of interrelated works by a limited number of partially interchangeable performers while limiting the total cost of performing the work. The proposed model and algorithm are the basis for creating specific organization management methodologies for the high-rise construction project.

A fast immersed boundary method for external incompressible viscous flows using lattice Green's functions

NASA Astrophysics Data System (ADS)

Liska, Sebastian; Colonius, Tim

2017-02-01

A new parallel, computationally efficient immersed boundary method for solving three-dimensional, viscous, incompressible flows on unbounded domains is presented. Immersed surfaces with prescribed motions are generated using the interpolation and regularization operators obtained from the discrete delta function approach of the original (Peskin's) immersed boundary method. Unlike Peskin's method, boundary forces are regarded as Lagrange multipliers that are used to satisfy the no-slip condition. The incompressible Navier-Stokes equations are discretized on an unbounded staggered Cartesian grid and are solved in a finite number of operations using lattice Green's function techniques. These techniques are used to automatically enforce the natural free-space boundary conditions and to implement a novel block-wise adaptive grid that significantly reduces the run-time cost of solutions by limiting operations to grid cells in the immediate vicinity and near-wake region of the immersed surface. These techniques also enable the construction of practical discrete viscous integrating factors that are used in combination with specialized half-explicit Runge-Kutta schemes to accurately and efficiently solve the differential algebraic equations describing the discrete momentum equation, incompressibility constraint, and no-slip constraint. Linear systems of equations resulting from the time integration scheme are efficiently solved using an approximation-free nested projection technique. The algebraic properties of the discrete operators are used to reduce projection steps to simple discrete elliptic problems, e.g. discrete Poisson problems, that are compatible with recent parallel fast multipole methods for difference equations. Numerical experiments on low-aspect-ratio flat plates and spheres at Reynolds numbers up to 3700 are used to verify the accuracy and physical fidelity of the formulation.

Symplectic partitioned Runge-Kutta scheme for Maxwell's equations

NASA Astrophysics Data System (ADS)

Huang, Zhi-Xiang; Wu, Xian-Liang

Using the symplectic partitioned Runge-Kutta (PRK) method, we construct a new scheme for approximating the solution to infinite dimensional nonseparable Hamiltonian systems of Maxwell's equations for the first time. The scheme is obtained by discretizing the Maxwell's equations in the time direction based on symplectic PRK method, and then evaluating the equation in the spatial direction with a suitable finite difference approximation. Several numerical examples are presented to verify the efficiency of the scheme.

A description of discrete internal representation schemes for visual pattern discrimination.

PubMed

Foster, D H

1980-01-01

A general description of a class of schemes for pattern vision is outlined in which the visual system is assumed to form a discrete internal representation of the stimulus. These representations are discrete in that they are considered to comprise finite combinations of "components" which are selected from a fixed and finite repertoire, and which designate certain simple pattern properties or features. In the proposed description it is supposed that the construction of an internal representation is a probabilistic process. A relationship is then formulated associating the probability density functions governing this construction and performance in visually discriminating patterns when differences in pattern shape are small. Some questions related to the application of this relationship to the experimental investigation of discrete internal representations are briefly discussed.

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

NASA Astrophysics Data System (ADS)

Moskal, P.; Alfs, D.; Bednarski, T.; Białas, P.; Curceanu, C.; Czerwiński, E.; Dulski, K.; Gajos, A.; Głowacz, B.; Gupta-Sharma, N.; Gorgol, M.; Hiesmayr, B. C.; Jasińska, B.; Kamińska, D.; Khreptak, O.; Korcyl, G.; Kowalski, P.; Krzemień, W.; Krawczyk, N.; Kubicz, E.; Mohammed, M.; Niedźwiecki, Sz.; Pawlik-Niedńwiecka, M.; Raczyński, L.; Rudy, Z.; Silarski, M.; Smyrski, J.; Wieczorek, A.; Wiślicki, W.; Zgardzińska, B.; Zieliński, M.

2016-11-01

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

Simulation-Based Prediction of Equivalent Continuous Noises during Construction Processes

PubMed Central

Zhang, Hong; Pei, Yun

2016-01-01

Quantitative prediction of construction noise is crucial to evaluate construction plans to help make decisions to address noise levels. Considering limitations of existing methods for measuring or predicting the construction noise and particularly the equivalent continuous noise level over a period of time, this paper presents a discrete-event simulation method for predicting the construction noise in terms of equivalent continuous level. The noise-calculating models regarding synchronization, propagation and equivalent continuous level are presented. The simulation framework for modeling the noise-affected factors and calculating the equivalent continuous noise by incorporating the noise-calculating models into simulation strategy is proposed. An application study is presented to demonstrate and justify the proposed simulation method in predicting the equivalent continuous noise during construction. The study contributes to provision of a simulation methodology to quantitatively predict the equivalent continuous noise of construction by considering the relevant uncertainties, dynamics and interactions. PMID:27529266

Simulation-Based Prediction of Equivalent Continuous Noises during Construction Processes.

PubMed

Zhang, Hong; Pei, Yun

2016-08-12

Quantitative prediction of construction noise is crucial to evaluate construction plans to help make decisions to address noise levels. Considering limitations of existing methods for measuring or predicting the construction noise and particularly the equivalent continuous noise level over a period of time, this paper presents a discrete-event simulation method for predicting the construction noise in terms of equivalent continuous level. The noise-calculating models regarding synchronization, propagation and equivalent continuous level are presented. The simulation framework for modeling the noise-affected factors and calculating the equivalent continuous noise by incorporating the noise-calculating models into simulation strategy is proposed. An application study is presented to demonstrate and justify the proposed simulation method in predicting the equivalent continuous noise during construction. The study contributes to provision of a simulation methodology to quantitatively predict the equivalent continuous noise of construction by considering the relevant uncertainties, dynamics and interactions.

Continuum modeling of the mechanical and thermal behavior of discrete large structures

NASA Technical Reports Server (NTRS)

Nayfeh, A. H.; Hefzy, M. S.

1980-01-01

In the present paper we introduce a rather straightforward construction procedure in order to derive continuum equivalence of discrete truss-like repetitive structures. Once the actual structure is specified, the construction procedure can be outlined by the following three steps: (a) all sets of parallel members are identified, (b) unidirectional 'effective continuum' properties are derived for each of these sets and (c) orthogonal transformations are finally used to determine the contribution of each set to the 'overall effective continuum' properties of the structure. Here the properties includes mechanical (stiffnesses), thermal (coefficients of thermal expansions) and material densities. Once expanded descriptions of the steps (b) and (c) are done, the construction procedure will be applied to a wide variety of discrete structures and the results will be compared with those of other existing methods.

Isospectral discrete and quantum graphs with the same flip counts and nodal counts

NASA Astrophysics Data System (ADS)

Juul, Jonas S.; Joyner, Christopher H.

2018-06-01

The existence of non-isomorphic graphs which share the same Laplace spectrum (to be referred to as isospectral graphs) leads naturally to the following question: what additional information is required in order to resolve isospectral graphs? It was suggested by Band, Shapira and Smilansky that this might be achieved by either counting the number of nodal domains or the number of times the eigenfunctions change sign (the so-called flip count) (Band et al 2006 J. Phys. A: Math. Gen. 39 13999–4014 Band and Smilansky 2007 Eur. Phys. J. Spec. Top. 145 171–9). Recent examples of (discrete) isospectral graphs with the same flip count and nodal count have been constructed by Ammann by utilising Godsil–McKay switching (Ammann private communication). Here, we provide a simple alternative mechanism that produces systematic examples of both discrete and quantum isospectral graphs with the same flip and nodal counts.

Fuzzy Adaptive Control Design and Discretization for a Class of Nonlinear Uncertain Systems.

PubMed

Zhao, Xudong; Shi, Peng; Zheng, Xiaolong

2016-06-01

In this paper, tracking control problems are investigated for a class of uncertain nonlinear systems in lower triangular form. First, a state-feedback controller is designed by using adaptive backstepping technique and the universal approximation ability of fuzzy logic systems. During the design procedure, a developed method with less computation is proposed by constructing one maximum adaptive parameter. Furthermore, adaptive controllers with nonsymmetric dead-zone are also designed for the systems. Then, a sampled-data control scheme is presented to discretize the obtained continuous-time controller by using the forward Euler method. It is shown that both proposed continuous and discrete controllers can ensure that the system output tracks the target signal with a small bounded error and the other closed-loop signals remain bounded. Two simulation examples are presented to verify the effectiveness and applicability of the proposed new design techniques.

Mathematical construction and perturbation analysis of Zernike discrete orthogonal points.

PubMed

Shi, Zhenguang; Sui, Yongxin; Liu, Zhenyu; Peng, Ji; Yang, Huaijiang

2012-06-20

Zernike functions are orthogonal within the unit circle, but they are not over the discrete points such as CCD arrays or finite element grids. This will result in reconstruction errors for loss of orthogonality. By using roots of Legendre polynomials, a set of points within the unit circle can be constructed so that Zernike functions over the set are discretely orthogonal. Besides that, the location tolerances of the points are studied by perturbation analysis, and the requirements of the positioning precision are not very strict. Computer simulations show that this approach provides a very accurate wavefront reconstruction with the proposed sampling set.

Discrete symmetries in Heterotic/F-theory duality and mirror symmetry

DOE PAGES

Cvetič, Mirjam; Grassi, Antonella; Poretschkin, Maximilian

2017-06-30

We study aspects of Heterotic/F-theory duality for compacti cations with Abelian discrete gauge symmetries. We consider F-theory compacti cations on genus-one bered Calabi-Yau manifolds with n-sections, associated with the Tate-Shafarevich group Z n. Such models are obtained by studying rst a speci c toric set-up whose associated Heterotic vector bundle has structure group Z n. By employing a conjectured Heterotic/Ftheory mirror symmetry we construct dual geometries of these original toric models, where in the stable degeneration limit we obtain a discrete gauge symmetry of order two and three, for compacti cations to six dimensions. We provide explicit constructions of mirrorpairsmore » for symmetric examples with Z 2 and Z 3, in six dimensions. The Heterotic models with symmetric discrete symmetries are related in eld theory to a Higgsing of Heterotic models with two symmetric abelian U(1) gauge factors, where due to the Stuckelberg mechanism only a diagonal U(1) factor remains massless, and thus after Higgsing only a diagonal discrete symmetry of order n is present in the Heterotic models and detected via Heterotic/F-theory duality. These constructions also provide further evidence for the conjectured mirror symmetry in Heterotic/F-theory at the level of brations with torsional sections and those with multi-sections.« less

Discrete symmetries in Heterotic/F-theory duality and mirror symmetry

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

Cvetič, Mirjam; Grassi, Antonella; Poretschkin, Maximilian

We study aspects of Heterotic/F-theory duality for compacti cations with Abelian discrete gauge symmetries. We consider F-theory compacti cations on genus-one bered Calabi-Yau manifolds with n-sections, associated with the Tate-Shafarevich group Z n. Such models are obtained by studying rst a speci c toric set-up whose associated Heterotic vector bundle has structure group Z n. By employing a conjectured Heterotic/Ftheory mirror symmetry we construct dual geometries of these original toric models, where in the stable degeneration limit we obtain a discrete gauge symmetry of order two and three, for compacti cations to six dimensions. We provide explicit constructions of mirrorpairsmore » for symmetric examples with Z 2 and Z 3, in six dimensions. The Heterotic models with symmetric discrete symmetries are related in eld theory to a Higgsing of Heterotic models with two symmetric abelian U(1) gauge factors, where due to the Stuckelberg mechanism only a diagonal U(1) factor remains massless, and thus after Higgsing only a diagonal discrete symmetry of order n is present in the Heterotic models and detected via Heterotic/F-theory duality. These constructions also provide further evidence for the conjectured mirror symmetry in Heterotic/F-theory at the level of brations with torsional sections and those with multi-sections.« less

Input-output characterization of an ultrasonic testing system by digital signal analysis

NASA Technical Reports Server (NTRS)

Williams, J. H., Jr.; Lee, S. S.; Karagulle, H.

1986-01-01

Ultrasonic test system input-output characteristics were investigated by directly coupling the transmitting and receiving transducers face to face without a test specimen. Some of the fundamentals of digital signal processing were summarized. Input and output signals were digitized by using a digital oscilloscope, and the digitized data were processed in a microcomputer by using digital signal-processing techniques. The continuous-time test system was modeled as a discrete-time, linear, shift-invariant system. In estimating the unit-sample response and frequency response of the discrete-time system, it was necessary to use digital filtering to remove low-amplitude noise, which interfered with deconvolution calculations. A digital bandpass filter constructed with the assistance of a Blackman window and a rectangular time window were used. Approximations of the impulse response and the frequency response of the continuous-time test system were obtained by linearly interpolating the defining points of the unit-sample response and the frequency response of the discrete-time system. The test system behaved as a linear-phase bandpass filter in the frequency range 0.6 to 2.3 MHz. These frequencies were selected in accordance with the criterion that they were 6 dB below the maximum peak of the amplitude of the frequency response. The output of the system to various inputs was predicted and the results were compared with the corresponding measurements on the system.

Numerical solution of the unsteady Navier-Stokes equation

NASA Technical Reports Server (NTRS)

Osher, Stanley J.; Engquist, Bjoern

1985-01-01

The construction and the analysis of nonoscillatory shock capturing methods for the approximation of hyperbolic conservation laws are discussed. These schemes share many desirable properties with total variation diminishing schemes, but TVD schemes have at most first-order accuracy, in the sense of truncation error, at extrema of the solution. In this paper a uniformly second-order approximation is constructed, which is nonoscillatory in the sense that the number of extrema of the discrete solution is not increasing in time. This is achieved via a nonoscillatory piecewise linear reconstruction of the solution from its cell averages, time evolution through an approximate solution of the resulting initial value problem, and averaging of this approximate solution over each cell.

Prethermal Phases of Matter Protected by Time-Translation Symmetry

NASA Astrophysics Data System (ADS)

Else, Dominic V.; Bauer, Bela; Nayak, Chetan

2017-01-01

In a periodically driven (Floquet) system, there is the possibility for new phases of matter, not present in stationary systems, protected by discrete time-translation symmetry. This includes topological phases protected in part by time-translation symmetry, as well as phases distinguished by the spontaneous breaking of this symmetry, dubbed "Floquet time crystals." We show that such phases of matter can exist in the prethermal regime of periodically driven systems, which exists generically for sufficiently large drive frequency, thereby eliminating the need for integrability or strong quenched disorder, which limited previous constructions. We prove a theorem that states that such a prethermal regime persists until times that are nearly exponentially long in the ratio of certain couplings to the drive frequency. By similar techniques, we can also construct stationary systems that spontaneously break continuous time-translation symmetry. Furthermore, we argue that for driven systems coupled to a cold bath, the prethermal regime could potentially persist to infinite time.

Construction of energy-stable Galerkin reduced order models.

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

Kalashnikova, Irina; Barone, Matthew Franklin; Arunajatesan, Srinivasan

2013-05-01

This report aims to unify several approaches for building stable projection-based reduced order models (ROMs). Attention is focused on linear time-invariant (LTI) systems. The model reduction procedure consists of two steps: the computation of a reduced basis, and the projection of the governing partial differential equations (PDEs) onto this reduced basis. Two kinds of reduced bases are considered: the proper orthogonal decomposition (POD) basis and the balanced truncation basis. The projection step of the model reduction can be done in two ways: via continuous projection or via discrete projection. First, an approach for building energy-stable Galerkin ROMs for linear hyperbolicmore » or incompletely parabolic systems of PDEs using continuous projection is proposed. The idea is to apply to the set of PDEs a transformation induced by the Lyapunov function for the system, and to build the ROM in the transformed variables. The resulting ROM will be energy-stable for any choice of reduced basis. It is shown that, for many PDE systems, the desired transformation is induced by a special weighted L2 inner product, termed the %E2%80%9Csymmetry inner product%E2%80%9D. Attention is then turned to building energy-stable ROMs via discrete projection. A discrete counterpart of the continuous symmetry inner product, a weighted L2 inner product termed the %E2%80%9CLyapunov inner product%E2%80%9D, is derived. The weighting matrix that defines the Lyapunov inner product can be computed in a black-box fashion for a stable LTI system arising from the discretization of a system of PDEs in space. It is shown that a ROM constructed via discrete projection using the Lyapunov inner product will be energy-stable for any choice of reduced basis. Connections between the Lyapunov inner product and the inner product induced by the balanced truncation algorithm are made. Comparisons are also made between the symmetry inner product and the Lyapunov inner product. The performance of ROMs constructed using these inner products is evaluated on several benchmark test cases.« less

A simulation trainer for complex articular fracture surgery.

PubMed

Yehyawi, Tameem M; Thomas, Thaddeus P; Ohrt, Gary T; Marsh, J Lawrence; Karam, Matthew D; Brown, Thomas D; Anderson, Donald D

2013-07-03

The purposes of this study were (1) to develop a physical model to improve articular fracture reduction skills, (2) to develop objective assessment methods to evaluate these skills, and (3) to assess the construct validity of the simulation. A surgical simulation was staged utilizing surrogate tibial plafond fractures. Multiple three-segment radio-opacified polyurethane foam fracture models were produced from the same mold, ensuring uniform surgical complexity between trials. Using fluoroscopic guidance, five senior and seven junior orthopaedic residents reduced the fracture through a limited anterior window. The residents were assessed on the basis of time to completion, hand movements (tracked with use of a motion capture system), and quality of the obtained reduction. All but three of the residents successfully reduced and fixed the fracture fragments (one senior resident and two junior residents completed the reduction but were unsuccessful in fixating all fragments). Senior residents had an average time to completion of 13.43 minutes, an average gross articular step-off of 3.00 mm, discrete hand motions of 540 actions, and a cumulative hand motion distance of 79 m. Junior residents had an average time to completion of 14.75 minutes, an average gross articular step-off of 3.09 mm, discrete hand motions of 511 actions, and a cumulative hand motion distance of 390 m. The large difference in cumulative hand motion distance, despite comparable numbers of discrete hand motion events, indicates that senior residents were more precise in their hand motions. The present experiment establishes the basic construct validity of the simulation trainer. Further studies are required to demonstrate that this laboratory-based model for articular fracture reduction training, along with an objective assessment of performance, can be used to improve resident surgical skills.

Integrable discrete PT symmetric model.

PubMed

Ablowitz, Mark J; Musslimani, Ziad H

2014-09-01

An exactly solvable discrete PT invariant nonlinear Schrödinger-like model is introduced. It is an integrable Hamiltonian system that exhibits a nontrivial nonlinear PT symmetry. A discrete one-soliton solution is constructed using a left-right Riemann-Hilbert formulation. It is shown that this pure soliton exhibits unique features such as power oscillations and singularity formation. The proposed model can be viewed as a discretization of a recently obtained integrable nonlocal nonlinear Schrödinger equation.

Printed Graphene Derivative Circuits as Passive Electrical Filters

PubMed Central

Sinar, Dogan

2018-01-01

The objective of this study is to inkjet print resistor-capacitor (RC) low pass electrical filters, using a novel water-based cellulose graphene ink, and compare the voltage-frequency and transient behavior to equivalent circuits constructed from discrete passive components. The synthesized non-toxic graphene-carboxymethyl cellulose (G-CMC) ink is deposited on mechanically flexible polyimide substrates using a customized printer that dispenses functionalized aqueous solutions. The design of the printed first-order and second-order low-pass RC filters incorporate resistive traces and interdigitated capacitors. Low pass filter characteristics, such as time constant, cut-off frequency and roll-off rate, are determined for comparative analysis. Experiments demonstrate that for low frequency applications (<100 kHz) the printed graphene derivative circuits performed as well as the circuits constructed from discrete resistors and capacitors for both low pass filter and RC integrator applications. The impact of mechanical stress due to bending on the electrical performance of the flexible printed circuits is also investigated. PMID:29473890

Printed Graphene Derivative Circuits as Passive Electrical Filters.

PubMed

Sinar, Dogan; Knopf, George K

2018-02-23

The objective of this study is to inkjet print resistor-capacitor ( RC ) low pass electrical filters, using a novel water-based cellulose graphene ink, and compare the voltage-frequency and transient behavior to equivalent circuits constructed from discrete passive components. The synthesized non-toxic graphene-carboxymethyl cellulose (G-CMC) ink is deposited on mechanically flexible polyimide substrates using a customized printer that dispenses functionalized aqueous solutions. The design of the printed first-order and second-order low-pass RC filters incorporate resistive traces and interdigitated capacitors. Low pass filter characteristics, such as time constant, cut-off frequency and roll-off rate, are determined for comparative analysis. Experiments demonstrate that for low frequency applications (<100 kHz) the printed graphene derivative circuits performed as well as the circuits constructed from discrete resistors and capacitors for both low pass filter and RC integrator applications. The impact of mechanical stress due to bending on the electrical performance of the flexible printed circuits is also investigated.

Dirac Cellular Automaton from Split-step Quantum Walk

PubMed Central

Mallick, Arindam; Chandrashekar, C. M.

2016-01-01

Simulations of one quantum system by an other has an implication in realization of quantum machine that can imitate any quantum system and solve problems that are not accessible to classical computers. One of the approach to engineer quantum simulations is to discretize the space-time degree of freedom in quantum dynamics and define the quantum cellular automata (QCA), a local unitary update rule on a lattice. Different models of QCA are constructed using set of conditions which are not unique and are not always in implementable configuration on any other system. Dirac Cellular Automata (DCA) is one such model constructed for Dirac Hamiltonian (DH) in free quantum field theory. Here, starting from a split-step discrete-time quantum walk (QW) which is uniquely defined for experimental implementation, we recover the DCA along with all the fine oscillations in position space and bridge the missing connection between DH-DCA-QW. We will present the contribution of the parameters resulting in the fine oscillations on the Zitterbewegung frequency and entanglement. The tuneability of the evolution parameters demonstrated in experimental implementation of QW will establish it as an efficient tool to design quantum simulator and approach quantum field theory from principles of quantum information theory. PMID:27184159

Variable speed wind turbine control by discrete-time sliding mode approach.

PubMed

Torchani, Borhen; Sellami, Anis; Garcia, Germain

2016-05-01

The aim of this paper is to propose a new design variable speed wind turbine control by discrete-time sliding mode approach. This methodology is designed for linear saturated system. The saturation constraint is reported on inputs vector. To this end, the back stepping design procedure is followed to construct a suitable sliding manifold that guarantees the attainment of a stabilization control objective. It is well known that the mechanisms are investigated in term of the most proposed assumptions to deal with the damping, shaft stiffness and inertia effect of the gear. The objectives are to synthesize robust controllers that maximize the energy extracted from wind, while reducing mechanical loads and rotor speed tracking combined with an electromagnetic torque. Simulation results of the proposed scheme are presented. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

Regenerating time series from ordinal networks.

PubMed

McCullough, Michael; Sakellariou, Konstantinos; Stemler, Thomas; Small, Michael

2017-03-01

Recently proposed ordinal networks not only afford novel methods of nonlinear time series analysis but also constitute stochastic approximations of the deterministic flow time series from which the network models are constructed. In this paper, we construct ordinal networks from discrete sampled continuous chaotic time series and then regenerate new time series by taking random walks on the ordinal network. We then investigate the extent to which the dynamics of the original time series are encoded in the ordinal networks and retained through the process of regenerating new time series by using several distinct quantitative approaches. First, we use recurrence quantification analysis on traditional recurrence plots and order recurrence plots to compare the temporal structure of the original time series with random walk surrogate time series. Second, we estimate the largest Lyapunov exponent from the original time series and investigate the extent to which this invariant measure can be estimated from the surrogate time series. Finally, estimates of correlation dimension are computed to compare the topological properties of the original and surrogate time series dynamics. Our findings show that ordinal networks constructed from univariate time series data constitute stochastic models which approximate important dynamical properties of the original systems.

Regenerating time series from ordinal networks

NASA Astrophysics Data System (ADS)

McCullough, Michael; Sakellariou, Konstantinos; Stemler, Thomas; Small, Michael

2017-03-01

Recently proposed ordinal networks not only afford novel methods of nonlinear time series analysis but also constitute stochastic approximations of the deterministic flow time series from which the network models are constructed. In this paper, we construct ordinal networks from discrete sampled continuous chaotic time series and then regenerate new time series by taking random walks on the ordinal network. We then investigate the extent to which the dynamics of the original time series are encoded in the ordinal networks and retained through the process of regenerating new time series by using several distinct quantitative approaches. First, we use recurrence quantification analysis on traditional recurrence plots and order recurrence plots to compare the temporal structure of the original time series with random walk surrogate time series. Second, we estimate the largest Lyapunov exponent from the original time series and investigate the extent to which this invariant measure can be estimated from the surrogate time series. Finally, estimates of correlation dimension are computed to compare the topological properties of the original and surrogate time series dynamics. Our findings show that ordinal networks constructed from univariate time series data constitute stochastic models which approximate important dynamical properties of the original systems.

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

NASA Technical Reports Server (NTRS)

Bradley, James R.

2012-01-01

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

High resolution schemes and the entropy condition

NASA Technical Reports Server (NTRS)

Osher, S.; Chakravarthy, S.

1983-01-01

A systematic procedure for constructing semidiscrete, second order accurate, variation diminishing, five point band width, approximations to scalar conservation laws, is presented. These schemes are constructed to also satisfy a single discrete entropy inequality. Thus, in the convex flux case, convergence is proven to be the unique physically correct solution. For hyperbolic systems of conservation laws, this construction is used formally to extend the first author's first order accurate scheme, and show (under some minor technical hypotheses) that limit solutions satisfy an entropy inequality. Results concerning discrete shocks, a maximum principle, and maximal order of accuracy are obtained. Numerical applications are also presented.

A Geometric Construction of Cyclic Cocycles on Twisted Convolution Algebras

NASA Astrophysics Data System (ADS)

Angel, Eitan

2010-09-01

In this thesis we give a construction of cyclic cocycles on convolution algebras twisted by gerbes over discrete translation groupoids. In his seminal book, Connes constructs a map from the equivariant cohomology of a manifold carrying the action of a discrete group into the periodic cyclic cohomology of the associated convolution algebra. Furthermore, for proper étale groupoids, J.-L. Tu and P. Xu provide a map between the periodic cyclic cohomology of a gerbe twisted convolution algebra and twisted cohomology groups. Our focus will be the convolution algebra with a product defined by a gerbe over a discrete translation groupoid. When the action is not proper, we cannot construct an invariant connection on the gerbe; therefore to study this algebra, we instead develop simplicial notions related to ideas of J. Dupont to construct a simplicial form representing the Dixmier-Douady class of the gerbe. Then by using a JLO formula we define a morphism from a simplicial complex twisted by this simplicial Dixmier-Douady form to the mixed bicomplex of certain matrix algebras. Finally, we define a morphism from this complex to the mixed bicomplex computing the periodic cyclic cohomology of the twisted convolution algebras.

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

PubMed

Liao, Bolin; Zhang, Yunong; Jin, Long

2016-02-01

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

Accelerated solution of discrete ordinates approximation to the Boltzmann transport equation via model reduction

DOE PAGES

Tencer, John; Carlberg, Kevin; Larsen, Marvin; ...

2017-06-17

Radiation heat transfer is an important phenomenon in many physical systems of practical interest. When participating media is important, the radiative transfer equation (RTE) must be solved for the radiative intensity as a function of location, time, direction, and wavelength. In many heat-transfer applications, a quasi-steady assumption is valid, thereby removing time dependence. The dependence on wavelength is often treated through a weighted sum of gray gases (WSGG) approach. The discrete ordinates method (DOM) is one of the most common methods for approximating the angular (i.e., directional) dependence. The DOM exactly solves for the radiative intensity for a finite numbermore » of discrete ordinate directions and computes approximations to integrals over the angular space using a quadrature rule; the chosen ordinate directions correspond to the nodes of this quadrature rule. This paper applies a projection-based model-reduction approach to make high-order quadrature computationally feasible for the DOM for purely absorbing applications. First, the proposed approach constructs a reduced basis from (high-fidelity) solutions of the radiative intensity computed at a relatively small number of ordinate directions. Then, the method computes inexpensive approximations of the radiative intensity at the (remaining) quadrature points of a high-order quadrature using a reduced-order model constructed from the reduced basis. Finally, this results in a much more accurate solution than might have been achieved using only the ordinate directions used to compute the reduced basis. One- and three-dimensional test problems highlight the efficiency of the proposed method.« less

Accelerated solution of discrete ordinates approximation to the Boltzmann transport equation via model reduction

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

Tencer, John; Carlberg, Kevin; Larsen, Marvin

Radiation heat transfer is an important phenomenon in many physical systems of practical interest. When participating media is important, the radiative transfer equation (RTE) must be solved for the radiative intensity as a function of location, time, direction, and wavelength. In many heat-transfer applications, a quasi-steady assumption is valid, thereby removing time dependence. The dependence on wavelength is often treated through a weighted sum of gray gases (WSGG) approach. The discrete ordinates method (DOM) is one of the most common methods for approximating the angular (i.e., directional) dependence. The DOM exactly solves for the radiative intensity for a finite numbermore » of discrete ordinate directions and computes approximations to integrals over the angular space using a quadrature rule; the chosen ordinate directions correspond to the nodes of this quadrature rule. This paper applies a projection-based model-reduction approach to make high-order quadrature computationally feasible for the DOM for purely absorbing applications. First, the proposed approach constructs a reduced basis from (high-fidelity) solutions of the radiative intensity computed at a relatively small number of ordinate directions. Then, the method computes inexpensive approximations of the radiative intensity at the (remaining) quadrature points of a high-order quadrature using a reduced-order model constructed from the reduced basis. Finally, this results in a much more accurate solution than might have been achieved using only the ordinate directions used to compute the reduced basis. One- and three-dimensional test problems highlight the efficiency of the proposed method.« less

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

Virasoro symmetry of the constrained multicomponent Kadomtsev-Petviashvili hierarchy and its integrable discretization

NASA Astrophysics Data System (ADS)

Li, Chuanzhong; He, Jingsong

2016-06-01

We construct Virasoro-type additional symmetries of a kind of constrained multicomponent Kadomtsev-Petviashvili (KP) hierarchy and obtain the Virasoro flow equation for the eigenfunctions and adjoint eigenfunctions. We show that the algebraic structure of the Virasoro symmetry is retained under discretization from the constrained multicomponent KP hierarchy to the discrete constrained multicomponent KP hierarchy.

Discrete structures in continuum descriptions of defective crystals

PubMed Central

2016-01-01

I discuss various mathematical constructions that combine together to provide a natural setting for discrete and continuum geometric models of defective crystals. In particular, I provide a quite general list of ‘plastic strain variables’, which quantifies inelastic behaviour, and exhibit rigorous connections between discrete and continuous mathematical structures associated with crystalline materials that have a correspondingly general constitutive specification. PMID:27002070

Theory of the Lattice Boltzmann Equation: Symmetry properties of Discrete Velocity Sets

NASA Technical Reports Server (NTRS)

Rubinstein, Robert; Luo, Li-Shi

2007-01-01

In the lattice Boltzmann equation, continuous particle velocity space is replaced by a finite dimensional discrete set. The number of linearly independent velocity moments in a lattice Boltzmann model cannot exceed the number of discrete velocities. Thus, finite dimensionality introduces linear dependencies among the moments that do not exist in the exact continuous theory. Given a discrete velocity set, it is important to know to exactly what order moments are free of these dependencies. Elementary group theory is applied to the solution of this problem. It is found that by decomposing the velocity set into subsets that transform among themselves under an appropriate symmetry group, it becomes relatively straightforward to assess the behavior of moments in the theory. The construction of some standard two- and three-dimensional models is reviewed from this viewpoint, and procedures for constructing some new higher dimensional models are suggested.

Atomic quantum simulation of dynamical gauge fields coupled to fermionic matter: from string breaking to evolution after a quench.

PubMed

Banerjee, D; Dalmonte, M; Müller, M; Rico, E; Stebler, P; Wiese, U-J; Zoller, P

2012-10-26

Using a Fermi-Bose mixture of ultracold atoms in an optical lattice, we construct a quantum simulator for a U(1) gauge theory coupled to fermionic matter. The construction is based on quantum links which realize continuous gauge symmetry with discrete quantum variables. At low energies, quantum link models with staggered fermions emerge from a Hubbard-type model which can be quantum simulated. This allows us to investigate string breaking as well as the real-time evolution after a quench in gauge theories, which are inaccessible to classical simulation methods.

A Summary of the Space-Time Conservation Element and Solution Element (CESE) Method

NASA Technical Reports Server (NTRS)

Wang, Xiao-Yen J.

2015-01-01

The space-time Conservation Element and Solution Element (CESE) method for solving conservation laws is examined for its development motivation and design requirements. The characteristics of the resulting scheme are discussed. The discretization of the Euler equations is presented to show readers how to construct a scheme based on the CESE method. The differences and similarities between the CESE method and other traditional methods are discussed. The strengths and weaknesses of the method are also addressed.

Upscaling of Mixed Finite Element Discretization Problems by the Spectral AMGe Method

DOE PAGES

Kalchev, Delyan Z.; Lee, C. S.; Villa, U.; ...

2016-09-22

Here, we propose two multilevel spectral techniques for constructing coarse discretization spaces for saddle-point problems corresponding to PDEs involving a divergence constraint, with a focus on mixed finite element discretizations of scalar self-adjoint second order elliptic equations on general unstructured grids. We use element agglomeration algebraic multigrid (AMGe), which employs coarse elements that can have nonstandard shape since they are agglomerates of fine-grid elements. The coarse basis associated with each agglomerated coarse element is constructed by solving local eigenvalue problems and local mixed finite element problems. This construction leads to stable upscaled coarse spaces and guarantees the inf-sup compatibility ofmore » the upscaled discretization. Also, the approximation properties of these upscaled spaces improve by adding more local eigenfunctions to the coarse spaces. The higher accuracy comes at the cost of additional computational effort, as the sparsity of the resulting upscaled coarse discretization (referred to as operator complexity) deteriorates when we introduce additional functions in the coarse space. We also provide an efficient solver for the coarse (upscaled) saddle-point system by employing hybridization, which leads to a symmetric positive definite (s.p.d.) reduced system for the Lagrange multipliers, and to solve the latter s.p.d. system, we use our previously developed spectral AMGe solver. Numerical experiments, in both two and three dimensions, are provided to illustrate the efficiency of the proposed upscaling technique.« less

Upscaling of Mixed Finite Element Discretization Problems by the Spectral AMGe Method

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

Kalchev, Delyan Z.; Lee, C. S.; Villa, U.

Here, we propose two multilevel spectral techniques for constructing coarse discretization spaces for saddle-point problems corresponding to PDEs involving a divergence constraint, with a focus on mixed finite element discretizations of scalar self-adjoint second order elliptic equations on general unstructured grids. We use element agglomeration algebraic multigrid (AMGe), which employs coarse elements that can have nonstandard shape since they are agglomerates of fine-grid elements. The coarse basis associated with each agglomerated coarse element is constructed by solving local eigenvalue problems and local mixed finite element problems. This construction leads to stable upscaled coarse spaces and guarantees the inf-sup compatibility ofmore » the upscaled discretization. Also, the approximation properties of these upscaled spaces improve by adding more local eigenfunctions to the coarse spaces. The higher accuracy comes at the cost of additional computational effort, as the sparsity of the resulting upscaled coarse discretization (referred to as operator complexity) deteriorates when we introduce additional functions in the coarse space. We also provide an efficient solver for the coarse (upscaled) saddle-point system by employing hybridization, which leads to a symmetric positive definite (s.p.d.) reduced system for the Lagrange multipliers, and to solve the latter s.p.d. system, we use our previously developed spectral AMGe solver. Numerical experiments, in both two and three dimensions, are provided to illustrate the efficiency of the proposed upscaling technique.« less

Relative-Error-Covariance Algorithms

NASA Technical Reports Server (NTRS)

Bierman, Gerald J.; Wolff, Peter J.

1991-01-01

Two algorithms compute error covariance of difference between optimal estimates, based on data acquired during overlapping or disjoint intervals, of state of discrete linear system. Provides quantitative measure of mutual consistency or inconsistency of estimates of states. Relative-error-covariance concept applied, to determine degree of correlation between trajectories calculated from two overlapping sets of measurements and construct real-time test of consistency of state estimates based upon recently acquired data.

An integrable semi-discrete Degasperis-Procesi equation

NASA Astrophysics Data System (ADS)

Feng, Bao-Feng; Maruno, Ken-ichi; Ohta, Yasuhiro

2017-06-01

Based on our previous work on the Degasperis-Procesi equation (Feng et al J. Phys. A: Math. Theor. 46 045205) and the integrable semi-discrete analogue of its short wave limit (Feng et al J. Phys. A: Math. Theor. 48 135203), we derive an integrable semi-discrete Degasperis-Procesi equation by Hirota’s bilinear method. Furthermore, N-soliton solution to the semi-discrete Degasperis-Procesi equation is constructed. It is shown that both the proposed semi-discrete Degasperis-Procesi equation, and its N-soliton solution converge to ones of the original Degasperis-Procesi equation in the continuum limit.

Lagrangian approach to the Barrett-Crane spin foam model

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

Bonzom, Valentin; Laboratoire de Physique, ENS Lyon, CNRS UMR 5672, 46 Allee d'Italie, 69007 Lyon; Livine, Etera R.

2009-03-15

We provide the Barrett-Crane spin foam model for quantum gravity with a discrete action principle, consisting in the usual BF term with discretized simplicity constraints which in the continuum turn topological BF theory into gravity. The setting is the same as usually considered in the literature: space-time is cut into 4-simplices, the connection describes how to glue these 4-simplices together and the action is a sum of terms depending on the holonomies around each triangle. We impose the discretized simplicity constraints on disjoint tetrahedra and we show how the Lagrange multipliers distort the parallel transport and the correlations between neighboringmore » simplices. We then construct the discretized BF action using a noncommutative * product between SU(2) plane waves. We show how this naturally leads to the Barrett-Crane model. This clears up the geometrical meaning of the model. We discuss the natural generalization of this action principle and the spin foam models it leads to. We show how the recently introduced spin foam fusion coefficients emerge with a nontrivial measure. In particular, we recover the Engle-Pereira-Rovelli spin foam model by weakening the discretized simplicity constraints. Finally, we identify the two sectors of Plebanski's theory and we give the analog of the Barrett-Crane model in the nongeometric sector.« less

Recurrence plots of discrete-time Gaussian stochastic processes

NASA Astrophysics Data System (ADS)

Ramdani, Sofiane; Bouchara, Frédéric; Lagarde, Julien; Lesne, Annick

2016-09-01

We investigate the statistical properties of recurrence plots (RPs) of data generated by discrete-time stationary Gaussian random processes. We analytically derive the theoretical values of the probabilities of occurrence of recurrence points and consecutive recurrence points forming diagonals in the RP, with an embedding dimension equal to 1. These results allow us to obtain theoretical values of three measures: (i) the recurrence rate (REC) (ii) the percent determinism (DET) and (iii) RP-based estimation of the ε-entropy κ(ε) in the sense of correlation entropy. We apply these results to two Gaussian processes, namely first order autoregressive processes and fractional Gaussian noise. For these processes, we simulate a number of realizations and compare the RP-based estimations of the three selected measures to their theoretical values. These comparisons provide useful information on the quality of the estimations, such as the minimum required data length and threshold radius used to construct the RP.

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.

Discrete structures in continuum descriptions of defective crystals.

PubMed

Parry, G P

2016-04-28

I discuss various mathematical constructions that combine together to provide a natural setting for discrete and continuum geometric models of defective crystals. In particular, I provide a quite general list of 'plastic strain variables', which quantifies inelastic behaviour, and exhibit rigorous connections between discrete and continuous mathematical structures associated with crystalline materials that have a correspondingly general constitutive specification. © 2016 The Author(s).

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

A general gridding, discretization, and coarsening methodology for modeling flow in porous formations with discrete geological features

NASA Astrophysics Data System (ADS)

Karimi-Fard, M.; Durlofsky, L. J.

2016-10-01

A comprehensive framework for modeling flow in porous media containing thin, discrete features, which could be high-permeability fractures or low-permeability deformation bands, is presented. The key steps of the methodology are mesh generation, fine-grid discretization, upscaling, and coarse-grid discretization. Our specialized gridding technique combines a set of intersecting triangulated surfaces by constructing approximate intersections using existing edges. This procedure creates a conforming mesh of all surfaces, which defines the internal boundaries for the volumetric mesh. The flow equations are discretized on this conforming fine mesh using an optimized two-point flux finite-volume approximation. The resulting discrete model is represented by a list of control-volumes with associated positions and pore-volumes, and a list of cell-to-cell connections with associated transmissibilities. Coarse models are then constructed by the aggregation of fine-grid cells, and the transmissibilities between adjacent coarse cells are obtained using flow-based upscaling procedures. Through appropriate computation of fracture-matrix transmissibilities, a dual-continuum representation is obtained on the coarse scale in regions with connected fracture networks. The fine and coarse discrete models generated within the framework are compatible with any connectivity-based simulator. The applicability of the methodology is illustrated for several two- and three-dimensional examples. In particular, we consider gas production from naturally fractured low-permeability formations, and transport through complex fracture networks. In all cases, highly accurate solutions are obtained with significant model reduction.

Modelling machine ensembles with discrete event dynamical system theory

NASA Technical Reports Server (NTRS)

Hunter, Dan

1990-01-01

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

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

NASA Technical Reports Server (NTRS)

Malin, Jane T.; Basham, Bryan D.

1989-01-01

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

Method of construction of a multi-cell solar array

NASA Technical Reports Server (NTRS)

Routh, D. E.; Hollis, B. R., Jr.; Feltner, W. R. (Inventor)

1979-01-01

The method of constructing a high voltage, low power, multicell solar array is described. A solar cell base region is formed in a substrate such as but not limited to silicon or sapphire. A protective coating is applied on the base and a patterned etching of the coating and base forms discrete base regions. A semiconductive junction and upper active region are formed in each base region, and defined by photolithography. Thus, discrete cells which are interconnected by metallic electrodes are formed.

A modified symplectic PRK scheme for seismic wave modeling

NASA Astrophysics Data System (ADS)

Liu, Shaolin; Yang, Dinghui; Ma, Jian

2017-02-01

A new scheme for the temporal discretization of the seismic wave equation is constructed based on symplectic geometric theory and a modified strategy. The ordinary differential equation in terms of time, which is obtained after spatial discretization via the spectral-element method, is transformed into a Hamiltonian system. A symplectic partitioned Runge-Kutta (PRK) scheme is used to solve the Hamiltonian system. A term related to the multiplication of the spatial discretization operator with the seismic wave velocity vector is added into the symplectic PRK scheme to create a modified symplectic PRK scheme. The symplectic coefficients of the new scheme are determined via Taylor series expansion. The positive coefficients of the scheme indicate that its long-term computational capability is more powerful than that of conventional symplectic schemes. An exhaustive theoretical analysis reveals that the new scheme is highly stable and has low numerical dispersion. The results of three numerical experiments demonstrate the high efficiency of this method for seismic wave modeling.

42 CFR 137.362 - May construction project agreements be amended?

Code of Federal Regulations, 2010 CFR

2010-10-01

... 42 Public Health 1 2010-10-01 2010-10-01 false May construction project agreements be amended? 137... of the Secretary in Establishing and Implementing Construction Project Agreements § 137.362 May construction project agreements be amended? Yes, the Self-Governance Tribe, at its discretion, may request the...

Integrating Security into the Curriculum

DTIC Science & Technology

1998-12-01

predicate calculus, discrete math , and finite-state machine the- ory. In addition to applying standard mathematical foundations to constructing hardware and...models, specifi- cations, and the use of formal methods for verification and covert channel analysis. The means for analysis is based on discrete math , information

Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling

PubMed Central

Luo, Qifang; Zhou, Yongquan; Xie, Jian; Ma, Mingzhi; Li, Liangliang

2014-01-01

A discrete bat algorithm (DBA) is proposed for optimal permutation flow shop scheduling problem (PFSP). Firstly, the discrete bat algorithm is constructed based on the idea of basic bat algorithm, which divide whole scheduling problem into many subscheduling problems and then NEH heuristic be introduced to solve subscheduling problem. Secondly, some subsequences are operated with certain probability in the pulse emission and loudness phases. An intensive virtual population neighborhood search is integrated into the discrete bat algorithm to further improve the performance. Finally, the experimental results show the suitability and efficiency of the present discrete bat algorithm for optimal permutation flow shop scheduling problem. PMID:25243220

Discrete bat algorithm for optimal problem of permutation flow shop scheduling.

PubMed

Luo, Qifang; Zhou, Yongquan; Xie, Jian; Ma, Mingzhi; Li, Liangliang

2014-01-01

A discrete bat algorithm (DBA) is proposed for optimal permutation flow shop scheduling problem (PFSP). Firstly, the discrete bat algorithm is constructed based on the idea of basic bat algorithm, which divide whole scheduling problem into many subscheduling problems and then NEH heuristic be introduced to solve subscheduling problem. Secondly, some subsequences are operated with certain probability in the pulse emission and loudness phases. An intensive virtual population neighborhood search is integrated into the discrete bat algorithm to further improve the performance. Finally, the experimental results show the suitability and efficiency of the present discrete bat algorithm for optimal permutation flow shop scheduling problem.

Ideal discrimination of discrete clinical endpoints using multilocus genotypes.

PubMed

Hahn, Lance W; Moore, Jason H

2004-01-01

Multifactor Dimensionality Reduction (MDR) is a method for the classification and prediction of discrete clinical endpoints using attributes constructed from multilocus genotype data. Empirical studies with both real and simulated data suggest that MDR has good power for detecting gene-gene interactions in the absence of independent main effects. The purpose of this study is to develop an objective, theory-driven approach to evaluate the strengths and limitations of MDR. To accomplish this goal, we borrow concepts from ideal observer analysis used in visual perception to evaluate the theoretical limits of classifying and predicting discrete clinical endpoints using multilocus genotype data. We conclude that MDR ideally discriminates between low risk and high risk subjects using attributes constructed from multilocus genotype data. We also how that the classification approach used once a multilocus attribute is constructed is similar to that of a naive Bayes classifier. This study provides a theoretical foundation for the continued development, evaluation, and application of the MDR as a data mining tool in the domain of statistical genetics and genetic epidemiology.

Cellular Decomposition Based Hybrid-Hierarchical Control Systems with Applications to Flight Management Systems

NASA Technical Reports Server (NTRS)

Caines, P. E.

1999-01-01

The work in this research project has been focused on the construction of a hierarchical hybrid control theory which is applicable to flight management systems. The motivation and underlying philosophical position for this work has been that the scale, inherent complexity and the large number of agents (aircraft) involved in an air traffic system imply that a hierarchical modelling and control methodology is required for its management and real time control. In the current work the complex discrete or continuous state space of a system with a small number of agents is aggregated in such a way that discrete (finite state machine or supervisory automaton) controlled dynamics are abstracted from the system's behaviour. High level control may then be either directly applied at this abstracted level, or, if this is in itself of significant complexity, further layers of abstractions may be created to produce a system with an acceptable degree of complexity at each level. By the nature of this construction, high level commands are necessarily realizable at lower levels in the system.

An Edge-Based Method for the Incompressible Navier-Stokes Equations on Polygonal Meshes

NASA Astrophysics Data System (ADS)

Wright, Jeffrey A.; Smith, Richard W.

2001-05-01

A pressure-based method is presented for discretizing the unsteady incompressible Navier-Stokes equations using hybrid unstructured meshes. The edge-based data structure and assembly procedure adopted lead naturally to a strictly conservative discretization, which is valid for meshes composed of n-sided polygons. Particular attention is given to the construction of a pressure-velocity coupling procedure which is supported by edge data, resulting in a relatively simple numerical method that is consistent with the boundary and initial conditions required by the incompressible Navier-Stokes equations. Edge formulas are presented for assembling the momentum equations, which are based on an upwind-biased linear reconstruction of the velocity field. Similar formulas are presented for assembling the pressure equation. The method is demonstrated to be second-order accurate in space and time for two Navier-Stokes problems admitting an exact solution. Results for several other well-known problems are also presented, including lid-driven cavity flow, impulsively started cylinder flow, and unsteady vortex shedding from a circular cylinder. Although the method is by construction minimalist, it is shown to be accurate and robust for the problems considered.

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

Construction of Discrete Pentanuclear Platinum(II) Stacks with Extended Metal-Metal Interactions by Using Phosphorescent Platinum(II) Tweezers.

PubMed

Kong, Fred Ka-Wai; Chan, Alan Kwun-Wa; Ng, Maggie; Low, Kam-Hung; Yam, Vivian Wing-Wah

2017-11-20

Discrete pentanuclear Pt II stacks were prepared by the host-guest adduct formation between multinuclear tweezer-type Pt II complexes. The formation of the Pt II stacks in solution was accompanied by color changes and the turning on of near-infrared emission resulting from Pt⋅⋅⋅Pt and π-π interactions. The X-ray crystal structure revealed the formation of a discrete 1:1 adduct, in which a linear stack of five Pt II centers with extended Pt⋅⋅⋅Pt interactions was observed. Additional binding affinity and stability have been achieved through a multinuclear host-guest system. The binding behaviors can be fine-tuned by varying the spacer between the two Pt II moieties in the guests. This work provides important insights for the construction of discrete higher-order supramolecular metal-ligand aggregates using a tweezer-directed approach. © 2017 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

Distinguishing discrete and gradient category structure in language: Insights from verb-particle constructions.

PubMed

Brehm, Laurel; Goldrick, Matthew

2017-10-01

The current work uses memory errors to examine the mental representation of verb-particle constructions (VPCs; e.g., make up the story, cut up the meat). Some evidence suggests that VPCs are represented by a cline in which the relationship between the VPC and its component elements ranges from highly transparent (cut up) to highly idiosyncratic (make up). Other evidence supports a multiple class representation, characterizing VPCs as belonging to discretely separated classes differing in semantic and syntactic structure. We outline a novel paradigm to investigate the representation of VPCs in which we elicit illusory conjunctions, or memory errors sensitive to syntactic structure. We then use a novel application of piecewise regression to demonstrate that the resulting error pattern follows a cline rather than discrete classes. A preregistered replication verifies these findings, and a final preregistered study verifies that these errors reflect syntactic structure. This provides evidence for gradient rather than discrete representations across levels of representation in language processing. (PsycINFO Database Record (c) 2017 APA, all rights reserved).

Revisiting the Least-squares Procedure for Gradient Reconstruction on Unstructured Meshes

NASA Technical Reports Server (NTRS)

Mavriplis, Dimitri J.; Thomas, James L. (Technical Monitor)

2003-01-01

The accuracy of the least-squares technique for gradient reconstruction on unstructured meshes is examined. While least-squares techniques produce accurate results on arbitrary isotropic unstructured meshes, serious difficulties exist for highly stretched meshes in the presence of surface curvature. In these situations, gradients are typically under-estimated by up to an order of magnitude. For vertex-based discretizations on triangular and quadrilateral meshes, and cell-centered discretizations on quadrilateral meshes, accuracy can be recovered using an inverse distance weighting in the least-squares construction. For cell-centered discretizations on triangles, both the unweighted and weighted least-squares constructions fail to provide suitable gradient estimates for highly stretched curved meshes. Good overall flow solution accuracy can be retained in spite of poor gradient estimates, due to the presence of flow alignment in exactly the same regions where the poor gradient accuracy is observed. However, the use of entropy fixes has the potential for generating large but subtle discretization errors.

Topics in spectral methods

NASA Technical Reports Server (NTRS)

Gottlieb, D.; Turkel, E.

1985-01-01

After detailing the construction of spectral approximations to time-dependent mixed initial boundary value problems, a study is conducted of differential equations of the form 'partial derivative of u/partial derivative of t = Lu + f', where for each t, u(t) belongs to a Hilbert space such that u satisfies homogeneous boundary conditions. For the sake of simplicity, it is assumed that L is an unbounded, time-independent linear operator. Attention is given to Fourier methods of both Galerkin and pseudospectral method types, the Galerkin method, the pseudospectral Chebyshev and Legendre methods, the error equation, hyperbolic partial differentiation equations, and time discretization and iterative methods.

Coulomb branches with complex singularities

NASA Astrophysics Data System (ADS)

Argyres, Philip C.; Martone, Mario

2018-06-01

We construct 4d superconformal field theories (SCFTs) whose Coulomb branches have singular complex structures. This implies, in particular, that their Coulomb branch coordinate rings are not freely generated. Our construction also gives examples of distinct SCFTs which have identical moduli space (Coulomb, Higgs, and mixed branch) geometries. These SCFTs thus provide an interesting arena in which to test the relationship between moduli space geometries and conformal field theory data. We construct these SCFTs by gauging certain discrete global symmetries of N = 4 superYang-Mills (sYM) theories. In the simplest cases, these discrete symmetries are outer automorphisms of the sYM gauge group, and so these theories have lagrangian descriptions as N = 4 sYM theories with disconnected gauge groups.

Variational Integrators for Interconnected Lagrange-Dirac Systems

NASA Astrophysics Data System (ADS)

Parks, Helen; Leok, Melvin

2017-10-01

Interconnected systems are an important class of mathematical models, as they allow for the construction of complex, hierarchical, multiphysics, and multiscale models by the interconnection of simpler subsystems. Lagrange-Dirac mechanical systems provide a broad category of mathematical models that are closed under interconnection, and in this paper, we develop a framework for the interconnection of discrete Lagrange-Dirac mechanical systems, with a view toward constructing geometric structure-preserving discretizations of interconnected systems. This work builds on previous work on the interconnection of continuous Lagrange-Dirac systems (Jacobs and Yoshimura in J Geom Mech 6(1):67-98, 2014) and discrete Dirac variational integrators (Leok and Ohsawa in Found Comput Math 11(5), 529-562, 2011). We test our results by simulating some of the continuous examples given in Jacobs and Yoshimura (2014).

Construction of Mathematical Definitions: An Epistemological and Didactical Study

ERIC Educational Resources Information Center

Ouvrier-Buffet, Cecile

2004-01-01

The definition-construction process is central to mathematics. The aim of this paper is to propose a few Situations of Definition-Construction (called SDC) and to study them. Our main objectives are to describe the definition-construction process and to design SDC for classroom. A SDC on "discrete straight line" and its mathematical and…

Measurement of discrete vertical in-shoe stress with piezoelectric transducers.

PubMed

Gross, T S; Bunch, R P

1988-05-01

The purpose of this investigation was to design and validate a system suitable for non-invasive measurement of discrete in-shoe vertical plantar stress during dynamic activities. Eight transducers were constructed, with small piezoelectric ceramic squares (4.83 x 4.83 x 1.3 mm) used to generate a charge output proportional to vertical plantar stress. The mechanical properties of the transducers included 2.3% linearity and 3.7% hysteresis for stresses up to 2000 kPa and loading times up to 200 ms. System design efficacy was analysed by means of a multiple day, multiple trial data collection. With the transducers placed beneath plantar landmarks, the footstrike of one subject was recorded ten times on each of five days while running at 3.58 m/s on a treadmill. Within-day and between-day proportional error (PE) was used to estimate the error contained in the mean peak stress during foot contact. Within-day PE focused on trial to trial variability associated with the subject and equipment, and averaged 3.1% (range 2.5-4.0%) across transducer location. Between-day PE provided a cumulative estimate of subject, transducer placement, and random equipment variability, but excluded trial to trial variability. It ranged from 4.9 to 15.8%, with a mean of 9.9%. Peak stress, impulse, and sequence of loading data were examined to identify discrete foot function patterns and highlight the value of discrete stress analysis.

ON THE ROLE OF INVOLUTIONS IN THE DISCONTINUOUS GALERKIN DISCRETIZATION OF MAXWELL AND MAGNETOHYDRODYNAMIC SYSTEMS

NASA Technical Reports Server (NTRS)

Barth, Timothy

2005-01-01

The role of involutions in energy stability of the discontinuous Galerkin (DG) discretization of Maxwell and magnetohydrodynamic (MHD) systems is examined. Important differences are identified in the symmetrization of the Maxwell and MHD systems that impact the construction of energy stable discretizations using the DG method. Specifically, general sufficient conditions to be imposed on the DG numerical flux and approximation space are given so that energy stability is retained These sufficient conditions reveal the favorable energy consequence of imposing continuity in the normal component of the magnetic induction field at interelement boundaries for MHD discretizations. Counterintuitively, this condition is not required for stability of Maxwell discretizations using the discontinuous Galerkin method.

Development of upwind schemes for the Euler equations

NASA Technical Reports Server (NTRS)

Chakravarthy, Sukumar R.

1987-01-01

Described are many algorithmic and computational aspects of upwind schemes and their second-order accurate formulations based on Total-Variation-Diminishing (TVD) approaches. An operational unification of the underlying first-order scheme is first presented encompassing Godunov's, Roe's, Osher's, and Split-Flux methods. For higher order versions, the preprocessing and postprocessing approaches to constructing TVD discretizations are considered. TVD formulations can be used to construct relaxation methods for unfactored implicit upwind schemes, which in turn can be exploited to construct space-marching procedures for even the unsteady Euler equations. A major part of the report describes time- and space-marching procedures for solving the Euler equations in 2-D, 3-D, Cartesian, and curvilinear coordinates. Along with many illustrative examples, several results of efficient computations on 3-D supersonic flows with subsonic pockets are presented.

Discrete cosine and sine transforms generalized to honeycomb lattice

NASA Astrophysics Data System (ADS)

Hrivnák, Jiří; Motlochová, Lenka

2018-06-01

The discrete cosine and sine transforms are generalized to a triangular fragment of the honeycomb lattice. The honeycomb point sets are constructed by subtracting the root lattice from the weight lattice points of the crystallographic root system A2. The two-variable orbit functions of the Weyl group of A2, discretized simultaneously on the weight and root lattices, induce a novel parametric family of extended Weyl orbit functions. The periodicity and von Neumann and Dirichlet boundary properties of the extended Weyl orbit functions are detailed. Three types of discrete complex Fourier-Weyl transforms and real-valued Hartley-Weyl transforms are described. Unitary transform matrices and interpolating behavior of the discrete transforms are exemplified. Consequences of the developed discrete transforms for transversal eigenvibrations of the mechanical graphene model are discussed.

Mathematical Methods of Communication Signal Design

DTIC Science & Technology

1990-09-30

Labelling of Annals of Discrete Math ., 1989-90. iv. T. Etzion, S.W. Golomb, and H. Taylor, "Polygonal Path Constructions for Tuscan-k Squares...the Special Issue on Graph Labellings of A,.nals of Discrete Math ., 1989-1990. vi. T. Etzion, "An Algorithm for Realization of Permutations in a

33 CFR 323.4 - Discharges not requiring permits.

Code of Federal Regulations, 2013 CFR

2013-07-01

... discrete structures and the installation of support facilities necessary for construction and utilization... construction of any canal, ditch, dike or other waterway or structure which drains or otherwise significantly... construction of any such structure or waterway requires a permit. (D) Plowing means all forms of primary...

33 CFR 323.4 - Discharges not requiring permits.

Code of Federal Regulations, 2011 CFR

2011-07-01

... discrete structures and the installation of support facilities necessary for construction and utilization... construction of any canal, ditch, dike or other waterway or structure which drains or otherwise significantly... construction of any such structure or waterway requires a permit. (D) Plowing means all forms of primary...

33 CFR 323.4 - Discharges not requiring permits.

Code of Federal Regulations, 2014 CFR

2014-07-01

... discrete structures and the installation of support facilities necessary for construction and utilization... construction of any canal, ditch, dike or other waterway or structure which drains or otherwise significantly... construction of any such structure or waterway requires a permit. (D) Plowing means all forms of primary...

33 CFR 323.4 - Discharges not requiring permits.

Code of Federal Regulations, 2012 CFR

2012-07-01

... discrete structures and the installation of support facilities necessary for construction and utilization... construction of any canal, ditch, dike or other waterway or structure which drains or otherwise significantly... construction of any such structure or waterway requires a permit. (D) Plowing means all forms of primary...

An adaptive discretization of incompressible flow using a multitude of moving Cartesian grids

NASA Astrophysics Data System (ADS)

English, R. Elliot; Qiu, Linhai; Yu, Yue; Fedkiw, Ronald

2013-12-01

We present a novel method for discretizing the incompressible Navier-Stokes equations on a multitude of moving and overlapping Cartesian grids each with an independently chosen cell size to address adaptivity. Advection is handled with first and second order accurate semi-Lagrangian schemes in order to alleviate any time step restriction associated with small grid cell sizes. Likewise, an implicit temporal discretization is used for the parabolic terms including Navier-Stokes viscosity which we address separately through the development of a method for solving the heat diffusion equations. The most intricate aspect of any such discretization is the method used in order to solve the elliptic equation for the Navier-Stokes pressure or that resulting from the temporal discretization of parabolic terms. We address this by first removing any degrees of freedom which duplicately cover spatial regions due to overlapping grids, and then providing a discretization for the remaining degrees of freedom adjacent to these regions. We observe that a robust second order accurate symmetric positive definite readily preconditioned discretization can be obtained by constructing a local Voronoi region on the fly for each degree of freedom in question in order to obtain both its stencil (logically connected neighbors) and stencil weights. Internal curved boundaries such as at solid interfaces are handled using a simple immersed boundary approach which is directly applied to the Voronoi mesh in both the viscosity and pressure solves. We independently demonstrate each aspect of our approach on test problems in order to show efficacy and convergence before finally addressing a number of common test cases for incompressible flow with stationary and moving solid bodies.

The Effects of Time Advance Mechanism on Simple Agent Behaviors in Combat Simulations

DTIC Science & Technology

2011-12-01

modeling packages that illustrate the differences between discrete-time simulation (DTS) and discrete-event simulation ( DES ) methodologies. Many combat... DES ) models , often referred to as “next-event” (Law and Kelton 2000) or discrete time simulation (DTS), commonly referred to as “time-step.” DTS...discrete-time simulation (DTS) and discrete-event simulation ( DES ) methodologies. Many combat models use DTS as their simulation time advance mechanism

Event-driven Monte Carlo: Exact dynamics at all time scales for discrete-variable models

NASA Astrophysics Data System (ADS)

Mendoza-Coto, Alejandro; Díaz-Méndez, Rogelio; Pupillo, Guido

2016-06-01

We present an algorithm for the simulation of the exact real-time dynamics of classical many-body systems with discrete energy levels. In the same spirit of kinetic Monte Carlo methods, a stochastic solution of the master equation is found, with no need to define any other phase-space construction. However, unlike existing methods, the present algorithm does not assume any particular statistical distribution to perform moves or to advance the time, and thus is a unique tool for the numerical exploration of fast and ultra-fast dynamical regimes. By decomposing the problem in a set of two-level subsystems, we find a natural variable step size, that is well defined from the normalization condition of the transition probabilities between the levels. We successfully test the algorithm with known exact solutions for non-equilibrium dynamics and equilibrium thermodynamical properties of Ising-spin models in one and two dimensions, and compare to standard implementations of kinetic Monte Carlo methods. The present algorithm is directly applicable to the study of the real-time dynamics of a large class of classical Markovian chains, and particularly to short-time situations where the exact evolution is relevant.

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

Discretely Self-Similar Solutions to the Navier-Stokes Equations with Besov Space Data

NASA Astrophysics Data System (ADS)

Bradshaw, Zachary; Tsai, Tai-Peng

2018-07-01

We construct self-similar solutions to the three dimensional Navier-Stokes equations for divergence free, self-similar initial data that can be large in the critical Besov space \\dot{B}_{p,∞}^{3/p-1} where 3 < p < 6. We also construct discretely self-similar solutions for divergence free initial data in \\dot{B}_{p,∞}^{3/p-1} for 3 < p < 6 that is discretely self-similar for some scaling factor λ > 1. These results extend those of Bradshaw and Tsai (Ann Henri Poincaré 2016. https://doi.org/10.1007/s00023-016-0519-0) which dealt with initial data in L 3 w since {L^3_w\\subsetneq \\dot{B}_{p,∞}^{3/p-1}} for p > 3. We also provide several concrete examples of vector fields in the relevant function spaces.

A dispersion minimizing scheme for the 3-D Helmholtz equation based on ray theory

NASA Astrophysics Data System (ADS)

Stolk, Christiaan C.

2016-06-01

We develop a new dispersion minimizing compact finite difference scheme for the Helmholtz equation in 2 and 3 dimensions. The scheme is based on a newly developed ray theory for difference equations. A discrete Helmholtz operator and a discrete operator to be applied to the source and the wavefields are constructed. Their coefficients are piecewise polynomial functions of hk, chosen such that phase and amplitude errors are minimal. The phase errors of the scheme are very small, approximately as small as those of the 2-D quasi-stabilized FEM method and substantially smaller than those of alternatives in 3-D, assuming the same number of gridpoints per wavelength is used. In numerical experiments, accurate solutions are obtained in constant and smoothly varying media using meshes with only five to six points per wavelength and wave propagation over hundreds of wavelengths. When used as a coarse level discretization in a multigrid method the scheme can even be used with down to three points per wavelength. Tests on 3-D examples with up to 108 degrees of freedom show that with a recently developed hybrid solver, the use of coarser meshes can lead to corresponding savings in computation time, resulting in good simulation times compared to the literature.

A Unified Approach to Adaptive Neural Control for Nonlinear Discrete-Time Systems With Nonlinear Dead-Zone Input.

PubMed

Liu, Yan-Jun; Gao, Ying; Tong, Shaocheng; Chen, C L Philip

2016-01-01

In this paper, an effective adaptive control approach is constructed to stabilize a class of nonlinear discrete-time systems, which contain unknown functions, unknown dead-zone input, and unknown control direction. Different from linear dead zone, the dead zone, in this paper, is a kind of nonlinear dead zone. To overcome the noncausal problem, which leads to the control scheme infeasible, the systems can be transformed into a m -step-ahead predictor. Due to nonlinear dead-zone appearance, the transformed predictor still contains the nonaffine function. In addition, it is assumed that the gain function of dead-zone input and the control direction are unknown. These conditions bring about the difficulties and the complicacy in the controller design. Thus, the implicit function theorem is applied to deal with nonaffine dead-zone appearance, the problem caused by the unknown control direction can be resolved through applying the discrete Nussbaum gain, and the neural networks are used to approximate the unknown function. Based on the Lyapunov theory, all the signals of the resulting closed-loop system are proved to be semiglobal uniformly ultimately bounded. Moreover, the tracking error is proved to be regulated to a small neighborhood around zero. The feasibility of the proposed approach is demonstrated by a simulation example.

Illustrating chaos: a schematic discretization of the general three-body problem in Newtonian gravity

NASA Astrophysics Data System (ADS)

Leigh, Nathan W. C.; Wegsman, Shalma

2018-05-01

We present a formalism for constructing schematic diagrams to depict chaotic three-body interactions in Newtonian gravity. This is done by decomposing each interaction into a series of discrete transformations in energy- and angular momentum-space. Each time a transformation is applied, the system changes state as the particles re-distribute their energy and angular momenta. These diagrams have the virtue of containing all of the quantitative information needed to fully characterize most bound or unbound interactions through time and space, including the total duration of the interaction, the initial and final stable states in addition to every intervening temporary meta-stable state. As shown via an illustrative example for the bound case, prolonged excursions of one of the particles, which by far dominates the computational cost of the simulations, are reduced to a single discrete transformation in energy- and angular momentum-space, thereby potentially mitigating any computational expense. We further generalize our formalism to sequences of (unbound) three-body interactions, as occur in dense stellar environments during binary hardening. Finally, we provide a method for dynamically evolving entire populations of binaries via three-body scattering interactions, using a purely analytic formalism. In principle, the techniques presented here are adaptable to other three-body problems that conserve energy and angular momentum.

A H-infinity Fault Detection and Diagnosis Scheme for Discrete Nonlinear System Using Output Probability Density Estimation

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

Zhang Yumin; Lum, Kai-Yew; Wang Qingguo

In this paper, a H-infinity fault detection and diagnosis (FDD) scheme for a class of discrete nonlinear system fault using output probability density estimation is presented. Unlike classical FDD problems, the measured output of the system is viewed as a stochastic process and its square root probability density function (PDF) is modeled with B-spline functions, which leads to a deterministic space-time dynamic model including nonlinearities, uncertainties. A weighting mean value is given as an integral function of the square root PDF along space direction, which leads a function only about time and can be used to construct residual signal. Thus,more » the classical nonlinear filter approach can be used to detect and diagnose the fault in system. A feasible detection criterion is obtained at first, and a new H-infinity adaptive fault diagnosis algorithm is further investigated to estimate the fault. Simulation example is given to demonstrate the effectiveness of the proposed approaches.« less

A H-infinity Fault Detection and Diagnosis Scheme for Discrete Nonlinear System Using Output Probability Density Estimation

NASA Astrophysics Data System (ADS)

Zhang, Yumin; Wang, Qing-Guo; Lum, Kai-Yew

2009-03-01

In this paper, a H-infinity fault detection and diagnosis (FDD) scheme for a class of discrete nonlinear system fault using output probability density estimation is presented. Unlike classical FDD problems, the measured output of the system is viewed as a stochastic process and its square root probability density function (PDF) is modeled with B-spline functions, which leads to a deterministic space-time dynamic model including nonlinearities, uncertainties. A weighting mean value is given as an integral function of the square root PDF along space direction, which leads a function only about time and can be used to construct residual signal. Thus, the classical nonlinear filter approach can be used to detect and diagnose the fault in system. A feasible detection criterion is obtained at first, and a new H-infinity adaptive fault diagnosis algorithm is further investigated to estimate the fault. Simulation example is given to demonstrate the effectiveness of the proposed approaches.

Fault-tolerant optimised tracking control for unknown discrete-time linear systems using a combined reinforcement learning and residual compensation methodology

NASA Astrophysics Data System (ADS)

Han, Ke-Zhen; Feng, Jian; Cui, Xiaohong

2017-10-01

This paper considers the fault-tolerant optimised tracking control (FTOTC) problem for unknown discrete-time linear system. A research scheme is proposed on the basis of data-based parity space identification, reinforcement learning and residual compensation techniques. The main characteristic of this research scheme lies in the parity-space-identification-based simultaneous tracking control and residual compensation. The specific technical line consists of four main contents: apply subspace aided method to design observer-based residual generator; use reinforcement Q-learning approach to solve optimised tracking control policy; rely on robust H∞ theory to achieve noise attenuation; adopt fault estimation triggered by residual generator to perform fault compensation. To clarify the design and implementation procedures, an integrated algorithm is further constructed to link up these four functional units. The detailed analysis and proof are subsequently given to explain the guaranteed FTOTC performance of the proposed conclusions. Finally, a case simulation is provided to verify its effectiveness.

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.

Efficient genetic algorithms using discretization scheduling.

PubMed

McLay, Laura A; Goldberg, David E

2005-01-01

In many applications of genetic algorithms, there is a tradeoff between speed and accuracy in fitness evaluations when evaluations use numerical methods with varying discretization. In these types of applications, the cost and accuracy vary from discretization errors when implicit or explicit quadrature is used to estimate the function evaluations. This paper examines discretization scheduling, or how to vary the discretization within the genetic algorithm in order to use the least amount of computation time for a solution of a desired quality. The effectiveness of discretization scheduling can be determined by comparing its computation time to the computation time of a GA using a constant discretization. There are three ingredients for the discretization scheduling: population sizing, estimated time for each function evaluation and predicted convergence time analysis. Idealized one- and two-dimensional experiments and an inverse groundwater application illustrate the computational savings to be achieved from using discretization scheduling.

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.

An Embedded 3D Fracture Modeling Approach for Simulating Fracture-Dominated Fluid Flow and Heat Transfer in Geothermal Reservoirs

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

Johnston, Henry; Wang, Cong; Winterfeld, Philip

An efficient modeling approach is described for incorporating arbitrary 3D, discrete fractures, such as hydraulic fractures or faults, into modeling fracture-dominated fluid flow and heat transfer in fractured geothermal reservoirs. This technique allows 3D discrete fractures to be discretized independently from surrounding rock volume and inserted explicitly into a primary fracture/matrix grid, generated without including 3D discrete fractures in prior. An effective computational algorithm is developed to discretize these 3D discrete fractures and construct local connections between 3D fractures and fracture/matrix grid blocks of representing the surrounding rock volume. The constructed gridding information on 3D fractures is then added tomore » the primary grid. This embedded fracture modeling approach can be directly implemented into a developed geothermal reservoir simulator via the integral finite difference (IFD) method or with TOUGH2 technology This embedded fracture modeling approach is very promising and computationally efficient to handle realistic 3D discrete fractures with complicated geometries, connections, and spatial distributions. Compared with other fracture modeling approaches, it avoids cumbersome 3D unstructured, local refining procedures, and increases computational efficiency by simplifying Jacobian matrix size and sparsity, while keeps sufficient accuracy. Several numeral simulations are present to demonstrate the utility and robustness of the proposed technique. Our numerical experiments show that this approach captures all the key patterns about fluid flow and heat transfer dominated by fractures in these cases. Thus, this approach is readily available to simulation of fractured geothermal reservoirs with both artificial and natural fractures.« less

Constructing Contracts: Making Discrete Mathematics Relevant to Beginning Programmers

ERIC Educational Resources Information Center

Gegg-Harrison, Timothy S.

2005-01-01

Although computer scientists understand the importance of discrete mathematics to the foundations of their field, computer science (CS) students do not always see the relevance. Thus, it is important to find a way to show students its relevance. The concept of program correctness is generally taught as an activity independent of the programming…

Integrable Seven-Point Discrete Equations and Second-Order Evolution Chains

NASA Astrophysics Data System (ADS)

Adler, V. E.

2018-04-01

We consider differential-difference equations defining continuous symmetries for discrete equations on a triangular lattice. We show that a certain combination of continuous flows can be represented as a secondorder scalar evolution chain. We illustrate the general construction with a set of examples including an analogue of the elliptic Yamilov chain.

Gröbner Bases and Generation of Difference Schemes for Partial Differential Equations

NASA Astrophysics Data System (ADS)

Gerdt, Vladimir P.; Blinkov, Yuri A.; Mozzhilkin, Vladimir V.

2006-05-01

In this paper we present an algorithmic approach to the generation of fully conservative difference schemes for linear partial differential equations. The approach is based on enlargement of the equations in their integral conservation law form by extra integral relations between unknown functions and their derivatives, and on discretization of the obtained system. The structure of the discrete system depends on numerical approximation methods for the integrals occurring in the enlarged system. As a result of the discretization, a system of linear polynomial difference equations is derived for the unknown functions and their partial derivatives. A difference scheme is constructed by elimination of all the partial derivatives. The elimination can be achieved by selecting a proper elimination ranking and by computing a Gröbner basis of the linear difference ideal generated by the polynomials in the discrete system. For these purposes we use the difference form of Janet-like Gröbner bases and their implementation in Maple. As illustration of the described methods and algorithms, we construct a number of difference schemes for Burgers and Falkowich-Karman equations and discuss their numerical properties.

Simulation of value stream mapping and discrete optimization of energy consumption in modular construction

NASA Astrophysics Data System (ADS)

Chowdhury, Md Mukul

With the increased practice of modularization and prefabrication, the construction industry gained the benefits of quality management, improved completion time, reduced site disruption and vehicular traffic, and improved overall safety and security. Whereas industrialized construction methods, such as modular and manufactured buildings, have evolved over decades, core techniques used in prefabrication plants vary only slightly from those employed in traditional site-built construction. With a focus on energy and cost efficient modular construction, this research presents the development of a simulation, measurement and optimization system for energy consumption in the manufacturing process of modular construction. The system is based on Lean Six Sigma principles and loosely coupled system operation to identify the non-value adding tasks and possible causes of low energy efficiency. The proposed system will also include visualization functions for demonstration of energy consumption in modular construction. The benefits of implementing this system include a reduction in the energy consumption in production cost, decrease of energy cost in the production of lean-modular construction, and increase profit. In addition, the visualization functions will provide detailed information about energy efficiency and operation flexibility in modular construction. A case study is presented to validate the reliability of the system.

On multigrid solution of the implicit equations of hydrodynamics. Experiments for the compressible Euler equations in general coordinates

NASA Astrophysics Data System (ADS)

Kifonidis, K.; Müller, E.

2012-08-01

Aims: We describe and study a family of new multigrid iterative solvers for the multidimensional, implicitly discretized equations of hydrodynamics. Schemes of this class are free of the Courant-Friedrichs-Lewy condition. They are intended for simulations in which widely differing wave propagation timescales are present. A preferred solver in this class is identified. Applications to some simple stiff test problems that are governed by the compressible Euler equations, are presented to evaluate the convergence behavior, and the stability properties of this solver. Algorithmic areas are determined where further work is required to make the method sufficiently efficient and robust for future application to difficult astrophysical flow problems. Methods: The basic equations are formulated and discretized on non-orthogonal, structured curvilinear meshes. Roe's approximate Riemann solver and a second-order accurate reconstruction scheme are used for spatial discretization. Implicit Runge-Kutta (ESDIRK) schemes are employed for temporal discretization. The resulting discrete equations are solved with a full-coarsening, non-linear multigrid method. Smoothing is performed with multistage-implicit smoothers. These are applied here to the time-dependent equations by means of dual time stepping. Results: For steady-state problems, our results show that the efficiency of the present approach is comparable to the best implicit solvers for conservative discretizations of the compressible Euler equations that can be found in the literature. The use of red-black as opposed to symmetric Gauss-Seidel iteration in the multistage-smoother is found to have only a minor impact on multigrid convergence. This should enable scalable parallelization without having to seriously compromise the method's algorithmic efficiency. For time-dependent test problems, our results reveal that the multigrid convergence rate degrades with increasing Courant numbers (i.e. time step sizes). Beyond a Courant number of nine thousand, even complete multigrid breakdown is observed. Local Fourier analysis indicates that the degradation of the convergence rate is associated with the coarse-grid correction algorithm. An implicit scheme for the Euler equations that makes use of the present method was, nevertheless, able to outperform a standard explicit scheme on a time-dependent problem with a Courant number of order 1000. Conclusions: For steady-state problems, the described approach enables the construction of parallelizable, efficient, and robust implicit hydrodynamics solvers. The applicability of the method to time-dependent problems is presently restricted to cases with moderately high Courant numbers. This is due to an insufficient coarse-grid correction of the employed multigrid algorithm for large time steps. Further research will be required to help us to understand and overcome the observed multigrid convergence difficulties for time-dependent problems.

Modulational Instability and Quantum Discrete Breather States of Cold Bosonic Atoms in a Zig-Zag Optical Lattice

NASA Astrophysics Data System (ADS)

Chang, Xia; Xie, Jiayu; Wu, Tianle; Tang, Bing

2018-07-01

A theoretical study on modulational instability and quantum discrete breather states in a system of cold bosonic atoms in zig-zag optical lattices is presented in this work. The time-dependent Hartree approximation is employed to deal with the multiple body problem. By means of a linear stability analysis, we analytically study the modulational instability, and estimate existence conditions of the bright stationary localized solutions for different values of the second-neighbor hopping constant. On the other hand, we get analytical bright stationary localized solutions, and analyze the influence of the second-neighbor hopping on their existence conditions. The predictions of the modulational instability analysis are shown to be reliable. Using these stationary localized single-boson wave functions, the quantum breather states corresponding to the system with different types of nonlinearities are constructed.

Discrete Velocity Models for Polyatomic Molecules Without Nonphysical Collision Invariants

NASA Astrophysics Data System (ADS)

Bernhoff, Niclas

2018-05-01

An important aspect of constructing discrete velocity models (DVMs) for the Boltzmann equation is to obtain the right number of collision invariants. Unlike for the Boltzmann equation, for DVMs there can appear extra collision invariants, so called spurious collision invariants, in plus to the physical ones. A DVM with only physical collision invariants, and hence, without spurious ones, is called normal. The construction of such normal DVMs has been studied a lot in the literature for single species, but also for binary mixtures and recently extensively for multicomponent mixtures. In this paper, we address ways of constructing normal DVMs for polyatomic molecules (here represented by that each molecule has an internal energy, to account for non-translational energies, which can change during collisions), under the assumption that the set of allowed internal energies are finite. We present general algorithms for constructing such models, but we also give concrete examples of such constructions. This approach can also be combined with similar constructions of multicomponent mixtures to obtain multicomponent mixtures with polyatomic molecules, which is also briefly outlined. Then also, chemical reactions can be added.

Mimicking Nonequilibrium Steady States with Time-Periodic Driving

NASA Astrophysics Data System (ADS)

Raz, Oren; Subasi, Yigit; Jarzynski, Christopher

Under static conditions, a system satisfying detailed balance generically relaxes to an equilibrium state in which there are no currents: to generate persistent currents, either detailed balance must be broken or the system must be driven in a time-dependent manner. A stationary system that violates detailed balance evolves to a nonequilibrium steady state (NESS) characterized by fixed currents. Conversely, a system that satisfies instantaneous detailed balance but is driven by the time-periodic variation of external parameters - also known as a stochastic pump (SP) - reaches a periodic state with non-vanishing currents. In both cases, these currents are maintained at the cost of entropy production. Are these two paradigmatic scenarios effectively equivalent? For discrete-state systems we establish a mapping between NESS and SP. Given a NESS characterized by a particular set of stationary probabilities, currents and entropy production rates, we show how to construct a SP with exactly the same (time-averaged) values. The mapping works in the opposite direction as well. These results establish a proof of principle: they show that SP are able to mimic the behavior of NESS, and vice-versa, within the theoretical framework of discrete-state stochastic thermodynamics.

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

PubMed

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

2009-07-01

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

A high-order positivity-preserving single-stage single-step method for the ideal magnetohydrodynamic equations

NASA Astrophysics Data System (ADS)

Christlieb, Andrew J.; Feng, Xiao; Seal, David C.; Tang, Qi

2016-07-01

We propose a high-order finite difference weighted ENO (WENO) method for the ideal magnetohydrodynamics (MHD) equations. The proposed method is single-stage (i.e., it has no internal stages to store), single-step (i.e., it has no time history that needs to be stored), maintains a discrete divergence-free condition on the magnetic field, and has the capacity to preserve the positivity of the density and pressure. To accomplish this, we use a Taylor discretization of the Picard integral formulation (PIF) of the finite difference WENO method proposed in Christlieb et al. (2015) [23], where the focus is on a high-order discretization of the fluxes (as opposed to the conserved variables). We use the version where fluxes are expanded to third-order accuracy in time, and for the fluid variables space is discretized using the classical fifth-order finite difference WENO discretization. We use constrained transport in order to obtain divergence-free magnetic fields, which means that we simultaneously evolve the magnetohydrodynamic (that has an evolution equation for the magnetic field) and magnetic potential equations alongside each other, and set the magnetic field to be the (discrete) curl of the magnetic potential after each time step. In this work, we compute these derivatives to fourth-order accuracy. In order to retain a single-stage, single-step method, we develop a novel Lax-Wendroff discretization for the evolution of the magnetic potential, where we start with technology used for Hamilton-Jacobi equations in order to construct a non-oscillatory magnetic field. The end result is an algorithm that is similar to our previous work Christlieb et al. (2014) [8], but this time the time stepping is replaced through a Taylor method with the addition of a positivity-preserving limiter. Finally, positivity preservation is realized by introducing a parameterized flux limiter that considers a linear combination of high and low-order numerical fluxes. The choice of the free parameter is then given in such a way that the fluxes are limited towards the low-order solver until positivity is attained. Given the lack of additional degrees of freedom in the system, this positivity limiter lacks energy conservation where the limiter turns on. However, this ingredient can be dropped for problems where the pressure does not become negative. We present two and three dimensional numerical results for several standard test problems including a smooth Alfvén wave (to verify formal order of accuracy), shock tube problems (to test the shock-capturing ability of the scheme), Orszag-Tang, and cloud shock interactions. These results assert the robustness and verify the high-order of accuracy of the proposed scheme.

Channel lining with fiber reinforced shotcrete

DOT National Transportation Integrated Search

1992-07-01

The Arizona Department of Transportation (ADOT) has used four brands of discrete synthetic fibers in a drainage outfall channel lining as part of construction project ACI-10-3(270). The use of the fibers was intended to test the constructibility and ...

Efficient Algorithms for Segmentation of Item-Set Time Series

NASA Astrophysics Data System (ADS)

Chundi, Parvathi; Rosenkrantz, Daniel J.

We propose a special type of time series, which we call an item-set time series, to facilitate the temporal analysis of software version histories, email logs, stock market data, etc. In an item-set time series, each observed data value is a set of discrete items. We formalize the concept of an item-set time series and present efficient algorithms for segmenting a given item-set time series. Segmentation of a time series partitions the time series into a sequence of segments where each segment is constructed by combining consecutive time points of the time series. Each segment is associated with an item set that is computed from the item sets of the time points in that segment, using a function which we call a measure function. We then define a concept called the segment difference, which measures the difference between the item set of a segment and the item sets of the time points in that segment. The segment difference values are required to construct an optimal segmentation of the time series. We describe novel and efficient algorithms to compute segment difference values for each of the measure functions described in the paper. We outline a dynamic programming based scheme to construct an optimal segmentation of the given item-set time series. We use the item-set time series segmentation techniques to analyze the temporal content of three different data sets—Enron email, stock market data, and a synthetic data set. The experimental results show that an optimal segmentation of item-set time series data captures much more temporal content than a segmentation constructed based on the number of time points in each segment, without examining the item set data at the time points, and can be used to analyze different types of temporal data.

Mapping of uncertainty relations between continuous and discrete time

NASA Astrophysics Data System (ADS)

Chiuchiú, Davide; Pigolotti, Simone

2018-03-01

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

Mapping of uncertainty relations between continuous and discrete time.

PubMed

Chiuchiù, Davide; Pigolotti, Simone

2018-03-01

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

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

PubMed

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

2017-10-01

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

Weight-lattice discretization of Weyl-orbit functions

NASA Astrophysics Data System (ADS)

Hrivnák, Jiří; Walton, Mark A.

2016-08-01

Weyl-orbit functions have been defined for each simple Lie algebra, and permit Fourier-like analysis on the fundamental region of the corresponding affine Weyl group. They have also been discretized, using a refinement of the coweight lattice, so that digitized data on the fundamental region can be Fourier-analyzed. The discretized orbit function has arguments that are redundant if related by the affine Weyl group, while its labels, the Weyl-orbit representatives, invoke the dual affine Weyl group. Here we discretize the orbit functions in a novel way, by using the weight lattice. A cleaner theory results with symmetry between the arguments and labels of the discretized orbit functions. Orthogonality of the new discretized orbit functions is proved, and leads to the construction of unitary, symmetric matrices with Weyl-orbit-valued elements. For one type of orbit function, the matrix coincides with the Kac-Peterson modular S matrix, important for Wess-Zumino-Novikov-Witten conformal field theory.

Electrical Resistivity Tomography using a finite element based BFGS algorithm with algebraic multigrid preconditioning

NASA Astrophysics Data System (ADS)

Codd, A. L.; Gross, L.

2018-03-01

We present a new inversion method for Electrical Resistivity Tomography which, in contrast to established approaches, minimizes the cost function prior to finite element discretization for the unknown electric conductivity and electric potential. Minimization is performed with the Broyden-Fletcher-Goldfarb-Shanno method (BFGS) in an appropriate function space. BFGS is self-preconditioning and avoids construction of the dense Hessian which is the major obstacle to solving large 3-D problems using parallel computers. In addition to the forward problem predicting the measurement from the injected current, the so-called adjoint problem also needs to be solved. For this problem a virtual current is injected through the measurement electrodes and an adjoint electric potential is obtained. The magnitude of the injected virtual current is equal to the misfit at the measurement electrodes. This new approach has the advantage that the solution process of the optimization problem remains independent to the meshes used for discretization and allows for mesh adaptation during inversion. Computation time is reduced by using superposition of pole loads for the forward and adjoint problems. A smoothed aggregation algebraic multigrid (AMG) preconditioned conjugate gradient is applied to construct the potentials for a given electric conductivity estimate and for constructing a first level BFGS preconditioner. Through the additional reuse of AMG operators and coarse grid solvers inversion time for large 3-D problems can be reduced further. We apply our new inversion method to synthetic survey data created by the resistivity profile representing the characteristics of subsurface fluid injection. We further test it on data obtained from a 2-D surface electrode survey on Heron Island, a small tropical island off the east coast of central Queensland, Australia.

Numerical treatment of a geometrically nonlinear planar Cosserat shell model

NASA Astrophysics Data System (ADS)

Sander, Oliver; Neff, Patrizio; Bîrsan, Mircea

2016-05-01

We present a new way to discretize a geometrically nonlinear elastic planar Cosserat shell. The kinematical model is similar to the general six-parameter resultant shell model with drilling rotations. The discretization uses geodesic finite elements (GFEs), which leads to an objective discrete model which naturally allows arbitrarily large rotations. GFEs of any approximation order can be constructed. The resulting algebraic problem is a minimization problem posed on a nonlinear finite-dimensional Riemannian manifold. We solve this problem using a Riemannian trust-region method, which is a generalization of Newton's method that converges globally without intermediate loading steps. We present the continuous model and the discretization, discuss the properties of the discrete model, and show several numerical examples, including wrinkling of thin elastic sheets in shear.

On the Existence of Simultaneous Edge Disjoint Realizations of Degree Sequences with ’Few’ Edges

DTIC Science & Technology

1975-08-01

constructing graphs and digraphs with given valences and factors. Discrete Math . 6 (1973) 79-88. 3. M. Keren, Realization of a sun of sequences by a sum...appear. 5. S. Kundu, The k factor conjecture is true. Discrete Math . 6 (1973) 367-376. 6. S. Kundu, Disjoint representation of tree realizable

[A correction method of baseline drift of discrete spectrum of NIR].

PubMed

Hu, Ai-Qin; Yuan, Hong-Fu; Song, Chun-Feng; Li, Xiao-Yu

2014-10-01

In the present paper, a new correction method of baseline drift of discrete spectrum is proposed by combination of cubic spline interpolation and first order derivative. A fitting spectrum is constructed by cubic spline interpolation, using the datum in discrete spectrum as interpolation nodes. The fitting spectrum is differentiable. First order derivative is applied to the fitting spectrum to calculate derivative spectrum. The spectral wavelengths which are the same as the original discrete spectrum were taken out from the derivative spectrum to constitute the first derivative spectra of the discrete spectra, thereby to correct the baseline drift of the discrete spectra. The effects of the new method were demonstrated by comparison of the performances of multivariate models built using original spectra, direct differential spectra and the spectra pretreated by the new method. The results show that negative effects on the performance of multivariate model caused by baseline drift of discrete spectra can be effectively eliminated by the new method.

Analysis and application of minimum variance discrete time system identification

NASA Technical Reports Server (NTRS)

Kaufman, H.; Kotob, S.

1975-01-01

An on-line minimum variance parameter identifier is developed which embodies both accuracy and computational efficiency. The formulation results in a linear estimation problem with both additive and multiplicative noise. The resulting filter which utilizes both the covariance of the parameter vector itself and the covariance of the error in identification is proven to be mean square convergent and mean square consistent. The MV parameter identification scheme is then used to construct a stable state and parameter estimation algorithm.

Family of columns isospectral to gravity-loaded columns with tip force: A discrete approach

NASA Astrophysics Data System (ADS)

Ramachandran, Nirmal; Ganguli, Ranjan

2018-06-01

A discrete model is introduced to analyze transverse vibration of straight, clamped-free (CF) columns of variable cross-sectional geometry under the influence of gravity and a constant axial force at the tip. The discrete model is used to determine critical combinations of loading parameters - a gravity parameter and a tip force parameter - that cause onset of dynamic instability in the CF column. A methodology, based on matrix-factorization, is described to transform the discrete model into a family of models corresponding to weightless and unloaded clamped-free (WUCF) columns, each with a transverse vibration spectrum isospectral to the original model. Characteristics of models in this isospectral family are dependent on three transformation parameters. A procedure is discussed to convert the isospectral discrete model description into geometric description of realistic columns i.e. from the discrete model, we construct isospectral WUCF columns with rectangular cross-sections varying in width and depth. As part of numerical studies to demonstrate efficacy of techniques presented, frequency parameters of a uniform column and three types of tapered CF columns under different combinations of loading parameters are obtained from the discrete model. Critical combinations of these parameters for a typical tapered column are derived. These results match with published results. Example CF columns, under arbitrarily-chosen combinations of loading parameters are considered and for each combination, isospectral WUCF columns are constructed. Role of transformation parameters in determining characteristics of isospectral columns is discussed and optimum values are deduced. Natural frequencies of these WUCF columns computed using Finite Element Method (FEM) match well with those of the given gravity-loaded CF column with tip force, hence confirming isospectrality.

3-D discrete analytical ridgelet transform.

PubMed

Helbert, David; Carré, Philippe; Andres, Eric

2006-12-01

In this paper, we propose an implementation of the 3-D Ridgelet transform: the 3-D discrete analytical Ridgelet transform (3-D DART). This transform uses the Fourier strategy for the computation of the associated 3-D discrete Radon transform. The innovative step is the definition of a discrete 3-D transform with the discrete analytical geometry theory by the construction of 3-D discrete analytical lines in the Fourier domain. We propose two types of 3-D discrete lines: 3-D discrete radial lines going through the origin defined from their orthogonal projections and 3-D planes covered with 2-D discrete line segments. These discrete analytical lines have a parameter called arithmetical thickness, allowing us to define a 3-D DART adapted to a specific application. Indeed, the 3-D DART representation is not orthogonal, It is associated with a flexible redundancy factor. The 3-D DART has a very simple forward/inverse algorithm that provides an exact reconstruction without any iterative method. In order to illustrate the potentiality of this new discrete transform, we apply the 3-D DART and its extension to the Local-DART (with smooth windowing) to the denoising of 3-D image and color video. These experimental results show that the simple thresholding of the 3-D DART coefficients is efficient.

On the discretization and control of an SEIR epidemic model with a periodic impulsive vaccination

NASA Astrophysics Data System (ADS)

Alonso-Quesada, S.; De la Sen, M.; Ibeas, A.

2017-01-01

This paper deals with the discretization and control of an SEIR epidemic model. Such a model describes the transmission of an infectious disease among a time-varying host population. The model assumes mortality from causes related to the disease. Our study proposes a discretization method including a free-design parameter to be adjusted for guaranteeing the positivity of the resulting discrete-time model. Such a method provides a discrete-time model close to the continuous-time one without the need for the sampling period to be as small as other commonly used discretization methods require. This fact makes possible the design of impulsive vaccination control strategies with less burden of measurements and related computations if one uses the proposed instead of other discretization methods. The proposed discretization method and the impulsive vaccination strategy designed on the resulting discretized model are the main novelties of the paper. The paper includes (i) the analysis of the positivity of the obtained discrete-time SEIR model, (ii) the study of stability of the disease-free equilibrium point of a normalized version of such a discrete-time model and (iii) the existence and the attractivity of a globally asymptotically stable disease-free periodic solution under a periodic impulsive vaccination. Concretely, the exposed and infectious subpopulations asymptotically converge to zero as time tends to infinity while the normalized subpopulations of susceptible and recovered by immunization individuals oscillate in the context of such a solution. Finally, a numerical example illustrates the theoretic results.

Construction of energy-stable projection-based reduced order models

DOE PAGES

Kalashnikova, Irina; Barone, Matthew F.; Arunajatesan, Srinivasan; ...

2014-12-15

Our paper aims to unify and extend several approaches for building stable projection-based reduced order models (ROMs) using the energy method and the concept of “energy-stability”. Attention is focused on linear time-invariant (LTI) systems. First, an approach for building energy stable Galerkin ROMs for linear hyperbolic or incompletely parabolic systems of partial differential equations (PDEs) using continuous projection is proposed. The key idea is to apply to the system a transformation induced by the Lyapunov function for the system, and to build the ROM in the transformed variables. The result of this procedure will be a ROM that is energy-stablemore » for any choice of reduced basis. It is shown that, for many PDE systems, the desired transformation is induced by a special inner product, termed the “symmetry inner product”. Next, attention is turned to building energy-stable ROMs via discrete projection. A discrete counterpart of the continuous symmetry inner product, termed the “Lyapunov inner product”, is derived. Moreover, it is shown that the Lyapunov inner product can be computed in a black-box fashion for a stable LTI system ari sing from the discretization of a system of PDEs in space. Projection in this inner product guarantees a ROM that is energy-stable, again for any choice of reduced basis. Connections between the Lyapunov inner product and the inner product induced by the balanced truncation algorithm are made. We also made comparisons between the symmetry inner product and the Lyapunov inner product. Performance of ROMs constructed using these inner products is evaluated on several benchmark test cases.« less

Spinning the fuzzy sphere

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

Berenstein, David; Dzienkowski, Eric; Lashof-Regas, Robin

Here, we construct various exact analytical solutions of the SO(3) BMN matrix model that correspond to rotating fuzzy spheres and rotating fuzzy tori. These are also solutions of Yang Mills theory compactified on a sphere times time and they are also translationally invariant solutions of the N = 1* field theory with a non-trivial chargedensity. The solutions we construct have a Ζ N symmetry, where N is the rank of the matrices. After an appropriate ansatz, we reduce the problem to solving a set of polynomial equations in 2N real variables. These equations have a discrete set of solutions formore » each value of the angular momentum. We study the phase structure of the solutions for various values of N . Also the continuum limit where N → ∞, where the problem reduces to finding periodic solutions of a set of coupled differential equations. We also study the topology change transition from the sphere to the torus.« less

Spinning the fuzzy sphere

DOE PAGES

Berenstein, David; Dzienkowski, Eric; Lashof-Regas, Robin

2015-08-27

Here, we construct various exact analytical solutions of the SO(3) BMN matrix model that correspond to rotating fuzzy spheres and rotating fuzzy tori. These are also solutions of Yang Mills theory compactified on a sphere times time and they are also translationally invariant solutions of the N = 1* field theory with a non-trivial chargedensity. The solutions we construct have a Ζ N symmetry, where N is the rank of the matrices. After an appropriate ansatz, we reduce the problem to solving a set of polynomial equations in 2N real variables. These equations have a discrete set of solutions formore » each value of the angular momentum. We study the phase structure of the solutions for various values of N . Also the continuum limit where N → ∞, where the problem reduces to finding periodic solutions of a set of coupled differential equations. We also study the topology change transition from the sphere to the torus.« less

Discrete elements for 3D microfluidics.

PubMed

Bhargava, Krisna C; Thompson, Bryant; Malmstadt, Noah

2014-10-21

Microfluidic systems are rapidly becoming commonplace tools for high-precision materials synthesis, biochemical sample preparation, and biophysical analysis. Typically, microfluidic systems are constructed in monolithic form by means of microfabrication and, increasingly, by additive techniques. These methods restrict the design and assembly of truly complex systems by placing unnecessary emphasis on complete functional integration of operational elements in a planar environment. Here, we present a solution based on discrete elements that liberates designers to build large-scale microfluidic systems in three dimensions that are modular, diverse, and predictable by simple network analysis techniques. We develop a sample library of standardized components and connectors manufactured using stereolithography. We predict and validate the flow characteristics of these individual components to design and construct a tunable concentration gradient generator with a scalable number of parallel outputs. We show that these systems are rapidly reconfigurable by constructing three variations of a device for generating monodisperse microdroplets in two distinct size regimes and in a high-throughput mode by simple replacement of emulsifier subcircuits. Finally, we demonstrate the capability for active process monitoring by constructing an optical sensing element for detecting water droplets in a fluorocarbon stream and quantifying their size and frequency. By moving away from large-scale integration toward standardized discrete elements, we demonstrate the potential to reduce the practice of designing and assembling complex 3D microfluidic circuits to a methodology comparable to that found in the electronics industry.

A priori discretization quality metrics for distributed hydrologic modeling applications

NASA Astrophysics Data System (ADS)

Liu, Hongli; Tolson, Bryan; Craig, James; Shafii, Mahyar; Basu, Nandita

2016-04-01

In distributed hydrologic modelling, a watershed is treated as a set of small homogeneous units that address the spatial heterogeneity of the watershed being simulated. The ability of models to reproduce observed spatial patterns firstly depends on the spatial discretization, which is the process of defining homogeneous units in the form of grid cells, subwatersheds, or hydrologic response units etc. It is common for hydrologic modelling studies to simply adopt a nominal or default discretization strategy without formally assessing alternative discretization levels. This approach lacks formal justifications and is thus problematic. More formalized discretization strategies are either a priori or a posteriori with respect to building and running a hydrologic simulation model. A posteriori approaches tend to be ad-hoc and compare model calibration and/or validation performance under various watershed discretizations. The construction and calibration of multiple versions of a distributed model can become a seriously limiting computational burden. Current a priori approaches are more formalized and compare overall heterogeneity statistics of dominant variables between candidate discretization schemes and input data or reference zones. While a priori approaches are efficient and do not require running a hydrologic model, they do not fully investigate the internal spatial pattern changes of variables of interest. Furthermore, the existing a priori approaches focus on landscape and soil data and do not assess impacts of discretization on stream channel definition even though its significance has been noted by numerous studies. The primary goals of this study are to (1) introduce new a priori discretization quality metrics considering the spatial pattern changes of model input data; (2) introduce a two-step discretization decision-making approach to compress extreme errors and meet user-specified discretization expectations through non-uniform discretization threshold modification. The metrics for the first time provides quantification of the routing relevant information loss due to discretization according to the relationship between in-channel routing length and flow velocity. Moreover, it identifies and counts the spatial pattern changes of dominant hydrological variables by overlaying candidate discretization schemes upon input data and accumulating variable changes in area-weighted way. The metrics are straightforward and applicable to any semi-distributed or fully distributed hydrological model with grid scales are greater than input data resolutions. The discretization metrics and decision-making approach are applied to the Grand River watershed located in southwestern Ontario, Canada where discretization decisions are required for a semi-distributed modelling application. Results show that discretization induced information loss monotonically increases as discretization gets rougher. With regards to routing information loss in subbasin discretization, multiple interesting points rather than just the watershed outlet should be considered. Moreover, subbasin and HRU discretization decisions should not be considered independently since subbasin input significantly influences the complexity of HRU discretization result. Finally, results show that the common and convenient approach of making uniform discretization decisions across the watershed domain performs worse compared to a metric informed non-uniform discretization approach as the later since is able to conserve more watershed heterogeneity under the same model complexity (number of computational units).

Marvelous medicines and dangerous drugs: the representation of prescription medicine in the UK newsprint media.

PubMed

Prosser, Helen

2010-01-01

Using discourse analysis, this study examines the representation of prescription medicines in the UK newsprint media and, specifically, how the meaning and function of medicines are constructed. At the same time, it examines the extent to which the newsprint media represents a resource for health information, and considers how it may encourage or challenge faith in modern medicine and medical authority. As such, it extends analysis around concepts such as the informed patient and examines the representation of patients and doctors and the extent to which patient-doctor identities promoted in the newsprint media reflect a shift away from paternalism to negotiated encounters. Findings show the media constructs a discrete, contradictory, and frequently oversimplified set of characterizations about medicine. Moreover, it discursively constructs realities that justify and sustain medial dominance. Ideological paradigms in discourse assign patients as passive and disempowered while simultaneously privileging "expert" knowledge. This constructs a reality that marginalizes patients' participation in decision-making.

Blood perfusion construction for infrared face recognition based on bio-heat transfer.

PubMed

Xie, Zhihua; Liu, Guodong

2014-01-01

To improve the performance of infrared face recognition for time-lapse data, a new construction of blood perfusion is proposed based on bio-heat transfer. Firstly, by quantifying the blood perfusion based on Pennes equation, the thermal information is converted into blood perfusion rate, which is stable facial biological feature of face image. Then, the separability discriminant criterion in Discrete Cosine Transform (DCT) domain is applied to extract the discriminative features of blood perfusion information. Experimental results demonstrate that the features of blood perfusion are more concentrative and discriminative for recognition than those of thermal information. The infrared face recognition based on the proposed blood perfusion is robust and can achieve better recognition performance compared with other state-of-the-art approaches.

An Application of the Difference Potentials Method to Solving External Problems in CFD

NASA Technical Reports Server (NTRS)

Ryaben 'Kii, Victor S.; Tsynkov, Semyon V.

1997-01-01

Numerical solution of infinite-domain boundary-value problems requires some special techniques that would make the problem available for treatment on the computer. Indeed, the problem must be discretized in a way that the computer operates with only finite amount of information. Therefore, the original infinite-domain formulation must be altered and/or augmented so that on one hand the solution is not changed (or changed slightly) and on the other hand the finite discrete formulation becomes available. One widely used approach to constructing such discretizations consists of truncating the unbounded original domain and then setting the artificial boundary conditions (ABC's) at the newly formed external boundary. The role of the ABC's is to close the truncated problem and at the same time to ensure that the solution found inside the finite computational domain would be maximally close to (in the ideal case, exactly the same as) the corresponding fragment of the original infinite-domain solution. Let us emphasize that the proper treatment of artificial boundaries may have a profound impact on the overall quality and performance of numerical algorithms. The latter statement is corroborated by the numerous computational experiments and especially concerns the area of CFD, in which external problems present a wide class of practically important formulations. In this paper, we review some work that has been done over the recent years on constructing highly accurate nonlocal ABC's for calculation of compressible external flows. The approach is based on implementation of the generalized potentials and pseudodifferential boundary projection operators analogous to those proposed first by Calderon. The difference potentials method (DPM) by Ryaben'kii is used for the effective computation of the generalized potentials and projections. The resulting ABC's clearly outperform the existing methods from the standpoints of accuracy and robustness, in many cases noticeably speed up the multigrid convergence, and at the same time are quite comparable to other methods from the standpoints of geometric universality and simplicity of implementation.

Yang-Baxter maps, discrete integrable equations and quantum groups

NASA Astrophysics Data System (ADS)

Bazhanov, Vladimir V.; Sergeev, Sergey M.

2018-01-01

For every quantized Lie algebra there exists a map from the tensor square of the algebra to itself, which by construction satisfies the set-theoretic Yang-Baxter equation. This map allows one to define an integrable discrete quantum evolution system on quadrilateral lattices, where local degrees of freedom (dynamical variables) take values in a tensor power of the quantized Lie algebra. The corresponding equations of motion admit the zero curvature representation. The commuting Integrals of Motion are defined in the standard way via the Quantum Inverse Problem Method, utilizing Baxter's famous commuting transfer matrix approach. All elements of the above construction have a meaningful quasi-classical limit. As a result one obtains an integrable discrete Hamiltonian evolution system, where the local equation of motion are determined by a classical Yang-Baxter map and the action functional is determined by the quasi-classical asymptotics of the universal R-matrix of the underlying quantum algebra. In this paper we present detailed considerations of the above scheme on the example of the algebra Uq (sl (2)) leading to discrete Liouville equations, however the approach is rather general and can be applied to any quantized Lie algebra.

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.

Prediction of the period of psychotic episode in individual schizophrenics by simulation-data construction approach.

PubMed

Huang, Chun-Jung; Wang, Hsiao-Fan; Chiu, Hsien-Jane; Lan, Tsuo-Hung; Hu, Tsung-Ming; Loh, El-Wui

2010-10-01

Although schizophrenia can be treated, most patients still experience inevitable psychotic episodes from time to time. Precautious actions can be taken if the next onset can be predicted. However, sufficient information is always lacking in the clinical scenario. A possible solution is to use the virtual data generated from limited of original data. Data construction method (DCM) has been shown to generate the virtual felt earthquake data effectively and used in the prediction of further events. Here we investigated the performance of DCM in deriving the membership functions and discrete-event simulations (DES) in predicting the period embracing the initiation and termination time-points of the next psychotic episode of 35 individual schizophrenic patients. The results showed that 21 subjects had a success of simulations (RSS) ≥70%. Further analysis demonstrated that the co-morbidity of coronary heart diseases (CHD), risks of CHD, and the frequency of previous psychotic episodes increased the RSS.

A construct analysis of meal convenience applied to military foods.

PubMed

Jaeger, Sara R; Cardello, Armand V

2007-07-01

The present research investigates the concept of food convenience within the institutional framework of military feeding. The approach views food-related convenience in terms of two broad dimensions: "type of convenience" and "timing of convenience." A discrete choice experiment was conducted with US military personnel (n=179) regarding their perceptions of the (in)convenience associated with the use and consumption of low-preparation, all-in-one, military meals (MREs-meals, ready-to-eat). The obtained data strongly suggest that perceived (in)convenience, time and effort are separate constructs. A food provisioning process perspective was captured in the "timing of convenience" dimension, and the contribution of different stages in the consumption process to the perceived convenience of the meal situation was empirically demonstrated. The latter result has important implications for the study of food convenience outside this specific population and context. As opposed to the product perspective that is currently predominant in the literature, it demonstrates the necessity of adopting a meal perspective in analysing food-related convenience.

Heuristic algorithms for the minmax regret flow-shop problem with interval processing times.

PubMed

Ćwik, Michał; Józefczyk, Jerzy

2018-01-01

An uncertain version of the permutation flow-shop with unlimited buffers and the makespan as a criterion is considered. The investigated parametric uncertainty is represented by given interval-valued processing times. The maximum regret is used for the evaluation of uncertainty. Consequently, the minmax regret discrete optimization problem is solved. Due to its high complexity, two relaxations are applied to simplify the optimization procedure. First of all, a greedy procedure is used for calculating the criterion's value, as such calculation is NP-hard problem itself. Moreover, the lower bound is used instead of solving the internal deterministic flow-shop. The constructive heuristic algorithm is applied for the relaxed optimization problem. The algorithm is compared with previously elaborated other heuristic algorithms basing on the evolutionary and the middle interval approaches. The conducted computational experiments showed the advantage of the constructive heuristic algorithm with regards to both the criterion and the time of computations. The Wilcoxon paired-rank statistical test confirmed this conclusion.

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

An Exact Dual Adjoint Solution Method for Turbulent Flows on Unstructured Grids

NASA Technical Reports Server (NTRS)

Nielsen, Eric J.; Lu, James; Park, Michael A.; Darmofal, David L.

2003-01-01

An algorithm for solving the discrete adjoint system based on an unstructured-grid discretization of the Navier-Stokes equations is presented. The method is constructed such that an adjoint solution exactly dual to a direct differentiation approach is recovered at each time step, yielding a convergence rate which is asymptotically equivalent to that of the primal system. The new approach is implemented within a three-dimensional unstructured-grid framework and results are presented for inviscid, laminar, and turbulent flows. Improvements to the baseline solution algorithm, such as line-implicit relaxation and a tight coupling of the turbulence model, are also presented. By storing nearest-neighbor terms in the residual computation, the dual scheme is computationally efficient, while requiring twice the memory of the flow solution. The scheme is expected to have a broad impact on computational problems related to design optimization as well as error estimation and grid adaptation efforts.

A Neo-Piagetian Theory of Constructive Operators: Applications to Perceptual-Motor Development and Learning.

ERIC Educational Resources Information Center

Todor, John I.

The author presents an overview of Pascual-Leone's Theory of Constructive Operators, a process-structural theory based upon Piagetian constructs which has evolved to both explain and predict the temporal unfolding of behavior. An application is made of the theory to the demands of a discrete motor task and prediction of (a) the minimal age…

Interpreting Significant Discrete-Time Periods in Survival Analysis.

ERIC Educational Resources Information Center

Schumacker, Randall E.; Denson, Kathleen B.

Discrete-time survival analysis is a new method for educational researchers to employ when looking at the timing of certain educational events. Previous continuous-time methods do not allow for the flexibility inherent in a discrete-time method. Because both time-invariant and time-varying predictor variables can now be used, the interaction of…

Space-Time Discrete KPZ Equation

NASA Astrophysics Data System (ADS)

Cannizzaro, G.; Matetski, K.

2018-03-01

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

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

Fermion systems in discrete space-time

NASA Astrophysics Data System (ADS)

Finster, Felix

2007-05-01

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

Path integrals and large deviations in stochastic hybrid systems.

PubMed

Bressloff, Paul C; Newby, Jay M

2014-04-01

We construct a path-integral representation of solutions to a stochastic hybrid system, consisting of one or more continuous variables evolving according to a piecewise-deterministic dynamics. The differential equations for the continuous variables are coupled to a set of discrete variables that satisfy a continuous-time Markov process, which means that the differential equations are only valid between jumps in the discrete variables. Examples of stochastic hybrid systems arise in biophysical models of stochastic ion channels, motor-driven intracellular transport, gene networks, and stochastic neural networks. We use the path-integral representation to derive a large deviation action principle for a stochastic hybrid system. Minimizing the associated action functional with respect to the set of all trajectories emanating from a metastable state (assuming that such a minimization scheme exists) then determines the most probable paths of escape. Moreover, evaluating the action functional along a most probable path generates the so-called quasipotential used in the calculation of mean first passage times. We illustrate the theory by considering the optimal paths of escape from a metastable state in a bistable neural network.

Predicting fruit fly's sensing rate with insect flight simulations.

PubMed

Chang, Song; Wang, Z Jane

2014-08-05

Without sensory feedback, flies cannot fly. Exactly how various feedback controls work in insects is a complex puzzle to solve. What do insects measure to stabilize their flight? How often and how fast must insects adjust their wings to remain stable? To gain insights into algorithms used by insects to control their dynamic instability, we develop a simulation tool to study free flight. To stabilize flight, we construct a control algorithm that modulates wing motion based on discrete measurements of the body-pitch orientation. Our simulations give theoretical bounds on both the sensing rate and the delay time between sensing and actuation. Interpreting our findings together with experimental results on fruit flies' reaction time and sensory motor reflexes, we conjecture that fruit flies sense their kinematic states every wing beat to stabilize their flight. We further propose a candidate for such a control involving the fly's haltere and first basalar motor neuron. Although we focus on fruit flies as a case study, the framework for our simulation and discrete control algorithms is applicable to studies of both natural and man-made fliers.

ORACLS: A system for linear-quadratic-Gaussian control law design

NASA Technical Reports Server (NTRS)

Armstrong, E. S.

1978-01-01

A modern control theory design package (ORACLS) for constructing controllers and optimal filters for systems modeled by linear time-invariant differential or difference equations is described. Numerical linear-algebra procedures are used to implement the linear-quadratic-Gaussian (LQG) methodology of modern control theory. Algorithms are included for computing eigensystems of real matrices, the relative stability of a matrix, factored forms for nonnegative definite matrices, the solutions and least squares approximations to the solutions of certain linear matrix algebraic equations, the controllability properties of a linear time-invariant system, and the steady state covariance matrix of an open-loop stable system forced by white noise. Subroutines are provided for solving both the continuous and discrete optimal linear regulator problems with noise free measurements and the sampled-data optimal linear regulator problem. For measurement noise, duality theory and the optimal regulator algorithms are used to solve the continuous and discrete Kalman-Bucy filter problems. Subroutines are also included which give control laws causing the output of a system to track the output of a prescribed model.

Using a simulation assistant in modeling manufacturing systems

NASA Technical Reports Server (NTRS)

Schroer, Bernard J.; Tseng, Fan T.; Zhang, S. X.; Wolfsberger, John W.

1988-01-01

Numerous simulation languages exist for modeling discrete event processes, and are now ported to microcomputers. Graphic and animation capabilities were added to many of these languages to assist the users build models and evaluate the simulation results. With all these languages and added features, the user is still plagued with learning the simulation language. Futhermore, the time to construct and then to validate the simulation model is always greater than originally anticipated. One approach to minimize the time requirement is to use pre-defined macros that describe various common processes or operations in a system. The development of a simulation assistant for modeling discrete event manufacturing processes is presented. A simulation assistant is defined as an interactive intelligent software tool that assists the modeler in writing a simulation program by translating the modeler's symbolic description of the problem and then automatically generating the corresponding simulation code. The simulation assistant is discussed with emphasis on an overview of the simulation assistant, the elements of the assistant, and the five manufacturing simulation generators. A typical manufacturing system will be modeled using the simulation assistant and the advantages and disadvantages discussed.

Design and performance of a large vocabulary discrete word recognition system. Volume 1: Technical report. [real time computer technique for voice data processing

NASA Technical Reports Server (NTRS)

1973-01-01

The development, construction, and test of a 100-word vocabulary near real time word recognition system are reported. Included are reasonable replacement of any one or all 100 words in the vocabulary, rapid learning of a new speaker, storage and retrieval of training sets, verbal or manual single word deletion, continuous adaptation with verbal or manual error correction, on-line verification of vocabulary as spoken, system modes selectable via verification display keyboard, relationship of classified word to neighboring word, and a versatile input/output interface to accommodate a variety of applications.

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

PubMed

Zhang, Guodong; Zeng, Zhigang; Hu, Junhao

2018-01-01

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

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.

Modeling and control of fuel cell based distributed generation systems

NASA Astrophysics Data System (ADS)

Jung, Jin Woo

This dissertation presents circuit models and control algorithms of fuel cell based distributed generation systems (DGS) for two DGS topologies. In the first topology, each DGS unit utilizes a battery in parallel to the fuel cell in a standalone AC power plant and a grid-interconnection. In the second topology, a Z-source converter, which employs both the L and C passive components and shoot-through zero vectors instead of the conventional DC/DC boost power converter in order to step up the DC-link voltage, is adopted for a standalone AC power supply. In Topology 1, two applications are studied: a standalone power generation (Single DGS Unit and Two DGS Units) and a grid-interconnection. First, dynamic model of the fuel cell is given based on electrochemical process. Second, two full-bridge DC to DC converters are adopted and their controllers are designed: an unidirectional full-bridge DC to DC boost converter for the fuel cell and a bidirectional full-bridge DC to DC buck/boost converter for the battery. Third, for a three-phase DC to AC inverter without or with a Delta/Y transformer, a discrete-time state space circuit model is given and two discrete-time feedback controllers are designed: voltage controller in the outer loop and current controller in the inner loop. And last, for load sharing of two DGS units and power flow control of two DGS units or the DGS connected to the grid, real and reactive power controllers are proposed. Particularly, for the grid-connected DGS application, a synchronization issue between an islanding mode and a paralleling mode to the grid is investigated, and two case studies are performed. To demonstrate the proposed circuit models and control strategies, simulation test-beds using Matlab/Simulink are constructed for each configuration of the fuel cell based DGS with a three-phase AC 120 V (L-N)/60 Hz/50 kVA and various simulation results are presented. In Topology 2, this dissertation presents system modeling, modified space vector PWM implementation (MSVPWM) and design of a closed-loop controller of the Z-source converter which utilizes L and C components and shoot-through zero vectors for the standalone AC power generation. The fuel cell system is modeled by an electrical R-C circuit in order to include slow dynamics of the fuel cells and a voltage-current characteristic of a cell is also considered. A discrete-time state space model is derived to implement digital control and a space vector pulse-width modulation (SVPWM) technique is modified to realize the shoot-through zero vectors that boost the DC-link voltage. Also, three discrete-time feedback controllers are designed: a discrete-time optimal voltage controller, a discrete-time sliding mode current controller, and a discrete-time PI DC-link voltage controller. Furthermore, an asymptotic observer is used to reduce the number of sensors and enhance the reliability of the system. To demonstrate the analyzed circuit model and proposed control strategy, various simulation results using Matlab/Simulink are presented under both light/heavy loads and linear/nonlinear loads for a three-phase AC 208 V (L-L)/60 Hz/10 kVA.

Fast Multilevel Solvers for a Class of Discrete Fourth Order Parabolic Problems

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

Zheng, Bin; Chen, Luoping; Hu, Xiaozhe

2016-03-05

In this paper, we study fast iterative solvers for the solution of fourth order parabolic equations discretized by mixed finite element methods. We propose to use consistent mass matrix in the discretization and use lumped mass matrix to construct efficient preconditioners. We provide eigenvalue analysis for the preconditioned system and estimate the convergence rate of the preconditioned GMRes method. Furthermore, we show that these preconditioners only need to be solved inexactly by optimal multigrid algorithms. Our numerical examples indicate that the proposed preconditioners are very efficient and robust with respect to both discretization parameters and diffusion coefficients. We also investigatemore » the performance of multigrid algorithms with either collective smoothers or distributive smoothers when solving the preconditioner systems.« less

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

PubMed

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

2007-02-01

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

Copula-based prediction of economic movements

NASA Astrophysics Data System (ADS)

García, J. E.; González-López, V. A.; Hirsh, I. D.

2016-06-01

In this paper we model the discretized returns of two paired time series BM&FBOVESPA Dividend Index and BM&FBOVESPA Public Utilities Index using multivariate Markov models. The discretization corresponds to three categories, high losses, high profits and the complementary periods of the series. In technical terms, the maximal memory that can be considered for a Markov model, can be derived from the size of the alphabet and dataset. The number of parameters needed to specify a discrete multivariate Markov chain grows exponentially with the order and dimension of the chain. In this case the size of the database is not large enough for a consistent estimation of the model. We apply a strategy to estimate a multivariate process with an order greater than the order achieved using standard procedures. The new strategy consist on obtaining a partition of the state space which is constructed from a combination, of the partitions corresponding to the two marginal processes and the partition corresponding to the multivariate Markov chain. In order to estimate the transition probabilities, all the partitions are linked using a copula. In our application this strategy provides a significant improvement in the movement predictions.

Lectures on algebraic system theory: Linear systems over rings

NASA Technical Reports Server (NTRS)

Kamen, E. W.

1978-01-01

The presentation centers on four classes of systems that can be treated as linear systems over a ring. These are: (1) discrete-time systems over a ring of scalars such as the integers; (2) continuous-time systems containing time delays; (3) large-scale discrete-time systems; and (4) time-varying discrete-time systems.

Weight-lattice discretization of Weyl-orbit functions

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

Hrivnák, Jiří, E-mail: jiri.hrivnak@fjfi.cvut.cz, E-mail: walton@uleth.ca; Walton, Mark A., E-mail: jiri.hrivnak@fjfi.cvut.cz, E-mail: walton@uleth.ca

Weyl-orbit functions have been defined for each simple Lie algebra, and permit Fourier-like analysis on the fundamental region of the corresponding affine Weyl group. They have also been discretized, using a refinement of the coweight lattice, so that digitized data on the fundamental region can be Fourier-analyzed. The discretized orbit function has arguments that are redundant if related by the affine Weyl group, while its labels, the Weyl-orbit representatives, invoke the dual affine Weyl group. Here we discretize the orbit functions in a novel way, by using the weight lattice. A cleaner theory results with symmetry between the arguments andmore » labels of the discretized orbit functions. Orthogonality of the new discretized orbit functions is proved, and leads to the construction of unitary, symmetric matrices with Weyl-orbit-valued elements. For one type of orbit function, the matrix coincides with the Kac-Peterson modular S matrix, important for Wess-Zumino-Novikov-Witten conformal field theory.« less

Ideal GLM-MHD: About the entropy consistent nine-wave magnetic field divergence diminishing ideal magnetohydrodynamics equations

NASA Astrophysics Data System (ADS)

Derigs, Dominik; Winters, Andrew R.; Gassner, Gregor J.; Walch, Stefanie; Bohm, Marvin

2018-07-01

The paper presents two contributions in the context of the numerical simulation of magnetized fluid dynamics. First, we show how to extend the ideal magnetohydrodynamics (MHD) equations with an inbuilt magnetic field divergence cleaning mechanism in such a way that the resulting model is consistent with the second law of thermodynamics. As a byproduct of these derivations, we show that not all of the commonly used divergence cleaning extensions of the ideal MHD equations are thermodynamically consistent. Secondly, we present a numerical scheme obtained by constructing a specific finite volume discretization that is consistent with the discrete thermodynamic entropy. It includes a mechanism to control the discrete divergence error of the magnetic field by construction and is Galilean invariant. We implement the new high-order MHD solver in the adaptive mesh refinement code FLASH where we compare the divergence cleaning efficiency to the constrained transport solver available in FLASH (unsplit staggered mesh scheme).

Non-holonomic integrators

NASA Astrophysics Data System (ADS)

Cortés, J.; Martínez, S.

2001-09-01

We introduce a discretization of the Lagrange-d'Alembert principle for Lagrangian systems with non-holonomic constraints, which allows us to construct numerical integrators that approximate the continuous flow. We study the geometric invariance properties of the discrete flow which provide an explanation for the good performance of the proposed method. This is tested on two examples: a non-holonomic particle with a quadratic potential and a mobile robot with fixed orientation.

Development and Application of Methods for Estimating Operating Characteristics of Discrete Test Item Responses without Assuming any Mathematical Form.

ERIC Educational Resources Information Center

Samejima, Fumiko

In latent trait theory the latent space, or space of the hypothetical construct, is usually represented by some unidimensional or multi-dimensional continuum of real numbers. Like the latent space, the item response can either be treated as a discrete variable or as a continuous variable. Latent trait theory relates the item response to the latent…

Higher-order vector discrete rogue-wave states in the coupled Ablowitz-Ladik equations: Exact solutions and stability.

PubMed

Wen, Xiao-Yong; Yan, Zhenya; Malomed, Boris A

2016-12-01

An integrable system of two-component nonlinear Ablowitz-Ladik equations is used to construct complex rogue-wave (RW) solutions in an explicit form. First, the modulational instability of continuous waves is studied in the system. Then, new higher-order discrete two-component RW solutions of the system are found by means of a newly derived discrete version of a generalized Darboux transformation. Finally, the perturbed evolution of these RW states is explored in terms of systematic simulations, which demonstrates that tightly and loosely bound RWs are, respectively, nearly stable and strongly unstable solutions.

Congruence Approximations for Entrophy Endowed Hyperbolic Systems

NASA Technical Reports Server (NTRS)

Barth, Timothy J.; Saini, Subhash (Technical Monitor)

1998-01-01

Building upon the standard symmetrization theory for hyperbolic systems of conservation laws, congruence properties of the symmetrized system are explored. These congruence properties suggest variants of several stabilized numerical discretization procedures for hyperbolic equations (upwind finite-volume, Galerkin least-squares, discontinuous Galerkin) that benefit computationally from congruence approximation. Specifically, it becomes straightforward to construct the spatial discretization and Jacobian linearization for these schemes (given a small amount of derivative information) for possible use in Newton's method, discrete optimization, homotopy algorithms, etc. Some examples will be given for the compressible Euler equations and the nonrelativistic MHD equations using linear and quadratic spatial approximation.

Galerkin v. discrete-optimal projection in nonlinear model reduction

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

Carlberg, Kevin Thomas; Barone, Matthew Franklin; Antil, Harbir

Discrete-optimal model-reduction techniques such as the Gauss{Newton with Approximated Tensors (GNAT) method have shown promise, as they have generated stable, accurate solutions for large-scale turbulent, compressible ow problems where standard Galerkin techniques have failed. However, there has been limited comparative analysis of the two approaches. This is due in part to difficulties arising from the fact that Galerkin techniques perform projection at the time-continuous level, while discrete-optimal techniques do so at the time-discrete level. This work provides a detailed theoretical and experimental comparison of the two techniques for two common classes of time integrators: linear multistep schemes and Runge{Kutta schemes.more » We present a number of new ndings, including conditions under which the discrete-optimal ROM has a time-continuous representation, conditions under which the two techniques are equivalent, and time-discrete error bounds for the two approaches. Perhaps most surprisingly, we demonstrate both theoretically and experimentally that decreasing the time step does not necessarily decrease the error for the discrete-optimal ROM; instead, the time step should be `matched' to the spectral content of the reduced basis. In numerical experiments carried out on a turbulent compressible- ow problem with over one million unknowns, we show that increasing the time step to an intermediate value decreases both the error and the simulation time of the discrete-optimal reduced-order model by an order of magnitude.« less

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

PubMed

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

2013-12-01

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

Discrete-Time Mapping for an Impulsive Goodwin Oscillator with Three Delays

NASA Astrophysics Data System (ADS)

Churilov, Alexander N.; Medvedev, Alexander; Zhusubaliyev, Zhanybai T.

A popular biomathematics model of the Goodwin oscillator has been previously generalized to a more biologically plausible construct by introducing three time delays to portray the transport phenomena arising due to the spatial distribution of the model states. The present paper addresses a similar conversion of an impulsive version of the Goodwin oscillator that has found application in mathematical modeling, e.g. in endocrine systems with pulsatile hormone secretion. While the cascade structure of the linear continuous part pertinent to the Goodwin oscillator is preserved in the impulsive Goodwin oscillator, the static nonlinear feedback of the former is substituted with a pulse modulation mechanism thus resulting in hybrid dynamics of the closed-loop system. To facilitate the analysis of the mathematical model under investigation, a discrete mapping propagating the continuous state variables through the firing times of the impulsive feedback is derived. Due to the presence of multiple time delays in the considered model, previously developed mapping derivation approaches are not applicable here and a novel technique is proposed and applied. The mapping captures the dynamics of the original hybrid system and is instrumental in studying complex nonlinear phenomena arising in the impulsive Goodwin oscillator. A simulation example is presented to demonstrate the utility of the proposed approach in bifurcation analysis.

German Value Set for the EQ-5D-5L.

PubMed

Ludwig, Kristina; Graf von der Schulenburg, J-Matthias; Greiner, Wolfgang

2018-06-01

The objective of this study was to develop a value set for EQ-5D-5L based on the societal preferences of the German population. As the first country to do so, the study design used the improved EQ-5D-5L valuation protocol 2.0 developed by the EuroQol Group, including a feedback module as internal validation and a quality control process that was missing in the first wave of EQ-5D-5L valuation studies. A representative sample of the general German population (n = 1158) was interviewed using a composite time trade-off and a discrete choice experiment under close quality control. Econometric modeling was used to estimate values for all 3125 possible health states described by EQ-5D-5L. The value set was based on a hybrid model including all available information from the composite time trade-off and discrete choice experiment valuations without any exclusions due to data issues. The final German value set was constructed from a combination of a conditional logit model for the discrete choice experiment data and a censored at -1 Tobit model for the composite time trade-off data, correcting for heteroskedasticity. The value set had logically consistent parameter estimates (p < 0.001 for all coefficients). The predicted EQ-5D-5L index values ranged from -0.661 to 1. This study provided values for the health states of the German version of EQ-5D-5L representing the preferences of the German population. The study successfully employed for the first time worldwide the improved protocol 2.0. The value set enables the use of the EQ-5D-5L instrument in economic evaluations and in clinical studies.

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

PubMed

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

2015-07-01

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

Using Symbolic-Logic Matrices To Improve Confirmatory Factor Analysis Techniques.

ERIC Educational Resources Information Center

Creighton, Theodore B.; Coleman, Donald G.; Adams, R. C.

A continuing and vexing problem associated with survey instrument development is the creation of items, initially, that correlate favorably a posteriori with constructs being measured. This study tests the use of symbolic-logic matrices developed by D. G. Coleman (1979) in creating factorially "pure" statistically discrete constructs in…

7 CFR 1726.125 - Generating plant facilities.

Code of Federal Regulations, 2011 CFR

2011-01-01

... buildings are covered under subpart E of this part. (a) Contract forms. (1) The borrower must use RUS Form... RUS Form 200, Construction Contract—Generating, for generating project construction contracts in the.... (3) The borrower may, in its discretion, use other contract or written purchase order forms for those...

7 CFR 1726.125 - Generating plant facilities.

Code of Federal Regulations, 2010 CFR

2010-01-01

... buildings are covered under subpart E of this part. (a) Contract forms. (1) The borrower must use RUS Form... RUS Form 200, Construction Contract—Generating, for generating project construction contracts in the.... (3) The borrower may, in its discretion, use other contract or written purchase order forms for those...

7 CFR 1726.125 - Generating plant facilities.

Code of Federal Regulations, 2014 CFR

2014-01-01

... buildings are covered under subpart E of this part. (a) Contract forms. (1) The borrower shall use RUS Form... RUS Form 200, Construction Contract—Generating, for generating project construction contracts in the.... (3) The borrower may, in its discretion, use other contract forms or written purchase order forms for...

7 CFR 1726.125 - Generating plant facilities.

Code of Federal Regulations, 2012 CFR

2012-01-01

... buildings are covered under subpart E of this part. (a) Contract forms. (1) The borrower must use RUS Form... RUS Form 200, Construction Contract—Generating, for generating project construction contracts in the.... (3) The borrower may, in its discretion, use other contract or written purchase order forms for those...

7 CFR 1726.125 - Generating plant facilities.

Code of Federal Regulations, 2013 CFR

2013-01-01

... buildings are covered under subpart E of this part. (a) Contract forms. (1) The borrower shall use RUS Form... RUS Form 200, Construction Contract—Generating, for generating project construction contracts in the.... (3) The borrower may, in its discretion, use other contract forms or written purchase order forms for...

Developing an Instrument to Assess Higher Education Leadership.

ERIC Educational Resources Information Center

Montez, Joni

An instrument was developed to assess the construct of higher education leadership from discrete innate (possessed) and extrinsic (directed toward others) points of view. Dimensions of the latent construct of higher education leadership were identified, and their content and the relationships between their indicators were "mapped" according to the…

Reliability Prediction Models for Discrete Semiconductor Devices

DTIC Science & Technology

1988-07-01

influence failure rate were device construction, semiconductor material, junction temperature, electrical stress, circuit application., a plication...found to influence failure rate were device construction, semiconductor material, junction temperature, electrical stress, circuit application...MFA Airbreathlng 14issile, Flight MFF Missile, Free Flight ML Missile, Launch MMIC Monolithic Microwave Integrated Circuits MOS Metal-Oxide

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

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

Argyres, Philip C.; Martone, Mario

In this paper we present a beautifully consistent web of evidence for the existence of interacting 4d rank-1more » $$ \\mathcal{N} $$ = 2 SCFTs obtained from gauging discrete subgroups of global symmetries of other existing 4d rank-1 $$ \\mathcal{N} $$ = 2 SCFTs. The global symmetries that can be gauged involve a non-trivial combination of discrete subgroups of the U(1) R, low-energy EM duality group SL(2,Z), and the outer automorphism group of the flavor symmetry algebra, Out(F ). The theories that we construct are remarkable in many ways: (i) two of them have exceptional F 4 and G 2 flavor groups; (ii) they substantially complete the picture of the landscape of rank-1 $$ \\mathcal{N} $$ = 2 SCFTs as they realize all but one of the remaining consistent rank-1 Seiberg-Witten geometries that we previously constructed but were not associated to known SCFTs; and (iii) some of them have enlarged $$ \\mathcal{N} $$ = 3 SUSY, and have not been previously constructed. They are also examples of SCFTs which violate the ShapereTachikawa relation between the conformal central charges and the scaling dimension of the Coulomb branch vev. Here, we propose a modification of the formulas computing these central charges from the topologically twisted Coulomb branch partition function which correctly compute them for discretely gauged theories.« less

Slow cortical potentials and "inner time consciousness" - A neuro-phenomenal hypothesis about the "width of present".

PubMed

Northoff, Georg

2016-05-01

William James postulated a "stream of consciousness" that presupposes temporal continuity. The neuronal mechanisms underlying the construction of such temporal continuity remain unclear, however, in my contribution, I propose a neuro-phenomenal hypothesis that is based on slow cortical potentials and their extension of the present moment as described in the phenomenal term of "width of present". More specifically, I focus on the way the brain's neural activity needs to be encoded in order to make possible the "stream of consciousness." This leads us again to the low-frequency fluctuations of the brain's neural activity and more specifically to slow cortical potentials (SCPs). Due to their long phase duration as low-frequency fluctuations, SCPs can integrate different stimuli and their associated neural activity from different regions in one converging region. Such integration may be central for consciousness to occur, as it was recently postulated by He and Raichle. They leave open, however, the question of the exact neuronal mechanisms, like the encoding strategy, that make possible the association of the otherwise purely neuronal SCP with consciousness and its phenomenal features. I hypothesize that SCPs allow for linking and connecting different discrete points in physical time by encoding their statistically based temporal differences rather than the single discrete time points by themselves. This presupposes difference-based coding rather than stimulus-based coding. The encoding of such statistically based temporal differences makes it possible to "go beyond" the merely physical features of the stimuli; that is, their single discrete time points and their conduction delays (as related to their neural processing in the brain). This, in turn, makes possible the constitution of "local temporal continuity" of neural activity in one particular region. The concept of "local temporal continuity" signifies the linkage and integration of different discrete time points into one neural activity in a particular region. How does such local temporal continuity predispose the experience of time in consciousness? For that, I turn to phenomenological philosopher Edmund Husserl and his description of what he calls "inner time consciousness" (Husserl and Brough, 1990). One hallmark of humans' "inner time consciousness" is that we experience events and objects in succession and duration in our consciousness; according to Husserl, this amounts to what he calls the "width of [the] present." The concept of the width of present describes the extension of the present beyond the single discrete time point, such as, for instance, when we perceive different tones as a melody. I now hypothesize the degree of the width of present to be directly dependent upon and thus predisposed by the degree of the temporal differences between two (or more) discrete time points as they are encoded into neural activity. I therefore conclude that the SCPs and their encoding of neural activity in terms of temporal differences must be regarded a neural predisposition of consciousness (NPC) as distinguished from a neural correlate of consciousness (NCC). Copyright © 2015 Elsevier B.V. All rights reserved.

Supercomputer modeling of flow past hypersonic flight vehicles

NASA Astrophysics Data System (ADS)

Ermakov, M. K.; Kryukov, I. A.

2017-02-01

A software platform for MPI-based parallel solution of the Navier-Stokes (Euler) equations for viscous heat-conductive compressible perfect gas on 3-D unstructured meshes is developed. The discretization and solution of the Navier-Stokes equations are constructed on generalized S.K. Godunov’s method and the second order approximation in space and time. Developed software platform allows to carry out effectively flow past hypersonic flight vehicles simulations for the Mach numbers 6 and higher, and numerical meshes with up to 1 billion numerical cells and with up to 128 processors.

A System of Poisson Equations for a Nonconstant Varadhan Functional on a Finite State Space

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

Cavazos-Cadena, Rolando; Hernandez-Hernandez, Daniel

2006-01-15

Given a discrete-time Markov chain with finite state space and a stationary transition matrix, a system of 'local' Poisson equations characterizing the (exponential) Varadhan's functional J(.) is given. The main results, which are derived for an arbitrary transition structure so that J(.) may be nonconstant, are as follows: (i) Any solution to the local Poisson equations immediately renders Varadhan's functional, and (ii) a solution of the system always exist. The proof of this latter result is constructive and suggests a method to solve the local Poisson equations.

A discrete model of a modified Burgers' partial differential equation

NASA Technical Reports Server (NTRS)

Mickens, R. E.; Shoosmith, J. N.

1990-01-01

A new finite-difference scheme is constructed for a modified Burger's equation. Three special cases of the equation are considered, and the 'exact' difference schemes for the space- and time-independent forms of the equation are presented, along with the diffusion-free case of Burger's equation modeled by a difference equation. The desired difference scheme is then obtained by imposing on any difference model of the initial equation the requirement that, in the appropriate limits, its difference scheme must reduce the results of the obtained equations.

Discretization of Continuous Time Discrete Scale Invariant Processes: Estimation and Spectra

NASA Astrophysics Data System (ADS)

Rezakhah, Saeid; Maleki, Yasaman

2016-07-01

Imposing some flexible sampling scheme we provide some discretization of continuous time discrete scale invariant (DSI) processes which is a subsidiary discrete time DSI process. Then by introducing some simple random measure we provide a second continuous time DSI process which provides a proper approximation of the first one. This enables us to provide a bilateral relation between covariance functions of the subsidiary process and the new continuous time processes. The time varying spectral representation of such continuous time DSI process is characterized, and its spectrum is estimated. Also, a new method for estimation time dependent Hurst parameter of such processes is provided which gives a more accurate estimation. The performance of this estimation method is studied via simulation. Finally this method is applied to the real data of S & P500 and Dow Jones indices for some special periods.

Doubled lattice Chern-Simons-Yang-Mills theories with discrete gauge group

NASA Astrophysics Data System (ADS)

Caspar, S.; Mesterházy, D.; Olesen, T. Z.; Vlasii, N. D.; Wiese, U.-J.

2016-11-01

We construct doubled lattice Chern-Simons-Yang-Mills theories with discrete gauge group G in the Hamiltonian formulation. Here, these theories are considered on a square spatial lattice and the fundamental degrees of freedom are defined on pairs of links from the direct lattice and its dual, respectively. This provides a natural lattice construction for topologically-massive gauge theories, which are invariant under parity and time-reversal symmetry. After defining the building blocks of the doubled theories, paying special attention to the realization of gauge transformations on quantum states, we examine the dynamics in the group space of a single cross, which is spanned by a single link and its dual. The dynamics is governed by the single-cross electric Hamiltonian and admits a simple quantum mechanical analogy to the problem of a charged particle moving on a discrete space affected by an abstract electromagnetic potential. Such a particle might accumulate a phase shift equivalent to an Aharonov-Bohm phase, which is manifested in the doubled theory in terms of a nontrivial ground-state degeneracy on a single cross. We discuss several examples of these doubled theories with different gauge groups including the cyclic group Z(k) ⊂ U(1) , the symmetric group S3 ⊂ O(2) , the binary dihedral (or quaternion) group D¯2 ⊂ SU(2) , and the finite group Δ(27) ⊂ SU(3) . In each case the spectrum of the single-cross electric Hamiltonian is determined exactly. We examine the nature of the low-lying excited states in the full Hilbert space, and emphasize the role of the center symmetry for the confinement of charges. Whether the investigated doubled models admit a non-Abelian topological state which allows for fault-tolerant quantum computation will be addressed in a future publication.

Stochastic flux analysis of chemical reaction networks

PubMed Central

2013-01-01

Background Chemical reaction networks provide an abstraction scheme for a broad range of models in biology and ecology. The two common means for simulating these networks are the deterministic and the stochastic approaches. The traditional deterministic approach, based on differential equations, enjoys a rich set of analysis techniques, including a treatment of reaction fluxes. However, the discrete stochastic simulations, which provide advantages in some cases, lack a quantitative treatment of network fluxes. Results We describe a method for flux analysis of chemical reaction networks, where flux is given by the flow of species between reactions in stochastic simulations of the network. Extending discrete event simulation algorithms, our method constructs several data structures, and thereby reveals a variety of statistics about resource creation and consumption during the simulation. We use these structures to quantify the causal interdependence and relative importance of the reactions at arbitrary time intervals with respect to the network fluxes. This allows us to construct reduced networks that have the same flux-behavior, and compare these networks, also with respect to their time series. We demonstrate our approach on an extended example based on a published ODE model of the same network, that is, Rho GTP-binding proteins, and on other models from biology and ecology. Conclusions We provide a fully stochastic treatment of flux analysis. As in deterministic analysis, our method delivers the network behavior in terms of species transformations. Moreover, our stochastic analysis can be applied, not only at steady state, but at arbitrary time intervals, and used to identify the flow of specific species between specific reactions. Our cases study of Rho GTP-binding proteins reveals the role played by the cyclic reverse fluxes in tuning the behavior of this network. PMID:24314153

Stochastic flux analysis of chemical reaction networks.

PubMed

Kahramanoğulları, Ozan; Lynch, James F

2013-12-07

Chemical reaction networks provide an abstraction scheme for a broad range of models in biology and ecology. The two common means for simulating these networks are the deterministic and the stochastic approaches. The traditional deterministic approach, based on differential equations, enjoys a rich set of analysis techniques, including a treatment of reaction fluxes. However, the discrete stochastic simulations, which provide advantages in some cases, lack a quantitative treatment of network fluxes. We describe a method for flux analysis of chemical reaction networks, where flux is given by the flow of species between reactions in stochastic simulations of the network. Extending discrete event simulation algorithms, our method constructs several data structures, and thereby reveals a variety of statistics about resource creation and consumption during the simulation. We use these structures to quantify the causal interdependence and relative importance of the reactions at arbitrary time intervals with respect to the network fluxes. This allows us to construct reduced networks that have the same flux-behavior, and compare these networks, also with respect to their time series. We demonstrate our approach on an extended example based on a published ODE model of the same network, that is, Rho GTP-binding proteins, and on other models from biology and ecology. We provide a fully stochastic treatment of flux analysis. As in deterministic analysis, our method delivers the network behavior in terms of species transformations. Moreover, our stochastic analysis can be applied, not only at steady state, but at arbitrary time intervals, and used to identify the flow of specific species between specific reactions. Our cases study of Rho GTP-binding proteins reveals the role played by the cyclic reverse fluxes in tuning the behavior of this network.

Discretization and control of an SEIR epidemic model under equilibrium Wiener noise disturbances

NASA Astrophysics Data System (ADS)

Alonso, Santiago; De la Sen, Manuel; Nistal, Raul; Ibeas, Asier

2017-11-01

A discretized SEIR epidemic model, subject to Wiener noise disturbances of the equilibrium points, is studied. The discrete-time model is got from a general discretization technique applied to its continuous-time counterpart so that its behaviour be close to its continuous-time counterpart irrespective of the size of the discretization period. The positivity and stability of a normalized version of such a discrete-time model are emphasized. The paper also proposes the design of a periodic impulsive vaccination which is periodically injected to the susceptible subpopulation in order to eradicate the propagation of the disease or, at least, to reduce its unsuitable infective effects within the potentially susceptible subpopulation. The existence and asymptotic stability of a disease-free periodic solution are proved. In particular, both the exposed and infectious subpopulations converge asymptotically to zero as time tends to infinity while the normalized subpopulations of susceptible and recovered by immunization oscillate.

Generating chaos for discrete time-delayed systems via impulsive control.

PubMed

Guan, Zhi-Hong; Liu, Na

2010-03-01

Generating chaos for a class of discrete time-delayed systems via impulsive control is investigated in this paper. With the augmented matrix method, the time-delay impulsive systems can be transformed into a new class of linear discrete impulsive systems. Based on the largest Lyapunov exponent and the boundedness of the systems, some theoretical results about the chaotification for the discrete impulsive systems with time delay are derived and an example is given to visualize the satisfactory control performance.

Construction of moment-matching multinomial lattices using Vandermonde matrices and Gröbner bases

NASA Astrophysics Data System (ADS)

Lundengârd, Karl; Ogutu, Carolyne; Silvestrov, Sergei; Ni, Ying; Weke, Patrick

2017-01-01

In order to describe and analyze the quantitative behavior of stochastic processes, such as the process followed by a financial asset, various discretization methods are used. One such set of methods are lattice models where a time interval is divided into equal time steps and the rate of change for the process is restricted to a particular set of values in each time step. The well-known binomial- and trinomial models are the most commonly used in applications, although several kinds of higher order models have also been examined. Here we will examine various ways of designing higher order lattice schemes with different node placements in order to guarantee moment-matching with the process.

Stochastic nonlinear time series forecasting using time-delay reservoir computers: performance and universality.

PubMed

Grigoryeva, Lyudmila; Henriques, Julie; Larger, Laurent; Ortega, Juan-Pablo

2014-07-01

Reservoir computing is a recently introduced machine learning paradigm that has already shown excellent performances in the processing of empirical data. We study a particular kind of reservoir computers called time-delay reservoirs that are constructed out of the sampling of the solution of a time-delay differential equation and show their good performance in the forecasting of the conditional covariances associated to multivariate discrete-time nonlinear stochastic processes of VEC-GARCH type as well as in the prediction of factual daily market realized volatilities computed with intraday quotes, using as training input daily log-return series of moderate size. We tackle some problems associated to the lack of task-universality for individually operating reservoirs and propose a solution based on the use of parallel arrays of time-delay reservoirs. Copyright © 2014 Elsevier Ltd. All rights reserved.

Reinforcement-learning-based dual-control methodology for complex nonlinear discrete-time systems with application to spark engine EGR operation.

PubMed

Shih, Peter; Kaul, Brian C; Jagannathan, S; Drallmeier, James A

2008-08-01

A novel reinforcement-learning-based dual-control methodology adaptive neural network (NN) controller is developed to deliver a desired tracking performance for a class of complex feedback nonlinear discrete-time systems, which consists of a second-order nonlinear discrete-time system in nonstrict feedback form and an affine nonlinear discrete-time system, in the presence of bounded and unknown disturbances. For example, the exhaust gas recirculation (EGR) operation of a spark ignition (SI) engine is modeled by using such a complex nonlinear discrete-time system. A dual-controller approach is undertaken where primary adaptive critic NN controller is designed for the nonstrict feedback nonlinear discrete-time system whereas the secondary one for the affine nonlinear discrete-time system but the controllers together offer the desired performance. The primary adaptive critic NN controller includes an NN observer for estimating the states and output, an NN critic, and two action NNs for generating virtual control and actual control inputs for the nonstrict feedback nonlinear discrete-time system, whereas an additional critic NN and an action NN are included for the affine nonlinear discrete-time system by assuming the state availability. All NN weights adapt online towards minimization of a certain performance index, utilizing gradient-descent-based rule. Using Lyapunov theory, the uniformly ultimate boundedness (UUB) of the closed-loop tracking error, weight estimates, and observer estimates are shown. The adaptive critic NN controller performance is evaluated on an SI engine operating with high EGR levels where the controller objective is to reduce cyclic dispersion in heat release while minimizing fuel intake. Simulation and experimental results indicate that engine out emissions drop significantly at 20% EGR due to reduction in dispersion in heat release thus verifying the dual-control approach.

On pseudo-spectral time discretizations in summation-by-parts form

NASA Astrophysics Data System (ADS)

Ruggiu, Andrea A.; Nordström, Jan

2018-05-01

Fully-implicit discrete formulations in summation-by-parts form for initial-boundary value problems must be invertible in order to provide well functioning procedures. We prove that, under mild assumptions, pseudo-spectral collocation methods for the time derivative lead to invertible discrete systems when energy-stable spatial discretizations are used.

Study on perception and control layer of mine CPS with mixed logic dynamic approach

NASA Astrophysics Data System (ADS)

Li, Jingzhao; Ren, Ping; Yang, Dayu

2017-01-01

Mine inclined roadway transportation system of mine cyber physical system is a hybrid system consisting of a continuous-time system and a discrete-time system, which can be divided into inclined roadway signal subsystem, error-proofing channel subsystems, anti-car subsystems, and frequency control subsystems. First, to ensure stable operation, improve efficiency and production safety, this hybrid system model with n inputs and m outputs is constructed and analyzed in detail, then its steady schedule state to be solved. Second, on the basis of the formal modeling for real-time systems, we use hybrid toolbox for system security verification. Third, the practical application of mine cyber physical system shows that the method for real-time simulation of mine cyber physical system is effective.

Some Aspects of Essentially Nonoscillatory (ENO) Formulations for the Euler Equations, Part 3

NASA Technical Reports Server (NTRS)

Chakravarthy, Sukumar R.

1990-01-01

An essentially nonoscillatory (ENO) formulation is described for hyperbolic systems of conservation laws. ENO approaches are based on smart interpolation to avoid spurious numerical oscillations. ENO schemes are a superset of Total Variation Diminishing (TVD) schemes. In the recent past, TVD formulations were used to construct shock capturing finite difference methods. At extremum points of the solution, TVD schemes automatically reduce to being first-order accurate discretizations locally, while away from extrema they can be constructed to be of higher order accuracy. The new framework helps construct essentially non-oscillatory finite difference methods without recourse to local reductions of accuracy to first order. Thus arbitrarily high orders of accuracy can be obtained. The basic general ideas of the new approach can be specialized in several ways and one specific implementation is described based on: (1) the integral form of the conservation laws; (2) reconstruction based on the primitive functions; (3) extension to multiple dimensions in a tensor product fashion; and (4) Runge-Kutta time integration. The resulting method is fourth-order accurate in time and space and is applicable to uniform Cartesian grids. The construction of such schemes for scalar equations and systems in one and two space dimensions is described along with several examples which illustrate interesting aspects of the new approach.

Controllability of discrete bilinear systems with bounded control.

NASA Technical Reports Server (NTRS)

Tarn, T. J.; Elliott, D. L.; Goka, T.

1973-01-01

The subject of this paper is the controllability of time-invariant discrete-time bilinear systems. Bilinear systems are classified into two categories; homogeneous and inhomogeneous. Sufficient conditions which ensure the global controllability of discrete-time bilinear systems are obtained by localized analysis in control variables.

The Spectrum of Mathematical Models.

ERIC Educational Resources Information Center

Karplus, Walter J.

1983-01-01

Mathematical modeling problems encountered in many disciplines are discussed in terms of the modeling process and applications of models. The models are classified according to three types of abstraction: continuous-space-continuous-time, discrete-space-continuous-time, and discrete-space-discrete-time. Limitations in different kinds of modeling…

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.

A novel discrete PSO algorithm for solving job shop scheduling problem to minimize makespan

NASA Astrophysics Data System (ADS)

Rameshkumar, K.; Rajendran, C.

2018-02-01

In this work, a discrete version of PSO algorithm is proposed to minimize the makespan of a job-shop. A novel schedule builder has been utilized to generate active schedules. The discrete PSO is tested using well known benchmark problems available in the literature. The solution produced by the proposed algorithms is compared with best known solution published in the literature and also compared with hybrid particle swarm algorithm and variable neighborhood search PSO algorithm. The solution construction methodology adopted in this study is found to be effective in producing good quality solutions for the various benchmark job-shop scheduling problems.

Transparent lattices and their solitary waves.

PubMed

Sadurní, E

2014-09-01

We provide a family of transparent tight-binding models with nontrivial potentials and site-dependent hopping parameters. Their feasibility is discussed in electromagnetic resonators, dielectric slabs, and quantum-mechanical traps. In the second part of the paper, the arrays are obtained through a generalization of supersymmetric quantum mechanics in discrete variables. The formalism includes a finite-difference Darboux transformation applied to the scattering matrix of a periodic array. A procedure for constructing a hierarchy of discrete Hamiltonians is indicated and a particular biparametric family is given. The corresponding potentials and hopping functions are identified as solitary waves, pointing to a discrete spinorial generalization of the Korteweg-deVries family.

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

NASA Astrophysics Data System (ADS)

Finster, Felix

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

A discrete element and ray framework for rapid simulation of acoustical dispersion of microscale particulate agglomerations

NASA Astrophysics Data System (ADS)

Zohdi, T. I.

2016-03-01

In industry, particle-laden fluids, such as particle-functionalized inks, are constructed by adding fine-scale particles to a liquid solution, in order to achieve desired overall properties in both liquid and (cured) solid states. However, oftentimes undesirable particulate agglomerations arise due to some form of mutual-attraction stemming from near-field forces, stray electrostatic charges, process ionization and mechanical adhesion. For proper operation of industrial processes involving particle-laden fluids, it is important to carefully breakup and disperse these agglomerations. One approach is to target high-frequency acoustical pressure-pulses to breakup such agglomerations. The objective of this paper is to develop a computational model and corresponding solution algorithm to enable rapid simulation of the effect of acoustical pulses on an agglomeration composed of a collection of discrete particles. Because of the complex agglomeration microstructure, containing gaps and interfaces, this type of system is extremely difficult to mesh and simulate using continuum-based methods, such as the finite difference time domain or the finite element method. Accordingly, a computationally-amenable discrete element/discrete ray model is developed which captures the primary physical events in this process, such as the reflection and absorption of acoustical energy, and the induced forces on the particulate microstructure. The approach utilizes a staggered, iterative solution scheme to calculate the power transfer from the acoustical pulse to the particles and the subsequent changes (breakup) of the pulse due to the particles. Three-dimensional examples are provided to illustrate the approach.

Robust inference in discrete hazard models for randomized clinical trials.

PubMed

Nguyen, Vinh Q; Gillen, Daniel L

2012-10-01

Time-to-event data in which failures are only assessed at discrete time points are common in many clinical trials. Examples include oncology studies where events are observed through periodic screenings such as radiographic scans. When the survival endpoint is acknowledged to be discrete, common methods for the analysis of observed failure times include the discrete hazard models (e.g., the discrete-time proportional hazards and the continuation ratio model) and the proportional odds model. In this manuscript, we consider estimation of a marginal treatment effect in discrete hazard models where the constant treatment effect assumption is violated. We demonstrate that the estimator resulting from these discrete hazard models is consistent for a parameter that depends on the underlying censoring distribution. An estimator that removes the dependence on the censoring mechanism is proposed and its asymptotic distribution is derived. Basing inference on the proposed estimator allows for statistical inference that is scientifically meaningful and reproducible. Simulation is used to assess the performance of the presented methodology in finite samples.

The Pauli Objection

NASA Astrophysics Data System (ADS)

Leon, Juan; Maccone, Lorenzo

2017-12-01

Schrödinger's equation says that the Hamiltonian is the generator of time translations. This seems to imply that any reasonable definition of time operator must be conjugate to the Hamiltonian. Then both time and energy must have the same spectrum since conjugate operators are unitarily equivalent. Clearly this is not always true: normal Hamiltonians have lower bounded spectrum and often only have discrete eigenvalues, whereas we typically desire that time can take any real value. Pauli concluded that constructing a general a time operator is impossible (although clearly it can be done in specific cases). Here we show how the Pauli argument fails when one uses an external system (a "clock") to track time, so that time arises as correlations between the system and the clock (conditional probability amplitudes framework). In this case, the time operator is conjugate to the clock Hamiltonian and not to the system Hamiltonian, but its eigenvalues still satisfy the Schrödinger equation for arbitrary system Hamiltonians.

Uniformly high-order accurate non-oscillatory schemes, 1

NASA Technical Reports Server (NTRS)

Harten, A.; Osher, S.

1985-01-01

The construction and the analysis of nonoscillatory shock capturing methods for the approximation of hyperbolic conservation laws was begun. These schemes share many desirable properties with total variation diminishing schemes (TVD), but TVD schemes have at most first order accuracy, in the sense of truncation error, at extreme of the solution. A uniformly second order approximation was constucted, which is nonoscillatory in the sense that the number of extrema of the discrete solution is not increasing in time. This is achieved via a nonoscillatory piecewise linear reconstruction of the solution from its cell averages, time evolution through an approximate solution of the resulting initial value problem, and averaging of this approximate solution over each cell.

Time Analysis of Building Dynamic Response Under Seismic Action. Part 1: Theoretical Propositions

NASA Astrophysics Data System (ADS)

Ufimtcev, E. M.

2017-11-01

The first part of the article presents the main provisions of the analytical approach - the time analysis method (TAM) developed for the calculation of the elastic dynamic response of rod structures as discrete dissipative systems (DDS) and based on the investigation of the characteristic matrix quadratic equation. The assumptions adopted in the construction of the mathematical model of structural oscillations as well as the features of seismic forces’ calculating and recording based on the data of earthquake accelerograms are given. A system to resolve equations is given to determine the nodal (kinematic and force) response parameters as well as the stress-strain state (SSS) parameters of the system’s rods.

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.

Connecting numbers to discrete quantification: a step in the child's construction of integer concepts.

PubMed

Slusser, Emily; Ditta, Annie; Sarnecka, Barbara

2013-10-01

The present study asks when young children understand that number words quantify over sets of discrete individuals. For this study, 2- to 4-year-old children were asked to extend the number word five or six either to a cup containing discrete objects (e.g., blocks) or to a cup containing a continuous substance (e.g., water). In Experiment 1, only children who knew the exact meanings of the words one, two and three extended higher number words (five or six) to sets of discrete objects. In Experiment 2, children who only knew the exact meaning of one extended higher number words to discrete objects under the right conditions (i.e., when the problem was first presented with the number words one and two). These results show that children have some understanding that number words pertain to discrete quantification from very early on, but that this knowledge becomes more robust as children learn the exact, cardinal meanings of individual number words. Copyright © 2013 Elsevier B.V. All rights reserved.

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.

A high-order time-parallel scheme for solving wave propagation problems via the direct construction of an approximate time-evolution operator

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

Haut, T. S.; Babb, T.; Martinsson, P. G.

2015-06-16

Our manuscript demonstrates a technique for efficiently solving the classical wave equation, the shallow water equations, and, more generally, equations of the form ∂u/∂t=Lu∂u/∂t=Lu, where LL is a skew-Hermitian differential operator. The idea is to explicitly construct an approximation to the time-evolution operator exp(τL)exp(τL) for a relatively large time-step ττ. Recently developed techniques for approximating oscillatory scalar functions by rational functions, and accelerated algorithms for computing functions of discretized differential operators are exploited. Principal advantages of the proposed method include: stability even for large time-steps, the possibility to parallelize in time over many characteristic wavelengths and large speed-ups over existingmore » methods in situations where simulation over long times are required. Numerical examples involving the 2D rotating shallow water equations and the 2D wave equation in an inhomogenous medium are presented, and the method is compared to the 4th order Runge–Kutta (RK4) method and to the use of Chebyshev polynomials. The new method achieved high accuracy over long-time intervals, and with speeds that are orders of magnitude faster than both RK4 and the use of Chebyshev polynomials.« less

3D Finite Element Analysis of Yixing CFRD Built on Inclined Mountain Slope

NASA Astrophysics Data System (ADS)

Sun, Da Wei; Zhang, Liang; Qing Yao, Hui; Wang, Kang Ping

2018-05-01

There are few CFRDs built on steep slope with dam height more than 50 m. So does the relative design and construction experience. The 75 m-high Yixing CFRD was built on steep mountain slope and the 45.9m-high gravity retaining wall was used to against dam sliding. Since the excessive deformation of dam body and perimetric joints would lead to failure of seal materials and cause water leakage, 3D nonlinear finite element stress-deformation analysis was carried out. 3D finite element mesh with 63875 elements including retaining wall and surrounding mountain was established by use of advanced grid discreteness technique. Large scales of equations solving method were adopted in the computer procedure and the calculation time was greatly reduced from former 40 hours to now 45 minutes. Therefore the behavior of the dam, retaining wall and the joint was obtained in a short time, and the results would be helpful to the design and construction of Yixing dam.

An advanced dissymmetric rolling model for online regulation

NASA Astrophysics Data System (ADS)

Cao, Trong-Son

2017-10-01

Roll-bite model is employed to predict the rolling force, torque as well as to estimate the forward slip for preset or online regulation at industrial rolling mills. The rolling process is often dissymmetric in terms of work-rolls rotation speeds and diameters as well as the friction conditions at upper and lower contact surfaces between work-rolls and the strip. The roll-bite model thus must be able to account for these dissymmetries and in the same time has to be accurate and fast enough for online applications. In the present study, a new method, namely Adapted Discretization Slab Method (ADSM) is proposed to obtain a robust roll-bite model, which can take into account the aforementioned dissymmetries and has a very short response time, lower than one millisecond. This model is based on the slab method, with an adaptive discretization and a global Newton-Raphson procedure to improve the convergence speed. The model was validated by comparing with other dissymmetric models proposed in the literature, as well as Finite Element simulations and industrial pilot trials. Furthermore, back-calculation tool was also constructed for friction management for both offline and online applications. With very short CPU time, the ADSM-based model is thus attractive for all online applications, both for cold and hot rolling.

Optimal Control-Based Adaptive NN Design for a Class of Nonlinear Discrete-Time Block-Triangular Systems.

PubMed

Liu, Yan-Jun; Tong, Shaocheng

2016-11-01

In this paper, we propose an optimal control scheme-based adaptive neural network design for a class of unknown nonlinear discrete-time systems. The controlled systems are in a block-triangular multi-input-multi-output pure-feedback structure, i.e., there are both state and input couplings and nonaffine functions to be included in every equation of each subsystem. The design objective is to provide a control scheme, which not only guarantees the stability of the systems, but also achieves optimal control performance. The main contribution of this paper is that it is for the first time to achieve the optimal performance for such a class of systems. Owing to the interactions among subsystems, making an optimal control signal is a difficult task. The design ideas are that: 1) the systems are transformed into an output predictor form; 2) for the output predictor, the ideal control signal and the strategic utility function can be approximated by using an action network and a critic network, respectively; and 3) an optimal control signal is constructed with the weight update rules to be designed based on a gradient descent method. The stability of the systems can be proved based on the difference Lyapunov method. Finally, a numerical simulation is given to illustrate the performance of the proposed scheme.

Application Driven Self-Assembly of Discrete, Three-Dimensional Architectures in Water.

PubMed

Taylor, Lauren; Riddell, Imogen; Smulders, Maarten M J

2018-06-25

In this review we discuss the recent advances in the construction of discrete, self-assembled architectures in water, a field that has gained significant interest in recent years because of the wide range of applications that arises from their well-defined 3D structure. We jointly discuss the efforts undertaken by supramolecular chemists and biotechnologists who previously worked independently to overcome discipline-specific challenges associated with construction of assemblies from synthetic and bio-derived components, respectively. We propose that going forward a more interdisciplinary research approach will expedite development of both synthetic and bio-derived complexes with real-world applications that exploit the benefits of compartmentalisation. In support of this, we summarise advances made in the development of discrete, water-soluble architectures, paying particular attention to their current and prospective applications. We also highlight keys areas where understanding and methodologies developed in the field of synthetic supramolecular chemistry can be integrated into the field of biotechnology and vice versa, in anticipation this will yield advances not possible from either field alone. © 2018 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Hemolytic potential of hydrodynamic cavitation.

PubMed

Chambers, S D; Bartlett, R H; Ceccio, S L

2000-08-01

The purpose of this study was to determine the hemolytic potentials of discrete bubble cavitation and attached cavitation. To generate controlled cavitation events, a venturigeometry hydrodynamic device, called a Cavitation Susceptibility Meter (CSM), was constructed. A comparison between the hemolytic potential of discrete bubble cavitation and attached cavitation was investigated with a single-pass flow apparatus and a recirculating flow apparatus, both utilizing the CSM. An analytical model, based on spherical bubble dynamics, was developed for predicting the hemolysis caused by discrete bubble cavitation. Experimentally, discrete bubble cavitation did not correlate with a measurable increase in plasma-free hemoglobin (PFHb), as predicted by the analytical model. However, attached cavitation did result in significant PFHb generation. The rate of PFHb generation scaled inversely with the Cavitation number at a constant flow rate, suggesting that the size of the attached cavity was the dominant hemolytic factor.

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.

Hamiltonian dynamics of a quantum of space: hidden symmetries and spectrum of the volume operator, and discrete orthogonal polynomials

NASA Astrophysics Data System (ADS)

Aquilanti, Vincenzo; Marinelli, Dimitri; Marzuoli, Annalisa

2013-05-01

The action of the quantum mechanical volume operator, introduced in connection with a symmetric representation of the three-body problem and recently recognized to play a fundamental role in discretized quantum gravity models, can be given as a second-order difference equation which, by a complex phase change, we turn into a discrete Schrödinger-like equation. The introduction of discrete potential-like functions reveals the surprising crucial role here of hidden symmetries, first discovered by Regge for the quantum mechanical 6j symbols; insight is provided into the underlying geometric features. The spectrum and wavefunctions of the volume operator are discussed from the viewpoint of the Hamiltonian evolution of an elementary ‘quantum of space’, and a transparent asymptotic picture of the semiclassical and classical regimes emerges. The definition of coordinates adapted to the Regge symmetry is exploited for the construction of a novel set of discrete orthogonal polynomials, characterizing the oscillatory components of torsion-like modes.

Bifacial DNA origami-directed discrete, three-dimensional, anisotropic plasmonic nanoarchitectures with tailored optical chirality.

PubMed

Lan, Xiang; Chen, Zhong; Dai, Gaole; Lu, Xuxing; Ni, Weihai; Wang, Qiangbin

2013-08-07

Discrete three-dimensional (3D) plasmonic nanoarchitectures with well-defined spatial configuration and geometry have aroused increasing interest, as new optical properties may originate from plasmon resonance coupling within the nanoarchitectures. Although spherical building blocks have been successfully employed in constructing 3D plasmonic nanoarchitectures because their isotropic nature facilitates unoriented localization, it still remains challenging to assemble anisotropic building blocks into discrete and rationally tailored 3D plasmonic nanoarchitectures. Here we report the first example of discrete 3D anisotropic gold nanorod (AuNR) dimer nanoarchitectures formed using bifacial DNA origami as a template, in which the 3D spatial configuration is precisely tuned by rationally shifting the location of AuNRs on the origami template. A distinct plasmonic chiral response was experimentally observed from the discrete 3D AuNR dimer nanoarchitectures and appeared in a spatial-configuration-dependent manner. This study represents great progress in the fabrication of 3D plasmonic nanoarchitectures with tailored optical chirality.

Joint modeling of longitudinal data and discrete-time survival outcome.

PubMed

Qiu, Feiyou; Stein, Catherine M; Elston, Robert C

2016-08-01

A predictive joint shared parameter model is proposed for discrete time-to-event and longitudinal data. A discrete survival model with frailty and a generalized linear mixed model for the longitudinal data are joined to predict the probability of events. This joint model focuses on predicting discrete time-to-event outcome, taking advantage of repeated measurements. We show that the probability of an event in a time window can be more precisely predicted by incorporating the longitudinal measurements. The model was investigated by comparison with a two-step model and a discrete-time survival model. Results from both a study on the occurrence of tuberculosis and simulated data show that the joint model is superior to the other models in discrimination ability, especially as the latent variables related to both survival times and the longitudinal measurements depart from 0. © The Author(s) 2013.

Variational approach to probabilistic finite elements

NASA Technical Reports Server (NTRS)

Belytschko, T.; Liu, W. K.; Mani, A.; Besterfield, G.

1991-01-01

Probabilistic finite element methods (PFEM), synthesizing the power of finite element methods with second-moment techniques, are formulated for various classes of problems in structural and solid mechanics. Time-invariant random materials, geometric properties and loads are incorporated in terms of their fundamental statistics viz. second-moments. Analogous to the discretization of the displacement field in finite element methods, the random fields are also discretized. Preserving the conceptual simplicity, the response moments are calculated with minimal computations. By incorporating certain computational techniques, these methods are shown to be capable of handling large systems with many sources of uncertainties. By construction, these methods are applicable when the scale of randomness is not very large and when the probabilistic density functions have decaying tails. The accuracy and efficiency of these methods, along with their limitations, are demonstrated by various applications. Results obtained are compared with those of Monte Carlo simulation and it is shown that good accuracy can be obtained for both linear and nonlinear problems. The methods are amenable to implementation in deterministic FEM based computer codes.

Variational approach to probabilistic finite elements

NASA Astrophysics Data System (ADS)

Belytschko, T.; Liu, W. K.; Mani, A.; Besterfield, G.

1991-08-01

Probabilistic finite element methods (PFEM), synthesizing the power of finite element methods with second-moment techniques, are formulated for various classes of problems in structural and solid mechanics. Time-invariant random materials, geometric properties and loads are incorporated in terms of their fundamental statistics viz. second-moments. Analogous to the discretization of the displacement field in finite element methods, the random fields are also discretized. Preserving the conceptual simplicity, the response moments are calculated with minimal computations. By incorporating certain computational techniques, these methods are shown to be capable of handling large systems with many sources of uncertainties. By construction, these methods are applicable when the scale of randomness is not very large and when the probabilistic density functions have decaying tails. The accuracy and efficiency of these methods, along with their limitations, are demonstrated by various applications. Results obtained are compared with those of Monte Carlo simulation and it is shown that good accuracy can be obtained for both linear and nonlinear problems. The methods are amenable to implementation in deterministic FEM based computer codes.

Variational approach to probabilistic finite elements

NASA Technical Reports Server (NTRS)

Belytschko, T.; Liu, W. K.; Mani, A.; Besterfield, G.

1987-01-01

Probabilistic finite element method (PFEM), synthesizing the power of finite element methods with second-moment techniques, are formulated for various classes of problems in structural and solid mechanics. Time-invariant random materials, geometric properties, and loads are incorporated in terms of their fundamental statistics viz. second-moments. Analogous to the discretization of the displacement field in finite element methods, the random fields are also discretized. Preserving the conceptual simplicity, the response moments are calculated with minimal computations. By incorporating certain computational techniques, these methods are shown to be capable of handling large systems with many sources of uncertainties. By construction, these methods are applicable when the scale of randomness is not very large and when the probabilistic density functions have decaying tails. The accuracy and efficiency of these methods, along with their limitations, are demonstrated by various applications. Results obtained are compared with those of Monte Carlo simulation and it is shown that good accuracy can be obtained for both linear and nonlinear problems. The methods are amenable to implementation in deterministic FEM based computer codes.

A discrete event simulation model for evaluating the performances of an m/g/c/c state dependent queuing system.

PubMed

Khalid, Ruzelan; Nawawi, Mohd Kamal M; Kawsar, Luthful A; Ghani, Noraida A; Kamil, Anton A; Mustafa, Adli

2013-01-01

M/G/C/C state dependent queuing networks consider service rates as a function of the number of residing entities (e.g., pedestrians, vehicles, and products). However, modeling such dynamic rates is not supported in modern Discrete Simulation System (DES) software. We designed an approach to cater this limitation and used it to construct the M/G/C/C state-dependent queuing model in Arena software. Using the model, we have evaluated and analyzed the impacts of various arrival rates to the throughput, the blocking probability, the expected service time and the expected number of entities in a complex network topology. Results indicated that there is a range of arrival rates for each network where the simulation results fluctuate drastically across replications and this causes the simulation results and analytical results exhibit discrepancies. Detail results that show how tally the simulation results and the analytical results in both abstract and graphical forms and some scientific justifications for these have been documented and discussed.

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

PubMed

Liu, Fuchun; Dziong, Zbigniew

2013-02-01

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

4d $$ \\mathcal{N} $$=2 theories with disconnected gauge groups

DOE PAGES

Argyres, Philip C.; Martone, Mario

2017-03-28

In this paper we present a beautifully consistent web of evidence for the existence of interacting 4d rank-1more » $$ \\mathcal{N} $$ = 2 SCFTs obtained from gauging discrete subgroups of global symmetries of other existing 4d rank-1 $$ \\mathcal{N} $$ = 2 SCFTs. The global symmetries that can be gauged involve a non-trivial combination of discrete subgroups of the U(1) R, low-energy EM duality group SL(2,Z), and the outer automorphism group of the flavor symmetry algebra, Out(F ). The theories that we construct are remarkable in many ways: (i) two of them have exceptional F 4 and G 2 flavor groups; (ii) they substantially complete the picture of the landscape of rank-1 $$ \\mathcal{N} $$ = 2 SCFTs as they realize all but one of the remaining consistent rank-1 Seiberg-Witten geometries that we previously constructed but were not associated to known SCFTs; and (iii) some of them have enlarged $$ \\mathcal{N} $$ = 3 SUSY, and have not been previously constructed. They are also examples of SCFTs which violate the ShapereTachikawa relation between the conformal central charges and the scaling dimension of the Coulomb branch vev. Here, we propose a modification of the formulas computing these central charges from the topologically twisted Coulomb branch partition function which correctly compute them for discretely gauged theories.« less

Discrete event performance prediction of speculatively parallel temperature-accelerated dynamics

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

Zamora, Richard James; Voter, Arthur F.; Perez, Danny

Due to its unrivaled ability to predict the dynamical evolution of interacting atoms, molecular dynamics (MD) is a widely used computational method in theoretical chemistry, physics, biology, and engineering. Despite its success, MD is only capable of modeling time scales within several orders of magnitude of thermal vibrations, leaving out many important phenomena that occur at slower rates. The Temperature Accelerated Dynamics (TAD) method overcomes this limitation by thermally accelerating the state-to-state evolution captured by MD. Due to the algorithmically complex nature of the serial TAD procedure, implementations have yet to improve performance by parallelizing the concurrent exploration of multiplemore » states. Here we utilize a discrete event-based application simulator to introduce and explore a new Speculatively Parallel TAD (SpecTAD) method. We investigate the SpecTAD algorithm, without a full-scale implementation, by constructing an application simulator proxy (SpecTADSim). Finally, following this method, we discover that a nontrivial relationship exists between the optimal SpecTAD parameter set and the number of CPU cores available at run-time. Furthermore, we find that a majority of the available SpecTAD boost can be achieved within an existing TAD application using relatively simple algorithm modifications.« less

Discrete event performance prediction of speculatively parallel temperature-accelerated dynamics

DOE PAGES

Zamora, Richard James; Voter, Arthur F.; Perez, Danny; ...

2016-12-01

Due to its unrivaled ability to predict the dynamical evolution of interacting atoms, molecular dynamics (MD) is a widely used computational method in theoretical chemistry, physics, biology, and engineering. Despite its success, MD is only capable of modeling time scales within several orders of magnitude of thermal vibrations, leaving out many important phenomena that occur at slower rates. The Temperature Accelerated Dynamics (TAD) method overcomes this limitation by thermally accelerating the state-to-state evolution captured by MD. Due to the algorithmically complex nature of the serial TAD procedure, implementations have yet to improve performance by parallelizing the concurrent exploration of multiplemore » states. Here we utilize a discrete event-based application simulator to introduce and explore a new Speculatively Parallel TAD (SpecTAD) method. We investigate the SpecTAD algorithm, without a full-scale implementation, by constructing an application simulator proxy (SpecTADSim). Finally, following this method, we discover that a nontrivial relationship exists between the optimal SpecTAD parameter set and the number of CPU cores available at run-time. Furthermore, we find that a majority of the available SpecTAD boost can be achieved within an existing TAD application using relatively simple algorithm modifications.« less

Multiple-Choice versus Constructed-Response Tests in the Assessment of Mathematics Computation Skills.

ERIC Educational Resources Information Center

Gadalla, Tahany M.

The equivalence of multiple-choice (MC) and constructed response (discrete) (CR-D) response formats as applied to mathematics computation at grade levels two to six was tested. The difference between total scores from the two response formats was tested for statistical significance, and the factor structure of items in both response formats was…

Distinguishing Discrete and Gradient Category Structure in Language: Insights from Verb-Particle Constructions

ERIC Educational Resources Information Center

Brehm, Laurel; Goldrick, Matthew

2017-01-01

The current work uses memory errors to examine the mental representation of verb-particle constructions (VPCs; e.g., "make up" the story, "cut up the meat"). Some evidence suggests that VPCs are represented by a cline in which the relationship between the VPC and its component elements ranges from highly transparent ("cut…

Examining Measurement Invariance and Differential Item Functioning with Discrete Latent Construct Indicators: A Note on a Multiple Testing Procedure

ERIC Educational Resources Information Center

Raykov, Tenko; Dimitrov, Dimiter M.; Marcoulides, George A.; Li, Tatyana; Menold, Natalja

2018-01-01

A latent variable modeling method for studying measurement invariance when evaluating latent constructs with multiple binary or binary scored items with no guessing is outlined. The approach extends the continuous indicator procedure described by Raykov and colleagues, utilizes similarly the false discovery rate approach to multiple testing, and…

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.

A geometric construction of the Riemann scalar curvature in Regge calculus

NASA Astrophysics Data System (ADS)

McDonald, Jonathan R.; Miller, Warner A.

2008-10-01

The Riemann scalar curvature plays a central role in Einstein's geometric theory of gravity. We describe a new geometric construction of this scalar curvature invariant at an event (vertex) in a discrete spacetime geometry. This allows one to constructively measure the scalar curvature using only clocks and photons. Given recent interest in discrete pre-geometric models of quantum gravity, we believe is it ever so important to reconstruct the curvature scalar with respect to a finite number of communicating observers. This derivation makes use of a new fundamental lattice cell built from elements inherited from both the original simplicial (Delaunay) spacetime and its circumcentric dual (Voronoi) lattice. The orthogonality properties between these two lattices yield an expression for the vertex-based scalar curvature which is strikingly similar to the corresponding hinge-based expression in Regge calculus (deficit angle per unit Voronoi dual area). In particular, we show that the scalar curvature is simply a vertex-based weighted average of deficits per weighted average of dual areas.

The construction and operation of a water tunnel in application to flow visualization studies of an oscillating airfoil

NASA Technical Reports Server (NTRS)

Olsen, J. H.; Liu, H. T.

1973-01-01

The water tunnel which was constructed at the NASA Ames Research Center is described along with the flow field adjacent to an oscillating airfoil. The design and operational procedures of the tunnel are described in detail. Hydrogen bubble and thymol blue techniques are used to visualize the flow field. Results of the flow visualizations are presented in a series of still pictures and a high speed movie. These results show that time stall is more complicated than simple shedding from the leading edge or the trailing edge, particularly at relatively low frequency oscillations comparable to those of a helicopter blade. Therefore, any successful theory for predicting the stall loads on the helicopter blades must treat an irregular separated region rather than a discrete vortex passing over each blade surface.

Superior memory efficiency of quantum devices for the simulation of continuous-time stochastic processes

NASA Astrophysics Data System (ADS)

Elliott, Thomas J.; Gu, Mile

2018-03-01

Continuous-time stochastic processes pervade everyday experience, and the simulation of models of these processes is of great utility. Classical models of systems operating in continuous-time must typically track an unbounded amount of information about past behaviour, even for relatively simple models, enforcing limits on precision due to the finite memory of the machine. However, quantum machines can require less information about the past than even their optimal classical counterparts to simulate the future of discrete-time processes, and we demonstrate that this advantage extends to the continuous-time regime. Moreover, we show that this reduction in the memory requirement can be unboundedly large, allowing for arbitrary precision even with a finite quantum memory. We provide a systematic method for finding superior quantum constructions, and a protocol for analogue simulation of continuous-time renewal processes with a quantum machine.

Light-Cone Effect of Radiation Fields in Cosmological Radiative Transfer Simulations

NASA Astrophysics Data System (ADS)

Ahn, Kyungjin

2015-02-01

We present a novel method to implement time-delayed propagation of radiation fields in cosmo-logical radiative transfer simulations. Time-delayed propagation of radiation fields requires construction of retarded-time fields by tracking the location and lifetime of radiation sources along the corresponding light-cones. Cosmological radiative transfer simulations have, until now, ignored this "light-cone effect" or implemented ray-tracing methods that are computationally demanding. We show that radiative trans-fer calculation of the time-delayed fields can be easily achieved in numerical simulations when periodic boundary conditions are used, by calculating the time-discretized retarded-time Green's function using the Fast Fourier Transform (FFT) method and convolving it with the source distribution. We also present a direct application of this method to the long-range radiation field of Lyman-Werner band photons, which is important in the high-redshift astrophysics with first stars.

Topological Aspects of Infinite Metal Clusters and Superconductors.

DTIC Science & Technology

1987-08-11

tetrahedra. T chemical bonding topologies qf discrete octahedral metal clusters can be either edge- localized (e.g., MoX8L 6 4 derivatives), face- localized ...constructed from edge- localized metal polyhedra such as the Mo 6 octahedra in the ternary molybdenum chalcogenides (Chevrel phases) and Rh4 tetrahedra in the...chemical bonding topologies of discrete octahedral metal clusters can be either e4ge- localized (e.g., No X L 4+ derivatives), face- localized (e.g

Nonautonomous ultradiscrete hungry Toda lattice and a generalized box-ball system

NASA Astrophysics Data System (ADS)

Maeda, Kazuki

2017-09-01

A nonautonomous version of the ultradiscrete hungry Toda lattice with a finite lattice boundary condition is derived by applying reduction and ultradiscretization to a nonautonomous two-dimensional discrete Toda lattice. It is shown that the derived ultradiscrete system has a direct connection to the box-ball system with many kinds of balls and finite carrier capacity. Particular solutions to the ultradiscrete system are constructed by using the theory of some sort of discrete biorthogonal polynomials.

On Extended Dissipativity of Discrete-Time Neural Networks With Time Delay.

PubMed

Feng, Zhiguang; Zheng, Wei Xing

2015-12-01

In this brief, the problem of extended dissipativity analysis for discrete-time neural networks with time-varying delay is investigated. The definition of extended dissipativity of discrete-time neural networks is proposed, which unifies several performance measures, such as the H∞ performance, passivity, l2 - l∞ performance, and dissipativity. By introducing a triple-summable term in Lyapunov function, the reciprocally convex approach is utilized to bound the forward difference of the triple-summable term and then the extended dissipativity criterion for discrete-time neural networks with time-varying delay is established. The derived condition guarantees not only the extended dissipativity but also the stability of the neural networks. Two numerical examples are given to demonstrate the reduced conservatism and effectiveness of the obtained results.

Formal methods for modeling and analysis of hybrid systems

NASA Technical Reports Server (NTRS)

Tiwari, Ashish (Inventor); Lincoln, Patrick D. (Inventor)

2009-01-01

A technique based on the use of a quantifier elimination decision procedure for real closed fields and simple theorem proving to construct a series of successively finer qualitative abstractions of hybrid automata is taught. The resulting abstractions are always discrete transition systems which can then be used by any traditional analysis tool. The constructed abstractions are conservative and can be used to establish safety properties of the original system. The technique works on linear and non-linear polynomial hybrid systems: the guards on discrete transitions and the continuous flows in all modes can be specified using arbitrary polynomial expressions over the continuous variables. An exemplar tool in the SAL environment built over the theorem prover PVS is detailed. The technique scales well to large and complex hybrid systems.

Factorizable Schemes for the Equations of Fluid Flow

NASA Technical Reports Server (NTRS)

Sidilkover, David

1999-01-01

We present an upwind high-resolution factorizable (UHF) discrete scheme for the compressible Euler equations that allows to distinguish between full-potential and advection factors at the discrete level. The scheme approximates equations in their general conservative form and is related to the family of genuinely multidimensional upwind schemes developed previously and demonstrated to have good shock-capturing capabilities. A unique property of this scheme is that in addition to the aforementioned features it is also factorizable, i.e., it allows to distinguish between full-potential and advection factors at the discrete level. The latter property facilitates the construction of optimally efficient multigrid solvers. This is done through a relaxation procedure that utilizes the factorizability property.

Computing approximate solutions of the protein structure determination problem using global constraints on discrete crystal lattices.

PubMed

Dal Palù, Alessandro; Dovier, Agostino; Pontelli, Enrico

2010-01-01

Crystal lattices are discrete models of the three-dimensional space that have been effectively employed to facilitate the task of determining proteins' natural conformation. This paper investigates alternative global constraints that can be introduced in a constraint solver over discrete crystal lattices. The objective is to enhance the efficiency of lattice solvers in dealing with the construction of approximate solutions of the protein structure determination problem. Some of them (e.g., self-avoiding-walk) have been explicitly or implicitly already used in previous approaches, while others (e.g., the density constraint) are new. The intrinsic complexities of all of them are studied and preliminary experimental results are discussed.

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

ERIC Educational Resources Information Center

Allison, Derek J.; Morfitt, Grace

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

Discrete Time Rescaling Theorem: Determining Goodness of Fit for Discrete Time Statistical Models of Neural Spiking

PubMed Central

Haslinger, Robert; Pipa, Gordon; Brown, Emery

2010-01-01

One approach for understanding the encoding of information by spike trains is to fit statistical models and then test their goodness of fit. The time rescaling theorem provides a goodness of fit test consistent with the point process nature of spike trains. The interspike intervals (ISIs) are rescaled (as a function of the model’s spike probability) to be independent and exponentially distributed if the model is accurate. A Kolmogorov Smirnov (KS) test between the rescaled ISIs and the exponential distribution is then used to check goodness of fit. This rescaling relies upon assumptions of continuously defined time and instantaneous events. However spikes have finite width and statistical models of spike trains almost always discretize time into bins. Here we demonstrate that finite temporal resolution of discrete time models prevents their rescaled ISIs from being exponentially distributed. Poor goodness of fit may be erroneously indicated even if the model is exactly correct. We present two adaptations of the time rescaling theorem to discrete time models. In the first we propose that instead of assuming the rescaled times to be exponential, the reference distribution be estimated through direct simulation by the fitted model. In the second, we prove a discrete time version of the time rescaling theorem which analytically corrects for the effects of finite resolution. This allows us to define a rescaled time which is exponentially distributed, even at arbitrary temporal discretizations. We demonstrate the efficacy of both techniques by fitting Generalized Linear Models (GLMs) to both simulated spike trains and spike trains recorded experimentally in monkey V1 cortex. Both techniques give nearly identical results, reducing the false positive rate of the KS test and greatly increasing the reliability of model evaluation based upon the time rescaling theorem. PMID:20608868

Discrete time rescaling theorem: determining goodness of fit for discrete time statistical models of neural spiking.

PubMed

Haslinger, Robert; Pipa, Gordon; Brown, Emery

2010-10-01

One approach for understanding the encoding of information by spike trains is to fit statistical models and then test their goodness of fit. The time-rescaling theorem provides a goodness-of-fit test consistent with the point process nature of spike trains. The interspike intervals (ISIs) are rescaled (as a function of the model's spike probability) to be independent and exponentially distributed if the model is accurate. A Kolmogorov-Smirnov (KS) test between the rescaled ISIs and the exponential distribution is then used to check goodness of fit. This rescaling relies on assumptions of continuously defined time and instantaneous events. However, spikes have finite width, and statistical models of spike trains almost always discretize time into bins. Here we demonstrate that finite temporal resolution of discrete time models prevents their rescaled ISIs from being exponentially distributed. Poor goodness of fit may be erroneously indicated even if the model is exactly correct. We present two adaptations of the time-rescaling theorem to discrete time models. In the first we propose that instead of assuming the rescaled times to be exponential, the reference distribution be estimated through direct simulation by the fitted model. In the second, we prove a discrete time version of the time-rescaling theorem that analytically corrects for the effects of finite resolution. This allows us to define a rescaled time that is exponentially distributed, even at arbitrary temporal discretizations. We demonstrate the efficacy of both techniques by fitting generalized linear models to both simulated spike trains and spike trains recorded experimentally in monkey V1 cortex. Both techniques give nearly identical results, reducing the false-positive rate of the KS test and greatly increasing the reliability of model evaluation based on the time-rescaling theorem.

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

PubMed

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

2017-07-01

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

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

NASA Astrophysics Data System (ADS)

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

2009-09-01

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

Variable selection in discrete survival models including heterogeneity.

PubMed

Groll, Andreas; Tutz, Gerhard

2017-04-01

Several variable selection procedures are available for continuous time-to-event data. However, if time is measured in a discrete way and therefore many ties occur models for continuous time are inadequate. We propose penalized likelihood methods that perform efficient variable selection in discrete survival modeling with explicit modeling of the heterogeneity in the population. The method is based on a combination of ridge and lasso type penalties that are tailored to the case of discrete survival. The performance is studied in simulation studies and an application to the birth of the first child.

Persistence Probabilities of Two-Sided (Integrated) Sums of Correlated Stationary Gaussian Sequences

NASA Astrophysics Data System (ADS)

Aurzada, Frank; Buck, Micha

2018-02-01

We study the persistence probability for some two-sided, discrete-time Gaussian sequences that are discrete-time analogues of fractional Brownian motion and integrated fractional Brownian motion, respectively. Our results extend the corresponding ones in continuous time in Molchan (Commun Math Phys 205(1):97-111, 1999) and Molchan (J Stat Phys 167(6):1546-1554, 2017) to a wide class of discrete-time processes.

Discrete-time Markovian stochastic Petri nets

NASA Technical Reports Server (NTRS)

Ciardo, Gianfranco

1995-01-01

We revisit and extend the original definition of discrete-time stochastic Petri nets, by allowing the firing times to have a 'defective discrete phase distribution'. We show that this formalism still corresponds to an underlying discrete-time Markov chain. The structure of the state for this process describes both the marking of the Petri net and the phase of the firing time for each transition, resulting in a large state space. We then modify the well-known power method to perform a transient analysis even when the state space is infinite, subject to the condition that only a finite number of states can be reached in a finite amount of time. Since the memory requirements might still be excessive, we suggest a bounding technique based on truncation.

Improved robustness and performance of discrete time sliding mode control systems.

PubMed

Chakrabarty, Sohom; Bartoszewicz, Andrzej

2016-11-01

This paper presents a theoretical analysis along with simulations to show that increased robustness can be achieved for discrete time sliding mode control systems by choosing the sliding variable, or the output, to be of relative degree two instead of relative degree one. In other words it successfully reduces the ultimate bound of the sliding variable compared to the ultimate bound for standard discrete time sliding mode control systems. It is also found out that for such a selection of relative degree two output of the discrete time system, the reduced order system during sliding becomes finite time stable in absence of disturbance. With disturbance, it becomes finite time ultimately bounded. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

Hybrid discrete/continuum algorithms for stochastic reaction networks

DOE PAGES

Safta, Cosmin; Sargsyan, Khachik; Debusschere, Bert; ...

2014-10-22

Direct solutions of the Chemical Master Equation (CME) governing Stochastic Reaction Networks (SRNs) are generally prohibitively expensive due to excessive numbers of possible discrete states in such systems. To enhance computational efficiency we develop a hybrid approach where the evolution of states with low molecule counts is treated with the discrete CME model while that of states with large molecule counts is modeled by the continuum Fokker-Planck equation. The Fokker-Planck equation is discretized using a 2nd order finite volume approach with appropriate treatment of flux components to avoid negative probability values. The numerical construction at the interface between the discretemore » and continuum regions implements the transfer of probability reaction by reaction according to the stoichiometry of the system. As a result, the performance of this novel hybrid approach is explored for a two-species circadian model with computational efficiency gains of about one order of magnitude.« less

Gaussian quadrature and lattice discretization of the Fermi-Dirac distribution for graphene.

PubMed

Oettinger, D; Mendoza, M; Herrmann, H J

2013-07-01

We construct a lattice kinetic scheme to study electronic flow in graphene. For this purpose, we first derive a basis of orthogonal polynomials, using as the weight function the ultrarelativistic Fermi-Dirac distribution at rest. Later, we use these polynomials to expand the respective distribution in a moving frame, for both cases, undoped and doped graphene. In order to discretize the Boltzmann equation and make feasible the numerical implementation, we reduce the number of discrete points in momentum space to 18 by applying a Gaussian quadrature, finding that the family of representative wave (2+1)-vectors, which satisfies the quadrature, reconstructs a honeycomb lattice. The procedure and discrete model are validated by solving the Riemann problem, finding excellent agreement with other numerical models. In addition, we have extended the Riemann problem to the case of different dopings, finding that by increasing the chemical potential the electronic fluid behaves as if it increases its effective viscosity.

Discretely Conservative Finite-Difference Formulations for Nonlinear Conservation Laws in Split Form: Theory and Boundary Conditions

NASA Technical Reports Server (NTRS)

Fisher, Travis C.; Carpenter, Mark H.; Nordstroem, Jan; Yamaleev, Nail K.; Swanson, R. Charles

2011-01-01

Simulations of nonlinear conservation laws that admit discontinuous solutions are typically restricted to discretizations of equations that are explicitly written in divergence form. This restriction is, however, unnecessary. Herein, linear combinations of divergence and product rule forms that have been discretized using diagonal-norm skew-symmetric summation-by-parts (SBP) operators, are shown to satisfy the sufficient conditions of the Lax-Wendroff theorem and thus are appropriate for simulations of discontinuous physical phenomena. Furthermore, special treatments are not required at the points that are near physical boundaries (i.e., discrete conservation is achieved throughout the entire computational domain, including the boundaries). Examples are presented of a fourth-order, SBP finite-difference operator with second-order boundary closures. Sixth- and eighth-order constructions are derived, and included in E. Narrow-stencil difference operators for linear viscous terms are also derived; these guarantee the conservative form of the combined operator.

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.

Combining Orthogonal Chain-End Deprotections and Thiol-Maleimide Michael Coupling: Engineering Discrete Oligomers by an Iterative Growth Strategy.

PubMed

Huang, Zhihao; Zhao, Junfei; Wang, Zimu; Meng, Fanying; Ding, Kunshan; Pan, Xiangqiang; Zhou, Nianchen; Li, Xiaopeng; Zhang, Zhengbiao; Zhu, Xiulin

2017-10-23

Orthogonal maleimide and thiol deprotections were combined with thiol-maleimide coupling to synthesize discrete oligomers/macromolecules on a gram scale with molecular weights up to 27.4 kDa (128mer, 7.9 g) using an iterative exponential growth strategy with a degree of polymerization (DP) of 2 n -1. Using the same chemistry, a "readable" sequence-defined oligomer and a discrete cyclic topology were also created. Furthermore, uniform dendrons were fabricated using sequential growth (DP=2 n -1) or double exponential dendrimer growth approaches (DP=22n -1) with significantly accelerated growth rates. A versatile, efficient, and metal-free method for construction of discrete oligomers with tailored structures and a high growth rate would greatly facilitate research into the structure-property relationships of sophisticated polymeric materials. © 2017 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

On the form of ROCs constructed from confidence ratings.

PubMed

Malmberg, Kenneth J

2002-03-01

A classical question for memory researchers is whether memories vary in an all-or-nothing, discrete manner (e.g., stored vs. not stored, recalled vs. not recalled), or whether they vary along a continuous dimension (e.g., strength, similarity, or familiarity). For yes-no classification tasks, continuous- and discrete-state models predict nonlinear and linear receiver operating characteristics (ROCs), respectively (D. M. Green & J. A. Swets, 1966; N. A. Macmillan & C. D. Creelman, 1991). Recently, several authors have assumed that these predictions are generalizable to confidence ratings tasks (J. Qin, C. L. Raye, M. K. Johnson, & K. J. Mitchell, 2001; S. D. Slotnick, S. A. Klein, C. S. Dodson, & A. P. Shimamura, 2000, and A. P. Yonelinas, 1999). This assumption is shown to be unwarranted by showing that discrete-state ratings models predict both linear and nonlinear ROCs. The critical factor determining the form of the discrete-state ROC is the response strategy adopted by the classifier.

Time operators in stroboscopic wave-packet basis and the time scales in tunneling

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

Bokes, P.

2011-03-15

We demonstrate that the time operator that measures the time of arrival of a quantum particle into a chosen state can be defined as a self-adjoint quantum-mechanical operator using periodic boundary conditions and applied to wave functions in energy representation. The time becomes quantized into discrete eigenvalues; and the eigenstates of the time operator, i.e., the stroboscopic wave packets introduced recently [Phys. Rev. Lett. 101, 046402 (2008)], form an orthogonal system of states. The formalism provides simple physical interpretation of the time-measurement process and direct construction of normalized, positive definite probability distribution for the quantized values of the arrival time.more » The average value of the time is equal to the phase time but in general depends on the choice of zero time eigenstate, whereas the uncertainty of the average is related to the traversal time and is independent of this choice. The general formalism is applied to a particle tunneling through a resonant tunneling barrier in one dimension.« less

Stochastic Evolution Equations Driven by Fractional Noises

DTIC Science & Technology

2016-11-28

rate of convergence to zero or the error and the limit in distribution of the error fluctuations. We have studied time discrete numerical schemes...error fluctuations. We have studied time discrete numerical schemes based on Taylor expansions for rough differential equations and for stochastic...variations of the time discrete Taylor schemes for rough differential equations and for stochastic differential equations driven by fractional Brownian

Feynman’s clock, a new variational principle, and parallel-in-time quantum dynamics

PubMed Central

McClean, Jarrod R.; Parkhill, John A.; Aspuru-Guzik, Alán

2013-01-01

We introduce a discrete-time variational principle inspired by the quantum clock originally proposed by Feynman and use it to write down quantum evolution as a ground-state eigenvalue problem. The construction allows one to apply ground-state quantum many-body theory to quantum dynamics, extending the reach of many highly developed tools from this fertile research area. Moreover, this formalism naturally leads to an algorithm to parallelize quantum simulation over time. We draw an explicit connection between previously known time-dependent variational principles and the time-embedded variational principle presented. Sample calculations are presented, applying the idea to a hydrogen molecule and the spin degrees of freedom of a model inorganic compound, demonstrating the parallel speedup of our method as well as its flexibility in applying ground-state methodologies. Finally, we take advantage of the unique perspective of this variational principle to examine the error of basis approximations in quantum dynamics. PMID:24062428

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.

Orthogonal sets of data windows constructed from trigonometric polynomials

NASA Technical Reports Server (NTRS)

Greenhall, C. A.

1989-01-01

Suboptimal, easily computable substitutes for the discrete prolate-spheroidal windows used by Thomson for spectral estimation are given. Trigonometric coefficients and energy leakages of the window polynomials are tabulated.

43 CFR 12.830 - Buy American Act-Construction materials.

Code of Federal Regulations, 2012 CFR

2012-10-01

... articles, materials or supplies. However, emergency life safety systems, such as emergency lighting, fire alarm, and audio evacuation systems, which are discrete systems incorporated into a public building or...

43 CFR 12.830 - Buy American Act-Construction materials.

Code of Federal Regulations, 2013 CFR

2013-10-01

... articles, materials or supplies. However, emergency life safety systems, such as emergency lighting, fire alarm, and audio evacuation systems, which are discrete systems incorporated into a public building or...

43 CFR 12.830 - Buy American Act-Construction materials.

Code of Federal Regulations, 2014 CFR

2014-10-01

... articles, materials or supplies. However, emergency life safety systems, such as emergency lighting, fire alarm, and audio evacuation systems, which are discrete systems incorporated into a public building or...

Discrete-element simulation of sea-ice mechanics: Contact mechanics and granular jamming

NASA Astrophysics Data System (ADS)

Damsgaard, A.; Adcroft, A.; Sergienko, O. V.; Stern, A. A.

2017-12-01

Lagrangian models of sea-ice dynamics offer several advantages to Eulerian continuum methods. Spatial discretization on the ice-floe scale is natural for Lagrangian models, which additionally offer the convenience of being able to handle arbitrary sea-ice concentrations. This is likely to improve model performance in ice-marginal zones with strong advection. Furthermore, phase transitions in granular rheology around the jamming limit, such as observed when sea ice moves through geometric confinements, includes sharp thresholds in effective viscosity which are typically ignored in Eulerian models. Granular jamming is a stochastic process dependent on having the right grains in the right place at the right time, and the jamming likelihood over time can be described by a probabilistic model. Difficult to parameterize in continuum formulations, jamming occurs naturally in dense granular systems simulated in a Lagrangian framework, and is a very relevant process controlling sea-ice transport through narrow straits. We construct a flexible discrete-element framework for simulating Lagrangian sea-ice dynamics at the ice-floe scale, forced by ocean and atmosphere velocity fields. Using this framework, we demonstrate that frictionless contact models based on compressive stiffness alone are unlikely to jam, and describe two different approaches based on friction and tensile strength which both result in increased bulk shear strength of the granular assemblage. The frictionless but cohesive contact model, with certain tensile strength values, can display jamming behavior which on the large scale is very similar to a more complex and realistic model with contact friction and ice-floe rotation.

Diffusion maps, clustering and fuzzy Markov modeling in peptide folding transitions

NASA Astrophysics Data System (ADS)

Nedialkova, Lilia V.; Amat, Miguel A.; Kevrekidis, Ioannis G.; Hummer, Gerhard

2014-09-01

Using the helix-coil transitions of alanine pentapeptide as an illustrative example, we demonstrate the use of diffusion maps in the analysis of molecular dynamics simulation trajectories. Diffusion maps and other nonlinear data-mining techniques provide powerful tools to visualize the distribution of structures in conformation space. The resulting low-dimensional representations help in partitioning conformation space, and in constructing Markov state models that capture the conformational dynamics. In an initial step, we use diffusion maps to reduce the dimensionality of the conformational dynamics of Ala5. The resulting pretreated data are then used in a clustering step. The identified clusters show excellent overlap with clusters obtained previously by using the backbone dihedral angles as input, with small—but nontrivial—differences reflecting torsional degrees of freedom ignored in the earlier approach. We then construct a Markov state model describing the conformational dynamics in terms of a discrete-time random walk between the clusters. We show that by combining fuzzy C-means clustering with a transition-based assignment of states, we can construct robust Markov state models. This state-assignment procedure suppresses short-time memory effects that result from the non-Markovianity of the dynamics projected onto the space of clusters. In a comparison with previous work, we demonstrate how manifold learning techniques may complement and enhance informed intuition commonly used to construct reduced descriptions of the dynamics in molecular conformation space.

Diffusion maps, clustering and fuzzy Markov modeling in peptide folding transitions

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

Nedialkova, Lilia V.; Amat, Miguel A.; Kevrekidis, Ioannis G., E-mail: yannis@princeton.edu, E-mail: gerhard.hummer@biophys.mpg.de

Using the helix-coil transitions of alanine pentapeptide as an illustrative example, we demonstrate the use of diffusion maps in the analysis of molecular dynamics simulation trajectories. Diffusion maps and other nonlinear data-mining techniques provide powerful tools to visualize the distribution of structures in conformation space. The resulting low-dimensional representations help in partitioning conformation space, and in constructing Markov state models that capture the conformational dynamics. In an initial step, we use diffusion maps to reduce the dimensionality of the conformational dynamics of Ala5. The resulting pretreated data are then used in a clustering step. The identified clusters show excellent overlapmore » with clusters obtained previously by using the backbone dihedral angles as input, with small—but nontrivial—differences reflecting torsional degrees of freedom ignored in the earlier approach. We then construct a Markov state model describing the conformational dynamics in terms of a discrete-time random walk between the clusters. We show that by combining fuzzy C-means clustering with a transition-based assignment of states, we can construct robust Markov state models. This state-assignment procedure suppresses short-time memory effects that result from the non-Markovianity of the dynamics projected onto the space of clusters. In a comparison with previous work, we demonstrate how manifold learning techniques may complement and enhance informed intuition commonly used to construct reduced descriptions of the dynamics in molecular conformation space.« less

Diffusion maps, clustering and fuzzy Markov modeling in peptide folding transitions

PubMed Central

Nedialkova, Lilia V.; Amat, Miguel A.; Kevrekidis, Ioannis G.; Hummer, Gerhard

2014-01-01

Using the helix-coil transitions of alanine pentapeptide as an illustrative example, we demonstrate the use of diffusion maps in the analysis of molecular dynamics simulation trajectories. Diffusion maps and other nonlinear data-mining techniques provide powerful tools to visualize the distribution of structures in conformation space. The resulting low-dimensional representations help in partitioning conformation space, and in constructing Markov state models that capture the conformational dynamics. In an initial step, we use diffusion maps to reduce the dimensionality of the conformational dynamics of Ala5. The resulting pretreated data are then used in a clustering step. The identified clusters show excellent overlap with clusters obtained previously by using the backbone dihedral angles as input, with small—but nontrivial—differences reflecting torsional degrees of freedom ignored in the earlier approach. We then construct a Markov state model describing the conformational dynamics in terms of a discrete-time random walk between the clusters. We show that by combining fuzzy C-means clustering with a transition-based assignment of states, we can construct robust Markov state models. This state-assignment procedure suppresses short-time memory effects that result from the non-Markovianity of the dynamics projected onto the space of clusters. In a comparison with previous work, we demonstrate how manifold learning techniques may complement and enhance informed intuition commonly used to construct reduced descriptions of the dynamics in molecular conformation space. PMID:25240340

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.

Time crystals: a review

NASA Astrophysics Data System (ADS)

Sacha, Krzysztof; Zakrzewski, Jakub

2018-01-01

Time crystals are time-periodic self-organized structures postulated by Frank Wilczek in 2012. While the original concept was strongly criticized, it stimulated at the same time an intensive research leading to propositions and experimental verifications of discrete (or Floquet) time crystals—the structures that appear in the time domain due to spontaneous breaking of discrete time translation symmetry. The struggle to observe discrete time crystals is reviewed here together with propositions that generalize this concept introducing condensed matter like physics in the time domain. We shall also revisit the original Wilczek’s idea and review strategies aimed at spontaneous breaking of continuous time translation symmetry.

How to Construct an Automated Warehouse Based on Colored Timed Petri Nets

NASA Astrophysics Data System (ADS)

Cheng, Fei; He, Shanjun

The automated warehouse considered here consists of a number of rack locations with three cranes, a narrow aisle shuttle, and several buffer stations with the roller. Based on analyzing of the behaviors of the active resources in the system, a modular and computerized model is presented via a colored timed Petri net approach, in which places are multicolored to simplify model and characterize control flow of the resources, and token colors are defined as the routes of storage/retrieval operations. In addition, an approach for realization of model via visual c++ is briefly given. These facts allow us to render an emulate system to simulate a discrete control application for online monitoring, dynamic dispatching control and off-line revising scheduler policies.

Convergence of discrete Aubry–Mather model in the continuous limit

NASA Astrophysics Data System (ADS)

Su, Xifeng; Thieullen, Philippe

2018-05-01

We develop two approximation schemes for solving the cell equation and the discounted cell equation using Aubry–Mather–Fathi theory. The Hamiltonian is supposed to be Tonelli, time-independent and periodic in space. By Legendre transform it is equivalent to find a fixed point of some nonlinear operator, called Lax-Oleinik operator, which may be discounted or not. By discretizing in time, we are led to solve an additive eigenvalue problem involving a discrete Lax–Oleinik operator. We show how to approximate the effective Hamiltonian and some weak KAM solutions by letting the time step in the discrete model tend to zero. We also obtain a selected discrete weak KAM solution as in Davini et al (2016 Invent. Math. 206 29–55), and show that it converges to a particular solution of the cell equation. In order to unify the two settings, continuous and discrete, we develop a more general formalism of the short-range interactions.

Global exponential stability of BAM neural networks with time-varying delays: The discrete-time case

NASA Astrophysics Data System (ADS)

Raja, R.; Marshal Anthoni, S.

2011-02-01

This paper deals with the problem of stability analysis for a class of discrete-time bidirectional associative memory (BAM) neural networks with time-varying delays. By employing the Lyapunov functional and linear matrix inequality (LMI) approach, a new sufficient conditions is proposed for the global exponential stability of discrete-time BAM neural networks. The proposed LMI based results can be easily checked by LMI control toolbox. Moreover, an example is also provided to demonstrate the effectiveness of the proposed method.

The Impact of One-Dose Package of Medicines on Patient Waiting Time in Dispensing Pharmacy: Application of a Discrete Event Simulation Model.

PubMed

Furushima, Daisuke; Yamada, Hiroshi; Kido, Michiko; Ohno, Yuko

2018-01-01

Improvement in patient waiting time in dispensing pharmacies is an important element for patient and pharmacists. The One-Dose Package (ODP) of medicines was implemented in Japan to support medicine adherence among elderly patients; however, it also contributed to increase in patient waiting times. Given the projected increase in ODP patients in the near future owing to rapid population aging, development of improved strategies is a key imperative. We conducted a cross-sectional survey at a single dispensing pharmacy to clarify the impact of ODP on patient waiting time. Further, we propose an improvement strategy developed with use of a discrete event simulation (DES) model. A total of 673 patients received pharmacy services during the study period. A two-fold difference in mean waiting time was observed between ODP and non-ODP patients (22.6 and 11.2 min, respectively). The DES model was constructed with input parameters estimated from observed data. Introduction of fully automated ODP (A-ODP) system was projected to reduce the waiting time for ODP patient by 0.5 times (from 23.1 to 11.5 min). Furthermore, assuming that 40% of non-ODP patients would transfer to ODP, the waiting time was predicted to increase to 56.8 min; however, introduction of the A-ODP system decreased the waiting time to 20.4 min. Our findings indicate that ODP is one of the elements that increases the waiting time and that it might become longer in the future. Introduction of the A-ODP system may be an effective strategy to improve waiting time.

Water Inrush Analysis of the Longmen Mountain Tunnel Based on a 3D Simulation of the Discrete Fracture Network

NASA Astrophysics Data System (ADS)

Xiong, Ziming; Wang, Mingyang; Shi, ShaoShuai; Xia, YuanPu; Lu, Hao; Bu, Lin

2017-12-01

The construction of tunnels and underground engineering in China has developed rapidly in recent years in both the number and the length of tunnels. However, with the development of tunnel construction technology, risk assessment of the tunnels has become increasingly important. Water inrush is one of the most important causes of engineering accidents worldwide, resulting in considerable economic and environmental losses. Accordingly, water inrush prediction is important for ensuring the safety of tunnel construction. Therefore, in this study, we constructed a three-dimensional discrete network fracture model using the Monte Carlo method first with the basic data from the engineering geological map of the Longmen Mountain area, the location of the Longmen Mountain tunnel. Subsequently, we transformed the discrete fracture networks into a pipe network model. Next, the DEM of the study area was analysed and a submerged analysis was conducted to determine the water storage area. Finally, we attempted to predict the water inrush along the Longmen Mountain tunnel based on the Darcy flow equation. Based on the contrast of water inrush between the proposed approach, groundwater dynamics and precipitation infiltration method, we conclude the following: the water inflow determined using the groundwater dynamics simulation results are basically consistent with those in the D2K91+020 to D2K110+150 mileage. Specifically, in the D2K91+020 to D2K94+060, D2K96+440 to D2K98+100 and other sections of the tunnel, the simulated and measured results are in close agreement and show that this method is effective. In general, we can predict the water inflow in the area of the Longmen Mountain tunnel based on the existing fracture joint parameters and the hydrogeological data of the Longmen Mountain area, providing a water inrush simulation and guiding the tunnel excavation and construction stages.

On the lagrangian 1-form structure of the hyperbolic calogero-moser system

NASA Astrophysics Data System (ADS)

Jairuk, Umpon; Tanasittikosol, Monsit; Yoo-Kong, Sikarin

2017-06-01

In this work, we present the Lagrangian 1-form structure of the hyperbolic Calogero-Moser system in both discrete-time level and continuous-time level. The discrete-time hyperbolic Calogero-Moser system is obtained by considering pole reduction of the semi-discrete Kadomtsev-Petviashvili (KP) equation. Furthermore, it is shown that the hyperbolic Calogero-Moser system possesses the key relation, known as the discrete-time closure relation. This relation is a consequence of the compatibility property of the temporal Lax matrices. The continuous-time hierarchy of the hyperbolic Calogero-Moser system is obtained by taking two successive continuum limits, namely, the skewed limit and full limit. With these successive limits, the continuous-time closure relation is also obtained and is shown to hold at the continuous level.

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.

High-Performance High-Order Simulation of Wave and Plasma Phenomena

NASA Astrophysics Data System (ADS)

Klockner, Andreas

This thesis presents results aiming to enhance and broaden the applicability of the discontinuous Galerkin ("DG") method in a variety of ways. DG was chosen as a foundation for this work because it yields high-order finite element discretizations with very favorable numerical properties for the treatment of hyperbolic conservation laws. In a first part, I examine progress that can be made on implementation aspects of DG. In adapting the method to mass-market massively parallel computation hardware in the form of graphics processors ("GPUs"), I obtain an increase in computation performance per unit of cost by more than an order of magnitude over conventional processor architectures. Key to this advance is a recipe that adapts DG to a variety of hardware through automated self-tuning. I discuss new parallel programming tools supporting GPU run-time code generation which are instrumental in the DG self-tuning process and contribute to its reaching application floating point throughput greater than 200 GFlops/s on a single GPU and greater than 3 TFlops/s on a 16-GPU cluster in simulations of electromagnetics problems in three dimensions. I further briefly discuss the solver infrastructure that makes this possible. In the second part of the thesis, I introduce a number of new numerical methods whose motivation is partly rooted in the opportunity created by GPU-DG: First, I construct and examine a novel GPU-capable shock detector, which, when used to control an artificial viscosity, helps stabilize DG computations in gas dynamics and a number of other fields. Second, I describe my pursuit of a method that allows the simulation of rarefied plasmas using a DG discretization of the electromagnetic field. Finally, I introduce new explicit multi-rate time integrators for ordinary differential equations with multiple time scales, with a focus on applicability to DG discretizations of time-dependent problems.

Application of variational principles and adjoint integrating factors for constructing numerical GFD models

NASA Astrophysics Data System (ADS)

Penenko, Vladimir; Tsvetova, Elena; Penenko, Alexey

2015-04-01

The proposed method is considered on an example of hydrothermodynamics and atmospheric chemistry models [1,2]. In the development of the existing methods for constructing numerical schemes possessing the properties of total approximation for operators of multiscale process models, we have developed a new variational technique, which uses the concept of adjoint integrating factors. The technique is as follows. First, a basic functional of the variational principle (the integral identity that unites the model equations, initial and boundary conditions) is transformed using Lagrange's identity and the second Green's formula. As a result, the action of the operators of main problem in the space of state functions is transferred to the adjoint operators defined in the space of sufficiently smooth adjoint functions. By the choice of adjoint functions the order of the derivatives becomes lower by one than those in the original equations. We obtain a set of new balance relationships that take into account the sources and boundary conditions. Next, we introduce the decomposition of the model domain into a set of finite volumes. For multi-dimensional non-stationary problems, this technique is applied in the framework of the variational principle and schemes of decomposition and splitting on the set of physical processes for each coordinate directions successively at each time step. For each direction within the finite volume, the analytical solutions of one-dimensional homogeneous adjoint equations are constructed. In this case, the solutions of adjoint equations serve as integrating factors. The results are the hybrid discrete-analytical schemes. They have the properties of stability, approximation and unconditional monotony for convection-diffusion operators. These schemes are discrete in time and analytic in the spatial variables. They are exact in case of piecewise-constant coefficients within the finite volume and along the coordinate lines of the grid area in each direction on a time step. In each direction, they have tridiagonal structure. They are solved by the sweep method. An important advantage of the discrete-analytical schemes is that the values of derivatives at the boundaries of finite volume are calculated together with the values of the unknown functions. This technique is particularly attractive for problems with dominant convection, as it does not require artificial monotonization and limiters. The same idea of integrating factors is applied in temporal dimension to the stiff systems of equations describing chemical transformation models [2]. The proposed method is applicable for the problems involving convection-diffusion-reaction operators. The work has been partially supported by the Presidium of RAS under Program 43, and by the RFBR grants 14-01-00125 and 14-01-31482. References: 1. V.V. Penenko, E.A. Tsvetova, A.V. Penenko. Variational approach and Euler's integrating factors for environmental studies// Computers and Mathematics with Applications, (2014) V.67, Issue 12, P. 2240-2256. 2. V.V.Penenko, E.A.Tsvetova. Variational methods of constructing monotone approximations for atmospheric chemistry models // Numerical analysis and applications, 2013, V. 6, Issue 3, pp 210-220.

Scintillators and applications thereof

DOEpatents

Williams, Richard T.

2015-09-01

Scintillators of various constructions and methods of making and using the same are provided. In some embodiments, a scintillator comprises at least one radiation absorption region and at least one spatially discrete radiative exciton recombination region.

Scintillators and applications thereof

DOEpatents

Williams, Richard T.

2014-07-15

Scintillators of various constructions and methods of making and using the same are provided. In some embodiments, a scintillator comprises at least one radiation absorption region and at least one spatially discrete radiative exciton recombination region.

Retrofitted supersymmetric models

NASA Astrophysics Data System (ADS)

Bose, Manatosh

This thesis explores several models of metastable dynamic supersymmetry breaking (MDSB) and a supersymmetric model of hybrid inflation. All of these models possess discrete R-symmetries. We specially focus on the retrofitted models for supersymmetry breaking models. At first we construct retrofitted models of gravity mediation. In these models we explore the genericity of the so-called "split supersymmetry." We show that with the simplest models, where the goldstino multiplet is neutral under the discrete R-symmetry, a split spectrum is not generic. However if the goldstino superfield is charged under some symmetry other than the R-symmetry, then a split spectrum is achievable but not generic. We also present a gravity mediated model where the fine tuning of the Z-boson mass is dictated by a discrete choice rather than a continuous tuning. Then we construct retrofitted models of gauge mediated SUSY breaking. We show that, in these models, if the approximate R-symmetry of the theory is spontaneously broken, the messenger scale is fixed; if explicitly broken by retrofitted couplings, a very small dimensionless number is required; if supergravity corrections are responsible for the symmetry breaking, at least two moderately small couplings are required, and that there is a large range of possible messenger scales. Finally we switch our attention to small field hybrid inflation. We construct a model that yields a spectral index ns = 0.96. Here, we also briefly discuss the possibility of relating the scale of inflation with the dynamics responsible for supersymmetry breaking.

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.

Molecular dynamics at low time resolution.

PubMed

Faccioli, P

2010-10-28

The internal dynamics of macromolecular systems is characterized by widely separated time scales, ranging from fraction of picoseconds to nanoseconds. In ordinary molecular dynamics simulations, the elementary time step Δt used to integrate the equation of motion needs to be chosen much smaller of the shortest time scale in order not to cut-off physical effects. We show that in systems obeying the overdamped Langevin equation, it is possible to systematically correct for such discretization errors. This is done by analytically averaging out the fast molecular dynamics which occurs at time scales smaller than Δt, using a renormalization group based technique. Such a procedure gives raise to a time-dependent calculable correction to the diffusion coefficient. The resulting effective Langevin equation describes by construction the same long-time dynamics, but has a lower time resolution power, hence it can be integrated using larger time steps Δt. We illustrate and validate this method by studying the diffusion of a point-particle in a one-dimensional toy model and the denaturation of a protein.

A Scale-Invariant ``Discrete-Time'' Balitsky--Kovchegov Equation

NASA Astrophysics Data System (ADS)

Bialas, A.; Peschanski, R.

2005-06-01

We consider a version of QCD dipole cascading corresponding to a finite number n of discrete Δ Y steps of branching in rapidity. Using the discretization scheme preserving the holomorphic factorizability and scale-invariance in position space of the dipole splitting function, we derive an exact recurrence formula from step to step which plays the rôle of a ``discrete-time'' Balitsky--Kovchegov equation. The BK solutions are recovered in the limit n=∞ and Δ Y=0.

Bone scaffolds with homogeneous and discrete gradient mechanical properties.

PubMed

Jelen, C; Mattei, G; Montemurro, F; De Maria, C; Mattioli-Belmonte, M; Vozzi, G

2013-01-01

Bone TE uses a scaffold either to induce bone formation from surrounding tissue or to act as a carrier or template for implanted bone cells or other agents. We prepared different bone tissue constructs based on collagen, gelatin and hydroxyapatite using genipin as cross-linking agent. The fabricated construct did not present a release neither of collagen neither of genipin over its toxic level in the surrounding aqueous environment. Each scaffold has been mechanically characterized with compression, swelling and creep tests, and their respective viscoelastic mechanical models were derived. Mechanical characterization showed a practically elastic behavior of all samples and that compressive elastic modulus basically increases as content of HA increases, and it is strongly dependent on porosity and water content. Moreover, by considering that gradients in cellular and extracellular architecture as well as in mechanical properties are readily apparent in native tissues, we developed discrete functionally graded scaffolds (discrete FGSs) in order to mimic the graded structure of bone tissue. These new structures were mechanically characterized showing a marked anisotropy as the native bone tissue. Results obtained have shown FGSs could represent valid bone substitutes. Copyright © 2012 Elsevier B.V. All rights reserved.

Topology reconstruction for B-Rep modeling from 3D mesh in reverse engineering applications

NASA Astrophysics Data System (ADS)

Bénière, Roseline; Subsol, Gérard; Gesquière, Gilles; Le Breton, François; Puech, William

2012-03-01

Nowadays, most of the manufactured objects are designed using CAD (Computer-Aided Design) software. Nevertheless, for visualization, data exchange or manufacturing applications, the geometric model has to be discretized into a 3D mesh composed of a finite number of vertices and edges. But, in some cases, the initial model may be lost or unavailable. In other cases, the 3D discrete representation may be modified, for example after a numerical simulation, and does not correspond anymore to the initial model. A reverse engineering method is then required to reconstruct a 3D continuous representation from the discrete one. In previous work, we have presented a new approach for 3D geometric primitive extraction. In this paper, to complete our automatic and comprehensive reverse engineering process, we propose a method to construct the topology of the retrieved object. To reconstruct a B-Rep model, a new formalism is now introduced to define the adjacency relations. Then a new process is used to construct the boundaries of the object. The whole process is tested on 3D industrial meshes and bring a solution to recover B-Rep models.

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

NASA Astrophysics Data System (ADS)

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

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

Geometric U-folds in four dimensions

NASA Astrophysics Data System (ADS)

Lazaroiu, C. I.; Shahbazi, C. S.

2018-01-01

We describe a general construction of geometric U-folds compatible with a non-trivial extension of the global formulation of four-dimensional extended supergravity on a differentiable spin manifold. The topology of geometric U-folds depends on certain flat fiber bundles which encode how supergravity fields are globally glued together. We show that smooth non-trivial U-folds of this type can exist only in theories where both the scalar and space-time manifolds have non-trivial fundamental group and in addition the scalar map of the solution is homotopically non-trivial. Consistency with string theory requires smooth geometric U-folds to be glued using subgroups of the effective discrete U-duality group, implying that the fundamental group of the scalar manifold of such solutions must be a subgroup of the latter. We construct simple examples of geometric U-folds in a generalization of the axion-dilaton model of \

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

PubMed

Wei, Qinglai; Liu, Derong; Lin, Qiao

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

Adjoint-Based Methodology for Time-Dependent Optimization

NASA Technical Reports Server (NTRS)

Yamaleev, N. K.; Diskin, B.; Nielsen, E. J.

2008-01-01

This paper presents a discrete adjoint method for a broad class of time-dependent optimization problems. The time-dependent adjoint equations are derived in terms of the discrete residual of an arbitrary finite volume scheme which approximates unsteady conservation law equations. Although only the 2-D unsteady Euler equations are considered in the present analysis, this time-dependent adjoint method is applicable to the 3-D unsteady Reynolds-averaged Navier-Stokes equations with minor modifications. The discrete adjoint operators involving the derivatives of the discrete residual and the cost functional with respect to the flow variables are computed using a complex-variable approach, which provides discrete consistency and drastically reduces the implementation and debugging cycle. The implementation of the time-dependent adjoint method is validated by comparing the sensitivity derivative with that obtained by forward mode differentiation. Our numerical results show that O(10) optimization iterations of the steepest descent method are needed to reduce the objective functional by 3-6 orders of magnitude for test problems considered.

Variability of a "force signature" during windmill softball pitching and relationship between discrete force variables and pitch velocity.

PubMed

Nimphius, Sophia; McGuigan, Michael R; Suchomel, Timothy J; Newton, Robert U

2016-06-01

This study assessed reliability of discrete ground reaction force (GRF) variables over multiple pitching trials, investigated the relationships between discrete GRF variables and pitch velocity (PV) and assessed the variability of the "force signature" or continuous force-time curve during the pitching motion of windmill softball pitchers. Intraclass correlation coefficient (ICC) for all discrete variables was high (0.86-0.99) while the coefficient of variance (CV) was low (1.4-5.2%). Two discrete variables were significantly correlated to PV; second vertical peak force (r(5)=0.81, p=0.03) and time between peak forces (r(5)=-0.79; p=0.03). High ICCs and low CVs support the reliability of discrete GRF and PV variables over multiple trials and significant correlations indicate there is a relationship between the ability to produce force and the timing of this force production with PV. The mean of all pitchers' curve-average standard deviation of their continuous force-time curves demonstrated low variability (CV=4.4%) indicating a repeatable and identifiable "force signature" pattern during this motion. As such, the continuous force-time curve in addition to discrete GRF variables should be examined in future research as a potential method to monitor or explain changes in pitching performance. Copyright © 2016 Elsevier B.V. All rights reserved.

New Developments in the Method of Space-Time Conservation Element and Solution Element-Applications to Two-Dimensional Time-Marching Problems

NASA Technical Reports Server (NTRS)

Chang, Sin-Chung; Wang, Xiao-Yen; Chow, Chuen-Yen

1994-01-01

A new numerical discretization method for solving conservation laws is being developed. This new approach differs substantially in both concept and methodology from the well-established methods, i.e., finite difference, finite volume, finite element, and spectral methods. It is motivated by several important physical/numerical considerations and designed to avoid several key limitations of the above traditional methods. As a result of the above considerations, a set of key principles for the design of numerical schemes was put forth in a previous report. These principles were used to construct several numerical schemes that model a 1-D time-dependent convection-diffusion equation. These schemes were then extended to solve the time-dependent Euler and Navier-Stokes equations of a perfect gas. It was shown that the above schemes compared favorably with the traditional schemes in simplicity, generality, and accuracy. In this report, the 2-D versions of the above schemes, except the Navier-Stokes solver, are constructed using the same set of design principles. Their constructions are simplified greatly by the use of a nontraditional space-time mesh. Its use results in the simplest stencil possible, i.e., a tetrahedron in a 3-D space-time with a vertex at the upper time level and other three at the lower time level. Because of the similarity in their design, each of the present 2-D solvers virtually shares with its 1-D counterpart the same fundamental characteristics. Moreover, it is shown that the present Euler solver is capable of generating highly accurate solutions for a famous 2-D shock reflection problem. Specifically, both the incident and the reflected shocks can be resolved by a single data point without the presence of numerical oscillations near the discontinuity.

Discrete sudden perturbation theory for inelastic scattering. I. Quantum and semiclassical treatment

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

Cross, R.J.

1985-12-01

A double perturbation theory is constructed to treat rotationally and vibrationally inelastic scattering. It uses both the elastic scattering from the spherically averaged potential and the infinite-order sudden (IOS) approximation as the unperturbed solutions. First, a standard perturbation expansion is done to express the radial wave functions in terms of the elastic wave functions. The resulting coupled equations are transformed to the discrete-variable representation where the IOS equations are diagonal. Then, the IOS solutions are removed from the equations which are solved by an exponential perturbation approximation. The results for Ar+N/sub 2/ are very much more accurate than the IOSmore » and somewhat more accurate than a straight first-order exponential perturbation theory. The theory is then converted into a semiclassical, time-dependent form by using the WKB approximation. The result is an integral of the potential times a slowly oscillating factor over the classical trajectory. A method of interpolating the result is given so that the calculation is done at the average velocity for a given transition. With this procedure, the semiclassical version of the theory is more accurate than the quantum version and very much faster. Calculations on Ar+N/sub 2/ show the theory to be much more accurate than the infinite-order sudden (IOS) approximation and the exponential time-dependent perturbation theory.« less

A meshless method for solving two-dimensional variable-order time fractional advection-diffusion equation

NASA Astrophysics Data System (ADS)

Tayebi, A.; Shekari, Y.; Heydari, M. H.

2017-07-01

Several physical phenomena such as transformation of pollutants, energy, particles and many others can be described by the well-known convection-diffusion equation which is a combination of the diffusion and advection equations. In this paper, this equation is generalized with the concept of variable-order fractional derivatives. The generalized equation is called variable-order time fractional advection-diffusion equation (V-OTFA-DE). An accurate and robust meshless method based on the moving least squares (MLS) approximation and the finite difference scheme is proposed for its numerical solution on two-dimensional (2-D) arbitrary domains. In the time domain, the finite difference technique with a θ-weighted scheme and in the space domain, the MLS approximation are employed to obtain appropriate semi-discrete solutions. Since the newly developed method is a meshless approach, it does not require any background mesh structure to obtain semi-discrete solutions of the problem under consideration, and the numerical solutions are constructed entirely based on a set of scattered nodes. The proposed method is validated in solving three different examples including two benchmark problems and an applied problem of pollutant distribution in the atmosphere. In all such cases, the obtained results show that the proposed method is very accurate and robust. Moreover, a remarkable property so-called positive scheme for the proposed method is observed in solving concentration transport phenomena.

Singular perturbations and time scales in the design of digital flight control systems

NASA Technical Reports Server (NTRS)

Naidu, Desineni S.; Price, Douglas B.

1988-01-01

The results are presented of application of the methodology of Singular Perturbations and Time Scales (SPATS) to the control of digital flight systems. A block diagonalization method is described to decouple a full order, two time (slow and fast) scale, discrete control system into reduced order slow and fast subsystems. Basic properties and numerical aspects of the method are discussed. A composite, closed-loop, suboptimal control system is constructed as the sum of the slow and fast optimal feedback controls. The application of this technique to an aircraft model shows close agreement between the exact solutions and the decoupled (or composite) solutions. The main advantage of the method is the considerable reduction in the overall computational requirements for the evaluation of optimal guidance and control laws. The significance of the results is that it can be used for real time, onboard simulation. A brief survey is also presented of digital flight systems.

The impact of parasitoid emergence time on host-parasitoid population dynamics.

PubMed

Cobbold, Christina A; Roland, Jens; Lewis, Mark A

2009-01-01

We investigate the effect of parasitoid phenology on host-parasitoid population cycles. Recent experimental research has shown that parasitized hosts can continue to interact with their unparasitized counterparts through competition. Parasitoid phenology, in particular the timing of emergence from the host, determines the duration of this competition. We construct a discrete-time host-parasitoid model in which within-generation dynamics associated with parasitoid timing is explicitly incorporated. We found that late-emerging parasitoids induce less severe, but more frequent, host outbreaks, independent of the choice of competition model. The competition experienced by the parasitized host reduces the parasitoids' numerical response to changes in host numbers, preventing the 'boom-bust' dynamics associated with more efficient parasitoids. We tested our findings against experimental data for the forest tent caterpillar (Malacosoma disstria Hübner) system, where a large number of consecutive years at a high host density is synonymous with severe forest damage.

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

PubMed

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

2017-09-21

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

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.

Donders revisited: Discrete or continuous temporal processing underlying reaction time distributions?

PubMed

Bao, Yan; Yang, Taoxi; Lin, Xiaoxiong; Pöppel, Ernst

2016-09-01

Differences of reaction times to specific stimulus configurations are used as indicators of cognitive processing stages. In this classical experimental paradigm, continuous temporal processing is implicitly assumed. Multimodal response distributions indicate, however, discrete time sampling, which is often masked by experimental conditions. Differences in reaction times reflect discrete temporal mechanisms that are pre-semantically implemented and suggested to be based on entrained neural oscillations. © 2016 The Institute of Psychology, Chinese Academy of Sciences and John Wiley & Sons Australia, Ltd.

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.

Discrete Time Crystals: Rigidity, Criticality, and Realizations.

PubMed

Yao, N Y; Potter, A C; Potirniche, I-D; Vishwanath, A

2017-01-20

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 is quantized to an integer multiple of the drive period, arising from a combination of collective synchronization and many body localization. Here, we consider a simple model for a one-dimensional discrete time crystal which explicitly reveals the rigidity of the emergent oscillations as the drive is varied. We numerically map out its phase diagram and compute the properties of the dynamical phase transition where the time crystal melts into a trivial Floquet insulator. Moreover, we demonstrate that the model can be realized with current experimental technologies and propose a blueprint based upon a one dimensional chain of trapped ions. Using experimental parameters (featuring long-range interactions), we identify the phase boundaries of the ion-time-crystal and propose a measurable signature of the symmetry breaking phase transition.

Predicting grain yield using canopy hyperspectral reflectance in wheat breeding data.

PubMed

Montesinos-López, Osval A; Montesinos-López, Abelardo; Crossa, José; de Los Campos, Gustavo; Alvarado, Gregorio; Suchismita, Mondal; Rutkoski, Jessica; González-Pérez, Lorena; Burgueño, Juan

2017-01-01

Modern agriculture uses hyperspectral cameras to obtain hundreds of reflectance data measured at discrete narrow bands to cover the whole visible light spectrum and part of the infrared and ultraviolet light spectra, depending on the camera. This information is used to construct vegetation indices (VI) (e.g., green normalized difference vegetation index or GNDVI, simple ratio or SRa, etc.) which are used for the prediction of primary traits (e.g., biomass). However, these indices only use some bands and are cultivar-specific; therefore they lose considerable information and are not robust for all cultivars. This study proposes models that use all available bands as predictors to increase prediction accuracy; we compared these approaches with eight conventional vegetation indexes (VIs) constructed using only some bands. The data set we used comes from CIMMYT's global wheat program and comprises 1170 genotypes evaluated for grain yield (ton/ha) in five environments (Drought, Irrigated, EarlyHeat, Melgas and Reduced Irrigated); the reflectance data were measured in 250 discrete narrow bands ranging between 392 and 851 nm. The proposed models for the simultaneous analysis of all the bands were ordinal least square (OLS), Bayes B, principal components with Bayes B, functional B-spline, functional Fourier and functional partial least square. The results of these models were compared with the OLS performed using as predictors each of the eight VIs individually and combined. We found that using all bands simultaneously increased prediction accuracy more than using VI alone. The Splines and Fourier models had the best prediction accuracy for each of the nine time-points under study. Combining image data collected at different time-points led to a small increase in prediction accuracy relative to models that use data from a single time-point. Also, using bands with heritabilities larger than 0.5 only in Drought as predictor variables showed improvements in prediction accuracy.

Can a quantum state over time resemble a quantum state at a single time?

NASA Astrophysics Data System (ADS)

Horsman, Dominic; Heunen, Chris; Pusey, Matthew F.; Barrett, Jonathan; Spekkens, Robert W.

2017-09-01

The standard formalism of quantum theory treats space and time in fundamentally different ways. In particular, a composite system at a given time is represented by a joint state, but the formalism does not prescribe a joint state for a composite of systems at different times. If there were a way of defining such a joint state, this would potentially permit a more even-handed treatment of space and time, and would strengthen the existing analogy between quantum states and classical probability distributions. Under the assumption that the joint state over time is an operator on the tensor product of single-time Hilbert spaces, we analyse various proposals for such a joint state, including one due to Leifer and Spekkens, one due to Fitzsimons, Jones and Vedral, and another based on discrete Wigner functions. Finding various problems with each, we identify five criteria for a quantum joint state over time to satisfy if it is to play a role similar to the standard joint state for a composite system: that it is a Hermitian operator on the tensor product of the single-time Hilbert spaces; that it represents probabilistic mixing appropriately; that it has the appropriate classical limit; that it has the appropriate single-time marginals; that composing over multiple time steps is associative. We show that no construction satisfies all these requirements. If Hermiticity is dropped, then there is an essentially unique construction that satisfies the remaining four criteria.

Discrete Variational Approach for Modeling Laser-Plasma Interactions

NASA Astrophysics Data System (ADS)

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

2014-10-01

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

A meshless method using radial basis functions for numerical solution of the two-dimensional KdV-Burgers equation

NASA Astrophysics Data System (ADS)

Zabihi, F.; Saffarian, M.

2016-07-01

The aim of this article is to obtain the numerical solution of the two-dimensional KdV-Burgers equation. We construct the solution by using a different approach, that is based on using collocation points. The solution is based on using the thin plate splines radial basis function, which builds an approximated solution with discretizing the time and the space to small steps. We use a predictor-corrector scheme to avoid solving the nonlinear system. The results of numerical experiments are compared with analytical solutions to confirm the accuracy and efficiency of the presented scheme.

Sliding mode stabilisation of networked systems with consecutive data packet dropouts using only accessible information

NASA Astrophysics Data System (ADS)

Argha, Ahmadreza; Li, Li; W. Su, Steven

2017-04-01

This paper develops a novel stabilising sliding mode for systems involving uncertainties as well as measurement data packet dropouts. In contrast to the existing literature that designs the switching function by using unavailable system states, a novel linear sliding function is constructed by employing only the available communicated system states for the systems involving measurement packet losses. This also equips us with the possibility to build a novel switching component for discrete-time sliding mode control (DSMC) by using only available system states. Finally, using a numerical example, we evaluate the performance of the designed DSMC for networked systems.

Analysis of Preconditioning and Relaxation Operators for the Discontinuous Galerkin Method Applied to Diffusion

NASA Technical Reports Server (NTRS)

Atkins, H. L.; Shu, Chi-Wang

2001-01-01

The explicit stability constraint of the discontinuous Galerkin method applied to the diffusion operator decreases dramatically as the order of the method is increased. Block Jacobi and block Gauss-Seidel preconditioner operators are examined for their effectiveness at accelerating convergence. A Fourier analysis for methods of order 2 through 6 reveals that both preconditioner operators bound the eigenvalues of the discrete spatial operator. Additionally, in one dimension, the eigenvalues are grouped into two or three regions that are invariant with order of the method. Local relaxation methods are constructed that rapidly damp high frequencies for arbitrarily large time step.

Approximation of discrete-time LQG compensators for distributed systems with boundary input and unbounded measurement

NASA Technical Reports Server (NTRS)

Gibson, J. S.; Rosen, I. G.

1987-01-01

The approximation of optimal discrete-time linear quadratic Gaussian (LQG) compensators for distributed parameter control systems with boundary input and unbounded measurement is considered. The approach applies to a wide range of problems that can be formulated in a state space on which both the discrete-time input and output operators are continuous. Approximating compensators are obtained via application of the LQG theory and associated approximation results for infinite dimensional discrete-time control systems with bounded input and output. Numerical results for spline and modal based approximation schemes used to compute optimal compensators for a one dimensional heat equation with either Neumann or Dirichlet boundary control and pointwise measurement of temperature are presented and discussed.

Discrete rational and breather solution in the spatial discrete complex modified Korteweg-de Vries equation and continuous counterparts.

PubMed

Zhao, Hai-Qiong; Yu, Guo-Fu

2017-04-01

In this paper, a spatial discrete complex modified Korteweg-de Vries equation is investigated. The Lax pair, conservation laws, Darboux transformations, and breather and rational wave solutions to the semi-discrete system are presented. The distinguished feature of the model is that the discrete rational solution can possess new W-shape rational periodic-solitary waves that were not reported before. In addition, the first-order rogue waves reach peak amplitudes which are at least three times of the background amplitude, whereas their continuous counterparts are exactly three times the constant background. Finally, the integrability of the discrete system, including Lax pair, conservation laws, Darboux transformations, and explicit solutions, yields the counterparts of the continuous system in the continuum limit.

Multi-symplectic integrators: numerical schemes for Hamiltonian PDEs that conserve symplecticity

NASA Astrophysics Data System (ADS)

Bridges, Thomas J.; Reich, Sebastian

2001-06-01

The symplectic numerical integration of finite-dimensional Hamiltonian systems is a well established subject and has led to a deeper understanding of existing methods as well as to the development of new very efficient and accurate schemes, e.g., for rigid body, constrained, and molecular dynamics. The numerical integration of infinite-dimensional Hamiltonian systems or Hamiltonian PDEs is much less explored. In this Letter, we suggest a new theoretical framework for generalizing symplectic numerical integrators for ODEs to Hamiltonian PDEs in R2: time plus one space dimension. The central idea is that symplecticity for Hamiltonian PDEs is directional: the symplectic structure of the PDE is decomposed into distinct components representing space and time independently. In this setting PDE integrators can be constructed by concatenating uni-directional ODE symplectic integrators. This suggests a natural definition of multi-symplectic integrator as a discretization that conserves a discrete version of the conservation of symplecticity for Hamiltonian PDEs. We show that this approach leads to a general framework for geometric numerical schemes for Hamiltonian PDEs, which have remarkable energy and momentum conservation properties. Generalizations, including development of higher-order methods, application to the Euler equations in fluid mechanics, application to perturbed systems, and extension to more than one space dimension are also discussed.

Adaptive Control via Neural Output Feedback for a Class of Nonlinear Discrete-Time Systems in a Nested Interconnected Form.

PubMed

Li, Dong-Juan; Li, Da-Peng

2017-09-14

In this paper, an adaptive output feedback control is framed for uncertain nonlinear discrete-time systems. The considered systems are a class of multi-input multioutput nonaffine nonlinear systems, and they are in the nested lower triangular form. Furthermore, the unknown dead-zone inputs are nonlinearly embedded into the systems. These properties of the systems will make it very difficult and challenging to construct a stable controller. By introducing a new diffeomorphism coordinate transformation, the controlled system is first transformed into a state-output model. By introducing a group of new variables, an input-output model is finally obtained. Based on the transformed model, the implicit function theorem is used to determine the existence of the ideal controllers and the approximators are employed to approximate the ideal controllers. By using the mean value theorem, the nonaffine functions of systems can become an affine structure but nonaffine terms still exist. The adaptation auxiliary terms are skillfully designed to cancel the effect of the dead-zone input. Based on the Lyapunov difference theorem, the boundedness of all the signals in the closed-loop system can be ensured and the tracking errors are kept in a bounded compact set. The effectiveness of the proposed technique is checked by a simulation study.

Curvature and tangential deflection of discrete arcs: a theory based on the commutator of scatter matrix pairs and its application to vertex detection in planar shape data.

PubMed

Anderson, I M; Bezdek, J C

1984-01-01

This paper introduces a new theory for the tangential deflection and curvature of plane discrete curves. Our theory applies to discrete data in either rectangular boundary coordinate or chain coded formats: its rationale is drawn from the statistical and geometric properties associated with the eigenvalue-eigenvector structure of sample covariance matrices. Specifically, we prove that the nonzero entry of the commutator of a piar of scatter matrices constructed from discrete arcs is related to the angle between their eigenspaces. And further, we show that this entry is-in certain limiting cases-also proportional to the analytical curvature of the plane curve from which the discrete data are drawn. These results lend a sound theoretical basis to the notions of discrete curvature and tangential deflection; and moreover, they provide a means for computationally efficient implementation of algorithms which use these ideas in various image processing contexts. As a concrete example, we develop the commutator vertex detection (CVD) algorithm, which identifies the location of vertices in shape data based on excessive cummulative tangential deflection; and we compare its performance to several well established corner detectors that utilize the alternative strategy of finding (approximate) curvature extrema.

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.

Einstein-Yang-Mills-Dirac systems from the discretized Kaluza-Klein theory

NASA Astrophysics Data System (ADS)

Wali, Kameshwar; Viet, Nguyen Ali

2017-01-01

A unified theory of the non-Abelian gauge interactions with gravity in the framework of a discretized Kaluza-Klein theory is constructed with a modified Dirac operator and wedge product. All the couplings of chiral spinors to the non-Abelian gauge fields emerge naturally as components of the coupling of the chiral spinors in the generalized gravity together with some new interactions. In particular, the currently prevailing gravity-QCD quark and gravity-electroweak-quark and lepton models are shown to follow as special cases of the general framework.

High order discretization techniques for real-space ab initio simulations

NASA Astrophysics Data System (ADS)

Anderson, Christopher R.

2018-03-01

In this paper, we present discretization techniques to address numerical problems that arise when constructing ab initio approximations that use real-space computational grids. We present techniques to accommodate the singular nature of idealized nuclear and idealized electronic potentials, and we demonstrate the utility of using high order accurate grid based approximations to Poisson's equation in unbounded domains. To demonstrate the accuracy of these techniques, we present results for a Full Configuration Interaction computation of the dissociation of H2 using a computed, configuration dependent, orbital basis set.

A coherent discrete variable representation method on a sphere

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

Yu, Hua -Gen

Here, the coherent discrete variable representation (ZDVR) has been extended for construct- ing a multidimensional potential-optimized DVR basis on a sphere. In order to deal with the non-constant Jacobian in spherical angles, two direct product primitive basis methods are proposed so that the original ZDVR technique can be properly implemented. The method has been demonstrated by computing the lowest states of a two dimensional (2D) vibrational model. Results show that the extended ZDVR method gives accurate eigenval- ues and exponential convergence with increasing ZDVR basis size.

A coherent discrete variable representation method on a sphere

DOE PAGES

Yu, Hua -Gen

2017-09-05

Here, the coherent discrete variable representation (ZDVR) has been extended for construct- ing a multidimensional potential-optimized DVR basis on a sphere. In order to deal with the non-constant Jacobian in spherical angles, two direct product primitive basis methods are proposed so that the original ZDVR technique can be properly implemented. The method has been demonstrated by computing the lowest states of a two dimensional (2D) vibrational model. Results show that the extended ZDVR method gives accurate eigenval- ues and exponential convergence with increasing ZDVR basis size.

On the existence of mosaic-skeleton approximations for discrete analogues of integral operators

NASA Astrophysics Data System (ADS)

Kashirin, A. A.; Taltykina, M. Yu.

2017-09-01

Exterior three-dimensional Dirichlet problems for the Laplace and Helmholtz equations are considered. By applying methods of potential theory, they are reduced to equivalent Fredholm boundary integral equations of the first kind, for which discrete analogues, i.e., systems of linear algebraic equations (SLAEs) are constructed. The existence of mosaic-skeleton approximations for the matrices of the indicated systems is proved. These approximations make it possible to reduce the computational complexity of an iterative solution of the SLAEs. Numerical experiments estimating the capabilities of the proposed approach are described.

Discrete-time stability of continuous-time controller designs for large space structures

NASA Technical Reports Server (NTRS)

Balas, M. J.

1982-01-01

In most of the stable control designs for flexible structures, continuous time is assumed. However, in view of the implementation of the controllers by on-line digital computers, the discrete-time stability of such controllers is an important consideration. In the case of direct-velocity feedback (DVFB), involving negative feedback from collocated force actuators and velocity sensors, it is not immediately apparent how much delay due to digital implementation of DVFB can be tolerated without loss of stability. The present investigation is concerned with such questions. A study is conducted of the discrete-time stability of DVFB, taking into account an employment of Euler's method of approximation of the time derivative. The obtained result gives an indication of the acceptable time-step size for stable digital implementation of DVFB. A result derived in connection with the consideration of the discrete-time stability of stable continuous-time systems provides a general condition under which digital implementation of such a system will remain stable.

A robust nonparametric framework for reconstruction of stochastic differential equation models

NASA Astrophysics Data System (ADS)

Rajabzadeh, Yalda; Rezaie, Amir Hossein; Amindavar, Hamidreza

2016-05-01

In this paper, we employ a nonparametric framework to robustly estimate the functional forms of drift and diffusion terms from discrete stationary time series. The proposed method significantly improves the accuracy of the parameter estimation. In this framework, drift and diffusion coefficients are modeled through orthogonal Legendre polynomials. We employ the least squares regression approach along with the Euler-Maruyama approximation method to learn coefficients of stochastic model. Next, a numerical discrete construction of mean squared prediction error (MSPE) is established to calculate the order of Legendre polynomials in drift and diffusion terms. We show numerically that the new method is robust against the variation in sample size and sampling rate. The performance of our method in comparison with the kernel-based regression (KBR) method is demonstrated through simulation and real data. In case of real dataset, we test our method for discriminating healthy electroencephalogram (EEG) signals from epilepsy ones. We also demonstrate the efficiency of the method through prediction in the financial data. In both simulation and real data, our algorithm outperforms the KBR method.

A Discrete Event Simulation Model for Evaluating the Performances of an M/G/C/C State Dependent Queuing System

PubMed Central

Khalid, Ruzelan; M. Nawawi, Mohd Kamal; Kawsar, Luthful A.; Ghani, Noraida A.; Kamil, Anton A.; Mustafa, Adli

2013-01-01

M/G/C/C state dependent queuing networks consider service rates as a function of the number of residing entities (e.g., pedestrians, vehicles, and products). However, modeling such dynamic rates is not supported in modern Discrete Simulation System (DES) software. We designed an approach to cater this limitation and used it to construct the M/G/C/C state-dependent queuing model in Arena software. Using the model, we have evaluated and analyzed the impacts of various arrival rates to the throughput, the blocking probability, the expected service time and the expected number of entities in a complex network topology. Results indicated that there is a range of arrival rates for each network where the simulation results fluctuate drastically across replications and this causes the simulation results and analytical results exhibit discrepancies. Detail results that show how tally the simulation results and the analytical results in both abstract and graphical forms and some scientific justifications for these have been documented and discussed. PMID:23560037

Delineation and management of sulfidic materials in Virginia highway corridors.

DOT National Transportation Integrated Search

2002-01-01

Excavation through sulfidic geologic materials during road construction has resulted in acid drainage related problems at numerous discrete locations across Virginia. Barren acidic roadbanks, and acidic runoff and fill seepage clearly cause local env...

Method and system for progressive mesh storage and reconstruction using wavelet-encoded height fields

NASA Technical Reports Server (NTRS)

Baxes, Gregory A. (Inventor); Linger, Timothy C. (Inventor)

2011-01-01

Systems and methods are provided for progressive mesh storage and reconstruction using wavelet-encoded height fields. A method for progressive mesh storage includes reading raster height field data, and processing the raster height field data with a discrete wavelet transform to generate wavelet-encoded height fields. In another embodiment, a method for progressive mesh storage includes reading texture map data, and processing the texture map data with a discrete wavelet transform to generate wavelet-encoded texture map fields. A method for reconstructing a progressive mesh from wavelet-encoded height field data includes determining terrain blocks, and a level of detail required for each terrain block, based upon a viewpoint. Triangle strip constructs are generated from vertices of the terrain blocks, and an image is rendered utilizing the triangle strip constructs. Software products that implement these methods are provided.

Method and system for progressive mesh storage and reconstruction using wavelet-encoded height fields

NASA Technical Reports Server (NTRS)

Baxes, Gregory A. (Inventor)

2010-01-01

Systems and methods are provided for progressive mesh storage and reconstruction using wavelet-encoded height fields. A method for progressive mesh storage includes reading raster height field data, and processing the raster height field data with a discrete wavelet transform to generate wavelet-encoded height fields. In another embodiment, a method for progressive mesh storage includes reading texture map data, and processing the texture map data with a discrete wavelet transform to generate wavelet-encoded texture map fields. A method for reconstructing a progressive mesh from wavelet-encoded height field data includes determining terrain blocks, and a level of detail required for each terrain block, based upon a viewpoint. Triangle strip constructs are generated from vertices of the terrain blocks, and an image is rendered utilizing the triangle strip constructs. Software products that implement these methods are provided.

Using Blocked Fractional Factorial Designs to Construct Discrete Choice Experiments for Health Care Studies

PubMed Central

Jaynes, Jessica; Wong, Weng Kee; Xu, Hongquan

2016-01-01

Discrete choice experiments (DCEs) are increasingly used for studying and quantifying subjects preferences in a wide variety of health care applications. They provide a rich source of data to assess real-life decision making processes, which involve trade-offs between desirable characteristics pertaining to health and health care, and identification of key attributes affecting health care. The choice of the design for a DCE is critical because it determines which attributes’ effects and their interactions are identifiable. We apply blocked fractional factorial designs to construct DCEs and address some identification issues by utilizing the known structure of blocked fractional factorial designs. Our design techniques can be applied to several situations including DCEs where attributes have different number of levels. We demonstrate our design methodology using two health care studies to evaluate (1) asthma patients’ preferences for symptom-based outcome measures, and (2) patient preference for breast screening services. PMID:26823156

Development of Mission Adaptive Digital Composite Aerostructure Technologies (MADCAT)

NASA Technical Reports Server (NTRS)

Cheung, Kenneth; Cellucci, Daniel; Copplestone, Grace; Cramer, Nick; Fusco, Jesse; Jenett, Benjamin; Kim, Joseph; Mazhari, Alex; Trinh, Greenfield; Swei, Sean

2017-01-01

This paper reviews the development of the Mission Adaptive Digital Composite Aerostructures Technologies (MADCAT) v0 demonstrator aircraft, utilizing a novel aerostructure concept that combines advanced composite materials manufacturing and fabrication technologies with a discrete construction approach to achieve high stiffness-to-density ratio ultra-light aerostructures that provide versatility and adaptability. This revolutionary aerostructure concept has the potential to change how future air vehicles are designed, built, and flown, with dramatic reductions in weight and manufacturing complexity the number of types of structural components needed to build air vehicles while enabling new mission objectives. We utilize the innovative digital composite materials and discrete construction technologies to demonstrate the feasibility of the proposed aerostructure concept, by building and testing a scaled prototype UAV, MADCAT v0. This paper presents an overview of the design and development of the MADCAT v0 flight demonstrator.

Discrete stochastic analogs of Erlang epidemic models.

PubMed

Getz, Wayne M; Dougherty, Eric R

2018-12-01

Erlang differential equation models of epidemic processes provide more realistic disease-class transition dynamics from susceptible (S) to exposed (E) to infectious (I) and removed (R) categories than the ubiquitous SEIR model. The latter is itself is at one end of the spectrum of Erlang SE[Formula: see text]I[Formula: see text]R models with [Formula: see text] concatenated E compartments and [Formula: see text] concatenated I compartments. Discrete-time models, however, are computationally much simpler to simulate and fit to epidemic outbreak data than continuous-time differential equations, and are also much more readily extended to include demographic and other types of stochasticity. Here we formulate discrete-time deterministic analogs of the Erlang models, and their stochastic extension, based on a time-to-go distributional principle. Depending on which distributions are used (e.g. discretized Erlang, Gamma, Beta, or Uniform distributions), we demonstrate that our formulation represents both a discretization of Erlang epidemic models and generalizations thereof. We consider the challenges of fitting SE[Formula: see text]I[Formula: see text]R models and our discrete-time analog to data (the recent outbreak of Ebola in Liberia). We demonstrate that the latter performs much better than the former; although confining fits to strict SEIR formulations reduces the numerical challenges, but sacrifices best-fit likelihood scores by at least 7%.

Discrete size optimization of steel trusses using a refined big bang-big crunch algorithm

NASA Astrophysics Data System (ADS)

Hasançebi, O.; Kazemzadeh Azad, S.

2014-01-01

This article presents a methodology that provides a method for design optimization of steel truss structures based on a refined big bang-big crunch (BB-BC) algorithm. It is shown that a standard formulation of the BB-BC algorithm occasionally falls short of producing acceptable solutions to problems from discrete size optimum design of steel trusses. A reformulation of the algorithm is proposed and implemented for design optimization of various discrete truss structures according to American Institute of Steel Construction Allowable Stress Design (AISC-ASD) specifications. Furthermore, the performance of the proposed BB-BC algorithm is compared to its standard version as well as other well-known metaheuristic techniques. The numerical results confirm the efficiency of the proposed algorithm in practical design optimization of truss structures.

Quantum models with energy-dependent potentials solvable in terms of exceptional orthogonal polynomials

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

Schulze-Halberg, Axel, E-mail: axgeschu@iun.edu; Department of Physics, Indiana University Northwest, 3400 Broadway, Gary IN 46408; Roy, Pinaki, E-mail: pinaki@isical.ac.in

We construct energy-dependent potentials for which the Schrödinger equations admit solutions in terms of exceptional orthogonal polynomials. Our method of construction is based on certain point transformations, applied to the equations of exceptional Hermite, Jacobi and Laguerre polynomials. We present several examples of boundary-value problems with energy-dependent potentials that admit a discrete spectrum and the corresponding normalizable solutions in closed form.

Fast orthogonal transforms and generation of Brownian paths

PubMed Central

Leobacher, Gunther

2012-01-01

We present a number of fast constructions of discrete Brownian paths that can be used as alternatives to principal component analysis and Brownian bridge for stratified Monte Carlo and quasi-Monte Carlo. By fast we mean that a path of length n can be generated in O(nlog(n)) floating point operations. We highlight some of the connections between the different constructions and we provide some numerical examples. PMID:23471545

Control of discrete time systems based on recurrent Super-Twisting-like algorithm.

PubMed

Salgado, I; Kamal, S; Bandyopadhyay, B; Chairez, I; Fridman, L

2016-09-01

Most of the research in sliding mode theory has been carried out to in continuous time to solve the estimation and control problems. However, in discrete time, the results in high order sliding modes have been less developed. In this paper, a discrete time super-twisting-like algorithm (DSTA) was proposed to solve the problems of control and state estimation. The stability proof was developed in terms of the discrete time Lyapunov approach and the linear matrix inequalities theory. The system trajectories were ultimately bounded inside a small region dependent on the sampling period. Simulation results tested the DSTA. The DSTA was applied as a controller for a Furuta pendulum and for a DC motor supplied by a DSTA signal differentiator. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

Generalized Detectability for Discrete Event Systems

PubMed Central

Shu, Shaolong; Lin, Feng

2011-01-01

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

A High Order Finite Difference Scheme with Sharp Shock Resolution for the Euler Equations

NASA Technical Reports Server (NTRS)

Gerritsen, Margot; Olsson, Pelle

1996-01-01

We derive a high-order finite difference scheme for the Euler equations that satisfies a semi-discrete energy estimate, and present an efficient strategy for the treatment of discontinuities that leads to sharp shock resolution. The formulation of the semi-discrete energy estimate is based on a symmetrization of the Euler equations that preserves the homogeneity of the flux vector, a canonical splitting of the flux derivative vector, and the use of difference operators that satisfy a discrete analogue to the integration by parts procedure used in the continuous energy estimate. Around discontinuities or sharp gradients, refined grids are created on which the discrete equations are solved after adding a newly constructed artificial viscosity. The positioning of the sub-grids and computation of the viscosity are aided by a detection algorithm which is based on a multi-scale wavelet analysis of the pressure grid function. The wavelet theory provides easy to implement mathematical criteria to detect discontinuities, sharp gradients and spurious oscillations quickly and efficiently.

A multigrid solver for the semiconductor equations

NASA Technical Reports Server (NTRS)

Bachmann, Bernhard

1993-01-01

We present a multigrid solver for the exponential fitting method. The solver is applied to the current continuity equations of semiconductor device simulation in two dimensions. The exponential fitting method is based on a mixed finite element discretization using the lowest-order Raviart-Thomas triangular element. This discretization method yields a good approximation of front layers and guarantees current conservation. The corresponding stiffness matrix is an M-matrix. 'Standard' multigrid solvers, however, cannot be applied to the resulting system, as this is dominated by an unsymmetric part, which is due to the presence of strong convection in part of the domain. To overcome this difficulty, we explore the connection between Raviart-Thomas mixed methods and the nonconforming Crouzeix-Raviart finite element discretization. In this way we can construct nonstandard prolongation and restriction operators using easily computable weighted L(exp 2)-projections based on suitable quadrature rules and the upwind effects of the discretization. The resulting multigrid algorithm shows very good results, even for real-world problems and for locally refined grids.

Static current-sheet models of quiescent prominences

NASA Technical Reports Server (NTRS)

Wu, F.; Low, B. C.

1986-01-01

A particular class of theoretical models idealize the prominence to be a discrete flat electric-current sheet suspended vertically in a potential magnetic field. The weight of the prominence is supported by the Lorentz force in the current sheet. These models can be extended to have curved electric-current sheets and to vary three-dimensionally. The equation for force balance is 1 over 4 pi (del times B) times Bdel p- p9 z=zero. Using Cartesian coordinates we take, for simplicity, a uniform gravity with constant acceleration g in the direction -z. If we are interested not in the detailed internal structure of the prominence, but in the global magnetic configuration around the prominence, we may take prominence plasma to be cold. Consideration is given to how such equilibrium states can be constructed. To simplify the mathematical problem, suppose there is no electric current in the atmosphere except for the discrete currents in the cold prominence sheet. Let us take the plane z =0 to be the base of the atmosphere and restrict our attention to the domain z greater than 0. The task we have is to solve for a magnetic field which is everywhere potential except on some free surface S, subject to suit able to boundary conditions. The surface S is determined by requiring that it possesses a discrete electric current density such that the Lorentz force on it is everywhere vertically upward to balance the weight of the material m(S). Since the magnetic field is potential in the external atmosphere, the latter is decoupled from the magnetic field and its plane parallel hydrostatic pressure and density can be prescribed.

Static current-sheet models of quiescent prominences

NASA Astrophysics Data System (ADS)

Wu, F.; Low, B. C.

1986-12-01

A particular class of theoretical models idealize the prominence to be a discrete flat electric-current sheet suspended vertically in a potential magnetic field. The weight of the prominence is supported by the Lorentz force in the current sheet. These models can be extended to have curved electric-current sheets and to vary three-dimensionally. The equation for force balance is 1 over 4 pi (del times B) times Bdel p- p9 z=zero. Using Cartesian coordinates we take, for simplicity, a uniform gravity with constant acceleration g in the direction -z. If we are interested not in the detailed internal structure of the prominence, but in the global magnetic configuration around the prominence, we may take prominence plasma to be cold. Consideration is given to how such equilibrium states can be constructed. To simplify the mathematical problem, suppose there is no electric current in the atmosphere except for the discrete currents in the cold prominence sheet. Let us take the plane z =0 to be the base of the atmosphere and restrict our attention to the domain z greater than 0. The task we have is to solve for a magnetic field which is everywhere potential except on some free surface S, subject to suit able to boundary conditions. The surface S is determined by requiring that it possesses a discrete electric current density such that the Lorentz force on it is everywhere vertically upward to balance the weight of the material m(S). Since the magnetic field is potential in the external atmosphere, the latter is decoupled from the magnetic field and its plane parallel hydrostatic pressure and density can be prescribed.

A prefiltering version of the Kalman filter with new numerical integration formulas for Riccati equations

NASA Technical Reports Server (NTRS)

Womble, M. E.; Potter, J. E.

1975-01-01

A prefiltering version of the Kalman filter is derived for both discrete and continuous measurements. The derivation consists of determining a single discrete measurement that is equivalent to either a time segment of continuous measurements or a set of discrete measurements. This prefiltering version of the Kalman filter easily handles numerical problems associated with rapid transients and ill-conditioned Riccati matrices. Therefore, the derived technique for extrapolating the Riccati matrix from one time to the next constitutes a new set of integration formulas which alleviate ill-conditioning problems associated with continuous Riccati equations. Furthermore, since a time segment of continuous measurements is converted into a single discrete measurement, Potter's square root formulas can be used to update the state estimate and its error covariance matrix. Therefore, if having the state estimate and its error covariance matrix at discrete times is acceptable, the prefilter extends square root filtering with all its advantages, to continuous measurement problems.

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

NASA Astrophysics Data System (ADS)

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

2009-01-01

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

The Wronskian solution of the constrained discrete Kadomtsev-Petviashvili hierarchy

NASA Astrophysics Data System (ADS)

Li, Maohua; He, Jingsong

2016-05-01

From the constrained discrete Kadomtsev-Petviashvili (cdKP) hierarchy, the discrete nonlinear Schrödinger (DNLS) equations have been derived. By means of the gauge transformation, the Wronskian solution of DNLS equations have been given. The u1 of the cdKP hierarchy is a Y-type soliton solution for odd times of the gauge transformation, but it becomes a dark-bright soliton solution for even times of the gauge transformation. The role of the discrete variable n in the profile of the u1 is discussed.

Discrete Space-Time: History and Recent Developments

NASA Astrophysics Data System (ADS)

Crouse, David

2017-01-01

Discussed in this work is the long history and debate of whether space and time are discrete or continuous. Starting from Zeno of Elea and progressing to Heisenberg and others, the issues with discrete space are discussed, including: Lorentz contraction (time dilation) of the ostensibly smallest spatial (temporal) interval, maintaining isotropy, violations of causality, and conservation of energy and momentum. It is shown that there are solutions to all these issues, such that discrete space is a viable model, yet the solution require strict non-absolute space (i.e., Mach's principle) and a re-analysis of the concept of measurement and the foundations of special relativity. In developing these solutions, the long forgotten but important debate between Albert Einstein and Henri Bergson concerning time will be discussed. Also discussed is the resolution to the Weyl tile argument against discrete space; however, the solution involves a modified version of the typical distance formula. One example effect of discrete space is then discussed, namely how it necessarily imposes order upon Wheeler's quantum foam, changing the foam into a gravity crystal and yielding crystalline properties of bandgaps, Brilluoin zones and negative inertial mass for astronomical bodies.

Time-domain damping models in structural acoustics using digital filtering

NASA Astrophysics Data System (ADS)

Parret-Fréaud, Augustin; Cotté, Benjamin; Chaigne, Antoine

2016-02-01

This paper describes a new approach in order to formulate well-posed time-domain damping models able to represent various frequency domain profiles of damping properties. The novelty of this approach is to represent the behavior law of a given material directly in a discrete-time framework as a digital filter, which is synthesized for each material from a discrete set of frequency-domain data such as complex modulus through an optimization process. A key point is the addition of specific constraints to this process in order to guarantee stability, causality and verification of thermodynamics second law when transposing the resulting discrete-time behavior law into the time domain. Thus, this method offers a framework which is particularly suitable for time-domain simulations in structural dynamics and acoustics for a wide range of materials (polymers, wood, foam, etc.), allowing to control and even reduce the distortion effects induced by time-discretization schemes on the frequency response of continuous-time behavior laws.

Space-Time Crystal and Space-Time Group

NASA Astrophysics Data System (ADS)

Xu, Shenglong; Wu, Congjun

2018-03-01

Crystal structures and the Bloch theorem play a fundamental role in condensed matter physics. We extend the static crystal to the dynamic "space-time" crystal characterized by the general intertwined space-time periodicities in D +1 dimensions, which include both the static crystal and the Floquet crystal as special cases. A new group structure dubbed a "space-time" group is constructed to describe the discrete symmetries of a space-time crystal. Compared to space and magnetic groups, the space-time group is augmented by "time-screw" rotations and "time-glide" reflections involving fractional translations along the time direction. A complete classification of the 13 space-time groups in one-plus-one dimensions (1 +1 D ) is performed. The Kramers-type degeneracy can arise from the glide time-reversal symmetry without the half-integer spinor structure, which constrains the winding number patterns of spectral dispersions. In 2 +1 D , nonsymmorphic space-time symmetries enforce spectral degeneracies, leading to protected Floquet semimetal states. We provide a general framework for further studying topological properties of the (D +1 )-dimensional space-time crystal.

Space-Time Crystal and Space-Time Group.

PubMed

Xu, Shenglong; Wu, Congjun

2018-03-02

Crystal structures and the Bloch theorem play a fundamental role in condensed matter physics. We extend the static crystal to the dynamic "space-time" crystal characterized by the general intertwined space-time periodicities in D+1 dimensions, which include both the static crystal and the Floquet crystal as special cases. A new group structure dubbed a "space-time" group is constructed to describe the discrete symmetries of a space-time crystal. Compared to space and magnetic groups, the space-time group is augmented by "time-screw" rotations and "time-glide" reflections involving fractional translations along the time direction. A complete classification of the 13 space-time groups in one-plus-one dimensions (1+1D) is performed. The Kramers-type degeneracy can arise from the glide time-reversal symmetry without the half-integer spinor structure, which constrains the winding number patterns of spectral dispersions. In 2+1D, nonsymmorphic space-time symmetries enforce spectral degeneracies, leading to protected Floquet semimetal states. We provide a general framework for further studying topological properties of the (D+1)-dimensional space-time crystal.

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.

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.

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

NASA Astrophysics Data System (ADS)

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

2018-02-01

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

When to be discrete: the importance of time formulation in understanding animal movement.

PubMed

McClintock, Brett T; Johnson, Devin S; Hooten, Mevin B; Ver Hoef, Jay M; Morales, Juan M

2014-01-01

Animal movement is essential to our understanding of population dynamics, animal behavior, and the impacts of global change. Coupled with high-resolution biotelemetry data, exciting new inferences about animal movement have been facilitated by various specifications of contemporary models. These approaches differ, but most share common themes. One key distinction is whether the underlying movement process is conceptualized in discrete or continuous time. This is perhaps the greatest source of confusion among practitioners, both in terms of implementation and biological interpretation. In general, animal movement occurs in continuous time but we observe it at fixed discrete-time intervals. Thus, continuous time is conceptually and theoretically appealing, but in practice it is perhaps more intuitive to interpret movement in discrete intervals. With an emphasis on state-space models, we explore the differences and similarities between continuous and discrete versions of mechanistic movement models, establish some common terminology, and indicate under which circumstances one form might be preferred over another. Counter to the overly simplistic view that discrete- and continuous-time conceptualizations are merely different means to the same end, we present novel mathematical results revealing hitherto unappreciated consequences of model formulation on inferences about animal movement. Notably, the speed and direction of movement are intrinsically linked in current continuous-time random walk formulations, and this can have important implications when interpreting animal behavior. We illustrate these concepts in the context of state-space models with multiple movement behavior states using northern fur seal (Callorhinus ursinus) biotelemetry data.

When to be discrete: The importance of time formulation in understanding animal movement

USGS Publications Warehouse

McClintock, Brett T.; Johnson, Devin S.; Hooten, Mevin B.; Ver Hoef, Jay M.; Morales, Juan M.

2014-01-01

Animal movement is essential to our understanding of population dynamics, animal behavior, and the impacts of global change. Coupled with high-resolution biotelemetry data, exciting new inferences about animal movement have been facilitated by various specifications of contemporary models. These approaches differ, but most share common themes. One key distinction is whether the underlying movement process is conceptualized in discrete or continuous time. This is perhaps the greatest source of confusion among practitioners, both in terms of implementation and biological interpretation. In general, animal movement occurs in continuous time but we observe it at fixed discrete-time intervals. Thus, continuous time is conceptually and theoretically appealing, but in practice it is perhaps more intuitive to interpret movement in discrete intervals. With an emphasis on state-space models, we explore the differences and similarities between continuous and discrete versions of mechanistic movement models, establish some common terminology, and indicate under which circumstances one form might be preferred over another. Counter to the overly simplistic view that discrete- and continuous-time conceptualizations are merely different means to the same end, we present novel mathematical results revealing hitherto unappreciated consequences of model formulation on inferences about animal movement. Notably, the speed and direction of movement are intrinsically linked in current continuous-time random walk formulations, and this can have important implications when interpreting animal behavior. We illustrate these concepts in the context of state-space models with multiple movement behavior states using northern fur seal (Callorhinus ursinus) biotelemetry data.

Discrete fractional solutions of a Legendre equation

NASA Astrophysics Data System (ADS)

Yılmazer, Resat

2018-01-01

One of the most popular research interests of science and engineering is the fractional calculus theory in recent times. Discrete fractional calculus has also an important position in fractional calculus. In this work, we acquire new discrete fractional solutions of the homogeneous and non homogeneous Legendre differential equation by using discrete fractional nabla operator.

Matter-wave solitons supported by quadrupole-quadrupole interactions and anisotropic discrete lattices

NASA Astrophysics Data System (ADS)

Zhong, Rong-Xuan; Huang, Nan; Li, Huang-Wu; He, He-Xiang; Lü, Jian-Tao; Huang, Chun-Qing; Chen, Zhao-Pin

2018-04-01

We numerically and analytically investigate the formations and features of two-dimensional discrete Bose-Einstein condensate solitons, which are constructed by quadrupole-quadrupole interactional particles trapped in the tunable anisotropic discrete optical lattices. The square optical lattices in the model can be formed by two pairs of interfering plane waves with different intensities. Two hopping rates of the particles in the orthogonal directions are different, which gives rise to a linear anisotropic system. We find that if all of the pairs of dipole and anti-dipole are perpendicular to the lattice panel and the line connecting the dipole and anti-dipole which compose the quadrupole is parallel to horizontal direction, both the linear anisotropy and the nonlocal nonlinear one can strongly influence the formations of the solitons. There exist three patterns of stable solitons, namely horizontal elongation quasi-one-dimensional discrete solitons, disk-shape isotropic pattern solitons and vertical elongation quasi-continuous solitons. We systematically demonstrate the relationships of chemical potential, size and shape of the soliton with its total norm and vertical hopping rate and analytically reveal the linear dispersion relation for quasi-one-dimensional discrete solitons.

The episodic random utility model unifies time trade-off and discrete choice approaches in health state valuation

PubMed Central

Craig, Benjamin M; Busschbach, Jan JV

2009-01-01

Background To present an episodic random utility model that unifies time trade-off and discrete choice approaches in health state valuation. Methods First, we introduce two alternative random utility models (RUMs) for health preferences: the episodic RUM and the more common instant RUM. For the interpretation of time trade-off (TTO) responses, we show that the episodic model implies a coefficient estimator, and the instant model implies a mean slope estimator. Secondly, we demonstrate these estimators and the differences between the estimates for 42 health states using TTO responses from the seminal Measurement and Valuation in Health (MVH) study conducted in the United Kingdom. Mean slopes are estimates with and without Dolan's transformation of worse-than-death (WTD) responses. Finally, we demonstrate an exploded probit estimator, an extension of the coefficient estimator for discrete choice data that accommodates both TTO and rank responses. Results By construction, mean slopes are less than or equal to coefficients, because slopes are fractions and, therefore, magnify downward errors in WTD responses. The Dolan transformation of WTD responses causes mean slopes to increase in similarity to coefficient estimates, yet they are not equivalent (i.e., absolute mean difference = 0.179). Unlike mean slopes, coefficient estimates demonstrate strong concordance with rank-based predictions (Lin's rho = 0.91). Combining TTO and rank responses under the exploded probit model improves the identification of health state values, decreasing the average width of confidence intervals from 0.057 to 0.041 compared to TTO only results. Conclusion The episodic RUM expands upon the theoretical framework underlying health state valuation and contributes to health econometrics by motivating the selection of coefficient and exploded probit estimators for the analysis of TTO and rank responses. In future MVH surveys, sample size requirements may be reduced through the incorporation of multiple responses under a single estimator. PMID:19144115

Simulation of Non-Abelian Braiding in Majorana Time Crystals

NASA Astrophysics Data System (ADS)

Bomantara, Raditya Weda; Gong, Jiangbin

2018-06-01

Discrete time crystals have attracted considerable theoretical and experimental studies but their potential applications have remained unexplored. A particular type of discrete time crystals, termed "Majorana time crystals," is found to emerge in a periodically driven superconducting wire accommodating two different species of topological edge modes. It is further shown that one can manipulate different Majorana edge modes separated in the time lattice, giving rise to an unforeseen scenario for topologically protected gate operations mimicking braiding. The proposed protocol can also generate a magic state that is important for universal quantum computation. This study thus advances the quantum control in discrete time crystals and reveals their great potential arising from their time-domain properties.

Retirement and death in office of U.S. Supreme Court justices.

PubMed

Stolzenberg, Ross M; Lindgren, James

2010-05-01

We construct demographic models of retirement and death in office of U.S. Supreme Court justices, a group that has gained demographic notice, evaded demographic analysis, and is said to diverge from expected retirement patterns. Models build on prior multistate labor force status studies, and data permit an unusually clear distinction between voluntary and "induced" retirement. Using data on every justice from 1789 through 2006, with robust, cluster-corrected, discrete-time, censored, event-history methods, we (1) estimate retirement effects of pension eligibility, age, health, and tenure on the timing of justices' retirements and deaths in office, (2) resolve decades of debate over the politicized departure hypothesis that justices tend to alter the timing of their retirements for the political benefit or detriment of the incumbent president, (3) reconsider the nature of rationality in retirement decisions, and (4) consider the relevance of organizational conditions as well as personal circumstances to retirement decisions. Methodological issues are addressed.

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.

Multilayer shallow water models with locally variable number of layers and semi-implicit time discretization

NASA Astrophysics Data System (ADS)

Bonaventura, Luca; Fernández-Nieto, Enrique D.; Garres-Díaz, José; Narbona-Reina, Gladys

2018-07-01

We propose an extension of the discretization approaches for multilayer shallow water models, aimed at making them more flexible and efficient for realistic applications to coastal flows. A novel discretization approach is proposed, in which the number of vertical layers and their distribution are allowed to change in different regions of the computational domain. Furthermore, semi-implicit schemes are employed for the time discretization, leading to a significant efficiency improvement for subcritical regimes. We show that, in the typical regimes in which the application of multilayer shallow water models is justified, the resulting discretization does not introduce any major spurious feature and allows again to reduce substantially the computational cost in areas with complex bathymetry. As an example of the potential of the proposed technique, an application to a sediment transport problem is presented, showing a remarkable improvement with respect to standard discretization approaches.

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.

Simultaneous optical flow and source estimation: Space–time discretization and preconditioning

PubMed Central

Andreev, R.; Scherzer, O.; Zulehner, W.

2015-01-01

We consider the simultaneous estimation of an optical flow field and an illumination source term in a movie sequence. The particular optical flow equation is obtained by assuming that the image intensity is a conserved quantity up to possible sources and sinks which represent varying illumination. We formulate this problem as an energy minimization problem and propose a space–time simultaneous discretization for the optimality system in saddle-point form. We investigate a preconditioning strategy that renders the discrete system well-conditioned uniformly in the discretization resolution. Numerical experiments complement the theory. PMID:26435561

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.

Improving Our Ability to Evaluate Underlying Mechanisms of Behavioral Onset and Other Event Occurrence Outcomes: A Discrete-Time Survival Mediation Model

PubMed Central

Fairchild, Amanda J.; Abara, Winston E.; Gottschall, Amanda C.; Tein, Jenn-Yun; Prinz, Ronald J.

2015-01-01

The purpose of this article is to introduce and describe a statistical model that researchers can use to evaluate underlying mechanisms of behavioral onset and other event occurrence outcomes. Specifically, the article develops a framework for estimating mediation effects with outcomes measured in discrete-time epochs by integrating the statistical mediation model with discrete-time survival analysis. The methodology has the potential to help strengthen health research by targeting prevention and intervention work more effectively as well as by improving our understanding of discretized periods of risk. The model is applied to an existing longitudinal data set to demonstrate its use, and programming code is provided to facilitate its implementation. PMID:24296470

The Selection of Computed Tomography Scanning Schemes for Lengthy Symmetric Objects

NASA Astrophysics Data System (ADS)

Trinh, V. B.; Zhong, Y.; Osipov, S. P.

2017-04-01

. The article describes the basic computed tomography scan schemes for lengthy symmetric objects: continuous (discrete) rotation with a discrete linear movement; continuous (discrete) rotation with discrete linear movement to acquire 2D projection; continuous (discrete) linear movement with discrete rotation to acquire one-dimensional projection and continuous (discrete) rotation to acquire of 2D projection. The general method to calculate the scanning time is discussed in detail. It should be extracted the comparison principle to select a scanning scheme. This is because data are the same for all scanning schemes: the maximum energy of the X-ray radiation; the power of X-ray radiation source; the angle of the X-ray cone beam; the transverse dimension of a single detector; specified resolution and the maximum time, which is need to form one point of the original image and complies the number of registered photons). It demonstrates the possibilities of the above proposed method to compare the scanning schemes. Scanning object was a cylindrical object with the mass thickness is 4 g/cm2, the effective atomic number is 15 and length is 1300 mm. It analyzes data of scanning time and concludes about the efficiency of scanning schemes. It examines the productivity of all schemes and selects the effective one.

Analysis of hydrocarbon-bearing fluid inclusions (HCFI) using time-resolved fluorescence spectroscopy

NASA Astrophysics Data System (ADS)

Przyjalgowski, Milosz A.; Ryder, Alan G.; Feely, Martin; Glynn, Thomas J.

2005-06-01

Hydrocarbon-bearing fluid inclusions (HCFI) are microscopic cavities within rocks that are filled with petroleum oil, the composition of which may not have changed since the trapping event. Thus, the composition of that entrapped oil can provide information about the formation and evolution of the oil reservoir. This type of information is important to the petroleum production and exploration industries. Crude oil fluorescence originates from the presence of cyclic aromatic compounds and the nature of the emission is governed by the chemical composition of the oil. Fluorescence based methods are widely used for analysis of crude oil because they offer robust, non-contact and non-destructive measurement options. The goal of our group is the development of a non-destructive analytical method for HCFI using time-resolved fluorescence methods. In broad terms, crude oil fluorescence behavior is governed by the concentration of quenching species and the distribution of fluorophores. For the intensity averaged fluorescence lifetime, the best correlations have been found between polar or alkane concentrations, but these are not suitable for robust, quantitative analysis. We have recently started to investigate another approach for characterizing oils by looking at Time-resolved Emission Spectra (TRES). TRES are constructed from intensities sampled at discrete times during the fluorescence decay of the sample. In this study, TRES, from a series of 10 crude oils from the Middle East, have been measured at discrete time gates (0.5 ns, 1 ns, 2 ns, 4 ns) over the 450-700 nm wavelength range. The spectral changes in TRES, such as time gate dependent Stokes' shift and spectral broadening, are analyzed in the context of energy transfer rates. In this work, the efficacy of using TRES for fingerprinting individual oils and HCFI is also demonstrated.

What Do Patients Want from Otolaryngologists? A Discrete Choice Experiment.

PubMed

Naunheim, Matthew R; Rathi, Vinay K; Naunheim, Margaret L; Alkire, Blake C; Lam, Allen C; Song, Phillip C; Shrime, Mark G

2017-10-01

Objectives Patient preferences are crucial for the delivery of patient-centered care. Discrete choice experiments (DCEs) are an emerging quantitative methodology used for understanding these preferences. In this study, we employed DCE techniques to understand the preferences of patients presenting for an ear, nose, and throat clinic visit. Study Design DCE. Setting Decision science laboratory. Methods A DCE survey of 5 attributes-wait time, physician experience, physician personality, utilization of visit time, and cost/copayment-was constructed with structured qualitative interviews with patients. The DCE was administered to participants from the general population, who chose among hypothetical scenarios that varied across these attributes. A conditional logit model was used to determine relative attribute importance, with a separate logit model for determining subject effects. Results A total of 161 participants were included. Cost/copayment had the greatest impact on decision making (importance, 32.2%), followed by wait time and physician experience (26.5% and 24.7%, respectively). Physician personality mattered least (4.7%), although all attributes were significantly correlated to decision making. Participants preferred doctors who spent more time performing physical examination than listening or explaining. Participants were willing to pay $52 extra to avoid a 4-week delay in appointment time; $87 extra for a physician with 10 years of experience (vs 0 years); and $9 extra for a caring, friendly, and compassionate doctor (vs formal, efficient, and business-like). Conclusion DCEs allow for powerful economic analyses that may help physicians understand patient preferences. Our model showed that cost is an important factor to patients and that patients are willing to pay extra for timely appointments, experience, and thorough physical examination.

Activity Diagrams for DEVS Models: A Case Study Modeling Health Care Behavior

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

Ozmen, Ozgur; Nutaro, James J

Discrete Event Systems Specification (DEVS) is a widely used formalism for modeling and simulation of discrete and continuous systems. While DEVS provides a sound mathematical representation of discrete systems, its practical use can suffer when models become complex. Five main functions, which construct the core of atomic modules in DEVS, can realize the behaviors that modelers want to represent. The integration of these functions is handled by the simulation routine, however modelers can implement each function in various ways. Therefore, there is a need for graphical representations of complex models to simplify their implementation and facilitate their reproduction. In thismore » work, we illustrate the use of activity diagrams for this purpose in the context of a health care behavior model, which is developed with an agent-based modeling paradigm.« less

Engine structures modeling software system: Computer code. User's manual

NASA Technical Reports Server (NTRS)

1992-01-01

ESMOSS is 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 software architecture of ESMOSS is designed in modular form with a central executive module through which the user controls and directs the development of the analytical model. Modules consist of a geometric shape generator, a library of discretization procedures, interfacing modules to join both geometric and discrete models, a deck generator to produce input for NASTRAN and a 'recipe' processor which generates geometric models from parametric definitions. ESMOSS can be executed both in interactive and batch modes. Interactive mode is considered to be the default mode and that mode will be assumed in the discussion in this document unless stated otherwise.

A Brownian Bridge Movement Model to Track Mobile Targets

DTIC Science & Technology

2016-09-01

breakout of Chinese forces in the South China Sea. Probability heat maps, depicting the probability of a target location at discrete times, are...achieve a higher probability of detection, it is more effective to have sensors cover a wider area at fewer discrete points in time than to have a...greater number of discrete looks using sensors covering smaller areas. 14. SUBJECT TERMS Brownian bridge movement models, unmanned sensors

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

NASA Technical Reports Server (NTRS)

Haras, Zigo; Taasan, Shlomo

1995-01-01

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

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.

Representation and design of wavelets using unitary circuits

NASA Astrophysics Data System (ADS)

Evenbly, Glen; White, Steven R.

2018-05-01

The representation of discrete, compact wavelet transformations (WTs) as circuits of local unitary gates is discussed. We employ a similar formalism as used in the multiscale representation of quantum many-body wave functions using unitary circuits, further cementing the relation established in the literature between classical and quantum multiscale methods. An algorithm for constructing the circuit representation of known orthogonal, dyadic, discrete WTs is presented, and the explicit representation for Daubechies wavelets, coiflets, and symlets is provided. Furthermore, we demonstrate the usefulness of the circuit formalism in designing WTs, including various classes of symmetric wavelets and multiwavelets, boundary wavelets, and biorthogonal wavelets.

Elliptic Painlevé equations from next-nearest-neighbor translations on the E_8^{(1)} lattice

NASA Astrophysics Data System (ADS)

Joshi, Nalini; Nakazono, Nobutaka

2017-07-01

The well known elliptic discrete Painlevé equation of Sakai is constructed by a standard translation on the E_8(1) lattice, given by nearest neighbor vectors. In this paper, we give a new elliptic discrete Painlevé equation obtained by translations along next-nearest-neighbor vectors. This equation is a generic (8-parameter) version of a 2-parameter elliptic difference equation found by reduction from Adler’s partial difference equation, the so-called Q4 equation. We also provide a projective reduction of the well known equation of Sakai.

LMI-based approach to stability analysis for fractional-order neural networks with discrete and distributed delays

NASA Astrophysics Data System (ADS)

Zhang, Hai; Ye, Renyu; Liu, Song; Cao, Jinde; Alsaedi, Ahmad; Li, Xiaodi

2018-02-01

This paper is concerned with the asymptotic stability of the Riemann-Liouville fractional-order neural networks with discrete and distributed delays. By constructing a suitable Lyapunov functional, two sufficient conditions are derived to ensure that the addressed neural network is asymptotically stable. The presented stability criteria are described in terms of the linear matrix inequalities. The advantage of the proposed method is that one may avoid calculating the fractional-order derivative of the Lyapunov functional. Finally, a numerical example is given to show the validity and feasibility of the theoretical results.

Fluid Stochastic Petri Nets: Theory, Applications, and Solution

NASA Technical Reports Server (NTRS)

Horton, Graham; Kulkarni, Vidyadhar G.; Nicol, David M.; Trivedi, Kishor S.

1996-01-01

In this paper we introduce a new class of stochastic Petri nets in which one or more places can hold fluid rather than discrete tokens. We define a class of fluid stochastic Petri nets in such a way that the discrete and continuous portions may affect each other. Following this definition we provide equations for their transient and steady-state behavior. We present several examples showing the utility of the construct in communication network modeling and reliability analysis, and discuss important special cases. We then discuss numerical methods for computing the transient behavior of such nets. Finally, some numerical examples are presented.

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

A New Model for Solving Time-Cost-Quality Trade-Off Problems in Construction

PubMed Central

Fu, Fang; Zhang, Tao

2016-01-01

A poor quality affects project makespan and its total costs negatively, but it can be recovered by repair works during construction. We construct a new non-linear programming model based on the classic multi-mode resource constrained project scheduling problem considering repair works. In order to obtain satisfactory quality without a high increase of project cost, the objective is to minimize total quality cost which consists of the prevention cost and failure cost according to Quality-Cost Analysis. A binary dependent normal distribution function is adopted to describe the activity quality; Cumulative quality is defined to determine whether to initiate repair works, according to the different relationships among activity qualities, namely, the coordinative and precedence relationship. Furthermore, a shuffled frog-leaping algorithm is developed to solve this discrete trade-off problem based on an adaptive serial schedule generation scheme and adjusted activity list. In the program of the algorithm, the frog-leaping progress combines the crossover operator of genetic algorithm and a permutation-based local search. Finally, an example of a construction project for a framed railway overpass is provided to examine the algorithm performance, and it assist in decision making to search for the appropriate makespan and quality threshold with minimal cost. PMID:27911939

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.

The Hundred-Year Emotion War: Are Emotions Natural Kinds or Psychological Constructions? Comment on Lench, Flores, and Bench (2011)

PubMed Central

Lindquist, Kristen A.; Siegel, Erika H.; Quigley, Karen S.; Barrett, Lisa Feldman

2012-01-01

For the last century, there has been a continuing debate about the nature of emotion. In the most recent offering in this scientific dialogue, Lench, Flores, and Bench (2011) report a meta-analysis of emotion induction research and claim support for the natural kind hypothesis that discrete emotions (e.g., happiness, sadness, anger, and anxiety) elicit specific changes in cognition, judgment, behavior, experience, and physiology. In this paper, we point out that Lench et al. (2011) is not the final word on the emotion debate. First, we point out that Lench et al.’s findings do not support their claim that discrete emotions organize cognition, judgment, experience, and physiology because they did not demonstrate emotion-consistent and -specific directional changes in these measurement domains. Second, we point out that Lench et al.’s findings are in fact consistent with the alternative (a psychological constructionist approach to emotion). We close by appealing for a construct validity approach to emotion research, which we hope will lead to greater consensus on the operationalization of the natural kind and psychological construction approaches, as well as the criteria required to finally resolve the emotion debate. PMID:23294094

A novel method to fabricate discrete porous carbon hemispheres and their electrochemical properties as supercapacitors.

PubMed

Chen, Jiafu; Lang, Zhanlin; Xu, Qun; Zhang, Jianan; Fu, Jianwei; Chen, Zhimin

2013-11-07

A simple and efficient method to produce discrete, hierarchical porous carbon hemispheres (CHs) with high uniformity has been successfully developed by constructing nanoreactors and using low crosslinked poly(styrene-co-divinylbenzene) (P(St-co-DVB)) capsules as precursors. The samples are characterized by scanning and transmission electron microscopy, Fourier transform infrared and Raman spectroscopy, X-ray diffraction, and N2 adsorption and desorption. Considering their application, the cyclic voltammetry and electrochemical impedance spectroscopy characterization are tested. The experimental results show that the achievement of discrete and perfect carbon hemispheres is dependent on the proper amount of DVB in the P(St-co-DVB) capsules, which can contribute to the ideal thickness or mechanical strength of the shells. When the amount of DVB is 35 wt% in the precursors, a high Brunauer-Emmett-Teller surface area of 676 m(2) g(-1) can be obtained for the carbon hemispheres, and the extremely large pore volume of 2.63 cm(3) g(-1) can also be achieved at the same time. The electrochemical test shows the carbon hemispheres have a higher specific capacitance of ca. 83 F g(-1) at 10 mV s(-1), compared to other carbon materials. So this method supplies a platform to extend the fabrication field of carbon materials and supplies more chances for the application of carbon materials including carbon hemispheres that are important components and substrates for supercapacitors.

A discrete time-varying internal model-based approach for high precision tracking of a multi-axis servo gantry.

PubMed

Zhang, Zhen; Yan, Peng; Jiang, Huan; Ye, Peiqing

2014-09-01

In this paper, we consider the discrete time-varying internal model-based control design for high precision tracking of complicated reference trajectories generated by time-varying systems. Based on a novel parallel time-varying internal model structure, asymptotic tracking conditions for the design of internal model units are developed, and a low order robust time-varying stabilizer is further synthesized. In a discrete time setting, the high precision tracking control architecture is deployed on a Voice Coil Motor (VCM) actuated servo gantry system, where numerical simulations and real time experimental results are provided, achieving the tracking errors around 3.5‰ for frequency-varying signals. Copyright © 2014 ISA. Published by Elsevier Ltd. All rights reserved.

A hybrid simulation approach for integrating safety behavior into construction planning: An earthmoving case study.

PubMed

Goh, Yang Miang; Askar Ali, Mohamed Jawad

2016-08-01

One of the key challenges in improving construction safety and health is the management of safety behavior. From a system point of view, workers work unsafely due to system level issues such as poor safety culture, excessive production pressure, inadequate allocation of resources and time and lack of training. These systemic issues should be eradicated or minimized during planning. However, there is a lack of detailed planning tools to help managers assess the impact of their upstream decisions on worker safety behavior. Even though simulation had been used in construction planning, the review conducted in this study showed that construction safety management research had not been exploiting the potential of simulation techniques. Thus, a hybrid simulation framework is proposed to facilitate integration of safety management considerations into construction activity simulation. The hybrid framework consists of discrete event simulation (DES) as the core, but heterogeneous, interactive and intelligent (able to make decisions) agents replace traditional entities and resources. In addition, some of the cognitive processes and physiological aspects of agents are captured using system dynamics (SD) approach. The combination of DES, agent-based simulation (ABS) and SD allows a more "natural" representation of the complex dynamics in construction activities. The proposed hybrid framework was demonstrated using a hypothetical case study. In addition, due to the lack of application of factorial experiment approach in safety management simulation, the case study demonstrated sensitivity analysis and factorial experiment to guide future research. Copyright © 2015 Elsevier Ltd. All rights reserved.

An Adynamical, Graphical Approach to Quantum Gravity and Unification

NASA Astrophysics Data System (ADS)

Stuckey, W. M.; Silberstein, Michael; McDevitt, Timothy

We use graphical field gradients in an adynamical, background independent fashion to propose a new approach to quantum gravity (QG) and unification. Our proposed reconciliation of general relativity (GR) and quantum field theory (QFT) is based on a modification of their graphical instantiations, i.e. Regge calculus and lattice gauge theory (LGT), respectively, which we assume are fundamental to their continuum counterparts. Accordingly, the fundamental structure is a graphical amalgam of space, time, and sources (in parlance of QFT) called a "space-time source element". These are fundamental elements of space, time, and sources, not source elements in space and time. The transition amplitude for a space-time source element is computed using a path integral with discrete graphical action. The action for a space-time source element is constructed from a difference matrix K and source vector J on the graph, as in lattice gauge theory. K is constructed from graphical field gradients so that it contains a non-trivial null space and J is then restricted to the row space of K, so that it is divergence-free and represents a conserved exchange of energy-momentum. This construct of K and J represents an adynamical global constraint (AGC) between sources, the space-time metric, and the energy-momentum content of the element, rather than a dynamical law for time-evolved entities. In this view, one manifestation of quantum gravity becomes evident when, for example, a single space-time source element spans adjoining simplices of the Regge calculus graph. Thus, energy conservation for the space-time source element includes contributions to the deficit angles between simplices. This idea is used to correct proper distance in the Einstein-de Sitter (EdS) cosmology model yielding a fit of the Union2 Compilation supernova data that matches ΛCDM without having to invoke accelerating expansion or dark energy. A similar modification to LGT results in an adynamical account of quantum interference.

Discrete-time bidirectional associative memory neural networks with variable delays

NASA Astrophysics Data System (ADS)

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

2005-02-01

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

Time-discretized steady compressible Navier-Stokes equations with inflow and outflow boundaries

NASA Astrophysics Data System (ADS)

Yoon, Gangjoon; Yang, Sung-Dae; Song, Minsu; Gunzburger, Max

2013-12-01

The time-discretized steady compressible Navier-Stokes equations in n-dimensional bounded domains with the velocity specified only at the inflow boundary are considered. The existence and uniqueness of L p solutions are proved for p > n. For time-discretized steady flows, results of Kweon and Kellogg and of Kweon and Song are extended in a manner that allows for more general domains and for density-dependent viscosity coefficients. Moreover, we only require p > n which is a critical barrier in the previous works.

Complexity and chaos control in a discrete-time prey-predator model

NASA Astrophysics Data System (ADS)

Din, Qamar

2017-08-01

We investigate the complex behavior and chaos control in a discrete-time prey-predator model. Taking into account the Leslie-Gower prey-predator model, we propose a discrete-time prey-predator system with predator partially dependent on prey and investigate the boundedness, existence and uniqueness of positive equilibrium and bifurcation analysis of the system by using center manifold theorem and bifurcation theory. Various feedback control strategies are implemented for controlling the bifurcation and chaos in the system. Numerical simulations are provided to illustrate theoretical discussion.

System and method for anomaly detection

DOEpatents

Scherrer, Chad

2010-06-15

A system and method for detecting one or more anomalies in a plurality of observations is provided. In one illustrative embodiment, the observations are real-time network observations collected from a stream of network traffic. The method includes performing a discrete decomposition of the observations, and introducing derived variables to increase storage and query efficiencies. A mathematical model, such as a conditional independence model, is then generated from the formatted data. The formatted data is also used to construct frequency tables which maintain an accurate count of specific variable occurrence as indicated by the model generation process. The formatted data is then applied to the mathematical model to generate scored data. The scored data is then analyzed to detect anomalies.

Construction and comparison of parallel implicit kinetic solvers in three spatial dimensions

NASA Astrophysics Data System (ADS)

Titarev, Vladimir; Dumbser, Michael; Utyuzhnikov, Sergey

2014-01-01

The paper is devoted to the further development and systematic performance evaluation of a recent deterministic framework Nesvetay-3D for modelling three-dimensional rarefied gas flows. Firstly, a review of the existing discretization and parallelization strategies for solving numerically the Boltzmann kinetic equation with various model collision integrals is carried out. Secondly, a new parallelization strategy for the implicit time evolution method is implemented which improves scaling on large CPU clusters. Accuracy and scalability of the methods are demonstrated on a pressure-driven rarefied gas flow through a finite-length circular pipe as well as an external supersonic flow over a three-dimensional re-entry geometry of complicated aerodynamic shape.

An Open-Source Arduino-based Controller for Mechanical Rain Simulators

NASA Astrophysics Data System (ADS)

Cantilina, K. K.

2017-12-01

Many commercial rain simulators currently used in hydrology rely on inflexible and outdated controller designs. These analog controllers typically only allow a handful of discrete parameter options, and do not support internal timing functions or continuously-changing parameters. A desire for finer control of rain simulation events necessitated the design and construction of a microcontroller-based controller, using widely available off-the-shelf components. A menu driven interface allows users to fine-tune simulation parameters without the need for training or experience with microcontrollers, and the accessibility of the Arduino IDE allows users with a minimum of programming and hardware experience to modify the controller program to suit the needs of individual experiments.

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

PubMed

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

2013-08-01

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

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

Campos, Rafael G.; Tututi, Eduardo S.

We study the Schwinger model on a lattice constructed from zeros of the Hermite polynomials that incorporates a lattice derivative and a discrete Fourier transform with many properties. Such a lattice produces a Klein-Gordon equation for the boson field and the correct value of the mass in the asymptotic limit.

Application of Model-based Prognostics to a Pneumatic Valves Testbed

NASA Technical Reports Server (NTRS)

Daigle, Matthew; Kulkarni, Chetan S.; Gorospe, George

2014-01-01

Pneumatic-actuated valves play an important role in many applications, including cryogenic propellant loading for space operations. Model-based prognostics emphasizes the importance of a model that describes the nominal and faulty behavior of a system, and how faulty behavior progresses in time, causing the end of useful life of the system. We describe the construction of a testbed consisting of a pneumatic valve that allows the injection of faulty behavior and controllable fault progression. The valve opens discretely, and is controlled through a solenoid valve. Controllable leaks of pneumatic gas in the testbed are introduced through proportional valves, allowing the testing and validation of prognostics algorithms for pneumatic valves. A new valve prognostics approach is developed that estimates fault progression and predicts remaining life based only on valve timing measurements. Simulation experiments demonstrate and validate the approach.

Spatio-temporal organization of dynamics in a two-dimensional periodically driven vortex flow: A Lagrangian flow network perspective.

PubMed

Lindner, Michael; Donner, Reik V

2017-03-01

We study the Lagrangian dynamics of passive tracers in a simple model of a driven two-dimensional vortex resembling real-world geophysical flow patterns. Using a discrete approximation of the system's transfer operator, we construct a directed network that describes the exchange of mass between distinct regions of the flow domain. By studying different measures characterizing flow network connectivity at different time-scales, we are able to identify the location of dynamically invariant structures and regions of maximum dispersion. Specifically, our approach allows us to delimit co-existing flow regimes with different dynamics. To validate our findings, we compare several network characteristics to the well-established finite-time Lyapunov exponents and apply a receiver operating characteristic analysis to identify network measures that are particularly useful for unveiling the skeleton of Lagrangian chaos.

Probe-Independent EEG Assessment of Mental Workload in Pilots

DTIC Science & Technology

2015-05-18

Teager Energy Operator - Frequency Modulated Component - z- score 10.94 17.46 10 Hurst Exponent - Discrete Second Order Derivative 7.02 17.06 D. Best...Teager Energy Operator– Frequency Modulated Component – Z-score 45. Line Length – Time Series 46. Line Length – Time Series – Z-score 47. Hurst Exponent ...Discrete Second Order Derivative 48. Hurst Exponent – Wavelet Based Adaptation 49. Hurst Exponent – Rescaled Range 50. Hurst Exponent – Discrete

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.

Scalar discrete nonlinear multipoint boundary value problems

NASA Astrophysics Data System (ADS)

Rodriguez, Jesus; Taylor, Padraic

2007-06-01

In this paper we provide sufficient conditions for the existence of solutions to scalar discrete nonlinear multipoint boundary value problems. By allowing more general boundary conditions and by imposing less restrictions on the nonlinearities, we obtain results that extend previous work in the area of discrete boundary value problems [Debra L. Etheridge, Jesus Rodriguez, Periodic solutions of nonlinear discrete-time systems, Appl. Anal. 62 (1996) 119-137; Debra L. Etheridge, Jesus Rodriguez, Scalar discrete nonlinear two-point boundary value problems, J. Difference Equ. Appl. 4 (1998) 127-144].

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.

Gauge Theory on a Space with Linear Lie Type Fuzziness

NASA Astrophysics Data System (ADS)

Khorrami, Mohammad; Fatollahi, Amir H.; Shariati, Ahmad

2013-03-01

The U(1) gauge theory on a space with Lie type noncommutativity is constructed. The construction is based on the group of translations in Fourier space, which in contrast to space itself is commutative. In analogy with lattice gauge theory, the object playing the role of flux of field strength per plaquette, as well as the action, is constructed. It is observed that the theory, in comparison with ordinary U(1) gauge theory, has an extra gauge field component. This phenomena is reminiscent of similar ones in formulation of SU(N) gauge theory in space with canonical noncommutativity, and also appearance of gauge field component in discrete direction of Connes' construction of the Standard Model.

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

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.

High-order solution methods for grey discrete ordinates thermal radiative transfer

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

Maginot, Peter G., E-mail: maginot1@llnl.gov; Ragusa, Jean C., E-mail: jean.ragusa@tamu.edu; Morel, Jim E., E-mail: morel@tamu.edu

This work presents a solution methodology for solving the grey radiative transfer equations that is both spatially and temporally more accurate than the canonical radiative transfer solution technique of linear discontinuous finite element discretization in space with implicit Euler integration in time. We solve the grey radiative transfer equations by fully converging the nonlinear temperature dependence of the material specific heat, material opacities, and Planck function. The grey radiative transfer equations are discretized in space using arbitrary-order self-lumping discontinuous finite elements and integrated in time with arbitrary-order diagonally implicit Runge–Kutta time integration techniques. Iterative convergence of the radiation equation ismore » accelerated using a modified interior penalty diffusion operator to precondition the full discrete ordinates transport operator.« less

High-order solution methods for grey discrete ordinates thermal radiative transfer

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

Maginot, Peter G.; Ragusa, Jean C.; Morel, Jim E.

This paper presents a solution methodology for solving the grey radiative transfer equations that is both spatially and temporally more accurate than the canonical radiative transfer solution technique of linear discontinuous finite element discretization in space with implicit Euler integration in time. We solve the grey radiative transfer equations by fully converging the nonlinear temperature dependence of the material specific heat, material opacities, and Planck function. The grey radiative transfer equations are discretized in space using arbitrary-order self-lumping discontinuous finite elements and integrated in time with arbitrary-order diagonally implicit Runge–Kutta time integration techniques. Iterative convergence of the radiation equation ismore » accelerated using a modified interior penalty diffusion operator to precondition the full discrete ordinates transport operator.« less

High-order solution methods for grey discrete ordinates thermal radiative transfer

DOE PAGES

Maginot, Peter G.; Ragusa, Jean C.; Morel, Jim E.

2016-09-29

This paper presents a solution methodology for solving the grey radiative transfer equations that is both spatially and temporally more accurate than the canonical radiative transfer solution technique of linear discontinuous finite element discretization in space with implicit Euler integration in time. We solve the grey radiative transfer equations by fully converging the nonlinear temperature dependence of the material specific heat, material opacities, and Planck function. The grey radiative transfer equations are discretized in space using arbitrary-order self-lumping discontinuous finite elements and integrated in time with arbitrary-order diagonally implicit Runge–Kutta time integration techniques. Iterative convergence of the radiation equation ismore » accelerated using a modified interior penalty diffusion operator to precondition the full discrete ordinates transport operator.« less

Energy thresholds of discrete breathers in thermal equilibrium and relaxation processes.

PubMed

Ming, Yi; Ling, Dong-Bo; Li, Hui-Min; Ding, Ze-Jun

2017-06-01

So far, only the energy thresholds of single discrete breathers in nonlinear Hamiltonian systems have been analytically obtained. In this work, the energy thresholds of discrete breathers in thermal equilibrium and the energy thresholds of long-lived discrete breathers which can remain after a long time relaxation are analytically estimated for nonlinear chains. These energy thresholds are size dependent. The energy thresholds of discrete breathers in thermal equilibrium are the same as the previous analytical results for single discrete breathers. The energy thresholds of long-lived discrete breathers in relaxation processes are different from the previous results for single discrete breathers but agree well with the published numerical results known to us. Because real systems are either in thermal equilibrium or in relaxation processes, the obtained results could be important for experimental detection of discrete breathers.

Discrete-time model reduction in limited frequency ranges

NASA Technical Reports Server (NTRS)

Horta, Lucas G.; Juang, Jer-Nan; Longman, Richard W.

1991-01-01

A mathematical formulation for model reduction of discrete time systems such that the reduced order model represents the system in a particular frequency range is discussed. The algorithm transforms the full order system into balanced coordinates using frequency weighted discrete controllability and observability grammians. In this form a criterion is derived to guide truncation of states based on their contribution to the frequency range of interest. Minimization of the criterion is accomplished without need for numerical optimization. Balancing requires the computation of discrete frequency weighted grammians. Close form solutions for the computation of frequency weighted grammians are developed. Numerical examples are discussed to demonstrate the algorithm.

Tail shortening by discrete hydrodynamics

NASA Astrophysics Data System (ADS)

Kiefer, J.; Visscher, P. B.

1982-02-01

A discrete formulation of hydrodynamics was recently introduced, whose most important feature is that it is exactly renormalizable. Previous numerical work has found that it provides a more efficient and rapidly convergent method for calculating transport coefficients than the usual Green-Kubo method. The latter's convergence difficulties are due to the well-known "long-time tail" of the time correlation function which must be integrated over time. The purpose of the present paper is to present additional evidence that these difficulties are really absent in the discrete equation of motion approach. The "memory" terms in the equation of motion are calculated accurately, and shown to decay much more rapidly with time than the equilibrium time correlations do.

Digital Morphing Wing: Active Wing Shaping Concept Using Composite Lattice-Based Cellular Structures.

PubMed

Jenett, Benjamin; Calisch, Sam; Cellucci, Daniel; Cramer, Nick; Gershenfeld, Neil; Swei, Sean; Cheung, Kenneth C

2017-03-01

We describe an approach for the discrete and reversible assembly of tunable and actively deformable structures using modular building block parts for robotic applications. The primary technical challenge addressed by this work is the use of this method to design and fabricate low density, highly compliant robotic structures with spatially tuned stiffness. This approach offers a number of potential advantages over more conventional methods for constructing compliant robots. The discrete assembly reduces manufacturing complexity, as relatively simple parts can be batch-produced and joined to make complex structures. Global mechanical properties can be tuned based on sub-part ordering and geometry, because local stiffness and density can be independently set to a wide range of values and varied spatially. The structure's intrinsic modularity can significantly simplify analysis and simulation. Simple analytical models for the behavior of each building block type can be calibrated with empirical testing and synthesized into a highly accurate and computationally efficient model of the full compliant system. As a case study, we describe a modular and reversibly assembled wing that performs continuous span-wise twist deformation. It exhibits high performance aerodynamic characteristics, is lightweight and simple to fabricate and repair. The wing is constructed from discrete lattice elements, wherein the geometric and mechanical attributes of the building blocks determine the global mechanical properties of the wing. We describe the mechanical design and structural performance of the digital morphing wing, including their relationship to wind tunnel tests that suggest the ability to increase roll efficiency compared to a conventional rigid aileron system. We focus here on describing the approach to design, modeling, and construction as a generalizable approach for robotics that require very lightweight, tunable, and actively deformable structures.

Digital Morphing Wing: Active Wing Shaping Concept Using Composite Lattice-Based Cellular Structures

PubMed Central

Jenett, Benjamin; Calisch, Sam; Cellucci, Daniel; Cramer, Nick; Gershenfeld, Neil; Swei, Sean

2017-01-01

Abstract We describe an approach for the discrete and reversible assembly of tunable and actively deformable structures using modular building block parts for robotic applications. The primary technical challenge addressed by this work is the use of this method to design and fabricate low density, highly compliant robotic structures with spatially tuned stiffness. This approach offers a number of potential advantages over more conventional methods for constructing compliant robots. The discrete assembly reduces manufacturing complexity, as relatively simple parts can be batch-produced and joined to make complex structures. Global mechanical properties can be tuned based on sub-part ordering and geometry, because local stiffness and density can be independently set to a wide range of values and varied spatially. The structure's intrinsic modularity can significantly simplify analysis and simulation. Simple analytical models for the behavior of each building block type can be calibrated with empirical testing and synthesized into a highly accurate and computationally efficient model of the full compliant system. As a case study, we describe a modular and reversibly assembled wing that performs continuous span-wise twist deformation. It exhibits high performance aerodynamic characteristics, is lightweight and simple to fabricate and repair. The wing is constructed from discrete lattice elements, wherein the geometric and mechanical attributes of the building blocks determine the global mechanical properties of the wing. We describe the mechanical design and structural performance of the digital morphing wing, including their relationship to wind tunnel tests that suggest the ability to increase roll efficiency compared to a conventional rigid aileron system. We focus here on describing the approach to design, modeling, and construction as a generalizable approach for robotics that require very lightweight, tunable, and actively deformable structures. PMID:28289574

Writing and compiling code into biochemistry.

PubMed

Shea, Adam; Fett, Brian; Riedel, Marc D; Parhi, Keshab

2010-01-01

This paper presents a methodology for translating iterative arithmetic computation, specified as high-level programming constructs, into biochemical reactions. From an input/output specification, we generate biochemical reactions that produce output quantities of proteins as a function of input quantities performing operations such as addition, subtraction, and scalar multiplication. Iterative constructs such as "while" loops and "for" loops are implemented by transferring quantities between protein types, based on a clocking mechanism. Synthesis first is performed at a conceptual level, in terms of abstract biochemical reactions - a task analogous to high-level program compilation. Then the results are mapped onto specific biochemical reactions selected from libraries - a task analogous to machine language compilation. We demonstrate our approach through the compilation of a variety of standard iterative functions: multiplication, exponentiation, discrete logarithms, raising to a power, and linear transforms on time series. The designs are validated through transient stochastic simulation of the chemical kinetics. We are exploring DNA-based computation via strand displacement as a possible experimental chassis.

Ocean Wave Simulation Based on Wind Field

PubMed Central

2016-01-01

Ocean wave simulation has a wide range of applications in movies, video games and training systems. Wind force is the main energy resource for generating ocean waves, which are the result of the interaction between wind and the ocean surface. While numerous methods to handle simulating oceans and other fluid phenomena have undergone rapid development during the past years in the field of computer graphic, few of them consider to construct ocean surface height field from the perspective of wind force driving ocean waves. We introduce wind force to the construction of the ocean surface height field through applying wind field data and wind-driven wave particles. Continual and realistic ocean waves result from the overlap of wind-driven wave particles, and a strategy was proposed to control these discrete wave particles and simulate an endless ocean surface. The results showed that the new method is capable of obtaining a realistic ocean scene under the influence of wind fields at real time rates. PMID:26808718

Ocean Wave Simulation Based on Wind Field.

PubMed

Li, Zhongyi; Wang, Hao

2016-01-01

Ocean wave simulation has a wide range of applications in movies, video games and training systems. Wind force is the main energy resource for generating ocean waves, which are the result of the interaction between wind and the ocean surface. While numerous methods to handle simulating oceans and other fluid phenomena have undergone rapid development during the past years in the field of computer graphic, few of them consider to construct ocean surface height field from the perspective of wind force driving ocean waves. We introduce wind force to the construction of the ocean surface height field through applying wind field data and wind-driven wave particles. Continual and realistic ocean waves result from the overlap of wind-driven wave particles, and a strategy was proposed to control these discrete wave particles and simulate an endless ocean surface. The results showed that the new method is capable of obtaining a realistic ocean scene under the influence of wind fields at real time rates.

An Optimization Framework for Driver Feedback Systems

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

Malikopoulos, Andreas; Aguilar, Juan P.

2013-01-01

Modern vehicles have sophisticated electronic control units that can control engine operation with discretion to balance fuel economy, emissions, and power. These control units are designed for specific driving conditions (e.g., different speed profiles for highway and city driving). However, individual driving styles are different and rarely match the specific driving conditions for which the units were designed. In the research reported here, we investigate driving-style factors that have a major impact on fuel economy and construct an optimization framework to optimize individual driving styles with respect to these driving factors. In this context, we construct a set of polynomialmore » metamodels to reflect the responses produced in fuel economy by changing the driving factors. Then, we compare the optimized driving styles to the original driving styles and evaluate the effectiveness of the optimization framework. Finally, we use this proposed framework to develop a real-time feedback system, including visual instructions, to enable drivers to alter their driving styles in response to actual driving conditions to improve fuel efficiency.« less