Dynamic Optimization of UV Flash Processes

DEFF Research Database (Denmark)

Ritschel, Tobias Kasper Skovborg; Capolei, Andrea; Jørgensen, John Bagterp

2017-01-01

UV ash processes, also referred to as isoenergetic-isochoric ash processes, occur for dynamic simulation and optimization of vapor-liquid equilibrium processes. Dynamic optimization and nonlinear model predictive control of distillation columns, certain two-phase ow problems, as well as oil reser...... that the optimization solver, the compiler, and high-performance linear algebra software are all important for e_cient dynamic optimization of UV ash processes....

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

Optimization of Mangala Hydropower Station, Pakistan, using Optimization Techniques

Directory of Open Access Journals (Sweden)

Zaman Muhammad

2017-01-01

Full Text Available Hydropower generation is one of the key element in the economy of a country. The present study focusses on the optimal electricity generation from the Mangla reservoir in Pakistan. A mathematical model has been developed for the Mangla hydropower station and particle swarm and genetic algorithm optimization techniques were applied at this model for optimal electricity generation. Results revealed that electricity production increases with the application of optimization techniques at the proposed mathematical model. Genetic Algorithm can produce maximum electricity than Particle swarm optimization but the time of execution of particle swarm optimization is much lesser than the Genetic algorithm. Mangla hydropower station can produce up to 59*109 kWh electricity by using the flows optimally than 47*108 kWh production from traditional methods.

Topology optimization of continuum structure with dynamic constraints using mode identification

International Nuclear Information System (INIS)

Li, Jianhongyu; Chen, Shenyan; Huang, Hai

2015-01-01

For the problems such as mode exchange and localized modes in topology optimization of continuum structure with dynamic constraints, it is difficult to apply the traditional optimization model which considers fixed order mode frequencies as constraints in optimization calculation. A new optimization model is established, in which the dynamical constraints are changed as frequencies of structural principal vibrations. The order of the principal vibrations is recognized through modal identification in the optimization process, and the constraints are updated to make the optimization calculation execute smoothly. Localized mode elimination techniques are introduced to reduce the localized modes induced by the low density elements, which could improve the optimization efficiency. A new optimization process is designed, which achieves the purpose of overcoming mode exchange problem and localized mode problem at the cost of increasing several structural analyses. Optimization system is developed by using Nastran to perform structural analysis and sensitivity analysis and two-level multipoint approximation algorithm as optimizer. Numerical results verified that the presented method is effective and reasonable.

Nonlinear dynamic macromodeling techniques for audio systems

Science.gov (United States)

Ogrodzki, Jan; Bieńkowski, Piotr

2015-09-01

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

Constrained Dynamic Optimality and Binomial Terminal Wealth

DEFF Research Database (Denmark)

Pedersen, J. L.; Peskir, G.

2018-01-01

with interest rate $r \\in {R}$). Letting $P_{t,x}$ denote a probability measure under which $X^u$ takes value $x$ at time $t,$ we study the dynamic version of the nonlinear optimal control problem $\\inf_u\\, Var{t,X_t^u}(X_T^u)$ where the infimum is taken over admissible controls $u$ subject to $X_t^u \\ge e...... a martingale method combined with Lagrange multipliers, we derive the dynamically optimal control $u_*^d$ in closed form and prove that the dynamically optimal terminal wealth $X_T^d$ can only take two values $g$ and $\\beta$. This binomial nature of the dynamically optimal strategy stands in sharp contrast...... with other known portfolio selection strategies encountered in the literature. A direct comparison shows that the dynamically optimal (time-consistent) strategy outperforms the statically optimal (time-inconsistent) strategy in the problem....

TECHNIQUE OF OPTIMAL AUDIT PLANNING FOR INFORMATION SECURITY MANAGEMENT SYSTEM

Directory of Open Access Journals (Sweden)

F. N. Shago

2014-03-01

Full Text Available Complication of information security management systems leads to the necessity of improving the scientific and methodological apparatus for these systems auditing. Planning is an important and determining part of information security management systems auditing. Efficiency of audit will be defined by the relation of the reached quality indicators to the spent resources. Thus, there is an important and urgent task of developing methods and techniques for optimization of the audit planning, making it possible to increase its effectiveness. The proposed technique gives the possibility to implement optimal distribution for planning time and material resources on audit stages on the basis of dynamics model for the ISMS quality. Special feature of the proposed approach is the usage of a priori data as well as a posteriori data for the initial audit planning, and also the plan adjustment after each audit event. This gives the possibility to optimize the usage of audit resources in accordance with the selected criteria. Application examples of the technique are given while planning audit information security management system of the organization. The result of computational experiment based on the proposed technique showed that the time (cost audit costs can be reduced by 10-15% and, consequently, quality assessments obtained through audit resources allocation can be improved with respect to well-known methods of audit planning.

Clustering Molecular Dynamics Trajectories for Optimizing Docking Experiments

Directory of Open Access Journals (Sweden)

Renata De Paris

2015-01-01

Full Text Available Molecular dynamics simulations of protein receptors have become an attractive tool for rational drug discovery. However, the high computational cost of employing molecular dynamics trajectories in virtual screening of large repositories threats the feasibility of this task. Computational intelligence techniques have been applied in this context, with the ultimate goal of reducing the overall computational cost so the task can become feasible. Particularly, clustering algorithms have been widely used as a means to reduce the dimensionality of molecular dynamics trajectories. In this paper, we develop a novel methodology for clustering entire trajectories using structural features from the substrate-binding cavity of the receptor in order to optimize docking experiments on a cloud-based environment. The resulting partition was selected based on three clustering validity criteria, and it was further validated by analyzing the interactions between 20 ligands and a fully flexible receptor (FFR model containing a 20 ns molecular dynamics simulation trajectory. Our proposed methodology shows that taking into account features of the substrate-binding cavity as input for the k-means algorithm is a promising technique for accurately selecting ensembles of representative structures tailored to a specific ligand.

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

Airfoil shape optimization using non-traditional optimization technique and its validation

Directory of Open Access Journals (Sweden)

R. Mukesh

2014-07-01

Full Text Available Computational fluid dynamics (CFD is one of the computer-based solution methods which is more widely employed in aerospace engineering. The computational power and time required to carry out the analysis increase as the fidelity of the analysis increases. Aerodynamic shape optimization has become a vital part of aircraft design in the recent years. Generally if we want to optimize an airfoil we have to describe the airfoil and for that, we need to have at least hundred points of x and y co-ordinates. It is really difficult to optimize airfoils with this large number of co-ordinates. Nowadays many different schemes of parameter sets are used to describe general airfoil such as B-spline, and PARSEC. The main goal of these parameterization schemes is to reduce the number of needed parameters as few as possible while controlling the important aerodynamic features effectively. Here the work has been done on the PARSEC geometry representation method. The objective of this work is to introduce the knowledge of describing general airfoil using twelve parameters by representing its shape as a polynomial function. And also we have introduced the concept of Genetic Algorithm to optimize the aerodynamic characteristics of a general airfoil for specific conditions. A MATLAB program has been developed to implement PARSEC, Panel Technique, and Genetic Algorithm. This program has been tested for a standard NACA 2411 airfoil and optimized to improve its coefficient of lift. Pressure distribution and co-efficient of lift for airfoil geometries have been calculated using the Panel method. The optimized airfoil has improved co-efficient of lift compared to the original one. The optimized airfoil is validated using wind tunnel data.

A novel comprehensive learning artificial bee colony optimizer for dynamic optimization biological problems.

Science.gov (United States)

Su, Weixing; Chen, Hanning; Liu, Fang; Lin, Na; Jing, Shikai; Liang, Xiaodan; Liu, Wei

2017-03-01

There are many dynamic optimization problems in the real world, whose convergence and searching ability is cautiously desired, obviously different from static optimization cases. This requires an optimization algorithm adaptively seek the changing optima over dynamic environments, instead of only finding the global optimal solution in the static environment. This paper proposes a novel comprehensive learning artificial bee colony optimizer (CLABC) for optimization in dynamic environments problems, which employs a pool of optimal foraging strategies to balance the exploration and exploitation tradeoff. The main motive of CLABC is to enrich artificial bee foraging behaviors in the ABC model by combining Powell's pattern search method, life-cycle, and crossover-based social learning strategy. The proposed CLABC is a more bee-colony-realistic model that the bee can reproduce and die dynamically throughout the foraging process and population size varies as the algorithm runs. The experiments for evaluating CLABC are conducted on the dynamic moving peak benchmarks. Furthermore, the proposed algorithm is applied to a real-world application of dynamic RFID network optimization. Statistical analysis of all these cases highlights the significant performance improvement due to the beneficial combination and demonstrates the performance superiority of the proposed algorithm.

Optimization of Dynamic Aperture of PEP-X Baseline Design

Energy Technology Data Exchange (ETDEWEB)

Wang, Min-Huey; /SLAC; Cai, Yunhai; /SLAC; Nosochkov, Yuri; /SLAC

2010-08-23

SLAC is developing a long-range plan to transfer the evolving scientific programs at SSRL from the SPEAR3 light source to a much higher performing photon source. Storage ring design is one of the possibilities that would be housed in the 2.2-km PEP-II tunnel. The design goal of PEPX storage ring is to approach an optimal light source design with horizontal emittance less than 100 pm and vertical emittance of 8 pm to reach the diffraction limit of 1-{angstrom} x-ray. The low emittance design requires a lattice with strong focusing leading to high natural chromaticity and therefore to strong sextupoles. The latter caused reduction of dynamic aperture. The dynamic aperture requirement for horizontal injection at injection point is about 10 mm. In order to achieve the desired dynamic aperture the transverse non-linearity of PEP-X is studied. The program LEGO is used to simulate the particle motion. The technique of frequency map is used to analyze the nonlinear behavior. The effect of the non-linearity is tried to minimize at the given constrains of limited space. The details and results of dynamic aperture optimization are discussed in this paper.

Optimization of Dynamic Aperture of PEP-X Baseline Design

International Nuclear Information System (INIS)

Wang, Min-Huey

2010-01-01

SLAC is developing a long-range plan to transfer the evolving scientific programs at SSRL from the SPEAR3 light source to a much higher performing photon source. Storage ring design is one of the possibilities that would be housed in the 2.2-km PEP-II tunnel. The design goal of PEPX storage ring is to approach an optimal light source design with horizontal emittance less than 100 pm and vertical emittance of 8 pm to reach the diffraction limit of 1-(angstrom) x-ray. The low emittance design requires a lattice with strong focusing leading to high natural chromaticity and therefore to strong sextupoles. The latter caused reduction of dynamic aperture. The dynamic aperture requirement for horizontal injection at injection point is about 10 mm. In order to achieve the desired dynamic aperture the transverse non-linearity of PEP-X is studied. The program LEGO is used to simulate the particle motion. The technique of frequency map is used to analyze the nonlinear behavior. The effect of the non-linearity is tried to minimize at the given constrains of limited space. The details and results of dynamic aperture optimization are discussed in this paper.

Radioactive tracer technique in process optimization: applications in the chemical industry

International Nuclear Information System (INIS)

Charlton, J.S.

1989-01-01

Process optimization is concerned with the selection of the most appropriate technological design of the process and with controlling its operation to obtain maximum benefit. The role of radioactive tracers in process optimization is discussed and the various circumstances under which such techniques may be beneficially applied are identified. Case studies are presented which illustrate how radioisotopes may be used to monitor plant performance under dynamic conditions to improve production efficiency and to investigate the cause of production limitations. In addition, the use of sealed sources to provide information complementary to the tracer study is described. (author)

A novel comprehensive learning artificial bee colony optimizer for dynamic optimization biological problems

Directory of Open Access Journals (Sweden)

Weixing Su

2017-03-01

Full Text Available There are many dynamic optimization problems in the real world, whose convergence and searching ability is cautiously desired, obviously different from static optimization cases. This requires an optimization algorithm adaptively seek the changing optima over dynamic environments, instead of only finding the global optimal solution in the static environment. This paper proposes a novel comprehensive learning artificial bee colony optimizer (CLABC for optimization in dynamic environments problems, which employs a pool of optimal foraging strategies to balance the exploration and exploitation tradeoff. The main motive of CLABC is to enrich artificial bee foraging behaviors in the ABC model by combining Powell’s pattern search method, life-cycle, and crossover-based social learning strategy. The proposed CLABC is a more bee-colony-realistic model that the bee can reproduce and die dynamically throughout the foraging process and population size varies as the algorithm runs. The experiments for evaluating CLABC are conducted on the dynamic moving peak benchmarks. Furthermore, the proposed algorithm is applied to a real-world application of dynamic RFID network optimization. Statistical analysis of all these cases highlights the significant performance improvement due to the beneficial combination and demonstrates the performance superiority of the proposed algorithm.

A Standalone PV System with a Hybrid P&O MPPT Optimization Technique

Directory of Open Access Journals (Sweden)

S. Hota

2017-12-01

Full Text Available In this paper a maximum power point tracking (MPPT design for a photovoltaic (PV system using a hybrid optimization technique is proposed. For maximum power transfer, maximum harvestable power from a PV cell in a dynamically changing surrounding should be known. The proposed technique is compared with the conventional Perturb and Observe (P&O technique. A comparative analysis of power-voltage and current-voltage characteristics of a PV cell with and without the MPPT module when connected to the grid was performed in SIMULINK, to demonstrate the increment in the efficiency of the PV module after using the MPPT module.

Dynamic optimization and differential games

CERN Document Server

Friesz, Terry L

2010-01-01

Dynamic Optimization and Differential Games has been written to address the increasing number of Operations Research and Management Science problems that involve the explicit consideration of time and of gaming among multiple agents. With end-of-chapter exercises throughout, it is a book that can be used both as a reference and as a textbook. It will be useful as a guide to engineers, operations researchers, applied mathematicians and social scientists whose work involves both the theoretical and computational aspects of dynamic optimization and differential games. Included throughout the text are detailed explanations of several original dynamic and game-theoretic mathematical models which are of particular relevance in today's technologically-driven-global economy: revenue management, oligopoly pricing, production planning, supply chain management, dynamic traffic assignment and dynamic congestion pricing. The book emphasizes deterministic theory, computational tools and applications associated with the stu...

Optimization-based human motion prediction using an inverse-inverse dynamics technique implemented in the AnyBody Modeling System

DEFF Research Database (Denmark)

Farahani, Saeed Davoudabadi; Andersen, Michael Skipper; de Zee, Mark

2012-01-01

derived from the detailed musculoskeletal analysis. The technique is demonstrated on a human model pedaling a bicycle. We use a physiology-based cost function expressing the mean square of all muscle activities over the cycle to predict a realistic motion pattern. Posture and motion prediction...... on a physics model including dynamic effects and a high level of anatomical realism. First, a musculoskeletal model comprising several hundred muscles is built in AMS. The movement is then parameterized by means of time functions controlling selected degrees of freedom of the model. Subsequently......, the parameters of these functions are optimized to produce an optimum posture or movement according to a user-defined cost function and constraints. The cost function and the constraints are typically express performance, comfort, injury risk, fatigue, muscle load, joint forces and other physiological properties...

Genetic algorithm enhanced by machine learning in dynamic aperture optimization

Science.gov (United States)

Li, Yongjun; Cheng, Weixing; Yu, Li Hua; Rainer, Robert

2018-05-01

With the aid of machine learning techniques, the genetic algorithm has been enhanced and applied to the multi-objective optimization problem presented by the dynamic aperture of the National Synchrotron Light Source II (NSLS-II) Storage Ring. During the evolution processes employed by the genetic algorithm, the population is classified into different clusters in the search space. The clusters with top average fitness are given "elite" status. Intervention on the population is implemented by repopulating some potentially competitive candidates based on the experience learned from the accumulated data. These candidates replace randomly selected candidates among the original data pool. The average fitness of the population is therefore improved while diversity is not lost. Maintaining diversity ensures that the optimization is global rather than local. The quality of the population increases and produces more competitive descendants accelerating the evolution process significantly. When identifying the distribution of optimal candidates, they appear to be located in isolated islands within the search space. Some of these optimal candidates have been experimentally confirmed at the NSLS-II storage ring. The machine learning techniques that exploit the genetic algorithm can also be used in other population-based optimization problems such as particle swarm algorithm.

Mechanical Design Optimization Using Advanced Optimization Techniques

CERN Document Server

Rao, R Venkata

2012-01-01

Mechanical design includes an optimization process in which designers always consider objectives such as strength, deflection, weight, wear, corrosion, etc. depending on the requirements. However, design optimization for a complete mechanical assembly leads to a complicated objective function with a large number of design variables. It is a good practice to apply optimization techniques for individual components or intermediate assemblies than a complete assembly. Analytical or numerical methods for calculating the extreme values of a function may perform well in many practical cases, but may fail in more complex design situations. In real design problems, the number of design parameters can be very large and their influence on the value to be optimized (the goal function) can be very complicated, having nonlinear character. In these complex cases, advanced optimization algorithms offer solutions to the problems, because they find a solution near to the global optimum within reasonable time and computational ...

Design optimization applied in structural dynamics

NARCIS (Netherlands)

Akcay-Perdahcioglu, Didem; de Boer, Andries; van der Hoogt, Peter; Tiskarna, T

2007-01-01

This paper introduces the design optimization strategies, especially for structures which have dynamic constraints. Design optimization involves first the modeling and then the optimization of the problem. Utilizing the Finite Element (FE) model of a structure directly in an optimization process

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.

Studies Regarding Design and Optimization of Mechanisms Using Modern Techniques of CAD and CAE

Directory of Open Access Journals (Sweden)

Marius Tufoi

2010-01-01

Full Text Available The paper presents applications of modern techniques of CAD (Computer Aided Design and CAE (Computer Aided Engineering to design and optimize the mechanisms used in mechanical engineering. The use exemplification of these techniques was achieved by designing and optimizing parts of a drawing installation for horizontal continuous casting of metals. By applying these design methods and using finite element method at simulations on designed mechanisms results a number of advantages over traditional methods of drawing and design: speed in drawing, design and optimization of parts and mechanisms, kinematic analysis option, kinetostatic and dynamic through simulation, without requiring physical realization of the part or mechanism, the determination by finite element method of tension, elongations, travel and safety factor and the possibility of optimization for these sizes to ensure the mechanical strength of each piece separately. Achieving these studies was possible using SolidWorks 2009 software suite.

Application of Dynamic Mutated Particle Swarm Optimization Algorithm to Design Water Distribution Networks

Directory of Open Access Journals (Sweden)

Kazem Mohammadi- Aghdam

2015-10-01

Full Text Available This paper proposes the application of a new version of the heuristic particle swarm optimization (PSO method for designing water distribution networks (WDNs. The optimization problem of looped water distribution networks is recognized as an NP-hard combinatorial problem which cannot be easily solved using traditional mathematical optimization techniques. In this paper, the concept of dynamic swarm size is considered in an attempt to increase the convergence speed of the original PSO algorithm. In this strategy, the size of the swarm is dynamically changed according to the iteration number of the algorithm. Furthermore, a novel mutation approach is introduced to increase the diversification property of the PSO and to help the algorithm to avoid trapping in local optima. The new version of the PSO algorithm is called dynamic mutated particle swarm optimization (DMPSO. The proposed DMPSO is then applied to solve WDN design problems. Finally, two illustrative examples are used for comparison to verify the efficiency of the proposed DMPSO as compared to other intelligent algorithms.

Greenhouse Environmental Control Using Optimized MIMO PID Technique

Directory of Open Access Journals (Sweden)

Fateh BOUNAAMA

2011-10-01

Full Text Available Climate control for protected crops brings the added dimension of a biological system into a physical system control situation. The thermally dynamic nature of a greenhouse suggests that disturbance attenuation (load control of external temperature, humidity, and sunlight is far more important than is the case for controlling other types of buildings. This paper investigates the application of multi-inputs multi-outputs (MIMO PID controller to a MIMO greenhouse environmental model with actuation constraints. This method is based on decoupling the system at low frequency point. The optimal tuning values are determined using genetic algorithms optimization (GA. The inside outsides climate model of the environmental greenhouse, and the automatically collected data sets of Avignon, France are used to simulate and test this technique. The control objective is to maintain a highly coupled inside air temperature and relative humidity of strongly perturbed greenhouse, at specified set-points, by the ventilation/cooling and moisturizing operations.

Comparison of various spring analogy related mesh deformation techniques in two-dimensional airfoil design optimization

Science.gov (United States)

Yang, Y.; Özgen, S.

2017-06-01

During the last few decades, CFD (Computational Fluid Dynamics) has developed greatly and has become a more reliable tool for the conceptual phase of aircraft design. This tool is generally combined with an optimization algorithm. In the optimization phase, the need for regenerating the computational mesh might become cumbersome, especially when the number of design parameters is high. For this reason, several mesh generation and deformation techniques have been developed in the past decades. One of the most widely used techniques is the Spring Analogy. There are numerous spring analogy related techniques reported in the literature: linear spring analogy, torsional spring analogy, semitorsional spring analogy, and ball vertex spring analogy. This paper gives the explanation of linear spring analogy method and angle inclusion in the spring analogy method. In the latter case, two di¨erent solution methods are proposed. The best feasible method will later be used for two-dimensional (2D) Airfoil Design Optimization with objective function being to minimize sectional drag for a required lift coe©cient at di¨erent speeds. Design variables used in the optimization include camber and thickness distribution of the airfoil. SU2 CFD is chosen as the §ow solver during the optimization procedure. The optimization is done by using Phoenix ModelCenter Optimization Tool.

Quantifying dynamic mechanical properties of human placenta tissue using optimization techniques with specimen-specific finite-element models.

Science.gov (United States)

Hu, Jingwen; Klinich, Kathleen D; Miller, Carl S; Nazmi, Giseli; Pearlman, Mark D; Schneider, Lawrence W; Rupp, Jonathan D

2009-11-13

Motor-vehicle crashes are the leading cause of fetal deaths resulting from maternal trauma in the United States, and placental abruption is the most common cause of these deaths. To minimize this injury, new assessment tools, such as crash-test dummies and computational models of pregnant women, are needed to evaluate vehicle restraint systems with respect to reducing the risk of placental abruption. Developing these models requires accurate material properties for tissues in the pregnant abdomen under dynamic loading conditions that can occur in crashes. A method has been developed for determining dynamic material properties of human soft tissues that combines results from uniaxial tensile tests, specimen-specific finite-element models based on laser scans that accurately capture non-uniform tissue-specimen geometry, and optimization techniques. The current study applies this method to characterizing material properties of placental tissue. For 21 placenta specimens tested at a strain rate of 12/s, the mean failure strain is 0.472+/-0.097 and the mean failure stress is 34.80+/-12.62 kPa. A first-order Ogden material model with ground-state shear modulus (mu) of 23.97+/-5.52 kPa and exponent (alpha(1)) of 3.66+/-1.90 best fits the test results. The new method provides a nearly 40% error reduction (p<0.001) compared to traditional curve-fitting methods by considering detailed specimen geometry, loading conditions, and dynamic effects from high-speed loading. The proposed method can be applied to determine mechanical properties of other soft biological tissues.

Dynamic optimization and adaptive controller design

Science.gov (United States)

Inamdar, S. R.

2010-10-01

In this work I present a new type of controller which is an adaptive tracking controller which employs dynamic optimization for optimizing current value of controller action for the temperature control of nonisothermal continuously stirred tank reactor (CSTR). We begin with a two-state model of nonisothermal CSTR which are mass and heat balance equations and then add cooling system dynamics to eliminate input multiplicity. The initial design value is obtained using local stability of steady states where approach temperature for cooling action is specified as a steady state and a design specification. Later we make a correction in the dynamics where material balance is manipulated to use feed concentration as a system parameter as an adaptive control measure in order to avoid actuator saturation for the main control loop. The analysis leading to design of dynamic optimization based parameter adaptive controller is presented. The important component of this mathematical framework is reference trajectory generation to form an adaptive control measure.

COMPARISON OF NONLINEAR DYNAMICS OPTIMIZATION METHODS FOR APS-U

Energy Technology Data Exchange (ETDEWEB)

Sun, Y.; Borland, Michael

2017-06-25

Many different objectives and genetic algorithms have been proposed for storage ring nonlinear dynamics performance optimization. These optimization objectives include nonlinear chromaticities and driving/detuning terms, on-momentum and off-momentum dynamic acceptance, chromatic detuning, local momentum acceptance, variation of transverse invariant, Touschek lifetime, etc. In this paper, the effectiveness of several different optimization methods and objectives are compared for the nonlinear beam dynamics optimization of the Advanced Photon Source upgrade (APS-U) lattice. The optimized solutions from these different methods are preliminarily compared in terms of the dynamic acceptance, local momentum acceptance, chromatic detuning, and other performance measures.

Dynamic optimization deterministic and stochastic models

CERN Document Server

Hinderer, Karl; Stieglitz, Michael

2016-01-01

This book explores discrete-time dynamic optimization and provides a detailed introduction to both deterministic and stochastic models. Covering problems with finite and infinite horizon, as well as Markov renewal programs, Bayesian control models and partially observable processes, the book focuses on the precise modelling of applications in a variety of areas, including operations research, computer science, mathematics, statistics, engineering, economics and finance. Dynamic Optimization is a carefully presented textbook which starts with discrete-time deterministic dynamic optimization problems, providing readers with the tools for sequential decision-making, before proceeding to the more complicated stochastic models. The authors present complete and simple proofs and illustrate the main results with numerous examples and exercises (without solutions). With relevant material covered in four appendices, this book is completely self-contained.

Dynamic optimization in environmental economics

International Nuclear Information System (INIS)

Moser, Elke; Tragler, Gernot; Veliov, Vladimir M.; Semmler, Willi

2014-01-01

This book contains two chapters with the topics: 1. Chapter: INTERACTIONS BETWEEN ECONOMY AND CLIMATE: (a) Climate Change and Technical Progress: Impact of Informational Constraints. (b) Environmental Policy in a Dynamic Model with Heterogeneous Agents and Voting. (c) Optimal Environmental Policy in the Presence of Multiple Equilibria and Reversible Hysteresis. (d). Modeling the Dynamics of the Transition to a Green Economy. (e) One-Parameter GHG Emission Policy With R and D-Based Growth. (f) Pollution, Public Health Care, and Life Expectancy when Inequality Matters. (g) Uncertain Climate Policy and the Green Paradox. (h) Uniqueness Versus Indeterminacy in the Tragedy of the Commons - A ''Geometric'' Approach. 2. Chapter: OPTIMAL EXTRACTION OF RESOURCES: (j) Dynamic Behavior of Oil Importers and Exporters Under Uncertainty. (k) Robust Control of a Spatially Distributed Commercial Fishery. (l) On the Effect of Resource Exploitation on Growth: Domestic Innovation vs. Technological Diffusion Through Trade. (m) Forest Management and Biodiversity in Size-Structured Forests Under Climate Change. (n) Carbon Taxes and Comparison of Trading Regimes in Fossil Fuels. (o) Landowning, Status and Population Growth. (p) Optimal Harvesting of Size-Structured Biological Populations.

Dynamic programming for QFD in PES optimization

Energy Technology Data Exchange (ETDEWEB)

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

2008-07-01

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

First principles molecular dynamics without self-consistent field optimization

International Nuclear Information System (INIS)

Souvatzis, Petros; Niklasson, Anders M. N.

2014-01-01

We present a first principles molecular dynamics approach that is based on time-reversible extended Lagrangian Born-Oppenheimer molecular dynamics [A. M. N. Niklasson, Phys. Rev. Lett. 100, 123004 (2008)] in the limit of vanishing self-consistent field optimization. The optimization-free dynamics keeps the computational cost to a minimum and typically provides molecular trajectories that closely follow the exact Born-Oppenheimer potential energy surface. Only one single diagonalization and Hamiltonian (or Fockian) construction are required in each integration time step. The proposed dynamics is derived for a general free-energy potential surface valid at finite electronic temperatures within hybrid density functional theory. Even in the event of irregular functional behavior that may cause a dynamical instability, the optimization-free limit represents a natural starting guess for force calculations that may require a more elaborate iterative electronic ground state optimization. Our optimization-free dynamics thus represents a flexible theoretical framework for a broad and general class of ab initio molecular dynamics simulations

A Dynamic Multistage Hybrid Swarm Intelligence Optimization Algorithm for Function Optimization

Directory of Open Access Journals (Sweden)

Daqing Wu

2012-01-01

Full Text Available A novel dynamic multistage hybrid swarm intelligence optimization algorithm is introduced, which is abbreviated as DM-PSO-ABC. The DM-PSO-ABC combined the exploration capabilities of the dynamic multiswarm particle swarm optimizer (PSO and the stochastic exploitation of the cooperative artificial bee colony algorithm (CABC for solving the function optimization. In the proposed hybrid algorithm, the whole process is divided into three stages. In the first stage, a dynamic multiswarm PSO is constructed to maintain the population diversity. In the second stage, the parallel, positive feedback of CABC was implemented in each small swarm. In the third stage, we make use of the particle swarm optimization global model, which has a faster convergence speed to enhance the global convergence in solving the whole problem. To verify the effectiveness and efficiency of the proposed hybrid algorithm, various scale benchmark problems are tested to demonstrate the potential of the proposed multistage hybrid swarm intelligence optimization algorithm. The results show that DM-PSO-ABC is better in the search precision, and convergence property and has strong ability to escape from the local suboptima when compared with several other peer algorithms.

A simple sizing optimization technique for an impact limiter based on dynamic material properties

International Nuclear Information System (INIS)

Choi, Woo-Seok; Seo, Ki-Seog

2010-01-01

According to IAEA regulations, a transportation package for radioactive material should perform its intended function of containing the radioactive contents after a drop test, which is one of the hypothetical accident conditions. Impact limiters attached to a transport cask absorb most of the impact energy. So, it is important to determine the shape, size and material of impact limiters properly. The material data needed in this determination is a dynamic one. In this study, several materials considered as those of impact limiters were tested by drop weight equipment to acquire the dynamic material characteristics data. The impact absorbing volume of the impact limiter was derived mathematically for each drop condition. A size optimization of the impact limiter was conducted. The derived impact absorbing volumes were applied as constraints. These volumes should be less than the critical volumes generated based on the dynamic material characteristics. The derived procedure to decide the shape of the impact limiter can be useful at the preliminary design stage when the transportation package's outline is roughly determined and applied as an input value.

A Monarch Butterfly Optimization for the Dynamic Vehicle Routing Problem

Directory of Open Access Journals (Sweden)

Shifeng Chen

2017-09-01

Full Text Available The dynamic vehicle routing problem (DVRP is a variant of the Vehicle Routing Problem (VRP in which customers appear dynamically. The objective is to determine a set of routes that minimizes the total travel distance. In this paper, we propose a monarch butterfly optimization (MBO algorithm to solve DVRPs, utilizing a greedy strategy. Both migration operation and the butterfly adjusting operator only accept the offspring of butterfly individuals that have better fitness than their parents. To improve performance, a later perturbation procedure is implemented, to maintain a balance between global diversification and local intensification. The computational results indicate that the proposed technique outperforms the existing approaches in the literature for average performance by at least 9.38%. In addition, 12 new best solutions were found. This shows that this proposed technique consistently produces high-quality solutions and outperforms other published heuristics for the DVRP.

Dynamic modeling and optimal joint torque coordination of advanced robotic systems

Science.gov (United States)

Kang, Hee-Jun

The development is documented of an efficient dynamic modeling algorithm and the subsequent optimal joint input load coordination of advanced robotic systems for industrial application. A closed-form dynamic modeling algorithm for the general closed-chain robotic linkage systems is presented. The algorithm is based on the transfer of system dependence from a set of open chain Lagrangian coordinates to any desired system generalized coordinate set of the closed-chain. Three different techniques for evaluation of the kinematic closed chain constraints allow the representation of the dynamic modeling parameters in terms of system generalized coordinates and have no restriction with regard to kinematic redundancy. The total computational requirement of the closed-chain system model is largely dependent on the computation required for the dynamic model of an open kinematic chain. In order to improve computational efficiency, modification of an existing open-chain KIC based dynamic formulation is made by the introduction of the generalized augmented body concept. This algorithm allows a 44 pct. computational saving over the current optimized one (O(N4), 5995 when N = 6). As means of resolving redundancies in advanced robotic systems, local joint torque optimization is applied for effectively using actuator power while avoiding joint torque limits. The stability problem in local joint torque optimization schemes is eliminated by using fictitious dissipating forces which act in the necessary null space. The performance index representing the global torque norm is shown to be satisfactory. In addition, the resulting joint motion trajectory becomes conservative, after a transient stage, for repetitive cyclic end-effector trajectories. The effectiveness of the null space damping method is shown. The modular robot, which is built of well defined structural modules from a finite-size inventory and is controlled by one general computer system, is another class of evolving

Dynamic optimization in environmental economics

Energy Technology Data Exchange (ETDEWEB)

Moser, Elke; Tragler, Gernot; Veliov, Vladimir M. (eds.) [Vienna Univ. of Technology (Austria). Inst. of Mathematical Methods in Economics; Semmler, Willi [The New School for Social Research, New York, NY (United States). Dept. of Economics

2014-11-01

This book contains two chapters with the topics: 1. Chapter: INTERACTIONS BETWEEN ECONOMY AND CLIMATE: (a) Climate Change and Technical Progress: Impact of Informational Constraints. (b) Environmental Policy in a Dynamic Model with Heterogeneous Agents and Voting. (c) Optimal Environmental Policy in the Presence of Multiple Equilibria and Reversible Hysteresis. (d). Modeling the Dynamics of the Transition to a Green Economy. (e) One-Parameter GHG Emission Policy With R and D-Based Growth. (f) Pollution, Public Health Care, and Life Expectancy when Inequality Matters. (g) Uncertain Climate Policy and the Green Paradox. (h) Uniqueness Versus Indeterminacy in the Tragedy of the Commons - A ''Geometric'' Approach. 2. Chapter: OPTIMAL EXTRACTION OF RESOURCES: (j) Dynamic Behavior of Oil Importers and Exporters Under Uncertainty. (k) Robust Control of a Spatially Distributed Commercial Fishery. (l) On the Effect of Resource Exploitation on Growth: Domestic Innovation vs. Technological Diffusion Through Trade. (m) Forest Management and Biodiversity in Size-Structured Forests Under Climate Change. (n) Carbon Taxes and Comparison of Trading Regimes in Fossil Fuels. (o) Landowning, Status and Population Growth. (p) Optimal Harvesting of Size-Structured Biological Populations.

Optimization by record dynamics

DEFF Research Database (Denmark)

Barettin, Daniele; Sibani, Paolo

2014-01-01

Large dynamical changes in thermalizing glassy systems are triggered by trajectories crossing record sized barriers, a behavior revealing the presence of a hierarchical structure in configuration space. The observation is here turned into a novel local search optimization algorithm dubbed record...... dynamics optimization,or RDO. RDO uses the Metropolis rule to accept or reject candidate solutions depending on the value of a parameter akin to the temperature and minimizes the cost function of the problem at hand through cycles where its ‘temperature’ is raised and subsequently decreased in order......), is applied to the same problem as a benchmark. RDO and PT turn out to produce solutions of similar quality for similar numerical effort, but RDO is simpler to program and additionally yields geometrical information on the system’s configuration space which is of interest in many applications. In particular...

Morphing-Based Shape Optimization in Computational Fluid Dynamics

Science.gov (United States)

Rousseau, Yannick; Men'Shov, Igor; Nakamura, Yoshiaki

In this paper, a Morphing-based Shape Optimization (MbSO) technique is presented for solving Optimum-Shape Design (OSD) problems in Computational Fluid Dynamics (CFD). The proposed method couples Free-Form Deformation (FFD) and Evolutionary Computation, and, as its name suggests, relies on the morphing of shape and computational domain, rather than direct shape parameterization. Advantages of the FFD approach compared to traditional parameterization are first discussed. Then, examples of shape and grid deformations by FFD are presented. Finally, the MbSO approach is illustrated and applied through an example: the design of an airfoil for a future Mars exploration airplane.

Role of controllability in optimizing quantum dynamics

International Nuclear Information System (INIS)

Wu Rebing; Hsieh, Michael A.; Rabitz, Herschel

2011-01-01

This paper reveals an important role that controllability plays in the complexity of optimizing quantum control dynamics. We show that the loss of controllability generally leads to multiple locally suboptimal controls when gate fidelity in a quantum control system is maximized, which does not happen if the system is controllable. Such local suboptimal controls may attract an optimization algorithm into a local trap when a global optimal solution is sought, even if the target gate can be perfectly realized. This conclusion results from an analysis of the critical topology of the corresponding quantum control landscape, which refers to the gate fidelity objective as a functional of the control fields. For uncontrollable systems, due to SU(2) and SU(3) dynamical symmetries, the control landscape corresponding to an implementable target gate is proven to possess multiple locally optimal critical points, and its ruggedness can be further increased if the target gate is not realizable. These results imply that the optimization of quantum dynamics can be seriously impeded when operating with local search algorithms under these conditions, and thus full controllability is demanded.

Optimal lag in dynamical investments

OpenAIRE

Serva, M.

1998-01-01

A portfolio of different stocks and a risk-less security whose composition is dynamically maintained stable by trading shares at any time step leads to a growth of the capital with a nonrandom rate. This is the key for the theory of optimal-growth investment formulated by Kelly. In presence of transaction costs, the optimal composition changes and, more important, it turns out that the frequency of transactions must be reduced. This simple observation leads to the definition of an optimal lag...

Gradient-based optimization in nonlinear structural dynamics

DEFF Research Database (Denmark)

Dou, Suguang

The intrinsic nonlinearity of mechanical structures can give rise to rich nonlinear dynamics. Recently, nonlinear dynamics of micro-mechanical structures have contributed to developing new Micro-Electro-Mechanical Systems (MEMS), for example, atomic force microscope, passive frequency divider......, frequency stabilization, and disk resonator gyroscope. For advanced design of these structures, it is of considerable value to extend current optimization in linear structural dynamics into nonlinear structural dynamics. In this thesis, we present a framework for modelling, analysis, characterization......, and optimization of nonlinear structural dynamics. In the modelling, nonlinear finite elements are used. In the analysis, nonlinear frequency response and nonlinear normal modes are calculated based on a harmonic balance method with higher-order harmonics. In the characterization, nonlinear modal coupling...

Optimization and anti-optimization of structures under uncertainty

National Research Council Canada - National Science Library

Elishakoff, Isaac; Ohsaki, Makoto

2010-01-01

.... The necessity of anti-optimization approach is first demonstrated, then the anti-optimization techniques are applied to static, dynamic and buckling problems, thus covering the broadest possible set of applications...

Optimal design of a vehicle magnetorheological damper considering the damping force and dynamic range

International Nuclear Information System (INIS)

Nguyen, Quoc-Hung; Choi, Seung-Bok

2009-01-01

This paper presents an optimal design of a passenger vehicle magnetorheological (MR) damper based on finite element analysis. The MR damper is constrained in a specific volume and the optimization problem identifies the geometric dimensions of the damper that minimize an objective function. The objective function consists of the damping force, the dynamic range, and the inductive time constant of the damper. After describing the configuration of the MR damper, the damping force and dynamic range are obtained on the basis of the Bingham model of an MR fluid. Then, the control energy (power consumption of the damper coil) and the inductive time constant are derived. The objective function for the optimization problem is determined based on the solution of the magnetic circuit of the initial damper. Subsequently, the optimization procedure, using a golden-section algorithm and a local quadratic fitting technique, is constructed via commercial finite element method parametric design language. Using the developed optimization tool, optimal solutions of the MR damper, which are constrained in a specific cylindrical volume defined by its radius and height, are determined and a comparative work on damping force and inductive time constant between the initial and optimal design is undertaken

Operation optimization of distributed generation using artificial intelligent techniques

Directory of Open Access Journals (Sweden)

Mahmoud H. Elkazaz

2016-06-01

Full Text Available Future smart grids will require an observable, controllable and flexible network architecture for reliable and efficient energy delivery. The use of artificial intelligence and advanced communication technologies is essential in building a fully automated system. This paper introduces a new technique for online optimal operation of distributed generation (DG resources, i.e. a hybrid fuel cell (FC and photovoltaic (PV system for residential applications. The proposed technique aims to minimize the total daily operating cost of a group of residential homes by managing the operation of embedded DG units remotely from a control centre. The target is formed as an objective function that is solved using genetic algorithm (GA optimization technique. The optimal settings of the DG units obtained from the optimization process are sent to each DG unit through a fully automated system. The results show that the proposed technique succeeded in defining the optimal operating points of the DGs that affect directly the total operating cost of the entire system.

TaPT: Temperature-Aware Dynamic Cache Optimization for Embedded Systems

Directory of Open Access Journals (Sweden)

Tosiron Adegbija

2017-12-01

Full Text Available Embedded systems have stringent design constraints, which has necessitated much prior research focus on optimizing energy consumption and/or performance. Since embedded systems typically have fewer cooling options, rising temperature, and thus temperature optimization, is an emergent concern. Most embedded systems only dissipate heat by passive convection, due to the absence of dedicated thermal management hardware mechanisms. The embedded system’s temperature not only affects the system’s reliability, but can also affect the performance, power, and cost. Thus, embedded systems require efficient thermal management techniques. However, thermal management can conflict with other optimization objectives, such as execution time and energy consumption. In this paper, we focus on managing the temperature using a synergy of cache optimization and dynamic frequency scaling, while also optimizing the execution time and energy consumption. This paper provides new insights on the impact of cache parameters on efficient temperature-aware cache tuning heuristics. In addition, we present temperature-aware phase-based tuning, TaPT, which determines Pareto optimal clock frequency and cache configurations for fine-grained execution time, energy, and temperature tradeoffs. TaPT enables autonomous system optimization and also allows designers to specify temperature constraints and optimization priorities. Experiments show that TaPT can effectively reduce execution time, energy, and temperature, while imposing minimal hardware overhead.

Search engine optimization

OpenAIRE

Marolt, Klemen

2013-01-01

Search engine optimization techniques, often shortened to “SEO,” should lead to first positions in organic search results. Some optimization techniques do not change over time, yet still form the basis for SEO. However, as the Internet and web design evolves dynamically, new optimization techniques flourish and flop. Thus, we looked at the most important factors that can help to improve positioning in search results. It is important to emphasize that none of the techniques can guarantee high ...

An effective parameter optimization technique for vibration flow field characterization of PP melts via LS-SVM combined with SALS in an electromagnetism dynamic extruder

Science.gov (United States)

Xian, Guangming

2018-03-01

A method for predicting the optimal vibration field parameters by least square support vector machine (LS-SVM) is presented in this paper. One convenient and commonly used technique for characterizing the the vibration flow field of polymer melts films is small angle light scattering (SALS) in a visualized slit die of the electromagnetism dynamic extruder. The optimal value of vibration vibration frequency, vibration amplitude, and the maximum light intensity projection area can be obtained by using LS-SVM for prediction. For illustrating this method and show its validity, the flowing material is used with polypropylene (PP) and fifteen samples are tested at the rotation speed of screw at 36rpm. This paper first describes the apparatus of SALS to perform the experiments, then gives the theoretical basis of this new method, and detail the experimental results for parameter prediction of vibration flow field. It is demonstrated that it is possible to use the method of SALS and obtain detailed information on optimal parameter of vibration flow field of PP melts by LS-SVM.

Dynamic optimization of a FCC converter unit: numerical analysis

Directory of Open Access Journals (Sweden)

E. Almeida Nt

2011-03-01

Full Text Available Fluidized-bed Catalytic Cracking (FCC is a process subject to frequent variations in the operating conditions (including feed quality and feed rate. The production objectives usually are the maximization of LPG and gasoline production. This fact makes the FCC converter unit an excellent opportunity for real-time optimization. The present work aims to apply a dynamic optimization in an industrial FCC converter unit, using a mechanistic dynamic model, and to carry out a numerical analysis of the solution procedure. A simultaneous approach was used to discretize the system of differential-algebraic equations and the resulting large-scale NLP problem was solved using the IPOPT solver. This study also does a short comparison between the results obtained by a potential dynamic real-time optimization (DRTO against a possible steady-state real-time optimization (RTO application. The results demonstrate that the application of dynamic real-time optimization of a FCC converter unit can bring significant benefits in production.

A fast and optimized dynamic economic load dispatch for large scale power systems

International Nuclear Information System (INIS)

Musse Mohamud Ahmed; Mohd Ruddin Ab Ghani; Ismail Hassan

2000-01-01

This paper presents Lagrangian Multipliers (LM) and Linear Programming (LP) based dynamic economic load dispatch (DELD) solution for large-scale power system operations. It is to minimize the operation cost of power generation. units subject to the considered constraints. After individual generator units are economically loaded and periodically dispatched, fast and optimized DELD has been achieved. DELD with period intervals has been taken into consideration The results found from the algorithm based on LM and LP techniques appear to be modest in both optimizing the operation cost and achieving fast computation. (author)

TH-EF-BRB-02: Feasibility of Optimization for Dynamic Trajectory Radiotherapy

Energy Technology Data Exchange (ETDEWEB)

Fix, MK; Frei, D; Volken, W; Terribilini, D; Aebersold, DM; Manser, P [Division of Medical Radiation Physics and Department of Radiation Oncology, Inselspital, Bern University Hospital, and University of Bern, Berne (Switzerland)

2016-06-15

Purpose: Over the last years, volumetric modulated arc therapy (VMAT) has been widely introduced into clinical routine using a coplanar delivery technique. However, VMAT might be improved by including dynamic couch and collimator rotations, leading to dynamic trajectory radiotherapy (DTRT). In this work the feasibility and the potential benefit of DTRT was investigated. Methods: A general framework for the optimization was developed using the Eclipse Scripting Research Application Programming Interface (ESRAPI). Based on contoured target and organs at risk (OARs), the structures are extracted using the ESRAPI. Sampling potential beam directions, regularly distributed on a sphere using a Fibanocci-lattice, the fractional volume-overlap of each OAR and the target is determined and used to establish dynamic gantry-couch movements. Then, for each gantry-couch track the most suitable collimator angle is determined for each control point by optimizing the area between the MLC leaves and the target contour. The resulting dynamic trajectories are used as input to perform the optimization using a research version of the VMAT optimization algorithm and the ESRAPI. The feasibility of this procedure was tested for a clinically motivated head and neck case. Resulting dose distributions for the VMAT plan and for the dynamic trajectory treatment plan were compared based on DVH-parameters. Results: While the DVH for the target is virtually preserved, improvements in maximum dose for the DTRT plan were achieved for all OARs except for the inner-ear, where maximum dose remains the same. The major improvements in maximum dose were 6.5% of the prescribed dose (66 Gy) for the parotid and 5.5% for the myelon and the eye. Conclusion: The result of this work suggests that DTRT has a great potential to reduce dose to OARs with similar target coverage when compared to conventional VMAT treatment plans. This work was supported by Varian Medical Systems. This work was supported by Varian

Evaluation of dynamically dimensioned search algorithm for optimizing SWAT by altering sampling distributions and searching range

Science.gov (United States)

The primary advantage of Dynamically Dimensioned Search algorithm (DDS) is that it outperforms many other optimization techniques in both convergence speed and the ability in searching for parameter sets that satisfy statistical guidelines while requiring only one algorithm parameter (perturbation f...

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.

9th International Conference on Optimization : Techniques and Applications

CERN Document Server

Wang, Song; Wu, Soon-Yi

2015-01-01

This book presents the latest research findings and state-of-the-art solutions on optimization techniques and provides new research direction and developments. Both the theoretical and practical aspects of the book will be much beneficial to experts and students in optimization and operation research community. It selects high quality papers from The International Conference on Optimization: Techniques and Applications (ICOTA2013). The conference is an official conference series of POP (The Pacific Optimization Research Activity Group; there are over 500 active members). These state-of-the-art works in this book authored by recognized experts will make contributions to the development of optimization with its applications.

Optimal Control of Complex Systems Based on Improved Dual Heuristic Dynamic Programming Algorithm

Directory of Open Access Journals (Sweden)

Hui Li

2017-01-01

Full Text Available When applied to solving the data modeling and optimal control problems of complex systems, the dual heuristic dynamic programming (DHP technique, which is based on the BP neural network algorithm (BP-DHP, has difficulty in prediction accuracy, slow convergence speed, poor stability, and so forth. In this paper, a dual DHP technique based on Extreme Learning Machine (ELM algorithm (ELM-DHP was proposed. Through constructing three kinds of network structures, the paper gives the detailed realization process of the DHP technique in the ELM. The controller designed upon the ELM-DHP algorithm controlled a molecular distillation system with complex features, such as multivariability, strong coupling, and nonlinearity. Finally, the effectiveness of the algorithm is verified by the simulation that compares DHP and HDP algorithms based on ELM and BP neural network. The algorithm can also be applied to solve the data modeling and optimal control problems of similar complex systems.

VMAT optimization with dynamic collimator rotation.

Science.gov (United States)

Lyu, Qihui; O'Connor, Daniel; Ruan, Dan; Yu, Victoria; Nguyen, Dan; Sheng, Ke

2018-04-16

Although collimator rotation is an optimization variable that can be exploited for dosimetric advantages, existing Volumetric Modulated Arc Therapy (VMAT) optimization uses a fixed collimator angle in each arc and only rotates the collimator between arcs. In this study, we develop a novel integrated optimization method for VMAT, accounting for dynamic collimator angles during the arc motion. Direct Aperture Optimization (DAO) for Dynamic Collimator in VMAT (DC-VMAT) was achieved by adding to the existing dose fidelity objective an anisotropic total variation term for regulating the fluence smoothness, a binary variable for forming simple apertures, and a group sparsity term for controlling collimator rotation. The optimal collimator angle for each beam angle was selected using the Dijkstra's algorithm, where the node costs depend on the estimated fluence map at the current iteration and the edge costs account for the mechanical constraints of multi-leaf collimator (MLC). An alternating optimization strategy was implemented to solve the DAO and collimator angle selection (CAS). Feasibility of DC-VMAT using one full-arc with dynamic collimator rotation was tested on a phantom with two small spherical targets, a brain, a lung and a prostate cancer patient. The plan was compared against a static collimator VMAT (SC-VMAT) plan using three full arcs with 60 degrees of collimator angle separation in patient studies. With the same target coverage, DC-VMAT achieved 20.3% reduction of R50 in the phantom study, and reduced the average max and mean OAR dose by 4.49% and 2.53% of the prescription dose in patient studies, as compared with SC-VMAT. The collimator rotation co-ordinated with the gantry rotation in DC-VMAT plans for deliverability. There were 13 beam angles in the single-arc DC-VMAT plan in patient studies that requires slower gantry rotation to accommodate multiple collimator angles. The novel DC-VMAT approach utilizes the dynamic collimator rotation during arc

Finite-element-model updating using computational intelligence techniques applications to structural dynamics

CERN Document Server

Marwala, Tshilidzi

2010-01-01

Finite element models (FEMs) are widely used to understand the dynamic behaviour of various systems. FEM updating allows FEMs to be tuned better to reflect measured data and may be conducted using two different statistical frameworks: the maximum likelihood approach and Bayesian approaches. Finite Element Model Updating Using Computational Intelligence Techniques applies both strategies to the field of structural mechanics, an area vital for aerospace, civil and mechanical engineering. Vibration data is used for the updating process. Following an introduction a number of computational intelligence techniques to facilitate the updating process are proposed; they include: • multi-layer perceptron neural networks for real-time FEM updating; • particle swarm and genetic-algorithm-based optimization methods to accommodate the demands of global versus local optimization models; • simulated annealing to put the methodologies into a sound statistical basis; and • response surface methods and expectation m...

Optimal placement of FACTS devices using optimization techniques: A review

Science.gov (United States)

Gaur, Dipesh; Mathew, Lini

2018-03-01

Modern power system is dealt with overloading problem especially transmission network which works on their maximum limit. Today’s power system network tends to become unstable and prone to collapse due to disturbances. Flexible AC Transmission system (FACTS) provides solution to problems like line overloading, voltage stability, losses, power flow etc. FACTS can play important role in improving static and dynamic performance of power system. FACTS devices need high initial investment. Therefore, FACTS location, type and their rating are vital and should be optimized to place in the network for maximum benefit. In this paper, different optimization methods like Particle Swarm Optimization (PSO), Genetic Algorithm (GA) etc. are discussed and compared for optimal location, type and rating of devices. FACTS devices such as Thyristor Controlled Series Compensator (TCSC), Static Var Compensator (SVC) and Static Synchronous Compensator (STATCOM) are considered here. Mentioned FACTS controllers effects on different IEEE bus network parameters like generation cost, active power loss, voltage stability etc. have been analyzed and compared among the devices.

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.

Modified meta-heuristics using random mutation for truss topology optimization with static and dynamic constraints

Directory of Open Access Journals (Sweden)

Vimal J. Savsani

2017-04-01

The static and dynamic responses to the TTO problems are challenging due to its search space, which is implicit, non-convex, non-linear, and often leading to divergence. Modified meta-heuristics are effective optimization methods to handle such problems in actual fact. In this paper, modified versions of Teaching–Learning-Based Optimization (TLBO, Heat Transfer Search (HTS, Water Wave Optimization (WWO, and Passing Vehicle Search (PVS are proposed by integrating the random mutation-based search technique with them. This paper compares the performance of four modified and four basic meta-heuristics to solve discrete TTO problems.

Dynamic optimization the calculus of variations and optimal control in economics and management

CERN Document Server

Kamien, Morton I

2012-01-01

Since its initial publication, this text has defined courses in dynamic optimization taught to economics and management science students. The two-part treatment covers the calculus of variations and optimal control. 1998 edition.

Dynamic Tensile Experimental Techniques for Geomaterials: A Comprehensive Review

Science.gov (United States)

Heard, W.; Song, B.; Williams, B.; Martin, B.; Sparks, P.; Nie, X.

2018-01-01

This review article is dedicated to the Dynamic Behavior of Materials Technical Division for celebrating the 75th anniversary of the Society for Experimental Mechanics (SEM). Understanding dynamic behavior of geomaterials is critical for analyzing and solving engineering problems of various applications related to underground explosions, seismic, airblast, and penetration events. Determining the dynamic tensile response of geomaterials has been a great challenge in experiments due to the nature of relatively low tensile strength and high brittleness. Various experimental approaches have been made in the past century, especially in the most recent half century, to understand the dynamic behavior of geomaterials in tension. In this review paper, we summarized the dynamic tensile experimental techniques for geomaterials that have been developed. The major dynamic tensile experimental techniques include dynamic direct tension, dynamic split tension, and spall tension. All three of the experimental techniques are based on Hopkinson or split Hopkinson (also known as Kolsky) bar techniques and principles. Uniqueness and limitations for each experimental technique are also discussed.

Acceleration techniques in the univariate Lipschitz global optimization

Science.gov (United States)

Sergeyev, Yaroslav D.; Kvasov, Dmitri E.; Mukhametzhanov, Marat S.; De Franco, Angela

2016-10-01

Univariate box-constrained Lipschitz global optimization problems are considered in this contribution. Geometric and information statistical approaches are presented. The novel powerful local tuning and local improvement techniques are described in the contribution as well as the traditional ways to estimate the Lipschitz constant. The advantages of the presented local tuning and local improvement techniques are demonstrated using the operational characteristics approach for comparing deterministic global optimization algorithms on the class of 100 widely used test functions.

An Optimization Principle for Deriving Nonequilibrium Statistical Models of Hamiltonian Dynamics

Science.gov (United States)

Turkington, Bruce

2013-08-01

A general method for deriving closed reduced models of Hamiltonian dynamical systems is developed using techniques from optimization and statistical estimation. Given a vector of resolved variables, selected to describe the macroscopic state of the system, a family of quasi-equilibrium probability densities on phase space corresponding to the resolved variables is employed as a statistical model, and the evolution of the mean resolved vector is estimated by optimizing over paths of these densities. Specifically, a cost function is constructed to quantify the lack-of-fit to the microscopic dynamics of any feasible path of densities from the statistical model; it is an ensemble-averaged, weighted, squared-norm of the residual that results from submitting the path of densities to the Liouville equation. The path that minimizes the time integral of the cost function determines the best-fit evolution of the mean resolved vector. The closed reduced equations satisfied by the optimal path are derived by Hamilton-Jacobi theory. When expressed in terms of the macroscopic variables, these equations have the generic structure of governing equations for nonequilibrium thermodynamics. In particular, the value function for the optimization principle coincides with the dissipation potential that defines the relation between thermodynamic forces and fluxes. The adjustable closure parameters in the best-fit reduced equations depend explicitly on the arbitrary weights that enter into the lack-of-fit cost function. Two particular model reductions are outlined to illustrate the general method. In each example the set of weights in the optimization principle contracts into a single effective closure parameter.

Optimal Operation of Radial Distribution Systems Using Extended Dynamic Programming

DEFF Research Database (Denmark)

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

2018-01-01

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

Optimizing Technology-Oriented Constructional Paramour's of complex dynamic systems

International Nuclear Information System (INIS)

Novak, S.M.

1998-01-01

Creating optimal vibro systems requires sequential solving of a few problems: selecting the basic pattern of dynamic actions, synthesizing the dynamic active systems, optimizing technological, technical, economic and design parameters. This approach is illustrated by an example of a high-efficiency vibro system synthesized for forming building structure components. When using only one single source to excite oscillations, resonance oscillations are imparted to the product to be formed in the horizontal and vertical planes. In order to obtain versatile and dynamically optimized parameters, a factor is introduced into the differential equations of the motion, accounting for the relationship between the parameters, which determine the frequency characteristics of the system and the parameter variation range. This results in obtaining non-sophisticated mathematical models of the system under investigation, convenient for optimization and for engineering design and calculations as well

Performance optimization in electro- discharge machining using a suitable multiresponse optimization technique

Directory of Open Access Journals (Sweden)

I. Nayak

2017-06-01

Full Text Available In the present research work, four different multi response optimization techniques, viz. multiple response signal-to-noise (MRSN ratio, weighted signal-to-noise (WSN ratio, Grey relational analysis (GRA and VIKOR (VlseKriterijumska Optimizacija I Kompromisno Resenje in Serbian methods have been used to optimize the electro-discharge machining (EDM performance characteristics such as material removal rate (MRR, tool wear rate (TWR and surface roughness (SR simultaneously. Experiments have been planned on a D2 steel specimen based on L9 orthogonal array. Experimental results are analyzed using the standard procedure. The optimum level combinations of input process parameters such as voltage, current, pulse-on-time and pulse-off-time, and percentage contributions of each process parameter using ANOVA technique have been determined. Different correlations have been developed between the various input process parameters and output performance characteristics. Finally, the optimum performances of these four methods are compared and the results show that WSN ratio method is the best multiresponse optimization technique for this process. From the analysis, it is also found that the current has the maximum effect on the overall performance of EDM operation as compared to other process parameters.

Fusion blanket design and optimization techniques

International Nuclear Information System (INIS)

Gohar, Y.

2005-01-01

In fusion reactors, the blanket design and its characteristics have a major impact on the reactor performance, size, and economics. The selection and arrangement of the blanket materials, dimensions of the different blanket zones, and different requirements of the selected materials for a satisfactory performance are the main parameters, which define the blanket performance. These parameters translate to a large number of variables and design constraints, which need to be simultaneously considered in the blanket design process. This represents a major design challenge because of the lack of a comprehensive design tool capable of considering all these variables to define the optimum blanket design and satisfying all the design constraints for the adopted figure of merit and the blanket design criteria. The blanket design techniques of the First Wall/Blanket/Shield Design and Optimization System (BSDOS) have been developed to overcome this difficulty and to provide the state-of-the-art techniques and tools for performing blanket design and analysis. This report describes some of the BSDOS techniques and demonstrates its use. In addition, the use of the optimization technique of the BSDOS can result in a significant blanket performance enhancement and cost saving for the reactor design under consideration. In this report, examples are presented, which utilize an earlier version of the ITER solid breeder blanket design and a high power density self-cooled lithium blanket design for demonstrating some of the BSDOS blanket design techniques

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

Multi objective optimization of foam-filled circular tubes for quasi-static and dynamic responses

Directory of Open Access Journals (Sweden)

Fauzan Djamaluddin

Full Text Available AbstractFuel consumption and safety are currently key aspects in automobile design. The foam-filled thin-walled aluminium tube represents a potentially effective material for use in the automotive industry, due to its energy absorption capability and light weight. Multi-objective crashworthiness design optimization for foam-filled double cylindrical tubes is presented in this paper. The double structures are impacted by a rigid wall simulating quasi-static and dynamic loadings. The optimal parameters under consideration are the minimum peak crushing force and maximum specific energy absorption, using the non-dominated sorting genetic algorithm-II (NSGA-II technique. Radial basis functions (RBF and D-Optimal are adopted to determine the more complex crashworthiness functional objectives. The comparison is performed by finite element analysis of the impact crashworthiness characteristics in tubes under static and dynamic loads. Finally, the optimum crashworthiness performance of empty and foam-filled double tubes is investigated and compared to the traditional single foam-filled tube. The results indicate that the foam-filled double aluminium circular tube can be recommended for crashworthy structures.

Constraint Embedding Technique for Multibody System Dynamics

Science.gov (United States)

Woo, Simon S.; Cheng, Michael K.

2011-01-01

Multibody dynamics play a critical role in simulation testbeds for space missions. There has been a considerable interest in the development of efficient computational algorithms for solving the dynamics of multibody systems. Mass matrix factorization and inversion techniques and the O(N) class of forward dynamics algorithms developed using a spatial operator algebra stand out as important breakthrough on this front. Techniques such as these provide the efficient algorithms and methods for the application and implementation of such multibody dynamics models. However, these methods are limited only to tree-topology multibody systems. Closed-chain topology systems require different techniques that are not as efficient or as broad as those for tree-topology systems. The closed-chain forward dynamics approach consists of treating the closed-chain topology as a tree-topology system subject to additional closure constraints. The resulting forward dynamics solution consists of: (a) ignoring the closure constraints and using the O(N) algorithm to solve for the free unconstrained accelerations for the system; (b) using the tree-topology solution to compute a correction force to enforce the closure constraints; and (c) correcting the unconstrained accelerations with correction accelerations resulting from the correction forces. This constraint-embedding technique shows how to use direct embedding to eliminate local closure-loops in the system and effectively convert the system back to a tree-topology system. At this point, standard tree-topology techniques can be brought to bear on the problem. The approach uses a spatial operator algebra approach to formulating the equations of motion. The operators are block-partitioned around the local body subgroups to convert them into aggregate bodies. Mass matrix operator factorization and inversion techniques are applied to the reformulated tree-topology system. Thus in essence, the new technique allows conversion of a system with

The optimal dynamic immunization under a controlled heterogeneous node-based SIRS model

Science.gov (United States)

Yang, Lu-Xing; Draief, Moez; Yang, Xiaofan

2016-05-01

Dynamic immunizations, under which the state of the propagation network of electronic viruses can be changed by adjusting the control measures, are regarded as an alternative to static immunizations. This paper addresses the optimal dynamical immunization under the widely accepted SIRS assumption. First, based on a controlled heterogeneous node-based SIRS model, an optimal control problem capturing the optimal dynamical immunization is formulated. Second, the existence of an optimal dynamical immunization scheme is shown, and the corresponding optimality system is derived. Next, some numerical examples are given to show that an optimal immunization strategy can be worked out by numerically solving the optimality system, from which it is found that the network topology has a complex impact on the optimal immunization strategy. Finally, the difference between a payoff and the minimum payoff is estimated in terms of the deviation of the corresponding immunization strategy from the optimal immunization strategy. The proposed optimal immunization scheme is justified, because it can achieve a low level of infections at a low cost.

Dynamic Heat Supply Prediction Using Support Vector Regression Optimized by Particle Swarm Optimization Algorithm

Directory of Open Access Journals (Sweden)

Meiping Wang

2016-01-01

Full Text Available We developed an effective intelligent model to predict the dynamic heat supply of heat source. A hybrid forecasting method was proposed based on support vector regression (SVR model-optimized particle swarm optimization (PSO algorithms. Due to the interaction of meteorological conditions and the heating parameters of heating system, it is extremely difficult to forecast dynamic heat supply. Firstly, the correlations among heat supply and related influencing factors in the heating system were analyzed through the correlation analysis of statistical theory. Then, the SVR model was employed to forecast dynamic heat supply. In the model, the input variables were selected based on the correlation analysis and three crucial parameters, including the penalties factor, gamma of the kernel RBF, and insensitive loss function, were optimized by PSO algorithms. The optimized SVR model was compared with the basic SVR, optimized genetic algorithm-SVR (GA-SVR, and artificial neural network (ANN through six groups of experiment data from two heat sources. The results of the correlation coefficient analysis revealed the relationship between the influencing factors and the forecasted heat supply and determined the input variables. The performance of the PSO-SVR model is superior to those of the other three models. The PSO-SVR method is statistically robust and can be applied to practical heating system.

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.

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.

Computational optimization techniques applied to microgrids planning

DEFF Research Database (Denmark)

Gamarra, Carlos; Guerrero, Josep M.

2015-01-01

Microgrids are expected to become part of the next electric power system evolution, not only in rural and remote areas but also in urban communities. Since microgrids are expected to coexist with traditional power grids (such as district heating does with traditional heating systems......), their planning process must be addressed to economic feasibility, as a long-term stability guarantee. Planning a microgrid is a complex process due to existing alternatives, goals, constraints and uncertainties. Usually planning goals conflict each other and, as a consequence, different optimization problems...... appear along the planning process. In this context, technical literature about optimization techniques applied to microgrid planning have been reviewed and the guidelines for innovative planning methodologies focused on economic feasibility can be defined. Finally, some trending techniques and new...

Optimal Route Searching with Multiple Dynamical Constraints—A Geometric Algebra Approach

Directory of Open Access Journals (Sweden)

Dongshuang Li

2018-05-01

Full Text Available The process of searching for a dynamic constrained optimal path has received increasing attention in traffic planning, evacuation, and personalized or collaborative traffic service. As most existing multiple constrained optimal path (MCOP methods cannot search for a path given various types of constraints that dynamically change during the search, few approaches for dynamic multiple constrained optimal path (DMCOP with type II dynamics are available for practical use. In this study, we develop a method to solve the DMCOP problem with type II dynamics based on the unification of various types of constraints under a geometric algebra (GA framework. In our method, the network topology and three different types of constraints are represented by using algebraic base coding. With a parameterized optimization of the MCOP algorithm based on a greedy search strategy under the generation-refinement paradigm, this algorithm is found to accurately support the discovery of optimal paths as the constraints of numerical values, nodes, and route structure types are dynamically added to the network. The algorithm was tested with simulated cases of optimal tourism route searches in China’s road networks with various combinations of constraints. The case study indicates that our algorithm can not only solve the DMCOP with different types of constraints but also use constraints to speed up the route filtering.

Muscle optimization techniques impact the magnitude of calculated hip joint contact forces

NARCIS (Netherlands)

Wesseling, M.; Derikx, L.C.; de Groote, F.; Bartels, W.; Meyer, C.; Verdonschot, Nicolaas Jacobus Joseph; Jonkers, I.

2015-01-01

In musculoskeletal modelling, several optimization techniques are used to calculate muscle forces, which strongly influence resultant hip contact forces (HCF). The goal of this study was to calculate muscle forces using four different optimization techniques, i.e., two different static optimization

Optimal power and performance trade-offs for dynamic voltage scaling in power management based wireless sensor node

Directory of Open Access Journals (Sweden)

Anuradha Pughat

2016-09-01

Full Text Available Dynamic voltage scaling contributes to a significant amount of power saving, especially in the energy constrained wireless sensor networks (WSNs. Existing dynamic voltage scaling techniques make the system slower and ignore the event miss rate. This results in degradation of the system performance when there is non-stationary workload at input. The overhead due to transition between voltage level and discrete voltage levels are also the limitations of available dynamic voltage scaling (DVS techniques at sensor node (SN. This paper proposes a workload dependent DVS based MSP430 controller model used for SN. An online gradient estimation technique has been used to optimize power and performance trade-offs. The analytical results are validated with the simulation results obtained using simulation tool “SimEvents” and compared with the available AT9OS8535 controller. Based on the stochastic workload, the controller's input voltage, operational frequency, utilization, and average wait time of events are obtained.

Optimization of freeform surfaces using intelligent deformation techniques for LED applications

Science.gov (United States)

Isaac, Annie Shalom; Neumann, Cornelius

2018-04-01

For many years, optical designers have great interests in designing efficient optimization algorithms to bring significant improvement to their initial design. However, the optimization is limited due to a large number of parameters present in the Non-uniform Rationaly b-Spline Surfaces. This limitation was overcome by an indirect technique known as optimization using freeform deformation (FFD). In this approach, the optical surface is placed inside a cubical grid. The vertices of this grid are modified, which deforms the underlying optical surface during the optimization. One of the challenges in this technique is the selection of appropriate vertices of the cubical grid. This is because these vertices share no relationship with the optical performance. When irrelevant vertices are selected, the computational complexity increases. Moreover, the surfaces created by them are not always feasible to manufacture, which is the same problem faced in any optimization technique while creating freeform surfaces. Therefore, this research addresses these two important issues and provides feasible design techniques to solve them. Finally, the proposed techniques are validated using two different illumination examples: street lighting lens and stop lamp for automobiles.

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.

Measurement configuration optimization for dynamic metrology using Stokes polarimetry

Science.gov (United States)

Liu, Jiamin; Zhang, Chuanwei; Zhong, Zhicheng; Gu, Honggang; Chen, Xiuguo; Jiang, Hao; Liu, Shiyuan

2018-05-01

As dynamic loading experiments such as a shock compression test are usually characterized by short duration, unrepeatability and high costs, high temporal resolution and precise accuracy of the measurements is required. Due to high temporal resolution up to a ten-nanosecond-scale, a Stokes polarimeter with six parallel channels has been developed to capture such instantaneous changes in optical properties in this paper. Since the measurement accuracy heavily depends on the configuration of the probing beam incident angle and the polarizer azimuth angle, it is important to select an optimal combination from the numerous options. In this paper, a systematic error propagation-based measurement configuration optimization method corresponding to the Stokes polarimeter was proposed. The maximal Frobenius norm of the combinatorial matrix of the configuration error propagating matrix and the intrinsic error propagating matrix is introduced to assess the measurement accuracy. The optimal configuration for thickness measurement of a SiO2 thin film deposited on a Si substrate has been achieved by minimizing the merit function. Simulation and experimental results show a good agreement between the optimal measurement configuration achieved experimentally using the polarimeter and the theoretical prediction. In particular, the experimental result shows that the relative error in the thickness measurement can be reduced from 6% to 1% by using the optimal polarizer azimuth angle when the incident angle is 45°. Furthermore, the optimal configuration for the dynamic metrology of a nickel foil under quasi-dynamic loading is investigated using the proposed optimization method.

DYNAMIC OPTIMAL BUDGET ALLOCATION FOR INTEGRATED MARKETING CONSIDERING PERSISTENCE

OpenAIRE

SHIZHONG AI; RONG DU; QIYING HU

2010-01-01

Aiming at forming dynamic optimal integrated marketing policies, we build a budget allocation model considering both current effects and sustained ones. The model includes multiple time periods and multiple marketing tools which interact through a common resource pool as well as through delayed cross influences on each other's sales, reflecting the nature of "integrated marketing" and its dynamics. In our study, marginal analysis is used to illuminate the structure of optimal policy. We deriv...

An Optimization Framework for Dynamic, Distributed Real-Time Systems

Science.gov (United States)

Eckert, Klaus; Juedes, David; Welch, Lonnie; Chelberg, David; Bruggerman, Carl; Drews, Frank; Fleeman, David; Parrott, David; Pfarr, Barbara

2003-01-01

Abstract. This paper presents a model that is useful for developing resource allocation algorithms for distributed real-time systems .that operate in dynamic environments. Interesting aspects of the model include dynamic environments, utility and service levels, which provide a means for graceful degradation in resource-constrained situations and support optimization of the allocation of resources. The paper also provides an allocation algorithm that illustrates how to use the model for producing feasible, optimal resource allocations.

Design optimization of tailor-rolled blank thin-walled structures based on ɛ-support vector regression technique and genetic algorithm

Science.gov (United States)

Duan, Libin; Xiao, Ning-cong; Li, Guangyao; Cheng, Aiguo; Chen, Tao

2017-07-01

Tailor-rolled blank thin-walled (TRB-TH) structures have become important vehicle components owing to their advantages of light weight and crashworthiness. The purpose of this article is to provide an efficient lightweight design for improving the energy-absorbing capability of TRB-TH structures under dynamic loading. A finite element (FE) model for TRB-TH structures is established and validated by performing a dynamic axial crash test. Different material properties for individual parts with different thicknesses are considered in the FE model. Then, a multi-objective crashworthiness design of the TRB-TH structure is constructed based on the ɛ-support vector regression (ɛ-SVR) technique and non-dominated sorting genetic algorithm-II. The key parameters (C, ɛ and σ) are optimized to further improve the predictive accuracy of ɛ-SVR under limited sample points. Finally, the technique for order preference by similarity to the ideal solution method is used to rank the solutions in Pareto-optimal frontiers and find the best compromise optima. The results demonstrate that the light weight and crashworthiness performance of the optimized TRB-TH structures are superior to their uniform thickness counterparts. The proposed approach provides useful guidance for designing TRB-TH energy absorbers for vehicle bodies.

An optimization planning technique for Suez Canal Network in Egypt

Energy Technology Data Exchange (ETDEWEB)

Abou El-Ela, A.A.; El-Zeftawy, A.A.; Allam, S.M.; Atta, Gasir M. [Electrical Engineering Dept., Faculty of Eng., Shebin El-Kom (Egypt)

2010-02-15

This paper introduces a proposed optimization technique POT for predicting the peak load demand and planning of transmission line systems. Many of traditional methods have been presented for long-term load forecasting of electrical power systems. But, the results of these methods are approximated. Therefore, the artificial neural network (ANN) technique for long-term peak load forecasting is modified and discussed as a modern technique in long-term load forecasting. The modified technique is applied on the Egyptian electrical network dependent on its historical data to predict the electrical peak load demand forecasting up to year 2017. This technique is compared with extrapolation of trend curves as a traditional method. The POT is applied also to obtain the optimal planning of transmission lines for the 220 kV of Suez Canal Network (SCN) using the ANN technique. The minimization of the transmission network costs are considered as an objective function, while the transmission lines (TL) planning constraints are satisfied. Zafarana site on the Red Sea coast is considered as an optimal site for installing big wind farm (WF) units in Egypt. So, the POT is applied to plan both the peak load and the electrical transmission of SCN with and without considering WF to develop the impact of WF units on the electrical transmission system of Egypt, considering the reliability constraints which were taken as a separate model in the previous techniques. The application on SCN shows the capability and the efficiently of the proposed techniques to obtain the predicting peak load demand and the optimal planning of transmission lines of SCN up to year 2017. (author)

Nonlinear Dynamic Analysis and Optimization of Closed-Form Planetary Gear System

Directory of Open Access Journals (Sweden)

Qilin Huang

2013-01-01

Full Text Available A nonlinear purely rotational dynamic model of a multistage closed-form planetary gear set formed by two simple planetary stages is proposed in this study. The model includes time-varying mesh stiffness, excitation fluctuation and gear backlash nonlinearities. The nonlinear differential equations of motion are solved numerically using variable step-size Runge-Kutta. In order to obtain function expression of optimization objective, the nonlinear differential equations of motion are solved analytically using harmonic balance method (HBM. Based on the analytical solution of dynamic equations, the optimization mathematical model which aims at minimizing the vibration displacement of the low-speed carrier and the total mass of the gear transmission system is established. The optimization toolbox in MATLAB program is adopted to obtain the optimal solution. A case is studied to demonstrate the effectiveness of the dynamic model and the optimization method. The results show that the dynamic properties of the closed-form planetary gear transmission system have been improved and the total mass of the gear set has been decreased significantly.

Practical synchronization on complex dynamical networks via optimal pinning control

Science.gov (United States)

Li, Kezan; Sun, Weigang; Small, Michael; Fu, Xinchu

2015-07-01

We consider practical synchronization on complex dynamical networks under linear feedback control designed by optimal control theory. The control goal is to minimize global synchronization error and control strength over a given finite time interval, and synchronization error at terminal time. By utilizing the Pontryagin's minimum principle, and based on a general complex dynamical network, we obtain an optimal system to achieve the control goal. The result is verified by performing some numerical simulations on Star networks, Watts-Strogatz networks, and Barabási-Albert networks. Moreover, by combining optimal control and traditional pinning control, we propose an optimal pinning control strategy which depends on the network's topological structure. Obtained results show that optimal pinning control is very effective for synchronization control in real applications.

Optimal long-term contracting with learning

OpenAIRE

He, Zhiguo; Wei, Bin; Yu, Jianfeng; Gao, Feng

2016-01-01

We introduce uncertainty into Holmstrom and Milgrom (1987) to study optimal long-term contracting with learning. In a dynamic relationship, the agent's shirking not only reduces current performance but also increases the agent's information rent due to the persistent belief manipulation effect. We characterize the optimal contract using the dynamic programming technique in which information rent is the unique state variable. In the optimal contract, the optimal effort is front-loaded and decr...

Determination of the optimal tolerance for MLC positioning in sliding window and VMAT techniques

International Nuclear Information System (INIS)

Hernandez, V.; Abella, R.; Calvo, J. F.; Jurado-Bruggemann, D.; Sancho, I.; Carrasco, P.

2015-01-01

Purpose: Several authors have recommended a 2 mm tolerance for multileaf collimator (MLC) positioning in sliding window treatments. In volumetric modulated arc therapy (VMAT) treatments, however, the optimal tolerance for MLC positioning remains unknown. In this paper, the authors present the results of a multicenter study to determine the optimal tolerance for both techniques. Methods: The procedure used is based on dynalog file analysis. The study was carried out using seven Varian linear accelerators from five different centers. Dynalogs were collected from over 100 000 clinical treatments and in-house software was used to compute the number of tolerance faults as a function of the user-defined tolerance. Thus, the optimal value for this tolerance, defined as the lowest achievable value, was investigated. Results: Dynalog files accurately predict the number of tolerance faults as a function of the tolerance value, especially for low fault incidences. All MLCs behaved similarly and the Millennium120 and the HD120 models yielded comparable results. In sliding window techniques, the number of beams with an incidence of hold-offs >1% rapidly decreases for a tolerance of 1.5 mm. In VMAT techniques, the number of tolerance faults sharply drops for tolerances around 2 mm. For a tolerance of 2.5 mm, less than 0.1% of the VMAT arcs presented tolerance faults. Conclusions: Dynalog analysis provides a feasible method for investigating the optimal tolerance for MLC positioning in dynamic fields. In sliding window treatments, the tolerance of 2 mm was found to be adequate, although it can be reduced to 1.5 mm. In VMAT treatments, the typically used 5 mm tolerance is excessively high. Instead, a tolerance of 2.5 mm is recommended

Optimal Piecewise-Linear Approximation of the Quadratic Chaotic Dynamics

Directory of Open Access Journals (Sweden)

J. Petrzela

2012-04-01

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

New numerical methods for open-loop and feedback solutions to dynamic optimization problems

Science.gov (United States)

Ghosh, Pradipto

The topic of the first part of this research is trajectory optimization of dynamical systems via computational swarm intelligence. Particle swarm optimization is a nature-inspired heuristic search method that relies on a group of potential solutions to explore the fitness landscape. Conceptually, each particle in the swarm uses its own memory as well as the knowledge accumulated by the entire swarm to iteratively converge on an optimal or near-optimal solution. It is relatively straightforward to implement and unlike gradient-based solvers, does not require an initial guess or continuity in the problem definition. Although particle swarm optimization has been successfully employed in solving static optimization problems, its application in dynamic optimization, as posed in optimal control theory, is still relatively new. In the first half of this thesis particle swarm optimization is used to generate near-optimal solutions to several nontrivial trajectory optimization problems including thrust programming for minimum fuel, multi-burn spacecraft orbit transfer, and computing minimum-time rest-to-rest trajectories for a robotic manipulator. A distinct feature of the particle swarm optimization implementation in this work is the runtime selection of the optimal solution structure. Optimal trajectories are generated by solving instances of constrained nonlinear mixed-integer programming problems with the swarming technique. For each solved optimal programming problem, the particle swarm optimization result is compared with a nearly exact solution found via a direct method using nonlinear programming. Numerical experiments indicate that swarm search can locate solutions to very great accuracy. The second half of this research develops a new extremal-field approach for synthesizing nearly optimal feedback controllers for optimal control and two-player pursuit-evasion games described by general nonlinear differential equations. A notable revelation from this development

The Adjoint Method for Gradient-based Dynamic Optimization of UV Flash Processes

DEFF Research Database (Denmark)

Ritschel, Tobias Kasper Skovborg; Capolei, Andrea; Jørgensen, John Bagterp

2017-01-01

This paper presents a novel single-shooting algorithm for gradient-based solution of optimal control problems with vapor-liquid equilibrium constraints. Dynamic optimization of UV flash processes is relevant in nonlinear model predictive control of distillation columns, certain two-phase flow pro......-component flash process which demonstrate the importance of the optimization solver, the compiler, and the linear algebra software for the efficiency of dynamic optimization of UV flash processes....

Electrostatic afocal-zoom lens design using computer optimization technique

Energy Technology Data Exchange (ETDEWEB)

Sise, Omer, E-mail: omersise@gmail.com

2014-12-15

Highlights: • We describe the detailed design of a five-element electrostatic afocal-zoom lens. • The simplex optimization is used to optimize lens voltages. • The method can be applied to multi-element electrostatic lenses. - Abstract: Electron optics is the key to the successful operation of electron collision experiments where well designed electrostatic lenses are needed to drive electron beam before and after the collision. In this work, the imaging properties and aberration analysis of an electrostatic afocal-zoom lens design were investigated using a computer optimization technique. We have found a whole new range of voltage combinations that has gone unnoticed until now. A full range of voltage ratios and spherical and chromatic aberration coefficients were systematically analyzed with a range of magnifications between 0.3 and 3.2. The grid-shadow evaluation was also employed to show the effect of spherical aberration. The technique is found to be useful for searching the optimal configuration in a multi-element lens system.

Optimal control of HIV/AIDS dynamic: Education and treatment

Science.gov (United States)

Sule, Amiru; Abdullah, Farah Aini

2014-07-01

A mathematical model which describes the transmission dynamics of HIV/AIDS is developed. The optimal control representing education and treatment for this model is explored. The existence of optimal Control is established analytically by the use of optimal control theory. Numerical simulations suggest that education and treatment for the infected has a positive impact on HIV/AIDS control.

Trajectory optimization for dynamic couch rotation during volumetric modulated arc radiotherapy

Science.gov (United States)

Smyth, Gregory; Bamber, Jeffrey C.; Evans, Philip M.; Bedford, James L.

2013-11-01

Non-coplanar radiation beams are often used in three-dimensional conformal and intensity modulated radiotherapy to reduce dose to organs at risk (OAR) by geometric avoidance. In volumetric modulated arc radiotherapy (VMAT) non-coplanar geometries are generally achieved by applying patient couch rotations to single or multiple full or partial arcs. This paper presents a trajectory optimization method for a non-coplanar technique, dynamic couch rotation during VMAT (DCR-VMAT), which combines ray tracing with a graph search algorithm. Four clinical test cases (partial breast, brain, prostate only, and prostate and pelvic nodes) were used to evaluate the potential OAR sparing for trajectory-optimized DCR-VMAT plans, compared with standard coplanar VMAT. In each case, ray tracing was performed and a cost map reflecting the number of OAR voxels intersected for each potential source position was generated. The least-cost path through the cost map, corresponding to an optimal DCR-VMAT trajectory, was determined using Dijkstra’s algorithm. Results show that trajectory optimization can reduce dose to specified OARs for plans otherwise comparable to conventional coplanar VMAT techniques. For the partial breast case, the mean heart dose was reduced by 53%. In the brain case, the maximum lens doses were reduced by 61% (left) and 77% (right) and the globes by 37% (left) and 40% (right). Bowel mean dose was reduced by 15% in the prostate only case. For the prostate and pelvic nodes case, the bowel V50 Gy and V60 Gy were reduced by 9% and 45% respectively. Future work will involve further development of the algorithm and assessment of its performance over a larger number of cases in site-specific cohorts.

Algorithms for optimal sequencing of dynamic multileaf collimators

Energy Technology Data Exchange (ETDEWEB)

Kamath, Srijit [Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL (United States); Sahni, Sartaj [Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL (United States); Palta, Jatinder [Department of Radiation Oncology, University of Florida, Gainesville, FL (United States); Ranka, Sanjay [Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL (United States)

2004-01-07

Dynamic multileaf collimator (DMLC) intensity modulated radiation therapy (IMRT) is used to deliver intensity modulated beams using a multileaf collimator (MLC), with the leaves in motion. DMLC-IMRT requires the conversion of a radiation intensity map into a leaf sequence file that controls the movement of the MLC while the beam is on. It is imperative that the intensity map delivered using the leaf sequence file be as close as possible to the intensity map generated by the dose optimization algorithm, while satisfying hardware constraints of the delivery system. Optimization of the leaf-sequencing algorithm has been the subject of several recent investigations. In this work, we present a systematic study of the optimization of leaf-sequencing algorithms for dynamic multileaf collimator beam delivery and provide rigorous mathematical proofs of optimized leaf sequence settings in terms of monitor unit (MU) efficiency under the most common leaf movement constraints that include leaf interdigitation constraint. Our analytical analysis shows that leaf sequencing based on unidirectional movement of the MLC leaves is as MU efficient as bi-directional movement of the MLC leaves.

Algorithms for optimal sequencing of dynamic multileaf collimators

International Nuclear Information System (INIS)

Kamath, Srijit; Sahni, Sartaj; Palta, Jatinder; Ranka, Sanjay

2004-01-01

Dynamic multileaf collimator (DMLC) intensity modulated radiation therapy (IMRT) is used to deliver intensity modulated beams using a multileaf collimator (MLC), with the leaves in motion. DMLC-IMRT requires the conversion of a radiation intensity map into a leaf sequence file that controls the movement of the MLC while the beam is on. It is imperative that the intensity map delivered using the leaf sequence file be as close as possible to the intensity map generated by the dose optimization algorithm, while satisfying hardware constraints of the delivery system. Optimization of the leaf-sequencing algorithm has been the subject of several recent investigations. In this work, we present a systematic study of the optimization of leaf-sequencing algorithms for dynamic multileaf collimator beam delivery and provide rigorous mathematical proofs of optimized leaf sequence settings in terms of monitor unit (MU) efficiency under the most common leaf movement constraints that include leaf interdigitation constraint. Our analytical analysis shows that leaf sequencing based on unidirectional movement of the MLC leaves is as MU efficient as bi-directional movement of the MLC leaves

Framework for optimal power flow incorporating dynamic system security

International Nuclear Information System (INIS)

El-Kady, M.A.; Owayedh, M.S.

2006-01-01

This paper introduces a novel framework and methodologies which are capable of tackling the complex issue of power system economy versus security in a practical and effective manner. At heart of achieving such a challenging and far-reaching objective is the incorporation of the Dyanamic Security Assessment (DSA) into production optimization techniques using the Transient Energy Function (TEF) method. In addition, and in parallel with the already well established concept of the system security, two new concepts pertaining to power system performance will be introduced in this paper, namely the concept of system dynamic susceptibility, which measures the level of systems weakness to a particular contingency and the concept of system consequent restorability, which measures the extent of contingency severity in terms of the required subsequent system restoration work should a particular contingency occur. (author)

Optimization of fuel-cell tram operation based on two dimension dynamic programming

Science.gov (United States)

Zhang, Wenbin; Lu, Xuecheng; Zhao, Jingsong; Li, Jianqiu

2018-02-01

This paper proposes an optimal control strategy based on the two-dimension dynamic programming (2DDP) algorithm targeting at minimizing operation energy consumption for a fuel-cell tram. The energy consumption model with the tram dynamics is firstly deduced. Optimal control problem are analyzed and the 2DDP strategy is applied to solve the problem. The optimal tram speed profiles are obtained for each interstation which consist of three stages: accelerate to the set speed with the maximum traction power, dynamically adjust to maintain a uniform speed and decelerate to zero speed with the maximum braking power at a suitable timing. The optimal control curves of all the interstations are connected with the parking time to form the optimal control method of the whole line. The optimized speed profiles are also simplified for drivers to follow.

Software for the grouped optimal aggregation technique

Science.gov (United States)

Brown, P. M.; Shaw, G. W. (Principal Investigator)

1982-01-01

The grouped optimal aggregation technique produces minimum variance, unbiased estimates of acreage and production for countries, zones (states), or any designated collection of acreage strata. It uses yield predictions, historical acreage information, and direct acreage estimate from satellite data. The acreage strata are grouped in such a way that the ratio model over historical acreage provides a smaller variance than if the model were applied to each individual stratum. An optimal weighting matrix based on historical acreages, provides the link between incomplete direct acreage estimates and the total, current acreage estimate.

Efficient reanalysis techniques for robust topology optimization

DEFF Research Database (Denmark)

Amir, Oded; Sigmund, Ole; Lazarov, Boyan Stefanov

2012-01-01

efficient robust topology optimization procedures based on reanalysis techniques. The approach is demonstrated on two compliant mechanism design problems where robust design is achieved by employing either a worst case formulation or a stochastic formulation. It is shown that the time spent on finite...

On the Optimization of Aerospace Plane Ascent Trajectory

Science.gov (United States)

Al-Garni, Ahmed; Kassem, Ayman Hamdy

A hybrid heuristic optimization technique based on genetic algorithms and particle swarm optimization has been developed and tested for trajectory optimization problems with multi-constraints and a multi-objective cost function. The technique is used to calculate control settings for two types for ascending trajectories (constant dynamic pressure and minimum-fuel-minimum-heat) for a two-dimensional model of an aerospace plane. A thorough statistical analysis is done on the hybrid technique to make comparisons with both basic genetic algorithms and particle swarm optimization techniques with respect to convergence and execution time. Genetic algorithm optimization showed better execution time performance while particle swarm optimization showed better convergence performance. The hybrid optimization technique, benefiting from both techniques, showed superior robust performance compromising convergence trends and execution time.

Direct Optimal Control of Duffing Dynamics

Science.gov (United States)

Oz, Hayrani; Ramsey, John K.

2002-01-01

The "direct control method" is a novel concept that is an attractive alternative and competitor to the differential-equation-based methods. The direct method is equally well applicable to nonlinear, linear, time-varying, and time-invariant systems. For all such systems, the method yields explicit closed-form control laws based on minimization of a quadratic control performance measure. We present an application of the direct method to the dynamics and optimal control of the Duffing system where the control performance measure is not restricted to a quadratic form and hence may include a quartic energy term. The results we present in this report also constitute further generalizations of our earlier work in "direct optimal control methodology." The approach is demonstrated for the optimal control of the Duffing equation with a softening nonlinear stiffness.

Weather and Climate Manipulation as an Optimal Control for Adaptive Dynamical Systems

Directory of Open Access Journals (Sweden)

Sergei A. Soldatenko

2017-01-01

Full Text Available The weather and climate manipulation is examined as an optimal control problem for the earth climate system, which is considered as a complex adaptive dynamical system. Weather and climate manipulations are actually amorphous operations. Since their objectives are usually formulated vaguely, the expected results are fairly unpredictable and uncertain. However, weather and climate modification is a purposeful process and, therefore, we can formulate operations to manipulate weather and climate as the optimization problem within the framework of the optimal control theory. The complexity of the earth’s climate system is discussed and illustrated using the simplified low-order coupled chaotic dynamical system. The necessary conditions of optimality are derived for the large-scale atmospheric dynamics. This confirms that even a relatively simplified control problem for the atmospheric dynamics requires significant efforts to obtain the solution.

An adaptive immune optimization algorithm with dynamic lattice searching operation for fast optimization of atomic clusters

International Nuclear Information System (INIS)

Wu, Xia; Wu, Genhua

2014-01-01

Highlights: • A high efficient method for optimization of atomic clusters is developed. • Its performance is studied by optimizing Lennard-Jones clusters and Ag clusters. • The method is proved to be quite efficient. • A new Ag 61 cluster with stacking-fault face-centered cubic motif is found. - Abstract: Geometrical optimization of atomic clusters is performed by a development of adaptive immune optimization algorithm (AIOA) with dynamic lattice searching (DLS) operation (AIOA-DLS method). By a cycle of construction and searching of the dynamic lattice (DL), DLS algorithm rapidly makes the clusters more regular and greatly reduces the potential energy. DLS can thus be used as an operation acting on the new individuals after mutation operation in AIOA to improve the performance of the AIOA. The AIOA-DLS method combines the merit of evolutionary algorithm and idea of dynamic lattice. The performance of the proposed method is investigated in the optimization of Lennard-Jones clusters within 250 atoms and silver clusters described by many-body Gupta potential within 150 atoms. Results reported in the literature are reproduced, and the motif of Ag 61 cluster is found to be stacking-fault face-centered cubic, whose energy is lower than that of previously obtained icosahedron

Bridging developmental systems theory and evolutionary psychology using dynamic optimization.

Science.gov (United States)

Frankenhuis, Willem E; Panchanathan, Karthik; Clark Barrett, H

2013-07-01

Interactions between evolutionary psychologists and developmental systems theorists have been largely antagonistic. This is unfortunate because potential synergies between the two approaches remain unexplored. This article presents a method that may help to bridge the divide, and that has proven fruitful in biology: dynamic optimization. Dynamic optimization integrates developmental systems theorists' focus on dynamics and contingency with the 'design stance' of evolutionary psychology. It provides a theoretical framework as well as a set of tools for exploring the properties of developmental systems that natural selection might favor, given particular evolutionary ecologies. We also discuss limitations of the approach. © 2013 Blackwell Publishing Ltd.

When are network coding based dynamic multi-homing techniques beneficial?

DEFF Research Database (Denmark)

Pereira, Carlos; Aguiar, Ana; Roetter, Daniel Enrique Lucani

2016-01-01

Mechanisms that can cope with unreliable wireless channels in an efficient manner are required due to the increasing number of resource constrained devices. Concurrent use of multiple communications technologies can be instrumental towards improving services to mobile devices in heterogeneous...... networks. In our previous work, we developed an optimization framework to generate channel-aware transmission policies for multi-homed devices under different cost criteria. Our formulation considers network coding as a key technique that simplifies load allocation across multiple channels and provides...... high resiliency under time-varying channel conditions. This paper seeks to explore the parameter space and identify the operating regions where dynamic coded policies offer most improvement over static ones in terms of energy consumption and channel utilization. We leverage meta-heuristics to find...

Moving Target Techniques: Cyber Resilience throught Randomization, Diversity, and Dynamism

Science.gov (United States)

2017-03-03

attacks. Simply put, these techniques turn systems into moving targets that will be hard for cyber attackers to compromise. MT techniques leverage...been diversified, they can attack it as if it was not diversified at all. Dynamic Data: Techniques in the dynamic data domain change the format

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 Strategy for Integrated Dynamic Inventory Control and Supplier Selection in Unknown Environment via Stochastic Dynamic Programming

International Nuclear Information System (INIS)

Sutrisno; Widowati; Solikhin

2016-01-01

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

Large portfolio risk management and optimal portfolio allocation with dynamic elliptical copulas

Directory of Open Access Journals (Sweden)

Jin Xisong

2018-02-01

Full Text Available Previous research has focused on the importance of modeling the multivariate distribution for optimal portfolio allocation and active risk management. However, existing dynamic models are not easily applied to high-dimensional problems due to the curse of dimensionality. In this paper, we extend the framework of the Dynamic Conditional Correlation/Equicorrelation and an extreme value approach into a series of Dynamic Conditional Elliptical Copulas. We investigate risk measures such as Value at Risk (VaR and Expected Shortfall (ES for passive portfolios and dynamic optimal portfolios using Mean-Variance and ES criteria for a sample of US stocks over a period of 10 years. Our results suggest that (1 Modeling the marginal distribution is important for dynamic high-dimensional multivariate models. (2 Neglecting the dynamic dependence in the copula causes over-aggressive risk management. (3 The DCC/DECO Gaussian copula and t-copula work very well for both VaR and ES. (4 Grouped t-copulas and t-copulas with dynamic degrees of freedom further match the fat tail. (5 Correctly modeling the dependence structure makes an improvement in portfolio optimization with respect to tail risk. (6 Models driven by multivariate t innovations with exogenously given degrees of freedom provide a flexible and applicable alternative for optimal portfolio risk management.

Development of High Speed Imaging and Analysis Techniques Compressible Dynamics Stall

Science.gov (United States)

Chandrasekhara, M. S.; Carr, L. W.; Wilder, M. C.; Davis, Sanford S. (Technical Monitor)

1996-01-01

Dynamic stall has limited the flight envelope of helicopters for many years. The problem has been studied in the laboratory as well as in flight, but most research, even in the laboratory, has been restricted to surface measurement techniques such as pressure transducers or skin friction gauges, except at low speed. From this research, it became apparent that flow visualization tests performed at Mach numbers representing actual flight conditions were needed if the complex physics associated with dynamic stall was to be properly understood. However, visualization of the flow field during compressible conditions required carefully aligned and meticulously reconstructed holographic interferometry. As part of a long-range effort focused on exposing of the physics of compressible dynamic stall, a research wind tunnel was developed at NASA Ames Research Center which permits visual access to the full flow field surrounding an oscillating airfoil during compressible dynamic stall. Initially, a stroboscopic schlieren technique was used for visualization of the stall process, but the primary research tool has been point diffraction interferometry(PDI), a technique carefully optimized for use in th is project. A review of the process of development of PDI will be presented in the full paper. One of the most valuable aspects of PDI is the fact that interferograms are produced in real time on a continuous basis. The use of a rapidly-pulsed laser makes this practical; a discussion of this approach will be presented in the full paper. This rapid pulsing(up to 40,000 pulses/sec) produces interferograms of the rapidly developing dynamic stall field in sufficient resolution(both in space and time) that the fluid physics of the compressible dynamic stall flowfield can be quantitatively determined, including the gradients of pressure in space and time. This permits analysis of the influence of the effect of pitch rate, Mach number, Reynolds number, amplitude of oscillation, and other

Sub-optimal control of fuzzy linear dynamical systems under granular differentiability concept.

Science.gov (United States)

Mazandarani, Mehran; Pariz, Naser

2018-05-01

This paper deals with sub-optimal control of a fuzzy linear dynamical system. The aim is to keep the state variables of the fuzzy linear dynamical system close to zero in an optimal manner. In the fuzzy dynamical system, the fuzzy derivative is considered as the granular derivative; and all the coefficients and initial conditions can be uncertain. The criterion for assessing the optimality is regarded as a granular integral whose integrand is a quadratic function of the state variables and control inputs. Using the relative-distance-measure (RDM) fuzzy interval arithmetic and calculus of variations, the optimal control law is presented as the fuzzy state variables feedback. Since the optimal feedback gains are obtained as fuzzy functions, they need to be defuzzified. This will result in the sub-optimal control law. This paper also sheds light on the restrictions imposed by the approaches which are based on fuzzy standard interval arithmetic (FSIA), and use strongly generalized Hukuhara and generalized Hukuhara differentiability concepts for obtaining the optimal control law. The granular eigenvalues notion is also defined. Using an RLC circuit mathematical model, it is shown that, due to their unnatural behavior in the modeling phenomenon, the FSIA-based approaches may obtain some eigenvalues sets that might be different from the inherent eigenvalues set of the fuzzy dynamical system. This is, however, not the case with the approach proposed in this study. The notions of granular controllability and granular stabilizability of the fuzzy linear dynamical system are also presented in this paper. Moreover, a sub-optimal control for regulating a Boeing 747 in longitudinal direction with uncertain initial conditions and parameters is gained. In addition, an uncertain suspension system of one of the four wheels of a bus is regulated using the sub-optimal control introduced in this paper. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.

A novel technique for active vibration control, based on optimal

Indian Academy of Sciences (India)

In the last few decades, researchers have proposed many control techniques to suppress unwanted vibrations in a structure. In this work, a novel and simple technique is proposed for the active vibration control. In this technique, an optimal tracking control is employed to suppress vibrations in a structure by simultaneously ...

Optimal DPM and DVFS for frame-based real-time systems

NARCIS (Netherlands)

Gerards, Marco Egbertus Theodorus; Kuper, Jan

Dynamic Power Management (DPM) and Dynamic Voltage and Frequency Scaling (DVFS) are popular techniques for reducing energy consumption. Algorithms for optimal DVFS exist, but optimal DPM and the optimal combination of DVFS and DPM are not yet solved. In this article we use well-established models of

An evolutionary algorithm technique for intelligence, surveillance, and reconnaissance plan optimization

Science.gov (United States)

Langton, John T.; Caroli, Joseph A.; Rosenberg, Brad

2008-04-01

To support an Effects Based Approach to Operations (EBAO), Intelligence, Surveillance, and Reconnaissance (ISR) planners must optimize collection plans within an evolving battlespace. A need exists for a decision support tool that allows ISR planners to rapidly generate and rehearse high-performing ISR plans that balance multiple objectives and constraints to address dynamic collection requirements for assessment. To meet this need we have designed an evolutionary algorithm (EA)-based "Integrated ISR Plan Analysis and Rehearsal System" (I2PARS) to support Effects-based Assessment (EBA). I2PARS supports ISR mission planning and dynamic replanning to coordinate assets and optimize their routes, allocation and tasking. It uses an evolutionary algorithm to address the large parametric space of route-finding problems which is sometimes discontinuous in the ISR domain because of conflicting objectives such as minimizing asset utilization yet maximizing ISR coverage. EAs are uniquely suited for generating solutions in dynamic environments and also allow user feedback. They are therefore ideal for "streaming optimization" and dynamic replanning of ISR mission plans. I2PARS uses the Non-dominated Sorting Genetic Algorithm (NSGA-II) to automatically generate a diverse set of high performing collection plans given multiple objectives, constraints, and assets. Intended end users of I2PARS include ISR planners in the Combined Air Operations Centers and Joint Intelligence Centers. Here we show the feasibility of applying the NSGA-II algorithm and EAs in general to the ISR planning domain. Unique genetic representations and operators for optimization within the ISR domain are presented along with multi-objective optimization criteria for ISR planning. Promising results of the I2PARS architecture design, early software prototype, and limited domain testing of the new algorithm are discussed. We also present plans for future research and development, as well as technology

Optimal control theory an introduction

CERN Document Server

Kirk, Donald E

2004-01-01

Optimal control theory is the science of maximizing the returns from and minimizing the costs of the operation of physical, social, and economic processes. Geared toward upper-level undergraduates, this text introduces three aspects of optimal control theory: dynamic programming, Pontryagin's minimum principle, and numerical techniques for trajectory optimization.Chapters 1 and 2 focus on describing systems and evaluating their performances. Chapter 3 deals with dynamic programming. The calculus of variations and Pontryagin's minimum principle are the subjects of chapters 4 and 5, and chapter

An Experimental Study of Structural Identification of Bridges Using the Kinetic Energy Optimization Technique and the Direct Matrix Updating Method

Directory of Open Access Journals (Sweden)

Gwanghee Heo

2016-01-01

Full Text Available This paper aims to develop an SI (structural identification technique using the KEOT and the DMUM to decide on optimal location of sensors and to update FE model, respectively, which ultimately contributes to a composition of more effective SHM. Owing to the characteristic structural flexing behavior of cable bridges (e.g., cable-stayed bridges and suspension bridges, which makes them vulnerable to any vibration, systematic and continuous structural health monitoring (SHM is pivotal for them. Since it is necessary to select optimal measurement locations with the fewest possible measurements and also to accurately assess the structural state of a bridge for the development of an effective SHM, an SI technique is as much important to accurately determine the modal parameters of the current structure based on the data optimally obtained. In this study, the kinetic energy optimization technique (KEOT was utilized to determine the optimal measurement locations, while the direct matrix updating method (DMUM was utilized for FE model updating. As a result of experiment, the required number of measurement locations derived from KEOT based on the target mode was reduced by approximately 80% compared to the initial number of measurement locations. Moreover, compared to the eigenvalue of the modal experiment, an improved FE model with a margin of error of less than 1% was derived from DMUM. Thus, the SI technique for cable-stayed bridges proposed in this study, which utilizes both KEOT and DMUM, is proven effective in minimizing the number of sensors while accurately determining the structural dynamic characteristics.

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

Optimal reduction of flexible dynamic system

International Nuclear Information System (INIS)

Jankovic, J.

1994-01-01

Dynamic system reduction is basic procedure in various problems of active control synthesis of flexible structures. In this paper is presented direct method for system reduction by explicit extraction of modes included in reduced model form. Criterion for optimal system discrete approximation in synthesis reduced dynamic model is also presented. Subjected method of system decomposition is discussed in relation to the Schur method of solving matrix algebraic Riccati equation as condition for system reduction. By using exposed method procedure of flexible system reduction in addition with corresponding example is presented. Shown procedure is powerful in problems of active control synthesis of flexible system vibrations

A dynamic supraclavicular field-matching technique for head-and-neck cancer patients treated with IMRT

International Nuclear Information System (INIS)

Duan, Jun; Shen Sui; Spencer, Sharon A.; Ahmed, Raef S.; Popple, Richard A.; Ye, Sung-Joon; Brezovich, Ivan A.

2004-01-01

Purpose: The conventional single-isocenter and half-beam (SIHB) technique for matching supraclavicular fields with head-and-neck (HN) intensity-modulated radiotherapy (IMRT) fields is subject to substantial dose inhomogeneities from imperfect accelerator jaw/MLC calibration. It also limits the isocenter location and restricts the useful field size for IMRT. We propose a dynamic field-matching technique to overcome these limitations. Methods and materials: The proposed dynamic field-matching technique makes use of wedge junctions for the abutment of supraclavicular and HN IMRT fields. The supraclavicular field was shaped with a multileaf collimator (MLC), which was orientated such that the leaves traveled along the superoinferior direction. The leaves that defined the superior field border moved continuously during treatment from 1.5 cm below to 1.5 cm above the conventional match line to generate a 3-cm-wide wedge-shaped junction. The HN IMRT fields were optimized by taking into account the dose contribution from the supraclavicular field to the junction area, which generates a complementary wedge to produce a smooth junction in the abutment region. This technique was evaluated on a polystyrene phantom and 10 HN cancer patients. Treatment plans were generated for the phantom and the 10 patients. Dose profiles across the abutment region were measured in the phantom on films. For patient plans, dose profiles that passed through the center of the neck lymph nodes were calculated using the proposed technique and the SIHB technique, and dose uniformity in the abutment region was compared. Field mismatches of ± 1 mm and ± 2 mm because of imperfect jaw/MLC calibration were simulated, and the resulting dose inhomogeneities were studied for the two techniques with film measurements and patient plans. Three-dimensional volumetric doses were analyzed, and equivalent uniform doses (EUD) were computed. The effect of field mismatches on EUD was compared for the two match

Tabu search, a versatile technique for the functions optimization

International Nuclear Information System (INIS)

Castillo M, J.A.

2003-01-01

The basic elements of the Tabu search technique are presented, putting emphasis in the qualities that it has in comparison with the traditional methods of optimization known as in descending pass. Later on some modifications are sketched that have been implemented in the technique along the time, so that this it is but robust. Finally they are given to know some areas where this technique has been applied, obtaining successful results. (Author)

Research on the optimal dynamical systems of three-dimensional Navier-Stokes equations based on weighted residual

Science.gov (United States)

Peng, NaiFu; Guan, Hui; Wu, ChuiJie

2016-04-01

In this paper, the theory of constructing optimal dynamical systems based on weighted residual presented by Wu & Sha is applied to three-dimensional Navier-Stokes equations, and the optimal dynamical system modeling equations are derived. Then the multiscale global optimization method based on coarse graining analysis is presented, by which a set of approximate global optimal bases is directly obtained from Navier-Stokes equations and the construction of optimal dynamical systems is realized. The optimal bases show good properties, such as showing the physical properties of complex flows and the turbulent vortex structures, being intrinsic to real physical problem and dynamical systems, and having scaling symmetry in mathematics, etc.. In conclusion, using fewer terms of optimal bases will approach the exact solutions of Navier-Stokes equations, and the dynamical systems based on them show the most optimal behavior.

A dynamic global and local combined particle swarm optimization algorithm

International Nuclear Information System (INIS)

Jiao Bin; Lian Zhigang; Chen Qunxian

2009-01-01

Particle swarm optimization (PSO) algorithm has been developing rapidly and many results have been reported. PSO algorithm has shown some important advantages by providing high speed of convergence in specific problems, but it has a tendency to get stuck in a near optimal solution and one may find it difficult to improve solution accuracy by fine tuning. This paper presents a dynamic global and local combined particle swarm optimization (DGLCPSO) algorithm to improve the performance of original PSO, in which all particles dynamically share the best information of the local particle, global particle and group particles. It is tested with a set of eight benchmark functions with different dimensions and compared with original PSO. Experimental results indicate that the DGLCPSO algorithm improves the search performance on the benchmark functions significantly, and shows the effectiveness of the algorithm to solve optimization problems.

Off-road vehicle dynamics analysis, modelling and optimization

CERN Document Server

Taghavifar, Hamid

2017-01-01

This book deals with the analysis of off-road vehicle dynamics from kinetics and kinematics perspectives and the performance of vehicle traversing over rough and irregular terrain. The authors consider the wheel performance, soil-tire interactions and their interface, tractive performance of the vehicle, ride comfort, stability over maneuvering, transient and steady state conditions of the vehicle traversing, modeling the aforementioned aspects and optimization from energetic and vehicle mobility perspectives. This book brings novel figures for the transient dynamics and original wheel terrain dynamics at on-the-go condition.

Optimal control landscape for the generation of unitary transformations with constrained dynamics

International Nuclear Information System (INIS)

Hsieh, Michael; Wu, Rebing; Rabitz, Herschel; Lidar, Daniel

2010-01-01

The reliable and precise generation of quantum unitary transformations is essential for the realization of a number of fundamental objectives, such as quantum control and quantum information processing. Prior work has explored the optimal control problem of generating such unitary transformations as a surface-optimization problem over the quantum control landscape, defined as a metric for realizing a desired unitary transformation as a function of the control variables. It was found that under the assumption of nondissipative and controllable dynamics, the landscape topology is trap free, which implies that any reasonable optimization heuristic should be able to identify globally optimal solutions. The present work is a control landscape analysis, which incorporates specific constraints in the Hamiltonian that correspond to certain dynamical symmetries in the underlying physical system. It is found that the presence of such symmetries does not destroy the trap-free topology. These findings expand the class of quantum dynamical systems on which control problems are intrinsically amenable to a solution by optimal control.

Optimization Techniques for Design Problems in Selected Areas in WSNs: A Tutorial.

Science.gov (United States)

Ibrahim, Ahmed; Alfa, Attahiru

2017-08-01

This paper is intended to serve as an overview of, and mostly a tutorial to illustrate, the optimization techniques used in several different key design aspects that have been considered in the literature of wireless sensor networks (WSNs). It targets the researchers who are new to the mathematical optimization tool, and wish to apply it to WSN design problems. We hence divide the paper into two main parts. One part is dedicated to introduce optimization theory and an overview on some of its techniques that could be helpful in design problem in WSNs. In the second part, we present a number of design aspects that we came across in the WSN literature in which mathematical optimization methods have been used in the design. For each design aspect, a key paper is selected, and for each we explain the formulation techniques and the solution methods implemented. We also provide in-depth analyses and assessments of the problem formulations, the corresponding solution techniques and experimental procedures in some of these papers. The analyses and assessments, which are provided in the form of comments, are meant to reflect the points that we believe should be taken into account when using optimization as a tool for design purposes.

Aerodynamic shape optimization for alleviating dynamic stall characteristics of helicopter rotor airfoil

Directory of Open Access Journals (Sweden)

Wang Qing

2015-04-01

Full Text Available In order to alleviate the dynamic stall effects in helicopter rotor, the sequential quadratic programming (SQP method is employed to optimize the characteristics of airfoil under dynamic stall conditions based on the SC1095 airfoil. The geometry of airfoil is parameterized by the class-shape-transformation (CST method, and the C-topology body-fitted mesh is then automatically generated around the airfoil by solving the Poisson equations. Based on the grid generation technology, the unsteady Reynolds-averaged Navier-Stokes (RANS equations are chosen as the governing equations for predicting airfoil flow field and the highly-efficient implicit scheme of lower–upper symmetric Gauss–Seidel (LU-SGS is adopted for temporal discretization. To capture the dynamic stall phenomenon of the rotor more accurately, the Spalart–Allmaras turbulence model is employed to close the RANS equations. The optimized airfoil with a larger leading edge radius and camber is obtained. The leading edge vortex and trailing edge separation of the optimized airfoil under unsteady conditions are obviously weakened, and the dynamic stall characteristics of optimized airfoil at different Mach numbers, reduced frequencies and angles of attack are also obviously improved compared with the baseline SC1095 airfoil. It is demonstrated that the optimized method is effective and the optimized airfoil is suitable as the helicopter rotor airfoil.

Dynamic ADMM for Real-time Optimal Power Flow: Preprint

Energy Technology Data Exchange (ETDEWEB)

Dall-Anese, Emiliano [National Renewable Energy Laboratory (NREL), Golden, CO (United States)

2018-02-23

This paper considers distribution networks featuring distributed energy resources (DERs), and develops a dynamic optimization method to maximize given operational objectives in real time while adhering to relevant network constraints. The design of the dynamic algorithm is based on suitable linearizations of the AC power flow equations, and it leverages the so-called alternating direction method of multipliers (ADMM). The steps of the ADMM, however, are suitably modified to accommodate appropriate measurements from the distribution network and the DERs. With the aid of these measurements, the resultant algorithm can enforce given operational constraints in spite of inaccuracies in the representation of the AC power flows, and it avoids ubiquitous metering to gather the state of non-controllable resources. Optimality and convergence of the propose algorithm are established in terms of tracking of the solution of a convex surrogate of the AC optimal power flow problem.

Optimization algorithm based on densification and dynamic canonical descent

Science.gov (United States)

Bousson, K.; Correia, S. D.

2006-07-01

Stochastic methods have gained some popularity in global optimization in that most of them do not assume the cost functions to be differentiable. They have capabilities to avoid being trapped by local optima, and may converge even faster than gradient-based optimization methods on some problems. The present paper proposes an optimization method, which reduces the search space by means of densification curves, coupled with the dynamic canonical descent algorithm. The performances of the new method are shown on several known problems classically used for testing optimization algorithms, and proved to outperform competitive algorithms such as simulated annealing and genetic algorithms.

Material saving by means of CWR technology using optimization techniques

Science.gov (United States)

Pérez, Iñaki; Ambrosio, Cristina

2017-10-01

Material saving is currently a must for the forging companies, as material costs sum up to 50% for parts made of steel and up to 90% in other materials like titanium. For long products, cross wedge rolling (CWR) technology can be used to obtain forging preforms with a suitable distribution of the material along its own axis. However, defining the correct preform dimensions is not an easy task and it could need an intensive trial-and-error campaign. To speed up the preform definition, it is necessary to apply optimization techniques on Finite Element Models (FEM) able to reproduce the material behaviour when being rolled. Meta-models Assisted Evolution Strategies (MAES), that combine evolutionary algorithms with Kriging meta-models, are implemented in FORGE® software and they allow reducing optimization computation costs in a relevant way. The paper shows the application of these optimization techniques to the definition of the right preform for a shaft from a vehicle of the agricultural sector. First, the current forging process, based on obtaining the forging preform by means of an open die forging operation, is showed. Then, the CWR preform optimization is developed by using the above mentioned optimization techniques. The objective is to reduce, as much as possible, the initial billet weight, so that a calculation of flash weight reduction due to the use of the proposed preform is stated. Finally, a simulation of CWR process for the defined preform is carried out to check that most common failures (necking, spirals,..) in CWR do not appear in this case.

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.

An overview of optimization of structures subjected to transient loads

International Nuclear Information System (INIS)

Kang, Byung Soo; Park, Gyung Jin

2005-01-01

Various aspects of structural optimization techniques under transient loads are extensively reviewed. The main themes of the paper are treatment of time dependent constraints, calculation of design sensitivity, and approximation. Each subject is reviewed with the corresponding papers that have been published since 1970s. The treatment of time dependent constraints in both the direct method and the transformation method is discussed. Two ways of calculating design sensitivity of a structure under transient loads are discussed-direct differentiation method and adjoint variable method. The approximation concept mainly focuses on response surface method in crashworthiness and local approximation with the intermediate variable. Especially, as an approximated optimization technique, equivalent static load method which takes advantage of the well-established static response optimization technique is introduced. And as an application area of dynamic response optimization technique, the structural optimization in flexible multibody dynamic system is reviewed in the viewpoint of the above three themes

Dynamic Programming Approach for Exact Decision Rule Optimization

KAUST Repository

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

2013-01-01

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

Advanced techniques in dynamic infrared imaging research and application for cancer patients

International Nuclear Information System (INIS)

Boggio, Esteban F.; Santa Cruz, Gustavo A.

2009-01-01

Infrared Imaging for biomedical applications is a non-invasive technique employed to visualize the distribution of infrared radiance coming from the subject under study, either in a static or a dynamic mode. The main difference is that while with the static method basal situations are studied, in the dynamic approach a sequence of thermograms, using thermal stimuli applied onto the patient are acquired, following the temperature evolution throughout the time. Since tumors possess abnormal metabolic activity, a structure and a vascular distribution essentially different from healthy tissue, and a lack of response to homeostatic signals, thermal stresses enhance even more their presence. For this reason, a completely non-invasive system, referred to as Enhancement and Stimulation System (ESS) was constructed, capable of imparting a cool or hot convective air flow onto the surface to examine and permitting to include in the study the time-course of the thermal stress application. In this work, the design of the Dynamic Infrared Imaging-ESS prototype, its characterization and optimization will be presented. In addition, examples of biomedical interest employing small animals will be shown as well. (author)

Novel optimization technique of isolated microgrid with hydrogen energy storage.

Science.gov (United States)

Beshr, Eman Hassan; Abdelghany, Hazem; Eteiba, Mahmoud

2018-01-01

This paper presents a novel optimization technique for energy management studies of an isolated microgrid. The system is supplied by various Distributed Energy Resources (DERs), Diesel Generator (DG), a Wind Turbine Generator (WTG), Photovoltaic (PV) arrays and supported by fuel cell/electrolyzer Hydrogen storage system for short term storage. Multi-objective optimization is used through non-dominated sorting genetic algorithm to suit the load requirements under the given constraints. A novel multi-objective flower pollination algorithm is utilized to check the results. The Pros and cons of the two optimization techniques are compared and evaluated. An isolated microgrid is modelled using MATLAB software package, dispatch of active/reactive power, optimal load flow analysis with slack bus selection are carried out to be able to minimize fuel cost and line losses under realistic constraints. The performance of the system is studied and analyzed during both summer and winter conditions and three case studies are presented for each condition. The modified IEEE 15 bus system is used to validate the proposed algorithm.

Novel optimization technique of isolated microgrid with hydrogen energy storage.

Directory of Open Access Journals (Sweden)

Eman Hassan Beshr

Full Text Available This paper presents a novel optimization technique for energy management studies of an isolated microgrid. The system is supplied by various Distributed Energy Resources (DERs, Diesel Generator (DG, a Wind Turbine Generator (WTG, Photovoltaic (PV arrays and supported by fuel cell/electrolyzer Hydrogen storage system for short term storage. Multi-objective optimization is used through non-dominated sorting genetic algorithm to suit the load requirements under the given constraints. A novel multi-objective flower pollination algorithm is utilized to check the results. The Pros and cons of the two optimization techniques are compared and evaluated. An isolated microgrid is modelled using MATLAB software package, dispatch of active/reactive power, optimal load flow analysis with slack bus selection are carried out to be able to minimize fuel cost and line losses under realistic constraints. The performance of the system is studied and analyzed during both summer and winter conditions and three case studies are presented for each condition. The modified IEEE 15 bus system is used to validate the proposed algorithm.

Energy-Aware Routing Optimization in Dynamic GMPLS Controlled Optical Networks

DEFF Research Database (Denmark)

Wang, Jiayuan; Ricciardi, Sergio; Fagertun, Anna Manolova

2012-01-01

In this paper, routing optimizations based on energy sources are proposed in dynamic GMPLS controlled optical networks. The influences of re-routing and load balancing factors on the algorithm are evaluated, with a focus on different re-routing thresholds. Results from dynamic network simulations...

A Dynamic Programming Solution for Energy-Optimal Video Playback on Mobile Devices

Directory of Open Access Journals (Sweden)

Minseok Song

2016-01-01

Full Text Available Due to the development of mobile technology and wide availability of smartphones, the Internet of Things (IoT starts to handle high volumes of video data to facilitate multimedia-based services, which requires energy-efficient video playback. In video playback, frames have to be decoded and rendered at high playback rate, increasing the computation cost on the CPU. To save the CPU power, dynamic voltage and frequency scaling (DVFS dynamically adjusts the operating voltage of the processor along with frequency, in which appropriate selection of frequency on power could achieve a balance between performance and power. We present a decoding model that allows buffering frames to let the CPU run at low frequency and then propose an algorithm that determines the CPU frequency needed to decode each frame in a video, with the aim of minimizing power consumption while meeting buffer size and deadline constraints, using a dynamic programming technique. We finally extend this algorithm to optimize CPU frequencies over a short sequence of frames, producing a practical method of reducing the energy required for video decoding. Experimental results show a system-wide reduction in energy of 27%, compared with a processor running at full speed.

Optimal transport of particle beams

International Nuclear Information System (INIS)

Allen, C.K.; Reiser, M.

1997-01-01

The transport and matching problem for a low energy transport system is approached from a control theoretical viewpoint. We develop a model for a beam transport and matching section based on a multistage control network. To this model we apply the principles of optimal control to formulate techniques aiding in the design of the transport and matching section. Both nonlinear programming and dynamic programming techniques are used in the optimization. These techniques are implemented in a computer-aided design program called SPOT. Examples are presented to demonstrate the procedure and outline the results. (orig.)

A Thermodynamic Library for Simulation and Optimization of Dynamic Processes

DEFF Research Database (Denmark)

Ritschel, Tobias Kasper Skovborg; Gaspar, Jozsef; Jørgensen, John Bagterp

2017-01-01

Process system tools, such as simulation and optimization of dynamic systems, are widely used in the process industries for development of operational strategies and control for process systems. These tools rely on thermodynamic models and many thermodynamic models have been developed for different...... compounds and mixtures. However, rigorous thermodynamic models are generally computationally intensive and not available as open-source libraries for process simulation and optimization. In this paper, we describe the application of a novel open-source rigorous thermodynamic library, ThermoLib, which...... is designed for dynamic simulation and optimization of vapor-liquid processes. ThermoLib is implemented in Matlab and C and uses cubic equations of state to compute vapor and liquid phase thermodynamic properties. The novelty of ThermoLib is that it provides analytical first and second order derivatives...

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

African Journals Online (AJOL)

It also results in better optimization performance than back-propagation neural network-based approach and data mining-based approach reported by the past researchers. Keywords: multiple responses, multiple regression, weighted dynamic signal-to-noise ratio, performance measure modelling, response function ...

An improved artificial physical optimization algorithm for dynamic dispatch of generators with valve-point effects and wind power

International Nuclear Information System (INIS)

Yuan, Xiaohui; Ji, Bin; Zhang, Shuangquan; Tian, Hao; Chen, Zhihuan

2014-01-01

Highlights: • Dynamic load economic dispatch with wind power (DLEDW) model is established. • Markov chains combined with scenario analysis method are used to predict wind power. • Chance constrained technique is used to simulate the impacts of wind forecast error. • Improved artificial physical optimization algorithm is proposed to solve DLEDW. • Heuristic search strategies are applied to handle the constraints of DLEDW. - Abstract: Wind power, a kind of promising renewable energy resource, has recently been getting more attractive because of various environmental and economic considerations. But the penetration of wind power with its fluctuation nature has made the operation of power system more intractable. To coordinate the reliability and operation cost, this paper established a stochastic model of dynamic load economic dispatch with wind integration (DLEDW). In this model, constraints such as ramping up/down capacity, prohibited operating zone are considered and effects of valve-point are taken into account. Markov chains combined with scenario analysis method is used to generate predictive values of wind power and chance constrained programming (CCP) is applied to simulate the impacts of wind power fluctuation on system operation. An improved artificial physical optimization algorithm is presented to solve the DLEDW problem. Heuristic strategies based on the priority list and stochastic simulation techniques are proposed to handle the constraints. In addition, a local chaotic mutation strategy is applied to overcome the disadvantage of premature convergence of artificial physical optimization algorithm. Two test systems with and without wind power integration are used to verify the feasibility and effectiveness of the proposed method and the results are compared with those of gravitational search algorithm, particle swarm optimization and standard artificial physical optimization. The simulation results demonstrate that the proposed method has a

Application of Advanced Particle Swarm Optimization Techniques to Wind-thermal Coordination

DEFF Research Database (Denmark)

Singh, Sri Niwas; Østergaard, Jacob; Yadagiri, J.

2009-01-01

wind-thermal coordination algorithm is necessary to determine the optimal proportion of wind and thermal generator capacity that can be integrated into the system. In this paper, four versions of Particle Swarm Optimization (PSO) techniques are proposed for solving wind-thermal coordination problem...

Optimal foraging and predator-prey dynamics III

Czech Academy of Sciences Publication Activity Database

Křivan, Vlastimil; Eisner, Jan

2003-01-01

Roč. 63, - (2003), s. 269-279 ISSN 0040-5809 R&D Projects: GA ČR GA201/03/0091; GA MŠk LA 101 Institutional research plan: CEZ:AV0Z5007907 Keywords : Optimal foraging theory * adaptive behavior * predator-prec population dynamics Subject RIV: EH - Ecology, Behaviour Impact factor: 2.261, year: 2003

Planning of the steam generators for nuclear applications using optimization techniques

International Nuclear Information System (INIS)

Sakai, M.; Silvares, O.M.

1978-01-01

Procedure for the maximization of the net power of a nuclear power plant through the application of the optimal control theory of dynamic systems is presented. The problem is formulated in the steam generator which links the primary and the secondary cycle. The solution of the steam generator, optimization problem is obtained simultaneously with the heat balance in both primary and secondary cycle, through an iterative process. By this way the optimal parameters are obtained for the steam generator, the vapor and the cooling gas cycle [pt

THD Minimization from H-Bridge Cascaded Multilevel Inverter Using Particle Swarm Optimization Technique

Directory of Open Access Journals (Sweden)

MUDASIR AHMED MEMON

2017-01-01

Full Text Available In this paper, PSO (Particle Swarm Optimization based technique is proposed to derive optimized switching angles that minimizes the THD (Total Harmonic Distortion and reduces the effect of selected low order non-triple harmonics from the output of the multilevel inverter. Conventional harmonic elimination techniques have plenty of limitations, and other heuristic techniques also not provide the satisfactory results. In this paper, single phase symmetrical cascaded H-Bridge 11-Level multilevel inverter is considered, and proposed algorithm is utilized to obtain the optimized switching angles that reduced the effect of 5th, 7th, 11th and 13th non-triplen harmonics from the output voltage of the multilevel inverter. A simulation result indicates that this technique outperforms other methods in terms of minimizing THD and provides high-quality output voltage waveform.

THD minimization from h-bridge cascaded multilevel inverter using particle swarm optimization technique

International Nuclear Information System (INIS)

Memon, M.A.; Memon, S.; Khan, S.

2017-01-01

In this paper, PSO (Particle Swarm Optimization) based technique is proposed to derive optimized switching angles that minimizes the THD (Total Harmonic Distortion) and reduces the effect of selected low order non-triple harmonics from the output of the multilevel inverter. Conventional harmonic elimination techniques have plenty of limitations, and other heuristic techniques also not provide the satisfactory results. In this paper, single phase symmetrical cascaded H-Bridge 11-Level multilevel inverter is considered, and proposed algorithm is utilized to obtain the optimized switching angles that reduced the effect of 5th, 7th, 11th and 13th non-triplen harmonics from the output voltage of the multilevel inverter. A simulation result indicates that this technique outperforms other methods in terms of minimizing THD and provides high-quality output voltage waveform. (author)

Confronting dynamics and uncertainty in optimal decision making for conservation

Science.gov (United States)

Williams, Byron K.; Johnson, Fred A.

2013-06-01

The effectiveness of conservation efforts ultimately depends on the recognition that decision making, and the systems that it is designed to affect, are inherently dynamic and characterized by multiple sources of uncertainty. To cope with these challenges, conservation planners are increasingly turning to the tools of decision analysis, especially dynamic optimization methods. Here we provide a general framework for optimal, dynamic conservation and then explore its capacity for coping with various sources and degrees of uncertainty. In broadest terms, the dynamic optimization problem in conservation is choosing among a set of decision options at periodic intervals so as to maximize some conservation objective over the planning horizon. Planners must account for immediate objective returns, as well as the effect of current decisions on future resource conditions and, thus, on future decisions. Undermining the effectiveness of such a planning process are uncertainties concerning extant resource conditions (partial observability), the immediate consequences of decision choices (partial controllability), the outcomes of uncontrolled, environmental drivers (environmental variation), and the processes structuring resource dynamics (structural uncertainty). Where outcomes from these sources of uncertainty can be described in terms of probability distributions, a focus on maximizing the expected objective return, while taking state-specific actions, is an effective mechanism for coping with uncertainty. When such probability distributions are unavailable or deemed unreliable, a focus on maximizing robustness is likely to be the preferred approach. Here the idea is to choose an action (or state-dependent policy) that achieves at least some minimum level of performance regardless of the (uncertain) outcomes. We provide some examples of how the dynamic optimization problem can be framed for problems involving management of habitat for an imperiled species, conservation of a

Confronting dynamics and uncertainty in optimal decision making for conservation

Science.gov (United States)

Williams, Byron K.; Johnson, Fred A.

2013-01-01

The effectiveness of conservation efforts ultimately depends on the recognition that decision making, and the systems that it is designed to affect, are inherently dynamic and characterized by multiple sources of uncertainty. To cope with these challenges, conservation planners are increasingly turning to the tools of decision analysis, especially dynamic optimization methods. Here we provide a general framework for optimal, dynamic conservation and then explore its capacity for coping with various sources and degrees of uncertainty. In broadest terms, the dynamic optimization problem in conservation is choosing among a set of decision options at periodic intervals so as to maximize some conservation objective over the planning horizon. Planners must account for immediate objective returns, as well as the effect of current decisions on future resource conditions and, thus, on future decisions. Undermining the effectiveness of such a planning process are uncertainties concerning extant resource conditions (partial observability), the immediate consequences of decision choices (partial controllability), the outcomes of uncontrolled, environmental drivers (environmental variation), and the processes structuring resource dynamics (structural uncertainty). Where outcomes from these sources of uncertainty can be described in terms of probability distributions, a focus on maximizing the expected objective return, while taking state-specific actions, is an effective mechanism for coping with uncertainty. When such probability distributions are unavailable or deemed unreliable, a focus on maximizing robustness is likely to be the preferred approach. Here the idea is to choose an action (or state-dependent policy) that achieves at least some minimum level of performance regardless of the (uncertain) outcomes. We provide some examples of how the dynamic optimization problem can be framed for problems involving management of habitat for an imperiled species, conservation of a

Confronting dynamics and uncertainty in optimal decision making for conservation

International Nuclear Information System (INIS)

Williams, Byron K; Johnson, Fred A

2013-01-01

The effectiveness of conservation efforts ultimately depends on the recognition that decision making, and the systems that it is designed to affect, are inherently dynamic and characterized by multiple sources of uncertainty. To cope with these challenges, conservation planners are increasingly turning to the tools of decision analysis, especially dynamic optimization methods. Here we provide a general framework for optimal, dynamic conservation and then explore its capacity for coping with various sources and degrees of uncertainty. In broadest terms, the dynamic optimization problem in conservation is choosing among a set of decision options at periodic intervals so as to maximize some conservation objective over the planning horizon. Planners must account for immediate objective returns, as well as the effect of current decisions on future resource conditions and, thus, on future decisions. Undermining the effectiveness of such a planning process are uncertainties concerning extant resource conditions (partial observability), the immediate consequences of decision choices (partial controllability), the outcomes of uncontrolled, environmental drivers (environmental variation), and the processes structuring resource dynamics (structural uncertainty). Where outcomes from these sources of uncertainty can be described in terms of probability distributions, a focus on maximizing the expected objective return, while taking state-specific actions, is an effective mechanism for coping with uncertainty. When such probability distributions are unavailable or deemed unreliable, a focus on maximizing robustness is likely to be the preferred approach. Here the idea is to choose an action (or state-dependent policy) that achieves at least some minimum level of performance regardless of the (uncertain) outcomes. We provide some examples of how the dynamic optimization problem can be framed for problems involving management of habitat for an imperiled species, conservation of a

Nonlinear Dynamic in an Ecological System with Impulsive Effect and Optimal Foraging

Directory of Open Access Journals (Sweden)

Min Zhao

2014-01-01

Full Text Available The population dynamics of a three-species ecological system with impulsive effect are investigated. Using the theories of impulsive equations and small-amplitude perturbation scales, the conditions for the system to be permanent when the number of predators released is less than some critical value can be obtained. Furthermore, because the predator in the system follows the predictions of optimal foraging theory, it follows that optimal foraging promotes species coexistence. In particular, the less beneficial prey can support the predator alone when the more beneficial prey goes extinct. Moreover, the influences of the impulsive effect and optimal foraging on inherent oscillations are studied using simulation, which reveals rich dynamic behaviors such as period-halving bifurcations, a chaotic band, a periodic window, and chaotic crises. In addition, the largest Lyapunov exponent and the power spectra of the strange attractor, which can help analyze the chaotic dynamic behavior of the model, are investigated. This information will be useful for studying the dynamic complexity of ecosystems.

Optimal time-domain technique for pulse width modulation in power electronics

Directory of Open Access Journals (Sweden)

I. Mayergoyz

2018-05-01

Full Text Available Optimal time-domain technique for pulse width modulation is presented. It is based on exact and explicit analytical solutions for inverter circuits, obtained for any sequence of input voltage rectangular pulses. Two optimal criteria are discussed and illustrated by numerical examples.

Solar photovoltaic power forecasting using optimized modified extreme learning machine technique

Directory of Open Access Journals (Sweden)

Manoja Kumar Behera

2018-06-01

Full Text Available Prediction of photovoltaic power is a significant research area using different forecasting techniques mitigating the effects of the uncertainty of the photovoltaic generation. Increasingly high penetration level of photovoltaic (PV generation arises in smart grid and microgrid concept. Solar source is irregular in nature as a result PV power is intermittent and is highly dependent on irradiance, temperature level and other atmospheric parameters. Large scale photovoltaic generation and penetration to the conventional power system introduces the significant challenges to microgrid a smart grid energy management. It is very critical to do exact forecasting of solar power/irradiance in order to secure the economic operation of the microgrid and smart grid. In this paper an extreme learning machine (ELM technique is used for PV power forecasting of a real time model whose location is given in the Table 1. Here the model is associated with the incremental conductance (IC maximum power point tracking (MPPT technique that is based on proportional integral (PI controller which is simulated in MATLAB/SIMULINK software. To train single layer feed-forward network (SLFN, ELM algorithm is implemented whose weights are updated by different particle swarm optimization (PSO techniques and their performance are compared with existing models like back propagation (BP forecasting model. Keywords: PV array, Extreme learning machine, Maximum power point tracking, Particle swarm optimization, Craziness particle swarm optimization, Accelerate particle swarm optimization, Single layer feed-forward network

Optimal interdependence enhances the dynamical robustness of complex systems

Science.gov (United States)

Singh, Rishu Kumar; Sinha, Sitabhra

2017-08-01

Although interdependent systems have usually been associated with increased fragility, we show that strengthening the interdependence between dynamical processes on different networks can make them more likely to survive over long times. By coupling the dynamics of networks that in isolation exhibit catastrophic collapse with extinction of nodal activity, we demonstrate system-wide persistence of activity for an optimal range of interdependence between the networks. This is related to the appearance of attractors of the global dynamics comprising disjoint sets ("islands") of stable activity.

A fermionic molecular dynamics technique to model nuclear matter

International Nuclear Information System (INIS)

Vantournhout, K.; Jachowicz, N.; Ryckebusch, J.

2009-01-01

Full text: At sub-nuclear densities of about 10 14 g/cm 3 , nuclear matter arranges itself in a variety of complex shapes. This can be the case in the crust of neutron stars and in core-collapse supernovae. These slab like and rod like structures, designated as nuclear pasta, have been modelled with classical molecular dynamics techniques. We present a technique, based on fermionic molecular dynamics, to model nuclear matter at sub-nuclear densities in a semi classical framework. The dynamical evolution of an antisymmetric ground state is described making the assumption of periodic boundary conditions. Adding the concepts of antisymmetry, spin and probability distributions to classical molecular dynamics, brings the dynamical description of nuclear matter to a quantum mechanical level. Applications of this model vary from investigation of macroscopic observables and the equation of state to the study of fundamental interactions on the microscopic structure of the matter. (author)

Application of hanging drop technique to optimize human IgG formulations.

Science.gov (United States)

Li, Guohua; Kasha, Purna C; Late, Sameer; Banga, Ajay K

2010-01-01

The purpose of this work is to assess the hanging drop technique in screening excipients to develop optimal formulations for human immunoglobulin G (IgG). A microdrop of human IgG and test solution hanging from a cover slide and undergoing vapour diffusion was monitored by a stereomicroscope. Aqueous solutions of IgG in the presence of different pH, salt concentrations and excipients were prepared and characterized. Low concentration of either sodium/potassium phosphate or McIlvaine buffer favoured the solubility of IgG. Addition of sucrose favoured the stability of this antibody while addition of NaCl caused more aggregation. Antimicrobial preservatives were also screened and a complex effect at different buffer conditions was observed. Dynamic light scattering, differential scanning calorimetry and size exclusion chromatography studies were performed to further validate the results. In conclusion, hanging drop is a very easy and effective approach to screen protein formulations in the early stage of formulation development.

Genetic algorithm optimization for dynamic construction site layout planning

Directory of Open Access Journals (Sweden)

Farmakis Panagiotis M.

2018-02-01

Full Text Available The dynamic construction site layout planning (DCSLP problem refers to the efficient placement and relocation of temporary construction facilities within a dynamically changing construction site environment considering the characteristics of facilities and work interrelationships, the shape and topography of the construction site, and the time-varying project needs. A multi-objective dynamic optimization model is developed for this problem that considers construction and relocation costs of facilities, transportation costs of resources moving from one facility to another or to workplaces, as well as safety and environmental considerations resulting from facilities’ operations and interconnections. The latter considerations are taken into account in the form of preferences or constraints regarding the proximity or remoteness of particular facilities to other facilities or work areas. The analysis of multiple project phases and the dynamic facility relocation from phase to phase highly increases the problem size, which, even in its static form, falls within the NP (for Nondeterministic Polynomial time- hard class of combinatorial optimization problems. For this reason, a genetic algorithm has been implemented for the solution due to its capability to robustly search within a large solution space. Several case studies and operational scenarios have been implemented through the Palisade’s Evolver software for model testing and evaluation. The results indi­cate satisfactory model response to time-varying input data in terms of solution quality and computation time. The model can provide decision support to site managers, allowing them to examine alternative scenarios and fine-tune optimal solutions according to their experience by introducing desirable preferences or constraints in the decision process.

Review of dynamic optimization methods in renewable natural resource management

Science.gov (United States)

Williams, B.K.

1989-01-01

In recent years, the applications of dynamic optimization procedures in natural resource management have proliferated. A systematic review of these applications is given in terms of a number of optimization methodologies and natural resource systems. The applicability of the methods to renewable natural resource systems are compared in terms of system complexity, system size, and precision of the optimal solutions. Recommendations are made concerning the appropriate methods for certain kinds of biological resource problems.

Model-based dynamic control and optimization of gas networks

Energy Technology Data Exchange (ETDEWEB)

Hofsten, Kai

2001-07-01

This work contributes to the research on control, optimization and simulation of gas transmission systems to support the dispatch personnel at gas control centres for the decision makings in the daily operation of the natural gas transportation systems. Different control and optimization strategies have been studied. The focus is on the operation of long distance natural gas transportation systems. Stationary optimization in conjunction with linear model predictive control using state space models is proposed for supply security, the control of quality parameters and minimization of transportation costs for networks offering transportation services. The result from the stationary optimization together with a reformulation of a simplified fluid flow model formulates a linear dynamic optimization model. This model is used in a finite time control and state constrained linear model predictive controller. The deviation from the control and the state reference determined from the stationary optimization is penalized quadratically. Because of the time varying status of infrastructure, the control space is also generally time varying. When the average load is expected to change considerably, a new stationary optimization is performed, giving a new state and control reference together with a new dynamic model that is used for both optimization and state estimation. Another proposed control strategy is a control and output constrained nonlinear model predictive controller for the operation of gas transmission systems. Here, the objective is also the security of the supply, quality control and minimization of transportation costs. An output vector is defined, which together with a control vector are both penalized quadratically from their respective references in the objective function. The nonlinear model predictive controller can be combined with a stationary optimization. At each sampling instant, a non convex nonlinear programming problem is solved giving a local minimum

Optimized molecular reconstruction procedure combining hybrid reverse Monte Carlo and molecular dynamics

Energy Technology Data Exchange (ETDEWEB)

Bousige, Colin; Boţan, Alexandru; Coasne, Benoît, E-mail: coasne@mit.edu [Department of Civil and Environmental Engineering, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, Massachusetts 02139 (United States); UMI 3466 CNRS-MIT, 77 Massachusetts Avenue, Cambridge, Massachusetts 02139 (United States); Ulm, Franz-Josef [Department of Civil and Environmental Engineering, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, Massachusetts 02139 (United States); Pellenq, Roland J.-M. [Department of Civil and Environmental Engineering, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, Massachusetts 02139 (United States); UMI 3466 CNRS-MIT, 77 Massachusetts Avenue, Cambridge, Massachusetts 02139 (United States); CINaM, CNRS/Aix Marseille Université, Campus de Luminy, 13288 Marseille Cedex 09 (France)

2015-03-21

We report an efficient atom-scale reconstruction method that consists of combining the Hybrid Reverse Monte Carlo algorithm (HRMC) with Molecular Dynamics (MD) in the framework of a simulated annealing technique. In the spirit of the experimentally constrained molecular relaxation technique [Biswas et al., Phys. Rev. B 69, 195207 (2004)], this modified procedure offers a refined strategy in the field of reconstruction techniques, with special interest for heterogeneous and disordered solids such as amorphous porous materials. While the HRMC method generates physical structures, thanks to the use of energy penalties, the combination with MD makes the method at least one order of magnitude faster than HRMC simulations to obtain structures of similar quality. Furthermore, in order to ensure the transferability of this technique, we provide rational arguments to select the various input parameters such as the relative weight ω of the energy penalty with respect to the structure optimization. By applying the method to disordered porous carbons, we show that adsorption properties provide data to test the global texture of the reconstructed sample but are only weakly sensitive to the presence of defects. In contrast, the vibrational properties such as the phonon density of states are found to be very sensitive to the local structure of the sample.

Optimizing the dynamic response of the H.B. Robinson nuclear plant using multiobjective particle swarm optimization

International Nuclear Information System (INIS)

Elsays, Mostafa A.; Naguib Aly, M.; Badawi, Alya A.

2009-01-01

In this paper, the Particle Swarm Optimization (PSO) algorithm is modified to deal with Multiobjective Optimization Problems (MOPs). A mathematical model for predicting the dynamic response of the H. B. Robinson nuclear power plant, which represents an Initial Value Problem (IVP) of Ordinary Differential Equations (ODEs), is solved using Runge-Kutta formula. The resulted data values are represented as a system of nonlinear algebraic equations by interpolation schemes for data fitting. This system of fitted nonlinear algebraic equations represents a nonlinear multiobjective optimization problem. A Multiobjective Particle Swarm Optimizer (MOPSO) which is based on the Pareto optimality concept is developed and applied to maximize the above mentioned problem. Results show that MOPSO efficiently cope with the problem and finds multiple Pareto optimal solutions. (orig.)

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

Improving the Dynamic Characteristics of Body-in-White Structure Using Structural Optimization

Directory of Open Access Journals (Sweden)

Aizzat S. Yahaya Rashid

2014-01-01

Full Text Available The dynamic behavior of a body-in-white (BIW structure has significant influence on the noise, vibration, and harshness (NVH and crashworthiness of a car. Therefore, by improving the dynamic characteristics of BIW, problems and failures associated with resonance and fatigue can be prevented. The design objectives attempt to improve the existing torsion and bending modes by using structural optimization subjected to dynamic load without compromising other factors such as mass and stiffness of the structure. The natural frequency of the design was modified by identifying and reinforcing the structure at critical locations. These crucial points are first identified by topology optimization using mass and natural frequencies as the design variables. The individual components obtained from the analysis go through a size optimization step to find their target thickness of the structure. The thickness of affected regions of the components will be modified according to the analysis. The results of both optimization steps suggest several design modifications to achieve the target vibration specifications without compromising the stiffness of the structure. A method of combining both optimization approaches is proposed to improve the design modification process.

New technique of identifying the hierarchy of dynamic domains in proteins using a method of molecular dynamics simulations

Directory of Open Access Journals (Sweden)

Yesylevskyy S. O.

2010-04-01

Full Text Available Aim. Despite a large number of existing domain identification techniques there is no universally accepted method, which identifies the hierarchy of dynamic domains using the data of molecular dynamics (MD simulations. The goal of this work is to develop such technique. Methods. The dynamic domains are identified by eliminating systematic motions from MD trajectories recursively in a model-free manner. Results. The technique called the Hierarchical Domain-Wise Alignment (HDWA to identify hierarchically organized dynamic domains in proteins using the MD trajectories has been developed. Conclusion. A new method of domain identification in proteins is proposed

Methodology for Designing and Developing a New Ultra-Wideband Antenna Based on Bio-Inspired Optimization Techniques

Science.gov (United States)

2017-11-01

on Bio -Inspired Optimization Techniques by Canh Ly, Nghia Tran, and Ozlem Kilic Approved for public release; distribution is...Research Laboratory Methodology for Designing and Developing a New Ultra-Wideband Antenna Based on Bio -Inspired Optimization Techniques by...SUBTITLE Methodology for Designing and Developing a New Ultra-Wideband Antenna Based on Bio -Inspired Optimization Techniques 5a. CONTRACT NUMBER

Optimal Dynamics of Intermittent Water Supply

Science.gov (United States)

Lieb, Anna; Wilkening, Jon; Rycroft, Chris

2014-11-01

In many urban areas of the developing world, piped water is supplied only intermittently, as valves direct water to different parts of the water distribution system at different times. The flow is transient, and may transition between free-surface and pressurized, resulting in complex dynamical features with important consequences for water suppliers and users. These consequences include degradation of distribution system components, compromised water quality, and inequitable water availability. The goal of this work is to model the important dynamics and identify operating conditions that mitigate certain negative effects of intermittent water supply. Specifically, we will look at valve parameters occurring as boundary conditions in a network model of transient, transition flow through closed pipes. Optimization will be used to find boundary values to minimize pressure gradients and ensure equitable water availability.

Optimal Acceleration-Velocity-Bounded Trajectory Planning in Dynamic Crowd Simulation

Directory of Open Access Journals (Sweden)

Fu Yue-wen

2014-01-01

Full Text Available Creating complex and realistic crowd behaviors, such as pedestrian navigation behavior with dynamic obstacles, is a difficult and time consuming task. In this paper, we study one special type of crowd which is composed of urgent individuals, normal individuals, and normal groups. We use three steps to construct the crowd simulation in dynamic environment. The first one is that the urgent individuals move forward along a given path around dynamic obstacles and other crowd members. An optimal acceleration-velocity-bounded trajectory planning method is utilized to model their behaviors, which ensures that the durations of the generated trajectories are minimal and the urgent individuals are collision-free with dynamic obstacles (e.g., dynamic vehicles. In the second step, a pushing model is adopted to simulate the interactions between urgent members and normal ones, which ensures that the computational cost of the optimal trajectory planning is acceptable. The third step is obligated to imitate the interactions among normal members using collision avoidance behavior and flocking behavior. Various simulation results demonstrate that these three steps give realistic crowd phenomenon just like the real world.

Dynamic Portfolio Optimization with Transaction Costs and State-Dependent Drift

DEFF Research Database (Denmark)

Palczewski, Jan; Poulsen, Rolf; Schenk-Hoppe, Klaus Reiner

2015-01-01

The problem of dynamic portfolio choice with transaction costs is often addressed by constructing a Markov Chain approximation of the continuous time price processes. Using this approximation, we present an efficient numerical method to determine optimal portfolio strategies under time- and state......-dependent drift and proportional transaction costs. This scenario arises when investors have behavioral biases or the actual drift is unknown and needs to be estimated. Our numerical method solves dynamic optimal portfolio problems with an exponential utility function for time-horizons of up to 40 years....... It is applied to measure the value of information and the loss from transaction costs using the indifference principle....

Focusing light through dynamical samples using fast continuous wavefront optimization.

Science.gov (United States)

Blochet, B; Bourdieu, L; Gigan, S

2017-12-01

We describe a fast continuous optimization wavefront shaping system able to focus light through dynamic scattering media. A micro-electro-mechanical system-based spatial light modulator, a fast photodetector, and field programmable gate array electronics are combined to implement a continuous optimization of a wavefront with a single-mode optimization rate of 4.1 kHz. The system performances are demonstrated by focusing light through colloidal solutions of TiO 2 particles in glycerol with tunable temporal stability.

Optimization of rotor blades for combined structural, dynamic, and aerodynamic properties

Science.gov (United States)

He, Cheng-Jian; Peters, David A.

1990-01-01

Optimal helicopter blade design with computer-based mathematical programming has received more and more attention in recent years. Most of the research has focused on optimum dynamic characteristics of rotor blades to reduce vehicle vibration. There is also work on optimization of aerodynamic performance and on composite structural design. This research has greatly increased our understanding of helicopter optimum design in each of these aspects. Helicopter design is an inherently multidisciplinary process involving strong interactions among various disciplines which can appropriately include aerodynamics; dynamics, both flight dynamics and structural dynamics; aeroelasticity: vibrations and stability; and even acoustics. Therefore, the helicopter design process must satisfy manifold requirements related to the aforementioned diverse disciplines. In our present work, we attempt to combine several of these important effects in a unified manner. First, we design a blade with optimum aerodynamic performance by proper layout of blade planform and spanwise twist. Second, the blade is designed to have natural frequencies that are placed away from integer multiples of the rotor speed for a good dynamic characteristics. Third, the structure is made as light as possible with sufficient rotational inertia to allow for autorotational landing, with safe stress margins and flight fatigue life at each cross-section, and with aeroelastical stability and low vibrations. Finally, a unified optimization refines the solution.

Tuning of PID controller using optimization techniques for a MIMO process

Science.gov (United States)

Thulasi dharan, S.; Kavyarasan, K.; Bagyaveereswaran, V.

2017-11-01

In this paper, two processes were considered one is Quadruple tank process and the other is CSTR (Continuous Stirred Tank Reactor) process. These are majorly used in many industrial applications for various domains, especially, CSTR in chemical plants.At first mathematical model of both the process is to be done followed by linearization of the system due to MIMO process and controllers are the major part to control the whole process to our desired point as per the applications so the tuning of the controller plays a major role among the whole process. For tuning of parameters we use two optimizations techniques like Particle Swarm Optimization, Genetic Algorithm. The above techniques are majorly used in different applications to obtain which gives the best among all, we use these techniques to obtain the best tuned values among many. Finally, we will compare the performance of the each process with both the techniques.

A dynamic inertia weight particle swarm optimization algorithm

International Nuclear Information System (INIS)

Jiao Bin; Lian Zhigang; Gu Xingsheng

2008-01-01

Particle swarm optimization (PSO) algorithm has been developing rapidly and has been applied widely since it was introduced, as it is easily understood and realized. This paper presents an improved particle swarm optimization algorithm (IPSO) to improve the performance of standard PSO, which uses the dynamic inertia weight that decreases according to iterative generation increasing. It is tested with a set of 6 benchmark functions with 30, 50 and 150 different dimensions and compared with standard PSO. Experimental results indicate that the IPSO improves the search performance on the benchmark functions significantly

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

An enhanced particle swarm optimization for dynamic economic dispatch problem considering valve-point loading

Energy Technology Data Exchange (ETDEWEB)

Sriyanyong, P. [King Mongkut' s Univ. of Technology, Bangkok (Thailand). Dept. of Teacher Training in Electrical Engineering

2008-07-01

This paper described the use of an enhanced particle swarm optimization (PSO) model to address the problem of dynamic economic dispatch (DED). A modified heuristic search method was incorporated into the PSO model. Both smooth and non-smooth cost functions were considered. The enhanced PSO model not only utilized the basic PSO algorithm in order to seek the optimal solution for the DED problem, but it also used a modified heuristic method to deal with constraints and increase the possibility of finding a feasible solution. In order to validate the enhanced PSO model, it was used and tested on 10-unit systems considering both smooth and non-smooth cost functions characteristics. The experimental results were also compared to other methods. The proposed technique was found to be better than other approaches. The enhanced PSO model outperformed others with respect to quality, stability and reliability. 23 refs., 1 tab., 8 figs.

Loading pattern optimization by multi-objective simulated annealing with screening technique

International Nuclear Information System (INIS)

Tong, K. P.; Hyun, C. L.; Hyung, K. J.; Chang, H. K.

2006-01-01

This paper presents a new multi-objective function which is made up of the main objective term as well as penalty terms related to the constraints. All the terms are represented in the same functional form and the coefficient of each term is normalized so that each term has equal weighting in the subsequent simulated annealing optimization calculations. The screening technique introduced in the previous work is also adopted in order to save computer time in 3-D neutronics evaluation of trial loading patterns. For numerical test of the new multi-objective function in the loading pattern optimization, the optimum loading patterns for the initial and the cycle 7 reload PWR core of Yonggwang Unit 4 are calculated by the simulated annealing algorithm with screening technique. A total of 10 optimum loading patterns are obtained for the initial core through 10 independent simulated annealing optimization runs. For the cycle 7 reload core one optimum loading pattern has been obtained from a single simulated annealing optimization run. More SA optimization runs will be conducted to optimum loading patterns for the cycle 7 reload core and results will be presented in the further work. (authors)

On Revenue-Optimal Dynamic Auctions for Bidders with Interdependent Values

Science.gov (United States)

Constantin, Florin; Parkes, David C.

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

Optimal dynamic voltage scaling for wireless sensor nodes with real-time constraints

Science.gov (United States)

Cassandras, Christos G.; Zhuang, Shixin

2005-11-01

Sensors are increasingly embedded in manufacturing systems and wirelessly networked to monitor and manage operations ranging from process and inventory control to tracking equipment and even post-manufacturing product monitoring. In building such sensor networks, a critical issue is the limited and hard to replenish energy in the devices involved. Dynamic voltage scaling is a technique that controls the operating voltage of a processor to provide desired performance while conserving energy and prolonging the overall network's lifetime. We consider such power-limited devices processing time-critical tasks which are non-preemptive, aperiodic and have uncertain arrival times. We treat voltage scaling as a dynamic optimization problem whose objective is to minimize energy consumption subject to hard or soft real-time execution constraints. In the case of hard constraints, we build on prior work (which engages a voltage scaling controller at task completion times) by developing an intra-task controller that acts at all arrival times of incoming tasks. We show that this optimization problem can be decomposed into two simpler ones whose solution leads to an algorithm that does not actually require solving any nonlinear programming problems. In the case of soft constraints, this decomposition must be partly relaxed, but it still leads to a scalable (linear in the number of tasks) algorithm. Simulation results are provided to illustrate performance improvements in systems with intra-task controllers compared to uncontrolled systems or those using inter-task control.

Emerging Dynamic Design Techniques for Mechanical and ...

Indian Academy of Sciences (India)

Emerging Dynamic Design Techniques for Mechanical ... through this school to bring about an awareness of the state-of-art of the software and ... those mentioned above, cannot be ensured on the basis of approaches involving numerical.

Optimization Techniques for 3D Graphics Deployment on Mobile Devices

Science.gov (United States)

Koskela, Timo; Vatjus-Anttila, Jarkko

2015-03-01

3D Internet technologies are becoming essential enablers in many application areas including games, education, collaboration, navigation and social networking. The use of 3D Internet applications with mobile devices provides location-independent access and richer use context, but also performance issues. Therefore, one of the important challenges facing 3D Internet applications is the deployment of 3D graphics on mobile devices. In this article, we present an extensive survey on optimization techniques for 3D graphics deployment on mobile devices and qualitatively analyze the applicability of each technique from the standpoints of visual quality, performance and energy consumption. The analysis focuses on optimization techniques related to data-driven 3D graphics deployment, because it supports off-line use, multi-user interaction, user-created 3D graphics and creation of arbitrary 3D graphics. The outcome of the analysis facilitates the development and deployment of 3D Internet applications on mobile devices and provides guidelines for future research.

Optimal Passive Dynamics for Physical Interaction: Catching a Mass

Directory of Open Access Journals (Sweden)

Kevin Kemper

2013-05-01

Full Text Available For manipulation tasks in uncertain environments, intentionally designed series impedance in mechanical systems can provide significant benefits that cannot be achieved in software. Traditionally, the design of actuated systems revolves around sizing torques, speeds, and control strategies without considering the system’s passive dynamics. However, the passive dynamics of the mechanical system, including inertia, stiffness, and damping along with other parameters such as torque and stroke limits often impose performance limitations that cannot be overcome with software control. In this paper, we develop relationships between an actuator’s passive dynamics and the resulting performance for the purpose of better understanding how to tune the passive dynamics for catching an unexpected object. We use a mathematically optimal controller subject to force limitations to stop the incoming object without breaking contact and bouncing. The use of an optimal controller is important so that our results directly reflect the physical system’s performance. We analytically calculate the maximum velocity that can be caught by a realistic actuator with limitations such as force and stroke limits. The results show that in order to maximize the velocity of an object that can be caught without exceeding the actuator’s torque and stroke limits, a soft spring along with a strong damper will be desired.

Dynamic Programming Approach for Exact Decision Rule Optimization

KAUST Repository

Amin, Talha

2013-01-01

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

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.

Rovibrational controlled-NOT gates using optimized stimulated Raman adiabatic passage techniques and optimal control theory

International Nuclear Information System (INIS)

Sugny, D.; Bomble, L.; Ribeyre, T.; Dulieu, O.; Desouter-Lecomte, M.

2009-01-01

Implementation of quantum controlled-NOT (CNOT) gates in realistic molecular systems is studied using stimulated Raman adiabatic passage (STIRAP) techniques optimized in the time domain by genetic algorithms or coupled with optimal control theory. In the first case, with an adiabatic solution (a series of STIRAP processes) as starting point, we optimize in the time domain different parameters of the pulses to obtain a high fidelity in two realistic cases under consideration. A two-qubit CNOT gate constructed from different assignments in rovibrational states is considered in diatomic (NaCs) or polyatomic (SCCl 2 ) molecules. The difficulty of encoding logical states in pure rotational states with STIRAP processes is illustrated. In such circumstances, the gate can be implemented by optimal control theory and the STIRAP sequence can then be used as an interesting trial field. We discuss the relative merits of the two methods for rovibrational computing (structure of the control field, duration of the control, and efficiency of the optimization).

Dynamic optimization and robust explicit model predictive control of hydrogen storage tank

KAUST Repository

Panos, C.

2010-09-01

We present a general framework for the optimal design and control of a metal-hydride bed under hydrogen desorption operation. The framework features: (i) a detailed two-dimension dynamic process model, (ii) a design and operational dynamic optimization step, and (iii) an explicit/multi-parametric model predictive controller design step. For the controller design, a reduced order approximate model is obtained, based on which nominal and robust multi-parametric controllers are designed. © 2010 Elsevier Ltd.

Dynamic optimization and robust explicit model predictive control of hydrogen storage tank

KAUST Repository

Panos, C.; Kouramas, K.I.; Georgiadis, M.C.; Pistikopoulos, E.N.

2010-01-01

We present a general framework for the optimal design and control of a metal-hydride bed under hydrogen desorption operation. The framework features: (i) a detailed two-dimension dynamic process model, (ii) a design and operational dynamic optimization step, and (iii) an explicit/multi-parametric model predictive controller design step. For the controller design, a reduced order approximate model is obtained, based on which nominal and robust multi-parametric controllers are designed. © 2010 Elsevier Ltd.

Intelligent Heuristic Techniques for the Optimization of the Transshipment and Storage Operations at Maritime Container Terminals

Directory of Open Access Journals (Sweden)

Christopher Expósito-Izquierdo

2017-02-01

Full Text Available This paper summarizes the main contributions of the Ph.D. thesis of Christopher Exp\\'osito-Izquierdo. This thesis seeks to develop a wide set of intelligent heuristic and meta-heuristic algorithms aimed at solving some of the most highlighted optimization problems associated with the transshipment and storage of containers at conventional maritime container terminals. Under the premise that no optimization technique can have a better performance than any other technique under all possible assumptions, the main point of interest in the domain of maritime logistics is to propose optimization techniques superior in terms of effectiveness and computational efficiency to previous proposals found in the scientific literature when solving individual optimization problems under realistic scenarios. Simultaneously, these optimization techniques should be enough competitive to be potentially implemented in practice. }}

Communication: Time-dependent optimized coupled-cluster method for multielectron dynamics

Science.gov (United States)

Sato, Takeshi; Pathak, Himadri; Orimo, Yuki; Ishikawa, Kenichi L.

2018-02-01

Time-dependent coupled-cluster method with time-varying orbital functions, called time-dependent optimized coupled-cluster (TD-OCC) method, is formulated for multielectron dynamics in an intense laser field. We have successfully derived the equations of motion for CC amplitudes and orthonormal orbital functions based on the real action functional, and implemented the method including double excitations (TD-OCCD) and double and triple excitations (TD-OCCDT) within the optimized active orbitals. The present method is size extensive and gauge invariant, a polynomial cost-scaling alternative to the time-dependent multiconfiguration self-consistent-field method. The first application of the TD-OCC method of intense-laser driven correlated electron dynamics in Ar atom is reported.

Optimal Dynamic Pricing for Perishable Assets with Nonhomogeneous Demand

OpenAIRE

Wen Zhao; Yu-Sheng Zheng

2000-01-01

We consider a dynamic pricing model for selling a given stock of a perishable product over a finite time horizon. Customers, whose reservation price distribution changes over time, arrive according to a nonhomogeneous Poisson process. We show that at any given time, the optimal price decreases with inventory. We also identify a sufficient condition under which the optimal price decreases over time for a given inventory level. This sufficient condition requires that the willingness of a custom...

Kernel optimization for short-range molecular dynamics

Science.gov (United States)

Hu, Changjun; Wang, Xianmeng; Li, Jianjiang; He, Xinfu; Li, Shigang; Feng, Yangde; Yang, Shaofeng; Bai, He

2017-02-01

To optimize short-range force computations in Molecular Dynamics (MD) simulations, multi-threading and SIMD optimizations are presented in this paper. With respect to multi-threading optimization, a Partition-and-Separate-Calculation (PSC) method is designed to avoid write conflicts caused by using Newton's third law. Serial bottlenecks are eliminated with no additional memory usage. The method is implemented by using the OpenMP model. Furthermore, the PSC method is employed on Intel Xeon Phi coprocessors in both native and offload models. We also evaluate the performance of the PSC method under different thread affinities on the MIC architecture. In the SIMD execution, we explain the performance influence in the PSC method, considering the "if-clause" of the cutoff radius check. The experiment results show that our PSC method is relatively more efficient compared to some traditional methods. In double precision, our 256-bit SIMD implementation is about 3 times faster than the scalar version.

Optimization of coronary optical coherence tomography imaging using the attenuation-compensated technique: a validation study.

NARCIS (Netherlands)

Teo, Jing Chun; Foin, Nicolas; Otsuka, Fumiyuki; Bulluck, Heerajnarain; Fam, Jiang Ming; Wong, Philip; Low, Fatt Hoe; Leo, Hwa Liang; Mari, Jean-Martial; Joner, Michael; Girard, Michael J A; Virmani, Renu; Bezerra, HG.; Costa, MA.; Guagliumi, G.; Rollins, AM.; Simon, D.; Gutiérrez-Chico, JL.; Alegría-Barrero, E.; Teijeiro-Mestre, R.; Chan, PH.; Tsujioka, H.; de Silva, R.; Otsuka, F.; Joner, M.; Prati, F.; Virmani, R.; Narula, J.; Members, WC.; Levine, GN.; Bates, ER.; Blankenship, JC.; Bailey, SR.; Bittl, JA.; Prati, F.; Guagliumi, G.; Mintz, G.S.; Costa, Marco; Regar, E.; Akasaka, T.; Roleder, T.; Jąkała, J.; Kałuża, GL.; Partyka, Ł.; Proniewska, K.; Pociask, E.; Girard, MJA.; Strouthidis, NG.; Ethier, CR.; Mari, JM.; Mari, JM.; Strouthidis, NG.; Park, SC.; Girard, MJA.; van der Lee, R.; Foin, N.; Otsuka, F.; Wong, P.K.; Mari, J-M.; Joner, M.; Nakano, M.; Vorpahl, M.; Otsuka, F.; Taniwaki, M.; Yazdani, SK.; Finn, AV.; Nakano, M.; Yahagi, K.; Yamamoto, H.; Taniwaki, M.; Otsuka, F.; Ladich, ER.; Girard, MJ.; Ang, M.; Chung, CW.; Farook, M.; Strouthidis, N.; Mehta, JS.; Foin, N.; Mari, JM.; Nijjer, S.; Sen, S.; Petraco, R.; Ghione, M.; Liu, X.; Kang, JU.; Virmani, R.; Kolodgie, F.D.; Burke, AP.; Farb, A.; Schwartz, S.M.; Yahagi, K.; Kolodgie, F.D.; Otsuka, F.; Finn, AV.; Davis, HR.; Joner, M.; Kume, T.; Akasaka, T.; Kawamoto, T.; Watanabe, N.; Toyota, E.; Neishi, Y.; Rieber, J.; Meissner, O.; Babaryka, G.; Reim, S.; Oswald, M.E.; Koenig, A.S.; Tearney, G. J.; Regar, E.; Akasaka, T.; Adriaenssens, T.; Barlis, P.; Bezerra, HG.; Yabushita, H.; Bouma, BE.; Houser, S. L.; Aretz, HT.; Jang, I-K.; Schlendorf, KH.; Guo, J.; Sun, L.; Chen, Y.D.; Tian, F.; Liu, HB.; Chen, L.; Kawasaki, M.; Bouma, BE.; Bressner, J. E.; Houser, S. L.; Nadkarni, S. K.; MacNeill, BD.; Jansen, CHP.; Onthank, DC.; Cuello, F.; Botnar, RM.; Wiethoff, AJ.; Warley, A.; von Birgelen, C.; Hartmann, A. M.; Kubo, T.; Akasaka, T.; Shite, J.; Suzuki, T.; Uemura, S.; Yu, B.; Habara, M.; Nasu, K.; Terashima, M.; Kaneda, H.; Yokota, D.; Ko, E.; Virmani, R.; Burke, AP.; Kolodgie, F.D.; Farb, A.; Takarada, S.; Imanishi, T.; Kubo, T.; Tanimoto, T.; Kitabata, H.; Nakamura, N.; Hattori, K.; Ozaki, Y.; Ismail, TF.; Okumura, M.; Naruse, H.; Kan, S.; Nishio, R.; Shinke, T.; Otake, H.; Nakagawa, M.; Nagoshi, R.; Inoue, T.; Sinclair, H.D.; Bourantas, C.; Bagnall, A.; Mintz, G.S.; Kunadian, V.; Tearney, G. J.; Yabushita, H.; Houser, S. L.; Aretz, HT.; Jang, I-K.; Schlendorf, KH.; van Soest, G.; Goderie, T.; Regar, E.; Koljenović, S.; Leenders, GL. van; Gonzalo, N.; Xu, C.; Schmitt, JM.; Carlier, SG.; Virmani, R.; van der Meer, FJ; Faber, D.J.; Sassoon, DMB.; Aalders, M.C.; Pasterkamp, G.; Leeuwen, TG. van; Schmitt, JM.; Knuttel, A.; Yadlowsky, M.; Eckhaus, MA.; Karamata, B.; Laubscher, M.; Leutenegger, M.; Bourquin, S.; Lasser, T.; Lambelet, P.; Vermeer, K.A.; Mo, J.; Weda, J.J.A.; Lemij, H.G.; Boer, JF. de

2016-01-01

PURPOSE To optimize conventional coronary optical coherence tomography (OCT) images using the attenuation-compensated technique to improve identification of plaques and the external elastic lamina (EEL) contour. METHOD The attenuation-compensated technique was optimized via manipulating contrast

SU-D-213-03: Towards An Optimized 3D Scintillation Dosimetry Tool for Quality Assurance of Dynamic Radiotherapy Techniques

Energy Technology Data Exchange (ETDEWEB)

Rilling, M [Département de physique, de génie physique et d’optique, Université Laval, Quebec City, QC (Canada); Centre de Recherche sur le Cancer, Hôtel-Dieu de Québec, Quebec City, QC (Canada); Département de radio-oncologie, CHU de Québec, Quebec City, QC (Canada); Center for Optics, Photonics and Lasers, Université Laval, Quebec City, QC, CA (Canada); Goulet, M [Département de radio-oncologie, CHU de Québec, Quebec City, QC (Canada); Thibault, S [Département de physique, de génie physique et d’optique, Université Laval, Quebec City, QC (Canada); Center for Optics, Photonics and Lasers, Université Laval, Quebec City, QC, CA (Canada); Archambault, L [Département de physique, de génie physique et d’optique, Université Laval, Quebec City, QC (Canada); Centre de Recherche sur le Cancer, Hôtel-Dieu de Québec, Quebec City, QC (Canada); Département de radio-oncologie, CHU de Québec, Quebec City, QC (Canada)

2015-06-15

Purpose: The purpose of this work is to simulate a multi-focus plenoptic camera used as the measuring device in a real-time three-dimensional scintillation dosimeter. Simulating and optimizing this realistic optical system will bridge the technological gap between concept validation and a clinically viable tool that can provide highly efficient, accurate and precise measurements for dynamic radiotherapy techniques. Methods: The experimental prototype, previously developed for proof of concept purposes, uses an off-the-shelf multi-focus plenoptic camera. With an array of interleaved microlenses of different focal lengths, this camera records spatial and angular information of light emitted by a plastic scintillator volume. The three distinct microlens focal lengths were determined experimentally for use as baseline parameters by measuring image-to-object magnification for different distances in object space. A simulated plenoptic system was implemented using the non-sequential ray tracing software Zemax: this tool allows complete simulation of multiple optical paths by modeling interactions at interfaces such as scatter, diffraction, reflection and refraction. The active sensor was modeled based on the camera manufacturer specifications by a 2048×2048, 5 µm-pixel pitch sensor. Planar light sources, simulating the plastic scintillator volume, were employed for ray tracing simulations. Results: The microlens focal lengths were determined to be 384, 327 and 290 µm. A realistic multi-focus plenoptic system, with independently defined and optimizable specifications, was fully simulated. A f/2.9 and 54 mm-focal length Double Gauss objective was modeled as the system’s main lens. A three-focal length hexagonal microlens array of 250-µm thickness was designed, acting as an image-relay system between the main lens and sensor. Conclusion: Simulation of a fully modeled multi-focus plenoptic camera enables the decoupled optimization of the main lens and microlens

Optimization of DNA Sensor Model Based Nanostructured Graphene Using Particle Swarm Optimization Technique

Directory of Open Access Journals (Sweden)

Hediyeh Karimi

2013-01-01

Full Text Available It has been predicted that the nanomaterials of graphene will be among the candidate materials for postsilicon electronics due to their astonishing properties such as high carrier mobility, thermal conductivity, and biocompatibility. Graphene is a semimetal zero gap nanomaterial with demonstrated ability to be employed as an excellent candidate for DNA sensing. Graphene-based DNA sensors have been used to detect the DNA adsorption to examine a DNA concentration in an analyte solution. In particular, there is an essential need for developing the cost-effective DNA sensors holding the fact that it is suitable for the diagnosis of genetic or pathogenic diseases. In this paper, particle swarm optimization technique is employed to optimize the analytical model of a graphene-based DNA sensor which is used for electrical detection of DNA molecules. The results are reported for 5 different concentrations, covering a range from 0.01 nM to 500 nM. The comparison of the optimized model with the experimental data shows an accuracy of more than 95% which verifies that the optimized model is reliable for being used in any application of the graphene-based DNA sensor.

Dynamic programming approach to optimization of approximate decision rules

KAUST Repository

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

2013-01-01

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

Optimal design of planar slider-crank mechanism using teaching-learning-based optimization algorithm

International Nuclear Information System (INIS)

Chaudhary, Kailash; Chaudhary, Himanshu

2015-01-01

In this paper, a two stage optimization technique is presented for optimum design of planar slider-crank mechanism. The slider crank mechanism needs to be dynamically balanced to reduce vibrations and noise in the engine and to improve the vehicle performance. For dynamic balancing, minimization of the shaking force and the shaking moment is achieved by finding optimum mass distribution of crank and connecting rod using the equipemental system of point-masses in the first stage of the optimization. In the second stage, their shapes are synthesized systematically by closed parametric curve, i.e., cubic B-spline curve corresponding to the optimum inertial parameters found in the first stage. The multi-objective optimization problem to minimize both the shaking force and the shaking moment is solved using Teaching-learning-based optimization algorithm (TLBO) and its computational performance is compared with Genetic algorithm (GA).

Optimal design of planar slider-crank mechanism using teaching-learning-based optimization algorithm

Energy Technology Data Exchange (ETDEWEB)

Chaudhary, Kailash; Chaudhary, Himanshu [Malaviya National Institute of Technology, Jaipur (Malaysia)

2015-11-15

In this paper, a two stage optimization technique is presented for optimum design of planar slider-crank mechanism. The slider crank mechanism needs to be dynamically balanced to reduce vibrations and noise in the engine and to improve the vehicle performance. For dynamic balancing, minimization of the shaking force and the shaking moment is achieved by finding optimum mass distribution of crank and connecting rod using the equipemental system of point-masses in the first stage of the optimization. In the second stage, their shapes are synthesized systematically by closed parametric curve, i.e., cubic B-spline curve corresponding to the optimum inertial parameters found in the first stage. The multi-objective optimization problem to minimize both the shaking force and the shaking moment is solved using Teaching-learning-based optimization algorithm (TLBO) and its computational performance is compared with Genetic algorithm (GA).

Optimization,Modeling, and Control: Applications to Klystron Designing and Hepatitis C Virus Dynamics

Science.gov (United States)

Lankford, George Bernard

In this dissertation, we address applying mathematical and numerical techniques in the fields of high energy physics and biomedical sciences. The first portion of this thesis presents a method for optimizing the design of klystron circuits. A klystron is an electron beam tube lined with cavities that emit resonant frequencies to velocity modulate electrons that pass through the tube. Radio frequencies (RF) inserted in the klystron are amplified due to the velocity modulation of the electrons. The routine described in this work automates the selection of cavity positions, resonant frequencies, quality factors, and other circuit parameters to maximize the efficiency with required gain. The method is based on deterministic sampling methods. We will describe the procedure and give several examples for both narrow and wide band klystrons, using the klystron codes AJDISK (Java) and TESLA (Python). The rest of the dissertation is dedicated to developing, calibrating and using a mathematical model for hepatitis C dynamics with triple drug combination therapy. Groundbreaking new drugs, called direct acting antivirals, have been introduced recently to fight off chronic hepatitis C virus infection. The model we introduce is for hepatitis C dynamics treated with the direct acting antiviral drug, telaprevir, along with traditional interferon and ribavirin treatments to understand how this therapy affects the viral load of patients exhibiting different types of response. We use sensitivity and identifiability techniques to determine which parameters can be best estimated from viral load data. We use these estimations to give patient-specific fits of the model to partial viral response, end-of-treatment response, and breakthrough patients. We will then revise the model to incorporate an immune response dynamic to more accurately describe the dynamics. Finally, we will implement a suboptimal control to acquire a drug treatment regimen that will alleviate the systemic cost

Achieving Optimal Self-Adaptivity for Dynamic Tuning of Organic Semiconductors through Resonance Engineering.

Science.gov (United States)

Tao, Ye; Xu, Lijia; Zhang, Zhen; Chen, Runfeng; Li, Huanhuan; Xu, Hui; Zheng, Chao; Huang, Wei

2016-08-03

Current static-state explorations of organic semiconductors for optimal material properties and device performance are hindered by limited insights into the dynamically changed molecular states and charge transport and energy transfer processes upon device operation. Here, we propose a simple yet successful strategy, resonance variation-based dynamic adaptation (RVDA), to realize optimized self-adaptive properties in donor-resonance-acceptor molecules by engineering the resonance variation for dynamic tuning of organic semiconductors. Organic light-emitting diodes hosted by these RVDA materials exhibit remarkably high performance, with external quantum efficiencies up to 21.7% and favorable device stability. Our approach, which supports simultaneous realization of dynamically adapted and selectively enhanced properties via resonance engineering, illustrates a feasible design map for the preparation of smart organic semiconductors capable of dynamic structure and property modulations, promoting the studies of organic electronics from static to dynamic.

Optimization of multi-stage dynamic treatment regimes utilizing accumulated data.

Science.gov (United States)

Huang, Xuelin; Choi, Sangbum; Wang, Lu; Thall, Peter F

2015-11-20

In medical therapies involving multiple stages, a physician's choice of a subject's treatment at each stage depends on the subject's history of previous treatments and outcomes. The sequence of decisions is known as a dynamic treatment regime or treatment policy. We consider dynamic treatment regimes in settings where each subject's final outcome can be defined as the sum of longitudinally observed values, each corresponding to a stage of the regime. Q-learning, which is a backward induction method, is used to first optimize the last stage treatment then sequentially optimize each previous stage treatment until the first stage treatment is optimized. During this process, model-based expectations of outcomes of late stages are used in the optimization of earlier stages. When the outcome models are misspecified, bias can accumulate from stage to stage and become severe, especially when the number of treatment stages is large. We demonstrate that a modification of standard Q-learning can help reduce the accumulated bias. We provide a computational algorithm, estimators, and closed-form variance formulas. Simulation studies show that the modified Q-learning method has a higher probability of identifying the optimal treatment regime even in settings with misspecified models for outcomes. It is applied to identify optimal treatment regimes in a study for advanced prostate cancer and to estimate and compare the final mean rewards of all the possible discrete two-stage treatment sequences. Copyright © 2015 John Wiley & Sons, Ltd.

Optimizing spread dynamics on graphs by message passing

International Nuclear Information System (INIS)

Altarelli, F; Braunstein, A; Dall’Asta, L; Zecchina, R

2013-01-01

Cascade processes are responsible for many important phenomena in natural and social sciences. Simple models of irreversible dynamics on graphs, in which nodes activate depending on the state of their neighbors, have been successfully applied to describe cascades in a large variety of contexts. Over the past decades, much effort has been devoted to understanding the typical behavior of the cascades arising from initial conditions extracted at random from some given ensemble. However, the problem of optimizing the trajectory of the system, i.e. of identifying appropriate initial conditions to maximize (or minimize) the final number of active nodes, is still considered to be practically intractable, with the only exception being models that satisfy a sort of diminishing returns property called submodularity. Submodular models can be approximately solved by means of greedy strategies, but by definition they lack cooperative characteristics which are fundamental in many real systems. Here we introduce an efficient algorithm based on statistical physics for the optimization of trajectories in cascade processes on graphs. We show that for a wide class of irreversible dynamics, even in the absence of submodularity, the spread optimization problem can be solved efficiently on large networks. Analytic and algorithmic results on random graphs are complemented by the solution of the spread maximization problem on a real-world network (the Epinions consumer reviews network). (paper)

Optimizing spread dynamics on graphs by message passing

Science.gov (United States)

Altarelli, F.; Braunstein, A.; Dall'Asta, L.; Zecchina, R.

2013-09-01

Cascade processes are responsible for many important phenomena in natural and social sciences. Simple models of irreversible dynamics on graphs, in which nodes activate depending on the state of their neighbors, have been successfully applied to describe cascades in a large variety of contexts. Over the past decades, much effort has been devoted to understanding the typical behavior of the cascades arising from initial conditions extracted at random from some given ensemble. However, the problem of optimizing the trajectory of the system, i.e. of identifying appropriate initial conditions to maximize (or minimize) the final number of active nodes, is still considered to be practically intractable, with the only exception being models that satisfy a sort of diminishing returns property called submodularity. Submodular models can be approximately solved by means of greedy strategies, but by definition they lack cooperative characteristics which are fundamental in many real systems. Here we introduce an efficient algorithm based on statistical physics for the optimization of trajectories in cascade processes on graphs. We show that for a wide class of irreversible dynamics, even in the absence of submodularity, the spread optimization problem can be solved efficiently on large networks. Analytic and algorithmic results on random graphs are complemented by the solution of the spread maximization problem on a real-world network (the Epinions consumer reviews network).

A Novel Analytical Technique for Optimal Allocation of Capacitors in Radial Distribution Systems

Directory of Open Access Journals (Sweden)

Sarfaraz Nawaz

2017-07-01

Full Text Available In this paper, a novel analytical technique is proposed to determine the optimal size and location of shunt capacitor units in radial distribution systems. An objective function is formulated to reduce real power loss, to improve the voltage profile and to increase annual cost savings. A new constant, the Loss Sensitivity Constant (LSC, is proposed here. The value of LSC decides the location and size of candidate buses. The technique is demonstrated on an IEEE-33 bus system at different load levels and the 130-bus distribution system of Jamawa Ramgarh village, Jaipur city. The obtained results are compared with the latest optimization techniques to show the effectiveness and robustness of the proposed technique.

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.

Virtual Power Plant and Microgrids controller for Energy Management based on optimization techniques

Directory of Open Access Journals (Sweden)

Maher G. M. Abdolrasol

2017-06-01

Full Text Available This paper discuss virtual power plant (VPP and Microgrid controller for energy management system (EMS based on optimization techniques by using two optimization techniques namely Backtracking search algorithm (BSA and particle swarm optimization algorithm (PSO. The research proposes use of multi Microgrid in the distribution networks to aggregate the power form distribution generation and form it into single Microgrid and let these Microgrid deal directly with the central organizer called virtual power plant. VPP duties are price forecast, demand forecast, weather forecast, production forecast, shedding loads, make intelligent decision and for aggregate & optimizes the data. This huge system has been tested and simulated by using Matlab simulink. These paper shows optimizations of two methods were really significant in the results. But BSA is better than PSO to search for better parameters which could make more power saving as in the results and the discussion.

Chaotic system optimal tracking using data-based synchronous method with unknown dynamics and disturbances

International Nuclear Information System (INIS)

Song Ruizhuo; Wei Qinglai

2017-01-01

We develop an optimal tracking control method for chaotic system with unknown dynamics and disturbances. The method allows the optimal cost function and the corresponding tracking control to update synchronously. According to the tracking error and the reference dynamics, the augmented system is constructed. Then the optimal tracking control problem is defined. The policy iteration (PI) is introduced to solve the min-max optimization problem. The off-policy adaptive dynamic programming (ADP) algorithm is then proposed to find the solution of the tracking Hamilton–Jacobi–Isaacs (HJI) equation online only using measured data and without any knowledge about the system dynamics. Critic neural network (CNN), action neural network (ANN), and disturbance neural network (DNN) are used to approximate the cost function, control, and disturbance. The weights of these networks compose the augmented weight matrix, and the uniformly ultimately bounded (UUB) of which is proven. The convergence of the tracking error system is also proven. Two examples are given to show the effectiveness of the proposed synchronous solution method for the chaotic system tracking problem. (paper)

Large Portfolio Risk Management and Optimal Portfolio Allocation with Dynamic Copulas

OpenAIRE

Thorsten Lehnert; Xisong Jin

2011-01-01

Previous research focuses on the importance of modeling the multivariate distribution for optimal portfolio allocation and active risk management. However, available dynamic models are not easily applied for high-dimensional problems due to the curse of dimensionality. In this paper, we extend the framework of the Dynamic Conditional Correlation/Equicorrelation and an extreme value approach into a series of Dynamic Conditional Elliptical Copulas. We investigate risk measures like Value at Ris...

On the equivalent static loads approach for dynamic response structural optimization

DEFF Research Database (Denmark)

Stolpe, Mathias

2014-01-01

The equivalent static loads algorithm is an increasingly popular approach to solve dynamic response structural optimization problems. The algorithm is based on solving a sequence of related static response structural optimization problems with the same objective and constraint functions...... as the original problem. The optimization theoretical foundation of the algorithm is mainly developed in Park and Kang (J Optim Theory Appl 118(1):191–200, 2003). In that article it is shown, for a certain class of problems, that if the equivalent static loads algorithm terminates then the KKT conditions...

Reliability analysis of large scaled structures by optimization technique

International Nuclear Information System (INIS)

Ishikawa, N.; Mihara, T.; Iizuka, M.

1987-01-01

This paper presents a reliability analysis based on the optimization technique using PNET (Probabilistic Network Evaluation Technique) method for the highly redundant structures having a large number of collapse modes. This approach makes the best use of the merit of the optimization technique in which the idea of PNET method is used. The analytical process involves the minimization of safety index of the representative mode, subjected to satisfaction of the mechanism condition and of the positive external work. The procedure entails the sequential performance of a series of the NLP (Nonlinear Programming) problems, where the correlation condition as the idea of PNET method pertaining to the representative mode is taken as an additional constraint to the next analysis. Upon succeeding iterations, the final analysis is achieved when a collapse probability at the subsequent mode is extremely less than the value at the 1st mode. The approximate collapse probability of the structure is defined as the sum of the collapse probabilities of the representative modes classified by the extent of correlation. Then, in order to confirm the validity of the proposed method, the conventional Monte Carlo simulation is also revised by using the collapse load analysis. Finally, two fairly large structures were analyzed to illustrate the scope and application of the approach. (orig./HP)

Fundamental study on repairing technique for cracked or damaged parts of structures by cold gas dynamic spray technique

International Nuclear Information System (INIS)

Ogawa, Kazuhiro; Amao, Satoshi; Ichikawa, Yuji; Shoji, Tetsuo

2008-01-01

This study proposes an innovative technique for repairing of cracked or damaged parts of structures, such as nuclear or thermal power plants, by means of cold gas dynamic spray (CS) technique. In the case of generation of cracks etc. in the structure, the cracks can be repaired by welding. However, the welding spends considerable time on repair, and also needs special skills. The CS technique is known as a new technique not only for coatings but also for thick depositions. It has many advantages, i.e. dense deposition, high deposition rate and low oxidation. Therefore, it has a possibility to apply the CS technique instead of welding to repair the cracks etc. In this study, the cold gas dynamic spray technique as a new repairing technique for some structures is introduced. (author)

Optimal control of dissipative nonlinear dynamical systems with triggers of coupled singularities

International Nuclear Information System (INIS)

Hedrih, K

2008-01-01

This paper analyses the controllability of motion of nonconservative nonlinear dynamical systems in which triggers of coupled singularities exist or appear. It is shown that the phase plane method is useful for the analysis of nonlinear dynamics of nonconservative systems with one degree of freedom of control strategies and also shows the way it can be used for controlling the relative motion in rheonomic systems having equivalent scleronomic conservative or nonconservative system For the system with one generalized coordinate described by nonlinear differential equation of nonlinear dynamics with trigger of coupled singularities, the functions of system potential energy and conservative force must satisfy some conditions defined by a Theorem on the existence of a trigger of coupled singularities and the separatrix in the form of 'an open a spiral form' of number eight. Task of the defined dynamical nonconservative system optimal control is: by using controlling force acting to the system, transfer initial state of the nonlinear dynamics of the system into the final state of the nonlinear dynamics in the minimal time for that optimal control task

Optimal control of dissipative nonlinear dynamical systems with triggers of coupled singularities

Science.gov (United States)

Stevanović Hedrih, K.

2008-02-01

This paper analyses the controllability of motion of nonconservative nonlinear dynamical systems in which triggers of coupled singularities exist or appear. It is shown that the phase plane method is useful for the analysis of nonlinear dynamics of nonconservative systems with one degree of freedom of control strategies and also shows the way it can be used for controlling the relative motion in rheonomic systems having equivalent scleronomic conservative or nonconservative system For the system with one generalized coordinate described by nonlinear differential equation of nonlinear dynamics with trigger of coupled singularities, the functions of system potential energy and conservative force must satisfy some conditions defined by a Theorem on the existence of a trigger of coupled singularities and the separatrix in the form of "an open a spiral form" of number eight. Task of the defined dynamical nonconservative system optimal control is: by using controlling force acting to the system, transfer initial state of the nonlinear dynamics of the system into the final state of the nonlinear dynamics in the minimal time for that optimal control task

Optimized maritime emergency resource allocation under dynamic demand.

Directory of Open Access Journals (Sweden)

Wenfen Zhang

Full Text Available Emergency resource is important for people evacuation and property rescue when accident occurs. The relief efforts could be promoted by a reasonable emergency resource allocation schedule in advance. As the marine environment is complicated and changeful, the place, type, severity of maritime accident is uncertain and stochastic, bringing about dynamic demand of emergency resource. Considering dynamic demand, how to make a reasonable emergency resource allocation schedule is challenging. The key problem is to determine the optimal stock of emergency resource for supplier centers to improve relief efforts. This paper studies the dynamic demand, and which is defined as a set. Then a maritime emergency resource allocation model with uncertain data is presented. Afterwards, a robust approach is developed and used to make sure that the resource allocation schedule performs well with dynamic demand. Finally, a case study shows that the proposed methodology is feasible in maritime emergency resource allocation. The findings could help emergency manager to schedule the emergency resource allocation more flexibly in terms of dynamic demand.

Multidimensional particle swarm optimization for machine learning and pattern recognition

CERN Document Server

Kiranyaz, Serkan; Gabbouj, Moncef

2013-01-01

For many engineering problems we require optimization processes with dynamic adaptation as we aim to establish the dimension of the search space where the optimum solution resides and develop robust techniques to avoid the local optima usually associated with multimodal problems. This book explores multidimensional particle swarm optimization, a technique developed by the authors that addresses these requirements in a well-defined algorithmic approach.  After an introduction to the key optimization techniques, the authors introduce their unified framework and demonstrate its advantages in chal

Conceptual Design Optimization of an Augmented Stability Aircraft Incorporating Dynamic Response and Actuator Constraints

Science.gov (United States)

Welstead, Jason; Crouse, Gilbert L., Jr.

2014-01-01

Empirical sizing guidelines such as tail volume coefficients have long been used in the early aircraft design phases for sizing stabilizers, resulting in conservatively stable aircraft. While successful, this results in increased empty weight, reduced performance, and greater procurement and operational cost relative to an aircraft with optimally sized surfaces. Including flight dynamics in the conceptual design process allows the design to move away from empirical methods while implementing modern control techniques. A challenge of flight dynamics and control is the numerous design variables, which are changing fluidly throughout the conceptual design process, required to evaluate the system response to some disturbance. This research focuses on addressing that challenge not by implementing higher order tools, such as computational fluid dynamics, but instead by linking the lower order tools typically used within the conceptual design process so each discipline feeds into the other. In thisresearch, flight dynamics and control was incorporated into the conceptual design process along with the traditional disciplines of vehicle sizing, weight estimation, aerodynamics, and performance. For the controller, a linear quadratic regulator structure with constant gains has been specified to reduce the user input. Coupling all the disciplines in the conceptual design phase allows the aircraft designer to explore larger design spaces where stabilizers are sized according to dynamic response constraints rather than historical static margin and volume coefficient guidelines.

Laser sources and techniques for spectroscopy and dynamics

Energy Technology Data Exchange (ETDEWEB)

Kung, A.H. [Lawrence Berkeley Laboratory, CA (United States)

1993-12-01

This program focuses on the development of novel laser and spectroscopic techniques in the IR, UV, and VUV regions for studying combustion related molecular dynamics at the microscopic level. Laser spectroscopic techniques have proven to be extremely powerful in the investigation of molecular processes which require very high sensitivity and selectivity. The authors approach is to use quantum electronic and non-linear optical techniques to extend the spectral coverage and to enhance the optical power of ultrahigh resolution laser sources so as to obtain and analyze photoionization, fluorescence, and photoelectron spectra of jet-cooled free radicals and of reaction products resulting from unimolecular and bimolecular dissociations. New spectroscopic techniques are developed with these sources for the detection of optically thin and often short-lived species. Recent activities center on regenerative amplification of high resolution solid-state lasers, development of tunable high power mid-IR lasers and short-pulse UV/VUV tunable lasers, and development of a multipurpose high-order suppressor crossed molecular beam apparatus for use with synchrotron radiation sources. This program also provides scientific and technical support within the Chemical Sciences Division to the development of LBL`s Combustion Dynamics Initiative.

The optimization of essential oils supercritical CO2 extraction from Lavandula hybrida through static-dynamic steps procedure and semi-continuous technique using response surface method

Science.gov (United States)

Kamali, Hossein; Aminimoghadamfarouj, Noushin; Golmakani, Ebrahim; Nematollahi, Alireza

2015-01-01

Aim: The aim of this study was to examine and evaluate crucial variables in essential oils extraction process from Lavandula hybrida through static-dynamic and semi-continuous techniques using response surface method. Materials and Methods: Essential oil components were extracted from Lavandula hybrida (Lavandin) flowers using supercritical carbon dioxide via static-dynamic steps (SDS) procedure, and semi-continuous (SC) technique. Results: Using response surface method the optimum extraction yield (4.768%) was obtained via SDS at 108.7 bar, 48.5°C, 120 min (static: 8×15), 24 min (dynamic: 8×3 min) in contrast to the 4.620% extraction yield for the SC at 111.6 bar, 49.2°C, 14 min (static), 121.1 min (dynamic). Conclusion: The results indicated that a substantial reduction (81.56%) solvent usage (kg CO2/g oil) is observed in the SDS method versus the conventional SC method. PMID:25598636

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

Science.gov (United States)

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

2009-01-01

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

Fuzzy Constrained Predictive Optimal Control of High Speed Train with Actuator Dynamics

Directory of Open Access Journals (Sweden)

Xi Wang

2016-01-01

Full Text Available We investigate the problem of fuzzy constrained predictive optimal control of high speed train considering the effect of actuator dynamics. The dynamics feature of the high speed train is modeled as a cascade of cars connected by flexible couplers, and the formulation is mathematically transformed into a Takagi-Sugeno (T-S fuzzy model. The goal of this study is to design a state feedback control law at each decision step to enhance safety, comfort, and energy efficiency of high speed train subject to safety constraints on the control input. Based on Lyapunov stability theory, the problem of optimizing an upper bound on the cruise control cost function subject to input constraints is reduced to a convex optimization problem involving linear matrix inequalities (LMIs. Furthermore, we analyze the influences of second-order actuator dynamics on the fuzzy constrained predictive controller, which shows risk of potentially deteriorating the overall system. Employing backstepping method, an actuator compensator is proposed to accommodate for the influence of the actuator dynamics. The experimental results show that with the proposed approach high speed train can track the desired speed, the relative coupler displacement between the neighbouring cars is stable at the equilibrium state, and the influence of actuator dynamics is reduced, which demonstrate the validity and effectiveness of the proposed approaches.

Volatile decision dynamics: experiments, stochastic description, intermittency control and traffic optimization

Science.gov (United States)

Helbing, Dirk; Schönhof, Martin; Kern, Daniel

2002-06-01

The coordinated and efficient distribution of limited resources by individual decisions is a fundamental, unsolved problem. When individuals compete for road capacities, time, space, money, goods, etc, they normally make decisions based on aggregate rather than complete information, such as TV news or stock market indices. In related experiments, we have observed a volatile decision dynamics and far-from-optimal payoff distributions. We have also identified methods of information presentation that can considerably improve the overall performance of the system. In order to determine optimal strategies of decision guidance by means of user-specific recommendations, a stochastic behavioural description is developed. These strategies manage to increase the adaptibility to changing conditions and to reduce the deviation from the time-dependent user equilibrium, thereby enhancing the average and individual payoffs. Hence, our guidance strategies can increase the performance of all users by reducing overreaction and stabilizing the decision dynamics. These results are highly significant for predicting decision behaviour, for reaching optimal behavioural distributions by decision support systems and for information service providers. One of the promising fields of application is traffic optimization.

Developing a computationally efficient dynamic multilevel hybrid optimization scheme using multifidelity model interactions.

Energy Technology Data Exchange (ETDEWEB)

Hough, Patricia Diane (Sandia National Laboratories, Livermore, CA); Gray, Genetha Anne (Sandia National Laboratories, Livermore, CA); Castro, Joseph Pete Jr. (; .); Giunta, Anthony Andrew

2006-01-01

Many engineering application problems use optimization algorithms in conjunction with numerical simulators to search for solutions. The formulation of relevant objective functions and constraints dictate possible optimization algorithms. Often, a gradient based approach is not possible since objective functions and constraints can be nonlinear, nonconvex, non-differentiable, or even discontinuous and the simulations involved can be computationally expensive. Moreover, computational efficiency and accuracy are desirable and also influence the choice of solution method. With the advent and increasing availability of massively parallel computers, computational speed has increased tremendously. Unfortunately, the numerical and model complexities of many problems still demand significant computational resources. Moreover, in optimization, these expenses can be a limiting factor since obtaining solutions often requires the completion of numerous computationally intensive simulations. Therefore, we propose a multifidelity optimization algorithm (MFO) designed to improve the computational efficiency of an optimization method for a wide range of applications. In developing the MFO algorithm, we take advantage of the interactions between multi fidelity models to develop a dynamic and computational time saving optimization algorithm. First, a direct search method is applied to the high fidelity model over a reduced design space. In conjunction with this search, a specialized oracle is employed to map the design space of this high fidelity model to that of a computationally cheaper low fidelity model using space mapping techniques. Then, in the low fidelity space, an optimum is obtained using gradient or non-gradient based optimization, and it is mapped back to the high fidelity space. In this paper, we describe the theory and implementation details of our MFO algorithm. We also demonstrate our MFO method on some example problems and on two applications: earth penetrators and

Optimal dynamic premium control in non-life insurance. Maximizing dividend pay-outs

DEFF Research Database (Denmark)

Højgaard, Bjarne

2002-01-01

In this paper we consider the problem of finding optimal dynamic premium policies in non-life insurance. The reserve of a company is modeled using the classical Cramér-Lundberg model with premium rates calculated via the expected value principle. The company controls dynamically the relative safety...... loading with the possibility of gaining or loosing customers. It distributes dividends according to a 'barrier strategy' and the objective of the company is to find an optimal premium policy and dividend barrier maximizing the expected total, discounted pay-out of dividends. In the case of exponential...

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.

Analysis and optimization of a proton exchange membrane fuel cell using modeling techniques

International Nuclear Information System (INIS)

Torre Valdés, Ing. Raciel de la; García Parra, MSc. Lázaro Roger; González Rodríguez, MSc. Daniel

2015-01-01

This paper proposes a three-dimensional, non-isothermal and steady-state model of Proton Exchange Membrane Fuel Cell using Computational Fluid Dynamic techniques, specifically ANSYS FLUENT 14.5. It's considered multicomponent diffusion and two-phasic flow. The model was compared with experimental published data and with another model. The operation parameters: reactants pressure and temperature, gases flow direction, gas diffusion layer and catalyst layer porosity, reactants humidification and oxygen concentration are analyzed. The model allows the fuel cell design optimization taking in consideration the channels dimensions, the channels length and the membrane thickness. Furthermore, fuel cell performance is analyzed working with SPEEK membrane, an alternative electrolyte to Nafion. In order to carry on membrane material study, it's necessary to modify the expression that describes the electrolyte ionic conductivity. It's found that the device performance has got a great sensibility to pressure, temperature, reactant humidification and oxygen concentration variations. (author)

Optimization of dynamic economic dispatch with valve-point effect using chaotic sequence based differential evolution algorithms

International Nuclear Information System (INIS)

He Dakuo; Dong Gang; Wang Fuli; Mao Zhizhong

2011-01-01

A chaotic sequence based differential evolution (DE) approach for solving the dynamic economic dispatch problem (DEDP) with valve-point effect is presented in this paper. The proposed method combines the DE algorithm with the local search technique to improve the performance of the algorithm. DE is the main optimizer, while an approximated model for local search is applied to fine tune in the solution of the DE run. To accelerate convergence of DE, a series of constraints handling rules are adopted. An initial population obtained by using chaotic sequence exerts optimal performance of the proposed algorithm. The combined algorithm is validated for two test systems consisting of 10 and 13 thermal units whose incremental fuel cost function takes into account the valve-point loading effects. The proposed combined method outperforms other algorithms reported in literatures for DEDP considering valve-point effects.

Dynamic optimization of combined harvesting of a two-species fishery

International Nuclear Information System (INIS)

Chaudhuri, K.

1986-06-01

In the present paper, the author considers the problem of dynamic optimization of the exploitation policy connected with the combined harvesting of two competing fish species, each of which obeys the logistic growth law. The singular extremal trajectory in the phase plane is derived by taking the harvesting effort as a dynamic variable. Biological or bioeconomic interpretations of the constraints required for this singular extremal are also given. (author)

A new concept of assistive virtual keyboards based on a systematic review of text entry optimization techniques

Directory of Open Access Journals (Sweden)

Renato de Sousa Gomide

Full Text Available Abstract Introduction: Due to the increasing popularization of computers and the internet expansion, Alternative and Augmentative Communication technologies have been employed to restore the ability to communicate of people with aphasia and tetraplegia. Virtual keyboards are one of the most primitive mechanisms for alternatively entering text and play a very important role in accomplishing this task. However, the text entry for this kind of keyboard is much slower than entering information through their physical counterparts. Many techniques and layouts have been proposed to improve the typing performance of virtual keyboards, each one concerning a different issue or solving a specific problem. However, not all of them are suitable to assist seriously people with motor impairment. Methods: In order to develop an assistive virtual keyboard with improved typing performance, we performed a systematic review on scientific databases. Results: We found 250 related papers and 52 of them were selected to compose. After that, we identified eight essentials virtual keyboard features, five methods to optimize data entry performance and five metrics to assess typing performance. Conclusion: Based on this review, we introduce a concept of an assistive, optimized, compact and adaptive virtual keyboard that gathers a set of suitable techniques such as: a new ambiguous keyboard layout, disambiguation algorithms, dynamic scan techniques, static text prediction of letters and words and, finally, the use of phonetic and similarity algorithms to reduce the user's typing error rate.

Stargate: Energy Management Techniques

OpenAIRE

Vijay Raghunathan; Mani Srivastava; Trevor Pering; Roy Want

2004-01-01

This poster presents techniques for energy efficient operation of the Stargate wireless platform. In addition to conventional power management techniques such as dynamic voltage and scaling and processor shutdown, the Stargate features several mechanisms for energy efficient operation of the communication subsystem, such as support for hierarchical radios, Bluetooth based remote wakeup, mote based wakeup, etc. Finally, design optimizations including the use of power gating, and provision for ...

Optimization Techniques for Improving the Performance of Silicone-Based Dielectric Elastomers

DEFF Research Database (Denmark)

Skov, Anne Ladegaard; Yu, Liyun

2017-01-01

the electro-mechanical performance of dielectric elastomers are highlighted. Various optimization methods for improved energy transduction are investigated and discussed, with special emphasis placed on the promise each method holds. The compositing and blending of elastomers are shown to be simple, versatile...... methods that can solve a number of optimization issues. More complicated methods, involving chemical modification of the silicone backbone as well as controlling the network structure for improved mechanical properties, are shown to solve yet more issues. From the analysis, it is obvious...... that there is not a single optimization technique that will lead to the universal optimization of dielectric elastomer films, though each method may lead to elastomers with certain features, and thus certain potentials....

Optimum path planning of mobile robot in unknown static and dynamic environments using Fuzzy-Wind Driven Optimization algorithm

Directory of Open Access Journals (Sweden)

Anish Pandey

2017-02-01

Full Text Available This article introduces a singleton type-1 fuzzy logic system (T1-SFLS controller and Fuzzy-WDO hybrid for the autonomous mobile robot navigation and collision avoidance in an unknown static and dynamic environment. The WDO (Wind Driven Optimization algorithm is used to optimize and tune the input/output membership function parameters of the fuzzy controller. The WDO algorithm is working based on the atmospheric motion of infinitesimal small air parcels navigates over an N-dimensional search domain. The performance of this proposed technique has compared through many computer simulations and real-time experiments by using Khepera-III mobile robot. As compared to the T1-SFLS controller the Fuzzy-WDO algorithm is found good agreement for mobile robot navigation.

Using simulation-optimization techniques to improve multiphase aquifer remediation

Energy Technology Data Exchange (ETDEWEB)

Finsterle, S.; Pruess, K. [Lawrence Berkeley Laboratory, Berkeley, CA (United States)

1995-03-01

The T2VOC computer model for simulating the transport of organic chemical contaminants in non-isothermal multiphase systems has been coupled to the ITOUGH2 code which solves parameter optimization problems. This allows one to use linear programming and simulated annealing techniques to solve groundwater management problems, i.e. the optimization of operations for multiphase aquifer remediation. A cost function has to be defined, containing the actual and hypothetical expenses of a cleanup operation which depend - directly or indirectly - on the state variables calculated by T2VOC. Subsequently, the code iteratively determines a remediation strategy (e.g. pumping schedule) which minimizes, for instance, pumping and energy costs, the time for cleanup, and residual contamination. We discuss an illustrative sample problem to discuss potential applications of the code. The study shows that the techniques developed for estimating model parameters can be successfully applied to the solution of remediation management problems. The resulting optimum pumping scheme depends, however, on the formulation of the remediation goals and the relative weighting between individual terms of the cost function.

An entropy flow optimization technique for helium liquefaction cycles

International Nuclear Information System (INIS)

Minta, M.; Smith, J.L.

1984-01-01

This chapter proposes a new method of analyzing thermodynamic cycles based on a continuous distribution of precooling over the temperature range of the cycle. The method gives the optimum distribution of precooling over the temperature range of the cycle by specifying the mass flow to be expanded at each temperature. The result is used to select a cycle configuration with discrete expansions and to initialize the independent variables for final optimization. Topics considered include the continuous precooling model, the results for ideal gas, the results for real gas, and the application to the design of a saturated vapor compression (SVC) cycle. The optimization technique for helium liquefaction cycles starts with the minimization of the generated entropy in a cycle model with continuous precooling. The pressure ratio, the pressure level and the distribution of the heat exchange are selected based on the results of the continuous precooling analysis. It is concluded that the technique incorporates the non-ideal behavior of helium in the procedure and allows the trade-off between heat exchange area and losses to be determined

Optimal Sizing of Energy Storage for Community Microgrids Considering Building Thermal Dynamics

Energy Technology Data Exchange (ETDEWEB)

Liu, Guodong [ORNL; Li, Zhi [ORNL; Starke, Michael R. [ORNL; Ollis, Ben [ORNL; Tomsovic, Kevin [University of Tennessee, Knoxville (UTK)

2017-07-01

This paper proposes an optimization model for the optimal sizing of energy storage in community microgrids considering the building thermal dynamics and customer comfort preference. The proposed model minimizes the annualized cost of the community microgrid, including energy storage investment, purchased energy cost, demand charge, energy storage degradation cost, voluntary load shedding cost and the cost associated with customer discomfort due to room temperature deviation. The decision variables are the power and energy capacity of invested energy storage. In particular, we assume the heating, ventilation and air-conditioning (HVAC) systems can be scheduled intelligently by the microgrid central controller while maintaining the indoor temperature in the comfort range set by customers. For this purpose, the detailed thermal dynamic characteristics of buildings have been integrated into the optimization model. Numerical simulation shows significant cost reduction by the proposed model. The impacts of various costs on the optimal solution are investigated by sensitivity analysis.

Evolutionary constrained optimization

CERN Document Server

Deb, Kalyanmoy

2015-01-01

This book makes available a self-contained collection of modern research addressing the general constrained optimization problems using evolutionary algorithms. Broadly the topics covered include constraint handling for single and multi-objective optimizations; penalty function based methodology; multi-objective based methodology; new constraint handling mechanism; hybrid methodology; scaling issues in constrained optimization; design of scalable test problems; parameter adaptation in constrained optimization; handling of integer, discrete and mix variables in addition to continuous variables; application of constraint handling techniques to real-world problems; and constrained optimization in dynamic environment. There is also a separate chapter on hybrid optimization, which is gaining lots of popularity nowadays due to its capability of bridging the gap between evolutionary and classical optimization. The material in the book is useful to researchers, novice, and experts alike. The book will also be useful...

The dynamical core of the Aeolus 1.0 statistical-dynamical atmosphere model: validation and parameter optimization

Science.gov (United States)

Totz, Sonja; Eliseev, Alexey V.; Petri, Stefan; Flechsig, Michael; Caesar, Levke; Petoukhov, Vladimir; Coumou, Dim

2018-02-01

We present and validate a set of equations for representing the atmosphere's large-scale general circulation in an Earth system model of intermediate complexity (EMIC). These dynamical equations have been implemented in Aeolus 1.0, which is a statistical-dynamical atmosphere model (SDAM) and includes radiative transfer and cloud modules (Coumou et al., 2011; Eliseev et al., 2013). The statistical dynamical approach is computationally efficient and thus enables us to perform climate simulations at multimillennia timescales, which is a prime aim of our model development. Further, this computational efficiency enables us to scan large and high-dimensional parameter space to tune the model parameters, e.g., for sensitivity studies.Here, we present novel equations for the large-scale zonal-mean wind as well as those for planetary waves. Together with synoptic parameterization (as presented by Coumou et al., 2011), these form the mathematical description of the dynamical core of Aeolus 1.0.We optimize the dynamical core parameter values by tuning all relevant dynamical fields to ERA-Interim reanalysis data (1983-2009) forcing the dynamical core with prescribed surface temperature, surface humidity and cumulus cloud fraction. We test the model's performance in reproducing the seasonal cycle and the influence of the El Niño-Southern Oscillation (ENSO). We use a simulated annealing optimization algorithm, which approximates the global minimum of a high-dimensional function.With non-tuned parameter values, the model performs reasonably in terms of its representation of zonal-mean circulation, planetary waves and storm tracks. The simulated annealing optimization improves in particular the model's representation of the Northern Hemisphere jet stream and storm tracks as well as the Hadley circulation.The regions of high azonal wind velocities (planetary waves) are accurately captured for all validation experiments. The zonal-mean zonal wind and the integrated lower

Three-dimensional biomechanical properties of human vocal folds: Parameter optimization of a numerical model to match in vitro dynamics

Science.gov (United States)

Yang, Anxiong; Berry, David A.; Kaltenbacher, Manfred; Döllinger, Michael

2012-01-01

The human voice signal originates from the vibrations of the two vocal folds within the larynx. The interactions of several intrinsic laryngeal muscles adduct and shape the vocal folds to facilitate vibration in response to airflow. Three-dimensional vocal fold dynamics are extracted from in vitro hemilarynx experiments and fitted by a numerical three-dimensional-multi-mass-model (3DM) using an optimization procedure. In this work, the 3DM dynamics are optimized over 24 experimental data sets to estimate biomechanical vocal fold properties during phonation. Accuracy of the optimization is verified by low normalized error (0.13 ± 0.02), high correlation (83% ± 2%), and reproducible subglottal pressure values. The optimized, 3DM parameters yielded biomechanical variations in tissue properties along the vocal fold surface, including variations in both the local mass and stiffness of vocal folds. That is, both mass and stiffness increased along the superior-to-inferior direction. These variations were statistically analyzed under different experimental conditions (e.g., an increase in tension as a function of vocal fold elongation and an increase in stiffness and a decrease in mass as a function of glottal airflow). The study showed that physiologically relevant vocal fold tissue properties, which cannot be directly measured during in vivo human phonation, can be captured using this 3D-modeling technique. PMID:22352511

Efficiency Optimization by Considering the High Voltage Flyback Transformer Parasitics using an Automatic Winding Layout Technique

DEFF Research Database (Denmark)

Thummala, Prasanth; Schneider, Henrik; Zhang, Zhe

2015-01-01

.The energy efficiency is optimized using a proposed new automatic winding layout (AWL) technique and a comprehensive loss model.The AWL technique generates a large number of transformer winding layouts.The transformer parasitics such as dc resistance, leakage inductance and self-capacitance are calculated...... for each winding layout.An optimization technique is formulated to minimize the sum of energy losses during charge and discharge operations.The efficiency and energy loss distribution results from the optimization routine provide a deep insight into the high voltage transformer designand its impact...

Optimization of Hydraulic Machinery Bladings by Multilevel CFD Techniques

Directory of Open Access Journals (Sweden)

Thum Susanne

2005-01-01

Full Text Available The numerical design optimization for complex hydraulic machinery bladings requires a high number of design parameters and the use of a precise CFD solver yielding high computational costs. To reduce the CPU time needed, a multilevel CFD method has been developed. First of all, the 3D blade geometry is parametrized by means of a geometric design tool to reduce the number of design parameters. To keep geometric accuracy, a special B-spline modification technique has been developed. On the first optimization level, a quasi-3D Euler code (EQ3D is applied. To guarantee a sufficiently accurate result, the code is calibrated by a Navier-Stokes recalculation of the initial design and can be recalibrated after a number of optimization steps by another Navier-Stokes computation. After having got a convergent solution, the optimization process is repeated on the second level using a full 3D Euler code yielding a more accurate flow prediction. Finally, a 3D Navier-Stokes code is applied on the third level to search for the optimum optimorum by means of a fine-tuning of the geometrical parameters. To show the potential of the developed optimization system, the runner blading of a water turbine having a specific speed n q = 41 1 / min was optimized applying the multilevel approach.

A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization.

Science.gov (United States)

Liu, Qingshan; Guo, Zhishan; Wang, Jun

2012-02-01

In this paper, a one-layer recurrent neural network is proposed for solving pseudoconvex optimization problems subject to linear equality and bound constraints. Compared with the existing neural networks for optimization (e.g., the projection neural networks), the proposed neural network is capable of solving more general pseudoconvex optimization problems with equality and bound constraints. Moreover, it is capable of solving constrained fractional programming problems as a special case. The convergence of the state variables of the proposed neural network to achieve solution optimality is guaranteed as long as the designed parameters in the model are larger than the derived lower bounds. Numerical examples with simulation results illustrate the effectiveness and characteristics of the proposed neural network. In addition, an application for dynamic portfolio optimization is discussed. Copyright © 2011 Elsevier Ltd. All rights reserved.

Evolutionary optimization technique for site layout planning

KAUST Repository

El Ansary, Ayman M.

2014-02-01

Solving the site layout planning problem is a challenging task. It requires an iterative approach to satisfy design requirements (e.g. energy efficiency, skyview, daylight, roads network, visual privacy, and clear access to favorite views). These design requirements vary from one project to another based on location and client preferences. In the Gulf region, the most important socio-cultural factor is the visual privacy in indoor space. Hence, most of the residential houses in this region are surrounded by high fences to provide privacy, which has a direct impact on other requirements (e.g. daylight and direction to a favorite view). This paper introduces a novel technique to optimally locate and orient residential buildings to satisfy a set of design requirements. The developed technique is based on genetic algorithm which explores the search space for possible solutions. This study considers two dimensional site planning problems. However, it can be extended to solve three dimensional cases. A case study is presented to demonstrate the efficiency of this technique in solving the site layout planning of simple residential dwellings. © 2013 Elsevier B.V. All rights reserved.

An Adaptive Genetic Algorithm with Dynamic Population Size for Optimizing Join Queries

OpenAIRE

Vellev, Stoyan

2008-01-01

The problem of finding the optimal join ordering executing a query to a relational database management system is a combinatorial optimization problem, which makes deterministic exhaustive solution search unacceptable for queries with a great number of joined relations. In this work an adaptive genetic algorithm with dynamic population size is proposed for optimizing large join queries. The performance of the algorithm is compared with that of several classical non-determinis...

Effects of upper body parameters on biped walking efficiency studied by dynamic optimization

Directory of Open Access Journals (Sweden)

Kang An

2016-12-01

Full Text Available Walking efficiency is one of the considerations for designing biped robots. This article uses the dynamic optimization method to study the effects of upper body parameters, including upper body length and mass, on walking efficiency. Two minimal actuations, hip joint torque and push-off impulse, are used in the walking model, and minimal constraints are set in a free search using the dynamic optimization. Results show that there is an optimal solution of upper body length for the efficient walking within a range of walking speed and step length. For short step length, walking with a lighter upper body mass is found to be more efficient and vice versa. It is also found that for higher speed locomotion, the increase of the upper body length and mass can make the walking gait optimal rather than other kind of gaits. In addition, the typical strategy of an optimal walking gait is that just actuating the swing leg at the beginning of the step.

Doubly Robust Estimation of Optimal Dynamic Treatment Regimes

DEFF Research Database (Denmark)

Barrett, Jessica K; Henderson, Robin; Rosthøj, Susanne

2014-01-01

We compare methods for estimating optimal dynamic decision rules from observational data, with particular focus on estimating the regret functions defined by Murphy (in J. R. Stat. Soc., Ser. B, Stat. Methodol. 65:331-355, 2003). We formulate a doubly robust version of the regret-regression appro......We compare methods for estimating optimal dynamic decision rules from observational data, with particular focus on estimating the regret functions defined by Murphy (in J. R. Stat. Soc., Ser. B, Stat. Methodol. 65:331-355, 2003). We formulate a doubly robust version of the regret......-regression approach of Almirall et al. (in Biometrics 66:131-139, 2010) and Henderson et al. (in Biometrics 66:1192-1201, 2010) and demonstrate that it is equivalent to a reduced form of Robins' efficient g-estimation procedure (Robins, in Proceedings of the Second Symposium on Biostatistics. Springer, New York, pp....... 189-326, 2004). Simulation studies suggest that while the regret-regression approach is most efficient when there is no model misspecification, in the presence of misspecification the efficient g-estimation procedure is more robust. The g-estimation method can be difficult to apply in complex...

Bidirectional Dynamic Diversity Evolutionary Algorithm for Constrained Optimization

Directory of Open Access Journals (Sweden)

Weishang Gao

2013-01-01

Full Text Available Evolutionary algorithms (EAs were shown to be effective for complex constrained optimization problems. However, inflexible exploration-exploitation and improper penalty in EAs with penalty function would lead to losing the global optimum nearby or on the constrained boundary. To determine an appropriate penalty coefficient is also difficult in most studies. In this paper, we propose a bidirectional dynamic diversity evolutionary algorithm (Bi-DDEA with multiagents guiding exploration-exploitation through local extrema to the global optimum in suitable steps. In Bi-DDEA potential advantage is detected by three kinds of agents. The scale and the density of agents will change dynamically according to the emerging of potential optimal area, which play an important role of flexible exploration-exploitation. Meanwhile, a novel double optimum estimation strategy with objective fitness and penalty fitness is suggested to compute, respectively, the dominance trend of agents in feasible region and forbidden region. This bidirectional evolving with multiagents can not only effectively avoid the problem of determining penalty coefficient but also quickly converge to the global optimum nearby or on the constrained boundary. By examining the rapidity and veracity of Bi-DDEA across benchmark functions, the proposed method is shown to be effective.

Conceptual Design Optimization of an Augmented Stability Aircraft Incorporating Dynamic Response Performance Constraints

Science.gov (United States)

Welstead, Jason

2014-01-01

This research focused on incorporating stability and control into a multidisciplinary de- sign optimization on a Boeing 737-class advanced concept called the D8.2b. A new method of evaluating the aircraft handling performance using quantitative evaluation of the sys- tem to disturbances, including perturbations, continuous turbulence, and discrete gusts, is presented. A multidisciplinary design optimization was performed using the D8.2b transport air- craft concept. The con guration was optimized for minimum fuel burn using a design range of 3,000 nautical miles. Optimization cases were run using xed tail volume coecients, static trim constraints, and static trim and dynamic response constraints. A Cessna 182T model was used to test the various dynamic analysis components, ensuring the analysis was behaving as expected. Results of the optimizations show that including stability and con- trol in the design process drastically alters the optimal design, indicating that stability and control should be included in conceptual design to avoid system level penalties later in the design process.

Multivariate Analysis Techniques for Optimal Vision System Design

DEFF Research Database (Denmark)

Sharifzadeh, Sara

The present thesis considers optimization of the spectral vision systems used for quality inspection of food items. The relationship between food quality, vision based techniques and spectral signature are described. The vision instruments for food analysis as well as datasets of the food items...... used in this thesis are described. The methodological strategies are outlined including sparse regression and pre-processing based on feature selection and extraction methods, supervised versus unsupervised analysis and linear versus non-linear approaches. One supervised feature selection algorithm...... (SSPCA) and DCT based characterization of the spectral diffused reflectance images for wavelength selection and discrimination. These methods together with some other state-of-the-art statistical and mathematical analysis techniques are applied on datasets of different food items; meat, diaries, fruits...

Application of chaos-based chaotic invasive weed optimization techniques for environmental OPF problems in the power system

International Nuclear Information System (INIS)

Ghasemi, Mojtaba; Ghavidel, Sahand; Aghaei, Jamshid; Gitizadeh, Mohsen; Falah, Hasan

2014-01-01

Highlights: • Chaotic invasive weed optimization techniques based on chaos. • Nonlinear environmental OPF problem considering non-smooth fuel cost curves. • A comparative study of CIWO techniques for environmental OPF problem. - Abstract: This paper presents efficient chaotic invasive weed optimization (CIWO) techniques based on chaos for solving optimal power flow (OPF) problems with non-smooth generator fuel cost functions (non-smooth OPF) with the minimum pollution level (environmental OPF) in electric power systems. OPF problem is used for developing corrective strategies and to perform least cost dispatches. However, cost based OPF problem solutions usually result in unattractive system gaze emission issue (environmental OPF). In the present paper, the OPF problem is formulated by considering the emission issue. The total emission can be expressed as a non-linear function of power generation, as a multi-objective optimization problem, where optimal control settings for simultaneous minimization of fuel cost and gaze emission issue are obtained. The IEEE 30-bus test power system is presented to illustrate the application of the environmental OPF problem using CIWO techniques. Our experimental results suggest that CIWO techniques hold immense promise to appear as efficient and powerful algorithm for optimization in the power systems

Distributed Optimal Consensus Control for Nonlinear Multiagent System With Unknown Dynamic.

Science.gov (United States)

Zhang, Jilie; Zhang, Huaguang; Feng, Tao

2017-08-01

This paper focuses on the distributed optimal cooperative control for continuous-time nonlinear multiagent systems (MASs) with completely unknown dynamics via adaptive dynamic programming (ADP) technology. By introducing predesigned extra compensators, the augmented neighborhood error systems are derived, which successfully circumvents the system knowledge requirement for ADP. It is revealed that the optimal consensus protocols actually work as the solutions of the MAS differential game. Policy iteration algorithm is adopted, and it is theoretically proved that the iterative value function sequence strictly converges to the solution of the coupled Hamilton-Jacobi-Bellman equation. Based on this point, a novel online iterative scheme is proposed, which runs based on the data sampled from the augmented system and the gradient of the value function. Neural networks are employed to implement the algorithm and the weights are updated, in the least-square sense, to the ideal value, which yields approximated optimal consensus protocols. Finally, a numerical example is given to illustrate the effectiveness of the proposed scheme.

Combinatorial Optimization Algorithms for Dynamic Multiple Fault Diagnosis in Automotive and Aerospace Applications

Science.gov (United States)

Kodali, Anuradha

outcomes of multiple binary classifiers over time using a sliding window or block dynamic fusion method that exploits temporal data correlations over time. We solve this NP-hard optimization problem via a Lagrangian relaxation (variational) technique. The third step optimizes the classifier parameters, viz., probabilities of detection and false alarm, using a genetic algorithm. The proposed algorithm is demonstrated by computing the diagnostic performance metrics on a twin-spool commercial jet engine, an automotive engine, and UCI datasets (problems with high classification error are specifically chosen for experimentation). We show that the primal-dual optimization framework performed consistently better than any traditional fusion technique, even when it is forced to give a single fault decision across a range of classification problems. Secondly, we implement the inference algorithms to diagnose faults in vehicle systems that are controlled by a network of electronic control units (ECUs). The faults, originating from various interactions and especially between hardware and software, are particularly challenging to address. Our basic strategy is to divide the fault universe of such cyber-physical systems in a hierarchical manner, and monitor the critical variables/signals that have impact at different levels of interactions. The proposed diagnostic strategy is validated on an electrical power generation and storage system (EPGS) controlled by two ECUs in an environment with CANoe/MATLAB co-simulation. Eleven faults are injected with the failures originating in actuator hardware, sensor, controller hardware and software components. Diagnostic matrix is established to represent the relationship between the faults and the test outcomes (also known as fault signatures) via simulations. The results show that the proposed diagnostic strategy is effective in addressing the interaction-caused faults.

Comparison of non-invasive electrohysterographic recording techniques for monitoring uterine dynamics.

Science.gov (United States)

Alberola-Rubio, J; Prats-Boluda, G; Ye-Lin, Y; Valero, J; Perales, A; Garcia-Casado, J

2013-12-01

Non-invasive recording of uterine myoelectric activity (electrohysterogram, EHG) could provide an alternative to monitoring uterine dynamics by systems based on tocodynamometers (TOCO). Laplacian recording of bioelectric signals has been shown to give better spatial resolution and less interference than mono- and bipolar surface recordings. The aim of this work was to study the signal quality obtained from monopolar, bipolar and Laplacian techniques in EHG recordings, as well as to assess their ability to detect uterine contractions. Twenty-two recording sessions were carried out on singleton pregnant women during the active phase of labour. In each session the following simultaneous recordings were obtained: internal uterine pressure (IUP), external tension of abdominal wall (TOCO) and EHG signals (5 monopolar and 4 bipolar recordings, 1 discrete approximation to the Laplacian of the potential and 2 estimates of the Laplacian from two active annular electrodes). The results obtained show that EHG is able to detect a higher number of uterine contractions than TOCO. Laplacian recordings give improved signal quality over monopolar and bipolar techniques, reduce maternal cardiac interference and improve the signal-to-noise ratio. The optimal position for recording EHG was found to be the uterine median axis and the lower centre-right umbilical zone. Copyright © 2013 IPEM. Published by Elsevier Ltd. All rights reserved.

Online adaptive optimal control for continuous-time nonlinear systems with completely unknown dynamics

Science.gov (United States)

Lv, Yongfeng; Na, Jing; Yang, Qinmin; Wu, Xing; Guo, Yu

2016-01-01

An online adaptive optimal control is proposed for continuous-time nonlinear systems with completely unknown dynamics, which is achieved by developing a novel identifier-critic-based approximate dynamic programming algorithm with a dual neural network (NN) approximation structure. First, an adaptive NN identifier is designed to obviate the requirement of complete knowledge of system dynamics, and a critic NN is employed to approximate the optimal value function. Then, the optimal control law is computed based on the information from the identifier NN and the critic NN, so that the actor NN is not needed. In particular, a novel adaptive law design method with the parameter estimation error is proposed to online update the weights of both identifier NN and critic NN simultaneously, which converge to small neighbourhoods around their ideal values. The closed-loop system stability and the convergence to small vicinity around the optimal solution are all proved by means of the Lyapunov theory. The proposed adaptation algorithm is also improved to achieve finite-time convergence of the NN weights. Finally, simulation results are provided to exemplify the efficacy of the proposed methods.

Optimal dynamic pricing and replenishment policy for perishable items with inventory-level-dependent demand

Science.gov (United States)

Lu, Lihao; Zhang, Jianxiong; Tang, Wansheng

2016-04-01

An inventory system for perishable items with limited replenishment capacity is introduced in this paper. The demand rate depends on the stock quantity displayed in the store as well as the sales price. With the goal to realise profit maximisation, an optimisation problem is addressed to seek for the optimal joint dynamic pricing and replenishment policy which is obtained by solving the optimisation problem with Pontryagin's maximum principle. A joint mixed policy, in which the sales price is a static decision variable and the replenishment rate remains to be a dynamic decision variable, is presented to compare with the joint dynamic policy. Numerical results demonstrate the advantages of the joint dynamic one, and further show the effects of different system parameters on the optimal joint dynamic policy and the maximal total profit.

Topology optimization of flow problems

DEFF Research Database (Denmark)

Gersborg, Allan Roulund

2007-01-01

This thesis investigates how to apply topology optimization using the material distribution technique to steady-state viscous incompressible flow problems. The target design applications are fluid devices that are optimized with respect to minimizing the energy loss, characteristic properties...... transport in 2D Stokes flow. Using Stokes flow limits the range of applications; nonetheless, the thesis gives a proof-of-concept for the application of the method within fluid dynamic problems and it remains of interest for the design of microfluidic devices. Furthermore, the thesis contributes...... at the Technical University of Denmark. Large topology optimization problems with 2D and 3D Stokes flow modeling are solved with direct and iterative strategies employing the parallelized Sun Performance Library and the OpenMP parallelization technique, respectively....

Nonlinear dynamics optimization with particle swarm and genetic algorithms for SPEAR3 emittance upgrade

International Nuclear Information System (INIS)

Huang, Xiaobiao; Safranek, James

2014-01-01

Nonlinear dynamics optimization is carried out for a low emittance upgrade lattice of SPEAR3 in order to improve its dynamic aperture and Touschek lifetime. Two multi-objective optimization algorithms, a genetic algorithm and a particle swarm algorithm, are used for this study. The performance of the two algorithms are compared. The result shows that the particle swarm algorithm converges significantly faster to similar or better solutions than the genetic algorithm and it does not require seeding of good solutions in the initial population. These advantages of the particle swarm algorithm may make it more suitable for many accelerator optimization applications

Nonlinear dynamics optimization with particle swarm and genetic algorithms for SPEAR3 emittance upgrade

Energy Technology Data Exchange (ETDEWEB)

Huang, Xiaobiao, E-mail: xiahuang@slac.stanford.edu; Safranek, James

2014-09-01

Nonlinear dynamics optimization is carried out for a low emittance upgrade lattice of SPEAR3 in order to improve its dynamic aperture and Touschek lifetime. Two multi-objective optimization algorithms, a genetic algorithm and a particle swarm algorithm, are used for this study. The performance of the two algorithms are compared. The result shows that the particle swarm algorithm converges significantly faster to similar or better solutions than the genetic algorithm and it does not require seeding of good solutions in the initial population. These advantages of the particle swarm algorithm may make it more suitable for many accelerator optimization applications.

Infiltration route analysis using thermal observation devices (TOD) and optimization techniques in a GIS environment.

Science.gov (United States)

Bang, Soonam; Heo, Joon; Han, Soohee; Sohn, Hong-Gyoo

2010-01-01

Infiltration-route analysis is a military application of geospatial information system (GIS) technology. In order to find susceptible routes, optimal-path-searching algorithms are applied to minimize the cost function, which is the summed result of detection probability. The cost function was determined according to the thermal observation device (TOD) detection probability, the viewshed analysis results, and two feature layers extracted from the vector product interim terrain data. The detection probability is computed and recorded for an individual cell (50 m × 50 m), and the optimal infiltration routes are determined with A* algorithm by minimizing the summed costs on the routes from a start point to an end point. In the present study, in order to simulate the dynamic nature of a real-world problem, one thousand cost surfaces in the GIS environment were generated with randomly located TODs and randomly selected infiltration start points. Accordingly, one thousand sets of vulnerable routes for infiltration purposes could be found, which could be accumulated and presented as an infiltration vulnerability map. This application can be further utilized for both optimal infiltration routing and surveillance network design. Indeed, dynamic simulation in the GIS environment is considered to be a powerful and practical solution for optimization problems. A similar approach can be applied to the dynamic optimal routing for civil infrastructure, which requires consideration of terrain-related constraints and cost functions.

Machine Learning Techniques in Optimal Design

Science.gov (United States)

Cerbone, Giuseppe

1992-01-01

Many important applications can be formalized as constrained optimization tasks. For example, we are studying the engineering domain of two-dimensional (2-D) structural design. In this task, the goal is to design a structure of minimum weight that bears a set of loads. A solution to a design problem in which there is a single load (L) and two stationary support points (S1 and S2) consists of four members, E1, E2, E3, and E4 that connect the load to the support points is discussed. In principle, optimal solutions to problems of this kind can be found by numerical optimization techniques. However, in practice [Vanderplaats, 1984] these methods are slow and they can produce different local solutions whose quality (ratio to the global optimum) varies with the choice of starting points. Hence, their applicability to real-world problems is severely restricted. To overcome these limitations, we propose to augment numerical optimization by first performing a symbolic compilation stage to produce: (a) objective functions that are faster to evaluate and that depend less on the choice of the starting point and (b) selection rules that associate problem instances to a set of recommended solutions. These goals are accomplished by successive specializations of the problem class and of the associated objective functions. In the end, this process reduces the problem to a collection of independent functions that are fast to evaluate, that can be differentiated symbolically, and that represent smaller regions of the overall search space. However, the specialization process can produce a large number of sub-problems. This is overcome by deriving inductively selection rules which associate problems to small sets of specialized independent sub-problems. Each set of candidate solutions is chosen to minimize a cost function which expresses the tradeoff between the quality of the solution that can be obtained from the sub-problem and the time it takes to produce it. The overall solution

Evaluation of EMG processing techniques using Information Theory.

Science.gov (United States)

Farfán, Fernando D; Politti, Julio C; Felice, Carmelo J

2010-11-12

Electromyographic signals can be used in biomedical engineering and/or rehabilitation field, as potential sources of control for prosthetics and orthotics. In such applications, digital processing techniques are necessary to follow efficient and effectively the changes in the physiological characteristics produced by a muscular contraction. In this paper, two methods based on information theory are proposed to evaluate the processing techniques. These methods determine the amount of information that a processing technique is able to extract from EMG signals. The processing techniques evaluated with these methods were: absolute mean value (AMV), RMS values, variance values (VAR) and difference absolute mean value (DAMV). EMG signals from the middle deltoid during abduction and adduction movement of the arm in the scapular plane was registered, for static and dynamic contractions. The optimal window length (segmentation), abduction and adduction movements and inter-electrode distance were also analyzed. Using the optimal segmentation (200 ms and 300 ms in static and dynamic contractions, respectively) the best processing techniques were: RMS, AMV and VAR in static contractions, and only the RMS in dynamic contractions. Using the RMS of EMG signal, variations in the amount of information between the abduction and adduction movements were observed. Although the evaluation methods proposed here were applied to standard processing techniques, these methods can also be considered as alternatives tools to evaluate new processing techniques in different areas of electrophysiology.

Identification of hierarchy of dynamic domains in proteins: comparison of HDWA and HCCP techniques

Directory of Open Access Journals (Sweden)

Yesylevskyy S. O.

2010-07-01

Full Text Available Aim. There are several techniques for the identification of hierarchy of dynamic domains in proteins. The goal of this work is to compare systematically two recently developed techniques, HCCP and HDWA,on a set of proteins from diverse structural classes. Methods. HDWA and HCCP techniques are used. The HDWA technique is designed to identify hierarchically organized dynamic domains in proteins using the Molecular Dynamics (MD trajectories, while HCCP utilizes the normal modes of simplified elastic network models. Results. It is shown that the dynamic domains found by HDWA are consistent with the domains identified by HCCP and other techniques. At the same time HDWA identifies flexible mobile loops of proteins correctly, which is hard to achieve with other model-based domain identification techniques. Conclusion. HDWA is shown to be a powerful method of analysis of MD trajectories, which can be used in various areas of protein science.

Optimally combining dynamical decoupling and quantum error correction.

Science.gov (United States)

Paz-Silva, Gerardo A; Lidar, D A

2013-01-01

Quantum control and fault-tolerant quantum computing (FTQC) are two of the cornerstones on which the hope of realizing a large-scale quantum computer is pinned, yet only preliminary steps have been taken towards formalizing the interplay between them. Here we explore this interplay using the powerful strategy of dynamical decoupling (DD), and show how it can be seamlessly and optimally integrated with FTQC. To this end we show how to find the optimal decoupling generator set (DGS) for various subspaces relevant to FTQC, and how to simultaneously decouple them. We focus on stabilizer codes, which represent the largest contribution to the size of the DGS, showing that the intuitive choice comprising the stabilizers and logical operators of the code is in fact optimal, i.e., minimizes a natural cost function associated with the length of DD sequences. Our work brings hybrid DD-FTQC schemes, and their potentially considerable advantages, closer to realization.

An improved technique for the prediction of optimal image resolution ...

African Journals Online (AJOL)

user

2010-10-04

Oct 4, 2010 ... Available online at http://www.academicjournals.org/AJEST ... robust technique for predicting optimal image resolution for the mapping of savannah ecosystems was developed. .... whether to purchase multi-spectral imagery acquired by GeoEye-2 ..... Analysis of the spectral behaviour of the pasture class in.

Optimal Control of Mechanical Systems

Directory of Open Access Journals (Sweden)

Vadim Azhmyakov

2007-01-01

Full Text Available In the present work, we consider a class of nonlinear optimal control problems, which can be called “optimal control problems in mechanics.” We deal with control systems whose dynamics can be described by a system of Euler-Lagrange or Hamilton equations. Using the variational structure of the solution of the corresponding boundary-value problems, we reduce the initial optimal control problem to an auxiliary problem of multiobjective programming. This technique makes it possible to apply some consistent numerical approximations of a multiobjective optimization problem to the initial optimal control problem. For solving the auxiliary problem, we propose an implementable numerical algorithm.

Comparison of particle swarm optimization and dynamic programming for large scale hydro unit load dispatch

International Nuclear Information System (INIS)

Cheng Chuntian; Liao Shengli; Tang Zitian; Zhao Mingyan

2009-01-01

Dynamic programming (DP) is one of classic and sophisticated optimization methods that have successfully been applied to solve the problem of hydro unit load dispatch (HULD). However, DP will be faced with the curse of dimensionality with the increase of unit number and installed generating capacity of hydropower station. With the appearance of the huge hydropower station similar to the Three George with 26 generators of 700 MW, it is hard to apply the DP to large scale HULD problem. It is crucial to seek for other optimization techniques in order to improve the operation quality and efficiency. Different with the most of literature about power generation scheduling that focused on the comparisons of novel PSO algorithms with other techniques, the paper will pay emphasis on comparison study of PSO with DP based on a case hydropower station. The objective of study is to seek for an effective and feasible method for the large scale of hydropower station of the current and future in China. This paper first compares the performance of PSO and DP using a sample load curve of the Wujiangdu hydropower plant located in the upper stream of the Yangtze River in China and contained five units with the installed capacity of 1250 MW. Next, the effect of different load interval and unit number on the optimal results and efficiency of two methods has also been implemented. The comparison results show that the PSO is feasible for HULD. Furthermore, we simulated the effect of the magnitude of unit number and load capacity on the optimal results and cost time. The simulation comparisons show that PSO has a great advantage over DP in the efficiency and will be one of effective methods for HULD problem of huge hydropower stations.

Comparison of particle swarm optimization and dynamic programming for large scale hydro unit load dispatch

Energy Technology Data Exchange (ETDEWEB)

Cheng Chuntian, E-mail: ctcheng@dlut.edu.c [Department of Civil and Hydraulic Engineering, Dalian University of Technology, 116024 Dalian (China); Liao Shengli; Tang Zitian [Department of Civil and Hydraulic Engineering, Dalian University of Technology, 116024 Dalian (China); Zhao Mingyan [Department of Environmental Science and Engineering, Tsinghua University, 100084 Beijing (China)

2009-12-15

Dynamic programming (DP) is one of classic and sophisticated optimization methods that have successfully been applied to solve the problem of hydro unit load dispatch (HULD). However, DP will be faced with the curse of dimensionality with the increase of unit number and installed generating capacity of hydropower station. With the appearance of the huge hydropower station similar to the Three George with 26 generators of 700 MW, it is hard to apply the DP to large scale HULD problem. It is crucial to seek for other optimization techniques in order to improve the operation quality and efficiency. Different with the most of literature about power generation scheduling that focused on the comparisons of novel PSO algorithms with other techniques, the paper will pay emphasis on comparison study of PSO with DP based on a case hydropower station. The objective of study is to seek for an effective and feasible method for the large scale of hydropower station of the current and future in China. This paper first compares the performance of PSO and DP using a sample load curve of the Wujiangdu hydropower plant located in the upper stream of the Yangtze River in China and contained five units with the installed capacity of 1250 MW. Next, the effect of different load interval and unit number on the optimal results and efficiency of two methods has also been implemented. The comparison results show that the PSO is feasible for HULD. Furthermore, we simulated the effect of the magnitude of unit number and load capacity on the optimal results and cost time. The simulation comparisons show that PSO has a great advantage over DP in the efficiency and will be one of effective methods for HULD problem of huge hydropower stations.

Comparison of particle swarm optimization and dynamic programming for large scale hydro unit load dispatch

Energy Technology Data Exchange (ETDEWEB)

Chun-tian Cheng; Sheng-li Liao; Zi-Tian Tang [Dept. of Civil and Hydraulic Engineering, Dalian Univ. of Technology, 116024 Dalian (China); Ming-yan Zhao [Dept. of Environmental Science and Engineering, Tsinghua Univ., 100084 Beijing (China)

2009-12-15

Dynamic programming (DP) is one of classic and sophisticated optimization methods that have successfully been applied to solve the problem of hydro unit load dispatch (HULD). However, DP will be faced with the curse of dimensionality with the increase of unit number and installed generating capacity of hydropower station. With the appearance of the huge hydropower station similar to the Three George with 26 generators of 700 MW, it is hard to apply the DP to large scale HULD problem. It is crucial to seek for other optimization techniques in order to improve the operation quality and efficiency. Different with the most of literature about power generation scheduling that focused on the comparisons of novel PSO algorithms with other techniques, the paper will pay emphasis on comparison study of PSO with DP based on a case hydropower station. The objective of study is to seek for an effective and feasible method for the large scale of hydropower station of the current and future in China. This paper first compares the performance of PSO and DP using a sample load curve of the Wujiangdu hydropower plant located in the upper stream of the Yangtze River in China and contained five units with the installed capacity of 1250 MW. Next, the effect of different load interval and unit number on the optimal results and efficiency of two methods has also been implemented. The comparison results show that the PSO is feasible for HULD. Furthermore, we simulated the effect of the magnitude of unit number and load capacity on the optimal results and cost time. The simulation comparisons show that PSO has a great advantage over DP in the efficiency and will be one of effective methods for HULD problem of huge hydropower stations. (author)

The optimal injection technique for the osteoarthritic ankle: A randomized, cross-over trial

NARCIS (Netherlands)

Witteveen, Angelique G. H.; Kok, Aimee; Sierevelt, Inger N.; Kerkhoffs, Gino M. M. J.; van Dijk, C. Niek

2013-01-01

Background: To optimize the injection technique for the osteoarthritic ankle in order to enhance the effect of intra-articular injections and minimize adverse events. Methods: Randomized cross-over trial. Comparing two injection techniques in patients with symptomatic ankle osteoarthritis. Patients

A dynamic optimization on economic energy efficiency in development: A numerical case of China

International Nuclear Information System (INIS)

Wang, Dong

2014-01-01

This paper is based on dynamic optimization methodology to investigate the economic energy efficiency issues in developing countries. The paper introduces some definitions about energy efficiency both in economics and physics, and establishes a quantitative way for measuring the economic energy efficiency. The linkage between economic energy efficiency, energy consumption and other macroeconomic variables is demonstrated primarily. Using the methodology of dynamic optimization, a maximum problem of economic energy efficiency over time, which is subjected to the extended Solow growth model and instantaneous investment rate, is modelled. In this model, the energy consumption is set as a control variable and the capital is regarded as a state variable. The analytic solutions can be derived and the diagrammatic analysis provides saddle-point equilibrium. A numerical simulation based on China is also presented; meanwhile, the optimal paths of investment and energy consumption can be drawn. The dynamic optimization encourages governments in developing countries to pursue higher economic energy efficiency by controlling the energy consumption and regulating the investment state as it can conserve energy without influencing the achievement of steady state in terms of Solow model. If that, a sustainable development will be achieved. - Highlights: • A new definition on economic energy efficiency is proposed mathematically. • A dynamic optimization modelling links economic energy efficiency with other macroeconomic variables in long run. • Economic energy efficiency is determined by capital stock level and energy consumption. • Energy saving is a key solution for improving economic energy efficiency

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

New Techniques for Optimal Treatment Planning for LINAC-based Sterotactic Radiosurgery

International Nuclear Information System (INIS)

Suh, Tae Suk

1992-01-01

Since LINAC-based stereotactic radiosurgery uses multiple noncoplanar arcs, three-dimensional dose evaluation and many beam parameters, a lengthy computation time is required to optimize even the simplest case by a trial and error. The basic approach presented in this paper is to show promising methods using an experimental optimization and an analytic optimization. The purpose of this paper is not to describe the detailed methods, but introduce briefly, proceeding research done currently or in near future. A more detailed description will be shown in ongoing published papers. Experimental optimization is based on two approaches. One is shaping the target volumes through the use of multiple isocenters determined from dose experience and testing. The other method is conformal therapy using a beam eye view technique and field shaping. The analytic approach is to adapt computer-aided design optimization in finding optimum irradiation parameters automatically

Optimized Bayesian dynamic advising theory and algorithms

CERN Document Server

Karny, Miroslav

2006-01-01

Written by one of the world's leading groups in the area of Bayesian identification, control, and decision making, this book provides the theoretical and algorithmic basis of optimized probabilistic advising. Starting from abstract ideas and formulations, and culminating in detailed algorithms, the book comprises a unified treatment of an important problem of the design of advisory systems supporting supervisors of complex processes. It introduces the theoretical and algorithmic basis of developed advising, relying on novel and powerful combination black-box modelling by dynamic mixture models

Resizing Technique-Based Hybrid Genetic Algorithm for Optimal Drift Design of Multistory Steel Frame Buildings

Directory of Open Access Journals (Sweden)

Hyo Seon Park

2014-01-01

Full Text Available Since genetic algorithm-based optimization methods are computationally expensive for practical use in the field of structural optimization, a resizing technique-based hybrid genetic algorithm for the drift design of multistory steel frame buildings is proposed to increase the convergence speed of genetic algorithms. To reduce the number of structural analyses required for the convergence, a genetic algorithm is combined with a resizing technique that is an efficient optimal technique to control the drift of buildings without the repetitive structural analysis. The resizing technique-based hybrid genetic algorithm proposed in this paper is applied to the minimum weight design of three steel frame buildings. To evaluate the performance of the algorithm, optimum weights, computational times, and generation numbers from the proposed algorithm are compared with those from a genetic algorithm. Based on the comparisons, it is concluded that the hybrid genetic algorithm shows clear improvements in convergence properties.

A CMOS-compatible silicon substrate optimization technique and its application in radio frequency crosstalk isolation

International Nuclear Information System (INIS)

Li Chen; Liao Huailin; Huang Ru; Wang Yangyuan

2008-01-01

In this paper, a complementary metal-oxide semiconductor (CMOS)-compatible silicon substrate optimization technique is proposed to achieve effective isolation. The selective growth of porous silicon is used to effectively suppress the substrate crosstalk. The isolation structures are fabricated in standard CMOS process and then this post-CMOS substrate optimization technique is carried out to greatly improve the performances of crosstalk isolation. Three-dimensional electro-magnetic simulation is implemented to verify the obvious effect of our substrate optimization technique. The morphologies and growth condition of porous silicon fabricated have been investigated in detail. Furthermore, a thick selectively grown porous silicon (SGPS) trench for crosstalk isolation has been formed and about 20dB improvement in substrate isolation is achieved. These results demonstrate that our post-CMOS SGPS technique is very promising for RF IC applications. (cross-disciplinary physics and related areas of science and technology)

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.

Application of Nontraditional Optimization Techniques for Airfoil Shape Optimization

Directory of Open Access Journals (Sweden)

R. Mukesh

2012-01-01

Full Text Available The method of optimization algorithms is one of the most important parameters which will strongly influence the fidelity of the solution during an aerodynamic shape optimization problem. Nowadays, various optimization methods, such as genetic algorithm (GA, simulated annealing (SA, and particle swarm optimization (PSO, are more widely employed to solve the aerodynamic shape optimization problems. In addition to the optimization method, the geometry parameterization becomes an important factor to be considered during the aerodynamic shape optimization process. The objective of this work is to introduce the knowledge of describing general airfoil geometry using twelve parameters by representing its shape as a polynomial function and coupling this approach with flow solution and optimization algorithms. An aerodynamic shape optimization problem is formulated for NACA 0012 airfoil and solved using the methods of simulated annealing and genetic algorithm for 5.0 deg angle of attack. The results show that the simulated annealing optimization scheme is more effective in finding the optimum solution among the various possible solutions. It is also found that the SA shows more exploitation characteristics as compared to the GA which is considered to be more effective explorer.

Optimization long hole blast fragmentation techniques and detonating circuit underground uranium mine stope

International Nuclear Information System (INIS)

Li Qin; Yang Lizhi; Song Lixia; Qin De'en; Xue Yongshe; Wang Zhipeng

2012-01-01

Aim at high rate of large blast fragmentation, a big difficulty in long hole drilling and blasting underground uranium mine stope, it is pointed out at the same time of taking integrated technical management measures, the key is to optimize the drilling and blasting parameters and insure safety the act of one that primes, adopt 'minimum burden' blasting technique, renew the stope fragmentation process, and use new process of hole bottom indirect initiation fragmentation; optimize the detonating circuit and use safe, reliable and economically rational duplex non-electric detonating circuit. The production practice shows that under the guarantee of strictly controlled construction quality, the application of optimized blast fragmentation technique has enhanced the reliability of safety detonation and preferably solved the problem of high rate of large blast fragments. (authors)

Research on Dynamic Optimization for Road-friendly Vehicle Suspension

Directory of Open Access Journals (Sweden)

Lu Yongjie

2014-10-01

Full Text Available The heavy vehicle brings large dynamic loads to the road surface, which would reduce vehicle ride comfort and shorten road service life. The structure characteristic of heavy vehicle suspension has a significant impact on vehicle performance. Based on the D'Alembert principle, the dynamics models of independent and integral balanced suspension are proposed considering mass and inertia of balancing rod. The sprung mass acceleration and the tire dynamic force for two kinds of balanced suspension and the traditional quarter vehicle model are compared in frequency-domain and time-domain respectively. It is concluded that a quarter vehicle model simplified for balanced suspension could be used to evaluate the ride comfort of vehicle well, but it has some limitations in assessing the vehicle road-friendliness. Then, the sprung mass acceleration and the road damage coefficients are also analyzed under different vehicle design and running parameters at detail. Some conclusions are obtained: low suspension stiffness, high suspension damping and low tire stiffness are all favorable to improve vehicle performance; there is a saturation range of suspension damping enhancing vehicle performance; improving the road surface roughness and avoiding the no-load running are two effective methods to accomplish the better ride comfort and road-friendliness. The suspension stiffness and damping parameters are chosen for optimal parameters matching of road friendliness based on the approximation optimization method.

A parameters optimization method for planar joint clearance model and its application for dynamics simulation of reciprocating compressor

Science.gov (United States)

Hai-yang, Zhao; Min-qiang, Xu; Jin-dong, Wang; Yong-bo, Li

2015-05-01

In order to improve the accuracy of dynamics response simulation for mechanism with joint clearance, a parameter optimization method for planar joint clearance contact force model was presented in this paper, and the optimized parameters were applied to the dynamics response simulation for mechanism with oversized joint clearance fault. By studying the effect of increased clearance on the parameters of joint clearance contact force model, the relation of model parameters between different clearances was concluded. Then the dynamic equation of a two-stage reciprocating compressor with four joint clearances was developed using Lagrange method, and a multi-body dynamic model built in ADAMS software was used to solve this equation. To obtain a simulated dynamic response much closer to that of experimental tests, the parameters of joint clearance model, instead of using the designed values, were optimized by genetic algorithms approach. Finally, the optimized parameters were applied to simulate the dynamics response of model with oversized joint clearance fault according to the concluded parameter relation. The dynamics response of experimental test verified the effectiveness of this application.

Extensions of Dynamic Programming: Decision Trees, Combinatorial Optimization, and Data Mining

KAUST Repository

Hussain, Shahid

2016-01-01

This thesis is devoted to the development of extensions of dynamic programming to the study of decision trees. The considered extensions allow us to make multi-stage optimization of decision trees relative to a sequence of cost functions, to count the number of optimal trees, and to study relationships: cost vs cost and cost vs uncertainty for decision trees by construction of the set of Pareto-optimal points for the corresponding bi-criteria optimization problem. The applications include study of totally optimal (simultaneously optimal relative to a number of cost functions) decision trees for Boolean functions, improvement of bounds on complexity of decision trees for diagnosis of circuits, study of time and memory trade-off for corner point detection, study of decision rules derived from decision trees, creation of new procedure (multi-pruning) for construction of classifiers, and comparison of heuristics for decision tree construction. Part of these extensions (multi-stage optimization) was generalized to well-known combinatorial optimization problems: matrix chain multiplication, binary search trees, global sequence alignment, and optimal paths in directed graphs.

Extensions of Dynamic Programming: Decision Trees, Combinatorial Optimization, and Data Mining

KAUST Repository

Hussain, Shahid

2016-07-10

This thesis is devoted to the development of extensions of dynamic programming to the study of decision trees. The considered extensions allow us to make multi-stage optimization of decision trees relative to a sequence of cost functions, to count the number of optimal trees, and to study relationships: cost vs cost and cost vs uncertainty for decision trees by construction of the set of Pareto-optimal points for the corresponding bi-criteria optimization problem. The applications include study of totally optimal (simultaneously optimal relative to a number of cost functions) decision trees for Boolean functions, improvement of bounds on complexity of decision trees for diagnosis of circuits, study of time and memory trade-off for corner point detection, study of decision rules derived from decision trees, creation of new procedure (multi-pruning) for construction of classifiers, and comparison of heuristics for decision tree construction. Part of these extensions (multi-stage optimization) was generalized to well-known combinatorial optimization problems: matrix chain multiplication, binary search trees, global sequence alignment, and optimal paths in directed graphs.

Dynamic programming for optimization of timber production and grazing in ponderosa pine

Science.gov (United States)

Kurt H. Riitters; J. Douglas Brodie; David W. Hann

1982-01-01

Dynamic programming procedures are presented for optimizing thinning and rotation of even-aged ponderosa pine by using the four descriptors: age, basal area, number of trees, and time since thinning. Because both timber yield and grazing yield are functions of stand density, the two outputs-forage and timber-can both be optimized. The soil expectation values for single...

Optimal Stochastic Control Problem for General Linear Dynamical Systems in Neuroscience

Directory of Open Access Journals (Sweden)

Yan Chen

2017-01-01

Full Text Available This paper considers a d-dimensional stochastic optimization problem in neuroscience. Suppose the arm’s movement trajectory is modeled by high-order linear stochastic differential dynamic system in d-dimensional space, the optimal trajectory, velocity, and variance are explicitly obtained by using stochastic control method, which allows us to analytically establish exact relationships between various quantities. Moreover, the optimal trajectory is almost a straight line for a reaching movement; the optimal velocity bell-shaped and the optimal variance are consistent with the experimental Fitts law; that is, the longer the time of a reaching movement, the higher the accuracy of arriving at the target position, and the results can be directly applied to designing a reaching movement performed by a robotic arm in a more general environment.

Global optimization for quantum dynamics of few-fermion systems

Science.gov (United States)

Li, Xikun; Pecak, Daniel; Sowiński, Tomasz; Sherson, Jacob; Nielsen, Anne E. B.

2018-03-01

Quantum state preparation is vital to quantum computation and quantum information processing tasks. In adiabatic state preparation, the target state is theoretically obtained with nearly perfect fidelity if the control parameter is tuned slowly enough. As this, however, leads to slow dynamics, it is often desirable to be able to carry out processes more rapidly. In this work, we employ two global optimization methods to estimate the quantum speed limit for few-fermion systems confined in a one-dimensional harmonic trap. Such systems can be produced experimentally in a well-controlled manner. We determine the optimized control fields and achieve a reduction in the ramping time of more than a factor of four compared to linear ramping. We also investigate how robust the fidelity is to small variations of the control fields away from the optimized shapes.

Dynamic Strategies for Yaw and Induction Control of Wind Farms Based on Large-Eddy Simulation and Optimization

Directory of Open Access Journals (Sweden)

Wim Munters

2018-01-01

Full Text Available In wind farms, wakes originating from upstream turbines cause reduced energy extraction and increased loading variability in downstream rows. The prospect of mitigating these detrimental effects through coordinated controllers at the wind-farm level has fueled a multitude of research efforts in wind-farm control. The main strategies in wind-farm control are to influence the velocity deficits in the wake by deviating from locally optimal axial induction setpoints on the one hand, and steering wakes away from downstream rows through yaw misalignment on the other hand. The current work investigates dynamic induction and yaw control of individual turbines for wind-farm power maximization in large-eddy simulations. To this end, receding-horizon optimal control techniques combined with continuous adjoint gradient evaluations are used. We study a 4 × 4 aligned wind farm, and find that for this farm layout yaw control is more effective than induction control, both for uniform and turbulent inflow conditions. Analysis of optimal yaw controls leads to the definition of two simplified yaw control strategies, in which wake meandering and wake redirection are exploited respectively. Furthermore it is found that dynamic yawing provides significant benefits over static yaw control in turbulent flow environments, whereas this is not the case for uniform inflow. Finally, the potential of combining overinductive axial induction control with yaw control is shown, with power gains that approximate the sum of those achieved by each control strategy separately.

Quantum optimal control theory and dynamic coupling in the spin-boson model

International Nuclear Information System (INIS)

Jirari, H.; Poetz, W.

2006-01-01

A Markovian master equation describing the evolution of open quantum systems in the presence of a time-dependent external field is derived within the Bloch-Redfield formalism. It leads to a system-bath interaction which depends on the control field. Optimal control theory is used to select control fields which allow accelerated or decelerated system relaxation, or suppression of relaxation (dissipation) altogether, depending on the dynamics we impose on the quantum system. The control-dissipation correlation and the nonperturbative treatment of the control field are essential for reaching this goal. The optimal control problem is formulated within Pontryagin's minimum principle and the resulting optimal differential system is solved numerically. As an application, we study the dynamics of a spin-boson model in the strong coupling regime under the influence of an external control field. We show how trapping the system in unstable quantum states and transfer of population can be achieved by optimized control of the dissipative quantum system. We also used optimal control theory to find the driving field that generates the quantum Z gate. In several cases studied, we find that the selected optimal field which reduces the purity loss significantly is a multicomponent low-frequency field including higher harmonics, all of which lie below the phonon cutoff frequency. Finally, in the undriven case we present an analytic result for the Lamb shift at zero temperature

Bioprocess iterative batch-to-batch optimization based on hybrid parametric/nonparametric models.

Science.gov (United States)

Teixeira, Ana P; Clemente, João J; Cunha, António E; Carrondo, Manuel J T; Oliveira, Rui

2006-01-01

This paper presents a novel method for iterative batch-to-batch dynamic optimization of bioprocesses. The relationship between process performance and control inputs is established by means of hybrid grey-box models combining parametric and nonparametric structures. The bioreactor dynamics are defined by material balance equations, whereas the cell population subsystem is represented by an adjustable mixture of nonparametric and parametric models. Thus optimizations are possible without detailed mechanistic knowledge concerning the biological system. A clustering technique is used to supervise the reliability of the nonparametric subsystem during the optimization. Whenever the nonparametric outputs are unreliable, the objective function is penalized. The technique was evaluated with three simulation case studies. The overall results suggest that the convergence to the optimal process performance may be achieved after a small number of batches. The model unreliability risk constraint along with sampling scheduling are crucial to minimize the experimental effort required to attain a given process performance. In general terms, it may be concluded that the proposed method broadens the application of the hybrid parametric/nonparametric modeling technique to "newer" processes with higher potential for optimization.

Product quality driven design of bakery operations using dynamic optimization

NARCIS (Netherlands)

Hadiyanto, M.; Esveld, D.C.; Boom, R.M.; Straten, van G.; Boxtel, van A.J.B.

2008-01-01

Abstract Quality driven design uses specified product qualities as a starting point for process design. By backward reasoning the required process conditions and processing system were found. In this work dynamic optimization was used as a tool to generate processing solutions for baking processes

Better Drumming Through Calibration: Techniques for Pre-Performance Robotic Percussion Optimization

OpenAIRE

Murphy, Jim; Kapur, Ajay; Carnegie, Dale

2012-01-01

A problem with many contemporary musical robotic percussion systems lies in the fact that solenoids fail to respond lin-early to linear increases in input velocity. This nonlinearity forces performers to individually tailor their compositions to specific robotic drummers. To address this problem, we introduce a method of pre-performance calibration using metaheuristic search techniques. A variety of such techniques are introduced and evaluated and the results of the optimized solenoid-based p...

Ckmeans.1d.dp: Optimal k-means Clustering in One Dimension by Dynamic Programming.

Science.gov (United States)

Wang, Haizhou; Song, Mingzhou

2011-12-01

The heuristic k -means algorithm, widely used for cluster analysis, does not guarantee optimality. We developed a dynamic programming algorithm for optimal one-dimensional clustering. The algorithm is implemented as an R package called Ckmeans.1d.dp . We demonstrate its advantage in optimality and runtime over the standard iterative k -means algorithm.

Optimal Vibration Control for Tracked Vehicle Suspension Systems

Directory of Open Access Journals (Sweden)

Yan-Jun Liang

2013-01-01

Full Text Available Technique of optimal vibration control with exponential decay rate and simulation for vehicle active suspension systems is developed. Mechanical model and dynamic system for a class of tracked vehicle suspension vibration control is established and the corresponding system of state space form is described. In order to prolong the working life of suspension system and improve ride comfort, based on the active suspension vibration control devices and using optimal control approach, an optimal vibration controller with exponential decay rate is designed. Numerical simulations are carried out, and the control effects of the ordinary optimal controller and the proposed controller are compared. Numerical simulation results illustrate the effectiveness of the proposed technique.

Optimization of a Fuzzy-Logic-Control-Based MPPT Algorithm Using the Particle Swarm Optimization Technique

Directory of Open Access Journals (Sweden)

Po-Chen Cheng

2015-06-01

Full Text Available In this paper, an asymmetrical fuzzy-logic-control (FLC-based maximum power point tracking (MPPT algorithm for photovoltaic (PV systems is presented. Two membership function (MF design methodologies that can improve the effectiveness of the proposed asymmetrical FLC-based MPPT methods are then proposed. The first method can quickly determine the input MF setting values via the power–voltage (P–V curve of solar cells under standard test conditions (STC. The second method uses the particle swarm optimization (PSO technique to optimize the input MF setting values. Because the PSO approach must target and optimize a cost function, a cost function design methodology that meets the performance requirements of practical photovoltaic generation systems (PGSs is also proposed. According to the simulated and experimental results, the proposed asymmetrical FLC-based MPPT method has the highest fitness value, therefore, it can successfully address the tracking speed/tracking accuracy dilemma compared with the traditional perturb and observe (P&O and symmetrical FLC-based MPPT algorithms. Compared to the conventional FLC-based MPPT method, the obtained optimal asymmetrical FLC-based MPPT can improve the transient time and the MPPT tracking accuracy by 25.8% and 0.98% under STC, respectively.

Kalman filter techniques for accelerated Cartesian dynamic cardiac imaging.

Science.gov (United States)

Feng, Xue; Salerno, Michael; Kramer, Christopher M; Meyer, Craig H

2013-05-01

In dynamic MRI, spatial and temporal parallel imaging can be exploited to reduce scan time. Real-time reconstruction enables immediate visualization during the scan. Commonly used view-sharing techniques suffer from limited temporal resolution, and many of the more advanced reconstruction methods are either retrospective, time-consuming, or both. A Kalman filter model capable of real-time reconstruction can be used to increase the spatial and temporal resolution in dynamic MRI reconstruction. The original study describing the use of the Kalman filter in dynamic MRI was limited to non-Cartesian trajectories because of a limitation intrinsic to the dynamic model used in that study. Here the limitation is overcome, and the model is applied to the more commonly used Cartesian trajectory with fast reconstruction. Furthermore, a combination of the Kalman filter model with Cartesian parallel imaging is presented to further increase the spatial and temporal resolution and signal-to-noise ratio. Simulations and experiments were conducted to demonstrate that the Kalman filter model can increase the temporal resolution of the image series compared with view-sharing techniques and decrease the spatial aliasing compared with TGRAPPA. The method requires relatively little computation, and thus is suitable for real-time reconstruction. Copyright © 2012 Wiley Periodicals, Inc.

A characteristic study of CCF modeling techniques and optimization of CCF defense strategies

International Nuclear Information System (INIS)

Kim, Min Chull

2000-02-01

Common Cause Failures (CCFs ) are among the major contributors to risk and core damage frequency (CDF ) from operating nuclear power plants (NPPs ). Our study on CCF focused on the following aspects : 1) a characteristic study on the CCF modeling techniques and 2) development of the optimal CCF defense strategy. Firstly, the characteristics of CCF modeling techniques were studied through sensitivity study of CCF occurrence probability upon system redundancy. The modeling techniques considered in this study include those most widely used worldwide, i.e., beta factor, MGL, alpha factor, and binomial failure rate models. We found that MGL and alpha factor models are essentially identical in terms of the CCF probability. Secondly, in the study for CCF defense, the various methods identified in the previous studies for defending against CCF were classified into five different categories. Based on these categories, we developed a generic method by which the optimal CCF defense strategy can be selected. The method is not only qualitative but also quantitative in nature: the selection of the optimal strategy among candidates is based on the use of analytic hierarchical process (AHP). We applied this method to two motor-driven valves for containment sump isolation in Ulchin 3 and 4 nuclear power plants. The result indicates that the method for developing an optimal CCF defense strategy is effective

Dynamic Reconfiguration in Real-Time Systems Energy, Performance, and Thermal Perspectives

CERN Document Server

Wang, Weixun; Ranka, Sanjay

2013-01-01

Given the widespread use of real-time multitasking systems, there are tremendous optimization opportunities if reconfigurable computing can be effectively incorporated while maintaining performance and other design constraints of typical applications. The focus of this book is to describe the dynamic reconfiguration techniques that can be safely used in real-time systems. This book provides comprehensive approaches by considering synergistic effects of computation, communication as well as storage together to significantly improve overall performance, power, energy and temperature.  Provides a comprehensive introduction to optimization and dynamic reconfiguration techniques in real-time embedded systems; Covers state-of-the-art techniques and ongoing research in reconfigurable architectures; Focuses on algorithms tuned for dynamic reconfiguration techniques in real-time systems;  Provides reference for anyone designing low-power systems, energy-/temperature-constrained devices, and power-performance efficie...

Optimal spectral tracking--adapting to dynamic regime change.

Science.gov (United States)

Brittain, John-Stuart; Halliday, David M

2011-01-30

Real world data do not always obey the statistical restraints imposed upon them by sophisticated analysis techniques. In spectral analysis for instance, an ergodic process--the interchangeability of temporal for spatial averaging--is assumed for a repeat-trial design. Many evolutionary scenarios, such as learning and motor consolidation, do not conform to such linear behaviour and should be approached from a more flexible perspective. To this end we previously introduced the method of optimal spectral tracking (OST) in the study of trial-varying parameters. In this extension to our work we modify the OST routines to provide an adaptive implementation capable of reacting to dynamic transitions in the underlying system state. In so doing, we generalise our approach to characterise both slow-varying and rapid fluctuations in time-series, simultaneously providing a metric of system stability. The approach is first applied to a surrogate dataset and compared to both our original non-adaptive solution and spectrogram approaches. The adaptive OST is seen to display fast convergence and desirable statistical properties. All three approaches are then applied to a neurophysiological recording obtained during a study on anaesthetic monitoring. Local field potentials acquired from the posterior hypothalamic region of a deep brain stimulation patient undergoing anaesthesia were analysed. The characterisation of features such as response delay, time-to-peak and modulation brevity are considered. Copyright © 2010 Elsevier B.V. All rights reserved.

Evaluation of EMG processing techniques using Information Theory

Directory of Open Access Journals (Sweden)

Felice Carmelo J

2010-11-01

Full Text Available Abstract Background Electromyographic signals can be used in biomedical engineering and/or rehabilitation field, as potential sources of control for prosthetics and orthotics. In such applications, digital processing techniques are necessary to follow efficient and effectively the changes in the physiological characteristics produced by a muscular contraction. In this paper, two methods based on information theory are proposed to evaluate the processing techniques. Methods These methods determine the amount of information that a processing technique is able to extract from EMG signals. The processing techniques evaluated with these methods were: absolute mean value (AMV, RMS values, variance values (VAR and difference absolute mean value (DAMV. EMG signals from the middle deltoid during abduction and adduction movement of the arm in the scapular plane was registered, for static and dynamic contractions. The optimal window length (segmentation, abduction and adduction movements and inter-electrode distance were also analyzed. Results Using the optimal segmentation (200 ms and 300 ms in static and dynamic contractions, respectively the best processing techniques were: RMS, AMV and VAR in static contractions, and only the RMS in dynamic contractions. Using the RMS of EMG signal, variations in the amount of information between the abduction and adduction movements were observed. Conclusions Although the evaluation methods proposed here were applied to standard processing techniques, these methods can also be considered as alternatives tools to evaluate new processing techniques in different areas of electrophysiology.

Optimal environmental policy and the dynamic property in LDCs

Directory of Open Access Journals (Sweden)

Masahiro Yabuta

2002-01-01

Full Text Available This paper has provided a model framework of foreign assistance policy in the context of dynamic optimal control and investigated the environmental policies in LDCs that received some financial support from abroad. The model framework features a specific behavior of the social planner who determines the level of voluntary expenditure for preservation of natural environment. Because more financial needs for natural environmental protection means less allowance of growth-oriented investment, the social planner confronts a trade-off problem between economic growth and environmental preservation. To tackle with this clearly, we have built a dynamic model with two control variables: per-capita consumption and voluntary expenditure for natural environment.

Power system dynamic state estimation using prediction based evolutionary technique

International Nuclear Information System (INIS)

Basetti, Vedik; Chandel, Ashwani K.; Chandel, Rajeevan

2016-01-01

In this paper, a new robust LWS (least winsorized square) estimator is proposed for dynamic state estimation of a power system. One of the main advantages of this estimator is that it has an inbuilt bad data rejection property and is less sensitive to bad data measurements. In the proposed approach, Brown's double exponential smoothing technique has been utilised for its reliable performance at the prediction step. The state estimation problem is solved as an optimisation problem using a new jDE-self adaptive differential evolution with prediction based population re-initialisation technique at the filtering step. This new stochastic search technique has been embedded with different state scenarios using the predicted state. The effectiveness of the proposed LWS technique is validated under different conditions, namely normal operation, bad data, sudden load change, and loss of transmission line conditions on three different IEEE test bus systems. The performance of the proposed approach is compared with the conventional extended Kalman filter. On the basis of various performance indices, the results thus obtained show that the proposed technique increases the accuracy and robustness of power system dynamic state estimation performance. - Highlights: • To estimate the states of the power system under dynamic environment. • The performance of the EKF method is degraded during anomaly conditions. • The proposed method remains robust towards anomalies. • The proposed method provides precise state estimates even in the presence of anomalies. • The results show that prediction accuracy is enhanced by using the proposed model.

Parallel halftoning technique using dot diffusion optimization

Science.gov (United States)

Molina-Garcia, Javier; Ponomaryov, Volodymyr I.; Reyes-Reyes, Rogelio; Cruz-Ramos, Clara

2017-05-01

In this paper, a novel approach for halftone images is proposed and implemented for images that are obtained by the Dot Diffusion (DD) method. Designed technique is based on an optimization of the so-called class matrix used in DD algorithm and it consists of generation new versions of class matrix, which has no baron and near-baron in order to minimize inconsistencies during the distribution of the error. Proposed class matrix has different properties and each is designed for two different applications: applications where the inverse-halftoning is necessary, and applications where this method is not required. The proposed method has been implemented in GPU (NVIDIA GeForce GTX 750 Ti), multicore processors (AMD FX(tm)-6300 Six-Core Processor and in Intel core i5-4200U), using CUDA and OpenCV over a PC with linux. Experimental results have shown that novel framework generates a good quality of the halftone images and the inverse halftone images obtained. The simulation results using parallel architectures have demonstrated the efficiency of the novel technique when it is implemented in real-time processing.

High Dynamic Optimized Carrier Loop Improvement for Tracking Doppler Rates

Directory of Open Access Journals (Sweden)

Amirhossein Fereidountabar

2015-01-01

Full Text Available Mathematical analysis and optimization of a carrier tracking loop are presented. Due to fast changing of the carrier frequency in some satellite systems, such as Low Earth Orbit (LEO or Global Positioning System (GPS, or some planes like Unmanned Aerial Vehicles (UAVs, high dynamic tracking loops play a very important role. In this paper an optimized tracking loop consisting of a third-order Phase Locked Loop (PLL assisted by a second-order Frequency Locked Loop (FLL for UAVs is proposed and discussed. Based on this structure an optimal loop has been designed. The main advantages of this approach are the reduction of the computation complexity and smaller phase error. The paper shows the simulation results, comparing them with a previous work.

An Image Morphing Technique Based on Optimal Mass Preserving Mapping

Science.gov (United States)

Zhu, Lei; Yang, Yan; Haker, Steven; Tannenbaum, Allen

2013-01-01

Image morphing, or image interpolation in the time domain, deals with the metamorphosis of one image into another. In this paper, a new class of image morphing algorithms is proposed based on the theory of optimal mass transport. The L2 mass moving energy functional is modified by adding an intensity penalizing term, in order to reduce the undesired double exposure effect. It is an intensity-based approach and, thus, is parameter free. The optimal warping function is computed using an iterative gradient descent approach. This proposed morphing method is also extended to doubly connected domains using a harmonic parameterization technique, along with finite-element methods. PMID:17547128

Modern techniques for condition monitoring of railway vehicle dynamics

International Nuclear Information System (INIS)

Ngigi, R W; Pislaru, C; Ball, A; Gu, F

2012-01-01

A modern railway system relies on sophisticated monitoring systems for maintenance and renewal activities. Some of the existing conditions monitoring techniques perform fault detection using advanced filtering, system identification and signal analysis methods. These theoretical approaches do not require complex mathematical models of the system and can overcome potential difficulties associated with nonlinearities and parameter variations in the system. Practical applications of condition monitoring tools use sensors which are mounted either on the track or rolling stock. For instance, monitoring wheelset dynamics could be done through the use of track-mounted sensors, while vehicle-based sensors are preferred for monitoring the train infrastructure. This paper attempts to collate and critically appraise the modern techniques used for condition monitoring of railway vehicle dynamics by analysing the advantages and shortcomings of these methods.

Photon attenuation correction technique in SPECT based on nonlinear optimization

International Nuclear Information System (INIS)

Suzuki, Shigehito; Wakabayashi, Misato; Okuyama, Keiichi; Kuwamura, Susumu

1998-01-01

Photon attenuation correction in SPECT was made using a nonlinear optimization theory, in which an optimum image is searched so that the sum of square errors between observed and reprojected projection data is minimized. This correction technique consists of optimization and step-width algorithms, which determine at each iteration a pixel-by-pixel directional value of search and its step-width, respectively. We used the conjugate gradient and quasi-Newton methods as the optimization algorithm, and Curry rule and the quadratic function method as the step-width algorithm. Statistical fluctuations in the corrected image due to statistical noise in the emission projection data grew as the iteration increased, depending on the combination of optimization and step-width algorithms. To suppress them, smoothing for directional values was introduced. Computer experiments and clinical applications showed a pronounced reduction in statistical fluctuations of the corrected image for all combinations. Combinations using the conjugate gradient method were superior in noise characteristic and computation time. The use of that method with the quadratic function method was optimum if noise property was regarded as important. (author)

Optimizing cloud removal from satellite remotely sensed data for monitoring vegetation dynamics in humid tropical climate

International Nuclear Information System (INIS)

Hashim, M; Pour, A B; Onn, C H

2014-01-01

Remote sensing technology is an important tool to analyze vegetation dynamics, quantifying vegetation fraction of Earth's agricultural and natural vegetation. In optical remote sensing analysis removing atmospheric interferences, particularly distribution of cloud contaminations, are always a critical task in the tropical climate. This paper suggests a fast and alternative approach to remove cloud and shadow contaminations for Landsat Enhanced Thematic Mapper + (ETM + ) multi temporal datasets. Band 3 and Band 4 from all the Landsat ETM + dataset are two main spectral bands that are very crucial in this study for cloud removal technique. The Normalise difference vegetation index (NDVI) and the normalised difference soil index (NDSI) are two main derivatives derived from the datasets. Change vector analysis is used in this study to seek the vegetation dynamics. The approach developed in this study for cloud optimizing can be broadly applicable for optical remote sensing satellite data, which are seriously obscured with heavy cloud contamination in the tropical climate

Optimal protocols for Hamiltonian and Schrödinger dynamics

International Nuclear Information System (INIS)

Schmiedl, Tim; Dieterich, Eckhard; Dieterich, Peter-Simon; Seifert, Udo

2009-01-01

For systems in an externally controllable time dependent potential, the optimal protocol minimizes the mean work spent in a finite time transition between given initial and final values of a control parameter. For an initially thermalized ensemble, we consider both Hamiltonian evolution for classical systems and Schrödinger evolution for quantum systems. In both cases, we show that for harmonic potentials, the optimal work is given by the adiabatic work even in the limit of short transition times. This result is counter-intuitive because the adiabatic work is substantially smaller than the work for an instantaneous jump. We also perform numerical calculations for the optimal protocol for Hamiltonian dynamics in an anharmonic quartic potential. For a two-level spin system, we give examples where the adiabatic work can be reached in either a finite or an arbitrarily short transition time depending on the allowed parameter space

The importance of functional form in optimal control solutions of problems in population dynamics

Science.gov (United States)

Runge, M.C.; Johnson, F.A.

2002-01-01

Optimal control theory is finding increased application in both theoretical and applied ecology, and it is a central element of adaptive resource management. One of the steps in an adaptive management process is to develop alternative models of system dynamics, models that are all reasonable in light of available data, but that differ substantially in their implications for optimal control of the resource. We explored how the form of the recruitment and survival functions in a general population model for ducks affected the patterns in the optimal harvest strategy, using a combination of analytical, numerical, and simulation techniques. We compared three relationships between recruitment and population density (linear, exponential, and hyperbolic) and three relationships between survival during the nonharvest season and population density (constant, logistic, and one related to the compensatory harvest mortality hypothesis). We found that the form of the component functions had a dramatic influence on the optimal harvest strategy and the ultimate equilibrium state of the system. For instance, while it is commonly assumed that a compensatory hypothesis leads to higher optimal harvest rates than an additive hypothesis, we found this to depend on the form of the recruitment function, in part because of differences in the optimal steady-state population density. This work has strong direct consequences for those developing alternative models to describe harvested systems, but it is relevant to a larger class of problems applying optimal control at the population level. Often, different functional forms will not be statistically distinguishable in the range of the data. Nevertheless, differences between the functions outside the range of the data can have an important impact on the optimal harvest strategy. Thus, development of alternative models by identifying a single functional form, then choosing different parameter combinations from extremes on the likelihood

Optimized evaporation technique for leachate treatment: Small scale implementation.

Science.gov (United States)

Benyoucef, Fatima; Makan, Abdelhadi; El Ghmari, Abderrahman; Ouatmane, Aziz

2016-04-01

This paper introduces an optimized evaporation technique for leachate treatment. For this purpose and in order to study the feasibility and measure the effectiveness of the forced evaporation, three cuboidal steel tubs were designed and implemented. The first control-tub was installed at the ground level to monitor natural evaporation. Similarly, the second and the third tub, models under investigation, were installed respectively at the ground level (equipped-tub 1) and out of the ground level (equipped-tub 2), and provided with special equipment to accelerate the evaporation process. The obtained results showed that the evaporation rate at the equipped-tubs was much accelerated with respect to the control-tub. It was accelerated five times in the winter period, where the evaporation rate was increased from a value of 0.37 mm/day to reach a value of 1.50 mm/day. In the summer period, the evaporation rate was accelerated more than three times and it increased from a value of 3.06 mm/day to reach a value of 10.25 mm/day. Overall, the optimized evaporation technique can be applied effectively either under electric or solar energy supply, and will accelerate the evaporation rate from three to five times whatever the season temperature. Copyright © 2016. Published by Elsevier Ltd.

Comparison of optimization techniques for MRR and surface roughness in wire EDM process for gear cutting

Directory of Open Access Journals (Sweden)

K.D. Mohapatra

2016-11-01

Full Text Available The objective of the present work is to use a suitable method that can optimize the process parameters like pulse on time (TON, pulse off time (TOFF, wire feed rate (WF, wire tension (WT and servo voltage (SV to attain the maximum value of MRR and minimum value of surface roughness during the production of a fine pitch spur gear made of copper. The spur gear has a pressure angle of 20⁰ and pitch circle diameter of 70 mm. The wire has a diameter of 0.25 mm and is made of brass. Experiments were conducted according to Taguchi’s orthogonal array concept with five factors and two levels. Thus, Taguchi quality loss design technique is used to optimize the output responses carried out from the experiments. Another optimization technique i.e. desirability with grey Taguchi technique has been used to optimize the process parameters. Both the optimized results are compared to find out the best combination of MRR and surface roughness. A confirmation test was carried out to identify the significant improvement in the machining performance in case of Taguchi quality loss. Finally, it was concluded that desirability with grey Taguchi technique produced a better result than the Taguchi quality loss technique in case of MRR and Taguchi quality loss gives a better result in case of surface roughness. The quality of the wire after the cutting operation has been presented in the scanning electron microscopy (SEM figure.

Rotor Pole Shape Optimization of Permanent Magnet Brushless DC Motors Using the Reduced Basis Technique

Directory of Open Access Journals (Sweden)

GHOLAMIAN, A. S.

2009-06-01

Full Text Available In this paper, a magnet shape optimization method for reduction of cogging torque and torque ripple in Permanent Magnet (PM brushless DC motors is presented by using the reduced basis technique coupled by finite element and design of experiments methods. The primary objective of the method is to reduce the enormous number of design variables required to define the magnet shape. The reduced basis technique is a weighted combination of several basis shapes. The aim of the method is to find the best combination using the weights for each shape as the design variables. A multi-level design process is developed to find suitable basis shapes or trial shapes at each level that can be used in the reduced basis technique. Each level is treated as a separated optimization problem until the required objective is achieved. The experimental design of Taguchi method is used to build the approximation model and to perform optimization. This method is demonstrated on the magnet shape optimization of a 6-poles/18-slots PM BLDC motor.

Optimization of Thermal Aspects of Friction Stir Welding – Initial Studies Using a Space Mapping Technique

DEFF Research Database (Denmark)

Larsen, Anders Astrup; Bendsøe, Martin P.; Schmidt, Henrik Nikolaj Blicher

2007-01-01

The aim of this paper is to optimize a thermal model of a friction stir welding process. The optimization is performed using a space mapping technique in which an analytical model is used along with the FEM model to be optimized. The results are compared to traditional gradient based optimization...

A Survey on Optimal Signal Processing Techniques Applied to Improve the Performance of Mechanical Sensors in Automotive Applications

Science.gov (United States)

Hernandez, Wilmar

2007-01-01

In this paper a survey on recent applications of optimal signal processing techniques to improve the performance of mechanical sensors is made. Here, a comparison between classical filters and optimal filters for automotive sensors is made, and the current state of the art of the application of robust and optimal control and signal processing techniques to the design of the intelligent (or smart) sensors that today's cars need is presented through several experimental results that show that the fusion of intelligent sensors and optimal signal processing techniques is the clear way to go. However, the switch between the traditional methods of designing automotive sensors and the new ones cannot be done overnight because there are some open research issues that have to be solved. This paper draws attention to one of the open research issues and tries to arouse researcher's interest in the fusion of intelligent sensors and optimal signal processing techniques.

Automated Testing Techniques for Event-Driven and Dynamically Typed Software Applications

DEFF Research Database (Denmark)

Adamsen, Christoffer Quist

techniques to address each of the challenges. We present a new methodology that extends the error detection capabilities of existing, manually written Android test suites. In the context of JavaScript web applications, we present practical race detectors for detecting AJAX and initialization races......, and a technique that can prevent event race errors by restricting the nondeterminism. Finally, we present a notion of test completeness for dynamic languages, along with a hybrid static/dynamic analysis framework that approximates test completeness, and demonstrate the usefulness of test completeness facts...

Solving Optimization Problems via Vortex Optimization Algorithm and Cognitive Development Optimization Algorithm

Directory of Open Access Journals (Sweden)

Ahmet Demir

2017-01-01

Full Text Available In the fields which require finding the most appropriate value, optimization became a vital approach to employ effective solutions. With the use of optimization techniques, many different fields in the modern life have found solutions to their real-world based problems. In this context, classical optimization techniques have had an important popularity. But after a while, more advanced optimization problems required the use of more effective techniques. At this point, Computer Science took an important role on providing software related techniques to improve the associated literature. Today, intelligent optimization techniques based on Artificial Intelligence are widely used for optimization problems. The objective of this paper is to provide a comparative study on the employment of classical optimization solutions and Artificial Intelligence solutions for enabling readers to have idea about the potential of intelligent optimization techniques. At this point, two recently developed intelligent optimization algorithms, Vortex Optimization Algorithm (VOA and Cognitive Development Optimization Algorithm (CoDOA, have been used to solve some multidisciplinary optimization problems provided in the source book Thomas' Calculus 11th Edition and the obtained results have compared with classical optimization solutions. 

Merging spatially variant physical process models under an optimized systems dynamics framework.

Energy Technology Data Exchange (ETDEWEB)

Cain, William O. (University of Texas at Austin, Austin, TX); Lowry, Thomas Stephen; Pierce, Suzanne A.; Tidwell, Vincent Carroll

2007-10-01

The complexity of water resource issues, its interconnectedness to other systems, and the involvement of competing stakeholders often overwhelm decision-makers and inhibit the creation of clear management strategies. While a range of modeling tools and procedures exist to address these problems, they tend to be case specific and generally emphasize either a quantitative and overly analytic approach or present a qualitative dialogue-based approach lacking the ability to fully explore consequences of different policy decisions. The integration of these two approaches is needed to drive toward final decisions and engender effective outcomes. Given these limitations, the Computer Assisted Dispute Resolution system (CADRe) was developed to aid in stakeholder inclusive resource planning. This modeling and negotiation system uniquely addresses resource concerns by developing a spatially varying system dynamics model as well as innovative global optimization search techniques to maximize outcomes from participatory dialogues. Ultimately, the core system architecture of CADRe also serves as the cornerstone upon which key scientific innovation and challenges can be addressed.

Quantitative Portfolio Optimization Techniques Applied to the Brazilian Stock Market

Directory of Open Access Journals (Sweden)

André Alves Portela Santos

2012-09-01

Full Text Available In this paper we assess the out-of-sample performance of two alternative quantitative portfolio optimization techniques - mean-variance and minimum variance optimization – and compare their performance with respect to a naive 1/N (or equally-weighted portfolio and also to the market portfolio given by the Ibovespa. We focus on short selling-constrained portfolios and consider alternative estimators for the covariance matrices: sample covariance matrix, RiskMetrics, and three covariance estimators proposed by Ledoit and Wolf (2003, Ledoit and Wolf (2004a and Ledoit and Wolf (2004b. Taking into account alternative portfolio re-balancing frequencies, we compute out-of-sample performance statistics which indicate that the quantitative approaches delivered improved results in terms of lower portfolio volatility and better risk-adjusted returns. Moreover, the use of more sophisticated estimators for the covariance matrix generated optimal portfolios with lower turnover over time.

Optimization of AFP-radioimmunoassay using Antibody Capture Technique

International Nuclear Information System (INIS)

Moustafa, K.A.

2003-01-01

Alpha-fetoprotein (AFP) is a substance produced by the unborn baby. When the neural tube is not properly formed large amounts of AFP pass into the amniotic fluid and reach the mother's blood. By measuring AFP in the mother's blood and amniotic fluid, it is possible to tell whether or not there is a chance that the unborn baby has a neural tube defect. AFP also used as a tumor marker for hepatocellular carcinoma. There are many different techniques for measuring AFP in blood, but the most accurate one is the immunoassay technique. The immunoassays can be classified on the basis of methodology into three classes; (1) the antibody capture assays, (2) the antigen capture assay, (3)the two-antibody sandwich assays. In this present study, the antibody capture assay in which the antigen is attached to a solid support, and labeled antibody is allowed to bind, will be optimized

Optimal Interest-Rate Setting in a Dynamic IS/AS Model

DEFF Research Database (Denmark)

Jensen, Henrik

2011-01-01

This note deals with interest-rate setting in a simple dynamic macroeconomic setting. The purpose is to present some basic and central properties of an optimal interest-rate rule. The model framework predates the New-Keynesian paradigm of the late 1990s and onwards (it is accordingly dubbed “Old...

Exploring the Environment/Energy Pareto Optimal Front of an Office Room Using Computational Fluid Dynamics-Based Interactive Optimization Method

Directory of Open Access Journals (Sweden)

Kangji Li

2017-02-01

Full Text Available This paper is concerned with the development of a high-resolution and control-friendly optimization framework in enclosed environments that helps improve thermal comfort, indoor air quality (IAQ, and energy costs of heating, ventilation and air conditioning (HVAC system simultaneously. A computational fluid dynamics (CFD-based optimization method which couples algorithms implemented in Matlab with CFD simulation is proposed. The key part of this method is a data interactive mechanism which efficiently passes parameters between CFD simulations and optimization functions. A two-person office room is modeled for the numerical optimization. The multi-objective evolutionary algorithm—non-dominated-and-crowding Sorting Genetic Algorithm II (NSGA-II—is realized to explore the environment/energy Pareto front of the enclosed space. Performance analysis will demonstrate the effectiveness of the presented optimization method.

A Dynamic Optimization Method of Indoor Fire Evacuation Route Based on Real-time Situation Awareness

Directory of Open Access Journals (Sweden)

DING Yulin

2016-12-01

Full Text Available How to provide safe and effective evacuation routes is an important safeguard to correctly guide evacuation and reduce the casualties during the fire situation rapidly evolving in complex indoor environment. The traditional static path finding method is difficult to adjust the path adaptively according to the changing fire situation, which lead to the evacuation decision-making blindness and hysteresis. This paper proposes a dynamic method which can dynamically optimize the indoor evacuation routes based on the real-time situation awareness. According to the real-time perception of fire situation parameters and the changing indoor environment information, the evacuation route is optimized dynamically. The integrated representation of multisource indoor fire monitoring sensor observations oriented fire emergency evacuation is presented at first, real-time fire threat situation information inside building is then extracted from the observation data of multi-source sensors, which is used to constrain the dynamical optimization of the topology of the evacuation route. Finally, the simulation experiments prove that this method can improve the accuracy and efficiency of indoor evacuation routing.

PSO Based Optimal Design of Fractional Order Controller for Industrial Application

OpenAIRE

Rohit Gupta; Ruchika

2016-01-01

In this paper, a PSO based fractional order PID (FOPID) controller is proposed for concentration control of an isothermal Continuous Stirred Tank Reactor (CSTR) problem. CSTR is used to carry out chemical reactions in industries, which possesses complex nonlinear dynamic characteristics. Particle Swarm Optimization algorithm technique, which is an evolutionary optimization technique based on the movement and intelligence of swarm is proposed for tuning of the controller for this system. Compa...

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

A new technique for detection of dynamic crack initiation

International Nuclear Information System (INIS)

Miya, K.; Yanagi, H.; Someya, K.

1986-01-01

A new test device was constructed to measure dynamic fracture toughness using electromagnetic force as a dynamic load and a laser system for the detection of load-line deflection. This method provides several advantages with respect to load control, high strain rate and easy instrumentation of the test device. Using the device, experiments on the dynamic fracture were performed with use of edge-cracked three point bending specimens which were made from the nuclear pressure vessel material A508cl.3. The present paper reports on the characteristic feature of dynamic fracture, the measuring technique of dynamic loading and deflection, the detection of dynamic crack initiation and fractographic observation. The detection of the dynamic crack initiation was made possible by the application of an AC electrical potential method that employs a lock-in amplifier driven by a demodulation mode of signal averager and guarantees a fast response to the crack initiation. It was found that the fracture was initiated after unloading of the electromagnetic force is finished, in other words, the fracture was caused by an inertia force and the dynamic fracture toughness Jsub(Id) of the test material was elevated with the increasing loading rate. (orig.)

Optimizing zonal advection of the Advanced Research WRF (ARW) dynamics for Intel MIC

Science.gov (United States)

Mielikainen, Jarno; Huang, Bormin; Huang, Allen H.

2014-10-01

The Weather Research and Forecast (WRF) model is the most widely used community weather forecast and research model in the world. There are two distinct varieties of WRF. The Advanced Research WRF (ARW) is an experimental, advanced research version featuring very high resolution. The WRF Nonhydrostatic Mesoscale Model (WRF-NMM) has been designed for forecasting operations. WRF consists of dynamics code and several physics modules. The WRF-ARW core is based on an Eulerian solver for the fully compressible nonhydrostatic equations. In the paper, we will use Intel Intel Many Integrated Core (MIC) architecture to substantially increase the performance of a zonal advection subroutine for optimization. It is of the most time consuming routines in the ARW dynamics core. Advection advances the explicit perturbation horizontal momentum equations by adding in the large-timestep tendency along with the small timestep pressure gradient tendency. We will describe the challenges we met during the development of a high-speed dynamics code subroutine for MIC architecture. Furthermore, lessons learned from the code optimization process will be discussed. The results show that the optimizations improved performance of the original code on Xeon Phi 5110P by a factor of 2.4x.

A singular value decomposition linear programming (SVDLP) optimization technique for circular cone based robotic radiotherapy

Science.gov (United States)

Liang, Bin; Li, Yongbao; Wei, Ran; Guo, Bin; Xu, Xuang; Liu, Bo; Li, Jiafeng; Wu, Qiuwen; Zhou, Fugen

2018-01-01

With robot-controlled linac positioning, robotic radiotherapy systems such as CyberKnife significantly increase freedom of radiation beam placement, but also impose more challenges on treatment plan optimization. The resampling mechanism in the vendor-supplied treatment planning system (MultiPlan) cannot fully explore the increased beam direction search space. Besides, a sparse treatment plan (using fewer beams) is desired to improve treatment efficiency. This study proposes a singular value decomposition linear programming (SVDLP) optimization technique for circular collimator based robotic radiotherapy. The SVDLP approach initializes the input beams by simulating the process of covering the entire target volume with equivalent beam tapers. The requirements on dosimetry distribution are modeled as hard and soft constraints, and the sparsity of the treatment plan is achieved by compressive sensing. The proposed linear programming (LP) model optimizes beam weights by minimizing the deviation of soft constraints subject to hard constraints, with a constraint on the l 1 norm of the beam weight. A singular value decomposition (SVD) based acceleration technique was developed for the LP model. Based on the degeneracy of the influence matrix, the model is first compressed into lower dimension for optimization, and then back-projected to reconstruct the beam weight. After beam weight optimization, the number of beams is reduced by removing the beams with low weight, and optimizing the weights of the remaining beams using the same model. This beam reduction technique is further validated by a mixed integer programming (MIP) model. The SVDLP approach was tested on a lung case. The results demonstrate that the SVD acceleration technique speeds up the optimization by a factor of 4.8. Furthermore, the beam reduction achieves a similar plan quality to the globally optimal plan obtained by the MIP model, but is one to two orders of magnitude faster. Furthermore, the SVDLP

A singular value decomposition linear programming (SVDLP) optimization technique for circular cone based robotic radiotherapy.

Science.gov (United States)

Liang, Bin; Li, Yongbao; Wei, Ran; Guo, Bin; Xu, Xuang; Liu, Bo; Li, Jiafeng; Wu, Qiuwen; Zhou, Fugen

2018-01-05

With robot-controlled linac positioning, robotic radiotherapy systems such as CyberKnife significantly increase freedom of radiation beam placement, but also impose more challenges on treatment plan optimization. The resampling mechanism in the vendor-supplied treatment planning system (MultiPlan) cannot fully explore the increased beam direction search space. Besides, a sparse treatment plan (using fewer beams) is desired to improve treatment efficiency. This study proposes a singular value decomposition linear programming (SVDLP) optimization technique for circular collimator based robotic radiotherapy. The SVDLP approach initializes the input beams by simulating the process of covering the entire target volume with equivalent beam tapers. The requirements on dosimetry distribution are modeled as hard and soft constraints, and the sparsity of the treatment plan is achieved by compressive sensing. The proposed linear programming (LP) model optimizes beam weights by minimizing the deviation of soft constraints subject to hard constraints, with a constraint on the l 1 norm of the beam weight. A singular value decomposition (SVD) based acceleration technique was developed for the LP model. Based on the degeneracy of the influence matrix, the model is first compressed into lower dimension for optimization, and then back-projected to reconstruct the beam weight. After beam weight optimization, the number of beams is reduced by removing the beams with low weight, and optimizing the weights of the remaining beams using the same model. This beam reduction technique is further validated by a mixed integer programming (MIP) model. The SVDLP approach was tested on a lung case. The results demonstrate that the SVD acceleration technique speeds up the optimization by a factor of 4.8. Furthermore, the beam reduction achieves a similar plan quality to the globally optimal plan obtained by the MIP model, but is one to two orders of magnitude faster. Furthermore, the SVDLP

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

Science.gov (United States)

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

2017-10-01

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

Simulation error propagation for a dynamic rod worth measurement technique

International Nuclear Information System (INIS)

Kastanya, D.F.; Turinsky, P.J.

1996-01-01

KRSKO nuclear station, subsequently adapted by Westinghouse, introduced the dynamic rod worth measurement (DRWM) technique for measuring pressurized water reactor rod worths. This technique has the potential for reduced test time and primary loop waste water versus alternatives. The measurement is performed starting from a slightly supercritical state with all rods out (ARO), driving a bank in at the maximum stepping rate, and recording the ex-core detectors responses and bank position as a function of time. The static bank worth is obtained by (1) using the ex-core detectors' responses to obtain the core average flux (2) using the core average flux in the inverse point-kinetics equations to obtain the dynamic bank worth (3) converting the dynamic bank worth to the static bank worth. In this data interpretation process, various calculated quantities obtained from a core simulator are utilized. This paper presents an analysis of the sensitivity to the impact of core simulator errors on the deduced static bank worth

Dynamic Simulation and Optimization of Nuclear Hydrogen Production Systems

Energy Technology Data Exchange (ETDEWEB)

Paul I. Barton; Mujid S. Kaximi; Georgios Bollas; Patricio Ramirez Munoz

2009-07-31

This project is part of a research effort to design a hydrogen plant and its interface with a nuclear reactor. This project developed a dynamic modeling, simulation and optimization environment for nuclear hydrogen production systems. A hybrid discrete/continuous model captures both the continuous dynamics of the nuclear plant, the hydrogen plant, and their interface, along with discrete events such as major upsets. This hybrid model makes us of accurate thermodynamic sub-models for the description of phase and reaction equilibria in the thermochemical reactor. Use of the detailed thermodynamic models will allow researchers to examine the process in detail and have confidence in the accurary of the property package they use.

Design refinement of multilayer optical thin film devices with two optimization techniques

International Nuclear Information System (INIS)

Apparao, K.V.S.R.

1992-01-01

The design efficiency of two different optimization techniques of designing multilayer optical thin film devices is compared. Ten different devices of varying complexities are chosen as design examples for the comparison. The design refinement efficiency and the design parameter characteristics of all the sample designs obtained with the two techniques are compared. The results of the comparison demonstrate that the new method of design developed using damped least squares technique with indirect derivatives give superior and efficient designs compared to the method developed with direct derivatives. (author). 23 refs., 4 tabs., 14 figs

Optimal energy management strategy for self-reconfigurable batteries

International Nuclear Information System (INIS)

Bouchhima, Nejmeddine; Schnierle, Marc; Schulte, Sascha; Birke, Kai Peter

2017-01-01

This paper proposes a novel energy management strategy for multi-cell high voltage batteries where the current through each cell can be controlled, called self-reconfigurable batteries. An optimized control strategy further enhances the energy efficiency gained by the hardware architecture of those batteries. Currently, achieving cell equalization by using the active balancing circuits is considered as the best way to optimize the energy efficiency of the battery pack. This study demonstrates that optimizing the energy efficiency of self-reconfigurable batteries is no more strongly correlated to the cell balancing. According to the features of this novel battery architecture, the energy management strategy is formulated as nonlinear dynamic optimization problem. To solve this optimal control, an optimization algorithm that generates the optimal discharge policy for a given driving cycle is developed based on dynamic programming and code vectorization. The simulation results show that the designed energy management strategy maximizes the system efficiency across the battery lifetime over conventional approaches. Furthermore, the present energy management strategy can be implemented online due to the reduced complexity of the optimization algorithm. - Highlights: • The energy efficiency of self-reconfigurable batteries is maximized. • The energy management strategy for the battery is formulated as optimal control problem. • Developing an optimization algorithm using dynamic programming techniques and code vectorization. • Simulation studies are conducted to validate the proposed optimal strategy.

Optimal Trajectories Generation in Robotic Fiber Placement Systems

Science.gov (United States)

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

2017-06-01

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

The Value of Optimization in Dynamic Ride-Sharing: a Simulation Study in Metro Atlanta

NARCIS (Netherlands)

N.A.H. Agatz (Niels); A. Erera (Alan); M.W.P. Savelsbergh (Martin); X. Wang (Xing)

2010-01-01

textabstractSmartphone technology enables dynamic ride-sharing systems that bring together people with similar itineraries and time schedules to share rides on short-notice. This paper considers the problem of matching drivers and riders in this dynamic setting. We develop optimization-based

Optimal diabatic dynamics of Majorana-based quantum gates

Science.gov (United States)

Rahmani, Armin; Seradjeh, Babak; Franz, Marcel

2017-08-01

In topological quantum computing, unitary operations on qubits are performed by adiabatic braiding of non-Abelian quasiparticles, such as Majorana zero modes, and are protected from local environmental perturbations. In the adiabatic regime, with timescales set by the inverse gap of the system, the errors can be made arbitrarily small by performing the process more slowly. To enhance the performance of quantum information processing with Majorana zero modes, we apply the theory of optimal control to the diabatic dynamics of Majorana-based qubits. While we sacrifice complete topological protection, we impose constraints on the optimal protocol to take advantage of the nonlocal nature of topological information and increase the robustness of our gates. By using the Pontryagin's maximum principle, we show that robust equivalent gates to perfect adiabatic braiding can be implemented in finite times through optimal pulses. In our implementation, modifications to the device Hamiltonian are avoided. Focusing on thermally isolated systems, we study the effects of calibration errors and external white and 1 /f (pink) noise on Majorana-based gates. While a noise-induced antiadiabatic behavior, where a slower process creates more diabatic excitations, prohibits indefinite enhancement of the robustness of the adiabatic scheme, our fast optimal protocols exhibit remarkable stability to noise and have the potential to significantly enhance the practical performance of Majorana-based information processing.

A Multi-Cycle Q-Modulation for Dynamic Optimization of Inductive Links.

Science.gov (United States)

Lee, Byunghun; Yeon, Pyungwoo; Ghovanloo, Maysam

2016-08-01

This paper presents a new method, called multi-cycle Q-modulation, which can be used in wireless power transmission (WPT) to modulate the quality factor (Q) of the receiver (Rx) coil and dynamically optimize the load impedance to maximize the power transfer efficiency (PTE) in two-coil links. A key advantage of the proposed method is that it can be easily implemented using off-the-shelf components without requiring fast switching at or above the carrier frequency, which is more suitable for integrated circuit design. Moreover, the proposed technique does not need any sophisticated synchronization between the power carrier and Q-modulation switching pulses. The multi-cycle Q-modulation is analyzed theoretically by a lumped circuit model, and verified in simulation and measurement using an off-the-shelf prototype. Automatic resonance tuning (ART) in the Rx, combined with multi-cycle Q-modulation helped maximizing PTE of the inductive link dynamically in the presence of environmental and loading variations, which can otherwise significantly degrade the PTE in multi-coil settings. In the prototype conventional 2-coil link, the proposed method increased the power amplifier (PA) plus inductive link efficiency from 4.8% to 16.5% at ( R L = 1 kΩ, d 23 = 3 cm), and from 23% to 28.2% at ( R L = 100 Ω, d 23 = 3 cm) after 11% change in the resonance capacitance, while delivering 168.1 mW to the load (PDL).

An adaptive dual-optimal path-planning technique for unmanned air vehicles with application to solar-regenerative high altitude long endurance flight

Science.gov (United States)

Whitfield, Clifford A.

2009-12-01

A multi-objective technique for Unmanned Air Vehicle (UAV) path and trajectory autonomy generation, through task allocation and sensor fusion has been developed. The Dual-Optimal Path-Planning (D-O.P-P.) Technique generates on-line adaptive flight paths for UAVs based on available flight windows and environmental influenced objectives. The environmental influenced optimal condition, known as the driver' determines the condition, within a downstream virtual window of possible vehicle destinations and orientation built from the UAV kinematics. The intermittent results are pursued by a dynamic optimization technique to determine the flight path. This sequential optimization technique is a multi-objective optimization procedure consisting of two goals, without requiring additional information to combine the conflicting objectives into a single-objective. An example case-study and additional applications are developed and the results are discussed; including the application to the field of Solar Regenerative (SR) High Altitude Long Endurance (HALE) UAV flight. Harnessing solar energy has recently been adapted for use on high altitude UAV platforms. An aircraft that uses solar panels and powered by the sun during the day and through the night by SR systems, in principle could sustain flight for weeks or months. The requirements and limitations of solar powered flight were determined. The SR-HALE UAV platform geometry and flight characteristics were selected from an existing aircraft that has demonstrated the capability for sustained flight through flight tests. The goals were to maintain continual Situational Awareness (SA) over a case-study selected Area of Interest (AOI) and existing UAV power and surveillance systems. This was done for still wind and constant wind conditions at altitude along with variations in latitude. The characteristics of solar flux and the dependence on the surface location and orientation were established along with fixed flight maneuvers for

A New Method Based on Simulation-Optimization Approach to Find Optimal Solution in Dynamic Job-shop Scheduling Problem with Breakdown and Rework

Directory of Open Access Journals (Sweden)

Farzad Amirkhani

2017-03-01

The proposed method is implemented on classical job-shop problems with objective of makespan and results are compared with mixed integer programming model. Moreover, the appropriate dispatching priorities are achieved for dynamic job-shop problem minimizing a multi-objective criteria. The results show that simulation-based optimization are highly capable to capture the main characteristics of the shop and produce optimal/near-optimal solutions with highly credibility degree.

Dynamic stochastic optimization

CERN Document Server

Ermoliev, Yuri; Pflug, Georg

2004-01-01

Uncertainties and changes are pervasive characteristics of modern systems involving interactions between humans, economics, nature and technology. These systems are often too complex to allow for precise evaluations and, as a result, the lack of proper management (control) may create significant risks. In order to develop robust strategies we need approaches which explic­ itly deal with uncertainties, risks and changing conditions. One rather general approach is to characterize (explicitly or implicitly) uncertainties by objec­ tive or subjective probabilities (measures of confidence or belief). This leads us to stochastic optimization problems which can rarely be solved by using the standard deterministic optimization and optimal control methods. In the stochastic optimization the accent is on problems with a large number of deci­ sion and random variables, and consequently the focus ofattention is directed to efficient solution procedures rather than to (analytical) closed-form solu­ tions. Objective an...

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

Optimization models and techniques for implementation and pricing of electricity markets

International Nuclear Information System (INIS)

Madrigal Martinez, M.

2001-01-01

The operation and planning of vertically integrated electric power systems can be optimized using models that simulate solutions to problems. As the electric power industry is going through a period of restructuring, there is a need for new optimization tools. This thesis describes the importance of optimization tools and presents techniques for implementing them. It also presents methods for pricing primary electricity markets. Three modeling groups are studied. The first considers a simplified continuous and discrete model for power pool auctions. The second considers the unit commitment problem, and the third makes use of a new type of linear network-constrained clearing system model for daily markets for power and spinning reserve. The newly proposed model considers bids for supply and demand and bilateral contracts. It is a direct current model for the transmission network

Distributed Optimization based Dynamic Tariff for Congestion Management in Distribution Networks

DEFF Research Database (Denmark)

Huang, Shaojun; Wu, Qiuwei; Zhao, Haoran

2017-01-01

This paper proposes a distributed optimization based dynamic tariff (DDT) method for congestion management in distribution networks with high penetration of electric vehicles (EVs) and heat pumps (HPs). The DDT method employs a decomposition based optimization method to have aggregators explicitly...... is able to minimize the overall energy consumption cost and line loss cost, which is different from previous decomposition-based methods such as multiagent system methods. In addition, a reconditioning method and an integral controller are introduced to improve convergence of the distributed optimization...... where challenges arise due to multiple congestion points, multiple types of flexible demands and network constraints. The case studies demonstrate the efficacy of the DDT method for congestion management in distribution networks....

A Survey on Optimal Signal Processing Techniques Applied to Improve the Performance of Mechanical Sensors in Automotive Applications

Directory of Open Access Journals (Sweden)

Wilmar Hernandez

2007-01-01

Full Text Available In this paper a survey on recent applications of optimal signal processing techniques to improve the performance of mechanical sensors is made. Here, a comparison between classical filters and optimal filters for automotive sensors is made, and the current state of the art of the application of robust and optimal control and signal processing techniques to the design of the intelligent (or smart sensors that today’s cars need is presented through several experimental results that show that the fusion of intelligent sensors and optimal signal processing techniques is the clear way to go. However, the switch between the traditional methods of designing automotive sensors and the new ones cannot be done overnight because there are some open research issues that have to be solved. This paper draws attention to one of the open research issues and tries to arouse researcher’s interest in the fusion of intelligent sensors and optimal signal processing techniques.

Scalable Clustering of High-Dimensional Data Technique Using SPCM with Ant Colony Optimization Intelligence

Directory of Open Access Journals (Sweden)

Thenmozhi Srinivasan

2015-01-01

Full Text Available Clusters of high-dimensional data techniques are emerging, according to data noisy and poor quality challenges. This paper has been developed to cluster data using high-dimensional similarity based PCM (SPCM, with ant colony optimization intelligence which is effective in clustering nonspatial data without getting knowledge about cluster number from the user. The PCM becomes similarity based by using mountain method with it. Though this is efficient clustering, it is checked for optimization using ant colony algorithm with swarm intelligence. Thus the scalable clustering technique is obtained and the evaluation results are checked with synthetic datasets.

Optimization of analytical techniques to characterize antibiotics in aquatic systems

International Nuclear Information System (INIS)

Al Mokh, S.

2013-01-01

Antibiotics are considered as pollutants when they are present in aquatic ecosystems, ultimate receptacles of anthropogenic substances. These compounds are studied as their persistence in the environment or their effects on natural organisms. Numerous efforts have been made worldwide to assess the environmental quality of different water resources for the survival of aquatic species, but also for human consumption and health risk related. Towards goal, the optimization of analytical techniques for these compounds in aquatic systems remains a necessity. Our objective is to develop extraction and detection methods for 12 molecules of aminoglycosides and colistin in sewage treatment plants and hospitals waters. The lack of analytical methods for analysis of these compounds and the deficiency of studies for their detection in water is the reason for their study. Solid Phase Extraction (SPE) in classic mode (offline) or online followed by Liquid Chromatography analysis coupled with Mass Spectrometry (LC/MS/MS) is the most method commonly used for this type of analysis. The parameters are optimized and validated to ensure the best conditions for the environmental analysis. This technique was applied to real samples of wastewater treatment plants in Bordeaux and Lebanon. (author)

Optimal Control Method of Robot End Position and Orientation Based on Dynamic Tracking Measurement

Science.gov (United States)

Liu, Dalong; Xu, Lijuan

2018-01-01

In order to improve the accuracy of robot pose positioning and control, this paper proposed a dynamic tracking measurement robot pose optimization control method based on the actual measurement of D-H parameters of the robot, the parameters is taken with feedback compensation of the robot, according to the geometrical parameters obtained by robot pose tracking measurement, improved multi sensor information fusion the extended Kalan filter method, with continuous self-optimal regression, using the geometric relationship between joint axes for kinematic parameters in the model, link model parameters obtained can timely feedback to the robot, the implementation of parameter correction and compensation, finally we can get the optimal attitude angle, realize the robot pose optimization control experiments were performed. 6R dynamic tracking control of robot joint robot with independent research and development is taken as experimental subject, the simulation results show that the control method improves robot positioning accuracy, and it has the advantages of versatility, simplicity, ease of operation and so on.

WE-G-204-08: Optimized Digital Radiographic Technique for Lost Surgical Devices/Needle Identification

International Nuclear Information System (INIS)

Gorman, A; Seabrook, G; Brakken, A; Dubois, M; Marn, C; Wilson, C; Jacobson, D; Liu, Y

2015-01-01

Purpose: Small surgical devices and needles are used in many surgical procedures. Conventionally, an x-ray film is taken to identify missing devices/needles if post procedure count is incorrect. There is no data to indicate smallest surgical devices/needles that can be identified with digital radiography (DR), and its optimized acquisition technique. Methods: In this study, the DR equipment used is a Canon RadPro mobile with CXDI-70c wireless DR plate, and the same DR plate on a fixed Siemens Multix unit. Small surgical devices and needles tested include Rubber Shod, Bulldog, Fogarty Hydrogrip, and needles with sizes 3-0 C-T1 through 8-0 BV175-6. They are imaged with PMMA block phantoms with thickness of 2–8 inch, and an abdomen phantom. Various DR techniques are used. Images are reviewed on the portable x-ray acquisition display, a clinical workstation, and a diagnostic workstation. Results: all small surgical devices and needles are visible in portable DR images with 2–8 inch of PMMA. However, when they are imaged with the abdomen phantom plus 2 inch of PMMA, needles smaller than 9.3 mm length can not be visualized at the optimized technique of 81 kV and 16 mAs. There is no significant difference in visualization with various techniques, or between mobile and fixed radiography unit. However, there is noticeable difference in visualizing the smallest needle on a diagnostic reading workstation compared to the acquisition display on a portable x-ray unit. Conclusion: DR images should be reviewed on a diagnostic reading workstation. Using optimized DR techniques, the smallest needle that can be identified on all phantom studies is 9.3 mm. Sample DR images of various small surgical devices/needles available on diagnostic workstation for comparison may improve their identification. Further in vivo study is needed to confirm the optimized digital radiography technique for identification of lost small surgical devices and needles

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

Investigation and optimization of transverse non-linear beam dynamics in the high-energy storage ring HESR

Energy Technology Data Exchange (ETDEWEB)

Welsch, Dominic Markus

2010-03-10

The High-Energy Storage Ring (HESR) is part of the upcoming Facility for Antiproton and Ion Research (FAIR) which is planned as a major extension to the present facility of the Helmholtzzentrum fuer Schwerionenforschung (GSI) in Darmstadt. The HESR will provide antiprotons in the momentum range from 1.5 to 15 GeV/c for the internal target experiment PANDA. The demanding requirements of PANDA in terms of beam quality and luminosity together with a limited production rate of antiprotons call for a long beam life time and a minimum of beam loss. Therefore, an effective closed orbit correction and a sufficiently large dynamic aperture of the HESR are crucial. With this thesis I present my work on both of these topics. The expected misalignments of beam guiding magnets have been estimated and used to simulate the closed orbit in the HESR. A closed orbit correction scheme has been developed for different ion optical settings of the HESR and numerical simulations have been performed to validate the scheme. The proposed closed orbit correction method which uses the orbit response matrix has been benchmarked at the Cooler Synchrotron COSY of the Forschungszentrum Juelich. A chromaticity correction scheme for the HESR consisting of sextupole magnets has been developed to reduce tune spread and thus to minimize the emittance growth caused by betatron resonances. The chromaticity correction scheme has been optimized through dynamic aperture calculations. The estimated field errors of the HESR dipole and quadrupole magnets have been included in the non-linear beam dynamics studies. Investigations concerning their optimization have been carried out. The ion optical settings of the HESR have been improved using dynamic aperture calculations and the technique of frequency map analysis. The related diffusion coefficient was also used to predict long-term stability based on short-term particle tracking. With a reasonable reduction of the quadrupole magnets field errors and a

Fast optimization of binary clusters using a novel dynamic lattice searching method

International Nuclear Information System (INIS)

Wu, Xia; Cheng, Wen

2014-01-01

Global optimization of binary clusters has been a difficult task despite of much effort and many efficient methods. Directing toward two types of elements (i.e., homotop problem) in binary clusters, two classes of virtual dynamic lattices are constructed and a modified dynamic lattice searching (DLS) method, i.e., binary DLS (BDLS) method, is developed. However, it was found that the BDLS can only be utilized for the optimization of binary clusters with small sizes because homotop problem is hard to be solved without atomic exchange operation. Therefore, the iterated local search (ILS) method is adopted to solve homotop problem and an efficient method based on the BDLS method and ILS, named as BDLS-ILS, is presented for global optimization of binary clusters. In order to assess the efficiency of the proposed method, binary Lennard-Jones clusters with up to 100 atoms are investigated. Results show that the method is proved to be efficient. Furthermore, the BDLS-ILS method is also adopted to study the geometrical structures of (AuPd) 79 clusters with DFT-fit parameters of Gupta potential

Hybrid Approximate Dynamic Programming Approach for Dynamic Optimal Energy Flow in the Integrated Gas and Power Systems

DEFF Research Database (Denmark)

Shuai, Hang; Ai, Xiaomeng; Wen, Jinyu

2017-01-01

This paper proposes a hybrid approximate dynamic programming (ADP) approach for the multiple time-period optimal power flow in integrated gas and power systems. ADP successively solves Bellman's equation to make decisions according to the current state of the system. So, the updated near future...

Numerical Simulation of a Tumor Growth Dynamics Model Using Particle Swarm Optimization.

Science.gov (United States)

Wang, Zhijun; Wang, Qing

Tumor cell growth models involve high-dimensional parameter spaces that require computationally tractable methods to solve. To address a proposed tumor growth dynamics mathematical model, an instance of the particle swarm optimization method was implemented to speed up the search process in the multi-dimensional parameter space to find optimal parameter values that fit experimental data from mice cancel cells. The fitness function, which measures the difference between calculated results and experimental data, was minimized in the numerical simulation process. The results and search efficiency of the particle swarm optimization method were compared to those from other evolutional methods such as genetic algorithms.

Nonlinear dynamic simulation of optimal depletion of crude oil in the lower 48 United States

International Nuclear Information System (INIS)

Ruth, M.; Cleveland, C.J.

1993-01-01

This study combines the economic theory of optimal resource use with econometric estimates of demand and supply parameters to develop a nonlinear dynamic model of crude oil exploration, development, and production in the lower 48 United States. The model is simulated with the graphical programming language STELLA, for the years 1985 to 2020. The procedure encourages use of economic theory and econometrics in combination with nonlinear dynamic simulation to enhance our understanding of complex interactions present in models of optimal resource use. (author)

WE-G-18C-08: Real Time Tumor Imaging Using a Novel Dynamic Keyhole MRI Reconstruction Technique

International Nuclear Information System (INIS)

Lee, D; Pollock, S; Whelan, B; Keall, P; Greer, P; Kim, T

2014-01-01

Purpose: To test the hypothesis that the novel Dynamic Keyhole MRI reconstruction technique can accelerate image acquisition whilst maintaining high image quality for lung cancer patients. Methods: 18 MRI datasets from 5 lung cancer patients were acquired using a 3T MRI scanner. These datasets were retrospectively reconstructed using (A) The novel Dynamic Keyhole technique, (B) The conventional keyhole technique and (C) the conventional zero filling technique. The dynamic keyhole technique in MRI refers to techniques in which previously acquired k-space data is used to supplement under sampled data obtained in real time. The novel Dynamic Keyhole technique utilizes a previously acquired a library of kspace datasets in conjunction with central k-space datasets acquired in realtime. A simultaneously acquired respiratory signal is utilized to sort, match and combine the two k-space streams with respect to respiratory displacement. Reconstruction performance was quantified by (1) comparing the keyhole size (which corresponds to imaging speed) required to achieve the same image quality, and (2) maintaining a constant keyhole size across the three reconstruction methods to compare the resulting image quality to the ground truth image. Results: (1) The dynamic keyhole method required a mean keyhole size which was 48% smaller than the conventional keyhole technique and 60% smaller than the zero filling technique to achieve the same image quality. This directly corresponds to faster imaging. (2) When a constant keyhole size was utilized, the Dynamic Keyhole technique resulted in the smallest difference of the tumor region compared to the ground truth. Conclusion: The dynamic keyhole is a simple and adaptable technique for clinical applications requiring real-time imaging and tumor monitoring such as MRI guided radiotherapy. Based on the results from this study, the dynamic keyhole method could increase the imaging frequency by a factor of five compared with full k

Determination of dynamic fracture toughness using a new experimental technique

Directory of Open Access Journals (Sweden)

Cady Carl M.

2015-01-01

Full Text Available In other studies dynamic fracture toughness has been measured using Charpy impact and modified Hopkinson Bar techniques. In this paper results will be shown for the measurement of fracture toughness using a new test geometry. The crack propagation velocities range from ∼0.15 mm/s to 2.5 m/s. Digital image correlation (DIC will be the technique used to measure both the strain and the crack growth rates. The boundary of the crack is determined using the correlation coefficient generated during image analysis and with interframe timing the crack growth rate and crack opening can be determined. A comparison of static and dynamic loading experiments will be made for brittle polymeric materials. The analysis technique presented by Sammis et al. [1] is a semi-empirical solution, however, additional Linear Elastic Fracture Mechanics analysis of the strain fields generated as part of the DIC analysis allow for the more commonly used method resembling the crack tip opening displacement (CTOD experiment. It should be noted that this technique was developed because limited amounts of material were available and crack growth rates were to fast for a standard CTOD method.

Determination of dynamic fracture toughness using a new experimental technique

Science.gov (United States)

Cady, Carl M.; Liu, Cheng; Lovato, Manuel L.

2015-09-01

In other studies dynamic fracture toughness has been measured using Charpy impact and modified Hopkinson Bar techniques. In this paper results will be shown for the measurement of fracture toughness using a new test geometry. The crack propagation velocities range from ˜0.15 mm/s to 2.5 m/s. Digital image correlation (DIC) will be the technique used to measure both the strain and the crack growth rates. The boundary of the crack is determined using the correlation coefficient generated during image analysis and with interframe timing the crack growth rate and crack opening can be determined. A comparison of static and dynamic loading experiments will be made for brittle polymeric materials. The analysis technique presented by Sammis et al. [1] is a semi-empirical solution, however, additional Linear Elastic Fracture Mechanics analysis of the strain fields generated as part of the DIC analysis allow for the more commonly used method resembling the crack tip opening displacement (CTOD) experiment. It should be noted that this technique was developed because limited amounts of material were available and crack growth rates were to fast for a standard CTOD method.

Dynamic Optimization Design of Cranes Based on Human–Crane–Rail System Dynamics and Annoyance Rate

Directory of Open Access Journals (Sweden)

Yunsheng Xin

2017-01-01

Full Text Available The operators of overhead traveling cranes experience discomfort as a result of the vibrations of crane structures. These vibrations are produced by defects in the rails on which the cranes move. To improve the comfort of operators, a nine-degree-of-freedom (nine-DOF mathematical model of a “human–crane–rail” system was constructed. Based on the theoretical guidance provided in ISO 2631-1, an annoyance rate model was established, and quantization results were determined. A dynamic optimization design method for overhead traveling cranes is proposed. A particle swarm optimization (PSO algorithm was used to optimize the crane structural design, with the structure parameters as the basic variables, the annoyance rate model as the objective function, and the acceleration amplitude and displacement amplitude of the crane as the constraint conditions. The proposed model and method were used to optimize the design of a double-girder 100 t–28.5 m casting crane, and the optimal parameters are obtained. The results show that optimization decreases the human annoyance rate from 28.3% to 9.8% and the root mean square of the weighted acceleration of human vibration from 0.59 m/s2 to 0.38 m/s2. These results demonstrate the effectiveness and practical applicability of the models and method proposed in this paper.

Energy and ancillary service dispatch through dynamic optimal power flow

International Nuclear Information System (INIS)

Costa, A.L.; Costa, A. Simoes

2007-01-01

This paper presents an approach based on dynamic optimal power flow (DOPF) to clear both energy and spinning reserve day-ahead markets. A competitive environment is assumed, where agents can offer active power for both demand supply and ancillary services. The DOPF jointly determines the optimal solutions for both energy dispatch and reserve allocation. A non-linear representation for the electrical network is employed, which is able to take transmission losses and power flow limits into account. An attractive feature of the proposed approach is that the final optimal solution will automatically meet physical constraints such as generating limits and ramp rate restrictions. In addition, the proposed framework allows the definition of multiple zones in the network for each time interval, in order to ensure a more adequate distribution of reserves throughout the power system. (author)

Application of Genetic Algorithm and Particle Swarm Optimization techniques for improved image steganography systems

Directory of Open Access Journals (Sweden)

Jude Hemanth Duraisamy

2016-01-01

Full Text Available Image steganography is one of the ever growing computational approaches which has found its application in many fields. The frequency domain techniques are highly preferred for image steganography applications. However, there are significant drawbacks associated with these techniques. In transform based approaches, the secret data is embedded in random manner in the transform coefficients of the cover image. These transform coefficients may not be optimal in terms of the stego image quality and embedding capacity. In this work, the application of Genetic Algorithm (GA and Particle Swarm Optimization (PSO have been explored in the context of determining the optimal coefficients in these transforms. Frequency domain transforms such as Bandelet Transform (BT and Finite Ridgelet Transform (FRIT are used in combination with GA and PSO to improve the efficiency of the image steganography system.

Complex fluid network optimization and control integrative design based on nonlinear dynamic model

International Nuclear Information System (INIS)

Sui, Jinxue; Yang, Li; Hu, Yunan

2016-01-01

In view of distribution according to complex fluid network’s needs, this paper proposed one optimization computation method of the nonlinear programming mathematical model based on genetic algorithm. The simulation result shows that the overall energy consumption of the optimized fluid network has a decrease obviously. The control model of the fluid network is established based on nonlinear dynamics. We design the control law based on feedback linearization, take the optimal value by genetic algorithm as the simulation data, can also solve the branch resistance under the optimal value. These resistances can provide technical support and reference for fluid network design and construction, so can realize complex fluid network optimization and control integration design.

GENETIC ALGORITHM BASED CONCEPT DESIGN TO OPTIMIZE NETWORK LOAD BALANCE

Directory of Open Access Journals (Sweden)

Ashish Jain

2012-07-01

Full Text Available Multiconstraints optimal network load balancing is an NP-hard problem and it is an important part of traffic engineering. In this research we balance the network load using classical method (brute force approach and dynamic programming is used but result shows the limitation of this method but at a certain level we recognized that the optimization of balanced network load with increased number of nodes and demands is intractable using the classical method because the solution set increases exponentially. In such case the optimization techniques like evolutionary techniques can employ for optimizing network load balance. In this paper we analyzed proposed classical algorithm and evolutionary based genetic approach is devise as well as proposed in this paper for optimizing the balance network load.

A Feedback Optimal Control Algorithm with Optimal Measurement Time Points

Directory of Open Access Journals (Sweden)

Felix Jost

2017-02-01

Full Text Available Nonlinear model predictive control has been established as a powerful methodology to provide feedback for dynamic processes over the last decades. In practice it is usually combined with parameter and state estimation techniques, which allows to cope with uncertainty on many levels. To reduce the uncertainty it has also been suggested to include optimal experimental design into the sequential process of estimation and control calculation. Most of the focus so far was on dual control approaches, i.e., on using the controls to simultaneously excite the system dynamics (learning as well as minimizing a given objective (performing. We propose a new algorithm, which sequentially solves robust optimal control, optimal experimental design, state and parameter estimation problems. Thus, we decouple the control and the experimental design problems. This has the advantages that we can analyze the impact of measurement timing (sampling independently, and is practically relevant for applications with either an ethical limitation on system excitation (e.g., chemotherapy treatment or the need for fast feedback. The algorithm shows promising results with a 36% reduction of parameter uncertainties for the Lotka-Volterra fishing benchmark example.

Parallel Algorithms for Graph Optimization using Tree Decompositions

Energy Technology Data Exchange (ETDEWEB)

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

2012-06-01

Although many $\\cal{NP}$-hard graph optimization problems can be solved in polynomial time on graphs of bounded tree-width, the adoption of these techniques into mainstream scientific computation has been limited due to the high memory requirements of the necessary dynamic programming tables and excessive runtimes of sequential implementations. This work addresses both challenges by proposing a set of new parallel algorithms for all steps of a tree decomposition-based approach to solve the maximum weighted independent set problem. A hybrid OpenMP/MPI implementation includes a highly scalable parallel dynamic programming algorithm leveraging the MADNESS task-based runtime, and computational results demonstrate scaling. This work enables a significant expansion of the scale of graphs on which exact solutions to maximum weighted independent set can be obtained, and forms a framework for solving additional graph optimization problems with similar techniques.

Dynamic regime of coherent population trapping and optimization of frequency modulation parameters in atomic clocks.

Science.gov (United States)

Yudin, V I; Taichenachev, A V; Basalaev, M Yu; Kovalenko, D V

2017-02-06

We theoretically investigate the dynamic regime of coherent population trapping (CPT) in the presence of frequency modulation (FM). We have formulated the criteria for quasi-stationary (adiabatic) and dynamic (non-adiabatic) responses of atomic system driven by this FM. Using the density matrix formalism for Λ system, the error signal is exactly calculated and optimized. It is shown that the optimal FM parameters correspond to the dynamic regime of atomic-field interaction, which significantly differs from conventional description of CPT resonances in the frame of quasi-stationary approach (under small modulation frequency). Obtained theoretical results are in good qualitative agreement with different experiments. Also we have found CPT-analogue of Pound-Driver-Hall regime of frequency stabilization.

Deterministic global optimization algorithm based on outer approximation for the parameter estimation of nonlinear dynamic biological systems.

Science.gov (United States)

Miró, Anton; Pozo, Carlos; Guillén-Gosálbez, Gonzalo; Egea, Jose A; Jiménez, Laureano

2012-05-10

The estimation of parameter values for mathematical models of biological systems is an optimization problem that is particularly challenging due to the nonlinearities involved. One major difficulty is the existence of multiple minima in which standard optimization methods may fall during the search. Deterministic global optimization methods overcome this limitation, ensuring convergence to the global optimum within a desired tolerance. Global optimization techniques are usually classified into stochastic and deterministic. The former typically lead to lower CPU times but offer no guarantee of convergence to the global minimum in a finite number of iterations. In contrast, deterministic methods provide solutions of a given quality (i.e., optimality gap), but tend to lead to large computational burdens. This work presents a deterministic outer approximation-based algorithm for the global optimization of dynamic problems arising in the parameter estimation of models of biological systems. Our approach, which offers a theoretical guarantee of convergence to global minimum, is based on reformulating the set of ordinary differential equations into an equivalent set of algebraic equations through the use of orthogonal collocation methods, giving rise to a nonconvex nonlinear programming (NLP) problem. This nonconvex NLP is decomposed into two hierarchical levels: a master mixed-integer linear programming problem (MILP) that provides a rigorous lower bound on the optimal solution, and a reduced-space slave NLP that yields an upper bound. The algorithm iterates between these two levels until a termination criterion is satisfied. The capabilities of our approach were tested in two benchmark problems, in which the performance of our algorithm was compared with that of the commercial global optimization package BARON. The proposed strategy produced near optimal solutions (i.e., within a desired tolerance) in a fraction of the CPU time required by BARON.

Modeling and Optimal Control of a Class of Warfare Hybrid Dynamic Systems Based on Lanchester (n,1 Attrition Model

Directory of Open Access Journals (Sweden)

Xiangyong Chen

2014-01-01

hybrid dynamic systems is established based on Lanchester equation in a (n,1 battle, where a heterogeneous force of n different troop types faces a homogeneous force. This model can be characterized by the interaction of continuous-time models (governed by Lanchester equation, and discrete event systems (described by variable tactics. Furthermore, an expository discussion is presented on an optimal variable tactics control problem for warfare hybrid dynamic system. The optimal control strategies are designed based on dynamic programming and differential game theory. As an example of the consequences of this optimal control problem, we take the (2, 1 case and solve the optimal strategies in a (2, 1 case. Simulation results show the feasibility of warfare hybrid system model and the effectiveness of the optimal control strategies designed.

A reduced scale two loop PWR core designed with particle swarm optimization technique

International Nuclear Information System (INIS)

Lima Junior, Carlos A. Souza; Pereira, Claudio M.N.A; Lapa, Celso M.F.; Cunha, Joao J.; Alvim, Antonio C.M.

2007-01-01

Reduced scale experiments are often employed in engineering projects because they are much cheaper than real scale testing. Unfortunately, designing reduced scale thermal-hydraulic circuit or equipment, with the capability of reproducing, both accurately and simultaneously, all physical phenomena that occur in real scale and at operating conditions, is a difficult task. To solve this problem, advanced optimization techniques, such as Genetic Algorithms, have been applied. Following this research line, we have performed investigations, using the Particle Swarm Optimization (PSO) Technique, to design a reduced scale two loop Pressurized Water Reactor (PWR) core, considering 100% of nominal power and non accidental operating conditions. Obtained results show that the proposed methodology is a promising approach for forced flow reduced scale experiments. (author)

Enhanced Microgrid Dynamic Performance Using a Modulated Power Filter Based on Enhanced Bacterial Foraging Optimization

Directory of Open Access Journals (Sweden)

Ahmed M. Othman

2017-06-01

Full Text Available This paper presents a design of microgrid (MG with enhanced dynamic performance. Distributed energy resources (DER are widely used in MGs to match the various load types and profiles. DERs include solar PV cells, wind energy sources, fuel cells, batteries, micro gas-engines and storage elements. MG will include AC/DC circuits, developed power electronics devices, inverters and power electronic controllers. A novel modulated power filters (MPF device will be applied in MG design. Enhanced bacterial foraging optimization (EBFO will be proposed to optimize and set the MPF parameters to enhance and tune the MG dynamic response. Recent dynamic control is applied to minimize the harmonic reference content. EBFO will adapt the gains of MPF dynamic control. The present research achieves an enhancement of MG dynamic performance, in addition to ensuring improvements in the power factor, bus voltage profile and power quality. MG operation will be evaluated by the dynamic response to be fine-tuned by MPF based on EBFO. Digital simulations have validated the results to show the effectiveness and efficient improvement by the proposed strategy.

Parameter estimation with bio-inspired meta-heuristic optimization: modeling the dynamics of endocytosis

Directory of Open Access Journals (Sweden)

Tashkova Katerina

2011-10-01

Full Text Available Abstract Background We address the task of parameter estimation in models of the dynamics of biological systems based on ordinary differential equations (ODEs from measured data, where the models are typically non-linear and have many parameters, the measurements are imperfect due to noise, and the studied system can often be only partially observed. A representative task is to estimate the parameters in a model of the dynamics of endocytosis, i.e., endosome maturation, reflected in a cut-out switch transition between the Rab5 and Rab7 domain protein concentrations, from experimental measurements of these concentrations. The general parameter estimation task and the specific instance considered here are challenging optimization problems, calling for the use of advanced meta-heuristic optimization methods, such as evolutionary or swarm-based methods. Results We apply three global-search meta-heuristic algorithms for numerical optimization, i.e., differential ant-stigmergy algorithm (DASA, particle-swarm optimization (PSO, and differential evolution (DE, as well as a local-search derivative-based algorithm 717 (A717 to the task of estimating parameters in ODEs. We evaluate their performance on the considered representative task along a number of metrics, including the quality of reconstructing the system output and the complete dynamics, as well as the speed of convergence, both on real-experimental data and on artificial pseudo-experimental data with varying amounts of noise. We compare the four optimization methods under a range of observation scenarios, where data of different completeness and accuracy of interpretation are given as input. Conclusions Overall, the global meta-heuristic methods (DASA, PSO, and DE clearly and significantly outperform the local derivative-based method (A717. Among the three meta-heuristics, differential evolution (DE performs best in terms of the objective function, i.e., reconstructing the output, and in terms of

Parameter estimation with bio-inspired meta-heuristic optimization: modeling the dynamics of endocytosis.

Science.gov (United States)

Tashkova, Katerina; Korošec, Peter; Silc, Jurij; Todorovski, Ljupčo; Džeroski, Sašo

2011-10-11

We address the task of parameter estimation in models of the dynamics of biological systems based on ordinary differential equations (ODEs) from measured data, where the models are typically non-linear and have many parameters, the measurements are imperfect due to noise, and the studied system can often be only partially observed. A representative task is to estimate the parameters in a model of the dynamics of endocytosis, i.e., endosome maturation, reflected in a cut-out switch transition between the Rab5 and Rab7 domain protein concentrations, from experimental measurements of these concentrations. The general parameter estimation task and the specific instance considered here are challenging optimization problems, calling for the use of advanced meta-heuristic optimization methods, such as evolutionary or swarm-based methods. We apply three global-search meta-heuristic algorithms for numerical optimization, i.e., differential ant-stigmergy algorithm (DASA), particle-swarm optimization (PSO), and differential evolution (DE), as well as a local-search derivative-based algorithm 717 (A717) to the task of estimating parameters in ODEs. We evaluate their performance on the considered representative task along a number of metrics, including the quality of reconstructing the system output and the complete dynamics, as well as the speed of convergence, both on real-experimental data and on artificial pseudo-experimental data with varying amounts of noise. We compare the four optimization methods under a range of observation scenarios, where data of different completeness and accuracy of interpretation are given as input. Overall, the global meta-heuristic methods (DASA, PSO, and DE) clearly and significantly outperform the local derivative-based method (A717). Among the three meta-heuristics, differential evolution (DE) performs best in terms of the objective function, i.e., reconstructing the output, and in terms of convergence. These results hold for both real and

Optimization of structures subjected to dynamic load: deterministic and probabilistic methods

Directory of Open Access Journals (Sweden)

Élcio Cassimiro Alves

Full Text Available Abstract This paper deals with the deterministic and probabilistic optimization of structures against bending when submitted to dynamic loads. The deterministic optimization problem considers the plate submitted to a time varying load while the probabilistic one takes into account a random loading defined by a power spectral density function. The correlation between the two problems is made by one Fourier Transformed. The finite element method is used to model the structures. The sensitivity analysis is performed through the analytical method and the optimization problem is dealt with by the method of interior points. A comparison between the deterministic optimisation and the probabilistic one with a power spectral density function compatible with the time varying load shows very good results.

A decoupled power flow algorithm using particle swarm optimization technique

International Nuclear Information System (INIS)

Acharjee, P.; Goswami, S.K.

2009-01-01

A robust, nondivergent power flow method has been developed using the particle swarm optimization (PSO) technique. The decoupling properties between the power system quantities have been exploited in developing the power flow algorithm. The speed of the power flow algorithm has been improved using a simple perturbation technique. The basic power flow algorithm and the improvement scheme have been designed to retain the simplicity of the evolutionary approach. The power flow is rugged, can determine the critical loading conditions and also can handle the flexible alternating current transmission system (FACTS) devices efficiently. Test results on standard test systems show that the proposed method can find the solution when the standard power flows fail.

Combined Optimal Sizing and Control for a Hybrid Tracked Vehicle

Directory of Open Access Journals (Sweden)

Huei Peng

2012-11-01

Full Text Available The optimal sizing and control of a hybrid tracked vehicle is presented and solved in this paper. A driving schedule obtained from field tests is used to represent typical tracked vehicle operations. Dynamics of the diesel engine-permanent magnetic AC synchronous generator set, the lithium-ion battery pack, and the power split between them are modeled and validated through experiments. Two coupled optimizations, one for the plant parameters, forming the outer optimization loop and one for the control strategy, forming the inner optimization loop, are used to achieve minimum fuel consumption under the selected driving schedule. The dynamic programming technique is applied to find the optimal controller in the inner loop while the component parameters are optimized iteratively in the outer loop. The results are analyzed, and the relationship between the key parameters is observed to keep the optimal sizing and control simultaneously.

A Dynamic Operation Permission Technique Based on an MFM Model and Numerical Simulation

International Nuclear Information System (INIS)

Akio, Gofuku; Masahiro, Yonemura

2011-01-01

It is important to support operator activities to an abnormal plant situation where many counter actions are taken in relatively short time. The authors proposed a technique called dynamic operation permission to decrease human errors without eliminating creative idea of operators to cope with an abnormal plant situation by checking if the counter action taken is consistent with emergency operation procedure. If the counter action is inconsistent, a dynamic operation permission system warns it to operators. It also explains how and why the counter action is inconsistent and what influence will appear on the future plant behavior by a qualitative influence inference technique based on a model by the Mf (Multilevel Flow Modeling). However, the previous dynamic operation permission is not able to explain quantitative effects on plant future behavior. Moreover, many possible influence paths are derived because a qualitative reasoning does not give a solution when positive and negative influences are propagated to the same node. This study extends the dynamic operation permission by combining the qualitative reasoning and the numerical simulation technique. The qualitative reasoning based on an Mf model of plant derives all possible influence propagation paths. Then, a numerical simulation gives a prediction of plant future behavior in the case of taking a counter action. The influence propagation that does not coincide with the simulation results is excluded from possible influence paths. The extended technique is implemented in a dynamic operation permission system for an oil refinery plant. An MFM model and a static numerical simulator are developed. The results of dynamic operation permission for some abnormal plant situations show the improvement of the accuracy of dynamic operation permission and the quality of explanation for the effects of the counter action taken

Optimal Design of MPPT Controllers for Grid Connected Photovoltaic Array System

Science.gov (United States)

Ebrahim, M. A.; AbdelHadi, H. A.; Mahmoud, H. M.; Saied, E. M.; Salama, M. M.

2016-10-01

Integrating photovoltaic (PV) plants into electric power system exhibits challenges to power system dynamic performance. These challenges stem primarily from the natural characteristics of PV plants, which differ in some respects from the conventional plants. The most significant challenge is how to extract and regulate the maximum power from the sun. This paper presents the optimal design for the most commonly used Maximum Power Point Tracking (MPPT) techniques based on Proportional Integral tuned by Particle Swarm Optimization (PI-PSO). These suggested techniques are, (1) the incremental conductance, (2) perturb and observe, (3) fractional short circuit current and (4) fractional open circuit voltage techniques. This research work provides a comprehensive comparative study with the energy availability ratio from photovoltaic panels. The simulation results proved that the proposed controllers have an impressive tracking response. The system dynamic performance improved greatly using the proposed controllers.

Search method optimization technique for thermal design of high power RFQ structure

International Nuclear Information System (INIS)

Sharma, N.K.; Joshi, S.C.

2009-01-01

RRCAT has taken up the development of 3 MeV RFQ structure for the low energy part of 100 MeV H - ion injector linac. RFQ is a precision machined resonating structure designed for high rf duty factor. RFQ structural stability during high rf power operation is an important design issue. The thermal analysis of RFQ has been performed using ANSYS finite element analysis software and optimization of various parameters is attempted using Search Method optimization technique. It is an effective optimization technique for the systems governed by a large number of independent variables. The method involves examining a number of combinations of values of independent variables and drawing conclusions from the magnitude of the objective function at these combinations. In these methods there is a continuous improvement in the objective function throughout the course of the search and hence these methods are very efficient. The method has been employed in optimization of various parameters (called independent variables) of RFQ like cooling water flow rate, cooling water inlet temperatures, cavity thickness etc. involved in RFQ thermal design. The temperature rise within RFQ structure is the objective function during the thermal design. Using ANSYS Programming Development Language (APDL), various multiple iterative programmes are written and the analysis are performed to minimize the objective function. The dependency of the objective function on various independent variables is established and the optimum values of the parameters are evaluated. The results of the analysis are presented in the paper. (author)

Dynamic optimization approach for integrated supplier selection and tracking control of single product inventory system with product discount

Science.gov (United States)

Sutrisno; Widowati; Heru Tjahjana, R.

2017-01-01

In this paper, we propose a mathematical model in the form of dynamic/multi-stage optimization to solve an integrated supplier selection problem and tracking control problem of single product inventory system with product discount. The product discount will be stated as a piece-wise linear function. We use dynamic programming to solve this proposed optimization to determine the optimal supplier and the optimal product volume that will be purchased from the optimal supplier for each time period so that the inventory level tracks a reference trajectory given by decision maker with minimal total cost. We give a numerical experiment to evaluate the proposed model. From the result, the optimal supplier was determined for each time period and the inventory level follows the given reference well.

Combinatorial techniques to efficiently investigate and optimize organic thin film processing and properties.

Science.gov (United States)

Wieberger, Florian; Kolb, Tristan; Neuber, Christian; Ober, Christopher K; Schmidt, Hans-Werner

2013-04-08

In this article we present several developed and improved combinatorial techniques to optimize processing conditions and material properties of organic thin films. The combinatorial approach allows investigations of multi-variable dependencies and is the perfect tool to investigate organic thin films regarding their high performance purposes. In this context we develop and establish the reliable preparation of gradients of material composition, temperature, exposure, and immersion time. Furthermore we demonstrate the smart application of combinations of composition and processing gradients to create combinatorial libraries. First a binary combinatorial library is created by applying two gradients perpendicular to each other. A third gradient is carried out in very small areas and arranged matrix-like over the entire binary combinatorial library resulting in a ternary combinatorial library. Ternary combinatorial libraries allow identifying precise trends for the optimization of multi-variable dependent processes which is demonstrated on the lithographic patterning process. Here we verify conclusively the strong interaction and thus the interdependency of variables in the preparation and properties of complex organic thin film systems. The established gradient preparation techniques are not limited to lithographic patterning. It is possible to utilize and transfer the reported combinatorial techniques to other multi-variable dependent processes and to investigate and optimize thin film layers and devices for optical, electro-optical, and electronic applications.

Combinatorial Techniques to Efficiently Investigate and Optimize Organic Thin Film Processing and Properties

Directory of Open Access Journals (Sweden)

Hans-Werner Schmidt

2013-04-01

Full Text Available In this article we present several developed and improved combinatorial techniques to optimize processing conditions and material properties of organic thin films. The combinatorial approach allows investigations of multi-variable dependencies and is the perfect tool to investigate organic thin films regarding their high performance purposes. In this context we develop and establish the reliable preparation of gradients of material composition, temperature, exposure, and immersion time. Furthermore we demonstrate the smart application of combinations of composition and processing gradients to create combinatorial libraries. First a binary combinatorial library is created by applying two gradients perpendicular to each other. A third gradient is carried out in very small areas and arranged matrix-like over the entire binary combinatorial library resulting in a ternary combinatorial library. Ternary combinatorial libraries allow identifying precise trends for the optimization of multi-variable dependent processes which is demonstrated on the lithographic patterning process. Here we verify conclusively the strong interaction and thus the interdependency of variables in the preparation and properties of complex organic thin film systems. The established gradient preparation techniques are not limited to lithographic patterning. It is possible to utilize and transfer the reported combinatorial techniques to other multi-variable dependent processes and to investigate and optimize thin film layers and devices for optical, electro-optical, and electronic applications.

Robust design of decentralized power system stabilizers using meta-heuristic optimization techniques for multimachine systems

Directory of Open Access Journals (Sweden)

Jeevanandham Arumugam

2009-01-01

Full Text Available In this paper a classical lead-lag power system stabilizer is used for demonstration. The stabilizer parameters are selected in such a manner to damp the rotor oscillations. The problem of selecting the stabilizer parameters is converted to a simple optimization problem with an eigen value based objective function and it is proposed to employ simulated annealing and particle swarm optimization for solving the optimization problem. The objective function allows the selection of the stabilizer parameters to optimally place the closed-loop eigen values in the left hand side of the complex s-plane. The single machine connected to infinite bus system and 10-machine 39-bus system are considered for this study. The effectiveness of the stabilizer tuned using the best technique, in enhancing the stability of power system. Stability is confirmed through eigen value analysis and simulation results and suitable heuristic technique will be selected for the best performance of the system.

5th Optimization Day

CERN Document Server

Mees, Alistair; Fisher, Mike; Jennings, Les

2000-01-01

'Optimization Day' (OD) has been a series of annual mini-conferences in Australia since 1994. The purpose of this series of events is to gather researchers in optimization and its related areas from Australia and their collaborators, in order to exchange new developments of optimization theories, methods and their applications. The first four OD mini-conferences were held in The Uni­ versity of Ballarat (1994), The University of New South Wales (1995), The University of Melbourne (1996) and Royal Melbourne Institute of Technology (1997), respectively. They were all on the eastern coast of Australia. The fifth mini-conference Optimization Days was held at the Centre for Ap­ plied Dynamics and Optimization (CADO), Department of Mathematics and Statistics, The University of Western Australia, Perth, from 29 to 30 June 1998. This is the first time the OD mini-conference has been held at the west­ ern coast of Australia. This fifth OD preceded the International Conference on Optimization: Techniques and Applica...

Quantum Optimal Control of Single Harmonic Oscillator under Quadratic Controls together with Linear Dipole Polarizability: A Fluctuation Free Expectation Value Dynamical Perspective

International Nuclear Information System (INIS)

Ayvaz, Muzaffer; Demiralp, Metin

2011-01-01

In this study, the optimal control equations for one dimensional quantum harmonic oscillator under the quadratic control operators together with linear dipole polarizability effects are constructed in the sense of Heisenberg equation of motion. A numerical technique based on the approximation to the non-commuting quantum mechanical operators from the fluctuation free expectation value dynamics perspective in the classical limit is also proposed for the solution of optimal control equations which are ODEs with accompanying boundary conditions. The dipole interaction of the system is considered to be linear, and the observable whose expectation value will be suppressed during the control process is considered to be quadratic in terms of position operator x. The objective term operator is also assumed to be quadratic.

Optimal Reference Strain Structure for Studying Dynamic Responses of Flexible Rockets

Science.gov (United States)

Tsushima, Natsuki; Su, Weihua; Wolf, Michael G.; Griffin, Edwin D.; Dumoulin, Marie P.

2017-01-01

In the proposed paper, the optimal design of reference strain structures (RSS) will be performed targeting for the accurate observation of the dynamic bending and torsion deformation of a flexible rocket. It will provide the detailed description of the finite-element (FE) model of a notional flexible rocket created in MSC.Patran. The RSS will be attached longitudinally along the side of the rocket and to track the deformation of the thin-walled structure under external loads. An integrated surrogate-based multi-objective optimization approach will be developed to find the optimal design of the RSS using the FE model. The Kriging method will be used to construct the surrogate model. For the data sampling and the performance evaluation, static/transient analyses will be performed with MSC.Natran/Patran. The multi-objective optimization will be solved with NSGA-II to minimize the difference between the strains of the launch vehicle and RSS. Finally, the performance of the optimal RSS will be evaluated by checking its strain-tracking capability in different numerical simulations of the flexible rocket.

Modeling, simulation and optimization of bipedal walking

CERN Document Server

Berns, Karsten

2013-01-01

The model-based investigation of motions of anthropomorphic systems is an important interdisciplinary research topic involving specialists from many fields such as Robotics, Biomechanics, Physiology, Orthopedics, Psychology, Neurosciences, Sports, Computer Graphics and Applied Mathematics. This book presents a study of basic locomotion forms such as walking and running is of particular interest due to the high demand on dynamic coordination, actuator efficiency and balance control. Mathematical models and numerical simulation and optimization techniques are explained, in combination with experimental data, which can help to better understand the basic underlying mechanisms of these motions and to improve them. Example topics treated in this book are Modeling techniques for anthropomorphic bipedal walking systems Optimized walking motions for different objective functions Identification of objective functions from measurements Simulation and optimization approaches for humanoid robots Biologically inspired con...

Dynamic Deformation Behavior of Soft Material Using Shpb Technique and Pulse Shaper

Science.gov (United States)

Lee, Ouk Sub; Cho, Kyu Sang; Kim, Sung Hyun; Han, Yong Hwan

This paper presents a modified Split Hopkinson Pressure Bar (SHPB) technique to obtain compressive stress strain data for NBR rubber materials. An experimental technique with a modified the conventional SHPB has been developed for measuring the compressive stress strain responses of materials with low mechanical impedance and low compressive strengths, such as the rubber and the polymeric material. This paper uses an aluminum pressure bar to achieve a closer impedance match between the pressure bar and the specimen materials. In addition, a pulse shaper is utilized to lengthen the rising time of the incident pulse to ensure dynamic stress equilibrium and homogeneous deformation of NBR rubber materials. It is found that the modified technique can determine the dynamic deformation behavior of rubbers more accurately.

Stochastic optimal foraging: tuning intensive and extensive dynamics in random searches.

Directory of Open Access Journals (Sweden)

Frederic Bartumeus

Full Text Available Recent theoretical developments had laid down the proper mathematical means to understand how the structural complexity of search patterns may improve foraging efficiency. Under information-deprived scenarios and specific landscape configurations, Lévy walks and flights are known to lead to high search efficiencies. Based on a one-dimensional comparative analysis we show a mechanism by which, at random, a searcher can optimize the encounter with close and distant targets. The mechanism consists of combining an optimal diffusivity (optimally enhanced diffusion with a minimal diffusion constant. In such a way the search dynamics adequately balances the tension between finding close and distant targets, while, at the same time, shifts the optimal balance towards relatively larger close-to-distant target encounter ratios. We find that introducing a multiscale set of reorientations ensures both a thorough local space exploration without oversampling and a fast spreading dynamics at the large scale. Lévy reorientation patterns account for these properties but other reorientation strategies providing similar statistical signatures can mimic or achieve comparable efficiencies. Hence, the present work unveils general mechanisms underlying efficient random search, beyond the Lévy model. Our results suggest that animals could tune key statistical movement properties (e.g. enhanced diffusivity, minimal diffusion constant to cope with the very general problem of balancing out intensive and extensive random searching. We believe that theoretical developments to mechanistically understand stochastic search strategies, such as the one here proposed, are crucial to develop an empirically verifiable and comprehensive animal foraging theory.

Artificial intelligence search techniques for optimization of the cold source geometry

International Nuclear Information System (INIS)

Azmy, Y.Y.

1988-01-01

Most optimization studies of cold neutron sources have concentrated on the numerical prediction or experimental measurement of the cold moderator optimum thickness which produces the largest cold neutron leakage for a given thermal neutron source. Optimizing the geometrical shape of the cold source, however, is a more difficult problem because the optimized quantity, the cold neutron leakage, is an implicit function of the shape which is the unknown in such a study. We draw an analogy between this problem and a state space search, then we use a simple Artificial Intelligence (AI) search technique to determine the optimum cold source shape based on a two-group, r-z diffusion model. We implemented this AI design concept in the computer program AID which consists of two modules, a physical model module and a search module, which can be independently modified, improved, or made more sophisticated. 7 refs., 1 fig

Artificial intelligence search techniques for the optimization of cold source geometry

International Nuclear Information System (INIS)

Azmy, Y.Y.

1988-01-01

Most optimization studies of cold neutron sources have concentrated on the numerical prediction or experimental measurement of the cold moderator optimum thickness that produces the largest cold neutron leakage for a given thermal neutron source. Optimizing the geometric shape of the cold source, however, is a more difficult problem because the optimized quantity, the cold neutron leakage, is an implicit function of the shape, which is the unknown in such a study. An analogy is drawn between this problem and a state space search, then a simple artificial intelligence (AI) search technique is used to determine the optimum cold source shape based on a two-group, r-z diffusion model. This AI design concept was implemented in the computer program AID, which consists of two modules, a physical model module, and a search module, which can be independently modified, improved, or made more sophisticated

Stochastic network optimization with application to communication and queueing systems

CERN Document Server

Neely, Michael

2010-01-01

This text presents a modern theory of analysis, control, and optimization for dynamic networks. Mathematical techniques of Lyapunov drift and Lyapunov optimization are developed and shown to enable constrained optimization of time averages in general stochastic systems. The focus is on communication and queueing systems, including wireless networks with time-varying channels, mobility, and randomly arriving traffic. A simple drift-plus-penalty framework is used to optimize time averages such as throughput, throughput-utility, power, and distortion. Explicit performance-delay tradeoffs are prov

A comparative analysis of particle swarm optimization and differential evolution algorithms for parameter estimation in nonlinear dynamic systems

International Nuclear Information System (INIS)

Banerjee, Amit; Abu-Mahfouz, Issam

2014-01-01

The use of evolutionary algorithms has been popular in recent years for solving the inverse problem of identifying system parameters given the chaotic response of a dynamical system. The inverse problem is reformulated as a minimization problem and population-based optimizers such as evolutionary algorithms have been shown to be efficient solvers of the minimization problem. However, to the best of our knowledge, there has been no published work that evaluates the efficacy of using the two most popular evolutionary techniques – particle swarm optimization and differential evolution algorithm, on a wide range of parameter estimation problems. In this paper, the two methods along with their variants (for a total of seven algorithms) are applied to fifteen different parameter estimation problems of varying degrees of complexity. Estimation results are analyzed using nonparametric statistical methods to identify if an algorithm is statistically superior to others over the class of problems analyzed. Results based on parameter estimation quality suggest that there are significant differences between the algorithms with the newer, more sophisticated algorithms performing better than their canonical versions. More importantly, significant differences were also found among variants of the particle swarm optimizer and the best performing differential evolution algorithm

Optimal Replacement and Management Policies for Beef Cows

OpenAIRE

W. Marshall Frasier; George H. Pfeiffer

1994-01-01

Beef cow replacement studies have not reflected the interaction between herd management and the culling decision. We demonstrate techniques for modeling optimal beef cow replacement intervals and discrete management policies by incorporating the dynamic effects of management on future productivity when biological response is uncertain. Markovian decision analysis is used to identify optimal beef cow management on a ranch typical of the Sandhills region of Nebraska. Issues of breeding season l...

Hiding Techniques for Dynamic Encryption Text based on Corner Point

Science.gov (United States)

Abdullatif, Firas A.; Abdullatif, Alaa A.; al-Saffar, Amna

2018-05-01

Hiding technique for dynamic encryption text using encoding table and symmetric encryption method (AES algorithm) is presented in this paper. The encoding table is generated dynamically from MSB of the cover image points that used as the first phase of encryption. The Harris corner point algorithm is applied on cover image to generate the corner points which are used to generate dynamic AES key to second phase of text encryption. The embedded process in the LSB for the image pixels except the Harris corner points for more robust. Experimental results have demonstrated that the proposed scheme have embedding quality, error-free text recovery, and high value in PSNR.

A hybrid multi-level optimization approach for the dynamic synthesis/design and operation/control under uncertainty of a fuel cell system

International Nuclear Information System (INIS)

Kim, Kihyung; Spakovsky, Michael R. von; Wang, M.; Nelson, Douglas J.

2011-01-01

During system development, large-scale, complex energy systems require multi-disciplinary efforts to achieve system quality, cost, and performance goals. As systems become larger and more complex, the number of possible system configurations and technologies, which meet the designer's objectives optimally, increases greatly. In addition, both transient and environmental effects may need to be taken into account. Thus, the difficulty of developing the system via the formulation of a single optimization problem in which the optimal synthesis/design and operation/control of the system are achieved simultaneously is great and rather problematic. This difficulty is further heightened with the introduction of uncertainty analysis, which transforms the problem from a purely deterministic one into a probabilistic one. Uncertainties, system complexity and nonlinearity, and large numbers of decision variables quickly render the single optimization problem unsolvable by conventional, single-level, optimization strategies. To address these difficulties, the strategy adopted here combines a dynamic physical decomposition technique for large-scale optimization with a response sensitivity analysis method for quantifying system response uncertainties to given uncertainty sources. The feasibility of such a hybrid approach is established by applying it to the synthesis/design and operation/control of a 5 kW proton exchange membrane (PEM) fuel cell system.