WorldWideScience

Sample records for approximate dynamic programming

  1. Configuring Airspace Sectors with Approximate Dynamic Programming

    Science.gov (United States)

    Bloem, Michael; Gupta, Pramod

    2010-01-01

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

  2. Approximate Dynamic Programming for Self-Learning Control

    Institute of Scientific and Technical Information of China (English)

    Derong Liu

    2005-01-01

    This paper introduces a self-learning control approach based on approximate dynamic programming. Dynamic programming was introduced by Bellman in the 1950's for solving optimal control problems of nonlinear dynamical systems. Due to its high computational complexity, the applications of dynamic programming have been limited to simple and small problems. The key step in finding approximate solutions to dynamic programming is to estimate the performance index in dynamic programming. The optimal control signal can then be determined by minimizing (or maximizing) the performance index. Artificial neural networks are very efficient tools in representing the performance index in dynamic programming. This paper assumes the use of neural networks for estimating the performance index in dynamic programming and for generating optimal control signals, thus to achieve optimal control through self-learning.

  3. Approximate Dynamic Programming Solving the Curses of Dimensionality

    CERN Document Server

    Powell, Warren B

    2011-01-01

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

  4. Approximate dynamic programming using fluid and diffusion approximations with applications to power management

    OpenAIRE

    Chen, Wei; Huang, Dayu; Kulkarni, Ankur A.; Unnikrishnan, Jayakrishnan; Zhu, Quanyan; Mehta, Prashant; Meyn, Sean; Wierman, Adam

    2013-01-01

    Neuro-dynamic programming is a class of powerful techniques for approximating the solution to dynamic programming equations. In their most computationally attractive formulations, these techniques provide the approximate solution only within a prescribed finite-dimensional function class. Thus, the question that always arises is how should the function class be chosen? The goal of this paper is to propose an approach using the solutions to associated fluid and diffusion approximations. In ord...

  5. Approximate Dynamic Programming By Minimizing Distributionally Robust Bounds

    CERN Document Server

    Petrik, Marek

    2012-01-01

    Approximate dynamic programming is a popular method for solving large Markov decision processes. This paper describes a new class of approximate dynamic programming (ADP) methods- distributionally robust ADP-that address the curse of dimensionality by minimizing a pessimistic bound on the policy loss. This approach turns ADP into an optimization problem, for which we derive new mathematical program formulations and analyze its properties. DRADP improves on the theoretical guarantees of existing ADP methods-it guarantees convergence and L1 norm based error bounds. The empirical evaluation of DRADP shows that the theoretical guarantees translate well into good performance on benchmark problems.

  6. An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems

    OpenAIRE

    Dimitris Bertsimas; Ramazan Demir

    2002-01-01

    We present an Approximate Dynamic Programming (ADP) approach for the multidimensional knapsack problem (MKP). We approximate the value function (a) using parametric and nonparametric methods and (b)using a base-heuristic. We propose a new heuristic which adaptively rounds the solution of the linear programming relaxation. Our computational study suggests: (a)the new heuristic produces high quality solutions fast and robustly, (b)state of the art commercial packages like CPLEX require signific...

  7. Approximate Dynamic Programming Based on High Dimensional Model Representation

    Czech Academy of Sciences Publication Activity Database

    Pištěk, Miroslav

    2013-01-01

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

  8. Approximate dynamic programming solving the curses of dimensionality

    CERN Document Server

    Powell, Warren B

    2007-01-01

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

  9. Editorial Special issue on approximate dynamic programming and reinforcement learning

    Institute of Scientific and Technical Information of China (English)

    Silvia Ferrari; Jagannathan Sarangapani; Frank L. Lewis

    2011-01-01

    We are extremely pleased to present this special issue of the Journal of Control Theory and Applications.Approximate dynamic programming (ADP) is a general and effective approach for solving optimal control and estimation problems by adapting to uncertain environments over time.ADP optimizes the sensing objectives accrued over a future time interval with respect to an adaptive control law,conditioned on prior knowledge of the system,its state,and uncertainties.A numerical search over the present value of the control minimizes a Hamilton-Jacobi-Bellman (HJB) equation providing a basis for real-time,approximate optimal control.

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

    Directory of Open Access Journals (Sweden)

    Marcin Szuster

    2016-02-01

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

  11. F -Discrepancy for Efficient Sampling in Approximate Dynamic Programming.

    Science.gov (United States)

    Cervellera, Cristiano; Maccio, Danilo

    2016-07-01

    In this paper, we address the problem of generating efficient state sample points for the solution of continuous-state finite-horizon Markovian decision problems through approximate dynamic programming. It is known that the selection of sampling points at which the value function is observed is a key factor when such function is approximated by a model based on a finite number of evaluations. A standard approach consists in generating these points through a random or deterministic procedure, aiming at a balanced covering of the state space. Yet, this solution may not be efficient if the state trajectories are not uniformly distributed. Here, we propose to exploit F -discrepancy, a quantity that measures how closely a set of random points represents a probability distribution, and introduce an example of an algorithm based on such concept to automatically select point sets that are efficient with respect to the underlying Markovian process. An error analysis of the approximate solution is provided, showing how the proposed algorithm enables convergence under suitable regularity hypotheses. Then, simulation results are provided concerning an inventory forecasting test problem. The tests confirm in general the important role of F -discrepancy, and show how the proposed algorithm is able to yield better results than uniform sampling, using sets even 50 times smaller. PMID:26241987

  12. Dynamic programming approach to optimization of approximate decision rules

    KAUST Repository

    Amin, Talha

    2013-02-01

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

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

    OpenAIRE

    Jooyoung Park; Gyo-Bum Chung; Jungdong Lim; Dongsu Yang

    2015-01-01

    Recently, the optimization of power flows in portable hybrid power-supply systems (HPSSs) has become an important issue with the advent of a variety of mobile systems and hybrid energy technologies. In this paper, a control strategy is considered for dynamically managing power flows in portable HPSSs employing batteries and supercapacitors. Our dynamic power management strategy utilizes the concept of approximate dynamic programming (ADP). ADP methods are important tools in the fields of stoc...

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

    Directory of Open Access Journals (Sweden)

    Jooyoung Park

    2015-05-01

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

  15. Hamilton-Jacobi-Bellman equations and approximate dynamic programming on time scales.

    Science.gov (United States)

    Seiffertt, John; Sanyal, Suman; Wunsch, Donald C

    2008-08-01

    The time scales calculus is a key emerging area of mathematics due to its potential use in a wide variety of multidisciplinary applications. We extend this calculus to approximate dynamic programming (ADP). The core backward induction algorithm of dynamic programming is extended from its traditional discrete case to all isolated time scales. Hamilton-Jacobi-Bellman equations, the solution of which is the fundamental problem in the field of dynamic programming, are motivated and proven on time scales. By drawing together the calculus of time scales and the applied area of stochastic control via ADP, we have connected two major fields of research. PMID:18632378

  16. Approximate group context tree: applications to dynamic programming and dynamic choice models

    CERN Document Server

    Belloni, Alexandre

    2011-01-01

    The paper considers a variable length Markov chain model associated with a group of stationary processes that share the same context tree but potentially different conditional probabilities. We propose a new model selection and estimation method, develop oracle inequalities and model selection properties for the estimator. These results also provide conditions under which the use of the group structure can lead to improvements in the overall estimation. Our work is also motivated by two methodological applications: discrete stochastic dynamic programming and dynamic discrete choice models. We analyze the uniform estimation of the value function for dynamic programming and the uniform estimation of average dynamic marginal effects for dynamic discrete choice models accounting for possible imperfect model selection. We also derive the typical behavior of our estimator when applied to polynomially $\\beta$-mixing stochastic processes. For parametric models, we derive uniform rate of convergence for the estimation...

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

    Directory of Open Access Journals (Sweden)

    Yaofei Ma

    2014-01-01

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

  18. The Smoothed Approximate Linear Program

    CERN Document Server

    Desai, V V; Moallemi, C C

    2009-01-01

    We present a novel linear program for the approximation of the dynamic programming cost-to-go function in high-dimensional stochastic control problems. LP approaches to approximate DP have typically relied on a natural `projection' of a well studied linear program for exact dynamic programming. Such programs restrict attention to approximations that are lower bounds to the optimal cost-to-go function. Our program--the `smoothed approximate linear program'--is distinct from such approaches and relaxes the restriction to lower bounding approximations in an appropriate fashion while remaining computationally tractable. Doing so appears to have several advantages: First, we demonstrate substantially superior bounds on the quality of approximation to the optimal cost-to-go function afforded by our approach. Second, experiments with our approach on a challenging problem (the game of Tetris) show that the approach outperforms the existing LP approach (which has previously been shown to be competitive with several AD...

  19. Approximating high-dimensional dynamics by barycentric coordinates with linear programming

    Energy Technology Data Exchange (ETDEWEB)

    Hirata, Yoshito, E-mail: yoshito@sat.t.u-tokyo.ac.jp; Aihara, Kazuyuki; Suzuki, Hideyuki [Institute of Industrial Science, The University of Tokyo, 4-6-1 Komaba, Meguro-ku, Tokyo 153-8505 (Japan); Department of Mathematical Informatics, The University of Tokyo, Bunkyo-ku, Tokyo 113-8656 (Japan); CREST, JST, 4-1-8 Honcho, Kawaguchi, Saitama 332-0012 (Japan); Shiro, Masanori [Department of Mathematical Informatics, The University of Tokyo, Bunkyo-ku, Tokyo 113-8656 (Japan); Mathematical Neuroinformatics Group, Advanced Industrial Science and Technology, Tsukuba, Ibaraki 305-8568 (Japan); Takahashi, Nozomu; Mas, Paloma [Center for Research in Agricultural Genomics (CRAG), Consorci CSIC-IRTA-UAB-UB, Barcelona 08193 (Spain)

    2015-01-15

    The increasing development of novel methods and techniques facilitates the measurement of high-dimensional time series but challenges our ability for accurate modeling and predictions. The use of a general mathematical model requires the inclusion of many parameters, which are difficult to be fitted for relatively short high-dimensional time series observed. Here, we propose a novel method to accurately model a high-dimensional time series. Our method extends the barycentric coordinates to high-dimensional phase space by employing linear programming, and allowing the approximation errors explicitly. The extension helps to produce free-running time-series predictions that preserve typical topological, dynamical, and/or geometric characteristics of the underlying attractors more accurately than the radial basis function model that is widely used. The method can be broadly applied, from helping to improve weather forecasting, to creating electronic instruments that sound more natural, and to comprehensively understanding complex biological data.

  20. Approximating high-dimensional dynamics by barycentric coordinates with linear programming

    International Nuclear Information System (INIS)

    The increasing development of novel methods and techniques facilitates the measurement of high-dimensional time series but challenges our ability for accurate modeling and predictions. The use of a general mathematical model requires the inclusion of many parameters, which are difficult to be fitted for relatively short high-dimensional time series observed. Here, we propose a novel method to accurately model a high-dimensional time series. Our method extends the barycentric coordinates to high-dimensional phase space by employing linear programming, and allowing the approximation errors explicitly. The extension helps to produce free-running time-series predictions that preserve typical topological, dynamical, and/or geometric characteristics of the underlying attractors more accurately than the radial basis function model that is widely used. The method can be broadly applied, from helping to improve weather forecasting, to creating electronic instruments that sound more natural, and to comprehensively understanding complex biological data

  1. Dynamic Analyses of Result Quality in Energy-Aware Approximate Programs

    Science.gov (United States)

    RIngenburg, Michael F.

    Energy efficiency is a key concern in the design of modern computer systems. One promising approach to energy-efficient computation, approximate computing, trades off output precision for energy efficiency. However, this tradeoff can have unexpected effects on computation quality. This thesis presents dynamic analysis tools to study, debug, and monitor the quality and energy efficiency of approximate computations. We propose three styles of tools: prototyping tools that allow developers to experiment with approximation in their applications, online tools that instrument code to determine the key sources of error, and online tools that monitor the quality of deployed applications in real time. Our prototyping tool is based on an extension to the functional language OCaml. We add approximation constructs to the language, an approximation simulator to the runtime, and profiling and auto-tuning tools for studying and experimenting with energy-quality tradeoffs. We also present two online debugging tools and three online monitoring tools. The first online tool identifies correlations between output quality and the total number of executions of, and errors in, individual approximate operations. The second tracks the number of approximate operations that flow into a particular value. Our online tools comprise three low-cost approaches to dynamic quality monitoring. They are designed to monitor quality in deployed applications without spending more energy than is saved by approximation. Online monitors can be used to perform real time adjustments to energy usage in order to meet specific quality goals. We present prototype implementations of all of these tools and describe their usage with several applications. Our prototyping, profiling, and autotuning tools allow us to experiment with approximation strategies and identify new strategies, our online tools succeed in providing new insights into the effects of approximation on output quality, and our monitors succeed in

  2. Combined mid- and short-term optimization of multireservoir systems via dynamic programming with function approximators

    Science.gov (United States)

    Bottacin-Busolin, Andrea; Wörman, Anders; Zmijewski, Nicholas

    2013-04-01

    A main challenge for the planning and management of water resources is the development of strategies for regulation of multireservoir systems under a complex stochastic environment. The sequential decision problem involving the release of water from multiple reservoirs depends on the stochastic variability of the hydrologic inflows over a spectrum of time scales. An important distinction is made between short-term and mid-term planning: the first is associated with regulation on the hourly scale within the one-week time horizon, whilst the second is associated with the weekly scale within the one-year horizon. Although a variety of optimization methods have been suggested, the achievement of a global optimum in the operation of large-scale systems is hindered by their high dimensional state space and by the stochastic nature of the hydrologic inflows. In this work, operational plans for multireservoir systems are derived via an approximate dynamic programming approach using a policy iteration algorithm. The algorithm is based on an off-line learning process in which policies are evaluated for a number of stochastic inflow scenarios by constructing approximations of their value functions, and the resulting value functions are used iteratively to design new, improved policies. In the mid-term planning phase, inflow scenarios are generated with a periodic autoregressive model that is calibrated against historical inflow data, and the policy iteration algorithm leads to a cyclostationary operating policy. In the short-term planning phase, the mid-term value function is used to calculate the value of a policy at the end of the short-term operating horizon, and synthetic inflow scenarios are generated by perturbing streamflow forecasts with Gaussian noise, following Zhao et al. (Water Resour. Res., 48, W01540, 2012). The variance of the noise is assumed to increase linearly over time and converges to the local variance of the historical time series. A case study is

  3. Optimization of approximate decision rules relative to number of misclassifications: Comparison of greedy and dynamic programming approaches

    KAUST Repository

    Amin, Talha

    2013-01-01

    In the paper, we present a comparison of dynamic programming and greedy approaches for construction and optimization of approximate decision rules relative to the number of misclassifications. We use an uncertainty measure that is a difference between the number of rows in a decision table T and the number of rows with the most common decision for T. For a nonnegative real number γ, we consider γ-decision rules that localize rows in subtables of T with uncertainty at most γ. Experimental results with decision tables from the UCI Machine Learning Repository are also presented. © 2013 Springer-Verlag.

  4. Approximate Dynamic Programming for Fast Denoising of aCGH Data

    CERN Document Server

    Miller, Gary L; Schwartz, Russell; Tsourakakis, Charalampos E

    2010-01-01

    DNA sequence copy number is the number of copies of DNA at a region of a genome. Identifying genomic regions whose DNA copy number deviates from the normal is a crucial task in understanding cancer evolution. Array-based comparative genomic hybridization (aCGH) is a high-throughput technique for identifying DNA gain or loss. Due to the high level of noise in microarray data, however, interpretation of aCGH output is a difficult and error-prone task. In this paper, we adopt a recent formulation of the denoising aCGH data problem as a regularized least squares problem and propose an approximation algorithm within $\\epsilon$ additive error, where \\epsilon is an arbitrarily small positive constant. Specifically, we show that for n probes, we can approximate the optimal value of our function within additive \\epsilon with an algorithm that runs in $\\tilde{O}(n^{1.5} \\log{(\\frac{U}{\\epsilon}))}$ time, where U is the maximum value over the regularization term and the probes. The basis of our algorithm is the definiti...

  5. Grid integration and smart grid implementation of emerging technologies in electric power systems through approximate dynamic programming

    Science.gov (United States)

    Xiao, Jingjie

    A key hurdle for implementing real-time pricing of electricity is a lack of consumers' responses. Solutions to overcome the hurdle include the energy management system that automatically optimizes household appliance usage such as plug-in hybrid electric vehicle charging (and discharging with vehicle-to-grid) via a two-way communication with the grid. Real-time pricing, combined with household automation devices, has a potential to accommodate an increasing penetration of plug-in hybrid electric vehicles. In addition, the intelligent energy controller on the consumer-side can help increase the utilization rate of the intermittent renewable resource, as the demand can be managed to match the output profile of renewables, thus making the intermittent resource such as wind and solar more economically competitive in the long run. One of the main goals of this dissertation is to present how real-time retail pricing, aided by control automation devices, can be integrated into the wholesale electricity market under various uncertainties through approximate dynamic programming. What distinguishes this study from the existing work in the literature is that whole- sale electricity prices are endogenously determined as we solve a system operator's economic dispatch problem on an hourly basis over the entire optimization horizon. This modeling and algorithm framework will allow a feedback loop between electricity prices and electricity consumption to be fully captured. While we are interested in a near-optimal solution using approximate dynamic programming; deterministic linear programming benchmarks are use to demonstrate the quality of our solutions. The other goal of the dissertation is to use this framework to provide numerical evidence to the debate on whether real-time pricing is superior than the current flat rate structure in terms of both economic and environmental impacts. For this purpose, the modeling and algorithm framework is tested on a large-scale test case

  6. BWM*: A Novel, Provable, Ensemble-based Dynamic Programming Algorithm for Sparse Approximations of Computational Protein Design.

    Science.gov (United States)

    Jou, Jonathan D; Jain, Swati; Georgiev, Ivelin S; Donald, Bruce R

    2016-06-01

    Sparse energy functions that ignore long range interactions between residue pairs are frequently used by protein design algorithms to reduce computational cost. Current dynamic programming algorithms that fully exploit the optimal substructure produced by these energy functions only compute the GMEC. This disproportionately favors the sequence of a single, static conformation and overlooks better binding sequences with multiple low-energy conformations. Provable, ensemble-based algorithms such as A* avoid this problem, but A* cannot guarantee better performance than exhaustive enumeration. We propose a novel, provable, dynamic programming algorithm called Branch-Width Minimization* (BWM*) to enumerate a gap-free ensemble of conformations in order of increasing energy. Given a branch-decomposition of branch-width w for an n-residue protein design with at most q discrete side-chain conformations per residue, BWM* returns the sparse GMEC in O([Formula: see text]) time and enumerates each additional conformation in merely O([Formula: see text]) time. We define a new measure, Total Effective Search Space (TESS), which can be computed efficiently a priori before BWM* or A* is run. We ran BWM* on 67 protein design problems and found that TESS discriminated between BWM*-efficient and A*-efficient cases with 100% accuracy. As predicted by TESS and validated experimentally, BWM* outperforms A* in 73% of the cases and computes the full ensemble or a close approximation faster than A*, enumerating each additional conformation in milliseconds. Unlike A*, the performance of BWM* can be predicted in polynomial time before running the algorithm, which gives protein designers the power to choose the most efficient algorithm for their particular design problem. PMID:26744898

  7. Using approximate dynamic programming for estimating the revenues of a hydrogen-based high-capacity storage device

    OpenAIRE

    François-Lavet, Vincent; Fonteneau, Raphaël; Ernst, Damien

    2014-01-01

    This paper proposes a methodology to estimate the maximum revenue that can be generated by a company that operates a high-capacity storage device to buy or sell electricity on the day-ahead electricity market. The methodology exploits the Dynamic Programming (DP) principle and is specified for hydrogen-based storage devices that use electrolysis to produce hydrogen and fuel cells to generate electricity from hydrogen. Experimental results are generated using historical data of energy prices o...

  8. Reduction of Linear Programming to Linear Approximation

    OpenAIRE

    Vaserstein, Leonid N.

    2006-01-01

    It is well known that every Chebyshev linear approximation problem can be reduced to a linear program. In this paper we show that conversely every linear program can be reduced to a Chebyshev linear approximation problem.

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

    Science.gov (United States)

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

    2015-08-01

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

  10. Proving acceptability properties of relaxed nondeterministic approximate programs

    OpenAIRE

    Carbin, Michael James; Kim, Deokhwan; Misailovic, Sasa; Rinard, Martin C

    2012-01-01

    Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dynamic knobs [16], synchronization elimination [20, 32], approximate function memoization [11],and approximate data types [34] produce programs that can execute at a variety of points in an underlying performance versus accuracy tradeoff space. These transformed programs have the ability to trade accuracy of their res...

  11. Dynamical equations and approximation methods

    International Nuclear Information System (INIS)

    The integral equations approach to the three-body problem, decisively stimulated by Faddeev's formulation, provides the most powerful tool for studying the internal structure of this system. An essential step towards a detailed understanding of composite particle dynamics has been done in this way. The search for adequate extensions to the general N-body situation therefore represented, and still represents a natural challenge. For various reasons this transition is non-trivial and non-unique. Emphasizing different aspects of the three-body theory, different generalizations have been found. In particular, it was the concept of connectedness of the (iterated) integral kernel which allows for an arbitrary number of formulations, many of them being presumably only mathematically correct, but physically rather unsatisfactory. Therefore, the present status of the N-body theory is reviewed in a less technical way. Starting from the basic, physically convincing definitions of scattering states, the defining equations are replaced by more appropriate matrix relations. This is done in a reversible way, thus preserving in every step the original structure and information. In order to be as close as possible to the basic definitions, all relations are first derived for scattering states or half-on-shell transition amplitudes. The ambiguity in going over to corresponding operator identities (fully off-shell equations) is demonstrated. (Auth.)

  12. Dynamical Vertex Approximation for Nanoscopic Systems

    International Nuclear Information System (INIS)

    Full text: We present model calculations for nanoscopic systems including Hubbard-like Coulomb repulsion and double exchange interactions with localized, classical spins. We compare the results of the recently introduced nanoscopic version of the dynamical vertex approximation at dynamical mean field level against exact diagonalization for a Benzene-like ring, where the latter is doable. This comparison allows us to investigate the reliability of the approximation. It shows that, already at the simplest approximation level (i.e. including only local correlations) the results are very accurate in a rather wide range of parameters. Since the computational effort is highly reduced, it is suitable for studying more complex systems. (author)

  13. Nonlinear Programming Method for Dynamic Programming

    OpenAIRE

    Yongyang Cai; Judd, Kenneth L; Lontzek, Thomas S.; Valentina Michelangeli; Che-Lin Su

    2013-01-01

    A nonlinear programming formulation is introduced to solve infinite horizon dynamic programming problems. This extends the linear approach to dynamic programming by using ideas from approximation theory to avoid inefficient discretization. Our numerical results show that this nonlinear programming method is efficient and accurate.

  14. Dynamic Approximate Vertex Cover and Maximum Matching

    OpenAIRE

    Onak, Krzysztof; Rubinfeld, Ronitt

    2010-01-01

    We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge insertion. We give the first randomized data structure that simultaneously achieves a constant approximation factor and handles a sequence of k updates in k. polylog(n) time. Previous data structures require a polynomial amount of computation per update. The starting point of our construction is a distributed algorit...

  15. An Algorithm of Dynamic Vehicle Scheduling Problem Based on Approximate Dynamic Programming%基于近似动态规划的动态车辆调度算法

    Institute of Scientific and Technical Information of China (English)

    李雪; 聂兰顺; 齐文艳; 战德臣

    2015-01-01

    针对物流配送服务业中,车辆调度问题日渐呈现任务规模大,车辆类型多、属性多,调度实时性要求越来越高等特点,提出了基于近似动态规划的动态车辆调度算法。根据当前的任务需求与车辆状态以及相应的约束条件作出相应的调度,并且对一些样本进行训练,得到了一个近似价值函数。通过该价值函数,即可对任务迅速作出相应的决策。仿真模拟实验证明了该算法的有效性和优越性。%Vehicle scheduling in service industry of logistics distribution was presenting features including the tasks tended to be of large scale,vehicles were multi-type and had multiple attributes as well as high demands for real-time scheduling.To solve these problems,this paper proposed a dy-namic vehicle scheduling algorithm based on the approximate dynamic programming.An approximate value function was obtained through training of some samples,and according to mission require-ments,vehicle state and conditions,and quick scheduling decisions could be made with the value func-tion.The simulation test has proved the correctness and effectiveness of the algorithm.

  16. Escape dynamics: a continuous-time approximation

    Czech Academy of Sciences Publication Activity Database

    Kolyuzhnov, D.; Bogomolova, A.; Slobodyan, Sergey

    2014-01-01

    Roč. 38, January (2014), s. 161-183. ISSN 0165-1889 Institutional support: RVO:67985998 Keywords : constant gain adaptive learning * escape dynamics * recursive least squares Subject RIV: AH - Economics Impact factor: 1.018, year: 2014

  17. Escape dynamics: a continuous-time approximation

    Czech Academy of Sciences Publication Activity Database

    Kolyuzhnov, Dmitri; Bogomolova, Anna; Slobodyan, S.

    2014-01-01

    Roč. 38, January (2014), s. 161-183. ISSN 0165-1889 R&D Projects: GA ČR(CZ) GBP402/12/G097 Institutional support: PRVOUK-P23 Keywords : constant gain adaptive learning * escape dynamics * recursive least squares Subject RIV: AH - Economics Impact factor: 1.018, year: 2014

  18. STOVL propulsion system volume dynamics approximations

    Science.gov (United States)

    Drummond, Colin K.

    1989-01-01

    Two approaches to modeling turbofan engine component volume dynamics are explored and compared with a view toward application to real-time simulation of short take-off vertical landing (STOVL) aircraft propulsion systems. The first (and most popular) approach considers only heat and mass balances; the second approach includes a momentum balance and substitutes the heat equation with a complete energy balance. Results for a practical test case are presented and discussed.

  19. Phase field approximation of dynamic brittle fracture

    Science.gov (United States)

    Schlüter, Alexander; Willenbücher, Adrian; Kuhn, Charlotte; Müller, Ralf

    2014-11-01

    Numerical methods that are able to predict the failure of technical structures due to fracture are important in many engineering applications. One of these approaches, the so-called phase field method, represents cracks by means of an additional continuous field variable. This strategy avoids some of the main drawbacks of a sharp interface description of cracks. For example, it is not necessary to track or model crack faces explicitly, which allows a simple algorithmic treatment. The phase field model for brittle fracture presented in Kuhn and Müller (Eng Fract Mech 77(18):3625-3634, 2010) assumes quasi-static loading conditions. However dynamic effects have a great impact on the crack growth in many practical applications. Therefore this investigation presents an extension of the quasi-static phase field model for fracture from Kuhn and Müller (Eng Fract Mech 77(18):3625-3634, 2010) to the dynamic case. First of all Hamilton's principle is applied to derive a coupled set of Euler-Lagrange equations that govern the mechanical behaviour of the body as well as the crack growth. Subsequently the model is implemented in a finite element scheme which allows to solve several test problems numerically. The numerical examples illustrate the capabilities of the developed approach to dynamic fracture in brittle materials.

  20. Approximating Sparse Covering Integer Programs Online

    CERN Document Server

    Gupta, Anupam

    2012-01-01

    A covering integer program (CIP) is a mathematical program of the form: min {c^T x : Ax >= 1, 0 <= x <= u, x integer}, where A is an m x n matrix, and c and u are n-dimensional vectors, all having non-negative entries. In the online setting, the constraints (i.e., the rows of the constraint matrix A) arrive over time, and the algorithm can only increase the coordinates of vector x to maintain feasibility. As an intermediate step, we consider solving the covering linear program (CLP) online, where the integrality requirement on x is dropped. Our main results are (a) an O(log k)-competitive online algorithm for solving the CLP, and (b) an O(log k log L)-competitive randomized online algorithm for solving the CIP. Here k<=n and L<=m respectively denote the maximum number of non-zero entries in any row and column of the constraint matrix A. By a result of Feige and Korman, this is the best possible for polynomial-time online algorithms, even in the special case of set cover.

  1. Real space Dynamical Super Cell Approximation for interacting disordered systems

    OpenAIRE

    Moradian, Rostam

    2004-01-01

    Effective medium super-cell approximation method which is introduced for disordered systems is extended to a general case of interacting disordered systems. We found that the dynamical cluster approximation (DCA) and also the non local coherent potential approximation (NLCPA) are two simple case of this technique. Whole equations of this formalism derived by using the effective medium theory in real space.

  2. Approximate Augmented Lagrangian Functions and Nonlinear Semidefinite Programs

    Institute of Scientific and Technical Information of China (English)

    X. X. HUANG; K. L. TEO; X. Q. YANG

    2006-01-01

    In this paper, an approximate augmented Lagrangian function for nonlinear semidefinite programs is introduced. Some basic properties of the approximate augmented Lagrange function such as monotonicity and convexity are discussed. Necessary and sufficient conditions for approximate strong duality results are derived. Conditions for an approximate exact penalty representation in the framework of augmented Lagrangian are given. Under certain conditions, it is shown that any limit point of a sequence of stationary points of approximate augmented Lagrangian problems is a KKT point of the original semidefinite program and that a sequence of optimal solutions to augmented Lagrangian problems converges to a solution of the original semidefinite program.

  3. Multistage Stochastic Programming Problems; Stability and Approximation

    Czech Academy of Sciences Publication Activity Database

    Kaňková, Vlasta

    Berlin: Springer, 2007 - (Waldmann, K.; Stocker, U.), s. 595-600 ISBN 978-3-540-69994-1. [Annual International Conference of the German Operations Research Society (GOR). Karlsruhe (DE), 06.09.2006-08.09.2006] R&D Projects: GA ČR GA402/04/1294; GA ČR GA402/05/0115; GA ČR(CZ) GA402/06/1417 Institutional research plan: CEZ:AV0Z10750506 Keywords : Multistage Sstochastic programming problems * individal probability constraints * autoregressive (generally) nonlinear sequence Subject RIV: BB - Applied Statistics, Operational Research

  4. Optimal Piecewise-Linear Approximation of the Quadratic Chaotic Dynamics

    Directory of Open Access Journals (Sweden)

    J. Petrzela

    2012-04-01

    Full Text Available This paper shows the influence of piecewise-linear approximation on the global dynamics associated with autonomous third-order dynamical systems with the quadratic vector fields. The novel method for optimal nonlinear function approximation preserving the system behavior is proposed and experimentally verified. This approach is based on the calculation of the state attractor metric dimension inside a stochastic optimization routine. The approximated systems are compared to the original by means of the numerical integration. Real electronic circuits representing individual dynamical systems are derived using classical as well as integrator-based synthesis and verified by time-domain analysis in Orcad Pspice simulator. The universality of the proposed method is briefly discussed, especially from the viewpoint of the higher-order dynamical systems. Future topics and perspectives are also provided

  5. A Linear-Programming Approximation of AC Power Flows

    OpenAIRE

    Coffrin, Carleton; Van Hentenryck, Pascal

    2012-01-01

    Linear active-power-only DC power flow approximations are pervasive in the planning and control of power systems. However, these approximations fail to capture reactive power and voltage magnitudes, both of which are necessary in many applications to ensure voltage stability and AC power flow feasibility. This paper proposes linear-programming models (the LPAC models) that incorporate reactive power and voltage magnitudes in a linear power flow approximation. The LPAC models are built on a co...

  6. Approximate dynamic programming and aerial refueling

    OpenAIRE

    Panos, Dennis C.

    2007-01-01

    Aerial refueling is an integral part of the United States military's ability to strike targets around the world with an overwhelming and continuous projection of force. However, with an aging fleet of refueling tankers and an indefinite replacement schedule the optimization of tanker usage is vital to national security. Optimizing tanker and receiver refueling operations is a complicated endeavor as it can involve over a thousand of missions during a 24 hour period, as in Operation Iraqi Free...

  7. Approximating the maximum weight clique using replicator dynamics.

    Science.gov (United States)

    Bomze, I R; Pelillo, M; Stix, V

    2000-01-01

    Given an undirected graph with weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having the largest total weight. This is a generalization of the classical problem of finding the maximum cardinality clique of an unweighted graph, which arises as a special case of the MWCP when all the weights associated to the vertices are equal. The problem is known to be NP-hard for arbitrary graphs and, according to recent theoretical results, so is the problem of approximating it within a constant factor. Although there has recently been much interest around neural-network algorithms for the unweighted maximum clique problem, no effort has been directed so far toward its weighted counterpart. In this paper, we present a parallel, distributed heuristic for approximating the MWCP based on dynamics principles developed and studied in various branches of mathematical biology. The proposed framework centers around a recently introduced continuous characterization of the MWCP which generalizes an earlier remarkable result by Motzkin and Straus. This allows us to formulate the MWCP (a purely combinatorial problem) in terms of a continuous quadratic programming problem. One drawback associated with this formulation, however, is the presence of "spurious" solutions, and we present characterizations of these solutions. To avoid them we introduce a new regularized continuous formulation of the MWCP inspired by previous works on the unweighted problem, and show how this approach completely solves the problem. The continuous formulation of the MWCP naturally maps onto a parallel, distributed computational network whose dynamical behavior is governed by the so-called replicator equations. These are dynamical systems introduced in evolutionary game theory and population genetics to model evolutionary processes on a macroscopic scale.We present theoretical results which guarantee that the solutions provided by

  8. Approximate Separability for Weak Interaction in Dynamic Systems

    OpenAIRE

    Pfeffer, Avi

    2012-01-01

    One approach to monitoring a dynamic system relies on decomposition of the system into weakly interacting subsystems. An earlier paper introduced a notion of weak interaction called separability, and showed that it leads to exact propagation of marginals for prediction. This paper addresses two questions left open by the earlier paper: can we define a notion of approximate separability that occurs naturally in practice, and do separability and approximate separability lead to accurate monitor...

  9. Some approximations in the linear dynamic equations of thin cylinders

    Science.gov (United States)

    El-Raheb, M.; Babcock, C. D., Jr.

    1981-01-01

    Theoretical analysis is performed on the linear dynamic equations of thin cylindrical shells to find the error committed by making the Donnell assumption and the neglect of in-plane inertia. At first, the effect of these approximations is studied on a shell with classical simply supported boundary condition. The same approximations are then investigated for other boundary conditions from a consistent approximate solution of the eigenvalue problem. The Donnell assumption is valid at frequencies high compared with the ring frequencies, for finite length thin shells. The error in the eigenfrequencies from omitting tangential inertia is appreciable for modes with large circumferential and axial wavelengths, independent of shell thickness and boundary conditions.

  10. The DYNAMIC program package

    International Nuclear Information System (INIS)

    The most important constituents and capacities of the practice-oriented program package DYNAMIC are explained. The versatility of the package in dealing with problems of structural dynamics is shown by examples (seismic qualification of SF6 switchgear equipment, turbine building of a BWR). The examples explain applications in the fields of construction engineering and electromechanics. (orig./HP)

  11. Approximate bayesian parameter inference for dynamical systems in systems biology

    International Nuclear Information System (INIS)

    This paper proposes to use approximate instead of exact stochastic simulation algorithms for approximate Bayesian parameter inference of dynamical systems in systems biology. It first presents the mathematical framework for the description of systems biology models, especially from the aspect of a stochastic formulation as opposed to deterministic model formulations based on the law of mass action. In contrast to maximum likelihood methods for parameter inference, approximate inference method- share presented which are based on sampling parameters from a known prior probability distribution, which gradually evolves toward a posterior distribution, through the comparison of simulated data from the model to a given data set of measurements. The paper then discusses the simulation process, where an over- view is given of the different exact and approximate methods for stochastic simulation and their improvements that we propose. The exact and approximate simulators are implemented and used within approximate Bayesian parameter inference methods. Our evaluation of these methods on two tasks of parameter estimation in two different models shows that equally good results are obtained much faster when using approximate simulation as compared to using exact simulation. (Author)

  12. Efficient Optimization of Dynamic Systems Using Pade Approximants

    DEFF Research Database (Denmark)

    Jensen, Jakob Søndergaard

    2006-01-01

    A numerical procedure is suggested for efficient optimization of large dynamic systems. The method is based on Pad´e approximants that give a remarkably accurate approximation of the vibration response for large ranges of frequencies at low computational cost. Analytical expressions for the design...... sensitivities are derived by an adjoint method making the method well suited for large number of design variables. The method is illustrated by a topology optimization example for an elastic body subjected to a time-harmonic load. The distribution of two material phases is optimized in order to reduce the...

  13. Dynamic programming using radial basis functions

    OpenAIRE

    Junge, Oliver; Schreiber, Alex

    2014-01-01

    We propose a discretization of the optimality principle in dynamic programming based on radial basis functions and Shepard's moving least squares approximation method. We prove convergence of the approximate optimal value function to the true one and present several numerical experiments.

  14. Wave packet dynamics in the optimal superadiabatic approximation

    CERN Document Server

    Betz, Volker; Manthe, Uwe

    2016-01-01

    We explain the concept of superadiabatic approximations and show how in the context of the Born- Oppenheimer approximation they lead to an explicit formula that can be used to predict transitions at avoided crossings. Based on this formula, we present a simple method for computing wave packet dynamics across avoided crossings. Only knowledge of the adiabatic electronic energy levels near the avoided crossing is required for the computation. In particular, this means that no diabatization procedure is necessary, the adiabatic energy levels can be computed on the fly, and they only need to be computed to higher accuracy when an avoided crossing is detected. We test the quality of our method on the paradigmatic example of photo-dissociation of NaI, finding very good agreement with results of exact wave packet calculations.

  15. Dynamical Mean Field Approximation Applied to Quantum Field Theory

    CERN Document Server

    Akerlund, Oscar; Georges, Antoine; Werner, Philipp

    2013-01-01

    We apply the Dynamical Mean Field (DMFT) approximation to the real, scalar phi^4 quantum field theory. By comparing to lattice Monte Carlo calculations, perturbation theory and standard mean field theory, we test the quality of the approximation in two, three, four and five dimensions. The quantities considered in these tests are the critical coupling for the transition to the ordered phase and the associated critical exponents nu and beta. We also map out the phase diagram in four dimensions. In two and three dimensions, DMFT incorrectly predicts a first order phase transition for all bare quartic couplings, which is problematic, because the second order nature of the phase transition of lattice phi^4-theory is crucial for taking the continuum limit. Nevertheless, by extrapolating the behaviour away from the phase transition, one can obtain critical couplings and critical exponents. They differ from those of mean field theory and are much closer to the correct values. In four dimensions the transition is sec...

  16. Approximate dynamic fault tree calculations for modelling water supply risks

    International Nuclear Information System (INIS)

    Traditional fault tree analysis is not always sufficient when analysing complex systems. To overcome the limitations dynamic fault tree (DFT) analysis is suggested in the literature as well as different approaches for how to solve DFTs. For added value in fault tree analysis, approximate DFT calculations based on a Markovian approach are presented and evaluated here. The approximate DFT calculations are performed using standard Monte Carlo simulations and do not require simulations of the full Markov models, which simplifies model building and in particular calculations. It is shown how to extend the calculations of the traditional OR- and AND-gates, so that information is available on the failure probability, the failure rate and the mean downtime at all levels in the fault tree. Two additional logic gates are presented that make it possible to model a system's ability to compensate for failures. This work was initiated to enable correct analyses of water supply risks. Drinking water systems are typically complex with an inherent ability to compensate for failures that is not easily modelled using traditional logic gates. The approximate DFT calculations are compared to results from simulations of the corresponding Markov models for three water supply examples. For the traditional OR- and AND-gates, and one gate modelling compensation, the errors in the results are small. For the other gate modelling compensation, the error increases with the number of compensating components. The errors are, however, in most cases acceptable with respect to uncertainties in input data. The approximate DFT calculations improve the capabilities of fault tree analysis of drinking water systems since they provide additional and important information and are simple and practically applicable.

  17. Dynamic Programming Strikes Back

    OpenAIRE

    Moerkotte, Guido; Neumann, Thomas

    2008-01-01

    Two highly efficient algorithms are known for optimally ordering joins while avoiding cross products: DPccp, which is based on dynamic programming, and Top-Down Partition Search, based on memoization. Both have two severe limitations: They handle only (1) simple (binary) join predicates and (2) inner joins. However, real queries may contain complex join predicates, involving more than two relations, and outer joins as well as other non-inner joins. Taking the mos...

  18. Approximations for inclusion of rotor lag dynamics in helicopter flight dynamics models

    Science.gov (United States)

    Mckillip, Robert, Jr.; Curtiss, Howard C., Jr.

    1991-01-01

    Approximate forms are suggested for augmenting linear rotor/body response models to include rotor lag dynamics. Use of an analytically linearized rotor/body model has shown that the primary effect comes from the additional angular rate contributions of the lag inertial response. Addition of lag dynamics may be made assuming these dynamics are represented by an isolated rotor with no shaft motion. Implications of such an approximation are indicated through comparison with flight test data and sensitivity of stability levels with body rate feedback.

  19. Exact and approximate probabilistic symbolic execution for nondeterministic programs

    DEFF Research Database (Denmark)

    Luckow, Kasper Søe; Păsăreanu, Corina S.; Dwyer, Matthew B.; Filieri, Antonio; Visser, Willem

    Probabilistic software analysis seeks to quantify the likelihood of reaching a target event under uncertain environments. Recent approaches compute probabilities of execution paths using symbolic execution, but do not support nondeterminism. Nondeterminism arises naturally when no suitable...... probabilistic model can capture a program behavior, e.g., for multithreading or distributed systems. In this work, we propose a technique, based on symbolic execution, to synthesize schedulers that resolve nondeterminism to maximize the probability of reaching a target event. To scale to large systems, we also...... introduce approximate algorithms to search for good schedulers, speeding up established random sampling and reinforcement learning results through the quantification of path probabilities based on symbolic execution. We implemented the techniques in Symbolic PathFinder and evaluated them on nondeterministic...

  20. Approximate labeling via graph cuts based on linear programming.

    Science.gov (United States)

    Komodakis, Nikos; Tziritas, Georgios

    2007-08-01

    A new framework is presented for both understanding and developing graph-cut-based combinatorial algorithms suitable for the approximate optimization of a very wide class of Markov Random Fields (MRFs) that are frequently encountered in computer vision. The proposed framework utilizes tools from the duality theory of linear programming in order to provide an alternative and more general view of state-of-the-art techniques like the \\alpha-expansion algorithm, which is included merely as a special case. Moreover, contrary to \\alpha-expansion, the derived algorithms generate solutions with guaranteed optimality properties for a much wider class of problems, for example, even for MRFs with nonmetric potentials. In addition, they are capable of providing per-instance suboptimality bounds in all occasions, including discrete MRFs with an arbitrary potential function. These bounds prove to be very tight in practice (that is, very close to 1), which means that the resulting solutions are almost optimal. Our algorithms' effectiveness is demonstrated by presenting experimental results on a variety of low-level vision tasks, such as stereo matching, image restoration, image completion, and optical flow estimation, as well as on synthetic problems. PMID:17568146

  1. Envelope induced ionization dynamics beyond the dipole approximation

    CERN Document Server

    Simonsen, Aleksander Skjerlie; Førre, Morten; Lindroth, Eva; Selstø, Sølve

    2015-01-01

    When atoms and molecules are ionized by laser pulses of finite duration and increasingly high intensities, the validity of the much used dipole approximation, in which the spatial dependence and magnetic component of the external field are neglected, eventually breaks down. We report that when going beyond the dipole approximation for the description of atoms exposed to ultraviolet light, the spatial dependence of the pulse shape, the envelope, provides the dominant correction, while the spatial dependence of the carrier may safely be neglected in the general case. We present a first order beyond-dipole correction to the Hamiltonian which accounts exclusively for effects stemming from the carrier-envelope of the pulse. This much simpler form of the correction is further discussed in connection with various descriptions of the light-matter interaction. We demonstrate by ab initio calculations that this approximation, which we will refer to as the envelope approximation, reproduces the full interaction beyond t...

  2. Approximate supernova remnant dynamics with cosmic ray production

    International Nuclear Information System (INIS)

    Supernova explosions are the most violent and energetic events in the galaxy and have long been considered probable sources of cosmic rays. Recent shock acceleration models treating the cosmic rays (CR's) as test particles nb a prescribed supernova remnant (SNR) evolution, indeed indicate an approximate power law momentum distribution f sub source (p) approximation p(-a) for the particles ultimately injected into the interstellar medium (ISM). This spectrum extends almost to the momentum p = 1 million GeV/c, where the break in the observed spectrum occurs. The calculated power law index approximately less than 4.2 agrees with that inferred for the galactic CR sources. The absolute CR intensity can however not be well determined in such a test particle approximation

  3. Dynamic Spatial Approximation Trees with clusters for secondary memory

    OpenAIRE

    Britos, Luís; Printista, Alicia Marcela; Reyes, Nora Susana

    2010-01-01

    Metric space searching is an emerging technique to address the problem of e cient similarity searching in many applications, including multimedia databases and other repositories handling complex objects. Although promising, the metric space approach is still immature in several aspects that are well established in traditional databases. In particular, most indexing schemes are not dynamic. From the few dynamic indexes, even fewer work well in secondary memory. That is, most of them need the ...

  4. Taylor Series Approximation to Solve Neutrosophic Multiobjective Programming Problem

    Directory of Open Access Journals (Sweden)

    Ibrahim M. Hezam

    2015-12-01

    Full Text Available In this paper, Taylor series is used to solve neutrosophic multi-objective programming problem (NMOPP. In the proposed approach, the truth membership, Indeterminacy membership, falsity membership functions associated with each objective of multi-objective programming problems are transformed into a single objective linear programming problem by using a first order Taylor polynomial series. Finally, to illustrate the efficiency of the proposed method, a numerical experiment for supplier selection is given as an application of Taylor series method for solving neutrosophic multi-objective programming problem at end of this paper.

  5. Dynamic Programming Foundations and Principles

    CERN Document Server

    Sniedovich, Moshe

    2010-01-01

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

  6. Introduction to stochastic dynamic programming

    CERN Document Server

    Ross, Sheldon M; Lukacs, E

    1983-01-01

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

  7. Strong semiclassical approximation of Wigner functions for the Hartree dynamics

    KAUST Repository

    Athanassoulis, Agissilaos

    2011-01-01

    We consider the Wigner equation corresponding to a nonlinear Schrödinger evolution of the Hartree type in the semiclassical limit h → 0. Under appropriate assumptions on the initial data and the interaction potential, we show that the Wigner function is close in L 2 to its weak limit, the solution of the corresponding Vlasov equation. The strong approximation allows the construction of semiclassical operator-valued observables, approximating their quantum counterparts in Hilbert-Schmidt topology. The proof makes use of a pointwise-positivity manipulation, which seems necessary in working with the L 2 norm and the precise form of the nonlinearity. We employ the Husimi function as a pivot between the classical probability density and the Wigner function, which - as it is well known - is not pointwise positive in general.

  8. Approximate analysis of dynamic soil-structure interaction

    OpenAIRE

    Lanzi, Armando

    2011-01-01

    This study focuses on the approximate analysis of soil- structure interaction problems, specifically on the application of classical modal analysis for coupled horizontal-rocking vibrations of plane structures resting on a linear elastic soil. Although the classical modal approach provides a non-rigorous solution, it is particularly meaningful as it offers physical insight into the nature of soil-structure interaction effects. After validating the numerical algorithm by comparison with earlie...

  9. Approximate Solutions of Interactive Dynamic Influence Diagrams Using Model Clustering

    DEFF Research Database (Denmark)

    Zeng, Yifeng; Doshi, Prashant; Qiongyu, Cheng

    2007-01-01

    Interactive dynamic influence diagrams (I-DIDs) offer a transparent and semantically clear representation for the sequential decision-making problem over multiple time steps in the presence of other interacting agents. Solving I-DIDs exactly involves knowing the solutions of possible models of the...

  10. Secure Dynamic Program Repartitioning

    DEFF Research Database (Denmark)

    Hansen, Rene Rydhoff; Probst, Christian

    2005-01-01

    Secure program partitioning has been introduced as a language-based technique to allow the distribution of data and computation across mutualy untrusted hosts, while at the same time guaranteeing the protection of confidential data. Programs that have been annotated with security types are...

  11. Approximate Bayesian Image Interpretation using Generative Probabilistic Graphics Programs

    OpenAIRE

    Mansinghka, Vikash K.; Kulkarni, Tejas D.; Perov, Yura N.; Tenenbaum, Joshua B.

    2013-01-01

    The idea of computer vision as the Bayesian inverse problem to computer graphics has a long history and an appealing elegance, but it has proved difficult to directly implement. Instead, most vision tasks are approached via complex bottom-up processing pipelines. Here we show that it is possible to write short, simple probabilistic graphics programs that define flexible generative models and to automatically invert them to interpret real-world images. Generative probabilistic graphics program...

  12. Dynamic Textures Modelling with Temporal Mixing Coefficients Approximation

    Czech Academy of Sciences Publication Activity Database

    Havlíček, Michal

    Praha : ČVUT, 2013, s. 41-48. ISBN 978-80-01-05379-9. [Doktorandské dny 2013 FJFI oboru Matematické inženýrství. Praha (CZ), 15.11.2013] Institutional support: RVO:67985556 Keywords : dynamic texture * texture synthesis Subject RIV: BD - Theory of Information http://kmwww.fjfi.cvut.cz/ddny/historie/13-sbornik.pdf

  13. Lattice dynamics of rhenium trioxide from the quasiharmonic approximation

    OpenAIRE

    Wdowik, U.D.; Parlinski, K.; Chatterji, T.; Rols, S.; Schober, H.

    2010-01-01

    The quasiharmonic theory is applied to study the lattice dynamics and thermal properties of rhenium trioxide, a material exhibiting the negative thermal-expansion phenomenon. Phonons are calculated at several external pressures. The pressure dependence of the M, R, and zone-center phonon modes is analyzed. Relying on the Gruneisen formalism an influence of temperature on the M phonon mode is investigated. The calculated free energy of the system provides predictions for the temperature depend...

  14. Evolutionary Algorithms and Dynamic Programming

    OpenAIRE

    Doerr, Benjamin; Eremeev, Anton; Neumann, Frank; Theile, Madeleine; Thyssen, Christian

    2013-01-01

    Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled by evolutionary algorithms that use a representation which enables them to construct solutions in a dynamic programming fashion. We take a general approach and relate the construction of such algorithms to the development of algorithms using dynamic programming techniques. Thereby, we give general guidelines on how ...

  15. Modelling Opinion Dynamics: Theoretical analysis and continuous approximation

    CERN Document Server

    Pinasco, Juan Pablo; Balenzuela, Pablo

    2016-01-01

    Frequently we revise our first opinions after talking over with other individuals because we get convinced. Argumentation is a verbal and social process aimed at convincing. It includes conversation and persuasion. In this case, the agreement is reached because the new arguments are incorporated. In this paper we deal with a simple model of opinion formation with such persuasion dynamics, and we find the exact analytical solutions for both, long and short range interactions. A novel theoretical approach has been used in order to solve the master equations of the model with non-local kernels. Simulation results demonstrate an excellent agreement with results obtained by the theoretical estimation.

  16. On the point-source approximation of earthquake dynamics

    Directory of Open Access Journals (Sweden)

    Andrea Bizzarri

    2014-06-01

    Full Text Available The focus on the present study is on the point-source approximation of a seismic source. First, we compare the synthetic motions on the free surface resulting from different analytical evolutions of the seismic source (the Gabor signal (G, the Bouchon ramp (B, the Cotton and Campillo ramp (CC, the Yoffe function (Y and the Liu and Archuleta function (LA. Our numerical experiments indicate that the CC and the Y functions produce synthetics with larger oscillations and correspondingly they have a higher frequency content. Moreover, the CC and the Y functions tend to produce higher peaks in the ground velocity (roughly of a factor of two. We have also found that the falloff at high frequencies is quite different: it roughly follows ω−2 in the case of G and LA functions, it decays more faster than ω−2 for the B function, while it is slow than ω−1 for both the CC and the Y solutions. Then we perform a comparison of seismic waves resulting from 3-D extended ruptures (both supershear and subshear obeying to different governing laws against those from a single point-source having the same features. It is shown that the point-source models tend to overestimate the ground motions and that they completely miss the Mach fronts emerging from the supershear transition process. When we compare the extended fault solutions against a multiple point-sources model the agreement becomes more significant, although relevant discrepancies still persist. Our results confirm that, and more importantly quantify how, the point-source approximation is unable to adequately describe the radiation emitted during a real world earthquake, even in the most idealized case of planar fault with homogeneous properties and embedded in a homogeneous, perfectly elastic medium.

  17. Wave packet dynamics in the optimal superadiabatic approximation

    Science.gov (United States)

    Betz, V.; Goddard, B. D.; Manthe, U.

    2016-06-01

    We explain the concept of superadiabatic representations and show how in the context of electronically non-adiabatic transitions they lead to an explicit formula that can be used to predict transitions at avoided crossings. Based on this formula, we present a simple method for computing wave packet dynamics across avoided crossings. Only knowledge of the adiabatic potential energy surfaces near the avoided crossing is required for the computation. In particular, this means that no diabatization procedure is necessary, the adiabatic electronic energies can be computed on the fly, and they only need to be computed to higher accuracy when an avoided crossing is detected. We test the quality of our method on the paradigmatic example of photo-dissociation of NaI, finding very good agreement with results of exact wave packet calculations.

  18. Dynamic-local-field approximation for the quantum solids

    Science.gov (United States)

    Etters, R. D.; Danilowicz, R. L.

    1974-01-01

    A local-molecular-field description for the ground-state properties of the quantum solids is presented. The dynamical behavior of atoms contributing to the local field, which acts on an arbitrary pair of test particles, is incorporated by decoupling the pair correlations between these field atoms. The energy, pressure, compressibility, single-particle-distribution function, and the rms atomic deviations about the equilibrium lattice sites are calculated for H2, He-3, and He-4 over the volume range from 5 to 24.5 cu cm/mole. The results are in close agreement with existing Monte Carlo calculations wherever comparisons are possible. At very high pressure, the results agree with simplified descriptions which depend on negligible overlap of the system wave function between neighboring lattice sites.

  19. Trojan dynamics well approximated by a new Hamiltonian normal form

    CERN Document Server

    Paez, Rocio Isabel

    2015-01-01

    We revisit a classical perturbative approach to the Hamiltonian related to the motions of Trojan bodies, in the framework of the Planar Circular Restricted Three-Body Problem (PCRTBP), by introducing a number of key new ideas in the formulation. In some sense, we adapt the approach of Garfinkel (1977) to the context of the normal form theory and its modern techniques. First, we make use of Delaunay variables for a physically accurate representation of the system. Therefore, we introduce a novel manipulation of the variables so as to respect the natural behavior of the model. We develop a normalization procedure over the fast angle which exploits the fact that singularities in this model are essentially related to the slow angle. Thus, we produce a new normal form, i.e. an integrable approximation to the Hamiltonian. We emphasize some practical examples of the applicability of our normalizing scheme, e.g. the estimation of the stable libration region. Finally, we compare the level curves produced by our normal...

  20. Trojan dynamics well approximated by a new Hamiltonian normal form

    Science.gov (United States)

    Páez, Rocío Isabel; Locatelli, Ugo

    2015-10-01

    We revisit a classical perturbative approach to the Hamiltonian related to the motions of Trojan bodies, in the framework of the planar circular restricted three-body problem, by introducing a number of key new ideas in the formulation. In some sense, we adapt the approach of Garfinkel to the context of the normal form theory and its modern techniques. First, we make use of Delaunay variables for a physically accurate representation of the system. Therefore, we introduce a novel manipulation of the variables so as to respect the natural behaviour of the model. We develop a normalization procedure over the fast angle which exploits the fact that singularities in this model are essentially related to the slow angle. Thus, we produce a new normal form, i.e. an integrable approximation to the Hamiltonian. We emphasize some practical examples of the applicability of our normalizing scheme, e.g. the estimation of the stable libration region. Finally, we compare the level curves produced by our normal form with surfaces of section provided by the integration of the non-normalized Hamiltonian, with very good agreement. Further precision tests are also provided. In addition, we give a step-by-step description of the algorithm, allowing for extensions to more complicated models.

  1. Stress stiffening and approximate equations in flexible multibody dynamics

    Science.gov (United States)

    Padilla, Carlos E.; Vonflotow, Andreas H.

    1993-01-01

    A useful model for open chains of flexible bodies undergoing large rigid body motions, but small elastic deformations, is one in which the equations of motion are linearized in the small elastic deformations and deformation rates. For slow rigid body motions, the correctly linearized, or consistent, set of equations can be compared to prematurely linearized, or inconsistent, equations and to 'oversimplified,' or ruthless, equations through the use of open loop dynamic simulations. It has been shown that the inconsistent model should never be used, while the ruthless model should be used whenever possible. The consistent and inconsistent models differ by stress stiffening terms. These are due to zeroth-order stresses effecting virtual work via nonlinear strain-displacement terms. In this paper we examine in detail the nature of these stress stiffening terms and conclude that they are significant only when the associated zeroth-order stresses approach 'buckling' stresses. Finally it is emphasized that when the stress stiffening terms are negligible the ruthlessly linearized equations should be used.

  2. Approximate but accurate quantum dynamics from the Mori formalism: I. Nonequilibrium dynamics

    Science.gov (United States)

    Montoya-Castillo, Andrés; Reichman, David R.

    2016-05-01

    We present a formalism that explicitly unifies the commonly used Nakajima-Zwanzig approach for reduced density matrix dynamics with the more versatile Mori theory in the context of nonequilibrium dynamics. Employing a Dyson-type expansion to circumvent the difficulty of projected dynamics, we obtain a self-consistent equation for the memory kernel which requires only knowledge of normally evolved auxiliary kernels. To illustrate the properties of the current approach, we focus on the spin-boson model and limit our attention to the use of a simple and inexpensive quasi-classical dynamics, given by the Ehrenfest method, for the calculation of the auxiliary kernels. For the first time, we provide a detailed analysis of the dependence of the properties of the memory kernels obtained via different projection operators, namely, the thermal (Redfield-type) and population based (NIBA-type) projection operators. We further elucidate the conditions that lead to short-lived memory kernels and the regions of parameter space to which this program is best suited. Via a thorough analysis of the different closures available for the auxiliary kernels and the convergence properties of the self-consistently extracted memory kernel, we identify the mechanisms whereby the current approach leads to a significant improvement over the direct usage of standard semi- and quasi-classical dynamics.

  3. Approximate but accurate quantum dynamics from the Mori formalism: I. Nonequilibrium dynamics.

    Science.gov (United States)

    Montoya-Castillo, Andrés; Reichman, David R

    2016-05-14

    We present a formalism that explicitly unifies the commonly used Nakajima-Zwanzig approach for reduced density matrix dynamics with the more versatile Mori theory in the context of nonequilibrium dynamics. Employing a Dyson-type expansion to circumvent the difficulty of projected dynamics, we obtain a self-consistent equation for the memory kernel which requires only knowledge of normally evolved auxiliary kernels. To illustrate the properties of the current approach, we focus on the spin-boson model and limit our attention to the use of a simple and inexpensive quasi-classical dynamics, given by the Ehrenfest method, for the calculation of the auxiliary kernels. For the first time, we provide a detailed analysis of the dependence of the properties of the memory kernels obtained via different projection operators, namely, the thermal (Redfield-type) and population based (NIBA-type) projection operators. We further elucidate the conditions that lead to short-lived memory kernels and the regions of parameter space to which this program is best suited. Via a thorough analysis of the different closures available for the auxiliary kernels and the convergence properties of the self-consistently extracted memory kernel, we identify the mechanisms whereby the current approach leads to a significant improvement over the direct usage of standard semi- and quasi-classical dynamics. PMID:27179468

  4. Reinforcement learning control with approximation of time-dependent agent dynamics

    Science.gov (United States)

    Kirkpatrick, Kenton Conrad

    Reinforcement Learning has received a lot of attention over the years for systems ranging from static game playing to dynamic system control. Using Reinforcement Learning for control of dynamical systems provides the benefit of learning a control policy without needing a model of the dynamics. This opens the possibility of controlling systems for which the dynamics are unknown, but Reinforcement Learning methods like Q-learning do not explicitly account for time. In dynamical systems, time-dependent characteristics can have a significant effect on the control of the system, so it is necessary to account for system time dynamics while not having to rely on a predetermined model for the system. In this dissertation, algorithms are investigated for expanding the Q-learning algorithm to account for the learning of sampling rates and dynamics approximations. For determining a proper sampling rate, it is desired to find the largest sample time that still allows the learning agent to control the system to goal achievement. An algorithm called Sampled-Data Q-learning is introduced for determining both this sample time and the control policy associated with that sampling rate. Results show that the algorithm is capable of achieving a desired sampling rate that allows for system control while not sampling "as fast as possible". Determining an approximation of an agent's dynamics can be beneficial for the control of hierarchical multiagent systems by allowing a high-level supervisor to use the dynamics approximations for task allocation decisions. To this end, algorithms are investigated for learning first- and second-order dynamics approximations. These algorithms are respectively called First-Order Dynamics Learning and Second-Order Dynamics Learning. The dynamics learning algorithms are evaluated on several examples that show their capability to learn accurate approximations of state dynamics. All of these algorithms are then evaluated on hierarchical multiagent systems

  5. Finding Approximate Analytic Solutions to Differential Equations by Seed Selection Genetic Programming

    Institute of Scientific and Technical Information of China (English)

    侯进军

    2007-01-01

    @@ 1 Seed Selection Genetic Programming In Genetic Programming, each tree in population shows an algebraic or surmounting expression, and each algebraic or surmounting expression shows an approximate analytic solution to differential equations.

  6. ACCESS 1: Approximation Concepts Code for Efficient Structural Synthesis program documentation and user's guide

    Science.gov (United States)

    Miura, H.; Schmit, L. A., Jr.

    1976-01-01

    The program documentation and user's guide for the ACCESS-1 computer program is presented. ACCESS-1 is a research oriented program which implements a collection of approximation concepts to achieve excellent efficiency in structural synthesis. The finite element method is used for structural analysis and general mathematical programming algorithms are applied in the design optimization procedure. Implementation of the computer program, preparation of input data and basic program structure are described, and three illustrative examples are given.

  7. Approximate models of dynamic thermoviscoelasticity describing shape-memory-alloy phase transitions

    OpenAIRE

    Melnik, R. V. N.; Roberts, A. J.

    1999-01-01

    We consider problems of dynamic viscoelasticity taking into account the coupling of elastic and thermal fields. Efficient approximate models are developed and computational results on thermomechanical behaviour of shape-memory-alloy structures are presented.

  8. A dynamic inequality generation scheme for polynomial programming

    NARCIS (Netherlands)

    Ghaddar, B.; Vera Lizcano, J.C.; Anjos, M.F.

    2016-01-01

    Hierarchies of semidefinite programs have been used to approximate or even solve polynomial programs. This approach rapidly becomes computationally expensive and is often tractable only for problems of small size. In this paper, we propose a dynamic inequality generation scheme to generate valid pol

  9. Dynamics of multilevel molecules and pulse propagation beyond rotating wave approximation near two-photon resonance

    International Nuclear Information System (INIS)

    Dynamics of multilevel molecules and pulse propagation is studied near the two-photon resonance. We have found a strict solution of this problem beyond the rotating wave approximation. Our analytical solution is in close agreement with the strict numerical solution for the 4,4'-bis(dimethylamino) stilbene molecule. The compensation of the dynamical Stark shift is studied for fixed-in-space molecules. It is shown that the orientational disorder does not allow complete compensation of the dynamical Stark shift

  10. Gate complexity using Dynamic Programming

    OpenAIRE

    Sridharan, Srinivas; Gu, Mile; James, Matthew R.

    2008-01-01

    The relationship between efficient quantum gate synthesis and control theory has been a topic of interest in the quantum control literature. Motivated by this work, we describe in the present article how the dynamic programming technique from optimal control may be used for the optimal synthesis of quantum circuits. We demonstrate simulation results on an example system on SU(2), to obtain plots related to the gate complexity and sample paths for different logic gates.

  11. A new class of ensemble conserving algorithms for approximate quantum dynamics: Theoretical formulation and model problems

    International Nuclear Information System (INIS)

    We develop two classes of quasi-classical dynamics that are shown to conserve the initial quantum ensemble when used in combination with the Feynman-Kleinert approximation of the density operator. These dynamics are used to improve the Feynman-Kleinert implementation of the classical Wigner approximation for the evaluation of quantum time correlation functions known as Feynman-Kleinert linearized path-integral. As shown, both classes of dynamics are able to recover the exact classical and high temperature limits of the quantum time correlation function, while a subset is able to recover the exact harmonic limit. A comparison of the approximate quantum time correlation functions obtained from both classes of dynamics is made with the exact results for the challenging model problems of the quartic and double-well potentials. It is found that these dynamics provide a great improvement over the classical Wigner approximation, in which purely classical dynamics are used. In a special case, our first method becomes identical to centroid molecular dynamics

  12. Application of approximate entropy on dynamic characteristics of epileptic absence seizure

    Institute of Scientific and Technical Information of China (English)

    Yi Zhou; Ruimei Huang; Ziyi Chen; Xin Chang; Jialong Chen; Lingli Xie

    2012-01-01

    Electroencephalogram signals are time-varying complex electrophysiological signals. Existing studies show that approximate entropy, which is a nonlinear dynamics index, is not an ideal method for electroencephalogram analysis. Clinical electroencephalogram measurements usually contain electrical interference signals, creating additional challenges in terms of maintaining robustness of the analytic methods. There is an urgent need for a novel method of nonlinear dynamical analysis of the electroencephalogram that can characterize seizure-related changes in cerebral dynamics. The aim of this paper was to study the fluctuations of approximate entropy in preictal, ictal, and postictal electroencephalogram signals from a patient with absence seizures, and to improve the algorithm used to calculate the approximate entropy. The approximate entropy algorithm, especially our modified version, could accurately describe the dynamical changes of the brain during absence seizures. We could also demonstrate that the complexity of the brain was greater in the normal state than in the ictal state. The fluctuations of the approximate entropy before epileptic seizures observed in this study can form a goodbasis for further study on the prediction of seizures with nonlinear dynamics.

  13. A Computer Program for Calculation of Approximate Embryo/Fetus Radiation Dose in Nuclear Medicine Applications

    Directory of Open Access Journals (Sweden)

    Tuncay Bayram

    2012-04-01

    Full Text Available Objective: In this study, we aimed to make a computer program that calculates approximate radiation dose received by embryo/fetus in nuclear medicine applications. Material and Methods: Radiation dose values per MBq-1 received by embryo/fetus in nuclear medicine applications were gathered from literature for various stages of pregnancy. These values were embedded in the computer code, which was written in Fortran 90 program language. Results: The computer program called nmfdose covers almost all radiopharmaceuticals used in nuclear medicine applications. Approximate radiation dose received by embryo/fetus can be calculated easily at a few steps using this computer program. Conclusion: Although there are some constraints on using the program for some special cases, nmfdose is useful and it provides practical solution for calculation of approximate dose to embryo/fetus in nuclear medicine applications. (MIRT 2012;21:19-22

  14. Dynamical response of a disordered ferromagnetic chain: alloy transfer matrix approximation

    International Nuclear Information System (INIS)

    The alloy transfer matrix approximation is used to study the uniform dynamic susceptibility of a disordered ferromagnetic chain. The approximation allows for a consistent treatment of diagonal and off- diagonal disorder. The results, in the limit of low concentrations, are in agreement with the exact single impurity ones. Intensities and lineshapes for infrared absorption are calculated for finite impurity concentrations and different values of the relative anisotropy parameter of a model alloy. (Author)

  15. Dynamics of Rabi model under second-order Born—Oppenheimer approximation

    International Nuclear Information System (INIS)

    We apply the second-order Born—Oppenheimer (BO) approximation to investigate the dynamics of the Rabi model, which describes the interaction between a two-level system and a single bosonic mode beyond the rotating wave approximation. By comparing with the numerical results, we find that our approach works well when the frequency of the two-level system is much smaller than that of the bosonic mode

  16. λ-PDF AND GEGENBAUER POLYNOMIAL APPROXIMATION FOR DYNAMIC RESPONSE PROBLEMS OF RANDOM STRUCTURES

    Institute of Scientific and Technical Information of China (English)

    FANG Tong; LENG Xiaolei; MA Xiaoping; MENG Guang

    2004-01-01

    A bounded, mono-peak, and symmetrically distributed probability density function,called λ-PDF, together with the Gegenbauer polynomial approximation, is used in dynamic response problems of random structures. The λ-PDF can reasonably model a variety of random parameters in engineering random structures. The Gegenbauer polynomial approximation can be viewed as a new extension of the weighted residual method into the random space. Both of them can be easily used by scientists and engineers, and applied to a variety of response problems of random structures. The numerical example shows the effectiveness of the proposed method to study dynamic phenomena in random structures.

  17. Improved Approximation of Interactive Dynamic Influence DiagramsUsing Discriminative Model Updates

    DEFF Research Database (Denmark)

    Prashant, Doshi; Zeng, Yifeng

    2009-01-01

    the concept of a minimal model set, which facilitates qualitative comparisons between different approximation techniques. We then present a new approximation technique that minimizes the space of candidate models by discriminating between model updates. We empirically demonstrate that our approach improves......Interactive dynamic influence diagrams (I-DIDs) are graphical models for sequential decision making in uncertain settings shared by other agents. Algorithms for solving I-DIDs face the challenge of an exponentially growing space of candidate models ascribed to other agents, over time. We formalize...... significantly in performance on the previous clustering based approximation technique....

  18. An Approximate Algorithm for a Class of Nonlinear Bilevel Integer Programming

    Institute of Scientific and Technical Information of China (English)

    LI Lei; TENG Chun-xian; TIAN Guang-yue

    2002-01-01

    The algorithm for a class of nonlinear bilevel integer programming is discussed in this paper. It is based on the theory and algorithm for nonlinear integer programming. The continuity methods for integer programming are studied in this paper. After simulated annealing algorithm is applied to the upper-level programming problem and the thought of filled function method for continuous global optimization is applied to the corresponding lower-level programming, an approximate algorithm is established. The satisfactory algorithm is elaborated in the following example.

  19. Improved sampling and validation of frozen Gaussian approximation with surface hopping algorithm for nonadiabatic dynamics

    CERN Document Server

    Lu, Jianfeng

    2016-01-01

    In the spirit of the fewest switches surface hopping, the frozen Gaussian approximation with surface hopping (FGA-SH) method samples a path integral representation of the non-adiabatic dynamics in the semiclassical regime. An improved sampling scheme is developed in this work for FGA-SH based on birth and death branching processes. The algorithm is validated for the standard test examples of non-adiabatic dynamics.

  20. Analytical Approach to Wave Packet Dynamics of Laser-Driven Particles beyond the Dipole Approximation

    CERN Document Server

    Verschl, M

    2005-01-01

    An analytical approach to quantum mechanical wave packet dynamics of laser-driven particles is presented. The time-dependent Schroedinger equation is solved for an electron exposed to a linearly polarized plane wave of arbitrary shape. The calculation goes beyond the dipole approximation, such that magnetic field effects like wave packet shearing are included. Analytical expressions for the time-dependent widths of the wave packet and its orientation are established. These allow for a simple understanding of the wave packet dynamics.

  1. Potential function methods for approximately solving linear programming problems theory and practice

    CERN Document Server

    Bienstock, Daniel

    2002-01-01

    Potential Function Methods For Approximately Solving Linear Programming Problems breaks new ground in linear programming theory. The book draws on the research developments in three broad areas: linear and integer programming, numerical analysis, and the computational architectures which enable speedy, high-level algorithm design. During the last ten years, a new body of research within the field of optimization research has emerged, which seeks to develop good approximation algorithms for classes of linear programming problems. This work both has roots in fundamental areas of mathematical programming and is also framed in the context of the modern theory of algorithms. The result of this work, in which Daniel Bienstock has been very much involved, has been a family of algorithms with solid theoretical foundations and with growing experimental success. This book will examine these algorithms, starting with some of the very earliest examples, and through the latest theoretical and computational developments.

  2. Approximate-model Based Estimation Method for Dynamic Response of Forging Processes

    Institute of Scientific and Technical Information of China (English)

    LEI Jie; LU Xinjiang; LI Yibo; HUANG Minghui; ZOU Wei

    2015-01-01

    Many high-quality forging productions require the large-sized hydraulic press machine (HPM) to have a desirable dynamic response. Since the forging process is complex under the low velocity, its response is difficult to estimate. And this often causes the desirable low-velocity forging condition difficult to obtaln. So far little work has been found to estimate the dynamic response of the forging process under low velocity. In this paper, an approximate-model based estimation method is proposed to estimate the dynamic response of the forging process under low velocity. First, an approximate model is developed to represent the forging process of this complex HPM around the low-velocity working point. Under guaranteeing the modeling performance, the model may greatly ease the complexity of the subsequent estimation of the dynamic response because it has a good linear structure. On this basis, the dynamic response is estimated and the conditions for stability, vibration, and creep are derived according to the solution of the velocity. All these analytical results are further verified by both simulations and experiment. In the simulation verification for modeling, the original movement model and the derived approximate model always have the same dynamic responses with very small approximate error. The simulations and experiment finally demonstrate and test the effectiveness of the derived conditions for stability, vibration, and creep, and these conditions will benefit both the prediction of the dynamic response of the forging process and the design of the controller for the high-quality forging. The proposed method is an effective solution to achieve the desirable low-velocity forging condition.

  3. Variational approximation for two-time correlation functions in Φ4 theory. Optimization of the dynamics

    International Nuclear Information System (INIS)

    The time-dependent variational principle of Balian and Veneroni was applied to the Φ4 theory. An appropriate parametrization for the variational objects allows the derivation of coupled dynamical equations from which yield approximations for the two-time correlation functions involving two, three or four field operators. (author) 7 refs

  4. Neuro-dynamic programming for the efficient management of reservoir networks

    OpenAIRE

    de Rigo, Daniele; Rizzoli, Andrea Emilio; Soncini-Sessa, Rodolfo; Weber, Enrico; Zenesi, Pietro

    2001-01-01

    Significance This article introduced in 2001 one of the very first successful applications of advanced machine learning techniques to solve complex, multicriteria management problems in water resources dealing with networks of water reservoirs. It applied approximate dynamic programming (here, neuro-dynamic programming - whose approximation of stochastic dynamic programming relies on artificial neural networks) to the integrated water resources management. The methodology is general enoug...

  5. Gravitational-wave dynamics and black-hole dynamics: second quasi-spherical approximation

    OpenAIRE

    Hayward, Sean A.

    2001-01-01

    Gravitational radiation with roughly spherical wavefronts, produced by roughly spherical black holes or other astrophysical objects, is described by an approximation scheme. The first quasi-spherical approximation, describing radiation propagation on a background, is generalized to include additional non-linear effects, due to the radiation itself. The gravitational radiation is locally defined and admits an energy tensor, satisfying all standard local energy conditions and entering the trunc...

  6. Ballistic-diffusive approximation for the thermal dynamics of metallic nanoparticles in nanocomposite materials

    International Nuclear Information System (INIS)

    Based on ballistic-diffusive approximation, a method is presented to model heat transfer in nanocomposites containing metal nanoparticles. This method provides analytical expression for the temperature dynamics of metallic nanoparticles embedded in a dielectric medium. In this study, nanoparticles are considered as spherical shells, so that Boltzmann equation is solved using ballistic-diffusive approximation to calculate the electron and lattice thermal dynamics in gold nanoparticles, while thermal exchange between the particles is taken into account. The model was used to investigate the influence of particle size and metal concentration of the medium on the electron and lattice thermal dynamics. It is shown that these two parameters are crucial in determining the nanocomposite thermal behavior. Our results showed that the heat transfer rate from nanoparticles to the matrix decreases as the nanoparticle size increases. On the other hand, increasing the metal concentration of the medium can also decrease the heat transfer rate

  7. BUILDING MATHEMATICAL MODELS IN DYNAMIC PROGRAMMING

    Directory of Open Access Journals (Sweden)

    LIANA RODICA PATER

    2012-05-01

    Full Text Available In short, we can say that dynamic programming is a method of optimization of systems, using their mathematical representation in phases or sequences or as we say, periods. Such systems are common in economic studies at the implementation of programs on the most advanced techniques, such as for example that involving cosmic navigation. Another concept that is involved in the study of dynamic programs is the economic horizon (number of periods or phases that a dynamic program needs. This concept often leads to the examination of the convergence of certain variables on infinite horizon. In many cases from the real economy by introducing updating, dynamic programs can be made convergent.

  8. Gravitational-wave dynamics and black-hole dynamics second quasi-spherical approximation

    CERN Document Server

    Hayward, S A

    2001-01-01

    Gravitational radiation with roughly spherical wavefronts, produced by roughly spherical black holes or other astrophysical objects, is described by an approximation scheme. The first quasi-spherical approximation, describing radiation propagation on a background, is generalized to include additional non-linear effects, due to the radiation itself. The gravitational radiation is locally defined and admits an energy tensor, satisfying all standard local energy conditions and entering the truncated Einstein equations as an effective energy tensor. This second quasi-spherical approximation thereby includes gravitational radiation reaction, such as the back-reaction on the black hole. With respect to a canonical flow of time, the combined energy-momentum of the matter and gravitational radiation is covariantly conserved. The corresponding Noether charge is a local gravitational mass-energy. Energy conservation is formulated as a local first law relating the gradient of the gravitational mass to work and energy-su...

  9. Dynamic Programming Applications in Water Resources

    Science.gov (United States)

    Yakowitz, Sidney

    1982-08-01

    The central intention of this survey is to review dynamic programming models for water resource problems and to examine computational techniques which have been used to obtain solutions to these problems. Problem areas surveyed here include aqueduct design, irrigation system control, project development, water quality maintenance, and reservoir operations analysis. Computational considerations impose severe limitation on the scale of dynamic programming problems which can be solved. Inventive numerical techniques for implementing dynamic programming have been applied to water resource problems. Discrete dynamic programming, differential dynamic programming, state incremental dynamic programming, and Howard's policy iteration method are among the techniques reviewed. Attempts have been made to delineate the successful applications, and speculative ideas are offered toward attacking problems which have not been solved satisfactorily.

  10. Dynamics of Zonal Flows: Failure of Wave-Kinetic Theory, and New Geometrical Optics Approximations

    CERN Document Server

    Parker, Jeffrey B

    2016-01-01

    The self-organization of turbulence into regular zonal flows can be fruitfully investigated with quasilinear methods and statistical descriptions. A wave kinetic equation that assumes asymptotically large-scale zonal flows is pathological. From an exact description of quasilinear dynamics emerges two better geometrical optics approximations. These involve not only the mean flow shear but also the second and third derivative of the mean flow. One approximation takes the form of a new wave kinetic equation, but is only valid when the zonal flow is quasi-static and wave action is conserved.

  11. Approximate Bisimulation and Optimization of Software Programs Based on Symbolic-Numeric Computation

    Directory of Open Access Journals (Sweden)

    Hui Deng

    2013-01-01

    Full Text Available To achieve behavior and structure optimization for a type of software program whose data exchange processes are represented by nonlinear polynomial systems, this paper establishes a novel formal description called a nonlinear polynomial transition system to represent the behavior and structure of the software program. Then, the notion of bisimulation for software programs is proposed based on the equivalence relation of corresponding nonlinear polynomial systems in their nonlinear polynomial transition systems. However, the exact equivalence is too strict in application. To enhance the flexibility of the relation among the different software systems, the notion of approximate bisimulation within a controllable error range and the calculation algorithm of approximate bisimulation based on symbolic-numeric computation are given. In this calculation, an approximate relation is represented as a MAX function that is resolved with the full filled method. At the same time, the actual error is calculable. An example on a multithreading program indicates that the approximate bisimulation relation is feasible and effective in behavior and structure optimization.

  12. On the Consistency of Approximate Quantum Dynamics Simulation Methods for Vibrational Spectra in the Condensed Phase

    CERN Document Server

    Rossi, Mariana; Paesani, Francesco; Bowman, Joel; Ceriotti, Michele

    2014-01-01

    Including quantum mechanical effects on the dynamics of nuclei in the condensed phase is challenging, because the complexity of exact methods grows exponentially with the number of quantum degrees of freedom. Efforts to circumvent these limitations can be traced down to two approaches: methods that treat a small subset of the degrees of freedom with rigorous quantum mechanics, considering the rest of the system as a static or classical environment, and methods that treat the whole system quantum mechanically, but using approximate dynamics. Here we perform a systematic comparison between these two philosophies for the description of quantum effects in vibrational spectroscopy, taking the Embedded Local Monomer (LMon) model and a mixed quantum-classical (MQC) model as representatives of the first family of methods, and centroid molecular dynamics (CMD) and thermostatted ring polymer molecular dynamics (TRPMD) as examples of the latter. We use as benchmarks D$_2$O doped with HOD and pure H$_2$O at three distinc...

  13. Non-Markovian dynamics in a spin star system: Exact solution and approximation techniques

    OpenAIRE

    Breuer, Heinz-Peter; Burgarth, Daniel; Petruccione, Francesco

    2004-01-01

    The reduced dynamics of a central spin coupled to a bath of N spin-1/2 particles arranged in a spin star configuration is investigated. The exact time evolution of the reduced density operator is derived, and an analytical solution is obtained in the limit of an infinite number of bath spins, where the model shows complete relaxation and partial decoherence. It is demonstrated that the dynamics of the central spin cannot be treated within the Born-Markov approximation. The Nakajima-Zwanzig an...

  14. Approximate but Accurate Quantum Dynamics from the Mori Formalism: I. Nonequilibrium Dynamics

    CERN Document Server

    Montoya-Castillo, Andrés

    2016-01-01

    We present a formalism that explicitly unifies the commonly used Nakajima-Zwanzig approach for reduced density matrix dynamics with the more versatile Mori theory in the context of nonequilibrium dynamics. Employing a Dyson-type expansion to circumvent the difficulty of projected dynamics, we obtain a self-consistent equation for the memory kernel which requires only knowledge of normally evolved auxiliary kernels. To illustrate the properties of the current approach, we focus on the spin-boson model and limit our attention to the use of a simple and inexpensive quasi-classical dynamics, given by the Ehrenfest method, for the calculation of the auxiliary kernels. For the first time, we provide a detailed analysis of the dependence of the properties of the memory kernels obtained via different projection operators, namely the thermal (Redfield-type) and population based (NIBA-type) projection operators. We further elucidate the conditions that lead to short-lived memory kernels and the regions of parameter spa...

  15. Classical dynamics of a charged particle in a laser field beyond the dipole approximation

    OpenAIRE

    Jameson, Paul; Khvedelidze, Arsen

    2008-01-01

    The classical dynamics of a charged particle traveling in a laser field modeled by an elliptically polarized monochromatic electromagnetic plane wave is discussed within the time reparametrization invariant form of the non-relativistic Hamilton-Jacobi theory. The exact parametric representation for a particle's orbit in an arbitrary plane wave background beyond the dipole approximation and including effect of the magnetic field is derived. For an elliptically polarized monochromatic plane wav...

  16. A dynamic subgrid-scale modeling framework for large eddy simulation using approximate deconvolution

    CERN Document Server

    Maulik, Romit

    2016-01-01

    We put forth a dynamic modeling framework for sub-grid parametrization of large eddy simulation of turbulent flows based upon the use of the approximate deconvolution procedure to compute the Smagorinsky constant self-adaptively from the resolved flow quantities. Our numerical assessments for solving the Burgers turbulence problem shows that the proposed approach could be used as a viable tool to address the turbulence closure problem due to its flexibility.

  17. Dynamic Slicing of Object-Oriented Programs

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    Program slice has many applications such as program debugging,testing, maintena n ce, and complexity measurement. A static slice consists of all statements in pro gram P that may effect the value of variable v at some point p, and a dynamic s lice consists only of statements that influence the value of variable occurrence for specific program inputs. In this paper, we concern the problem of dynamic s licing of object-oriented programs which, to our knowledge, has not been addres s ed in the literatures. To solve this problem, we present the dynamic object-ori e nted dependence graph (DODG)which is an arc-classified digraph to explicitly re p resent various dynamic dependence between statement instances for a particular e xecution of an object-oriented program. Based on the DODG, we present a two-ph as e backward algorithm for computing a dynamic slice of an object-oriented program.

  18. Boundary detection via dynamic programming

    Science.gov (United States)

    Udupa, Jayaram K.; Samarasekera, Supun; Barrett, William A.

    1992-09-01

    This paper reports a new method for detecting optimal boundaries in multidimensional scene data via dynamic programming (DP). In its current form the algorithm detects 2-D contours on slices and differs from other reported DP-based algorithms in an essential way in that it allows freedom in 2-D for finding optimal contour paths (as opposed to a single degree of freedom in the published methods). The method is being successfully used in segmenting object boundaries in a variety of medical applications including orbital volume from CT images (for craniofacial surgical planning), segmenting bone in MR images for kinematic analysis of the joints of the foot, segmenting the surface of the brain from the inner surface of the cranial vault, segmenting pituitary gland tumor for following the effect of a drug on the tumor, segmenting the boundaries of the heart in MR images, and segmenting the olfactory bulb for verifying hypotheses related to the size of this bulb in certain disease states.

  19. Genomic Signal Search by Dynamic Programming

    Institute of Scientific and Technical Information of China (English)

    ZHENG Wei-Mou

    2003-01-01

    A general and flexible multi-motif model is proposed based on dynamic programming. By extending theGibbs sampler to the dynamic programming and introducing temperature, an efficient algorithm is developed. Branchpoint signalsequences and translation initiation sequences extracted from the rice genome are then examined.

  20. Weak Dynamic Programming Principle for Viscosity Solutions

    OpenAIRE

    Bouchard, Bruno; Touzi, Nizar

    2011-01-01

    We prove a weak version of the dynamic programming principle for standard stochastic control problems and mixed control-stopping problems, which avoids the technical difficulties related to the measurable selection argument. In the Markov case, our result is tailor-maid for the derivation of the dynamic programming equation in the sense of viscosity solutions.

  1. A Discrete Meta-Control Procedure for Approximating Solutions to Binary Programs

    Directory of Open Access Journals (Sweden)

    Zelda B. Zabinsky

    2013-09-01

    Full Text Available Large-scale binary integer programs occur frequently in many real-world applications. For some binary integer problems, finding an optimal solution or even a feasible solution is computationally expensive. In this paper, we develop a discrete meta-control procedure to approximately solve large-scale binary integer programs efficiently. The key idea is to map the vector of n binary decision variables into a scalar function defined over a time interval [0; n] and construct a linear quadratic tracking (LQT problem that can be solved efficiently. We prove that an LQT formulation has an optimal binary solution, analogous to a classical bang-bang control in continuous time. Our LQT approach can provide advantages in reducing computation while generating a good approximate solution. Numerical examples are presented to demonstrate the usefulness of the proposed method.

  2. A Significance-Driven Programming Framework for Energy-Constrained Approximate Computing

    OpenAIRE

    Vassiliadis, Vassilis; Chalios, Charalambos; Parasyris, Konstantinos; Antonopoulos, Christos D.; Lalis, Spyros; Bellas, Nikolaos; Vandierendonck, Hans; Nikolopoulos, Dimitrios

    2015-01-01

    Approximate execution is a viable technique for energy-con\\-strained environments, provided that applications have the mechanisms to produce outputs of the highest possible quality within the given energy budget. We introduce a framework for energy-constrained execution with controlled and graceful quality loss. A simple programming model allows users to express the relative importance of computations for the quality of the end result, as well as minimum quality requirements. The significance...

  3. Implicit Time Integration for Multiscale Molecular Dynamics Using Transcendental Padé Approximants.

    Science.gov (United States)

    Abi Mansour, Andrew; Ortoleva, Peter J

    2016-04-12

    Molecular dynamics systems evolve through the interplay of collective and localized disturbances. As a practical consequence, there is a restriction on the time step imposed by the broad spectrum of time scales involved. To resolve this restriction, multiscale factorization was introduced for molecular dynamics as a method that exploits the separation of time scales by coevolving the coarse-grained and atom-resolved states via Trotter factorization. Developing a stable time-marching scheme for this coevolution, however, is challenging because the coarse-grained dynamical equations depend on the microstate; therefore, these equations cannot be expressed in closed form. The objective of this paper is to develop an implicit time integration scheme for multiscale simulation of large systems over long periods of time and with high accuracy. The scheme uses Padé approximants to account for both the stochastic and deterministic features of the coarse-grained dynamics. The method is demonstrated for a protein either undergoing a conformational change or migrating under the influence of an external force. The method shows promise in accelerating multiscale molecular dynamics without a loss of atomic precision or the need to conjecture the form of coarse-grained governing equations. PMID:26845510

  4. The effect of rheological approximations on the dynamics and topography in 3D subduction-collision models

    Science.gov (United States)

    Pusok, Adina E.; Kaus, Boris J. P.; Popov, Anton A.

    2016-04-01

    Most of the major mountain belts and orogenic plateaus are found within the overlying plate of active or fossil subduction and/or collision zones. Moreover, they evolve differently from one another as the result of specific combinations of surface and mantle processes. These differences arise for several reasons, such as different rheological properties, different amounts of regional isostatic compensation, and different mechanisms by which forces are applied to the convergent plates. Previous 3D geodynamic models of subduction/collision processes have used various rheological approximations, making numerical results difficult to compare, since there is no clear image on the extent of these approximations on the dynamics. Here, we employ the code LaMEM to perform high-resolution long-term 3D simulations of subduction/continental collision in an integrated lithospheric and upper-mantle scale model. We test the effect of rheological approximations on mantle and lithosphere dynamics in a geometrically simplified model setup that resembles a tectonic map of the India-Asia collision zone. We use the "sticky-air" approach to allow for the development of topography and the dynamics of subduction and collision is entirely driven by slab-pull (i.e. "free subduction"). The models exhibit a wide range of behaviours depending on the rheological law employed: from linear to temperature-dependent visco-elasto-plastic rheology that takes into account both diffusion and dislocation creep. For example, we find that slab dynamics varies drastically between end member models: in viscous approximations, slab detachment is slow following a viscous thinning, while for a non-linear visco-elasto-plastic rheology, slab detachment is relatively fast, inducing strong mantle flow in the slab window. We also examine the stress states in the subducting and overriding plates and topography evolution in the upper plate, and we discuss the implications on lithosphere dynamics at convergent margins

  5. Program Structure Combines Segmentation and Dynamic Storage

    Science.gov (United States)

    Tiffany, S. H.

    1982-01-01

    Programing techniques incorporate advantages of overlaying into segmented loads while retaining all dynamic load advantages of segmentation, employing those capabilities that best suit mode of operation, whether batch or interactive. User is allowed to load a program automatically in a variable manner, based solely on a single data input to the program, to maintain minimal field lengths for interactive use.

  6. Quasi-classical approximation in vortex filament dynamics. Integrable systems, gradient catastrophe and flutter

    CERN Document Server

    Konopelchenko, B G

    2012-01-01

    Quasiclassical approximation in the intrinsic description of the vortex filament dynamics is discussed. Within this approximation the governing equations are given by elliptic system of quasi-linear PDEs of the first order. Dispersionless Da Rios system and dispersionless Hirota equation are among them. They describe motion of vortex filament with slow varying curvature and torsion without or with axial flow. Gradient catastrophe for governing equations is studied. It is shown that geometrically this catastrophe manifests as a fast oscillation of a filament curve around the rectifying plane which resembles the flutter of airfoils. Analytically it is the elliptic umbilic singularity in the terminology of the catastrophe theory. It is demonstrated that its double scaling regularization is governed by the Painleve' I equation.

  7. Approximating Model Equivalence in Interactive Dynamic Influence Diagrams Using Top K Policy Paths

    DEFF Research Database (Denmark)

    Zeng, Y.; Chen, Y.; Doshi, Prashant

    2011-01-01

    approaches mainly cluster behaviorally equivalent models to reduce the complexity of I-DID solutions. In this paper, we seek to further reduce the model space by introducing an approximate measure of behavioral equivalence (BE) and using it to group models. Specifically, we focus on $K$ most probable paths......Interactive dynamic influence diagrams (I-DIDs) are graphical models for sequential decision making in uncertain settings shared by other agents. Algorithms for solving I-DIDs face the challenge of an exponentially growing space of behavioral models ascribed to other agents over time. Previous...... in the solution of each model and compare these policy paths to determine approximate BE. We discuss the challenges in computing the top $K$ policy paths and experimentally evaluate the performance of this heuristic approach in terms of the scalability and quality of the solution....

  8. Cosmological dynamics: from the Eulerian to the Lagrangian frame. Part I. Newtonian approximation

    International Nuclear Information System (INIS)

    We analyse the non-linear gravitational dynamics of a pressure-less fluid in the Newtonian limit of General Relativity in both the Eulerian and Lagrangian pictures. Starting from the Newtonian metric in the Poisson gauge, we transform to the synchronous and comoving gauge and obtain the Lagrangian metric within the Newtonian approximation. Our approach is fully non-perturbative, which implies that if our quantities are expanded according to the rules of standard perturbation theory, all terms are exactly recovered at any order in perturbation theory, only provided they are Newtonian. We explicitly show this result up to second order and in both gauges. Our transformation clarifies the meaning of the change of spatial and time coordinates from the Eulerian to the Lagrangian frame in the Newtonian approximation

  9. Coherent Dynamics in Dressed Optical Lattices Beyond the Born-Oppenheimer Approximation

    Science.gov (United States)

    Reeves, Jeremy; Krinner, Ludwig; Stewart, Mike; Pazmino, Arturo; Schneble, Dominik

    2015-05-01

    Usual treatments of matter-wave diffraction assume that the zero-point energy in the diffracting potential is much smaller than the gap between the dressed levels. However, in near-resonant weak-driving scenarios, zero-point motion can mix the adiabatic dressed states, making the diffracting potentials highly non-adiabatic, such that the usual Born-Oppenheimer approximation for the external and internal degrees of freedom no longer applies. We model the dynamics of a matter wave in a microwave-coupled state-dependent lattice in this regime, and quantify the importance of these effects on recent experiments. Supported by NSF grant PHY-1205894.

  10. Dynamics of Jaynes-Cummings Model in the Absence of Rotating-Wave Approximation

    Institute of Scientific and Technical Information of China (English)

    FAN Yun-Xia; LIU Tao; FENG Mang; WANG Ke-Lin

    2007-01-01

    The Jaynes-Cummings model (JCM) is studied in the absence of the rotating-wave approximation (RWA)by a coherent-state expansion technique. In comparison with the previous paper in which the coherent-state expansion was performed only to the third order, we carry out in this paper a complete expansion to demonstrate exactly the dynamics of the JCM without the RWA. Our study gives a systematic method to solve the non-RWA problem, which would be useful in various physical systems, e.g., in a system with an ultracold trapped ion experiencing the running waves of lasers.

  11. Dynamics of Jaynes-Cummings Model in the Absence of Rotating-Wave Approximation

    International Nuclear Information System (INIS)

    The Jaynes-Cummings model (JCM) is studied in the absence of the rotating-wave approximation (RWA) by a coherent-state expansion technique. In comparison with the previous paper in which the coherent-state expansion was performed only to the third order, we carry out in this paper a complete expansion to demonstrate exactly the dynamics of the JCM without the RWA. Our study gives a systematic method to solve the non-RWA problem, which would be useful in various physical systems, e.g., in a system with an ultracold trapped ion experiencing the running waves of lasers.

  12. Dynamics of Jaynes-Cummings Model in the Absence of Rotating-Wave Approximation

    Science.gov (United States)

    Fan, Yun-Xia; Liu, Tao; Feng, Mang; Wang, Ke-Lin

    2007-05-01

    The Jaynes-Cummings model (JCM) is studied in the absence of the rotating-wave approximation (RWA) by a coherent-state expansion technique. In comparison with the previous paper in which the coherent-state expansion was performed only to the third order, we carry out in this paper a complete expansion to demonstrate exactly the dynamics of the JCM without the RWA. Our study gives a systematic method to solve the non-RWA problem, which would be useful in various physical systems, e.g., in a system with an ultracold trapped ion experiencing the running waves of lasers.

  13. Approximating a Giving Up Smoking Dynamic on Adolescent Nicotine Dependence in Fractional Order

    Science.gov (United States)

    2016-01-01

    In this work, we consider giving up smoking dynamic on adolescent nicotine dependence. First, we use the Caputo derivative to develop the model in fractional order. Then we apply two different numerical methods to compute accurate approximate solutions of this new model in fractional order and compare their results. In order to do this, we consider the generalized Euler method (GEM) and multi-step generalized differential transform method (MSGDTM). We also show the unique positive solution for this model and present numerical results graphically. PMID:27105426

  14. Quantum dynamics of water dissociative chemisorption on rigid Ni(111): An approximate nine-dimensional treatment

    Science.gov (United States)

    Jiang, Bin; Song, Hongwei; Yang, Minghui; Guo, Hua

    2016-04-01

    The quantum dynamics of water dissociative chemisorption on the rigid Ni(111) surface is investigated using a recently developed nine-dimensional potential energy surface. The quantum dynamical model includes explicitly seven degrees of freedom of D2O at fixed surface sites, and the final results were obtained with a site-averaging model. The mode specificity in the site-specific results is reported and analyzed. Finally, the approximate sticking probabilities for various vibrationally excited states of D2O are obtained considering surface lattice effects and formally all nine degrees of freedom. The comparison with experiment reveals the inaccuracy of the density functional theory and suggests the need to improve the potential energy surface.

  15. Approximation-Exact Penalty Function Method for Solving a Class of Stochastic Programming

    Institute of Scientific and Technical Information of China (English)

    WangGuang-min; WanZhong-ping

    2003-01-01

    We present an approximation-exact penalty function method for solving the single stage stochastic programming problem with continuous random variable. The original problem is transformed into a determinate nonlinear programming problem with a discrete random variable sequence, which is obtained by some discrete method. We construct an exact penalty function and obtain an unconstrained optimization. It avoids the difficulty in solution by the rapid growing of the number of constraints for discrete precision.Under lenient conditions, we prove the equivalence of the minimum solution of penalty function and the solution of the determinate programming, and prove that the solution sequences of the discrete problem converge to a solution to the original problem.

  16. Stability and dynamical properties of Rosenau-Hyman compactons using Padé approximants.

    Science.gov (United States)

    Mihaila, Bogdan; Cardenas, Andres; Cooper, Fred; Saxena, Avadh

    2010-05-01

    We present a systematic approach for calculating higher-order derivatives of smooth functions on a uniform grid using Padé approximants. We illustrate our findings by deriving higher-order approximations using traditional second-order finite-difference formulas as our starting point. We employ these schemes to study the stability and dynamical properties of K(2,2) Rosenau-Hyman compactons including the collision of two compactons and resultant shock formation. Our approach uses a differencing scheme involving only nearest and next-to-nearest neighbors on a uniform spatial grid. The partial differential equation for the compactons involves first, second, and third partial derivatives in the spatial coordinate and we concentrate on four different fourth-order methods which differ in the possibility of increasing the degree of accuracy (or not) of one of the spatial derivatives to sixth order. A method designed to reduce round-off errors was found to be the most accurate approximation in stability studies of single solitary waves even though all derivates are accurate only to fourth order. Simulating compacton scattering requires the addition of fourth derivatives related to artificial viscosity. For those problems the different choices lead to different amounts of "spurious" radiation and we compare the virtues of the different choices. PMID:20866355

  17. DYNAMICAL SPIN SUSCEPTIBILITY IN THE TD-LDA AND QSGW APPROXIMATIONS

    Energy Technology Data Exchange (ETDEWEB)

    SCHILFGAARDE, MARK VAN; KOTANI, TAKAO

    2012-10-15

    Abstract. This project was aimed at building the transverse dynamical spin susceptibility with the TD-LDA and the recently-developed Quasparticle Self-Consisent Approximations, which determines an optimum quasiparticle picture in a self-consistent manner within the GW approximation. Our main results were published into two papers, (J. Phys. Cond. Matt. 20, 95214 (2008), and Phys. Rev. B83, 060404(R) (2011). In the first paper we present spin wave dispersions for MnO, NiO, and -MnAs based on quasiparticle self-consistent GW approximation (QSGW). For MnO and NiO, QSGW results are in rather good agreement with experiments, in contrast to the LDA and LDA+U descriptions. For -MnAs, we find a collinear ferromagnetic ground state in QSGW, while this phase is unstable in the LDA. In the second, we apply TD-LDA to the CaFeAs2 the first attempt the first ab initio calculation of dynamical susceptibililty in a system with complex electronic structure Magnetic excitations in the striped phase of CaFe2As2 are studied as a function of local moment amplitude. We find a new kind of excitation: sharp resonances of Stoner-like (itinerant) excitations at energies comparable to the ´eel temperature, originating largely from a narrow band of Fe d states near the Fermi level, and coexisting with more conventional (localized) spin waves. Both kinds of excitations can show multiple branches, highlighting the inadequacy of a description based on a localized spin model.

  18. Integrating Pareto Optimization into Dynamic Programming

    OpenAIRE

    Thomas Gatter; Robert Giegerich; Cédric Saule

    2016-01-01

    Pareto optimization combines independent objectives by computing the Pareto front of the search space, yielding a set of optima where none scores better on all objectives than any other. Recently, it was shown that Pareto optimization seamlessly integrates with algebraic dynamic programming: when scoring schemes A and B can correctly evaluate the search space via dynamic programming, then so can Pareto optimization with respect to A and B. However, the integration of Pareto optimization into ...

  19. Adaptive dynamic programming for linear impulse systems

    Institute of Scientific and Technical Information of China (English)

    Xiao-hua WANG; Juan-juan YU; Yao HUANG; Hua WANG; Zhong-hua MIAO

    2014-01-01

    We investigate the optimization of linear impulse systems with the reinforcement learning based adaptive dynamic programming (ADP) method. For linear impulse systems, the optimal objective function is shown to be a quadric form of the pre-impulse states. The ADP method provides solutions that iteratively converge to the optimal objective function. If an initial guess of the pre-impulse objective function is selected as a quadratic form of the pre-impulse states, the objective function iteratively converges to the optimal one through ADP. Though direct use of the quadratic objective function of the states within the ADP method is theoretically possible, the numerical singularity problem may occur due to the matrix inversion therein when the system dimensionality increases. A neural network based ADP method can circumvent this problem. A neural network with polynomial activation functions is selected to approximate the pre-impulse objective function and trained iteratively using the ADP method to achieve optimal control. After a successful training, optimal impulse control can be derived. Simulations are presented for illustrative purposes.

  20. Integrating Pareto Optimization into Dynamic Programming

    Directory of Open Access Journals (Sweden)

    Thomas Gatter

    2016-01-01

    Full Text Available Pareto optimization combines independent objectives by computing the Pareto front of the search space, yielding a set of optima where none scores better on all objectives than any other. Recently, it was shown that Pareto optimization seamlessly integrates with algebraic dynamic programming: when scoring schemes A and B can correctly evaluate the search space via dynamic programming, then so can Pareto optimization with respect to A and B. However, the integration of Pareto optimization into dynamic programming opens a wide range of algorithmic alternatives, which we study in substantial detail in this article, using real-world applications in biosequence analysis, a field where dynamic programming is ubiquitous. Our results are two-fold: (1 We introduce the operation of a “Pareto algebra product” in the dynamic programming framework of Bellman’s GAP. Users of this framework can now ask for Pareto optimization with a single keystroke. Careful evaluation of the implementation alternatives by means of an extended Bellman’s GAP compiler demonstrates the dependence of the best implementation choice on the application at hand. (2 We extract from our experiments several pieces of advice to programmers who do not use a system such as Bellman’s GAP, but who choose to hand-craft their dynamic programming recurrences, incorporating Pareto optimization from scratch.

  1. A population-level model from the microscopic dynamics in Escherichia coli chemotaxis via Langevin approximation

    International Nuclear Information System (INIS)

    Recent extensive studies of Escherichia coli (E. coli) chemotaxis have achieved a deep understanding of its microscopic control dynamics. As a result, various quantitatively predictive models have been developed to describe the chemotactic behavior of E. coli motion. However, a population-level partial differential equation (PDE) that rationally incorporates such microscopic dynamics is still insufficient. Apart from the traditional Keller–Segel (K–S) equation, many existing population-level models developed from the microscopic dynamics are integro-PDEs. The difficulty comes mainly from cell tumbles which yield a velocity jumping process. Here, we propose a Langevin approximation method that avoids such a difficulty without appreciable loss of precision. The resulting model not only quantitatively reproduces the results of pathway-based single-cell simulators, but also provides new inside information on the mechanism of E. coli chemotaxis. Our study demonstrates a possible alternative in establishing a simple population-level model that allows for the complex microscopic mechanisms in bacterial chemotaxis

  2. Guidelines for dynamic international programs

    International Nuclear Information System (INIS)

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

  3. Synthesis of Large Dynamic Concurrent Programs from Dynamic Specifications

    OpenAIRE

    Attie, Paul C.

    2008-01-01

    We present a tractable method for synthesizing arbitrarily large concurrent programs, for a shared memory model with common hardware-available primitives such as atomic registers, compare-and-swap, load-linked/store conditional, etc. The programs we synthesize are dynamic: new processes can be created and added at run-time, and so our programs are not finite-state, in general. Nevertheless, we successfully exploit automatic synthesis and model-checking methods based on propositional temporal ...

  4. How to approximate viscoelastic dynamic topographies of stagnant lid planetary bodies?

    Science.gov (United States)

    Dumoulin, Caroline; Čadek, Ondřej; Choblet, Gaël

    2013-04-01

    Planetary mantles are viscoelastic media. However, since numerical models of thermal convection in a viscoelastic spherical shell are still very challenging, most of the studies concerning dynamic topography of planetary surfaces generated by mantle convection use one of the following simplified rheological set-up: i) IVF (instantaneous viscous flow), ii) viscous body with a free surface, or iii) hybrid methods combining viscous deformation and elastic filtering of the topography. Justifications for the use of such approximations instead of a fully viscoelastic rheology have been made on the basis of simple tests with step-like viscosity structures, with small to moderate viscosity contrasts. However, because the rheology of planetary materials is thermally activated, the radial stratification of viscosity is more likely to be a continuous function of depth, and global viscosity contrasts might be very large. In our study, we systematically compare viscoelastic dynamic topography induced by an internal load to topographies generated by the three different simplified approaches listed above using a realistic viscosity profile for a stagnant lid associated to the lithosphere of a one plate planete. To this purpose, we compute response functions of surface topography and geoid using three different semi-spectral models that all include self-gravitation: a) a linear Maxwell body with a pseudo free upper surface, b) a viscous body with a pseudo free upper surface, and c) a viscous body with a free-slip condition at the surface. Results obtained with this last model (IVF) can then be filtered using the elastic thin shell approximation: the effective elastic thickness then corresponds to the elastic thickness that is needed to fit the viscoelastic topography with an elastic filtering of the IVF topography. We show that the effective elastic thickness varies strongly with the degree of the load, with the depth of the load, and with the duration of the loading. These

  5. Computer program for flexible rotor dynamics analysis

    Science.gov (United States)

    Shen, F. A.

    1974-01-01

    Program analyzes general nonaxisymmetric and nonsynchronous transient and steady-state rotor dynamic performance of bending- and shear-wise flexible rotor-bearing system under various operating conditions. Program can be used as analytical study tool for general transient spin-speed and/or non-axisymmetric rotor motion.

  6. Development of a Computer Program to Compute Approximate Heat Balance for Furnace Design

    Directory of Open Access Journals (Sweden)

    O.A. Ighodalo

    2011-08-01

    Full Text Available This study presents the description of a computer program developed for purpose of carrying out an approximate heat balance for a rectangular furnace at the design stage. This is often necessary in order to determine the heat input, its expenditure and the fuel consumption. The program which was written in MATLAB estimates surface areas, calorimetric and actual furnace temperatures, input heat from fuel combustion and the heat output for metal melting, waste gases, and lining losses. Fuel requirement was obtained by equating total heat input and output. The various percentages were determined as well as the thermal indicators. The result of the application of the program to a furnace design of dimension 700×600×600 mm using gaseous fuel (Butane is presented. The percentage of heat lost through the waste gases, the unit energy consumption and coefficient of total heat utilization compare well with what is obtainable in practice as revealed in literatures. The program will be useful for furnace design purposes.

  7. Hybrid Differential Dynamic Programming with Stochastic Search

    Science.gov (United States)

    Aziz, Jonathan; Parker, Jeffrey; Englander, Jacob

    2016-01-01

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

  8. Classical dynamics of a charged particle in a laser field beyond the dipole approximation

    CERN Document Server

    Jameson, Paul

    2008-01-01

    The classical dynamics of a charged particle traveling in a laser field modeled by an elliptically polarized monochromatic electromagnetic plane wave is discussed within the time reparametrization invariant form of the non-relativistic Hamilton-Jacobi theory. The exact parametric representation for a particle's orbit in an arbitrary plane wave background beyond the dipole approximation and including effect of the magnetic field is derived. For an elliptically polarized monochromatic plane wave the particle's trajectory, as an explicit function of the laboratory frame's time, is given in terms of the Jacobian elliptic functions, whose modulus is proportional to the laser's intensity and depends on the polarization of radiation. It is shown that the system exposes the ``intensity duality'', correspondence between the motion in the backgrounds with various intensities. In virtue of the modular properties of the Jacobian functions, by starting with the representative ``fundamental solution'' and applying a certai...

  9. Object Tracking System Using Approximate Median Filter, Kalman Filter and Dynamic Template Matching

    Directory of Open Access Journals (Sweden)

    G. Mallikarjuna Rao

    2014-04-01

    Full Text Available In this work, we dealt with the tracking of single object in a sequence of frames either from a live camera or a previously saved video. A moving object is detected frame-by-frame with high accuracy and efficiency using Median approximation technique. As soon as the object has been detected, the same is tracked by kalman filter estimation technique along with a more accurate Template Matching algorithm. The templates are dynamically generated for this purpose. This guarantees any change in object pose which does not be hindered from tracking procedure. The system is capable of handling entry and exit of an object. Such a tracking scheme is cost effective and it can be used as an automated video conferencing system and also has application as a surveillance tool. Several trials of the tracking show that the approach is correct and extremely fast, and it's a more robust performance throughout the experiments.

  10. The dynamics of a spinning particle in a linear in spin Hamiltonian approximation

    CERN Document Server

    Lukes-Gerakopoulos, Georgios; Patsis, Panos A; Seyrich, Jonathan

    2016-01-01

    We investigate for order and chaos the dynamical system of a spinning test particle of mass $m$ moving in the spacetime background of a Kerr black hole of mass M. This system is approximated in our investigation by the linear in spin Hamiltonian function provided in [E. Barausse, and A. Buonanno, Phys.Rev. D 81, 084024 (2010)]. We study the corresponding phase space by using 2D projections on a surface of section and the method of color and rotation on a 4D Poincar\\'e section. Various topological structures coming from the non-integrability of the linear in spin Hamiltonian are found and discussed. Moreover, an interesting result is that from the value of the dimensionless spin $S/(m M)=10^{-4}$ of the particle and below, the impact of the non-integrability of the system on the motion of the particle seems to be negligible.

  11. Piping and fitting dynamic reliability program

    International Nuclear Information System (INIS)

    The Electric Power Research Institute (EPRI) in conjunction with the U.S. Nuclear Regulatory Commission (NRC) initiated the Piping and Fitting Dynamic Reliability (PFDR) Program. The ultimate objective of this program is to introduce new, improved, realistic and defensible ASME Code design rules which take advantage of the inherent dynamic margin in piping and which result in a more balanced piping design between infrequent dynamic loads and daily operating loads. The basis for the proposed changes in design criteria will be derived from an extensive testing program together with supporting analyses. The first of three testing programs is focusing on the behaviour of typical piping components when subjected to dynamic loading introduced through hydraulically operated sleds. A second testing program is investigating the behaviour of piping systems under dynamic loading and the third program is focusing on development of a laboratory type specimen which can be used to quantitatively evaluate low cycle fatigue in the presence of ratcheting. This paper represents a status report of results of the component tests to date

  12. Approximate pole-placement controller using inverse plant dynamics for floor vibration control

    Science.gov (United States)

    Nyawako, Donald S.; Reynolds, Paul; Hudson, Malcolm J.

    2013-04-01

    Past research and field trials have demonstrated the viability of active vibration control (AVC) technologies for the mitigation of human induced vibrations in problematic floors. They make use of smaller units than their passive counterparts, provide quicker and more efficient control, can tackle multiple modes of vibration simultaneously and adaptability can be introduced to enhance their robustness. Predominantly single-input-single-output (SISO) and multi- SISO collocated sensor and actuator pairs have been utilized in direct output feedback schemes, for example, with direct velocity feedback (DVF). On-going studies have extended such past works to include model-based control approaches, for example, pole-placement (PP), which demonstrate increased flexibility of achieving desired vibration mitigation performances but for which stability issues must be adequately addressed. The work presented here is an extension to the pole-placement controller design using an algebraic approach that has been investigated in past studies. An approximate pole-placement controller formulated via the inversion of the floor dynamics, considered as minimum phase, is designed to achieve target closed-loop performances. Analytical studies and experimental tests are based on a laboratory structure and comparisons in vibration mitigation performances are made with a typical DVF control scheme with inner loop actuator compensation. It is shown that with minimal compensation, primarily in the form of notch filters and gain adjustment, the approximate pole-placement controller scheme is easily formulated and implemented and offers good vibration mitigation performance as well as the potential for isolation and control of specific target modes of vibration. Predicted attenuations of 22dB and 12dB in both the first and second vibration modes of the laboratory structure were also realized in the experimental studies for DVF and the approximate PP controller.

  13. The structure of approximate two electron wavefunctions in intense laser driven ionization dynamics

    International Nuclear Information System (INIS)

    The structure of approximate two-electron wavefunctions in strong-field-driven ionization dynamics is investigated in depth, both theoretically and numerically. Theoretical analyses clarify that for two-electron singlet systems, the previously proposed time-dependent extended Hartree–Fock (TD-EHF) method (1995 Phys. Rev. A 51 3999) is equivalent to the multiconfiguration time-dependent Hartree–Fock method with two occupied orbitals. The latter wavefunction is further transformed into the natural expansion form, enabling the direct propagation of the natural orbitals (NOs). These methods, as well as the conventional time-dependent Hartree–Fock (TDHF) method, are numerically assessed as regards providing a description of the ionization dynamics of a one-dimensional helium atom model. This numerical analysis (i) explains the reason behind the well-known failure of the TDHF method to describe tunneling ionization, (ii) demonstrates the interpretive power of the TD-EHF wavefunction in both the original nonorthogonal formulation and the NO-based formulation, and (iii) highlights different manifestations of the electron correlation (an effect beyond the single-determinant description), in tunneling ionization, high harmonic generation, and nonsequential double ionization. Possible extensions of the NO basis approach to multielectron systems are briefly discussed. (paper)

  14. Analytical descriptions of cross-polarisation dynamics: relaxing the secular approximations

    Science.gov (United States)

    Hirschinger, J.; Raya, J.

    2015-11-01

    In this work, analytical expressions of the cross-polarisation (CP) dynamics under both static and magic-angle spinning (MAS) conditions are obtained by solving the generalised Liouville-von Neumann quantum mechanical equation beyond the standard approximations, i.e., reintroducing neglected non-secular terms in the system superoperator. Although the simple model of a two-spin system interacting with a spin bath gives a rather crude description of CP dynamics, it accounts well for the orientation dependence of CP in a static sample of ferrocene powder and permits to detect slight departures from the Hartmann-Hahn matching condition. This approach also has the advantage of yielding manageable analytical expressions that can be used even by less inclined or experienced workers to obtain results that are good enough in an operational sense. Moreover, the resulting spin diffusion rate constants containing different sources of anisotropy of the system-environment interaction as well as their dependence on the MAS frequency are related semi-quantitatively to the local network of dipolar interactions. Finally, it is shown that non-secular solutions improve significantly the analysis of CPMAS-based separated-local-field spectroscopy experimental data in the absence of homonuclear decoupling.

  15. Simple finite element methods for approximating predator-prey dynamics in two dimensions using MATLAB.

    Science.gov (United States)

    Garvie, Marcus R; Burkardt, John; Morgan, Jeff

    2015-03-01

    We describe simple finite element schemes for approximating spatially extended predator-prey dynamics with the Holling type II functional response and logistic growth of the prey. The finite element schemes generalize 'Scheme 1' in the paper by Garvie (Bull Math Biol 69(3):931-956, 2007). We present user-friendly, open-source MATLAB code for implementing the finite element methods on arbitrary-shaped two-dimensional domains with Dirichlet, Neumann, Robin, mixed Robin-Neumann, mixed Dirichlet-Neumann, and Periodic boundary conditions. Users can download, edit, and run the codes from http://www.uoguelph.ca/~mgarvie/ . In addition to discussing the well posedness of the model equations, the results of numerical experiments are presented and demonstrate the crucial role that habitat shape, initial data, and the boundary conditions play in determining the spatiotemporal dynamics of predator-prey interactions. As most previous works on this problem have focussed on square domains with standard boundary conditions, our paper makes a significant contribution to the area. PMID:25616741

  16. A Superstabilizing $\\log(n)$-Approximation Algorithm for Dynamic Steiner Trees

    CERN Document Server

    Blin, Lélia; Rovedakis, Stephane

    2009-01-01

    In this paper we design and prove correct a fully dynamic distributed algorithm for maintaining an approximate Steiner tree that connects via a minimum-weight spanning tree a subset of nodes of a network (referred as Steiner members or Steiner group) . Steiner trees are good candidates to efficiently implement communication primitives such as publish/subscribe or multicast, essential building blocks for the new emergent networks (e.g. P2P, sensor or adhoc networks). The cost of the solution returned by our algorithm is at most $\\log |S|$ times the cost of an optimal solution, where $S$ is the group of members. Our algorithm improves over existing solutions in several ways. First, it tolerates the dynamism of both the group members and the network. Next, our algorithm is self-stabilizing, that is, it copes with nodes memory corruption. Last but not least, our algorithm is \\emph{superstabilizing}. That is, while converging to a correct configuration (i.e., a Steiner tree) after a modification of the network, it...

  17. Planar multibody dynamics formulation, programming and applications

    CERN Document Server

    Nikravesh, Parviz E

    2007-01-01

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

  18. A Dynamic Programming Approach to Individual Initialization in Genetic Programming

    Czech Academy of Sciences Publication Activity Database

    Křen, T.; Neruda, Roman

    Los Alamitos: IEEE, 2015, s. 1752-1757. ISBN 978-1-4799-8696-5. [SMC 2015. International Conference on Systems, Man and Cybernetics. Hong Kong (HK), 09.10.2015-12.10.2015] R&D Projects: GA ČR GA15-18108S Grant ostatní: GA UK(CZ) 187115; SVV(CZ) 260 224 Institutional support: RVO:67985807 Keywords : genetic programming * initialization * dynamic programming Subject RIV: IN - Informatics, Computer Science

  19. Dynamic Programming Model of Health and Retirement

    OpenAIRE

    Iskhakov, Fedor

    2008-01-01

    A structural dynamic programming model is applied for modeling labour market transitions among older age workers in Norway in 1992-2003. Special attention is given to early retirement pensiion and disability pension as two major exit routes from the labour force. Health status is represented by a latent variable reflecting the eligibility for participating in disability programs. Incomplete information maximum likelihood method is used in several stages to facilitate the estimation. The model...

  20. Classical dynamics of a charged particle in a laser field beyond the dipole approximation

    Science.gov (United States)

    Jameson, Paul; Khvedelidze, Arsen

    2008-05-01

    The classical dynamics of a charged particle traveling in a laser field modeled by an elliptically polarized monochromatic electromagnetic plane wave is discussed within the time reparametrization invariant form of the nonrelativistic Hamilton-Jacobi theory. The exact parametric representation for a particle’s orbit in an arbitrary plane wave background beyond the dipole approximation and including effect of the magnetic field is derived. For an elliptically polarized monochromatic plane wave the particle’s trajectory, as an explicit function of the laboratory frame’s time, is given in terms of the Jacobian elliptic functions, whose modulus is proportional to the laser’s intensity and depends on the polarization of radiation. It is shown that the system exposes the intensity duality, correspondence between the motion in the backgrounds with various intensities. In virtue of the modular properties of the Jacobian functions, by starting with the representative “fundamental solution” and applying a certain modular transformation one can obtain the particle’s orbit in the monochromatic plane wave background with arbitrarily prescribed characteristics.

  1. Modeling Aggregation of Ionic Surfactants Using a Smeared Charge Approximation in Dissipative Particle Dynamics Simulations.

    Science.gov (United States)

    Mao, Runfang; Lee, Ming-Tsung; Vishnyakov, Aleksey; Neimark, Alexander V

    2015-09-01

    Using dissipative particle dynamics (DPD) simulations, we explore the specifics of micellization in the solutions of anionic and cationic surfactants and their mixtures. Anionic surfactant sodium dodecyl sulfate (SDS) and cationic surfactant cetyltrimethylammonium bromide (CTAB) are chosen as characteristic examples. Coarse-grained models of the surfactants are constructed and parameterized using a combination of atomistic molecular simulation and infinite dilution activity coefficient calibration. Electrostatic interactions of charged beads are treated using a smeared charge approximation: the surfactant heads and dissociated counterions are modeled as beads with charges distributed around the bead center in an implicit dielectric medium. The proposed models semiquantitatively describe self-assembly in solutions of SDS and CTAB at various surfactant concentrations and molarities of added electrolyte. In particular, the model predicts a decline in the free surfactant concentration with the increase of the total surfactant loading, as well as characteristic aggregation transitions in single-component surfactant solutions caused by the addition of salt. The calculated values of the critical micelle concentration reasonably agree with experimental observations. Modeling of catanionic SDS-CTAB mixtures show consecutive transitions to worm-like micelles and then to vesicles caused by the addition of CTAB to micellar solution of SDS. PMID:26241704

  2. Microsoft Dynamics NAV 7 programming cookbook

    CERN Document Server

    Raul, Rakesh

    2013-01-01

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

  3. Quantum optical device accelerating dynamic programming

    OpenAIRE

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

    2005-01-01

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

  4. Waste Heat Approximation for Understanding Dynamic Compression in Nature and Experiments

    Science.gov (United States)

    Jeanloz, R.

    2015-12-01

    Energy dissipated during dynamic compression quantifies the residual heat left in a planet due to impact and accretion, as well as the deviation of a loading path from an ideal isentrope. Waste heat ignores the difference between the pressure-volume isentrope and Hugoniot in approximating the dissipated energy as the area between the Rayleigh line and Hugoniot (assumed given by a linear dependence of shock velocity on particle velocity). Strength and phase transformations are ignored: justifiably, when considering sufficiently high dynamic pressures and reversible transformations. Waste heat mis-estimates the dissipated energy by less than 10-20 percent for volume compressions under 30-60 percent. Specific waste heat (energy per mass) reaches 0.2-0.3 c02 at impact velocities 2-4 times the zero-pressure bulk sound velocity (c0), its maximum possible value being 0.5 c02. As larger impact velocities are implied for typical orbital velocities of Earth-like planets, and c02 ≈ 2-30 MJ/kg for rock, the specific waste heat due to accretion corresponds to temperature rises of about 3-15 x 103 K for rock: melting accompanies accretion even with only 20-30 percent waste heat retained. Impact sterilization is similarly quantified in terms of waste heat relative to the energy required to vaporize H2O (impact velocity of 7-8 km/s, or 4.5-5 c0, is sufficient). Waste heat also clarifies the relationship between shock, multi-shock and ramp loading experiments, as well as the effect of (static) pre-compression. Breaking a shock into 2 steps significantly reduces the dissipated energy, with minimum waste heat achieved for two equal volume compressions in succession. Breaking a shock into as few as 4 steps reduces the waste heat to within a few percent of zero, documenting how multi-shock loading approaches an isentrope. Pre-compression, being less dissipative than an initial shock to the same strain, further reduces waste heat. Multi-shock (i.e., high strain-rate) loading of pre

  5. Synthesis of Large Dynamic Concurrent Programs from Dynamic Specifications

    CERN Document Server

    Attie, Paul C

    2008-01-01

    We present a tractable method for synthesizing arbitrarily large concurrent programs, for a shared memory model with common hardware-available primitives such as atomic registers, compare-and-swap, load-linked/store conditional, etc. The programs we synthesize are dynamic: new processes can be created and added at run-time, and so our programs are not finite-state, in general. Nevertheless, we successfully exploit automatic synthesis and model-checking methods based on propositional temporal logic. Our method is algorithmically efficient, with complexity polynomial in the number of component processes (of the program) that are ``alive'' at any time. Our method does not explicitly construct the automata-theoretic product of all processes that are alive, thereby avoiding \\intr{state explosion}. Instead, for each pair of processes which interact, our method constructs an automata-theoretic product (\\intr{pair-machine}) which embodies all the possible interactions of these two processes. From each pair-machine, w...

  6. Multiconfiguration time-dependent self-consistent field approximations in the numerical solution of quantum dynamical problems

    International Nuclear Information System (INIS)

    The use of the time-dependent self-consistent field approximation (TDSCF) in the numerical solution of quantum curve crossing and tunneling dynamical problems is investigated. Particular emphasis is given to multiconfiguration TDSCF (MCTDSCF) approximations, which are shown to perform considerably better with only a small increase in computational effort. We investigate a number of simple models in which a 'system' characterized by two electronic potential surfaces evolves while interacting with a 'bath' mode described by an harmonic oscillator, and compare exact numerical solutions to one- and two-configuration TDSCF approximations. We also introduce and investigate a semiclassical approximation in which the 'bath' mode is described by semiclassical wavepackets (one for each electronic state) and show that for all models investigated this scheme works very well in comparison with the fully quantum MCTDSCF approximation. This provides a potentially very useful method to simulate strongly quantum systems coupled to an essentially classical environment. (orig.)

  7. Use of periodic approximants in a dynamical LEED study of the quasicrystalline tenfold surface of decagonal Al-Ni-Co

    International Nuclear Information System (INIS)

    The determination of quasicrystal (QC) surface structures is a challenge to current surface structure techniques. Low-energy electron diffraction (LEED) is the primary technique for the determination of periodic surface structures, but application of dynamical LEED to quasicrystals requires the use of many approximations. In this study, two different approaches were used to apply dynamical LEED to the structure of the tenfold surface of decagonal Al73Ni10Co17. One method (method 1) involves the use of a quasicrystalline model along with approximations that average over the composition and local geometries. The other method (method 2) uses periodic models that approximate the actual local QC structure (approximants) in more exact, atomistic calculations. Although the results using the two methods were consistent, the results of the approximant analysis (method 2) suggested a different way to apply the approximations in method 1, resulting in a better fit between experimental and calculated beams. Thus, periodic approximant structure models can provide a simpler and more efficient method for the determination of local geometries in QC surfaces, and may also facilitate analyses using quasicrystal models

  8. On Static and Dynamic Control-Flow Information in Program Analysis and Transformation

    DEFF Research Database (Denmark)

    Damian, Daniel

    's first-order, one-pass CPS transformation, we present a simpler CPS transformation of flow information with a simpler correctness proof. We continue by exploring Shivers's time-stamps-based technique for approximating program analyses over programs with dynamic control flow. We formalize a time...

  9. Local minimization algorithms for dynamic programming equations

    OpenAIRE

    Kalise, Dante; Kröner, Axel; Kunisch, Karl

    2015-01-01

    The numerical realization of the dynamic programming principle for continuous-time optimal control leads to nonlinear Hamilton-Jacobi-Bellman equations which require the minimization of a nonlinear mapping over the set of admissible controls. This minimization is often performed by comparison over a finite number of elements of the control set. In this paper we demonstrate the importance of an accurate realization of these minimization problems and propose algorithms by which this can be achi...

  10. Dynamic Programming, Maximum Principle and Vintage Capital

    OpenAIRE

    Fabbri, Giorgio; Iacopetta, Maurizio

    2007-01-01

    We present an application of the Dynamic Programming (DP) and of the Maximum Principle (MP) to solve an optimization over time when the production function is linear in the stock of capital (Ak model). Two views of capital are considered. In one, which is embraced by the great majority of macroeconomic models, capital is homogeneous and depreciates at a constant exogenous rate. In the other view each piece of capital has its own finite productive life cycle (vintage capital). The interpretatio...

  11. Weak Dynamic Programming for Generalized State Constraints

    OpenAIRE

    Bouchard, Bruno; Nutz, Marcel

    2012-01-01

    We provide a dynamic programming principle for stochastic optimal control problems with expectation constraints. A weak formulation, using test functions and a probabilistic relaxation of the constraint, avoids restrictions related to a measurable selection but still implies the Hamilton-Jacobi-Bellman equation in the viscosity sense. We treat open state constraints as a special case of expectation constraints and prove a comparison theorem to obtain the equation for closed state constraints.

  12. Eradication of Ebola Based on Dynamic Programming

    Science.gov (United States)

    Zhu, Jia-Ming; Wang, Lu; Liu, Jia-Bao

    2016-01-01

    This paper mainly studies the eradication of the Ebola virus, proposing a scientific system, including three modules for the eradication of Ebola virus. Firstly, we build a basic model combined with nonlinear incidence rate and maximum treatment capacity. Secondly, we use the dynamic programming method and the Dijkstra Algorithm to set up M-S (storage) and several delivery locations in West Africa. Finally, we apply the previous results to calculate the total cost, production cost, storage cost, and shortage cost. PMID:27313655

  13. Eradication of Ebola Based on Dynamic Programming.

    Science.gov (United States)

    Zhu, Jia-Ming; Wang, Lu; Liu, Jia-Bao

    2016-01-01

    This paper mainly studies the eradication of the Ebola virus, proposing a scientific system, including three modules for the eradication of Ebola virus. Firstly, we build a basic model combined with nonlinear incidence rate and maximum treatment capacity. Secondly, we use the dynamic programming method and the Dijkstra Algorithm to set up M-S (storage) and several delivery locations in West Africa. Finally, we apply the previous results to calculate the total cost, production cost, storage cost, and shortage cost. PMID:27313655

  14. Joint Chance-Constrained Dynamic Programming

    Science.gov (United States)

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

    2012-01-01

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

  15. The dissipative dynamics of the field of two-photon Jaynes-Cummings model with Stark shift in dispersive approximation

    CERN Document Server

    Zhou, L; Luo, Y X

    2001-01-01

    We present the dissipative dynamics of the field of two-photon Jaynes-Cummings model (JCM) with Stark shift in dispersive approximation and investigate the influence of dissipation on entanglement. We show the coherence properties of the field can be affected by the dissipative cavity when nonlinear two-photon process is involved.

  16. On a Natural Dynamics for Linear Programming

    CERN Document Server

    Straszak, Damian

    2015-01-01

    In this paper we study dynamics inspired by Physarum polycephalum (a slime mold) for solving linear programs [NTY00, IJNT11, JZ12]. These dynamics are arrived at by a local and mechanistic interpretation of the inner workings of the slime mold and a global optimization perspective has been lacking even in the simplest of instances. Our first result is an interpretation of the dynamics as an optimization process. We show that Physarum dynamics can be seen as a steepest-descent type algorithm on a certain Riemannian manifold. Moreover, we prove that the trajectories of Physarum are in fact paths of optimizers to a parametrized family of convex programs, in which the objective is a linear cost function regularized by an entropy barrier. Subsequently, we rigorously establish several important properties of solution curves of Physarum. We prove global existence of such solutions and show that they have limits, being optimal solutions of the underlying LP. Finally, we show that the discretization of the Physarum dy...

  17. Optimization of decision rules based on dynamic programming approach

    KAUST Repository

    Zielosko, Beata

    2014-01-14

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

  18. Approximate Modified Policy Iteration

    CERN Document Server

    Scherrer, Bruno; Ghavamzadeh, Mohammad; Geist, Matthieu

    2012-01-01

    Modified policy iteration (MPI) is a dynamic programming (DP) algorithm that contains the two celebrated policy and value iteration methods. Despite its generality, MPI has not been thoroughly studied, especially its approximation form which is used when the state and/or action spaces are large or infinite. In this paper, we propose three approximate MPI (AMPI) algorithms that are extensions of the well-known approximate DP algorithms: fitted-value iteration, fitted-Q iteration, and classification-based policy iteration. We provide an error propagation analysis for AMPI that unifies those for approximate policy and value iteration. We also provide a finite-sample analysis for the classification-based implementation of AMPI (CBMPI), which is more general (and somehow contains) than the analysis of the other presented AMPI algorithms. An interesting observation is that the MPI's parameter allows us to control the balance of errors (in value function approximation and in estimating the greedy policy) in the fina...

  19. Optimal Control for Industrial Sucrose Crystallization with Action Dependent Heuristic Dynamic Programming

    OpenAIRE

    Xiaofeng Lin; Heng Zhang; Li Wei; Huixia Liu

    2009-01-01

    This paper applies a neural-network-based approximate dynamic programming (ADP) method, namely, the action dependent heuristic dynamic programming (ADHDP), to an industrial sucrose crystallization optimal control problem. The industrial sucrose crystallization is a nonlinear and slow time-varying process. It is quite difficult to establish a precise mechanism model of the crystallization, because of complex internal mechanism and interacting variables. We developed a neural network model of t...

  20. Comparison of dynamical approximation schemes for non-linear gravitational clustering

    CERN Document Server

    Melott, A L

    1994-01-01

    I report on controlled comparison of gravitational approximation schemes linear/lognormal/adhesion/frozen-flow/Zel'dovich(ZA) and ZA's second--order generalization. In the last two cases we also created new versions of the approximation by truncation, i.e., by finding an optimum smoothing window (see text) for the initial conditions. The Zel'dovich approximation, with optimized initial smoothing, worked extremely well. Its second-order generalization was slightly better. The success of our best-choice was a result of the treatment of the phases of nonlinear Fourier components. The adhesion approximation produced the most accurate nonlinear power spectrum and density distribution, but its phase errors suggest mass condensations were moved somewhat incorrectly. Due to its better reproduction of the mass density distribution function and power spectrum, adhesion might be preferred for some uses. We recommend either n-body simulations or our modified versions of ZA, depending on the purpose. Modified ZA can rapid...

  1. Ionization dynamics beyond the dipole approximation induced by the pulse envelope

    Science.gov (United States)

    Simonsen, Aleksander Skjerlie; Kjellsson, Tor; Førre, Morten; Lindroth, Eva; Selstø, Sølve

    2016-05-01

    When atoms and molecules are ionized by laser pulses of finite duration and increasingly high intensities, the validity of the much-used dipole approximation, in which the spatial dependence and magnetic component of the external field are neglected, eventually breaks down. We report that, when going beyond the dipole approximation for the description of atoms exposed to ultraviolet light, the spatial dependence of the pulse shape, the envelope, provides the dominant correction, while the spatial dependence of the carrier is negligible. We present a first-order beyond-dipole correction to the Hamiltonian which accounts exclusively for nondipole effects stemming from the carrier envelope of the pulse. We demonstrate by ab initio calculations for hydrogen that this approximation, which we refer to as the envelope approximation, reproduces the full interaction beyond the dipole approximation for absolute and differential observables and proves to be valid for a broad range of high-frequency fields. This is done both for the Schrödinger and the Dirac equation. Moreover, it is demonstrated that the envelope approximation provides an interaction-term which gives rise to faster numerical convergence in terms of partial waves compared to its exact counterpart.

  2. Thermal decay rate of a metastable state with two degrees of freedom: dynamical modeling versus approximate analytical formula

    CERN Document Server

    Gontchar, Igor

    2015-01-01

    Accuracy of the Kramers approximate formula for the thermal decay rate of the metastable state is studied for the two-dimensional potential pocket. This is done by the comparison with the quasistationary rate resulting from the dynamical modeling. It is shown that the Kramers rate is in agreement with the quasistationary rate within the statistical errors provided the absorptive border is far enough from the potential ridge restricting the metastable state. As the absorptive border (or its part) gets closer to the ridge the Kramers formula underestimate the quasistationary rate. The difference reaches approximately the factor of 2 when the absorptive border coincides with the ridge.

  3. Nonequilibrium dynamics of optical-lattice-loaded Bose-Einstein-condensate atoms: Beyond the Hartree-Fock-Bogoliubov approximation

    International Nuclear Information System (INIS)

    In this work a two-particle irreducible (2PI) closed-time-path (CTP) effective action is used to describe the nonequilibrium dynamics of a Bose-Einstein condensate selectively loaded into every third site of a one-dimensional optical lattice. The motivation of this work is the recent experimental realization of this system. Patterned loading methods may be useful for quantum computing with trapped atoms. This system also serves to illustrate many basic issues in nonequilibrium quantum-field theory pertaining to the dynamics of quantum correlations and fluctuations which goes beyond the capability of a mean-field theory. By numerically evolving in time the initial-state configuration using the Bose-Hubbard Hamiltonian an exact quantum solution is available for this system in the case of few atoms and wells. One can also use it to test various approximate methods. Under the 2PI CTP scheme with this initial configuration, three different approximations are considered: (a) the Hartree-Fock-Bogoliubov (HFB) approximation (b) the next-to-leading-order 1/N expansion of the 2PI effective action up to second order in the interaction strength, and (c) a second-order perturbative expansion in the interaction strength. We present detailed comparisons between these approximations and determine their range of validity by contrasting them with the exact many-body solution for a moderate number of atoms and wells. As a general feature we observe that because the second-order 2PI approximations include multiparticle scattering in a systematic way, they are able to capture damping effects exhibited in the exact solution, which a mean-field collisionless approach fails to produce. While the second-order approximations show a clear improvement over the HFB approximation, our numerical results show that they fail at late times, when interaction effects are significant

  4. Independent center, independent electron approximation for dynamics of molecules and clusters

    International Nuclear Information System (INIS)

    A formalism is developed for evaluating probabilities and cross sections for multiple-electron transitions in scattering of molecules and clusters by charged collision partners. First, the molecule is divided into subclusters each made up of identical centers (atoms). Within each subcluster coherent scattering from identical centers may lead to observable phase terms and a geometrical structure factor. Then, using a mean field approximation to describe the interactions between centers we obtain AI∼ summation k product keiδkIAIk. Second, the independent electron approximation for each center may be obtained by neglecting the correlation between electrons in each center. The probability amplitude for each center is then a product of single electron transition probability amplitudes, aIki, i.e. AIk≅ product iaiki. Finally, the independent subcluster approximation is introduced by neglecting the interactions between different subclusters in the molecule or cluster. The total probability amplitude then reduces to a simple product of amplitudes for each subcluster, A≅ product IAI. Limitations of this simple approximation are discussed. copyright 1996 American Institute of Physics

  5. Eradication of Ebola Based on Dynamic Programming

    Directory of Open Access Journals (Sweden)

    Jia-Ming Zhu

    2016-01-01

    Full Text Available This paper mainly studies the eradication of the Ebola virus, proposing a scientific system, including three modules for the eradication of Ebola virus. Firstly, we build a basic model combined with nonlinear incidence rate and maximum treatment capacity. Secondly, we use the dynamic programming method and the Dijkstra Algorithm to set up M-S (storage and several delivery locations in West Africa. Finally, we apply the previous results to calculate the total cost, production cost, storage cost, and shortage cost.

  6. Damping in nuclear collective modes in a semiclassical fluid-dynamical approximation

    International Nuclear Information System (INIS)

    A semiclassical fluiddynamical model based on an usual scaling approximation (SCA) was extended to investigate the role of one and two-body dissipation in the widths of nuclear collective modes. The competition between one and two-body viscosity in: i) the collisionless (elastic) limit; ii) the hydrodynamical case and iii) the general viscoelastic regime is examined over the whole range of nuclear collision time scales. Numerical solutions are investigated for the first magnetic 2- twist mode in 208Pb. (Author)

  7. Dynamics of the 12C-12C system in the static molecular mean field approximation

    International Nuclear Information System (INIS)

    The interaction between two 12C ions at low energy is investigated in the mean field (Hartree-Fock) approximation. The authors assume adiabaticity for the molecular motion and calculate the interaction energy by the constrained Hartree-Fock method, using the inderdistance d separating the two ions as the constrained quantity. This energy is calculated by using the Skyrme SIII force, without spin-orbit. (orig./AH)

  8. Approximation scheme for classical surface plasmas at strong coupling: Progress in the formulation of a dynamical theory

    International Nuclear Information System (INIS)

    A self-consistent approximation scheme is formulated for the calculation of the dynamical linear polarizability of classical electron monolayers. The derivation is carried out in two stages. In the first stage, the authors formulate a simple response function relation linking linear and quadratic polarizabilities; the dynamical coupling function is expressed entirely in terms of the latter. The basic elements in the derivation are the first BBGKY kinetic equation (prepared in the velocity average approximation) and the non-linear fluctuation-dissipation theorem. The new response function relation is exact at zero frequency and exactly satisfies the third frequency moment sum rule. In the second stage, self-consistency is guaranteed by approximating the quadratic polarizability in terms of linear ones. The theory is examined in the weak coupling limit where it is found that a dominant γ-independent non-RPA contribution to the damping is missing. The structure of the missing term is identified at arbitrary coupling strengths. Work is in progress to see how it can be incorporated into the approximation scheme. (author)

  9. Automated Flight Routing Using Stochastic Dynamic Programming

    Science.gov (United States)

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

    2010-01-01

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

  10. Runway Scheduling Using Generalized Dynamic Programming

    Science.gov (United States)

    Montoya, Justin; Wood, Zachary; Rathinam, Sivakumar

    2011-01-01

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

  11. Upper Bounds on Numerical Approximation Errors

    DEFF Research Database (Denmark)

    Raahauge, Peter

    2004-01-01

    This paper suggests a method for determining rigorous upper bounds on approximationerrors of numerical solutions to infinite horizon dynamic programming models.Bounds are provided for approximations of the value function and the policyfunction as well as the derivatives of the value function. The...... approximations of a standard (strictly concave)growth model.KEYWORDS: Numerical approximation errors, Bellman contractions, Error bounds...

  12. An approximate solution for interlaminar stresses in laminated composites: Applied mechanics program

    Science.gov (United States)

    Rose, Cheryl A.; Herakovich, Carl T.

    1992-01-01

    An approximate solution for interlaminar stresses in finite width, laminated composites subjected to uniform extensional, and bending loads is presented. The solution is based upon the principle of minimum complementary energy and an assumed, statically admissible stress state, derived by considering local material mismatch effects and global equilibrium requirements. The stresses in each layer are approximated by polynomial functions of the thickness coordinate, multiplied by combinations of exponential functions of the in-plane coordinate, expressed in terms of fourteen unknown decay parameters. Imposing the stationary condition of the laminate complementary energy with respect to the unknown variables yields a system of fourteen non-linear algebraic equations for the parameters. Newton's method is implemented to solve this system. Once the parameters are known, the stresses can be easily determined at any point in the laminate. Results are presented for through-thickness and interlaminar stress distributions for angle-ply, cross-ply (symmetric and unsymmetric laminates), and quasi-isotropic laminates subjected to uniform extension and bending. It is shown that the solution compares well with existing finite element solutions and represents an improved approximate solution for interlaminar stresses, primarily at interfaces where global equilibrium is satisfied by the in-plane stresses, but large local mismatch in properties requires the presence of interlaminar stresses.

  13. A quadratic approximation-based algorithm for the solution of multiparametric mixed-integer nonlinear programming problems

    KAUST Repository

    Domínguez, Luis F.

    2012-06-25

    An algorithm for the solution of convex multiparametric mixed-integer nonlinear programming problems arising in process engineering problems under uncertainty is introduced. The proposed algorithm iterates between a multiparametric nonlinear programming subproblem and a mixed-integer nonlinear programming subproblem to provide a series of parametric upper and lower bounds. The primal subproblem is formulated by fixing the integer variables and solved through a series of multiparametric quadratic programming (mp-QP) problems based on quadratic approximations of the objective function, while the deterministic master subproblem is formulated so as to provide feasible integer solutions for the next primal subproblem. To reduce the computational effort when infeasibilities are encountered at the vertices of the critical regions (CRs) generated by the primal subproblem, a simplicial approximation approach is used to obtain CRs that are feasible at each of their vertices. The algorithm terminates when there does not exist an integer solution that is better than the one previously used by the primal problem. Through a series of examples, the proposed algorithm is compared with a multiparametric mixed-integer outer approximation (mp-MIOA) algorithm to demonstrate its computational advantages. © 2012 American Institute of Chemical Engineers (AIChE).

  14. On generalized and approximative symmetry properties of quantum-mechanical and classical dynamical systems

    International Nuclear Information System (INIS)

    We consider symmetry properties of differential equations in non-relativistic quantum mechanics and classical mechanics. Special emphasis is given to periodically driven systems. For a model system connections between symmetries of corresponding classical and quantal systems are established. The fundamental difference between variational symmetries and symmetries of the Euler-Lagrange-equations is discussed for the special case of classical mechanics. For nonintegrable systems with quasiregular regions in phase space we introduce the notion of approximate symmetry. As an example, we demonstrate the accuracy of such symmetry properties in certain domains of phase space for a periodically driven anharmonic oscillator. (orig.)

  15. Approximate expression for the dynamic structure factor in the Lieb-Liniger model

    OpenAIRE

    Cherny, Alexander Yu.; Brand, Joachim

    2009-01-01

    Recently, Imambekov and Glazman [Phys. Rev. Lett. 100, 206805 (2008)] showed that the dynamic structure factor (DSF) of the 1D Bose gas demonstrates power-law behaviour along the limiting dispersion curve of the collective modes and calculated the corresponding exponents exactly. Combining these recent results with a previously obtained strong-coupling expansion we present an interpolation formula for the DSF of the 1D Bose gas. The obtained expression is further consistent with exact low ene...

  16. Equilibria of dynamic games with many players: Existence, approximation, and market structure

    OpenAIRE

    Adlakha, Sachin; Johari, Ramesh; Gabriel Y. Weintraub

    2015-01-01

    In this paper we study stochastic dynamic games with many players; these are a fundamental model for a wide range of economic applications. The standard solution concept for such games is Markov perfect equilibrium (MPE), but it is well known that MPE computation becomes intractable as the number of players increases. We instead consider the notion of stationary equilibrium (SE), where players optimize assuming the empirical distribution of others' states remains constant at its long run aver...

  17. Dynamics of a working process approximated to combustion at constant pressure

    OpenAIRE

    Andrusenko Oleg Evgenevich; Matveev Yury Ivanovich; Andrusenko Sergey Evgenevich

    2011-01-01

    The process of fuel combustion in the cylinder is considered in the paper. The interaction of the fuel combustion process with the gas distribution system and the fuel injection into the cylinder is investigated. The interconnection of the advance angle of fuel injection with the dynamics of loads on engine parts is studied. Experimental observations connected with fuel adjustment and parameter changes in working processes of the diesel engine are described. Practical advice is also given to ...

  18. Communication: On the consistency of approximate quantum dynamics simulation methods for vibrational spectra in the condensed phase

    International Nuclear Information System (INIS)

    Including quantum mechanical effects on the dynamics of nuclei in the condensed phase is challenging, because the complexity of exact methods grows exponentially with the number of quantum degrees of freedom. Efforts to circumvent these limitations can be traced down to two approaches: methods that treat a small subset of the degrees of freedom with rigorous quantum mechanics, considering the rest of the system as a static or classical environment, and methods that treat the whole system quantum mechanically, but using approximate dynamics. Here, we perform a systematic comparison between these two philosophies for the description of quantum effects in vibrational spectroscopy, taking the Embedded Local Monomer model and a mixed quantum-classical model as representatives of the first family of methods, and centroid molecular dynamics and thermostatted ring polymer molecular dynamics as examples of the latter. We use as benchmarks D2O doped with HOD and pure H2O at three distinct thermodynamic state points (ice Ih at 150 K, and the liquid at 300 K and 600 K), modeled with the simple q-TIP4P/F potential energy and dipole moment surfaces. With few exceptions the different techniques yield IR absorption frequencies that are consistent with one another within a few tens of cm−1. Comparison with classical molecular dynamics demonstrates the importance of nuclear quantum effects up to the highest temperature, and a detailed discussion of the discrepancies between the various methods let us draw some (circumstantial) conclusions about the impact of the very different approximations that underlie them. Such cross validation between radically different approaches could indicate a way forward to further improve the state of the art in simulations of condensed-phase quantum dynamics

  19. Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation

    Institute of Scientific and Technical Information of China (English)

    Da-chuan; XU; Shu-zhong; ZHANG

    2007-01-01

    In this paper,we consider a class of quadratic maximization problems.For a subclass of the problems,we show that the SDP relaxation approach yields an approximation solution with the ratio is dependent on the data of the problem with α being a uniform lower bound.In light of this new bound,we show that the actual worst-case performance ratio of the SDP relaxation approach (with the triangle inequalities added) is at least α + δd if every weight is strictly positive,where δd > 0 is a constant depending on the problem dimension and data.

  20. Versatile and declarative dynamic programming using pair algebras

    Directory of Open Access Journals (Sweden)

    Giegerich Robert

    2005-09-01

    Full Text Available Abstract Background Dynamic programming is a widely used programming technique in bioinformatics. In sharp contrast to the simplicity of textbook examples, implementing a dynamic programming algorithm for a novel and non-trivial application is a tedious and error prone task. The algebraic dynamic programming approach seeks to alleviate this situation by clearly separating the dynamic programming recurrences and scoring schemes. Results Based on this programming style, we introduce a generic product operation of scoring schemes. This leads to a remarkable variety of applications, allowing us to achieve optimizations under multiple objective functions, alternative solutions and backtracing, holistic search space analysis, ambiguity checking, and more, without additional programming effort. We demonstrate the method on several applications for RNA secondary structure prediction. Conclusion The product operation as introduced here adds a significant amount of flexibility to dynamic programming. It provides a versatile testbed for the development of new algorithmic ideas, which can immediately be put to practice.

  1. Programs for least square approximation and graphic display in an experimental data processing computer

    International Nuclear Information System (INIS)

    In the experimental data processing computer PANAFACOM U-400 in the Institute of Plasma Physics, Nagoya University, general purpose programs have been prepared for checking on the data stored in it. These programs were originally developed for use in the on-line data processing system for JIPP T-2 experiment. They are in two subroutines for obtaining straight lines best fitting data points by the method of least squares and several subroutines for the graphic display of data points. With the subroutines, graphic display, statistical processing and the display of its results can be carried out for experimental data. The programs are cataloged as execution load modules in disk files. In case of using them, it is necessary only to assign required arguments and then call the subroutines by FORTRAN CALL statements. The graphic display subroutines are based on the standard GRASP of U-400 graphic processing software. No knowledge of GRASP is required, however. Users can readily use the programs only by referring to the present report. (J.P.N.)

  2. Optimal Control for Industrial Sucrose Crystallization with Action Dependent Heuristic Dynamic Programming

    Directory of Open Access Journals (Sweden)

    Xiaofeng Lin

    2009-10-01

    Full Text Available This paper applies a neural-network-based approximate dynamic programming (ADP method, namely, the action dependent heuristic dynamic programming (ADHDP, to an industrial sucrose crystallization optimal control problem. The industrial sucrose crystallization is a nonlinear and slow time-varying process. It is quite difficult to establish a precise mechanism model of the crystallization, because of complex internal mechanism and interacting variables. We developed a neural network model of the crystallization based on the data from the actual sugar boiling process of sugar refinery. The ADHDP is a learningand approximation-based approach which can solve the optimization control problem of nonlinear system. The paper covers the basic principle of this learning scheme and the design of neural network controller based on the approach. The result of simulation shows the controller based on action dependent heuristic dynamic programming approach can optimize industrial sucrose crystallization.

  3. RIMBAY - a multi-approximation 3D ice-dynamics model for comprehensive applications: model description and examples

    Science.gov (United States)

    Thoma, M.; Grosfeld, K.; Barbi, D.; Determann, J.; Goeller, S.; Mayer, C.; Pattyn, F.

    2014-01-01

    Glaciers and ice caps exhibit currently the largest cryospheric contributions to sea level rise. Modelling the dynamics and mass balance of the major ice sheets is therefore an important issue to investigate the current state and the future response of the cryosphere in response to changing environmental conditions, namely global warming. This requires a powerful, easy-to-use, versatile multi-approximation ice dynamics model. Based on the well-known and established ice sheet model of Pattyn (2003) we develop the modular multi-approximation thermomechanic ice model RIMBAY, in which we improve the original version in several aspects like a shallow ice-shallow shelf coupler and a full 3D-grounding-line migration scheme based on Schoof's (2007) heuristic analytical approach. We summarise the full Stokes equations and several approximations implemented within this model and we describe the different numerical discretisations. The results are cross-validated against previous publications dealing with ice modelling, and some additional artificial set-ups demonstrate the robustness of the different solvers and their internal coupling. RIMBAY is designed for an easy adaption to new scientific issues. Hence, we demonstrate in very different set-ups the applicability and functionality of RIMBAY in Earth system science in general and ice modelling in particular.

  4. Goal representation heuristic dynamic programming on maze navigation.

    Science.gov (United States)

    Ni, Zhen; He, Haibo; Wen, Jinyu; Xu, Xin

    2013-12-01

    Goal representation heuristic dynamic programming (GrHDP) is proposed in this paper to demonstrate online learning in the Markov decision process. In addition to the (external) reinforcement signal in literature, we develop an adaptively internal goal/reward representation for the agent with the proposed goal network. Specifically, we keep the actor-critic design in heuristic dynamic programming (HDP) and include a goal network to represent the internal goal signal, to further help the value function approximation. We evaluate our proposed GrHDP algorithm on two 2-D maze navigation problems, and later on one 3-D maze navigation problem. Compared to the traditional HDP approach, the learning performance of the agent is improved with our proposed GrHDP approach. In addition, we also include the learning performance with two other reinforcement learning algorithms, namely Sarsa(λ) and Q-learning, on the same benchmarks for comparison. Furthermore, in order to demonstrate the theoretical guarantee of our proposed method, we provide the characteristics analysis toward the convergence of weights in neural networks in our GrHDP approach. PMID:24805221

  5. Approximate solution algorithm for multi-parametric non-convex programming problems with polyhedral constraints

    Directory of Open Access Journals (Sweden)

    Abay Molla Kassa

    2014-07-01

    Full Text Available In this paper, we developed a novel algorithmic approach for thesolution of multi-parametric non-convex programming problems withcontinuous decision variables. The basic idea of the proposedapproach is based on successive convex relaxation of each non-convexterms and sensitivity analysis theory. The proposed algorithm isimplemented using MATLAB software package and numericalexamples are presented to illustrate the effectiveness andapplicability of the proposed method on multi-parametric non-convexprogramming problems with polyhedral constraints.

  6. Dynamically Computing Approximate Frequency Counts in Sliding Window over Data Stream

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    This paper presents two one-pass algorithms for dynamically computing frequency counts in sliding window over a data stream-computing frequency counts exceeding user-specified threshold ε. The first algorithm constructs sub-windows and deletes expired sub-windows periodically in sliding window, and each sub-window maintains a summary data structure. The first algorithm outputs at most 1/ε + 1 elements for frequency queries over the most recent N elements. The second algorithm adapts multiple levels method to deal with data stream. Once the sketch of the most recent N elements has been constructed, the second algorithm can provides the answers to the frequency queries over the most recent n(n≤N) elements. The second algorithm outputs at most 1/ε+2 elements. The analytical and experimental results show that our algorithms are accurate and effective.

  7. Dynamic Proportional Reinsurance and Approximations for Ruin Probabilities in the Two-Dimensional Compound Poisson Risk Model

    Directory of Open Access Journals (Sweden)

    Yan Li

    2012-01-01

    Full Text Available We consider the dynamic proportional reinsurance in a two-dimensional compound Poisson risk model. The optimization in the sense of minimizing the ruin probability which is defined by the sum of subportfolio is being ruined. Via the Hamilton-Jacobi-Bellman approach we find a candidate for the optimal value function and prove the verification theorem. In addition, we obtain the Lundberg bounds and the Cramér-Lundberg approximation for the ruin probability and show that as the capital tends to infinity, the optimal strategies converge to the asymptotically optimal constant strategies. The asymptotic value can be found by maximizing the adjustment coefficient.

  8. Tails of the dynamical structure factor of 1D spinless fermions beyond the Tomonaga-Luttinger approximation

    International Nuclear Information System (INIS)

    We consider one-dimensional interacting spinless fermions with a non-linear spectrum in a clean quantum wire (non-linear bosonization). We compute diagrammatically the one-dimensional dynamical structure factor, S(ω, q), beyond the Tomonaga-Luttinger approximation focusing on its tails, i.e. vertical bar ω vertical bar >> vq. We provide a re-derivation, through diagrammatics, of the result of Pustilnik, Mishchenko, Glazman, and Andreev. We also extend their results to finite temperatures and long-range interactions. As applications we determine curvature and interaction corrections to the small- momentum, high-frequency conductivity and the electron-electron scattering rate. (author)

  9. Approximate P-wave ray tracing and dynamic ray tracing in weakly orthorhombic media of varying symmetry orientation

    KAUST Repository

    Masmoudi, Nabil

    2014-01-01

    We present an approximate, but efficient and sufficiently accurate P-wave ray tracing and dynamic ray tracing procedure for 3D inhomogeneous, weakly orthorhombic media with varying orientation of symmetry planes. In contrast to commonly used approaches, the orthorhombic symmetry is preserved at any point of the model. The model is described by six weak-anisotropy parameters and three Euler angles, which may vary arbitrarily, but smoothly, throughout the model. We use the procedure for the calculation of rays and corresponding two-point traveltimes in a VSP experiment in a part of the BP benchmark model generalized to orthorhombic symmetry.

  10. Speed of sound in solid molecular hydrogen-deuterium: Quantum Molecular Dynamics Approximation

    Science.gov (United States)

    Guerrero, Carlo Luis; Perlado, Jose Manuel

    2016-05-01

    Uniformity of the solid layer is one of the critical points for an efficient ignition of the Deuterium-Tritium (DT) target. During the compression process this layer, perturbations grow as the Rayleigh-Taylor instability. Knowing the mechanical properties of this layer and its thermo-mechanical limits is necessary if we want to control or to minimize these instabilities. In this work we have used a simplified approach, replacing the DT ice system with a mixture of hydrogen-deuterium (HD) because beta decay of tritium complicates the analysis in the former case. Through simulation with ab initio methods we have calculated the elastic constants, the bulk modulus and sound velocity for hydrogen isotopes in solid molecular state. In this work we present the results for hydrogen-deuterium mixtures 50%-50%, at 15 K and with a compression which covers the range of 1 to 15 GPa. This system is interesting for study the early stages of the dynamic compression and provides conditions that are close to the manufacture of DT target in inertial confinement fusion. Discontinuities in the curve that have been observed on pure hydrogen, which are associated with phase transitions and the phase hysteresis.

  11. Quantum dynamics of incoherently driven V-type system: Analytic solutions beyond the secular approximation

    CERN Document Server

    Dodin, Amro; Brumer, Paul

    2015-01-01

    We present closed-form analytic solutions to non-secular Bloch-Redfield master equations for quantum dynamics of a V-type system driven by weak coupling to a thermal bath. We focus on noise-induced Fano coherences among the excited states induced by incoherent driving of the V-system initially in the ground state. For suddenly turned-on incoherent driving, the time evolution of the coherences is determined by the damping parameter $\\zeta=\\frac{1}{2}(\\gamma_1+\\gamma_2)/\\Delta_p$, where $\\gamma_i$ are the radiative decay rates of the excited levels $i=1,2$, and $\\Delta_p=\\sqrt{\\Delta^2 + (1-p^2)\\gamma_1\\gamma_2}$ depends on the excited-state level splitting $\\Delta>0$ and the angle between the transition dipole moments in the energy basis. The coherences oscillate as a function of time in the underdamped limit ($\\zeta\\gg1$), approach a long-lived quasi-steady state in the overdamped limit ($\\zeta\\ll 1$), and display an intermediate behavior at critical damping ($\\zeta= 1$). The sudden incoherent turn-on generat...

  12. Quantum dynamics of incoherently driven V-type systems: Analytic solutions beyond the secular approximation.

    Science.gov (United States)

    Dodin, Amro; Tscherbul, Timur V; Brumer, Paul

    2016-06-28

    Closed-form analytic solutions to non-secular Bloch-Redfield master equations for quantum dynamics of a V-type system driven by weak coupling to a thermal bath, relevant to light harvesting processes, are obtained and discussed. We focus on noise-induced Fano coherences among the excited states induced by incoherent driving of the V-system initially in the ground state. For suddenly turned-on incoherent driving, the time evolution of the coherences is determined by the damping parameter ζ=12(γ1+γ2)/Δp, where γi are the radiative decay rates of the excited levels i = 1, 2, and Δp=Δ(2)+(1-p(2))γ1γ2 depends on the excited-state level splitting Δ > 0 and the angle between the transition dipole moments in the energy basis. The coherences oscillate as a function of time in the underdamped limit (ζ ≫ 1), approach a long-lived quasi-steady state in the overdamped limit (ζ ≪ 1), and display an intermediate behavior at critical damping (ζ = 1). The sudden incoherent turn-on is shown to generate a mixture of excited eigenstates |e1〉 and |e2〉 and their in-phase coherent superposition |ϕ+〉=1r1+r2(r1|e1〉+r2|e2〉), which is remarkably long-lived in the overdamped limit (where r1 and r2 are the incoherent pumping rates). Formation of this coherent superposition enhances the decay rate from the excited states to the ground state. In the strongly asymmetric V-system where the coupling strengths between the ground state and the excited states differ significantly, additional asymptotic quasistationary coherences are identified, which arise due to slow equilibration of one of the excited states. Finally, we demonstrate that noise-induced Fano coherences are maximized with respect to populations when r1 = r2 and the transition dipole moments are fully aligned. PMID:27369498

  13. Quantum dynamics of incoherently driven V-type systems: Analytic solutions beyond the secular approximation

    Science.gov (United States)

    Dodin, Amro; Tscherbul, Timur V.; Brumer, Paul

    2016-06-01

    Closed-form analytic solutions to non-secular Bloch-Redfield master equations for quantum dynamics of a V-type system driven by weak coupling to a thermal bath, relevant to light harvesting processes, are obtained and discussed. We focus on noise-induced Fano coherences among the excited states induced by incoherent driving of the V-system initially in the ground state. For suddenly turned-on incoherent driving, the time evolution of the coherences is determined by the damping parameter ζ = /1 2 ( γ 1 + γ 2) / Δ p , where γi are the radiative decay rates of the excited levels i = 1, 2, and Δ p = √{ Δ 2 + ( 1 - p 2) γ 1 γ 2 } depends on the excited-state level splitting Δ > 0 and the angle between the transition dipole moments in the energy basis. The coherences oscillate as a function of time in the underdamped limit (ζ ≫ 1), approach a long-lived quasi-steady state in the overdamped limit (ζ ≪ 1), and display an intermediate behavior at critical damping (ζ = 1). The sudden incoherent turn-on is shown to generate a mixture of excited eigenstates |e1> and |e2> and their in-phase coherent superposition | ϕ + > = /1 √{ r 1 + r 2 } ( √{ r 1 } | e 1 > + √{ r 2 } | e 2 >) , which is remarkably long-lived in the overdamped limit (where r1 and r2 are the incoherent pumping rates). Formation of this coherent superposition enhances the decay rate from the excited states to the ground state. In the strongly asymmetric V-system where the coupling strengths between the ground state and the excited states differ significantly, additional asymptotic quasistationary coherences are identified, which arise due to slow equilibration of one of the excited states. Finally, we demonstrate that noise-induced Fano coherences are maximized with respect to populations when r1 = r2 and the transition dipole moments are fully aligned.

  14. Spatial cluster detection using dynamic programming

    Directory of Open Access Journals (Sweden)

    Sverchkov Yuriy

    2012-03-01

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

  15. CaMKII activation and dynamics are independent of the holoenzyme structure: an infinite subunit holoenzyme approximation

    International Nuclear Information System (INIS)

    The combinatorial explosion produced by the multi-state, multi-subunit character of CaMKII has made analysis and modeling of this key signaling protein a significant challenge. Using rule-based and particle-based approaches, we construct exact models of CaMKII holoenzyme dynamics and study these models as a function of the number of subunits per holoenzyme, N. Without phosphatases the dynamics of activation are independent of the holoenzyme structure unless phosphorylation significantly alters the kinase activity of a subunit. With phosphatases the model is independent of holoenzyme size for N > 6. We introduce an infinite subunit holoenzyme approximation (ISHA), which simplifies the modeling by eliminating the combinatorial complexities encountered in any finite holoenzyme model. The ISHA is an excellent approximation to the full system over a broad range of physiologically relevant parameters. Finally, we demonstrate that the ISHA reproduces the behavior of exact models during synaptic plasticity protocols, which justifies its use as a module in large models of synaptic plasticity. (paper)

  16. Approximate and detailed analyses for structures of reactor containment buildings, using three-dimensional computer program

    International Nuclear Information System (INIS)

    Three-dimensional programs were developed and proved to be fast and reliable tools for the analysis in each phase of the design of nuclear reactor building structures. Short descriptions and size of models used are given for the following analyses: preliminary analysis for all structures of a BWR reactor containment building; preliminary analysis for selection of structural solution of a reactor pedestal structure; independent checking analysis for the primary containment structures of a BWR; independent checking analysis of a reactor shield structure, and test analysis with a simplified model for the seismic response analysis of a reactor drywell structure. Description of analysis and model sizes for two complex structures is also given: building structure of a breeder reactor with detailed non-linear analysis of the internal support structure for 30 million pound hypothetic accident loads. Model sizes: 1570 and 1032 nodes respectively. Drywell structure, which serves as a primary containment and also carries the weight of the upper fuel pools. Loading conditions include internal and external pressures, thermal, seismic and other loads. Model size: 1350 nodes

  17. Methods for determination and approximation of the domain of attraction in the case of autonomous discrete dynamical systems

    Directory of Open Access Journals (Sweden)

    Grigis A

    2006-01-01

    Full Text Available A method for determination and two methods for approximation of the domain of attraction Da(0 of the asymptotically stable zero steady state of an autonomous, ℝ-analytical, discrete dynamical system are presented. The method of determination is based on the construction of a Lyapunov function V, whose domain of analyticity is Da(0. The first method of approximation uses a sequence of Lyapunov functions Vp, which converge to the Lyapunov function V on Da(0. Each Vp defines an estimate Np of Da(0. For any x ∈ Da(0, there exists an estimate which contains x. The second method of approximation uses a ball B(R ⊂ Da(0 which generates the sequence of estimates Mp = f-p(B(R. For any x ∈ Da(0, there exists an estimate which contains x. The cases ||∂0f||<1 and ρ(∂0f < 1 ≤||∂0f|| are treated separately because significant differences occur.

  18. A Dynamic Programming Approach to Adaptive Fractionation

    CERN Document Server

    Ramakrishnan, Jagdish; Bortfeld, Thomas; Tsitsiklis, John

    2011-01-01

    We formulate a previously introduced adaptive fractionation problem in a dynamic programming (DP) framework and explore various solution techniques. The two messages of this paper are: (i) the DP model is a useful framework for studying adaptive radiation therapy, particularly adaptive fractionation, and (ii) there is a potential for substantial decrease in dose to the primary organ-at-risk (OAR), or equivalently increase in tumor escalation, when using an adaptive fraction size. The essence of adaptive fractionation is to increase the fraction size when observing a "favorable" anatomy or when the tumor and OAR are far apart and to decrease the fraction size when they are close together. Given that a fixed prescribed dose must be delivered to the tumor over the course of the treatment, such an approach results in a lower cumulative dose to the OAR when compared to that resulting from standard fractionation. We first establish a benchmark by using the DP algorithm to solve the problem exactly. In this case, we...

  19. Segmentation of Indus Texts: A Dynamic Programming Approach.

    Science.gov (United States)

    Siromoney, Gift; Huq, Abdul

    1988-01-01

    Demonstrates how a dynamic programing algorithm can be developed to segment unusually long written inscriptions from the Indus Valley Civilization. Explains the problem of segmentation, discusses the dynamic programing algorithm used, and includes tables which illustrate the segmentation of the inscriptions. (GEA)

  20. Electric Double-Layer Structure in Primitive Model Electrolytes. Comparing Molecular Dynamics with Local-Density Approximations

    International Nuclear Information System (INIS)

    We evaluate the accuracy of local-density approximations (LDAs) using explicit molecular dynamics simulations of binary electrolytes comprised of equisized ions in an implicit solvent. The Bikerman LDA, which considers ions to occupy a lattice, poorly captures excluded volume interactions between primitive model ions. Instead, LDAs based on the Carnaha-Starling (CS) hard-sphere equation of state capture simulated values of ideal and excess chemical potential profiles extremely well, as is the relationship between surface charge density and electrostatic potential. Excellent agreement between the EDL capacitances predicted by CS-LDAs and computed in molecular simulations is found even in systems where ion correlations drive strong density and free charge oscillations within the EDL, despite the inability of LDAs to capture the oscillations in the detailed EDL profiles

  1. ALPprolog --- A New Logic Programming Method for Dynamic Domains

    CERN Document Server

    Drescher, Conrad

    2011-01-01

    Logic programming is a powerful paradigm for programming autonomous agents in dynamic domains, as witnessed by languages such as Golog and Flux. In this work we present ALPprolog, an expressive, yet efficient, logic programming language for the online control of agents that have to reason about incomplete information and sensing actions.

  2. Combining a reactive potential with a harmonic approximation for molecular dynamics simulation of failure: construction of a reduced potential

    International Nuclear Information System (INIS)

    Molecular dynamics is a simulation technique that can be used to study failure in solids, provided the inter-atomic potential energy is able to account for the complex mechanisms at failure. Reactive potentials fitted on ab initio results or on experimental values have the ability to adapt to any complex atomic arrangement and, therefore, are suited to simulate failure. But the complexity of these potentials, together with the size of the systems considered, make simulations computationally expensive. In order to improve the efficiency of numerical simulations, simpler harmonic potentials can be used instead of complex reactive potentials in the regions where the system is close to its ground state and a harmonic approximation reasonably fits the actual reactive potential. However the validity and precision of such an approach has not been investigated in detail yet. We present here a methodology for constructing a reduced potential and combining it with the reactive one. We also report some important features of crack propagation that may be affected by the coupling of reactive and reduced potentials. As an illustrative case, we model a crystalline two-dimensional material (graphene) with a reactive empirical bond-order potential (REBO) or with harmonic potentials made of bond and angle springs that are designed to reproduce the second order approximation of REBO in the ground state. We analyze the consistency of this approximation by comparing the mechanical behavior and the phonon spectra of systems modeled with these potentials. These tests reveal when the anharmonicity effects appear. As anharmonic effects originate from strain, stress or temperature, the latter quantities are the basis for establishing coupling criteria for on the fly substitution in large simulations

  3. Reduction of dimensionality in dynamic programming-based solution methods for nonlinear integer programming

    OpenAIRE

    A. J. G. Babu; Balasubramanian Ram

    1988-01-01

    This paper suggests a method of formulating any nonlinear integer programming problem, with any number of constraints, as an equivalent single constraint problem, thus reducing the dimensionality of the associated dynamic programming problem.

  4. Hybrid dynamic modeling of Escherichia coli central metabolic network combining Michaelis–Menten and approximate kinetic equations

    DEFF Research Database (Denmark)

    Costa, Rafael S.; Machado, Daniel; Rocha, Isabel;

    2010-01-01

    The construction of dynamic metabolic models at reaction network level requires the use of mechanistic enzymatic rate equations that comprise a large number of parameters. The lack of knowledge on these equations and the difficulty in the experimental identification of their associated parameters...... using the hybrid model composed of Michaelis–Menten and the approximate lin-log kinetics indicate that this is a possible suitable approach to model complex large-scale networks where the exact rate laws are unknown.......The construction of dynamic metabolic models at reaction network level requires the use of mechanistic enzymatic rate equations that comprise a large number of parameters. The lack of knowledge on these equations and the difficulty in the experimental identification of their associated parameters......, represent nowadays the limiting factor in the construction of such models. In this study, we compare four alternative modeling approaches based on Michaelis–Menten kinetics for the bi-molecular reactions and different types of simplified rate equations for the remaining reactions (generalized mass action...

  5. Improving approximate-optimized effective potentials by imposing exact conditions: Theory and applications to electronic statics and dynamics

    International Nuclear Information System (INIS)

    We develop a method that can constrain any local exchange-correlation potential to preserve basic exact conditions. Using the method of Lagrange multipliers, we calculate for each set of given Kohn-Sham orbitals a constraint-preserving potential which is closest to the given exchange-correlation potential. The method is applicable to both the time-dependent (TD) and independent cases. The exact conditions that are enforced for the time-independent case are Galilean covariance, zero net force and torque, and Levy-Perdew virial theorem. For the time-dependent case we enforce translational covariance, zero net force, Levy-Perdew virial theorem, and energy balance. We test our method on the exchange (only) Krieger-Li-Iafrate (xKLI) approximate-optimized effective potential for both cases. For the time-independent case, we calculated the ground state properties of some hydrogen chains and small sodium clusters for some constrained xKLI potentials and Hartree-Fock (HF) exchange. The results (total energy, Kohn-Sham eigenvalues, polarizability, and hyperpolarizability) indicate that enforcing the exact conditions is not important for these cases. On the other hand, in the time-dependent case, constraining both energy balance and zero net force yields improved results relative to TDHF calculations. We explored the electron dynamics in small sodium clusters driven by cw laser pulses. For each laser pulse we compared calculations from TD constrained xKLI, TD partially constrained xKLI, and TDHF. We found that electron dynamics such as electron ionization and moment of inertia dynamics for the constrained xKLI are most similar to the TDHF results. Also, energy conservation is better by at least one order of magnitude with respect to the unconstrained xKLI. We also discuss the problems that arise in satisfying constraints in the TD case with a non-cw driving force.

  6. Dynamic Internship Programs: Comparison Between Two Universities

    OpenAIRE

    Mark C. Wallace

    2012-01-01

    Internship and experiential learning programs are compared between The University of Rhode Island (URI), Department of Natural Resources Science (1992-1996), and Texas Tech University (TTU), Department of Natural Resources Management (1997-current) through the periods in which I was associated with them. I review and compare the kinds of administrative support and faculty involvement, the numbers of students and kinds of opportunities provided in each program. Programs differed markedly: URI ...

  7. Granular contact dynamics using mathematical programming methods

    DEFF Research Database (Denmark)

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

    2012-01-01

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

  8. Dynamic Programming Algorithms in Speech Recognition

    Directory of Open Access Journals (Sweden)

    Titus Felix FURTUNA

    2008-01-01

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

  9. Capacities, Measurable Selection and Dynamic Programming Part I: Abstract Framework

    OpenAIRE

    Karoui, Nicole El; Tan, Xiaolu

    2013-01-01

    We give a brief presentation of the capacity theory and show how it derives naturally a measurable selection theorem following the approach of Dellacherie (1972). Then we present the classical method to prove the dynamic programming of discrete time stochastic control problem, using measurable selection arguments. At last, we propose a continuous time extension, that is an abstract framework for the continuous time dynamic programming principle (DPP).

  10. Applying dynamic programming to a gas-lift optimization problem

    Energy Technology Data Exchange (ETDEWEB)

    Camponogara, Eduardo; Nakashima, Paulo H.R. [Santa Catarina Univ., Florianopolis (Brazil). Dept. de Automacao e Sistemas]. E-mails: camponog@das.ufsc.br; phrn@das.ufsc.br

    2003-07-01

    The ever-increasing demand for nonrenewable resources and the pressure from stockholders are two forces pressing the oil industry for higher efficiency. The opportunities for advances abound in all sectors of the industry, in particular production processes in gas-lift oil wells, which are often favored to draw oil from high-depth reservoirs. Of concern in this paper is the task of distributing the limited supply of gas to the wells so as to induce an optimal oil production. Narrowing this task to the steady-state response of the wells gives rise to the gas-lift optimization problem, whose variables decide which wells should be active as well as the gas-injection and whose objective is profit maximization. The paper elaborates on a few properties of the problem and delivers a dynamic programming algorithm to find approximate solutions. The effectiveness of the algorithm was demonstrated by contrasting its solutions against upper bounds obtained with continuous relaxation. As closure, the paper outlines a few directions for future research. (author)

  11. Optimal Control of a Fed-batch Fermentation Process by Neuro-Dynamic Programming

    OpenAIRE

    Tatiana Ilkova; Stoyan Tzonkov

    2004-01-01

    In this paper the method for optimal control of a fermentation process is presented, that is based on an approach for optimal control - Neuro-Dynamic programming. For this aim the approximation neural network is developed and the decision of the optimization problem is improved by an iteration mode founded on the Bellman equation. With this approach computing time and procedure are decreased and quality of the biomass at the end of the process is increased.

  12. Optimal Control of a Fed-batch Fermentation Process by Neuro-Dynamic Programming

    Directory of Open Access Journals (Sweden)

    Tatiana Ilkova

    2004-10-01

    Full Text Available In this paper the method for optimal control of a fermentation process is presented, that is based on an approach for optimal control - Neuro-Dynamic programming. For this aim the approximation neural network is developed and the decision of the optimization problem is improved by an iteration mode founded on the Bellman equation. With this approach computing time and procedure are decreased and quality of the biomass at the end of the process is increased.

  13. Robust Adaptive Dynamic Programming for Optimal Nonlinear Control Design

    OpenAIRE

    Jiang, Yu; Jiang, Zhong-Ping

    2013-01-01

    This paper studies the robust optimal control design for uncertain nonlinear systems from a perspective of robust adaptive dynamic programming (robust-ADP). The objective is to fill up a gap in the past literature of ADP where dynamic uncertainties or unmodeled dynamics are not addressed. A key strategy is to integrate tools from modern nonlinear control theory, such as the robust redesign and the backstepping techniques as well as the nonlinear small-gain theorem, with the theory of ADP. The...

  14. Dynamic Performance Tuning Supported by Program Specification

    Directory of Open Access Journals (Sweden)

    Eduardo César

    2002-01-01

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

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2012-10-01

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

  16. Dynamic Learning Objects to Teach Java Programming Language

    Science.gov (United States)

    Narasimhamurthy, Uma; Al Shawkani, Khuloud

    2010-01-01

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

  17. Nonlinear beam dynamics experimental program at SPEAR

    International Nuclear Information System (INIS)

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

  18. Using of Dynamic and Rollout Neuro - Dynamic Programming for Static and Dynamic Optimization of a Fed-batch Fermentation Process

    OpenAIRE

    Tatiana Ilkova

    2005-01-01

    A fed-batch fermentation process is examined in this paper for experimental and further dynamic optimization. The static optimization is developed for to be found out the optimal initial concentrations of the basic biochemical variables - biomass, substrate and substrate in the feeding solution. For the static optimization of the process the method of Dynamic programming is used. After that these initial values are used for the dynamic optimization carried out by a submethod of Neuro-dynamic ...

  19. Primary damage in tungsten using the binary collision approximation, molecular dynamic simulations and the density functional theory

    Science.gov (United States)

    De Backer, A.; Sand, A.; Ortiz, C. J.; Domain, C.; Olsson, P.; Berthod, E.; Becquart, C. S.

    2016-02-01

    The damage produced by primary knock-on atoms (PKA) in W has been investigated from the threshold displacement energy (TDE) where it produces one self interstitial atom-vacancy pair to larger energies, up to 100 keV, where a large molten volume is formed. The TDE has been determined in different crystal directions using the Born-Oppenheimer density functional molecular dynamics (DFT-MD). A significant difference has been observed without and with the semi-core electrons. Classical MD has been used with two different empirical potentials characterized as ‘soft’ and ‘hard’ to obtain statistics on TDEs. Cascades of larger energy have been calculated, with these potentials, using a model that accounts for electronic losses (Sand et al 2013 Europhys. Lett. 103 46003). Two other sets of cascades have been produced using the binary collision approximation (BCA): a Monte Carlo BCA using SDTrimSP (Eckstein et al 2011 SDTrimSP: Version 5.00. Report IPP 12/8) (similar to SRIM www.srim.org) and MARLOWE (RSICC Home Page. (https://rsicc.ornl.gov/codes/psr/psr1/psr-137.html) (accessed May, 2014)). The comparison of these sets of cascades gave a recombination distance equal to 12 Å which is significantly larger from the one we reported in Hou et al (2010 J. Nucl. Mater. 403 89) because, here, we used bulk cascades rather than surface cascades which produce more defects (Stoller 2002 J. Nucl. Mater. 307 935, Nordlund et al 1999 Nature 398 49). Investigations on the defect clustering aspect showed that the difference between BCA and MD cascades is considerably reduced after the annealing of the cascade debris at 473 K using our Object Kinetic Monte Carlo model, LAKIMOCA (Domain et al 2004 J. Nucl. Mater. 335 121).

  20. Macroscopic reality and the dynamical reduction program

    International Nuclear Information System (INIS)

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

  1. Regression Dynamic Programming for Large Stochastic Reservoir Systems

    Science.gov (United States)

    Shoemaker, C. A.; Fan, D. K.

    2001-12-01

    Regression Dynamic Programming has been developed by the authors and D. Ruppert as a computationally efficient procedure for solving higher dimensional stochastic dynamic programming problems, such as those arising in the solution of the optimal release policy in a system of reservoirs with nonlinear dynamics and stochastic inflow and hydropower demand. The dimension of the problem is a function of the number of reservoirs and the number of hydrologic state variables. The dimensionality difficulties of DP are mitigated in Regression DP by coupling an experimental design procedure with a multidimensional spline fit that is determined by regression. This approach differs from that used by Chen, Ruppert, and Shoemaker (Oper. Res., 1999) in that we have applied a simpler and more computationally efficient regression technique than was previously done and we implemented a Latin Hypercube experimental design. Comparisons with an orthogonal array show that the Latin Hypercube is a more efficient experimental design for a given level of accuracy. This is also the first application of this method to reservoir systems. Several stochastic examples with nonlinear cost functions have been done, including one example with 13 reservoirs and another example with a hydrologic state variable and a nonlinear term associated with evaporation. The developed approach described is a general method for solving a true stochastic dynamic programming problem. Our Regression Dynamic Programming method does not make any assumptions about linearity, deterministic relationships, aggregation of state variables, or sampling of future scenarios, which are methods of changing the problem formulation that have been used in other published reservoir applications in order to avoid the computational effort of solving the true dynamic programming problem. In general, this gives Regression Dynamic Programming a significant advantage in terms of accuracy, especially for problems with a large number of time

  2. Modelling of windmill induction generators in dynamic simulation programs

    DEFF Research Database (Denmark)

    Akhmatov, Vladislav; Knudsen, Hans

    1999-01-01

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

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

    International Nuclear Information System (INIS)

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

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

    International Nuclear Information System (INIS)

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

  5. Non-convex dynamic programming and optimal investment

    OpenAIRE

    Penannen, Teemu; Perkkiö, Ari-Pekka; Rásonyi, Miklós

    2015-01-01

    We establish the existence of minimizers in a rather general setting of dynamic stochastic optimization without assuming either convexity or coercivity of the objective function. We apply this to prove the existence of optimal portfolios for non-concave utility maximization problems in financial market models with frictions (such as illiquidity), a first result of its kind. The proofs are based on the dynamic programming principle whose validity is established under quite general assumptions.

  6. Including UPFC dynamic phasor model into transient stability program

    OpenAIRE

    Ni, Y; Liu, H.; Zhu, H; Li, Y

    2005-01-01

    In this paper a novel time simulation approach is introduced to implement transient stability analysis with FACTS devices, in which FACTS devices will use dynamic phasor models and interface properly with conventional electromechanical transient-model-based stability program. The unified power flow controller (UPFC) is used as an example to demo the realization of the approach. In the paper, the UPFC dynamic phasor model and control scheme are presented first and followed by the interface for...

  7. Dynamic Programming for Mean-field type Control

    OpenAIRE

    Laurière, Mathieu; Pironneau, Olivier

    2014-01-01

    For mean-field type control problems, stochastic dynamic programming requires adaptation. We propose to reformulate the problem as a distributed control problem by assuming that the PDF $\\rho$ of the stochastic process exists. Then we show that Bellman's principle applies to the dynamic programming value function $V(\\tau,\\rho_\\tau)$ where the dependency on $\\rho_\\tau$ is functional as in P.L. Lions' analysis of mean-filed games (2007). We derive HJB equations and apply them to two examples, a...

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

    Directory of Open Access Journals (Sweden)

    Marcin Szuster

    2014-01-01

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

  9. A note on dynamic programming in accounts receivable management

    OpenAIRE

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

    1982-01-01

    The paper considers a dynamic programming formulation of the accounts receivable problem for single outstanding amounts. An optimal collection policy can be computed efficiently by invoking a “planning horizon” result that determines a time period beyond which the decision process cannot extend. The optimality of so called monotone policies is shown under rather intuitive restrictions on the collection probabilities.

  10. Parallel dynamic programming for on-line flight path optimization

    Science.gov (United States)

    Slater, G. L.; Hu, K.

    1989-01-01

    Parallel systolic algorithms for dynamic programming(DP) and their respective hardware implementations are presented for a problem in on-line trajectory optimization. The method is applied to a model for helicopter flight path optimization through a complex constraint region. This problem has application to an air traffic control problem and also to a terrain following/threat avoidance problem.

  11. General Existence of Solutions to Dynamic Programming Principle

    OpenAIRE

    Liu, Qing; Schikorra, Armin

    2013-01-01

    We provide an alternative approach to the existence of solutions to dynamic programming equations arising in the discrete game-theoretic interpretations for various nonlinear partial differential equations including the infinity Laplacian, mean curvature flow and Hamilton-Jacobi type. Our general result is similar to Perron's method but adapted to the discrete situation.

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

    DEFF Research Database (Denmark)

    Bille, Philip; Stöckel, Morten

    2012-01-01

    -oblivious algorithm for this type of local dynamic programming suitable for comparing large-scale strings. Our algorithm outperforms the previous state-of-the-art solutions. Surprisingly, our new simple algorithm is competitive with a complicated, optimized, and tuned implementation of the best cache-aware algorithm...

  13. Dynamic Programming Approach for Exact Decision Rule Optimization

    KAUST Repository

    Amin, Talha

    2013-01-01

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

  14. Dynamic Magic Sets for Super-Consistent Answer Set Programs

    CERN Document Server

    Alviano, Mario

    2010-01-01

    For many practical applications of ASP, for instance data integration or planning, query answering is important, and therefore query optimization techniques for ASP are of great interest. Magic Sets are one of these techniques, originally defined for Datalog queries (ASP without disjunction and negation). Dynamic Magic Sets (DMS) are an extension of this technique, which has been proved to be sound and complete for query answering over ASP programs with stratified negation. A distinguishing feature of DMS is that the optimization can be exploited also during the nondeterministic phase of ASP engines. In particular, after some assumptions have been made during the computation, parts of the program may become irrelevant to a query under these assumptions. This allows for dynamic pruning of the search space, which may result in exponential performance gains. In this paper, the correctness of DMS is formally established and proved for brave and cautious reasoning over the class of super-consistent ASP programs (A...

  15. A minimalistic approach to static and dynamic electron correlations: Amending generalized valence bond method with extended random phase approximation correlation correction

    Science.gov (United States)

    Chatterjee, Koushik; Pastorczak, Ewa; Jawulski, Konrad; Pernal, Katarzyna

    2016-06-01

    A perfect-pairing generalized valence bond (GVB) approximation is known to be one of the simplest approximations, which allows one to capture the essence of static correlation in molecular systems. In spite of its attractive feature of being relatively computationally efficient, this approximation misses a large portion of dynamic correlation and does not offer sufficient accuracy to be generally useful for studying electronic structure of molecules. We propose to correct the GVB model and alleviate some of its deficiencies by amending it with the correlation energy correction derived from the recently formulated extended random phase approximation (ERPA). On the examples of systems of diverse electronic structures, we show that the resulting ERPA-GVB method greatly improves upon the GVB model. ERPA-GVB recovers most of the electron correlation and it yields energy barrier heights of excellent accuracy. Thanks to a balanced treatment of static and dynamic correlation, ERPA-GVB stays reliable when one moves from systems dominated by dynamic electron correlation to those for which the static correlation comes into play.

  16. Improvement of DYANA. The dynamic analysis program for event transition

    International Nuclear Information System (INIS)

    In the probabilistic safety assessment (PSA), the fault tree/event tree technique has been widely used to evaluate accident sequence frequencies. However, event transition which operators actually face can not be dynamically treated by the conventional technique. Therefore, we have made the dynamic analysis program(DYANA) for event transition for a liquid metal cooled fast breeder reactor. In the previous development, we made basic model for analysis. However, we have a problem that calculation time is too long. At the current term, we made parallelization of DYANA using MPI. So we got good performance on WS claster. It performance is close to ideal one. (author)

  17. Dynamic Programming for Structured Continuous Markov Decision Problems

    Science.gov (United States)

    Dearden, Richard; Meuleau, Nicholas; Washington, Richard; Feng, Zhengzhu

    2004-01-01

    We describe an approach for exploiting structure in Markov Decision Processes with continuous state variables. At each step of the dynamic programming, the state space is dynamically partitioned into regions where the value function is the same throughout the region. We first describe the algorithm for piecewise constant representations. We then extend it to piecewise linear representations, using techniques from POMDPs to represent and reason about linear surfaces efficiently. We show that for complex, structured problems, our approach exploits the natural structure so that optimal solutions can be computed efficiently.

  18. A Fortran IV Program for Estimating Parameters through Multiple Matrix Sampling with Standard Errors of Estimate Approximated by the Jackknife.

    Science.gov (United States)

    Shoemaker, David M.

    Described and listed herein with concomitant sample input and output is the Fortran IV program which estimates parameters and standard errors of estimate per parameters for parameters estimated through multiple matrix sampling. The specific program is an improved and expanded version of an earlier version. (Author/BJG)

  19. Approximate method for estimating plasma ionization characteristics based on numerical simulation of the dynamics of a plasma bunch with a high specific energy in the upper ionosphere

    Science.gov (United States)

    Motorin, A. A.; Stupitsky, E. L.; Kholodov, A. S.

    2016-07-01

    The spatiotemporal pattern for the development of a plasma cloud formed in the ionosphere and the main cloud gas-dynamic characteristics have been obtained from 3D calculations of the explosion-type plasmodynamic flows previously performed by us. An approximate method for estimating the plasma temperature and ionization degree with the introduction of the effective adiabatic index has been proposed based on these results.

  20. Diverse Eruptions at Approximately 2,200 Years B.P. on the Great Rift, Idaho: Inferences for Magma Dynamics Along Volcanic Rift Zones

    Science.gov (United States)

    Hughes, S. S.; Nawotniak, S. E. Kobs; Borg, C.; Mallonee, H. C.; Purcell, S.; Neish, C.; Garry, W. B.; Haberle, C. W.; Lim, D. S. S.; Heldmann, J. L.

    2016-01-01

    Compositionally and morphologically diverse lava flows erupted on the Great Rift of Idaho approximately 2.2 ka (kilo-annum, 1000 years ago) during a volcanic "flare-up" of activity following an approximately 2 ky (kiloyear, 1000 years) hiatus in eruptions. Volcanism at Craters of the Moon (COTM), Wapi and Kings Bowl lava fields around this time included primitive and evolved compositions, separated over 75 kilometers along the approximately 85 kilometers-long rift, with striking variability in lava flow emplacement mechanisms and surface morphologies. Although the temporal associations may be coincidental, the system provides a planetary analog to better understand magma dynamics along rift systems, including that associated with lunar floor-fractured craters. This study aims to help bridge the knowledge gap between ancient rift volcanism evident on the Moon and other terrestrial planets, and active rift volcanism, e.g., at Hawai'i and Iceland.

  1. Synthesizing Dynamic Programming Algorithms from Linear Temporal Logic Formulae

    Science.gov (United States)

    Rosu, Grigore; Havelund, Klaus

    2001-01-01

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

  2. Adaptive Dynamic Programming for Control Algorithms and Stability

    CERN Document Server

    Zhang, Huaguang; Luo, Yanhong; Wang, Ding

    2013-01-01

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

  3. Approximately universal, explicit DMT-optimal constructions for the dynamic-decode-and-forward cooperative wireless relay network

    CERN Document Server

    Elia, Petros

    2007-01-01

    Explicit codes are constructed that achieve the diversity-multiplexing gain tradeoff of the cooperative-relay channel under the dynamic decode-and-forward protocol for any network size, for all delays and for all numbers of transmit and receive antennas at the relays.

  4. On the comparison of results regarding the post-Newtonian approximate treatment of the dynamics of extended spinning compact binaries

    International Nuclear Information System (INIS)

    A brief review has been given of all the Hamiltonians, and effective potentials calculated hitherto covering the post-Newtonian (pN) dynamics of a two-body system. A method has been presented to compare (conservative) reduced Hamiltonians with non-reduced potentials directly at least up to the next-to-leading-pN order

  5. Comparison of multistage stochastic programs with recourse and stochastic dynamic programs with discrete time

    Czech Academy of Sciences Publication Activity Database

    Dupačová, J.; Sladký, Karel

    2002-01-01

    Roč. 82, 11/12 (2002), s. 753-765. ISSN 0044-2267 R&D Projects: GA ČR GA201/99/0264; GA ČR GA402/99/1136; GA MŠk 113200008 Institutional research plan: CEZ:AV0Z1075907 Keywords : multistage stochastic programs with recourse * dynamic programming * Markov decision processes Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 0.085, year: 2002

  6. Dynamic Programming and Time-Varying Delay Systems

    OpenAIRE

    Lincoln, Bo

    2003-01-01

    This thesis is divided into two separate parts. The first part is about Dynamic Programming for non-trivial optimal control problems. The second part introduces some useful tools for analysis of stability and performance of systems with time-varying delays. The two papers presented in the first part attacks optimal control problems with finite but rapidly increasing search space. In the first paper we try it reduce the complexity of the optimization by exploiting the structure of a cer...

  7. Systems and methods for interpolation-based dynamic programming

    KAUST Repository

    Rockwood, Alyn

    2013-01-03

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

  8. Neuro-dynamic programming for cooperative inventory control

    OpenAIRE

    Bauso, D.; Giarré, L.; Pesenti, R.

    2004-01-01

    In Multi-Retailer Inventory Control the possibility of sharing set up costs motivates communication and coordination among the retailers. We solve the problem of finding suboptimal distributed reordering policies which minimize set up, ordering, storage and shortage costs, incurred by the retailers over a finite horizon. Neuro-Dynamic Programming (NDP) reduces the computational complexity of the solution algorithm from exponential to polynomial on the number of retailers.

  9. Risk-aware decision making and dynamic programming

    OpenAIRE

    Defourny, Boris; Ernst, Damien; Wehenkel, Louis

    2008-01-01

    This paper considers sequential decision making problems under uncertainty, the tradeoff between the expected return and the risk of high loss, and methods that use dynamic programming to find optimal policies. It is argued that using Bellman's Principle determines how risk considerations on the return can be incorporated. The discussion centers around returns generated by Markov Decision Processes and conclusions concern a large class of methods in Reinforcement Learning.

  10. Deterministic Dynamic Programming in Discrete Time: A Monotone Convergence Principle

    OpenAIRE

    Takashi Kamihigashi; Masayuki Yao

    2015-01-01

    We consider infinite-horizon deterministic dynamic programming problems in discrete time. We show that the value function is always a fixed point of a modified version of the Bellman operator. We also show that value iteration monotonically converges to the value function if the initial function is dominated by the value function, is mapped upward by the modified Bellman operator, and satisfies a transversality-like condition. These results require no assumption except for the general framewo...

  11. Restricted Dynamic Programming Heuristic for Precedence Constrained Bottleneck Generalized TSP

    OpenAIRE

    Salii, Y.

    2015-01-01

    We develop a restricted dynamical programming heuristic for a complicated traveling salesman problem: a) cities are grouped into clusters, resp. Generalized TSP; b) precedence constraints are imposed on the order of visiting the clusters, resp. Precedence Constrained TSP; c) the costs of moving to the next cluster and doing the required job inside one are aggregated in a minimax manner, resp. Bottleneck TSP; d) all the costs may depend on the sequence of previously visited clusters, resp. Seq...

  12. SEWER NETWORK DISCHARGE OPTIMIZATION USING THE DYNAMIC PROGRAMMING

    Directory of Open Access Journals (Sweden)

    Viorel MINZU

    2015-12-01

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

  13. Diophantine approximations

    CERN Document Server

    Niven, Ivan

    2008-01-01

    This self-contained treatment originated as a series of lectures delivered to the Mathematical Association of America. It covers basic results on homogeneous approximation of real numbers; the analogue for complex numbers; basic results for nonhomogeneous approximation in the real case; the analogue for complex numbers; and fundamental properties of the multiples of an irrational number, for both the fractional and integral parts.The author refrains from the use of continuous fractions and includes basic results in the complex case, a feature often neglected in favor of the real number discuss

  14. An algorithm for the solution of dynamic linear programs

    Science.gov (United States)

    Psiaki, Mark L.

    1989-01-01

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

  15. A B-Spline-Based Colocation Method to Approximate the Solutions to the Equations of Fluid Dynamics

    Energy Technology Data Exchange (ETDEWEB)

    Johnson, Richard Wayne; Landon, Mark Dee

    1999-07-01

    The potential of a B-spline collocation method for numerically solving the equations of fluid dynamics is discussed. It is known that B-splines can resolve curves with drastically fewer data than can their standard shape function counterparts. This feature promises to allow much faster numerical simulations of fluid flow than standard finite volume/finite element methods without sacrificing accuracy. An example channel flow problem is solved using the method.

  16. A B-Spline-Based Colocation Method to Approximate the Solutions to the Equations of Fluid Dynamics

    Energy Technology Data Exchange (ETDEWEB)

    M. D. Landon; R. W. Johnson

    1999-07-01

    The potential of a B-spline collocation method for numerically solving the equations of fluid dynamics is discussed. It is known that B-splines can resolve complex curves with drastically fewer data than can their standard shape function counterparts. This feature promises to allow much faster numerical simulations of fluid flow than standard finite volume/finite element methods without sacrificing accuracy. An example channel flow problem is solved using the method.

  17. Conservative dynamics of two-body systems at the fourth post-Newtonian approximation of general relativity

    Science.gov (United States)

    Damour, Thibault; Jaranowski, Piotr; Schäfer, Gerhard

    2016-04-01

    The fourth post-Newtonian (4PN) two-body dynamics has been recently tackled by several different approaches: effective field theory, Arnowitt-Deser-Misner Hamiltonian, action-angle-Delaunay averaging, effective-one-body, gravitational self-force, first law of dynamics, and Fokker action. We review the achievements of these approaches and discuss the complementarity of their results. Our main conclusions are: (i) the results of the first complete derivation of the 4PN dynamics [T. Damour, P. Jaranowski, and G. Schäfer, Phys. Rev. D 89, 064058 (2014)] have been, piecewise, fully confirmed by several subsequent works; (ii) the results of the Delaunay-averaging technique [T. Damour, P. Jaranowski, and G. Schäfer, Phys. Rev. D 91, 084024 (2015)] have been confirmed by several independent works; and (iii) several claims in a recent harmonic-coordinates Fokker-action computation [L. Bernard et al., arXiv:1512.02876v2] are incorrect, but can be corrected by the addition of a couple of ambiguity parameters linked to subtleties in the regularization of infrared and ultraviolet divergences.

  18. On the conservative dynamics of two-body systems at the fourth post-Newtonian approximation of general relativity

    CERN Document Server

    Damour, Thibault; Schäfer, Gerhard

    2016-01-01

    The fourth post-Newtonian (4PN) two-body dynamics has been recently tackled by several different approaches: effective field theory, Arnowitt-Deser-Misner Hamiltonian, action-angle-Delaunay averaging, effective-one-body, gravitational self-force, first law of dynamics, and Fokker action. We review the achievements of these approaches and discuss the complementarity of their results. Our main conclusions are: (i) the results of the first complete derivation of the 4PN dynamics [T.Damour, P.Jaranowski, and G.Sch\\"afer, Phys. Rev. D 89, 064058 (2014)] have been, piecewise, fully confirmed by several subsequent works; (ii) the results of the Delaunay-averaging technique [T.Damour, P.Jaranowski, and G.Sch\\"afer, Phys. Rev. D 91, 084024 (2015)] have been confirmed by several independent works; and (iii) several claims in a recent Fokker-action computation [L.Bernard et al., arXiv:1512.02876v2 [gr-qc

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

    Directory of Open Access Journals (Sweden)

    Susan Stepney

    2012-10-01

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

  20. Neural-network-observer-based optimal control for unknown nonlinear systems using adaptive dynamic programming

    Science.gov (United States)

    Liu, Derong; Huang, Yuzhu; Wang, Ding; Wei, Qinglai

    2013-09-01

    In this paper, an observer-based optimal control scheme is developed for unknown nonlinear systems using adaptive dynamic programming (ADP) algorithm. First, a neural-network (NN) observer is designed to estimate system states. Then, based on the observed states, a neuro-controller is constructed via ADP method to obtain the optimal control. In this design, two NN structures are used: a three-layer NN is used to construct the observer which can be applied to systems with higher degrees of nonlinearity and without a priori knowledge of system dynamics, and a critic NN is employed to approximate the value function. The optimal control law is computed using the critic NN and the observer NN. Uniform ultimate boundedness of the closed-loop system is guaranteed. The actor, critic, and observer structures are all implemented in real-time, continuously and simultaneously. Finally, simulation results are presented to demonstrate the effectiveness of the proposed control scheme.

  1. Switch programming of reflectivity control devices for the coupled dynamics of a solar sail

    Science.gov (United States)

    Hu, Tianjian; Gong, Shengping; Mu, Junshan; Li, Junfeng; Wang, Tianshu; Qian, Weiping

    2016-03-01

    As demonstrated in the Interplanetary Kite-craft Accelerated by Radiation Of the Sun (IKAROS), reflectivity control devices (RCDs) are switched on or off independently with each other, which has nevertheless been ignored by many previous researches. This paper emphasizes the discrete property of RCDs, and aims to obtain an appropriate switch law of RCDs for a rigid spinning solar sail. First, the coupled attitude-orbit dynamics is derived from the basic solar force and torque model into an underdetermined linear system with a binary set constraint. Subsequently, the coupled dynamics is reformulated into a constrained quadratic programming and a basic gradient projection method is designed to search for the optimal solution. Finally, a circular sail flying in the Venus rendezvous mission demonstrates the model and method numerically, which illustrates approximately 103 km terminal position error and 0.5 m/s terminal velocity error as 80 independent RCDs are switched on or off appropriately.

  2. Scale-free memory model for multiagent reinforcement learning. Mean field approximation and rock-paper-scissors dynamics

    Science.gov (United States)

    Lubashevsky, I.; Kanemoto, S.

    2010-07-01

    A continuous time model for multiagent systems governed by reinforcement learning with scale-free memory is developed. The agents are assumed to act independently of one another in optimizing their choice of possible actions via trial-and-error search. To gain awareness about the action value the agents accumulate in their memory the rewards obtained from taking a specific action at each moment of time. The contribution of the rewards in the past to the agent current perception of action value is described by an integral operator with a power-law kernel. Finally a fractional differential equation governing the system dynamics is obtained. The agents are considered to interact with one another implicitly via the reward of one agent depending on the choice of the other agents. The pairwise interaction model is adopted to describe this effect. As a specific example of systems with non-transitive interactions, a two agent and three agent systems of the rock-paper-scissors type are analyzed in detail, including the stability analysis and numerical simulation. Scale-free memory is demonstrated to cause complex dynamics of the systems at hand. In particular, it is shown that there can be simultaneously two modes of the system instability undergoing subcritical and supercritical bifurcation, with the latter one exhibiting anomalous oscillations with the amplitude and period growing with time. Besides, the instability onset via this supercritical mode may be regarded as “altruism self-organization”. For the three agent system the instability dynamics is found to be rather irregular and can be composed of alternate fragments of oscillations different in their properties.

  3. Approximate Representations and Approximate Homomorphisms

    OpenAIRE

    Moore, Cristopher; Russell, Alexander

    2010-01-01

    Approximate algebraic structures play a defining role in arithmetic combinatorics and have found remarkable applications to basic questions in number theory and pseudorandomness. Here we study approximate representations of finite groups: functions f:G -> U_d such that Pr[f(xy) = f(x) f(y)] is large, or more generally Exp_{x,y} ||f(xy) - f(x)f(y)||^2$ is small, where x and y are uniformly random elements of the group G and U_d denotes the unitary group of degree d. We bound these quantities i...

  4. A Class of Expected Value Bilevel Programming Problems with Random Coefficients Based on Rough Approximation and Its Application to a Production-Inventory System

    OpenAIRE

    Liming Yao; Jiuping Xu

    2013-01-01

    This paper focuses on the development of a bilevel optimization model with random coefficients for a production-inventory system. The expected value operator technique is used to deal with the objective function, and rough approximation is applied to convert the stochastic constraint into a crisp constraint. Then an interactive programming method and genetic algorithm are utilized to solve the crisp model. Finally, an application is given to show the efficiency of the proposed model and appro...

  5. ADAPE program for calculation of the cross sections of neutron inelastic scattering on deformed nuclei in the adiabatic approximation by the coupled channel method

    International Nuclear Information System (INIS)

    The program for calculation of the cross sections of neutron interaction with deformed nuclei by the strongly coupled channel method in the adiabatic approximation is described. The results of test calculations of cross sections of elastic and inelastic neutron scattering with initial energy of 0.1; 0.6; 2.0; 2.5 MeV on the sup(238)U nucleus are presented

  6. Supplier selection and order lot sizing using dynamic programming

    Directory of Open Access Journals (Sweden)

    M. M. Moqri

    2011-04-01

    Full Text Available In this paper, we consider a multi-period integrated supplier selection and order lot sizing problem where a single buyer plans to purchase a single product in multiple periods from several qualified suppliers who are able to provide the required product with the needed quality in a timely manner. Product price and order cost differs among different suppliers. Buyer’s demand for the product is deterministic and varies for different time periods. The problem is to determine how much product from which supplier must be ordered in each period such that buyer’s demand is satisfied without violating some side constraints. We have developed a mathematical programming model to deal with this problem, and proposed a forward dynamic programming approach to obtain optimal solutions in reasonable amount of time even for large scale problems. Finally, a numerical example is conducted in which solutions obtained from the proposed dynamic programming algorithm is compared with solutions from the branch-and-bound algorithm. Through the numerical example we have shown the efficiency of our algorithm.

  7. Using the Discrete Dipole Approximation and Holographic Microscopy to Measure Rotational Dynamics of Non-spherical Colloids

    CERN Document Server

    Wang, Anna; Fung, Jerome; Razavi, Sepideh; Kretzschmar, Ilona; Chaudhary, Kundan; Lewis, Jennifer A; Manoharan, Vinothan N

    2013-01-01

    We present a new, high-speed technique to track the three-dimensional translation and rotation of non-spherical colloidal particles. We capture digital holograms of micrometer-scale silica rods and sub-micrometer-scale Janus particles freely diffusing in water, and then fit numerical scattering models based on the discrete dipole approximation to the measured holograms. This inverse-scattering approach allows us to extract the the position and orientation of the particles as a function of time, along with static parameters including the size, shape, and refractive index. The best-fit sizes and refractive indices of both particles agree well with expected values. The technique is able to track the center of mass of the rod to a precision of 35 nm and its orientation to a precision of 1.5$^\\circ$, comparable to or better than the precision of other 3D diffusion measurements on non-spherical particles. Furthermore, the measured translational and rotational diffusion coefficients for the silica rods agree with hy...

  8. Heuristic reusable dynamic programming: efficient updates of local sequence alignment.

    Science.gov (United States)

    Hong, Changjin; Tewfik, Ahmed H

    2009-01-01

    Recomputation of the previously evaluated similarity results between biological sequences becomes inevitable when researchers realize errors in their sequenced data or when the researchers have to compare nearly similar sequences, e.g., in a family of proteins. We present an efficient scheme for updating local sequence alignments with an affine gap model. In principle, using the previous matching result between two amino acid sequences, we perform a forward-backward alignment to generate heuristic searching bands which are bounded by a set of suboptimal paths. Given a correctly updated sequence, we initially predict a new score of the alignment path for each contour to select the best candidates among them. Then, we run the Smith-Waterman algorithm in this confined space. Furthermore, our heuristic alignment for an updated sequence shows that it can be further accelerated by using reusable dynamic programming (rDP), our prior work. In this study, we successfully validate "relative node tolerance bound" (RNTB) in the pruned searching space. Furthermore, we improve the computational performance by quantifying the successful RNTB tolerance probability and switch to rDP on perturbation-resilient columns only. In our searching space derived by a threshold value of 90 percent of the optimal alignment score, we find that 98.3 percent of contours contain correctly updated paths. We also find that our method consumes only 25.36 percent of the runtime cost of sparse dynamic programming (sDP) method, and to only 2.55 percent of that of a normal dynamic programming with the Smith-Waterman algorithm. PMID:19875856

  9. Parallel solution of sparse one-dimensional dynamic programming problems

    Science.gov (United States)

    Nicol, David M.

    1989-01-01

    Parallel computation offers the potential for quickly solving large computational problems. However, it is often a non-trivial task to effectively use parallel computers. Solution methods must sometimes be reformulated to exploit parallelism; the reformulations are often more complex than their slower serial counterparts. We illustrate these points by studying the parallelization of sparse one-dimensional dynamic programming problems, those which do not obviously admit substantial parallelization. We propose a new method for parallelizing such problems, develop analytic models which help us to identify problems which parallelize well, and compare the performance of our algorithm with existing algorithms on a multiprocessor.

  10. GOP-Level Bit Allocation Using Reverse Dynamic Programming

    Institute of Scientific and Technical Information of China (English)

    LU Yang; XIE Jun; LI Hang; CUI Huijuan

    2009-01-01

    An efficient adaptive group of pictures (GOP)-Ievel bit allocation algorithm was developed based on reverse dynamic programming (RDP). The algorithm gives the initial delay and sequence distortion curve with just one iteration of the algorithm. A simple GOP-level rate and distortion model was then developed for two-level constant quality rate control. The initial delay values and the corresponding optimal GOP-level bit allocation scheme can be obtained for video streaming along with the proper initial delay for various distortion tolerance levels. Simulations show that the algorithm provides an efficient solution for delay and buffer con-strained GOP-level rate control for video streaming.

  11. Dynamic programming parallel implementations for the knapsack problem

    OpenAIRE

    Andonov, Rumen; Raimbault, Frédéric; Quinton, Patrice

    1993-01-01

    A systolic algorithm for the dynamic programming approach to the knapsack problem is presented. The algorithm can run on any number of processors and has optimal time speedup and processor efficiency. The running time of the algorithm is [??](mc/q+m) on a ring of q processors, where c is the knapsack size and m is the number of object types. A new procedure for the backtracking phase of the algorithm with a time complexity [??](m) is also proposed which is an improvement on the usual strategi...

  12. Modelling dynamic programming problems by generalized d-graphs

    CERN Document Server

    Kátai, Zoltán

    2010-01-01

    In this paper we introduce the concept of generalized d-graph (admitting cycles) as special dependency-graphs for modelling dynamic programming (DP) problems. We describe the d-graph versions of three famous single-source shortest algorithms (The algorithm based on the topological order of the vertices, Dijkstra algorithm and Bellman-Ford algorithm), which can be viewed as general DP strategies in the case of three different class of optimization problems. The new modelling method also makes possible to classify DP problems and the corresponding DP strategies in term of graph theory.

  13. Using dynamic programming to improve fiducial marker localization

    Science.gov (United States)

    Wan, Hanlin; Ge, Jiajia; Parikh, Parag

    2014-04-01

    Fiducial markers are used in a wide range of medical imaging applications. In radiation therapy, they are often implanted near tumors and used as motion surrogates that are tracked with fluoroscopy. We propose a novel and robust method based on dynamic programming (DP) for retrospectively localizing radiopaque fiducial markers in fluoroscopic images. Our method was compared to template matching (TM) algorithms on 407 data sets from 24 patients. We found that the performance of TM varied dramatically depending on the template used (ranging from 47% to 92% of data sets with a mean error images regardless of marker type, shape, and size.

  14. CASSANDRE, 2-D Reactor Dynamic FEM Program with Thermohydraulic Feedback

    International Nuclear Information System (INIS)

    1 - Description of program or function: CASSANDRE is a two-dimensional (x-y or r-z) finite-elements neutronics code with thermohydraulic feedback for reactor dynamics prior to the disassembly phase. The code was conceived in order to be coupled with any thermohydraulics module, although thermohydraulics feedback is only considered in r-z geometry. In the steady state, criticality search is possible either by control-rod insertion or by homogeneous poisoning of the coolant. 2 - Method of solution: The program uses multigroup diffusion theory. Its main characteristics are the use of a generalized quasi-static model, the use of a flexible multigroup point-kinetics algorithm allowing for spectral matching, and the use of a finite elements description. 3 - Restrictions on the complexity of the problem: The user must prepare a cross section library

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

    Science.gov (United States)

    Zaryabova, Victoria; Israel, Michel

    2015-09-01

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

  16. Dynamic programming methods for concurrent design and dynamic allocation of vehicles embedded in a system-of-systems

    Science.gov (United States)

    Nusawardhana

    2007-12-01

    is equipped with the set of analytical tools to solve several cases of nonlinear optimal control problems: continuous- and discrete-time nonlinear problems with applications on both optimal regulation and tracking. These tools are useful when mathematical descriptions of dynamic systems are available. In the absence of such a mathematical model, it is often necessary to derive a solution based on computer simulation. For this case, a set of parameterized decision may constitute a solution. This thesis presents a method to adjust these parameters based on the principle of stochastic approximation simultaneous perturbation using continuous measurements. The set of tools developed here mostly employs the methods of exact dynamic programming. However, due to the complexity of SoS problems, this research also develops suboptimal solution approaches, collectively recognized as approximate dynamic programming solutions, for large scale problems. The thesis presents, explores, and solves problems from an airline industry, in which a new aircraft is to be designed and allocated along with an existing fleet of aircraft. Because the life cycle of an aircraft is on the order of 10 to 20 years, this problem is to be addressed dynamically so that the new aircraft design is the best design for the fleet over a given time horizon.

  17. Dynamics of neuroinflammation in the macrosphere model of arterio-arterial embolic focal ischemia: an approximation to human stroke patterns

    Directory of Open Access Journals (Sweden)

    Walberer Maureen

    2010-12-01

    Full Text Available Abstract Background Neuroinflammation evolves as a multi-facetted response to focal cerebral ischemia. It involves activation of resident glia cell populations, recruitment of blood-derived leucocytes as well as humoral responses. Among these processes, phagocyte accumulation has been suggested to be a surrogate marker of neuroinflammation. We previously assessed phagocyte accumulation in human stroke by MRI. We hypothesize that phagocyte accumulation in the macrosphere model may resemble the temporal and spatial patterns observed in human stroke. Methods In a rat model of permanent focal ischemia by embolisation of TiO2-spheres we assessed key features of post-ischemic neuroinflammation by the means of histology, immunocytochemistry of glial activation and influx of hematogeneous cells, and quantitative PCR of TNF-α, IL-1, IL-18, and iNOS mRNA. Results In the boundary zone of the infarct, a transition of ramified microglia into ameboid phagocytic microglia was accompanied by an up-regulation of MHC class II on the cells after 3 days. By day 7, a hypercellular infiltrate consisting of activated microglia and phagocytic cells formed a thick rim around the ischemic infarct core. Interestingly, in the ischemic core microglia could only be observed at day 7. TNF-α was induced rapidly within hours, IL-1β and iNOS peaked within days, and IL-18 later at around 1 week after ischemia. Conclusions The macrosphere model closely resembles the characteristical dynamics of postischemic inflammation previously observed in human stroke. We therefore suggest that the macrosphere model is highly appropriate for studying the pathophysiology of stroke in a translational approach from rodent to human.

  18. Approximate Likelihood

    CERN Document Server

    CERN. Geneva

    2015-01-01

    Most physics results at the LHC end in a likelihood ratio test. This includes discovery and exclusion for searches as well as mass, cross-section, and coupling measurements. The use of Machine Learning (multivariate) algorithms in HEP is mainly restricted to searches, which can be reduced to classification between two fixed distributions: signal vs. background. I will show how we can extend the use of ML classifiers to distributions parameterized by physical quantities like masses and couplings as well as nuisance parameters associated to systematic uncertainties. This allows for one to approximate the likelihood ratio while still using a high dimensional feature vector for the data. Both the MEM and ABC approaches mentioned above aim to provide inference on model parameters (like cross-sections, masses, couplings, etc.). ABC is fundamentally tied Bayesian inference and focuses on the “likelihood free” setting where only a simulator is available and one cannot directly compute the likelihood for the dat...

  19. Diophantine approximation

    CERN Document Server

    Schmidt, Wolfgang M

    1980-01-01

    "In 1970, at the U. of Colorado, the author delivered a course of lectures on his famous generalization, then just established, relating to Roth's theorem on rational approxi- mations to algebraic numbers. The present volume is an ex- panded and up-dated version of the original mimeographed notes on the course. As an introduction to the author's own remarkable achievements relating to the Thue-Siegel-Roth theory, the text can hardly be bettered and the tract can already be regarded as a classic in its field."(Bull.LMS) "Schmidt's work on approximations by algebraic numbers belongs to the deepest and most satisfactory parts of number theory. These notes give the best accessible way to learn the subject. ... this book is highly recommended." (Mededelingen van het Wiskundig Genootschap)

  20. The Design of Educational Programs in System Dynamics at Worcester Polytechnic Institute (WPI)

    OpenAIRE

    Oleg V. Pavlov; Doyle, James K.; Khalid Saeed; James M. Lyneis; Michael J. Radzicki

    2014-01-01

    Educational programs leading to degrees in system dynamics are rare and thus of critical importance to the future of the field of system dynamics. However, to a large extent such programs have not yet been made transparent to the system dynamics community as a whole. The present article describes the design and rationale for undergraduate and graduate programs at Worcester Polytechnic Institute (WPI). The goal of the article is to invite feedback from the system dynamics community about our s...

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

    Science.gov (United States)

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

    2016-02-01

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

  2. Validity of the site-averaging approximation for modeling the dissociative chemisorption of H2 on Cu(111) surface: A quantum dynamics study on two potential energy surfaces

    International Nuclear Information System (INIS)

    A new finding of the site-averaging approximation was recently reported on the dissociative chemisorption of the HCl/DCl+Au(111) surface reaction [T. Liu, B. Fu, and D. H. Zhang, J. Chem. Phys. 139, 184705 (2013); T. Liu, B. Fu, and D. H. Zhang, J. Chem. Phys. 140, 144701 (2014)]. Here, in order to investigate the dependence of new site-averaging approximation on the initial vibrational state of H2 as well as the PES for the dissociative chemisorption of H2 on Cu(111) surface at normal incidence, we carried out six-dimensional quantum dynamics calculations using the initial state-selected time-dependent wave packet approach, with H2 initially in its ground vibrational state and the first vibrational excited state. The corresponding four-dimensional site-specific dissociation probabilities are also calculated with H2 fixed at bridge, center, and top sites. These calculations are all performed based on two different potential energy surfaces (PESs). It is found that the site-averaging dissociation probability over 15 fixed sites obtained from four-dimensional quantum dynamics calculations can accurately reproduce the six-dimensional dissociation probability for H2 (v = 0) and (v = 1) on the two PESs

  3. Dynamic Analysis of a Helicopter Rotor by Dymore Program

    Science.gov (United States)

    Doğan, Vedat; Kırca, Mesut

    The dynamic behavior of hingeless and bearingless blades of a light commercial helicopter which has been under design process at ITU (İstanbul Technical University, Rotorcraft Research and Development Centre) is investigated. Since the helicopter rotor consists of several parts connected to each other by joints and hinges; rotors in general can be considered as an assembly of the rigid and elastic parts. Dynamics of rotor system in rotation is complicated due to coupling of elastic forces (bending, torsion and tension), inertial forces, control and aerodynamic forces on the rotor blades. In this study, the dynamic behavior of the rotor for a real helicopter design project is analyzed by using DYMORE. Blades are modeled as elastic beams, hub as a rigid body, torque tubes as rigid bodies, control links as rigid bodies plus springs and several joints. Geometric and material cross-sectional properties of blades (Stiffness-Matrix and Mass-Matrix) are calculated by using VABS programs on a CATIA model. Natural frequencies and natural modes of the rotating (and non-rotating) blades are obtained by using DYMORE. Fan-Plots which show the variation of the natural frequencies for different modes (Lead-Lag, Flapping, Feathering, etc.) vs. rotor RPM are presented.

  4. Use of Approximate Bayesian Computation to Assess and Fit Models of Mycobacterium leprae to Predict Outcomes of the Brazilian Control Program.

    Directory of Open Access Journals (Sweden)

    Rebecca Lee Smith

    Full Text Available Hansen's disease (leprosy elimination has proven difficult in several countries, including Brazil, and there is a need for a mathematical model that can predict control program efficacy. This study applied the Approximate Bayesian Computation algorithm to fit 6 different proposed models to each of the 5 regions of Brazil, then fitted hierarchical models based on the best-fit regional models to the entire country. The best model proposed for most regions was a simple model. Posterior checks found that the model results were more similar to the observed incidence after fitting than before, and that parameters varied slightly by region. Current control programs were predicted to require additional measures to eliminate Hansen's Disease as a public health problem in Brazil.

  5. Use of Approximate Bayesian Computation to Assess and Fit Models of Mycobacterium leprae to Predict Outcomes of the Brazilian Control Program.

    Science.gov (United States)

    Smith, Rebecca Lee; Gröhn, Yrjö Tapio

    2015-01-01

    Hansen's disease (leprosy) elimination has proven difficult in several countries, including Brazil, and there is a need for a mathematical model that can predict control program efficacy. This study applied the Approximate Bayesian Computation algorithm to fit 6 different proposed models to each of the 5 regions of Brazil, then fitted hierarchical models based on the best-fit regional models to the entire country. The best model proposed for most regions was a simple model. Posterior checks found that the model results were more similar to the observed incidence after fitting than before, and that parameters varied slightly by region. Current control programs were predicted to require additional measures to eliminate Hansen's Disease as a public health problem in Brazil. PMID:26107951

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

    Science.gov (United States)

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

    2007-01-01

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

  7. Novel algorithm for distributed replicas management based on dynamic programming

    Institute of Scientific and Technical Information of China (English)

    Wang Tao; Lu Xianliang; Hou Mengshu

    2006-01-01

    Replicas can improve the data reliability in distributed system. However, the traditional algorithms for replica management are based on the assumption that all replicas have the uniform reliability, which is inaccurate in some actual systems. To address such problem, a novel algorithm is proposed based on dynamic programming to manage the number and distribution of replicas in different nodes. By using Markov model, replicas management is organized as a multi-phase process, and the recursion equations are provided. In this algorithm, the heterogeneity of nodes, the expense for maintaining replicas and the engaged space have been considered. Under these restricted conditions, this algorithm realizes high data reliability in a distributed system. The results of case analysis prove the feasibility of the algorithm.

  8. NEW METHOD FOR SHAPE RECOGNITION BASED ON DYNAMIC PROGRAMMING

    Directory of Open Access Journals (Sweden)

    NOREDINNE GHERABI

    2011-02-01

    Full Text Available In this paper we present a new method for shape recognition based on dynamic programming. First, each contour of shape is represented by a set of points. After alignment and matching between two shapes, the outline of the shape is divided into parts according to N angular and M radial sectors , Each Sector contains a portion of the contour; thisportion is divided at the inflexion points into convex and concave sections, and the information about sections are extracted in order to provide a semantic content to the outline shape, then this information are coded and transformed into a string of symbols. Finally we find the best alignment of two complete strings and compute the optimal cost of similarity. The algorithm has been tested on a large set of shape databases and real images (MPEG-7, natural silhouette database.

  9. Estimating Arrhenius parameters using temperature programmed molecular dynamics

    Science.gov (United States)

    Imandi, Venkataramana; Chatterjee, Abhijit

    2016-07-01

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

  10. Dynamic programming on a tree for ultrasound elastography

    Science.gov (United States)

    Shams, Roozbeh; Boily, Mathieu; Martineau, Paul A.; Rivaz, Hassan

    2016-04-01

    Ultrasound Elastography is an emerging imaging technique that allows estimation of the mechanical characteristics of tissue. Two issues that need to be addressed before widespread use of elastography in clinical environments are real time constraints and deteriorating effects of signal decorrelation between pre- and post-compression images. Previous work has used Dynamic Programming (DP) to estimate tissue deformation. However, in case of large signal decorrelation, DP can fail. In this paper we, have proposed a novel solution to this problem by solving DP on a tree instead of a single Radio-Frequency line. Formulation of DP on a tree allows exploiting significantly more information, and as such, is more robust and accurate. Our results on phantom and in-vivo human data show that DP on tree significantly outperforms traditional DP in ultrasound elastography.

  11. Optimal approach to quantum communication using dynamic programming.

    Science.gov (United States)

    Jiang, Liang; Taylor, Jacob M; Khaneja, Navin; Lukin, Mikhail D

    2007-10-30

    Reliable preparation of entanglement between distant systems is an outstanding problem in quantum information science and quantum communication. In practice, this has to be accomplished by noisy channels (such as optical fibers) that generally result in exponential attenuation of quantum signals at large distances. A special class of quantum error correction protocols, quantum repeater protocols, can be used to overcome such losses. In this work, we introduce a method for systematically optimizing existing protocols and developing more efficient protocols. Our approach makes use of a dynamic programming-based searching algorithm, the complexity of which scales only polynomially with the communication distance, letting us efficiently determine near-optimal solutions. We find significant improvements in both the speed and the final-state fidelity for preparing long-distance entangled states. PMID:17959783

  12. DYNAMIC PROGRAMMING – ITS PRINCIPLES, APPLICATIONS, STRENGTHS, AND LIMITATIONS

    Directory of Open Access Journals (Sweden)

    BISWAJIT BHOWMIK

    2010-09-01

    Full Text Available The massive increase in computation power over the last few decades has substantially enhanced our ability to solve complex problems with their performance evaluations in diverse areas of science and engineering. With the recent developments in the field of optimizations, these methods are now become lucrative to make decisions. Dynamic Programming is one of the elegant algorithm design standards and is powerful tool which yields classic algorithms for a variety of combinatorial optimization problems. In this paper fundamental working principles, major area of applications of this approach has been introduced. The strengths which make it more prevailing than the others is also opened up. Focusing the imperative drawbacks afterward comparison study of this algorithm design technique in this paper brings a general awareness to the implementation strategies.

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

    DEFF Research Database (Denmark)

    Knudsen, Peter Voigt; Madsen, Jan

    1996-01-01

    This paper presents the PACE partitioning algorithm which is used in the LYCOS co-synthesis system for partitioning control/dataflow graphs into hardware and software parts. The algorithm is a dynamic programming algorithm which solves both the problem of minimizing system execution time with a...... hardware area constraint and the problem of minimizing hardware area with a system execution time constraint. The target architecture consists of a single microprocessor and a single hardware chip (ASIC, FPGA, etc.) which are connected by a communication channel. The algorithm incorporates a realistic...... communication model and thus attempts to minimize communication overhead. The time-complexity of the algorithm is O(n2·𝒜) and the space-complexity is O(n·𝒜) where 𝒜 is the total area of the hardware chip and n the number of code fragments which may be placed in either hardware or software...

  14. Optimal Charging of Electric Drive Vehicles: A Dynamic Programming Approach

    DEFF Research Database (Denmark)

    Delikaraoglou, Stefanos; Capion, Karsten Emil; Juul, Nina;

    2013-01-01

    With the integration of fluctuating renewable production into the electricity system, electric-drive vehicles may contribute to the resulting need for flexibility, given that the market conditions provide sufficient economic incentive. To investigate this, we consider the short-term management of...... electric vehicles in a market environment. From the perspective of vehicle operators participating in the electricity spot market, the problem is to optimally charge and discharge the vehicles in response to spot market prices. We consider the case of a vehicle owner who is a price-taker and that of a...... fleet operator who can influence prices. In both cases, we show how the problem is amenable to dynamic programming with respectively linear and quadratic costs. With discretization of the state space, however, the problem of fleet operation is prone to suffer from the curse of dimensionality and...

  15. Application of dynamic programming to structural repairing strategies

    Institute of Scientific and Technical Information of China (English)

    陈朝晖; LIU; Xila; 等

    2002-01-01

    A model of dynamic programming for repairing strategies of concrete structures during a projected service period is proposed,which takes into account the degradation in strength of components and the probability of accidental load.This model takes the safety grade of a structural system as the state variable of repairing strategies,and incorporates economic factors including expected repair cost,property loss due to structure failure,goods and material loss due to structure failure,loss of production interrupt due to structure failure,and inspection cost in decision making.It is found that the optimal repairing strategies are sensitive to the probability of accidental loads as well as the failure costs.The practicality of the model is demonstrated by an example.

  16. Mitochondrial Dynamics Controls T Cell Fate through Metabolic Programming.

    Science.gov (United States)

    Buck, Michael D; O'Sullivan, David; Klein Geltink, Ramon I; Curtis, Jonathan D; Chang, Chih-Hao; Sanin, David E; Qiu, Jing; Kretz, Oliver; Braas, Daniel; van der Windt, Gerritje J W; Chen, Qiongyu; Huang, Stanley Ching-Cheng; O'Neill, Christina M; Edelson, Brian T; Pearce, Edward J; Sesaki, Hiromi; Huber, Tobias B; Rambold, Angelika S; Pearce, Erika L

    2016-06-30

    Activated effector T (TE) cells augment anabolic pathways of metabolism, such as aerobic glycolysis, while memory T (TM) cells engage catabolic pathways, like fatty acid oxidation (FAO). However, signals that drive these differences remain unclear. Mitochondria are metabolic organelles that actively transform their ultrastructure. Therefore, we questioned whether mitochondrial dynamics controls T cell metabolism. We show that TE cells have punctate mitochondria, while TM cells maintain fused networks. The fusion protein Opa1 is required for TM, but not TE cells after infection, and enforcing fusion in TE cells imposes TM cell characteristics and enhances antitumor function. Our data suggest that, by altering cristae morphology, fusion in TM cells configures electron transport chain (ETC) complex associations favoring oxidative phosphorylation (OXPHOS) and FAO, while fission in TE cells leads to cristae expansion, reducing ETC efficiency and promoting aerobic glycolysis. Thus, mitochondrial remodeling is a signaling mechanism that instructs T cell metabolic programming. PMID:27293185

  17. Dynamic Line Rating Oncor Electric Delivery Smart Grid Program

    Energy Technology Data Exchange (ETDEWEB)

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

    2013-05-04

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

  18. Approximate spatial reasoning

    Science.gov (United States)

    Dutta, Soumitra

    1988-01-01

    Much of human reasoning is approximate in nature. Formal models of reasoning traditionally try to be precise and reject the fuzziness of concepts in natural use and replace them with non-fuzzy scientific explicata by a process of precisiation. As an alternate to this approach, it has been suggested that rather than regard human reasoning processes as themselves approximating to some more refined and exact logical process that can be carried out with mathematical precision, the essence and power of human reasoning is in its capability to grasp and use inexact concepts directly. This view is supported by the widespread fuzziness of simple everyday terms (e.g., near tall) and the complexity of ordinary tasks (e.g., cleaning a room). Spatial reasoning is an area where humans consistently reason approximately with demonstrably good results. Consider the case of crossing a traffic intersection. We have only an approximate idea of the locations and speeds of various obstacles (e.g., persons and vehicles), but we nevertheless manage to cross such traffic intersections without any harm. The details of our mental processes which enable us to carry out such intricate tasks in such apparently simple manner are not well understood. However, it is that we try to incorporate such approximate reasoning techniques in our computer systems. Approximate spatial reasoning is very important for intelligent mobile agents (e.g., robots), specially for those operating in uncertain or unknown or dynamic domains.

  19. Diophantine approximations on fractals

    CERN Document Server

    Einsiedler, Manfred; Shapira, Uri

    2009-01-01

    We exploit dynamical properties of diagonal actions to derive results in Diophantine approximations. In particular, we prove that the continued fraction expansion of almost any point on the middle third Cantor set (with respect to the natural measure) contains all finite patterns (hence is well approximable). Similarly, we show that for a variety of fractals in [0,1]^2, possessing some symmetry, almost any point is not Dirichlet improvable (hence is well approximable) and has property C (after Cassels). We then settle by similar methods a conjecture of M. Boshernitzan saying that there are no irrational numbers x in the unit interval such that the continued fraction expansions of {nx mod1 : n is a natural number} are uniformly eventually bounded.

  20. Piping and Fitting Dynamic Reliability Program, Volume 3: System tests

    International Nuclear Information System (INIS)

    Studies of single-degree-of-freedom systems have shown that after a few large excursions of deformation into the inelastic regime, component failure can be predicted to occur. However, similar multi-degree-of-freedom studies indicate that considerably higher amplitude excursions are required to produce failure within a piping system because of the redundancy in support and the redistribution of strains within the system. Earlier tests by ANCO Engineers, conducted on behalf of the Electric Power Research Institute (EPRI) and the U.S. Nuclear Regulatory Commission (NRC), showed that 4-inch diameter pressurized piping could be subjected to response levels well into yield as a result of seismic excitation up to five times safe shutdown earthquake (SSE) values without inducing either leak or collapse type of failure. Even though piping system failure was not induced during these tests, the tests did demonstrate the feasibility of multiple excitation using hydraulically-operated sleds to achieve large amplitude excitation of simple piping systems. Piping components tests of this program showed that fatigue-ratchet failure (cracking) could be induced in the component by increasing the amplitude of the input up to 20 times the SSE. This observation was confirmed on the NRC sponsored 6-inch diameter system demonstration test at the Energy Technology Engineering Center (ETEC), where failure was induced by a fatigue-ratchet mechanism and not by plastic collapse for ZPA input loads of up to 30 g's. One of the major purposes of the pipe system testing task of this program was to test the systems to confirm the failure mode and capacity where sustained primary loads (such as weight and pressure) are present and where large, time history type dynamic loads (simulating seismic, hydrodynamic, and water hammer) are used to excite the system

  1. Optimization of control poison management by dynamic programming

    International Nuclear Information System (INIS)

    A dynamic programming approach was used to optimize the poison distribution in the core of a nuclear power plant between reloading. This method was applied to a 500 M We PWR subject to two different fuel management policies. The beginning of a stage is marked by a fuel management decision. The state vector of the system is defined by the burnups in the three fuel zones of the core. The change of the state vector is computed in several time steps. A criticality conserving poison management pattern is chosen at the beginning of each step. The burnups at the end of a step are obtained by means of depletion calculations, assuming constant neutron distribution during the step. The violation of burnup and power peaking constraints during the step eliminates the corresponding end states. In the case of identical end states, all except that which produced the largest amount of energy, are eliminated. Among the several end states one is selected for the subsequent stage, when it is subjected to a fuel management decision. This selection is based on an optimally criterion previously chosen, such as: discharged fuel burnup maximization, energy generation cost minimization, etc. (author)

  2. A stochastic dynamic programming model for stream water quality management

    Indian Academy of Sciences (India)

    P P Mujumdar; Pavan Saxena

    2004-10-01

    This paper deals with development of a seasonal fraction-removal policy model for waste load allocation in streams addressing uncertainties due to randomness and fuzziness. A stochastic dynamic programming (SDP) model is developed to arrive at the steady-state seasonal fraction-removal policy. A fuzzy decision model (FDM) developed by us in an earlier study is used to compute the system performance measure required in the SDP model. The state of the system in a season is defined by streamflows at the headwaters during the season and the initial DO deficit at some pre-specified checkpoints. The random variation of streamflows is included in the SDP model through seasonal transitional probabilities. The decision vector consists of seasonal fraction-removal levels for the effluent dischargers. Uncertainty due to imprecision (fuzziness) associated with water quality goals is addressed using the concept of fuzzy decision. Responses of pollution control agencies to the resulting end-of-season DO deficit vector and that of dischargers to the fraction-removal levels are treated as fuzzy, and modelled with appropriate membership functions. Application of the model is illustrated with a case study of the Tungabhadra river in India.

  3. Dynamic behavior of the Fast Reactor cores: the Symphony program

    International Nuclear Information System (INIS)

    A fast reactor core is schematically constituted of Fuel Assemblies and Neutronic Shields, immersed in the primary coolant (sodium) which circulates inside the assemblies. Two main physical phenomena have a strong influence on the dynamic behavior of this system: the impacts between the beams and the interactions with the fluid. The impacts between the beams limit the relative displacements. The fluid leads to “inertial effects”, with globally lower vibration frequencies, and “dissipative effects”, with higher damping. Symphony is an important research program on the seismic behaviour of the fast reactor cores, developed from 1993 to 1998 at the CEA Saclay, with both experimental and theoretical parts. The experiments are at a representative scale, with Fuel Assemblies (or FA) and Neutronic Shields (or NS). Test are made “in air” (without fluid) and “in water”, to study the influence of the fluid (the sodium). A numerical model has been built for the interpretation of the tests. The interpretation of the tests is made by using a simple and efficient numerical method, based on the Euler equations for the fluid and homogenization techniques, which yields low computational costs. Impacts between the beams are taken into account also. The gaps between the feet and the grid plate lead to high damping for the beams if the gaps are important. The fluid leads to a strong coupling between the FA and the NS in the whole core, and limits the relative displacement. (author)

  4. Dynamic Programming and Genetic Algorithm for Business Processes Optimisation

    Directory of Open Access Journals (Sweden)

    Mateusz Wibig

    2012-12-01

    Full Text Available There are many business process modelling techniques, which allow to capture features of those processes, but graphical, diagrammatic models seems to be used most in companies and organizations. Although the modelling notations are more and more mature and can be used not only to visualise the process idea but also to implement it in the workflow solution and although modern software allows us to gather a lot of data for analysis purposes, there is still not much commercial used business process optimisation methods. In this paper the scheduling / optimisation method for automatic task scheduling in business processes models is described. The Petri Net model is used, but it can be easily applied to any other modelling notation, where the process is presented as a set of tasks, i.e. BPMN (Business Process Modelling Notation. The method uses Petri Nets’, business processes’ scalability and dynamic programming concept to reduce the necessary computations, by revising only those parts of the model, to which the change was applied.

  5. Dynamic programming approach for partial decision rule optimization

    KAUST Repository

    Amin, Talha

    2012-10-04

    This paper is devoted to the study of an extension of dynamic programming approach which allows optimization of partial decision rules relative to the length or coverage. We introduce an uncertainty measure J(T) which is the difference between number of rows in a decision table T and number of rows with the most common decision for T. For a nonnegative real number γ, we consider γ-decision rules (partial decision rules) that localize rows in subtables of T with uncertainty at most γ. Presented algorithm constructs a directed acyclic graph Δ γ(T) which nodes are subtables of the decision table T given by systems of equations of the kind "attribute = value". This algorithm finishes the partitioning of a subtable when its uncertainty is at most γ. The graph Δ γ(T) allows us to describe the whole set of so-called irredundant γ-decision rules. We can optimize such set of rules according to length or coverage. This paper contains also results of experiments with decision tables from UCI Machine Learning Repository.

  6. HBT-EP Program: Active MHD Mode Dynamics and Control

    Science.gov (United States)

    Navratil, G. A.; Bialek, J.; Boozer, A. H.; Byrne, P. J.; Donald, G. V.; Hughes, P. E.; Levesque, J. P.; Mauel, M. E.; Peng, Q.; Rhodes, D. J.; Stoafer, C. C.; Hansen, C. J.

    2015-11-01

    The HBT-EP active mode control research program aims to: (i) quantify external kink dynamics and multimode response to magnetic perturbations, (ii) understand the relationship between control coil configuration, conducting and ferritic wall effects, and active feedback control, and (iii) explore advanced feedback algorithms. Biorthogonal decomposition is used to observe multiple simultaneous resistive wall modes (RWM). A 512 core GPU-based low latency (14 μs) MIMO control system uses 96 inputs and 64 outputs for Adaptive Control of RWMs. An in-vessel adjustable ferritic wall is used to study ferritic RWMs with increased growth rates, RMP response, and disruptivity. A biased electrode in the plasma is used to control the rotation of external kinks and evaluate error fields. A Thomson scattering diagnostic measures Te and ne at 3 spatial points, soon to be extended to 10 points. A quasi-linear sharp-boundary model of the plasma's multimode response to error fields is developed to determine harmful error field structures and associated NTV and resonant torques. Upcoming machine upgrades will allow measurements and control of scrape-off-layer currents, and control of kink modes using optical diagnostics. Supported by U.S. DOE Grant DE-FG02-86ER53222.

  7. Adherence and satisfaction of rheumatoid arthritis patients with a long-term intensive dynamic exercise program (RAPIT program).

    NARCIS (Netherlands)

    Munneke, M.; Jong, Z. de; Zwinderman, A.H.; Jansen, A.; Ronday, H.K.; Peter, W.F.; Boonman, D.C.; Ende, C.H.M. van den; Vliet Vlieland, T.P.M.; Hazes, J.M.W.

    2003-01-01

    OBJECTIVE: To evaluate adherence and satisfaction of patients with rheumatoid arthritis (RA) in a long-term intensive dynamic exercise program. METHODS: A total of 146 RA patients started an intensive (strength and endurance training for 75 minutes, twice a week, for 2 years) exercise program (Rheum

  8. Experimental and molecular dynamics studies of dysprosium(III) salt solutions for a better representation of the microscopic features used within the binding mean spherical approximation theory

    International Nuclear Information System (INIS)

    This work is aimed at a predictive description of the thermodynamic properties of actinide (III) salt solutions at high concentration and 25 deg. C. A new solution of the binding mean spherical approximation (BIMSA) theory, based on the Wertheim formalism, for taking into account 1: 1 and also 1: 2 complex formation, is used to reproduce, from a simple procedure, experimental osmotic coefficient variation with concentration for three binary salt solutions of the same lanthanide (III) cation: dysprosium (III) perchlorate, nitrate, and chloride. The relevance of the fitted parameters is discussed, and their values are compared with available literature values. UV-vis/near-IR, time-resolved laser-induced fluorescence spectroscopy experiments, and molecular dynamics (MD) calculations were conducted for dilute to concentrated solutions (ca. 3 mol, kg-1) for a study of the microscopic behavior of DyCl3 binary solutions. Coupling MD calculations and extended X-ray absorption fine structure led to the determination of reliable distances. The MD results were used for a discussion of the parameters used in the BIMSA. (authors)

  9. Combinations of coupled cluster, density functionals, and the random phase approximation for describing static and dynamic correlation, and van der Waals interactions

    CERN Document Server

    Garza, Alejandro J; Alencar, Ana G Sousa; Sun, Jianwei; Perdew, John P; Scuseria, Gustavo E

    2015-01-01

    Contrary to standard coupled cluster doubles (CCD) and Brueckner doubles (BD), singlet-paired analogues of CCD and BD (denoted here as CCD0 and BD0) do not break down when static correlation is present, but neglect substantial amounts of dynamic correlation. In fact, CCD0 and BD0 do not account for any contributions from multielectron excitations involving only same-spin electrons at all. We exploit this feature to add---without introducing double counting, self-interaction, or increase in cost---the missing correlation to these methods via meta-GGA density functionals (TPSS and SCAN). Furthermore, we improve upon these CCD0+DFT blends by invoking range separation: the short- and long-range correlations absent in CCD0/BD0 are evaluated with DFT and the direct random phase approximation (dRPA), respectively. This corrects the description of long-range van der Waals forces. Comprehensive benchmarking shows that the combinations presented here are very accurate for weakly correlated systems, while also providing...

  10. Increasing the Thermal Conductivity of Graphene-Polyamide-6,6 Nanocomposites by Surface-Grafted Polymer Chains: Calculation with Molecular Dynamics and Effective-Medium Approximation.

    Science.gov (United States)

    Gao, Yangyang; Müller-Plathe, Florian

    2016-02-25

    By employing reverse nonequilibrium molecular dynamics simulations in a full atomistic resolution, the effect of surface-grafted chains on the thermal conductivity of graphene-polyamide-6.6 (PA) nanocomposites has been investigated. The interfacial thermal conductivity perpendicular to the graphene plane is proportional to the grafting density, while it first increases and then saturates with the grafting length. Meanwhile, the intrinsic in-plane thermal conductivity of graphene drops sharply as the grafting density increases. The maximum overall thermal conductivity of nanocomposites appears at an intermediate grafting density because of these two competing effects. The thermal conductivity of the composite parallel to the graphene plane increases with the grafting density and grafting length which is attributed to better interfacial coupling between graphene and PA. There exists an optimal balance between grafting density and grafting length to obtain the highest interfacial and parallel thermal conductivity. Two empirical formulas are suggested, which quantitatively account for the effects of grafting length and density on the interfacial and parallel thermal conductivity. Combined with effective medium approximation, for ungrafted graphene in random orientation, the model overestimates the thermal conductivity at low graphene volume fraction (f 10%). For unoriented grafted graphene, the model matches the experimental results well. In short, this work provides some valuable guides to obtain the nanocomposites with high thermal conductivity by grafting chain on the surface of graphene. PMID:26800434

  11. Dynamical mean-field approximation to small-world networks of spiking neurons: From local to global and/or from regular to random couplings

    International Nuclear Information System (INIS)

    By extending a dynamical mean-field approximation previously proposed by the author [H. Hasegawa, Phys. Rev. E 67, 041903 (2003)], we have developed a semianalytical theory which takes into account a wide range of couplings in a small-world network. Our network consists of noisy N-unit FitzHugh-Nagumo neurons with couplings whose average coordination number Z may change from local (Z<< N) to global couplings (Z=N-1) and/or whose concentration of random couplings p is allowed to vary from regular (p=0) to completely random (p=1). We have taken into account three kinds of spatial correlations: the on-site correlation, the correlation for a coupled pair, and that for a pair without direct couplings. The original 2N-dimensional stochastic differential equations are transformed to 13-dimensional deterministic differential equations expressed in terms of means, variances, and covariances of state variables. The synchronization ratio and the firing-time precision for an applied single spike have been discussed as functions of Z and p. Our calculations have shown that with increasing p, the synchronization is worse because of increased heterogeneous couplings, although the average network distance becomes shorter. Results calculated by our theory are in good agreement with those by direct simulations

  12. Optimal Polygonal Approximation of Digital Planar Curves Using Genetic Algorithm and Tabu Search

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

    Three heuristic algorithms for optimal polygonal approximation of digital planar curves is presented.With Genetic Algorithm (GA), improved Genetic Algorithm (IGA) based on Pareto optimal solution and Tabu Search (TS), a near optimal polygonal approximation was obtained.Compared to the famous Teh-chin algorithm, our algorithms have obtained the approximated polygons with less number of vertices and less approximation error.Compared to the dynamic programming algorithm, the processing time of our algorithms are much less expensive.

  13. Prestack wavefield approximations

    KAUST Repository

    Alkhalifah, Tariq

    2013-09-01

    The double-square-root (DSR) relation offers a platform to perform prestack imaging using an extended single wavefield that honors the geometrical configuration between sources, receivers, and the image point, or in other words, prestack wavefields. Extrapolating such wavefields, nevertheless, suffers from limitations. Chief among them is the singularity associated with horizontally propagating waves. I have devised highly accurate approximations free of such singularities which are highly accurate. Specifically, I use Padé expansions with denominators given by a power series that is an order lower than that of the numerator, and thus, introduce a free variable to balance the series order and normalize the singularity. For the higher-order Padé approximation, the errors are negligible. Additional simplifications, like recasting the DSR formula as a function of scattering angle, allow for a singularity free form that is useful for constant-angle-gather imaging. A dynamic form of this DSR formula can be supported by kinematic evaluations of the scattering angle to provide efficient prestack wavefield construction. Applying a similar approximation to the dip angle yields an efficient 1D wave equation with the scattering and dip angles extracted from, for example, DSR ray tracing. Application to the complex Marmousi data set demonstrates that these approximations, although they may provide less than optimal results, allow for efficient and flexible implementations. © 2013 Society of Exploration Geophysicists.

  14. Application Study on the Dynamic Programming Algorithm for Energy Management of Plug-in Hybrid Electric Vehicles

    Directory of Open Access Journals (Sweden)

    Ximing Wang

    2015-04-01

    Full Text Available To explore the problems associated with applying dynamic programming (DP in the energy management strategies of plug-in hybrid electric vehicles (PHEVs, a plug-in hybrid bus powertrain is introduced and its dynamic control model is constructed. The numerical issues, including the discretization resolution of the relevant variables and the boundary issue of their feasible regions, were considered when implementing DP to solve the optimal control problem of PHEVs. The tradeoff between the optimization accuracy when using the DP algorithm and the computational burden was systematically investigated. As a result of overcoming the numerical issues, the DP-based approach has the potential to improve the fuel-savings potential of PHEVs. The results from comparing the DP-based strategy and the traditional control strategy indicate that there is an approximately 20% improvement in fuel economy.

  15. Bellman's GAP : a 2nd generation language and system for algebraic dynamic programming

    OpenAIRE

    Sauthoff, Georg

    2010-01-01

    The dissertation describes the new Bellman’s GAP which is a programming system for writing dynamic programming algorithms over sequential data. It is the second generation implementation of the algebraic dynamic programming framework (ADP). The system includes the multi-paradigm language (GAP-L), its compiler (GAP-C), functional modules (GAP-M) and a web site (GAP Pages) to experiment with GAP-L programs. GAP-L includes declarative constructs, e.g. tree grammars to model the search space, and...

  16. Program participation, labor force dynamics, and accepted wage rates

    DEFF Research Database (Denmark)

    Munch, Jakob Roland; Skipper, Lars

    2008-01-01

    We apply a recently suggested econometric approach to measure the effects of active labor market programs on employment, unemployment, and wage histories among participants. We find that participation in most of these training programs produces an initial locking-in effect and for some even a lower...

  17. Hybrid procedure based on Bounded Dynamic Programming and Linear Programming for solving a variant of the MMSP-W

    OpenAIRE

    Bautista Valhondo, Joaquín; Cano Pérez, Alberto; Alfaro Pozo, Rocío; Batalla García, Cristina

    2013-01-01

    n this paper, we propose a hybrid procedure based on Bounded Dynamic Programming ( BDP ) and linear programming to solve the Mixed - Model Se quencing Problem with Workload Minimization ( MMSP - W ), with serial workstations, free interruption of the operations and production mix restrictions. We performed a computational experiment with 225 instances from the literature. The results of our proposal are compared with those obtained through the Guro...

  18. Automatic detection of cardiac contours on MR images using fuzzy logic and dynamic programming.

    OpenAIRE

    Lalande, A; Legrand, L; Walker, P M; Jaulent, M. C.; Guy, F.; Cottin, Y; Brunotte, F

    1997-01-01

    This paper deals with the use of fuzzy logic and dynamic programming in the detection of cardiac contours in MR Images. The definition of two parameters for each pixel allows the construction of the fuzzy set of the cardiac contour points. The first parameter takes into account the grey level, and the second the presence of an edge. A corresponding fuzzy matrix is derived from the initial image. Finally, a dynamic programming with graph searching is performed on this fuzzy matrix. The method ...

  19. A Decision Making Framework in Production Processes Using Bayesian Inference and Stochastic Dynamic Programming

    OpenAIRE

    Seyed Taghi Akhavan Niaki; Mohammad Saber Fallah Nezhad

    2007-01-01

    In order to design a decision-making framework in production environments, in this study, we use both the stochastic dynamic programming and Bayesian inference concepts. Using the posterior probability of the production process to be in state λ (the hazard rate of defective products), first we formulate the problem into a stochastic dynamic programming model. Next, we derive some properties for the optimal value of the objective function. Then, we propose a solution algorithm. At the end, the...

  20. An Action Dependent Heuristic Dynamic Programming-controlled Superconducting Magnetic Energy Storage for Transient Stability Augmentation

    Science.gov (United States)

    Wang, Xinpu; Yang, Jun; Zhang, Xiaodong; Yu, Xiaopeng

    To enhance the stability of power system, the active power and reactive power can be absorbed from or released to Superconducting magnetic energy storage (SMES) unit according to system power requirements. This paper proposes a control strategy based on action dependent heuristic dynamic programing (ADHDP) which can control SMES to improve the stability of electric power system with on-line learning ability. Based on back propagation (BP) neural network, ADHDP approximates the optimal control solution of nonlinear system through iteration step by step. This on-line learning ability improves its performance by learning from its own mistakes through reinforcement signal from external environment, so that it can adjust the neural network weights according to the back propagation error to achieve optimal control performance. To investigate the effectiveness of the proposed control strategy, simulation tests are carried out in Matlab/Simulink. And a conventional Proportional-Integral (PI) controlled method is used to compare the performance of ADHDP. Simulation results show that the proposed controller demonstrates superior damping performance on power system oscillation caused by three-phase fault and wind power fluctuation over the PI controller.

  1. Nonlinear dynamic fluid-structure interaction calculations with coupled finite element and finite volume programs

    Energy Technology Data Exchange (ETDEWEB)

    Lewis, M.W.; Kashiwa, B.A.; Meier, R.W. [Los Alamos National Lab., NM (United States); Bishop, S. [US Army Night Vision and Electronic Sensors Directorate, Fort Belvoir, VA (United States)

    1994-08-01

    Two- and three-dimensional fluid-structure interaction computer programs for the simulation of nonlinear dynamics were developed and applied to a number of problems. The programs were created by coupling Arbitrary Lagrangian-Eulerian finite volume fluid dynamics programs with strictly Lagrangian finite element structural dynamics programs. The resulting coupled programs can use either fully explicit or implicit time integration. The implicit time integration is accomplished by iterations of the fluid dynamics pressure solver and the structural dynamics system solver. The coupled programs have been used to solve problems involving incompressible fluids, membrane and shell elements, compressible multiphase flows, explosions in both air and water, and large displacements. In this paper, we present the approach used for the coupling and describe test problems that verify the two-dimensional programs against an experiment and an analytical linear problem. The experiment involves an explosion underwater near an instrumented thin steel plate. The analytical linear problem is the vibration of an infinite cylinder surrounded by an incompressible fluid to a given radius.

  2. Diophantine approximation and badly approximable sets

    DEFF Research Database (Denmark)

    Kristensen, S.; Thorn, R.; Velani, S.

    2006-01-01

    Let (X,d) be a metric space and (Omega, d) a compact subspace of X which supports a non-atomic finite measure m.  We consider `natural' classes of badly approximable  subsets of Omega. Loosely speaking, these consist of points in Omega which `stay clear' of some given set of points in X....... The classical set Bad of `badly approximable' numbers in the theory of Diophantine approximation falls within our framework as do the sets Bad(i,j) of simultaneously badly approximable numbers. Under various natural conditions we prove that the badly approximable subsets of Omega have full Hausdorff dimension...

  3. The Solar Dynamics Observatory (SDO) Education and Outreach (E/PO) Program: Changing Perceptions One Program at a Time

    Science.gov (United States)

    Drobnes, Emilie; Littleton, A.; Pesnell, William D.; Beck, K.; Buhr, S.; Durscher, R.; Hill, S.; McCaffrey, M.; McKenzie, D. E.; Myers, D.; Scherrer, D.; Wawro, M.; Wolt, A.

    2013-01-01

    We outline the context and overall philosophy for the combined Solar Dynamics Observatory (SDO) Education and Public Outreach (E/PO) program, present a brief overview of all SDO E/PO programs along with more detailed highlights of a few key programs, followed by a review of our results to date, conclude a summary of the successes, failures, and lessons learned, which future missions can use as a guide, while incorporating their own content to enhance the public's knowledge and appreciation of science and technology as well as its benefit to society.

  4. An η-Approximation Method to Duality in Multiobjective Programming Involving Invex Functions%不变凸多目标规划对偶性的η-逼近方法

    Institute of Scientific and Technical Information of China (English)

    闫春雷

    2011-01-01

    建立了不变凸多目标规划问题的η-逼近多目标规划问题与η-逼近Mond-Weir对偶问题,并通过其对偶性给出了原多目标规划问题与其Mond-Weir对偶问题的对偶性.%An 17-approximated multiobjective program associated with the original multiobjective problem involving invex functions and its 17-approximated Mond-Weir dual problem are constructed; By the help of ^-approximated dual problems various duality results are established for the original multiobjective problem and its original Mond-Weir duals .

  5. Approximating the Geometry of Dynamics in Potential Games: Point-wise Convergence, Regions of Attraction, Average Case Performance Analysis and System Invariants

    OpenAIRE

    Panageas, Ioannis; Piliouras, Georgios

    2014-01-01

    What does it mean to fully understand the behavior of a network of competing agents? The golden standard typically is the behavior of learning dynamics in potential games, where many evolutionary dynamics, e.g., replicator, are known to converge to sets of equilibria. Even in such classic settings many critical questions remain unanswered. Inspired by topological and geometric considerations, we devise novel yardsticks and techniques that allow for much more detailed analysis of game dynamics...

  6. A parallel clustered dynamic programming algorithm for discrete time optimal control problems

    International Nuclear Information System (INIS)

    Optimal control of dynamical systems is a problem that arises in many areas of engineering and physical science. Due to the special structure of optimal control problems, currently there is no parallel algorithm that can solve optimal control problems efficiently on computers with a large number of processors. In this paper, we will introduce a new optimal control algorithm that permits massively parallel processing. The proposed algorithm, called Cluster Dynamic Programming, is a combination of two efficient serial algorithms, differential dynamic programming and a stagewise Newton's method. Parallel numerical results on an Intel iPSC/860 will be presented

  7. Dispersion analysis and linear error analysis capabilities of the space vehicle dynamics simulation program

    Science.gov (United States)

    Snow, L. S.; Kuhn, A. E.

    1975-01-01

    Previous error analyses conducted by the Guidance and Dynamics Branch of NASA have used the Guidance Analysis Program (GAP) as the trajectory simulation tool. Plans are made to conduct all future error analyses using the Space Vehicle Dynamics Simulation (SVDS) program. A study was conducted to compare the inertial measurement unit (IMU) error simulations of the two programs. Results of the GAP/SVDS comparison are presented and problem areas encountered while attempting to simulate IMU errors, vehicle performance uncertainties and environmental uncertainties using SVDS are defined. An evaluation of the SVDS linear error analysis capability is also included.

  8. Steering plasmodium with light: Dynamical programming of Physarum machine

    OpenAIRE

    Adamatzky, Andrew

    2009-01-01

    A plasmodium of Physarum polycephalum is a very large cell visible by unaided eye. The plasmodium is capable for distributed sensing, parallel information processing, and decentralized optimization. It is an ideal substrate for future and emerging bio-computing devices. We study space-time dynamics of plasmodium reactiom to localised illumination, and provide analogies between propagating plasmodium and travelling wave-fragments in excitable media. We show how plasmodium-based computing devic...

  9. Transient dynamic and inelastic analysis of shells of revolution - a survey of programs

    International Nuclear Information System (INIS)

    Advances in the limits of structural use in the aerospace and nuclear power industries over the past years have increased the requirements upon the applicable analytical computer programs to include accurate capabilities for inelastic and transient dynamic analyses. In many minds, however, this advanced capability is unequivocally linked with the large scale, general purpose, finite element programs. This idea is also combined with the view that such analyses are therefore prohibitively expensive and should be relegated to the 'last resort' classification. While this, in the general sense, may indeed be the case, if the user needs only to analyze structures falling into limited categories, however, he may find that a variety of smaller special purpose programs are available which do not put an undue strain upon his resources. One such structural category is shells of revolution. This survey of programs concentrates upon the analytical tools which have been developed predominantly for shells of revolution. The survey is subdivided into three parts: (a) consideration of programs for transient dynamic analysis; (b) consideration of programs for inelastic analysis and finally; (c) consideration of programs capable of dynamic plasticity analysis. In each part, programs based upon finite difference, finite element, and numerical integration methods are considered. The programs are compared on the basis of analytical capabilities, and ease of idealization and use. In each part of the survey sample problems are utilized to exemplify the state-of-the-art. (Auth.)

  10. Chebyshev polynomial approximation to approximate partial differential equations

    OpenAIRE

    Caporale, Guglielmo Maria; Cerrato, Mario

    2008-01-01

    This pa per suggests a simple method based on Chebyshev approximation at Chebyshev nodes to approximate partial differential equations. The methodology simply consists in determining the value function by using a set of nodes and basis functions. We provide two examples. Pricing an European option and determining the best policy for chatting down a machinery. The suggested method is flexible, easy to program and efficient. It is also applicable in other fields, providing efficient solutions t...

  11. A dynamic regrouping based sequential dynamic programming algorithm for unit commitment of combined heat and power systems

    DEFF Research Database (Denmark)

    Rong, Aiying; Hakonen, Henri; Lahdelma, Risto

    2009-01-01

    This paper addresses the unit commitment (UC) in multi-period combined heat and power (CHP) production planning under the deregulated power market. In CHP plants (units), generation of heat and power follows joint characteristics, which implies that it is difficult to determine the relative cost...... efficiency of the plants. We introduce in this paper the DRDP-RSC algorithm, which is a dynamic regrouping based dynamic programming (DP) algorithm based on linear relaxation of the ON/OFF states of the units, sequential commitment of units in small groups. Relaxed states of the plants are used to reduce the...

  12. Integrating Program Theory and Systems-Based Procedures in Program Evaluation: A Dynamic Approach to Evaluate Educational Programs

    Science.gov (United States)

    Grammatikopoulos, Vasilis

    2012-01-01

    The current study attempts to integrate parts of program theory and systems-based procedures in educational program evaluation. The educational program that was implemented, called the "Early Steps" project, proposed that physical education can contribute to various educational goals apart from the usual motor skills improvement. Basic elements of…

  13. A Case for Dynamic Reverse-code Generation to Debug Non-deterministic Programs

    Directory of Open Access Journals (Sweden)

    Jooyong Yi

    2013-09-01

    Full Text Available Backtracking (i.e., reverse execution helps the user of a debugger to naturally think backwards along the execution path of a program, and thinking backwards makes it easy to locate the origin of a bug. So far backtracking has been implemented mostly by state saving or by checkpointing. These implementations, however, inherently do not scale. Meanwhile, a more recent backtracking method based on reverse-code generation seems promising because executing reverse code can restore the previous states of a program without state saving. In the literature, there can be found two methods that generate reverse code: (a static reverse-code generation that pre-generates reverse code through static analysis before starting a debugging session, and (b dynamic reverse-code generation that generates reverse code by applying dynamic analysis on the fly during a debugging session. In particular, we espoused the latter one in our previous work to accommodate non-determinism of a program caused by e.g., multi-threading. To demonstrate the usefulness of our dynamic reverse-code generation, this article presents a case study of various backtracking methods including ours. We compare the memory usage of various backtracking methods in a simple but nontrivial example, a bounded-buffer program. In the case of non-deterministic programs such as this bounded-buffer program, our dynamic reverse-code generation outperforms the existing backtracking methods in terms of memory efficiency.

  14. Neuro-Dynamic Programming for Radiation Treatment Planning

    OpenAIRE

    Ferris, Michael C.; Voelker, Meta M.

    2002-01-01

    In many cases a radiotherapy treatment is delivered as a series of smaller dosages over a period of time. Currently, it is difficult to determine the actual dose that has been delivered at each stage, precluding the use of adaptive treatment plans. However, new generations of machines will give more accurate information of actual dose delivered, allowing a planner to compensate for errors in delivery. We formulate a model of the day-to-day planning problem as a stochastic linear program and e...

  15. Structural dynamics: Probabilistic structural analysis methods. Program overview

    Science.gov (United States)

    Chamis, Christos C.; Hopkins, Dale A.

    1991-01-01

    A brief description is provided of the fundamental aspects of a quantification process. Progress since the last structural durability conference in 1989 is summarized. The methodology to date and that to be developed during the life of the program is presented. The uncertain factors are presented. The approach is outlined that is required to achieve component and/or system certification in the shortest possible time for affordable reliability risk. Two new elements appear in a block diagram: (1) uncertainties in human factor, and (2) uncertainties in the computer code. Research to quantify the uncertainties in the human factor was initiated and is discussed.

  16. Program of research in flight dynamics in the JIAFS at NASA-Langley Research Center

    Science.gov (United States)

    1992-01-01

    The program objectives are fully defined in the original proposal entitled 'Program of Research in Flight Dynamics in the Joint Institute for the Advancement of Flight Sciences (JIAFS) at NASA-Langley Research Center,' which was originated March 20, 1975 and in the renewal of the research program dated December 1, 1991. The program includes four major topics: (1) the improvement of existing methods and development of new methods for flight test data analysis; (2) the application of these methods to real flight test data obtained from advanced airplanes; (3) the correlation of flight results with wind tunnel measurements; and (4) the modeling, and control of aircraft, space structures, and spacecraft.

  17. Program of Research in Flight Dynamics, The George Washington University at NASA Langley Research Center

    Science.gov (United States)

    Murphy, Patrick C. (Technical Monitor); Klein, Vladislav

    2005-01-01

    The program objectives are fully defined in the original proposal entitled Program of Research in Flight Dynamics in GW at NASA Langley Research Center, which was originated March 20, 1975, and in the renewals of the research program from January 1, 2003 to September 30, 2005. The program in its present form includes three major topics: 1. the improvement of existing methods and development of new methods for wind tunnel and flight data analysis, 2. the application of these methods to wind tunnel and flight test data obtained from advanced airplanes, 3. the correlation of flight results with wind tunnel measurements, and theoretical predictions.

  18. RVDYNA: A relief-valve dynamic analysis program

    International Nuclear Information System (INIS)

    A lumped parameter dynamic simulation model called RVDYNA has been developed to study the behavior of relief valves on liquid service. The model can provide an insight into the operation of these valves when they are installed in their final plant piping configuration. The model is able to predict the onset of chattering which can result in a piping or valve failure. In addition to first-principles based hydraulic models for the piping network, RVDYNA uses empirical steady-state characteristics for the valves. The empirical parameters are determined by laboratory tests. The model can predict conditions that can lead to valve flutter (high frequency disc oscillations with no metal to metal contact) or chatter (lower frequency disc oscillations with metal to metal contact). RVDYNA can also be used to predict normal valve cycling rates (open/close cycles) for various accident inflow conditions and to estimate available margins to chatter for the RVs for a number of piping design parameters

  19. Watermarking Java Programs using Dummy Methods with Dynamically Opaque Predicates

    CERN Document Server

    Akbar, Zaenal

    2010-01-01

    Software piracy, the illegal using, copying, and resale of applications is a major concern for anyone develops software. Software developers also worry about their applications being reverse engineered by extracting data structures and algorithms from an application and incorporated into competitor's code. A defense against software piracy is watermarking, a process that embeds a secret message in a cover software. Watermarking is a method that does not aim to stop piracy copying, but to prove ownership of the software and possibly even the data structures and algorithms used in the software. The language Java was designed to be compiled into a platform independent bytecode format. Much of the information contained in the source code remains in the bytecode, which means that decompilation is easier than with traditional native codes. In this thesis, we present a technique for watermarking Java programs by using a never-executed dummy method (Monden et.al., 2000) combined with opaque predicates (Collberg et.al...

  20. Repetitive elements dynamics in cell identity programming, maintenance and disease

    KAUST Repository

    Bodega, Beatrice

    2014-12-01

    The days of \\'junk DNA\\' seem to be over. The rapid progress of genomics technologies has been unveiling unexpected mechanisms by which repetitive DNA and in particular transposable elements (TEs) have evolved, becoming key issues in understanding genome structure and function. Indeed, rather than \\'parasites\\', recent findings strongly suggest that TEs may have a positive function by contributing to tissue specific transcriptional programs, in particular as enhancer-like elements and/or modules for regulation of higher order chromatin structure. Further, it appears that during development and aging genomes experience several waves of TEs activation, and this contributes to individual genome shaping during lifetime. Interestingly, TEs activity is major target of epigenomic regulation. These findings are shedding new light on the genome-phenotype relationship and set the premises to help to explain complex disease manifestation, as consequence of TEs activity deregulation.

  1. Discrete neural dynamic programming in wheeled mobile robot control

    Science.gov (United States)

    Hendzel, Zenon; Szuster, Marcin

    2011-05-01

    In this paper we propose a discrete algorithm for a tracking control of a two-wheeled mobile robot (WMR), using an advanced Adaptive Critic Design (ACD). We used Dual-Heuristic Programming (DHP) algorithm, that consists of two parametric structures implemented as Neural Networks (NNs): an actor and a critic, both realized in a form of Random Vector Functional Link (RVFL) NNs. In the proposed algorithm the control system consists of the DHP adaptive critic, a PD controller and a supervisory term, derived from the Lyapunov stability theorem. The supervisory term guaranties a stable realization of a tracking movement in a learning phase of the adaptive critic structure and robustness in face of disturbances. The discrete tracking control algorithm works online, uses the WMR model for a state prediction and does not require a preliminary learning. Verification has been conducted to illustrate the performance of the proposed control algorithm, by a series of experiments on the WMR Pioneer 2-DX.

  2. A test of two approximate two-state treatments for the dynamics of H-atom transfers between two heavy particles

    OpenAIRE

    Klippenstein, Stephen J.; Babamov, Vasil K.; Marcus, R. A.

    1986-01-01

    Reactive transition probabilities and Boltzmann-averaged reactive transition probabilities for a slightly off-resonant model H-atom transfer system with an appreciable energy barrier are calculated using the approximate methods of Babamov et al. and of Crothers–Stückelberg. Both are compared with the corresponding quantities obtained from a numerical two-state treatment of the same model system. The method of Babamov et al. is seen to give more accurate results for the transition probabilitie...

  3. Data compression of discrete sequence: A tree based approach using dynamic programming

    Science.gov (United States)

    Shivaram, Gurusrasad; Seetharaman, Guna; Rao, T. R. N.

    1994-01-01

    A dynamic programming based approach for data compression of a ID sequence is presented. The compression of an input sequence of size N to that of a smaller size k is achieved by dividing the input sequence into k subsequences and replacing the subsequences by their respective average values. The partitioning of the input sequence is carried with the intention of reducing the mean squared error in the reconstructed sequence. The complexity involved in finding the partitions which would result in such an optimal compressed sequence is reduced by using the dynamic programming approach, which is presented.

  4. OpenDx programs for visualization of computational fluid dynamics (CFD) simulations

    International Nuclear Information System (INIS)

    The search for high performance and low cost hardware and software solutions always guides the developments performed at the IEN parallel computing laboratory. In this context, this dissertation about the building of programs for visualization of computational fluid dynamics (CFD) simulations using the open source software OpenDx was written. The programs developed are useful to produce videos and images in two or three dimensions. They are interactive, easily to use and were designed to serve fluid dynamics researchers. A detailed description about how this programs were developed and the complete instructions of how to use them was done. The use of OpenDx as development tool is also introduced. There are examples that help the reader to understand how programs can be useful for many applications. (author)

  5. Dynamic analysis for solid waste management systems: an inexact multistage integer programming approach.

    Science.gov (United States)

    Li, Yongping; Huang, Guohe

    2009-03-01

    In this study, a dynamic analysis approach based on an inexact multistage integer programming (IMIP) model is developed for supporting municipal solid waste (MSW) management under uncertainty. Techniques of interval-parameter programming and multistage stochastic programming are incorporated within an integer-programming framework. The developed IMIP can deal with uncertainties expressed as probability distributions and interval numbers, and can reflect the dynamics in terms of decisions for waste-flow allocation and facility-capacity expansion over a multistage context. Moreover, the IMIP can be used for analyzing various policy scenarios that are associated with different levels of economic consequences. The developed method is applied to a case study of long-term waste-management planning. The results indicate that reasonable solutions have been generated for binary and continuous variables. They can help generate desired decisions of system-capacity expansion and waste-flow allocation with a minimized system cost and maximized system reliability. PMID:19320267

  6. A note on linearization methods and dynamic programming principles for stochastic discontinuous control problems

    OpenAIRE

    Goreac, Dan; Serea, Oana Silvia

    2012-01-01

    Using the linear programming approach to stochastic control introduced by Buckdahn, Goreac, and Quincampoix, and by Goreac and Serea, we provide a semigroup property for some set of probability measures leading to dynamic programming principles for stochastic control problems. An abstract principle is provided for general bounded costs. Linearized versions are obtained under further (semi)continuity assumptions.

  7. Evaluation of Bonneville's 1988 and 1989 Residential Weatherization Program: A Northwest study of program dynamics

    Energy Technology Data Exchange (ETDEWEB)

    Brown, M.A.; White, D.L.

    1992-12-01

    This study continues the series of evaluations of the Bonneville Power Administration's long-term Residential Weatherization Program (RWP) by examining the energy saved by its 1988 and 1989 participants. The sample of participants for this study was drawn from 10 utilities covering the region's three climate zones. Six of these utilities were included in the 1988 RWP evaluation, and eight of them were included in the 1989 RWP evaluation. This study analyzes data on 356 participating households in 1988, 433 participants in 1989, and a comparison group of 1170 nonparticipants in 1988 and 1466 in 1989. Previous evaluations of Bonneville's earlier weatherization programs provide an historic context for analyzing program dynamics.

  8. Evaluation of Bonneville`s 1988 and 1989 Residential Weatherization Program: A Northwest study of program dynamics

    Energy Technology Data Exchange (ETDEWEB)

    Brown, M.A.; White, D.L.

    1992-12-01

    This study continues the series of evaluations of the Bonneville Power Administration`s long-term Residential Weatherization Program (RWP) by examining the energy saved by its 1988 and 1989 participants. The sample of participants for this study was drawn from 10 utilities covering the region`s three climate zones. Six of these utilities were included in the 1988 RWP evaluation, and eight of them were included in the 1989 RWP evaluation. This study analyzes data on 356 participating households in 1988, 433 participants in 1989, and a comparison group of 1170 nonparticipants in 1988 and 1466 in 1989. Previous evaluations of Bonneville`s earlier weatherization programs provide an historic context for analyzing program dynamics.

  9. Interatomic forces in the electron-gas approximation

    International Nuclear Information System (INIS)

    This report describes the approximations involved in calculating the separate kinetic, coulomb, exchange and correlation contributions to the non-bonded interaction energy between closed-shell atoms. The basis of the method is an electron-gas model. The resulting potentials may be used in solid-state physics calculations or molecular dynamics simulations. Instructions are included for running three computer programs, HERSKILL, EXPAND and WEDEPOHL, which use the method described. (author)

  10. Electronic localization and bad-metallicity in pure and electron-doped troilite: A local-density-approximation plus dynamical-mean-field-theory study of FeS for lithium-ion batteries

    Science.gov (United States)

    Craco, L.; Faria, J. L. B.

    2016-02-01

    Iron sulfides are promising candidates for the next generation of rechargeable lithium-ion battery materials. Motivated thereby, we present a detailed study of correlation- and doping-induced electronic reconstruction in troilite. Based on local-density-approximation plus dynamical-mean-field-theory, we stress the importance of multi-orbital Coulomb interactions in concert with first-principles band structure calculations for a consistent understanding of intrinsic Mott-Hubbard insulating state in FeS. We explore the anomalous nature of electron doping-induced insulator-bad metal transition, showing that it is driven by orbital-selective dynamical spectral weight transfer. Our results are relevant for understanding charge dynamics upon electrochemical lithiation of iron monosulfides electrode materials for lithium-ion batteries.

  11. Dynamic capacity adjustment for virtual-path based networks using neuro-dynamic programming

    OpenAIRE

    Şahin, Cem

    2003-01-01

    Cataloged from PDF version of article. Dynamic capacity adjustment is the process of updating the capacity reservation of a virtual path via signalling in the network. There are two important issues to be considered: bandwidth (resource) utilization and signaling traffic. Changing the capacity too frequently will lead to efficient usage of resources but has a disadvantage of increasing signaling traffic among the network elements. On the other hand, if the capacity is adjust...

  12. Static and Dynamic Coupling and Cohesion Measures in Object Oriented Programming

    Directory of Open Access Journals (Sweden)

    Vasudha Dixit, Dr. Rajeev Vishwkarma

    2013-10-01

    Full Text Available A large numbers of metrics have been proposed for measuring properties of object-oriented software such as size, inheritance, cohesion and coupling. The coupling metrics presented in this paper exploring the difference between inheritance and interface programming. This paper presents a measurement to measure coupling between object (CBO, number of associations between classes (NASSocC, number of dependencies in metric (NDepIN and number of dependenciesout metric (NDepOut in object oriented programming for both static and dynamic analysis. Java programs is used for implementation.In this paper we want to show which concept is good to use and beneficial for software developer.

  13. Encoding four gene expression programs in the activation dynamics of a single transcription factor.

    Science.gov (United States)

    Hansen, Anders S; O'Shea, Erin K

    2016-04-01

    Cellular signaling response pathways often exhibit a bow-tie topology [1,2]: multiple upstream stress signals converge on a single shared transcription factor, which is thought to induce different downstream gene expression programs (Figure 1A). However, if several different signals activate the same transcription factor, can each signal then induce a specific gene expression response? A growing body of literature supports a temporal coding theory where information about environmental signals can be encoded, at least partially, in the temporal dynamics of the shared transcription factor [1,2]. For example, in the case of the budding yeast transcription factor Msn2, different stresses induce distinct Msn2 activation dynamics: Msn2 shows pulsatile nuclear activation with dose-dependent frequency under glucose limitation, but sustained nuclear activation with dose-dependent amplitude under oxidative stress [3]. These dynamic patterns can then lead to differential gene expression responses [3-5], but it is not known how much specificity can be obtained. Thus, a major question of this temporal coding theory is how many gene response programs or cellular functions can be robustly encoded by dynamic control of a single transcription factor. Here we provide the first direct evidence that, simply by regulating the activation dynamics of a single transcription factor, it is possible to preferentially induce four distinct gene expression programs. PMID:27046808

  14. Heuristic Implementation of Dynamic Programming for Matrix Permutation Problems in Combinatorial Data Analysis

    Science.gov (United States)

    Brusco, Michael J.; Kohn, Hans-Friedrich; Stahl, Stephanie

    2008-01-01

    Dynamic programming methods for matrix permutation problems in combinatorial data analysis can produce globally-optimal solutions for matrices up to size 30x30, but are computationally infeasible for larger matrices because of enormous computer memory requirements. Branch-and-bound methods also guarantee globally-optimal solutions, but computation…

  15. On the Dynamic Programming Approach for the 3D Navier-Stokes Equations

    International Nuclear Information System (INIS)

    The dynamic programming approach for the control of a 3D flow governed by the stochastic Navier-Stokes equations for incompressible fluid in a bounded domain is studied. By a compactness argument, existence of solutions for the associated Hamilton-Jacobi-Bellman equation is proved. Finally, existence of an optimal control through the feedback formula and of an optimal state is discussed

  16. Relationship between Maximum Principle and Dynamic Programming for Stochastic Recursive Optimal Control Problems and Applications

    Directory of Open Access Journals (Sweden)

    Jingtao Shi

    2013-01-01

    Full Text Available This paper is concerned with the relationship between maximum principle and dynamic programming for stochastic recursive optimal control problems. Under certain differentiability conditions, relations among the adjoint processes, the generalized Hamiltonian function, and the value function are given. A linear quadratic recursive utility portfolio optimization problem in the financial engineering is discussed as an explicitly illustrated example of the main result.

  17. Relationship between Maximum Principle and Dynamic Programming for Stochastic Recursive Optimal Control Problems and Applications

    OpenAIRE

    Jingtao Shi; Zhiyong Yu

    2013-01-01

    This paper is concerned with the relationship between maximum principle and dynamic programming for stochastic recursive optimal control problems. Under certain differentiability conditions, relations among the adjoint processes, the generalized Hamiltonian function, and the value function are given. A linear quadratic recursive utility portfolio optimization problem in the financial engineering is discussed as an explicitly illustrated example of the main result.

  18. Dynamic Programming Principle for Stochastic Control Problems driven by General L\\'{e}vy Noise

    OpenAIRE

    Goldys, Ben; Wu, Wei

    2016-01-01

    We extend the proof of the dynamic programming principle (DPP) for standard stochastic optimal control problems driven by general L\\'{e}vy noises. Under appropriate assumptions, it is shown that the DPP still holds when the state process fails to have any moments at all.

  19. A Weak Dynamic Programming Principle for Zero-Sum Stochastic Differential Games with Unbounded Controls

    OpenAIRE

    Bayraktar, Erhan; Yao, Song

    2012-01-01

    We analyze a zero-sum stochastic differential game between two competing players who can choose unbounded controls. The payoffs of the game are defined through backward stochastic differential equations. We prove that each player's priority value satisfies a weak dynamic programming principle and thus solves the associated fully non-linear partial differential equation in the viscosity sense.

  20. Dynamic Programming for Re-Mapping Noisy Fixations in Translation Tasks

    DEFF Research Database (Denmark)

    Carl, Michael

    2013-01-01

    possible fixated symbols, including those on the line above and below the naïve fixation mapping. In a second step a dynamic programming algorithm applies a number of heuristics to find the best path through the lattice, based on the probable distance in characters, in words and in pixels between...

  1. An Optimal Algorithm towards Successive Location Privacy in Sensor Networks with Dynamic Programming

    Science.gov (United States)

    Zhao, Baokang; Wang, Dan; Shao, Zili; Cao, Jiannong; Chan, Keith C. C.; Su, Jinshu

    In wireless sensor networks, preserving location privacy under successive inference attacks is extremely critical. Although this problem is NP-complete in general cases, we propose a dynamic programming based algorithm and prove it is optimal in special cases where the correlation only exists between p immediate adjacent observations.

  2. Modeling Dynamic Programming Problems over Sequences and Trees with Inverse Coupled Rewrite Systems

    Directory of Open Access Journals (Sweden)

    Robert Giegerich

    2014-03-01

    Full Text Available Dynamic programming is a classical algorithmic paradigm, which often allows the evaluation of a search space of exponential size in polynomial time. Recursive problem decomposition, tabulation of intermediate results for re-use, and Bellman’s Principle of Optimality are its well-understood ingredients. However, algorithms often lack abstraction and are difficult to implement, tedious to debug, and delicate to modify. The present article proposes a generic framework for specifying dynamic programming problems. This framework can handle all kinds of sequential inputs, as well as tree-structured data. Biosequence analysis, document processing, molecular structure analysis, comparison of objects assembled in a hierarchic fashion, and generally, all domains come under consideration where strings and ordered, rooted trees serve as natural data representations. The new approach introduces inverse coupled rewrite systems. They describe the solutions of combinatorial optimization problems as the inverse image of a term rewrite relation that reduces problem solutions to problem inputs. This specification leads to concise yet translucent specifications of dynamic programming algorithms. Their actual implementation may be challenging, but eventually, as we hope, it can be produced automatically. The present article demonstrates the scope of this new approach by describing a diverse set of dynamic programming problems which arise in the domain of computational biology, with examples in biosequence and molecular structure analysis.

  3. Learning to Question: The Roles of Multiple Hypotheses, Successive Approximations, Balloons and Toilet Paper in University Science Programs of Southwestern Amazonia

    Science.gov (United States)

    Brown, I. Foster

    2008-01-01

    Learning to question is essential for determining pathways of conservation and development in southwestern Amazonia during a time of rapid global environmental change. Teaching such an approach in graduate science programs in regional universities can be done using play-acting and simulation exercises. Multiple working hypotheses help students…

  4. A molecular dynamics study of intramolecular proton transfer reaction of malonaldehyde in solutions based upon mixed quantum-classical approximation. I. Proton transfer reaction in water

    International Nuclear Information System (INIS)

    In order to investigate proton transfer reaction in solution, mixed quantum-classical molecular dynamics calculations have been carried out based on our previously proposed quantum equation of motion for the reacting system [A. Yamada and S. Okazaki, J. Chem. Phys. 128, 044507 (2008)]. Surface hopping method was applied to describe forces acting on the solvent classical degrees of freedom. In a series of our studies, quantum and solvent effects on the reaction dynamics in solutions have been analysed in detail. Here, we report our mixed quantum-classical molecular dynamics calculations for intramolecular proton transfer of malonaldehyde in water. Thermally activated proton transfer process, i.e., vibrational excitation in the reactant state followed by transition to the product state and vibrational relaxation in the product state, as well as tunneling reaction can be described by solving the equation of motion. Zero point energy is, of course, included, too. The quantum simulation in water has been compared with the fully classical one and the wave packet calculation in vacuum. The calculated quantum reaction rate in water was 0.70 ps−1, which is about 2.5 times faster than that in vacuum, 0.27 ps−1. This indicates that the solvent water accelerates the reaction. Further, the quantum calculation resulted in the reaction rate about 2 times faster than the fully classical calculation, which indicates that quantum effect enhances the reaction rate, too. Contribution from three reaction mechanisms, i.e., tunneling, thermal activation, and barrier vanishing reactions, is 33:46:21 in the mixed quantum-classical calculations. This clearly shows that the tunneling effect is important in the reaction

  5. Dynamics of the dissociative electron attachment in H2O and D2O: The A1 resonance and axial recoil approximation

    Indian Academy of Sciences (India)

    N Bhargava Ram; Vaibhav S Prabhudesai; E Krishnakumar

    2012-01-01

    The dynamics of the formation and decay of negative ion resonance of A1 symmetry at 8.5 eV electron energy in the dissociative electron attachment (DEA) process in H2O and D2O are investigated using the velocity slice imaging technique. While the highest energy hydride ions formed by DEA show angular distributions characteristic to the A1 symmetry, those formed with low-kinetic energy show considerably different angular distributions indicating changes in the orientation of the dissociating bond due to bending mode vibrations. Our observations are quite different from the recently reported measurements, but consistent with the fully quantum calculations.

  6. Fuzzy Approximating Spaces

    OpenAIRE

    Bin Qin

    2014-01-01

    Relationships between fuzzy relations and fuzzy topologies are deeply researched. The concept of fuzzy approximating spaces is introduced and decision conditions that a fuzzy topological space is a fuzzy approximating space are obtained.

  7. Stochastic approximation: invited paper

    OpenAIRE

    Lai, Tze Leung

    2003-01-01

    Stochastic approximation, introduced by Robbins and Monro in 1951, has become an important and vibrant subject in optimization, control and signal processing. This paper reviews Robbins' contributions to stochastic approximation and gives an overview of several related developments.

  8. Approximate flavor symmetries

    CERN Document Server

    Rasin, A

    1994-01-01

    We discuss the idea of approximate flavor symmetries. Relations between approximate flavor symmetries and natural flavor conservation and democracy models is explored. Implications for neutrino physics are also discussed.

  9. Approximate iterative algorithms

    CERN Document Server

    Almudevar, Anthony Louis

    2014-01-01

    Iterative algorithms often rely on approximate evaluation techniques, which may include statistical estimation, computer simulation or functional approximation. This volume presents methods for the study of approximate iterative algorithms, providing tools for the derivation of error bounds and convergence rates, and for the optimal design of such algorithms. Techniques of functional analysis are used to derive analytical relationships between approximation methods and convergence properties for general classes of algorithms. This work provides the necessary background in functional analysis a

  10. Solar Pilot Plant, Phase I. Preliminary design report. Volume II, Book 3. Dynamic simulation model and computer program descriptions. CDRL item 2. [SPP dynamics simulation program

    Energy Technology Data Exchange (ETDEWEB)

    None

    1977-05-01

    The mathematical models and computer program comprising the SPP Dynamic Simulation are described. The SPP Dynamic Simulation is a computerized model representing the time-varying performance characteristics of the SPP. The model incorporates all the principal components of the pilot plant. Time-dependent direct normal solar insulation, as corrupted by simulated cloud passages, is transformed into absorbed radiant power by actions of the heliostat field and enclosed receiver cavity. The absorbed power then drives the steam generator model to produce superheated steam for the turbine and/or thermal storage subsystems. The thermal storage subsystem can, in turn, also produce steam for the turbine. The turbine using the steam flow energy produces the mechanical shaft power necessary for the generator to convert it to electrical power. This electrical power is subsequently transmitted to a transmission grid system. Exhaust steam from the turbine is condensed, reheated, deaerated, and pressurized by pumps for return as feedwater to the thermal storage and/or steam generator. A master control/instrumentation system is utilized to coordinate the various plant operations. The master controller reacts to plant operator demands and control settings to effect the desired output response. The SPP Dynamic Simulation Computer program is written in FORTRAN language. Various input options (e.g., insolation values, load demands, initial pressures/temperatures/flows) are permitted. Plant performance may be monitored via computer printout or computer generated plots. The remainder of this document describes the detailed pilot plant dynamic model, the basis for this simulation, and the utilization of this simulation to obtain analytical plant performance results.

  11. Optimal Strategy for Integrated Dynamic Inventory Control and Supplier Selection in Unknown Environment via Stochastic Dynamic Programming

    Science.gov (United States)

    Sutrisno; Widowati; Solikhin

    2016-06-01

    In this paper, we propose a mathematical model in stochastic dynamic optimization form to determine the optimal strategy for an integrated single product inventory control problem and supplier selection problem where the demand and purchasing cost parameters are random. For each time period, by using the proposed model, we decide the optimal supplier and calculate the optimal product volume purchased from the optimal supplier so that the inventory level will be located at some point as close as possible to the reference point with minimal cost. We use stochastic dynamic programming to solve this problem and give several numerical experiments to evaluate the model. From the results, for each time period, the proposed model was generated the optimal supplier and the inventory level was tracked the reference point well.

  12. Solving the Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem by Dynamic Programming

    DEFF Research Database (Denmark)

    Christensen, Tue; Andersen, Kim Allan; Klose, Andreas

    2013-01-01

    This paper considers a minimum-cost network flow problem in a bipartite graph with a single sink. The transportation costs exhibit a staircase cost structure because such types of transportation cost functions are often found in practice. We present a dynamic programming algorithm for solving...... this so-called single-sink, fixed-charge, multiple-choice transportation problem exactly. The method exploits heuristics and lower bounds to peg binary variables, improve bounds on flow variables, and reduce the state-space variable. In this way, the dynamic programming method is able to solve large...... instances with up to 10,000 nodes and 10 different transportation modes in a few seconds, much less time than required by a widely used mixed-integer programming solver and other methods proposed in the literature for this problem....

  13. Dynamics and Control of Orbiting Space Structures NASA Advanced Design Program (ADP)

    Science.gov (United States)

    Cruse, T. A.

    1996-01-01

    The report summarizes the advanced design program in the mechanical engineering department at Vanderbilt University for the academic years 1994-1995 and 1995-1996. Approximately 100 students participated in the two years of the subject grant funding. The NASA-oriented design projects that were selected included lightweight hydrogen propellant tank for the reusable launch vehicle, a thermal barrier coating test facility, a piezoelectric motor for space antenna control, and a lightweight satellite for automated materials processing. The NASA supported advanced design program (ADP) has been a success and a number of graduates are working in aerospace and are doing design.

  14. Approximation of distributed delays

    CERN Document Server

    Lu, Hao; Eberard, Damien; Simon, Jean-Pierre

    2010-01-01

    We address in this paper the approximation problem of distributed delays. Such elements are convolution operators with kernel having bounded support, and appear in the control of time-delay systems. From the rich literature on this topic, we propose a general methodology to achieve such an approximation. For this, we enclose the approximation problem in the graph topology, and work with the norm defined over the convolution Banach algebra. The class of rational approximates is described, and a constructive approximation is proposed. Analysis in time and frequency domains is provided. This methodology is illustrated on the stabilization control problem, for which simulations results show the effectiveness of the proposed methodology.

  15. Extended application of Kohn-Sham first-principles molecular dynamics method with plane wave approximation at high energy—From cold materials to hot dense plasmas

    Science.gov (United States)

    Zhang, Shen; Wang, Hongwei; Kang, Wei; Zhang, Ping; He, X. T.

    2016-04-01

    An extended first-principles molecular dynamics (FPMD) method based on Kohn-Sham scheme is proposed to elevate the temperature limit of the FPMD method in the calculation of dense plasmas. The extended method treats the wave functions of high energy electrons as plane waves analytically and thus expands the application of the FPMD method to the region of hot dense plasmas without suffering from the formidable computational costs. In addition, the extended method inherits the high accuracy of the Kohn-Sham scheme and keeps the information of electronic structures. This gives an edge to the extended method in the calculation of mixtures of plasmas composed of heterogeneous ions, high-Z dense plasmas, lowering of ionization potentials, X-ray absorption/emission spectra, and opacities, which are of particular interest to astrophysics, inertial confinement fusion engineering, and laboratory astrophysics.

  16. Sparse approximation with bases

    CERN Document Server

    2015-01-01

    This book systematically presents recent fundamental results on greedy approximation with respect to bases. Motivated by numerous applications, the last decade has seen great successes in studying nonlinear sparse approximation. Recent findings have established that greedy-type algorithms are suitable methods of nonlinear approximation in both sparse approximation with respect to bases and sparse approximation with respect to redundant systems. These insights, combined with some previous fundamental results, form the basis for constructing the theory of greedy approximation. Taking into account the theoretical and practical demand for this kind of theory, the book systematically elaborates a theoretical framework for greedy approximation and its applications.  The book addresses the needs of researchers working in numerical mathematics, harmonic analysis, and functional analysis. It quickly takes the reader from classical results to the latest frontier, but is written at the level of a graduate course and do...

  17. Optimal Least-Squares Unidimensional Scaling: Improved Branch-and-Bound Procedures and Comparison to Dynamic Programming

    Science.gov (United States)

    Brusco, Michael J.; Stahl, Stephanie

    2005-01-01

    There are two well-known methods for obtaining a guaranteed globally optimal solution to the problem of least-squares unidimensional scaling of a symmetric dissimilarity matrix: (a) dynamic programming, and (b) branch-and-bound. Dynamic programming is generally more efficient than branch-and-bound, but the former is limited to matrices with…

  18. Waveless Approximation Theories of Gravity

    CERN Document Server

    Isenberg, J A

    2007-01-01

    The analysis of a general multibody physical system governed by Einstein's equations in quite difficult, even if numerical methods (on a computer) are used. Some of the difficulties -- many coupled degrees of freedom, dynamic instability -- are associated with the presence of gravitational waves. We have developed a number of ``waveless approximation theories'' (WAT) which repress the gravitational radiation and thereby simplify the analysis. The matter, according to these theories, evolves dynamically. The gravitational field, however, is determined at each time step by a set of elliptic equations with matter sources. There is reason to believe that for many physical systems, the WAT-generated system evolution is a very accurate approximation to that generated by the full Einstein theory.

  19. An Object Oriented Programming Tool for Optimal Management of Water Systems under Uncertainty by use of Stochastic Dual Dynamic Programming

    Science.gov (United States)

    Raso, Luciano; Dorchies, David; Malaterre, Pierre-Olivier

    2015-04-01

    We developed an Objective Oriented Programming (OOP) tool for optimal management of complex water systems by use of Stochastic Dual Dynamic Programming (SDDP). OOP is a powerful programming paradigm. OOP minimizes code redundancies, making code modification and maintenance very effective. This is especially welcome in research, in which, often, code must be modified to meet new requirements that were not initially considered. SDDP is an advanced method for optimal operation of complex dynamic systems under uncertainty. SDDP can deal with large and complex systems, such as a multi-reservoir system. The objective of this tool is making SDDP usable for Water Management Analysts. Thanks to this tool, the Analyst can bypass the SDDP programming complexity, and his/her task is simplified to the definition of system elements, topology and objectives, and experiments characteristics. In this tool, the main classes are: Experiment, System, Element, and Objective. Experiments are run on a system. A system is made of many elements interconnected among them. Class Element is made of the following sub-classes: (stochastic) hydrological scenario, (deterministic) water demand scenario, reservoir, river reach, off-take, and irrigation basin. Objectives are used in the optimization procedure to find the optimal operational rules, for a given system and experiment. OOP flexibility allows the Water Management Analyst to extend easily existing classes in order to answer his/her specific research questions. The tool is implemented in Python, and will be initially tested on two applications: the Senegal River water system, in West Africa, and the Seine River, in France.

  20. Dynamic programming

    CERN Document Server

    Bellman, Richard

    2003-01-01

    An introduction to the mathematical theory of multistage decision processes, this text takes a ""functional equation"" approach to the discovery of optimum policies. Written by a leading developer of such policies, it presents a series of methods, uniqueness and existence theorems, and examples for solving the relevant equations. The text examines existence and uniqueness theorems, the optimal inventory equation, bottleneck problems in multistage production processes, a new formalism in the calculus of variation, strategies behind multistage games, and Markovian decision processes. Each chapte

  1. Dynamic programming algorithm for economic lot-sizing problem with bounded inventory and out-sourcing

    Institute of Scientific and Technical Information of China (English)

    LIU Xiao; WANG Cheng-en

    2005-01-01

    This paper addresses a single item dynamic lot-sizing model with inventory capacity and out-sourcing. The goal is to minimize the total costs of production, setup, inventory holding and out-sourcing. Two versions of an out-sourcing model with time-varying costs are considered: stock out case and conservation case. Zero Inventory Order property has been found and some new properties are obtained in an optimal solution. Dynamic programming algorithms are developed to solve the problem in strongly polynomial time respectively. Furthermore, some numerical results demonstrate that the approach proposed is efficient and applicable.

  2. Optimal Input Design for Aircraft Parameter Estimation using Dynamic Programming Principles

    Science.gov (United States)

    Morelli, Eugene A.; Klein, Vladislav

    1990-01-01

    A new technique was developed for designing optimal flight test inputs for aircraft parameter estimation experiments. The principles of dynamic programming were used for the design in the time domain. This approach made it possible to include realistic practical constraints on the input and output variables. A description of the new approach is presented, followed by an example for a multiple input linear model describing the lateral dynamics of a fighter aircraft. The optimal input designs produced by the new technique demonstrated improved quality and expanded capability relative to the conventional multiple input design method.

  3. Full-scale Mark II CRT program: dynamic response evaluation test of pressure transducers

    International Nuclear Information System (INIS)

    A dynamic response evaluation test of pressure transducers was conducted in support of the JAERI Full-Scale Mark II CRT (Containment Response Test) Program. The test results indicated that certain of the cavity-type transducers used in the early blowdown test had undesirable response characteristics. The transducer mounting scheme was modified to avoid trapping of air bubbles in the pressure transmission tubing attached to the transducers. The dynamic response of the modified transducers was acceptable within the frequency range of 200 Hz. (author)

  4. An Approach for Dynamic Optimization of Prevention Program Implementation in Stochastic Environments

    Science.gov (United States)

    Kang, Yuncheol; Prabhu, Vittal

    The science of preventing youth problems has significantly advanced in developing evidence-based prevention program (EBP) by using randomized clinical trials. Effective EBP can reduce delinquency, aggression, violence, bullying and substance abuse among youth. Unfortunately the outcomes of EBP implemented in natural settings usually tend to be lower than in clinical trials, which has motivated the need to study EBP implementations. In this paper we propose to model EBP implementations in natural settings as stochastic dynamic processes. Specifically, we propose Markov Decision Process (MDP) for modeling and dynamic optimization of such EBP implementations. We illustrate these concepts using simple numerical examples and discuss potential challenges in using such approaches in practice.

  5. AN OPTIMAL FUZZY APPROXIMATOR

    Institute of Scientific and Technical Information of China (English)

    YueShihong; ZhangKecun

    2002-01-01

    In a dot product space with the reproducing kernel (r. k. S. ) ,a fuzzy system with the estimation approximation errors is proposed ,which overcomes the defect that the existing fuzzy control system is difficult to estimate the errors of approximation for a desired function,and keeps the characteristics of fuzzy system as an inference approach. The structure of the new fuzzy approximator benefits a course got by other means.

  6. Approximation of irrationals

    OpenAIRE

    Malvina Baica

    1985-01-01

    The author uses a new modification of Jacobi-Perron Algorithm which holds for complex fields of any degree (abbr. ACF), and defines it as Generalized Euclidean Algorithm (abbr. GEA) to approximate irrationals.This paper deals with approximation of irrationals of degree n=2,3,5. Though approximations of these irrationals in a variety of patterns are known, the results are new and practical, since there is used an algorithmic method.

  7. Expectation Consistent Approximate Inference

    OpenAIRE

    Opper, Manfred; Winther, Ole

    2005-01-01

    We propose a novel framework for approximations to intractable probabilistic models which is based on a free energy formulation. The approximation can be understood from replacing an average over the original intractable distribution with a tractable one. It requires two tractable probability distributions which are made consistent on a set of moments and encode different features of the original intractable distribution. In this way we are able to use Gaussian approximations for models with ...

  8. Approximation techniques for engineers

    CERN Document Server

    Komzsik, Louis

    2006-01-01

    Presenting numerous examples, algorithms, and industrial applications, Approximation Techniques for Engineers is your complete guide to the major techniques used in modern engineering practice. Whether you need approximations for discrete data of continuous functions, or you''re looking for approximate solutions to engineering problems, everything you need is nestled between the covers of this book. Now you can benefit from Louis Komzsik''s years of industrial experience to gain a working knowledge of a vast array of approximation techniques through this complete and self-contained resource.

  9. First results of operational ionospheric dynamics prediction for the Brazilian Space Weather program

    Science.gov (United States)

    Petry, Adriano; de Souza, Jonas Rodrigues; de Campos Velho, Haroldo Fraga; Pereira, André Grahl; Bailey, Graham John

    2014-07-01

    It is shown the development and preliminary results of operational ionosphere dynamics prediction system for the Brazilian Space Weather program. The system is based on the Sheffield University Plasmasphere-Ionosphere Model (SUPIM), a physics-based model computer code describing the distribution of ionization within the Earth mid to equatorial latitude ionosphere and plasmasphere, during geomagnetically quiet periods. The model outputs are given in a 2-dimensional plane aligned with Earth magnetic field lines, with fixed magnetic longitude coordinate. The code was adapted to provide the output in geographical coordinates. It was made referring to the Earth’s magnetic field as an eccentric dipole, using the approximation based on International Geomagnetic Reference Field (IGRF-11). During the system operation, several simulation runs are performed at different longitudes. The original code would not be able to run all simulations serially in reasonable time. So, a parallel version for the code was developed for enhancing the performance. After preliminary tests, it was frequently observed code instability, when negative ion temperatures or concentrations prevented the code from continuing its processing. After a detailed analysis, it was verified that most of these problems occurred due to concentration estimation of simulation points located at high altitudes, typically over 4000 km of altitude. In order to force convergence, an artificial exponential decay for ion-neutral collisional frequency was used above mentioned altitudes. This approach shown no significant difference from original code output, but improved substantially the code stability. In order to make operational system even more stable, the initial altitude and initial ion concentration values used on exponential decay equation are changed when convergence is not achieved, within pre-defined values. When all code runs end, the longitude of every point is then compared with its original reference

  10. Optimal Design of Measurement Programs for the Parameter Identification of Dynamic Systems

    DEFF Research Database (Denmark)

    Kirkegaard, Poul Henning; Sørensen, John Dalsgaard; Brincker, Rune

    1993-01-01

    The design of a measurement program devoted to parameter identification of structural dynamic systems is considered. The design problem is formulated as an optimization problem to minimize the total expected cost that is the cost of failure and the cost of the measurement program. All the...... calculations are based on a priori knowledge and engineering judgement. One of the contribution of the approach is that the optimal number of sensory can be estimated. This is shown in an numerical example where the proposed approach is demonstrated. The example is concerned with design of a measurement...

  11. A 4-cylinder Stirling engine computer program with dynamic energy equations

    Science.gov (United States)

    Daniele, C. J.; Lorenzo, C. F.

    1983-01-01

    A computer program for simulating the steady state and transient performance of a four cylinder Stirling engine is presented. The thermodynamic model includes both continuity and energy equations and linear momentum terms (flow resistance). Each working space between the pistons is broken into seven control volumes. Drive dynamics and vehicle load effects are included. The model contains 70 state variables. Also included in the model are piston rod seal leakage effects. The computer program includes a model of a hydrogen supply system, from which hydrogen may be added to the system to accelerate the engine. Flow charts are provided.

  12. Fast approximate convex decomposition using relative concavity

    KAUST Repository

    Ghosh, Mukulika

    2013-02-01

    Approximate convex decomposition (ACD) is a technique that partitions an input object into approximately convex components. Decomposition into approximately convex pieces is both more efficient to compute than exact convex decomposition and can also generate a more manageable number of components. It can be used as a basis of divide-and-conquer algorithms for applications such as collision detection, skeleton extraction and mesh generation. In this paper, we propose a new method called Fast Approximate Convex Decomposition (FACD) that improves the quality of the decomposition and reduces the cost of computing it for both 2D and 3D models. In particular, we propose a new strategy for evaluating potential cuts that aims to reduce the relative concavity, rather than absolute concavity. As shown in our results, this leads to more natural and smaller decompositions that include components for small but important features such as toes or fingers while not decomposing larger components, such as the torso, that may have concavities due to surface texture. Second, instead of decomposing a component into two pieces at each step, as in the original ACD, we propose a new strategy that uses a dynamic programming approach to select a set of n c non-crossing (independent) cuts that can be simultaneously applied to decompose the component into n c+1 components. This reduces the depth of recursion and, together with a more efficient method for computing the concavity measure, leads to significant gains in efficiency. We provide comparative results for 2D and 3D models illustrating the improvements obtained by FACD over ACD and we compare with the segmentation methods in the Princeton Shape Benchmark by Chen et al. (2009) [31]. © 2012 Elsevier Ltd. All rights reserved.

  13. Water-cooled end-point boundary temperature control of hot strip via dynamic programming

    Energy Technology Data Exchange (ETDEWEB)

    Samaras, N.S. [Danieli Automation, Pittsburgh, PA (United States); Simaan, M.A. [Univ. of Pittsburgh, PA (United States). Dept. of Electrical Engineering

    1998-11-01

    In this paper, an end-point boundary temperature control approach for runout table cooling used in hot strip mills is presented. The system relies on a linearized model for describing heat radiated to the environment and heat transferred to cooling water. At first, a conventional feedforward control design to control the temperature at the end-point boundary, the only measurable controlled parameter, is presented. Subsequently, a modified control scheme which uses dynamic programming to minimize the temperature error at the end-point boundary is discussed in detail. System performance analysis via simulation is presented for both control schemes. Simulation results show that temperature error minimization by dynamic programming improves system performance.

  14. The Time-Synchronous Dynamic Programming Approach to the Shortest Path Search in Spoken Dialog System

    Institute of Scientific and Technical Information of China (English)

    HEWei; YANGSuqiong; YUANBaozong; LINBiqin

    2004-01-01

    Shortest path search has important practical applications and is related to optimization problem.This paper discusses a new algorithm time-synchronous heuristic dynamic programming search, which combined the pruning and global optimization of DP (Dynamic programming) and the partial search of heuristic strategy and found the shortest path in time O(n/kd) (k, d ≥ 1). Furthermore, the algorithm can be applied to find the K shortest paths between a pair of given nodes or all paths less than a given length within the same steps. Finally this algorithm was applied to the shortest path search on the real map and user could use spoken dialog to query shortcut in realtime, 90% of the system responses are correct.

  15. An intelligent environment for dynamic simulation program generation of nuclear reactor systems

    International Nuclear Information System (INIS)

    A graphical user interface system was developed for the two dynamic simulation systems based on modular programming methods: MSS and DSNP. The following works were made in conjunction with the system development: (1) conversion of the module libraries of both DSNP and MSS, (2) extension of DSNP- pre-compiler, (3) graphical interface for module integration, and (4) automatic converter of simple language descriptions for DSNP, where (1) and (2) were made on an engineering work station, while the rest (3) and (4), on Macintosh HyperCard. By using the graphical interface, a user can specify the structure of a simulation model, geometrical data, initial values of variables, etc. only by handling modules as icon on the pallet fields. The use of extended DSNP pre-compiler then generates the final product of dynamic simulation program automatically. The capability and effectiveness of the system was confirmed by a sample simulation of PWR SBLOCA transient in PORV stuck open event. (author)

  16. Optimum Repartition of Transport Capacities in the Logistic System using Dynamic Programming

    Directory of Open Access Journals (Sweden)

    Gheorghe BĂŞANU

    2011-08-01

    Full Text Available Transportations take an essential role in logistics, interconnecting the majority of processes and operations within logistic system. The efficient use of transportation capacity is a priority whose achievement can diminish logistic costs. This objective is today difficult to achieve due to increasing complexity of transportation monitoring and coordination. This complexity is determined by transportation number and diversity, by the volume and diversity of orders, by increasing the targets to be supplied.Dynamic programming represents a highly useful tool for logistic managers, considering that its specific techniques and methods are oriented toward solving problems related to resource optimum allocation and utilization.The present paper presents briefly a series of theoretical elements of dynamic programming applied in logistics, based on which it is shown a mathematic model to determine the optimum policy for transport capacity repartition for the area attached to a logistic centre, through three distribution centres.

  17. Testing Object-Oriented Programs using Dynamic Aspects and Non-Determinism

    DEFF Research Database (Denmark)

    Achenbach, Michael; Ostermann, Klaus

    2010-01-01

    decisions exposing private data. We present an approach that both improves the expressiveness of test cases using non-deterministic choice and reduces design modifications using dynamic aspect-oriented programming techniques. Non-deterministic choice facilitates local definitions of multiple executions......The implementation of unit tests with mock objects and stubs often involves substantial manual work. Stubbed methods return simple default values, therefore variations of these values require separate test cases. The integration of mock objects often requires more infrastructure code and design...... without parameterization or generation of tests. It also eases modelling naturally non-deterministic program features like IO or multi-threading in integration tests. Dynamic AOP facilitates powerful design adaptations without exposing test features, keeping the scope of these adaptations local to each...

  18. Capabilities and applications of a computer program system for dynamic loads analyses of flexible airplanes with active controls /DYLOFLEX/

    Science.gov (United States)

    Perry, B., III; Goetz, R. C.; Kroll, R. I.; Miller, R. D.

    1979-01-01

    This paper describes and illustrates the capabilities of the DYLOFLEX Computer Program System. DYLOFLEX is an integrated system of computer programs for calculating dynamic loads of flexible airplanes with active control systems. A brief discussion of the engineering formulation for each of the nine DYLOFLEX programs is described. The capabilities of the system are illustrated by the analyses of two example configurations.

  19. A coordination policy for the NATO SEASPARROW Missile and the Rolling Airframe Missile using dynamic programming

    OpenAIRE

    Drennan, Arthur Paul

    1994-01-01

    This thesis develops a dynamic program, the SEASPARROW Coordinated Assignment Model (SCAM), that determines the optimal coordinated assignment policy for the SEASPARROW missile in a shipboard self defense weapon configuration consisting of the NATO SEASPARROW Missile System, the Rolling Airframe Missile and the Phalanx Close-In Weapon System. Threat scenarios are described by the type of' anti-ship cruise missile, the number of threat missiles, the total duration of the arrival window and the...

  20. A Generalized Speckle Tracking Algorithm for Ultrasonic Strain Imaging Using Dynamic Programming

    OpenAIRE

    Jiang, Jingfeng; Hall, Timothy J.

    2009-01-01

    This study developed an improved motion estimation algorithm for ultrasonic strain imaging that employs a dynamic programming technique. In this paper, we model the motion estimation task as an optimization problem. Since tissue motion under external mechanical stimuli often should be reasonably continuous, a set of cost functions combining correlation and various levels of motion continuity constraint were used to regularize the motion estimation. To solve the optimization problem with a rea...

  1. A dynamic programming algorithm for the space allocation and aisle positioning problem

    OpenAIRE

    Peter Bodnar; Jens Lysgaard

    2014-01-01

    The space allocation and aisle positioning problem (SAAPP) in a material handling system with gravity flow racks is the problem of minimizing the total number of replenishments over a period subject to practical constraints related to the need for aisles granting safe and easy access to storage locations. In this paper, we develop an exact dynamic programming algorithm for the SAAPP. The computational study shows that our exact algorithm can be used to find optimal solutions for numerous SAAP...

  2. An Application of Dynamic Programming Principle in Corporate International Optimal Investment and Consumption Choice Problem

    OpenAIRE

    Zhen Wu; Zongyuan Huang

    2010-01-01

    This paper is concerned with a kind of corporate international optimal portfolio and consumption choice problems, in which the investor can invest her or his wealth either in a domestic bond (bank account) or in an oversea real project with production. The bank pays a lower interest rate for deposit and takes a higher rate for any loan. First, we show that Bellman's dynamic programming principle still holds in our setting; second, in terms of the foregoing principle, we obtain the investor's ...

  3. Dynamic Programming Principle for Stochastic Recursive Optimal Control Problem under G-framework

    OpenAIRE

    Hu, Mingshang; Ji, Shaolin

    2014-01-01

    In this paper, we study a stochastic recursive optimal control problem in which the cost functional is described by the solution of a backward stochastic differential equation driven by G-Brownian motion. Under standard assumptions, we establish the dynamic programming principle and the related fully nonlinear HJB equation in the framework of G-expectation. Finally, we show that the value function is the viscosity solution of the obtained HJB equation.

  4. Vintage Capital in the AK growth model: a Dynamic Programming approach. Extended version.

    OpenAIRE

    Fabbri, Giorgio; Gozzi, Fausto

    2006-01-01

    This paper deals with an endogenous growth model with vintage capital and, more precisely, with the AK model proposed in [18]. In endogenous growth models the introduction of vintage capital allows to explain some growth facts but strongly increases the mathematical difficulties. So far, in this approach, the model is studied by the Maximum Principle; here we develop the Dynamic Programming approach to the same problem by obtaining sharper results and we provide more insight about the economi...

  5. Dynamic Programming for controlled Markov families: abstractly and over Martingale Measures

    OpenAIRE

    Gordan Zitkovic

    2013-01-01

    We describe an abstract control-theoretic framework in which the validity of the dynamic programming principle can be established in continuous time by a verification of a small number of structural properties. As an application we treat several cases of interest, most notably the lower-hedging and utility-maximization problems of financial mathematics both of which are naturally posed over ``sets of martingale measures''.

  6. Infnite-Horizon Deterministic Dynamic Programming in Discrete Time: A Monotone Convergence Principle

    OpenAIRE

    Takashi Kamihigashi; Masayuki Yao

    2015-01-01

    We consider infinite-horizon deterministic dynamic programming problems in discrete time. We show that the value function is always a fixed point of a modified version of the Bellman operator. We also show that value iteration monotonically converges to the value function if the initial function is dominated by the value function, is mapped upward by the modified Bellman operator, and satisfies a transversality-like condition. These results require no assumption except for the general framewo...

  7. On the dynamic programming principle for controlled diffusion processes in a cylindrical region

    OpenAIRE

    Dmitry B. Rokhlin

    2012-01-01

    We prove the dynamic programming principle for a class of diffusion processes controlled up to the time of exit from a cylindrical region $[0,T)\\times G$. It is assumed that the functional to be maximized is in the Lagrange form with nonnegative integrand. Besides this we only adopt the standard assumptions, ensuring the existence of a unique strong solution of a stochastic differential equation for the state process.

  8. Discrete time McKean-Vlasov control problem: a dynamic programming approach

    OpenAIRE

    Pham, Huyên; Wei, Xiaoli

    2015-01-01

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

  9. Control of Aircraft Pushbacks at an Airport using a Dynamic Programming Formulation

    OpenAIRE

    Khadilkar, Harshad Dilip; Balakrishnan, Hamsa

    2012-01-01

    This paper describes a dynamic programming formulation of the airport surface traffic management problem. Movement of aircraft is modeled as the flow of traffic on a network, with stochastic link travel times. This is followed by an algorithm for controlling entry of aircraft into the taxiway system at an airport. Finally, two realistic variations of the formulation are presented - variation of parameters and nite bu er capacity. Optimal control policies for all cases are calculated using po...

  10. Memory-efficient dynamic programming backtrace and pairwise local sequence alignment

    OpenAIRE

    Newberg, Lee A.

    2008-01-01

    Motivation: A backtrace through a dynamic programming algorithm's intermediate results in search of an optimal path, or to sample paths according to an implied probability distribution, or as the second stage of a forward–backward algorithm, is a task of fundamental importance in computational biology. When there is insufficient space to store all intermediate results in high-speed memory (e.g. cache) existing approaches store selected stages of the computation, and recompute missing values f...

  11. A Linear Dynamic Programming Approach to Irrigation System Management with Depleting Groundwater

    OpenAIRE

    Stoecker, A. L.; A. Seidmann; Lloyd, G S

    1985-01-01

    A model for measuring the economic benefits of irrigation system development over a depleting aquifer is presented, along with related methodology for detailed long-range farm planning. The paper considers management issues, such as distribution system configuration, drilling policy, area developed for irrigation, and crop production. A Linear Dynamic Programming (LDP) method is developed and applied to derive optimal temporal investments in the use of stock resources and long-term cropping p...

  12. Heuristic algorithm for single resource constrained project scheduling problem based on the dynamic programming

    Directory of Open Access Journals (Sweden)

    Stanimirović Ivan

    2009-01-01

    Full Text Available We introduce a heuristic method for the single resource constrained project scheduling problem, based on the dynamic programming solution of the knapsack problem. This method schedules projects with one type of resources, in the non-preemptive case: once started an activity is not interrupted and runs to completion. We compare the implementation of this method with well-known heuristic scheduling method, called Minimum Slack First (known also as Gray-Kidd algorithm, as well as with Microsoft Project.

  13. A dynamic programming algorithm for the buffer allocation problem in homogeneous asymptotically reliable serial production lines

    OpenAIRE

    Diamantidis A. C.; Papadopoulos C. T.

    2004-01-01

    In this study, the buffer allocation problem (BAP) in homogeneous, asymptotically reliable serial production lines is considered. A known aggregation method, given by Lim, Meerkov, and Top (1990), for the performance evaluation (i.e., estimation of throughput) of this type of production lines when the buffer allocation is known, is used as an evaluative method in conjunction with a newly developed dynamic programming (DP) algorithm for the BAP. The proposed algorithm is applied to production ...

  14. Optimal investment conditions for electrification of Edvard Grieg : a discrete dynamic programming approach

    OpenAIRE

    Cowell, Laura

    2014-01-01

    This thesis investigates the optimal investment conditions for switching the Edvard Grieg field from traditional power generation methods (gas turbines) to electrical power from shore. By interpreting this problem as a cost-minimization problem, the wholesale electricity price is the main stochastic element. A discrete dynamic programming model, implementing backward recursion, is implemented to find the threshold wholesale electricity prices for choosing between gas turbines and PFS. Additio...

  15. Expectation Consistent Approximate Inference

    DEFF Research Database (Denmark)

    Opper, Manfred; Winther, Ole

    2005-01-01

    We propose a novel framework for approximations to intractable probabilistic models which is based on a free energy formulation. The approximation can be understood from replacing an average over the original intractable distribution with a tractable one. It requires two tractable probability dis...

  16. Ordered cones and approximation

    CERN Document Server

    Keimel, Klaus

    1992-01-01

    This book presents a unified approach to Korovkin-type approximation theorems. It includes classical material on the approximation of real-valuedfunctions as well as recent and new results on set-valued functions and stochastic processes, and on weighted approximation. The results are notonly of qualitative nature, but include quantitative bounds on the order of approximation. The book is addressed to researchers in functional analysis and approximation theory as well as to those that want to applythese methods in other fields. It is largely self- contained, but the readershould have a solid background in abstract functional analysis. The unified approach is based on a new notion of locally convex ordered cones that are not embeddable in vector spaces but allow Hahn-Banach type separation and extension theorems. This concept seems to be of independent interest.

  17. Approximating maximum clique with a Hopfield network.

    Science.gov (United States)

    Jagota, A

    1995-01-01

    In a graph, a clique is a set of vertices such that every pair is connected by an edge. MAX-CLIQUE is the optimization problem of finding the largest clique in a given graph and is NP-hard, even to approximate well. Several real-world and theory problems can be modeled as MAX-CLIQUE. In this paper, we efficiently approximate MAX-CLIQUE in a special case of the Hopfield network whose stable states are maximal cliques. We present several energy-descent optimizing dynamics; both discrete (deterministic and stochastic) and continuous. One of these emulates, as special cases, two well-known greedy algorithms for approximating MAX-CLIQUE. We report on detailed empirical comparisons on random graphs and on harder ones. Mean-field annealing, an efficient approximation to simulated annealing, and a stochastic dynamics are the narrow but clear winners. All dynamics approximate much better than one which emulates a "naive" greedy heuristic. PMID:18263357

  18. Dynamic programming in parallel boundary detection with application to ultrasound intima-media segmentation.

    Science.gov (United States)

    Zhou, Yuan; Cheng, Xinyao; Xu, Xiangyang; Song, Enmin

    2013-12-01

    Segmentation of carotid artery intima-media in longitudinal ultrasound images for measuring its thickness to predict cardiovascular diseases can be simplified as detecting two nearly parallel boundaries within a certain distance range, when plaque with irregular shapes is not considered. In this paper, we improve the implementation of two dynamic programming (DP) based approaches to parallel boundary detection, dual dynamic programming (DDP) and piecewise linear dual dynamic programming (PL-DDP). Then, a novel DP based approach, dual line detection (DLD), which translates the original 2-D curve position to a 4-D parameter space representing two line segments in a local image segment, is proposed to solve the problem while maintaining efficiency and rotation invariance. To apply the DLD to ultrasound intima-media segmentation, it is imbedded in a framework that employs an edge map obtained from multiplication of the responses of two edge detectors with different scales and a coupled snake model that simultaneously deforms the two contours for maintaining parallelism. The experimental results on synthetic images and carotid arteries of clinical ultrasound images indicate improved performance of the proposed DLD compared to DDP and PL-DDP, with respect to accuracy and efficiency. PMID:23837965

  19. Dynamic trunk stabilization: a conceptual back injury prevention program for volleyball athletes.

    Science.gov (United States)

    Smith, Chad E; Nyland, John; Caudill, Paul; Brosky, Joseph; Caborn, David N M

    2008-11-01

    The sport of volleyball creates considerable dynamic trunk stability demands. Back injury occurs all too frequently in volleyball, particularly among female athletes. The purpose of this clinical commentary is to review functional anatomy, muscle coactivation strategies, assessment of trunk muscle performance, and the characteristics of effective exercises for the trunk or core. From this information, a conceptual progressive 3-phase volleyball-specific training program is presented to improve dynamic trunk stability and to potentially reduce the incidence of back injury among volleyball athletes. Phase 1 addresses low-velocity motor control, kinesthetic awareness, and endurance, with the clinician providing cues to teach achievement of biomechanically neutral spine alignment. Phase 2 focuses on progressively higher velocity dynamic multiplanar endurance, coordination, and strength-power challenges integrating upper and lower extremity movements, while maintaining neutral spine alignment. Phase 3 integrates volleyball-specific skill simulations by breaking down composite movement patterns into their component parts, with differing dynamic trunk stability requirements, while maintaining neutral spine alignment. Prospective research is needed to validate the efficacy of this program. PMID:18978452

  20. HEURISTIC MODELING FOR A DYNAMIC AND GOAL PROGRAMMING IN PRODUCTION PLANNING OF CONTINUOUS MANUFACTURING SYSTEMS

    Institute of Scientific and Technical Information of China (English)

    JAHAN A; ABDOLSHAH M

    2007-01-01

    At the first sight it seems that advanced operation research is not used enough in continuous production systems as comparison with mass production, batch production and job shop systems, but really in a comprehensive evaluation the advanced operation research techniques can be used in continuous production systems in developing countries very widely, because of initial inadequate plant layout, stage by stage development of production lines, the purchase of second hand machineries from various countries, plurality of customers. A case of production system planning is proposed for a chemical company in which the above mentioned conditions are almost presented. The goals and constraints in this issue are as follows: ① Minimizing deviation of customer's requirements. ② Maximizing the profit. ③ Minimizing the frequencies of changes in formula production. ④ Minimizing the inventory of final products. ⑤ Balancing the production sections with regard to rate in production. ⑥ Limitation in inventory of raw material. The present situation is in such a way that various techniques such as goal programming, linear programming and dynamic programming can be used. But dynamic production programming issues are divided into two categories, at first one with limitation in production capacity and another with unlimited production capacity. For the first category, a systematic and acceptable solution has not been presented yet. Therefore an innovative method is used to convert the dynamic situation to a zero- one model. At last this issue is changed to a goal programming model with non-linear limitations with the use of GRG algorithm and that's how it is solved.

  1. A computer program for the geometrically nonlinear static and dynamic analysis of arbitrarily loaded shells of revolution, theory and users manual

    Science.gov (United States)

    Ball, R. E.

    1972-01-01

    A digital computer program known as SATANS (static and transient analysis, nonlinear, shells) for the geometrically nonlinear static and dynamic response of arbitrarily loaded shells of revolution is presented. Instructions for the preparation of the input data cards and other information necessary for the operation of the program are described in detail and two sample problems are included. The governing partial differential equations are based upon Sanders' nonlinear thin shell theory for the conditions of small strains and moderately small rotations. The governing equations are reduced to uncoupled sets of four linear, second order, partial differential equations in the meridional and time coordinates by expanding the dependent variables in a Fourier sine or cosine series in the circumferential coordinate and treating the nonlinear modal coupling terms as pseudo loads. The derivatives with respect to the meridional coordinate are approximated by central finite differences, and the displacement accelerations are approximated by the implicit Houbolt backward difference scheme with a constant time interval. The boundaries of the shell may be closed, free, fixed, or elastically restrained. The program is coded in the FORTRAN 4 language and is dimensioned to allow a maximum of 10 arbitrary Fourier harmonics and a maximum product of the total number of meridional stations and the total number of Fourier harmonics of 200. The program requires 155,000 bytes of core storage.

  2. Approximating ambient D-region electron densities using dual-beam HF heating experiments at the high-frequency Active Auroral Research Program (HAARP)

    Science.gov (United States)

    Agrawal, Divya

    Dual-beam ELF/VLF wave generation experiments performed at the High-frequency Active Auroral Research Program (HAARP) HF transmitter in Gakona, Alaska are critically compared with the predictions of a newly developed ionospheric high frequency (HF) heating model that accounts for the simultaneous propagation and absorption of multiple HF beams. The dual-beam HF heating experiments presented herein consist of two HF beams transmitting simultaneously: one amplitude modulated (AM) HF beam modulates the conductivity of the lower ionosphere in the extremely low frequency (ELF, 30 Hz to 3 kHz) and/or very low frequency (VLF, 3 kHz to 30 kHz) band while a second HF beam broadcasts a continuous waveform (CW) signal, modifying the efficiency of ELF/VLF conductivity modulation and thereby the efficiency of ELF/VLF wave generation. Ground-based experimental observations are used together with the predictions of the theoretical model to identify the property of the received ELF/VLF wave that is most sensitive to the effects of multi-beam HF heating, and that property is determined to be the ELF/VLF signal magnitude. The dependence of the generated ELF/VLF wave magnitude on several HF transmission parameters (HF power, HF frequency, and modulation waveform) is then experimentally measured and analyzed within the context of the multi-beam HF heating model. For all cases studied, the received ELF/VLF wave magnitude as a function of transmission parameter is analyzed to identify the dependence on the ambient D-region electron density (Ne) and/or electron temperature ( Te), in turn identifying the HF transmission parameters that provide significant independent information regarding the ambient conditions of the D-region ionosphere. A theoretical analysis is performed to determine the conditions under which the effects of Ne and Te can be decoupled, and the results of this analysis are applied to identify an electron density profile that can reproduce the unusually high level of ELF

  3. Summary of work completed under the Environmental and Dynamic Equipment Qualification research program (EDQP)

    International Nuclear Information System (INIS)

    This report documents the results of the main projects undertaken under the Environmental and Dynamic Equipment Qualification Research Program (EDQP) sponsored by the U.S. Nuclear Regulatory Commission (NRC) under FIN A6322. Lasting from fiscal year 1983 to 1987, the program dealt with environmental and dynamic (including seismic) equipment qualification issues for mechanical and electromechanical components and systems used in nuclear power plants. The research results have since been used by both the NRC and industry. The program included seven major research projects that addressed the following issues: (a) containment purge and vent valves performing under design basis loss of coolant accident loads, (b) containment piping penetrations and isolation valves performing under seismic loadings and design basis and severe accident containment wall displacements, (c) shaft seals for primary coolant pumps performing under station blackout conditions, (d) electrical cabinet internals responding to in-structure generated motion (rattling), and (e) in situ piping and valves responding to seismic loadings. Another project investigating whether certain containment isolation valves will close under design basis conditions was also started under this program. This report includes eight main section, each of which provides a brief description of one of the projects, a summary of the findings, and an overview of the application of the results. A bibliography lists the journal articles, papers, and reports that document the research

  4. Approximation concepts for efficient structural synthesis

    Science.gov (United States)

    Schmit, L. A., Jr.; Miura, H.

    1976-01-01

    It is shown that efficient structural synthesis capabilities can be created by using approximation concepts to mesh finite element structural analysis methods with nonlinear mathematical programming techniques. The history of the application of mathematical programming techniques to structural design optimization problems is reviewed. Several rather general approximation concepts are described along with the technical foundations of the ACCESS 1 computer program, which implements several approximation concepts. A substantial collection of structural design problems involving truss and idealized wing structures is presented. It is concluded that since the basic ideas employed in creating the ACCESS 1 program are rather general, its successful development supports the contention that the introduction of approximation concepts will lead to the emergence of a new generation of practical and efficient, large scale, structural synthesis capabilities in which finite element analysis methods and mathematical programming algorithms will play a central role.

  5. Concurrent extensions to the FORTRAN language for parallel programming of computational fluid dynamics algorithms

    Science.gov (United States)

    Weeks, Cindy Lou

    1986-01-01

    Experiments were conducted at NASA Ames Research Center to define multi-tasking software requirements for multiple-instruction, multiple-data stream (MIMD) computer architectures. The focus was on specifying solutions for algorithms in the field of computational fluid dynamics (CFD). The program objectives were to allow researchers to produce usable parallel application software as soon as possible after acquiring MIMD computer equipment, to provide researchers with an easy-to-learn and easy-to-use parallel software language which could be implemented on several different MIMD machines, and to enable researchers to list preferred design specifications for future MIMD computer architectures. Analysis of CFD algorithms indicated that extensions of an existing programming language, adaptable to new computer architectures, provided the best solution to meeting program objectives. The CoFORTRAN Language was written in response to these objectives and to provide researchers a means to experiment with parallel software solutions to CFD algorithms on machines with parallel architectures.

  6. Approximations to toroidal harmonics

    International Nuclear Information System (INIS)

    Toroidal harmonics P/sub n-1/2/1(cosh μ) and Q/sub n-1/2/1(cosh μ) are useful in solutions to Maxwell's equations in toroidal coordinates. In order to speed their computation, a set of approximations has been developed that is valid over the range 0 -10. The simple method used to determine the approximations is described. Relative error curves are also presented, obtained by comparing approximations to the more accurate values computed by direct summation of the hypergeometric series

  7. Approximations in Inspection Planning

    DEFF Research Database (Denmark)

    Engelund, S.; Sørensen, John Dalsgaard; Faber, M. H.; Bloch, Allan

    2000-01-01

    . One of the more important of these approximations is the assumption that all inspections will reveal no defects. Using this approximation the optimal inspection plan may be determined on the basis of conditional probabilities, i.e. the probability of failure given no defects have been found by the......Planning of inspections of civil engineering structures may be performed within the framework of Bayesian decision analysis. The effort involved in a full Bayesian decision analysis is relatively large. Therefore, the actual inspection planning is usually performed using a number of approximations...... inspection. In this paper the quality of this approximation is investigated. The inspection planning is formulated both as a full Bayesian decision problem and on the basis of the assumption that the inspection will reveal no defects....

  8. The Karlqvist approximation revisited

    OpenAIRE

    Tannous, C.

    2015-01-01

    The Karlqvist approximation signaling the historical beginning of magnetic recording head theory is reviewed and compared to various approaches progressing from Green, Fourier, Conformal mapping that obeys the Sommerfeld edge condition at angular points and leads to exact results.

  9. Sequential optimization of approximate inhibitory rules relative to the length, coverage and number of misclassifications

    KAUST Repository

    Alsolami, Fawaz

    2013-01-01

    This paper is devoted to the study of algorithms for sequential optimization of approximate inhibitory rules relative to the length, coverage and number of misclassifications. Theses algorithms are based on extensions of dynamic programming approach. The results of experiments for decision tables from UCI Machine Learning Repository are discussed. © 2013 Springer-Verlag.

  10. Approximation Behooves Calibration

    DEFF Research Database (Denmark)

    da Silva Ribeiro, André Manuel; Poulsen, Rolf

    2013-01-01

    Calibration based on an expansion approximation for option prices in the Heston stochastic volatility model gives stable, accurate, and fast results for S&P500-index option data over the period 2005–2009.......Calibration based on an expansion approximation for option prices in the Heston stochastic volatility model gives stable, accurate, and fast results for S&P500-index option data over the period 2005–2009....

  11. Approximation and Computation

    CERN Document Server

    Gautschi, Walter; Rassias, Themistocles M

    2011-01-01

    Approximation theory and numerical analysis are central to the creation of accurate computer simulations and mathematical models. Research in these areas can influence the computational techniques used in a variety of mathematical and computational sciences. This collection of contributed chapters, dedicated to renowned mathematician Gradimir V. Milovanovia, represent the recent work of experts in the fields of approximation theory and numerical analysis. These invited contributions describe new trends in these important areas of research including theoretic developments, new computational alg

  12. Control of water distribution networks with dynamic DMA topology using strictly feasible sequential convex programming

    Science.gov (United States)

    Wright, Robert; Abraham, Edo; Parpas, Panos; Stoianov, Ivan

    2015-12-01

    The operation of water distribution networks (WDN) with a dynamic topology is a recently pioneered approach for the advanced management of District Metered Areas (DMAs) that integrates novel developments in hydraulic modeling, monitoring, optimization, and control. A common practice for leakage management is the sectorization of WDNs into small zones, called DMAs, by permanently closing isolation valves. This facilitates water companies to identify bursts and estimate leakage levels by measuring the inlet flow for each DMA. However, by permanently closing valves, a number of problems have been created including reduced resilience to failure and suboptimal pressure management. By introducing a dynamic topology to these zones, these disadvantages can be eliminated while still retaining the DMA structure for leakage monitoring. In this paper, a novel optimization method based on sequential convex programming (SCP) is outlined for the control of a dynamic topology with the objective of reducing average zone pressure (AZP). A key attribute for control optimization is reliable convergence. To achieve this, the SCP method we propose guarantees that each optimization step is strictly feasible, resulting in improved convergence properties. By using a null space algorithm for hydraulic analyses, the computations required are also significantly reduced. The optimized control is actuated on a real WDN operated with a dynamic topology. This unique experimental program incorporates a number of technologies set up with the objective of investigating pioneering developments in WDN management. Preliminary results indicate AZP reductions for a dynamic topology of up to 6.5% over optimally controlled fixed topology DMAs. This article was corrected on 12 JAN 2016. See the end of the full text for details.

  13. Optimization of environmental management strategies through a dynamic stochastic possibilistic multiobjective program

    International Nuclear Information System (INIS)

    Highlights: ► A dynamic stochastic possibilistic multiobjective programming model is developed. ► Greenhouse gas emission control is considered. ► Three planning scenarios are analyzed and compared. ► Optimal decision schemes under three scenarios and different pi levels are obtained. ► Tradeoffs between economics and environment are reflected. -- Abstract: Greenhouse gas (GHG) emissions from municipal solid waste (MSW) management facilities have become a serious environmental issue. In MSW management, not only economic objectives but also environmental objectives should be considered simultaneously. In this study, a dynamic stochastic possibilistic multiobjective programming (DSPMP) model is developed for supporting MSW management and associated GHG emission control. The DSPMP model improves upon the existing waste management optimization methods through incorporation of fuzzy possibilistic programming and chance-constrained programming into a general mixed-integer multiobjective linear programming (MOP) framework where various uncertainties expressed as fuzzy possibility distributions and probability distributions can be effectively reflected. Two conflicting objectives are integrally considered, including minimization of total system cost and minimization of total GHG emissions from waste management facilities. Three planning scenarios are analyzed and compared, representing different preferences of the decision makers for economic development and environmental-impact (i.e. GHG-emission) issues in integrated MSW management. Optimal decision schemes under three scenarios and different pi levels (representing the probability that the constraints would be violated) are generated for planning waste flow allocation and facility capacity expansions as well as GHG emission control. The results indicate that economic and environmental tradeoffs can be effectively reflected through the proposed DSPMP model. The generated decision variables can help the decision

  14. Comparative Analysis of Plyometric Training Program and Dynamic Stretching on Vertical Jump and Agility in Male Collegiate Basketball Player

    OpenAIRE

    John Shaji; Saluja Isha

    2009-01-01

    The purpose of the study was to compare, analyze the individual and combined effect of plyometric training program and dynamic stretching on vertical jump and agility. The subjects included 45, healthy male collegiate basketball players between the ages of 18-25. All subjects were tested in the vertical jump and agility using the Sergeant Jump test and T-test respectively prior to starting the dynamic stretching and plyometric training program. The subjects then completed a four week plyomet...

  15. Optimal bipedal interactions with dynamic terrain: synthesis and analysis via nonlinear programming

    Science.gov (United States)

    Hubicki, Christian; Goldman, Daniel; Ames, Aaron

    In terrestrial locomotion, gait dynamics and motor control behaviors are tuned to interact efficiently and stably with the dynamics of the terrain (i.e. terradynamics). This controlled interaction must be particularly thoughtful in bipeds, as their reduced contact points render them highly susceptible to falls. While bipedalism under rigid terrain assumptions is well-studied, insights for two-legged locomotion on soft terrain, such as sand and dirt, are comparatively sparse. We seek an understanding of how biological bipeds stably and economically negotiate granular media, with an eye toward imbuing those abilities in bipedal robots. We present a trajectory optimization method for controlled systems subject to granular intrusion. By formulating a large-scale nonlinear program (NLP) with reduced-order resistive force theory (RFT) models and jamming cone dynamics, the optimized motions are informed and shaped by the dynamics of the terrain. Using a variant of direct collocation methods, we can express all optimization objectives and constraints in closed-form, resulting in rapid solving by standard NLP solvers, such as IPOPT. We employ this tool to analyze emergent features of bipedal locomotion in granular media, with an eye toward robotic implementation.

  16. Covariant approximation averaging

    CERN Document Server

    Shintani, Eigo; Blum, Thomas; Izubuchi, Taku; Jung, Chulwoo; Lehner, Christoph

    2014-01-01

    We present a new class of statistical error reduction techniques for Monte-Carlo simulations. Using covariant symmetries, we show that correlation functions can be constructed from inexpensive approximations without introducing any systematic bias in the final result. We introduce a new class of covariant approximation averaging techniques, known as all-mode averaging (AMA), in which the approximation takes account of contributions of all eigenmodes through the inverse of the Dirac operator computed from the conjugate gradient method with a relaxed stopping condition. In this paper we compare the performance and computational cost of our new method with traditional methods using correlation functions and masses of the pion, nucleon, and vector meson in $N_f=2+1$ lattice QCD using domain-wall fermions. This comparison indicates that AMA significantly reduces statistical errors in Monte-Carlo calculations over conventional methods for the same cost.

  17. Accuracy of Approximate Eigenstates

    CERN Document Server

    Lucha, Wolfgang; Lucha, Wolfgang

    2000-01-01

    Besides perturbation theory, which requires, of course, the knowledge of the exact unperturbed solution, variational techniques represent the main tool for any investigation of the eigenvalue problem of some semibounded operator H in quantum theory. For a reasonable choice of the employed trial subspace of the domain of H, the lowest eigenvalues of H usually can be located with acceptable precision whereas the trial-subspace vectors corresponding to these eigenvalues approximate, in general, the exact eigenstates of H with much less accuracy. Accordingly, various measures for the accuracy of the approximate eigenstates derived by variational techniques are scrutinized. In particular, the matrix elements of the commutator of the operator H and (suitably chosen) different operators, with respect to degenerate approximate eigenstates of H obtained by some variational method, are proposed here as new criteria for the accuracy of variational eigenstates. These considerations are applied to that Hamiltonian the eig...

  18. Synthesis of approximation errors

    Energy Technology Data Exchange (ETDEWEB)

    Bareiss, E.H.; Michel, P.

    1977-07-01

    A method is developed for the synthesis of the error in approximations in the large of regular and irregular functions. The synthesis uses a small class of dimensionless elementary error functions which are weighted by the coefficients of the expansion of the regular part of the function. The question is answered whether a computer can determine the analytical nature of a solution by numerical methods. It is shown that continuous least-squares approximations of irregular functions can be replaced by discrete least-squares approximation and how to select the discrete points. The elementary error functions are used to show how the classical convergence criterions can be markedly improved. There are eight numerical examples included, 30 figures and 74 tables.

  19. Low Rank Approximation in $G_0W_0$ Approximation

    CERN Document Server

    Shao, Meiyue; Yang, Chao; Liu, Fang; da Jornada, Felipe H; Deslippe, Jack; Louie, Steven G

    2016-01-01

    The single particle energies obtained in a Kohn--Sham density functional theory (DFT) calculation are generally known to be poor approximations to electron excitation energies that are measured in transport, tunneling and spectroscopic experiments such as photo-emission spectroscopy. The correction to these energies can be obtained from the poles of a single particle Green's function derived from a many-body perturbation theory. From a computational perspective, the accuracy and efficiency of such an approach depends on how a self energy term that properly accounts for dynamic screening of electrons is approximated. The $G_0W_0$ approximation is a widely used technique in which the self energy is expressed as the convolution of a non-interacting Green's function ($G_0$) and a screened Coulomb interaction ($W_0$) in the frequency domain. The computational cost associated with such a convolution is high due to the high complexity of evaluating $W_0$ at multiple frequencies. In this paper, we discuss how the cos...

  20. Optimizing conjunctive use of surface water and groundwater resources with stochastic dynamic programming

    DEFF Research Database (Denmark)

    Davidsen, Claus; Liu, Suxia; Mo, Xinguo;

    2014-01-01

    customizable method. The method has been applied to the Ziya River basin, China. The basin is located on the North China Plain and is subject to severe water scarcity, which includes surface water droughts and groundwater over-pumping. The head-dependent groundwater pumping costs will enable assessment of the......Optimal management of conjunctive use of surface water and groundwater has been attempted with different algorithms in the literature. In this study, a hydro-economic modelling approach to optimize conjunctive use of scarce surface water and groundwater resources under uncertainty is presented. A...... stochastic dynamic programming (SDP) approach is used to minimize the basin-wide total costs arising from water allocations and water curtailments. Dynamic allocation problems with inclusion of groundwater resources proved to be more complex to solve with SDP than pure surface water allocation problems due...

  1. Fast pairwise structural RNA alignments by pruning of the dynamical programming matrix

    DEFF Research Database (Denmark)

    Havgaard, Jakob Hull; Torarinsson, Elfar; Gorodkin, Jan

    2007-01-01

    not be present and pre-folding ignores the comparative information. Here, pruning of the dynamical programming matrix is presented as an alternative novel heuristic constraint. All subalignments that do not exceed a length-dependent minimum score are discarded as the matrix is filled out, thus giving...... the advantage of providing the constraints dynamically. This has been included in a new implementation of the FOLDALIGN algorithm for pairwise local or global structural alignment of RNA sequences. It is shown that time and memory requirements are dramatically lowered while overall performance is maintained....... Furthermore, a new divide and conquer method is introduced to limit the memory requirement during global alignment and backtrack of local alignment. All branch points in the computed RNA structure are found and used to divide the structure into smaller unbranched segments. Each segment is then realigned...

  2. A data base and analysis program for shuttle main engine dynamic pressure measurements

    Science.gov (United States)

    Coffin, T.

    1986-01-01

    A dynamic pressure data base management system is described for measurements obtained from space shuttle main engine (SSME) hot firing tests. The data were provided in terms of engine power level and rms pressure time histories, and power spectra of the dynamic pressure measurements at selected times during each test. Test measurements and engine locations are defined along with a discussion of data acquisition and reduction procedures. A description of the data base management analysis system is provided and subroutines developed for obtaining selected measurement means, variances, ranges and other statistics of interest are discussed. A summary of pressure spectra obtained at SSME rated power level is provided for reference. Application of the singular value decomposition technique to spectrum interpolation is discussed and isoplots of interpolated spectra are presented to indicate measurement trends with engine power level. Program listings of the data base management and spectrum interpolation software are given. Appendices are included to document all data base measurements.

  3. A computer code for beam optics calculation--third order approximation

    Institute of Scientific and Technical Information of China (English)

    L(U) Jianqin; LI Jinhai

    2006-01-01

    To calculate the beam transport in the ion optical systems accurately, a beam dynamics computer program of third order approximation is developed. Many conventional optical elements are incorporated in the program. Particle distributions of uniform type or Gaussian type in the ( x, y, z ) 3D ellipses can be selected by the users. The optimization procedures are provided to make the calculations reasonable and fast. The calculated results can be graphically displayed on the computer monitor.

  4. A dynamic programming approach to water allocation for seasonally dry area, based on stochastic soil moisture

    Science.gov (United States)

    Lu, Z.; Porporato, A. M.

    2012-12-01

    seasonally dry areas, which are widely distributed in the world, are usually facing an intensive disparity between the lack of natural resource and the great demand of social development. In dry seasons of such areas, the distribution/allocation of water resource is an extremely critical and sensitive issue, and conflicts often occur due to lack of appropriate water allocation scheme. Among the many uses of water, the need of agricultural irrigation water is highly elastic, but this factor has not yet been made full use to free up water from agriculture use. The primary goal of this work is to design an optimal distribution scheme of water resource for dry seasons to maximize benefits from precious water resources, considering the high elasticity of agriculture water demand due to the dynamic of soil moisture affected by the uncertainty of precipitation and other factors like canopy interception. A dynamic programming model will be used to figure out an appropriate allocation of water resources among agricultural irrigation and other purposes like drinking water, industry, and hydropower, etc. In this dynamic programming model, we analytically quantify the dynamic of soil moisture in the agricultural fields by describing the interception with marked Poisson process and describing the rainfall depth with exponential distribution. Then, we figure out a water-saving irrigation scheme, which regulates the timetable and volumes of water in irrigation, in order to minimize irrigation water requirement under the premise of necessary crop yield (as a constraint condition). And then, in turn, we provide a scheme of water resource distribution/allocation among agriculture and other purposes, taking aim at maximizing benefits from precious water resources, or in other words, make best use of limited water resource.

  5. Regulation of Dynamical Systems to Optimal Solutions of Semidefinite Programs: Algorithms and Applications to AC Optimal Power Flow

    OpenAIRE

    Dall'Anese, Emiliano; Dhople, Sairaj; Giannakis, Georgios B.

    2014-01-01

    This paper considers a collection of networked nonlinear dynamical systems, and addresses the synthesis of feedback controllers that seek optimal operating points corresponding to the solution of network-wide constrained optimization problems. Particular emphasis is placed on the solution of semidefinite programs (SDPs). The design of the feedback controller is grounded on a dual epsilon-subgradient approach, with the dual iterates utilized to dynamically update the dynamical-system reference...

  6. Efficient Parallelization of the Stochastic Dual Dynamic Programming Algorithm Applied to Hydropower Scheduling

    Directory of Open Access Journals (Sweden)

    Arild Helseth

    2015-12-01

    Full Text Available Stochastic dual dynamic programming (SDDP has become a popular algorithm used in practical long-term scheduling of hydropower systems. The SDDP algorithm is computationally demanding, but can be designed to take advantage of parallel processing. This paper presents a novel parallel scheme for the SDDP algorithm, where the stage-wise synchronization point traditionally used in the backward iteration of the SDDP algorithm is partially relaxed. The proposed scheme was tested on a realistic model of a Norwegian water course, proving that the synchronization point relaxation significantly improves parallel efficiency.

  7. A Dynamic Programming-Based Heuristic for the Shift Design Problem in Airport Ground Handling

    DEFF Research Database (Denmark)

    Clausen, Tommy

    We consider the heterogeneous shift design problem for a workforce with multiple skills, where work shifts are created to cover a given demand as well as possible while minimizing cost and satisfying a flexible set of constraints. We focus mainly on applications within airport ground handling where...... on dynamic programming that allows flexibility in modeling the workforce. Parameters allow a planner to determine the level of demand coverage that best fulfills the requirements of the organization. Results are presented from several diverse real-life ground handling instances....

  8. Dynamic analysis of piping systems - an approach to the experimental verification of computer programs (beam models)

    International Nuclear Information System (INIS)

    The structural analysis of dynamically excited piping systems as performed with the numerical method of Finite Elements (FE) is usually based on simple beam elements. However, in order to establish their applicability, the computer programs used for the structural analysis must be verified on the basis of large-scale experiments. The behaviour of the extremely endangered elbows is considered with the help of an experimentally and numerically analyzed piping system. The influences of form effects (cross-section ovalization) in the elbows are isolated from the measured total stresses by a new method and their importance for a comparison between experiment and calculation is shown. (orig.)

  9. Dynamic analysis of piping systems - an approach to the experimental verification of computer programs (beam models)

    International Nuclear Information System (INIS)

    The structural analysis of dynamically excited piping systems as performed with the numerical method of Finite Elements (FE) is usually based on simple beam elements. However, in order to establish their applicability, the computer programs used for the structural analysis must be verified on the basis of large-scale experiments. The behaviour of the extremely endangered elbows is considered (blowdown accident in a NPP). The influences of form effects (cross-section ovalization) in the elbows are isolated from the measured total stresses by a new method and their importance for a comparison experiment and calculation is shown. (orig./HP)

  10. Some vistas of modern mathematics dynamic programming, invariant imbedding, and the mathematical biosciences

    CERN Document Server

    Bellman, Richard

    2015-01-01

    Rapid advances in the physical and biological sciences and in related technologies have brought about equally farreaching changes in mathematical research. Focusing on control theory, invariant imbedding, dynamic programming, and quasilinearization, Mr. Bellman explores with ease and clarity the mathematical research problems arising from scientific questions in engineering, physics, biology, and medicine. Special attention is paid in these essays to the use of the digital computer in obtaining the numerical solution of numerical problems, its influence in the formulation of new and old scient

  11. Dynamic Programming Method Applied in Vietnamese Word Segmentation Based on Mutual Information among Syllables

    Directory of Open Access Journals (Sweden)

    Nguyen Thi Uyen

    2014-09-01

    Full Text Available Vietnamese word segmentation is an important step in Vietnamese natural language processing such as text categorization, text summary, and automated machine translation. The problem with Vietnamese word segmentation is complicated because Vietnamese words are not always separated by a space. One word can include one or more syllables depending on the context. This paper proposes a method for Vietnamese word segmentation based on the mutual information among the syllables combined with dynamic programming. With this method, we can achieve an accuracy rate of about 90% with a raw text corpus.

  12. An Efficient Dynamic Programming Algorithm for STR-IC-SEQ-EC-LCS Problem

    OpenAIRE

    Zhu, Daxin; Wang, Lei; Wu, Yingjie; Wang, Xiaodong

    2015-01-01

    In this paper, we consider a generalized longest common subsequence problem, in which a constraining sequence of length $s$ must be included as a substring and the other constraining sequence of length $t$ must be excluded as a subsequence of two main sequences and the length of the result must be maximal. For the two input sequences $X$ and $Y$ of lengths $n$ and $m$, and the given two constraining sequences of length $s$ and $t$, we present an $O(nmst)$ time dynamic programming algorithm fo...

  13. An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring inclusive constraints

    OpenAIRE

    Zhu, Daxin; Wang, Lei; Wu, Yingjie; Wang, Xiaodong

    2015-01-01

    In this paper, we consider a generalized longest common subsequence problem with multiple substring inclusive constraints. For the two input sequences $X$ and $Y$ of lengths $n$ and $m$, and a set of $d$ constraints $P=\\{P_1,\\cdots,P_d\\}$ of total length $r$, the problem is to find a common subsequence $Z$ of $X$ and $Y$ including each of constraint string in $P$ as a substring and the length of $Z$ is maximized. A new dynamic programming solution to this problem is presented in this paper. T...

  14. Discounted Continuous-time Markov Decision Processes with Unbounded Rates: the Dynamic Programming Approach

    CERN Document Server

    Piunovskiy, Alexey

    2011-01-01

    This paper deals with unconstrained discounted continuous-time Markov decision processes in Borel state and action spaces. Under some conditions imposed on the primitives, allowing unbounded transition rates and unbounded (from both above and below) cost rates, we show the regularity of the controlled process, which ensures the underlying models to be well defined. Then we develop the dynamic programming approach by showing that the Bellman equation is satisfied (by the optimal value). Finally, under some compactness-continuity conditions, we obtain the existence of a deterministic stationary optimal policy out of the class of randomized history-dependent policies.

  15. Development of a rubber component model suitable for being implemented in railway dynamic simulation programs

    Science.gov (United States)

    Alonso, A.; Gil-Negrete, N.; Nieto, J.; Giménez, J. G.

    2013-06-01

    Rubber elements are widely used in the railway industry in order to achieve vibration transmission requirements. Although they are critical components in railway vehicles, their modelling in the dynamic models of railway vehicles is usually relatively simple: it is usual to characterise them using a simple linear model formed by a spring and a viscous dashpot in parallel. In this paper the behaviour of typical rubber elements is analysed and a model that allows more accurately the prediction of its behaviour is proposed. The methodology to implement this model in railway simulation programs is also discussed.

  16. Dynamic Isotope Power System: technology verification phase, program plan, 1 October 1978

    International Nuclear Information System (INIS)

    The technology verification phase program plan of the Dynamic Isotope Power System (DIPS) project is presented. DIPS is a project to develop a 0.5 to 2.0 kW power system for spacecraft using an isotope heat source and a closed-cycle Rankine power-system with an organic working fluid. The technology verification phase's purposes are to increase the system efficiency to over 18%, to demonstrate system reliability, and to provide an estimate for flight test scheduling. Progress toward these goals is reported

  17. Dynamic Simulations of Nonlinear Multi-Domain Systems Based on Genetic Programming and Bond Graphs

    Institute of Scientific and Technical Information of China (English)

    DI Wenhui; SUN Bo; XU Lixin

    2009-01-01

    A dynamic simulation method for non-linear systems based on genetic programming (GP) and bond graphs (BG) was developed to improve the design of nonlinear multi-domain energy conversion sys-tems. The genetic operators enable the embryo bond graph to evolve towards the target graph according to the fitness function. Better simulation requires analysis of the optimization of the eigenvalue and the filter circuit evolution. The open topological design and space search ability of this method not only gives a more optimized convergence for the operation, but also reduces the generation time for the new circuit graph for the design of nonlinear multi-domain systems.

  18. Optimization and analysis of decision trees and rules: Dynamic programming approach

    KAUST Repository

    Alkhalid, Abdulaziz

    2013-08-01

    This paper is devoted to the consideration of software system Dagger created in KAUST. This system is based on extensions of dynamic programming. It allows sequential optimization of decision trees and rules relative to different cost functions, derivation of relationships between two cost functions (in particular, between number of misclassifications and depth of decision trees), and between cost and uncertainty of decision trees. We describe features of Dagger and consider examples of this systems work on decision tables from UCI Machine Learning Repository. We also use Dagger to compare 16 different greedy algorithms for decision tree construction. © 2013 Taylor and Francis Group, LLC.

  19. Solving the Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem by Dynamic Programming

    DEFF Research Database (Denmark)

    Rauff Lind Christensen, Tue; Klose, Andreas; Andersen, Kim Allan

    are neglected in the SSFCTP. The SSFCMCTP overcome this problem by incorporating a staircase cost structure in the cost function instead of the usual one used in SSFCTP. We present a dynamic programming algorithm for the resulting problem. To enhance the performance of the generic algorithm a number......The Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem (SSFCMCTP) is a problem with versatile applications. This problem is a generalization of the Single-Sink, Fixed-Charge Transportation Problem (SSFCTP), which has a fixed-charge, linear cost structure. However, in at least two...

  20. A Dynamic Programming based method for optimizing power system restoration with high wind power penetration

    DEFF Research Database (Denmark)

    Hu, Rui; Hu, Weihao; Li, Pengfei;

    2016-01-01

    to its stable limits. Once the blackout happens, a well-designed restoration strategy is significant. This paper focuses on how to ameliorate the power system restoration procedures to adapt the high wind power penetration and how to take full advantages of the wind power plants during the...... and relatively low cost. Thus, many countries are increasing the wind power penetration in their power system step by step, such as Denmark, Spain and Germany. The incremental wind power penetration brings a lot of new issues in operation and programming. The power system sometimes will operate close...... restoration. In this paper, the possibility to exploit the stochastic wind power during restoration was discussed, and a Dynamic Programming (DP) method was proposed to make wind power contribute in the restoration rationally as far as possible. In this paper, the method is tested and verified by a modified...

  1. Human dynamics of spending: Longitudinal study of a coalition loyalty program

    Science.gov (United States)

    Yi, Il Gu; Jeong, Hyang Min; Choi, Woosuk; Jang, Seungkwon; Lee, Heejin; Kim, Beom Jun

    2014-09-01

    Large-scale data of a coalition loyalty program is analyzed in terms of the temporal dynamics of customers' behaviors. We report that the two main activities of a loyalty program, earning and redemption of points, exhibit very different behaviors. It is also found that as customers become older from their early 20's, both male and female customers increase their earning and redemption activities until they arrive at the turning points, beyond which both activities decrease. The positions of turning points as well as the maximum earned and redeemed points are found to differ for males and females. On top of these temporal behaviors, we identify that there exists a learning effect and customers learn how to earn and redeem points as their experiences accumulate in time.

  2. Controller Synthesis for Robust Invariance of Polynomial Dynamical Systems using Linear Programming

    CERN Document Server

    Sassi, Mohamed Amin Ben

    2011-01-01

    In this paper, we consider a control synthesis problem for a class of polynomial dynamical systems subject to bounded disturbances and with input constraints. More precisely, we aim at synthesizing at the same time a controller and an invariant set for the controlled system under all admissible disturbances. We propose a computational method to solve this problem. Given a candidate polyhedral invariant, we show that controller synthesis can be formulated as an optimization problem involving polynomial cost functions over bounded polytopes for which effective linear programming relaxations can be obtained. Then, we propose an iterative approach to compute the controller and the polyhedral invariant at once. Each iteration of the approach mainly consists in solving two linear programs (one for the controller and one for the invariant) and is thus computationally tractable. Finally, we show with several examples the usefulness of our method in applications.

  3. K-TIF: a two-fluid computer program for downcomer flow dynamics. [PWR

    Energy Technology Data Exchange (ETDEWEB)

    Amsden, A.A.; Harlow, F.H.

    1977-10-01

    The K-TIF computer program has been developed for numerical solution of the time-varying dynamics of steam and water in a pressurized water reactor downcomer. The current status of physical and mathematical modeling is presented in detail. The report also contains a complete description of the numerical solution technique, a full description and listing of the computer program, instructions for its use, with a sample printout for a specific test problem. A series of calculations, performed with no change in the modeling parameters, shows consistent agreement with the experimental trends over a wide range of conditions, which gives confidence to the calculations as a basis for investigating the complicated physics of steam-water flows in the downcomer.

  4. The Zeldovich approximation

    CERN Document Server

    White, Martin

    2014-01-01

    This year marks the 100th anniversary of the birth of Yakov Zel'dovich. Amongst his many legacies is the Zel'dovich approximation for the growth of large-scale structure, which remains one of the most successful and insightful analytic models of structure formation. We use the Zel'dovich approximation to compute the two-point function of the matter and biased tracers, and compare to the results of N-body simulations and other Lagrangian perturbation theories. We show that Lagrangian perturbation theories converge well and that the Zel'dovich approximation provides a good fit to the N-body results except for the quadrupole moment of the halo correlation function. We extend the calculation of halo bias to 3rd order and also consider non-local biasing schemes, none of which remove the discrepancy. We argue that a part of the discrepancy owes to an incorrect prediction of inter-halo velocity correlations. We use the Zel'dovich approximation to compute the ingredients of the Gaussian streaming model and show that ...

  5. Approximating The DCM

    DEFF Research Database (Denmark)

    Madsen, Rasmus Elsborg

    2005-01-01

    The Dirichlet compound multinomial (DCM), which has recently been shown to be well suited for modeling for word burstiness in documents, is here investigated. A number of conceptual explanations that account for these recent results, are provided. An exponential family approximation of the DCM that...

  6. Addressing gender dynamics and engaging men in HIV programs: lessons learned from Horizons research.

    Science.gov (United States)

    Pulerwitz, Julie; Michaelis, Annie; Verma, Ravi; Weiss, Ellen

    2010-01-01

    In the field of human immunodeficiency virus (HIV) prevention, there has been increasing interest in the role that gender plays in HIV and violence risk, and in successfully engaging men in the response. This article highlights findings from more than 10 studies in Asia, Africa, and Latin America--conducted from 1997 through 2007 as part of the Horizons program--that have contributed to understanding the relationship between gender and men's behaviors, developing useful measurement tools for gender norms, and designing and evaluating the impact of gender-focused program strategies. Studies showed significant associations between support for inequitable norms and risk, such as more partner violence and less condom use. Programmatic lessons learned ranged from insights into appropriate media messages, to strategies to engage men in critically reflecting upon gender inequality, to the qualities of successful program facilitators. The portfolio of work reveals the potential and importance of directly addressing gender dynamics in HIV- and violence-prevention programs for both men and women. PMID:20297757

  7. Approximation algorithms for the fixed-topology phylogenetic number problem

    Energy Technology Data Exchange (ETDEWEB)

    Cryan, M.; Goldberg, L.A. [Univ. of Warwick, Coventry (United Kingdom). Dept. of Computer Science; Phillips, C.A. [Sandia National Labs., Albuquerque, NM (United States)

    1997-04-01

    In the {ell}-phylogeny problem, one wishes to construct an evolutionary tree for a set of species represented by characters, in which each state of each character induces no more than {ell} connected components. The authors consider the fixed-topology version of this problem for fixed-topologies of arbitrary degree. This version of the problem is known to be NP-complete for {ell} {ge} 3 even for degree-3 trees in which no state labels more than {ell} + 1 leaves (and therefore there is a trivial {ell} + 1 phylogeny). They give a 2-approximation algorithm for all {ell} {ge} 3 for arbitrary input topologies and they given an optimal approximation algorithm that constructs a 4-phylogeny when a 3-phylogeny exists. Dynamic programming techniques, which are typically used in fixed-topology problems, cannot be applied to {ell}-phylogeny problems. The 2-approximation algorithm is the first application of linear programming to approximation algorithms for phylogeny problems. They extend their results to a related problem in which characters are polymorphic.

  8. Dynamics of a Successful Planned Giving Program Utilizing Shared Leadership at Historically Black Colleges and Universities (HBCUs)

    Science.gov (United States)

    Baldwin, Robin Lynn Brunty

    2013-01-01

    The purpose of this study was to evaluate the dynamics of a successful planned giving program utilizing shared leadership at Historically Black Colleges and Universities (HBCUs). This information will assist the leadership in determining if and how a successful planned giving program can be established for HBCUs. It is possible for planned gifts…

  9. Development of massive multilevel molecular dynamics simulation program, platypus (PLATform for dYnamic protein unified simulation), for the elucidation of protein functions

    OpenAIRE

    Takano, Yu; Nakata, Kazuto; Yonezawa, Yasushige; Nakamura, Haruki

    2016-01-01

    A massively parallel program for quantum mechanical‐molecular mechanical (QM/MM) molecular dynamics simulation, called Platypus (PLATform for dYnamic Protein Unified Simulation), was developed to elucidate protein functions. The speedup and the parallelization ratio of Platypus in the QM and QM/MM calculations were assessed for a bacteriochlorophyll dimer in the photosynthetic reaction center (DIMER) on the K computer, a massively parallel computer achieving 10 PetaFLOPs with 705,024 cores. P...

  10. Lattice approximation of gauge theories with Dirac Kaehler fermions

    International Nuclear Information System (INIS)

    A program which tries to overcome the systematic difficulties caused by the lattice fermion problem by the consideration of models which describe Dirac fields by differential forms is reported. In the first lecture the formalism is developped and applied to the formulation of geometric QCD and of a Geometric Standard Model. The second lecture treats the characteristic symmetry problems which appear in the lattice approximation of geometric field theories. In the last lecture strong coupling dynamics of geometric QCD are considered with the final aim of a derivation of the quark model for the hadron spectrum. (author)

  11. Program POD; A computer code to calculate nuclear elastic scattering cross sections with the optical model and neutron inelastic scattering cross sections by the distorted-wave born approximation

    International Nuclear Information System (INIS)

    The computer code, POD, was developed to calculate angle-differential cross sections and analyzing powers for shape-elastic scattering for collisions of neutron or light ions with target nucleus. The cross sections are computed with the optical model. Angle-differential cross sections for neutron inelastic scattering can also be calculated with the distorted-wave Born approximation. The optical model potential parameters are the most essential inputs for those model computations. In this program, the cross sections and analyzing powers are obtained by using the existing local or global parameters. The parameters can also be inputted by users. In this report, the theoretical formulas, the computational methods, and the input parameters are explained. The sample inputs and outputs are also presented. (author)

  12. Stockpile strategy for China's emergency oil reserve: A dynamic programming approach

    International Nuclear Information System (INIS)

    China is currently accelerating construction of its strategic petroleum reserves. How should China fill the SPR in a cost-effective manner in the short-run? How might this affect world oil prices? Using a dynamic programming model to answer these questions, the objective of this paper is to minimize the stockpiling costs, including consumer surplus as well as crude acquisition and holding costs. The crude oil acquisition price in the model is determined by global equilibrium between supply and demand. Demand, in turn, depends on world market conditions including China's stockpile filling rate. Our empirical study under different market conditions shows that China's optimal stockpile acquisition rate varies from 9 to 19 million barrels per month, and the optimal stockpiling drives up the world oil price by 3–7%. The endogenous price increase accounts for 52% of total stockpiling costs in the base case. When the market is tighter or the demand function is more inelastic, the stockpiling affects the market more significantly and pushes prices even higher. Alternatively, in a disruption, drawdown from the stockpile can effectively dampen soaring prices, though the shortage is likely to leave the price higher than before the disruption. - Highlights: • China's SPR policies are examined by dynamic programming. • The optimal stockpile acquisition rate varies from 9 to 19 million barrels per month. • The optimal stockpiling drives up world oil price by 3–7%

  13. Ground test program for a full-size solar dynamic heat receiver

    Science.gov (United States)

    Sedgwick, L. M.; Kaufmann, K. J.; Mclallin, K. L.; Kerslake, T. W.

    1991-01-01

    Test hardware, facilities, and procedures were developed to conduct ground testing of a full-size, solar dynamic heat receiver in a partially simulated, low earth orbit environment. The heat receiver was designed to supply 102 kW of thermal energy to a helium and xenon gas mixture continuously over a 94 minute orbit, including up to 36 minutes of eclipse. The purpose of the test program was to quantify the receiver thermodynamic performance, its operating temperatures, and thermal response to changes in environmental and power module interface boundary conditions. The heat receiver was tested in a vacuum chamber using liquid nitrogen cold shrouds and an aperture cold plate. Special test equipment was designed to provide the required ranges in interface boundary conditions that typify those expected or required for operation as part of the solar dynamic power module on the Space Station Freedom. The support hardware includes an infrared quartz lamp heater with 30 independently controllable zones and a closed-Brayton cycle engine simulator to circulate and condition the helium-xenon gas mixture. The test article, test support hardware, facilities, and instrumentation developed to conduct the ground test program are all described.

  14. Dynamic programming-based hot spot identification approach for pedestrian crashes.

    Science.gov (United States)

    Medury, Aditya; Grembek, Offer

    2016-08-01

    Network screening techniques are widely used by state agencies to identify locations with high collision concentration, also referred to as hot spots. However, most of the research in this regard has focused on identifying highway segments that are of concern to automobile collisions. In comparison, pedestrian hot spot detection has typically focused on analyzing pedestrian crashes in specific locations, such as at/near intersections, mid-blocks, and/or other crossings, as opposed to long stretches of roadway. In this context, the efficiency of the some of the widely used network screening methods has not been tested. Hence, in order to address this issue, a dynamic programming-based hot spot identification approach is proposed which provides efficient hot spot definitions for pedestrian crashes. The proposed approach is compared with the sliding window method and an intersection buffer-based approach. The results reveal that the dynamic programming method generates more hot spots with a higher number of crashes, while providing small hot spot segment lengths. In comparison, the sliding window method is shown to suffer from shortcomings due to a first-come-first-serve approach vis-à-vis hot spot identification and a fixed hot spot window length assumption. PMID:27209154

  15. Hybrid integer coded differential evolution - dynamic programming approach for economic load dispatch with multiple fuel options

    International Nuclear Information System (INIS)

    This paper presents a novel and efficient approach through a hybrid integer coded differential evolution - dynamic programming (ICDEDP) scheme to solve the economic dispatch (ED) problem with multiple fuel options. A dynamic programming (DP) based simplified recursive algorithm is developed for optimal scheduling of the generating units in the ED problem. The proposed hybrid scheme is developed in such a way that an integer coded differential evolution (ICDE) is acting as a main optimizer to identify the optimal fuel options, and the DP is used to find the fitness of each agent in the population of the ICDE, which makes a quick decision to direct the search towards the optimal region. The hybrid ICDEDP decision vector consists of a sequence of integer numbers representing the fuel options of each unit to optimize quality of search and computation time. A gene swap operator is introduced in the proposed algorithm to improve its convergence characteristics. In order to show the efficiency and effectiveness, the proposed hybrid ICDEDP approach has been examined and tested with numerical results using the ten generation unit economic dispatch problem with multiple fuel options. The test result shows that the proposed hybrid ICDEDP algorithm has high quality solution, superior convergence characteristics and shorter computation time

  16. A parallel dynamic programming algorithm for multi-reservoir system optimization

    Science.gov (United States)

    Li, Xiang; Wei, Jiahua; Li, Tiejian; Wang, Guangqian; Yeh, William W.-G.

    2014-05-01

    This paper develops a parallel dynamic programming algorithm to optimize the joint operation of a multi-reservoir system. First, a multi-dimensional dynamic programming (DP) model is formulated for a multi-reservoir system. Second, the DP algorithm is parallelized using a peer-to-peer parallel paradigm. The parallelization is based on the distributed memory architecture and the message passing interface (MPI) protocol. We consider both the distributed computing and distributed computer memory in the parallelization. The parallel paradigm aims at reducing the computation time as well as alleviating the computer memory requirement associated with running a multi-dimensional DP model. Next, we test the parallel DP algorithm on the classic, benchmark four-reservoir problem on a high-performance computing (HPC) system with up to 350 cores. Results indicate that the parallel DP algorithm exhibits good performance in parallel efficiency; the parallel DP algorithm is scalable and will not be restricted by the number of cores. Finally, the parallel DP algorithm is applied to a real-world, five-reservoir system in China. The results demonstrate the parallel efficiency and practical utility of the proposed methodology.

  17. Risk-Constrained Dynamic Programming for Optimal Mars Entry, Descent, and Landing

    Science.gov (United States)

    Ono, Masahiro; Kuwata, Yoshiaki

    2013-01-01

    A chance-constrained dynamic programming algorithm was developed that is capable of making optimal sequential decisions within a user-specified risk bound. This work handles stochastic uncertainties over multiple stages in the CEMAT (Combined EDL-Mobility Analyses Tool) framework. It was demonstrated by a simulation of Mars entry, descent, and landing (EDL) using real landscape data obtained from the Mars Reconnaissance Orbiter. Although standard dynamic programming (DP) provides a general framework for optimal sequential decisionmaking under uncertainty, it typically achieves risk aversion by imposing an arbitrary penalty on failure states. Such a penalty-based approach cannot explicitly bound the probability of mission failure. A key idea behind the new approach is called risk allocation, which decomposes a joint chance constraint into a set of individual chance constraints and distributes risk over them. The joint chance constraint was reformulated into a constraint on an expectation over a sum of an indicator function, which can be incorporated into the cost function by dualizing the optimization problem. As a result, the chance-constraint optimization problem can be turned into an unconstrained optimization over a Lagrangian, which can be solved efficiently using a standard DP approach.

  18. Prestack traveltime approximations

    KAUST Repository

    Alkhalifah, Tariq Ali

    2011-01-01

    Most prestack traveltime relations we tend work with are based on homogeneous (or semi-homogenous, possibly effective) media approximations. This includes the multi-focusing or double square-root (DSR) and the common reflection stack (CRS) equations. Using the DSR equation, I analyze the associated eikonal form in the general source-receiver domain. Like its wave-equation counterpart, it suffers from a critical singularity for horizontally traveling waves. As a result, I derive expansion based solutions of this eikonal based on polynomial expansions in terms of the reflection and dip angles in a generally inhomogenous background medium. These approximate solutions are free of singularities and can be used to estimate travetimes for small to moderate offsets (or reflection angles) in a generally inhomogeneous medium. A Marmousi example demonstrates the usefulness of the approach. © 2011 Society of Exploration Geophysicists.

  19. Approximate level method

    OpenAIRE

    Richtárik, Peter

    2008-01-01

    In this paper we propose and analyze a variant of the level method [4], which is an algorithm for minimizing nonsmooth convex functions. The main work per iteration is spent on 1) minimizing a piecewise-linear model of the objective function and on 2) projecting onto the intersection of the feasible region and a polyhedron arising as a level set of the model. We show that by replacing exact computations in both cases by approximate computations, in relative scale, the theoretical ...

  20. Approximate Bayesian recursive estimation

    Czech Academy of Sciences Publication Activity Database

    Kárný, Miroslav

    2014-01-01

    Roč. 285, č. 1 (2014), s. 100-111. ISSN 0020-0255 R&D Projects: GA ČR GA13-13502S Institutional support: RVO:67985556 Keywords : Approximate parameter estimation * Bayesian recursive estimation * Kullback–Leibler divergence * Forgetting Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 4.038, year: 2014 http://library.utia.cas.cz/separaty/2014/AS/karny-0425539.pdf