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.

Replacement model of city bus: A dynamic programming approach

Science.gov (United States)

Arifin, Dadang; Yusuf, Edhi

2017-06-01

This paper aims to develop a replacement model of city bus vehicles operated in Bandung City. This study is driven from real cases encountered by the Damri Company in the efforts to improve services to the public. The replacement model propounds two policy alternatives: First, to maintain or keep the vehicles, and second is to replace them with new ones taking into account operating costs, revenue, salvage value, and acquisition cost of a new vehicle. A deterministic dynamic programming approach is used to solve the model. The optimization process was heuristically executed using empirical data of Perum Damri. The output of the model is to determine the replacement schedule and the best policy if the vehicle has passed the economic life. Based on the results, the technical life of the bus is approximately 20 years old, while the economic life is an average of 9 (nine) years. It means that after the bus is operated for 9 (nine) years, managers should consider the policy of rejuvenation.

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

DEFF Research Database (Denmark)

Achenbach, Michael; Ostermann, Klaus

2010-01-01

decisions exposing private data. We present an approach that both improves the expressiveness of test cases using non-deterministic choice and reduces design modifications using dynamic aspect-oriented programming techniques. Non-deterministic choice facilitates local definitions of multiple executions...... without parameterization or generation of tests. It also eases modelling naturally non-deterministic program features like IO or multi-threading in integration tests. Dynamic AOP facilitates powerful design adaptations without exposing test features, keeping the scope of these adaptations local to each...... test. We also combine non-determinism and dynamic aspects in a new approach to testing multi-threaded programs using co-routines....

Evaluating Dynamic Analysis Techniques for Program Comprehension

NARCIS (Netherlands)

Cornelissen, S.G.M.

2009-01-01

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

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.

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.

Efficient dynamic optimization of logic programs

Science.gov (United States)

Laird, Phil

1992-01-01

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

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.

Introduction to dynamic programming

CERN Document Server

Cooper, Leon; Rodin, E Y

1981-01-01

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

Hybrid Semantics of Stochastic Programs with Dynamic Reconfiguration

Directory of Open Access Journals (Sweden)

Alberto Policriti

2009-10-01

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

Convergence of Sample Path Optimal Policies for Stochastic Dynamic Programming

National Research Council Canada - National Science Library

Fu, Michael C; Jin, Xing

2005-01-01

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

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.

A combined stochastic programming and optimal control approach to personal finance and pensions

DEFF Research Database (Denmark)

Konicz, Agnieszka Karolina; Pisinger, David; Rasmussen, Kourosh Marjani

2015-01-01

The paper presents a model that combines a dynamic programming (stochastic optimal control) approach and a multi-stage stochastic linear programming approach (SLP), integrated into one SLP formulation. Stochastic optimal control produces an optimal policy that is easy to understand and implement....

A stochastic programming approach to manufacturing flow control

OpenAIRE

Haurie, Alain; Moresino, Francesco

2012-01-01

This paper proposes and tests an approximation of the solution of a class of piecewise deterministic control problems, typically used in the modeling of manufacturing flow processes. This approximation uses a stochastic programming approach on a suitably discretized and sampled system. The method proceeds through two stages: (i) the Hamilton-Jacobi-Bellman (HJB) dynamic programming equations for the finite horizon continuous time stochastic control problem are discretized over a set of sample...

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.

Dynamic programming algorithms for biological sequence comparison.

Science.gov (United States)

Pearson, W R; Miller, W

1992-01-01

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

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

Energy Technology Data Exchange (ETDEWEB)

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

2016-12-15

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

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

International Nuclear Information System (INIS)

Pham, Huyên; Wei, Xiaoli

2016-01-01

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

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

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

Dynamic Frames Based Verification Method for Concurrent Java Programs

NARCIS (Netherlands)

Mostowski, Wojciech

2016-01-01

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

A Dynamic Programming Algorithm for the k-Haplotyping Problem

Institute of Scientific and Technical Information of China (English)

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

2006-01-01

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

Constraint Logic Programming approach to protein structure prediction

Directory of Open Access Journals (Sweden)

Fogolari Federico

2004-11-01

Full Text Available Abstract Background The protein structure prediction problem is one of the most challenging problems in biological sciences. Many approaches have been proposed using database information and/or simplified protein models. The protein structure prediction problem can be cast in the form of an optimization problem. Notwithstanding its importance, the problem has very seldom been tackled by Constraint Logic Programming, a declarative programming paradigm suitable for solving combinatorial optimization problems. Results Constraint Logic Programming techniques have been applied to the protein structure prediction problem on the face-centered cube lattice model. Molecular dynamics techniques, endowed with the notion of constraint, have been also exploited. Even using a very simplified model, Constraint Logic Programming on the face-centered cube lattice model allowed us to obtain acceptable results for a few small proteins. As a test implementation their (known secondary structure and the presence of disulfide bridges are used as constraints. Simplified structures obtained in this way have been converted to all atom models with plausible structure. Results have been compared with a similar approach using a well-established technique as molecular dynamics. Conclusions The results obtained on small proteins show that Constraint Logic Programming techniques can be employed for studying protein simplified models, which can be converted into realistic all atom models. The advantage of Constraint Logic Programming over other, much more explored, methodologies, resides in the rapid software prototyping, in the easy way of encoding heuristics, and in exploiting all the advances made in this research area, e.g. in constraint propagation and its use for pruning the huge search space.

Constraint Logic Programming approach to protein structure prediction.

Science.gov (United States)

Dal Palù, Alessandro; Dovier, Agostino; Fogolari, Federico

2004-11-30

The protein structure prediction problem is one of the most challenging problems in biological sciences. Many approaches have been proposed using database information and/or simplified protein models. The protein structure prediction problem can be cast in the form of an optimization problem. Notwithstanding its importance, the problem has very seldom been tackled by Constraint Logic Programming, a declarative programming paradigm suitable for solving combinatorial optimization problems. Constraint Logic Programming techniques have been applied to the protein structure prediction problem on the face-centered cube lattice model. Molecular dynamics techniques, endowed with the notion of constraint, have been also exploited. Even using a very simplified model, Constraint Logic Programming on the face-centered cube lattice model allowed us to obtain acceptable results for a few small proteins. As a test implementation their (known) secondary structure and the presence of disulfide bridges are used as constraints. Simplified structures obtained in this way have been converted to all atom models with plausible structure. Results have been compared with a similar approach using a well-established technique as molecular dynamics. The results obtained on small proteins show that Constraint Logic Programming techniques can be employed for studying protein simplified models, which can be converted into realistic all atom models. The advantage of Constraint Logic Programming over other, much more explored, methodologies, resides in the rapid software prototyping, in the easy way of encoding heuristics, and in exploiting all the advances made in this research area, e.g. in constraint propagation and its use for pruning the huge search space.

Stochastic integer programming by dynamic programming

NARCIS (Netherlands)

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

1988-01-01

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

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

The design of measurement programs 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 sensors can be estimated. This is shown in a numerical example where the proposed approach is demonstrated. The example is concerned with design of a measurement program...

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

The design of a measured program devoted to parameter identification of structural dynamic systems is considered, the design problem is formulated as an optimization problem due to minimize the total expected 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 nmber of sensors can be estimated. This is sown in an numerical example where the proposed approach is demonstrated. The example is concerned with design of a measurement program for estimating the modal damping parameters...

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.

IMPLICIT DUAL CONTROL BASED ON PARTICLE FILTERING AND FORWARD DYNAMIC PROGRAMMING.

Science.gov (United States)

Bayard, David S; Schumitzky, Alan

2010-03-01

This paper develops a sampling-based approach to implicit dual control. Implicit dual control methods synthesize stochastic control policies by systematically approximating the stochastic dynamic programming equations of Bellman, in contrast to explicit dual control methods that artificially induce probing into the control law by modifying the cost function to include a term that rewards learning. The proposed implicit dual control approach is novel in that it combines a particle filter with a policy-iteration method for forward dynamic programming. The integration of the two methods provides a complete sampling-based approach to the problem. Implementation of the approach is simplified by making use of a specific architecture denoted as an H-block. Practical suggestions are given for reducing computational loads within the H-block for real-time applications. As an example, the method is applied to the control of a stochastic pendulum model having unknown mass, length, initial position and velocity, and unknown sign of its dc gain. Simulation results indicate that active controllers based on the described method can systematically improve closed-loop performance with respect to other more common stochastic control approaches.

Extraction of Static and Dynamic Reservoir Operation Rules by Genetic Programming

Directory of Open Access Journals (Sweden)

Habib Akbari Alashti

2014-11-01

Full Text Available Considering the necessity of desirable operation of limited water resources and assuming the significant role of dams in controlling and consuming the surface waters, highlights the advantageous of suitable operation rules for optimal and sustainable operation of dams. This study investigates the hydroelectric supply of a one-reservoir system of Karoon3 using nonlinear programming (NLP, genetic algorithm (GA, genetic programming (GP and fixed length gen GP (FLGGP in real-time operation of dam considering two approaches of static and dynamic operation rules. In static operation rule, only one rule curve is extracted for all months in a year whereas in dynamic operation rule, monthly rule curves (12 rules are extracted for each month of a year. In addition, nonlinear decision rule (NLDR curves are considered, and the total deficiency function as the target (objective function have been used for evaluating the performance of each method and approach. Results show appropriate efficiency of GP and FLGGP methods in extracting operation rules in both approaches. Superiority of these methods to operation methods yielded by GA and NLP is 5%. Moreover, according to the results, it can be remarked that, FLGGP method is an alternative for GP method, whereas the GP method cannot be used due to its limitations. Comparison of two approaches of static and dynamic operation rules demonstrated the superiority of dynamic operation rule to static operation rule (about 10% and therefore this method has more capabilities in real-time operation of the reservoirs systems.

Charting Multidisciplinary Team External Dynamics Using a Systems Thinking Approach

Science.gov (United States)

Barthelemy, Jean-Francois; Waszak, Martin R.; Jones, Kenneth M.; Silcox, Richard J.; Silva, Walter A.; Nowaczyk, Ronald H.

1998-01-01

Using the formalism provided by the Systems Thinking approach, the dynamics present when operating multidisciplinary teams are examined in the context of the NASA Langley Research and Technology Group, an R&D organization organized along functional lines. The paper focuses on external dynamics and examines how an organization creates and nurtures the teams and how it disseminates and retains the lessons and expertise created by the multidisciplinary activities. Key variables are selected and the causal relationships between the variables are identified. Five "stories" are told, each of which touches on a different aspect of the dynamics. The Systems Thinking Approach provides recommendations as to interventions that will facilitate the introduction of multidisciplinary teams and that therefore will increase the likelihood of performing successful multidisciplinary developments. These interventions can be carried out either by individual researchers, line management or program management.

Algorithms and programs of dynamic mixture estimation unified approach to different types of components

CERN Document Server

Nagy, Ivan

2017-01-01

This book provides a general theoretical background for constructing the recursive Bayesian estimation algorithms for mixture models. It collects the recursive algorithms for estimating dynamic mixtures of various distributions and brings them in the unified form, providing a scheme for constructing the estimation algorithm for a mixture of components modeled by distributions with reproducible statistics. It offers the recursive estimation of dynamic mixtures, which are free of iterative processes and close to analytical solutions as much as possible. In addition, these methods can be used online and simultaneously perform learning, which improves their efficiency during estimation. The book includes detailed program codes for solving the presented theoretical tasks. Codes are implemented in the open source platform for engineering computations. The program codes given serve to illustrate the theory and demonstrate the work of the included algorithms.

Adaptive dynamic programming with applications in optimal control

CERN Document Server

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

2017-01-01

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

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

Fast engineering optimization: A novel highly effective control parameterization approach for industrial dynamic processes.

Science.gov (United States)

Liu, Ping; Li, Guodong; Liu, Xinggao

2015-09-01

Control vector parameterization (CVP) is an important approach of the engineering optimization for the industrial dynamic processes. However, its major defect, the low optimization efficiency caused by calculating the relevant differential equations in the generated nonlinear programming (NLP) problem repeatedly, limits its wide application in the engineering optimization for the industrial dynamic processes. A novel highly effective control parameterization approach, fast-CVP, is first proposed to improve the optimization efficiency for industrial dynamic processes, where the costate gradient formulae is employed and a fast approximate scheme is presented to solve the differential equations in dynamic process simulation. Three well-known engineering optimization benchmark problems of the industrial dynamic processes are demonstrated as illustration. The research results show that the proposed fast approach achieves a fine performance that at least 90% of the computation time can be saved in contrast to the traditional CVP method, which reveals the effectiveness of the proposed fast engineering optimization approach for the industrial dynamic processes. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.

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

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

1991-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, i.e. 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 contributions of the approach is that the optimal number of sensors can be estimated. This is shown in a numerical example where the proposed approach is demonstrated. The example is concerned with design of a measurement...

A dynamic programming approach for modeling low-carbon fuel technology adoption considering learning-by-doing effect

International Nuclear Information System (INIS)

Chen, Yuche; Zhang, Yunteng; Fan, Yueyue; Hu, Kejia; Zhao, Jianyou

2017-01-01

Highlights: • Dynamic programming method is used in transportation fuel portfolio planning. • The learning effect in new fuel technology is endogenously modeled through an experience curve. • Cellulosic biofuels play critical role in de-carbonization transport sector in near term. • The initial 3–4 billion gallons production is critical to bring down cellulosic biofuels’ cost. • Large penetration of Zero Emission Vehicles will discourage development of cellulosic biofuels. - Abstract: Promoting the adoption of low-carbon technologies in the transportation fuel portfolio is an effective strategy to mitigate greenhouse gas emissions from the transportation sector worldwide. However, as one of the most promising low-carbon fuels, cellulosic biofuel has not fully entered commercial production. Governments could provide guidance in developing cellulosic biofuel technologies, but no systematic approach has been proposed yet. We establish a dynamic programming framework for investigating time-dependent and adaptive decision-making processes to develop advanced fuel technologies. The learning-by-doing effect inherited in the technology development process is included in the framework. The proposed framework is applied in a case study to explore the most economical pathway for California to develop a solid cellulosic biofuel industry under its Low Carbon Fuel Standard. Our results show that cellulosic biofuel technology is playing a critical role in guaranteeing California’s 10% greenhouse gas emission reduction by 2020. Three to four billion gallons of cumulative production are needed to ensure that cellulosic biofuel is cost-competitive with petroleum-based fuels or conventional biofuels. Zero emission vehicle promoting policies will discourage the development of cellulosic biofuel. The proposed framework, with small adjustments, can also be applied to study new technology development in other energy sectors.

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.

Dynamical System Approaches to Combinatorial Optimization

DEFF Research Database (Denmark)

Starke, Jens

2013-01-01

of large times as an asymptotically stable point of the dynamics. The obtained solutions are often not globally optimal but good approximations of it. Dynamical system and neural network approaches are appropriate methods for distributed and parallel processing. Because of the parallelization......Several dynamical system approaches to combinatorial optimization problems are described and compared. These include dynamical systems derived from penalty methods; the approach of Hopfield and Tank; self-organizing maps, that is, Kohonen networks; coupled selection equations; and hybrid methods...... thereof can be used as models for many industrial problems like manufacturing planning and optimization of flexible manufacturing systems. This is illustrated for an example in distributed robotic systems....

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.

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.

Optimization and analysis of decision trees and rules: Dynamic programming approach

KAUST Repository

Alkhalid, Abdulaziz; Amin, Talha M.; Chikalov, Igor; Hussain, Shahid; Moshkov, Mikhail; Zielosko, Beata

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

Policy analysis of the budget used in training program for reducing lower back pain among heavy equipment operators in the construction industry: System dynamics approach

Science.gov (United States)

Vitharana, V. H. P.; Chinda, T.

2018-04-01

Lower back pain (LBP), prevalence is high among the heavy equipment operators leading to high compensation cost in the construction industry. It is found that proper training program assists in reducing chances of having LBP. This study, therefore aims to examine different safety related budget available to support LBP related training program for different age group workers, utilizing system dynamics modeling approach. The simulation results show that at least 2.5% of the total budget must be allocated in the safety and health budget to reduce the chances of having LBP cases.

Element Partition Trees For H-Refined Meshes to Optimize Direct Solver Performance. Part I: Dynamic Programming

KAUST Repository

AbouEisha, Hassan M.

2017-07-13

We consider a class of two-and three-dimensional h-refined meshes generated by an adaptive finite element method. We introduce an element partition tree, which controls the execution of the multi-frontal solver algorithm over these refined grids. We propose and study algorithms with polynomial computational cost for the optimization of these element partition trees. The trees provide an ordering for the elimination of unknowns. The algorithms automatically optimize the element partition trees using extensions of dynamic programming. The construction of the trees by the dynamic programming approach is expensive. These generated trees cannot be used in practice, but rather utilized as a learning tool to propose fast heuristic algorithms. In this first part of our paper we focus on the dynamic programming approach, and draw a sketch of the heuristic algorithm. The second part will be devoted to a more detailed analysis of the heuristic algorithm extended for the case of hp-adaptive

Element Partition Trees For H-Refined Meshes to Optimize Direct Solver Performance. Part I: Dynamic Programming

KAUST Repository

AbouEisha, Hassan M.; Calo, Victor Manuel; Jopek, Konrad; Moshkov, Mikhail; Paszyńka, Anna; Paszyński, Maciej; Skotniczny, Marcin

2017-01-01

We consider a class of two-and three-dimensional h-refined meshes generated by an adaptive finite element method. We introduce an element partition tree, which controls the execution of the multi-frontal solver algorithm over these refined grids. We propose and study algorithms with polynomial computational cost for the optimization of these element partition trees. The trees provide an ordering for the elimination of unknowns. The algorithms automatically optimize the element partition trees using extensions of dynamic programming. The construction of the trees by the dynamic programming approach is expensive. These generated trees cannot be used in practice, but rather utilized as a learning tool to propose fast heuristic algorithms. In this first part of our paper we focus on the dynamic programming approach, and draw a sketch of the heuristic algorithm. The second part will be devoted to a more detailed analysis of the heuristic algorithm extended for the case of hp-adaptive

Pathwise dynamic programming

NARCIS (Netherlands)

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

2017-01-01

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

Neutrophil programming dynamics and its disease relevance.

Science.gov (United States)

Ran, Taojing; Geng, Shuo; Li, Liwu

2017-11-01

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

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. Copyright © 2013 Elsevier B.V. All rights reserved.

DYNAMIC PROGRAMMING APPROACH TO TESTING RESOURCE ALLOCATION PROBLEM FOR MODULAR SOFTWARE

Directory of Open Access Journals (Sweden)

P.K. Kapur

2003-02-01

Full Text Available Testing phase of a software begins with module testing. During this period modules are tested independently to remove maximum possible number of faults within a specified time limit or testing resource budget. This gives rise to some interesting optimization problems, which are discussed in this paper. Two Optimization models are proposed for optimal allocation of testing resources among the modules of a Software. In the first model, we maximize the total fault removal, subject to budgetary Constraint. In the second model, additional constraint representing aspiration level for fault removals for each module of the software is added. These models are solved using dynamic programming technique. The methods have been illustrated through numerical examples.

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.

Dynamic analysis program for frame structure

International Nuclear Information System (INIS)

Ando, Kozo; Chiba, Toshio

1975-01-01

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

Dynamic Approaches for Multichoice Solutions

Directory of Open Access Journals (Sweden)

Yu-Hsien Liao

2011-01-01

Full Text Available Based on alternative reduced games, several dynamic approaches are proposed to show how the three extended Shapley values can be reached dynamically from arbitrary efficient payoff vectors on multichoice games.

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

DEFF Research Database (Denmark)

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

2017-01-01

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

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

International Nuclear Information System (INIS)

Hunter, J.A.

1984-01-01

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

Dual Dynamic Programming - DDP

International Nuclear Information System (INIS)

Velasquez Bermudez, Jesus M

1998-01-01

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

Implementing corporate wellness programs: a business approach to program planning.

Science.gov (United States)

Helmer, D C; Dunn, L M; Eaton, K; Macedonio, C; Lubritz, L

1995-11-01

1. Support of key decision makers is critical to the successful implementation of a corporate wellness program. Therefore, the program implementation plan must be communicated in a format and language readily understood by business people. 2. A business approach to corporate wellness program planning provides a standardized way to communicate the implementation plan. 3. A business approach incorporates the program planning components in a format that ranges from general to specific. This approach allows for flexibility and responsiveness to changes in program planning. 4. Components of the business approach are the executive summary, purpose, background, ground rules, approach, requirements, scope of work, schedule, and financials.

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

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

. 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...... to head-dependent pumping costs. These dynamic pumping costs strongly affect the total costs and can lead to non-convexity of the future cost function. The water user groups (agriculture, industry, domestic) are characterized by inelastic demands and fixed water allocation and water supply curtailment...

Approximate dynamic programming approaches for appointment scheduling with patient preferences.

Science.gov (United States)

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

2018-04-01

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

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

The application of dynamic programming in production planning

Science.gov (United States)

Wu, Run

2017-05-01

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

Optimization of Algorithms Using Extensions of Dynamic Programming

KAUST Repository

AbouEisha, Hassan M.

2017-04-09

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

Automatic programming via iterated local search for dynamic job shop scheduling.

Science.gov (United States)

Nguyen, Su; Zhang, Mengjie; Johnston, Mark; Tan, Kay Chen

2015-01-01

Dispatching rules have been commonly used in practice for making sequencing and scheduling decisions. Due to specific characteristics of each manufacturing system, there is no universal dispatching rule that can dominate in all situations. Therefore, it is important to design specialized dispatching rules to enhance the scheduling performance for each manufacturing environment. Evolutionary computation approaches such as tree-based genetic programming (TGP) and gene expression programming (GEP) have been proposed to facilitate the design task through automatic design of dispatching rules. However, these methods are still limited by their high computational cost and low exploitation ability. To overcome this problem, we develop a new approach to automatic programming via iterated local search (APRILS) for dynamic job shop scheduling. The key idea of APRILS is to perform multiple local searches started with programs modified from the best obtained programs so far. The experiments show that APRILS outperforms TGP and GEP in most simulation scenarios in terms of effectiveness and efficiency. The analysis also shows that programs generated by APRILS are more compact than those obtained by genetic programming. An investigation of the behavior of APRILS suggests that the good performance of APRILS comes from the balance between exploration and exploitation in its search mechanism.

Stockpile strategy for China's emergency oil reserve: A dynamic programming approach

International Nuclear Information System (INIS)

Bai, Y.; Dahl, C.A.; Zhou, D.Q.; Zhou, P.

2014-01-01

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%

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.

MyDTW - Dynamic Time Warping program for stratigraphical time series

Science.gov (United States)

Kotov, Sergey; Paelike, Heiko

2017-04-01

One of the general tasks in many geological disciplines is matching of one time or space signal to another. It can be classical correlation between two cores or cross-sections in sedimentology or marine geology. For example, tuning a paleoclimatic signal to a target curve, driven by variations in the astronomical parameters, is a powerful technique to construct accurate time scales. However, these methods can be rather time-consuming and can take ours of routine work even with the help of special semi-automatic software. Therefore, different approaches to automate the processes have been developed during last decades. Some of them are based on classical statistical cross-correlations such as the 'Correlator' after Olea [1]. Another ones use modern ideas of dynamic programming. A good example is as an algorithm developed by Lisiecki and Lisiecki [2] or dynamic time warping based algorithm after Pälike [3]. We introduce here an algorithm and computer program, which are also stemmed from the Dynamic Time Warping algorithm class. Unlike the algorithm of Lisiecki and Lisiecki, MyDTW does not lean on a set of penalties to follow geological logics, but on a special internal structure and specific constrains. It differs also from [3] in basic ideas of implementation and constrains design. The algorithm is implemented as a computer program with a graphical user interface using Free Pascal and Lazarus IDE and available for Windows, Mac OS, and Linux. Examples with synthetic and real data are demonstrated. Program is available for free download at http://www.marum.de/Sergey_Kotov.html . References: 1. Olea, R.A. Expert systems for automated correlation and interpretation of wireline logs // Math Geol (1994) 26: 879. doi:10.1007/BF02083420 2. Lisiecki L. and Lisiecki P. Application of dynamic programming to the correlation of paleoclimate records // Paleoceanography (2002), Volume 17, Issue 4, pp. 1-1, CiteID 1049, doi: 10.1029/2001PA000733 3. Pälike, H. Extending the

Dynamic electricity pricing—Which programs do consumers prefer?

International Nuclear Information System (INIS)

Dütschke, Elisabeth; Paetz, Alexandra-Gwyn

2013-01-01

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

Handling movement epenthesis and hand segmentation ambiguities in continuous sign language recognition using nested dynamic programming.

Science.gov (United States)

Yang, Ruiduo; Sarkar, Sudeep; Loeding, Barbara

2010-03-01

We consider two crucial problems in continuous sign language recognition from unaided video sequences. At the sentence level, we consider the movement epenthesis (me) problem and at the feature level, we consider the problem of hand segmentation and grouping. We construct a framework that can handle both of these problems based on an enhanced, nested version of the dynamic programming approach. To address movement epenthesis, a dynamic programming (DP) process employs a virtual me option that does not need explicit models. We call this the enhanced level building (eLB) algorithm. This formulation also allows the incorporation of grammar models. Nested within this eLB is another DP that handles the problem of selecting among multiple hand candidates. We demonstrate our ideas on four American Sign Language data sets with simple background, with the signer wearing short sleeves, with complex background, and across signers. We compared the performance with Conditional Random Fields (CRF) and Latent Dynamic-CRF-based approaches. The experiments show more than 40 percent improvement over CRF or LDCRF approaches in terms of the frame labeling rate. We show the flexibility of our approach when handling a changing context. We also find a 70 percent improvement in sign recognition rate over the unenhanced DP matching algorithm that does not accommodate the me effect.

A Stereo Dual-Channel Dynamic Programming Algorithm for UAV Image Stitching.

Science.gov (United States)

Li, Ming; Chen, Ruizhi; Zhang, Weilong; Li, Deren; Liao, Xuan; Wang, Lei; Pan, Yuanjin; Zhang, Peng

2017-09-08

Dislocation is one of the major challenges in unmanned aerial vehicle (UAV) image stitching. In this paper, we propose a new algorithm for seamlessly stitching UAV images based on a dynamic programming approach. Our solution consists of two steps: Firstly, an image matching algorithm is used to correct the images so that they are in the same coordinate system. Secondly, a new dynamic programming algorithm is developed based on the concept of a stereo dual-channel energy accumulation. A new energy aggregation and traversal strategy is adopted in our solution, which can find a more optimal seam line for image stitching. Our algorithm overcomes the theoretical limitation of the classical Duplaquet algorithm. Experiments show that the algorithm can effectively solve the dislocation problem in UAV image stitching, especially for the cases in dense urban areas. Our solution is also direction-independent, which has better adaptability and robustness for stitching images.

Fluid dynamics computer programs for NERVA turbopump

Science.gov (United States)

Brunner, J. J.

1972-01-01

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

Fission fragment distributions within dynamical approach

Energy Technology Data Exchange (ETDEWEB)

Mazurek, K. [Institute of Nuclear, Physics Polish Academy of Sciences, Krakow (Poland); Nadtochy, P.N. [Omsk State Technical University, Omsk (Russian Federation); Ryabov, E.G.; Adeev, G.D. [Omsk State University, Physics Department, Omsk (Russian Federation)

2017-04-15

The review covers recent developments and achievements in the dynamical description of fission process at high excitation energy. It is shown that the dynamical approach based on multidimensional Langevin equations combined with the statistical description of nuclear decay by particles evaporation is capable of fairly well describing the formation of fission fragment mass-energy, charge, and angular distributions of fission fragments in coincidence with the pre- and post-scission particle emission. The final yields of fission and evaporation residues channels products could be obtained. The detailed description of fission dynamics allows studying different stages of fission process, indicating the most important ingredients governing fission process and studying in detail such fundamental nuclear properties as nuclear viscosity and fission timescale. The tasks and perspectives of multidimensional dynamical approach are also discussed. (orig.)

Dynamic programming models and applications

CERN Document Server

Denardo, Eric V

2003-01-01

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

A constructive approach to gene expression dynamics

International Nuclear Information System (INIS)

Ochiai, T.; Nacher, J.C.; Akutsu, T.

2004-01-01

Recently, experiments on mRNA abundance (gene expression) have revealed that gene expression shows a stationary organization described by a scale-free distribution. Here we propose a constructive approach to gene expression dynamics which restores the scale-free exponent and describes the intermediate state dynamics. This approach requires only one assumption: Markov property

DYNAMIC PROGRAMMING – EFFICIENT TOOL FOR POWER SYSTEM EXPANSION PLANNING

Directory of Open Access Journals (Sweden)

SIMO A.

2015-03-01

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

Dynamic Programming: An Introduction by Example

Science.gov (United States)

Zietz, Joachim

2007-01-01

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

A dynamical-systems approach for computing ice-affected streamflow

Science.gov (United States)

Holtschlag, David J.

1996-01-01

A dynamical-systems approach was developed and evaluated for computing ice-affected streamflow. The approach provides for dynamic simulation and parameter estimation of site-specific equations relating ice effects to routinely measured environmental variables. Comparison indicates that results from the dynamical-systems approach ranked higher than results from 11 analytical methods previously investigated on the basis of accuracy and feasibility criteria. Additional research will likely lead to further improvements in the approach.

Dynamics of Financial System: A System Dynamics Approach

OpenAIRE

Girish K. Nair; Lewlyn Lester Raj Rodrigues

2013-01-01

There are several ratios which define the financial health of an organization but the importance of Net cash flow, Gross income, Net income, Pending bills, Receivable bills, Debt, and Book value can never be undermined as they give the exact picture of the financial condition. While there are several approaches to study the dynamics of these variables, system dynamics based modelling and simulation is one of the modern techniques. The paper explores this method to simulate the before mentione...

A short note on dynamic programming in a band.

Science.gov (United States)

Gibrat, Jean-François

2018-06-15

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

Identification of time-varying structural dynamic systems - An artificial intelligence approach

Science.gov (United States)

Glass, B. J.; Hanagud, S.

1992-01-01

An application of the artificial intelligence-derived methodologies of heuristic search and object-oriented programming to the problem of identifying the form of the model and the associated parameters of a time-varying structural dynamic system is presented in this paper. Possible model variations due to changes in boundary conditions or configurations of a structure are organized into a taxonomy of models, and a variant of best-first search is used to identify the model whose simulated response best matches that of the current physical structure. Simulated model responses are verified experimentally. An output-error approach is used in a discontinuous model space, and an equation-error approach is used in the parameter space. The advantages of the AI methods used, compared with conventional programming techniques for implementing knowledge structuring and inheritance, are discussed. Convergence conditions and example problems have been discussed. In the example problem, both the time-varying model and its new parameters have been identified when changes occur.

Stochastic control theory dynamic programming principle

CERN Document Server

Nisio, Makiko

2015-01-01

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

Demand side management scheme in smart grid with cloud computing approach using stochastic dynamic programming

Directory of Open Access Journals (Sweden)

S. Sofana Reka

2016-09-01

Full Text Available This paper proposes a cloud computing framework in smart grid environment by creating small integrated energy hub supporting real time computing for handling huge storage of data. A stochastic programming approach model is developed with cloud computing scheme for effective demand side management (DSM in smart grid. Simulation results are obtained using GUI interface and Gurobi optimizer in Matlab in order to reduce the electricity demand by creating energy networks in a smart hub approach.

A Dynamic Programming Approach for Base Station Sleeping in Cellular Networks

Science.gov (United States)

Gong, Jie; Zhou, Sheng; Niu, Zhisheng

The energy consumption of the information and communication technology (ICT) industry, which has become a serious problem, is mostly due to the network infrastructure rather than the mobile terminals. In this paper, we focus on reducing the energy consumption of base stations (BSs) by adjusting their working modes (active or sleep). Specifically, the objective is to minimize the energy consumption while satisfying quality of service (QoS, e.g., blocking probability) requirement and, at the same time, avoiding frequent mode switching to reduce signaling and delay overhead. The problem is modeled as a dynamic programming (DP) problem, which is NP-hard in general. Based on cooperation among neighboring BSs, a low-complexity algorithm is proposed to reduce the size of state space as well as that of action space. Simulations demonstrate that, with the proposed algorithm, the active BS pattern well meets the time variation and the non-uniform spatial distribution of system traffic. Moreover, the tradeoff between the energy saving from BS sleeping and the cost of switching is well balanced by the proposed scheme.

A Unified Approach to Modeling and Programming

DEFF Research Database (Denmark)

Madsen, Ole Lehrmann; Møller-Pedersen, Birger

2010-01-01

of this paper is to go back to the future and get inspiration from SIMULA and propose a unied approach. In addition to reintroducing the contributions of SIMULA and the Scandinavian approach to object-oriented programming, we do this by discussing a number of issues in modeling and programming and argue3 why we......SIMULA was a language for modeling and programming and provided a unied approach to modeling and programming in contrast to methodologies based on structured analysis and design. The current development seems to be going in the direction of separation of modeling and programming. The goal...

Direct heuristic dynamic programming for damping oscillations in a large power system.

Science.gov (United States)

Lu, Chao; Si, Jennie; Xie, Xiaorong

2008-08-01

This paper applies a neural-network-based approximate dynamic programming method, namely, the direct heuristic dynamic programming (direct HDP), to a large power system stability control problem. The direct HDP is a learning- and approximation-based approach to addressing nonlinear coordinated control under uncertainty. One of the major design parameters, the controller learning objective function, is formulated to directly account for network-wide low-frequency oscillation with the presence of nonlinearity, uncertainty, and coupling effect among system components. Results include a novel learning control structure based on the direct HDP with applications to two power system problems. The first case involves static var compensator supplementary damping control, which is used to provide a comprehensive evaluation of the learning control performance. The second case aims at addressing a difficult complex system challenge by providing a new solution to a large interconnected power network oscillation damping control problem that frequently occurs in the China Southern Power Grid.

A dynamic model of functioning of a bank

Science.gov (United States)

Malafeyev, Oleg; Awasthi, Achal; Zaitseva, Irina; Rezenkov, Denis; Bogdanova, Svetlana

2018-04-01

In this paper, we analyze dynamic programming as a novel approach to solve the problem of maximizing the profits of a bank. The mathematical model of the problem and the description of bank's work is described in this paper. The problem is then approached using the method of dynamic programming. Dynamic programming makes sure that the solutions obtained are globally optimal and numerically stable. The optimization process is set up as a discrete multi-stage decision process and solved with the help of dynamic programming.

Thermosphere-ionosphere-mesosphere energetics and dynamics (TIMED). The TIMED mission and science program report of the science definition team. Volume 1: Executive summary

Science.gov (United States)

1991-01-01

A Science Definition Team was established in December 1990 by the Space Physics Division, NASA, to develop a satellite program to conduct research on the energetics, dynamics, and chemistry of the mesosphere and lower thermosphere/ionosphere. This two-volume publication describes the TIMED (Thermosphere-Ionosphere-Mesosphere, Energetics and Dynamics) mission and associated science program. The report outlines the scientific objectives of the mission, the program requirements, and the approach towards meeting these requirements.

A dynamic approach for the optimal electricity dispatch in the deregulated market

International Nuclear Information System (INIS)

Carraretto, Cristian; Lazzaretto, Andrea

2004-01-01

The electricity market has been experiencing the deregulation process in many countries. Effective approaches to the management of single power plants or groups of plants are therefore becoming crucial for the competitiveness of energy utilities. A dynamic programming approach is presented in this paper for the optimal plant management in the new Italian deregulated market. A thorough description of the method is given in cases of free or fixed production over time (e.g. when the overall production is limited by bilateral contracts or cogeneration). Analysis of market characteristics, detailed thermodynamic models of plant operation and reliable price forecasts over the time period of interest are required. The suggested approach is useful for both long-term scheduling and planning daily offers in the market

General Dynamics Convair Division approach to structural analysis of large superconducting coils

International Nuclear Information System (INIS)

Baldi, R.W.

1979-01-01

This paper describes the overall integrated analysis approach and highlights the results obtained. Most of the procedures and techniques described were developed over the past three years. Starting in late 1976, development began on high-accuracy computer codes for electromagnetic field and force analysis. This effort resulted in completion of a family of computer programs called MAGIC (MAGnetic Integration Calculation). Included in this group of programs is a post-processor called POSTMAGIC that links MAGIC to GDSAP (General Dynamics Structural Analysis Program) by automatically transferring force data. Integrating these computer programs afforded us the capability to readily analyze several different conditions that are anticipated to occur during tokamak operation. During 1977 we initiated the development of the CONVERT program that effectively links our THERMAL ANALYZER program to GDSAP by automatically transferring temperature data. The CONVERT program allowed us the capability to readily predict thermal stresses at several different time phases during the computer-simulated cooldown and warmup cycle. This feature aided us in determining the most crucial time phases and to adjust recommended operating procedure to minimize risk. (orig.)

An integrated approach to strategic planning in the civilian high-level radioactive waste management program

International Nuclear Information System (INIS)

Sprecher, W.M.; Katz, J.; Redmond, R.J.

1992-01-01

This paper describes the approach that the Office of Civilian Radioactive Waste Management (OCRWM) of the Department of Energy (DOE) is taking to the task of strategic planning for the civilian high-level radioactive waste management program. It highlights selected planning products and activities that have emerged over the past year. It demonstrates that this approach is an integrated one, both in the sense of being systematic on the program level but also as a component of DOE strategic planning efforts. Lastly, it indicates that OCRWM strategic planning takes place in a dynamic environment and consequently is a process that is still evolving in response to the demands placed upon it

Creative-Dynamics Approach To Neural Intelligence

Science.gov (United States)

Zak, Michail A.

1992-01-01

Paper discusses approach to mathematical modeling of artificial neural networks exhibiting complicated behaviors reminiscent of creativity and intelligence of biological neural networks. Neural network treated as non-Lipschitzian dynamical system - as described in "Non-Lipschitzian Dynamics For Modeling Neural Networks" (NPO-17814). System serves as tool for modeling of temporal-pattern memories and recognition of complicated spatial patterns.

Noninvasive fetal QRS detection using an echo state network and dynamic programming.

Science.gov (United States)

Lukoševičius, Mantas; Marozas, Vaidotas

2014-08-01

We address a classical fetal QRS detection problem from abdominal ECG recordings with a data-driven statistical machine learning approach. Our goal is to have a powerful, yet conceptually clean, solution. There are two novel key components at the heart of our approach: an echo state recurrent neural network that is trained to indicate fetal QRS complexes, and several increasingly sophisticated versions of statistics-based dynamic programming algorithms, which are derived from and rooted in probability theory. We also employ a standard technique for preprocessing and removing maternal ECG complexes from the signals, but do not take this as the main focus of this work. The proposed approach is quite generic and can be extended to other types of signals and annotations. Open-source code is provided.

Modelling of windmill induction generators in dynamic simulation programs

DEFF Research Database (Denmark)

Akhmatov, Vladislav; Knudsen, Hans

1999-01-01

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

A dynamic approach to vehicle scheduling

NARCIS (Netherlands)

D. Huisman (Dennis); R. Freling (Richard); A.P.M. Wagelmans (Albert)

2001-01-01

textabstractThis paper presents a dynamic approach to the vehicle scheduling problem. We discuss the potential benefit of our approach compared to the traditional one, where the vehicle scheduling problem is solved only once for a whole period and the travel times are assumed to be fixed. In our

Upper atmosphere research satellite program. [to study the chemistry energetics, and dynamics

Science.gov (United States)

Huntress, W. T., Jr.

1978-01-01

A satellite program to conduct research on the chemistry, energetics, and dynamics of the upper atmosphere was developed. The scientific goals of the Upper Atmospheric Research Program, the program requirements, and the approach toward meeting those requirements are outlined. An initial series of two overlapping spacecraft missions is described. Both spacecraft are launched and recovered by the STS, one in the winter of 1983 at a 56 deg inclination, and the other a year later at a 70 deg inclination. The duration of each mission is 18 months, and each carries instruments to make global measurements of the temperature, winds, composition, irradation, and radiance in the stratosphere, mesosphere, and lower thermosphere between the tropopause and 120 km altitude. The program requires a dedicated ground-based data system and a science team organization that leads to a strong interaction between the experiments and theory. The program includes supportive observations from other platforms such as rockets, balloons, and the Spacelab.

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

NARCIS (Netherlands)

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

2013-01-01

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

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

African Journals Online (AJOL)

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

Which Introductory Programming Approach Is Most Suitable for Students: Procedural or Visual Programming?

Science.gov (United States)

Eid, Chaker; Millham, Richard

2012-01-01

In this paper, we discuss the visual programming approach to teaching introductory programming courses and then compare this approach with that of procedural programming. The involved cognitive levels of students, as beginning students are introduced to different types of programming concepts, are correlated to the learning processes of…

Noninvasive fetal QRS detection using an echo state network and dynamic programming

International Nuclear Information System (INIS)

Lukoševičius, Mantas; Marozas, Vaidotas

2014-01-01

We address a classical fetal QRS detection problem from abdominal ECG recordings with a data-driven statistical machine learning approach. Our goal is to have a powerful, yet conceptually clean, solution. There are two novel key components at the heart of our approach: an echo state recurrent neural network that is trained to indicate fetal QRS complexes, and several increasingly sophisticated versions of statistics-based dynamic programming algorithms, which are derived from and rooted in probability theory. We also employ a standard technique for preprocessing and removing maternal ECG complexes from the signals, but do not take this as the main focus of this work. The proposed approach is quite generic and can be extended to other types of signals and annotations. Open-source code is provided. (paper)

Bellman's GAP--a language and compiler for dynamic programming in sequence analysis.

Science.gov (United States)

Sauthoff, Georg; Möhl, Mathias; Janssen, Stefan; Giegerich, Robert

2013-03-01

Dynamic programming is ubiquitous in bioinformatics. Developing and implementing non-trivial dynamic programming algorithms is often error prone and tedious. Bellman's GAP is a new programming system, designed to ease the development of bioinformatics tools based on the dynamic programming technique. In Bellman's GAP, dynamic programming algorithms are described in a declarative style by tree grammars, evaluation algebras and products formed thereof. This bypasses the design of explicit dynamic programming recurrences and yields programs that are free of subscript errors, modular and easy to modify. The declarative modules are compiled into C++ code that is competitive to carefully hand-crafted implementations. This article introduces the Bellman's GAP system and its language, GAP-L. It then demonstrates the ease of development and the degree of re-use by creating variants of two common bioinformatics algorithms. Finally, it evaluates Bellman's GAP as an implementation platform of 'real-world' bioinformatics tools. Bellman's GAP is available under GPL license from http://bibiserv.cebitec.uni-bielefeld.de/bellmansgap. This Web site includes a repository of re-usable modules for RNA folding based on thermodynamics.

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

Science.gov (United States)

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

2013-01-01

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

Evaluation of Electric Power Procurement Strategies by Stochastic Dynamic Programming

Science.gov (United States)

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

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

Rule of Thumb and Dynamic Programming

NARCIS (Netherlands)

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

1995-01-01

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

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.

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

Energy Technology Data Exchange (ETDEWEB)

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

2015-11-30

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

Developmental Programming of Renal Function and Re-Programming Approaches.

Science.gov (United States)

Nüsken, Eva; Dötsch, Jörg; Weber, Lutz T; Nüsken, Kai-Dietrich

2018-01-01

Chronic kidney disease affects more than 10% of the population. Programming studies have examined the interrelationship between environmental factors in early life and differences in morbidity and mortality between individuals. A number of important principles has been identified, namely permanent structural modifications of organs and cells, long-lasting adjustments of endocrine regulatory circuits, as well as altered gene transcription. Risk factors include intrauterine deficiencies by disturbed placental function or maternal malnutrition, prematurity, intrauterine and postnatal stress, intrauterine and postnatal overnutrition, as well as dietary dysbalances in postnatal life. This mini-review discusses critical developmental periods and long-term sequelae of renal programming in humans and presents studies examining the underlying mechanisms as well as interventional approaches to "re-program" renal susceptibility toward disease. Clinical manifestations of programmed kidney disease include arterial hypertension, proteinuria, aggravation of inflammatory glomerular disease, and loss of kidney function. Nephron number, regulation of the renin-angiotensin-aldosterone system, renal sodium transport, vasomotor and endothelial function, myogenic response, and tubuloglomerular feedback have been identified as being vulnerable to environmental factors. Oxidative stress levels, metabolic pathways, including insulin, leptin, steroids, and arachidonic acid, DNA methylation, and histone configuration may be significantly altered by adverse environmental conditions. Studies on re-programming interventions focused on dietary or anti-oxidative approaches so far. Further studies that broaden our understanding of renal programming mechanisms are needed to ultimately develop preventive strategies. Targeted re-programming interventions in animal models focusing on known mechanisms will contribute to new concepts which finally will have to be translated to human application. Early

Functional integral approach to classical statistical dynamics

International Nuclear Information System (INIS)

Jensen, R.V.

1980-04-01

A functional integral method is developed for the statistical solution of nonlinear stochastic differential equations which arise in classical dynamics. The functional integral approach provides a very natural and elegant derivation of the statistical dynamical equations that have been derived using the operator formalism of Martin, Siggia, and Rose

Final Report from The University of Texas at Austin for DEGAS: Dynamic Global Address Space programming environments

Energy Technology Data Exchange (ETDEWEB)

Erez, Mattan

2018-02-21

The Dynamic, Exascale Global Address Space programming environment (DEGAS) project will develop the next generation of programming models and runtime systems to meet the challenges of Exascale computing. Our approach is to provide an efficient and scalable programming model that can be adapted to application needs through the use of dynamic runtime features and domain-specific languages for computational kernels. We address the following technical challenges: Programmability: Rich set of programming constructs based on a Hierarchical Partitioned Global Address Space (HPGAS) model, demonstrated in UPC++. Scalability: Hierarchical locality control, lightweight communication (extended GASNet), and ef- ficient synchronization mechanisms (Phasers). Performance Portability: Just-in-time specialization (SEJITS) for generating hardware-specific code and scheduling libraries for domain-specific adaptive runtimes (Habanero). Energy Efficiency: Communication-optimal code generation to optimize energy efficiency by re- ducing data movement. Resilience: Containment Domains for flexible, domain-specific resilience, using state capture mechanisms and lightweight, asynchronous recovery mechanisms. Interoperability: Runtime and language interoperability with MPI and OpenMP to encourage broad adoption.

Electric generating capacity planning: A nonlinear programming approach

Energy Technology Data Exchange (ETDEWEB)

Yakin, M.Z.; McFarland, J.W.

1987-02-01

This paper presents a nonlinear programming approach for long-range generating capacity expansion planning in electrical power systems. The objective in the model is the minimization of total cost consisting of investment cost plus generation cost for a multi-year planning horizon. Reliability constraints are imposed by using standard and practical reserve margin requirements. State equations representing the dynamic aspect of the problem are included. The electricity demand (load) and plant availabilities are treated as random variables, and the method of cumulants is used to calculate the expected energy generated by each plant in each year of the planning horizon. The resulting model has a (highly) nonlinear objective function and linear constraints. The planning model is solved over the multiyear planning horizon instead of decomposing it into one-year period problems. This approach helps the utility decision maker to carry out extensive sensitivity analysis easily. A case study example is provided using EPRI test data. Relationships among the reserve margin, total cost and surplus energy generating capacity over the planning horizon are explored by analyzing the model.

Stochastic optimization in insurance a dynamic programming approach

CERN Document Server

Azcue, Pablo

2014-01-01

The main purpose of the book is to show how a viscosity approach can be used to tackle control problems in insurance. The problems covered are the maximization of survival probability as well as the maximization of dividends in the classical collective risk model. The authors consider the possibility of controlling the risk process by reinsurance as well as by investments. They show that optimal value functions are characterized as either the unique or the smallest viscosity solution of the associated Hamilton-Jacobi-Bellman equation; they also study the structure of the optimal strategies and show how to find them. The viscosity approach was widely used in control problems related to mathematical finance but until quite recently it was not used to solve control problems related to actuarial mathematical science. This book is designed to familiarize the reader on how to use this approach. The intended audience is graduate students as well as researchers in this area.

Developmental Programming of Renal Function and Re-Programming Approaches

Science.gov (United States)

Nüsken, Eva; Dötsch, Jörg; Weber, Lutz T.; Nüsken, Kai-Dietrich

2018-01-01

Chronic kidney disease affects more than 10% of the population. Programming studies have examined the interrelationship between environmental factors in early life and differences in morbidity and mortality between individuals. A number of important principles has been identified, namely permanent structural modifications of organs and cells, long-lasting adjustments of endocrine regulatory circuits, as well as altered gene transcription. Risk factors include intrauterine deficiencies by disturbed placental function or maternal malnutrition, prematurity, intrauterine and postnatal stress, intrauterine and postnatal overnutrition, as well as dietary dysbalances in postnatal life. This mini-review discusses critical developmental periods and long-term sequelae of renal programming in humans and presents studies examining the underlying mechanisms as well as interventional approaches to “re-program” renal susceptibility toward disease. Clinical manifestations of programmed kidney disease include arterial hypertension, proteinuria, aggravation of inflammatory glomerular disease, and loss of kidney function. Nephron number, regulation of the renin–angiotensin–aldosterone system, renal sodium transport, vasomotor and endothelial function, myogenic response, and tubuloglomerular feedback have been identified as being vulnerable to environmental factors. Oxidative stress levels, metabolic pathways, including insulin, leptin, steroids, and arachidonic acid, DNA methylation, and histone configuration may be significantly altered by adverse environmental conditions. Studies on re-programming interventions focused on dietary or anti-oxidative approaches so far. Further studies that broaden our understanding of renal programming mechanisms are needed to ultimately develop preventive strategies. Targeted re-programming interventions in animal models focusing on known mechanisms will contribute to new concepts which finally will have to be translated to human application

Seismic safety margins research program. Phase I. Project VII: systems analysis specifications of computational approach

International Nuclear Information System (INIS)

Collins, J.D.; Hudson, J.M.; Chrostowski, J.D.

1979-02-01

A computational methodology is presented for the prediction of core melt probabilities in a nuclear power plant due to earthquake events. The proposed model has four modules: seismic hazard, structural dynamic (including soil-structure interaction), component failure and core melt sequence. The proposed modules would operate in series and would not have to be operated at the same time. The basic statistical approach uses a Monte Carlo simulation to treat random and systematic error but alternate statistical approaches are permitted by the program design

Engineering system dynamics a unified graph-centered approach

CERN Document Server

Brown, Forbes T

2006-01-01

For today's students, learning to model the dynamics of complex systems is increasingly important across nearly all engineering disciplines. First published in 2001, Forbes T. Brown's Engineering System Dynamics: A Unified Graph-Centered Approach introduced students to a unique and highly successful approach to modeling system dynamics using bond graphs. Updated with nearly one-third new material, this second edition expands this approach to an even broader range of topics. What's New in the Second Edition? In addition to new material, this edition was restructured to build students' competence in traditional linear mathematical methods before they have gone too far into the modeling that still plays a pivotal role. New topics include magnetic circuits and motors including simulation with magnetic hysteresis; extensive new material on the modeling, analysis, and simulation of distributed-parameter systems; kinetic energy in thermodynamic systems; and Lagrangian and Hamiltonian methods. MATLAB(R) figures promi...

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

Air-Breathing Hypersonic Vehicle Tracking Control Based on Adaptive Dynamic Programming.

Science.gov (United States)

Mu, Chaoxu; Ni, Zhen; Sun, Changyin; He, Haibo

2017-03-01

In this paper, we propose a data-driven supplementary control approach with adaptive learning capability for air-breathing hypersonic vehicle tracking control based on action-dependent heuristic dynamic programming (ADHDP). The control action is generated by the combination of sliding mode control (SMC) and the ADHDP controller to track the desired velocity and the desired altitude. In particular, the ADHDP controller observes the differences between the actual velocity/altitude and the desired velocity/altitude, and then provides a supplementary control action accordingly. The ADHDP controller does not rely on the accurate mathematical model function and is data driven. Meanwhile, it is capable to adjust its parameters online over time under various working conditions, which is very suitable for hypersonic vehicle system with parameter uncertainties and disturbances. We verify the adaptive supplementary control approach versus the traditional SMC in the cruising flight, and provide three simulation studies to illustrate the improved performance with the proposed approach.

Dynamic traffic assignment : genetic algorithms approach

Science.gov (United States)

1997-01-01

Real-time route guidance is a promising approach to alleviating congestion on the nations highways. A dynamic traffic assignment model is central to the development of guidance strategies. The artificial intelligence technique of genetic algorithm...

QoS Differential Scheduling in Cognitive-Radio-Based Smart Grid Networks: An Adaptive Dynamic Programming Approach.

Science.gov (United States)

Yu, Rong; Zhong, Weifeng; Xie, Shengli; Zhang, Yan; Zhang, Yun

2016-02-01

As the next-generation power grid, smart grid will be integrated with a variety of novel communication technologies to support the explosive data traffic and the diverse requirements of quality of service (QoS). Cognitive radio (CR), which has the favorable ability to improve the spectrum utilization, provides an efficient and reliable solution for smart grid communications networks. In this paper, we study the QoS differential scheduling problem in the CR-based smart grid communications networks. The scheduler is responsible for managing the spectrum resources and arranging the data transmissions of smart grid users (SGUs). To guarantee the differential QoS, the SGUs are assigned to have different priorities according to their roles and their current situations in the smart grid. Based on the QoS-aware priority policy, the scheduler adjusts the channels allocation to minimize the transmission delay of SGUs. The entire transmission scheduling problem is formulated as a semi-Markov decision process and solved by the methodology of adaptive dynamic programming. A heuristic dynamic programming (HDP) architecture is established for the scheduling problem. By the online network training, the HDP can learn from the activities of primary users and SGUs, and adjust the scheduling decision to achieve the purpose of transmission delay minimization. Simulation results illustrate that the proposed priority policy ensures the low transmission delay of high priority SGUs. In addition, the emergency data transmission delay is also reduced to a significantly low level, guaranteeing the differential QoS in smart grid.

Dynamic Programming and Error Estimates for Stochastic Control Problems with Maximum Cost

International Nuclear Information System (INIS)

Bokanowski, Olivier; Picarelli, Athena; Zidani, Hasnaa

2015-01-01

This work is concerned with stochastic optimal control for a running maximum cost. A direct approach based on dynamic programming techniques is studied leading to the characterization of the value function as the unique viscosity solution of a second order Hamilton–Jacobi–Bellman (HJB) equation with an oblique derivative boundary condition. A general numerical scheme is proposed and a convergence result is provided. Error estimates are obtained for the semi-Lagrangian scheme. These results can apply to the case of lookback options in finance. Moreover, optimal control problems with maximum cost arise in the characterization of the reachable sets for a system of controlled stochastic differential equations. Some numerical simulations on examples of reachable analysis are included to illustrate our approach

Dynamic Programming and Error Estimates for Stochastic Control Problems with Maximum Cost

Energy Technology Data Exchange (ETDEWEB)

Bokanowski, Olivier, E-mail: boka@math.jussieu.fr [Laboratoire Jacques-Louis Lions, Université Paris-Diderot (Paris 7) UFR de Mathématiques - Bât. Sophie Germain (France); Picarelli, Athena, E-mail: athena.picarelli@inria.fr [Projet Commands, INRIA Saclay & ENSTA ParisTech (France); Zidani, Hasnaa, E-mail: hasnaa.zidani@ensta.fr [Unité de Mathématiques appliquées (UMA), ENSTA ParisTech (France)

2015-02-15

This work is concerned with stochastic optimal control for a running maximum cost. A direct approach based on dynamic programming techniques is studied leading to the characterization of the value function as the unique viscosity solution of a second order Hamilton–Jacobi–Bellman (HJB) equation with an oblique derivative boundary condition. A general numerical scheme is proposed and a convergence result is provided. Error estimates are obtained for the semi-Lagrangian scheme. These results can apply to the case of lookback options in finance. Moreover, optimal control problems with maximum cost arise in the characterization of the reachable sets for a system of controlled stochastic differential equations. Some numerical simulations on examples of reachable analysis are included to illustrate our approach.

Conditions for characterizing the structure of optimal strategies in infinite-horizon dynamic programs

International Nuclear Information System (INIS)

Porteus, E.

1982-01-01

The study of infinite-horizon nonstationary dynamic programs using the operator approach is continued. The point of view here differs slightly from that taken by others, in that Denardo's local income function is not used as a starting point. Infinite-horizon values are defined as limits of finite-horizon values, as the horizons get long. Two important conditions of an earlier paper are weakened, yet the optimality equations, the optimality criterion, and the existence of optimal ''structured'' strategies are still obtained

Assessing the Dynamic Behavior of Online Q&A Knowledge Markets: A System Dynamics Approach

Science.gov (United States)

Jafari, Mostafa; Hesamamiri, Roozbeh; Sadjadi, Jafar; Bourouni, Atieh

2012-01-01

Purpose: The objective of this paper is to propose a holistic dynamic model for understanding the behavior of a complex and internet-based kind of knowledge market by considering both social and economic interactions. Design/methodology/approach: A system dynamics (SD) model is formulated in this study to investigate the dynamic characteristics of…

Developmental Programming of Renal Function and Re-Programming Approaches

Directory of Open Access Journals (Sweden)

Eva Nüsken

2018-02-01

Full Text Available Chronic kidney disease affects more than 10% of the population. Programming studies have examined the interrelationship between environmental factors in early life and differences in morbidity and mortality between individuals. A number of important principles has been identified, namely permanent structural modifications of organs and cells, long-lasting adjustments of endocrine regulatory circuits, as well as altered gene transcription. Risk factors include intrauterine deficiencies by disturbed placental function or maternal malnutrition, prematurity, intrauterine and postnatal stress, intrauterine and postnatal overnutrition, as well as dietary dysbalances in postnatal life. This mini-review discusses critical developmental periods and long-term sequelae of renal programming in humans and presents studies examining the underlying mechanisms as well as interventional approaches to “re-program” renal susceptibility toward disease. Clinical manifestations of programmed kidney disease include arterial hypertension, proteinuria, aggravation of inflammatory glomerular disease, and loss of kidney function. Nephron number, regulation of the renin–angiotensin–aldosterone system, renal sodium transport, vasomotor and endothelial function, myogenic response, and tubuloglomerular feedback have been identified as being vulnerable to environmental factors. Oxidative stress levels, metabolic pathways, including insulin, leptin, steroids, and arachidonic acid, DNA methylation, and histone configuration may be significantly altered by adverse environmental conditions. Studies on re-programming interventions focused on dietary or anti-oxidative approaches so far. Further studies that broaden our understanding of renal programming mechanisms are needed to ultimately develop preventive strategies. Targeted re-programming interventions in animal models focusing on known mechanisms will contribute to new concepts which finally will have to be translated

The READY program: Building a global potential energy surface and reactive dynamic simulations for the hydrogen combustion.

Science.gov (United States)

Mogo, César; Brandão, João

2014-06-30

READY (REActive DYnamics) is a program for studying reactive dynamic systems using a global potential energy surface (PES) built from previously existing PESs corresponding to each of the most important elementary reactions present in the system. We present an application to the combustion dynamics of a mixture of hydrogen and oxygen using accurate PESs for all the systems involving up to four oxygen and hydrogen atoms. Results at the temperature of 4000 K and pressure of 2 atm are presented and compared with model based on rate constants. Drawbacks and advantages of this approach are discussed and future directions of research are pointed out. Copyright © 2014 Wiley Periodicals, Inc.

Skin tumor area extraction using an improved dynamic programming approach.

Science.gov (United States)

Abbas, Qaisar; Celebi, M E; Fondón García, Irene

2012-05-01

Border (B) description of melanoma and other pigmented skin lesions is one of the most important tasks for the clinical diagnosis of dermoscopy images using the ABCD rule. For an accurate description of the border, there must be an effective skin tumor area extraction (STAE) method. However, this task is complicated due to uneven illumination, artifacts present in the lesions and smooth areas or fuzzy borders of the desired regions. In this paper, a novel STAE algorithm based on improved dynamic programming (IDP) is presented. The STAE technique consists of the following four steps: color space transform, pre-processing, rough tumor area detection and refinement of the segmented area. The procedure is performed in the CIE L(*) a(*) b(*) color space, which is approximately uniform and is therefore related to dermatologist's perception. After pre-processing the skin lesions to reduce artifacts, the DP algorithm is improved by introducing a local cost function, which is based on color and texture weights. The STAE method is tested on a total of 100 dermoscopic images. In order to compare the performance of STAE with other state-of-the-art algorithms, various statistical measures based on dermatologist-drawn borders are utilized as a ground truth. The proposed method outperforms the others with a sensitivity of 96.64%, a specificity of 98.14% and an error probability of 5.23%. The results demonstrate that this STAE method by IDP is an effective solution when compared with other state-of-the-art segmentation techniques. The proposed method can accurately extract tumor borders in dermoscopy images. © 2011 John Wiley & Sons A/S.

DYNAMICS OF FINANCIAL SYSTEM: A SYSTEM DYNAMICS APPROACH

Directory of Open Access Journals (Sweden)

Girish K Nair

2013-01-01

Full Text Available There are several ratios which define the financial health of an organization but the importance of Net cash flow, Gross income, Net income, Pending bills, Receivable bills, Debt, and Book value can never be undermined as they give the exact picture of the financial condition. While there are several approaches to study the dynamics of these variables, system dynamics based modelling and simulation is one of the modern techniques. The paper explores this method to simulate the before mentioned parameters during production capacity expansion in an electronic industry. Debt and Book value have shown a non-linear pattern of variation which is discussed. The model can be used by the financial experts as a decision support tool in arriving at conclusions in connection to the expansion plans of the organization.

A user's guide to the Flexible Spacecraft Dynamics and Control Program

Science.gov (United States)

Fedor, J. V.

1984-01-01

A guide to the use of the Flexible Spacecraft Dynamics Program (FSD) is presented covering input requirements, control words, orbit generation, spacecraft description and simulation options, and output definition. The program can be used in dynamics and control analysis as well as in orbit support of deployment and control of spacecraft. The program is applicable to inertially oriented spinning, Earth oriented or gravity gradient stabilized spacecraft. Internal and external environmental effects can be simulated.

A linear programming approach for placement of applicants to academic programs.

Science.gov (United States)

Kassa, Biniyam Asmare

2013-01-01

This paper reports a linear programming approach for placement of applicants to study programs developed and implemented at the college of Business & Economics, Bahir Dar University, Bahir Dar, Ethiopia. The approach is estimated to significantly streamline the placement decision process at the college by reducing required man hour as well as the time it takes to announce placement decisions. Compared to the previous manual system where only one or two placement criteria were considered, the new approach allows the college's management to easily incorporate additional placement criteria, if needed. Comparison of our approach against manually constructed placement decisions based on actual data for the 2012/13 academic year suggested that about 93 percent of the placements from our model concur with the actual placement decisions. For the remaining 7 percent of placements, however, the actual placements made by the manual system display inconsistencies of decisions judged against the very criteria intended to guide placement decisions by the college's program management office. Overall, the new approach proves to be a significant improvement over the manual system in terms of efficiency of the placement process and the quality of placement decisions.

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…

A comprehensive dynamic modeling approach for giant magnetostrictive material actuators

International Nuclear Information System (INIS)

Gu, Guo-Ying; Zhu, Li-Min; Li, Zhi; Su, Chun-Yi

2013-01-01

In this paper, a comprehensive modeling approach for a giant magnetostrictive material actuator (GMMA) is proposed based on the description of nonlinear electromagnetic behavior, the magnetostrictive effect and frequency response of the mechanical dynamics. It maps the relationships between current and magnetic flux at the electromagnetic part to force and displacement at the mechanical part in a lumped parameter form. Towards this modeling approach, the nonlinear hysteresis effect of the GMMA appearing only in the electrical part is separated from the linear dynamic plant in the mechanical part. Thus, a two-module dynamic model is developed to completely characterize the hysteresis nonlinearity and the dynamic behaviors of the GMMA. The first module is a static hysteresis model to describe the hysteresis nonlinearity, and the cascaded second module is a linear dynamic plant to represent the dynamic behavior. To validate the proposed dynamic model, an experimental platform is established. Then, the linear dynamic part and the nonlinear hysteresis part of the proposed model are identified in sequence. For the linear part, an approach based on axiomatic design theory is adopted. For the nonlinear part, a Prandtl–Ishlinskii model is introduced to describe the hysteresis nonlinearity and a constrained quadratic optimization method is utilized to identify its coefficients. Finally, experimental tests are conducted to demonstrate the effectiveness of the proposed dynamic model and the corresponding identification method. (paper)

Fast and Cache-Oblivious Dynamic Programming with Local Dependencies

DEFF Research Database (Denmark)

Bille, Philip; Stöckel, Morten

2012-01-01

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

A linear programming approach for placement of applicants to academic programs

OpenAIRE

Kassa, Biniyam Asmare

2013-01-01

This paper reports a linear programming approach for placement of applicants to study programs developed and implemented at the college of Business & Economics, Bahir Dar University, Bahir Dar, Ethiopia. The approach is estimated to significantly streamline the placement decision process at the college by reducing required man hour as well as the time it takes to announce placement decisions. Compared to the previous manual system where only one or two placement criteria were considered, the ...

Incorporating a multi-criteria decision procedure into the combined dynamic programming/production simulation algorithm for generation expansion planning

International Nuclear Information System (INIS)

Yang, H.T.; Chen, S.L.

1989-01-01

A multi-objective optimization approach to generation expansion planning is presented. The approach is designed by adding a new multi-criteria decision (MCD) procedure to the conventional algorithm which combines dynamic programming with production simulation method. The MCD procedure can help decision makers weight the relative importance of multiple attributes associated with the decision alternatives, and find the near-best compromise solution efficiently at each optimization step of the conventional algorithm. Practical application of proposed approach to feasibility evaluation of the fourth nuclear power plant of Tawian is also presented, demonstrating the effectiveness and limitations of the approach

Beginning Java programming the object-oriented approach

CERN Document Server

Baesens, Bart; vanden Broucke, Seppe

2015-01-01

A comprehensive Java guide, with samples, exercises, case studies, and step-by-step instruction Beginning Java Programming: The Object Oriented Approach is a straightforward resource for getting started with one of the world's most enduringly popular programming languages. Based on classes taught by the authors, the book starts with the basics and gradually builds into more advanced concepts. The approach utilizes an integrated development environment that allows readers to immediately apply what they learn, and includes step-by-step instruction with plenty of sample programs. Each chapter c

Step by step parallel programming method for molecular dynamics code

International Nuclear Information System (INIS)

Orii, Shigeo; Ohta, Toshio

1996-07-01

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

The Dynamic Geometrisation of Computer Programming

Science.gov (United States)

Sinclair, Nathalie; Patterson, Margaret

2018-01-01

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

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

A reliability program approach to operational safety

International Nuclear Information System (INIS)

Mueller, C.J.; Bezella, W.A.

1985-01-01

A Reliability Program (RP) model based on proven reliability techniques is being formulated for potential application in the nuclear power industry. Methods employed under NASA and military direction, commercial airline and related FAA programs were surveyed and a review of current nuclear risk-dominant issues conducted. The need for a reliability approach to address dependent system failures, operating and emergency procedures and human performance, and develop a plant-specific performance data base for safety decision making is demonstrated. Current research has concentrated on developing a Reliability Program approach for the operating phase of a nuclear plant's lifecycle. The approach incorporates performance monitoring and evaluation activities with dedicated tasks that integrate these activities with operation, surveillance, and maintenance of the plant. The detection, root-cause evaluation and before-the-fact correction of incipient or actual systems failures as a mechanism for maintaining plant safety is a major objective of the Reliability Program. (orig./HP)

Computational neuropharmacology: dynamical approaches in drug discovery.

Science.gov (United States)

Aradi, Ildiko; Erdi, Péter

2006-05-01

Computational approaches that adopt dynamical models are widely accepted in basic and clinical neuroscience research as indispensable tools with which to understand normal and pathological neuronal mechanisms. Although computer-aided techniques have been used in pharmaceutical research (e.g. in structure- and ligand-based drug design), the power of dynamical models has not yet been exploited in drug discovery. We suggest that dynamical system theory and computational neuroscience--integrated with well-established, conventional molecular and electrophysiological methods--offer a broad perspective in drug discovery and in the search for novel targets and strategies for the treatment of neurological and psychiatric diseases.

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.

Bellman’s GAP—a language and compiler for dynamic programming in sequence analysis

Science.gov (United States)

Sauthoff, Georg; Möhl, Mathias; Janssen, Stefan; Giegerich, Robert

2013-01-01

Motivation: Dynamic programming is ubiquitous in bioinformatics. Developing and implementing non-trivial dynamic programming algorithms is often error prone and tedious. Bellman’s GAP is a new programming system, designed to ease the development of bioinformatics tools based on the dynamic programming technique. Results: In Bellman’s GAP, dynamic programming algorithms are described in a declarative style by tree grammars, evaluation algebras and products formed thereof. This bypasses the design of explicit dynamic programming recurrences and yields programs that are free of subscript errors, modular and easy to modify. The declarative modules are compiled into C++ code that is competitive to carefully hand-crafted implementations. This article introduces the Bellman’s GAP system and its language, GAP-L. It then demonstrates the ease of development and the degree of re-use by creating variants of two common bioinformatics algorithms. Finally, it evaluates Bellman’s GAP as an implementation platform of ‘real-world’ bioinformatics tools. Availability: Bellman’s GAP is available under GPL license from http://bibiserv.cebitec.uni-bielefeld.de/bellmansgap. This Web site includes a repository of re-usable modules for RNA folding based on thermodynamics. Contact: robert@techfak.uni-bielefeld.de Supplementary information: Supplementary data are available at Bioinformatics online PMID:23355290

Proving deadlock freedom of logic programs with dynamic scheduling

NARCIS (Netherlands)

E. Marchiori; F. Teusink (Frank)

1996-01-01

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

Memory-efficient dynamic programming backtrace and pairwise local sequence alignment.

Science.gov (United States)

Newberg, Lee A

2008-08-15

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 from these checkpoints on an as-needed basis. Here we present an optimal checkpointing strategy, and demonstrate its utility with pairwise local sequence alignment of sequences of length 10,000. Sample C++-code for optimal backtrace is available in the Supplementary Materials. Supplementary data is available at Bioinformatics online.

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

Energy Technology Data Exchange (ETDEWEB)

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

2014-11-18

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

Sandia Dynamic Materials Program Strategic Plan.

Energy Technology Data Exchange (ETDEWEB)

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

2017-05-01

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

Runtime Support for Type-Safe Dynamic Java Classes

National Research Council Canada - National Science Library

Malabarba, Scott; Pandey, Raju; Gragg, Jeff; Barr, Earl; Barnes, J. F

2000-01-01

.... In this paper we present an approach for supporting dynamic evolution of Java programs. In this approach, Java programs can evolve by changing their components, namely classes, during their execution...

An Online Energy Management Control for Hybrid Electric Vehicles Based on Neuro-Dynamic Programming

Directory of Open Access Journals (Sweden)

Feiyan Qin

2018-03-01

Full Text Available Hybrid electric vehicles are a compromise between traditional vehicles and pure electric vehicles and can be part of the solution to the energy shortage problem. Energy management strategies (EMSs are highly related to energy utilization in HEVs’ fuel economy. In this research, we have employed a neuro-dynamic programming (NDP method to simultaneously optimize fuel economy and battery state of charge (SOC. In this NDP method, the critic network is a multi-resolution wavelet neural network based on the Meyer wavelet function, and the action network is a conventional wavelet neural network based on the Morlet function. The weights and parameters of both networks are obtained by an algorithm of backpropagation type. The NDP-based EMS has been applied to a parallel HEV and compared with a previously reported NDP EMS and a stochastic dynamic programing-based method. Simulation results under ADVISOR2002 have shown that the proposed NDP approach achieves better performance than both the methods. These indicate that the proposed NDP EMS, and the CWNN and MRWNN, are effective in approximating a nonlinear system.

Dynamical maximum entropy approach to flocking.

Science.gov (United States)

Cavagna, Andrea; Giardina, Irene; Ginelli, Francesco; Mora, Thierry; Piovani, Duccio; Tavarone, Raffaele; Walczak, Aleksandra M

2014-04-01

We derive a new method to infer from data the out-of-equilibrium alignment dynamics of collectively moving animal groups, by considering the maximum entropy model distribution consistent with temporal and spatial correlations of flight direction. When bird neighborhoods evolve rapidly, this dynamical inference correctly learns the parameters of the model, while a static one relying only on the spatial correlations fails. When neighbors change slowly and the detailed balance is satisfied, we recover the static procedure. We demonstrate the validity of the method on simulated data. The approach is applicable to other systems of active matter.

Evolutionary programming for goal-driven dynamic planning

Science.gov (United States)

Vaccaro, James M.; Guest, Clark C.; Ross, David O.

2002-03-01

Many complex artificial intelligence (IA) problems are goal- driven in nature and the opportunity exists to realize the benefits of a goal-oriented solution. In many cases, such as in command and control, a goal-oriented approach may be the only option. One of many appropriate applications for such an approach is War Gaming. War Gaming is an important tool for command and control because it provides a set of alternative courses of actions so that military leaders can contemplate their next move in the battlefield. For instance, when making decisions that save lives, it is necessary to completely understand the consequences of a given order. A goal-oriented approach provides a slowly evolving tractably reasoned solution that inherently follows one of the principles of war: namely concentration on the objective. Future decision-making will depend not only on the battlefield, but also on a virtual world where military leaders can wage wars and determine their options by playing computer war games much like the real world. The problem with these games is that the built-in AI does not learn nor adapt and many times cheats, because the intelligent player has access to all the information, while the user has access to limited information provided on a display. These games are written for the purpose of entertainment and actions are calculated a priori and off-line, and are made prior or during their development. With these games getting more sophisticated in structure and less domain specific in scope, there needs to be a more general intelligent player that can adapt and learn in case the battlefield situations or the rules of engagement change. One such war game that might be considered is Risk. Risk incorporates the principles of war, is a top-down scalable model, and provides a good application for testing a variety of goal- oriented AI approaches. By integrating a goal-oriented hybrid approach, one can develop a program that plays the Risk game effectively and move

A stochastic-programming approach to integrated asset and liability ...

African Journals Online (AJOL)

This increase in complexity has provided an impetus for the investigation into integrated asset- and liability-management frameworks that could realistically address dynamic portfolio allocation in a risk-controlled way. In this paper the authors propose a multi-stage dynamic stochastic-programming model for the integrated ...

Intensive Research Program on Advances in Nonsmooth Dynamics 2016

CERN Document Server

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

2017-01-01

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

Benchmarking novel approaches for modelling species range dynamics.

Science.gov (United States)

Zurell, Damaris; Thuiller, Wilfried; Pagel, Jörn; Cabral, Juliano S; Münkemüller, Tamara; Gravel, Dominique; Dullinger, Stefan; Normand, Signe; Schiffers, Katja H; Moore, Kara A; Zimmermann, Niklaus E

2016-08-01

Increasing biodiversity loss due to climate change is one of the most vital challenges of the 21st century. To anticipate and mitigate biodiversity loss, models are needed that reliably project species' range dynamics and extinction risks. Recently, several new approaches to model range dynamics have been developed to supplement correlative species distribution models (SDMs), but applications clearly lag behind model development. Indeed, no comparative analysis has been performed to evaluate their performance. Here, we build on process-based, simulated data for benchmarking five range (dynamic) models of varying complexity including classical SDMs, SDMs coupled with simple dispersal or more complex population dynamic models (SDM hybrids), and a hierarchical Bayesian process-based dynamic range model (DRM). We specifically test the effects of demographic and community processes on model predictive performance. Under current climate, DRMs performed best, although only marginally. Under climate change, predictive performance varied considerably, with no clear winners. Yet, all range dynamic models improved predictions under climate change substantially compared to purely correlative SDMs, and the population dynamic models also predicted reasonable extinction risks for most scenarios. When benchmarking data were simulated with more complex demographic and community processes, simple SDM hybrids including only dispersal often proved most reliable. Finally, we found that structural decisions during model building can have great impact on model accuracy, but prior system knowledge on important processes can reduce these uncertainties considerably. Our results reassure the clear merit in using dynamic approaches for modelling species' response to climate change but also emphasize several needs for further model and data improvement. We propose and discuss perspectives for improving range projections through combination of multiple models and for making these approaches

Quantum dynamical semigroups and approach to equilibrium

International Nuclear Information System (INIS)

Frigerio, A.

1977-01-01

For a quantum dynamical semigroup possessing a faithful normal stationary state, some conditions are discussed, which ensure the uniqueness of the equilibrium state and/or the approach to equilibrium for arbitrary initial condition. (Auth.)

A dynamic Bayesian network based approach to safety decision support in tunnel construction

International Nuclear Information System (INIS)

Wu, Xianguo; Liu, Huitao; Zhang, Limao; Skibniewski, Miroslaw J.; Deng, Qianli; Teng, Jiaying

2015-01-01

This paper presents a systemic decision approach with step-by-step procedures based on dynamic Bayesian network (DBN), aiming to provide guidelines for dynamic safety analysis of the tunnel-induced road surface damage over time. The proposed DBN-based approach can accurately illustrate the dynamic and updated feature of geological, design and mechanical variables as the construction progress evolves, in order to overcome deficiencies of traditional fault analysis methods. Adopting the predictive, sensitivity and diagnostic analysis techniques in the DBN inference, this approach is able to perform feed-forward, concurrent and back-forward control respectively on a quantitative basis, and provide real-time support before and after an accident. A case study in relating to dynamic safety analysis in the construction of Wuhan Yangtze Metro Tunnel in China is used to verify the feasibility of the proposed approach, as well as its application potential. The relationships between the DBN-based and BN-based approaches are further discussed according to analysis results. The proposed approach can be used as a decision tool to provide support for safety analysis in tunnel construction, and thus increase the likelihood of a successful project in a dynamic project environment. - Highlights: • A dynamic Bayesian network (DBN) based approach for safety decision support is developed. • This approach is able to perform feed-forward, concurrent and back-forward analysis and control. • A case concerning dynamic safety analysis in Wuhan Yangtze Metro Tunnel in China is presented. • DBN-based approach can perform a higher accuracy than traditional static BN-based approach

A self-cognizant dynamic system approach for prognostics and health management

Science.gov (United States)

Bai, Guangxing; Wang, Pingfeng; Hu, Chao

2015-03-01

Prognostics and health management (PHM) is an emerging engineering discipline that diagnoses and predicts how and when a system will degrade its performance and lose its partial or whole functionality. Due to the complexity and invisibility of rules and states of most dynamic systems, developing an effective approach to track evolving system states becomes a major challenge. This paper presents a new self-cognizant dynamic system (SCDS) approach that incorporates artificial intelligence into dynamic system modeling for PHM. A feed-forward neural network (FFNN) is selected to approximate a complex system response which is challenging task in general due to inaccessible system physics. The trained FFNN model is then embedded into a dual extended Kalman filter algorithm to track down system dynamics. A recursive computation technique used to update the FFNN model using online measurements is also derived. To validate the proposed SCDS approach, a battery dynamic system is considered as an experimental application. After modeling the battery system by a FFNN model and a state-space model, the state-of-charge (SoC) and state-of-health (SoH) are estimated by updating the FFNN model using the proposed approach. Experimental results suggest that the proposed approach improves the efficiency and accuracy for battery health management.

Dynamical Systems Approaches to Emotional Development

Science.gov (United States)

Camras, Linda A.; Witherington, David C.

2005-01-01

Within the last 20 years, transitions in the conceptualization of emotion and its development have given rise to calls for an explanatory framework that captures emotional development in all its organizational complexity and variability. Recent attempts have been made to couch emotional development in terms of a dynamical systems approach through…

Data and Dynamics Driven Approaches for Modelling and Forecasting the Red Sea Chlorophyll

KAUST Repository

Dreano, Denis

2017-01-01

concentration and have practical applications for fisheries operation and harmful algae blooms monitoring. Modelling approaches can be divided between physics- driven (dynamical) approaches, and data-driven (statistical) approaches. Dynamical models are based

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.

A double-loop adaptive sampling approach for sensitivity-free dynamic reliability analysis

International Nuclear Information System (INIS)

Wang, Zequn; Wang, Pingfeng

2015-01-01

Dynamic reliability measures reliability of an engineered system considering time-variant operation condition and component deterioration. Due to high computational costs, conducting dynamic reliability analysis at an early system design stage remains challenging. This paper presents a confidence-based meta-modeling approach, referred to as double-loop adaptive sampling (DLAS), for efficient sensitivity-free dynamic reliability analysis. The DLAS builds a Gaussian process (GP) model sequentially to approximate extreme system responses over time, so that Monte Carlo simulation (MCS) can be employed directly to estimate dynamic reliability. A generic confidence measure is developed to evaluate the accuracy of dynamic reliability estimation while using the MCS approach based on developed GP models. A double-loop adaptive sampling scheme is developed to efficiently update the GP model in a sequential manner, by considering system input variables and time concurrently in two sampling loops. The model updating process using the developed sampling scheme can be terminated once the user defined confidence target is satisfied. The developed DLAS approach eliminates computationally expensive sensitivity analysis process, thus substantially improves the efficiency of dynamic reliability analysis. Three case studies are used to demonstrate the efficacy of DLAS for dynamic reliability analysis. - Highlights: • Developed a novel adaptive sampling approach for dynamic reliability analysis. • POD Developed a new metric to quantify the accuracy of dynamic reliability estimation. • Developed a new sequential sampling scheme to efficiently update surrogate models. • Three case studies were used to demonstrate the efficacy of the new approach. • Case study results showed substantially enhanced efficiency with high accuracy

A dynamic approach to technology transfer

International Nuclear Information System (INIS)

Shave, D.F.; Kent, G.F.; Giambusso, A.; Jacobs, S.B.

1987-01-01

Stone and Webster Engineering Corporation has developed a systematic program for achieving efficient, effective technology transfer. This program is based on transferring both know-why and know-how. The transfer of know-why and know-how is achieved most effectively by working in partnership with the recipient of the technology; by employing five primary transfer mechanisms, according to the type of learning required; by treating the technology transfer as a designed process rather than an isolated event; and by using a project management approach to control and direct the process. This paper describes the philosophy, process, and training mechanisms that have worked for Stone and Webster, as well as the project management approach needed for the most effective transfer of technology. (author)

Dynamic optimization of maintenance and improvement planning for water main system: Periodic replacement approach

Energy Technology Data Exchange (ETDEWEB)

Kim, Jong Woo; Choi, Go Bong; Lee, Jong Min [Seoul National University, Seoul (Korea, Republic of); Suh, Jung Chul [Samchully Corporation, Seoul (Korea, Republic of)

2016-01-15

This paper proposes a Markov decision process (MDP) based approach to derive an optimal schedule of maintenance, rehabilitation and replacement of the water main system. The scheduling problem utilizes auxiliary information of a pipe such as the current state, cost, and deterioration model. The objective function and detailed algorithm of dynamic programming are modified to solve the periodic replacement problem. The optimal policy evaluated by the proposed algorithm is compared to several existing policies via Monte Carlo simulations. The proposed decision framework provides a systematic way to obtain an optimal policy.

An energy management for series hybrid electric vehicle using improved dynamic programming

Science.gov (United States)

Peng, Hao; Yang, Yaoquan; Liu, Chunyu

2018-02-01

With the increasing numbers of hybrid electric vehicle (HEV), management for two energy sources, engine and battery, is more and more important to achieve the minimum fuel consumption. This paper introduces several working modes of series hybrid electric vehicle (SHEV) firstly and then describes the mathematical model of main relative components in SHEV. On the foundation of this model, dynamic programming is applied to distribute energy of engine and battery on the platform of matlab and acquires less fuel consumption compared with traditional control strategy. Besides, control rule recovering energy in brake profiles is added into dynamic programming, so shorter computing time is realized by improved dynamic programming and optimization on algorithm.

Optimization of Measurements on Dynamically Sensitive Structures Using a Reliability Approach

DEFF Research Database (Denmark)

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

Design of a measuring program devoted to parameter identification of structural dynamic systems described by random fields is considered. The design problem is formulated as an optimization problem to minimize the total expected costs due to failure and costs of a measuring program. Design variab...... variables are the numbers of measuring points, the locations of these points and the required number of sample records. An example with a simply supported plane, vibrating beam is considered and tentative results are presented.......Design of a measuring program devoted to parameter identification of structural dynamic systems described by random fields is considered. The design problem is formulated as an optimization problem to minimize the total expected costs due to failure and costs of a measuring program. Design...

Optimization of Measurements on Dynamically Sensitive Structures Using a Reliability Approach

DEFF Research Database (Denmark)

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

1990-01-01

Design of measuring program devoted to parameter identification of structural dynamic systems described by random fields is considered. The design problem is formulated as an optimization problem to minimize the total expected costs due to failure and costs of masuring program. Design variables a...... are the numbers of measuring points, the locations of these points and the required number of sample records. An example with a simply supported plane, vibrating beam is considered and tentative results are presented.......Design of measuring program devoted to parameter identification of structural dynamic systems described by random fields is considered. The design problem is formulated as an optimization problem to minimize the total expected costs due to failure and costs of masuring program. Design variables...

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.

School District Program Cost Accounting: An Alternative Approach

Science.gov (United States)

Hentschke, Guilbert C.

1975-01-01

Discusses the value for school districts of a program cost accounting system and examines different approaches to generating program cost data, with particular emphasis on the "cost allocation to program system" (CAPS) and the traditional "transaction-based system." (JG)

Program packages for dynamics systems analysis and design

International Nuclear Information System (INIS)

Athani, V.V.

1976-01-01

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

GrDHP: a general utility function representation for dual heuristic dynamic programming.

Science.gov (United States)

Ni, Zhen; He, Haibo; Zhao, Dongbin; Xu, Xin; Prokhorov, Danil V

2015-03-01

A general utility function representation is proposed to provide the required derivable and adjustable utility function for the dual heuristic dynamic programming (DHP) design. Goal representation DHP (GrDHP) is presented with a goal network being on top of the traditional DHP design. This goal network provides a general mapping between the system states and the derivatives of the utility function. With this proposed architecture, we can obtain the required derivatives of the utility function directly from the goal network. In addition, instead of a fixed predefined utility function in literature, we conduct an online learning process for the goal network so that the derivatives of the utility function can be adaptively tuned over time. We provide the control performance of both the proposed GrDHP and the traditional DHP approaches under the same environment and parameter settings. The statistical simulation results and the snapshot of the system variables are presented to demonstrate the improved learning and controlling performance. We also apply both approaches to a power system example to further demonstrate the control capabilities of the GrDHP approach.

Rethink, Reform, Reenter: An Entrepreneurial Approach to Prison Programming.

Science.gov (United States)

Keena, Linda; Simmons, Chris

2015-07-01

The purpose of this article was to present a description and first-stage evaluation of the impact of the Ice House Entrepreneurship Program on the learning experience of participating prerelease inmates at a Mississippi maximum-security prison and their perception of the transfer of skills learned in program into securing employment upon reentry. The Ice House Entrepreneurship Program is a 12-week program facilitated by volunteer university professors to inmates in a prerelease unit of a maximum-security prison in Mississippi. Participants' perspectives were examined through content analysis of inmates' answers to program Reflection and Response Assignments and interviews. The analyses were conducted according to the constant comparative method. Findings reveal the emergent of eight life-lessons and suggest that this is a promising approach to prison programming for prerelease inmates. This study discusses three approaches to better prepare inmates for a mindset change. The rethink, reform, and reenter approaches help break the traditional cycle of release, reoffend, and return. © The Author(s) 2014.

An analytic approach to cyber adversarial dynamics

Science.gov (United States)

Sweeney, Patrick; Cybenko, George

2012-06-01

To date, cyber security investment by both the government and commercial sectors has been largely driven by the myopic best response of players to the actions of their adversaries and their perception of the adversarial environment. However, current work in applying traditional game theory to cyber operations typically assumes that games exist with prescribed moves, strategies, and payos. This paper presents an analytic approach to characterizing the more realistic cyber adversarial metagame that we believe is being played. Examples show that understanding the dynamic metagame provides opportunities to exploit an adversary's anticipated attack strategy. A dynamic version of a graph-based attack-defend game is introduced, and a simulation shows how an optimal strategy can be selected for success in the dynamic environment.

Challenges in fluid dynamics a new approach

CERN Document Server

Zeytounian, R Kh

2017-01-01

This monograph presents a synopsis of fluid dynamics based on the personal scientific experience of the author who has contributed immensely to the field. The interested reader will also benefit from the general historical context in which the material is presented in the book. The book covers a wide range of relevant topics of the field, and the main tool being rational asymptotic modelling (RAM) approach. The target audience primarily comprises experts in the field of fluid dynamics, but the book may also be beneficial for graduate students.

Analysis of the dynamics of liquid aluminium: recurrent relation approach

International Nuclear Information System (INIS)

Mokshin, A V; Yulmetyev, R M; Khusnutdinoff, R M; Haenggi, P

2007-01-01

By use of the recurrent relation approach (RRA) we study the microscopic dynamics of liquid aluminium at T = 973 K and develop a theoretical model which satisfies all the corresponding sum rules. The investigation covers the inelastic features as well as the crossover of our theory into the hydrodynamical and the free-particle regimes. A comparison between our theoretical results with those following from a generalized hydrodynamical approach is also presented. In addition to this we report the results of our molecular dynamics simulations for liquid aluminium, which are also discussed and compared to experimental data. The results obtained reveal (i) that the microscopical dynamics of density fluctuations is defined mainly by the first four even frequency moments of the dynamic structure factor, and (ii) the inherent relation of the high-frequency collective excitations observed in experimental spectra of dynamic structure factor S(k,ω) with the two-, three- and four-particle correlations

A first approach to filament dynamics

International Nuclear Information System (INIS)

Silva, P E S; De Abreu, F Vistulo; Dias, R G; Simoes, R

2010-01-01

Modelling elastic filament dynamics is a topic of high interest due to the wide range of applications. However, it has reached a high level of complexity in the literature, making it unaccessible to a beginner. In this paper we explain the main steps involved in the computational modelling of the dynamics of an elastic filament. We first derive equations governing the dynamics of an elastic lament suitable for a computer simulation implementation. The derivation starts from the relation between forces and potential energy in conservative systems in order to derive the equation of motion of any bead in the filament. Only two-dimensional movements are considered, but extensions to three dimensions can follow similar lines. Suggestions for computer implementations are provided in Matlab as well as an example of application related to the generation of musical sounds. This example allows a critical analysis of the numerical results obtained using a cross-disciplinary perspective. Since derivations start from basic physics equations, use simple calculus and computational implementations are straightforward, this paper proposes a different approach to introduce simple molecular dynamics simulations or animations of real systems in undergraduate elasticity or computer modelling courses.

Numerical simulation of particle dynamics in storage rings using BETACOOL program

International Nuclear Information System (INIS)

Meshkov, I.N.; Pivin, R.V.; Sidorin, A.O.; Smirnov, A.V.; Trubnikov, G.V.

2006-01-01

BETACOOL program developed by JINR electron cooling group is a kit of algorithms based on common format of input and output files. The program is oriented to simulation of the ion beam dynamics in a storage ring in the presence of cooling and heating effects. The version presented in this report includes three basic algorithms: simulation of rms parameters of the ion distribution function evolution in time, simulation of the distribution function evolution using Monte-Carlo method and tracking algorithm based on molecular dynamics technique. General processes to be investigated with the program are intrabeam scattering in the ion beam, electron cooling, interaction with residual gas and internal target

Comparing approaches to generic programming in Haskell

NARCIS (Netherlands)

Hinze, R.; Jeuring, J.T.; Löh, A.

2006-01-01

The last decade has seen a number of approaches to generic programming: PolyP, Functorial ML, `Scrap Your Boilerplate', Generic Haskell, `Generics for the Masses', etc. The approaches vary in sophistication and target audience: some propose full-blown pro- gramming languages, some suggest

Integer 1/0 Knapsack Problem Dynamic Programming Approach in Building Maintenance Optimization

Directory of Open Access Journals (Sweden)

Viska Dewi Fawzy

2017-12-01

Full Text Available The most common problem in urban areas is the high public demand and the limited provision of housing. In meeting the needs of affordable housing for low income communities, the Government of Indonesia implements Rusunawa Project. Object of this research is Pandanarang Rusunawa. Rusunawa Pandanarang is one of the vertical housing in Cilacap that is facing deterioration issue and needs good maintenance management. This study aims at insetting priority and optimizing maintenance plan due to limited funds (limited budget and the amount of damage that must be repaired.This study uses one of the optimization methods of Dynamic Programing on the application of Integer 1/0 Knapsack Problem, to determine an schedule the maintenance activities. The Criteria that are used such as: the level of building components damage and the level of occupants participation. In the first criterion, the benefit (p is the percentage of damage that is fixed with the cost (w. While on the second criterion, the benefit (p is the percentage of occupant participation rate on the maintenance activities with the cost (w. For the budget of Rp 125.000.000, 00, it was obtained from the simulation that the value of the optimum solution on the first criterion at the 7th stage of 71.88% with total cost Rp 106.000.000, 00. At the second criterion, the value of the optimum solution at the 7th stage of 89.29% with total cost Rp 124.000.000, 00.

An optimal maintenance policy for machine replacement problem using dynamic programming

OpenAIRE

Mohsen Sadegh Amalnik; Morteza Pourgharibshahi

2017-01-01

In this article, we present an acceptance sampling plan for machine replacement problem based on the backward dynamic programming model. Discount dynamic programming is used to solve a two-state machine replacement problem. We plan to design a model for maintenance by consid-ering the quality of the item produced. The purpose of the proposed model is to determine the optimal threshold policy for maintenance in a finite time horizon. We create a decision tree based on a sequential sampling inc...

Empirical valence bond models for reactive potential energy surfaces: a parallel multilevel genetic program approach.

Science.gov (United States)

Bellucci, Michael A; Coker, David F

2011-07-28

We describe a new method for constructing empirical valence bond potential energy surfaces using a parallel multilevel genetic program (PMLGP). Genetic programs can be used to perform an efficient search through function space and parameter space to find the best functions and sets of parameters that fit energies obtained by ab initio electronic structure calculations. Building on the traditional genetic program approach, the PMLGP utilizes a hierarchy of genetic programming on two different levels. The lower level genetic programs are used to optimize coevolving populations in parallel while the higher level genetic program (HLGP) is used to optimize the genetic operator probabilities of the lower level genetic programs. The HLGP allows the algorithm to dynamically learn the mutation or combination of mutations that most effectively increase the fitness of the populations, causing a significant increase in the algorithm's accuracy and efficiency. The algorithm's accuracy and efficiency is tested against a standard parallel genetic program with a variety of one-dimensional test cases. Subsequently, the PMLGP is utilized to obtain an accurate empirical valence bond model for proton transfer in 3-hydroxy-gamma-pyrone in gas phase and protic solvent. © 2011 American Institute of Physics

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

International Nuclear Information System (INIS)

Silva, Marcelo Mariano da

2008-01-01

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)

Comparing approaches to generic programming in Haskell

NARCIS (Netherlands)

Hinze, R.; Jeuring, J.T.; Löh, A.

2006-01-01

The last decade has seen a number of approaches to data- type-generic programming: PolyP, Functorial ML, `Scrap Your Boiler- plate', Generic Haskell, `Generics for the Masses', etc. The approaches vary in sophistication and target audience: some propose full-blown pro- gramming languages, some

Enhanced dynamic data-driven fault detection approach: Application to a two-tank heater system

KAUST Repository

Harrou, Fouzi; Madakyaru, Muddu; Sun, Ying; Kammammettu, Sanjula

2018-01-01

on PCA approach a challenging task. Accounting for the dynamic nature of data can also reflect the performance of the designed fault detection approaches. In PCA-based methods, this dynamic characteristic of the data can be accounted for by using dynamic

A programming approach to computability

CERN Document Server

Kfoury, A J; Arbib, Michael A

1982-01-01

Computability theory is at the heart of theoretical computer science. Yet, ironically, many of its basic results were discovered by mathematical logicians prior to the development of the first stored-program computer. As a result, many texts on computability theory strike today's computer science students as far removed from their concerns. To remedy this, we base our approach to computability on the language of while-programs, a lean subset of PASCAL, and postpone consideration of such classic models as Turing machines, string-rewriting systems, and p. -recursive functions till the final chapter. Moreover, we balance the presentation of un solvability results such as the unsolvability of the Halting Problem with a presentation of the positive results of modern programming methodology, including the use of proof rules, and the denotational semantics of programs. Computer science seeks to provide a scientific basis for the study of information processing, the solution of problems by algorithms, and the design ...

A Comparative Study of the Effects of Two Approaches of Dynamic Assessment on the Reading Comprehension of Iranian EFL Learners

Directory of Open Access Journals (Sweden)

Jila Naeini

2015-03-01

Full Text Available The aim of this study was to examine and compare the impact of two Dynamic Assessment (DA approaches, that is, Feuerstein’s Mediated Learning Experience (MLE and Brown’s Graduated Prompt (GP on Iranian EFL learners’ reading comprehension. Therefore, a mixed methods approach consisting of a semi-structured interview, a pretest, an intervention program, a posttest, and a transfer test was applied to assess and compare the efficacy of two DA approaches. One hundred and two EFL learners taking a General English course at Islamic Azad University were assigned to two experimental groups (MLEG and GPG and one comparison group (CG. The participants in the MLEG took part in the MLE, and the participants in the GPG participated in the GP intervention program.  The results of the qualitative as well as the aggregate and disaggregated quantitative data analyses indicated that both intervention approaches of DA were effective in enhancing the learners’ reading comprehension.

An Approach for Solving Linear Fractional Programming Problems

OpenAIRE

Andrew Oyakhobo Odior

2012-01-01

Linear fractional programming problems are useful tools in production planning, financial and corporate planning, health care and hospital planning and as such have attracted considerable research interest. The paper presents a new approach for solving a fractional linear programming problem in which the objective function is a linear fractional function, while the constraint functions are in the form of linear inequalities. The approach adopted is based mainly upon solving the problem algebr...

Optimal Risk Reduction in the Railway Industry by Using Dynamic Programming

OpenAIRE

Michael Todinov; Eberechi Weli

2013-01-01

The paper suggests for the first time the use of dynamic programming techniques for optimal risk reduction in the railway industry. It is shown that by using the concept ‘amount of removed risk by a risk reduction option’, the problem related to optimal allocation of a fixed budget to achieve a maximum risk reduction in the railway industry can be reduced to an optimisation problem from dynamic programming. For n risk reduction options and size of the available risk reduction budget B (expres...

On dynamical systems approaches and methods in f ( R ) cosmology

Energy Technology Data Exchange (ETDEWEB)

Alho, Artur [Center for Mathematical Analysis, Geometry and Dynamical Systems, Instituto Superior Técnico, Universidade de Lisboa, Av. Rovisco Pais, 1049-001 Lisboa (Portugal); Carloni, Sante [Centro Multidisciplinar de Astrofisica – CENTRA, Instituto Superior Técnico, Universidade de Lisboa, Av. Rovisco Pais, 1049-001 Lisboa (Portugal); Uggla, Claes, E-mail: aalho@math.ist.utl.pt, E-mail: sante.carloni@tecnico.ulisboa.pt, E-mail: claes.uggla@kau.se [Department of Physics, Karlstad University, S-65188 Karlstad (Sweden)

2016-08-01

We discuss dynamical systems approaches and methods applied to flat Robertson-Walker models in f ( R )-gravity. We argue that a complete description of the solution space of a model requires a global state space analysis that motivates globally covering state space adapted variables. This is shown explicitly by an illustrative example, f ( R ) = R + α R {sup 2}, α > 0, for which we introduce new regular dynamical systems on global compactly extended state spaces for the Jordan and Einstein frames. This example also allows us to illustrate several local and global dynamical systems techniques involving, e.g., blow ups of nilpotent fixed points, center manifold analysis, averaging, and use of monotone functions. As a result of applying dynamical systems methods to globally state space adapted dynamical systems formulations, we obtain pictures of the entire solution spaces in both the Jordan and the Einstein frames. This shows, e.g., that due to the domain of the conformal transformation between the Jordan and Einstein frames, not all the solutions in the Jordan frame are completely contained in the Einstein frame. We also make comparisons with previous dynamical systems approaches to f ( R ) cosmology and discuss their advantages and disadvantages.

The DYLAM approach for the dynamic reliability analysis of systems

International Nuclear Information System (INIS)

Cojazzi, Giacomo

1996-01-01

In many real systems, failures occurring to the components, control failures and human interventions often interact with the physical system evolution in such a way that a simple reliability analysis, de-coupled from process dynamics, is very difficult or even impossible. In the last ten years many dynamic reliability approaches have been proposed to properly assess the reliability of these systems characterized by dynamic interactions. The DYLAM methodology, now implemented in its latest version, DYLAM-3, offers a powerful tool for integrating deterministic and failure events. This paper describes the main features of the DYLAM-3 code with reference to the classic fault-tree and event-tree techniques. Some aspects connected to the practical problems underlying dynamic event-trees are also discussed. A simple system, already analyzed with other dynamic methods is used as a reference for the numerical applications. The same system is also studied with a time-dependent fault-tree approach in order to show some features of dynamic methods vs classical techniques. Examples including stochastic failures, without and with repair, failures on demand and time dependent failure rates give an extensive overview of DYLAM-3 capabilities

Understanding the Entrepreneurial Process: a Dynamic Approach

Directory of Open Access Journals (Sweden)

Vânia Maria Jorge Nassif

2010-04-01

Full Text Available There is considerable predominance in the adoption of perspectives based on characteristics in research into entrepreneurship. However, most studies describe the entrepreneur from a static or snapshot approach; very few adopt a dynamic perspective. The aim of this study is to contribute to the enhancement of knowledge concerning entrepreneurial process dynamics through an understanding of the values, characteristics and actions of the entrepreneur over time. By focusing on personal attributes, we have developed a framework that shows the importance of affective and cognitive aspects of entrepreneurs and the way that they evolve during the development of their business.

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

Dynamic electricity pricing for electric vehicles using stochastic programming

International Nuclear Information System (INIS)

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

2017-01-01

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

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

Science.gov (United States)

Yang, Yongliang; Wunsch, Donald; Yin, Yixin

2017-08-01

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

A Novel Approach for Solving Semidefinite Programs

Directory of Open Access Journals (Sweden)

Hong-Wei Jiao

2014-01-01

Full Text Available A novel linearizing alternating direction augmented Lagrangian approach is proposed for effectively solving semidefinite programs (SDP. For every iteration, by fixing the other variables, the proposed approach alternatively optimizes the dual variables and the dual slack variables; then the primal variables, that is, Lagrange multipliers, are updated. In addition, the proposed approach renews all the variables in closed forms without solving any system of linear equations. Global convergence of the proposed approach is proved under mild conditions, and two numerical problems are given to demonstrate the effectiveness of the presented approach.

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.

GLOBEC (Global Ocean Ecosystems Dynamics: Northwest Atlantic program

Science.gov (United States)

1991-01-01

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

An approach of community evolution based on gravitational relationship refactoring in dynamic networks

International Nuclear Information System (INIS)

Yin, Guisheng; Chi, Kuo; Dong, Yuxin; Dong, Hongbin

2017-01-01

In this paper, an approach of community evolution based on gravitational relationship refactoring between the nodes in a dynamic network is proposed, and it can be used to simulate the process of community evolution. A static community detection algorithm and a dynamic community evolution algorithm are included in the approach. At first, communities are initialized by constructing the core nodes chains, the nodes can be iteratively searched and divided into corresponding communities via the static community detection algorithm. For a dynamic network, an evolutionary process is divided into three phases, and behaviors of community evolution can be judged according to the changing situation of the core nodes chain in each community. Experiments show that the proposed approach can achieve accuracy and availability in the synthetic and real world networks. - Highlights: • The proposed approach considers both the static community detection and dynamic community evolution. • The approach of community evolution can identify the whole 6 common evolution events. • The proposed approach can judge the evolutionary events according to the variations of the core nodes chains.

Effect of the CTL proliferation program on virus dynamics

DEFF Research Database (Denmark)

Wodarz, Dominik; Thomsen, Allan Randrup

2005-01-01

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

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.

Finite temperature dynamics of a Holstein polaron: The thermo-field dynamics approach

Science.gov (United States)

Chen, Lipeng; Zhao, Yang

2017-12-01

Combining the multiple Davydov D2 Ansatz with the method of thermo-field dynamics, we study finite temperature dynamics of a Holstein polaron on a lattice. It has been demonstrated, using the hierarchy equations of motion method as a benchmark, that our approach provides an efficient, robust description of finite temperature dynamics of the Holstein polaron in the simultaneous presence of diagonal and off-diagonal exciton-phonon coupling. The method of thermo-field dynamics handles temperature effects in the Hilbert space with key numerical advantages over other treatments of finite-temperature dynamics based on quantum master equations in the Liouville space or wave function propagation with Monte Carlo importance sampling. While for weak to moderate diagonal coupling temperature increases inhibit polaron mobility, it is found that off-diagonal coupling induces phonon-assisted transport that dominates at high temperatures. Results on the mean square displacements show that band-like transport features dominate the diagonal coupling cases, and there exists a crossover from band-like to hopping transport with increasing temperature when including off-diagonal coupling. As a proof of concept, our theory provides a unified treatment of coherent and incoherent transport in molecular crystals and is applicable to any temperature.

Regulation of Dynamical Systems to Optimal Solutions of Semidefinite Programs: Algorithms and Applications to AC Optimal Power Flow

Energy Technology Data Exchange (ETDEWEB)

Dall' Anese, Emiliano; Dhople, Sairaj V.; Giannakis, Georgios B.

2015-07-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 pertinent network-wide optimization problems. Particular emphasis is placed on the solution of semidefinite programs (SDPs). The design of the feedback controller is grounded on a dual e-subgradient approach, with the dual iterates utilized to dynamically update the dynamical-system reference signals. Global convergence is guaranteed for diminishing stepsize rules, even when the reference inputs are updated at a faster rate than the dynamical-system settling time. The application of the proposed framework to the control of power-electronic inverters in AC distribution systems is discussed. The objective is to bridge the time-scale separation between real-time inverter control and network-wide optimization. Optimization objectives assume the form of SDP relaxations of prototypical AC optimal power flow problems.

Markdown Optimization via Approximate Dynamic Programming

Directory of Open Access Journals (Sweden)

Cos?gun

2013-02-01

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

Employing Program Semantics for Malware Detection

OpenAIRE

Naval, S.; Laxmi, V.; Rajarajan, M.; Gaur, M. S.; Conti, M.

2015-01-01

In recent years, malware has emerged as a critical security threat. Additionally, malware authors continue to embed numerous anti–detection features to evade existing malware detection approaches. Against this advanced class of malicious programs, dynamic behavior–based malware detection approaches outperform the traditional signature–based approaches by neutralizing the effects of obfuscation and morphing techniques. The majority of dynamic behavior detectors rely on system–calls to model th...

Dynamic partnership: A new approach to EM technology commercialization and deployment

International Nuclear Information System (INIS)

Daly, D.J.; Erickson, T.A.; Groenewold, G.H.

1996-01-01

The cleanup of nuclear defense complex sites under the U.S. Department of Energy (DOE) Environmental Management (EM) Program presents an unprecedented challenge to the environmental sector. Effective and efficient cleanup of EM sites requires the timely development or modification of cleanup technologies. Facilitating the development of technologies to meet DOE goals for site cleanup is the responsibility of EM-50, the EM Program Office of Science and Technology. However, efforts are often arrested at the open-quotes valley of death,close quotes the general term for barriers to demonstration, commercialization, and deployment. The Energy ampersand Environmental Research Center (EERC), a not-for-profit, contract-supported organization focused on research, development, demonstration, and commercialization (RDD ampersand C) of energy and environmental technologies, is in the second year of a Cooperative Agreement with DOE's Morgantown Energy Technology Center (METC) designed to deliver EM technologies into the commercial marketplace through a unique combination of technical support, real-world demonstration, and brokering. This paper profiles this novel approach, termed open-quotes Dynamic Partnership,close quotes and reviews the application of this concept to the ongoing commercialization and deployment of four innovative cleanup technologies

Dynamic partnership: A new approach to EM technology commercialization and deployment

International Nuclear Information System (INIS)

Daly, D.J.; Erickson, T.A.; Groenewold, G.H.

1996-01-01

The task of restoring nuclear defense complex sites under the U.S. Department of Energy (DOE) Environmental Management (EM) Program presents an unprecedented challenge to the environmental restoration community. Effective and efficient cleanup requires the timely development or modification of novel cleanup technologies applicable to radioactive wastes. Fostering the commercialization of these innovative technologies is the mission of EM-50, the EM Program Office of Science and Technology. However, efforts are often arrested at the open-quotes valley of death,close quotes the general term for barriers to demonstration, commercialization, and deployment. The Energy ampersand Environmental Research Center (EERC), a not-for-profit, contract-supported organization focused on research, development, demonstration, and commercialization (RDD ampersand C) of energy and environmental technologies, is in the second year of a cooperative agreement with the U.S. Department of Energy (DOE) Morgantown Energy Technology Center (METC) designed to deliver EM technologies into the commercial marketplace through a unique combination of technical support, real-world demonstration, and brokering. This paper profiles this novel approach, termed open-quotes Dynamic Partnership,close quotes and reviews the application of this concept to the ongoing commercialization and deployment of four innovative cleanup technologies. 2 tabs

Survey for service selection approaches in dynamic environments

CSIR Research Space (South Africa)

Manqele, Lindelweyizizwe S

2017-09-01

Full Text Available The usage of the service selection approaches across different dynamic service provisioning environments has increased the challenges associated with an effective method that can be used to select a relevant service. The use of service selection...

Combinatorial computational chemistry approach of tight-binding quantum chemical molecular dynamics method to the design of the automotive catalysts

International Nuclear Information System (INIS)

Ito, Yuki; Jung, Changho; Luo, Yi; Koyama, Michihisa; Endou, Akira; Kubo, Momoji; Imamura, Akira; Miyamoto, Akira

2006-01-01

Recently, we have developed a new tight-binding quantum chemical molecular dynamics program 'Colors' for combinatorial computational chemistry approach. This methodology is based on our original tight-binding approximation and realized over 5000 times acceleration compared to the conventional first-principles molecular dynamics method. In the present study, we applied our new program to the simulations on various realistic large-scale models of the automotive three-way catalysts, ultrafine Pt particle/CeO 2 (111) support. Significant electron transfer from the Pt particle to the CeO 2 (111) surface was observed and it was found to strongly depend on the size of the Pt particle. Furthermore, our simulation results suggest that the reduction of the Ce atom due to the electron transfer from the Pt particle to the CeO 2 surface is a main reason for the strong interaction of the Pt particle and CeO 2 (111) support

Two-step approach to the dynamics of coupled anharmonic oscillators

International Nuclear Information System (INIS)

Chung, N. N.; Chew, L. Y.

2009-01-01

We have further extended the two-step approach developed by Chung and Chew [N. N. Chung and L. Y. Chew, Phys. Rev. A 76, 032113 (2007)] to the solution of the quantum dynamics of general systems of N-coupled anharmonic oscillators. The idea is to employ an optimized basis set to represent the dynamical quantum states of these oscillator systems. The set is generated via the action of the optimized Bogoliubov transformed bosonic operators on the optimal squeezed vacuum product state. The procedure requires (i) applying the two-step approach to the eigendecomposition of the time evolution operator and (ii) transforming the representation of the initial state from the original to the optimal bases. We have applied the formalism to examine the dynamics of squeezing and entanglement of several anharmonic oscillator systems.

An Adaptive Learning Based Network Selection Approach for 5G Dynamic Environments

Directory of Open Access Journals (Sweden)

Xiaohong Li

2018-03-01

Full Text Available Networks will continue to become increasingly heterogeneous as we move toward 5G. Meanwhile, the intelligent programming of the core network makes the available radio resource be more changeable rather than static. In such a dynamic and heterogeneous network environment, how to help terminal users select optimal networks to access is challenging. Prior implementations of network selection are usually applicable for the environment with static radio resources, while they cannot handle the unpredictable dynamics in 5G network environments. To this end, this paper considers both the fluctuation of radio resources and the variation of user demand. We model the access network selection scenario as a multiagent coordination problem, in which a bunch of rationally terminal users compete to maximize their benefits with incomplete information about the environment (no prior knowledge of network resource and other users’ choices. Then, an adaptive learning based strategy is proposed, which enables users to adaptively adjust their selections in response to the gradually or abruptly changing environment. The system is experimentally shown to converge to Nash equilibrium, which also turns out to be both Pareto optimal and socially optimal. Extensive simulation results show that our approach achieves significantly better performance compared with two learning and non-learning based approaches in terms of load balancing, user payoff and the overall bandwidth utilization efficiency. In addition, the system has a good robustness performance under the condition with non-compliant terminal users.

Modeling workforce demand in North Dakota: a System Dynamics approach

OpenAIRE

Muminova, Adiba

2015-01-01

This study investigates the dynamics behind the workforce demand and attempts to predict the potential effects of future changes in oil prices on workforce demand in North Dakota. The study attempts to join System Dynamics and Input-Output models in order to overcome shortcomings in both of the approaches and gain a more complete understanding of the issue of workforce demand. A system dynamics simulation of workforce demand within different economic sector...

Programming massively parallel processors a hands-on approach

CERN Document Server

Kirk, David B

2010-01-01

Programming Massively Parallel Processors discusses basic concepts about parallel programming and GPU architecture. ""Massively parallel"" refers to the use of a large number of processors to perform a set of computations in a coordinated parallel way. The book details various techniques for constructing parallel programs. It also discusses the development process, performance level, floating-point format, parallel patterns, and dynamic parallelism. The book serves as a teaching guide where parallel programming is the main topic of the course. It builds on the basics of C programming for CUDA, a parallel programming environment that is supported on NVI- DIA GPUs. Composed of 12 chapters, the book begins with basic information about the GPU as a parallel computer source. It also explains the main concepts of CUDA, data parallelism, and the importance of memory access efficiency using CUDA. The target audience of the book is graduate and undergraduate students from all science and engineering disciplines who ...

Probabilistic approach to manipulator kinematics and dynamics

International Nuclear Information System (INIS)

Rao, S.S.; Bhatti, P.K.

2001-01-01

A high performance, high speed robotic arm must be able to manipulate objects with a high degree of accuracy and repeatability. As with any other physical system, there are a number of factors causing uncertainties in the behavior of a robotic manipulator. These factors include manufacturing and assembling tolerances, and errors in the joint actuators and controllers. In order to study the effect of these uncertainties on the robotic end-effector and to obtain a better insight into the manipulator behavior, the manipulator kinematics and dynamics are modeled using a probabilistic approach. Based on the probabilistic model, kinematic and dynamic performance criteria are defined to provide measures of the behavior of the robotic end-effector. Techniques are presented to compute the kinematic and dynamic reliabilities of the manipulator. The effects of tolerances associated with the various manipulator parameters on the reliabilities are studied. Numerical examples are presented to illustrate the procedures

Approaches to Learning to Control Dynamic Uncertainty

Directory of Open Access Journals (Sweden)

Magda Osman

2015-10-01

Full Text Available In dynamic environments, when faced with a choice of which learning strategy to adopt, do people choose to mostly explore (maximizing their long term gains or exploit (maximizing their short term gains? More to the point, how does this choice of learning strategy influence one’s later ability to control the environment? In the present study, we explore whether people’s self-reported learning strategies and levels of arousal (i.e., surprise, stress correspond to performance measures of controlling a Highly Uncertain or Moderately Uncertain dynamic environment. Generally, self-reports suggest a preference for exploring the environment to begin with. After which, those in the Highly Uncertain environment generally indicated they exploited more than those in the Moderately Uncertain environment; this difference did not impact on performance on later tests of people’s ability to control the dynamic environment. Levels of arousal were also differentially associated with the uncertainty of the environment. Going beyond behavioral data, our model of dynamic decision-making revealed that, in actual fact, there was no difference in exploitation levels between those in the highly uncertain or moderately uncertain environments, but there were differences based on sensitivity to negative reinforcement. We consider the implications of our findings with respect to learning and strategic approaches to controlling dynamic uncertainty.

A grey-forecasting interval-parameter mixed-integer programming approach for integrated electric-environmental management–A case study of Beijing

International Nuclear Information System (INIS)

Wang, Xingwei; Cai, Yanpeng; Chen, Jiajun; Dai, Chao

2013-01-01

In this study, a GFIPMIP (grey-forecasting interval-parameter mixed-integer programming) approach was developed for supporting IEEM (integrated electric-environmental management) in Beijing. It was an attempt to incorporate an energy-forecasting model within a general modeling framework at the municipal level. The developed GFIPMIP model can not only forecast electric demands, but also reflect dynamic, interactive, and uncertain characteristics of the IEEM system in Beijing. Moreover, it can address issues regarding power supply, and emission reduction of atmospheric pollutants and GHG (greenhouse gas). Optimal solutions were obtained related to power generation patterns and facility capacity expansion schemes under a series of system constraints. Two scenarios were analyzed based on multiple environmental policies. The results were useful for helping decision makers identify desired management strategies to guarantee the city's power supply and mitigate emissions of GHG and atmospheric pollutants. The results also suggested that the developed GFIPMIP model be applicable to similar engineering problems. - Highlights: • A grey-forecasting interval-parameter mixed integer programming (GFIPMIP) approach was developed. • It could reflect dynamic, interactive, and uncertain characteristics of an IEEM system. • The developed GFIPMIP approach was used for supporting IEEM system planning in Beijing. • Two scenarios were established based on different environmental policies and management targets. • Optimal schemes for power generation, energy supply, and environmental protection were identified

Optimization of multi-response dynamic systems integrating multiple ...

African Journals Online (AJOL)

regression and Taguchi's dynamic signal-to-noise ratio concept ..... algorithm for dynamic multi-response optimization based on goal programming approach. .... problem-solving confirmation, if no grave infringement of model suppositions is ...

Online Adaptive Optimal Control of Vehicle Active Suspension Systems Using Single-Network Approximate Dynamic Programming

Directory of Open Access Journals (Sweden)

Zhi-Jun Fu

2017-01-01

Full Text Available In view of the performance requirements (e.g., ride comfort, road holding, and suspension space limitation for vehicle suspension systems, this paper proposes an adaptive optimal control method for quarter-car active suspension system by using the approximate dynamic programming approach (ADP. Online optimal control law is obtained by using a single adaptive critic NN to approximate the solution of the Hamilton-Jacobi-Bellman (HJB equation. Stability of the closed-loop system is proved by Lyapunov theory. Compared with the classic linear quadratic regulator (LQR approach, the proposed ADP-based adaptive optimal control method demonstrates improved performance in the presence of parametric uncertainties (e.g., sprung mass and unknown road displacement. Numerical simulation results of a sedan suspension system are presented to verify the effectiveness of the proposed control strategy.

Fuzzy Multi-objective Linear Programming Approach

Directory of Open Access Journals (Sweden)

Amna Rehmat

2007-07-01

Full Text Available Traveling salesman problem (TSP is one of the challenging real-life problems, attracting researchers of many fields including Artificial Intelligence, Operations Research, and Algorithm Design and Analysis. The problem has been well studied till now under different headings and has been solved with different approaches including genetic algorithms and linear programming. Conventional linear programming is designed to deal with crisp parameters, but information about real life systems is often available in the form of vague descriptions. Fuzzy methods are designed to handle vague terms, and are most suited to finding optimal solutions to problems with vague parameters. Fuzzy multi-objective linear programming, an amalgamation of fuzzy logic and multi-objective linear programming, deals with flexible aspiration levels or goals and fuzzy constraints with acceptable deviations. In this paper, a methodology, for solving a TSP with imprecise parameters, is deployed using fuzzy multi-objective linear programming. An example of TSP with multiple objectives and vague parameters is discussed.

Optimization of control poison management by dynamic programming

International Nuclear Information System (INIS)

Ponzoni Filho, P.

1974-01-01

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

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

International Nuclear Information System (INIS)

Svalbonas, V.

1976-01-01

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

Inverse Transformation: Unleashing Spatially Heterogeneous Dynamics with an Alternative Approach to XPCS Data Analysis.

Science.gov (United States)

Andrews, Ross N; Narayanan, Suresh; Zhang, Fan; Kuzmenko, Ivan; Ilavsky, Jan

2018-02-01

X-ray photon correlation spectroscopy (XPCS), an extension of dynamic light scattering (DLS) in the X-ray regime, detects temporal intensity fluctuations of coherent speckles and provides scattering vector-dependent sample dynamics at length scales smaller than DLS. The penetrating power of X-rays enables probing dynamics in a broad array of materials with XPCS, including polymers, glasses and metal alloys, where attempts to describe the dynamics with a simple exponential fit usually fails. In these cases, the prevailing XPCS data analysis approach employs stretched or compressed exponential decay functions (Kohlrausch functions), which implicitly assume homogeneous dynamics. In this paper, we propose an alternative analysis scheme based upon inverse Laplace or Gaussian transformation for elucidating heterogeneous distributions of dynamic time scales in XPCS, an approach analogous to the CONTIN algorithm widely accepted in the analysis of DLS from polydisperse and multimodal systems. Using XPCS data measured from colloidal gels, we demonstrate the inverse transform approach reveals hidden multimodal dynamics in materials, unleashing the full potential of XPCS.

A phenomenological approach to modeling chemical dynamics in nonlinear and two-dimensional spectroscopy.

Science.gov (United States)

Ramasesha, Krupa; De Marco, Luigi; Horning, Andrew D; Mandal, Aritra; Tokmakoff, Andrei

2012-04-07

We present an approach for calculating nonlinear spectroscopic observables, which overcomes the approximations inherent to current phenomenological models without requiring the computational cost of performing molecular dynamics simulations. The trajectory mapping method uses the semi-classical approximation to linear and nonlinear response functions, and calculates spectra from trajectories of the system's transition frequencies and transition dipole moments. It rests on identifying dynamical variables important to the problem, treating the dynamics of these variables stochastically, and then generating correlated trajectories of spectroscopic quantities by mapping from the dynamical variables. This approach allows one to describe non-Gaussian dynamics, correlated dynamics between variables of the system, and nonlinear relationships between spectroscopic variables of the system and the bath such as non-Condon effects. We illustrate the approach by applying it to three examples that are often not adequately treated by existing analytical models--the non-Condon effect in the nonlinear infrared spectra of water, non-Gaussian dynamics inherent to strongly hydrogen bonded systems, and chemical exchange processes in barrier crossing reactions. The methods described are generally applicable to nonlinear spectroscopy throughout the optical, infrared and terahertz regions.

Optimal blood glucose level control using dynamic programming based on minimal Bergman model

Science.gov (United States)

Rettian Anggita Sari, Maria; Hartono

2018-03-01

The purpose of this article is to simulate the glucose dynamic and the insulin kinetic of diabetic patient. The model used in this research is a non-linear Minimal Bergman model. Optimal control theory is then applied to formulate the problem in order to determine the optimal dose of insulin in the treatment of diabetes mellitus such that the glucose level is in the normal range for some specific time range. The optimization problem is solved using dynamic programming. The result shows that dynamic programming is quite reliable to represent the interaction between glucose and insulin levels in diabetes mellitus patient.

The dynamics of alliances. A game theoretical approach

NARCIS (Netherlands)

Ridder, A. de

2007-01-01

In this dissertation, Annelies de Ridder presents a game theoretical approach to strategic alliances. More specifically, the dynamics of and within alliances have been studied. To do so, four new models have been developed in the game theoretical tradition. Both coalition theory and strategic game

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

PSHED: a simplified approach to developing parallel programs

International Nuclear Information System (INIS)

Mahajan, S.M.; Ramesh, K.; Rajesh, K.; Somani, A.; Goel, M.

1992-01-01

This paper presents a simplified approach in the forms of a tree structured computational model for parallel application programs. An attempt is made to provide a standard user interface to execute programs on BARC Parallel Processing System (BPPS), a scalable distributed memory multiprocessor. The interface package called PSHED provides a basic framework for representing and executing parallel programs on different parallel architectures. The PSHED package incorporates concepts from a broad range of previous research in programming environments and parallel computations. (author). 6 refs

A comprehensive approach to RCM-based preventive maintenance program development

International Nuclear Information System (INIS)

Hall, B.E.; Davis, T.; Pennington, A.J.

1988-01-01

In late 1986, Public Service Electric and Gas Company (PSE ampersand G) concluded that to support its vision and strategic planning it would be necessary to develop a consistent approach to maintenance for all nuclear units at the artificial island. General Physics Corporation was selected to lead a consultant team to support full-scale development of a preventive maintenance (PM) program for Salem and Hope Creek generating stations based on a reliability-centered maintenance (RCM) approach. RCM was selected because it represents a systematic approach to developing a PM program that provides a logical, consistent, and traceable methodology and produces a well-documented engineering basis for the program. Early in 1987, primary objectives for the PM program were defined. The Phase I tasks addressed key programmatic areas such as maintenance philosophy, procedures, condition monitoring, performance trending, equipment failure data base, ogranization, PM program effectiveness evaluation, RCM process, reliability/availability modeling, information management, training, spare parts, software/hardware, and commitments. Phase I of the PM program development project was completed in January 1988. Highlights of the Phase I work and the PM program manual are described

EDISON-WMW: Exact Dynamic Programing Solution of the Wilcoxon–Mann–Whitney Test

Directory of Open Access Journals (Sweden)

Alexander Marx

2016-02-01

Full Text Available In many research disciplines, hypothesis tests are applied to evaluate whether findings are statistically significant or could be explained by chance. The Wilcoxon–Mann–Whitney (WMW test is among the most popular hypothesis tests in medicine and life science to analyze if two groups of samples are equally distributed. This nonparametric statistical homogeneity test is commonly applied in molecular diagnosis. Generally, the solution of the WMW test takes a high combinatorial effort for large sample cohorts containing a significant number of ties. Hence, P value is frequently approximated by a normal distribution. We developed EDISON-WMW, a new approach to calculate the exact permutation of the two-tailed unpaired WMW test without any corrections required and allowing for ties. The method relies on dynamic programing to solve the combinatorial problem of the WMW test efficiently. Beyond a straightforward implementation of the algorithm, we presented different optimization strategies and developed a parallel solution. Using our program, the exact P value for large cohorts containing more than 1000 samples with ties can be calculated within minutes. We demonstrate the performance of this novel approach on randomly-generated data, benchmark it against 13 other commonly-applied approaches and moreover evaluate molecular biomarkers for lung carcinoma and chronic obstructive pulmonary disease (COPD. We found that approximated P values were generally higher than the exact solution provided by EDISON-WMW. Importantly, the algorithm can also be applied to high-throughput omics datasets, where hundreds or thousands of features are included. To provide easy access to the multi-threaded version of EDISON-WMW, a web-based solution of our algorithm is freely available at http://www.ccb.uni-saarland.de/software/wtest/.

Mathematical solution of multilevel fractional programming problem with fuzzy goal programming approach

Science.gov (United States)

Lachhwani, Kailash; Poonia, Mahaveer Prasad

2012-08-01

In this paper, we show a procedure for solving multilevel fractional programming problems in a large hierarchical decentralized organization using fuzzy goal programming approach. In the proposed method, the tolerance membership functions for the fuzzily described numerator and denominator part of the objective functions of all levels as well as the control vectors of the higher level decision makers are respectively defined by determining individual optimal solutions of each of the level decision makers. A possible relaxation of the higher level decision is considered for avoiding decision deadlock due to the conflicting nature of objective functions. Then, fuzzy goal programming approach is used for achieving the highest degree of each of the membership goal by minimizing negative deviational variables. We also provide sensitivity analysis with variation of tolerance values on decision vectors to show how the solution is sensitive to the change of tolerance values with the help of a numerical example.

A statistical state dynamics approach to wall turbulence.

Science.gov (United States)

Farrell, B F; Gayme, D F; Ioannou, P J

2017-03-13

This paper reviews results obtained using statistical state dynamics (SSD) that demonstrate the benefits of adopting this perspective for understanding turbulence in wall-bounded shear flows. The SSD approach used in this work employs a second-order closure that retains only the interaction between the streamwise mean flow and the streamwise mean perturbation covariance. This closure restricts nonlinearity in the SSD to that explicitly retained in the streamwise constant mean flow together with nonlinear interactions between the mean flow and the perturbation covariance. This dynamical restriction, in which explicit perturbation-perturbation nonlinearity is removed from the perturbation equation, results in a simplified dynamics referred to as the restricted nonlinear (RNL) dynamics. RNL systems, in which a finite ensemble of realizations of the perturbation equation share the same mean flow, provide tractable approximations to the SSD, which is equivalent to an infinite ensemble RNL system. This infinite ensemble system, referred to as the stochastic structural stability theory system, introduces new analysis tools for studying turbulence. RNL systems provide computationally efficient means to approximate the SSD and produce self-sustaining turbulence exhibiting qualitative features similar to those observed in direct numerical simulations despite greatly simplified dynamics. The results presented show that RNL turbulence can be supported by as few as a single streamwise varying component interacting with the streamwise constant mean flow and that judicious selection of this truncated support or 'band-limiting' can be used to improve quantitative accuracy of RNL turbulence. These results suggest that the SSD approach provides new analytical and computational tools that allow new insights into wall turbulence.This article is part of the themed issue 'Toward the development of high-fidelity models of wall turbulence at large Reynolds number'. © 2017 The Author(s).

Mathematical-programming approaches to test item pool design

NARCIS (Netherlands)

Veldkamp, Bernard P.; van der Linden, Willem J.; Ariel, A.

2002-01-01

This paper presents an approach to item pool design that has the potential to improve on the quality of current item pools in educational and psychological testing andhence to increase both measurement precision and validity. The approach consists of the application of mathematical programming

A note on dynamic programming in accounts receivable management

NARCIS (Netherlands)

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

1982-01-01

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

Possibilities of fractal analysis of the competitive dynamics: Approaches and procedures

Science.gov (United States)

Zagornaya, T. O.; Medvedeva, M. A.; Panova, V. L.; Isaichik, K. F.; Medvedev, A. N.

2017-11-01

The possibilities of the fractal approach are used for the study of non-linear nature of the competitive dynamics of the market of trading intermediaries. Based on a statistical study of the functioning of retail indicators in the region, the approach to the analysis of the characteristics of the competitive behavior of market participants is developed. The authors postulate the principles of studying the dynamics of competition as a result of changes in the characteristics of the vector and the competitive behavior of market agents.

Dynamics and Determinants of Supplemental Nutrition Assistance Program Participation from 2008 to 2012

OpenAIRE

James Mabli; Thomas Godfrey; Nancy Wemmerus; Joshua Leftin; Stephen Tordella

2014-01-01

Mathematica nutrition experts recently conducted research on the dynamics and determinants of Supplemental Nutrition Assistance Program (SNAP) participation. A study examines SNAP participation dynamics between October 2008 and December 2012. In particular, it describes patterns of SNAP entry, length of time on the program, and re-entry for policy-relevant subgroups, and discusses how these patterns have changed over time. This work was conducted in conjunction with an analysis presented on t...

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

DEFF Research Database (Denmark)

Rong, Aiying; Hakonen, Henri; Lahdelma, Risto

2009-01-01

efficiency of the plants. We introduce in this paper the DRDP-RSC algorithm, which is a dynamic regrouping based dynamic programming (DP) algorithm based on linear relaxation of the ON/OFF states of the units, sequential commitment of units in small groups. Relaxed states of the plants are used to reduce...... the dimension of the UC problem and dynamic regrouping is used to improve the solution quality. Numerical results based on real-life data sets show that this algorithm is efficient and optimal or near-optimal solutions with very small optimality gap are obtained....

A Multi-Agent Modelling Approach to Simulate Dynamic Activity-Travel Patterns

NARCIS (Netherlands)

Han, Q.; Arentze, T.A.; Timmermans, H.J.P.; Janssens, D.; Wets, G.; Bazzan, A.L.C.; Klügl, F.

2009-01-01

Contributing to the recent interest in the dynamics of activity-travel patterns, this chapter discusses a framework of an agent-based modeling approach focusing on the dynamic formation of (location) choice sets. Individual travelers are represented as agents, each with their cognition of the

Information-flux approach to multiple-spin dynamics

International Nuclear Information System (INIS)

Di Franco, C.; Paternostro, M.; Kim, M. S.; Palma, G. M.

2007-01-01

We introduce and formalize the concept of information flux in a many-body register as the influence that the dynamics of a specific element receive from any other element of the register. By quantifying the information flux in a protocol, we can design the most appropriate initial state of the system and, noticeably, the distribution of coupling strengths among the parts of the register itself. The intuitive nature of this tool and its flexibility, which allow for easily manageable numerical approaches when analytic expressions are not straightforward, are greatly useful in interacting many-body systems such as quantum spin chains. We illustrate the use of this concept in quantum cloning and quantum state transfer and we also sketch its extension to nonunitary dynamics

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

KAUST Repository

Kouramas, K.I.

2011-08-01

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

Myth 8: The "Patch-On" Approach to Programming Is Effective

Science.gov (United States)

Tomlinson, Carol Ann

2009-01-01

It is not likely that any group of educators of the gifted ever sat around a table and came to the decision that a "patch-on" approach to programming for bright learners represented best practice. Nonetheless, it is as common today as 25 years ago that programming for students identified as gifted often represents such an approach. Patch-on…

A Dynamic Health Assessment Approach for Shearer Based on Artificial Immune Algorithm

Directory of Open Access Journals (Sweden)

Zhongbin Wang

2016-01-01

Full Text Available In order to accurately identify the dynamic health of shearer, reducing operating trouble and production accident of shearer and improving coal production efficiency further, a dynamic health assessment approach for shearer based on artificial immune algorithm was proposed. The key technologies such as system framework, selecting the indicators for shearer dynamic health assessment, and health assessment model were provided, and the flowchart of the proposed approach was designed. A simulation example, with an accuracy of 96%, based on the collected data from industrial production scene was provided. Furthermore, the comparison demonstrated that the proposed method exhibited higher classification accuracy than the classifiers based on back propagation-neural network (BP-NN and support vector machine (SVM methods. Finally, the proposed approach was applied in an engineering problem of shearer dynamic health assessment. The industrial application results showed that the paper research achievements could be used combining with shearer automation control system in fully mechanized coal face. The simulation and the application results indicated that the proposed method was feasible and outperforming others.

Dynamics and control of quadcopter using linear model predictive control approach

Science.gov (United States)

Islam, M.; Okasha, M.; Idres, M. M.

2017-12-01

This paper investigates the dynamics and control of a quadcopter using the Model Predictive Control (MPC) approach. The dynamic model is of high fidelity and nonlinear, with six degrees of freedom that include disturbances and model uncertainties. The control approach is developed based on MPC to track different reference trajectories ranging from simple ones such as circular to complex helical trajectories. In this control technique, a linearized model is derived and the receding horizon method is applied to generate the optimal control sequence. Although MPC is computer expensive, it is highly effective to deal with the different types of nonlinearities and constraints such as actuators’ saturation and model uncertainties. The MPC parameters (control and prediction horizons) are selected by trial-and-error approach. Several simulation scenarios are performed to examine and evaluate the performance of the proposed control approach using MATLAB and Simulink environment. Simulation results show that this control approach is highly effective to track a given reference trajectory.

Stability of nanofluids: Molecular dynamic approach and experimental study

International Nuclear Information System (INIS)

Farzaneh, H.; Behzadmehr, A.; Yaghoubi, M.; Samimi, A.; Sarvari, S.M.H.

2016-01-01

Highlights: • Nanofluid stability is investigated and discussed. • A molecular dynamic approach, considering different forces on the nanoparticles, is adopted. • Stability diagrams are presented for different thermo-fluid conditions. • An experimental investigation is carried out to confirm the theoretical approach. - Abstract: Nanofluids as volumetric absorbent in solar energy conversion devices or as working fluid in different heat exchangers have been proposed by various researchers. However, dispersion stability of nanofluids is an important issue that must be well addressed before any industrial applications. Conditions such as severe temperature gradient, high temperature of heat transfer fluid, nanoparticle mean diameters and types of nanoparticles and base fluid are among the most effective parameters on the stability of nanofluid. A molecular dynamic approach, considering kinetic energy of nanoparticles and DLVO potential energy between nanoparticles, is adopted to study the nanofluid stability for different nanofluids at different working conditions. Different forces such as Brownian, thermophoresis, drag and DLVO are considered to introduce the stability diagrams. The latter presents the conditions for which a nanofluid can be stable. In addition an experimental investigation is carried out to find a stable nanofluid and to show the validity of the theoretical approach. There is a good agreement between the experimental and theoretical results that confirms the validity of our theoretical approach.

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

International Nuclear Information System (INIS)

Hancevic, Pedro Ignacio

2017-01-01

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

BEAMPATH: a program library for beam dynamics simulation in linear accelerators

International Nuclear Information System (INIS)

Batygin, Y.K.

1992-01-01

A structured programming technique was used to develop software for space charge dominated beams investigation in linear accelerators. The method includes hierarchical program design using program independent modules and a flexible combination of modules to provide a most effective version of structure for every specific case of simulation. A modular program BEAMPATH was developed for 2D and 3D particle-in-cell simulation of beam dynamics in a structure containing RF gaps, radio-frequency quadrupoles (RFQ), multipole lenses, waveguides, bending magnets and solenoids. (author) 5 refs.; 2 figs

Gas-Phase Molecular Dynamics: Theoretical Studies in Spectroscopy and Chemical Dynamics

Energy Technology Data Exchange (ETDEWEB)

Yu, H.G.; Muckerman, J.T.

2010-06-01

The goal of this program is the development and application of computational methods for studying chemical reaction dynamics and molecular spectroscopy in the gas phase. We are interested in developing rigorous quantum dynamics algorithms for small polyatomic systems and in implementing approximate approaches for complex ones. Particular focus is on the dynamics and kinetics of chemical reactions and on the rovibrational spectra of species involved in combustion processes. This research also explores the potential energy surfaces of these systems of interest using state-of-the-art quantum chemistry methods.

A dynamic approach to recognition memory.

Science.gov (United States)

Cox, Gregory E; Shiffrin, Richard M

2017-11-01

We present a dynamic model of memory that integrates the processes of perception, retrieval from knowledge, retrieval of events, and decision making as these evolve from 1 moment to the next. The core of the model is that recognition depends on tracking changes in familiarity over time from an initial baseline generally determined by context, with these changes depending on the availability of different kinds of information at different times. A mathematical implementation of this model leads to precise, accurate predictions of accuracy, response time, and speed-accuracy trade-off in episodic recognition at the levels of both groups and individuals across a variety of paradigms. Our approach leads to novel insights regarding word frequency, speeded responding, context reinstatement, short-term priming, similarity, source memory, and associative recognition, revealing how the same set of core dynamic principles can help unify otherwise disparate phenomena in the study of memory. (PsycINFO Database Record (c) 2017 APA, all rights reserved).

Cumulant approach to dynamical correlation functions at finite temperatures

International Nuclear Information System (INIS)

Tran Minhtien.

1993-11-01

A new theoretical approach, based on the introduction of cumulants, to calculate thermodynamic averages and dynamical correlation functions at finite temperatures is developed. The method is formulated in Liouville instead of Hilbert space and can be applied to operators which do not require to satisfy fermion or boson commutation relations. The application of the partitioning and projection methods for the dynamical correlation functions is discussed. The present method can be applied to weakly as well as to strongly correlated systems. (author). 9 refs

An approach for solving linear fractional programming problems ...

African Journals Online (AJOL)

The paper presents a new approach for solving a fractional linear programming problem in which the objective function is a linear fractional function, while the constraint functions are in the form of linear inequalities. The approach adopted is based mainly upon solving the problem algebraically using the concept of duality ...

Dynamics of safety performance and culture: a group model building approach.

Science.gov (United States)

Goh, Yang Miang; Love, Peter E D; Stagbouer, Greg; Annesley, Chris

2012-09-01

The management of occupational health and safety (OHS) including safety culture interventions is comprised of complex problems that are often hard to scope and define. Due to the dynamic nature and complexity of OHS management, the concept of system dynamics (SD) is used to analyze accident prevention. In this paper, a system dynamics group model building (GMB) approach is used to create a causal loop diagram of the underlying factors influencing the OHS performance of a major drilling and mining contractor in Australia. While the organization has invested considerable resources into OHS their disabling injury frequency rate (DIFR) has not been decreasing. With this in mind, rich individualistic knowledge about the dynamics influencing the DIFR was acquired from experienced employees with operations, health and safety and training background using a GMB workshop. Findings derived from the workshop were used to develop a series of causal loop diagrams that includes a wide range of dynamics that can assist in better understanding the causal influences OHS performance. The causal loop diagram provides a tool for organizations to hypothesize the dynamics influencing effectiveness of OHS management, particularly the impact on DIFR. In addition the paper demonstrates that the SD GMB approach has significant potential in understanding and improving OHS management. Copyright © 2011 Elsevier Ltd. All rights reserved.

A dynamic approach to dependability studies

International Nuclear Information System (INIS)

Labeau, P.E.

2008-01-01

Dependability studies have now become an important part of the performance management of industrial plants. These last decades, several methods have been proposed and widely used for the analysis of systems of components subject to degradation and failure. These methods are based either on Boolean representations (for example, event trees/fault trees), or on discrete-state models (Markovian reliability, Petri nets, Bayesian networks...). However, the underlying, inherently continuous, physical processes have scarcely been accounted for, at least in an integrated fashion, in dependability studies. This paper first describes, through simple cases, the limitations of discrete approaches and the need of hybrid, discrete-continuous methods. It then summarizes the main concepts of dynamic reliability. Finally, some possible application domains are presented, as well as challenges that still need to be tackled to favour the diffusion of this approach among industrial circles. (author)

Bending localization of nitrous oxide under anharmonicity and Fermi coupling: the dynamical potential approach

International Nuclear Information System (INIS)

Zhang Chi; Wu Guo-Zhen; Fang Chao

2010-01-01

This paper studies the vibrational nonlinear dynamics of nitrous oxide with Fermi coupling between the symmetric stretching and bending coordinates by classical dynamical potential approach. This is a global approach in the sense that the overall dynamics is evidenced by the classical nonlinear variables such as the fixed points and the focus are on a set of levels instead of individual ones. The dynamics of nitrous oxide is demonstrated to be not so much dependent on the excitation energy. Moreover, the localized bending mode is shown to be ubiquitous in all the energy range studied

Quantum wavepacket ab initio molecular dynamics: an approach for computing dynamically averaged vibrational spectra including critical nuclear quantum effects.

Science.gov (United States)

Sumner, Isaiah; Iyengar, Srinivasan S

2007-10-18

We have introduced a computational methodology to study vibrational spectroscopy in clusters inclusive of critical nuclear quantum effects. This approach is based on the recently developed quantum wavepacket ab initio molecular dynamics method that combines quantum wavepacket dynamics with ab initio molecular dynamics. The computational efficiency of the dynamical procedure is drastically improved (by several orders of magnitude) through the utilization of wavelet-based techniques combined with the previously introduced time-dependent deterministic sampling procedure measure to achieve stable, picosecond length, quantum-classical dynamics of electrons and nuclei in clusters. The dynamical information is employed to construct a novel cumulative flux/velocity correlation function, where the wavepacket flux from the quantized particle is combined with classical nuclear velocities to obtain the vibrational density of states. The approach is demonstrated by computing the vibrational density of states of [Cl-H-Cl]-, inclusive of critical quantum nuclear effects, and our results are in good agreement with experiment. A general hierarchical procedure is also provided, based on electronic structure harmonic frequencies, classical ab initio molecular dynamics, computation of nuclear quantum-mechanical eigenstates, and employing quantum wavepacket ab initio dynamics to understand vibrational spectroscopy in hydrogen-bonded clusters that display large degrees of anharmonicities.

Data and Dynamics Driven Approaches for Modelling and Forecasting the Red Sea Chlorophyll

KAUST Repository

Dreano, Denis

2017-05-31

Phytoplankton is at the basis of the marine food chain and therefore play a fundamental role in the ocean ecosystem. However, the large-scale phytoplankton dynamics of the Red Sea are not well understood yet, mainly due to the lack of historical in situ measurements. As a result, our knowledge in this area relies mostly on remotely-sensed observations and large-scale numerical marine ecosystem models. Models are very useful to identify the mechanisms driving the variations in chlorophyll concentration and have practical applications for fisheries operation and harmful algae blooms monitoring. Modelling approaches can be divided between physics- driven (dynamical) approaches, and data-driven (statistical) approaches. Dynamical models are based on a set of differential equations representing the transfer of energy and matter between different subsets of the biota, whereas statistical models identify relationships between variables based on statistical relations within the available data. The goal of this thesis is to develop, implement and test novel dynamical and statistical modelling approaches for studying and forecasting the variability of chlorophyll concentration in the Red Sea. These new models are evaluated in term of their ability to efficiently forecast and explain the regional chlorophyll variability. We also propose innovative synergistic strategies to combine data- and physics-driven approaches to further enhance chlorophyll forecasting capabilities and efficiency.

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

Science.gov (United States)

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

2016-11-01

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

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.

A New Approach to Programming Language Education for Beginners with Top-Down Learning

Directory of Open Access Journals (Sweden)

Daisuke Saito

2013-12-01

Full Text Available There are two basic approaches in learning new programming language: a bottom-up approach and a top-down approach. It has been said that if a learner has already acquired one language, the top-down approach is more efficient to learn another while, for a person who has absolutely no knowledge of any programming languages; the bottom-up approach is preferable. The major problem of the bottom-up approach is that it requires longer period to acquire the language. For quicker learning, this paper applies a top-down approach for a beginners who has not yet acquired any programming languages.

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

Computational fluid dynamics a practical approach

CERN Document Server

Tu, Jiyuan; Liu, Chaoqun

2018-01-01

Computational Fluid Dynamics: A Practical Approach, Third Edition, is an introduction to CFD fundamentals and commercial CFD software to solve engineering problems. The book is designed for a wide variety of engineering students new to CFD, and for practicing engineers learning CFD for the first time. Combining an appropriate level of mathematical background, worked examples, computer screen shots, and step-by-step processes, this book walks the reader through modeling and computing, as well as interpreting CFD results. This new edition has been updated throughout, with new content and improved figures, examples and problems.

New Approach for Nuclear Safety and Regulation - Application of Complexity Theory and System Dynamics

International Nuclear Information System (INIS)

Choi, Kwang Sik; Choi, Young Sung; Han, Kyu Hyun; Kim, Do Hyoung

2007-01-01

The methodology being used today for assuring nuclear safety is based on analytic approaches. In the 21st century, holistic approaches are increasingly used over traditional analytic method that is based on reductionism. Presently, it leads to interest in complexity theory or system dynamics. In this paper, we review global academic trends, social environments, concept of nuclear safety and regulatory frameworks for nuclear safety. We propose a new safety paradigm and also regulatory approach using holistic approach and system dynamics now in fashion

A multithreaded parallel implementation of a dynamic programming algorithm for sequence comparison.

Science.gov (United States)

Martins, W S; Del Cuvillo, J B; Useche, F J; Theobald, K B; Gao, G R

2001-01-01

This paper discusses the issues involved in implementing a dynamic programming algorithm for biological sequence comparison on a general-purpose parallel computing platform based on a fine-grain event-driven multithreaded program execution model. Fine-grain multithreading permits efficient parallelism exploitation in this application both by taking advantage of asynchronous point-to-point synchronizations and communication with low overheads and by effectively tolerating latency through the overlapping of computation and communication. We have implemented our scheme on EARTH, a fine-grain event-driven multithreaded execution and architecture model which has been ported to a number of parallel machines with off-the-shelf processors. Our experimental results show that the dynamic programming algorithm can be efficiently implemented on EARTH systems with high performance (e.g., speedup of 90 on 120 nodes), good programmability and reasonable cost.

Iterative Adaptive Dynamic Programming for Solving Unknown Nonlinear Zero-Sum Game Based on Online Data.

Science.gov (United States)

Zhu, Yuanheng; Zhao, Dongbin; Li, Xiangjun

2017-03-01

H ∞ control is a powerful method to solve the disturbance attenuation problems that occur in some control systems. The design of such controllers relies on solving the zero-sum game (ZSG). But in practical applications, the exact dynamics is mostly unknown. Identification of dynamics also produces errors that are detrimental to the control performance. To overcome this problem, an iterative adaptive dynamic programming algorithm is proposed in this paper to solve the continuous-time, unknown nonlinear ZSG with only online data. A model-free approach to the Hamilton-Jacobi-Isaacs equation is developed based on the policy iteration method. Control and disturbance policies and value are approximated by neural networks (NNs) under the critic-actor-disturber structure. The NN weights are solved by the least-squares method. According to the theoretical analysis, our algorithm is equivalent to a Gauss-Newton method solving an optimization problem, and it converges uniformly to the optimal solution. The online data can also be used repeatedly, which is highly efficient. Simulation results demonstrate its feasibility to solve the unknown nonlinear ZSG. When compared with other algorithms, it saves a significant amount of online measurement time.

Coupled information diffusion--pest dynamics models predict delayed benefits of farmer cooperation in pest management programs.

Science.gov (United States)

Rebaudo, François; Dangles, Olivier

2011-10-01

Worldwide, the theory and practice of agricultural extension system have been dominated for almost half a century by Rogers' "diffusion of innovation theory". In particular, the success of integrated pest management (IPM) extension programs depends on the effectiveness of IPM information diffusion from trained farmers to other farmers, an important assumption which underpins funding from development organizations. Here we developed an innovative approach through an agent-based model (ABM) combining social (diffusion theory) and biological (pest population dynamics) models to study the role of cooperation among small-scale farmers to share IPM information for controlling an invasive pest. The model was implemented with field data, including learning processes and control efficiency, from large scale surveys in the Ecuadorian Andes. Our results predict that although cooperation had short-term costs for individual farmers, it paid in the long run as it decreased pest infestation at the community scale. However, the slow learning process placed restrictions on the knowledge that could be generated within farmer communities over time, giving rise to natural lags in IPM diffusion and applications. We further showed that if individuals learn from others about the benefits of early prevention of new pests, then educational effort may have a sustainable long-run impact. Consistent with models of information diffusion theory, our results demonstrate how an integrated approach combining ecological and social systems would help better predict the success of IPM programs. This approach has potential beyond pest management as it could be applied to any resource management program seeking to spread innovations across populations.

Multifaceted Approach to Designing an Online Masters Program.

Science.gov (United States)

McNeil, Sara G.; Chernish, William N.; DeFranco, Agnes L.

At the Conrad N. Hilton College of Hotel and Restaurant Management at the University of Houston (Texas), the faculty and administrators made a conscious effort to take a broad, extensive approach to designing and implementing a fully online masters program. This approach was entered in a comprehensive needs assessment model and sought input from…

Distributed Memory Programming on Many-Cores

DEFF Research Database (Denmark)

Berthold, Jost; Dieterle, Mischa; Lobachev, Oleg

2009-01-01

Eden is a parallel extension of the lazy functional language Haskell providing dynamic process creation and automatic data exchange. As a Haskell extension, Eden takes a high-level approach to parallel programming and thereby simplifies parallel program development. The current implementation is ...

Decomposing the misery index: A dynamic approach

Directory of Open Access Journals (Sweden)

Ivan K. Cohen

2014-12-01

Full Text Available The misery index (the unweighted sum of unemployment and inflation rates was probably the first attempt to develop a single statistic to measure the level of a population’s economic malaise. In this letter, we develop a dynamic approach to decompose the misery index using two basic relations of modern macroeconomics: the expectations-augmented Phillips curve and Okun’s law. Our reformulation of the misery index is closer in spirit to Okun’s idea. However, we are able to offer an improved version of the index, mainly based on output and unemployment. Specifically, this new Okun’s index measures the level of economic discomfort as a function of three key factors: (1 the misery index in the previous period; (2 the output gap in growth rate terms; and (3 cyclical unemployment. This dynamic approach differs substantially from the standard one utilised to develop the misery index, and allow us to obtain an index with five main interesting features: (1 it focuses on output, unemployment and inflation; (2 it considers only objective variables; (3 it allows a distinction between short-run and long-run phenomena; (4 it places more importance on output and unemployment rather than inflation; and (5 it weights recessions more than expansions.

A dynamic approach to real-time performance measurement in design projects

DEFF Research Database (Denmark)

Skec, Stanko; Cash, Philip; Storga, Mario

2017-01-01

Recent developments in engineering design management point to the need for more dynamic, fine-grain measurement approaches able to deal with multi-dimensional, cross-level process performance in product design. Thus, this paper proposes a new approach to the measurement and management of individu...

Generalized Models from Beta(p, 2) Densities with Strong Allee Effect: Dynamical Approach

OpenAIRE

Aleixo, Sandra M.; Rocha, J. Leonel

2012-01-01

A dynamical approach to study the behaviour of generalized populational growth models from Beta(p, 2) densities, with strong Allee effect, is presented. The dynamical analysis of the respective unimodal maps is performed using symbolic dynamics techniques. The complexity of the correspondent discrete dynamical systems is measured in terms of topological entropy. Different populational dynamics regimes are obtained when the intrinsic growth rates are modified: extinction, bistability, chaotic ...

A spectral approach for discrete dislocation dynamics simulations of nanoindentation

Science.gov (United States)

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

2018-07-01

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

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.

Computational approach to large quantum dynamical problems

International Nuclear Information System (INIS)

Friesner, R.A.; Brunet, J.P.; Wyatt, R.E.; Leforestier, C.; Binkley, S.

1987-01-01

The organizational structure is described for a new program that permits computations on a variety of quantum mechanical problems in chemical dynamics and spectroscopy. Particular attention is devoted to developing and using algorithms that exploit the capabilities of current vector supercomputers. A key component in this procedure is the recursive transformation of the large sparse Hamiltonian matrix into a much smaller tridiagonal matrix. An application to time-dependent laser molecule energy transfer is presented. Rate of energy deposition in the multimode molecule for systematic variations in the molecular intermode coupling parameters is emphasized

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.

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

OpenAIRE

Marcin Szuster; Zenon Hendzel

2014-01-01

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

Software complex for developing dynamically packed program system for experiment automation

International Nuclear Information System (INIS)

Baluka, G.; Salamatin, I.M.

1985-01-01

Software complex for developing dynamically packed program system for experiment automation is considered. The complex includes general-purpose programming systems represented as the RT-11 standard operating system and specially developed problem-oriented moduli providing execution of certain jobs. The described complex is realized in the PASKAL' and MAKRO-2 languages and it is rather flexible to variations of the technique of the experiment

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

Science.gov (United States)

2012-03-30

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

A Theoretical Approach to Understanding Population Dynamics with Seasonal Developmental Durations

Science.gov (United States)

Lou, Yijun; Zhao, Xiao-Qiang

2017-04-01

There is a growing body of biological investigations to understand impacts of seasonally changing environmental conditions on population dynamics in various research fields such as single population growth and disease transmission. On the other side, understanding the population dynamics subject to seasonally changing weather conditions plays a fundamental role in predicting the trends of population patterns and disease transmission risks under the scenarios of climate change. With the host-macroparasite interaction as a motivating example, we propose a synthesized approach for investigating the population dynamics subject to seasonal environmental variations from theoretical point of view, where the model development, basic reproduction ratio formulation and computation, and rigorous mathematical analysis are involved. The resultant model with periodic delay presents a novel term related to the rate of change of the developmental duration, bringing new challenges to dynamics analysis. By investigating a periodic semiflow on a suitably chosen phase space, the global dynamics of a threshold type is established: all solutions either go to zero when basic reproduction ratio is less than one, or stabilize at a positive periodic state when the reproduction ratio is greater than one. The synthesized approach developed here is applicable to broader contexts of investigating biological systems with seasonal developmental durations.

Enhanced dynamic data-driven fault detection approach: Application to a two-tank heater system

KAUST Repository

Harrou, Fouzi

2018-02-12

Principal components analysis (PCA) has been intensively studied and used in monitoring industrial systems. However, data generated from chemical processes are usually correlated in time due to process dynamics, which makes the fault detection based on PCA approach a challenging task. Accounting for the dynamic nature of data can also reflect the performance of the designed fault detection approaches. In PCA-based methods, this dynamic characteristic of the data can be accounted for by using dynamic PCA (DPCA), in which lagged variables are used in the PCA model to capture the time evolution of the process. This paper presents a new approach that combines the DPCA to account for autocorrelation in data and generalized likelihood ratio (GLR) test to detect faults. A DPCA model is applied to perform dimension reduction while appropriately considering the temporal relationships in the data. Specifically, the proposed approach uses the DPCA to generate residuals, and then apply GLR test to reveal any abnormality. The performances of the proposed method are evaluated through a continuous stirred tank heater system.

Effects produced by oscillations applied to nonlinear dynamic systems: a general approach and examples

DEFF Research Database (Denmark)

Blekhman, I. I.; Sorokin, V. S.

2016-01-01

A general approach to study effects produced by oscillations applied to nonlinear dynamic systems is developed. It implies a transition from initial governing equations of motion to much more simple equations describing only the main slow component of motions (the vibro-transformed dynamics.......g., the requirement for the involved nonlinearities to be weak. The approach is illustrated by several relevant examples from various fields of science, e.g., mechanics, physics, chemistry and biophysics....... equations). The approach is named as the oscillatory strobodynamics, since motions are perceived as under a stroboscopic light. The vibro-transformed dynamics equations comprise terms that capture the averaged effect of oscillations. The method of direct separation of motions appears to be an efficient...

Optimal Charging of Electric Drive Vehicles: A Dynamic Programming Approach

DEFF Research Database (Denmark)

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

2013-01-01

, therefore, we propose an ex ante vehicle aggregation approach. We illustrate the results in a Danish case study and find that, although optimal management of the vehicles does not allow for storage and day-to-day flexibility in the electricity system, the market provides incentive for intra-day flexibility....

On the implicit programming approach in a class of mathematical programs with equilibrium constraints

Czech Academy of Sciences Publication Activity Database

Outrata, Jiří; Červinka, Michal

2009-01-01

Roč. 38, 4B (2009), s. 1557-1574 ISSN 0324-8569 R&D Projects: GA ČR GA201/09/1957 Institutional research plan: CEZ:AV0Z10750506 Keywords : mathematical problem with equilibrium constraint * state constraints * implicit programming * calmness * exact penalization Subject RIV: BA - General Mathematics Impact factor: 0.378, year: 2009 http://library.utia.cas.cz/separaty/2010/MTR/outrata-on the implicit programming approach in a class of mathematical programs with equilibrium constraints.pdf

A cutting- plane approach for semi- infinite mathematical programming

African Journals Online (AJOL)

Many situations ranging from industrial to social via economic and environmental problems may be cast into a Semi-infinite mathematical program. In this paper, the cutting-plane approach which lends itself better for standard non-linear programs is exploited with good reasons for grappling with linear, convex and ...

Pareto optimization in algebraic dynamic programming.

Science.gov (United States)

Saule, Cédric; Giegerich, Robert

2015-01-01

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

The NASA Computational Fluid Dynamics (CFD) program - Building technology to solve future challenges

Science.gov (United States)

Richardson, Pamela F.; Dwoyer, Douglas L.; Kutler, Paul; Povinelli, Louis A.

1993-01-01

This paper presents the NASA Computational Fluid Dynamics program in terms of a strategic vision and goals as well as NASA's financial commitment and personnel levels. The paper also identifies the CFD program customers and the support to those customers. In addition, the paper discusses technical emphasis and direction of the program and some recent achievements. NASA's Ames, Langley, and Lewis Research Centers are the research hubs of the CFD program while the NASA Headquarters Office of Aeronautics represents and advocates the program.

Field theoretic approach to dynamical orbital localization in ab initio molecular dynamics

International Nuclear Information System (INIS)

Thomas, Jordan W.; Iftimie, Radu; Tuckerman, Mark E.

2004-01-01

Techniques from gauge-field theory are employed to derive an alternative formulation of the Car-Parrinello ab initio molecular-dynamics method that allows maximally localized Wannier orbitals to be generated dynamically as the calculation proceeds. In particular, the Car-Parrinello Lagrangian is mapped onto an SU(n) non-Abelian gauge-field theory and the fictitious kinetic energy in the Car-Parrinello Lagrangian is modified to yield a fully gauge-invariant form. The Dirac gauge-fixing method is then employed to derive a set of equations of motion that automatically maintain orbital locality by restricting the orbitals to remain in the 'Wannier gauge'. An approximate algorithm for integrating the equations of motion that is stable and maintains orbital locality is then developed based on the exact equations of motion. It is shown in a realistic application (64 water molecules plus one hydrogen-chloride molecule in a periodic box) that orbital locality can be maintained with only a modest increase in CPU time. The ability to keep orbitals localized in an ab initio molecular-dynamics calculation is a crucial ingredient in the development of emerging linear scaling approaches

Development and demonstration program for dynamic nuclear materials control

International Nuclear Information System (INIS)

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

1978-01-01

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

Concurrent object-oriented programming: The MP-Eiffel approach

OpenAIRE

Silva, Miguel Augusto Mendes Oliveira e

2004-01-01

This article evaluates several possible approaches for integrating concurrency into object-oriented programming languages, presenting afterwards, a new language named MP-Eiffel. MP-Eiffel was designed attempting to include all the essential properties of both concurrent and object-oriented programming with simplicity and safety. A special care was taken to achieve the orthogonality of all the language mechanisms, allowing their joint use without unsafe side-effects (such as inh...

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

Toward personalised and dynamic cultural routing: a three-level approach

NARCIS (Netherlands)

Aksenov, P.; Kemperman, A.D.A.M.; Arentze, T.A.

2014-01-01

This paper introduces the concept of “smart routing” as a recommender system for tourists that takes into account the dynamics of their personal user profiles. The concept relies on three levels of support: 1) programming the tour, i.e. selecting a set of relevant points of interests (POIs) to be

A temporal interpolation approach for dynamic reconstruction in perfusion CT

International Nuclear Information System (INIS)

Montes, Pau; Lauritsch, Guenter

2007-01-01

This article presents a dynamic CT reconstruction algorithm for objects with time dependent attenuation coefficient. Projection data acquired over several rotations are interpreted as samples of a continuous signal. Based on this idea, a temporal interpolation approach is proposed which provides the maximum temporal resolution for a given rotational speed of the CT scanner. Interpolation is performed using polynomial splines. The algorithm can be adapted to slow signals, reducing the amount of data acquired and the computational cost. A theoretical analysis of the approximations made by the algorithm is provided. In simulation studies, the temporal interpolation approach is compared with three other dynamic reconstruction algorithms based on linear regression, linear interpolation, and generalized Parker weighting. The presented algorithm exhibits the highest temporal resolution for a given sampling interval. Hence, our approach needs less input data to achieve a certain quality in the reconstruction than the other algorithms discussed or, equivalently, less x-ray exposure and computational complexity. The proposed algorithm additionally allows the possibility of using slow rotating scanners for perfusion imaging purposes

Endocardium and Epicardium Segmentation in MR Images Based on Developed Otsu and Dynamic Programming

Directory of Open Access Journals (Sweden)

Shengzhou XU

2014-03-01

Full Text Available In order to accurately extract the endocardium and epicardium of the left ventricle from cardiac magnetic resonance (MR images, a method based on developed Otsu and dynamic programming has been proposed. First, regions with high gray value are divided into several left ventricle candidate regions by the developed Otsu algorithm, which based on constraining the search range of the ideal segmentation threshold. Then, left ventricular blood pool is selected from the candidate regions and its convex hull is found out as the endocardium. The epicardium is derived by applying dynamic programming method to find a closed path with minimum local cost. The local cost function of the dynamic programming method consists of two factors: boundary gradient and shape features. In order to improve the accuracy of segmentation, a non-maxima gradient suppression technique is adopted to get the boundary gradient. The experimental result of 138 MR images show that the method proposed has high accuracy and robustness.

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

The Configuration Of Supply Chain Agritourism To Improve The Performance With Dynamic Programming

Directory of Open Access Journals (Sweden)

Sahnaz Ubud

2015-09-01

Full Text Available The purposes of this research is to implementation about  the configuration of Supply Chain Agritourism in Mekarsari Tours Garden and result a decision making  which must be done by top level management about their supply chain configuration. Because now Mekarsari, the biggest fruit garden in the world, have a lot of type of fruit which must be supply for the customer depend on the season with on time. So Mekarsari must know about their configuration from supplier to customer to improve their performance. The Respondents  for this research is selected based on the results of supply chain maping from the worker in the garden, the top level management until the end customer. Supply chian network is formed consisting of farm workers to the end customers, especially those located in the tourist are of green land zone.  The type of data is displayed in a supply chain modeling approach is to use the dynamic system. It’s consists of numeric data, the written data and mental models.  That data is collected and processed into a design model. The design model is using system dynamics methodology. In compiling the system dynamics model has been used software Vensim Professional Academic Ventana 5.7. The result of this research is a configuration of Supply Chain Agritourism which is developed from the supplier until the end customer in Mekarsari tours Garden. From the Dynamic Programming, the result is a decision making which must be done by the top level management to improve the supply chain performance, especially in the green land zone.

Detection and Extraction of Roads from High Resolution Satellites Images with Dynamic Programming

Science.gov (United States)

Benzouai, Siham; Smara, Youcef

2010-12-01

The advent of satellite images allows now a regular and a fast digitizing and update of geographic data, especially roads which are very useful for Geographic Information Systems (GIS) applications such as transportation, urban pollution, geomarketing, etc. For this, several studies have been conducted to automate roads extraction in order to minimize the manual processes [4]. In this work, we are interested in roads extraction from satellite imagery with high spatial resolution (at best equal to 10 m). The method is semi automatic and follows a linear approach where road is considered as a linear object. As roads extraction is a pattern recognition problem, it is useful, above all, to characterize roads. After, we realize a pre-processing by applying an Infinite Size Edge Filter -ISEF- and processing method based on dynamic programming concept, in particular, Fishler algorithm designed by F*.

RichMol: A general variational approach for rovibrational molecular dynamics in external electric fields

Science.gov (United States)

Owens, Alec; Yachmenev, Andrey

2018-03-01

In this paper, a general variational approach for computing the rovibrational dynamics of polyatomic molecules in the presence of external electric fields is presented. Highly accurate, full-dimensional variational calculations provide a basis of field-free rovibrational states for evaluating the rovibrational matrix elements of high-rank Cartesian tensor operators and for solving the time-dependent Schrödinger equation. The effect of the external electric field is treated as a multipole moment expansion truncated at the second hyperpolarizability interaction term. Our fully numerical and computationally efficient method has been implemented in a new program, RichMol, which can simulate the effects of multiple external fields of arbitrary strength, polarization, pulse shape, and duration. Illustrative calculations of two-color orientation and rotational excitation with an optical centrifuge of NH3 are discussed.

Linear decomposition approach for a class of nonconvex programming problems.

Science.gov (United States)

Shen, Peiping; Wang, Chunfeng

2017-01-01

This paper presents a linear decomposition approach for a class of nonconvex programming problems by dividing the input space into polynomially many grids. It shows that under certain assumptions the original problem can be transformed and decomposed into a polynomial number of equivalent linear programming subproblems. Based on solving a series of liner programming subproblems corresponding to those grid points we can obtain the near-optimal solution of the original problem. Compared to existing results in the literature, the proposed algorithm does not require the assumptions of quasi-concavity and differentiability of the objective function, and it differs significantly giving an interesting approach to solving the problem with a reduced running time.

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

Energy Technology Data Exchange (ETDEWEB)

Montoya-Castillo, Andrés, E-mail: am3720@columbia.edu; Reichman, David R., E-mail: drr2103@columbia.edu [Department of Chemistry, Columbia University, New York, New York 10027 (United States)

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.

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

International Nuclear Information System (INIS)

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

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

Variational approach to nuclear fluid dynamics

International Nuclear Information System (INIS)

Da Providencia, J.P.; Holzwarth, G.

1983-01-01

A variational derivation of a fluid-dynamical formalism for finite Fermi systems is presented which is based on a single determinant as variational function and does not exclude the possibility of transverse flow. Therefore the explicit specification of the time-odd part has to go beyond the local chi-approximation, while the time-even part is taken in the generalized scaling form. The necessary boundary conditions are derived from the variation of the lagrangian. The results confirm previous simplified approaches to a remarkable degree for quadrupole modes; for other multipolarities the deviations are much less than might be expected according to a sizeable change in the transverse sound speed. (orig.)

A program for dynamic noise investigations of reactor systems

International Nuclear Information System (INIS)

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

1980-01-01

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

A Dynamic Linear Modeling Approach to Public Policy Change

DEFF Research Database (Denmark)

Loftis, Matthew; Mortensen, Peter Bjerre

2017-01-01

Theories of public policy change, despite their differences, converge on one point of strong agreement. The relationship between policy and its causes can and does change over time. This consensus yields numerous empirical implications, but our standard analytical tools are inadequate for testing...... them. As a result, the dynamic and transformative relationships predicted by policy theories have been left largely unexplored in time-series analysis of public policy. This paper introduces dynamic linear modeling (DLM) as a useful statistical tool for exploring time-varying relationships in public...... policy. The paper offers a detailed exposition of the DLM approach and illustrates its usefulness with a time series analysis of U.S. defense policy from 1957-2010. The results point the way for a new attention to dynamics in the policy process and the paper concludes with a discussion of how...

Spreading dynamics on complex networks: a general stochastic approach.

Science.gov (United States)

Noël, Pierre-André; Allard, Antoine; Hébert-Dufresne, Laurent; Marceau, Vincent; Dubé, Louis J

2014-12-01

Dynamics on networks is considered from the perspective of Markov stochastic processes. We partially describe the state of the system through network motifs and infer any missing data using the available information. This versatile approach is especially well adapted for modelling spreading processes and/or population dynamics. In particular, the generality of our framework and the fact that its assumptions are explicitly stated suggests that it could be used as a common ground for comparing existing epidemics models too complex for direct comparison, such as agent-based computer simulations. We provide many examples for the special cases of susceptible-infectious-susceptible and susceptible-infectious-removed dynamics (e.g., epidemics propagation) and we observe multiple situations where accurate results may be obtained at low computational cost. Our perspective reveals a subtle balance between the complex requirements of a realistic model and its basic assumptions.

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

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

Directory of Open Access Journals (Sweden)

Farhad Ghassemi Tari

2016-01-01

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

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

A new and unifying approach to spin dynamics and beam polarization in storage rings

International Nuclear Information System (INIS)

Heinemann, K.; Ellison, J.A.

2014-09-01

With this paper we extend our studies on polarized beams by distilling tools from the theory of principal bundles. Four major theorems are presented, one which ties invariant fields with the notion of normal form, one which allows one to compare different invariant fields, and two that relate the existence of invariant fields to the existence of certain invariant sets and relations between them. We then apply the theory to the dynamics of spin-1/2 and spin-1 particles and their density matrices describing statistically the particle-spin content of bunches. Our approach thus unifies the spin-vector dynamics from the T-BMT equation with the spin-tensor dynamics and other dynamics. This unifying aspect of our approach relates the examples elegantly and uncovers relations between the various underlying dynamical systems in a transparent way.

Self-regulated learning in higher education: strategies adopted by computer programming students when supported by the SimProgramming approach

Directory of Open Access Journals (Sweden)

Daniela Pedrosa

Full Text Available Abstract The goal of the SimProgramming approach is to help students overcome their learning difficulties in the transition from entry-level to advanced computer programming, developing an appropriate set of learning strategies. We implemented it at the University of Trás-os-Montes e Alto Douro (Portugal, in two courses (PM3 and PM4 of the bachelor programmes in Informatics Engineering and ICT. We conducted semi-structured interviews with students (n=38 at the end of the courses, to identify the students’ strategies for self-regulation of learning in the assignment. We found that students changed some of their strategies from one course edition to the following one and that changes are related to the SimProgramming approach. We believe that changes to the educational approach were appropriate to support the assignment goals. We recommend applying the SimProgramming approach in other educational contexts, to improve educational practices by including techniques to help students in their learning.

An information-theoretic approach to assess practical identifiability of parametric dynamical systems.

Science.gov (United States)

Pant, Sanjay; Lombardi, Damiano

2015-10-01

A new approach for assessing parameter identifiability of dynamical systems in a Bayesian setting is presented. The concept of Shannon entropy is employed to measure the inherent uncertainty in the parameters. The expected reduction in this uncertainty is seen as the amount of information one expects to gain about the parameters due to the availability of noisy measurements of the dynamical system. Such expected information gain is interpreted in terms of the variance of a hypothetical measurement device that can measure the parameters directly, and is related to practical identifiability of the parameters. If the individual parameters are unidentifiable, correlation between parameter combinations is assessed through conditional mutual information to determine which sets of parameters can be identified together. The information theoretic quantities of entropy and information are evaluated numerically through a combination of Monte Carlo and k-nearest neighbour methods in a non-parametric fashion. Unlike many methods to evaluate identifiability proposed in the literature, the proposed approach takes the measurement-noise into account and is not restricted to any particular noise-structure. Whilst computationally intensive for large dynamical systems, it is easily parallelisable and is non-intrusive as it does not necessitate re-writing of the numerical solvers of the dynamical system. The application of such an approach is presented for a variety of dynamical systems--ranging from systems governed by ordinary differential equations to partial differential equations--and, where possible, validated against results previously published in the literature. Copyright © 2015 Elsevier Inc. All rights reserved.

Dynamical system approach to running Λ cosmological models

International Nuclear Information System (INIS)

Stachowski, Aleksander; Szydlowski, Marek

2016-01-01

We study the dynamics of cosmological models with a time dependent cosmological term. We consider five classes of models; two with the non-covariant parametrization of the cosmological term Λ: Λ(H)CDM cosmologies, Λ(a)CDM cosmologies, and three with the covariant parametrization of Λ: Λ(R)CDM cosmologies, where R(t) is the Ricci scalar, Λ(φ)-cosmologies with diffusion, Λ(X)-cosmologies, where X = (1)/(2)g"α"β∇_α∇_βφ is a kinetic part of the density of the scalar field. We also consider the case of an emergent Λ(a) relation obtained from the behaviour of trajectories in a neighbourhood of an invariant submanifold. In the study of the dynamics we used dynamical system methods for investigating how an evolutionary scenario can depend on the choice of special initial conditions. We show that the methods of dynamical systems allow one to investigate all admissible solutions of a running Λ cosmology for all initial conditions. We interpret Alcaniz and Lima's approach as a scaling cosmology. We formulate the idea of an emergent cosmological term derived directly from an approximation of the exact dynamics. We show that some non-covariant parametrization of the cosmological term like Λ(a), Λ(H) gives rise to the non-physical behaviour of trajectories in the phase space. This behaviour disappears if the term Λ(a) is emergent from the covariant parametrization. (orig.)

An Approximate Dynamic Programming Mode for Optimal MEDEVAC Dispatching

Science.gov (United States)

2015-03-26

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

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.

Systems and methods for interpolation-based dynamic programming

KAUST Repository

Rockwood, Alyn

2013-01-01

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

A Single-Cell Biochemistry Approach Reveals PAR Complex Dynamics during Cell Polarization.

Science.gov (United States)

Dickinson, Daniel J; Schwager, Francoise; Pintard, Lionel; Gotta, Monica; Goldstein, Bob

2017-08-21

Regulated protein-protein interactions are critical for cell signaling, differentiation, and development. For the study of dynamic regulation of protein interactions in vivo, there is a need for techniques that can yield time-resolved information and probe multiple protein binding partners simultaneously, using small amounts of starting material. Here we describe a single-cell protein interaction assay. Single-cell lysates are generated at defined time points and analyzed using single-molecule pull-down, yielding information about dynamic protein complex regulation in vivo. We established the utility of this approach by studying PAR polarity proteins, which mediate polarization of many animal cell types. We uncovered striking regulation of PAR complex composition and stoichiometry during Caenorhabditis elegans zygote polarization, which takes place in less than 20 min. PAR complex dynamics are linked to the cell cycle by Polo-like kinase 1 and govern the movement of PAR proteins to establish polarity. Our results demonstrate an approach to study dynamic biochemical events in vivo. Copyright © 2017 Elsevier Inc. All rights reserved.

Dynamic Behavior Sequencing in a Hybrid Robot Architecture

Science.gov (United States)

2008-03-01

robots to represent and execute procedures, scripts , and plans in dynamic environ- ments [24]. Ingrand et al. describe the PRS as the link between the...based language in a similar style to Java that follows a model-based programming approach. A model-based programming approach refers to embedded...refers to the angular orientation of the robot from its initial heading. Therefore, the θ parameter value of zero (0) indicates that the desired

Ultrasonic fluid quantity measurement in dynamic vehicular applications a support vector machine approach

CERN Document Server

Terzic, Jenny; Nagarajah, Romesh; Alamgir, Muhammad

2013-01-01

Accurate fluid level measurement in dynamic environments can be assessed using a Support Vector Machine (SVM) approach. SVM is a supervised learning model that analyzes and recognizes patterns. It is a signal classification technique which has far greater accuracy than conventional signal averaging methods. Ultrasonic Fluid Quantity Measurement in Dynamic Vehicular Applications: A Support Vector Machine Approach describes the research and development of a fluid level measurement system for dynamic environments. The measurement system is based on a single ultrasonic sensor. A Support Vector Machines (SVM) based signal characterization and processing system has been developed to compensate for the effects of slosh and temperature variation in fluid level measurement systems used in dynamic environments including automotive applications. It has been demonstrated that a simple ν-SVM model with Radial Basis Function (RBF) Kernel with the inclusion of a Moving Median filter could be used to achieve the high levels...

Using the Dynamic Model to develop an evidence-based and theory-driven approach to school improvement

NARCIS (Netherlands)

Creemers, B.P.M.; Kyriakides, L.

2010-01-01

This paper refers to a dynamic perspective of educational effectiveness and improvement stressing the importance of using an evidence-based and theory-driven approach. Specifically, an approach to school improvement based on the dynamic model of educational effectiveness is offered. The recommended

Robust Optimization Approach for Design for a Dynamic Cell Formation Considering Labor Utilization: Bi-objective Mathematical Mode

Directory of Open Access Journals (Sweden)

Hiwa Farughi

2016-05-01

Full Text Available In this paper, robust optimization of a bi-objective mathematical model in a dynamic cell formation problem considering labor utilization with uncertain data is carried out. The robust approach is used to reduce the effects of fluctuations of the uncertain parameters with regards to all the possible future scenarios. In this research, cost parameters of the cell formation and demand fluctuations are subject to uncertainty and a mixed-integer programming (MIP model is developed to formulate the related robust dynamic cell formation problem. Then the problem is transformed into a bi-objective linear one. The first objective function seeks to minimize relevant costs of the problem including machine procurement and relocation costs, machine variable cost, inter-cell movement and intra-cell movement costs, overtime cost and labor shifting cost between cells, machine maintenance cost, inventory, holding part cost. The second objective function seeks to minimize total man-hour deviations between cells or indeed labor utilization of the modeled.

A Nonlinear Programming and Artificial Neural Network Approach for Optimizing the Performance of a Job Dispatching Rule in a Wafer Fabrication Factory

Directory of Open Access Journals (Sweden)

Toly Chen

2012-01-01

Full Text Available A nonlinear programming and artificial neural network approach is presented in this study to optimize the performance of a job dispatching rule in a wafer fabrication factory. The proposed methodology fuses two existing rules and constructs a nonlinear programming model to choose the best values of parameters in the two rules by dynamically maximizing the standard deviation of the slack, which has been shown to benefit scheduling performance by several studies. In addition, a more effective approach is also applied to estimate the remaining cycle time of a job, which is empirically shown to be conducive to the scheduling performance. The efficacy of the proposed methodology was validated with a simulated case; evidence was found to support its effectiveness. We also suggested several directions in which it can be exploited in the future.

A combined multibody and finite element approach for dynamic interaction analysis of high-speed train and railway structure including post-derailment behavior during an earthquake

International Nuclear Information System (INIS)

Tanabe, M; Wakui, H; Sogabe, M; Matsumoto, N; Tanabe, Y

2010-01-01

A combined multibody and finite element approach is given to solve the dynamic interaction of a Shinkansen train (high-speed train in Japan) and the railway structure including post-derailment during an earthquake effectively. The motion of the train is expressed in multibody dynamics. Efficient mechanical models to express interactions between wheel and track structure including post-derailment are given. Rail and track elements expressed in multibody dynamics and FEM are given to solve contact problems between wheel and long railway components effectively. The motion of a railway structure is modeled with various finite elements and rail and track elements. The computer program has been developed for the dynamic interaction analysis of a Shinkansen train and railway structure including post derailment during an earthquake. Numerical examples are demonstrated.

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

Science.gov (United States)

Scherer, Klaus R; Ellgring, Heiner

2007-02-01

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

A Dynamic Approach to School Improvement : Main Features and Impact

NARCIS (Netherlands)

Creemers, Bert; Kyriakides, L.; Antoniou, P.

2013-01-01

This paper refers to the dynamic approach to school improvement (DASI) which attempts to contribute to the merging of educational effectiveness research and school improvement. The main underlying assumptions and the implementation phases of DASI are discussed. Moreover, a study aiming to compare

An optimal maintenance policy for machine replacement problem using dynamic programming

Directory of Open Access Journals (Sweden)

Mohsen Sadegh Amalnik

2017-06-01

Full Text Available In this article, we present an acceptance sampling plan for machine replacement problem based on the backward dynamic programming model. Discount dynamic programming is used to solve a two-state machine replacement problem. We plan to design a model for maintenance by consid-ering the quality of the item produced. The purpose of the proposed model is to determine the optimal threshold policy for maintenance in a finite time horizon. We create a decision tree based on a sequential sampling including renew, repair and do nothing and wish to achieve an optimal threshold for making decisions including renew, repair and continue the production in order to minimize the expected cost. Results show that the optimal policy is sensitive to the data, for the probability of defective machines and parameters defined in the model. This can be clearly demonstrated by a sensitivity analysis technique.

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

Science.gov (United States)

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

2018-04-01

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

Optimization of a pump-pipe system by dynamic programming

DEFF Research Database (Denmark)

Vidal, Rene Victor Valqui; Ferreira, Jose S.

1984-01-01

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

Thermospheric dynamics - A system theory approach

Science.gov (United States)

Codrescu, M.; Forbes, J. M.; Roble, R. G.

1990-01-01

A system theory approach to thermospheric modeling is developed, based upon a linearization method which is capable of preserving nonlinear features of a dynamical system. The method is tested using a large, nonlinear, time-varying system, namely the thermospheric general circulation model (TGCM) of the National Center for Atmospheric Research. In the linearized version an equivalent system, defined for one of the desired TGCM output variables, is characterized by a set of response functions that is constructed from corresponding quasi-steady state and unit sample response functions. The linearized version of the system runs on a personal computer and produces an approximation of the desired TGCM output field height profile at a given geographic location.

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

International Nuclear Information System (INIS)

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

2012-01-01

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

Dynamical coupled channel approach to omega meson production

Energy Technology Data Exchange (ETDEWEB)

Mark Paris

2007-09-10

The dynamical coupled channel approach of Matsuyama, Sato, and Lee is used to study the $\\omega$--meson production induced by pions and photons scattering from the proton. The parameters of the model are fixed in a two-channel (\\omega N,\\pi N) calculation for the non-resonant and resonant contributions to the $T$ matrix by fitting the available unpolarized differential cross section data. The polarized photon beam asymmetry is predicted and compared to existing data.

Sliding Mode Control for Mass Moment Aerospace Vehicles Using Dynamic Inversion Approach

Directory of Open Access Journals (Sweden)

Xiao-Yu Zhang

2013-01-01

Full Text Available The moving mass actuation technique offers significant advantages over conventional aerodynamic control surfaces and reaction control systems, because the actuators are contained entirely within the airframe geometrical envelope. Modeling, control, and simulation of Mass Moment Aerospace Vehicles (MMAV utilizing moving mass actuators are discussed. Dynamics of the MMAV are separated into two parts on the basis of the two time-scale separation theory: the dynamics of fast state and the dynamics of slow state. And then, in order to restrain the system chattering and keep the track performance of the system by considering aerodynamic parameter perturbation, the flight control system is designed for the two subsystems, respectively, utilizing fuzzy sliding mode control approach. The simulation results describe the effectiveness of the proposed autopilot design approach. Meanwhile, the chattering phenomenon that frequently appears in the conventional variable structure systems is also eliminated without deteriorating the system robustness.

The Dynamics of Heat A Unified Approach to Thermodynamics and Heat Transfer

CERN Document Server

Fuchs, Hans U

2010-01-01

Based on courses for students of science, engineering, and systems science at the Zurich University of Applied Sciences at Winterthur, this text approaches the fundamentals of thermodynamics from the point of view of continuum physics. By describing physical processes in terms of the flow and balance of physical quantities, the author achieves a unified approach to hydraulics, electricity, mechanics and thermodynamics. In this way, it becomes clear that entropy is the fundamental property that is transported in thermal processes (i.e., heat), and that temperature is the corresponding potential. The resulting theory of the creation, flow, and balance of entropy provides the foundation of a dynamical theory of heat. This extensively revised and updated second edition includes new material on dynamical chemical processes, thermoelectricity, and explicit dynamical modeling of thermal and chemical processes. To make the book more useful for courses on thermodynamics and physical chemistry at different levels, cove...

Modeling Dynamic Processes in Smallholder Dairy Value Chains in Nicaragua: A System Dynamics Approach

Directory of Open Access Journals (Sweden)

Helene Lie

2016-08-01

Full Text Available In Nicaragua, the production of dairy and beef is the most important source of household income for many smallholder producers. However, erratic volumes and quality of milk limit the participation of small- and medium-scale cattle farmers into higher-value dairy value chains. This research uses a system dynamics (SD approach to analyze the Matiguás dairy value chain in Nicaragua. The paper presents the conceptual framework of the model and highlights the dynamic processes in the value chain, with a focus on improving feeding systems to achieve higher milk productivity and increased income for producers. The model was developed using a participatory group model building (GMB technique to jointly conceptualize and validate the model with stakeholders.

Dynamics of screw dislocations : a generalised minimising-movements scheme approach

NARCIS (Netherlands)

Bonaschi, G.A.; Meurs, van P.J.P.; Morandotti, M.

2015-01-01

The gradient flow structure of the model introduced in [CG99] for the dynamics of screw dislocations is investigated by means of a generalised minimising-movements scheme approach. The assumption of a finite number of available glide directions, together with the "maximal dissipation criterion" that

The Feldenkrais Method: A Dynamic Approach to Changing Motor Behavior.

Science.gov (United States)

Buchanan, Patricia A.; Ulrich, Beverly D.

2001-01-01

Describes the Feldenkrais Method of somatic education, noting parallels with a dynamic systems theory (DST) approach to motor behavior. Feldenkrais uses movement and perception to foster individualized improvement in function. DST explains that a human-environment system continually adapts to changing conditions and assembles behaviors…

A unifying energy-based approach to stability of power grids with market dynamics

NARCIS (Netherlands)

Stegink, Tjerk; De Persis, Claudio; van der Schaft, Arjan

2017-01-01

In this paper a unifying energy-based approach is provided to the modeling and stability analysis of power systems coupled with market dynamics. We consider a standard model of the power network with a third-order model for the synchronous generators involving voltage dynamics. By applying the

A port-Hamiltonian approach to image-based visual servo control for dynamic systems

NARCIS (Netherlands)

Mahony, R.; Stramigioli, Stefano

2012-01-01

This paper introduces a port-Hamiltonian framework for the design of image-based visual servo control for dynamic mechanical systems. The approach taken introduces the concept of an image effort and provides an interpretation of energy exchange between the dynamics of the physical system and virtual

Evolutionary Design of Both Topologies and Parameters of a Hybrid Dynamical System

DEFF Research Database (Denmark)

Dupuis, Jean-Francois; Fan, Zhun; Goodman, Erik

2012-01-01

This paper investigates the issue of evolutionary design of open-ended plants for hybrid dynamical systems--i.e. both their topologies and parameters. Hybrid bond graphs are used to represent dynamical systems involving both continuous and discrete system dynamics. Genetic programming, with some...... of hybrid dynamical systems that fulfill predefined design specifications. A comprehensive investigation of a case study of DC-DC converter design demonstrates the feasibility and effectiveness of the HBGGP approach. Important characteristics of the approach are also discussed, with some future research...

Dynamic Programming for Re-Mapping Noisy Fixations in Translation Tasks

DEFF Research Database (Denmark)

Carl, Michael

2013-01-01

this "naïve" gaze-to-word mapping by introducing background knowledge about the gazing task. In a first step, the sequence of "naïve" gaze-to-symbol mappings is projected into a lattice of several possible gaze locations above and below the current fixation on the text. In a second step a dynamic programming...

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

The Effect of Water Exercise Program on Static and Dynamic Balance in Elderly Women

Directory of Open Access Journals (Sweden)

Heydar Sadeghi

2008-01-01

Full Text Available Objectives: Poor balance is one of risk factors of falling, a cause of injury and even death in elderly. The aim of this study was to evaluate the effect of a water exercise program on static and dynamic balance in elder women. Methods & Materials: Thirty participants aged 55-70 years completed an exercise program (60 min, 3 days and 6 weeks, in 2 groups, exercise and control, voluntarily. Static and dynamic balances were measured before and after exercise program in both groups. Postural sway parameters, including mean displacement of center of pressure and velocity of center of pressure in Medio-Lateral (ML and Anterio-Posterior (AP directions, in single stance position, as a measure of static balance and functional reach test, functional reach right test and functional reach left test, as dynamic measure of balance was considered. T test for deepened groups was used for evaluation of changes within groups, and T test for independent groups was used for between groups' changes at threshold of 0.05 After 6 weeks. Results: Significant changes were observed in results of Functional Reach Test (FRT, Functional Reach Left Test (FRLT after exercise program, also in average displacement of cop and velocity of cop in ML direction. Between groups significant differences were observed in results of average cop displacement and velocity of displacement, FRT and FRLT. Conclusion: These results suggest that challenging the physiological systems involved in balance control, in water, while on the non stable support surface, improved both static and dynamic balance and probably might decrease the risk of falling.

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

Science.gov (United States)

Lewis, F L; Vamvoudakis, Kyriakos G

2011-02-01

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

Training Program Handbook: A systematic approach to training

Energy Technology Data Exchange (ETDEWEB)

1994-08-01

This DOE handbook describes a systematic method for establishing and maintaining training programs that meet the requirements and expectations of DOE Orders 5480.18B and 5480.20. The systematic approach to training includes 5 phases: Analysis, design, development, implementation, and evaluation.

Convergence of carbon dioxide emissions in Chinese cities: A continuous dynamic distribution approach

International Nuclear Information System (INIS)

Wu, Jianxin; Wu, Yanrui; Guo, Xiumei; Cheong, Tsun Se

2016-01-01

This paper investigates the spatial dynamics of per capita carbon dioxide (CO_2) emissions in China. The analyses are conducted by employing a continuous dynamic distribution approach and panel data of 286 cities at the prefecture and above-prefecture level. The results show that per capita CO_2 emissions tend to converge during the sample period of 2002–2011. However, multimodality is found in the ergodic distribution of the full sample. It is also found that there is more persistence in cities with low per capita CO_2 emissions, and more mobility in cities with high per capita CO_2 emissions. The analyses also show that the dynamics of per capita CO_2 emissions are significantly different among various geographical, income and environmental policy groups. The conditional distribution analyses indicate that multimodality cannot be explained independently by any one of the two factors, namely geographical location or income level. The findings in this study may have important policy implications for CO_2 abatement in China. - Highlights: •Spatial dynamics of per capita carbon dioxide (CO_2) emissions in 286 Chinese cities. •A continuous dynamic distribution approach and panel data. •Multimodality is found in the ergodic distribution of the full sample. •Significantly different dynamics among various city groups.

Gas-Phase Molecular Dynamics: Theoretical Studies In Spectroscopy and Chemical Dynamics

Energy Technology Data Exchange (ETDEWEB)

Yu H. G.; Muckerman, J.T.

2012-05-29

The main goal of this program is the development and application of computational methods for studying chemical reaction dynamics and molecular spectroscopy in the gas phase. We are interested in developing rigorous quantum dynamics algorithms for small polyatomic systems and in implementing approximate approaches for complex ones. Particular focus is on the dynamics and kinetics of chemical reactions and on the rovibrational spectra of species involved in combustion processes. This research also explores the potential energy surfaces of these systems of interest using state-of-the-art quantum chemistry methods, and extends them to understand some important properties of materials in condensed phases and interstellar medium as well as in combustion environments.

Logical Attractors: a Boolean Approach to the Dynamics of Psychosis

Science.gov (United States)

Kupper, Z.; Hoffmann, H.

A Boolean modeling approach to attractors in the dynamics of psychosis is presented: Kinetic Logic, originating from R. Thomas, describes systems on an intermediate level between a purely verbal, qualitative description and a description using nonlinear differential equations. With this method we may model impact, feedback and temporal evolution, as well as analyze the resulting attractors. In our previous research the method has been applied to general and more specific questions in the dynamics of psychotic disorders. In this paper a model is introduced that describes different dynamical patterns of chronic psychosis in the context of vocational rehabilitation. It also shows to be useful in formulating and exploring possible treatment strategies. Finally, some of the limitations and benefits of Kinetic Logic as a modeling tool for psychology and psychiatry are discussed.

Gr-GDHP: A New Architecture for Globalized Dual Heuristic Dynamic Programming.

Science.gov (United States)

Zhong, Xiangnan; Ni, Zhen; He, Haibo

2017-10-01

Goal representation globalized dual heuristic dynamic programming (Gr-GDHP) method is proposed in this paper. A goal neural network is integrated into the traditional GDHP method providing an internal reinforcement signal and its derivatives to help the control and learning process. From the proposed architecture, it is shown that the obtained internal reinforcement signal and its derivatives can be able to adjust themselves online over time rather than a fixed or predefined function in literature. Furthermore, the obtained derivatives can directly contribute to the objective function of the critic network, whose learning process is thus simplified. Numerical simulation studies are applied to show the performance of the proposed Gr-GDHP method and compare the results with other existing adaptive dynamic programming designs. We also investigate this method on a ball-and-beam balancing system. The statistical simulation results are presented for both the Gr-GDHP and the GDHP methods to demonstrate the improved learning and controlling performance.

A nonlinear dynamics approach for incorporating wind-speed patterns into wind-power project evaluation.

Science.gov (United States)

Huffaker, Ray; Bittelli, Marco

2015-01-01

Wind-energy production may be expanded beyond regions with high-average wind speeds (such as the Midwest U.S.A.) to sites with lower-average speeds (such as the Southeast U.S.A.) by locating favorable regional matches between natural wind-speed and energy-demand patterns. A critical component of wind-power evaluation is to incorporate wind-speed dynamics reflecting documented diurnal and seasonal behavioral patterns. Conventional probabilistic approaches remove patterns from wind-speed data. These patterns must be restored synthetically before they can be matched with energy-demand patterns. How to accurately restore wind-speed patterns is a vexing problem spurring an expanding line of papers. We propose a paradigm shift in wind power evaluation that employs signal-detection and nonlinear-dynamics techniques to empirically diagnose whether synthetic pattern restoration can be avoided altogether. If the complex behavior of observed wind-speed records is due to nonlinear, low-dimensional, and deterministic system dynamics, then nonlinear dynamics techniques can reconstruct wind-speed dynamics from observed wind-speed data without recourse to conventional probabilistic approaches. In the first study of its kind, we test a nonlinear dynamics approach in an application to Sugarland Wind-the first utility-scale wind project proposed in Florida, USA. We find empirical evidence of a low-dimensional and nonlinear wind-speed attractor characterized by strong temporal patterns that match up well with regular daily and seasonal electricity demand patterns.

One Approach for Dynamic L-lysine Modelling of Repeated Fed-batch Fermentation

Directory of Open Access Journals (Sweden)

Kalin Todorov

2007-03-01

Full Text Available This article deals with establishment of dynamic unstructured model of variable volume fed-batch fermentation process with intensive droppings for L-lysine production. The presented approach of the investigation includes the following main procedures: description of the process by generalized stoichiometric equations; preliminary data processing and calculation of specific rates for main kinetic variables; identification of the specific rates as a second-order non-linear dynamic models; establishment and optimisation of dynamic model of the process; simulation researches. MATLAB is used as a research environment.

Nuclear Fermi Dynamics: physical content versus theoretical approach

International Nuclear Information System (INIS)

Griffin, J.J.

1977-01-01

Those qualitative properties of nuclei, and of their energetic collisions, which seem of most importance for the flow of nuclear matter are listed and briefly discussed. It is suggested that nuclear matter flow is novel among fluid dynamical problems. The name, Nuclear Fermi Dynamics, is proposed as an appropriate unambiguous label. The Principle of Commensurability, which suggests the measurement of the theoretical content of an approach against its expected predictive range is set forth and discussed. Several of the current approaches to the nuclear matter flow problem are listed and subjected to such a test. It is found that the Time-Dependent Hartree-Fock (TDHF) description, alone of all the major theoretical approaches currently in vogue, incorporates each of the major qualitative features within its very concise single mathematical assumption. Some limitations of the conventional TDHF method are noted, and one particular defect is discussed in detail: the Spurious Cross Channel Correlations which arise whenever several asymptotic reaction channels must be simultaneously described by a single determinant. A reformulated Time-Dependent-S-Matrix Hartree-Fock Theory is proposed, which obviates this difficulty. It is noted that the structure of TD-S-HF can be applied to a more general class of non-linear wave mechanical problems than simple TDHF. Physical requirements minimal to assure that TD-S-HF represents a sensible reaction theory are utilized to prescribe the definition of acceptable asymptotic channels. That definition, in turn, defines the physical range of the TD-S-HF theory as the description of collisions of certain mathematically well-defined objects of mixed quantal and classical character, the ''TDHF droplets.''

Benchmarking the stochastic time-dependent variational approach for excitation dynamics in molecular aggregates

Energy Technology Data Exchange (ETDEWEB)

Chorošajev, Vladimir [Department of Theoretical Physics, Faculty of Physics, Vilnius University, Sauletekio 9-III, 10222 Vilnius (Lithuania); Gelzinis, Andrius; Valkunas, Leonas [Department of Theoretical Physics, Faculty of Physics, Vilnius University, Sauletekio 9-III, 10222 Vilnius (Lithuania); Department of Molecular Compound Physics, Center for Physical Sciences and Technology, Sauletekio 3, 10222 Vilnius (Lithuania); Abramavicius, Darius, E-mail: darius.abramavicius@ff.vu.lt [Department of Theoretical Physics, Faculty of Physics, Vilnius University, Sauletekio 9-III, 10222 Vilnius (Lithuania)

2016-12-20

Highlights: • The Davydov ansatze can be used for finite temperature simulations with an extension. • The accuracy is high if the system is strongly coupled to the environmental phonons. • The approach can simulate time-resolved fluorescence spectra. - Abstract: Time dependent variational approach is a convenient method to characterize the excitation dynamics in molecular aggregates for different strengths of system-bath interaction a, which does not require any additional perturbative schemes. Until recently, however, this method was only applicable in zero temperature case. It has become possible to extend this method for finite temperatures with the introduction of stochastic time dependent variational approach. Here we present a comparison between this approach and the exact hierarchical equations of motion approach for describing excitation dynamics in a broad range of temperatures. We calculate electronic population evolution, absorption and auxiliary time resolved fluorescence spectra in different regimes and find that the stochastic approach shows excellent agreement with the exact approach when the system-bath coupling is sufficiently large and temperatures are high. The differences between the two methods are larger, when temperatures are lower or the system-bath coupling is small.

A COMPARATIVE ANALYSIS OF ASEAN CURRENCIES USING A COPULA APPROACH AND A DYNAMIC COPULA APPROACH

Directory of Open Access Journals (Sweden)

CHUKIAT CHAIBOONSRI

2012-12-01

Full Text Available The ASEAN Economic Community (AEC will be shaped developing to be a single market and production base in 2015, moving towards regional Economic Integration, 2009. These developments in international financial markets do lead to some adverse cost for AEC country borrowers. The specific objective aims to investigate the dependent measures and the co-movement among selected ASEAN currencies. A Copula Approach was used to examine dependent measures of Thai Baht exchange rate among selected ASEAN currencies during the period of 2008-2011. Also, a Dynamic Copula Approach was tested to investigate the co-movement of Thai Baht exchange rate among selected ASEAN currencies during the period of 2008-2011. The results of the study based on a Pearson linear correlation coefficient confirmed that Thai Baht exchange rate and each of selected ASEAN currencies have a linear correlation during the specific period excluding Vietnam exchange rate. Furthermore, based on empirical Copula Approach, Thai Baht exchange rate had a dependent structure with each of the selected in ASEAN currencies including Brunei exchange rate, Singapore exchange rate, Malaysia exchange rate, Indonesia exchange rate, Philippine exchange rate, and Vietnam exchange rate respectively. The results of Dynamic Copula estimation indicated that Thai Baht exchange rate had a co-movement with selected ASEAN currencies. The research results provide an informative and interactive ASEAN financial market to all users, including Global financial market.

Interactive Approach for Multi-Level Multi-Objective Fractional Programming Problems with Fuzzy Parameters

Directory of Open Access Journals (Sweden)

M.S. Osman

2018-03-01

Full Text Available In this paper, an interactive approach for solving multi-level multi-objective fractional programming (ML-MOFP problems with fuzzy parameters is presented. The proposed interactive approach makes an extended work of Shi and Xia (1997. In the first phase, the numerical crisp model of the ML-MOFP problem has been developed at a confidence level without changing the fuzzy gist of the problem. Then, the linear model for the ML-MOFP problem is formulated. In the second phase, the interactive approach simplifies the linear multi-level multi-objective model by converting it into separate multi-objective programming problems. Also, each separate multi-objective programming problem of the linear model is solved by the ∊-constraint method and the concept of satisfactoriness. Finally, illustrative examples and comparisons with the previous approaches are utilized to evince the feasibility of the proposed approach.

DEGAS: Dynamic Exascale Global Address Space Programming Environments

Energy Technology Data Exchange (ETDEWEB)

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

2018-02-23

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

A full time-domain approach to spatio-temporal dynamics of semiconductor lasers. II. Spatio-temporal dynamics

Science.gov (United States)

Böhringer, Klaus; Hess, Ortwin

The spatio-temporal dynamics of novel semiconductor lasers is discussed on the basis of a space- and momentum-dependent full time-domain approach. To this means the space-, time-, and momentum-dependent Full-Time Domain Maxwell Semiconductor Bloch equations, derived and discussed in our preceding paper I [K. Böhringer, O. Hess, A full time-domain approach to spatio-temporal dynamics of semiconductor lasers. I. Theoretical formulation], are solved by direct numerical integration. Focussing on the device physics of novel semiconductor lasers that profit, in particular, from recent advances in nanoscience and nanotechnology, we discuss the examples of photonic band edge surface emitting lasers (PBE-SEL) and semiconductor disc lasers (SDLs). It is demonstrated that photonic crystal effects can be obtained for finite crystal structures, and leading to a significant improvement in laser performance such as reduced lasing thresholds. In SDLs, a modern device concept designed to increase the power output of surface-emitters in combination with near-diffraction-limited beam quality, we explore the complex interplay between the intracavity optical fields and the quantum well gain material in SDL structures. Our simulations reveal the dynamical balance between carrier generation due to pumping into high energy states, momentum relaxation of carriers, and stimulated recombination from states near the band edge. Our full time-domain approach is shown to also be an excellent framework for the modelling of the interaction of high-intensity femtosecond and picosecond pulses with semiconductor nanostructures. It is demonstrated that group velocity dispersion, dynamical gain saturation and fast self-phase modulation (SPM) are the main causes for the induced changes and asymmetries in the amplified pulse shape and spectrum of an ultrashort high-intensity pulse. We attest that the time constants of the intraband scattering processes are critical to gain recovery. Moreover, we present

A restraint molecular dynamics and simulated annealing approach for protein homology modeling utilizing mean angles

Directory of Open Access Journals (Sweden)

Maurer Till

2005-04-01

Full Text Available Abstract Background We have developed the program PERMOL for semi-automated homology modeling of proteins. It is based on restrained molecular dynamics using a simulated annealing protocol in torsion angle space. As main restraints defining the optimal local geometry of the structure weighted mean dihedral angles and their standard deviations are used which are calculated with an algorithm described earlier by Döker et al. (1999, BBRC, 257, 348–350. The overall long-range contacts are established via a small number of distance restraints between atoms involved in hydrogen bonds and backbone atoms of conserved residues. Employing the restraints generated by PERMOL three-dimensional structures are obtained using standard molecular dynamics programs such as DYANA or CNS. Results To test this modeling approach it has been used for predicting the structure of the histidine-containing phosphocarrier protein HPr from E. coli and the structure of the human peroxisome proliferator activated receptor γ (Ppar γ. The divergence between the modeled HPr and the previously determined X-ray structure was comparable to the divergence between the X-ray structure and the published NMR structure. The modeled structure of Ppar γ was also very close to the previously solved X-ray structure with an RMSD of 0.262 nm for the backbone atoms. Conclusion In summary, we present a new method for homology modeling capable of producing high-quality structure models. An advantage of the method is that it can be used in combination with incomplete NMR data to obtain reasonable structure models in accordance with the experimental data.

PlayIt: Game Based Learning Approach for Teaching Programming Concepts

Science.gov (United States)

Mathrani, Anuradha; Christian, Shelly; Ponder-Sutton, Agate

2016-01-01

This study demonstrates a game-based learning (GBL) approach to engage students in learning and enhance their programming skills. The paper gives a detailed narrative of how an educational game was mapped with the curriculum of a prescribed programming course in a computing diploma study programme. Two separate student cohorts were invited to…

On the sighting of unicorns: A variational approach to computing invariant sets in dynamical systems

Science.gov (United States)

Junge, Oliver; Kevrekidis, Ioannis G.

2017-06-01

We propose to compute approximations to invariant sets in dynamical systems by minimizing an appropriate distance between a suitably selected finite set of points and its image under the dynamics. We demonstrate, through computational experiments, that this approach can successfully converge to approximations of (maximal) invariant sets of arbitrary topology, dimension, and stability, such as, e.g., saddle type invariant sets with complicated dynamics. We further propose to extend this approach by adding a Lennard-Jones type potential term to the objective function, which yields more evenly distributed approximating finite point sets, and illustrate the procedure through corresponding numerical experiments.

New chromaticity compensation approach and dynamic aperture increase in the SSRF storage ring

International Nuclear Information System (INIS)

Tian Shunqiang; Hou Jie; Chen Guangling; Chinese Academy of Sciences, Beijing; Liu Guimin

2008-01-01

Strong chromatic sextupoles used to compensate natural chromaticities in the third generation light source storage ring usually reduce dynamic aperture drastically. Many optimization methods can be used to find solutions that provide large dynamic apertures. This paper discusses a new optimization approach of sextupole strengths with step-by-step procedure, which is applied in the SSRF storage ring, and a better solution is obtained. Investigating driving terms generated by the sextupoles in every step can analyze their convergences and guide the weight setting among different terms in object function of the single resonance approach based on the perturbation theory. (authors)

Semantic Edge Based Disparity Estimation Using Adaptive Dynamic Programming for Binocular Sensors.

Science.gov (United States)

Zhu, Dongchen; Li, Jiamao; Wang, Xianshun; Peng, Jingquan; Shi, Wenjun; Zhang, Xiaolin

2018-04-03

Disparity calculation is crucial for binocular sensor ranging. The disparity estimation based on edges is an important branch in the research of sparse stereo matching and plays an important role in visual navigation. In this paper, we propose a robust sparse stereo matching method based on the semantic edges. Some simple matching costs are used first, and then a novel adaptive dynamic programming algorithm is proposed to obtain optimal solutions. This algorithm makes use of the disparity or semantic consistency constraint between the stereo images to adaptively search parameters, which can improve the robustness of our method. The proposed method is compared quantitatively and qualitatively with the traditional dynamic programming method, some dense stereo matching methods, and the advanced edge-based method respectively. Experiments show that our method can provide superior performance on the above comparison.

Interactive Fuzzy Goal Programming approach in multi-response stratified sample surveys

Directory of Open Access Journals (Sweden)

Gupta Neha

2016-01-01

Full Text Available In this paper, we applied an Interactive Fuzzy Goal Programming (IFGP approach with linear, exponential and hyperbolic membership functions, which focuses on maximizing the minimum membership values to determine the preferred compromise solution for the multi-response stratified surveys problem, formulated as a Multi- Objective Non Linear Programming Problem (MONLPP, and by linearizing the nonlinear objective functions at their individual optimum solution, the problem is approximated to an Integer Linear Programming Problem (ILPP. A numerical example based on real data is given, and comparison with some existing allocations viz. Cochran’s compromise allocation, Chatterjee’s compromise allocation and Khowaja’s compromise allocation is made to demonstrate the utility of the approach.

A TSK neuro-fuzzy approach for modeling highly dynamic systems

NARCIS (Netherlands)

Acampora, G.

2011-01-01

This paper introduces a new type of TSK-based neuro-fuzzy approach and its application to modeling highly dynamic systems. In details, our proposal performs an adaptive supervised learning on a collection of time series in order to create a so-called Timed Automata Based Fuzzy Controller, i.e. an

Synchronization of two chaotic systems: Dynamic compensator approach

International Nuclear Information System (INIS)

Chen, C.-K.; Lai, T.-W.; Yan, J.-J.; Liao, T.-L.

2009-01-01

This study is concerned with the identical synchronization problem for a class of chaotic systems. A dynamic compensator is proposed to achieve the synchronization between master and slave chaotic systems using only the accessible output variables. A sufficient condition is also proposed to ensure the global synchronization. Furthermore, the strictly positive real (SPR) restriction, which is normally required in most of the observer-based synchronization schemes, is released in our approach. Two numerical examples are included to illustrate the proposed scheme.

A dynamic probabilistic safety margin characterization approach in support of Integrated Deterministic and Probabilistic Safety Analysis

International Nuclear Information System (INIS)

Di Maio, Francesco; Rai, Ajit; Zio, Enrico

2016-01-01

The challenge of Risk-Informed Safety Margin Characterization (RISMC) is to develop a methodology for estimating system safety margins in the presence of stochastic and epistemic uncertainties affecting the system dynamic behavior. This is useful to support decision-making for licensing purposes. In the present work, safety margin uncertainties are handled by Order Statistics (OS) (with both Bracketing and Coverage approaches) to jointly estimate percentiles of the distributions of the safety parameter and of the time required for it to reach these percentiles values during its dynamic evolution. The novelty of the proposed approach consists in the integration of dynamic aspects (i.e., timing of events) into the definition of a dynamic safety margin for a probabilistic Quantification of Margin and Uncertainties (QMU). The system here considered for demonstration purposes is the Lead–Bismuth Eutectic- eXperimental Accelerator Driven System (LBE-XADS). - Highlights: • We integrate dynamic aspects into the definition of a safety margins. • We consider stochastic and epistemic uncertainties affecting the system dynamics. • Uncertainties are handled by Order Statistics (OS). • We estimate the system grace time during accidental scenarios. • We apply the approach to an LBE-XADS accidental scenario.

Dynamics of WIC Program Participation by Infants and Children, 2001 to 2003. Final Report

Science.gov (United States)

Castner, Laura; Mabli, James; Sykes, Julie

2009-01-01

The Special Supplemental Nutrition Program for Women, Infants, and Children (WIC) provides nutritious foods that promote the health of low-income pregnant women, new mothers, infants, and preschool children. This study examines WIC participation dynamics of infants and children from 2001 to 2003 using the Survey of Income and Program Participation…

A Dynamic Simulation Program for a Hydriodic Acid Concentration and Decomposition Process in the VHTR-SI Process

International Nuclear Information System (INIS)

Chang, Ji Woon; Shin, Young Joon; Lee, Tae Hoon; Lee, Ki Young; Kim, Yong Wan; Chang, Jong Hwa; Youn, Cheung

2011-01-01

The Sulfur-Iodine (SI) cycle which can produce hydrogen by using nuclear heat consists of a Bunsen reaction (Section 1), a sulfur acid concentration and decomposition (Section 2), and a hydriodic acid concentration and decomposition (Section 3). The heat required in the SI process can be supplied through an intermediate heat exchanger (IHX) by a Very High Temperature Gas Cooled Reactor (VHTR). The Korea Atomic Energy Research Institute-Dynamic Simulation Code (KAERI-DySCo) based on the Visual C++ is an integration application software that simulates the dynamic behavior of the SI process. KAERI-DySCo was prepared to solve dynamic problem of the seven chemical reactors which consist of Sections 2 and 3. Section 3 is the key part of the SI process, because the strong non-ideality and the partial immiscibility of the binary HI.H 2 O and the ternary HI.I 2 .H 2 O (HIX solution) mixture make it difficult to model and simulate the dynamic behavior of the system. Therefore, it is necessary to compose separately a dynamic simulation program for Section 3 in KAERI-DySCo optimization. In this paper, a simulation program to analyze the dynamic behavior of Section 3 is introduced using the prepared KAERI-DySCo, and results of dynamic simulation are represented by running the program

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.

Two-step algorithm of generalized PAPA method applied to linear programming solution of dynamic matrix control

International Nuclear Information System (INIS)

Shimizu, Yoshiaki

1991-01-01

In recent complicated nuclear systems, there are increasing demands for developing highly advanced procedures for various problems-solvings. Among them keen interests have been paid on man-machine communications to improve both safety and economy factors. Many optimization methods have been good enough to elaborate on these points. In this preliminary note, we will concern with application of linear programming (LP) for this purpose. First we will present a new superior version of the generalized PAPA method (GEPAPA) to solve LP problems. We will then examine its effectiveness when applied to derive dynamic matrix control (DMC) as the LP solution. The approach is to aim at the above goal through a quality control of process that will appear in the system. (author)

Numerical methodologies for investigation of moderate-velocity flow using a hybrid computational fluid dynamics - molecular dynamics simulation approach

International Nuclear Information System (INIS)

Ko, Soon Heum; Kim, Na Yong; Nikitopoulos, Dimitris E.; Moldovan, Dorel; Jha, Shantenu

2014-01-01

Numerical approaches are presented to minimize the statistical errors inherently present due to finite sampling and the presence of thermal fluctuations in the molecular region of a hybrid computational fluid dynamics (CFD) - molecular dynamics (MD) flow solution. Near the fluid-solid interface the hybrid CFD-MD simulation approach provides a more accurate solution, especially in the presence of significant molecular-level phenomena, than the traditional continuum-based simulation techniques. It also involves less computational cost than the pure particle-based MD. Despite these advantages the hybrid CFD-MD methodology has been applied mostly in flow studies at high velocities, mainly because of the higher statistical errors associated with low velocities. As an alternative to the costly increase of the size of the MD region to decrease statistical errors, we investigate a few numerical approaches that reduce sampling noise of the solution at moderate-velocities. These methods are based on sampling of multiple simulation replicas and linear regression of multiple spatial/temporal samples. We discuss the advantages and disadvantages of each technique in the perspective of solution accuracy and computational cost.

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.

Dynamic risk analysis using bow-tie approach

International Nuclear Information System (INIS)

Khakzad, Nima; Khan, Faisal; Amyotte, Paul

2012-01-01

Accident probability estimation is a common and central step to all quantitative risk assessment methods. Among many techniques available, bow-tie model (BT) is very popular because it represent the accident scenario altogether including causes and consequences. However, it suffers a static structure limiting its application in real-time monitoring and probability updating which are key factors in dynamic risk analysis. The present work is focused on using BT approach in a dynamic environment in which the occurrence probability of accident consequences changes. In this method, on one hand, failure probability of primary events of BT, leading to the top event, are developed using physical reliability models, and constantly revised as physical parameters (e.g., pressure, velocity, dimension, etc) change. And, on the other hand, the failure probability of safety barriers of the BT are periodically updated using Bayes’ theorem as new information becomes available over time. Finally, the resulting, updated BT is used to estimate the posterior probability of the consequences which in turn results in an updated risk profile. - Highlights: ► A methodology is proposed to make bow-tie method adapted for dynamic risk analysis. ► Physical reliability models are used to revise the top event. ► Bayes’ theorem is used to update the probability of safety barriers. ► The number of accidents in sequential time intervals is used to form likelihood function. ► The risk profile is updated for varying physical parameters and for different times.

Musical structure analysis using similarity matrix and dynamic programming

Science.gov (United States)

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

2005-10-01

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

A Mobile Device Based Serious Gaming Approach for Teaching and Learning Java Programming

Directory of Open Access Journals (Sweden)

Tobias Jordine

2015-01-01

Full Text Available Most first year computer science students find that learning object-oriented programming is hard. Serious games have ever been used as one approach to handle this problem. But most of them cannot be played with mobile devices. This obviously does not suit the era of mobile computing that intends to allow students to learn programming skills in anytime anywhere. To enhance mobile teaching and learning, a research project started over a year ago and aims to create a mobile device based serious gaming approach along with a serious game for enhancing mobile teaching and learning for Java programming. So far the project has completed a literature review for understanding existing work and identifying problems in this area, conducted a survey for eliciting students’ requirements for mobile gaming approach, and then established a mobile-device based serious gaming approach with a developed prototype of the game. This paper introduces the project in details, and in particularly presents and discusses its current results. It is expected that the presented project will be helpful and useful to bring more efficient approaches with new mobile games into teaching object-oriented programming and to enhance students’ learning experiences.

A Family of Tools for Supporting the Learning of Programming

Directory of Open Access Journals (Sweden)

Guido Rößling

2010-04-01

Full Text Available Both learning how to program and understanding algorithms or data structures are often difficult. This paper presents three complementary approaches that we employ to help our students in learning to program, especially during the first term of their study. We use a web-based programming task database as an easy and risk-free environment for taking the first steps in programming Java. The Animal algorithm visualization system is used to visualize the dynamic behavior of algorithms and data structures. We complement both approaches with tutorial videos on using the Eclipse IDE. We also report on the experiences with this combined approach.

A phase-space approach to atmospheric dynamics based on observational data. Theory and applications

International Nuclear Information System (INIS)

Wang Risheng.

1994-01-01

This thesis is an attempt to develop systematically a phase-space approach to the atmospheric dynamics based on the theoretical achievement and application experiences in nonlinear time-series analysis. In particular, it is concerned with the derivation of quantities for describing the geometrical structure of the observed dynamics in phase-space (dimension estimation) and the examination of the observed atmospheric fluctuations in the light of phase-space representation. The thesis is, therefore composed of three major parts, i.e. an general survey of the theory of statistical approaches to dynamic systems, the methodology designed for the present study and specific applications with respect to dimension estimation and to a phase-space analysis of the tropical stratospheric quasi-biennial oscillation. (orig./KW)

Vibrational mechanics nonlinear dynamic effects, general approach, applications

CERN Document Server

Blekhman, Iliya I

2000-01-01

This important book deals with vibrational mechanics - the new, intensively developing section of nonlinear dynamics and the theory of nonlinear oscillations. It offers a general approach to the study of the effect of vibration on nonlinear mechanical systems.The book presents the mathematical apparatus of vibrational mechanics which is used to describe such nonlinear effects as the disappearance and appearance under vibration of stable positions of equilibrium and motions (i.e. attractors), the change of the rheological properties of the media, self-synchronization, self-balancing, the vibrat

Dynamic Data-Driven UAV Network for Plume Characterization

Science.gov (United States)

2016-05-23

AFRL-AFOSR-VA-TR-2016-0203 Dynamic Data-Driven UAV Network for Plume Characterization Kamran Mohseni UNIVERSITY OF FLORIDA Final Report 05/23/2016...AND SUBTITLE Dynamic Data-Driven UAV Network for Plume Characterization 5a.  CONTRACT NUMBER 5b.  GRANT NUMBER FA9550-13-1-0090 5c.  PROGRAM ELEMENT...studied a dynamic data driven (DDD) approach to operation of a heterogeneous team of unmanned aerial vehicles ( UAVs ) or micro/miniature aerial

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.

Managing complex processing of medical image sequences by program supervision techniques

Science.gov (United States)

Crubezy, Monica; Aubry, Florent; Moisan, Sabine; Chameroy, Virginie; Thonnat, Monique; Di Paola, Robert

1997-05-01

Our objective is to offer clinicians wider access to evolving medical image processing (MIP) techniques, crucial to improve assessment and quantification of physiological processes, but difficult to handle for non-specialists in MIP. Based on artificial intelligence techniques, our approach consists in the development of a knowledge-based program supervision system, automating the management of MIP libraries. It comprises a library of programs, a knowledge base capturing the expertise about programs and data and a supervision engine. It selects, organizes and executes the appropriate MIP programs given a goal to achieve and a data set, with dynamic feedback based on the results obtained. It also advises users in the development of new procedures chaining MIP programs.. We have experimented the approach for an application of factor analysis of medical image sequences as a means of predicting the response of osteosarcoma to chemotherapy, with both MRI and NM dynamic image sequences. As a result our program supervision system frees clinical end-users from performing tasks outside their competence, permitting them to concentrate on clinical issues. Therefore our approach enables a better exploitation of possibilities offered by MIP and higher quality results, both in terms of robustness and reliability.

Semi-analytical approach to modelling the dynamic behaviour of soil excited by embedded foundations

DEFF Research Database (Denmark)

Bucinskas, Paulius; Andersen, Lars Vabbersgaard

2017-01-01

The underlying soil has a significant effect on the dynamic behaviour of structures. The paper proposes a semi-analytical approach based on a Green’s function solution in frequency–wavenumber domain. The procedure allows calculating the dynamic stiffness for points on the soil surface as well...... are analysed. It is determined how simplification of the numerical model affects the overall dynamic behaviour. © 2017 The Authors. Published by Elsevier Ltd....

Development of nonlinear dynamic analysis program for nuclear piping systems

International Nuclear Information System (INIS)

Kamichika, Ryoichi; Izawa, Masahiro; Yamadera, Masao

1980-01-01

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

Approaches to determining the reliability of a multimodal three-dimensional dynamic signature

Directory of Open Access Journals (Sweden)

Yury E. Kozlov

2018-03-01

Full Text Available The market of modern mobile applications has increasingly strict requirements for the authentication system reliability. This article examines an authentication method using a multimodal three-dimensional dynamic signature (MTDS, that can be used both as a main and additional method of user authentication in mobile applications. It is based on the use of gesture in the air performed by two independent mobile devices as an identifier. The MTDS method has certain advantages over currently used biometric methods, including fingerprint authentication, face recognition and voice recognition. A multimodal three-dimensional dynamic signature allows quickly changing an authentication gesture, as well as concealing the authentication procedure using gestures that do not attract attention. Despite all its advantages, the MTDS method has certain limitations, the main one is building functionally dynamic complex (FDC skills required for accurate repeating an authentication gesture. To correctly create MTDS need to have a system for assessing the reliability of gestures. Approaches to the solution of this task are grouped in this article according to methods of their implementation. Two of the approaches can be implemented only with the use of a server as a centralized MTDS processing center and one approach can be implemented using smartphone's own computing resources. The final part of the article provides data of testing one of these methods on a template performing the MTDS authentication.

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

International Nuclear Information System (INIS)

Timp, Sheila; Karssemeijer, Nico

2004-01-01

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

A study of concept-based similarity approaches for recommending program examples

Science.gov (United States)

Hosseini, Roya; Brusilovsky, Peter

2017-07-01

This paper investigates a range of concept-based example recommendation approaches that we developed to provide example-based problem-solving support in the domain of programming. The goal of these approaches is to offer students a set of most relevant remedial examples when they have trouble solving a code comprehension problem where students examine a program code to determine its output or the final value of a variable. In this paper, we use the ideas of semantic-level similarity-based linking developed in the area of intelligent hypertext to generate examples for the given problem. To determine the best-performing approach, we explored two groups of similarity approaches for selecting examples: non-structural approaches focusing on examples that are similar to the problem in terms of concept coverage and structural approaches focusing on examples that are similar to the problem by the structure of the content. We also explored the value of personalized example recommendation based on student's knowledge levels and learning goal of the exercise. The paper presents concept-based similarity approaches that we developed, explains the data collection studies and reports the result of comparative analysis. The results of our analysis showed better ranking performance of the personalized structural variant of cosine similarity approach.

Computer Program for Analysis, Design and Optimization of Propulsion, Dynamics, and Kinematics of Multistage Rockets

Science.gov (United States)

Lali, Mehdi

2009-03-01

A comprehensive computer program is designed in MATLAB to analyze, design and optimize the propulsion, dynamics, thermodynamics, and kinematics of any serial multi-staging rocket for a set of given data. The program is quite user-friendly. It comprises two main sections: "analysis and design" and "optimization." Each section has a GUI (Graphical User Interface) in which the rocket's data are entered by the user and by which the program is run. The first section analyzes the performance of the rocket that is previously devised by the user. Numerous plots and subplots are provided to display the performance of the rocket. The second section of the program finds the "optimum trajectory" via billions of iterations and computations which are done through sophisticated algorithms using numerical methods and incremental integrations. Innovative techniques are applied to calculate the optimal parameters for the engine and designing the "optimal pitch program." This computer program is stand-alone in such a way that it calculates almost every design parameter in regards to rocket propulsion and dynamics. It is meant to be used for actual launch operations as well as educational and research purposes.

Steady and dynamic states analysis of induction motor: FEA approach

African Journals Online (AJOL)

This paper deals with the steady and dynamic states analysis of induction motor using finite element analysis (FEA) approach. The motor has aluminum rotor bars and is designed for direct-on-line operation at 50 Hz. A study of the losses occurring in the motor performed at operating frequency of 50Hz showed that stator ...

An object-oriented programming paradigm for parallelization of computational fluid dynamics

International Nuclear Information System (INIS)

Ohta, Takashi.

1997-03-01

We propose an object-oriented programming paradigm for parallelization of scientific computing programs, and show that the approach can be a very useful strategy. Generally, parallelization of scientific programs tends to be complicated and unportable due to the specific requirements of each parallel computer or compiler. In this paper, we show that the object-oriented programming design, which separates the parallel processing parts from the solver of the applications, can achieve the large improvement in the maintenance of the codes, as well as the high portability. We design the program for the two-dimensional Euler equations according to the paradigm, and evaluate the parallel performance on IBM SP2. (author)

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

Science.gov (United States)

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

2017-07-01

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

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

Science.gov (United States)

1975-12-01

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

A Dynamical System Approach Explaining the Process of Development by Introducing Different Time-scales.

Science.gov (United States)

Hashemi Kamangar, Somayeh Sadat; Moradimanesh, Zahra; Mokhtari, Setareh; Bakouie, Fatemeh

2018-06-11

A developmental process can be described as changes through time within a complex dynamic system. The self-organized changes and emergent behaviour during development can be described and modeled as a dynamical system. We propose a dynamical system approach to answer the main question in human cognitive development i.e. the changes during development happens continuously or in discontinuous stages. Within this approach there is a concept; the size of time scales, which can be used to address the aforementioned question. We introduce a framework, by considering the concept of time-scale, in which "fast" and "slow" is defined by the size of time-scales. According to our suggested model, the overall pattern of development can be seen as one continuous function, with different time-scales in different time intervals.

Modification of the RTMTRACE program for numerical simulation of particle dynamics at racetrack microtrons with account of space charge forces

International Nuclear Information System (INIS)

Surma, I.V.; Shvedunov, V.I.

1993-01-01

The paper presents modification results of the program for simulation of particle dynamics in cyclic accelerators with RTMTRACE linear gap. The program was modified with regard for the effect of space charge effect on particle dynamics. Calculation results of particle dynamics in 1 MeV energy continuous-duty accelerator with 10 kw beam were used to develop continuous powerful commercial accelerator. 3 refs., 2 figs

Modelling of population dynamics of red king crab using Bayesian approach

Directory of Open Access Journals (Sweden)

Bakanev Sergey ...

2012-10-01

Modeling population dynamics based on the Bayesian approach enables to successfully resolve the above issues. The integration of the data from various studies into a unified model based on Bayesian parameter estimation method provides a much more detailed description of the processes occurring in the population.

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

International Nuclear Information System (INIS)

Ishizaka, Hiroaki; Gofuku, Akio; Yoshikawa, Hidekazu

2004-01-01

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)

TEACCH and SIT Approach Program in Children with Autism Spectrum Disorders

Directory of Open Access Journals (Sweden)

Maryam Abshirini

2016-10-01

Full Text Available Objective: Sensory Integration Therapy (SIT is one of the most commonly used treatment approaches for Autism Spectrum Disorders (ASD. Treatment and Education of Autistic and related Communication-handicapped Children (TEACCH is another less known approach in Iran. The aim of this study was to compare the effectiveness of SIT and TEACCH approaches in children with ASD. Design: The study design was quasi- experimental, which was conducted on 2014 in Autism center of Bushehr city, based in south of Iran. Method: Study participants were children aged 3 to 9 with normal IQ who were diagnosed with ASD. Intervention included SIT and TEACCH treatment approaches for a 6 months duration to two groups of children (n=20. One group did not receive any intervention during the 6 months. Main outcome was the total score of Autism Treatment Evaluation Checklist (ATEC. Results: There was no significant difference in ATEC score between the three groups at the base line. ATEC score was significantly different among three groups after intervention using one-way ANOVA test. Tukey test showed that TEACCH group had more improvement in autism score compared to SIT group. The results of ANCOVA test showed that 70% of variation in autism score is due to the interventional approaches. Conclusion: This study showed that TEACCH program was effective in Iranian culture as well, and can be used widely in Iranian Autism centers and TEACCH program was more effective than SIT program.

A dynamic multimedia fuzzy-stochastic integrated environmental risk assessment approach for contaminated sites management

Energy Technology Data Exchange (ETDEWEB)

Hu, Yan; Wen, Jing-ya; Li, Xiao-li; Wang, Da-zhou; Li, Yu, E-mail: liyuxx8@hotmail.com

2013-10-15

Highlights: • Using interval mathematics to describe spatial and temporal variability and parameter uncertainty. • Using fuzzy theory to quantify variability of environmental guideline values. • Using probabilistic approach to integrate interval concentrations and fuzzy environmental guideline. • Establishment of dynamic multimedia environmental integrated risk assessment framework. -- Abstract: A dynamic multimedia fuzzy-stochastic integrated environmental risk assessment approach was developed for contaminated sites management. The contaminant concentrations were simulated by a validated interval dynamic multimedia fugacity model, and different guideline values for the same contaminant were represented as a fuzzy environmental guideline. Then, the probability of violating environmental guideline (Pv) can be determined by comparison between the modeled concentrations and the fuzzy environmental guideline, and the constructed relationship between the Pvs and environmental risk levels was used to assess the environmental risk level. The developed approach was applied to assess the integrated environmental risk at a case study site in China, simulated from 1985 to 2020. Four scenarios were analyzed, including “residential land” and “industrial land” environmental guidelines under “strict” and “loose” strictness. It was found that PAH concentrations will increase steadily over time, with soil found to be the dominant sink. Source emission in soil was the leading input and atmospheric sedimentation was the dominant transfer process. The integrated environmental risks primarily resulted from petroleum spills and coke ovens, while the soil environmental risks came from coal combustion. The developed approach offers an effective tool for quantifying variability and uncertainty in the dynamic multimedia integrated environmental risk assessment and the contaminated site management.

A dynamic multimedia fuzzy-stochastic integrated environmental risk assessment approach for contaminated sites management

International Nuclear Information System (INIS)

Hu, Yan; Wen, Jing-ya; Li, Xiao-li; Wang, Da-zhou; Li, Yu

2013-01-01

Highlights: • Using interval mathematics to describe spatial and temporal variability and parameter uncertainty. • Using fuzzy theory to quantify variability of environmental guideline values. • Using probabilistic approach to integrate interval concentrations and fuzzy environmental guideline. • Establishment of dynamic multimedia environmental integrated risk assessment framework. -- Abstract: A dynamic multimedia fuzzy-stochastic integrated environmental risk assessment approach was developed for contaminated sites management. The contaminant concentrations were simulated by a validated interval dynamic multimedia fugacity model, and different guideline values for the same contaminant were represented as a fuzzy environmental guideline. Then, the probability of violating environmental guideline (Pv) can be determined by comparison between the modeled concentrations and the fuzzy environmental guideline, and the constructed relationship between the Pvs and environmental risk levels was used to assess the environmental risk level. The developed approach was applied to assess the integrated environmental risk at a case study site in China, simulated from 1985 to 2020. Four scenarios were analyzed, including “residential land” and “industrial land” environmental guidelines under “strict” and “loose” strictness. It was found that PAH concentrations will increase steadily over time, with soil found to be the dominant sink. Source emission in soil was the leading input and atmospheric sedimentation was the dominant transfer process. The integrated environmental risks primarily resulted from petroleum spills and coke ovens, while the soil environmental risks came from coal combustion. The developed approach offers an effective tool for quantifying variability and uncertainty in the dynamic multimedia integrated environmental risk assessment and the contaminated site management

A two-stage stochastic programming approach for operating multi-energy systems

DEFF Research Database (Denmark)

Zeng, Qing; Fang, Jiakun; Chen, Zhe

2017-01-01

This paper provides a two-stage stochastic programming approach for joint operating multi-energy systems under uncertainty. Simulation is carried out in a test system to demonstrate the feasibility and efficiency of the proposed approach. The test energy system includes a gas subsystem with a gas...

The Elements of Language Curriculum: A Systematic Approach to Program Development.

Science.gov (United States)

Brown, James Dean

A systematic approach to second language curriculum development is outlined, enumerating the phases and activities involved in developing and implementing a sound and effective language program. The first chapter describes a system whereby all language teaching activities can be classified into approaches, syllabuses, techniques, exercises, or…

Dynamic Positioning Capability Analysis for Marine Vessels Based on A DPCap Polar Plot Program

Science.gov (United States)

Wang, Lei; Yang, Jian-min; Xu, Sheng-wen

2018-03-01

Dynamic positioning capability (DPCap) analysis is essential in the selection of thrusters, in their configuration, and during preliminary investigation of the positioning ability of a newly designed vessel dynamic positioning system. DPCap analysis can help determine the maximum environmental forces, in which the DP system can counteract in given headings. The accuracy of the DPCap analysis is determined by the precise estimation of the environmental forces as well as the effectiveness of the thrust allocation logic. This paper is dedicated to developing an effective and efficient software program for the DPCap analysis for marine vessels. Estimation of the environmental forces can be obtained by model tests, hydrodynamic computation and empirical formulas. A quadratic programming method is adopted to allocate the total thrust on every thruster of the vessel. A detailed description of the thrust allocation logic of the software program is given. The effectiveness of the new program DPCap Polar Plot (DPCPP) was validated by a DPCap analysis for a supply vessel. The present study indicates that the developed program can be used in the DPCap analysis for marine vessels. Moreover, DPCap analysis considering the thruster failure mode might give guidance to the designers of vessels whose thrusters need to be safer.

Academic entrepreneurship in a medical university: A system dynamics approach

Directory of Open Access Journals (Sweden)

Tofighi Sharam

2017-01-01

Full Text Available Academic entrepreneurship is a dynamic field which is growing after the second academic revolution that added entrepreneurial mission as the Third Mission of universities. In this sense, dynamics of this phenomenon is a suitable field of study and provides fruitful insights for both theory and practice. Thus, in this research, system dynamics approach is used to scrutinize academic entrepreneurship. The main question of this research is 'how academic entrepreneurship might evolve in a medical university of a developing country?' Therefore, Cross Impact Analysis method is used to examine the system behavior. In this study, the main attributes are adapted from a recent study by Salamzadeh et al. (2013a. Then, some policy variables are proposed and their effects on the model were shown. Findings show that although entrepreneurial ecosystem is growing in the country, still there are problems to be taken into account in order to improve the entrepreneurship in university.

Comparison between goal programming and cointegration approaches in enhanced index tracking

Science.gov (United States)

Lam, Weng Siew; Jamaan, Saiful Hafizah Hj.

2013-04-01

Index tracking is a popular form of passive fund management in stock market. Passive management is a buy-and-hold strategy that aims to achieve rate of return similar to the market return. Index tracking problem is a problem of reproducing the performance of a stock market index, without purchasing all of the stocks that make up the index. This can be done by establishing an optimal portfolio that minimizes risk or tracking error. An improved index tracking (enhanced index tracking) is a dual-objective optimization problem, a trade-off between maximizing the mean return and minimizing the tracking error. Enhanced index tracking aims to generate excess return over the return achieved by the index. The objective of this study is to compare the portfolio compositions and performances by using two different approaches in enhanced index tracking problem, which are goal programming and cointegration. The result of this study shows that the optimal portfolios for both approaches are able to outperform the Malaysia market index which is Kuala Lumpur Composite Index. Both approaches give different optimal portfolio compositions. Besides, the cointegration approach outperforms the goal programming approach because the cointegration approach gives higher mean return and lower risk or tracking error. Therefore, the cointegration approach is more appropriate for the investors in Malaysia.

A Dynamic BI–Orthogonal Field Equation Approach to Efficient Bayesian Inversion

Directory of Open Access Journals (Sweden)

Tagade Piyush M.

2017-06-01

Full Text Available This paper proposes a novel computationally efficient stochastic spectral projection based approach to Bayesian inversion of a computer simulator with high dimensional parametric and model structure uncertainty. The proposed method is based on the decomposition of the solution into its mean and a random field using a generic Karhunen-Loève expansion. The random field is represented as a convolution of separable Hilbert spaces in stochastic and spatial dimensions that are spectrally represented using respective orthogonal bases. In particular, the present paper investigates generalized polynomial chaos bases for the stochastic dimension and eigenfunction bases for the spatial dimension. Dynamic orthogonality is used to derive closed-form equations for the time evolution of mean, spatial and the stochastic fields. The resultant system of equations consists of a partial differential equation (PDE that defines the dynamic evolution of the mean, a set of PDEs to define the time evolution of eigenfunction bases, while a set of ordinary differential equations (ODEs define dynamics of the stochastic field. This system of dynamic evolution equations efficiently propagates the prior parametric uncertainty to the system response. The resulting bi-orthogonal expansion of the system response is used to reformulate the Bayesian inference for efficient exploration of the posterior distribution. The efficacy of the proposed method is investigated for calibration of a 2D transient diffusion simulator with an uncertain source location and diffusivity. The computational efficiency of the method is demonstrated against a Monte Carlo method and a generalized polynomial chaos approach.

Applications of sub-optimality in dynamic programming to location and construction of nuclear fuel processing plant

International Nuclear Information System (INIS)

Thiriet, L.; Deledicq, A.

1968-09-01

First, the point of applying Dynamic Programming to optimization and Operational Research problems in chemical industries are recalled, as well as the conditions in which a dynamic program is illustrated by a sequential graph. A new algorithm for the determination of sub-optimal politics in a sequential graph is then developed. Finally, the applications of sub-optimality concept is shown when taking into account the indirect effects related to possible strategies, or in the case of stochastic choices and of problems of the siting of plants... application examples are given. (authors) [fr

Multiscale molecular dynamics simulation approaches to the structure and dynamics of viruses.

Science.gov (United States)

Huber, Roland G; Marzinek, Jan K; Holdbrook, Daniel A; Bond, Peter J

2017-09-01

Viral pathogens are a significant source of human morbidity and mortality, and have a major impact on societies and economies around the world. One of the challenges inherent in targeting these pathogens with drugs is the tight integration of the viral life cycle with the host's cellular machinery. However, the reliance of the virus on the host cell replication machinery is also an opportunity for therapeutic targeting, as successful entry- and exit-inhibitors have demonstrated. An understanding of the extracellular and intracellular structure and dynamics of the virion - as well as of the entry and exit pathways in host and vector cells - is therefore crucial to the advancement of novel antivirals. In recent years, advances in computing architecture and algorithms have begun to allow us to use simulations to study the structure and dynamics of viral ultrastructures at various stages of their life cycle in atomistic or near-atomistic detail. In this review, we outline specific challenges and solutions that have emerged to allow for structurally detailed modelling of viruses in silico. We focus on the history and state of the art of atomistic and coarse-grained approaches to simulate the dynamics of the large, macromolecular structures associated with viral infection, and on their usefulness in explaining and expanding upon experimental data. We discuss the types of interactions that need to be modeled to describe major components of the virus particle and advances in modelling techniques that allow for the treatment of these systems, highlighting recent key simulation studies. Copyright © 2016 Elsevier Ltd. All rights reserved.

Systems approaches to study root architecture dynamics

Directory of Open Access Journals (Sweden)

Candela eCuesta

2013-12-01

Full Text Available The plant root system is essential for providing anchorage to the soil, supplying minerals and water, and synthesizing metabolites. It is a dynamic organ modulated by external cues such as environmental signals, water and nutrients availability, salinity and others. Lateral roots are initiated from the primary root post-embryonically, after which they progress through discrete developmental stages which can be independently controlled, providing a high level of plasticity during root system formation.Within this review, main contributions are presented, from the classical forward genetic screens to the more recent high-throughput approaches, combined with computer model predictions, dissecting how lateral roots and thereby root system architecture is established and developed.

Dynamic Programming and Graph Algorithms in Computer Vision*

Science.gov (United States)

Felzenszwalb, Pedro F.; Zabih, Ramin

2013-01-01

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

Dynamics and tolerances for the CERN interdigital H LINAC

International Nuclear Information System (INIS)

Valero, S.; Ratzinger, U.

1992-01-01

A three tank interdigital H structure has been chosen for the 0.25 to 4.2 MeV/u part of the CERN heavy-ion injector linac. The complete design has been developed by GSI, in particular the longitudinal dimensions have been determined and multi-particle studies have been made using the program LORAS. Some RF tolerance studies have also be made at CERN using this program. For more general approach to the dynamics, the program DYNAC is being used at CERN especially where statistical analyses are essential i.e for determining emittance growth, tolerances on accelerator parameters and alignment. The approaches and results of these two programs are compared for this novel type of accelerator

Program Management Approach to the Territorial Development of Small Business

Directory of Open Access Journals (Sweden)

Natalia Aleksandrovna Knysh

2016-06-01

Full Text Available This article presents the results of the research of the application on a state level of the program management approach to the territorial development of small business. Studying the main mechanism of the state policy implementation in the sphere of small business on a regional level, the authors have revealed the necessity to take into account the territorial specificity while the government programs of small business development are being formed. The analysis of the national practice of utilizing the program management mechanism in the regional system of the government support of small entrepreneurship was conducted on the example of Omsk region. The results of the analysis have shown the inefficiency of the current support system for small business and have determined the need to create an integrated model of territorial programming, which would not only contribute to the qualitative development of small business, but also provide the functioning efficiency of program management mechanism. As a result, the authors have created the two-level model of the programming of the territorial development of small business, which allows to satisfy purposefully the needs of entrepreneurship taking into account the specificity of the internal and external environment of the region. The first level of the model is methodological one and it is based on the marketing approach (the concepts of place marketing and relationship marketing to the operation of the program management mechanism. The second level of the model is methodical one. It offers the combination of the flexible methods of management of programming procedure (benchmarking, foresight, crowdsourcing and outsourcing. The given model raises the efficiency of the management decisions of the state structures in the sphere of small business. Therefore, it is interesting for the government authorities, which are responsible for the regional and municipal support programs of small business, as well

Improved dynamic-programming-based algorithms for segmentation of masses in mammograms

International Nuclear Information System (INIS)

Dominguez, Alfonso Rojas; Nandi, Asoke K.

2007-01-01

In this paper, two new boundary tracing algorithms for segmentation of breast masses are presented. These new algorithms are based on the dynamic programming-based boundary tracing (DPBT) algorithm proposed in Timp and Karssemeijer, [S. Timp and N. Karssemeijer, Med. Phys. 31, 958-971 (2004)] The DPBT algorithm contains two main steps: (1) construction of a local cost function, and (2) application of dynamic programming to the selection of the optimal boundary based on the local cost function. The validity of some assumptions used in the design of the DPBT algorithm is tested in this paper using a set of 349 mammographic images. Based on the results of the tests, modifications to the computation of the local cost function have been designed and have resulted in the Improved-DPBT (IDPBT) algorithm. A procedure for the dynamic selection of the strength of the components of the local cost function is presented that makes these parameters independent of the image dataset. Incorporation of this dynamic selection procedure has produced another new algorithm which we have called ID 2 PBT. Methods for the determination of some other parameters of the DPBT algorithm that were not covered in the original paper are presented as well. The merits of the new IDPBT and ID 2 PBT algorithms are demonstrated experimentally by comparison against the DPBT algorithm. The segmentation results are evaluated with base on the area overlap measure and other segmentation metrics. Both of the new algorithms outperform the original DPBT; the improvements in the algorithms performance are more noticeable around the values of the segmentation metrics corresponding to the highest segmentation accuracy, i.e., the new algorithms produce more optimally segmented regions, rather than a pronounced increase in the average quality of all the segmented regions

Separation of left and right lungs using 3D information of sequential CT images and a guided dynamic programming algorithm

Science.gov (United States)

Park, Sang Cheol; Leader, Joseph Ken; Tan, Jun; Lee, Guee Sang; Kim, Soo Hyung; Na, In Seop; Zheng, Bin

2011-01-01

Objective this article presents a new computerized scheme that aims to accurately and robustly separate left and right lungs on CT examinations. Methods we developed and tested a method to separate the left and right lungs using sequential CT information and a guided dynamic programming algorithm using adaptively and automatically selected start point and end point with especially severe and multiple connections. Results the scheme successfully identified and separated all 827 connections on the total 4034 CT images in an independent testing dataset of CT examinations. The proposed scheme separated multiple connections regardless of their locations, and the guided dynamic programming algorithm reduced the computation time to approximately 4.6% in comparison with the traditional dynamic programming and avoided the permeation of the separation boundary into normal lung tissue. Conclusions The proposed method is able to robustly and accurately disconnect all connections between left and right lungs and the guided dynamic programming algorithm is able to remove redundant processing. PMID:21412104

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

International Nuclear Information System (INIS)

Kukita, Yutaka; Namatame, Ken; Takeshita, Isao; Shiba, Masayoshi

1982-12-01

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)

Discrete Cosserat Approach for Multi-Section Soft Robots Dynamics

OpenAIRE

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

2017-01-01

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

[Efficacy of the program "Testas's (mis)adventures" to promote the deep approach to learning].

Science.gov (United States)

Rosário, Pedro; González-Pienda, Julio Antonio; Cerezo, Rebeca; Pinto, Ricardo; Ferreira, Pedro; Abilio, Lourenço; Paiva, Olimpia

2010-11-01

This paper provides information about the efficacy of a tutorial training program intended to enhance elementary fifth graders' study processes and foster their deep approaches to learning. The program "Testas's (mis)adventures" consists of a set of books in which Testas, a typical student, reveals and reflects upon his life experiences during school years. These life stories are nothing but an opportunity to present and train a wide range of learning strategies and self-regulatory processes, designed to insure students' deeper preparation for present and future learning challenges. The program has been developed along a school year, in a one hour weekly tutorial sessions. The training program had a semi-experimental design, included an experimental group (n=50) and a control one (n=50), and used pre- and posttest measures (learning strategies' declarative knowledge, learning approaches and academic achievement). Data suggest that the students enrolled in the training program, comparing with students in the control group, showed a significant improvement in their declarative knowledge of learning strategies and in their deep approach to learning, consequently lowering their use of a surface approach. In spite of this, in what concerns to academic achievement, no statistically significant differences have been found.

Bohm's theory versus dynamical reduction

International Nuclear Information System (INIS)

Ghirardi, G.C.; Grassi, R.

1995-10-01

This essay begins with a comparison between Bohm's theory and the dynamical reduction program. While there are similarities (e.g., the preferred basis), there are also important differences (e.g., the type of nonlocality or of Lorentz invariance). In particular, it is made plausible that theories which exhibit parameter dependence effects cannot be ''genuinely Lorentz invariant''. For the two approaches under consideration, this analysis provides a comparison that can produce a richer understanding both of the pilot wave and of the dynamical reduction mechanism. (author). 33 refs, 1 fig

A simple interface to computational fluid dynamics programs for building environment simulations

Energy Technology Data Exchange (ETDEWEB)

Broderick, III, C R; Chen, Q [Massachusetts Institute of Technology, Cambridge, MA (United States)

2000-07-01

It is becoming a popular practice for architects and HVAC engineers to simulate airflow in and around buildings by computational fluid dynamics (CFD) methods in order to predict indoor and outdoor environment. However, many CFD programs are crippled by a historically poor and inefficient user interface system, particularly for users with little training in numerical simulation. This investigation endeavors to create a simplified CFD interface (SCI) that allows architects and buildings engineers to use CFD without excessive training. The SCI can be easily integrated into new CFD programs. (author)

A Dynamic Fuzzy Approach Based on the EDAS Method for Multi-Criteria Subcontractor Evaluation

Directory of Open Access Journals (Sweden)

Mehdi Keshavarz-Ghorabaee

2018-03-01

Full Text Available Selection of appropriate subcontractors for outsourcing is very important for the success of construction projects. This can improve the overall quality of projects and promote the qualification and reputation of the main contractors. The evaluation of subcontractors can be made by some experts or decision-makers with respect to some criteria. If this process is done in different time periods, it can be defined as a dynamic multi-criteria group decision-making (MCGDM problem. In this study, we propose a new fuzzy dynamic MCGDM approach based on the EDAS (Evaluation based on Distance from Average Solution method for subcontractor evaluation. In the procedure of the proposed approach, the sets of alternatives, criteria and decision-makers can be changed at different time periods. Also, the proposed approach gives more weight to newer decision information for aggregating the overall performance of alternatives. A numerical example is used to illustrate the proposed approach and show the application of it in subcontractor evaluation. The results demonstrate that the proposed approach is efficient and useful in real-world decision-making problems.

A polynomial chaos approach to the analysis of vehicle dynamics under uncertainty

Science.gov (United States)

Kewlani, Gaurav; Crawford, Justin; Iagnemma, Karl

2012-05-01

The ability of ground vehicles to quickly and accurately analyse their dynamic response to a given input is critical to their safety and efficient autonomous operation. In field conditions, significant uncertainty is associated with terrain and/or vehicle parameter estimates, and this uncertainty must be considered in the analysis of vehicle motion dynamics. Here, polynomial chaos approaches that explicitly consider parametric uncertainty during modelling of vehicle dynamics are presented. They are shown to be computationally more efficient than the standard Monte Carlo scheme, and experimental results compared with the simulation results performed on ANVEL (a vehicle simulator) indicate that the method can be utilised for efficient and accurate prediction of vehicle motion in realistic scenarios.

A dynamic texture based approach to recognition of facial actions and their temporal models

NARCIS (Netherlands)

Koelstra, Sander; Pantic, Maja; Patras, Ioannis (Yannis)

2010-01-01

In this work, we propose a dynamic texture-based approach to the recognition of facial Action Units (AUs, atomic facial gestures) and their temporal models (i.e., sequences of temporal segments: neutral, onset, apex, and offset) in near-frontal-view face videos. Two approaches to modeling the

The stochastic system approach for estimating dynamic treatments effect.

Science.gov (United States)

Commenges, Daniel; Gégout-Petit, Anne

2015-10-01

The problem of assessing the effect of a treatment on a marker in observational studies raises the difficulty that attribution of the treatment may depend on the observed marker values. As an example, we focus on the analysis of the effect of a HAART on CD4 counts, where attribution of the treatment may depend on the observed marker values. This problem has been treated using marginal structural models relying on the counterfactual/potential response formalism. Another approach to causality is based on dynamical models, and causal influence has been formalized in the framework of the Doob-Meyer decomposition of stochastic processes. Causal inference however needs assumptions that we detail in this paper and we call this approach to causality the "stochastic system" approach. First we treat this problem in discrete time, then in continuous time. This approach allows incorporating biological knowledge naturally. When working in continuous time, the mechanistic approach involves distinguishing the model for the system and the model for the observations. Indeed, biological systems live in continuous time, and mechanisms can be expressed in the form of a system of differential equations, while observations are taken at discrete times. Inference in mechanistic models is challenging, particularly from a numerical point of view, but these models can yield much richer and reliable results.

Chance-constrained programming approach to natural-gas curtailment decisions

Energy Technology Data Exchange (ETDEWEB)

Guldmann, J M

1981-10-01

This paper presents a modeling methodology for the determination of optimal-curtailment decisions by a gas-distribution utility during a chronic gas-shortage situation. Based on the end-use priority approach, a linear-programming model is formulated, that reallocates the available gas supply among the utility's customers while minimizing fuel switching, unemployment, and utility operating costs. This model is then transformed into a chance-constrained program in order to account for the weather-related variability of the gas requirements. The methodology is applied to the East Ohio Gas Company. 16 references, 2 figures, 3 tables.

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

DEFF Research Database (Denmark)

Nielsen, Helena Skyt

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

Chaos based on Riemannian geometric approach to Abelian-Higgs dynamical system

International Nuclear Information System (INIS)

Kawabe, Tetsuji

2003-01-01

Based on the Riemannian geometric approach, we study chaos of the Abelian-Higgs dynamical system derived from a classical field equation consisting of a spatially homogeneous Abelian gauge field and Higgs field. Using the global indicator of chaos formulated by the sectional curvature of the ambient manifold, we show that this approach brings the same qualitative and quantitative information about order and chaos as has been provided by the Lyapunov exponents in the conventional and phenomenological approach. We confirm that the mechanism of chaos is a parametric instability of the system. By analyzing a close relation between the sectional curvature and the Gaussian curvature, we point out that the Toda-Brumer criterion becomes a sufficient condition to the criterion based on this geometric approach as to the stability condition

A new shared-memory programming paradigm for molecular dynamics simulations on the Intel Paragon

International Nuclear Information System (INIS)

D'Azevedo, E.F.; Romine, C.H.

1994-12-01

This report describes the use of shared memory emulation with DOLIB (Distributed Object Library) to simplify parallel programming on the Intel Paragon. A molecular dynamics application is used as an example to illustrate the use of the DOLIB shared memory library. SOTON-PAR, a parallel molecular dynamics code with explicit message-passing using a Lennard-Jones 6-12 potential, is rewritten using DOLIB primitives. The resulting code has no explicit message primitives and resembles a serial code. The new code can perform dynamic load balancing and achieves better performance than the original parallel code with explicit message-passing

Portfolio optimization in enhanced index tracking with goal programming approach

Science.gov (United States)

Siew, Lam Weng; Jaaman, Saiful Hafizah Hj.; Ismail, Hamizun bin

2014-09-01

Enhanced index tracking is a popular form of passive fund management in stock market. Enhanced index tracking aims to generate excess return over the return achieved by the market index without purchasing all of the stocks that make up the index. This can be done by establishing an optimal portfolio to maximize the mean return and minimize the risk. The objective of this paper is to determine the portfolio composition and performance using goal programming approach in enhanced index tracking and comparing it to the market index. Goal programming is a branch of multi-objective optimization which can handle decision problems that involve two different goals in enhanced index tracking, a trade-off between maximizing the mean return and minimizing the risk. The results of this study show that the optimal portfolio with goal programming approach is able to outperform the Malaysia market index which is FTSE Bursa Malaysia Kuala Lumpur Composite Index because of higher mean return and lower risk without purchasing all the stocks in the market index.

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.

Practical approaches to implementing facility wide equipment strengthening programs

International Nuclear Information System (INIS)

Kincaid, R.H.; Smietana, E.A.

1989-01-01

Equipment strengthening programs typically focus on components required to ensure operability of safety related equipment or to prevent the release of toxic substances. Survival of non-safety related equipment may also be crucial to ensure rapid recovery and minimize business interruption losses. Implementing a strengthening program for non-safety related equipment can be difficult due to the large amounts of equipment involved and limited budget availability. EQE has successfully implemented comprehensive equipment strengthening programs for a number of California corporations. Many of the lessons learned from these projects are applicable to DOE facilities. These include techniques for prioritizing equipment and three general methodologies for anchoring equipment. Pros and cons of each anchorage approach are presented along with typical equipment strengthening costs

A New Dynamic Multicriteria Decision-Making Approach for Green Supplier Selection in Construction Projects under Time Sequence

Directory of Open Access Journals (Sweden)

Shi Yin

2017-01-01

Full Text Available Nowadays, due to the lack of natural resources and environment problems which have been appearing increasingly, green building is more and more involved in the construction industry. The evaluation and selection of green supplier are a significant part of the development of green building. In this paper, we propose a new dynamic multicriteria decision-making approach in construction projects under time sequence to deal with these problems. First, the paper establishes 4 main criteria and 17 subcriteria for green supplier selection in construction projects. Then, a method considering interaction between criteria and the influence of constructors subjective preference and objective criteria information is proposed. It uses the interval-valued intuitionistic fuzzy geometric weighted Heronian means (IVIFGWHM operator and multitarget nonlinear programming model to calculate the comprehensive evaluation results of potential green suppliers. The proposed method is much easier for constructors to select green supplier and make the localization of green supplier more practical and accurate in construction projects. Finally, a case study about a green building project is given to verify practicality and effectiveness of the proposed approach.

Issues of knowledge and expertise in policy arrangements: An exploratory case study of the dynamic preservation approach to coastal management