WorldWideScience

Sample records for algorithm asset-based dynamic

  1. Exploring consumption- and asset-based poverty dynamics in Ethiopia

    African Journals Online (AJOL)

    This paper examines the dynamics of wellbeing in Ethiopia by assessing changes in poverty status based on consumption and asset ownership. Using panel data from the first two waves of the Ethiopia Socioeconomic Survey (ESS), we discover that although the cross-sectional poverty remains relatively unchanged ...

  2. Dynamic training algorithm for dynamic neural networks

    International Nuclear Information System (INIS)

    Tan, Y.; Van Cauwenberghe, A.; Liu, Z.

    1996-01-01

    The widely used backpropagation algorithm for training neural networks based on the gradient descent has a significant drawback of slow convergence. A Gauss-Newton method based recursive least squares (RLS) type algorithm with dynamic error backpropagation is presented to speed-up the learning procedure of neural networks with local recurrent terms. Finally, simulation examples concerning the applications of the RLS type algorithm to identification of nonlinear processes using a local recurrent neural network are also included in this paper

  3. Deceptiveness and genetic algorithm dynamics

    Energy Technology Data Exchange (ETDEWEB)

    Liepins, G.E. (Oak Ridge National Lab., TN (USA)); Vose, M.D. (Tennessee Univ., Knoxville, TN (USA))

    1990-01-01

    We address deceptiveness, one of at least four reasons genetic algorithms can fail to converge to function optima. We construct fully deceptive functions and other functions of intermediate deceptiveness. For the fully deceptive functions of our construction, we generate linear transformations that induce changes of representation to render the functions fully easy. We further model genetic algorithm selection recombination as the interleaving of linear and quadratic operators. Spectral analysis of the underlying matrices allows us to draw preliminary conclusions about fixed points and their stability. We also obtain an explicit formula relating the nonuniform Walsh transform to the dynamics of genetic search. 21 refs.

  4. Next Generation Suspension Dynamics Algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Schunk, Peter Randall [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Higdon, Jonathon [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Chen, Steven [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

    2014-12-01

    This research project has the objective to extend the range of application, improve the efficiency and conduct simulations with the Fast Lubrication Dynamics (FLD) algorithm for concentrated particle suspensions in a Newtonian fluid solvent. The research involves a combination of mathematical development, new computational algorithms, and application to processing flows of relevance in materials processing. The mathematical developments clarify the underlying theory, facilitate verification against classic monographs in the field and provide the framework for a novel parallel implementation optimized for an OpenMP shared memory environment. The project considered application to consolidation flows of major interest in high throughput materials processing and identified hitherto unforeseen challenges in the use of FLD in these applications. Extensions to the algorithm have been developed to improve its accuracy in these applications.

  5. Parallel algorithms for continuum dynamics

    International Nuclear Information System (INIS)

    Hicks, D.L.; Liebrock, L.M.

    1987-01-01

    Simply porting existing parallel programs to a new parallel processor may not achieve the full speedup possible; to achieve the maximum efficiency may require redesigning the parallel algorithms for the specific architecture. The authors discuss here parallel algorithms that were developed first for the HEP processor and then ported to the CRAY X-MP/4, the ELXSI/10, and the Intel iPSC/32. Focus is mainly on the most recent parallel processing results produced, i.e., those on the Intel Hypercube. The applications are simulations of continuum dynamics in which the momentum and stress gradients are important. Examples of these are inertial confinement fusion experiments, severe breaks in the coolant system of a reactor, weapons physics, shock-wave physics. Speedup efficiencies on the Intel iPSC Hypercube are very sensitive to the ratio of communication to computation. Great care must be taken in designing algorithms for this machine to avoid global communication. This is much more critical on the iPSC than it was on the three previous parallel processors

  6. Control algorithms for dynamic attenuators

    International Nuclear Information System (INIS)

    Hsieh, Scott S.; Pelc, Norbert J.

    2014-01-01

    Purpose: The authors describe algorithms to control dynamic attenuators in CT and compare their performance using simulated scans. Dynamic attenuators are prepatient beam shaping filters that modulate the distribution of x-ray fluence incident on the patient on a view-by-view basis. These attenuators can reduce dose while improving key image quality metrics such as peak or mean variance. In each view, the attenuator presents several degrees of freedom which may be individually adjusted. The total number of degrees of freedom across all views is very large, making many optimization techniques impractical. The authors develop a theory for optimally controlling these attenuators. Special attention is paid to a theoretically perfect attenuator which controls the fluence for each ray individually, but the authors also investigate and compare three other, practical attenuator designs which have been previously proposed: the piecewise-linear attenuator, the translating attenuator, and the double wedge attenuator. Methods: The authors pose and solve the optimization problems of minimizing the mean and peak variance subject to a fixed dose limit. For a perfect attenuator and mean variance minimization, this problem can be solved in simple, closed form. For other attenuator designs, the problem can be decomposed into separate problems for each view to greatly reduce the computational complexity. Peak variance minimization can be approximately solved using iterated, weighted mean variance (WMV) minimization. Also, the authors develop heuristics for the perfect and piecewise-linear attenuators which do not requirea priori knowledge of the patient anatomy. The authors compare these control algorithms on different types of dynamic attenuators using simulated raw data from forward projected DICOM files of a thorax and an abdomen. Results: The translating and double wedge attenuators reduce dose by an average of 30% relative to current techniques (bowtie filter with tube current

  7. Dynamic Programming Algorithms in Speech Recognition

    Directory of Open Access Journals (Sweden)

    Titus Felix FURTUNA

    2008-01-01

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

  8. Identifying asset-based trends in sustainable programmes which ...

    African Journals Online (AJOL)

    We indicate the similarities between the asset-based approach and current discourses focusing on the notion of schools as nodes of support and care.1 We conclude by suggesting that knowledge of asset-based good practices could be shared with families in school-based sessions, thereby developing schools', families' ...

  9. Information Dynamics in Networks: Models and Algorithms

    Science.gov (United States)

    2016-09-13

    Information Dynamics in Networks: Models and Algorithms In this project, we investigated how network structure interplays with higher level processes in...Models and Algorithms Report Title In this project, we investigated how network structure interplays with higher level processes in online social...Received Paper 1.00 2.00 3.00 . A Note on Modeling Retweet Cascades on Twitter, Workshop on Algorithms and Models for the Web Graph. 09-DEC-15

  10. Computational plasticity algorithm for particle dynamics simulations

    Science.gov (United States)

    Krabbenhoft, K.; Lyamin, A. V.; Vignes, C.

    2018-01-01

    The problem of particle dynamics simulation is interpreted in the framework of computational plasticity leading to an algorithm which is mathematically indistinguishable from the common implicit scheme widely used in the finite element analysis of elastoplastic boundary value problems. This algorithm provides somewhat of a unification of two particle methods, the discrete element method and the contact dynamics method, which usually are thought of as being quite disparate. In particular, it is shown that the former appears as the special case where the time stepping is explicit while the use of implicit time stepping leads to the kind of schemes usually labelled contact dynamics methods. The framing of particle dynamics simulation within computational plasticity paves the way for new approaches similar (or identical) to those frequently employed in nonlinear finite element analysis. These include mixed implicit-explicit time stepping, dynamic relaxation and domain decomposition schemes.

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

  12. Dynamic algorithms for the Dyck languages

    DEFF Research Database (Denmark)

    Frandsen, Gudmund Skovbjerg; Husfeldt, Thore; Miltersen, Peter Bro

    1995-01-01

    We study Dynamic Membership problems for the Dyck languages, the class of strings of properly balanced parentheses. We also study the Dynamic Word problem for the free group. We present deterministic algorithms and data structures which maintain a string under replacements of symbols, insertions......, and deletions of symbols, and language membership queries. Updates and queries are handled in polylogarithmic time. We also give both Las Vegas- and Monte Carlo-type randomised algorithms to achieve better running times, and present lower bounds on the complexity for variants of the problems....

  13. An improved genetic algorithm with dynamic topology

    International Nuclear Information System (INIS)

    Cai Kai-Quan; Tang Yan-Wu; Zhang Xue-Jun; Guan Xiang-Min

    2016-01-01

    The genetic algorithm (GA) is a nature-inspired evolutionary algorithm to find optima in search space via the interaction of individuals. Recently, researchers demonstrated that the interaction topology plays an important role in information exchange among individuals of evolutionary algorithm. In this paper, we investigate the effect of different network topologies adopted to represent the interaction structures. It is found that GA with a high-density topology ends up more likely with an unsatisfactory solution, contrarily, a low-density topology can impede convergence. Consequently, we propose an improved GA with dynamic topology, named DT-GA, in which the topology structure varies dynamically along with the fitness evolution. Several experiments executed with 15 well-known test functions have illustrated that DT-GA outperforms other test GAs for making a balance of convergence speed and optimum quality. Our work may have implications in the combination of complex networks and computational intelligence. (paper)

  14. An Asset-Based Approach to Tribal Community Energy Planning

    Energy Technology Data Exchange (ETDEWEB)

    Gutierrez, Rachael A. [Pratt Inst., Brooklyn, NY (United States). City and Regional Planning; Martino, Anthony [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States). Materials, Devices, and Energy Technologies; Begay, Sandra K. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States). Materials, Devices, and Energy Technologies

    2016-08-01

    Community energy planning is a vital component of successful energy resource development and project implementation. Planning can help tribes develop a shared vision and strategies to accomplish their energy goals. This paper explores the benefits of an asset-based approach to tribal community energy planning. While a framework for community energy planning and federal funding already exists, some areas of difficulty in the planning cycle have been identified. This paper focuses on developing a planning framework that offsets those challenges. The asset-based framework described here takes inventory of a tribe’s capital assets, such as: land capital, human capital, financial capital, and political capital. Such an analysis evaluates how being rich in a specific type of capital can offer a tribe unique advantages in implementing their energy vision. Finally, a tribal case study demonstrates the practical application of an asset-based framework.

  15. Nonequilibrium molecular dynamics theory, algorithms and applications

    CERN Document Server

    Todd, Billy D

    2017-01-01

    Written by two specialists with over twenty-five years of experience in the field, this valuable text presents a wide range of topics within the growing field of nonequilibrium molecular dynamics (NEMD). It introduces theories which are fundamental to the field - namely, nonequilibrium statistical mechanics and nonequilibrium thermodynamics - and provides state-of-the-art algorithms and advice for designing reliable NEMD code, as well as examining applications for both atomic and molecular fluids. It discusses homogenous and inhomogenous flows and pays considerable attention to highly confined fluids, such as nanofluidics. In addition to statistical mechanics and thermodynamics, the book covers the themes of temperature and thermodynamic fluxes and their computation, the theory and algorithms for homogenous shear and elongational flows, response theory and its applications, heat and mass transport algorithms, applications in molecular rheology, highly confined fluids (nanofluidics), the phenomenon of slip and...

  16. Dynamic hierarchical algorithm for accelerated microfossil identification

    Science.gov (United States)

    Wong, Cindy M.; Joseph, Dileepan

    2015-02-01

    Marine microfossils provide a useful record of the Earth's resources and prehistory via biostratigraphy. To study Hydrocarbon reservoirs and prehistoric climate, geoscientists visually identify the species of microfossils found in core samples. Because microfossil identification is labour intensive, automation has been investigated since the 1980s. With the initial rule-based systems, users still had to examine each specimen under a microscope. While artificial neural network systems showed more promise for reducing expert labour, they also did not displace manual identification for a variety of reasons, which we aim to overcome. In our human-based computation approach, the most difficult step, namely taxon identification is outsourced via a frontend website to human volunteers. A backend algorithm, called dynamic hierarchical identification, uses unsupervised, supervised, and dynamic learning to accelerate microfossil identification. Unsupervised learning clusters specimens so that volunteers need not identify every specimen during supervised learning. Dynamic learning means interim computation outputs prioritize subsequent human inputs. Using a dataset of microfossils identified by an expert, we evaluated correct and incorrect genus and species rates versus simulated time, where each specimen identification defines a moment. The proposed algorithm accelerated microfossil identification effectively, especially compared to benchmark results obtained using a k-nearest neighbour method.

  17. Domain decomposition algorithms and computational fluid dynamics

    International Nuclear Information System (INIS)

    Chan, T.F.

    1988-01-01

    In the past several years, domain decomposition has been a very popular topic, partly because of the potential of parallelization. Although numerous theories and algorithms have been developed for model elliptic problems, they are only recently starting to be tested on realistic applications. This paper investigates the application of some of these methods to two model problems in computational fluid dynamics: two-dimensional convection-diffusion problems and the incompressible driven cavity flow problem. The authors approach is the construction and analysis of efficient preconditioners for the interface operator to be used in the iterative solution of the interface solution. For the convection-diffusion problems, they discuss the effect of the convection term and its discretization on the performance of some of the preconditioners. For the driven cavity problem, they discuss the effectiveness of a class of boundary probe preconditioners

  18. A computational fluid dynamics algorithm on a massively parallel computer

    International Nuclear Information System (INIS)

    Jespersen, D.C.; Levit, C.

    1989-01-01

    The discipline of computational fluid dynamics is demanding ever-increasing computational power to deal with complex fluid flow problems. The authors investigate the performance of a finite-difference computational fluid dynamics algorithm on a massively parallel computer, the Connection Machine. Of special interest is an implicitly time-stepping algorithm; to obtain maximum performance from the Connection Machine, it is necessary to use a nonstandard algorithm to solve the linear systems that arise in the implicit algorithm. The authors find that the Connection Machine can achieve very high computation rates on both explicit and implicit algorithms. The performance of the Connection Machine puts it in the same class as conventional supercomputers

  19. Dynamic reconstruction algorithm of temperature field based on Kalman filter

    Science.gov (United States)

    Li, Yanqiu; Liu, Shi; Han, Ren

    2017-05-01

    Development of temperature reconstruction algorithm plays an important role in the application of temperature field measurement by acoustic tomography. A dynamic model of temperature field reconstruction by acoustic tomography is established. A dynamic reconstruction algorithm based on Kalman Filter (KF) is proposed considering both acoustic measurement and the dynamic evolution information. An objective function fusing space constrain with dynamic evolution information is designed. Simulation results of three temperature field distribution models show that the reconstruction quality of dynamic reconstruction method based on KF is better than those of static reconstruction methods.

  20. Dynamic Uniform Scaling for Multiobjective Genetic Algorithms

    DEFF Research Database (Denmark)

    Pedersen, Gerulf; Goldberg, David E.

    2004-01-01

    Before Multiobjective Evolutionary Algorithms (MOEAs) can be used as a widespread tool for solving arbitrary real world problems there are some salient issues which require further investigation. One of these issues is how a uniform distribution of solutions along the Pareto non-dominated front can......, the issue of obtaining a diverse set of solutions for badly scaled objective functions will be investigated and proposed solutions will be implemented using the NSGA-II algorithm....

  1. Congested Link Inference Algorithms in Dynamic Routing IP Network

    Directory of Open Access Journals (Sweden)

    Yu Chen

    2017-01-01

    Full Text Available The performance descending of current congested link inference algorithms is obviously in dynamic routing IP network, such as the most classical algorithm CLINK. To overcome this problem, based on the assumptions of Markov property and time homogeneity, we build a kind of Variable Structure Discrete Dynamic Bayesian (VSDDB network simplified model of dynamic routing IP network. Under the simplified VSDDB model, based on the Bayesian Maximum A Posteriori (BMAP and Rest Bayesian Network Model (RBNM, we proposed an Improved CLINK (ICLINK algorithm. Considering the concurrent phenomenon of multiple link congestion usually happens, we also proposed algorithm CLILRS (Congested Link Inference algorithm based on Lagrangian Relaxation Subgradient to infer the set of congested links. We validated our results by the experiments of analogy, simulation, and actual Internet.

  2. Analysing the performance of dynamic multi-objective optimisation algorithms

    CSIR Research Space (South Africa)

    Helbig, M

    2013-06-01

    Full Text Available and the goal of the algorithm is to track a set of tradeoff solutions over time. Analysing the performance of a dynamic multi-objective optimisation algorithm (DMOA) is not a trivial task. For each environment (before a change occurs) the DMOA has to find a set...

  3. New MPPT algorithm based on hybrid dynamical theory

    KAUST Repository

    Elmetennani, Shahrazed

    2014-11-01

    This paper presents a new maximum power point tracking algorithm based on the hybrid dynamical theory. A multiceli converter has been considered as an adaptation stage for the photovoltaic chain. The proposed algorithm is a hybrid automata switching between eight different operating modes, which has been validated by simulation tests under different working conditions. © 2014 IEEE.

  4. Generalized-ensemble molecular dynamics and Monte Carlo algorithms beyond the limit of the multicanonical algorithm

    International Nuclear Information System (INIS)

    Okumura, Hisashi

    2010-01-01

    I review two new generalized-ensemble algorithms for molecular dynamics and Monte Carlo simulations of biomolecules, that is, the multibaric–multithermal algorithm and the partial multicanonical algorithm. In the multibaric–multithermal algorithm, two-dimensional random walks not only in the potential-energy space but also in the volume space are realized. One can discuss the temperature dependence and pressure dependence of biomolecules with this algorithm. The partial multicanonical simulation samples a wide range of only an important part of potential energy, so that one can concentrate the effort to determine a multicanonical weight factor only on the important energy terms. This algorithm has higher sampling efficiency than the multicanonical and canonical algorithms. (review)

  5. Using Genetic Algorithms for Navigation Planning in Dynamic Environments

    Directory of Open Access Journals (Sweden)

    Ferhat Uçan

    2012-01-01

    Full Text Available Navigation planning can be considered as a combination of searching and executing the most convenient flight path from an initial waypoint to a destination waypoint. Generally the aim is to follow the flight path, which provides minimum fuel consumption for the air vehicle. For dynamic environments, constraints change dynamically during flight. This is a special case of dynamic path planning. As the main concern of this paper is flight planning, the conditions and objectives that are most probable to be used in navigation problem are considered. In this paper, the genetic algorithm solution of the dynamic flight planning problem is explained. The evolutionary dynamic navigation planning algorithm is developed for compensating the existing deficiencies of the other approaches. The existing fully dynamic algorithms process unit changes to topology one modification at a time, but when there are several such operations occurring in the environment simultaneously, the algorithms are quite inefficient. The proposed algorithm may respond to the concurrent constraint updates in a shorter time for dynamic environment. The most secure navigation of the air vehicle is planned and executed so that the fuel consumption is minimum.

  6. Dynamic Uniform Scaling for Multiobjective Genetic Algorithms

    DEFF Research Database (Denmark)

    Pedersen, Gerulf; Goldberg, D.E.

    2004-01-01

    Before Multiobjective Evolutionary Algorithms (MOEAs) can be used as a widespread tool for solving arbitrary real world problems there are some salient issues which require further investigation. One of these issues is how a uniform distribution of solutions along the Pareto non-dominated front can...

  7. Dynamic Uniform Scaling for Multiobjective Genetic Algorithms

    DEFF Research Database (Denmark)

    Pedersen, Gerulf; Goldberg, David E.

    2004-01-01

    Before Multiobjective Evolutionary Algorithms (MOEAs) can be used as a widespread tool for solving arbitrary real world problems there are some salient issues which require further investigation. One of these issues is how a uniform distribution of solutions along the Pareto non-dominated front c...

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

  9. A Computational Fluid Dynamics Algorithm on a Massively Parallel Computer

    Science.gov (United States)

    Jespersen, Dennis C.; Levit, Creon

    1989-01-01

    The discipline of computational fluid dynamics is demanding ever-increasing computational power to deal with complex fluid flow problems. We investigate the performance of a finite-difference computational fluid dynamics algorithm on a massively parallel computer, the Connection Machine. Of special interest is an implicit time-stepping algorithm; to obtain maximum performance from the Connection Machine, it is necessary to use a nonstandard algorithm to solve the linear systems that arise in the implicit algorithm. We find that the Connection Machine ran achieve very high computation rates on both explicit and implicit algorithms. The performance of the Connection Machine puts it in the same class as today's most powerful conventional supercomputers.

  10. Parallel algorithms and architecture for computation of manipulator forward dynamics

    Science.gov (United States)

    Fijany, Amir; Bejczy, Antal K.

    1989-01-01

    Parallel computation of manipulator forward dynamics is investigated. Considering three classes of algorithms for the solution of the problem, that is, the O(n), the O(n exp 2), and the O(n exp 3) algorithms, parallelism in the problem is analyzed. It is shown that the problem belongs to the class of NC and that the time and processors bounds are of O(log2/2n) and O(n exp 4), respectively. However, the fastest stable parallel algorithms achieve the computation time of O(n) and can be derived by parallelization of the O(n exp 3) serial algorithms. Parallel computation of the O(n exp 3) algorithms requires the development of parallel algorithms for a set of fundamentally different problems, that is, the Newton-Euler formulation, the computation of the inertia matrix, decomposition of the symmetric, positive definite matrix, and the solution of triangular systems. Parallel algorithms for this set of problems are developed which can be efficiently implemented on a unique architecture, a triangular array of n(n+2)/2 processors with a simple nearest-neighbor interconnection. This architecture is particularly suitable for VLSI and WSI implementations. The developed parallel algorithm, compared to the best serial O(n) algorithm, achieves an asymptotic speedup of more than two orders-of-magnitude in the computation the forward dynamics.

  11. Dynamic Shortest Path Algorithms for Hypergraphs

    Science.gov (United States)

    2014-01-01

    hypergraphs, energy efficient routing in multichannel multiradio networks, and the Enron email data set. The experiment with the Enron email data set...efficient routing inmultichannel multiradio networks, and the Enron email data set. The experiment with the Enron email data set illustrates the application...FOR HYPERGRAPHS 3 of each actor. In Section VII, we apply the proposed shortest hy- perpath algorithms to the Enron e-mail data set. We propose a

  12. Dynamic programming algorithm for detecting dim infrared moving targets

    Science.gov (United States)

    He, Lisha; Mao, Liangjing; Xie, Lijun

    2009-10-01

    Infrared (IR) target detection is a key part of airborne infrared weapon system, especially the detection of poor dim moving IR target embedded in complex context. This paper presents an improved Dynamic Programming (DP) algorithm in allusion to low Signal to Noise Ratio (SNR) infrared dim moving targets under cluttered context. The algorithm brings the dim target to prominence by accumulating the energy of pixels in the image sequence, after suppressing the background noise with a mathematical morphology preprocessor. As considering the continuity and stabilization of target's energy and forward direction, this algorithm has well solved the energy scattering problem that exists in the original DP algorithm. An effective energy segmentation threshold is given by a Contrast-Limited Adaptive Histogram Equalization (CLAHE) filter with a regional peak extraction algorithm. Simulation results show that the improved DP tracking algorithm performs well in detecting poor dim targets.

  13. Dynamic Vehicle Routing Using an Improved Variable Neighborhood Search Algorithm

    Directory of Open Access Journals (Sweden)

    Yingcheng Xu

    2013-01-01

    Full Text Available In order to effectively solve the dynamic vehicle routing problem with time windows, the mathematical model is established and an improved variable neighborhood search algorithm is proposed. In the algorithm, allocation customers and planning routes for the initial solution are completed by the clustering method. Hybrid operators of insert and exchange are used to achieve the shaking process, the later optimization process is presented to improve the solution space, and the best-improvement strategy is adopted, which make the algorithm can achieve a better balance in the solution quality and running time. The idea of simulated annealing is introduced to take control of the acceptance of new solutions, and the influences of arrival time, distribution of geographical location, and time window range on route selection are analyzed. In the experiment, the proposed algorithm is applied to solve the different sizes' problems of DVRP. Comparing to other algorithms on the results shows that the algorithm is effective and feasible.

  14. Quantum Dynamical Entropies and Gács Algorithmic Entropy

    Directory of Open Access Journals (Sweden)

    Fabio Benatti

    2012-07-01

    Full Text Available Several quantum dynamical entropies have been proposed that extend the classical Kolmogorov–Sinai (dynamical entropy. The same scenario appears in relation to the extension of algorithmic complexity theory to the quantum realm. A theorem of Brudno establishes that the complexity per unit time step along typical trajectories of a classical ergodic system equals the KS-entropy. In the following, we establish a similar relation between the Connes–Narnhofer–Thirring quantum dynamical entropy for the shift on quantum spin chains and the Gács algorithmic entropy. We further provide, for the same system, a weaker linkage between the latter algorithmic complexity and a different quantum dynamical entropy proposed by Alicki and Fannes.

  15. Successful Community Midwives in Pakistan: An Asset-Based Approach.

    Directory of Open Access Journals (Sweden)

    Zubia Mumtaz

    Full Text Available In response to the low levels of skilled birth attendance in rural Pakistan, the government introduced a new cadre of community midwives (CMWs in 2006. Assessments to-date have found that these CMWs have yet to emerge as significant providers for a number of sociocultural, geographic and financial reasons. However, a small number of CMWs have managed to establish functional practices in the private sector in conservative, infrastructure-challenged rural contexts. With an objective to highlight "what are the successful CMWs doing right given their context?" this paper adopts an asset-based approach to explore the experiences of the Pakistani CMWs who have managed to overcome the barriers and practice. We drew upon ethnographic data that was collected as part of a larger mixed methods study conducted in 2011-2012 in districts Jhelum and Layyah, Pakistan. Thirty eight CMWs, 45 other health care providers, 20 policymakers, 78 women, 35 husbands and 23 older women were interviewed. CMW clinics and practices were observed. Our data showed that only eight 8 out of 38 CMWs sampled were active providers. Poverty as a push factor to work and intrinsic individual-level characteristics that enabled the CMWs to respond successfully to the demands of the midwifery profession in the private sector emerged as the two key themes. Household poverty pushed the CMWs to work in this perceived low-status occupation. Their families supported them since they became the breadwinners. The successful CMWs also had an intrinsic sense of what was required to establish a private practice; they exhibited professionalism, had strong business sense and provided respectful maternity care. The study provides insight into how the program might improve its functioning by adapting its recruitment criteria to ensure selection of right candidates.

  16. Heuristic Scheduling Algorithm Oriented Dynamic Tasks for Imaging Satellites

    Directory of Open Access Journals (Sweden)

    Maocai Wang

    2014-01-01

    Full Text Available Imaging satellite scheduling is an NP-hard problem with many complex constraints. This paper researches the scheduling problem for dynamic tasks oriented to some emergency cases. After the dynamic properties of satellite scheduling were analyzed, the optimization model is proposed in this paper. Based on the model, two heuristic algorithms are proposed to solve the problem. The first heuristic algorithm arranges new tasks by inserting or deleting them, then inserting them repeatedly according to the priority from low to high, which is named IDI algorithm. The second one called ISDR adopts four steps: insert directly, insert by shifting, insert by deleting, and reinsert the tasks deleted. Moreover, two heuristic factors, congestion degree of a time window and the overlapping degree of a task, are employed to improve the algorithm’s performance. Finally, a case is given to test the algorithms. The results show that the IDI algorithm is better than ISDR from the running time point of view while ISDR algorithm with heuristic factors is more effective with regard to algorithm performance. Moreover, the results also show that our method has good performance for the larger size of the dynamic tasks in comparison with the other two methods.

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

  18. An enhanced dynamic hash TRIE algorithm for lexicon search

    Science.gov (United States)

    Yang, Lai; Xu, Lida; Shi, Zhongzhi

    2012-11-01

    Information retrieval (IR) is essential to enterprise systems along with growing orders, customers and materials. In this article, an enhanced dynamic hash TRIE (eDH-TRIE) algorithm is proposed that can be used in a lexicon search in Chinese, Japanese and Korean (CJK) segmentation and in URL identification. In particular, the eDH-TRIE algorithm is suitable for Unicode retrieval. The Auto-Array algorithm and Hash-Array algorithm are proposed to handle the auxiliary memory allocation; the former changes its size on demand without redundant restructuring, and the latter replaces linked lists with arrays, saving the overhead of memory. Comparative experiments show that the Auto-Array algorithm and Hash-Array algorithm have better spatial performance; they can be used in a multitude of situations. The eDH-TRIE is evaluated for both speed and storage and compared with the naïve DH-TRIE algorithms. The experiments show that the eDH-TRIE algorithm performs better. These algorithms reduce memory overheads and speed up IR.

  19. Lorentz covariant canonical symplectic algorithms for dynamics of charged particles

    Science.gov (United States)

    Wang, Yulei; Liu, Jian; Qin, Hong

    2016-12-01

    In this paper, the Lorentz covariance of algorithms is introduced. Under Lorentz transformation, both the form and performance of a Lorentz covariant algorithm are invariant. To acquire the advantages of symplectic algorithms and Lorentz covariance, a general procedure for constructing Lorentz covariant canonical symplectic algorithms (LCCSAs) is provided, based on which an explicit LCCSA for dynamics of relativistic charged particles is built. LCCSA possesses Lorentz invariance as well as long-term numerical accuracy and stability, due to the preservation of a discrete symplectic structure and the Lorentz symmetry of the system. For situations with time-dependent electromagnetic fields, which are difficult to handle in traditional construction procedures of symplectic algorithms, LCCSA provides a perfect explicit canonical symplectic solution by implementing the discretization in 4-spacetime. We also show that LCCSA has built-in energy-based adaptive time steps, which can optimize the computation performance when the Lorentz factor varies.

  20. Node-Dependence-Based Dynamic Incentive Algorithm in Opportunistic Networks

    Directory of Open Access Journals (Sweden)

    Ruiyun Yu

    2014-01-01

    Full Text Available Opportunistic networks lack end-to-end paths between source nodes and destination nodes, so the communications are mainly carried out by the “store-carry-forward” strategy. Selfish behaviors of rejecting packet relay requests will severely worsen the network performance. Incentive is an efficient way to reduce selfish behaviors and hence improves the reliability and robustness of the networks. In this paper, we propose the node-dependence-based dynamic gaming incentive (NDI algorithm, which exploits the dynamic repeated gaming to motivate nodes relaying packets for other nodes. The NDI algorithm presents a mechanism of tolerating selfish behaviors of nodes. Reward and punishment methods are also designed based on the node dependence degree. Simulation results show that the NDI algorithm is effective in increasing the delivery ratio and decreasing average latency when there are a lot of selfish nodes in the opportunistic networks.

  1. On The Algorithm for Dynamic Restoring Control Problems with ...

    African Journals Online (AJOL)

    An algorithm is hereby developed to solve a class of control problems constrained by dynamic restoring type with matrix coefficients numerically. The penalty-multiplier method is evolved to obtain an unconstrained discretized formulation. With the bilinear form expression, an associated operator is constructed via a theorem ...

  2. Molecular dynamics algorithms for path integrals at constant pressure

    Science.gov (United States)

    Martyna, Glenn J.; Hughes, Adam; Tuckerman, Mark E.

    1999-02-01

    Extended system path integral molecular dynamics algorithms have been developed that can generate efficiently averages in the quantum mechanical canonical ensemble [M. E. Tuckerman, B. J. Berne, G. J. Martyna, and M. L. Klein, J. Chem. Phys. 99, 2796 (1993)]. Here, the corresponding extended system path integral molecular dynamics algorithms appropriate to the quantum mechanical isothermal-isobaric ensembles with isotropic-only and full system cell fluctuations are presented. The former ensemble is employed to study fluid systems which do not support shear modes while the latter is employed to study solid systems. The algorithms are constructed by deriving appropriate dynamical equations of motions and developing reversible multiple time step algorithms to integrate the equations numerically. Effective parallelization schemes for distributed memory computers are presented. The new numerical methods are tested on model (a particle in a periodic potential) and realistic (liquid and solid para-hydrogen and liquid butane) systems. In addition, the methodology is extended to treat the path integral centroid dynamics scheme, [J. Cao and G. A. Voth, J. Chem. Phys. 99, 10070 (1993)], a novel method which is capable of generating semiclassical approximations to quantum mechanical time correlation functions.

  3. A focussed dynamic path finding algorithm with constraints

    CSIR Research Space (South Africa)

    Leenen, L

    2013-11-01

    Full Text Available , the authors formulated the MUPFP as a constraint satisfaction problem (CSP) where path costs are minimised whilst threat and obstacle avoidance constraints are satisfied in a dynamic environment. In this paper the previous algorithm is improved by adding a...

  4. Parallel conjugate gradient algorithms for manipulator dynamic simulation

    Science.gov (United States)

    Fijany, Amir; Scheld, Robert E.

    1989-01-01

    Parallel conjugate gradient algorithms for the computation of multibody dynamics are developed for the specialized case of a robot manipulator. For an n-dimensional positive-definite linear system, the Classical Conjugate Gradient (CCG) algorithms are guaranteed to converge in n iterations, each with a computation cost of O(n); this leads to a total computational cost of O(n sq) on a serial processor. A conjugate gradient algorithms is presented that provide greater efficiency using a preconditioner, which reduces the number of iterations required, and by exploiting parallelism, which reduces the cost of each iteration. Two Preconditioned Conjugate Gradient (PCG) algorithms are proposed which respectively use a diagonal and a tridiagonal matrix, composed of the diagonal and tridiagonal elements of the mass matrix, as preconditioners. Parallel algorithms are developed to compute the preconditioners and their inversions in O(log sub 2 n) steps using n processors. A parallel algorithm is also presented which, on the same architecture, achieves the computational time of O(log sub 2 n) for each iteration. Simulation results for a seven degree-of-freedom manipulator are presented. Variants of the proposed algorithms are also developed which can be efficiently implemented on the Robot Mathematics Processor (RMP).

  5. A Dynamical Reliability Prediction Algorithm for Composite Service

    Directory of Open Access Journals (Sweden)

    Chunli Xie

    2014-01-01

    Full Text Available Dynamic selection and dynamic binding and rebinding at runtime are new characters of composite services. The traditional static reliability prediction models are unsuitable to dynamic composite services. A new reliability predicting algorithm for composite services is proposed in this paper. Firstly, a composite service is decomposed into composition unites (executing path, composite module and atomic service according to their constituents. Consequently, a hierarchical graph of all composite units is constructed. Lastly, a new dynamic reliability prediction algorithm is presented. Comparing with the traditional reliability model, the new dynamic reliability approach is more flexible, which does not recompute reliability for all composite units and only computes the reliability of the effected composite units. In addition, an example to show how to measure the reliability based on our algorithm is designed. The experimental results show our proposed methods can give an accurate estimation of reliability. Furthermore, a more flexible sensitivity analysis is performed to determine which service component has the most significant impact on the improvement of composite service reliability.

  6. Coulomb interactions via local dynamics: a molecular-dynamics algorithm

    International Nuclear Information System (INIS)

    Pasichnyk, Igor; Duenweg, Burkhard

    2004-01-01

    We derive and describe in detail a recently proposed method for obtaining Coulomb interactions as the potential of mean force between charges which are dynamically coupled to a local electromagnetic field. We focus on the molecular dynamics version of the method and show that it is intimately related to the Car-Parrinello approach, while being equivalent to solving Maxwell's equations with a freely adjustable speed of light. Unphysical self-energies arise as a result of the lattice interpolation of charges, and are corrected by a subtraction scheme based on the exact lattice Green function. The method can be straightforwardly parallelized using standard domain decomposition. Some preliminary benchmark results are presented

  7. High speed railway track dynamics models, algorithms and applications

    CERN Document Server

    Lei, Xiaoyan

    2017-01-01

    This book systematically summarizes the latest research findings on high-speed railway track dynamics, made by the author and his research team over the past decade. It explores cutting-edge issues concerning the basic theory of high-speed railways, covering the dynamic theories, models, algorithms and engineering applications of the high-speed train and track coupling system. Presenting original concepts, systematic theories and advanced algorithms, the book places great emphasis on the precision and completeness of its content. The chapters are interrelated yet largely self-contained, allowing readers to either read through the book as a whole or focus on specific topics. It also combines theories with practice to effectively introduce readers to the latest research findings and developments in high-speed railway track dynamics. It offers a valuable resource for researchers, postgraduates and engineers in the fields of civil engineering, transportation, highway & railway engineering.

  8. Partial multicanonical algorithm for molecular dynamics and Monte Carlo simulations.

    Science.gov (United States)

    Okumura, Hisashi

    2008-09-28

    Partial multicanonical algorithm is proposed for molecular dynamics and Monte Carlo simulations. The partial multicanonical simulation samples a wide range of a part of the potential-energy terms, which is necessary to sample the conformational space widely, whereas a wide range of total potential energy is sampled in the multicanonical algorithm. Thus, one can concentrate the effort to determine the weight factor only on the important energy terms in the partial multicanonical simulation. The partial multicanonical, multicanonical, and canonical molecular dynamics algorithms were applied to an alanine dipeptide in explicit water solvent. The canonical simulation sampled the states of P(II), C(5), alpha(R), and alpha(P). The multicanonical simulation covered the alpha(L) state as well as these states. The partial multicanonical simulation also sampled the C(7) (ax) state in addition to the states that were sampled by the multicanonical simulation. In the partial multicanonical simulation, furthermore, backbone dihedral angles phi and psi rotated more frequently than those in the multicanonical and canonical simulations. These results mean that the partial multicanonical algorithm has a higher sampling efficiency than the multicanonical and canonical algorithms.

  9. Parameter identification for structural dynamics based on interval analysis algorithm

    Science.gov (United States)

    Yang, Chen; Lu, Zixing; Yang, Zhenyu; Liang, Ke

    2018-04-01

    A parameter identification method using interval analysis algorithm for structural dynamics is presented in this paper. The proposed uncertain identification method is investigated by using central difference method and ARMA system. With the help of the fixed memory least square method and matrix inverse lemma, a set-membership identification technology is applied to obtain the best estimation of the identified parameters in a tight and accurate region. To overcome the lack of insufficient statistical description of the uncertain parameters, this paper treats uncertainties as non-probabilistic intervals. As long as we know the bounds of uncertainties, this algorithm can obtain not only the center estimations of parameters, but also the bounds of errors. To improve the efficiency of the proposed method, a time-saving algorithm is presented by recursive formula. At last, to verify the accuracy of the proposed method, two numerical examples are applied and evaluated by three identification criteria respectively.

  10. Dynamic Keypoint-Based Algorithm of Object Tracking

    Science.gov (United States)

    Morgacheva, A. I.; Kulikov, V. A.; Kosykh, V. P.

    2017-05-01

    The model of the observed object plays the key role in the task of object tracking. Models as a set of image parts, in particular, keypoints, is more resistant to the changes in shape, texture, angle of view, because local changes apply only to specific parts of the object. On the other hand, any model requires updating as the appearance of the object changes with respect to the camera. In this paper, we propose a dynamic (time-varying) model, based on a set of keypoints. To update the data this model uses the algorithm of rating keypoints and the decision rule, based on a Function of Rival Similarity (FRiS). As a result, at the test set of image sequences the improvement was achieved on average by 9.3% compared to the original algorithm. On some sequences, the improvement was 16% compared to the original algorithm.

  11. Functional clustering algorithm for the analysis of dynamic network data

    Science.gov (United States)

    Feldt, S.; Waddell, J.; Hetrick, V. L.; Berke, J. D.; Żochowski, M.

    2009-05-01

    We formulate a technique for the detection of functional clusters in discrete event data. The advantage of this algorithm is that no prior knowledge of the number of functional groups is needed, as our procedure progressively combines data traces and derives the optimal clustering cutoff in a simple and intuitive manner through the use of surrogate data sets. In order to demonstrate the power of this algorithm to detect changes in network dynamics and connectivity, we apply it to both simulated neural spike train data and real neural data obtained from the mouse hippocampus during exploration and slow-wave sleep. Using the simulated data, we show that our algorithm performs better than existing methods. In the experimental data, we observe state-dependent clustering patterns consistent with known neurophysiological processes involved in memory consolidation.

  12. Multiscale Reaction-Diffusion Algorithms: PDE-Assisted Brownian Dynamics

    KAUST Repository

    Franz, Benjamin

    2013-06-19

    Two algorithms that combine Brownian dynami cs (BD) simulations with mean-field partial differential equations (PDEs) are presented. This PDE-assisted Brownian dynamics (PBD) methodology provides exact particle tracking data in parts of the domain, whilst making use of a mean-field reaction-diffusion PDE description elsewhere. The first PBD algorithm couples BD simulations with PDEs by randomly creating new particles close to the interface, which partitions the domain, and by reincorporating particles into the continuum PDE-description when they cross the interface. The second PBD algorithm introduces an overlap region, where both descriptions exist in parallel. It is shown that the overlap region is required to accurately compute variances using PBD simulations. Advantages of both PBD approaches are discussed and illustrative numerical examples are presented. © 2013 Society for Industrial and Applied Mathematics.

  13. A self-learning algorithm for biased molecular dynamics

    Science.gov (United States)

    Tribello, Gareth A.; Ceriotti, Michele; Parrinello, Michele

    2010-01-01

    A new self-learning algorithm for accelerated dynamics, reconnaissance metadynamics, is proposed that is able to work with a very large number of collective coordinates. Acceleration of the dynamics is achieved by constructing a bias potential in terms of a patchwork of one-dimensional, locally valid collective coordinates. These collective coordinates are obtained from trajectory analyses so that they adapt to any new features encountered during the simulation. We show how this methodology can be used to enhance sampling in real chemical systems citing examples both from the physics of clusters and from the biological sciences. PMID:20876135

  14. A new dynamical layout algorithm for complex biochemical reaction networks

    OpenAIRE

    Kummer Ursula; Wegner Katja

    2005-01-01

    Abstract Background To study complex biochemical reaction networks in living cells researchers more and more rely on databases and computational methods. In order to facilitate computational approaches, visualisation techniques are highly important. Biochemical reaction networks, e.g. metabolic pathways are often depicted as graphs and these graphs should be drawn dynamically to provide flexibility in the context of different data. Conventional layout algorithms are not sufficient for every k...

  15. Computational Fluid Dynamics. [numerical methods and algorithm development

    Science.gov (United States)

    1992-01-01

    This collection of papers was presented at the Computational Fluid Dynamics (CFD) Conference held at Ames Research Center in California on March 12 through 14, 1991. It is an overview of CFD activities at NASA Lewis Research Center. The main thrust of computational work at Lewis is aimed at propulsion systems. Specific issues related to propulsion CFD and associated modeling will also be presented. Examples of results obtained with the most recent algorithm development will also be presented.

  16. Cone Algorithm of Spinning Vehicles under Dynamic Coning Environment

    Directory of Open Access Journals (Sweden)

    Shuang-biao Zhang

    2015-01-01

    Full Text Available Due to the fact that attitude error of vehicles has an intense trend of divergence when vehicles undergo worsening coning environment, in this paper, the model of dynamic coning environment is derived firstly. Then, through investigation of the effect on Euler attitude algorithm for the equivalency of traditional attitude algorithm, it is found that attitude error is actually the roll angle error including drifting error and oscillating error, which is induced directly by dynamic coning environment and further affects the pitch angle and yaw angle through transferring. Based on definition of the cone frame and cone attitude, a cone algorithm is proposed by rotation relationship to calculate cone attitude, and the relationship between cone attitude and Euler attitude of spinning vehicle is established. Through numerical simulations with different conditions of dynamic coning environment, it is shown that the induced error of Euler attitude fluctuates by the variation of precession and nutation, especially by that of nutation, and the oscillating frequency of roll angle error is twice that of pitch angle error and yaw angle error. In addition, the rotation angle is more competent to describe the spinning process of vehicles under coning environment than Euler angle gamma, and the real pitch angle and yaw angle are calculated finally.

  17. The δf algorithm for beam dynamics

    International Nuclear Information System (INIS)

    Koga, J.; Tajima, T.

    1993-05-01

    An algorithm is developed to study particle dynamics of beams including collective interaction with high accuracy and low noise. Particle dynamics with collective interactions is treated through particle simulation, where the main or average distribution f 0 and the deviation away from it δf are separately followed. The main distribution f 0 is handled by an analytic equilibrium solution and the perturbation away from it δf is followed by the method of characteristics. We call this the δf algorithm. We specifically model a synchrotron collider which includes the collision section where collective effects of collisions are simulated by this δf algorithm and the rest of the collider where single particle dynamics are treated by simple harmonic transport. The most important target of this simulation is to understand and predict the long-time behavior of the beam luminosity and lifetime. The δf method allows the study the effect of small perturbations over long timescales on beam lifetime by eliminating the numerical noise problem inherent in Particle-in-Cell techniques. In the δf code using the reference parameters of the SSC (Superconducting Super Collider), beam blow-up near resonances and oscillations in the tune shift, Δν, far from resonances are observed. In studying long timescale particle diffusion in the phase space of the beams away from resonances, the δf code performance is compared with a tracking code which does not incorporate collective interaction

  18. A new parallel molecular dynamics algorithm for organic systems

    International Nuclear Information System (INIS)

    Plimpton, S.; Hendrickson, B.; Heffelfinger, G.

    1993-01-01

    A new parallel algorithm for simulating bonded molecular systems such as polymers and proteins by molecular dynamics (MD) is presented. In contrast to methods that extract parallelism by breaking the spatial domain into sub-pieces, the new method does not require regular geometries or uniform particle densities to achieve high parallel efficiency. For very large, regular systems spatial methods are often the best choice, but in practice the new method is faster for systems with tens-of-thousands of atoms simulated on large numbers of processors. It is also several times faster than the techniques commonly used for parallelizing bonded MD that assign a subset of atoms to each processor and require all-to-all communication. Implementation of the algorithm in a CHARMm-like MD model with many body forces and constraint dynamics is discussed and timings on the Intel Delta and Paragon machines are given. Example calculations using the algorithm in simulations of polymers and liquid-crystal molecules will also be briefly discussed

  19. Promoting Asset Based Approaches for Health and Wellbeing: Exploring a Theory of Change and Challenges in Evaluation

    OpenAIRE

    Rippon, S; South, J

    2017-01-01

    This project sought to explore two key areas that are critical for moving to a more systematised approach to asset based action for health. These two areas are: 1. The need to develop further a Theory of Change for asset based approaches aligned to an asset model for health 2. The requirement to understand how to measure and illustrate impact and benefit from asset based approaches. Following work to develop an understanding of practice, through site visits, interviews and a think piece event...

  20. Dynamic Programming and Graph Algorithms in Computer Vision*

    Science.gov (United States)

    Felzenszwalb, Pedro F.; Zabih, Ramin

    2013-01-01

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

  1. Dynamic programming and graph algorithms in computer vision.

    Science.gov (United States)

    Felzenszwalb, Pedro F; Zabih, Ramin

    2011-04-01

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

  2. A new dynamical layout algorithm for complex biochemical reaction networks.

    Science.gov (United States)

    Wegner, Katja; Kummer, Ursula

    2005-08-26

    To study complex biochemical reaction networks in living cells researchers more and more rely on databases and computational methods. In order to facilitate computational approaches, visualisation techniques are highly important. Biochemical reaction networks, e.g. metabolic pathways are often depicted as graphs and these graphs should be drawn dynamically to provide flexibility in the context of different data. Conventional layout algorithms are not sufficient for every kind of pathway in biochemical research. This is mainly due to certain conventions to which biochemists/biologists are used to and which are not in accordance to conventional layout algorithms. A number of approaches has been developed to improve this situation. Some of these are used in the context of biochemical databases and make more or less use of the information in these databases to aid the layout process. However, visualisation becomes also more and more important in modelling and simulation tools which mostly do not offer additional connections to databases. Therefore, layout algorithms used in these tools have to work independently of any databases. In addition, all of the existing algorithms face some limitations with respect to the number of edge crossings when it comes to larger biochemical systems due to the interconnectivity of these. Last but not least, in some cases, biochemical conventions are not met properly. Out of these reasons we have developed a new algorithm which tackles these problems by reducing the number of edge crossings in complex systems, taking further biological conventions into account to identify and visualise cycles. Furthermore the algorithm is independent from database information in order to be easily adopted in any application. It can also be tested as part of the SimWiz package (free to download for academic users at 1). The new algorithm reduces the complexity of pathways, as well as edge crossings and edge length in the resulting graphical representation

  3. A new dynamical layout algorithm for complex biochemical reaction networks

    Directory of Open Access Journals (Sweden)

    Kummer Ursula

    2005-08-01

    Full Text Available Abstract Background To study complex biochemical reaction networks in living cells researchers more and more rely on databases and computational methods. In order to facilitate computational approaches, visualisation techniques are highly important. Biochemical reaction networks, e.g. metabolic pathways are often depicted as graphs and these graphs should be drawn dynamically to provide flexibility in the context of different data. Conventional layout algorithms are not sufficient for every kind of pathway in biochemical research. This is mainly due to certain conventions to which biochemists/biologists are used to and which are not in accordance to conventional layout algorithms. A number of approaches has been developed to improve this situation. Some of these are used in the context of biochemical databases and make more or less use of the information in these databases to aid the layout process. However, visualisation becomes also more and more important in modelling and simulation tools which mostly do not offer additional connections to databases. Therefore, layout algorithms used in these tools have to work independently of any databases. In addition, all of the existing algorithms face some limitations with respect to the number of edge crossings when it comes to larger biochemical systems due to the interconnectivity of these. Last but not least, in some cases, biochemical conventions are not met properly. Results Out of these reasons we have developed a new algorithm which tackles these problems by reducing the number of edge crossings in complex systems, taking further biological conventions into account to identify and visualise cycles. Furthermore the algorithm is independent from database information in order to be easily adopted in any application. It can also be tested as part of the SimWiz package (free to download for academic users at 1. Conclusion The new algorithm reduces the complexity of pathways, as well as edge crossings

  4. Beyond Proficiency: An Asset-Based Approach to International Teaching Assistant Training

    Science.gov (United States)

    Swan, Lisa M.; Kramer, Sabrina; Gopal, Anita; Shi, Lijuan; Roth, Stephen M.

    2017-01-01

    This study assesses an asset-based approach to international teaching assistant (ITA) training at a public research institution. The program is a peer mentorship-based learning community that facilitates ITAs' cultural awareness and pedagogic development. Survey results indicate the program positively impacted participants' teaching skills,…

  5. An asset-based approach in career facilitation: Lessons for higher ...

    African Journals Online (AJOL)

    We developed and implemented an asset-based career facilitation intervention that included psychometric and post-modern career activities. We used multiple data collection strategies (observation, unstructured interviews, intervention activities, visual data and participant reflections), which we documented in various ways

  6. The Sociological Imagination and Community-Based Learning: Using an Asset-Based Approach

    Science.gov (United States)

    Garoutte, Lisa

    2018-01-01

    Fostering a sociological imagination in students is a central goal for most introductory sociology courses and sociology departments generally, yet success is difficult to achieve. This project suggests that using elements of asset-based community development can be used in sociology classrooms to develop a sociological perspective. After…

  7. "Now I Know My ABCDs": Asset-Based Community Development with School Children in Ethiopia

    Science.gov (United States)

    Johnson Butterfield, Alice K.; Yeneabat, Mulu; Moxley, David P.

    2016-01-01

    Asset-based community development (ABCD) is a promising practice for communities to engage in self-determination through the efforts residents invest in identifying community assets, framing and documenting the issues communities face, and taking action to advance quality of life. The ABCD literature does not report on the application of ABCD…

  8. An Improved Dynamic Joint Resource Allocation Algorithm Based on SFR

    Directory of Open Access Journals (Sweden)

    Yibing Li

    2016-04-01

    Full Text Available Inter-cell interference (ICI is the main factor affecting system capacity and spectral efficiency. Effective spectrum resource management is an important and challenging issue for the design of wireless communication systems. The soft frequency reuse (SFR is regarded as an interesting approach to significantly eliminate ICI. However, the allocation of resource is fixed prior to system deployment in static SFR. To overcome this drawback, this paper adopts a distributed method and proposes an improved dynamic joint resource allocation algorithm (DJRA. The improved scheme adaptively adjusts resource allocation based on the real-time user distribution. DJRA first detects the edge-user distribution vector to determine the optimal scheme, which guarantees that all the users have available resources and the number of iterations is reduced. Then, the DJRA maximizes the throughput for each cell via optimizing resource and power allocation. Due to further eliminate interference, the sector partition method is used in the center region and in view of fairness among users, the novel approach adds the proportional fair algorithm at the end of DJRA. Simulation results show that the proposed algorithm outperforms previous approaches for improving the system capacity and cell edge user performance.

  9. Algorithms for computational fluid dynamics n parallel processors

    International Nuclear Information System (INIS)

    Van de Velde, E.F.

    1986-01-01

    A study of parallel algorithms for the numerical solution of partial differential equations arising in computational fluid dynamics is presented. The actual implementation on parallel processors of shared and nonshared memory design is discussed. The performance of these algorithms is analyzed in terms of machine efficiency, communication time, bottlenecks and software development costs. For elliptic equations, a parallel preconditioned conjugate gradient method is described, which has been used to solve pressure equations discretized with high order finite elements on irregular grids. A parallel full multigrid method and a parallel fast Poisson solver are also presented. Hyperbolic conservation laws were discretized with parallel versions of finite difference methods like the Lax-Wendroff scheme and with the Random Choice method. Techniques are developed for comparing the behavior of an algorithm on different architectures as a function of problem size and local computational effort. Effective use of these advanced architecture machines requires the use of machine dependent programming. It is shown that the portability problems can be minimized by introducing high level operations on vectors and matrices structured into program libraries

  10. Dynamic airspace configuration algorithms for next generation air transportation system

    Science.gov (United States)

    Wei, Jian

    The National Airspace System (NAS) is under great pressure to safely and efficiently handle the record-high air traffic volume nowadays, and will face even greater challenge to keep pace with the steady increase of future air travel demand, since the air travel demand is projected to increase to two to three times the current level by 2025. The inefficiency of traffic flow management initiatives causes severe airspace congestion and frequent flight delays, which cost billions of economic losses every year. To address the increasingly severe airspace congestion and delays, the Next Generation Air Transportation System (NextGen) is proposed to transform the current static and rigid radar based system to a dynamic and flexible satellite based system. New operational concepts such as Dynamic Airspace Configuration (DAC) have been under development to allow more flexibility required to mitigate the demand-capacity imbalances in order to increase the throughput of the entire NAS. In this dissertation, we address the DAC problem in the en route and terminal airspace under the framework of NextGen. We develop a series of algorithms to facilitate the implementation of innovative concepts relevant with DAC in both the en route and terminal airspace. We also develop a performance evaluation framework for comprehensive benefit analyses on different aspects of future sector design algorithms. First, we complete a graph based sectorization algorithm for DAC in the en route airspace, which models the underlying air route network with a weighted graph, converts the sectorization problem into the graph partition problem, partitions the weighted graph with an iterative spectral bipartition method, and constructs the sectors from the partitioned graph. The algorithm uses a graph model to accurately capture the complex traffic patterns of the real flights, and generates sectors with high efficiency while evenly distributing the workload among the generated sectors. We further improve

  11. An evaluation of biosurveillance grid--dynamic algorithm distribution across multiple computer nodes.

    Science.gov (United States)

    Tsai, Ming-Chi; Tsui, Fu-Chiang; Wagner, Michael M

    2007-10-11

    Performing fast data analysis to detect disease outbreaks plays a critical role in real-time biosurveillance. In this paper, we described and evaluated an Algorithm Distribution Manager Service (ADMS) based on grid technologies, which dynamically partition and distribute detection algorithms across multiple computers. We compared the execution time to perform the analysis on a single computer and on a grid network (3 computing nodes) with and without using dynamic algorithm distribution. We found that algorithms with long runtime completed approximately three times earlier in distributed environment than in a single computer while short runtime algorithms performed worse in distributed environment. A dynamic algorithm distribution approach also performed better than static algorithm distribution approach. This pilot study shows a great potential to reduce lengthy analysis time through dynamic algorithm partitioning and parallel processing, and provides the opportunity of distributing algorithms from a client to remote computers in a grid network.

  12. An Evaluation of Biosurveillance Grid—Dynamic Algorithm Distribution Across Multiple Computer Nodes

    Science.gov (United States)

    Tsai, Ming-Chi; Tsui, Fu-Chiang; Wagner, Michael M.

    2007-01-01

    Performing fast data analysis to detect disease outbreaks plays a critical role in real-time biosurveillance. In this paper, we described and evaluated an Algorithm Distribution Manager Service (ADMS) based on grid technologies, which dynamically partition and distribute detection algorithms across multiple computers. We compared the execution time to perform the analysis on a single computer and on a grid network (3 computing nodes) with and without using dynamic algorithm distribution. We found that algorithms with long runtime completed approximately three times earlier in distributed environment than in a single computer while short runtime algorithms performed worse in distributed environment. A dynamic algorithm distribution approach also performed better than static algorithm distribution approach. This pilot study shows a great potential to reduce lengthy analysis time through dynamic algorithm partitioning and parallel processing, and provides the opportunity of distributing algorithms from a client to remote computers in a grid network. PMID:18693936

  13. Dynamics of the evolution of learning algorithms by selection

    International Nuclear Information System (INIS)

    Neirotti, Juan Pablo; Caticha, Nestor

    2003-01-01

    We study the evolution of artificial learning systems by means of selection. Genetic programming is used to generate populations of programs that implement algorithms used by neural network classifiers to learn a rule in a supervised learning scenario. In contrast to concentrating on final results, which would be the natural aim while designing good learning algorithms, we study the evolution process. Phenotypic and genotypic entropies, which describe the distribution of fitness and of symbols, respectively, are used to monitor the dynamics. We identify significant functional structures responsible for the improvements in the learning process. In particular, some combinations of variables and operators are useful in assessing performance in rule extraction and can thus implement annealing of the learning schedule. We also find combinations that can signal surprise, measured on a single example, by the difference between predicted and correct classification. When such favorable structures appear, they are disseminated on very short time scales throughout the population. Due to such abruptness they can be thought of as dynamical transitions. But foremost, we find a strict temporal order of such discoveries. Structures that measure performance are never useful before those for measuring surprise. Invasions of the population by such structures in the reverse order were never observed. Asymptotically, the generalization ability approaches Bayesian results

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

  15. Dynamic characterization of oil fields, complex stratigraphically using genetic algorithms

    International Nuclear Information System (INIS)

    Gonzalez, Santiago; Hidrobo, Eduardo A

    2004-01-01

    A novel methodology is presented in this paper for the characterization of highly heterogeneous oil fields by integration of the oil fields dynamic information to the static updated model. The objective of the oil field's characterization process is to build an oil field model, as realistic as possible, through the incorporation of all the available information. The classical approach consists in producing a model based in the oil field's static information, having as the process final stage the validation model with the dynamic information available. It is important to clarify that the term validation implies a punctual process by nature, generally intended to secure the required coherence between productive zones and petrophysical properties. The objective of the proposed methodology is to enhance the prediction capacity of the oil field's model by previously integrating, parameters inherent to the oil field's fluid dynamics by a process of dynamic data inversion through an optimization procedure based on evolutionary computation. The proposed methodology relies on the construction of the oil field's high-resolution static model, escalated by means of hybrid techniques while aiming to preserve the oil field's heterogeneity. Afterwards, using an analytic simulator as reference, the scaled model is methodically modified by means of an optimization process that uses genetic algorithms and production data as conditional information. The process's final product is a model that observes the static and dynamic conditions of the oil field with the capacity to minimize the economic impact that generates production historical adjustments to the simulation tasks. This final model features some petrophysical properties (porosity, permeability and water saturation), as modified to achieve a better adjustment of the simulated production's history versus the real one history matching. Additionally, the process involves a slight modification of relative permeability, which has

  16. Dynamic multiple thresholding breast boundary detection algorithm for mammograms

    International Nuclear Information System (INIS)

    Wu, Yi-Ta; Zhou Chuan; Chan, Heang-Ping; Paramagul, Chintana; Hadjiiski, Lubomir M.; Daly, Caroline Plowden; Douglas, Julie A.; Zhang Yiheng; Sahiner, Berkman; Shi Jiazheng; Wei Jun

    2010-01-01

    Purpose: Automated detection of breast boundary is one of the fundamental steps for computer-aided analysis of mammograms. In this study, the authors developed a new dynamic multiple thresholding based breast boundary (MTBB) detection method for digitized mammograms. Methods: A large data set of 716 screen-film mammograms (442 CC view and 274 MLO view) obtained from consecutive cases of an Institutional Review Board approved project were used. An experienced breast radiologist manually traced the breast boundary on each digitized image using a graphical interface to provide a reference standard. The initial breast boundary (MTBB-Initial) was obtained by dynamically adapting the threshold to the gray level range in local regions of the breast periphery. The initial breast boundary was then refined by using gradient information from horizontal and vertical Sobel filtering to obtain the final breast boundary (MTBB-Final). The accuracy of the breast boundary detection algorithm was evaluated by comparison with the reference standard using three performance metrics: The Hausdorff distance (HDist), the average minimum Euclidean distance (AMinDist), and the area overlap measure (AOM). Results: In comparison with the authors' previously developed gradient-based breast boundary (GBB) algorithm, it was found that 68%, 85%, and 94% of images had HDist errors less than 6 pixels (4.8 mm) for GBB, MTBB-Initial, and MTBB-Final, respectively. 89%, 90%, and 96% of images had AMinDist errors less than 1.5 pixels (1.2 mm) for GBB, MTBB-Initial, and MTBB-Final, respectively. 96%, 98%, and 99% of images had AOM values larger than 0.9 for GBB, MTBB-Initial, and MTBB-Final, respectively. The improvement by the MTBB-Final method was statistically significant for all the evaluation measures by the Wilcoxon signed rank test (p<0.0001). Conclusions: The MTBB approach that combined dynamic multiple thresholding and gradient information provided better performance than the breast boundary

  17. Scheduling with Group Dynamics: a Multi-Robot Task Allocation Algorithm based on Vacancy Chains

    National Research Council Canada - National Science Library

    Dahl, Torbjorn S; Mataric, Maja J; Sukhatme, Gaurav S

    2002-01-01

    .... We present a multi-robot task allocation algorithm that is sensitive to group dynamics. Our algorithm is based on vacancy chains, a resource distribution process common in human and animal societies...

  18. Dynamic collimator trajectory algorithm for multiple metastases dynamic conformal arc treatment planning.

    Science.gov (United States)

    MacDonald, R Lee; Thomas, Christopher G; Syme, Alasdair

    2018-01-01

    To develop an algorithm for dynamic collimator positioning to optimize beam's eye view (BEV) fitting of targets in dynamic conformal arc (DCA)-based radiotherapy procedures, of particular use in multiple metastases stereotactic radiosurgery procedures. A trajectory algorithm was developed to dynamically modify the angle of the collimator as a function of arc-based control point to provide optimized collimation of target volume(s). Central to this algorithm is a concept denoted herein as "whitespace" defined as any nontarget area in the BEV that is not covered by any collimation system and is open to exposure from the radiation beam. Calculating whitespace at all collimator angles and every control point, a two-dimensional topographical map depicting the tightness-of-fit of the MLC was generated. A bidirectional gradient trajectory algorithm identified a number of candidate trajectories of continuous collimator motion. Minimization of integrated whitespace was used to identify an optimal solution for the navigation of the parameter space. Plans with dynamic collimator trajectories were designed for multiple metastases targets and were compared with fixed collimator angle dynamic conformal arc (DCA) plans and standard VMAT plans. Algorithm validation was performed on simple test cases with known solutions. The whitespace metric showed a strong correlation (R 2 = 0.90) with mean dose to proximal normal tissue. Seventeen cases were studied using our algorithm to generate dynamic conformal arc (DCA) plans with optimized collimator trajectories for three and four target SRS patients and comparing them to DCA plans generated with optimized fixed collimator angles per arc and standard VMAT plans generated via template. Optimized collimator trajectories were found to produce a reduction in monitor units of up to 49.7 ± 5.1% when compared to VMAT across 17 patients, and all organ-at-risk and normal brain metrics were found to be superior or comparable. Dynamic collimator

  19. Artificial bee colony algorithm with dynamic multi-population

    Science.gov (United States)

    Zhang, Ming; Ji, Zhicheng; Wang, Yan

    2017-07-01

    To improve the convergence rate and make a balance between the global search and local turning abilities, this paper proposes a decentralized form of artificial bee colony (ABC) algorithm with dynamic multi-populations by means of fuzzy C-means (FCM) clustering. Each subpopulation periodically enlarges with the same size during the search process, and the overlapping individuals among different subareas work for delivering information acting as exploring the search space with diffusion of solutions. Moreover, a Gaussian-based search equation with redefined local attractor is proposed to further accelerate the diffusion of the best solution and guide the search towards potential areas. Experimental results on a set of benchmarks demonstrate the competitive performance of our proposed approach.

  20. RETRACTED ARTICLE: Dynamic voltage restorer controller using grade algorithm

    Directory of Open Access Journals (Sweden)

    S. Deepa

    2015-12-01

    Full Text Available This paper deals with the terminology and various issues about power quality problems. This problem occurs owing to voltage sag, swell, harmonics, and surges. The sustained overvoltage and undervoltage originated from power system may often damage/or disrupt computerized process. Voltage sags and harmonics disturb the power quality and this can be overcome by custom power device called dynamic voltage restorer (DVR. The DVR is normally installed between the source voltage and critical or sensitive load. The vital role of DVR depends on the efficiency of the control technique involved in switching circuit of the inverter. In this paper, Combination of improved grade algorithm with fuzzy membership function is used to decide the Proportional-Integral coefficients. The DVR works well both in balanced and unbalanced conditions of voltages. The simulation results show the efficiency of the proposed method.

  1. Parallel Genetic Algorithms with Dynamic Topology using Cluster Computing

    Directory of Open Access Journals (Sweden)

    ADAR, N.

    2016-08-01

    Full Text Available A parallel genetic algorithm (PGA conducts a distributed meta-heuristic search by employing genetic algorithms on more than one subpopulation simultaneously. PGAs migrate a number of individuals between subpopulations over generations. The layout that facilitates the interactions of the subpopulations is called the topology. Static migration topologies have been widely incorporated into PGAs. In this article, a PGA with a dynamic migration topology (D-PGA is proposed. D-PGA generates a new migration topology in every epoch based on the average fitness values of the subpopulations. The D-PGA has been tested against ring and fully connected migration topologies in a Beowulf Cluster. The D-PGA has outperformed the ring migration topology with comparable communication cost and has provided competitive or better results than a fully connected migration topology with significantly lower communication cost. PGA convergence behaviors have been analyzed in terms of the diversities within and between subpopulations. Conventional diversity can be considered as the diversity within a subpopulation. A new concept of permeability has been introduced to measure the diversity between subpopulations. It is shown that the success of the proposed D-PGA can be attributed to maintaining a high level of permeability while preserving diversity within subpopulations.

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

  3. Theoretical framework for a dynamic cone-beam reconstruction algorithm based on a dynamic particle model.

    Science.gov (United States)

    Grangeat, Pierre; Koenig, Anne; Rodet, Thomas; Bonnet, Stéphane

    2002-08-07

    Dynamic cone-beam reconstruction algorithms are required to reconstruct three-dimensional (3D) image sequences on dynamic 3D CT combining multi-row two-dimensional (2D) detectors and sub-second scanners. The speed-up of the rotating gantry allows one to improve the temporal resolution of the image sequence, but at the same time, it implies increase in the dose delivered during a given time period to keep constant the signal-to-noise ratio associated with each frame. The alternative solution proposed in this paper is to process data acquisition on several half-turns in order to reduce the dose delivered per rotation with the same signal-to-noise ratio. In order to compensate for time evolution and motion artefacts, we propose to use a dynamic particle model to describe the object evolution during the scan. In this article, we first introduce the dynamic particle model and the dynamic CT acquisition model. Then, we explain the principle of the proposed dynamic cone-beam reconstruction algorithm. Lastly, we present preliminary results on simulated data.

  4. Asset Based Community Driven Development Method For Agrotourism Development On Integrated Farming

    OpenAIRE

    Ridwan Syah, Muhammad; Zakariah, Muhammad Askari; Zakariah, Muhammad; Azis, Muhammad Asra

    2017-01-01

    This community based research aim to determined effect asset based community driven development (ABCD) method for agrotourism development on integrated farming system were done in Mowewe district, East Kolaka Regency. Qualitative method were used participant observation developed. Approach stage of ABCD method for agrotourism development on integrated farming system are: discovering strengths, organizing and mapping, lingking and mobilizing, community driven initiatives and sustaining the pro...

  5. Dynamic load balancing algorithm for molecular dynamics based on Voronoi cells domain decompositions

    Energy Technology Data Exchange (ETDEWEB)

    Fattebert, J.-L. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Richards, D.F. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Glosli, J.N. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

    2012-12-01

    We present a new algorithm for automatic parallel load balancing in classical molecular dynamics. It assumes a spatial domain decomposition of particles into Voronoi cells. It is a gradient method which attempts to minimize a cost function by displacing Voronoi sites associated with each processor/sub-domain along steepest descent directions. Excellent load balance has been obtained for quasi-2D and 3D practical applications, with up to 440·106 particles on 65,536 MPI tasks.

  6. DSMC multicomponent aerosol dynamics: Sampling algorithms and aerosol processes

    Science.gov (United States)

    Palaniswaamy, Geethpriya

    The post-accident nuclear reactor primary and containment environments can be characterized by high temperatures and pressures, and fission products and nuclear aerosols. These aerosols evolve via natural transport processes as well as under the influence of engineered safety features. These aerosols can be hazardous and may pose risk to the public if released into the environment. Computations of their evolution, movement and distribution involve the study of various processes such as coagulation, deposition, condensation, etc., and are influenced by factors such as particle shape, charge, radioactivity and spatial inhomogeneity. These many factors make the numerical study of nuclear aerosol evolution computationally very complicated. The focus of this research is on the use of the Direct Simulation Monte Carlo (DSMC) technique to elucidate the role of various phenomena that influence the nuclear aerosol evolution. In this research, several aerosol processes such as coagulation, deposition, condensation, and source reinforcement are explored for a multi-component, aerosol dynamics problem in a spatially homogeneous medium. Among the various sampling algorithms explored the Metropolis sampling algorithm was found to be effective and fast. Several test problems and test cases are simulated using the DSMC technique. The DSMC results obtained are verified against the analytical and sectional results for appropriate test problems. Results show that the assumption of a single mean density is not appropriate due to the complicated effect of component densities on the aerosol processes. The methods developed and the insights gained will also be helpful in future research on the challenges associated with the description of fission product and aerosol releases.

  7. A Formal Verification Model for Performance Analysis of Reinforcement Learning Algorithms Applied t o Dynamic Networks

    OpenAIRE

    Shrirang Ambaji KULKARNI; Raghavendra G . RAO

    2017-01-01

    Routing data packets in a dynamic network is a difficult and important problem in computer networks. As the network is dynamic, it is subject to frequent topology changes and is subject to variable link costs due to congestion and bandwidth. Existing shortest path algorithms fail to converge to better solutions under dynamic network conditions. Reinforcement learning algorithms posses better adaptation techniques in dynamic environments. In this paper we apply model based Q-Routing technique ...

  8. Warehouse stocking optimization based on dynamic ant colony genetic algorithm

    Science.gov (United States)

    Xiao, Xiaoxu

    2018-04-01

    In view of the various orders of FAW (First Automotive Works) International Logistics Co., Ltd., the SLP method is used to optimize the layout of the warehousing units in the enterprise, thus the warehouse logistics is optimized and the external processing speed of the order is improved. In addition, the relevant intelligent algorithms for optimizing the stocking route problem are analyzed. The ant colony algorithm and genetic algorithm which have good applicability are emphatically studied. The parameters of ant colony algorithm are optimized by genetic algorithm, which improves the performance of ant colony algorithm. A typical path optimization problem model is taken as an example to prove the effectiveness of parameter optimization.

  9. Optimal Dynamic Strategies for Index Tracking and Algorithmic Trading

    Science.gov (United States)

    Ward, Brian

    In this thesis we study dynamic strategies for index tracking and algorithmic trading. Tracking problems have become ever more important in Financial Engineering as investors seek to precisely control their portfolio risks and exposures over different time horizons. This thesis analyzes various tracking problems and elucidates the tracking errors and strategies one can employ to minimize those errors and maximize profit. In Chapters 2 and 3, we study the empirical tracking properties of exchange traded funds (ETFs), leveraged ETFs (LETFs), and futures products related to spot gold and the Chicago Board Option Exchange (CBOE) Volatility Index (VIX), respectively. These two markets provide interesting and differing examples for understanding index tracking. We find that static strategies work well in the nonleveraged case for gold, but fail to track well in the corresponding leveraged case. For VIX, tracking via neither ETFs, nor futures\\ portfolios succeeds, even in the nonleveraged case. This motivates the need for dynamic strategies, some of which we construct in these two chapters and further expand on in Chapter 4. There, we analyze a framework for index tracking and risk exposure control through financial derivatives. We derive a tracking condition that restricts our exposure choices and also define a slippage process that characterizes the deviations from the index over longer horizons. The framework is applied to a number of models, for example, Black Scholes model and Heston model for equity index tracking, as well as the Square Root (SQR) model and the Concatenated Square Root (CSQR) model for VIX tracking. By specifying how each of these models fall into our framework, we are able to understand the tracking errors in each of these models. Finally, Chapter 5 analyzes a tracking problem of a different kind that arises in algorithmic trading: schedule following for optimal execution. We formulate and solve a stochastic control problem to obtain the optimal

  10. Dynamic Inertia Weight Binary Bat Algorithm with Neighborhood Search

    Directory of Open Access Journals (Sweden)

    Xingwang Huang

    2017-01-01

    Full Text Available Binary bat algorithm (BBA is a binary version of the bat algorithm (BA. It has been proven that BBA is competitive compared to other binary heuristic algorithms. Since the update processes of velocity in the algorithm are consistent with BA, in some cases, this algorithm also faces the premature convergence problem. This paper proposes an improved binary bat algorithm (IBBA to solve this problem. To evaluate the performance of IBBA, standard benchmark functions and zero-one knapsack problems have been employed. The numeric results obtained by benchmark functions experiment prove that the proposed approach greatly outperforms the original BBA and binary particle swarm optimization (BPSO. Compared with several other heuristic algorithms on zero-one knapsack problems, it also verifies that the proposed algorithm is more able to avoid local minima.

  11. A domain specific language for performance portable molecular dynamics algorithms

    Science.gov (United States)

    Saunders, William Robert; Grant, James; Müller, Eike Hermann

    2018-03-01

    Developers of Molecular Dynamics (MD) codes face significant challenges when adapting existing simulation packages to new hardware. In a continuously diversifying hardware landscape it becomes increasingly difficult for scientists to be experts both in their own domain (physics/chemistry/biology) and specialists in the low level parallelisation and optimisation of their codes. To address this challenge, we describe a "Separation of Concerns" approach for the development of parallel and optimised MD codes: the science specialist writes code at a high abstraction level in a domain specific language (DSL), which is then translated into efficient computer code by a scientific programmer. In a related context, an abstraction for the solution of partial differential equations with grid based methods has recently been implemented in the (Py)OP2 library. Inspired by this approach, we develop a Python code generation system for molecular dynamics simulations on different parallel architectures, including massively parallel distributed memory systems and GPUs. We demonstrate the efficiency of the auto-generated code by studying its performance and scalability on different hardware and compare it to other state-of-the-art simulation packages. With growing data volumes the extraction of physically meaningful information from the simulation becomes increasingly challenging and requires equally efficient implementations. A particular advantage of our approach is the easy expression of such analysis algorithms. We consider two popular methods for deducing the crystalline structure of a material from the local environment of each atom, show how they can be expressed in our abstraction and implement them in the code generation framework.

  12. Analysis of Ant Colony Optimization and Population-Based Evolutionary Algorithms on Dynamic Problems

    DEFF Research Database (Denmark)

    Lissovoi, Andrei

    the dynamic optimum for finite alphabets up to size μ, while MMAS is able to do so for any finite alphabet size. Parallel Evolutionary Algorithms on Maze. We prove that while a (1 + λ) EA is unable to track the optimum of the dynamic fitness function Maze for offspring population size up to λ = O(n1-ε......This thesis presents new running time analyses of nature-inspired algorithms on various dynamic problems. It aims to identify and analyse the features of algorithms and problem classes which allow efficient optimization to occur in the presence of dynamic behaviour. We consider the following...... settings: λ-MMAS on Dynamic Shortest Path Problems. We investigate how in-creasing the number of ants simulated per iteration may help an ACO algorithm to track optimum in a dynamic problem. It is shown that while a constant number of ants per-vertex is sufficient to track some oscillations, there also...

  13. Maintenance of Process Control Algorithms based on Dynamic Program Slicing

    DEFF Research Database (Denmark)

    Hansen, Ole Fink; Andersen, Nils Axel; Ravn, Ole

    2010-01-01

    Today’s industrial control systems gradually lose performance after installation and must be regularly maintained by means of adjusting parameters and modifying the control algorithm, in order to regain high performance. Industrial control algorithms are complex software systems, and it is partic...... modifying the existing control algorithm, which makes the solution well suited for industrial applications.......Today’s industrial control systems gradually lose performance after installation and must be regularly maintained by means of adjusting parameters and modifying the control algorithm, in order to regain high performance. Industrial control algorithms are complex software systems......, and it is particularly difficult to locate causes of performance loss, while readjusting the algorithm once the cause of performance loss is actually realized and found is relatively simple. In this paper we present a software-engineering approach to the maintenance problem, which provides tools for exploring...

  14. Teaching corner: child family health international : the ethics of asset-based global health education programs.

    Science.gov (United States)

    Evert, Jessica

    2015-03-01

    Child Family Health International (CFHI) is a U.S.-based nonprofit, nongovernmental organization (NGO) that has more than 25 global health education programs in seven countries annually serving more than 600 interprofessional undergraduate, graduate, and postgraduate participants in programs geared toward individual students and university partners. Recognized by Special Consultative Status with the United Nations Economic and Social Council (ECOSOC), CFHI utilizes an asset-based community engagement model to ensure that CFHI's programs challenge, rather than reinforce, historical power imbalances between the "Global North" and "Global South." CFHI's programs are predicated on ethical principles including reciprocity, sustainability, humility, transparency, nonmaleficence, respect for persons, and social justice.

  15. A Dynamic Fuzzy Cluster Algorithm for Time Series

    Directory of Open Access Journals (Sweden)

    Min Ji

    2013-01-01

    clustering time series by introducing the definition of key point and improving FCM algorithm. The proposed algorithm works by determining those time series whose class labels are vague and further partitions them into different clusters over time. The main advantage of this approach compared with other existing algorithms is that the property of some time series belonging to different clusters over time can be partially revealed. Results from simulation-based experiments on geographical data demonstrate the excellent performance and the desired results have been obtained. The proposed algorithm can be applied to solve other clustering problems in data mining.

  16. Event-chain algorithm for the Heisenberg model: Evidence for z≃1 dynamic scaling.

    Science.gov (United States)

    Nishikawa, Yoshihiko; Michel, Manon; Krauth, Werner; Hukushima, Koji

    2015-12-01

    We apply the event-chain Monte Carlo algorithm to the three-dimensional ferromagnetic Heisenberg model. The algorithm is rejection-free and also realizes an irreversible Markov chain that satisfies global balance. The autocorrelation functions of the magnetic susceptibility and the energy indicate a dynamical critical exponent z≈1 at the critical temperature, while that of the magnetization does not measure the performance of the algorithm. We show that the event-chain Monte Carlo algorithm substantially reduces the dynamical critical exponent from the conventional value of z≃2.

  17. A Method Based on Dial's Algorithm for Multi-time Dynamic Traffic Assignment

    Directory of Open Access Journals (Sweden)

    Rongjie Kuang

    2014-03-01

    Full Text Available Due to static traffic assignment has poor performance in reflecting actual case and dynamic traffic assignment may incurs excessive compute cost, method of multi-time dynamic traffic assignment combining static and dynamic traffic assignment balances factors of precision and cost effectively. A method based on Dial's logit algorithm is proposed in the article to solve the dynamic stochastic user equilibrium problem in dynamic traffic assignment. Before that, a fitting function that can proximately reflect overloaded traffic condition of link is proposed and used to give corresponding model. Numerical example is given to illustrate heuristic procedure of method and to compare results with one of same example solved by other literature's algorithm. Results show that method based on Dial's algorithm is preferable to algorithm from others.

  18. Multi-heuristic dynamic task allocation using genetic algorithms in a heterogeneous distributed system

    Science.gov (United States)

    Page, Andrew J.; Keane, Thomas M.; Naughton, Thomas J.

    2010-01-01

    We present a multi-heuristic evolutionary task allocation algorithm to dynamically map tasks to processors in a heterogeneous distributed system. It utilizes a genetic algorithm, combined with eight common heuristics, in an effort to minimize the total execution time. It operates on batches of unmapped tasks and can preemptively remap tasks to processors. The algorithm has been implemented on a Java distributed system and evaluated with a set of six problems from the areas of bioinformatics, biomedical engineering, computer science and cryptography. Experiments using up to 150 heterogeneous processors show that the algorithm achieves better efficiency than other state-of-the-art heuristic algorithms. PMID:20862190

  19. Finite element solution algorithm for incompressible fluid dynamics

    Science.gov (United States)

    Baker, A. J.

    1974-01-01

    A finite element solution algorithm is established for the two-dimensional Navier-Stokes equations governing the transient motion of a viscous incompressible fluid, i.e., hydrodynamics. Dependent variable transformation renders the differential equation description uniformly elliptic. The finite element algorithm is established using the Galerkin criterion on a local basis within the Method of Weighted Residuals. It is unconstrained with respect to system linearity, computational mesh uniformity or solution domain closure regularity. The finite element matrices are established using a linear 'natural coordinate function' description. Computational solutions using the COMOC computer program illustrate the various features of the algorithm including recirculating flows.

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

    Science.gov (United States)

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

    2017-09-08

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

  1. Inversion for Refractivity Parameters Using a Dynamic Adaptive Cuckoo Search with Crossover Operator Algorithm

    Directory of Open Access Journals (Sweden)

    Zhihua Zhang

    2016-01-01

    Full Text Available Using the RFC technique to estimate refractivity parameters is a complex nonlinear optimization problem. In this paper, an improved cuckoo search (CS algorithm is proposed to deal with this problem. To enhance the performance of the CS algorithm, a parameter dynamic adaptive operation and crossover operation were integrated into the standard CS (DACS-CO. Rechenberg’s 1/5 criteria combined with learning factor were used to control the parameter dynamic adaptive adjusting process. The crossover operation of genetic algorithm was utilized to guarantee the population diversity. The new hybrid algorithm has better local search ability and contributes to superior performance. To verify the ability of the DACS-CO algorithm to estimate atmospheric refractivity parameters, the simulation data and real radar clutter data are both implemented. The numerical experiments demonstrate that the DACS-CO algorithm can provide an effective method for near-real-time estimation of the atmospheric refractivity profile from radar clutter.

  2. Molecular dynamics algorithms for quantum Monte Carlo methods

    Science.gov (United States)

    Miura, Shinichi

    2009-11-01

    In the present Letter, novel molecular dynamics methods compatible with corresponding quantum Monte Carlo methods are developed. One is a variational molecular dynamics method that is a molecular dynamics analog of quantum variational Monte Carlo method. The other is a variational path integral molecular dynamics method, which is based on the path integral molecular dynamics method for finite temperature systems by Tuckerman et al. [M. Tuckerman, B.J. Berne, G.J. Martyna, M.L. Klein, J. Chem. Phys. 99 (1993) 2796]. These methods are applied to model systems including the liquid helium-4, demonstrated to work satisfactorily for the tested ground state calculations.

  3. Robot path planning algorithm based on symbolic tags in dynamic environment

    Science.gov (United States)

    Vokhmintsev, A.; Timchenko, M.; Melnikov, A.; Kozko, A.; Makovetskii, A.

    2017-09-01

    The present work will propose a new heuristic algorithms for path planning of a mobile robot in an unknown dynamic space that have theoretically approved estimates of computational complexity and are approbated for solving specific applied problems.

  4. Algorithms

    Indian Academy of Sciences (India)

    have been found in Vedic Mathematics which are dated much before Euclid's algorithm. A programming language Is used to describe an algorithm for execution on a computer. An algorithm expressed using a programming language Is called a program. From activities 1-3, we can observe that: • Each activity is a command.

  5. Offshore Wind Farm Cable Connection Configuration Optimization using Dynamic Minimum Spanning Tree Algorithm

    DEFF Research Database (Denmark)

    Hou, Peng; Hu, Weihao; Chen, Zhe

    2015-01-01

    Anew approach, Dynamic Minimal Spanning Tree (DMST) algorithm, whichisbased on the MST algorithm isproposed in this paper to optimizethe cable connectionlayout for large scale offshore wind farm collection system. The current carrying capacity of the cable is considered as the main constraint. Th...

  6. Optimal Positioning of Emergency Preparedness Assets based on Dynamic Traffic Situation

    OpenAIRE

    Støwer, Knut Skaseth

    2015-01-01

    The objective of this thesis is to create a method that utilizes mathematical models and tools to measure the threat posed to the environment by the merchant traffic along the Norwegian coast. This is done so that operators at Vessel Traffic Service(VTS) centers in Norway can assess dangers and allocate emergency assets to the correct areas so that the existing assets are utilized to their potential. If the existing emergency assets are utilized fully, the risk of catastroph...

  7. The Patch-Levy-Based Bees Algorithm Applied to Dynamic Optimization Problems

    Directory of Open Access Journals (Sweden)

    Wasim A. Hussein

    2017-01-01

    Full Text Available Many real-world optimization problems are actually of dynamic nature. These problems change over time in terms of the objective function, decision variables, constraints, and so forth. Therefore, it is very important to study the performance of a metaheuristic algorithm in dynamic environments to assess the robustness of the algorithm to deal with real-word problems. In addition, it is important to adapt the existing metaheuristic algorithms to perform well in dynamic environments. This paper investigates a recently proposed version of Bees Algorithm, which is called Patch-Levy-based Bees Algorithm (PLBA, on solving dynamic problems, and adapts it to deal with such problems. The performance of the PLBA is compared with other BA versions and other state-of-the-art algorithms on a set of dynamic multimodal benchmark problems of different degrees of difficulties. The results of the experiments show that PLBA achieves better results than the other BA variants. The obtained results also indicate that PLBA significantly outperforms some of the other state-of-the-art algorithms and is competitive with others.

  8. Energy Efficient Routing Algorithms in Dynamic Optical Core Networks with Dual Energy Sources

    DEFF Research Database (Denmark)

    Wang, Jiayuan; Fagertun, Anna Manolova; Ruepp, Sarah Renée

    2013-01-01

    This paper proposes new energy efficient routing algorithms in optical core networks, with the application of solar energy sources and bundled links. A comprehensive solar energy model is described in the proposed network scenarios. Network performance in energy savings, connection blocking...... probability, resource utilization and bundled link usage are evaluated with dynamic network simulations. Results show that algorithms proposed aiming for reducing the dynamic part of the energy consumption of the network may raise the fixed part of the energy consumption meanwhile....

  9. A computational fluid dynamics algorithm on a massively parallel computer

    International Nuclear Information System (INIS)

    Jespersen, D.C.; Levit, C.

    1989-01-01

    The implementation and performance of a finite-difference algorithm for the compressible Navier-Stokes equations in two or three dimensions on the Connection Machine are described. This machine is a single-instruction multiple-data machine with up to 65536 physical processors. The implicit portion of the algorithm is of particular interest. Running times and megadrop rates are given for two- and three-dimensional problems. Included are comparisons with the standard codes on a Cray X-MP/48. 15 refs

  10. A Formal Verification Model for Performance Analysis of Reinforcement Learning Algorithms Applied t o Dynamic Networks

    Directory of Open Access Journals (Sweden)

    Shrirang Ambaji KULKARNI

    2017-04-01

    Full Text Available Routing data packets in a dynamic network is a difficult and important problem in computer networks. As the network is dynamic, it is subject to frequent topology changes and is subject to variable link costs due to congestion and bandwidth. Existing shortest path algorithms fail to converge to better solutions under dynamic network conditions. Reinforcement learning algorithms posses better adaptation techniques in dynamic environments. In this paper we apply model based Q-Routing technique for routing in dynamic network. To analyze the correctness of Q-Routing algorithms mathematically, we provide a proof and also implement a SPIN based verification model. We also perform simulation based analysis of Q-Routing for given metrics.

  11. Comparison of Controller and Flight Deck Algorithm Performance During Interval Management with Dynamic Arrival Trees (STARS)

    Science.gov (United States)

    Battiste, Vernol; Lawton, George; Lachter, Joel; Brandt, Summer; Koteskey, Robert; Dao, Arik-Quang; Kraut, Josh; Ligda, Sarah; Johnson, Walter W.

    2012-01-01

    Managing the interval between arrival aircraft is a major part of the en route and TRACON controller s job. In an effort to reduce controller workload and low altitude vectoring, algorithms have been developed to allow pilots to take responsibility for, achieve and maintain proper spacing. Additionally, algorithms have been developed to create dynamic weather-free arrival routes in the presence of convective weather. In a recent study we examined an algorithm to handle dynamic re-routing in the presence of convective weather and two distinct spacing algorithms. The spacing algorithms originated from different core algorithms; both were enhanced with trajectory intent data for the study. These two algorithms were used simultaneously in a human-in-the-loop (HITL) simulation where pilots performed weather-impacted arrival operations into Louisville International Airport while also performing interval management (IM) on some trials. The controllers retained responsibility for separation and for managing the en route airspace and some trials managing IM. The goal was a stress test of dynamic arrival algorithms with ground and airborne spacing concepts. The flight deck spacing algorithms or controller managed spacing not only had to be robust to the dynamic nature of aircraft re-routing around weather but also had to be compatible with two alternative algorithms for achieving the spacing goal. Flight deck interval management spacing in this simulation provided a clear reduction in controller workload relative to when controllers were responsible for spacing the aircraft. At the same time, spacing was much less variable with the flight deck automated spacing. Even though the approaches taken by the two spacing algorithms to achieve the interval management goals were slightly different they seem to be simpatico in achieving the interval management goal of 130 sec by the TRACON boundary.

  12. An Iterative Algorithm to Determine the Dynamic User Equilibrium in a Traffic Simulation Model

    Science.gov (United States)

    Gawron, C.

    An iterative algorithm to determine the dynamic user equilibrium with respect to link costs defined by a traffic simulation model is presented. Each driver's route choice is modeled by a discrete probability distribution which is used to select a route in the simulation. After each simulation run, the probability distribution is adapted to minimize the travel costs. Although the algorithm does not depend on the simulation model, a queuing model is used for performance reasons. The stability of the algorithm is analyzed for a simple example network. As an application example, a dynamic version of Braess's paradox is studied.

  13. Algorithmic Information Dynamics of Persistent Patterns and Colliding Particles in the Game of Life

    KAUST Repository

    Zenil, Hector

    2018-02-18

    We demonstrate the way to apply and exploit the concept of \\\\textit{algorithmic information dynamics} in the characterization and classification of dynamic and persistent patterns, motifs and colliding particles in, without loss of generalization, Conway\\'s Game of Life (GoL) cellular automaton as a case study. We analyze the distribution of prevailing motifs that occur in GoL from the perspective of algorithmic probability. We demonstrate how the tools introduced are an alternative to computable measures such as entropy and compression algorithms which are often nonsensitive to small changes and features of non-statistical nature in the study of evolving complex systems and their emergent structures.

  14. Advanced Dynamically Adaptive Algorithms for Stochastic Simulations on Extreme Scales

    Energy Technology Data Exchange (ETDEWEB)

    Xiu, Dongbin [Univ. of Utah, Salt Lake City, UT (United States)

    2017-03-03

    The focus of the project is the development of mathematical methods and high-performance computational tools for stochastic simulations, with a particular emphasis on computations on extreme scales. The core of the project revolves around the design of highly efficient and scalable numerical algorithms that can adaptively and accurately, in high dimensional spaces, resolve stochastic problems with limited smoothness, even containing discontinuities.

  15. Optimization in Quaternion Dynamic Systems: Gradient, Hessian, and Learning Algorithms.

    Science.gov (United States)

    Xu, Dongpo; Xia, Yili; Mandic, Danilo P

    2016-02-01

    The optimization of real scalar functions of quaternion variables, such as the mean square error or array output power, underpins many practical applications. Solutions typically require the calculation of the gradient and Hessian. However, real functions of quaternion variables are essentially nonanalytic, which are prohibitive to the development of quaternion-valued learning systems. To address this issue, we propose new definitions of quaternion gradient and Hessian, based on the novel generalized Hamilton-real (GHR) calculus, thus making a possible efficient derivation of general optimization algorithms directly in the quaternion field, rather than using the isomorphism with the real domain, as is current practice. In addition, unlike the existing quaternion gradients, the GHR calculus allows for the product and chain rule, and for a one-to-one correspondence of the novel quaternion gradient and Hessian with their real counterparts. Properties of the quaternion gradient and Hessian relevant to numerical applications are also introduced, opening a new avenue of research in quaternion optimization and greatly simplified the derivations of learning algorithms. The proposed GHR calculus is shown to yield the same generic algorithm forms as the corresponding real- and complex-valued algorithms. Advantages of the proposed framework are illuminated over illustrative simulations in quaternion signal processing and neural networks.

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

    DEFF Research Database (Denmark)

    Knudsen, Peter Voigt; Madsen, Jan

    1996-01-01

    with a hardware area constraint and the problem of minimizing hardware area with a system execution time constraint. The target architecture consists of a single microprocessor and a single hardware chip (ASIC, FPGA, etc.) which are connected by a communication channel. The algorithm incorporates a realistic...

  17. A Runtime Analysis of Parallel Evolutionary Algorithms in Dynamic Optimization

    DEFF Research Database (Denmark)

    Lissovoi, Andrei; Witt, Carsten

    2017-01-01

    . It is proved that even for an increased offspring population size up to (Formula presented.), the (Formula presented.) EA is still not able to track the optimum of Maze. If the migration interval is chosen carefully, the algorithm is able to track the optimum even for logarithmic (Formula presented...

  18. Dynamic contrast-enhanced MRI of the prostate. Comparison of two different post-processing algorithms

    International Nuclear Information System (INIS)

    Beyersdorff, Dirk; Franiel, T.; Luedemann, L.; Dietz, E.; Galler, D.; Marchot, P.

    2011-01-01

    Purpose: To evaluate the usefulness of a commercially available post-processing software tool for detecting prostate cancer on dynamic contrast-enhanced magnetic resonance imaging (MRI) and to compare the results to those obtained with a custom-made post-processing algorithm already tested under clinical conditions. Materials and Methods: Forty-eight patients with proven prostate cancer were examined by standard MRI supplemented by dynamic contrast-enhanced dual susceptibility contrast (DCE-DSC) MRI prior to prostatectomy. A custom-made post-processing algorithm was used to analyze the MRI data sets and the results were compared to those obtained using a post-processing algorithm from Invivo Corporation (Dyna CAD for Prostate) applied to dynamic T 1-weighted images. Histology was used as the gold standard. Results: The sensitivity for prostate cancer detection was 78 % for the custom-made algorithm and 60 % for the commercial algorithm and the specificity was 79 % and 82 %, respectively. The accuracy was 79 % for our algorithm and 77.5 % for the commercial software tool. The chi-square test (McNemar-Bowker test) yielded no significant differences between the two tools (p = 0.06). Conclusion: The two investigated post-processing algorithms did not differ in terms of prostate cancer detection. The commercially available software tool allows reliable and fast analysis of dynamic contrast-enhanced MRI for the detection of prostate cancer. (orig.)

  19. DARAL: A Dynamic and Adaptive Routing Algorithm for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Francisco José Estévez

    2016-06-01

    Full Text Available The evolution of Smart City projects is pushing researchers and companies to develop more efficient embedded hardware and also more efficient communication technologies. These communication technologies are the focus of this work, presenting a new routing algorithm based on dynamically-allocated sub-networks and node roles. Among these features, our algorithm presents a fast set-up time, a reduced overhead and a hierarchical organization, which allows for the application of complex management techniques. This work presents a routing algorithm based on a dynamically-allocated hierarchical clustering, which uses the link quality indicator as a reference parameter, maximizing the network coverage and minimizing the control message overhead and the convergence time. The present work based its test scenario and analysis in the density measure, considered as a node degree. The routing algorithm is compared with some of the most well known routing algorithms for different scenario densities.

  20. On a high-dimensional objective genetic algorithm and its nonlinear dynamic properties

    Science.gov (United States)

    Huang, Jun; Huang, Xiaohong; Ma, Yan; Liu, Yanbing

    2011-09-01

    The revival of multi-objective optimization is mainly resulted from the recent development of multi-objective evolutionary optimization that allows the generation of the overall Pareto front. This paper presents an algorithm called HOGA (High-dimensional Objective Genetic Algorithm) for high-dimensional objective optimization on the basis of evolutionary computing. It adopts the principle of Shannon entropy to calculate the weight for each object since the well-known multi-objective evolutionary algorithms work poorly on the high-dimensional optimization problem. To further discuss the nonlinear dynamic property of HOGA, a martingale analysis approach is then employed; some mathematical derivations of the convergent theorems are obtained. The obtained results indicate that this new algorithm is indeed capable of achieving convergence and the suggested martingale analysis approach provides a new methodology for nonlinear dynamic analysis of evolutionary algorithms.

  1. An exact Polynomial Hybrid Monte Carlo algorithm for dynamical Kogut-Susskind fermions

    International Nuclear Information System (INIS)

    Ishikawa, K.-I.; Fukugita, M.; Hashimoto, S.; Ishizuka, N.; Iwasaki, Y.; Kanaya, K.; Kuramashi, Y.; Okawa, M.; Tsutsui, N.; Ukawa, A.; Yamada, N.; Yoshie, T.

    2003-01-01

    We present a polynomial Hybrid Monte Carlo (PHMC) algorithm as an exact simulation algorithm with dynamical Kogut-Susskind fermions. The algorithm uses a Hermitian polynomial approximation for the fractional power of the KS fermion matrix. The systematic error from the polynomial approximation is removed by the Kennedy-Kuti noisy Metropolis test so that the algorithm becomes exact at a finite molecular dynamics step size. We performed numerical tests with N f =2 case on several lattice sizes. We found that the PHMC algorithm works on a moderately large lattice of 16 4 at β=5.7, m=0.02 (m ps /m v ∼0.69) with a reasonable computational time

  2. Matrix product algorithm for stochastic dynamics on networks applied to nonequilibrium Glauber dynamics

    Science.gov (United States)

    Barthel, Thomas; De Bacco, Caterina; Franz, Silvio

    2018-01-01

    We introduce and apply an efficient method for the precise simulation of stochastic dynamical processes on locally treelike graphs. Networks with cycles are treated in the framework of the cavity method. Such models correspond, for example, to spin-glass systems, Boolean networks, neural networks, or other technological, biological, and social networks. Building upon ideas from quantum many-body theory, our approach is based on a matrix product approximation of the so-called edge messages—conditional probabilities of vertex variable trajectories. Computation costs and accuracy can be tuned by controlling the matrix dimensions of the matrix product edge messages (MPEM) in truncations. In contrast to Monte Carlo simulations, the algorithm has a better error scaling and works for both single instances as well as the thermodynamic limit. We employ it to examine prototypical nonequilibrium Glauber dynamics in the kinetic Ising model. Because of the absence of cancellation effects, observables with small expectation values can be evaluated accurately, allowing for the study of decay processes and temporal correlations.

  3. Signal Processing Algorithm for Controlling Dynamic Bandwidth of Fiber Optic Accelerometer

    International Nuclear Information System (INIS)

    Kim, Dae Hyun

    2007-01-01

    This paper presents a signal processing algorithm to control the dynamic bandwidth of a single-degree-of-freedom (SDF) dynamic sensor system. An accelerometer is a representative SDF sensor system. In this paper, a moire-fringe-based fiber optic accelerometer is newly used for the test of the algorithm. The accelerometer is composed of one mass, one damper and one spring as a SDF dynamic system. In order to increase the dynamic bandwidth of the accelerometer, it is needed to increase the spring constant or decrease the mass. However, there are mechanical difficulties of this adjustment. Therefore, the presented signal processing algorithm is very effective to overcome the difficulties because it is just adjustment in the signal processing software. In this paper, the novel fiber optic accelerometer is introduced shortly, and the algorithm is applied to the fiber optic accelerometer to control its natural frequency and damping ratio. Several simulations and experiments are carried out to prove the performance of the algorithm. As a result, it is shown that the presented signal processing algorithm is a good way to broaden the dynamic bandwidth of the fiber optic accelerometer

  4. A new algorithm for extended nonequilibrium molecular dynamics simulations of mixed flow

    NARCIS (Netherlands)

    Hunt, T.A.; Hunt, Thomas A.; Bernardi, Stefano; Todd, B.D.

    2010-01-01

    In this work, we develop a new algorithm for nonequilibrium molecular dynamics of fluids under planar mixed flow, a linear combination of planar elongational flow and planar Couette flow. To date, the only way of simulating mixed flow using nonequilibrium molecular dynamics techniques was to impose

  5. ALGORITHM FOR DYNAMIC SCALING RELATIONAL DATABASE IN CLOUDS

    Directory of Open Access Journals (Sweden)

    Alexander V. Boichenko

    2014-01-01

    Full Text Available This article analyzes the main methods of scalingdatabases (replication, sharding and their supportat the popular relational databases and NoSQLsolutions with different data models: document-oriented, key-value, column-oriented and graph.The article presents an algorithm for the dynamicscaling of a relational database (DB, that takesinto account the specifics of the different types of logic database model. This article was prepared with the support of RFBR (grant № 13-07-00749.

  6. Dynamic greedy algorithms for the Edwards-Anderson model

    Science.gov (United States)

    Schnabel, Stefan; Janke, Wolfhard

    2017-11-01

    To provide a novel tool for the investigation of the energy landscape of the Edwards-Anderson spin-glass model we introduce an algorithm that allows an efficient execution of a greedy optimization based on data from a previously performed optimization for a similar configuration. As an application we show how the technique can be used to perform higher-order greedy optimizations and simulated annealing searches with improved performance.

  7. Optimization Algorithms and Equilibrium Analysis for Dynamic Resource Allocation

    Science.gov (United States)

    2011-11-30

    throughput by choosing jointly the sensing duration, the detection thresholds, and the vector power allocation over a multichannel link. The formulation...user (player) aims to maximize his own opportunistic throughput by choosing jointly the sensing duration, the detection thresholds, and the vector power...problems. Award: EURASIP 2011 Best Paper Award for the joint paper with Zhi-Quan Luo: Analysis of iterative waterfilling algorithm for multiuser power

  8. Information dynamics algorithm for detecting communities in networks

    Science.gov (United States)

    Massaro, Emanuele; Bagnoli, Franco; Guazzini, Andrea; Lió, Pietro

    2012-11-01

    The problem of community detection is relevant in many scientific disciplines, from social science to statistical physics. Given the impact of community detection in many areas, such as psychology and social sciences, we have addressed the issue of modifying existing well performing algorithms by incorporating elements of the domain application fields, i.e. domain-inspired. We have focused on a psychology and social network-inspired approach which may be useful for further strengthening the link between social network studies and mathematics of community detection. Here we introduce a community-detection algorithm derived from the van Dongen's Markov Cluster algorithm (MCL) method [4] by considering networks' nodes as agents capable to take decisions. In this framework we have introduced a memory factor to mimic a typical human behavior such as the oblivion effect. The method is based on information diffusion and it includes a non-linear processing phase. We test our method on two classical community benchmark and on computer generated networks with known community structure. Our approach has three important features: the capacity of detecting overlapping communities, the capability of identifying communities from an individual point of view and the fine tuning the community detectability with respect to prior knowledge of the data. Finally we discuss how to use a Shannon entropy measure for parameter estimation in complex networks.

  9. A local flocking algorithm of multi-agent dynamic systems

    Science.gov (United States)

    Pei, Huiqin; Chen, Shiming; Lai, Qiang

    2015-11-01

    In this paper, the local flocking of multi-agent systems is investigated, which means all agents form some groups of surrounding multiple targets with the partial information exchange. For the purpose of realising local multi-flocking, a control algorithm of local flocking is proposed, which is a biologically inspired approach that assimilates key characteristics of flocking and anti-flocking. In the process of surrounding mobile targets through the control algorithm, all agents can adaptively choose between two work modes to depend on the variation of visual field and the number of pursuing agents with the mobile target. One is a flocking pursuing mode which is that some agents pursue each mobile target, the other is an anti-flocking searching mode that means with the exception of the pursing agents of mobile targets, other agents respectively hunt for optimal the mobile target with a closest principle between the agent and the target. In two work modes, the agents are controlled severally via the different control protocol. By the Lyapunov theorem, the stability of the second-order multi-agent system is proven in detail. Finally, simulation results verify the effectiveness of the proposed algorithm.

  10. Algorithms

    Indian Academy of Sciences (India)

    algorithms such as synthetic (polynomial) division have been found in Vedic Mathematics which are dated much before Euclid's algorithm. A programming language ... ·1 x:=sln(theta) x : = sm(theta) 1. ~. Idl d.t Read A.B,C. ~ lei ~ Print x.y.z. L;;;J. Figure 2 Symbols used In flowchart language to rep- resent Assignment, Read.

  11. Algorithms

    Indian Academy of Sciences (India)

    In the previous articles, we have discussed various common data-structures such as arrays, lists, queues and trees and illustrated the widely used algorithm design paradigm referred to as 'divide-and-conquer'. Although there has been a large effort in realizing efficient algorithms, there are not many universally accepted ...

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

    International Nuclear Information System (INIS)

    Rong, Aiying; Hakonen, Henri; Lahdelma, Risto

    2009-01-01

    This paper addresses the unit commitment (UC) in multi-period combined heat and power (CHP) production planning under the deregulated power market. In CHP plants (units), generation of heat and power follows joint characteristics, which implies that it is difficult to determine the relative cost efficiency of the plants. We introduce in this paper the DRDP-RSC algorithm, which is a dynamic regrouping based dynamic programming (DP) algorithm based on linear relaxation of the ON/OFF states of the units, sequential commitment of units in small groups. Relaxed states of the plants are used to reduce the dimension of the UC problem and dynamic regrouping is used to improve the solution quality. Numerical results based on real-life data sets show that this algorithm is efficient and optimal or near-optimal solutions with very small optimality gap are obtained

  13. A Multiagent Dynamic Assessment Approach for Water Quality Based on Improved Q-Learning Algorithm

    Directory of Open Access Journals (Sweden)

    Jianjun Ni

    2013-01-01

    Full Text Available The dynamic water quality assessment is a challenging and critical issue in water resource management systems. To deal with this complex problem, a dynamic water assessment model based on multiagent technology is proposed, and an improved Q-learning algorithm is used in this paper. In the proposed Q-learning algorithm, a fuzzy membership function and a punishment mechanism are introduced to improve the learning speed of Q-learning algorithm. The dynamic water quality assessment for different regions and the prewarning of water pollution are achieved by using an interaction factor in the proposed approach. The proposed approach can deal with various situations, such as static and dynamic water quality assessment. The experimental results show that the water quality assessment based on the proposed approach is more accurate and efficient than the general methods.

  14. Performance analysis of dynamic load balancing algorithm for multiprocessor interconnection network

    Directory of Open Access Journals (Sweden)

    M.U. Bokhari

    2016-09-01

    Full Text Available Multiprocessor interconnection network have become powerful parallel computing system for real-time applications. Nowadays the many researchers posses studies on the dynamic load balancing in multiprocessor system. Load balancing is the method of dividing the total load among the processors of the distributed system to progress task's response time as well as resource utilization whereas ignoring a condition where few processors are overloaded or underloaded or moderately loaded. However, in dynamic load balancing algorithm presumes no priori information about behaviour of tasks or the global state of the system. There are numerous issues while designing an efficient dynamic load balancing algorithm that involves utilization of system, amount of information transferred among processors, selection of tasks for migration, load evaluation, comparison of load levels and many more. This paper enlightens the performance analysis on dynamic load balancing strategy (DLBS algorithm, used for hypercube network in multiprocessor system.

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

    DEFF Research Database (Denmark)

    Rong, Aiying; Hakonen, Henri; Lahdelma, Risto

    2009-01-01

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

  16. Optimization of segment weight using simulated dynamics algorithm for beamlet-based IMRT

    International Nuclear Information System (INIS)

    Chen Bingzhou; Hou Qing

    2007-01-01

    With accurate calculation algorithms in inverse planning for beamlet-based intensity modulated radiotherapy (IMRT), it takes time to calculate the dose matrix, which represents the dose distribution of each beamlet element to each voxel for unit fluence. To reduce the calculation time, coarse or approximate algorithms are often a choice, but this results in a final dose distribution that cannot reflect the real value. In addition, it is necessary to test if a coarse algorithm is capable of calculating the dose matrix of beamlets. In this work, simulated dynamics optimization algorithm was applied to optimize the segment weight to minish the dose error from the dose matrix calculation. After calculating the dose matrix by ray-tracing algorithm which takes into account just the primary component of absorbed dose, the original beam profile intensity distribution was optimized by using the simulated dynamics algorithm. Before segmentation, the even-spaced algorithm and genetic algorithm were applied in clustering. The dose distribution of every segment was calculated accurately by using convolution-superposition algorithm, and the weight of any voxel was in inverse proportion to the voxel number of the PTV or OAR it belonged. The segment weight was optimized by using the simulated dynamics algorithm. By comparing the dose distributions before and after optimization of segment weight, one finds that the dose distribution is improved obviously., It was also found that some segments which contained fewer beamlets or lower weight value could be omitted because the decay of dose distribution could be improved by re-optimizing the segment weight, and that some segments could be omitted by re-optimizing the segment weight during the process of beamlet-based IMRT. (authors)

  17. PM Synchronous Motor Dynamic Modeling with Genetic Algorithm ...

    African Journals Online (AJOL)

    Adel

    This paper proposes dynamic modeling simulation for ac Surface Permanent Magnet Synchronous Motor (SPMSM) with the aid of MATLAB – Simulink environment. The proposed model would be used in many applications such as automotive, mechatronics, green energy applications, and machine drives. The modeling ...

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

    CERN Document Server

    Nagy, Ivan

    2017-01-01

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

  19. Dynamic population artificial bee colony algorithm for multi-objective optimal power flow

    Directory of Open Access Journals (Sweden)

    Man Ding

    2017-03-01

    Full Text Available This paper proposes a novel artificial bee colony algorithm with dynamic population (ABC-DP, which synergizes the idea of extended life-cycle evolving model to balance the exploration and exploitation tradeoff. The proposed ABC-DP 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. ABC-DP is then used for solving the optimal power flow (OPF problem in power systems that considers the cost, loss, and emission impacts as the objective functions. The 30-bus IEEE test system is presented to illustrate the application of the proposed algorithm. The simulation results, which are also compared to nondominated sorting genetic algorithm II (NSGAII and multi-objective ABC (MOABC, are presented to illustrate the effectiveness and robustness of the proposed method.

  20. A New Multiobjective Evolutionary Algorithm for Community Detection in Dynamic Complex Networks

    Directory of Open Access Journals (Sweden)

    Guoqiang Chen

    2013-01-01

    Full Text Available Community detection in dynamic networks is an important research topic and has received an enormous amount of attention in recent years. Modularity is selected as a measure to quantify the quality of the community partition in previous detection methods. But, the modularity has been exposed to resolution limits. In this paper, we propose a novel multiobjective evolutionary algorithm for dynamic networks community detection based on the framework of nondominated sorting genetic algorithm. Modularity density which can address the limitations of modularity function is adopted to measure the snapshot cost, and normalized mutual information is selected to measure temporal cost, respectively. The characteristics knowledge of the problem is used in designing the genetic operators. Furthermore, a local search operator was designed, which can improve the effectiveness and efficiency of community detection. Experimental studies based on synthetic datasets show that the proposed algorithm can obtain better performance than the compared algorithms.

  1. An FDTD algorithm for simulating light propagation in anisotropic dynamic gain media

    KAUST Repository

    Al-Jabr, A. A.

    2014-05-02

    Simulating light propagation in anisotropic dynamic gain media such as semiconductors and solid-state lasers using the finite difference time-domain FDTD technique is a tedious process, as many variables need to be evaluated in the same instant of time. The algorithm has to take care of the laser dynamic gain, rate equations, anisotropy and dispersion. In this paper, to the best of our knowledge, we present the first algorithm that solves this problem. The algorithm is based on separating calculations into independent layers and hence solving each problem in a layer of calculations. The anisotropic gain medium is presented and tested using a one-dimensional set-up. The algorithm is then used for the analysis of a two-dimensional problem.

  2. Development of GPS Receiver Kalman Filter Algorithms for Stationary, Low-Dynamics, and High-Dynamics Applications

    Science.gov (United States)

    2016-06-01

    UNCLASSIFIED Development of GPS Receiver Kalman Filter Algorithms for Stationary, Low-Dynamics, and High-Dynamics Applications Peter W. Sarunic 1 1...determine instantaneous estimates of receiver position and then goes on to develop three Kalman filter based estimators, which use stationary receiver...used in actual GPS receivers, and cover a wide range of applications. While the standard form of the Kalman filter , of which the three filters just

  3. Adaptive Dynamic Programming for Control Algorithms and Stability

    CERN Document Server

    Zhang, Huaguang; Luo, Yanhong; Wang, Ding

    2013-01-01

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

  4. Parallel Multiscale Algorithms for Astrophysical Fluid Dynamics Simulations

    Science.gov (United States)

    Norman, Michael L.

    1997-01-01

    Our goal is to develop software libraries and applications for astrophysical fluid dynamics simulations in multidimensions that will enable us to resolve the large spatial and temporal variations that inevitably arise due to gravity, fronts and microphysical phenomena. The software must run efficiently on parallel computers and be general enough to allow the incorporation of a wide variety of physics. Cosmological structure formation with realistic gas physics is the primary application driver in this work. Accurate simulations of e.g. galaxy formation require a spatial dynamic range (i.e., ratio of system scale to smallest resolved feature) of 104 or more in three dimensions in arbitrary topologies. We take this as our technical requirement. We have achieved, and in fact, surpassed these goals.

  5. Fuzzy Dynamic Discrimination Algorithms for Distributed Knowledge Management Systems

    Directory of Open Access Journals (Sweden)

    Vasile MAZILESCU

    2010-12-01

    Full Text Available A reduction of the algorithmic complexity of the fuzzy inference engine has the following property: the inputs (the fuzzy rules and the fuzzy facts can be divided in two parts, one being relatively constant for a long a time (the fuzzy rule or the knowledge model when it is compared to the second part (the fuzzy facts for every inference cycle. The occurrence of certain transformations over the constant part makes sense, in order to decrease the solution procurement time, in the case that the second part varies, but it is known at certain moments in time. The transformations attained in advance are called pre-processing or knowledge compilation. The use of variables in a Business Rule Management System knowledge representation allows factorising knowledge, like in classical knowledge based systems. The language of the first-degree predicates facilitates the formulation of complex knowledge in a rigorous way, imposing appropriate reasoning techniques. It is, thus, necessary to define the description method of fuzzy knowledge, to justify the knowledge exploiting efficiency when the compiling technique is used, to present the inference engine and highlight the functional features of the pattern matching and the state space processes. This paper presents the main results of our project PR356 for designing a compiler for fuzzy knowledge, like Rete compiler, that comprises two main components: a static fuzzy discrimination structure (Fuzzy Unification Tree and the Fuzzy Variables Linking Network. There are also presented the features of the elementary pattern matching process that is based on the compiled structure of fuzzy knowledge. We developed fuzzy discrimination algorithms for Distributed Knowledge Management Systems (DKMSs. The implementations have been elaborated in a prototype system FRCOM (Fuzzy Rule COMpiler.

  6. Performance Evaluation of using a Dynamic Shortest Path Algorithm in OLSRv2

    OpenAIRE

    Herberg, Ulrich

    2010-01-01

    MANET routing protocols are designed to scale up to thousands of routers with frequent changes of the topology. In preference, MANET routing protocols should also support constrained low-power devices. One of the bottlenecks of scalability in link-state routing protocols is the performance of the shortest path algorithm (e.g. Dijkstra). In this document, we investigate the in-node performance of OLSRv2 and, in particular, study the benefits of using a dynamic shortest path (DSP) algorithm for...

  7. Experimental validation of a distributed algorithm for dynamic spectrum access in local area networks

    DEFF Research Database (Denmark)

    Tonelli, Oscar; Berardinelli, Gilberto; Tavares, Fernando Menezes Leitão

    2013-01-01

    activities with the Autonomous Component Carrier Selection (ACCS) algorithm, a distributed solution for interference management among small neighboring cells. A preliminary evaluation of the algorithm performance is provided considering its live execution on a software defined radio network testbed....... The obtained experimental results confirm the performance trends obtained from prior simulation studies. The analysis in dynamic environment conditions also allowed identifying the utilization of static thresholds in the decision making process, as a critical aspect for the optimization of network capacity....

  8. An STDP training algorithm for a spiking neural network with dynamic threshold neurons.

    Science.gov (United States)

    Strain, T J; McDaid, L J; McGinnity, T M; Maguire, L P; Sayers, H M

    2010-12-01

    This paper proposes a supervised training algorithm for Spiking Neural Networks (SNNs) which modifies the Spike Timing Dependent Plasticity (STDP)learning rule to support both local and network level training with multiple synaptic connections and axonal delays. The training algorithm applies the rule to two and three layer SNNs, and is benchmarked using the Iris and Wisconsin Breast Cancer (WBC) data sets. The effectiveness of hidden layer dynamic threshold neurons is also investigated and results are presented.

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

  10. A dynamic programming algorithm for the space allocation and aisle positioning problem

    DEFF Research Database (Denmark)

    Bodnar, Peter; Lysgaard, Jens

    2014-01-01

    The space allocation and aisle positioning problem (SAAPP) in a material handling system with gravity flow racks is the problem of minimizing the total number of replenishments over a period subject to practical constraints related to the need for aisles granting safe and easy access to storage...... locations. In this paper, we develop an exact dynamic programming algorithm for the SAAPP. The computational study shows that our exact algorithm can be used to find optimal solutions for numerous SAAPP instances of moderate size....

  11. An algorithm for engineering regime shifts in one-dimensional dynamical systems

    Science.gov (United States)

    Tan, James P. L.

    2018-01-01

    Regime shifts are discontinuous transitions between stable attractors hosting a system. They can occur as a result of a loss of stability in an attractor as a bifurcation is approached. In this work, we consider one-dimensional dynamical systems where attractors are stable equilibrium points. Relying on critical slowing down signals related to the stability of an equilibrium point, we present an algorithm for engineering regime shifts such that a system may escape an undesirable attractor into a desirable one. We test the algorithm on synthetic data from a one-dimensional dynamical system with a multitude of stable equilibrium points and also on a model of the population dynamics of spruce budworms in a forest. The algorithm and other ideas discussed here contribute to an important part of the literature on exercising greater control over the sometimes unpredictable nature of nonlinear systems.

  12. Analysis of Population Diversity of Dynamic Probabilistic Particle Swarm Optimization Algorithms

    Directory of Open Access Journals (Sweden)

    Qingjian Ni

    2014-01-01

    Full Text Available In evolutionary algorithm, population diversity is an important factor for solving performance. In this paper, combined with some population diversity analysis methods in other evolutionary algorithms, three indicators are introduced to be measures of population diversity in PSO algorithms, which are standard deviation of population fitness values, population entropy, and Manhattan norm of standard deviation in population positions. The three measures are used to analyze the population diversity in a relatively new PSO variant—Dynamic Probabilistic Particle Swarm Optimization (DPPSO. The results show that the three measure methods can fully reflect the evolution of population diversity in DPPSO algorithms from different angles, and we also discuss the impact of population diversity on the DPPSO variants. The relevant conclusions of the population diversity on DPPSO can be used to analyze, design, and improve the DPPSO algorithms, thus improving optimization performance, which could also be beneficial to understand the working mechanism of DPPSO theoretically.

  13. Using an Improved Artificial Bee Colony Algorithm for Parameter Estimation of a Dynamic Grain Flow Model

    Directory of Open Access Journals (Sweden)

    He Wang

    2018-01-01

    Full Text Available An effective method is proposed to estimate the parameters of a dynamic grain flow model (DGFM. To this end, an improved artificial bee colony (IABC algorithm is used to estimate unknown parameters of DGFM with minimizing a given objective function. A comparative study of the performance of the IABC algorithm and the other ABC variants on several benchmark functions is carried out, and the results present a significant improvement in performance over the other ABC variants. The practical application performance of the IABC is compared to that of the nonlinear least squares (NLS, particle swarm optimization (PSO, and genetic algorithm (GA. The compared results demonstrate that IABC algorithm is more accurate and effective for the parameter estimation of DGFM than the other algorithms.

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

  15. Asset-Based Community Development as a Strategy for Developing Local Global Health Curricula.

    Science.gov (United States)

    Webber, Sarah; Butteris, Sabrina M; Houser, Laura; Coller, Karen; Coller, Ryan J

    2018-02-07

    A significant and growing proportion of US children have immigrant parents, an issue of increasing importance to pediatricians. Training globally minded pediatric residents to address health inequities related to globalization is an important reason to expand educational strategies around local global health (LGH). We developed a curriculum in the pediatric global health residency track at the University of Wisconsin in an effort to address gaps in LGH education and to increase resident knowledge about local health disparities for global community members. This curriculum was founded in asset-based community development (ABCD), a strategy used in advocacy training but not reported in global health education. The initial curriculum outputs have provided the foundation for a longitudinal LGH curriculum and a community-academic partnership. Supported by a community partnership grant, this partnership is focused on establishing a community-based postpartum support group for local Latinos, with an emphasis on building capacity in the Latino community. Aspects of this curriculum can serve other programs looking to develop LGH curricula rooted in building local partnerships and capacity using an ABCD model. Copyright © 2018 Academic Pediatric Association. Published by Elsevier Inc. All rights reserved.

  16. Threshold based AntNet algorithm for dynamic traffic routing of road networks

    Directory of Open Access Journals (Sweden)

    Ayman M. Ghazy

    2012-07-01

    Full Text Available Dynamic routing algorithms play an important role in road traffic routing to avoid congestion and to direct vehicles to better routes. AntNet routing algorithms have been applied, extensively and successfully, in data communication network. However, its application for dynamic routing on road networks is still considerably limited. This paper presents a modified version of the AntNet routing algorithm, called “Threshold based AntNet”, that has the ability to efficiently utilize a priori information of dynamic traffic routing, especially, for road networks. The modification exploits the practical and pre-known information for most road traffic networks, namely, the good travel times between sources and destinations. The values of those good travel times are manipulated as threshold values. This approach has proven to conserve tracking of good routes. According to the dynamic nature of the problem, the presented approach guards the agility of rediscovering a good route. Attaining the thresholds (good reported travel times, of a given source to destination route, permits for a better utilization of the computational resources, that, leads to better accommodation for the network changes. The presented algorithm introduces a new type of ants called “check ants”. It assists in preserving good routes and, better yet, exposes and discards the degraded ones. The threshold AntNet algorithm presents a new strategy for updating the routing information, supported by the backward ants.

  17. Dynamic gradient descent learning algorithms for enhanced empirical modeling of power plants

    International Nuclear Information System (INIS)

    Parlos, A.G.; Atiya, Amir; Chong, K.T.

    1991-01-01

    A newly developed dynamic gradient descent-based learning algorithm is used to train a recurrent multilayer perceptron network for use in empirical modeling of power plants. The two main advantages of the proposed learning algorithm are its ability to consider past error gradient information for future use and the two forward passes associated with its implementation, instead of one forward and one backward pass of the backpropagation algorithm. The latter advantage results in computational time saving because both passes can be performed simultaneously. The dynamic learning algorithm is used to train a hybrid feedforward/feedback neural network, a recurrent multilayer perceptron, which was previously found to exhibit good interpolation and extrapolation capabilities in modeling nonlinear dynamic systems. One of the drawbacks, however, of the previously reported work has been the long training times associated with accurate empirical models. The enhanced learning capabilities provided by the dynamic gradient descent-based learning algorithm are demonstrated by a case study of a steam power plant. The number of iterations required for accurate empirical modeling has been reduced from tens of thousands to hundreds, thus significantly expediting the learning process

  18. A dynamic material discrimination algorithm for dual MV energy X-ray digital radiography

    International Nuclear Information System (INIS)

    Li, Liang; Li, Ruizhe; Zhang, Siyuan; Zhao, Tiao; Chen, Zhiqiang

    2016-01-01

    Dual-energy X-ray radiography has become a well-established technique in medical, industrial, and security applications, because of its material or tissue discrimination capability. The main difficulty of this technique is dealing with the materials overlapping problem. When there are two or more materials along the X-ray beam path, its material discrimination performance will be affected. In order to solve this problem, a new dynamic material discrimination algorithm is proposed for dual-energy X-ray digital radiography, which can also be extended to multi-energy X-ray situations. The algorithm has three steps: α-curve-based pre-classification, decomposition of overlapped materials, and the final material recognition. The key of the algorithm is to establish a dual-energy radiograph database of both pure basis materials and pair combinations of them. After the pre-classification results, original dual-energy projections of overlapped materials can be dynamically decomposed into two sets of dual-energy radiographs of each pure material by the algorithm. Thus, more accurate discrimination results can be provided even with the existence of the overlapping problem. Both numerical and experimental results that prove the validity and effectiveness of the algorithm are presented. - Highlights: • A material discrimination algorithm for dual MV energy X-ray digital radiography is proposed. • To solve the materials overlapping problem of the current dual energy algorithm. • The experimental results with the 4/7 MV container inspection system are shown.

  19. LUNA: An algorithm for generating dynamic planet-moon transits

    OpenAIRE

    Kipping, David M.

    2011-01-01

    It has been previously shown that moons of extrasolar planets may be detectable with the Kepler Mission, for moon masses above ~0.2 Earth masses Kipping et al. 2009c. Transit timing effects have been formerly identified as a potent tool to this end, exploiting the dynamics of the system. In this work, we explore the simulation of transit light curves of a planet plus a single moon including not only the transit timing effects but also the light curve signal of the moon itself. We introduce ou...

  20. Explicit K-symplectic algorithms for charged particle dynamics

    International Nuclear Information System (INIS)

    He, Yang; Zhou, Zhaoqi; Sun, Yajuan; Liu, Jian; Qin, Hong

    2017-01-01

    We study the Lorentz force equation of charged particle dynamics by considering its K-symplectic structure. As the Hamiltonian of the system can be decomposed as four parts, we are able to construct the numerical methods that preserve the K-symplectic structure based on Hamiltonian splitting technique. The newly derived numerical methods are explicit, and are shown in numerical experiments to be stable over long-term simulation. The error convergency as well as the long term energy conservation of the numerical solutions is also analyzed by means of the Darboux transformation.

  1. Dynamical Consensus Algorithm for Second-Order Multi-Agent Systems Subjected to Communication Delay

    International Nuclear Information System (INIS)

    Liu Chenglin; Liu Fei

    2013-01-01

    To solve the dynamical consensus problem of second-order multi-agent systems with communication delay, delay-dependent compensations are added into the normal asynchronously-coupled consensus algorithm so as to make the agents achieve a dynamical consensus. Based on frequency-domain analysis, sufficient conditions are gained for second-order multi-agent systems with communication delay under leaderless and leader-following consensus algorithms respectively. Simulation illustrates the correctness of the results. (interdisciplinary physics and related areas of science and technology)

  2. The generation algorithm of arbitrary polygon animation based on dynamic correction

    Directory of Open Access Journals (Sweden)

    Hou Ya Wei

    2016-01-01

    Full Text Available This paper, based on the key-frame polygon sequence, proposes a method that makes use of dynamic correction to develop continuous animation. Firstly we use quadratic Bezier curve to interpolate the corresponding sides vector of polygon sequence consecutive frame and realize the continuity of animation sequences. And then, according to Bezier curve characteristic, we conduct dynamic regulation to interpolation parameters and implement the changing smoothness. Meanwhile, we take use of Lagrange Multiplier Method to correct the polygon and close it. Finally, we provide the concrete algorithm flow and present numerical experiment results. The experiment results show that the algorithm acquires excellent effect.

  3. An elementary singularity-free Rotational Brownian Dynamics algorithm for anisotropic particles.

    Science.gov (United States)

    Ilie, Ioana M; Briels, Wim J; den Otter, Wouter K

    2015-03-21

    Brownian Dynamics is the designated technique to simulate the collective dynamics of colloidal particles suspended in a solution, e.g., the self-assembly of patchy particles. Simulating the rotational dynamics of anisotropic particles by a first-order Langevin equation, however, gives rise to a number of complications, ranging from singularities when using a set of three rotational coordinates to subtle metric and drift corrections. Here, we derive and numerically validate a quaternion-based Rotational Brownian Dynamics algorithm that handles these complications in a simple and elegant way. The extension to hydrodynamic interactions is also discussed.

  4. A Multifluid Numerical Algorithm for Interpenetrating Plasma Dynamics

    Science.gov (United States)

    Ghosh, Debojyoti; Kavouklis, Christos; Berger, Richard; Chapman, Thomas; Hittinger, Jeffrey

    2017-10-01

    Interpenetrating plasmas occur in situations including inertial confinement fusion experiments, where plasmas ablate off the hohlraum and capsule surfaces and interact with each other, and in high-energy density physics experiments that involve the collision of plasma streams ablating off discs irradiated by laser beams. Single-fluid, multi-species hydrodynamic models are not well-suited to study this interaction because they cannot support more than a single fluid velocity; this results in unphysical solutions. Though kinetic models yield accurate solutions for multi-fluid interactions, they are prohibitively expensive for at-scale three-dimensional (3D) simulations. In this study, we propose a multifluid approach where the compressible fluid equations are solved for each ion species and the electrons. Electrostatic forces and inter-species friction and thermal equilibration couple the species. A high-order finite-volume algorithm with explicit time integration is used to solve on a 3D Cartesian domain, and a high-order Poisson solver is used to compute the electrostatic potential. We present preliminary results for the interpenetration of two plasma streams in vacuum and in the presence of a gas fill. This work was performed under the auspices of the U.S. DOE by Lawrence Livermore National Laboratory under Contract No. DE-AC52- 07NA27344 and funded by the LDRD Program at LLNL under project tracking code 17-ERD-081.

  5. A Scheduling Algorithm for Cloud Computing System Based on the Driver of Dynamic Essential Path.

    Science.gov (United States)

    Xie, Zhiqiang; Shao, Xia; Xin, Yu

    2016-01-01

    To solve the problem of task scheduling in the cloud computing system, this paper proposes a scheduling algorithm for cloud computing based on the driver of dynamic essential path (DDEP). This algorithm applies a predecessor-task layer priority strategy to solve the problem of constraint relations among task nodes. The strategy assigns different priority values to every task node based on the scheduling order of task node as affected by the constraint relations among task nodes, and the task node list is generated by the different priority value. To address the scheduling order problem in which task nodes have the same priority value, the dynamic essential long path strategy is proposed. This strategy computes the dynamic essential path of the pre-scheduling task nodes based on the actual computation cost and communication cost of task node in the scheduling process. The task node that has the longest dynamic essential path is scheduled first as the completion time of task graph is indirectly influenced by the finishing time of task nodes in the longest dynamic essential path. Finally, we demonstrate the proposed algorithm via simulation experiments using Matlab tools. The experimental results indicate that the proposed algorithm can effectively reduce the task Makespan in most cases and meet a high quality performance objective.

  6. Parallel processors and nonlinear structural dynamics algorithms and software

    Science.gov (United States)

    Belytschko, Ted

    1989-01-01

    A nonlinear structural dynamics finite element program was developed to run on a shared memory multiprocessor with pipeline processors. The program, WHAMS, was used as a framework for this work. The program employs explicit time integration and has the capability to handle both the nonlinear material behavior and large displacement response of 3-D structures. The elasto-plastic material model uses an isotropic strain hardening law which is input as a piecewise linear function. Geometric nonlinearities are handled by a corotational formulation in which a coordinate system is embedded at the integration point of each element. Currently, the program has an element library consisting of a beam element based on Euler-Bernoulli theory and trianglar and quadrilateral plate element based on Mindlin theory.

  7. Dynamic game balancing implementation using adaptive algorithm in mobile-based Safari Indonesia game

    Science.gov (United States)

    Yuniarti, Anny; Nata Wardanie, Novita; Kuswardayan, Imam

    2018-03-01

    In developing a game there is one method that should be applied to maintain the interest of players, namely dynamic game balancing. Dynamic game balancing is a process to match a player’s playing style with the behaviour, attributes, and game environment. This study applies dynamic game balancing using adaptive algorithm in scrolling shooter game type called Safari Indonesia which developed using Unity. The game of this type is portrayed by a fighter aircraft character trying to defend itself from insistent enemy attacks. This classic game is chosen to implement adaptive algorithms because it has quite complex attributes to be developed using dynamic game balancing. Tests conducted by distributing questionnaires to a number of players indicate that this method managed to reduce frustration and increase the pleasure factor in playing.

  8. Dynamic load balance scheme for the DSMC algorithm

    International Nuclear Information System (INIS)

    Li, Jin; Geng, Xiangren; Jiang, Dingwu; Chen, Jianqiang

    2014-01-01

    The direct simulation Monte Carlo (DSMC) algorithm, devised by Bird, has been used over a wide range of various rarified flow problems in the past 40 years. While the DSMC is suitable for the parallel implementation on powerful multi-processor architecture, it also introduces a large load imbalance across the processor array, even for small examples. The load imposed on a processor by a DSMC calculation is determined to a large extent by the total of simulator particles upon it. Since most flows are impulsively started with initial distribution of particles which is surely quite different from the steady state, the total of simulator particles will change dramatically. The load balance based upon an initial distribution of particles will break down as the steady state of flow is reached. The load imbalance and huge computational cost of DSMC has limited its application to rarefied or simple transitional flows. In this paper, by taking advantage of METIS, a software for partitioning unstructured graphs, and taking the total of simulator particles in each cell as a weight information, the repartitioning based upon the principle that each processor handles approximately the equal total of simulator particles has been achieved. The computation must pause several times to renew the total of simulator particles in each processor and repartition the whole domain again. Thus the load balance across the processors array holds in the duration of computation. The parallel efficiency can be improved effectively. The benchmark solution of a cylinder submerged in hypersonic flow has been simulated numerically. Besides, hypersonic flow past around a complex wing-body configuration has also been simulated. The results have displayed that, for both of cases, the computational time can be reduced by about 50%

  9. Algorithm to illustrate context using dynamic lighting effects

    Science.gov (United States)

    John, Roshy M.; Balasubramanian, T.

    2007-09-01

    With the invention of Ultra-Bright LED, solid state lighting has come to something which is much more efficient and energy saving when compared to conventional incandescent or fluorescent lighting. With the use of proper driver electronics now a days it is possible to install solid state lighting systems with the cost same as that of any other lighting technology. This paper is a part of the research project we are doing in our lab, which deals with using ultra bright LEDs of different colors for lighting applications. The driver electronics are made in such a way that, the color and brightness of the lights will change according to context. For instance, if one of the users is reading a story or listening to music in a Personal Computer or in a hand held device such as a PDA, the lighting systems and the HVAC (Heating Ventilation Air-conditioning) systems will change dramatically according to the content of the story or the music. The vulnerability of solid-state lighting helps to accomplish such an effect. Such a type of system will help the reader to feel the story mentally and physically as well. We developed complete driver electronics for the system using multiple microcomputers and a full software suite which uses complex algorithms to decode the context from text or music and synchronize it to lighting and HVAC information. The paper also presents some case-study statistics which shows the advantage of using the system to teach kindergarten children, deaf and dumb children and for language learning classes.

  10. Algorithms

    Indian Academy of Sciences (India)

    In the program shown in Figure 1, we have repeated the algorithm. M times and we can make the following observations. Each block is essentially a different instance of "code"; that is, the objects differ by the value to which N is initialized before the execution of the. "code" block. Thus, we can now avoid the repetition of the ...

  11. Algorithms

    Indian Academy of Sciences (India)

    algorithms built into the computer corresponding to the logic- circuit rules that are used to .... For the purpose of carrying ou t ari thmetic or logical operations the memory is organized in terms .... In fixed point representation, one essentially uses integer arithmetic operators assuming the binary point to be at some point other ...

  12. Constraint treatment techniques and parallel algorithms for multibody dynamic analysis. Ph.D. Thesis

    Science.gov (United States)

    Chiou, Jin-Chern

    1990-01-01

    Computational procedures for kinematic and dynamic analysis of three-dimensional multibody dynamic (MBD) systems are developed from the differential-algebraic equations (DAE's) viewpoint. Constraint violations during the time integration process are minimized and penalty constraint stabilization techniques and partitioning schemes are developed. The governing equations of motion, a two-stage staggered explicit-implicit numerical algorithm, are treated which takes advantage of a partitioned solution procedure. A robust and parallelizable integration algorithm is developed. This algorithm uses a two-stage staggered central difference algorithm to integrate the translational coordinates and the angular velocities. The angular orientations of bodies in MBD systems are then obtained by using an implicit algorithm via the kinematic relationship between Euler parameters and angular velocities. It is shown that the combination of the present solution procedures yields a computationally more accurate solution. To speed up the computational procedures, parallel implementation of the present constraint treatment techniques, the two-stage staggered explicit-implicit numerical algorithm was efficiently carried out. The DAE's and the constraint treatment techniques were transformed into arrowhead matrices to which Schur complement form was derived. By fully exploiting the sparse matrix structural analysis techniques, a parallel preconditioned conjugate gradient numerical algorithm is used to solve the systems equations written in Schur complement form. A software testbed was designed and implemented in both sequential and parallel computers. This testbed was used to demonstrate the robustness and efficiency of the constraint treatment techniques, the accuracy of the two-stage staggered explicit-implicit numerical algorithm, and the speed up of the Schur-complement-based parallel preconditioned conjugate gradient algorithm on a parallel computer.

  13. Development of algorithm for depreciation costs allocation in dynamic input-output industrial enterprise model

    OpenAIRE

    Keller Alevtina; Vinogradova Tatyana

    2017-01-01

    The article considers the issue of allocation of depreciation costs in the dynamic inputoutput model of an industrial enterprise. Accounting the depreciation costs in such a model improves the policy of fixed assets management. It is particularly relevant to develop the algorithm for the allocation of depreciation costs in the construction of dynamic input-output model of an industrial enterprise, since such enterprises have a significant amount of fixed assets. Implementation of terms of the...

  14. Quantum algorithm for simulating the dynamics of an open quantum system

    International Nuclear Information System (INIS)

    Wang Hefeng; Ashhab, S.; Nori, Franco

    2011-01-01

    In the study of open quantum systems, one typically obtains the decoherence dynamics by solving a master equation. The master equation is derived using knowledge of some basic properties of the system, the environment, and their interaction: One basically needs to know the operators through which the system couples to the environment and the spectral density of the environment. For a large system, it could become prohibitively difficult to even write down the appropriate master equation, let alone solve it on a classical computer. In this paper, we present a quantum algorithm for simulating the dynamics of an open quantum system. On a quantum computer, the environment can be simulated using ancilla qubits with properly chosen single-qubit frequencies and with properly designed coupling to the system qubits. The parameters used in the simulation are easily derived from the parameters of the system + environment Hamiltonian. The algorithm is designed to simulate Markovian dynamics, but it can also be used to simulate non-Markovian dynamics provided that this dynamics can be obtained by embedding the system of interest into a larger system that obeys Markovian dynamics. We estimate the resource requirements for the algorithm. In particular, we show that for sufficiently slow decoherence a single ancilla qubit could be sufficient to represent the entire environment, in principle.

  15. Dynamic Power System Security Analysis Using a Hybrid PSO-APO Algorithm

    Directory of Open Access Journals (Sweden)

    K. Teeparthi

    2017-12-01

    Full Text Available In this paper, a novel hybrid particle swarm optimization and artificial physics optimization (HPSO-APO algorithm is proposed to solve the dynamic security constrained optimal power flow (DSCOPF problem for enhancing system security. The dynamic security assessment deals with contingency analysis which is carried out using a performance index. DSCOPF recommends preventive control actions like generator rescheduling to alleviate an existing credible contingency in the system while ensuring minimal operating cost. The OPF problem is a highly nonlinear differential one and becomes more complex when considering the rotor dynamics of the system. The APO algorithm has the capability to reach a near global optimum value. However, it suffers from convergence problem. On the other hand, PSO exhibits premature convergence characteristics, but it may get trapped at a local optima value. The proposed HPSO-APO algorithm combines both individual algorithm strengths, to get balance between global and local search capability. The proposed method has been evaluated on a standard IEEE six-generator, 30-bus system and a New England ten-generator, 39-bus test system. The proposed HPSO-APO algorithm gives an efficient and robust optimal solution of DSCOPF problem compared to standard PSO and APO methods.

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

  17. Strategic flight assignment approach based on multi-objective parallel evolution algorithm with dynamic migration interval

    Directory of Open Access Journals (Sweden)

    Zhang Xuejun

    2015-04-01

    Full Text Available The continuous growth of air traffic has led to acute airspace congestion and severe delays, which threatens operation safety and cause enormous economic loss. Flight assignment is an economical and effective strategic plan to reduce the flight delay and airspace congestion by reasonably regulating the air traffic flow of China. However, it is a large-scale combinatorial optimization problem which is difficult to solve. In order to improve the quality of solutions, an effective multi-objective parallel evolution algorithm (MPEA framework with dynamic migration interval strategy is presented in this work. Firstly, multiple evolution populations are constructed to solve the problem simultaneously to enhance the optimization capability. Then a new strategy is proposed to dynamically change the migration interval among different evolution populations to improve the efficiency of the cooperation of populations. Finally, the cooperative co-evolution (CC algorithm combined with non-dominated sorting genetic algorithm II (NSGA-II is introduced for each population. Empirical studies using the real air traffic data of the Chinese air route network and daily flight plans show that our method outperforms the existing approaches, multi-objective genetic algorithm (MOGA, multi-objective evolutionary algorithm based on decomposition (MOEA/D, CC-based multi-objective algorithm (CCMA as well as other two MPEAs with different migration interval strategies.

  18. Research on Methodology to Prioritize Critical Digital Assets based on Nuclear Risk Assessment

    International Nuclear Information System (INIS)

    Kim, Wonjik; Kwon, Kookheui; Kim, Hyundoo

    2016-01-01

    Digital systems are used in nuclear facilities to monitor and control various types of field devices, as well as to obtain and store vital information. Therefore, it is getting important for nuclear facilities to protect digital systems from cyber-attack in terms of safety operation and public health since cyber compromise of these systems could lead to unacceptable radiological consequences. Based on KINAC/RS-015 which is a cyber security regulatory standard, regulatory activities for cyber security at nuclear facilities generally focus on critical digital assets (CDAs) which are safety, security, and emergency preparedness related digital assets. Critical digital assets are estimated over 60% among all digital assets in a nuclear power plant. Therefore, it was required to prioritize critical digital assets to improve efficiency of regulation and implementation. In this paper, the research status on methodology development to prioritize critical digital assets based on nuclear risk assessment will be introduced. In this paper, to derive digital asset directly affect accident, PRA results (ET, FT, and minimal cut set) are analyzed. According to result of analysis, digital systems related to CD are derived ESF-CCS (safety-related component control system) and Process-CCS (non-safety-related component control system) as well as Engineered Safety Features Actuation System (ESFAS). These digital assets can be identified Vital Digital Asset (VDA). Hereafter, to develop general methodology which was identified VDA related to accident among CDAs, (1) method using result of minimal cut set in PRA model will be studied and (2) method quantifying result of Digital I and C PRA which is performed to reflect all digital cabinet related to system in FT will be studied

  19. A Dynamic Traffic Signal Timing Model and its Algorithm for Junction of Urban Road

    DEFF Research Database (Denmark)

    Cai, Yanguang; Cai, Hao

    2012-01-01

    As an important part of Intelligent Transportation System, the scientific traffic signal timing of junction can improve the efficiency of urban transport. This paper presents a novel dynamic traffic signal timing model. According to the characteristics of the model, hybrid chaotic quantum......-time and dynamic signal control of junction. To obtain the optimal solution of the model by hybrid chaotic quantum evolutionary algorithm, the model is converted to an easily solvable form. To simplify calculation, we give the expression of the partial derivative and change rate of the objective function...... such that the implementation of the algorithm only involves function assignments and arithmetic operations and thus avoids complex operations such as integral and differential. Simulation results show that the algorithm has less remain vehicles than Webster method, higher convergence rate and convergence speed than quantum...

  20. Efficiencies of dynamic Monte Carlo algorithms for off-lattice particle systems with a single impurity

    KAUST Repository

    Novotny, M.A.

    2010-02-01

    The efficiency of dynamic Monte Carlo algorithms for off-lattice systems composed of particles is studied for the case of a single impurity particle. The theoretical efficiencies of the rejection-free method and of the Monte Carlo with Absorbing Markov Chains method are given. Simulation results are presented to confirm the theoretical efficiencies. © 2010.

  1. Parallel Implementation of Isothermal and Isoenergetic Dissipative Particle Dynamics using Shardlow-like Splitting Algorithms

    Czech Academy of Sciences Publication Activity Database

    Larentzos, J.P.; Brennan, J.K.; Moore, J.D.; Lísal, Martin; Mattson, w.D.

    2014-01-01

    Roč. 185, č. 7 (2014), s. 1987-1998 ISSN 0010-4655 Grant - others:ARL(US) W911NF-10-2-0039 Institutional support: RVO:67985858 Keywords : dissipative particle dynamics * shardlow splitting algorithm * numerical integration Subject RIV: CF - Physical ; Theoretical Chemistry Impact factor: 3.112, year: 2014

  2. A Hybrid Shared-Memory Parallel Max-Tree Algorithm for Extreme Dynamic-Range Images

    NARCIS (Netherlands)

    Moschini, Ugo; Meijster, Arnold; Wilkinson, Michael

    Max-trees, or component trees, are graph structures that represent the connected components of an image in a hierarchical way. Nowadays, many application fields rely on images with high-dynamic range or floating point values. Efficient sequential algorithms exist to build trees and compute

  3. Learning and anticipation in online dynamic optimization with evolutionary algorithms: The stochastic case

    NARCIS (Netherlands)

    P.A.N. Bosman (Peter); J.A. La Poutré (Han); D. Thierens (Dirk)

    2007-01-01

    htmlabstractThe focus of this paper is on how to design evolutionary algorithms (EAs) for solving stochastic dynamic optimization problems online, i.e. as time goes by. For a proper design, the EA must not only be capable of tracking shifting optima, it must also take into account the future

  4. Dynamically Predicting the Quality of Service: Batch, Online, and Hybrid Algorithms

    Directory of Open Access Journals (Sweden)

    Ya Chen

    2017-01-01

    Full Text Available This paper studies the problem of dynamically modeling the quality of web service. The philosophy of designing practical web service recommender systems is delivered in this paper. A general system architecture for such systems continuously collects the user-service invocation records and includes both an online training module and an offline training module for quality prediction. In addition, we introduce matrix factorization-based online and offline training algorithms based on the gradient descent algorithms and demonstrate the fitness of this online/offline algorithm framework to the proposed architecture. The superiority of the proposed model is confirmed by empirical studies on a real-life quality of web service data set and comparisons with existing web service recommendation algorithms.

  5. Nonuniform Sparse Data Clustering Cascade Algorithm Based on Dynamic Cumulative Entropy

    Directory of Open Access Journals (Sweden)

    Ning Li

    2016-01-01

    Full Text Available A small amount of prior knowledge and randomly chosen initial cluster centers have a direct impact on the accuracy of the performance of iterative clustering algorithm. In this paper we propose a new algorithm to compute initial cluster centers for k-means clustering and the best number of the clusters with little prior knowledge and optimize clustering result. It constructs the Euclidean distance control factor based on aggregation density sparse degree to select the initial cluster center of nonuniform sparse data and obtains initial data clusters by multidimensional diffusion density distribution. Multiobjective clustering approach based on dynamic cumulative entropy is adopted to optimize the initial data clusters and the best number of the clusters. The experimental results show that the newly proposed algorithm has good performance to obtain the initial cluster centers for the k-means algorithm and it effectively improves the clustering accuracy of nonuniform sparse data by about 5%.

  6. A variant of the dynamic programming algorithm for unit commitment of combined heat and power systems

    DEFF Research Database (Denmark)

    Rong, Aiying; Hakonen, Henri; Lahdelma, Risto

    2008-01-01

    The paper addresses the unit commitment in multi-period combined heat and power (CHP) production planning under the deregulated power market. In CHP plants (units), generation of heat and power follows joint characteristics, which means that production planning must be done in coordination. We...... in the system, the number of periods over the planning horizon and the time for solving a single-period economic dispatch problem. We have compared the DP-RSC1 algorithm with realistic power plants against the unit decommitment algorithm and the traditional priority listing method. The results show that the DP...... introduce in this paper the DP-RSC1 algorithm, which is a variant of the dynamic programming (DP) algorithm based on linear relaxation of the ON/OFF states of the units and sequential commitment of units one by one. The time complexity of DP-RSC1 is proportional to the number of generating units...

  7. Genetic Algorithm-based Dynamic Vehicle Route Search using Car-to-Car Communication

    Directory of Open Access Journals (Sweden)

    KIM, J.

    2010-11-01

    Full Text Available Suggesting more efficient driving routes generate benefits not only for individuals by saving commute time, but also for society as a whole by reducing accident rates and social costs by lessening traffic congestion. In this paper, we suggest a new route search algorithm based on a genetic algorithm which is more easily installable into mutually communicating car navigation systems, and validate its usefulness through experiments reflecting real-world situations. The proposed algorithm is capable of searching alternative routes dynamically in unexpected events of system malfunctioning or traffic slow-downs due to accidents. Experimental results demonstrate that our algorithm searches the best route more efficiently and evolves with universal adaptability.

  8. Algorithm for predicting the evolution of series of dynamics of complex systems in solving information problems

    Science.gov (United States)

    Kasatkina, T. I.; Dushkin, A. V.; Pavlov, V. A.; Shatovkin, R. R.

    2018-03-01

    In the development of information, systems and programming to predict the series of dynamics, neural network methods have recently been applied. They are more flexible, in comparison with existing analogues and are capable of taking into account the nonlinearities of the series. In this paper, we propose a modified algorithm for predicting the series of dynamics, which includes a method for training neural networks, an approach to describing and presenting input data, based on the prediction by the multilayer perceptron method. To construct a neural network, the values of a series of dynamics at the extremum points and time values corresponding to them, formed based on the sliding window method, are used as input data. The proposed algorithm can act as an independent approach to predicting the series of dynamics, and be one of the parts of the forecasting system. The efficiency of predicting the evolution of the dynamics series for a short-term one-step and long-term multi-step forecast by the classical multilayer perceptron method and a modified algorithm using synthetic and real data is compared. The result of this modification was the minimization of the magnitude of the iterative error that arises from the previously predicted inputs to the inputs to the neural network, as well as the increase in the accuracy of the iterative prediction of the neural network.

  9. Decomposition-Based Multiobjective Evolutionary Algorithm for Community Detection in Dynamic Social Networks

    Directory of Open Access Journals (Sweden)

    Jingjing Ma

    2014-01-01

    Full Text Available Community structure is one of the most important properties in social networks. In dynamic networks, there are two conflicting criteria that need to be considered. One is the snapshot quality, which evaluates the quality of the community partitions at the current time step. The other is the temporal cost, which evaluates the difference between communities at different time steps. In this paper, we propose a decomposition-based multiobjective community detection algorithm to simultaneously optimize these two objectives to reveal community structure and its evolution in dynamic networks. It employs the framework of multiobjective evolutionary algorithm based on decomposition to simultaneously optimize the modularity and normalized mutual information, which quantitatively measure the quality of the community partitions and temporal cost, respectively. A local search strategy dealing with the problem-specific knowledge is incorporated to improve the effectiveness of the new algorithm. Experiments on computer-generated and real-world networks demonstrate that the proposed algorithm can not only find community structure and capture community evolution more accurately, but also be steadier than the two compared algorithms.

  10. An Event-Driven Hybrid Molecular Dynamics and Direct Simulation Monte Carlo Algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Donev, A; Garcia, A L; Alder, B J

    2007-07-30

    A novel algorithm is developed for the simulation of polymer chains suspended in a solvent. The polymers are represented as chains of hard spheres tethered by square wells and interact with the solvent particles with hard core potentials. The algorithm uses event-driven molecular dynamics (MD) for the simulation of the polymer chain and the interactions between the chain beads and the surrounding solvent particles. The interactions between the solvent particles themselves are not treated deterministically as in event-driven algorithms, rather, the momentum and energy exchange in the solvent is determined stochastically using the Direct Simulation Monte Carlo (DSMC) method. The coupling between the solvent and the solute is consistently represented at the particle level, however, unlike full MD simulations of both the solvent and the solute, the spatial structure of the solvent is ignored. The algorithm is described in detail and applied to the study of the dynamics of a polymer chain tethered to a hard wall subjected to uniform shear. The algorithm closely reproduces full MD simulations with two orders of magnitude greater efficiency. Results do not confirm the existence of periodic (cycling) motion of the polymer chain.

  11. Decomposition-Based Multiobjective Evolutionary Algorithm for Community Detection in Dynamic Social Networks

    Science.gov (United States)

    Ma, Jingjing; Liu, Jie; Ma, Wenping; Gong, Maoguo; Jiao, Licheng

    2014-01-01

    Community structure is one of the most important properties in social networks. In dynamic networks, there are two conflicting criteria that need to be considered. One is the snapshot quality, which evaluates the quality of the community partitions at the current time step. The other is the temporal cost, which evaluates the difference between communities at different time steps. In this paper, we propose a decomposition-based multiobjective community detection algorithm to simultaneously optimize these two objectives to reveal community structure and its evolution in dynamic networks. It employs the framework of multiobjective evolutionary algorithm based on decomposition to simultaneously optimize the modularity and normalized mutual information, which quantitatively measure the quality of the community partitions and temporal cost, respectively. A local search strategy dealing with the problem-specific knowledge is incorporated to improve the effectiveness of the new algorithm. Experiments on computer-generated and real-world networks demonstrate that the proposed algorithm can not only find community structure and capture community evolution more accurately, but also be steadier than the two compared algorithms. PMID:24723806

  12. PRESS-based EFOR algorithm for the dynamic parametrical modeling of nonlinear MDOF systems

    Science.gov (United States)

    Liu, Haopeng; Zhu, Yunpeng; Luo, Zhong; Han, Qingkai

    2017-09-01

    In response to the identification problem concerning multi-degree of freedom (MDOF) nonlinear systems, this study presents the extended forward orthogonal regression (EFOR) based on predicted residual sums of squares (PRESS) to construct a nonlinear dynamic parametrical model. The proposed parametrical model is based on the non-linear autoregressive with exogenous inputs (NARX) model and aims to explicitly reveal the physical design parameters of the system. The PRESS-based EFOR algorithm is proposed to identify such a model for MDOF systems. By using the algorithm, we built a common-structured model based on the fundamental concept of evaluating its generalization capability through cross-validation. The resulting model aims to prevent over-fitting with poor generalization performance caused by the average error reduction ratio (AERR)-based EFOR algorithm. Then, a functional relationship is established between the coefficients of the terms and the design parameters of the unified model. Moreover, a 5-DOF nonlinear system is taken as a case to illustrate the modeling of the proposed algorithm. Finally, a dynamic parametrical model of a cantilever beam is constructed from experimental data. Results indicate that the dynamic parametrical model of nonlinear systems, which depends on the PRESS-based EFOR, can accurately predict the output response, thus providing a theoretical basis for the optimal design of modeling methods for MDOF nonlinear systems.

  13. Optimizing Natural Gas Networks through Dynamic Manifold Theory and a Decentralized Algorithm: Belgium Case Study

    Science.gov (United States)

    Koch, Caleb; Winfrey, Leigh

    2014-10-01

    Natural Gas is a major energy source in Europe, yet political instabilities have the potential to disrupt access and supply. Energy resilience is an increasingly essential construct and begins with transmission network design. This study proposes a new way of thinking about modelling natural gas flow. Rather than relying on classical economic models, this problem is cast into a time-dependent Hamiltonian dynamics discussion. Traditional Natural Gas constraints, including inelastic demand and maximum/minimum pipe flows, are portrayed as energy functions and built into the dynamics of each pipe flow. Doing so allows the constraints to be built into the dynamics of each pipeline. As time progresses in the model, natural gas flow rates find the minimum energy, thus the optimal gas flow rates. The most important result of this study is using dynamical principles to ensure the output of natural gas at demand nodes remains constant, which is important for country to country natural gas transmission. Another important step in this study is building the dynamics of each flow in a decentralized algorithm format. Decentralized regulation has solved congestion problems for internet data flow, traffic flow, epidemiology, and as demonstrated in this study can solve the problem of Natural Gas congestion. A mathematical description is provided for how decentralized regulation leads to globally optimized network flow. Furthermore, the dynamical principles and decentralized algorithm are applied to a case study of the Fluxys Belgium Natural Gas Network.

  14. Concurrent extensions to the FORTRAN language for parallel programming of computational fluid dynamics algorithms

    Science.gov (United States)

    Weeks, Cindy Lou

    1986-01-01

    Experiments were conducted at NASA Ames Research Center to define multi-tasking software requirements for multiple-instruction, multiple-data stream (MIMD) computer architectures. The focus was on specifying solutions for algorithms in the field of computational fluid dynamics (CFD). The program objectives were to allow researchers to produce usable parallel application software as soon as possible after acquiring MIMD computer equipment, to provide researchers with an easy-to-learn and easy-to-use parallel software language which could be implemented on several different MIMD machines, and to enable researchers to list preferred design specifications for future MIMD computer architectures. Analysis of CFD algorithms indicated that extensions of an existing programming language, adaptable to new computer architectures, provided the best solution to meeting program objectives. The CoFORTRAN Language was written in response to these objectives and to provide researchers a means to experiment with parallel software solutions to CFD algorithms on machines with parallel architectures.

  15. A multilevel-skin neighbor list algorithm for molecular dynamics simulation

    Science.gov (United States)

    Zhang, Chenglong; Zhao, Mingcan; Hou, Chaofeng; Ge, Wei

    2018-01-01

    Searching of the interaction pairs and organization of the interaction processes are important steps in molecular dynamics (MD) algorithms and are critical to the overall efficiency of the simulation. Neighbor lists are widely used for these steps, where thicker skin can reduce the frequency of list updating but is discounted by more computation in distance check for the particle pairs. In this paper, we propose a new neighbor-list-based algorithm with a precisely designed multilevel skin which can reduce unnecessary computation on inter-particle distances. The performance advantages over traditional methods are then analyzed against the main simulation parameters on Intel CPUs and MICs (many integrated cores), and are clearly demonstrated. The algorithm can be generalized for various discrete simulations using neighbor lists.

  16. An Improved Shuffled Frog Leaping Algorithm and Its Application in Dynamic Emergency Vehicle Dispatching

    Directory of Open Access Journals (Sweden)

    Xiaohong Duan

    2018-01-01

    Full Text Available The traditional method for solving the dynamic emergency vehicle dispatching problem can only get a local optimal strategy in each horizon. In order to obtain the dispatching strategy that can better respond to changes in road conditions during the whole dispatching process, the real-time and time-dependent link travel speeds are fused, and a time-dependent polygonal-shaped link travel speed function is set up to simulate the predictable changes in road conditions. Response times, accident severity, and accident time windows are taken as key factors to build an emergency vehicle dispatching model integrating dynamic emergency vehicle routing and selection. For the unpredictable changes in road conditions caused by accidents, the dispatching strategy is adjusted based on the real-time link travel speed. In order to solve the dynamic emergency vehicle dispatching model, an improved shuffled frog leaping algorithm (ISFLA is proposed. The global search of the improved algorithm uses the probability model of estimation of distribution algorithm to avoid the partial optimal solution. Based on the Beijing expressway network, the efficacy of the model and the improved algorithm were tested from three aspects. The results have shown the following: (1 Compared with SFLA, the optimization performance of ISFLA is getting better and better with the increase of the number of decision variables. When the possible emergency vehicle selection strategies are 815, the objective function value of optimal selection strategies obtained by the base algorithm is 210.10% larger than that of ISFLA. (2 The prediction error of the travel speed affects the accuracy of the initial emergency vehicle dispatching. The prediction error of ±10 can basically meet the requirements of the initial dispatching. (3 The adjustment of emergency vehicle dispatching strategy can successfully bypassed road sections affected by accidents and shorten the response time.

  17. Development of algorithm for depreciation costs allocation in dynamic input-output industrial enterprise model

    Directory of Open Access Journals (Sweden)

    Keller Alevtina

    2017-01-01

    Full Text Available The article considers the issue of allocation of depreciation costs in the dynamic inputoutput model of an industrial enterprise. Accounting the depreciation costs in such a model improves the policy of fixed assets management. It is particularly relevant to develop the algorithm for the allocation of depreciation costs in the construction of dynamic input-output model of an industrial enterprise, since such enterprises have a significant amount of fixed assets. Implementation of terms of the adequacy of such an algorithm itself allows: evaluating the appropriateness of investments in fixed assets, studying the final financial results of an industrial enterprise, depending on management decisions in the depreciation policy. It is necessary to note that the model in question for the enterprise is always degenerate. It is caused by the presence of zero rows in the matrix of capital expenditures by lines of structural elements unable to generate fixed assets (part of the service units, households, corporate consumers. The paper presents the algorithm for the allocation of depreciation costs for the model. This algorithm was developed by the authors and served as the basis for further development of the flowchart for subsequent implementation with use of software. The construction of such algorithm and its use for dynamic input-output models of industrial enterprises is actualized by international acceptance of the effectiveness of the use of input-output models for national and regional economic systems. This is what allows us to consider that the solutions discussed in the article are of interest to economists of various industrial enterprises.

  18. Express company’s vehicle routing optimization by multiple-dynamic saving algorithm

    Directory of Open Access Journals (Sweden)

    Junchao Liu

    2014-05-01

    Full Text Available Purpose: According to the disorder in circulation commuting and crossover commuting of SF company which is the China’s largest private express delivery service provider, the study uses the Saving Algorithm to make the vehicle routing and resources optimized, on this basis, proposes innovative improvements with Saving Algorithm and then applies it in every distribution center of SF forming a "multi-dynamic" type of Saving Algorithm to ensure both cost savings and timeliness. This method can be generalized for all express company to get the vehicle routing optimized.Design/methodology/approach: As the special transportation requirements of express companies, this study optimizes the vehicle route based on Saving Algorithm, uses multiple-dynamic Saving Algorithm, and considers the timeliness requirements of the express company to achieve a balance of cost and timeliness.Findings: The main finding is that a new method proposed which there can be a balance improvement for both cost and timeliness to optimize the vehicle route of express company. Calculation example validates the effectiveness of the model established and solving method.Practical implications: It is a widespread practice that by setting up model and parameters for the objectives, express company can maintain the balances between cost and timeliness and achieve the optimized vehicle route.Originality/value: It proposes innovative improvements, takes SF express company as an example, with Saving Algorithm which can be applied in every distribution center of express company to ensure the balance improvement for both cost and timeliness, and has a great practical significance to the transportation network and path optimization of express companies.

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

    Science.gov (United States)

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

    2001-01-01

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

  20. Improved k-t PCA Algorithm Using Artificial Sparsity in Dynamic MRI.

    Science.gov (United States)

    Wang, Yiran; Chen, Zhifeng; Wang, Jing; Yuan, Lixia; Xia, Ling; Liu, Feng

    2017-01-01

    The k - t principal component analysis ( k - t PCA) is an effective approach for high spatiotemporal resolution dynamic magnetic resonance (MR) imaging. However, it suffers from larger residual aliasing artifacts and noise amplification when the reduction factor goes higher. To further enhance the performance of this technique, we propose a new method called sparse k - t PCA that combines the k - t PCA algorithm with an artificial sparsity constraint. It is a self-calibrated procedure that is based on the traditional k - t PCA method by further eliminating the reconstruction error derived from complex subtraction of the sampled k - t space from the original reconstructed k - t space. The proposed method is tested through both simulations and in vivo datasets with different reduction factors. Compared to the standard k - t PCA algorithm, the sparse k - t PCA can improve the normalized root-mean-square error performance and the accuracy of temporal resolution. It is thus useful for rapid dynamic MR imaging.

  1. Thickness determination in textile material design: dynamic modeling and numerical algorithms

    International Nuclear Information System (INIS)

    Xu, Dinghua; Ge, Meibao

    2012-01-01

    Textile material design is of paramount importance in the study of functional clothing design. It is therefore important to determine the dynamic heat and moisture transfer characteristics in the human body–clothing–environment system, which directly determine the heat–moisture comfort level of the human body. Based on a model of dynamic heat and moisture transfer with condensation in porous fabric at low temperature, this paper presents a new inverse problem of textile thickness determination (IPTTD). Adopting the idea of the least-squares method, we formulate the IPTTD into a function minimization problem. By means of the finite-difference method, quasi-solution method and direct search method for one-dimensional minimization problems, we construct iterative algorithms of the approximated solution for the IPTTD. Numerical simulation results validate the formulation of the IPTTD and demonstrate the effectiveness of the proposed numerical algorithms. (paper)

  2. A discrete force allocation algorithm for modelling wind turbines in computational fluid dynamics

    DEFF Research Database (Denmark)

    Réthoré, Pierre-Elouan; Sørensen, Niels N.

    2012-01-01

    This paper describes an algorithm for allocating discrete forces in computational fluid dynamics (CFD). Discrete forces are useful in wind energy CFD. They are used as an approximation of the wind turbine blades’ action on the wind (actuator disc/line), to model forests and to model turbulent inf...... applicable in other fields of CFD that use discrete body forces. Copyright © 2011 John Wiley & Sons, Ltd....... inflows. Many CFD codes are designed with collocated variables layout. Although this approach has many attractive features, it can generate a numerical decoupling between the pressure and the velocities. This issue is addressed by the Rhie–Chow control volume momentum interpolation. However......This paper describes an algorithm for allocating discrete forces in computational fluid dynamics (CFD). Discrete forces are useful in wind energy CFD. They are used as an approximation of the wind turbine blades’ action on the wind (actuator disc/line), to model forests and to model turbulent...

  3. AUTOMATIC DETECTION ALGORITHM OF DYNAMIC PRESSURE PULSES IN THE SOLAR WIND

    International Nuclear Information System (INIS)

    Zuo, Pingbing; Feng, Xueshang; Wang, Yi; Xie, Yanqiong; Li, Huijun; Xu, Xiaojun

    2015-01-01

    Dynamic pressure pulses (DPPs) in the solar wind are a significant phenomenon closely related to the solar-terrestrial connection and physical processes of solar wind dynamics. In order to automatically identify DPPs from solar wind measurements, we develop a procedure with a three-step detection algorithm that is able to rapidly select DPPs from the plasma data stream and simultaneously define the transition region where large dynamic pressure variations occur and demarcate the upstream and downstream region by selecting the relatively quiet status before and after the abrupt change in dynamic pressure. To demonstrate the usefulness, efficiency, and accuracy of this procedure, we have applied it to the Wind observations from 1996 to 2008 by successfully obtaining the DPPs. The procedure can also be applied to other solar wind spacecraft observation data sets with different time resolutions

  4. Reconstruction of 4-D dynamic SPECT images from inconsistent projections using a Spline initialized FADS algorithm (SIFADS).

    Science.gov (United States)

    Abdalah, Mahmoud; Boutchko, Rostyslav; Mitra, Debasis; Gullberg, Grant T

    2015-01-01

    In this paper, we propose and validate an algorithm of extracting voxel-by-voxel time activity curves directly from inconsistent projections applied in dynamic cardiac SPECT. The algorithm was derived based on factor analysis of dynamic structures (FADS) approach and imposes prior information by applying several regularization functions with adaptively changing relative weighting. The anatomical information of the imaged subject was used to apply the proposed regularization functions adaptively in the spatial domain. The algorithm performance is validated by reconstructing dynamic datasets simulated using the NCAT phantom with a range of different input tissue time-activity curves. The results are compared to the spline-based and FADS methods. The validated algorithm is then applied to reconstruct pre-clinical cardiac SPECT data from canine and murine subjects. Images, generated from both simulated and experimentally acquired data confirm the ability of the new algorithm to solve the inverse problem of dynamic SPECT with slow gantry rotation.

  5. A novel control algorithm of dual flyback inverter suitable for dynamic and nonlinear loads

    Energy Technology Data Exchange (ETDEWEB)

    Cernan, P. [Clayton Power Research and Development, Trencin (Slovakia); Sul, R.; Dobrucky, B. [Zilina Univ., Zilina (Slovakia)

    2010-08-13

    The dual flyback inverter (DFBI) is one of the preferred topologies for isolated low power low cost photovoltaic (PV) inverters. It can be employed for grid connected power systems or for island operation power systems. Island operation necessitates a high performance output voltage control algorithm which will ensure that output alternating current voltage will stay quasi harmonic and within operating limits under the different load and input voltage conditions. This paper introduced a unique control algorithm of DFBI suitable for dynamic and nonlinear loads. Functionality of control loop was verified by computer simulation with different loads on the output of DFBI. Specifically, the paper presented a circuit diagram of DFBI with an active clamp circuit as well as the novel control algorithm. The dimensioning of power stage components for DFBI simulation was also discussed. The results achieved by Simetrix simulation were presented. It was concluded that the algorithm could be utilized for dynamic or nonlinear loads without significant deformation of output voltage. 13 refs., 1 tab., 10 figs.

  6. An improved molecular dynamics algorithm to study thermodiffusion in binary hydrocarbon mixtures

    Science.gov (United States)

    Antoun, Sylvie; Saghir, M. Ziad; Srinivasan, Seshasai

    2018-03-01

    In multicomponent liquid mixtures, the diffusion flow of chemical species can be induced by temperature gradients, which leads to a separation of the constituent components. This cross effect between temperature and concentration is known as thermodiffusion or the Ludwig-Soret effect. The performance of boundary driven non-equilibrium molecular dynamics along with the enhanced heat exchange (eHEX) algorithm was studied by assessing the thermodiffusion process in n-pentane/n-decane (nC5-nC10) binary mixtures. The eHEX algorithm consists of an extended version of the HEX algorithm with an improved energy conservation property. In addition to this, the transferable potentials for phase equilibria-united atom force field were employed in all molecular dynamics (MD) simulations to precisely model the molecular interactions in the fluid. The Soret coefficients of the n-pentane/n-decane (nC5-nC10) mixture for three different compositions (at 300.15 K and 0.1 MPa) were calculated and compared with the experimental data and other MD results available in the literature. Results of our newly employed MD algorithm showed great agreement with experimental data and a better accuracy compared to other MD procedures.

  7. Chaotic Image Encryption Algorithm Based on Bit Permutation and Dynamic DNA Encoding

    Directory of Open Access Journals (Sweden)

    Xuncai Zhang

    2017-01-01

    Full Text Available With the help of the fact that chaos is sensitive to initial conditions and pseudorandomness, combined with the spatial configurations in the DNA molecule’s inherent and unique information processing ability, a novel image encryption algorithm based on bit permutation and dynamic DNA encoding is proposed here. The algorithm first uses Keccak to calculate the hash value for a given DNA sequence as the initial value of a chaotic map; second, it uses a chaotic sequence to scramble the image pixel locations, and the butterfly network is used to implement the bit permutation. Then, the image is coded into a DNA matrix dynamic, and an algebraic operation is performed with the DNA sequence to realize the substitution of the pixels, which further improves the security of the encryption. Finally, the confusion and diffusion properties of the algorithm are further enhanced by the operation of the DNA sequence and the ciphertext feedback. The results of the experiment and security analysis show that the algorithm not only has a large key space and strong sensitivity to the key but can also effectively resist attack operations such as statistical analysis and exhaustive analysis.

  8. A structural dynamic factor model for the effects of monetary policy estimated by the EM algorithm

    DEFF Research Database (Denmark)

    Bork, Lasse

    This paper applies the maximum likelihood based EM algorithm to a large-dimensional factor analysis of US monetary policy. Specifically, economy-wide effects of shocks to the US federal funds rate are estimated in a structural dynamic factor model in which 100+ US macroeconomic and financial time...... as opposed to the orthogonal factors resulting from the popular principal component approach to structural factor models. Correlated factors are economically more sensible and important for a richer monetary policy transmission mechanism. Secondly, I consider both static factor loadings as well as dynamic...

  9. Polynomial filtered HMC-an algorithm for lattice QCD with dynamical quarks

    Science.gov (United States)

    Kamleh, Waseem; Peardon, Mike

    2012-09-01

    Polynomial approximations to the inverse of the fermion matrix are used to filter the dynamics of the upper energy scales in Hybrid Monte Carlo (HMC) simulations. The use of a multiple time-scale integration scheme then allows the filtered pseudofermions to be evolved using a coarse step size. The algorithm is applied to Nf=2 flavour simulations at two different quark masses. Polynomial filtering yields a reduction in the computational expense of the molecular dynamics integration of between three- and fivefold when compared to standard HMC. Significantly, the observed speedup is better at the lower quark mass.

  10. Fiber optic gyroscope dynamic north-finder algorithm modeling and analysis based on Simulink

    Science.gov (United States)

    Zhang, Zhengyi; Liu, Chuntong

    2017-09-01

    In view of the problems such as the lower automation level and the insufficient precision of the traditional fiber optic gyroscope (FOG) static north-finder, this paper focuses on the in-depth analysis of the FOG dynamic north-finder principle and algorithm. The simulation model of the FOG dynamic north found algorithm with the least square method by points is established using Simulink toolbox, and then the platform rotation speed and sampling frequency, which affect FOG dynamic north found precision obviously, are simulated and calculated, and the optimization analysis is carried out as a key consideration. The simulation results show that, when the platform rotation speed is between 4.5 °/s and 8.5 °/s and the sampling frequency is at about 50 Hz in the case of using the parameters of this paper, the FOG dynamic north finding system can reach the higher precision. And the conclusions can provide the reference and validation for the engineering and practical of FOG dynamic north-finder.

  11. A Dantzig-Wolfe decomposition algorithm for linear economic model predictive control of dynamically decoupled subsystems

    DEFF Research Database (Denmark)

    Sokoler, Leo Emil; Standardi, Laura; Edlund, Kristian

    2014-01-01

    This paper presents a warm-started Dantzig–Wolfe decomposition algorithm tailored to economic model predictive control of dynamically decoupled subsystems. We formulate the constrained optimal control problem solved at each sampling instant as a linear program with state space constraints, input ....... In the presence of process and measurement noise, such a regularization term is critical for achieving a well-behaved closed-loop performance....

  12. Analysis of Shooting Consistency in Archers: A Dynamic Time Warping Algorithm-Based Approach

    OpenAIRE

    Quan, Cheng-Hao; Mohy-Ud-Din, Zia; Lee, Sangmin

    2017-01-01

    The shooting consistency of an archer is commonly perceived to be an important determinant of successful scores. Four (n=4) elementary level archers from a middle school in Korea participated in this study. In order to quantify shooting consistency, movement of the bow forearm was measured with an inertia sensor during archery shooting. The shooting consistency was calculated and defined by the dynamic time warping (DTW) algorithm as the distance between two time sequences of acceleration dat...

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

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

    Energy Technology Data Exchange (ETDEWEB)

    Wu, Xia, E-mail: xiawu@mail.nankai.edu.cn; Wu, Genhua

    2014-08-31

    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{sub 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{sub 61} cluster is found to be stacking-fault face-centered cubic, whose energy is lower than that of previously obtained icosahedron.

  15. A New Online Random Particles Optimization Algorithm for Mobile Robot Path Planning in Dynamic Environments

    Directory of Open Access Journals (Sweden)

    Behrang Mohajer

    2013-01-01

    Full Text Available A new algorithm named random particle optimization algorithm (RPOA for local path planning problem of mobile robots in dynamic and unknown environments is proposed. The new algorithm inspired from bacterial foraging technique is based on particles which are randomly distributed around a robot. These particles search the optimal path toward the target position while avoiding the moving obstacles by getting help from the robot’s sensors. The criterion of optimal path selection relies on the particles distance to target and Gaussian cost function assign to detected obstacles. Then, a high level decision making strategy will decide to select best mobile robot path among the proceeded particles, and finally a low level decision control provides a control signal for control of considered holonomic mobile robot. This process is implemented without requirement to tuning algorithm or complex calculation, and furthermore, it is independent from gradient base methods such as heuristic (artificial potential field methods. Therefore, in this paper, the problem of local mobile path planning is free from getting stuck in local minima and is easy computed. To evaluate the proposed algorithm, some simulations in three various scenarios are performed and results are compared by the artificial potential field.

  16. Explicit symplectic algorithms based on generating functions for relativistic charged particle dynamics in time-dependent electromagnetic field

    Science.gov (United States)

    Zhang, Ruili; Wang, Yulei; He, Yang; Xiao, Jianyuan; Liu, Jian; Qin, Hong; Tang, Yifa

    2018-02-01

    Relativistic dynamics of a charged particle in time-dependent electromagnetic fields has theoretical significance and a wide range of applications. The numerical simulation of relativistic dynamics is often multi-scale and requires accurate long-term numerical simulations. Therefore, explicit symplectic algorithms are much more preferable than non-symplectic methods and implicit symplectic algorithms. In this paper, we employ the proper time and express the Hamiltonian as the sum of exactly solvable terms and product-separable terms in space-time coordinates. Then, we give the explicit symplectic algorithms based on the generating functions of orders 2 and 3 for relativistic dynamics of a charged particle. The methodology is not new, which has been applied to non-relativistic dynamics of charged particles, but the algorithm for relativistic dynamics has much significance in practical simulations, such as the secular simulation of runaway electrons in tokamaks.

  17. An examination of the validity of nonequilibrium molecular-dynamics simulation algorithms for arbitrary steady-state flows.

    Science.gov (United States)

    Edwards, Brian J; Baig, Chunggi; Keffer, David J

    2005-09-15

    Nonlinear-response theory of nonequilibrium molecular-dynamics simulation algorithms is considered under the imposition of an arbitrary steady-state flow field. It is demonstrated that the SLLOD and DOLLS algorithms cannot be used for general flows, although the SLLOD algorithm is rigorous for planar Couette flow. Following the same procedure used to establish SLLOD as the valid algorithm for planar Couette flow [D. J. Evans and E. P. Morriss, Phys. Rev. A 30, 1528 (1984)], it is demonstrated that the p-SLLOD algorithm is valid for arbitrary flows and produces the correct nonlinear response of the viscous pressure tensor.

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

    Science.gov (United States)

    Geraci, Joseph; Dharsee, Moyez; Nuin, Paulo; Haslehurst, Alexandria; Koti, Madhuri; Feilotter, Harriet E; Evans, Ken

    2014-03-01

    We introduce a novel method for visualizing high dimensional data via a discrete dynamical system. This method provides a 2D representation of the relationship between subjects according to a set of variables without geometric projections, transformed axes or principal components. The algorithm exploits a memory-type mechanism inherent in a certain class of discrete dynamical systems collectively referred to as the chaos game that are closely related to iterative function systems. The goal of the algorithm was to create a human readable representation of high dimensional patient data that was capable of detecting unrevealed subclusters of patients from within anticipated classifications. This provides a mechanism to further pursue a more personalized exploration of pathology when used with medical data. For clustering and classification protocols, the dynamical system portion of the algorithm is designed to come after some feature selection filter and before some model evaluation (e.g. clustering accuracy) protocol. In the version given here, a univariate features selection step is performed (in practice more complex feature selection methods are used), a discrete dynamical system is driven by this reduced set of variables (which results in a set of 2D cluster models), these models are evaluated for their accuracy (according to a user-defined binary classification) and finally a visual representation of the top classification models are returned. Thus, in addition to the visualization component, this methodology can be used for both supervised and unsupervised machine learning as the top performing models are returned in the protocol we describe here. Butterfly, the algorithm we introduce and provide working code for, uses a discrete dynamical system to classify high dimensional data and provide a 2D representation of the relationship between subjects. We report results on three datasets (two in the article; one in the appendix) including a public lung cancer

  19. A molecular dynamics algorithm for simulation of field theories in the canonical ensemble

    International Nuclear Information System (INIS)

    Kogut, J.B.; Sinclair, D.K.

    1986-01-01

    We add a single scalar degree of freedom (''demon'') to the microcanonical ensemble which converts its molecular dynamics into a simulation method for the canonical ensemble (euclidean path integral) of the underlying field theory. This generalization of the microcanonical molecular dynamics algorithm simulates the field theory at fixed coupling with a completely deterministic procedure. We discuss the finite size effects of the method, the equipartition theorem and ergodicity. The method is applied to the planar model in two dimensions and SU(3) lattice gauge theory with four species of light, dynamical quarks in four dimensions. The method is much less sensitive to its discrete time step than conventional Langevin equation simulations of the canonical ensemble. The method is a straightforward generalization of a procedure introduced by S. Nose for molecular physics. (orig.)

  20. Incorporating a Wheeled Vehicle Model in a New Monocular Visual Odometry Algorithm for Dynamic Outdoor Environments

    Science.gov (United States)

    Jiang, Yanhua; Xiong, Guangming; Chen, Huiyan; Lee, Dah-Jye

    2014-01-01

    This paper presents a monocular visual odometry algorithm that incorporates a wheeled vehicle model for ground vehicles. The main innovation of this algorithm is to use the single-track bicycle model to interpret the relationship between the yaw rate and side slip angle, which are the two most important parameters that describe the motion of a wheeled vehicle. Additionally, the pitch angle is also considered since the planar-motion hypothesis often fails due to the dynamic characteristics of wheel suspensions and tires in real-world environments. Linearization is used to calculate a closed-form solution of the motion parameters that works as a hypothesis generator in a RAndom SAmple Consensus (RANSAC) scheme to reduce the complexity in solving equations involving trigonometric. All inliers found are used to refine the winner solution through minimizing the reprojection error. Finally, the algorithm is applied to real-time on-board visual localization applications. Its performance is evaluated by comparing against the state-of-the-art monocular visual odometry methods using both synthetic data and publicly available datasets over several kilometers in dynamic outdoor environments. PMID:25256109

  1. Incorporating a wheeled vehicle model in a new monocular visual odometry algorithm for dynamic outdoor environments.

    Science.gov (United States)

    Jiang, Yanhua; Xiong, Guangming; Chen, Huiyan; Lee, Dah-Jye

    2014-09-01

    This paper presents a monocular visual odometry algorithm that incorporates a wheeled vehicle model for ground vehicles. The main innovation of this algorithm is to use the single-track bicycle model to interpret the relationship between the yaw rate and side slip angle, which are the two most important parameters that describe the motion of a wheeled vehicle. Additionally, the pitch angle is also considered since the planar-motion hypothesis often fails due to the dynamic characteristics of wheel suspensions and tires in real-world environments. Linearization is used to calculate a closed-form solution of the motion parameters that works as a hypothesis generator in a RAndom SAmple Consensus (RANSAC) scheme to reduce the complexity in solving equations involving trigonometric. All inliers found are used to refine the winner solution through minimizing the reprojection error. Finally, the algorithm is applied to real-time on-board visual localization applications. Its performance is evaluated by comparing against the state-of-the-art monocular visual odometry methods using both synthetic data and publicly available datasets over several kilometers in dynamic outdoor environments.

  2. Incorporating a Wheeled Vehicle Model in a New Monocular Visual Odometry Algorithm for Dynamic Outdoor Environments

    Directory of Open Access Journals (Sweden)

    Yanhua Jiang

    2014-09-01

    Full Text Available This paper presents a monocular visual odometry algorithm that incorporates a wheeled vehicle model for ground vehicles. The main innovation of this algorithm is to use the single-track bicycle model to interpret the relationship between the yaw rate and side slip angle, which are the two most important parameters that describe the motion of a wheeled vehicle. Additionally, the pitch angle is also considered since the planar-motion hypothesis often fails due to the dynamic characteristics of wheel suspensions and tires in real-world environments. Linearization is used to calculate a closed-form solution of the motion parameters that works as a hypothesis generator in a RAndom SAmple Consensus (RANSAC scheme to reduce the complexity in solving equations involving trigonometric. All inliers found are used to refine the winner solution through minimizing the reprojection error. Finally, the algorithm is applied to real-time on-board visual localization applications. Its performance is evaluated by comparing against the state-of-the-art monocular visual odometry methods using both synthetic data and publicly available datasets over several kilometers in dynamic outdoor environments.

  3. A cell multipole based domain decomposition algorithm for molecular dynamics simulation of systems of arbitrary shape

    Science.gov (United States)

    Lakshminarasimhulu, Pasupulati; Madura, Jeffry D.

    2002-04-01

    A domain decomposition algorithm for molecular dynamics simulation of atomic and molecular systems with arbitrary shape and non-periodic boundary conditions is described. The molecular dynamics program uses cell multipole method for efficient calculation of long range electrostatic interactions and a multiple time step method to facilitate bigger time steps. The system is enclosed in a cube and the cube is divided into a hierarchy of cells. The deepest level cells are assigned to processors such that each processor has contiguous cells and static load balancing is achieved by redistributing the cells so that each processor has approximately same number of atoms. The resulting domains have irregular shape and may have more than 26 neighbors. Atoms constituting bond angles and torsion angles may straddle more than two processors. An efficient strategy is devised for initial assignment and subsequent reassignment of such multiple-atom potentials to processors. At each step, computation is overlapped with communication greatly reducing the effect of communication overhead on parallel performance. The algorithm is tested on a spherical cluster of water molecules, a hexasaccharide and an enzyme both solvated by a spherical cluster of water molecules. In each case a spherical boundary containing oxygen atoms with only repulsive interactions is used to prevent evaporation of water molecules. The algorithm shows excellent parallel efficiency even for small number of cells/atoms per processor.

  4. Hybrid genetic algorithms: solutions in realistic dynamic and setup dependent job-shop scheduling problems

    Directory of Open Access Journals (Sweden)

    Rogério M. Branco

    2016-07-01

    Full Text Available This paper discusses the application of heuristic-based evolutionary technique in search for solutions concerning the dynamic job-shop scheduling problems with dependent setup times and alternate routes. With a combinatorial nature, these problems belong to an NP-hard class, with an aggravated condition when in realistic, dynamic and therefore, more complex cases than the traditional static ones. The proposed genetic algorithm executes two important functions: choose the routes using dispatching rules when forming each individual from a defined set of available machines and, also make the scheduling for each of these individuals created. The chromosome codifies a route, or the selected machines, and also an order to process the operations. In essence , each individual needs to be decoded by the scheduler to evaluate its time of completion, so the fitness function of the genetic algorithm, applying the modified Giffler and Thomson’s algorithm, obtains a scheduling of the selected routes in a given planning horizon. The scheduler considers the preparation time between operations on the machines and can manage operations exchange respecting the route and the order given by the chromosome. The best results in the evolutionary process are individuals with routes and processing orders optimized for this type of problema.

  5. New Factorization Techniques and Parallel (log N) Algorithms for Forward Dynamics Solution of Single Closed-Chain Robot Manipulators

    Science.gov (United States)

    Fijany, Amir

    1993-01-01

    In this paper parallel 0(log N) algorithms for dynamic simulation of single closed-chain rigid multibody system as specialized to the case of a robot manipulatoar in contact with the environment are developed.

  6. A Robust Dynamic Heart-Rate Detection Algorithm Framework During Intense Physical Activities Using Photoplethysmographic Signals.

    Science.gov (United States)

    Song, Jiajia; Li, Dan; Ma, Xiaoyuan; Teng, Guowei; Wei, Jianming

    2017-10-25

    Dynamic accurate heart-rate (HR) estimation using a photoplethysmogram (PPG) during intense physical activities is always challenging due to corruption by motion artifacts (MAs). It is difficult to reconstruct a clean signal and extract HR from contaminated PPG. This paper proposes a robust HR-estimation algorithm framework that uses one-channel PPG and tri-axis acceleration data to reconstruct the PPG and calculate the HR based on features of the PPG and spectral analysis. Firstly, the signal is judged by the presence of MAs. Then, the spectral peaks corresponding to acceleration data are filtered from the periodogram of the PPG when MAs exist. Different signal-processing methods are applied based on the amount of remaining PPG spectral peaks. The main MA-removal algorithm (NFEEMD) includes the repeated single-notch filter and ensemble empirical mode decomposition. Finally, HR calibration is designed to ensure the accuracy of HR tracking. The NFEEMD algorithm was performed on the 23 datasets from the 2015 IEEE Signal Processing Cup Database. The average estimation errors were 1.12 BPM (12 training datasets), 2.63 BPM (10 testing datasets) and 1.87 BPM (all 23 datasets), respectively. The Pearson correlation was 0.992. The experiment results illustrate that the proposed algorithm is not only suitable for HR estimation during continuous activities, like slow running (13 training datasets), but also for intense physical activities with acceleration, like arm exercise (10 testing datasets).

  7. The Dynamic Enterprise Network Composition Algorithm for Efficient Operation in Cloud Manufacturing

    Directory of Open Access Journals (Sweden)

    Gilseung Ahn

    2016-11-01

    Full Text Available As a service oriented and networked model, cloud manufacturing (CM has been proposed recently for solving a variety of manufacturing problems, including diverse requirements from customers. In CM, on-demand manufacturing services are provided by a temporary production network composed of several enterprises participating within an enterprise network. In other words, the production network is the main agent of production and a subset of an enterprise network. Therefore, it is essential to compose the enterprise network in a way that can respond to demands properly. A properly-composed enterprise network means the network can handle demands that arrive at the CM, with minimal costs, such as network composition and operation costs, such as participation contract costs, system maintenance costs, and so forth. Due to trade-offs among costs (e.g., contract cost and opportunity cost of production, it is a non-trivial problem to find the optimal network enterprise composition. In addition, this includes probabilistic constraints, such as forecasted demand. In this paper, we propose an algorithm, named the dynamic enterprise network composition algorithm (DENCA, based on a genetic algorithm to solve the enterprise network composition problem. A numerical simulation result is provided to demonstrate the performance of the proposed algorithm.

  8. Sleep/doze controlled dynamic bandwidth allocation algorithms for energy-efficient passive optical networks.

    Science.gov (United States)

    Dias, Maluge Pubuduni Imali; Wong, Elaine

    2013-04-22

    In this work, we present a comparative study of two just-in-time (JIT) dynamic bandwidth allocation algorithms (DBAs), designed to improve the energy-efficiency of the 10 Gbps Ethernet passive optical networks (10G-EPONs). The algorithms, termed just-in-time with varying polling cycle times (JIT) and just-in-time with fixed polling cycle times (J-FIT), are designed to achieve energy-savings when the idle time of an optical network unit (ONU) is less than the sleep-to-active transition time. This is made possible by a vertical-cavity surface-emitting laser (VCSEL) ONU that can transit into sleep or doze modes during its idle time. We evaluate the performance of the algorithms in terms of polling cycle time, power consumption, percentage of energy-savings, and average delay. The energy-efficiency of a VCSEL ONU that can transition into sleep or doze mode is compared to an always-ON distributed feedback (DFB) laser ONU. Simulation results indicate that both JIT and J-FIT DBA algorithms result in improved energy-efficiency whilst J-FIT performs better in terms of energy-savings at low network loads. The J-FIT DBA however, results in increased average delay in comparison to the JIT DBA. Nonetheless, this increase in average delay is within the acceptable range to support the quality of service (QoS) requirements of the next-generation access networks.

  9. A Robust Dynamic Heart-Rate Detection Algorithm Framework During Intense Physical Activities Using Photoplethysmographic Signals

    Directory of Open Access Journals (Sweden)

    Jiajia Song

    2017-10-01

    Full Text Available Dynamic accurate heart-rate (HR estimation using a photoplethysmogram (PPG during intense physical activities is always challenging due to corruption by motion artifacts (MAs. It is difficult to reconstruct a clean signal and extract HR from contaminated PPG. This paper proposes a robust HR-estimation algorithm framework that uses one-channel PPG and tri-axis acceleration data to reconstruct the PPG and calculate the HR based on features of the PPG and spectral analysis. Firstly, the signal is judged by the presence of MAs. Then, the spectral peaks corresponding to acceleration data are filtered from the periodogram of the PPG when MAs exist. Different signal-processing methods are applied based on the amount of remaining PPG spectral peaks. The main MA-removal algorithm (NFEEMD includes the repeated single-notch filter and ensemble empirical mode decomposition. Finally, HR calibration is designed to ensure the accuracy of HR tracking. The NFEEMD algorithm was performed on the 23 datasets from the 2015 IEEE Signal Processing Cup Database. The average estimation errors were 1.12 BPM (12 training datasets, 2.63 BPM (10 testing datasets and 1.87 BPM (all 23 datasets, respectively. The Pearson correlation was 0.992. The experiment results illustrate that the proposed algorithm is not only suitable for HR estimation during continuous activities, like slow running (13 training datasets, but also for intense physical activities with acceleration, like arm exercise (10 testing datasets.

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

    Science.gov (United States)

    Kodali, Anuradha

    In this thesis, we develop dynamic multiple fault diagnosis (DMFD) algorithms to diagnose faults that are sporadic and coupled. Firstly, we formulate a coupled factorial hidden Markov model-based (CFHMM) framework to diagnose dependent faults occurring over time (dynamic case). Here, we implement a mixed memory Markov coupling model to determine the most likely sequence of (dependent) fault states, the one that best explains the observed test outcomes over time. An iterative Gauss-Seidel coordinate ascent optimization method is proposed for solving the problem. A soft Viterbi algorithm is also implemented within the framework for decoding dependent fault states over time. We demonstrate the algorithm on simulated and real-world systems with coupled faults; the results show that this approach improves the correct isolation rate as compared to the formulation where independent fault states are assumed. Secondly, we formulate a generalization of set-covering, termed dynamic set-covering (DSC), which involves a series of coupled set-covering problems over time. The objective of the DSC problem is to infer the most probable time sequence of a parsimonious set of failure sources that explains the observed test outcomes over time. The DSC problem is NP-hard and intractable due to the fault-test dependency matrix that couples the failed tests and faults via the constraint matrix, and the temporal dependence of failure sources over time. Here, the DSC problem is motivated from the viewpoint of a dynamic multiple fault diagnosis problem, but it has wide applications in operations research, for e.g., facility location problem. Thus, we also formulated the DSC problem in the context of a dynamically evolving facility location problem. Here, a facility can be opened, closed, or can be temporarily unavailable at any time for a given requirement of demand points. These activities are associated with costs or penalties, viz., phase-in or phase-out for the opening or closing of a

  11. A memetic algorithm to solve the dynamic multiple runway aircraft landing problem

    Directory of Open Access Journals (Sweden)

    Ghizlane Bencheikh

    2016-01-01

    Full Text Available The aircraft landing problem (ALP consists of scheduling the landing of aircrafts onto the available runways in an airport by assigning to each aircraft a landing time and a specific runway while respecting different operational constraints. This is a complex task for the air traffic controller, especially when the flow of aircrafts entering the radar range is continuous and the number of aircrafts is unknown a priori. In this paper, we study the dynamic version of the ALP when new aircrafts appear over time, which means that the landing of the previous aircrafts should be rescheduled. To solve this problem, we propose a memetic algorithm combining an ant colony algorithm and a local heuristic.

  12. Dynamic connectivity algorithms for Monte Carlo simulations of the random-cluster model

    Science.gov (United States)

    Metin Elçi, Eren; Weigel, Martin

    2014-05-01

    We review Sweeny's algorithm for Monte Carlo simulations of the random cluster model. Straightforward implementations suffer from the problem of computational critical slowing down, where the computational effort per edge operation scales with a power of the system size. By using a tailored dynamic connectivity algorithm we are able to perform all operations with a poly-logarithmic computational effort. This approach is shown to be efficient in keeping online connectivity information and is of use for a number of applications also beyond cluster-update simulations, for instance in monitoring droplet shape transitions. As the handling of the relevant data structures is non-trivial, we provide a Python module with a full implementation for future reference.

  13. A Wavelet Analysis-Based Dynamic Prediction Algorithm to Network Traffic

    Directory of Open Access Journals (Sweden)

    Meng Fan-Bo

    2016-01-01

    Full Text Available Network traffic is a significantly important parameter for network traffic engineering, while it holds highly dynamic nature in the network. Accordingly, it is difficult and impossible to directly predict traffic amount of end-to-end flows. This paper proposes a new prediction algorithm to network traffic using the wavelet analysis. Firstly, network traffic is converted into the time-frequency domain to capture time-frequency feature of network traffic. Secondly, in different frequency components, we model network traffic in the time-frequency domain. Finally, we build the prediction model about network traffic. At the same time, the corresponding prediction algorithm is presented to attain network traffic prediction. Simulation results indicates that our approach is promising.

  14. Dynamic connectivity algorithms for Monte Carlo simulations of the random-cluster model

    International Nuclear Information System (INIS)

    Elçi, Eren Metin; Weigel, Martin

    2014-01-01

    We review Sweeny's algorithm for Monte Carlo simulations of the random cluster model. Straightforward implementations suffer from the problem of computational critical slowing down, where the computational effort per edge operation scales with a power of the system size. By using a tailored dynamic connectivity algorithm we are able to perform all operations with a poly-logarithmic computational effort. This approach is shown to be efficient in keeping online connectivity information and is of use for a number of applications also beyond cluster-update simulations, for instance in monitoring droplet shape transitions. As the handling of the relevant data structures is non-trivial, we provide a Python module with a full implementation for future reference.

  15. Dynamic modeling of genetic networks using genetic algorithm and S-system.

    Science.gov (United States)

    Kikuchi, Shinichi; Tominaga, Daisuke; Arita, Masanori; Takahashi, Katsutoshi; Tomita, Masaru

    2003-03-22

    The modeling of system dynamics of genetic networks, metabolic networks or signal transduction cascades from time-course data is formulated as a reverse-problem. Previous studies focused on the estimation of only network structures, and they were ineffective in inferring a network structure with feedback loops. We previously proposed a method to predict not only the network structure but also its dynamics using a Genetic Algorithm (GA) and an S-system formalism. However, it could predict only a small number of parameters and could rarely obtain essential structures. In this work, we propose a unified extension of the basic method. Notable improvements are as follows: (1) an additional term in its evaluation function that aims at eliminating futile parameters; (2) a crossover method called Simplex Crossover (SPX) to improve its optimization ability; and (3) a gradual optimization strategy to increase the number of predictable parameters. The proposed method is implemented as a C program called PEACE1 (Predictor by Evolutionary Algorithms and Canonical Equations 1). Its performance was compared with the basic method. The comparison showed that: (1) the convergence rate increased about 5-fold; (2) the optimization speed was raised about 1.5-fold; and (3) the number of predictable parameters was increased about 5-fold. Moreover, we successfully inferred the dynamics of a small genetic network constructed with 60 parameters for 5 network variables and feedback loops using only time-course data of gene expression.

  16. A parallel algorithm for transient solid dynamics simulations with contact detection

    International Nuclear Information System (INIS)

    Attaway, S.; Hendrickson, B.; Plimpton, S.; Gardner, D.; Vaughan, C.; Heinstein, M.; Peery, J.

    1996-01-01

    Solid dynamics simulations with Lagrangian finite elements are used to model a wide variety of problems, such as the calculation of impact damage to shipping containers for nuclear waste and the analysis of vehicular crashes. Using parallel computers for these simulations has been hindered by the difficulty of searching efficiently for material surface contacts in parallel. A new parallel algorithm for calculation of arbitrary material contacts in finite element simulations has been developed and implemented in the PRONTO3D transient solid dynamics code. This paper will explore some of the issues involved in developing efficient, portable, parallel finite element models for nonlinear transient solid dynamics simulations. The contact-detection problem poses interesting challenges for efficient implementation of a solid dynamics simulation on a parallel computer. The finite element mesh is typically partitioned so that each processor owns a localized region of the finite element mesh. This mesh partitioning is optimal for the finite element portion of the calculation since each processor must communicate only with the few connected neighboring processors that share boundaries with the decomposed mesh. However, contacts can occur between surfaces that may be owned by any two arbitrary processors. Hence, a global search across all processors is required at every time step to search for these contacts. Load-imbalance can become a problem since the finite element decomposition divides the volumetric mesh evenly across processors but typically leaves the surface elements unevenly distributed. In practice, these complications have been limiting factors in the performance and scalability of transient solid dynamics on massively parallel computers. In this paper the authors present a new parallel algorithm for contact detection that overcomes many of these limitations

  17. Dynamics analysis of electrodynamic satellite tethers. Equations of motion and numerical solution algorithms for the tether

    Science.gov (United States)

    Nacozy, P. E.

    1984-01-01

    The equations of motion are developed for a perfectly flexible, inelastic tether with a satellite at its extremity. The tether is attached to a space vehicle in orbit. The tether is allowed to possess electrical conductivity. A numerical solution algorithm to provide the motion of the tether and satellite system is presented. The resulting differential equations can be solved by various existing standard numerical integration computer programs. The resulting differential equations allow the introduction of approximations that can lead to analytical, approximate general solutions. The differential equations allow more dynamical insight of the motion.

  18. A Temporal Domain Decomposition Algorithmic Scheme for Large-Scale Dynamic Traffic Assignment

    Directory of Open Access Journals (Sweden)

    Eric J. Nava

    2012-03-01

    This paper presents a temporal decomposition scheme for large spatial- and temporal-scale dynamic traffic assignment, in which the entire analysis period is divided into Epochs. Vehicle assignment is performed sequentially in each Epoch, thus improving the model scalability and confining the peak run-time memory requirement regardless of the total analysis period. A proposed self-turning scheme adaptively searches for the run-time-optimal Epoch setting during iterations regardless of the characteristics of the modeled network. Extensive numerical experiments confirm the promising performance of the proposed algorithmic schemes.

  19. Generation of initial stepping pattern of a biped robot with modular dynamic encoding algorithm for searches

    Science.gov (United States)

    Kim, Taegyu; Kim, Jong-Wook

    2007-12-01

    In this paper, a modified version of dynamic encoding algorithm for searches (DEAS) is proposed and applied to generate walking patterns of a biped humanoid robot. For the controller of each joint motor to generate optimal trajectories, mDEAS is developed from the previous versions of exhaustive DEAS (eDEAS) and univariate DEAS (uDEAS). Modular DEAS (mDEAS) searches optimal coefficients of polynomials whose trajectories are assigned to joint motors. Since the number of the coefficients amounts up to 16, sharing search space and optimizing independently is expected to search efficiently. For validation of mDEAS, a simulation result about initial stepping is provided.

  20. Optimisation of Offshore Wind Farm Cable Connection Layout Considering Levelised Production Cost Using Dynamic Minimum Spanning Tree Algorithm

    DEFF Research Database (Denmark)

    Hou, Peng; Hu, Weihao; Chen, Cong

    2016-01-01

    The approach in this paper hads been developed to optimize the cable connection layout of large scale offshore wind farms. The objective is to minimize the Levelised Production Cost (LPC) og an offshore wind farm by optimizing the cable connection configuration. Based on the minimum spanning tree...... (MST) algorithm, an improved algorithm, the Dynamic Minimum Spanning Tree (DMST) algorithm is proposed. The current carrying capacity of the cable is considered to be the main constraint and the cable sectional area is changed dynamically. An irregular shaped wind farm is chosen as the studie case...

  1. Field programmable gate array (FPGA) implementation of dynamic compensation (DyCom) algorithm for vanadium self-powered neutron detectors

    International Nuclear Information System (INIS)

    Das, A.; Dixit, M.Y.; Das, D.; Kulkarni, C.P.; Chaganty, S.P.; Kataria, S.K.; Ramachandiran, V.

    2003-01-01

    Full text: A new on-line digital signal processing (DSP) based Dynamic Compensation (DyCom) algorithm has been developed [Das 1999] to speed-up the response time of slow-responding Vanadium self-powered neutron detectors. The algorithm is based on the principles of direct inversion and on-line nonlinear (median) filtering. The algorithm was tested at different research and power reactors on a PC based platform with encouraging results [Das 2001]. This paper discusses the stand-alone FPGA implementation of the DyCom algorithm with the experimental results obtained with prototype FPGA boards

  2. The solution of the Elrod algorithm for a dynamically loaded journal bearing using multigrid techniques

    Science.gov (United States)

    Woods, C. M.; Brewe, D. E.

    1989-01-01

    A numerical solution to a theoretical model of vapor cavitation in a dynamically loaded journal bearing is developed utilizing a multigrid iteration technique. The method is compared with a noniterative approach in terms of computational time and accuracy. The computational model is based on the Elrod algorithm, a control volume approach to the Reynolds equation which mimics the Jakobsson-Floberg and Olsson cavitation theory. Besides accounting for a moving cavitation boundary and conservation of mass at the boundary, it also conserves mass within the cavitated region via a smeared mass or striated flow extending to both surfaces in the film gap. The mixed nature of the equations (parabolic in the full film zone and hyperbolic in the cavitated zone) coupled with the dynamic aspects of the problem create interesting difficulties for the present solution approach. Emphasis is placed on the methods found to eliminate solution instabilities. Excellent results are obtained for both accuracy and reduction of computational time.

  3. Imperialist Competitive Algorithm with Dynamic Parameter Adaptation Using Fuzzy Logic Applied to the Optimization of Mathematical Functions

    Directory of Open Access Journals (Sweden)

    Emer Bernal

    2017-01-01

    Full Text Available In this paper we are presenting a method using fuzzy logic for dynamic parameter adaptation in the imperialist competitive algorithm, which is usually known by its acronym ICA. The ICA algorithm was initially studied in its original form to find out how it works and what parameters have more effect upon its results. Based on this study, several designs of fuzzy systems for dynamic adjustment of the ICA parameters are proposed. The experiments were performed on the basis of solving complex optimization problems, particularly applied to benchmark mathematical functions. A comparison of the original imperialist competitive algorithm and our proposed fuzzy imperialist competitive algorithm was performed. In addition, the fuzzy ICA was compared with another metaheuristic using a statistical test to measure the advantage of the proposed fuzzy approach for dynamic parameter adaptation.

  4. A composite experimental dynamic substructuring method based on partitioned algorithms and localized Lagrange multipliers

    Science.gov (United States)

    Abbiati, Giuseppe; La Salandra, Vincenzo; Bursi, Oreste S.; Caracoglia, Luca

    2018-02-01

    Successful online hybrid (numerical/physical) dynamic substructuring simulations have shown their potential in enabling realistic dynamic analysis of almost any type of non-linear structural system (e.g., an as-built/isolated viaduct, a petrochemical piping system subjected to non-stationary seismic loading, etc.). Moreover, owing to faster and more accurate testing equipment, a number of different offline experimental substructuring methods, operating both in time (e.g. the impulse-based substructuring) and frequency domains (i.e. the Lagrange multiplier frequency-based substructuring), have been employed in mechanical engineering to examine dynamic substructure coupling. Numerous studies have dealt with the above-mentioned methods and with consequent uncertainty propagation issues, either associated with experimental errors or modelling assumptions. Nonetheless, a limited number of publications have systematically cross-examined the performance of the various Experimental Dynamic Substructuring (EDS) methods and the possibility of their exploitation in a complementary way to expedite a hybrid experiment/numerical simulation. From this perspective, this paper performs a comparative uncertainty propagation analysis of three EDS algorithms for coupling physical and numerical subdomains with a dual assembly approach based on localized Lagrange multipliers. The main results and comparisons are based on a series of Monte Carlo simulations carried out on a five-DoF linear/non-linear chain-like systems that include typical aleatoric uncertainties emerging from measurement errors and excitation loads. In addition, we propose a new Composite-EDS (C-EDS) method to fuse both online and offline algorithms into a unique simulator. Capitalizing from the results of a more complex case study composed of a coupled isolated tank-piping system, we provide a feasible way to employ the C-EDS method when nonlinearities and multi-point constraints are present in the emulated system.

  5. FPGA implementation of dynamic channel assignment algorithm for cognitive wireless sensor networks

    Science.gov (United States)

    Martínez, Daniela M.; Andrade, Ángel G.

    2015-07-01

    The reliability of wireless sensor networks (WSNs) in industrial applications can be thwarted due to multipath fading, noise generated by industrial equipment or heavy machinery and particularly by the interference generated from other wireless devices operating in the same spectrum band. Recently, cognitive WSNs (CWSNs) were proposed to improve the performance and reliability of WSNs in highly interfered and noisy environments. In this class of WSN, the nodes are spectrum aware, that is, they monitor the radio spectrum to find channels available for data transmission and dynamically assign and reassign nodes to low-interference condition channels. In this work, we present the implementation of a channel assignment algorithm in a field-programmable gate array, which dynamically assigns channels to sensor nodes based on the interference and noise levels experimented in the network. From the results obtained from the performance evaluation of the CWSN when the channel assignment algorithm is considered, it is possible to identify how many channels should be available in the network in order to achieve a desired percentage of successful transmissions, subject to constraints on the signal-to-interference plus noise ratio on each active link.

  6. Multiple Time-Step Dual-Hamiltonian Hybrid Molecular Dynamics - Monte Carlo Canonical Propagation Algorithm.

    Science.gov (United States)

    Chen, Yunjie; Kale, Seyit; Weare, Jonathan; Dinner, Aaron R; Roux, Benoît

    2016-04-12

    A multiple time-step integrator based on a dual Hamiltonian and a hybrid method combining molecular dynamics (MD) and Monte Carlo (MC) is proposed to sample systems in the canonical ensemble. The Dual Hamiltonian Multiple Time-Step (DHMTS) algorithm is based on two similar Hamiltonians: a computationally expensive one that serves as a reference and a computationally inexpensive one to which the workload is shifted. The central assumption is that the difference between the two Hamiltonians is slowly varying. Earlier work has shown that such dual Hamiltonian multiple time-step schemes effectively precondition nonlinear differential equations for dynamics by reformulating them into a recursive root finding problem that can be solved by propagating a correction term through an internal loop, analogous to RESPA. Of special interest in the present context, a hybrid MD-MC version of the DHMTS algorithm is introduced to enforce detailed balance via a Metropolis acceptance criterion and ensure consistency with the Boltzmann distribution. The Metropolis criterion suppresses the discretization errors normally associated with the propagation according to the computationally inexpensive Hamiltonian, treating the discretization error as an external work. Illustrative tests are carried out to demonstrate the effectiveness of the method.

  7. Battery available power prediction of hybrid electric vehicle based on improved Dynamic Matrix Control algorithms

    Science.gov (United States)

    Wang, Limei; Cheng, Yong; Zou, Ju

    2014-09-01

    The core technology to any hybrid engine vehicle (HEV) is the design of energy management strategy (EMS). To develop a reasonable EMS, it is necessary to monitor the state of capacity, state of health and instantaneous available power of battery packs. A new method that linearizes RC equivalent circuit model and predicts battery available power according to original Dynamic Matrix Control algorithm is proposed. To verify the validity of the new algorithm, a bench test with lithium-ion battery cell and a HEV test with lithium-ion battery packs are carried out. The bench test results indicate that a single RC block equivalent circuit model could be used to describe the dynamic and the steady state characteristics of a battery under testing conditions. However, lacking of long time constant of RC modules, there is a sample deviation in the open-circuit voltage identified and that measured. The HEV testing results show that the battery voltage predicted is in good agreement with that measured, the maximum difference is within 3.7%. Fixing the time constant to a numeric value, satisfactory results can still be achieved. After setting a battery discharge cut-off voltage, the instantaneous available power of the battery can be predicted.

  8. New MPPT algorithm for PV applications based on hybrid dynamical approach

    KAUST Repository

    Elmetennani, Shahrazed

    2016-10-24

    This paper proposes a new Maximum Power Point Tracking (MPPT) algorithm for photovoltaic applications using the multicellular converter as a stage of power adaptation. The proposed MPPT technique has been designed using a hybrid dynamical approach to model the photovoltaic generator. The hybrid dynamical theory has been applied taking advantage of the particular topology of the multicellular converter. Then, a hybrid automata has been established to optimize the power production. The maximization of the produced solar energy is achieved by switching between the different operative modes of the hybrid automata, which is conditioned by some invariance and transition conditions. These conditions have been validated by simulation tests under different conditions of temperature and irradiance. Moreover, the performance of the proposed algorithm has been then evaluated by comparison with standard MPPT techniques numerically and by experimental tests under varying external working conditions. The results have shown the interesting features that the hybrid MPPT technique presents in terms of performance and simplicity for real time implementation.

  9. A multispin algorithm for the Kob-Andersen stochastic dynamics on regular lattices

    Science.gov (United States)

    Boccagna, Roberto

    2017-07-01

    The aim of the paper is to propose an algorithm based on the Multispin Coding technique for the Kob-Andersen glassy dynamics. We first give motivations to speed up the numerical simulation in the context of spin glass models [M. Mezard, G. Parisi, M. Virasoro, Spin Glass Theory and Beyond (World Scientific, Singapore, 1987)]; after defining the Markovian dynamics as in [W. Kob, H.C. Andersen, Phys. Rev. E 48, 4364 (1993)] as well as the related interesting observables, we extend it to the more general framework of random regular graphs, listing at the same time some known analytical results [C. Toninelli, G. Biroli, D.S. Fisher, J. Stat. Phys. 120, 167 (2005)]. The purpose of this work is a dual one; firstly, we describe how bitwise operators can be used to build up the algorithm by carefully exploiting the way data are stored on a computer. Since it was first introduced [M. Creutz, L. Jacobs, C. Rebbi, Phys. Rev. D 20, 1915 (1979); C. Rebbi, R.H. Swendsen, Phys. Rev. D 21, 4094 (1980)], this technique has been widely used to perform Monte Carlo simulations for Ising and Potts spin systems; however, it can be successfully adapted to more complex systems in which microscopic parameters may assume boolean values. Secondly, we introduce a random graph in which a characteristic parameter allows to tune the possible transition point. A consistent part is devoted to listing the numerical results obtained by running numerical simulations.

  10. Algorithm of dynamic regulation of a system of duct, for a high accuracy climatic system

    Science.gov (United States)

    Arbatskiy, A. A.; Afonina, G. N.; Glazov, V. S.

    2017-11-01

    Currently, major part of climatic system, are stationary in projected mode only. At the same time, many modern industrial sites, require constant or periodical changes in technological process. That is 80% of the time, the industrial site is not require ventilation system in projected mode and high precision of climatic parameters must maintain. While that not constantly is in use for climatic systems, which use in parallel for different rooms, we will be have a problem for balance of duct system. For this problem, was created the algorithm for quantity regulation, with minimal changes. Dynamic duct system: Developed of parallel control system of air balance, with high precision of climatic parameters. The Algorithm provide a permanent pressure in main duct, in different a flow of air. Therefore, the ending devises air flow have only one parameter for regulation - flaps open area. Precision of regulation increase and the climatic system provide high precision for temperature and humidity (0,5C for temperature, 5% for relative humidity). Result: The research has been made in CFD-system - PHOENICS. Results for velocity of air in duct, for pressure of air in duct for different operation mode, has been obtained. Equation for air valves positions, with different parameters for climate in room’s, has been obtained. Energy saving potential for dynamic duct system, for different types of a rooms, has been calculated.

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

    Directory of Open Access Journals (Sweden)

    Zhongbin Wang

    2016-01-01

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

  12. A dynamics and control algorithm for low Earth orbit precision formation flying satellites

    Science.gov (United States)

    Eyer, Jesse Koovik

    An innovative dynamics and control algorithm is developed for a dual-nanosatellite formation flying mission. The principal function of this algorithm is to use regular GPS state measurements to determine the controlled satellite's tracking error from a set of reference trajectories in the local-vertical/local-horizontal reference frame. A linear state-feedback control law---designed using a linear quadratic regulator method---calculates the optimal thrusts necessary to correct this error and communicates the thrust directions to the attitude control system and the thrust durations to the propulsion system. The control system is developed to minimize the conflicting metrics of tracking error and DeltaV requirements. To reconfigure the formation, an optimization algorithm is designed using the analytical solution to the state-space equation and the Hill-Clohessy-Wiltshire state transition matrix to solve for dual-thrust reconfiguration maneuvers. The resulting trajectories require low DeltaV, use finite-time thrusts and are accurate in a fully nonlinear orbital environment. This algorithm will be used to control the CanX-4&5 formation flying demonstration mission. In addition, an iterative method which numerically generates quasi periodic trajectories for a satellite formation is presented. This novel technique utilizes a shooting approach to the Newton method to close the relative deputy trajectory over a specific number of orbits, then fits the actual perturbed motion of the deputy with a Fourier series to enforce periodicity. This process is applied to two well-known satellite formations: a projected circular orbit and a J2-invariant formation. Compared to conventional formations, these resulting quasi-periodic trajectories require a dramatically lower control effort to maintain and could therefore be used to extend DeltaV-limited formation flying missions. Finally, an analytical study of the stability of the formation flying algorithm is conducted. To facilitate

  13. A divide-conquer-recombine algorithmic paradigm for large spatiotemporal quantum molecular dynamics simulations

    Science.gov (United States)

    Shimojo, Fuyuki; Hattori, Shinnosuke; Kalia, Rajiv K.; Kunaseth, Manaschai; Mou, Weiwei; Nakano, Aiichiro; Nomura, Ken-ichi; Ohmura, Satoshi; Rajak, Pankaj; Shimamura, Kohei; Vashishta, Priya

    2014-05-01

    We introduce an extension of the divide-and-conquer (DC) algorithmic paradigm called divide-conquer-recombine (DCR) to perform large quantum molecular dynamics (QMD) simulations on massively parallel supercomputers, in which interatomic forces are computed quantum mechanically in the framework of density functional theory (DFT). In DCR, the DC phase constructs globally informed, overlapping local-domain solutions, which in the recombine phase are synthesized into a global solution encompassing large spatiotemporal scales. For the DC phase, we design a lean divide-and-conquer (LDC) DFT algorithm, which significantly reduces the prefactor of the O(N) computational cost for N electrons by applying a density-adaptive boundary condition at the peripheries of the DC domains. Our globally scalable and locally efficient solver is based on a hybrid real-reciprocal space approach that combines: (1) a highly scalable real-space multigrid to represent the global charge density; and (2) a numerically efficient plane-wave basis for local electronic wave functions and charge density within each domain. Hybrid space-band decomposition is used to implement the LDC-DFT algorithm on parallel computers. A benchmark test on an IBM Blue Gene/Q computer exhibits an isogranular parallel efficiency of 0.984 on 786 432 cores for a 50.3 × 106-atom SiC system. As a test of production runs, LDC-DFT-based QMD simulation involving 16 661 atoms is performed on the Blue Gene/Q to study on-demand production of hydrogen gas from water using LiAl alloy particles. As an example of the recombine phase, LDC-DFT electronic structures are used as a basis set to describe global photoexcitation dynamics with nonadiabatic QMD (NAQMD) and kinetic Monte Carlo (KMC) methods. The NAQMD simulations are based on the linear response time-dependent density functional theory to describe electronic excited states and a surface-hopping approach to describe transitions between the excited states. A series of techniques

  14. A divide-conquer-recombine algorithmic paradigm for large spatiotemporal quantum molecular dynamics simulations

    International Nuclear Information System (INIS)

    Shimojo, Fuyuki; Hattori, Shinnosuke; Kalia, Rajiv K.; Mou, Weiwei; Nakano, Aiichiro; Nomura, Ken-ichi; Rajak, Pankaj; Vashishta, Priya; Kunaseth, Manaschai; Ohmura, Satoshi; Shimamura, Kohei

    2014-01-01

    We introduce an extension of the divide-and-conquer (DC) algorithmic paradigm called divide-conquer-recombine (DCR) to perform large quantum molecular dynamics (QMD) simulations on massively parallel supercomputers, in which interatomic forces are computed quantum mechanically in the framework of density functional theory (DFT). In DCR, the DC phase constructs globally informed, overlapping local-domain solutions, which in the recombine phase are synthesized into a global solution encompassing large spatiotemporal scales. For the DC phase, we design a lean divide-and-conquer (LDC) DFT algorithm, which significantly reduces the prefactor of the O(N) computational cost for N electrons by applying a density-adaptive boundary condition at the peripheries of the DC domains. Our globally scalable and locally efficient solver is based on a hybrid real-reciprocal space approach that combines: (1) a highly scalable real-space multigrid to represent the global charge density; and (2) a numerically efficient plane-wave basis for local electronic wave functions and charge density within each domain. Hybrid space-band decomposition is used to implement the LDC-DFT algorithm on parallel computers. A benchmark test on an IBM Blue Gene/Q computer exhibits an isogranular parallel efficiency of 0.984 on 786 432 cores for a 50.3 × 10 6 -atom SiC system. As a test of production runs, LDC-DFT-based QMD simulation involving 16 661 atoms is performed on the Blue Gene/Q to study on-demand production of hydrogen gas from water using LiAl alloy particles. As an example of the recombine phase, LDC-DFT electronic structures are used as a basis set to describe global photoexcitation dynamics with nonadiabatic QMD (NAQMD) and kinetic Monte Carlo (KMC) methods. The NAQMD simulations are based on the linear response time-dependent density functional theory to describe electronic excited states and a surface-hopping approach to describe transitions between the excited states. A series of

  15. An FDTD algorithm for simulation of EM waves propagation in laser with static and dynamic gain models

    KAUST Repository

    Al-Jabr, Ahmad Ali

    2013-01-01

    This paper presents methods of simulating gain media in the finite difference time-domain (FDTD) algorithm utilizing a generalized polarization formulation. The gain can be static or dynamic. For static gain, Lorentzian and non-Lorentzian models are presented and tested. For the dynamic gain, rate equations for two-level and four-level models are incorporated in the FDTD scheme. The simulation results conform with the expected behavior of wave amplification and dynamic population inversion.

  16. Graphics Processing Unit–Enhanced Genetic Algorithms for Solving the Temporal Dynamics of Gene Regulatory Networks

    Science.gov (United States)

    García-Calvo, Raúl; Guisado, JL; Diaz-del-Rio, Fernando; Córdoba, Antonio; Jiménez-Morales, Francisco

    2018-01-01

    Understanding the regulation of gene expression is one of the key problems in current biology. A promising method for that purpose is the determination of the temporal dynamics between known initial and ending network states, by using simple acting rules. The huge amount of rule combinations and the nonlinear inherent nature of the problem make genetic algorithms an excellent candidate for finding optimal solutions. As this is a computationally intensive problem that needs long runtimes in conventional architectures for realistic network sizes, it is fundamental to accelerate this task. In this article, we study how to develop efficient parallel implementations of this method for the fine-grained parallel architecture of graphics processing units (GPUs) using the compute unified device architecture (CUDA) platform. An exhaustive and methodical study of various parallel genetic algorithm schemes—master-slave, island, cellular, and hybrid models, and various individual selection methods (roulette, elitist)—is carried out for this problem. Several procedures that optimize the use of the GPU’s resources are presented. We conclude that the implementation that produces better results (both from the performance and the genetic algorithm fitness perspectives) is simulating a few thousands of individuals grouped in a few islands using elitist selection. This model comprises 2 mighty factors for discovering the best solutions: finding good individuals in a short number of generations, and introducing genetic diversity via a relatively frequent and numerous migration. As a result, we have even found the optimal solution for the analyzed gene regulatory network (GRN). In addition, a comparative study of the performance obtained by the different parallel implementations on GPU versus a sequential application on CPU is carried out. In our tests, a multifold speedup was obtained for our optimized parallel implementation of the method on medium class GPU over an equivalent

  17. Graphics Processing Unit-Enhanced Genetic Algorithms for Solving the Temporal Dynamics of Gene Regulatory Networks.

    Science.gov (United States)

    García-Calvo, Raúl; Guisado, J L; Diaz-Del-Rio, Fernando; Córdoba, Antonio; Jiménez-Morales, Francisco

    2018-01-01

    Understanding the regulation of gene expression is one of the key problems in current biology. A promising method for that purpose is the determination of the temporal dynamics between known initial and ending network states, by using simple acting rules. The huge amount of rule combinations and the nonlinear inherent nature of the problem make genetic algorithms an excellent candidate for finding optimal solutions. As this is a computationally intensive problem that needs long runtimes in conventional architectures for realistic network sizes, it is fundamental to accelerate this task. In this article, we study how to develop efficient parallel implementations of this method for the fine-grained parallel architecture of graphics processing units (GPUs) using the compute unified device architecture (CUDA) platform. An exhaustive and methodical study of various parallel genetic algorithm schemes-master-slave, island, cellular, and hybrid models, and various individual selection methods (roulette, elitist)-is carried out for this problem. Several procedures that optimize the use of the GPU's resources are presented. We conclude that the implementation that produces better results (both from the performance and the genetic algorithm fitness perspectives) is simulating a few thousands of individuals grouped in a few islands using elitist selection. This model comprises 2 mighty factors for discovering the best solutions: finding good individuals in a short number of generations, and introducing genetic diversity via a relatively frequent and numerous migration. As a result, we have even found the optimal solution for the analyzed gene regulatory network (GRN). In addition, a comparative study of the performance obtained by the different parallel implementations on GPU versus a sequential application on CPU is carried out. In our tests, a multifold speedup was obtained for our optimized parallel implementation of the method on medium class GPU over an equivalent

  18. Designs and Algorithms to Map Eye Tracking Data with Dynamic Multielement Moving Objects.

    Science.gov (United States)

    Kang, Ziho; Mandal, Saptarshi; Crutchfield, Jerry; Millan, Angel; McClung, Sarah N

    2016-01-01

    Design concepts and algorithms were developed to address the eye tracking analysis issues that arise when (1) participants interrogate dynamic multielement objects that can overlap on the display and (2) visual angle error of the eye trackers is incapable of providing exact eye fixation coordinates. These issues were addressed by (1) developing dynamic areas of interests (AOIs) in the form of either convex or rectangular shapes to represent the moving and shape-changing multielement objects, (2) introducing the concept of AOI gap tolerance (AGT) that controls the size of the AOIs to address the overlapping and visual angle error issues, and (3) finding a near optimal AGT value. The approach was tested in the context of air traffic control (ATC) operations where air traffic controller specialists (ATCSs) interrogated multiple moving aircraft on a radar display to detect and control the aircraft for the purpose of maintaining safe and expeditious air transportation. In addition, we show how eye tracking analysis results can differ based on how we define dynamic AOIs to determine eye fixations on moving objects. The results serve as a framework to more accurately analyze eye tracking data and to better support the analysis of human performance.

  19. Designs and Algorithms to Map Eye Tracking Data with Dynamic Multielement Moving Objects

    Directory of Open Access Journals (Sweden)

    Ziho Kang

    2016-01-01

    Full Text Available Design concepts and algorithms were developed to address the eye tracking analysis issues that arise when (1 participants interrogate dynamic multielement objects that can overlap on the display and (2 visual angle error of the eye trackers is incapable of providing exact eye fixation coordinates. These issues were addressed by (1 developing dynamic areas of interests (AOIs in the form of either convex or rectangular shapes to represent the moving and shape-changing multielement objects, (2 introducing the concept of AOI gap tolerance (AGT that controls the size of the AOIs to address the overlapping and visual angle error issues, and (3 finding a near optimal AGT value. The approach was tested in the context of air traffic control (ATC operations where air traffic controller specialists (ATCSs interrogated multiple moving aircraft on a radar display to detect and control the aircraft for the purpose of maintaining safe and expeditious air transportation. In addition, we show how eye tracking analysis results can differ based on how we define dynamic AOIs to determine eye fixations on moving objects. The results serve as a framework to more accurately analyze eye tracking data and to better support the analysis of human performance.

  20. STEADY ESTIMATION ALGORITHMS OF THE DYNAMIC SYSTEMS CONDITION ON THE BASIS OF CONCEPTS OF THE ADAPTIVE FILTRATION AND CONTROL

    Directory of Open Access Journals (Sweden)

    H.Z. Igamberdiyev

    2014-07-01

    Full Text Available Dynamic systems condition estimation regularization algorithms in the conditions of signals and hindrances statistical characteristics aprioristic uncertainty are offered. Regular iterative algorithms of strengthening matrix factor elements of the Kalman filter, allowing to adapt the filter to changing hindrance-alarm conditions are developed. Steady adaptive estimation algorithms of a condition vector in the aprioristic uncertainty conditions of covariance matrixes of object noise and the measurements hindrances providing a certain roughness of filtration process in relation to changing statistical characteristics of signals information parameters are offered. Offered practical realization results of the dynamic systems condition estimation algorithms are given at the adaptive management systems synthesis problems solution by technological processes of granulation drying of an ammophos pulp and receiving ammonia.

  1. Impact of different disassembly line balancing algorithms on the performance of dynamic kanban system for disassembly line

    Science.gov (United States)

    Kizilkaya, Elif A.; Gupta, Surendra M.

    2005-11-01

    In this paper, we compare the impact of different disassembly line balancing (DLB) algorithms on the performance of our recently introduced Dynamic Kanban System for Disassembly Line (DKSDL) to accommodate the vagaries of uncertainties associated with disassembly and remanufacturing processing. We consider a case study to illustrate the impact of various DLB algorithms on the DKSDL. The approach to the solution, scenario settings, results and the discussions of the results are included.

  2. A new multiple robot path planning algorithm: dynamic distributed particle swarm optimization.

    Science.gov (United States)

    Ayari, Asma; Bouamama, Sadok

    2017-01-01

    Multiple robot systems have become a major study concern in the field of robotic research. Their control becomes unreliable and even infeasible if the number of robots increases. In this paper, a new dynamic distributed particle swarm optimization (D 2 PSO) algorithm is proposed for trajectory path planning of multiple robots in order to find collision-free optimal path for each robot in the environment. The proposed approach consists in calculating two local optima detectors, LOD pBest and LOD gBest . Particles which are unable to improve their personal best and global best for predefined number of successive iterations would be replaced with restructured ones. Stagnation and local optima problems would be avoided by adding diversity to the population, without losing the fast convergence characteristic of PSO. Experiments with multiple robots are provided and proved effectiveness of such approach compared with the distributed PSO.

  3. Multi-robot path planning in a dynamic environment using improved gravitational search algorithm

    Directory of Open Access Journals (Sweden)

    P.K. Das

    2016-09-01

    Full Text Available This paper proposes a new methodology to optimize trajectory of the path for multi-robots using improved gravitational search algorithm (IGSA in a dynamic environment. GSA is improved based on memory information, social, cognitive factor of PSO (particle swarm optimization and then, population for next generation is decided by the greedy strategy. A path planning scheme has been developed using IGSA to optimally obtain the succeeding positions of the robots from the existing position. Finally, the analytical and experimental results of the multi-robot path planning have been compared with those obtained by IGSA, GSA and PSO in a similar environment. The simulation and the Khepera environmental results outperform IGSA as compared to GSA and PSO with respect to performance matrix.

  4. Analysis of Shooting Consistency in Archers: A Dynamic Time Warping Algorithm-Based Approach

    Directory of Open Access Journals (Sweden)

    Cheng-Hao Quan

    2017-01-01

    Full Text Available The shooting consistency of an archer is commonly perceived to be an important determinant of successful scores. Four (n=4 elementary level archers from a middle school in Korea participated in this study. In order to quantify shooting consistency, movement of the bow forearm was measured with an inertia sensor during archery shooting. The shooting consistency was calculated and defined by the dynamic time warping (DTW algorithm as the distance between two time sequences of acceleration data. Small distance values indicate that the archer has maintained high-level shooting consistency while archery shooting repetitively. To verify the shooting consistency metric, the relationship between scores and shooting consistency is evaluated. The results show that the higher the scores achieved by the archer, the higher is the level of shooting consistency demonstrated.

  5. Transmission Expansion Planning – A Multiyear Dynamic Approach Using a Discrete Evolutionary Particle Swarm Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Saraiva J. T.

    2012-10-01

    Full Text Available The basic objective of Transmission Expansion Planning (TEP is to schedule a number of transmission projects along an extended planning horizon minimizing the network construction and operational costs while satisfying the requirement of delivering power safely and reliably to load centres along the horizon. This principle is quite simple, but the complexity of the problem and the impact on society transforms TEP on a challenging issue. This paper describes a new approach to solve the dynamic TEP problem, based on an improved discrete integer version of the Evolutionary Particle Swarm Optimization (EPSO meta-heuristic algorithm. The paper includes sections describing in detail the EPSO enhanced approach, the mathematical formulation of the TEP problem, including the objective function and the constraints, and a section devoted to the application of the developed approach to this problem. Finally, the use of the developed approach is illustrated using a case study based on the IEEE 24 bus 38 branch test system.

  6. Hybrid Electromagnetism-Like Algorithm for Dynamic Supply Chain Network Design under Traffic Congestion and Uncertainty

    Directory of Open Access Journals (Sweden)

    Javid Jouzdani

    2016-01-01

    Full Text Available With the constantly increasing pressure of the competitive environment, supply chain (SC decision makers are forced to consider several aspects of business climate. More specifically, they should take into account the endogenous features (e.g., available means of transportation, and the variety of products and exogenous criteria (e.g., the environmental uncertainty, and transportation system conditions. In this paper, a mixed integer nonlinear programming (MINLP model for dynamic design of a supply chain network is proposed. In this model, multiple products and multiple transportation modes, the time value of money, traffic congestion, and both supply-side and demand-side uncertainties are considered. Due to the complexity of such models, conventional solution methods are not applicable; therefore, two hybrid Electromagnetism-Like Algorithms (EMA are designed and discussed for tackling the problem. The numerical results show the applicability of the proposed model and the capabilities of the solution approaches to the MINLP problem.

  7. Dynamic Programming Algorithm for Generation of Optimal Elimination Trees for Multi-frontal Direct Solver Over H-refined Grids

    KAUST Repository

    AbouEisha, Hassan M.

    2014-06-06

    In this paper we present a dynamic programming algorithm for finding optimal elimination trees for computational grids refined towards point or edge singularities. The elimination tree is utilized to guide the multi-frontal direct solver algorithm. Thus, the criterion for the optimization of the elimination tree is the computational cost associated with the multi-frontal solver algorithm executed over such tree. We illustrate the paper with several examples of optimal trees found for grids with point, isotropic edge and anisotropic edge mixed with point singularity. We show the comparison of the execution time of the multi-frontal solver algorithm with results of MUMPS solver with METIS library, implementing the nested dissection algorithm.

  8. Computational Intelligence Based Data Fusion Algorithm for Dynamic sEMG and Skeletal Muscle Force Modelling

    Energy Technology Data Exchange (ETDEWEB)

    Chandrasekhar Potluri,; Madhavi Anugolu; Marco P. Schoen; D. Subbaram Naidu

    2013-08-01

    In this work, an array of three surface Electrography (sEMG) sensors are used to acquired muscle extension and contraction signals for 18 healthy test subjects. The skeletal muscle force is estimated using the acquired sEMG signals and a Non-linear Wiener Hammerstein model, relating the two signals in a dynamic fashion. The model is obtained from using System Identification (SI) algorithm. The obtained force models for each sensor are fused using a proposed fuzzy logic concept with the intent to improve the force estimation accuracy and resilience to sensor failure or misalignment. For the fuzzy logic inference system, the sEMG entropy, the relative error, and the correlation of the force signals are considered for defining the membership functions. The proposed fusion algorithm yields an average of 92.49% correlation between the actual force and the overall estimated force output. In addition, the proposed fusionbased approach is implemented on a test platform. Experiments indicate an improvement in finger/hand force estimation.

  9. The assets-based approach: furthering a neoliberal agenda or rediscovering the old public health? A critical examination of practitioner discourses.

    Science.gov (United States)

    Roy, Michael J

    2017-08-08

    The 'assets-based approach' to health and well-being has, on the one hand, been presented as a potentially empowering means to address the social determinants of health while, on the other, been criticised for obscuring structural drivers of inequality and encouraging individualisation and marketisation; in essence, for being a tool of neoliberalism. This study looks at how this apparent contestation plays out in practice through a critical realist-inspired examination of practitioner discourses, specifically of those working within communities to address social vulnerabilities that we know impact upon health. The study finds that practitioners interact with the assets-based policy discourse in interesting ways. Rather than unwitting tools of neoliberalism, they considered their work to be about mitigating the worst effects of poverty and social vulnerability in ways that enhance collectivism and solidarity, concepts that neoliberalism arguably seeks to disrupt. Furthermore, rather than a different, innovative, way of working, they consider the assets-based approach to simply be a re-labelling of what they have been doing anyway, for as long as they can remember. So, for practitioners, rather than a 'new' approach to public health, the assets-based public health movement seems to be a return to recognising and appreciating the role of community within public health policy and practice; ideals that predate neoliberalism by quite some considerable time.

  10. A UWB/Improved PDR Integration Algorithm Applied to Dynamic Indoor Positioning for Pedestrians.

    Science.gov (United States)

    Chen, Pengzhan; Kuang, Ye; Chen, Xiaoyue

    2017-09-08

    Inertial sensors are widely used in various applications, such as human motion monitoring and pedestrian positioning. However, inertial sensors cannot accurately define the process of human movement, a limitation that causes data drift in the process of human body positioning, thus seriously affecting positioning accuracy and stability. The traditional pedestrian dead-reckoning algorithm, which is based on a single inertial measurement unit, can suppress the data drift, but fails to accurately calculate the number of walking steps and heading value, thus it cannot meet the application requirements. This study proposes an indoor dynamic positioning method with an error self-correcting function based on the symmetrical characteristics of human motion to obtain the definition basis of human motion process quickly and to solve the abovementioned problems. On the basis of this proposed method, an ultra-wide band (UWB) method is introduced. An unscented Kalman filter is applied to fuse inertial sensors and UWB data, inertial positioning is applied to compensation for the defects of susceptibility to UWB signal obstacles, and UWB positioning is used to overcome the error accumulation of inertial positioning. The above method can improve both the positioning accuracy and the response of the positioning results. Finally, this study designs an indoor positioning test system to test the static and dynamic performances of the proposed indoor positioning method. Results show that the positioning system both has high accuracy and good real-time performance.

  11. A heuristic algorithm to approximate dynamic program of a novel new product development process

    Directory of Open Access Journals (Sweden)

    Hamed Fazlollahtabar

    2016-01-01

    Full Text Available We are concerned with a new product development (NPD network in digital environment in which the aim is to find integrated attributes for value added purposes. Different views exist for new product development. Here, the effective factors are categorized into customers, competitors and the company’s own past experience. Also, various attributes are considered for the development of a product. Thus, using digital data of attributes, the optimal set of attributes is chosen for user in the new product development. Regarding the multi stage decision making process of the customer, competitor and company’s own past experience, we develop a multi-dimensional dynamic program as a useful tool for multi stage decision making. To counteract the dynamism of the digital data in different time periods, two concepts of state and policy direction are introduced to determine the cost of moving through the stages of the proposed NPD digital network. Since the space requirements and value function computations become impractical for even moderate size, we approximate the optimal value function developing a heuristic algorithm.

  12. Massively Parallel and Scalable Implicit Time Integration Algorithms for Structural Dynamics

    Science.gov (United States)

    Farhat, Charbel

    1997-01-01

    Explicit codes are often used to simulate the nonlinear dynamics of large-scale structural systems, even for low frequency response, because the storage and CPU requirements entailed by the repeated factorizations traditionally found in implicit codes rapidly overwhelm the available computing resources. With the advent of parallel processing, this trend is accelerating because of the following additional facts: (a) explicit schemes are easier to parallelize than implicit ones, and (b) explicit schemes induce short range interprocessor communications that are relatively inexpensive, while the factorization methods used in most implicit schemes induce long range interprocessor communications that often ruin the sought-after speed-up. However, the time step restriction imposed by the Courant stability condition on all explicit schemes cannot yet be offset by the speed of the currently available parallel hardware. Therefore, it is essential to develop efficient alternatives to direct methods that are also amenable to massively parallel processing because implicit codes using unconditionally stable time-integration algorithms are computationally more efficient when simulating the low-frequency dynamics of aerospace structures.

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

  14. The PHMC algorithm for simulations of dynamical fermions; 2, Performance analysis

    CERN Document Server

    Frezzotti, R

    1999-01-01

    We compare the performance of the PHMC algorithm with the one of the HMC algorithm in practical simulations of lattice QCD. We show that the PHMC algorithm can lead to an acceleration of numerical simulations. It is demonstrated that the PHMC algorithm generates configurations carrying small isolated eigenvalues of the lattice Dirac operator and hence leads to a sampling of configuration space that is different from that of the HMC algorithm.

  15. Dynamic Analysis of the High Speed Train and Slab Track Nonlinear Coupling System with the Cross Iteration Algorithm

    OpenAIRE

    Xiaoyan Lei; Shenhua Wu; Bin Zhang

    2016-01-01

    A model for dynamic analysis of the vehicle-track nonlinear coupling system is established by the finite element method. The whole system is divided into two subsystems: the vehicle subsystem and the track subsystem. Coupling of the two subsystems is achieved by equilibrium conditions for wheel-to-rail nonlinear contact forces and geometrical compatibility conditions. To solve the nonlinear dynamics equations for the vehicle-track coupling system, a cross iteration algorithm and a relaxation ...

  16. Numerical methods and parallel algorithms for fast transient strongly coupled fluid-structure dynamics

    International Nuclear Information System (INIS)

    Faucher, V.

    2014-01-01

    This HDR is dedicated to the research in the framework of fast transient dynamics for industrial fluid-structure systems carried in the Laboratory of Dynamic Studies from CEA, implementing new numerical methods for the modelling of complex systems and the parallel solution of large coupled problems on supercomputers. One key issue for the proposed approaches is the limitation to its minimum of the number of non-physical parameters, to cope with constraints arising from the area of usage of the concepts: safety for both nuclear applications (CEA, EDF) and aeronautics (ONERA), protection of the citizen (EC/JRC) in particular. Kinematic constraints strongly coupling structures (namely through unilateral contact) or fluid and structures (with both conformant or non-conformant meshes depending on the geometrical situation) are handled through exact methods including Lagrange Multipliers, with consequences on the solution strategy to be dealt with. This latter aspect makes EPX, the simulation code where the methods are integrated, a singular tool in the community of fast transient dynamics software. The document mainly relies on a description of the modelling needs for industrial fast transient scenarios, for nuclear applications in particular, and the proposed solutions built in the framework of the collaboration between CEA, EDF (via the LaMSID laboratory) and the LaMCoS laboratory from INSA Lyon. The main considered examples are the tearing of the fluid-filled tank after impact, the Code Disruptive Accident for a Generation IV reactor or the ruin of reinforced concrete structures under impact. Innovative models and parallel algorithms are thus proposed, allowing to carry out with robustness and performance the corresponding simulations on supercomputers made of interconnected multi-core nodes, with a strict preservation of the quality of the physical solution. This was particularly the main point of the ANR RePDyn project (2010-2013), with CEA as the pilot. (author

  17. An evaluation of scanpath-comparison and machine-learning classification algorithms used to study the dynamics of analogy making.

    Science.gov (United States)

    French, Robert M; Glady, Yannick; Thibaut, Jean-Pierre

    2017-08-01

    In recent years, eyetracking has begun to be used to study the dynamics of analogy making. Numerous scanpath-comparison algorithms and machine-learning techniques are available that can be applied to the raw eyetracking data. We show how scanpath-comparison algorithms, combined with multidimensional scaling and a classification algorithm, can be used to resolve an outstanding question in analogy making-namely, whether or not children's and adults' strategies in solving analogy problems are different. (They are.) We show which of these scanpath-comparison algorithms is best suited to the kinds of analogy problems that have formed the basis of much analogy-making research over the years. Furthermore, we use machine-learning classification algorithms to examine the item-to-item saccade vectors making up these scanpaths. We show which of these algorithms best predicts, from very early on in a trial, on the basis of the frequency of various item-to-item saccades, whether a child or an adult is doing the problem. This type of analysis can also be used to predict, on the basis of the item-to-item saccade dynamics in the first third of a trial, whether or not a problem will be solved correctly.

  18. An improved Pattern Search based algorithm to solve the Dynamic Economic Dispatch problem with valve-point effect

    International Nuclear Information System (INIS)

    Alsumait, J.S.; Qasem, M.; Sykulski, J.K.; Al-Othman, A.K.

    2010-01-01

    In this paper, an improved algorithm based on Pattern Search method (PS) to solve the Dynamic Economic Dispatch is proposed. The algorithm maintains the essential unit ramp rate constraint, along with all other necessary constraints, not only for the time horizon of operation (24 h), but it preserves these constraints through the transaction period to the next time horizon (next day) in order to avoid the discontinuity of the power system operation. The Dynamic Economic and Emission Dispatch problem (DEED) is also considered. The load balance constraints, operating limits, valve-point loading and network losses are included in the models of both DED and DEED. The numerical results clarify the significance of the improved algorithm and verify its performance.

  19. A Thrust Allocation Method for Efficient Dynamic Positioning of a Semisubmersible Drilling Rig Based on the Hybrid Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Luman Zhao

    2015-01-01

    Full Text Available A thrust allocation method was proposed based on a hybrid optimization algorithm to efficiently and dynamically position a semisubmersible drilling rig. That is, the thrust allocation was optimized to produce the generalized forces and moment required while at the same time minimizing the total power consumption under the premise that forbidden zones should be taken into account. An optimization problem was mathematically formulated to provide the optimal thrust allocation by introducing the corresponding design variables, objective function, and constraints. A hybrid optimization algorithm consisting of a genetic algorithm and a sequential quadratic programming (SQP algorithm was selected and used to solve this problem. The proposed method was evaluated by applying it to a thrust allocation problem for a semisubmersible drilling rig. The results indicate that the proposed method can be used as part of a cost-effective strategy for thrust allocation of the rig.

  20. Two-dimensional priority-based dynamic resource allocation algorithm for QoS in WDM/TDM PON networks

    Science.gov (United States)

    Sun, Yixin; Liu, Bo; Zhang, Lijia; Xin, Xiangjun; Zhang, Qi; Rao, Lan

    2018-01-01

    Wavelength division multiplexing/time division multiplexing (WDM/TDM) passive optical networks (PON) is being viewed as a promising solution for delivering multiple services and applications. The hybrid WDM / TDM PON uses the wavelength and bandwidth allocation strategy to control the distribution of the wavelength channels in the uplink direction, so that it can ensure the high bandwidth requirements of multiple Optical Network Units (ONUs) while improving the wavelength resource utilization. Through the investigation of the presented dynamic bandwidth allocation algorithms, these algorithms can't satisfy the requirements of different levels of service very well while adapting to the structural characteristics of mixed WDM / TDM PON system. This paper introduces a novel wavelength and bandwidth allocation algorithm to efficiently utilize the bandwidth and support QoS (Quality of Service) guarantees in WDM/TDM PON. Two priority based polling subcycles are introduced in order to increase system efficiency and improve system performance. The fixed priority polling subcycle and dynamic priority polling subcycle follow different principles to implement wavelength and bandwidth allocation according to the priority of different levels of service. A simulation was conducted to study the performance of the priority based polling in dynamic resource allocation algorithm in WDM/TDM PON. The results show that the performance of delay-sensitive services is greatly improved without degrading QoS guarantees for other services. Compared with the traditional dynamic bandwidth allocation algorithms, this algorithm can meet bandwidth needs of different priority traffic class, achieve low loss rate performance, and ensure real-time of high priority traffic class in terms of overall traffic on the network.

  1. Application of Template Matching Algorithm for Dynamic Gesture Recognition of American Sign Language Finger Spelling and Hand Gesture

    Directory of Open Access Journals (Sweden)

    KARL CAEZAR P. CARRERA

    2014-08-01

    Full Text Available —In this study the researchers developed a human computer interface system where the dynamic gestures on the American Sign Language can be recognized. This is another way of communicating by people who understands and do not understand American Sign Language. They proposed the application of template matching algorithm for the recognition of dynamic gestures where it is based on the number of templates per gesture, which must be taken by the user, to be trained and saved in the system. To be able to recognize the dynamic gestures three things must be considered. These are the number of templates required for the algorithm to be able to recognize the gestures, the factors in handling different hand orientation of other users, and the reliability of the system in terms of communication

  2. Dynamic Clinical Algorithms: Digital Technology Can Transform Health Care Decision-Making.

    Science.gov (United States)

    Bell, David; Gachuhi, Noni; Assefi, Nassim

    2018-01-01

    Most health care in low-income countries is delivered at a primary care level by health workers who lack quality training and supervision, often distant from more experienced support. Lack of knowledge and poor communication result in a poor quality of care and inefficient delivery of health services. Although bringing great benefits in sectors such as finance and telecommunication in recent years, the Digital Revolution has lightly and inconsistently affected the health sector. These advances offer an opportunity to dramatically transform health care by increasing the availability and timeliness of information to augment clinical decision-making, based on improved access to patient histories, current information on disease epidemiology, and improved incorporation of data from point-of-care and centralized diagnostic testing. A comprehensive approach is needed to more effectively incorporate current digital technologies into health systems, bringing external and patient-derived data into the clinical decision-making process in real time, irrespective of health worker training or location. Such dynamic clinical algorithms could provide a more effective framework within which to design and integrate new digital health technologies and deliver improved patient care by primary care health workers.

  3. Multidimensional Dynamic Programming Algorithm for N-Level Batching with Hierarchical Clustering Structure

    Directory of Open Access Journals (Sweden)

    Seung-Kil Lim

    2017-01-01

    Full Text Available This study focuses on the N-level batching problem with a hierarchical clustering structure. Clustering is the task of grouping a set of item types in such a way that item types in the same cluster are more similar (in some sense or another to each other than to those in other clusters. In hierarchical clustering structure, more and more different item types are clustered together as the level of the hierarchy increases. N-level batching is the process by which items with different types are grouped into several batches passed from level 1 to level N sequentially for given hierarchical clustering structure such that batches in each level should satisfy the maximum and minimum batch size requirements of the level. We consider two types of processing costs of the batches: unit processing cost and batch processing cost. We formulate the N-level batching problem with a hierarchical clustering structure as a nonlinear integer programming model with the objective of minimizing the total processing cost. To solve the problem optimally, we propose a multidimensional dynamic programming algorithm with an example.

  4. A genetic algorithm for a bi-objective mathematical model for dynamic virtual cell formation problem

    Science.gov (United States)

    Moradgholi, Mostafa; Paydar, Mohammad Mahdi; Mahdavi, Iraj; Jouzdani, Javid

    2016-05-01

    Nowadays, with the increasing pressure of the competitive business environment and demand for diverse products, manufacturers are force to seek for solutions that reduce production costs and rise product quality. Cellular manufacturing system (CMS), as a means to this end, has been a point of attraction to both researchers and practitioners. Limitations of cell formation problem (CFP), as one of important topics in CMS, have led to the introduction of virtual CMS (VCMS). This research addresses a bi-objective dynamic virtual cell formation problem (DVCFP) with the objective of finding the optimal formation of cells, considering the material handling costs, fixed machine installation costs and variable production costs of machines and workforce. Furthermore, we consider different skills on different machines in workforce assignment in a multi-period planning horizon. The bi-objective model is transformed to a single-objective fuzzy goal programming model and to show its performance; numerical examples are solved using the LINGO software. In addition, genetic algorithm (GA) is customized to tackle large-scale instances of the problems to show the performance of the solution method.

  5. Due Date Assignment in a Dynamic Job Shop with the Orthogonal Kernel Least Squares Algorithm

    Science.gov (United States)

    Yang, D. H.; Hu, L.; Qian, Y.

    2017-06-01

    Meeting due dates is a key goal in the manufacturing industries. This paper proposes a method for due date assignment (DDA) by using the Orthogonal Kernel Least Squares Algorithm (OKLSA). A simulation model is built to imitate the production process of a highly dynamic job shop. Several factors describing job characteristics and system state are extracted as attributes to predict job flow-times. A number of experiments under conditions of varying dispatching rules and 90% shop utilization level have been carried out to evaluate the effectiveness of OKLSA applied for DDA. The prediction performance of OKLSA is compared with those of five conventional DDA models and back-propagation neural network (BPNN). The experimental results indicate that OKLSA is statistically superior to other DDA models in terms of mean absolute lateness and root mean squares lateness in most cases. The only exception occurs when the shortest processing time rule is used for dispatching jobs, the difference between OKLSA and BPNN is not statistically significant.

  6. [A quick algorithm of dynamic spectrum photoelectric pulse wave detection based on LabVIEW].

    Science.gov (United States)

    Lin, Ling; Li, Na; Li, Gang

    2010-02-01

    Dynamic spectrum (DS) detection is attractive among the numerous noninvasive blood component detection methods because of the elimination of the main interference of the individual discrepancy and measure conditions. DS is a kind of spectrum extracted from the photoelectric pulse wave and closely relative to the artery blood. It can be used in a noninvasive blood component concentration examination. The key issues in DS detection are high detection precision and high operation speed. The precision of measure can be advanced by making use of over-sampling and lock-in amplifying on the pick-up of photoelectric pulse wave in DS detection. In the present paper, the theory expression formula of the over-sampling and lock-in amplifying method was deduced firstly. Then in order to overcome the problems of great data and excessive operation brought on by this technology, a quick algorithm based on LabVIEW and a method of using external C code applied in the pick-up of photoelectric pulse wave were presented. Experimental verification was conducted in the environment of LabVIEW. The results show that by the method pres ented, the speed of operation was promoted rapidly and the data memory was reduced largely.

  7. Parameter estimation of internal thermal mass of building dynamic models using genetic algorithm

    International Nuclear Information System (INIS)

    Wang Shengwei; Xu Xinhua

    2006-01-01

    Building thermal transfer models are essential to predict transient cooling or heating requirements for performance monitoring, diagnosis and control strategy analysis. Detailed physical models are time consuming and often not cost effective. Black box models require a significant amount of training data and may not always reflect the physical behaviors. In this study, a building is described using a simplified thermal network model. For the building envelope, the model parameters can be determined using easily available physical details. For building internal mass having thermal capacitance, including components such as furniture, partitions etc., it is very difficult to obtain detailed physical properties. To overcome this problem, this paper proposes to present the building internal mass with a thermal network structure of lumped thermal mass and estimate the lumped parameters using operation data. A genetic algorithm estimator is developed to estimate the lumped internal thermal parameters of the building thermal network model using the operation data collected from site monitoring. The simplified dynamic model of building internal mass is validated in different weather conditions

  8. A High-Speed Vision-Based Sensor for Dynamic Vibration Analysis Using Fast Motion Extraction Algorithms

    Directory of Open Access Journals (Sweden)

    Dashan Zhang

    2016-04-01

    Full Text Available The development of image sensor and optics enables the application of vision-based techniques to the non-contact dynamic vibration analysis of large-scale structures. As an emerging technology, a vision-based approach allows for remote measuring and does not bring any additional mass to the measuring object compared with traditional contact measurements. In this study, a high-speed vision-based sensor system is developed to extract structure vibration signals in real time. A fast motion extraction algorithm is required for this system because the maximum sampling frequency of the charge-coupled device (CCD sensor can reach up to 1000 Hz. Two efficient subpixel level motion extraction algorithms, namely the modified Taylor approximation refinement algorithm and the localization refinement algorithm, are integrated into the proposed vision sensor. Quantitative analysis shows that both of the two modified algorithms are at least five times faster than conventional upsampled cross-correlation approaches and achieve satisfactory error performance. The practicability of the developed sensor is evaluated by an experiment in a laboratory environment and a field test. Experimental results indicate that the developed high-speed vision-based sensor system can extract accurate dynamic structure vibration signals by tracking either artificial targets or natural features.

  9. A Scalable O(N) Algorithm for Large-Scale Parallel First-Principles Molecular Dynamics Simulations

    Energy Technology Data Exchange (ETDEWEB)

    Osei-Kuffuor, Daniel [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Fattebert, Jean-Luc [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

    2014-01-01

    Traditional algorithms for first-principles molecular dynamics (FPMD) simulations only gain a modest capability increase from current petascale computers, due to their O(N3) complexity and their heavy use of global communications. To address this issue, we are developing a truly scalable O(N) complexity FPMD algorithm, based on density functional theory (DFT), which avoids global communications. The computational model uses a general nonorthogonal orbital formulation for the DFT energy functional, which requires knowledge of selected elements of the inverse of the associated overlap matrix. We present a scalable algorithm for approximately computing selected entries of the inverse of the overlap matrix, based on an approximate inverse technique, by inverting local blocks corresponding to principal submatrices of the global overlap matrix. The new FPMD algorithm exploits sparsity and uses nearest neighbor communication to provide a computational scheme capable of extreme scalability. Accuracy is controlled by the mesh spacing of the finite difference discretization, the size of the localization regions in which the electronic orbitals are confined, and a cutoff beyond which the entries of the overlap matrix can be omitted when computing selected entries of its inverse. We demonstrate the algorithm's excellent parallel scaling for up to O(100K) atoms on O(100K) processors, with a wall-clock time of O(1) minute per molecular dynamics time step.

  10. Modular simulation of the dynamics of a 925 MWe PWR electronuclear type reactor and design of a multivariable control algorithm

    International Nuclear Information System (INIS)

    Mansouri, S.

    1985-06-01

    This work has been consecrated to the modular simulation of a PWR 925 MWe power plant's dynamic and to the design of a multivariable algorithm control: a mathematical model of a plant type was developed. The programs were written on a structured manner in order to maximize flexibility. A multivariable control algorithm based on pole placement with output feedback was elaborated together with its correspondent program. The simulation results for different normal transients were shown and the capabilities of the new method of multivariable control are illustrated through many examples

  11. Kriging-Based Parameter Estimation Algorithm for Metabolic Networks Combined with Single-Dimensional Optimization and Dynamic Coordinate Perturbation.

    Science.gov (United States)

    Wang, Hong; Wang, Xicheng; Li, Zheng; Li, Keqiu

    2016-01-01

    The metabolic network model allows for an in-depth insight into the molecular mechanism of a particular organism. Because most parameters of the metabolic network cannot be directly measured, they must be estimated by using optimization algorithms. However, three characteristics of the metabolic network model, i.e., high nonlinearity, large amount parameters, and huge variation scopes of parameters, restrict the application of many traditional optimization algorithms. As a result, there is a growing demand to develop efficient optimization approaches to address this complex problem. In this paper, a Kriging-based algorithm aiming at parameter estimation is presented for constructing the metabolic networks. In the algorithm, a new infill sampling criterion, named expected improvement and mutual information (EI&MI), is adopted to improve the modeling accuracy by selecting multiple new sample points at each cycle, and the domain decomposition strategy based on the principal component analysis is introduced to save computing time. Meanwhile, the convergence speed is accelerated by combining a single-dimensional optimization method with the dynamic coordinate perturbation strategy when determining the new sample points. Finally, the algorithm is applied to the arachidonic acid metabolic network to estimate its parameters. The obtained results demonstrate the effectiveness of the proposed algorithm in getting precise parameter values under a limited number of iterations.

  12. Coronary CT Angiography-derived Fractional Flow Reserve: Machine Learning Algorithm versus Computational Fluid Dynamics Modeling.

    Science.gov (United States)

    Tesche, Christian; De Cecco, Carlo N; Baumann, Stefan; Renker, Matthias; McLaurin, Tindal W; Duguay, Taylor M; Bayer, Richard R; Steinberg, Daniel H; Grant, Katharine L; Canstein, Christian; Schwemmer, Chris; Schoebinger, Max; Itu, Lucian M; Rapaka, Saikiran; Sharma, Puneet; Schoepf, U Joseph

    2018-04-10

    Purpose To compare two technical approaches for determination of coronary computed tomography (CT) angiography-derived fractional flow reserve (FFR)-FFR derived from coronary CT angiography based on computational fluid dynamics (hereafter, FFR CFD ) and FFR derived from coronary CT angiography based on machine learning algorithm (hereafter, FFR ML )-against coronary CT angiography and quantitative coronary angiography (QCA). Materials and Methods A total of 85 patients (mean age, 62 years ± 11 [standard deviation]; 62% men) who had undergone coronary CT angiography followed by invasive FFR were included in this single-center retrospective study. FFR values were derived on-site from coronary CT angiography data sets by using both FFR CFD and FFR ML . The performance of both techniques for detecting lesion-specific ischemia was compared against visual stenosis grading at coronary CT angiography, QCA, and invasive FFR as the reference standard. Results On a per-lesion and per-patient level, FFR ML showed a sensitivity of 79% and 90% and a specificity of 94% and 95%, respectively, for detecting lesion-specific ischemia. Meanwhile, FFR CFD resulted in a sensitivity of 79% and 89% and a specificity of 93% and 93%, respectively, on a per-lesion and per-patient basis (P = .86 and P = .92). On a per-lesion level, the area under the receiver operating characteristics curve (AUC) of 0.89 for FFR ML and 0.89 for FFR CFD showed significantly higher discriminatory power for detecting lesion-specific ischemia compared with that of coronary CT angiography (AUC, 0.61) and QCA (AUC, 0.69) (all P < .0001). Also, on a per-patient level, FFR ML (AUC, 0.91) and FFR CFD (AUC, 0.91) performed significantly better than did coronary CT angiography (AUC, 0.65) and QCA (AUC, 0.68) (all P < .0001). Processing time for FFR ML was significantly shorter compared with that of FFR CFD (40.5 minutes ± 6.3 vs 43.4 minutes ± 7.1; P = .042). Conclusion The FFR ML algorithm performs equally in

  13. Explicit symplectic integrators of molecular dynamics algorithms for rigid-body molecules in the canonical, isobaric-isothermal, and related ensembles.

    Science.gov (United States)

    Okumura, Hisashi; Itoh, Satoru G; Okamoto, Yuko

    2007-02-28

    The authors propose explicit symplectic integrators of molecular dynamics (MD) algorithms for rigid-body molecules in the canonical and isobaric-isothermal ensembles. They also present a symplectic algorithm in the constant normal pressure and lateral surface area ensemble and that combined with the Parrinello-Rahman algorithm. Employing the symplectic integrators for MD algorithms, there is a conserved quantity which is close to Hamiltonian. Therefore, they can perform a MD simulation more stably than by conventional nonsymplectic algorithms. They applied this algorithm to a TIP3P pure water system at 300 K and compared the time evolution of the Hamiltonian with those by the nonsymplectic algorithms. They found that the Hamiltonian was conserved well by the symplectic algorithm even for a time step of 4 fs. This time step is longer than typical values of 0.5-2 fs which are used by the conventional nonsymplectic algorithms.

  14. Combating Weapons of Mass Destruction: Models, Complexity, and Algorithms in Complex Dynamic and Evolving Networks

    Science.gov (United States)

    2015-11-01

    symposium on Discrete algorithms. SODA ’08. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 2008, 1029–1037. [18] Chen, Wei, Wang...the recovery process . We have provided 7 Algorithm 1: Exact Algorithm MFMCSP 1: Input: directed graph G = (V,E), constraint set M = {c1, · · · , cm...cause further failures back to Gs. The process continues back and forth between two networks until there are no more failure nodes. Our major findings are

  15. Discrete-Time Nonzero-Sum Games for Multiplayer Using Policy-Iteration-Based Adaptive Dynamic Programming Algorithms.

    Science.gov (United States)

    Zhang, Huaguang; Jiang, He; Luo, Chaomin; Xiao, Geyang

    2017-10-01

    In this paper, we investigate the nonzero-sum games for a class of discrete-time (DT) nonlinear systems by using a novel policy iteration (PI) adaptive dynamic programming (ADP) method. The main idea of our proposed PI scheme is to utilize the iterative ADP algorithm to obtain the iterative control policies, which not only ensure the system to achieve stability but also minimize the performance index function for each player. This paper integrates game theory, optimal control theory, and reinforcement learning technique to formulate and handle the DT nonzero-sum games for multiplayer. First, we design three actor-critic algorithms, an offline one and two online ones, for the PI scheme. Subsequently, neural networks are employed to implement these algorithms and the corresponding stability analysis is also provided via the Lyapunov theory. Finally, a numerical simulation example is presented to demonstrate the effectiveness of our proposed approach.

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

  17. On Newton-Raphson formulation and algorithm for displacement based structural dynamics problem with quadratic damping nonlinearity

    Directory of Open Access Journals (Sweden)

    Koh Kim Jie

    2017-01-01

    Full Text Available Quadratic damping nonlinearity is challenging for displacement based structural dynamics problem as the problem is nonlinear in time derivative of the primitive variable. For such nonlinearity, the formulation of tangent stiffness matrix is not lucid in the literature. Consequently, ambiguity related to kinematics update arises when implementing the time integration-iterative algorithm. In present work, an Euler-Bernoulli beam vibration problem with quadratic damping nonlinearity is addressed as the main source of quadratic damping nonlinearity arises from drag force estimation, which is generally valid only for slender structures. Employing Newton-Raphson formulation, tangent stiffness components associated with quadratic damping nonlinearity requires velocity input for evaluation purpose. For this reason, two mathematically equivalent algorithm structures with different kinematics arrangement are tested. Both algorithm structures result in the same accuracy and convergence characteristic of solution.

  18. Assessment of an MCMC algorithm convergence for Bayesian estimation of the particle size distribution from multiangle dynamic light scattering measurements

    Science.gov (United States)

    Boualem, Abdelbassit; Jabloun, Meryem; Ravier, Philippe; Naiim, Marie; Jalocha, Alain

    2015-01-01

    Recovering the particle size distribution (PSD) from dynamic light scattering (DLS) measurements is known to be a highly ill-posed inverse problem. In a former study, we proposed a new Bayesian inference method applied directly to the multiangle DLS measurements to improve the estimation of multimodal PSDs. The posterior probability density of interest is sampled using a MCMC Metropolis-within-Gibbs algorithm. In this work, we experimentally examined the convergence of the used MCMC strategy using the simulation method recently proposed by Chauveau and Vandekerkhove (2013). This method is based on the evolution in time (iterations) of the Kullback-Leibler divergence between the target posterior density and the successive densities of the algorithm of interest. The convergence of the used MCMC algorithm was examined when processing simulated and experimental data.

  19. When Algorithms Shape Collective Action: Social Media and the Dynamics of Cloud Protesting

    Directory of Open Access Journals (Sweden)

    Stefania Milan

    2015-12-01

    Full Text Available How does the algorithmically mediated environment of social media restructure social action? This article combines social movement studies and science and technology studies to explore the role of social media in the organization, unfolding, and diffusion of contemporary protests. In particular, it examines how activists leverage the technical properties of social media to develop a joint narrative and a collective identity. To this end, it offers the notion of cloud protesting as a theoretical approach and framework for empirical analysis. Cloud protesting indicates a specific type of mobilization that is grounded on, modeled around, and enabled by social media platforms and mobile devices and the virtual universes they identify. The notion emphasizes both the productive mediation of social and mobile media and the importance of activists’ sense-making activities. It also acknowledges that social media set in motion a process that is sociotechnical in nature rather than merely sociological or communicative, and thus can be understood only by intersecting the material and the symbolic dimensions of contemporary digitally mediated collective action. The article shows how the specific materiality of social media intervenes in the actors’ meaning work by fostering four mechanisms—namely performance, interpellation, temporality, and reproducibility—which concur to create a “politics of visibility” that alters traditional identity dynamics. In addition, it exposes the connection between organizational patterns and the role of individuals, explaining how the politics of visibility is the result of a process that originates and ends within the individual—which ultimately creates individuals-in-the-group rather than groups.

  20. A Method on Dynamic Path Planning for Robotic Manipulator Autonomous Obstacle Avoidance Based on an Improved RRT Algorithm

    Directory of Open Access Journals (Sweden)

    Kun Wei

    2018-02-01

    Full Text Available In a future intelligent factory, a robotic manipulator must work efficiently and safely in a Human–Robot collaborative and dynamic unstructured environment. Autonomous path planning is the most important issue which must be resolved first in the process of improving robotic manipulator intelligence. Among the path-planning methods, the Rapidly Exploring Random Tree (RRT algorithm based on random sampling has been widely applied in dynamic path planning for a high-dimensional robotic manipulator, especially in a complex environment because of its probability completeness, perfect expansion, and fast exploring speed over other planning methods. However, the existing RRT algorithm has a limitation in path planning for a robotic manipulator in a dynamic unstructured environment. Therefore, an autonomous obstacle avoidance dynamic path-planning method for a robotic manipulator based on an improved RRT algorithm, called Smoothly RRT (S-RRT, is proposed. This method that targets a directional node extends and can increase the sampling speed and efficiency of RRT dramatically. A path optimization strategy based on the maximum curvature constraint is presented to generate a smooth and curved continuous executable path for a robotic manipulator. Finally, the correctness, effectiveness, and practicability of the proposed method are demonstrated and validated via a MATLAB static simulation and a Robot Operating System (ROS dynamic simulation environment as well as a real autonomous obstacle avoidance experiment in a dynamic unstructured environment for a robotic manipulator. The proposed method not only provides great practical engineering significance for a robotic manipulator’s obstacle avoidance in an intelligent factory, but also theoretical reference value for other type of robots’ path planning.

  1. A Method on Dynamic Path Planning for Robotic Manipulator Autonomous Obstacle Avoidance Based on an Improved RRT Algorithm.

    Science.gov (United States)

    Wei, Kun; Ren, Bingyin

    2018-02-13

    In a future intelligent factory, a robotic manipulator must work efficiently and safely in a Human-Robot collaborative and dynamic unstructured environment. Autonomous path planning is the most important issue which must be resolved first in the process of improving robotic manipulator intelligence. Among the path-planning methods, the Rapidly Exploring Random Tree (RRT) algorithm based on random sampling has been widely applied in dynamic path planning for a high-dimensional robotic manipulator, especially in a complex environment because of its probability completeness, perfect expansion, and fast exploring speed over other planning methods. However, the existing RRT algorithm has a limitation in path planning for a robotic manipulator in a dynamic unstructured environment. Therefore, an autonomous obstacle avoidance dynamic path-planning method for a robotic manipulator based on an improved RRT algorithm, called Smoothly RRT (S-RRT), is proposed. This method that targets a directional node extends and can increase the sampling speed and efficiency of RRT dramatically. A path optimization strategy based on the maximum curvature constraint is presented to generate a smooth and curved continuous executable path for a robotic manipulator. Finally, the correctness, effectiveness, and practicability of the proposed method are demonstrated and validated via a MATLAB static simulation and a Robot Operating System (ROS) dynamic simulation environment as well as a real autonomous obstacle avoidance experiment in a dynamic unstructured environment for a robotic manipulator. The proposed method not only provides great practical engineering significance for a robotic manipulator's obstacle avoidance in an intelligent factory, but also theoretical reference value for other type of robots' path planning.

  2. A Method on Dynamic Path Planning for Robotic Manipulator Autonomous Obstacle Avoidance Based on an Improved RRT Algorithm

    Science.gov (United States)

    Wei, Kun; Ren, Bingyin

    2018-01-01

    In a future intelligent factory, a robotic manipulator must work efficiently and safely in a Human–Robot collaborative and dynamic unstructured environment. Autonomous path planning is the most important issue which must be resolved first in the process of improving robotic manipulator intelligence. Among the path-planning methods, the Rapidly Exploring Random Tree (RRT) algorithm based on random sampling has been widely applied in dynamic path planning for a high-dimensional robotic manipulator, especially in a complex environment because of its probability completeness, perfect expansion, and fast exploring speed over other planning methods. However, the existing RRT algorithm has a limitation in path planning for a robotic manipulator in a dynamic unstructured environment. Therefore, an autonomous obstacle avoidance dynamic path-planning method for a robotic manipulator based on an improved RRT algorithm, called Smoothly RRT (S-RRT), is proposed. This method that targets a directional node extends and can increase the sampling speed and efficiency of RRT dramatically. A path optimization strategy based on the maximum curvature constraint is presented to generate a smooth and curved continuous executable path for a robotic manipulator. Finally, the correctness, effectiveness, and practicability of the proposed method are demonstrated and validated via a MATLAB static simulation and a Robot Operating System (ROS) dynamic simulation environment as well as a real autonomous obstacle avoidance experiment in a dynamic unstructured environment for a robotic manipulator. The proposed method not only provides great practical engineering significance for a robotic manipulator’s obstacle avoidance in an intelligent factory, but also theoretical reference value for other type of robots’ path planning. PMID:29438320

  3. Discharge rate balancing control strategy based on dynamic consensus algorithm for energy storage units in AC microgrids

    DEFF Research Database (Denmark)

    Guan, Yajuan; Meng, Lexuan; Li, Chendan

    2017-01-01

    A dynamic consensus algorithm-based coordinated secondary control with an autonomous current-sharing control strategy is proposed in this paper for balancing discharge rate of energy storage systems (ESSs) in an islanded AC microgrid. The dynamic consensus algorithm is applied for information...... sharing between distributed generation (DG) units in order to regulate the output power of DGs according to ESS capacities and state-of-charge (SoC). The proposed controller can not only effectively prevent operation failure caused by over current and unintentional outage of DGs by means of balanced...... discharge rate control, but also provide fast response and accurate current sharing performance due to an autonomous current-sharing controller at primary level. In addition, expandability, flexibility and high reliability can be obtained thanks to the distributed architecture. Based on the developed...

  4. A simple but efficient voice activity detection algorithm through Hilbert transform and dynamic threshold for speech pathologies

    Science.gov (United States)

    Ortiz P., D.; Villa, Luisa F.; Salazar, Carlos; Quintero, O. L.

    2016-04-01

    A simple but efficient voice activity detector based on the Hilbert transform and a dynamic threshold is presented to be used on the pre-processing of audio signals. The algorithm to define the dynamic threshold is a modification of a convex combination found in literature. This scheme allows the detection of prosodic and silence segments on a speech in presence of non-ideal conditions like a spectral overlapped noise. The present work shows preliminary results over a database built with some political speech. The tests were performed adding artificial noise to natural noises over the audio signals, and some algorithms are compared. Results will be extrapolated to the field of adaptive filtering on monophonic signals and the analysis of speech pathologies on futures works.

  5. Application of second order sliding mode algorithms for output feedback control in hydraulic cylinder drives with profound valve dynamics

    DEFF Research Database (Denmark)

    Schmidt, Lasse; Andersen, Torben O.

    2016-01-01

    The application of second order sliding mode algorithms for output feedback control in hydraulic valve-cylinder drives appear attractive due to their simple realization and parametrization, and strong robustness toward bounded parameter variations and uncertainties. However, intrinsic nonlinear...... consideration are applied for position tracking control of a hydraulic valve-cylinder drive exhibiting strong variations in inertia- and gravitational loads, and furthermore suffer from profound valve dynamics. Results demonstrate that both the twisting- and super twisting algorithms may be successfully applied...... dynamic effects of hydraulic valves such as slew rate limitations and time delays arising in the electrical and mechanical amplification stages limits the applicability of such methods, and may lead to partial losses of robustness and limit cycles/oscillations in the outputs, internal states and the valve...

  6. Accurate and Scalable O(N) Algorithm for First-Principles Molecular-Dynamics Computations on Large Parallel Computers

    Energy Technology Data Exchange (ETDEWEB)

    Osei-Kuffuor, Daniel [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Fattebert, Jean-Luc [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

    2014-01-01

    We present the first truly scalable first-principles molecular dynamics algorithm with O(N) complexity and controllable accuracy, capable of simulating systems with finite band gaps of sizes that were previously impossible with this degree of accuracy. By avoiding global communications, we provide a practical computational scheme capable of extreme scalability. Accuracy is controlled by the mesh spacing of the finite difference discretization, the size of the localization regions in which the electronic wave functions are confined, and a cutoff beyond which the components of the overlap matrix can be omitted when computing selected elements of its inverse. We demonstrate the algorithm's excellent parallel scaling for up to 101 952 atoms on 23 328 processors, with a wall-clock time of the order of 1 min per molecular dynamics time step and numerical error on the forces of less than 7x10-4 Ha/Bohr.

  7. A Memetic Differential Evolution Algorithm Based on Dynamic Preference for Constrained Optimization Problems

    Directory of Open Access Journals (Sweden)

    Ning Dong

    2014-01-01

    functions are executed, and comparisons with five state-of-the-art algorithms are made. The results illustrate that the proposed algorithm is competitive with and in some cases superior to the compared ones in terms of the quality, efficiency, and the robustness of the obtained results.

  8. The PHMC algorithm for simulations of dynamical fermions; 1, description and properties

    CERN Document Server

    Frezzotti, R

    1999-01-01

    We give a detailed description of the so-called Polynomial Hybrid Monte Carlo (PHMC) algorithm. The effects of the correction factor, which is introduced to render the algorithm exact, are discussed, stressing their relevance for the statistical fluctuations and (almost) zero mode contributions to physical observables. We also investigate rounding-error effects and propose several ways to reduce memory requirements.

  9. Output-only modal dynamic identification of frames by a refined FDD algorithm at seismic input and high damping

    Science.gov (United States)

    Pioldi, Fabio; Ferrari, Rosalba; Rizzi, Egidio

    2016-02-01

    The present paper deals with the seismic modal dynamic identification of frame structures by a refined Frequency Domain Decomposition (rFDD) algorithm, autonomously formulated and implemented within MATLAB. First, the output-only identification technique is outlined analytically and then employed to characterize all modal properties. Synthetic response signals generated prior to the dynamic identification are adopted as input channels, in view of assessing a necessary condition for the procedure's efficiency. Initially, the algorithm is verified on canonical input from random excitation. Then, modal identification has been attempted successfully at given seismic input, taken as base excitation, including both strong motion data and single and multiple input ground motions. Rather than different attempts investigating the role of seismic response signals in the Time Domain, this paper considers the identification analysis in the Frequency Domain. Results turn-out very much consistent with the target values, with quite limited errors in the modal estimates, including for the damping ratios, ranging from values in the order of 1% to 10%. Either seismic excitation and high values of damping, resulting critical also in case of well-spaced modes, shall not fulfill traditional FFD assumptions: this shows the consistency of the developed algorithm. Through original strategies and arrangements, the paper shows that a comprehensive rFDD modal dynamic identification of frames at seismic input is feasible, also at concomitant high damping.

  10. Dynamic Power Dispatch Considering Electric Vehicles and Wind Power Using Decomposition Based Multi-Objective Evolutionary Algorithm

    Directory of Open Access Journals (Sweden)

    Boyang Qu

    2017-12-01

    Full Text Available The intermittency of wind power and the large-scale integration of electric vehicles (EVs bring new challenges to the reliability and economy of power system dispatching. In this paper, a novel multi-objective dynamic economic emission dispatch (DEED model is proposed considering the EVs and uncertainties of wind power. The total fuel cost and pollutant emission are considered as the optimization objectives, and the vehicle to grid (V2G power and the conventional generator output power are set as the decision variables. The stochastic wind power is derived by Weibull probability distribution function. Under the premise of meeting the system energy and user’s travel demand, the charging and discharging behavior of the EVs are dynamically managed. Moreover, we propose a two-step dynamic constraint processing strategy for decision variables based on penalty function, and, on this basis, the Multi-Objective Evolutionary Algorithm Based on Decomposition (MOEA/D algorithm is improved. The proposed model and approach are verified by the 10-generator system. The results demonstrate that the proposed DEED model and the improved MOEA/D algorithm are effective and reasonable.

  11. Implementation of a genetic algorithm for energy design optimization of livestock housing using a dynamic thermal simulator

    Directory of Open Access Journals (Sweden)

    Maria Elena Menconi

    2013-09-01

    Full Text Available A Genetic Algorithm (GA is an optimization process inspired by natural systems ability of surviving in many different environments through the mechanisms of natural selection and genetics. The pairing of GA-based optimization techniques with dynamic energy models is a common and effective practice to find energy efficient design solutions. In this paper is implemented an optimization tool that use a GA and a dynamic energy model. Efficiency of GAs depends largely on the coding strategy and on the parameters selection. In order to test the code and to find the best combination of parameters, a parametric analysis of GA's performances is carried out. The algorithm, coded in Matlab, works with populations of strings. Each string, that represents a complete design solution, is initially randomly generated by the GA and evaluated in terms of energy performances by the dynamic thermal simulator. A new population is then generated using three different GA stochastic operators: reproduction, crossover and mutation, by selecting, mixing and randomly modifying the fittest solutions of the previous generation. Each generation is energetically evaluated and thus the fitness of the strings, that represent the energy efficiency of the design solutions, improves every cycle till eventually converge to the best solution. This whole methodology is well documented and applied in residential buildings design but can be easily extended to livestock housing. In this paper the algorithm is coded to be applied on a simple sheepfold model in order to optimize only passive design solutions.

  12. Automatic determination of the arterial input function in dynamic susceptibility contrast MRI: comparison of different reproducible clustering algorithms

    International Nuclear Information System (INIS)

    Yin, Jiandong; Yang, Jiawen; Guo, Qiyong

    2015-01-01

    Arterial input function (AIF) plays an important role in the quantification of cerebral hemodynamics. The purpose of this study was to select the best reproducible clustering method for AIF detection by comparing three algorithms reported previously in terms of detection accuracy and computational complexity. First, three reproducible clustering methods, normalized cut (Ncut), hierarchy (HIER), and fast affine propagation (FastAP), were applied independently to simulated data which contained the true AIF. Next, a clinical verification was performed where 42 subjects participated in dynamic susceptibility contrast MRI (DSC-MRI) scanning. The manual AIF and AIFs based on the different algorithms were obtained. The performance of each algorithm was evaluated based on shape parameters of the estimated AIFs and the true or manual AIF. Moreover, the execution time of each algorithm was recorded to determine the algorithm that operated more rapidly in clinical practice. In terms of the detection accuracy, Ncut and HIER method produced similar AIF detection results, which were closer to the expected AIF and more accurate than those obtained using FastAP method; in terms of the computational efficiency, the Ncut method required the shortest execution time. Ncut clustering appears promising because it facilitates the automatic and robust determination of AIF with high accuracy and efficiency. (orig.)

  13. A Dynamic Construction Algorithm for the Compact Patricia Trie Using the Hierarchical Structure.

    Science.gov (United States)

    Jung, Minsoo; Shishibori, Masami; Tanaka, Yasuhiro; Aoe, Jun-ichi

    2002-01-01

    Discussion of information retrieval focuses on the use of binary trees and how to compact it to use less memory and take less time. Explains retrieval algorithms and describes data structure and hierarchical structure. (LRW)

  14. An elementary singularity-free Rotational Brownian Dynamics algorithm for anisotropic particles

    NARCIS (Netherlands)

    Ilie, Ioana Mariuca; Briels, Willem J.; den Otter, Wouter K.

    2015-01-01

    Brownian Dynamics is the designated technique to simulate the collective dynamics of colloidal particles suspended in a solution, e.g., the self-assembly of patchy particles. Simulating the rotational dynamics of anisotropic particles by a first-order Langevin equation, however, gives rise to a

  15. Experimental investigation of a moving averaging algorithm for motion perpendicular to the leaf travel direction in dynamic MLC target tracking

    Energy Technology Data Exchange (ETDEWEB)

    Yoon, Jai-Woong; Sawant, Amit; Suh, Yelin; Cho, Byung-Chul; Suh, Tae-Suk; Keall, Paul [Department of Biomedical Engineering, College of Medicine, Catholic University of Korea, Seoul, Korea 131-700 and Research Institute of Biomedical Engineering, Catholic University of Korea, Seoul, 131-700 (Korea, Republic of); Department of Radiation Oncology, Stanford University, Stanford, California 94305 (United States); Department of Radiation Oncology, Stanford University, Stanford, California 94305 (United States) and Department of Radiation Oncology, Asan Medical Center, Seoul, 138-736 (Korea, Republic of); Department of Biomedical Engineering, College of Medicine, Catholic University of Korea, Seoul, 131-700 and Research Institute of Biomedical Engineering, Catholic University of Korea, Seoul, 131-700 (Korea, Republic of); Department of Radiation Oncology, Stanford University, Stanford, California 94305 (United States) and Radiation Physics Laboratory, Sydney Medical School, University of Sydney, 2006 (Australia)

    2011-07-15

    Purpose: In dynamic multileaf collimator (MLC) motion tracking with complex intensity-modulated radiation therapy (IMRT) fields, target motion perpendicular to the MLC leaf travel direction can cause beam holds, which increase beam delivery time by up to a factor of 4. As a means to balance delivery efficiency and accuracy, a moving average algorithm was incorporated into a dynamic MLC motion tracking system (i.e., moving average tracking) to account for target motion perpendicular to the MLC leaf travel direction. The experimental investigation of the moving average algorithm compared with real-time tracking and no compensation beam delivery is described. Methods: The properties of the moving average algorithm were measured and compared with those of real-time tracking (dynamic MLC motion tracking accounting for both target motion parallel and perpendicular to the leaf travel direction) and no compensation beam delivery. The algorithm was investigated using a synthetic motion trace with a baseline drift and four patient-measured 3D tumor motion traces representing regular and irregular motions with varying baseline drifts. Each motion trace was reproduced by a moving platform. The delivery efficiency, geometric accuracy, and dosimetric accuracy were evaluated for conformal, step-and-shoot IMRT, and dynamic sliding window IMRT treatment plans using the synthetic and patient motion traces. The dosimetric accuracy was quantified via a {gamma}-test with a 3%/3 mm criterion. Results: The delivery efficiency ranged from 89 to 100% for moving average tracking, 26%-100% for real-time tracking, and 100% (by definition) for no compensation. The root-mean-square geometric error ranged from 3.2 to 4.0 mm for moving average tracking, 0.7-1.1 mm for real-time tracking, and 3.7-7.2 mm for no compensation. The percentage of dosimetric points failing the {gamma}-test ranged from 4 to 30% for moving average tracking, 0%-23% for real-time tracking, and 10%-47% for no compensation

  16. Experimental investigation of a moving averaging algorithm for motion perpendicular to the leaf travel direction in dynamic MLC target tracking

    International Nuclear Information System (INIS)

    Yoon, Jai-Woong; Sawant, Amit; Suh, Yelin; Cho, Byung-Chul; Suh, Tae-Suk; Keall, Paul

    2011-01-01

    Purpose: In dynamic multileaf collimator (MLC) motion tracking with complex intensity-modulated radiation therapy (IMRT) fields, target motion perpendicular to the MLC leaf travel direction can cause beam holds, which increase beam delivery time by up to a factor of 4. As a means to balance delivery efficiency and accuracy, a moving average algorithm was incorporated into a dynamic MLC motion tracking system (i.e., moving average tracking) to account for target motion perpendicular to the MLC leaf travel direction. The experimental investigation of the moving average algorithm compared with real-time tracking and no compensation beam delivery is described. Methods: The properties of the moving average algorithm were measured and compared with those of real-time tracking (dynamic MLC motion tracking accounting for both target motion parallel and perpendicular to the leaf travel direction) and no compensation beam delivery. The algorithm was investigated using a synthetic motion trace with a baseline drift and four patient-measured 3D tumor motion traces representing regular and irregular motions with varying baseline drifts. Each motion trace was reproduced by a moving platform. The delivery efficiency, geometric accuracy, and dosimetric accuracy were evaluated for conformal, step-and-shoot IMRT, and dynamic sliding window IMRT treatment plans using the synthetic and patient motion traces. The dosimetric accuracy was quantified via a γ-test with a 3%/3 mm criterion. Results: The delivery efficiency ranged from 89 to 100% for moving average tracking, 26%-100% for real-time tracking, and 100% (by definition) for no compensation. The root-mean-square geometric error ranged from 3.2 to 4.0 mm for moving average tracking, 0.7-1.1 mm for real-time tracking, and 3.7-7.2 mm for no compensation. The percentage of dosimetric points failing the γ-test ranged from 4 to 30% for moving average tracking, 0%-23% for real-time tracking, and 10%-47% for no compensation. Conclusions

  17. Experimental investigation of a moving averaging algorithm for motion perpendicular to the leaf travel direction in dynamic MLC target tracking.

    Science.gov (United States)

    Yoon, Jai-Woong; Sawant, Amit; Suh, Yelin; Cho, Byung-Chul; Suh, Tae-Suk; Keall, Paul

    2011-07-01

    In dynamic multileaf collimator (MLC) motion tracking with complex intensity-modulated radiation therapy (IMRT) fields, target motion perpendicular to the MLC leaf travel direction can cause beam holds, which increase beam delivery time by up to a factor of 4. As a means to balance delivery efficiency and accuracy, a moving average algorithm was incorporated into a dynamic MLC motion tracking system (i.e., moving average tracking) to account for target motion perpendicular to the MLC leaf travel direction. The experimental investigation of the moving average algorithm compared with real-time tracking and no compensation beam delivery is described. The properties of the moving average algorithm were measured and compared with those of real-time tracking (dynamic MLC motion tracking accounting for both target motion parallel and perpendicular to the leaf travel direction) and no compensation beam delivery. The algorithm was investigated using a synthetic motion trace with a baseline drift and four patient-measured 3D tumor motion traces representing regular and irregular motions with varying baseline drifts. Each motion trace was reproduced by a moving platform. The delivery efficiency, geometric accuracy, and dosimetric accuracy were evaluated for conformal, step-and-shoot IMRT, and dynamic sliding window IMRT treatment plans using the synthetic and patient motion traces. The dosimetric accuracy was quantified via a tgamma-test with a 3%/3 mm criterion. The delivery efficiency ranged from 89 to 100% for moving average tracking, 26%-100% for real-time tracking, and 100% (by definition) for no compensation. The root-mean-square geometric error ranged from 3.2 to 4.0 mm for moving average tracking, 0.7-1.1 mm for real-time tracking, and 3.7-7.2 mm for no compensation. The percentage of dosimetric points failing the gamma-test ranged from 4 to 30% for moving average tracking, 0%-23% for real-time tracking, and 10%-47% for no compensation. The delivery efficiency of

  18. Improving the Penetration of Wind Power with Dynamic Thermal Rating System, Static VAR Compensator and Multi-Objective Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Jiashen Teh

    2018-04-01

    Full Text Available The integration of renewable energy sources, especially wind energy, has been on the rise throughout power systems worldwide. Due to this relatively new introduction, the integration of wind energy is often not optimized. Moreover, owing to the technical constraints and transmission congestions of the power network, most of the wind energy has to be curtailed. Due to various factors that influence the connectivity of wind energy, this paper proposes a well-organized posterior multi-objective (MO optimization algorithm for maximizing the connections of wind energy. In this regard, the dynamic thermal rating (DTR system and the static VAR compensator (SVC have been identified as effective tools for improving the loadability of the network. The propose MO algorithm in this paper aims to minimize: (1 wind energy curtailment, (2 operation cost of the network considering all investments and operations, also known as the total social cost, and (3 SVC operation cost. The proposed MO problem was solved using the non-dominated sorting genetic algorithm (NSGA II and it was tested on the modified IEEE reliability test system (IEEE-RTS. The results demonstrate the applicability of the proposed algorithm in aiding power system enhancement planning for integrating wind energy.

  19. Improved genetic algorithm for economic load dispatch in hydropower plants and comprehensive performance comparison with dynamic programming method

    Science.gov (United States)

    Shang, Yizi; Lu, Shibao; Gong, Jiaguo; Liu, Ronghua; Li, Xiang; Fan, Qixiang

    2017-11-01

    This paper presents a practical genetic algorithm (GA)-based solution for solving the economic load dispatch problem (ELDP) and further compares the performance of the improved GA (IGA) with that of dynamic programming (DP). Specifically, their performance is comprehensively evaluated in terms of addressing the ELDP through a case study of 26 turbines in the Three Gorges Hydropower Plant with a focus on calculation accuracy, calculation time, and algorithm stability. Evaluation results show that the improved GA method can significantly reduce the ineffectiveness of the GA in current use and could avoid the running of the turbines in the cavitation/vibration zone, thereby ensuring the safety of the turbines during generating operations. Further, the analysis comparing the performance of the IGA and DP show that the IGA is superior to DP when a small number of turbines are involved. However, as the number of turbines increases, the IGA requires more calculation time than DP; moreover, its calculation accuracy and convergence rate are significantly reduced. It is difficult to guarantee the stability of IGA in high-dimension space even though the population grows, on account of the exponential expansion of the calculation dimension, the algorithm's premature convergence, and the lack of a local search capability. The improvement of the GA as well as the evaluation method proposed in this paper provide a new approach for choosing and improving optimization algorithms to solve the ELDP of large-scale hydropower plants.

  20. Comparison of Different Post-Processing Algorithms for Dynamic Susceptibility Contrast Perfusion Imaging of Cerebral Gliomas.

    Science.gov (United States)

    Kudo, Kohsuke; Uwano, Ikuko; Hirai, Toshinori; Murakami, Ryuji; Nakamura, Hideo; Fujima, Noriyuki; Yamashita, Fumio; Goodwin, Jonathan; Higuchi, Satomi; Sasaki, Makoto

    2017-04-10

    The purpose of the present study was to compare different software algorithms for processing DSC perfusion images of cerebral tumors with respect to i) the relative CBV (rCBV) calculated, ii) the cutoff value for discriminating low- and high-grade gliomas, and iii) the diagnostic performance for differentiating these tumors. Following approval of institutional review board, informed consent was obtained from all patients. Thirty-five patients with primary glioma (grade II, 9; grade III, 8; and grade IV, 18 patients) were included. DSC perfusion imaging was performed with 3-Tesla MRI scanner. CBV maps were generated by using 11 different algorithms of four commercially available software and one academic program. rCBV of each tumor compared to normal white matter was calculated by ROI measurements. Differences in rCBV value were compared between algorithms for each tumor grade. Receiver operator characteristics analysis was conducted for the evaluation of diagnostic performance of different algorithms for differentiating between different grades. Several algorithms showed significant differences in rCBV, especially for grade IV tumors. When differentiating between low- (II) and high-grade (III/IV) tumors, the area under the ROC curve (Az) was similar (range 0.85-0.87), and there were no significant differences in Az between any pair of algorithms. In contrast, the optimal cutoff values varied between algorithms (range 4.18-6.53). rCBV values of tumor and cutoff values for discriminating low- and high-grade gliomas differed between software packages, suggesting that optimal software-specific cutoff values should be used for diagnosis of high-grade gliomas.

  1. An Improved Fast Flocking Algorithm with Obstacle Avoidance for Multiagent Dynamic Systems

    Directory of Open Access Journals (Sweden)

    Jialiang Wang

    2014-01-01

    Full Text Available Flocking behavior is a common phenomenon in nature, such as flocks of birds and groups of fish. In order to make the agents effectively avoid obstacles and fast form flocking towards the direction of destination point, this paper proposes a fast multiagent obstacle avoidance (FMOA algorithm. FMOA is illustrated based on the status of whether the flocking has formed. If flocking has not formed, agents should avoid the obstacles toward the direction of target. If otherwise, these agents have reached the state of lattice and then these agents only need to avoid the obstacles and ignore the direction of target. The experimental results show that the proposed FMOA algorithm has better performance in terms of flocking path length. Furthermore, the proposed FMOA algorithm is applied to the formation flying of quad-rotor helicopters. Compared with other technologies to perform the localization of quad-rotor helicopter, this paper innovatively constructs a smart environment by deploying some wireless sensor network (WSN nodes using the proposed localization algorithm. Finally, the proposed FMOA algorithm is used to conduct the formation flying of these quad-rotor helicopters in the smart environment.

  2. A Nonlinear, Six-Degree of Freedom Precision Formation Control Algorithm, Based on Restricted Three Body Dynamics

    Science.gov (United States)

    Bauer, Frank (Technical Monitor); Luquette, Richard J.; Sanner, Robert M.

    2003-01-01

    Precision Formation Flying is an enabling technology for a variety of proposed space-based observatories, including the Micro-Arcsecond X-ray Imaging Mission (MAXIM), the associated MAXIM pathfinder mission, and the Stellar Imager. An essential element of the technology is the control algorithm. This paper discusses the development of a nonlinear, six-degree of freedom (6DOF) control algorithm for maintaining the relative position and attitude of a spacecraft within a formation. The translation dynamics are based on the equations of motion for the restricted three body problem. The control law guarantees the tracking error convergences to zero, based on a Lyapunov analysis. The simulation, modelled after the MAXIM Pathfinder mission, maintains the relative position and attitude of a Follower spacecraft with respect to a Leader spacecraft, stationed near the L2 libration point in the Sun-Earth system.

  3. A Dynamic Programming Algorithm for Finding the Optimal Placement of a Secondary Structure Topology in Cryo-EM Data.

    Science.gov (United States)

    Biswas, Abhishek; Ranjan, Desh; Zubair, Mohammad; He, Jing

    2015-09-01

    The determination of secondary structure topology is a critical step in deriving the atomic structures from the protein density maps obtained from electron cryomicroscopy technique. This step often relies on matching the secondary structure traces detected from the protein density map to the secondary structure sequence segments predicted from the amino acid sequence. Due to inaccuracies in both sources of information, a pool of possible secondary structure positions needs to be sampled. One way to approach the problem is to first derive a small number of possible topologies using existing matching algorithms, and then find the optimal placement for each possible topology. We present a dynamic programming method of Θ(Nq(2)h) to find the optimal placement for a secondary structure topology. We show that our algorithm requires significantly less computational time than the brute force method that is in the order of Θ(q(N) h).

  4. Dynamic Analysis of the High Speed Train and Slab Track Nonlinear Coupling System with the Cross Iteration Algorithm

    Directory of Open Access Journals (Sweden)

    Xiaoyan Lei

    2016-01-01

    Full Text Available A model for dynamic analysis of the vehicle-track nonlinear coupling system is established by the finite element method. The whole system is divided into two subsystems: the vehicle subsystem and the track subsystem. Coupling of the two subsystems is achieved by equilibrium conditions for wheel-to-rail nonlinear contact forces and geometrical compatibility conditions. To solve the nonlinear dynamics equations for the vehicle-track coupling system, a cross iteration algorithm and a relaxation technique are presented. Examples of vibration analysis of the vehicle and slab track coupling system induced by China’s high speed train CRH3 are given. In the computation, the influences of linear and nonlinear wheel-to-rail contact models and different train speeds are considered. It is found that the cross iteration algorithm and the relaxation technique have the following advantages: simple programming; fast convergence; shorter computation time; and greater accuracy. The analyzed dynamic responses for the vehicle and the track with the wheel-to-rail linear contact model are greater than those with the wheel-to-rail nonlinear contact model, where the increasing range of the displacement and the acceleration is about 10%, and the increasing range of the wheel-to-rail contact force is less than 5%.

  5. Parallel algorithm of trigonometric collocation method in nonlinear dynamics of rotors

    Directory of Open Access Journals (Sweden)

    Musil T.

    2007-11-01

    Full Text Available A parallel algorithm of a numeric procedure based on a method of trigonometric collocation is presented for investigating an unbalance response of a rotor supported by journal bearings. After a condensation process the trigonometric collocation method results in a set of nonlinear algebraic equations which is solved by the Newton-Raphson method. The order of the set is proportional to the number of nonlinear bearing coordinates and terms of the finite Fourier series. The algorithm, realized in the MATLAB parallel computing environment (DCT/DCE, uses message passing technique for interacting among processes on nodes of a parallel computer. This technique enables portability of the source code both on parallel computers with distributed and shared memory. Tests, made on a Beowulf cluster and a symmetric multiprocessor, have revealed very good speed-up and scalability of this algorithm.

  6. Stable reduced-order models of generalized dynamical systems using coordinate-transformed Arnoldi algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Silveira, L.M.; Kamon, M.; Elfadel, I.; White, J. [Massachusetts Inst. of Technology, Cambridge, MA (United States)

    1996-12-31

    Model order reduction based on Krylov subspace iterative methods has recently emerged as a major tool for compressing the number of states in linear models used for simulating very large physical systems (VLSI circuits, electromagnetic interactions). There are currently two main methods for accomplishing such a compression: one is based on the nonsymmetric look-ahead Lanczos algorithm that gives a numerically stable procedure for finding Pade approximations, while the other is based on a less well characterized Arnoldi algorithm. In this paper, we show that for certain classes of generalized state-space systems, the reduced-order models produced by a coordinate-transformed Arnoldi algorithm inherit the stability of the original system. Complete Proofs of our results will be given in the final paper.

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

  8. An algorithm for gradient-based dynamic optimization of UV flash processes

    DEFF Research Database (Denmark)

    Ritschel, Tobias Kasper Skovborg; Capolei, Andrea; Gaspar, Jozsef

    2017-01-01

    This paper presents a novel single-shooting algorithm for gradient-based solution of optimal control problems with vapor-liquid equilibrium constraints. Such optimal control problems are important in several engineering applications, for instance in control of distillation columns, in certain two...

  9. On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling

    DEFF Research Database (Denmark)

    Neumann, Frank; Witt, Carsten

    2015-01-01

    combinatorial optimization problem, namely makespan scheduling. We study the model of a strong adversary which is allowed to change one job at regular intervals. Furthermore, we investigate the setting of random changes. Our results show that randomized local search and a simple evolutionary algorithm are very...

  10. A dynamic programming algorithm for identification of triplex-forming sequences.

    Science.gov (United States)

    Lexa, Matej; Martínek, Tomáš; Burgetová, Ivana; Kopeček, Daniel; Brázdová, Marie

    2011-09-15

    Current methods for identification of potential triplex-forming sequences in genomes and similar sequence sets rely primarily on detecting homopurine and homopyrimidine tracts. Procedures capable of detecting sequences supporting imperfect, but structurally feasible intramolecular triplex structures are needed for better sequence analysis. We modified an algorithm for detection of approximate palindromes, so as to account for the special nature of triplex DNA structures. From available literature, we conclude that approximate triplexes tolerate two classes of errors. One, analogical to mismatches in duplex DNA, involves nucleotides in triplets that do not readily form Hoogsteen bonds. The other class involves geometrically incompatible neighboring triplets hindering proper alignment of strands for optimal hydrogen bonding and stacking. We tested the statistical properties of the algorithm, as well as its correctness when confronted with known triplex sequences. The proposed algorithm satisfactorily detects sequences with intramolecular triplex-forming potential. Its complexity is directly comparable to palindrome searching. Our implementation of the algorithm is available at http://www.fi.muni.cz/lexa/triplex as source code and a web-based search tool. The source code compiles into a library providing searching capability to other programs, as well as into a stand-alone command-line application based on this library. lexa@fi.muni.cz Supplementary data are available at Bioinformatics online.

  11. Synthesizing mixed H2/H-infinity dynamic controller using evolutionary algorithms

    DEFF Research Database (Denmark)

    Pedersen, Gerulf; Langballe, A.S.; Wisniewski, Rafal

    2001-01-01

    This paper covers the design of an Evolutionary Algorithm (EA), which should be able to synthesize a mixed H2/H-infinity. It will be shown how a system can be expressed as Matrix Inequalities (MI) and these will then be used in the design of the EA. The main objective is to examine whether a mixed...

  12. Synthesizing multi-objective H2/H-infinity dynamic controller using evolutionary algorithms

    DEFF Research Database (Denmark)

    Pedersen, Gerulf; Langballe, A.S.; Wisniewski, Rafal

    This paper covers the design of an Evolutionary Algorithm (EA), which should be able to synthesize a mixed H2/H-infinity. It will be shown how a system can be expressed as Matrix Inequalities (MI) and these will then be used in the design of the EA. The main objective is to examine whether a mixed...

  13. When algorithms shape collective action: Social media and the dynamics of cloud protesting

    NARCIS (Netherlands)

    Milan, S.

    2015-01-01

    How does the algorithmically mediated environment of social media restructure social action? This article combines social movement studies and science and technology studies to explore the role of social media in the organization, unfolding, and diffusion of contemporary protests. In particular, it

  14. Worm Algorithm simulations of the hole dynamics in the t-J model

    Science.gov (United States)

    Prokof'ev, Nikolai; Ruebenacker, Oliver

    2001-03-01

    In the limit of small J 0.4t there is an ongoing argument that at smaller J spin-charge separation is still possible. Worm algorithm Monte Carlo simulations of the hole Green function for 0.1 hole spectral function in the thermodynamic limit.

  15. Understanding Air Transportation Market Dynamics Using a Search Algorithm for Calibrating Travel Demand and Price

    Science.gov (United States)

    Kumar, Vivek; Horio, Brant M.; DeCicco, Anthony H.; Hasan, Shahab; Stouffer, Virginia L.; Smith, Jeremy C.; Guerreiro, Nelson M.

    2015-01-01

    This paper presents a search algorithm based framework to calibrate origin-destination (O-D) market specific airline ticket demands and prices for the Air Transportation System (ATS). This framework is used for calibrating an agent based model of the air ticket buy-sell process - Airline Evolutionary Simulation (Airline EVOS) -that has fidelity of detail that accounts for airline and consumer behaviors and the interdependencies they share between themselves and the NAS. More specificially, this algorithm simultaneous calibrates demand and airfares for each O-D market, to within specified threshold of a pre-specified target value. The proposed algorithm is illustrated with market data targets provided by the Transportation System Analysis Model (TSAM) and Airline Origin and Destination Survey (DB1B). Although we specify these models and datasources for this calibration exercise, the methods described in this paper are applicable to calibrating any low-level model of the ATS to some other demand forecast model-based data. We argue that using a calibration algorithm such as the one we present here to synchronize ATS models with specialized forecast demand models, is a powerful tool for establishing credible baseline conditions in experiments analyzing the effects of proposed policy changes to the ATS.

  16. A phi-competitive algorithm for collecting items with increasing weights from a dynamic queue

    Czech Academy of Sciences Publication Activity Database

    Bienkowski, M.; Chrobak, M.; Dürr, Ch.; Hurand, M.; Jeż, A.; Jeż, Łukasz; Stachowiak, G.

    2013-01-01

    Roč. 475, 4 March (2013), s. 92-102 ISSN 0304-3975 Institutional support: RVO:67985840 Keywords : online algorithms * competitive analysis * buffer management Subject RIV: BA - General Mathematics Impact factor: 0.516, year: 2013 http://www.sciencedirect.com/science/article/pii/S0304397513000121

  17. Pre-emptive resource-constrained multimode project scheduling using genetic algorithm: A dynamic forward approach

    Directory of Open Access Journals (Sweden)

    Aidin Delgoshaei

    2016-09-01

    Full Text Available Purpose: The issue resource over-allocating is a big concern for project engineers in the process of scheduling project activities. Resource over-allocating drawback is frequently seen after scheduling of a project in practice which causes a schedule to be useless. Modifying an over-allocated schedule is very complicated and needs a lot of efforts and time. In this paper, a new and fast tracking method is proposed to schedule large scale projects which can help project engineers to schedule the project rapidly and with more confidence. Design/methodology/approach: In this article, a forward approach for maximizing net present value (NPV in multi-mode resource constrained project scheduling problem while assuming discounted positive cash flows (MRCPSP-DCF is proposed. The progress payment method is used and all resources are considered as pre-emptible. The proposed approach maximizes NPV using unscheduled resources through resource calendar in forward mode. For this purpose, a Genetic Algorithm is applied to solve. Findings: The findings show that the proposed method is an effective way to maximize NPV in MRCPSP-DCF problems while activity splitting is allowed. The proposed algorithm is very fast and can schedule experimental cases with 1000 variables and 100 resources in few seconds. The results are then compared with branch and bound method and simulated annealing algorithm and it is found the proposed genetic algorithm can provide results with better quality. Then algorithm is then applied for scheduling a hospital in practice. Originality/value: The method can be used alone or as a macro in Microsoft Office Project® Software to schedule MRCPSP-DCF problems or to modify resource over-allocated activities after scheduling a project. This can help project engineers to schedule project activities rapidly with more accuracy in practice.

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

    International Nuclear Information System (INIS)

    Smith, Kyle K. G.; Poulsen, Jens Aage; Nyman, Gunnar; Rossky, Peter J.

    2015-01-01

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

  19. A massively parallel algorithm for the solution of constrained equations of motion with applications to large-scale, long-time molecular dynamics simulations

    Energy Technology Data Exchange (ETDEWEB)

    Fijany, A. [Jet Propulsion Lab., Pasadena, CA (United States); Coley, T.R. [Virtual Chemistry, Inc., San Diego, CA (United States); Cagin, T.; Goddard, W.A. III [California Institute of Technology, Pasadena, CA (United States)

    1997-12-31

    Successful molecular dynamics (MD) simulation of large systems (> million atoms) for long times (> nanoseconds) requires the integration of constrained equations of motion (CEOM). Constraints are used to eliminate high frequency degrees of freedom (DOF) and to allow the use of rigid bodies. Solving the CEOM allows for larger integration time-steps and helps focus the simulation on the important collective dynamics of chemical, biological, and materials systems. We explore advances in multibody dynamics which have resulted in O(N) algorithms for propagating the CEOM. However, because of their strictly sequential nature, the computational time required by these algorithms does not scale down with increased numbers of processors. We then present the new constraint force algorithm for solving the CEOM and show that this algorithm is fully parallelizable, leading to a computational cost of O(N/P+IogP) for N DOF on P processors.

  20. Path lumping: An efficient algorithm to identify metastable path channels for conformational dynamics of multi-body systems

    Science.gov (United States)

    Meng, Luming; Sheong, Fu Kit; Zeng, Xiangze; Zhu, Lizhe; Huang, Xuhui

    2017-07-01

    Constructing Markov state models from large-scale molecular dynamics simulation trajectories is a promising approach to dissect the kinetic mechanisms of complex chemical and biological processes. Combined with transition path theory, Markov state models can be applied to identify all pathways connecting any conformational states of interest. However, the identified pathways can be too complex to comprehend, especially for multi-body processes where numerous parallel pathways with comparable flux probability often coexist. Here, we have developed a path lumping method to group these parallel pathways into metastable path channels for analysis. We define the similarity between two pathways as the intercrossing flux between them and then apply the spectral clustering algorithm to lump these pathways into groups. We demonstrate the power of our method by applying it to two systems: a 2D-potential consisting of four metastable energy channels and the hydrophobic collapse process of two hydrophobic molecules. In both cases, our algorithm successfully reveals the metastable path channels. We expect this path lumping algorithm to be a promising tool for revealing unprecedented insights into the kinetic mechanisms of complex multi-body processes.

  1. Enhanced TDMA Based Anti-Collision Algorithm with a Dynamic Frame Size Adjustment Strategy for Mobile RFID Readers

    Directory of Open Access Journals (Sweden)

    Kwang Cheol Shin

    2009-02-01

    Full Text Available In the fields of production, manufacturing and supply chain management, Radio Frequency Identification (RFID is regarded as one of the most important technologies. Nowadays, Mobile RFID, which is often installed in carts or forklift trucks, is increasingly being applied to the search for and checkout of items in warehouses, supermarkets, libraries and other industrial fields. In using Mobile RFID, since the readers are continuously moving, they can interfere with each other when they attempt to read the tags. In this study, we suggest a Time Division Multiple Access (TDMA based anti-collision algorithm for Mobile RFID readers. Our algorithm automatically adjusts the frame size of each reader without using manual parameters by adopting the dynamic frame size adjustment strategy when collisions occur at a reader. Through experiments on a simulated environment for Mobile RFID readers, we show that the proposed method improves the number of successful transmissions by about 228% on average, compared with Colorwave, a representative TDMA based anti-collision algorithm.

  2. Effect of regularized functions on the dynamic response of a clutch system using a high-order algorithm

    Science.gov (United States)

    Hilali, Youssef; Braikat, Bouazza; Lahmam, Hassane; Damil, Noureddine

    2017-11-01

    The main objective of this work is to propose some regularization techniques for modeling contact actions in a clutch system and to solve the obtained nonlinear dynamic problem by a high-order algorithm. This device is modeled by a discrete mechanical system with eleven degrees of freedom. In several works, the discontinuous models of the contact actions are replaced by the smoothed functions using the hyperbolic tangent. We propose, in this work, to replace the discontinuous model by a regularized model with new continuous functions that permit us to search the solution under Taylor series expansion. This regularized model approaches better the discontinuous model than the model based on the smoothing functions, especially in the vicinity of the zone of singularities. To solve the equations of motion of discrete mechanical systems, we propose to use a high-order algorithm combining a time discretization, a change of variable based on the previous time, a homotopy transformation and Taylor series expansion in the continuation process. The results obtained by this modeling are compared with those computed by the Newton-Raphson algorithm.

  3. Enhanced TDMA Based Anti-Collision Algorithm with a Dynamic Frame Size Adjustment Strategy for Mobile RFID Readers

    Science.gov (United States)

    Shin, Kwang Cheol; Park, Seung Bo; Jo, Geun Sik

    2009-01-01

    In the fields of production, manufacturing and supply chain management, Radio Frequency Identification (RFID) is regarded as one of the most important technologies. Nowadays, Mobile RFID, which is often installed in carts or forklift trucks, is increasingly being applied to the search for and checkout of items in warehouses, supermarkets, libraries and other industrial fields. In using Mobile RFID, since the readers are continuously moving, they can interfere with each other when they attempt to read the tags. In this study, we suggest a Time Division Multiple Access (TDMA) based anti-collision algorithm for Mobile RFID readers. Our algorithm automatically adjusts the frame size of each reader without using manual parameters by adopting the dynamic frame size adjustment strategy when collisions occur at a reader. Through experiments on a simulated environment for Mobile RFID readers, we show that the proposed method improves the number of successful transmissions by about 228% on average, compared with Colorwave, a representative TDMA based anti-collision algorithm. PMID:22399942

  4. Enhanced TDMA Based Anti-Collision Algorithm with a Dynamic Frame Size Adjustment Strategy for Mobile RFID Readers.

    Science.gov (United States)

    Shin, Kwang Cheol; Park, Seung Bo; Jo, Geun Sik

    2009-01-01

    In the fields of production, manufacturing and supply chain management, Radio Frequency Identification (RFID) is regarded as one of the most important technologies. Nowadays, Mobile RFID, which is often installed in carts or forklift trucks, is increasingly being applied to the search for and checkout of items in warehouses, supermarkets, libraries and other industrial fields. In using Mobile RFID, since the readers are continuously moving, they can interfere with each other when they attempt to read the tags. In this study, we suggest a Time Division Multiple Access (TDMA) based anti-collision algorithm for Mobile RFID readers. Our algorithm automatically adjusts the frame size of each reader without using manual parameters by adopting the dynamic frame size adjustment strategy when collisions occur at a reader. Through experiments on a simulated environment for Mobile RFID readers, we show that the proposed method improves the number of successful transmissions by about 228% on average, compared with Colorwave, a representative TDMA based anti-collision algorithm.

  5. A Dynamically Adaptive Multigrid Algorithm for the Incompressible Navier-Stokes Equations - Validation and Model Problems

    Science.gov (United States)

    1991-06-01

    rates on all grids [131. This is essential in multigrid methods : violation of this condition can mean that the coarse-grid correction is grossly...project in more detail. For completeness, we give a brief outline of our multigrid algorithm here. A more com- plete description of multigrid methods is...same way as the fine-grid one except that h is replaced by 2h.) The staggcred discretization works well in the context of multigrid methods and

  6. An efficient General Transit Feed Specification (GTFS enabled algorithm for dynamic transit accessibility analysis.

    Directory of Open Access Journals (Sweden)

    S Kiavash Fayyaz S

    Full Text Available The social functions of urbanized areas are highly dependent on and supported by the convenient access to public transportation systems, particularly for the less privileged populations who have restrained auto ownership. To accurately evaluate the public transit accessibility, it is critical to capture the spatiotemporal variation of transit services. This can be achieved by measuring the shortest paths or minimum travel time between origin-destination (OD pairs at each time-of-day (e.g. every minute. In recent years, General Transit Feed Specification (GTFS data has been gaining popularity for between-station travel time estimation due to its interoperability in spatiotemporal analytics. Many software packages, such as ArcGIS, have developed toolbox to enable the travel time estimation with GTFS. They perform reasonably well in calculating travel time between OD pairs for a specific time-of-day (e.g. 8:00 AM, yet can become computational inefficient and unpractical with the increase of data dimensions (e.g. all times-of-day and large network. In this paper, we introduce a new algorithm that is computationally elegant and mathematically efficient to address this issue. An open-source toolbox written in C++ is developed to implement the algorithm. We implemented the algorithm on City of St. George's transit network to showcase the accessibility analysis enabled by the toolbox. The experimental evidence shows significant reduction on computational time. The proposed algorithm and toolbox presented is easily transferable to other transit networks to allow transit agencies and researchers perform high resolution transit performance analysis.

  7. An efficient General Transit Feed Specification (GTFS) enabled algorithm for dynamic transit accessibility analysis

    Science.gov (United States)

    Fayyaz S., S. Kiavash; Zhang, Guohui

    2017-01-01

    The social functions of urbanized areas are highly dependent on and supported by the convenient access to public transportation systems, particularly for the less privileged populations who have restrained auto ownership. To accurately evaluate the public transit accessibility, it is critical to capture the spatiotemporal variation of transit services. This can be achieved by measuring the shortest paths or minimum travel time between origin-destination (OD) pairs at each time-of-day (e.g. every minute). In recent years, General Transit Feed Specification (GTFS) data has been gaining popularity for between-station travel time estimation due to its interoperability in spatiotemporal analytics. Many software packages, such as ArcGIS, have developed toolbox to enable the travel time estimation with GTFS. They perform reasonably well in calculating travel time between OD pairs for a specific time-of-day (e.g. 8:00 AM), yet can become computational inefficient and unpractical with the increase of data dimensions (e.g. all times-of-day and large network). In this paper, we introduce a new algorithm that is computationally elegant and mathematically efficient to address this issue. An open-source toolbox written in C++ is developed to implement the algorithm. We implemented the algorithm on City of St. George’s transit network to showcase the accessibility analysis enabled by the toolbox. The experimental evidence shows significant reduction on computational time. The proposed algorithm and toolbox presented is easily transferable to other transit networks to allow transit agencies and researchers perform high resolution transit performance analysis. PMID:28981544

  8. Dynamic acoustics for the STAR-100. [computer algorithms for time dependent sound waves in jet

    Science.gov (United States)

    Bayliss, A.; Turkel, E.

    1979-01-01

    An algorithm is described to compute time dependent acoustic waves in a jet. The method differs from previous methods in that no harmonic time dependence is assumed, thus permitting the study of nonharmonic acoustical behavior. Large grids are required to resolve the acoustic waves. Since the problem is nonstiff, explicit high order schemes can be used. These have been adapted to the STAR-100 with great efficiencies and permitted the efficient solution of problems which would not be feasible on a scalar machine.

  9. Review of Methods and Algorithms for Dynamic Management of CBRNE Collection Assets

    Science.gov (United States)

    2013-07-01

    Li (2000). Note that SAA for UAVs is not a mature technology in the DoD. AFRL’s SAA architecture contains an algorithm called MuSICA (Multi-Sensor...SWOrRD.html. Graham, S., and J. Kay. 2012. Multi-Sensor Integrated Conflict Avoidance ( MuSICA ): 2012 International Test and Evaluation Association...moving target indicator MuSICA Multi-Sensor Integrated Conflict Avoidance MVOI multivariate optimal interpolation MVU maximum variance unfolding

  10. Comprehensive proton dose algorithm using pencil beam redefinition and recursive dynamic splitting

    OpenAIRE

    Gottschalk, Bernard

    2016-01-01

    We compute, from first principles, the absolute dose or fluence distribution per incident proton charge in a known heterogeneous terrain exposed to known proton beams. The algorithm is equally amenable to scattered or scanned beams. All objects in the terrain (including collimators) are sliced into slabs, of any convenient thickness, perpendicular to the nominal beam direction. Transport is by standard Fermi-Eyges theory. Transverse heterogeneities are handled by breaking up pencil beams (PBs...

  11. When algorithms shape collective action: Social media and the dynamics of cloud protesting

    OpenAIRE

    Milan, S.

    2015-01-01

    How does the algorithmically mediated environment of social media restructure social action? This article combines social movement studies and science and technology studies to explore the role of social media in the organization, unfolding, and diffusion of contemporary protests. In particular, it examines how activists leverage the technical properties of social media to develop a joint narrative and a collective identity. To this end, it offers the notion of cloud protesting as a theoretic...

  12. Prediction of China's coal production-environmental pollution based on a hybrid genetic algorithm-system dynamics model

    International Nuclear Information System (INIS)

    Yu Shiwei; Wei Yiming

    2012-01-01

    This paper proposes a hybrid model based on genetic algorithm (GA) and system dynamics (SD) for coal production–environmental pollution load in China. GA has been utilized in the optimization of the parameters of the SD model to reduce implementation subjectivity. The chain of “Economic development–coal demand–coal production–environmental pollution load” of China in 2030 was predicted, and scenarios were analyzed. Results show that: (1) GA performs well in optimizing the parameters of the SD model objectively and in simulating the historical data; (2) The demand for coal energy continuously increases, although the coal intensity has actually decreased because of China's persistent economic development. Furthermore, instead of reaching a turning point by 2030, the environmental pollution load continuously increases each year even under the scenario where coal intensity decreased by 20% and investment in pollution abatement increased by 20%; (3) For abating the amount of “three types of wastes”, reducing the coal intensity is more effective than reducing the polluted production per tonne of coal and increasing investment in pollution control. - Highlights: ► We propos a GA-SD model for China's coal production-pollution prediction. ► Genetic algorithm (GA) can objectively and accurately optimize parameters of system dynamics (SD) model. ► Environmental pollution in China is projected to grow in our scenarios by 2030. ► The mechanism of reducing waste production per tonne of coal mining is more effective than others.

  13. A stable algorithm for calculating phase equilibria with capillarity at specified moles, volume and temperature using a dynamic model

    KAUST Repository

    Kou, Jisheng

    2017-09-30

    Capillary pressure can significantly affect the phase properties and flow of liquid-gas fluids in porous media, and thus, the phase equilibrium calculation incorporating capillary pressure is crucial to simulate such problems accurately. Recently, the phase equilibrium calculation at specified moles, volume and temperature (NVT-flash) becomes an attractive issue. In this paper, capillarity is incorporated into the phase equilibrium calculation at specified moles, volume and temperature. A dynamical model for such problem is developed for the first time by using the laws of thermodynamics and Onsager\\'s reciprocal principle. This model consists of the evolutionary equations for moles and volume, and it can characterize the evolutionary process from a non-equilibrium state to an equilibrium state in the presence of capillarity effect at specified moles, volume and temperature. The phase equilibrium equations are naturally derived. To simulate the proposed dynamical model efficiently, we adopt the convex-concave splitting of the total Helmholtz energy, and propose a thermodynamically stable numerical algorithm, which is proved to preserve the second law of thermodynamics at the discrete level. Using the thermodynamical relations, we derive a phase stability condition with capillarity effect at specified moles, volume and temperature. Moreover, we propose a stable numerical algorithm for the phase stability testing, which can provide the feasible initial conditions. The performance of the proposed methods in predicting phase properties under capillarity effect is demonstrated on various cases of pure substance and mixture systems.

  14. Development of GPS Receiver Kalman Filter Algorithms for Stationary, Low-Dynamics, and High-Dynamics Applications

    Science.gov (United States)

    2016-06-01

    Defence Science and Technology Organisation in 1986. His major areas of work were adaptive tracking, sig- nal processing, and radar systems engineering...to quite unpredictable behaviour . This issue, and its solution, is in- vestigated, and another version of the high dynamics filter is presented...that, for the simulations consid- ered, the primary cause of the incorrect behaviour of the standard form filter is the effects of numerical error on the

  15. Local pursuit strategy-inspired cooperative trajectory planning algorithm for a class of nonlinear constrained dynamical systems

    Science.gov (United States)

    Xu, Yunjun; Remeikas, Charles; Pham, Khanh

    2014-03-01

    Cooperative trajectory planning is crucial for networked vehicles to respond rapidly in cluttered environments and has a significant impact on many applications such as air traffic or border security monitoring and assessment. One of the challenges in cooperative planning is to find a computationally efficient algorithm that can accommodate both the complexity of the environment and real hardware and configuration constraints of vehicles in the formation. Inspired by a local pursuit strategy observed in foraging ants, feasible and optimal trajectory planning algorithms are proposed in this paper for a class of nonlinear constrained cooperative vehicles in environments with densely populated obstacles. In an iterative hierarchical approach, the local behaviours, such as the formation stability, obstacle avoidance, and individual vehicle's constraints, are considered in each vehicle's (i.e. follower's) decentralised optimisation. The cooperative-level behaviours, such as the inter-vehicle collision avoidance, are considered in the virtual leader's centralised optimisation. Early termination conditions are derived to reduce the computational cost by not wasting time in the local-level optimisation if the virtual leader trajectory does not satisfy those conditions. The expected advantages of the proposed algorithms are (1) the formation can be globally asymptotically maintained in a decentralised manner; (2) each vehicle decides its local trajectory using only the virtual leader and its own information; (3) the formation convergence speed is controlled by one single parameter, which makes it attractive for many practical applications; (4) nonlinear dynamics and many realistic constraints, such as the speed limitation and obstacle avoidance, can be easily considered; (5) inter-vehicle collision avoidance can be guaranteed in both the formation transient stage and the formation steady stage; and (6) the computational cost in finding both the feasible and optimal

  16. An accurate and rapid continuous wavelet dynamic time warping algorithm for unbalanced global mapping in nanopore sequencing

    KAUST Repository

    Han, Renmin

    2017-12-24

    Long-reads, point-of-care, and PCR-free are the promises brought by nanopore sequencing. Among various steps in nanopore data analysis, the global mapping between the raw electrical current signal sequence and the expected signal sequence from the pore model serves as the key building block to base calling, reads mapping, variant identification, and methylation detection. However, the ultra-long reads of nanopore sequencing and an order of magnitude difference in the sampling speeds of the two sequences make the classical dynamic time warping (DTW) and its variants infeasible to solve the problem. Here, we propose a novel multi-level DTW algorithm, cwDTW, based on continuous wavelet transforms with different scales of the two signal sequences. Our algorithm starts from low-resolution wavelet transforms of the two sequences, such that the transformed sequences are short and have similar sampling rates. Then the peaks and nadirs of the transformed sequences are extracted to form feature sequences with similar lengths, which can be easily mapped by the original DTW. Our algorithm then recursively projects the warping path from a lower-resolution level to a higher-resolution one by building a context-dependent boundary and enabling a constrained search for the warping path in the latter. Comprehensive experiments on two real nanopore datasets on human and on Pandoraea pnomenusa, as well as two benchmark datasets from previous studies, demonstrate the efficiency and effectiveness of the proposed algorithm. In particular, cwDTW can almost always generate warping paths that are very close to the original DTW, which are remarkably more accurate than the state-of-the-art methods including FastDTW and PrunedDTW. Meanwhile, on the real nanopore datasets, cwDTW is about 440 times faster than FastDTW and 3000 times faster than the original DTW. Our program is available at https://github.com/realbigws/cwDTW.

  17. CCM Continuity Constraint Method: A finite-element computational fluid dynamics algorithm for incompressible Navier-Stokes fluid flows

    Energy Technology Data Exchange (ETDEWEB)

    Williams, P. T. [Univ. of Tennessee, Knoxville, TN (United States)

    1993-09-01

    As the field of computational fluid dynamics (CFD) continues to mature, algorithms are required to exploit the most recent advances in approximation theory, numerical mathematics, computing architectures, and hardware. Meeting this requirement is particularly challenging in incompressible fluid mechanics, where primitive-variable CFD formulations that are robust, while also accurate and efficient in three dimensions, remain an elusive goal. This dissertation asserts that one key to accomplishing this goal is recognition of the dual role assumed by the pressure, i.e., a mechanism for instantaneously enforcing conservation of mass and a force in the mechanical balance law for conservation of momentum. Proving this assertion has motivated the development of a new, primitive-variable, incompressible, CFD algorithm called the Continuity Constraint Method (CCM). The theoretical basis for the CCM consists of a finite-element spatial semi-discretization of a Galerkin weak statement, equal-order interpolation for all state-variables, a 0-implicit time-integration scheme, and a quasi-Newton iterative procedure extended by a Taylor Weak Statement (TWS) formulation for dispersion error control. Original contributions to algorithmic theory include: (a) formulation of the unsteady evolution of the divergence error, (b) investigation of the role of non-smoothness in the discretized continuity-constraint function, (c) development of a uniformly H1 Galerkin weak statement for the Reynolds-averaged Navier-Stokes pressure Poisson equation, (d) derivation of physically and numerically well-posed boundary conditions, and (e) investigation of sparse data structures and iterative methods for solving the matrix algebra statements generated by the algorithm.

  18. BROMOCEA Code: An Improved Grand Canonical Monte Carlo/Brownian Dynamics Algorithm Including Explicit Atoms.

    Science.gov (United States)

    Solano, Carlos J F; Pothula, Karunakar R; Prajapati, Jigneshkumar D; De Biase, Pablo M; Noskov, Sergei Yu; Kleinekathöfer, Ulrich

    2016-05-10

    All-atom molecular dynamics simulations have a long history of applications studying ion and substrate permeation across biological and artificial pores. While offering unprecedented insights into the underpinning transport processes, MD simulations are limited in time-scales and ability to simulate physiological membrane potentials or asymmetric salt solutions and require substantial computational power. While several approaches to circumvent all of these limitations were developed, Brownian dynamics simulations remain an attractive option to the field. The main limitation, however, is an apparent lack of protein flexibility important for the accurate description of permeation events. In the present contribution, we report an extension of the Brownian dynamics scheme which includes conformational dynamics. To achieve this goal, the dynamics of amino-acid residues was incorporated into the many-body potential of mean force and into the Langevin equations of motion. The developed software solution, called BROMOCEA, was applied to ion transport through OmpC as a test case. Compared to fully atomistic simulations, the results show a clear improvement in the ratio of permeating anions and cations. The present tests strongly indicate that pore flexibility can enhance permeation properties which will become even more important in future applications to substrate translocation.

  19. Measurement correction method for force sensor used in dynamic pressure calibration based on artificial neural network optimized by genetic algorithm

    Science.gov (United States)

    Gu, Tingwei; Kong, Deren; Shang, Fei; Chen, Jing

    2017-12-01

    We present an optimization algorithm to obtain low-uncertainty dynamic pressure measurements from a force-transducer-based device. In this paper, the advantages and disadvantages of the methods that are commonly used to measure the propellant powder gas pressure, the applicable scope of dynamic pressure calibration devices, and the shortcomings of the traditional comparison calibration method based on the drop-weight device are firstly analysed in detail. Then, a dynamic calibration method for measuring pressure using a force sensor based on a drop-weight device is introduced. This method can effectively save time when many pressure sensors are calibrated simultaneously and extend the life of expensive reference sensors. However, the force sensor is installed between the drop-weight and the hammerhead by transition pieces through the connection mode of bolt fastening, which causes adverse effects such as additional pretightening and inertia forces. To solve these effects, the influence mechanisms of the pretightening force, the inertia force and other influence factors on the force measurement are theoretically analysed. Then a measurement correction method for the force measurement is proposed based on an artificial neural network optimized by a genetic algorithm. The training and testing data sets are obtained from calibration tests, and the selection criteria for the key parameters of the correction model is discussed. The evaluation results for the test data show that the correction model can effectively improve the force measurement accuracy of the force sensor. Compared with the traditional high-accuracy comparison calibration method, the percentage difference of the impact-force-based measurement is less than 0.6% and the relative uncertainty of the corrected force value is 1.95%, which can meet the requirements of engineering applications.

  20. Comparison of multiobjective evolutionary algorithms for optimization of externalities by using dynamic traffic management measures.

    NARCIS (Netherlands)

    Wismans, Luc Johannes Josephus; van Berkum, Eric C.; Bliemer, M.C.J.

    2011-01-01

    The externalities of traffic are increasingly important for policy decisions related to design of a road network. Optimization of externalities with dynamic traffic management measures influencing the supply of infrastructure is a multiobjective network design problem, which in turn is a bi-level

  1. A parallel neural network training algorithm for control of discrete dynamical systems.

    Energy Technology Data Exchange (ETDEWEB)

    Gordillo, J. L.; Hanebutte, U. R.; Vitela, J. E.

    1998-01-20

    In this work we present a parallel neural network controller training code, that uses MPI, a portable message passing environment. A comprehensive performance analysis is reported which compares results of a performance model with actual measurements. The analysis is made for three different load assignment schemes: block distribution, strip mining and a sliding average bin packing (best-fit) algorithm. Such analysis is crucial since optimal load balance can not be achieved because the work load information is not available a priori. The speedup results obtained with the above schemes are compared with those corresponding to the bin packing load balance scheme with perfect load prediction based on a priori knowledge of the computing effort. Two multiprocessor platforms: a SGI/Cray Origin 2000 and a IBM SP have been utilized for this study. It is shown that for the best load balance scheme a parallel efficiency of over 50% for the entire computation is achieved by 17 processors of either parallel computers.

  2. Dynamic Consensus Algorithm based Distributed Voltage Harmonic Compensation in Islanded Microgrids

    DEFF Research Database (Denmark)

    Meng, Lexuan; Tang, Fen; Firoozabadi, Mehdi Savaghebi

    2015-01-01

    control to realize voltage harmonic compensation and accurate current sharing in multi-bus islanded microgrids. Low order harmonic components are considered as examples in this paper. Harmonic current sharing is also realized among distributed generators by applying the proposed methods. Plug......In islanded microgrids, the existence of nonlinear electric loads may cause voltage distortion and affect the performance of power quality sensitive equipment. Thanks to the prevalent utilization of interfacing power electronic devices and information/communication technologies, distributed...... generators can be employed as compensators to enhance the power quality on consumer side. However, conventional centralized control is facing obstacles because of the distributed fashion of generation and consumption. Accordingly, this paper proposes a consensus algorithm based distributed hierarchical...

  3. The Splashback Radius of Halos from Particle Dynamics. I. The SPARTA Algorithm

    Science.gov (United States)

    Diemer, Benedikt

    2017-07-01

    Motivated by the recent proposal of the splashback radius as a physical boundary of dark-matter halos, we present a parallel computer code for Subhalo and PARticle Trajectory Analysis (SPARTA). The code analyzes the orbits of all simulation particles in all host halos, billions of orbits in the case of typical cosmological N-body simulations. Within this general framework, we develop an algorithm that accurately extracts the location of the first apocenter of particles after infall into a halo, or splashback. We define the splashback radius of a halo as the smoothed average of the apocenter radii of individual particles. This definition allows us to reliably measure the splashback radii of 95% of host halos above a resolution limit of 1000 particles. We show that, on average, the splashback radius and mass are converged to better than 5% accuracy with respect to mass resolution, snapshot spacing, and all free parameters of the method.

  4. A Component Mode Synthesis Algorithm for Multibody Dynamics of Wind Turbines

    DEFF Research Database (Denmark)

    Holm-Jørgensen, Kristian; Nielsen, Søren R.K.

    2009-01-01

    A system reduction scheme related to a multibody formulation of wind turbine dynamics is devised. Each substructure is described in its own frame of reference, which is moving freely in the vicinity of the moving substructure, in principle without any constraints to the rigid body part of the mot......A system reduction scheme related to a multibody formulation of wind turbine dynamics is devised. Each substructure is described in its own frame of reference, which is moving freely in the vicinity of the moving substructure, in principle without any constraints to the rigid body part...... of the motion of the substructure. The system reduction is based on a component mode synthesis method, where the response of the internal degrees of freedom of the substructure is described as the quasi-static response induced by the boundary degrees of freedom via the constraint modes superimposed...

  5. A Data Transmission Algorithm Based on Dynamic Grid Division for Coal Goaf Temperature Monitoring

    Directory of Open Access Journals (Sweden)

    Qingsong Hu

    2014-01-01

    Full Text Available WSN (wireless sensor network is a perfect tool of temperature monitoring in coal goaf. Based on the three-zone theory of goaf, the GtmWSN model is proposed, and its dynamic features are analyzed. Accordingly, a data transmission scheme, named DTDGD, is worked out. Firstly, sink nodes conduct dynamic grid division on the GtmWSN according to virtual semicircle. Secondly, each node will confirm to which grid it belongs based on grid number. Finally, data will be delivered to sink nodes with greedy forward and hole avoidance. Simulation results and field data showed that the GtmWSN and DTDGD satisfied the lifetime need of goaf temperature monitoring.

  6. Ant Colony Optimization Algorithm to Dynamic Energy Management in Cloud Data Center

    Directory of Open Access Journals (Sweden)

    Shanchen Pang

    2017-01-01

    Full Text Available With the wide deployment of cloud computing data centers, the problems of power consumption have become increasingly prominent. The dynamic energy management problem in pursuit of energy-efficiency in cloud data centers is investigated. Specifically, a dynamic energy management system model for cloud data centers is built, and this system is composed of DVS Management Module, Load Balancing Module, and Task Scheduling Module. According to Task Scheduling Module, the scheduling process is analyzed by Stochastic Petri Net, and a task-oriented resource allocation method (LET-ACO is proposed, which optimizes the running time of the system and the energy consumption by scheduling tasks. Simulation studies confirm the effectiveness of the proposed system model. And the simulation results also show that, compared to ACO, Min-Min, and RR scheduling strategy, the proposed LET-ACO method can save up to 28%, 31%, and 40% energy consumption while meeting performance constraints.

  7. A Dynamic Consensus Algorithm based Low-Voltage Ride-Through Operation of Power Converters in Grid-Interactive Microgrids

    DEFF Research Database (Denmark)

    Zhao, Xin; Meng, Lexuan; Savaghebi, Mehdi

    2016-01-01

    control based voltage support strategy has been proposed to aid MGs riding through three phase asymmetrical voltage sags. However, since the line impedance from each converter to the point of common coupling (PCC) is not identical, both positive sequence and negative sequence output current......The possibility of increasing penetration level of grid-interactive microgrids (MGs) has gained a great interest over the past decade. Thus, it is critical to investigate the performance of the MGs under voltage sags, since it may induce instability to the power grid. Negative sequence droop...... of the converters cannot be equally shared if no extra current balancing loop is added. Accordingly, a dynamic consensus algorithm (DCA) based negative/positive sequence current sharing scheme is proposed in this paper. Finally, a lab-scale AC microgrid was designed and tested in the lab to validate the feasibility...

  8. Higher order explicit solutions for nonlinear dynamic model of column buckling using variational approach and variational iteration algorithm-II

    Energy Technology Data Exchange (ETDEWEB)

    Bagheri, Saman; Nikkar, Ali [University of Tabriz, Tabriz (Iran, Islamic Republic of)

    2014-11-15

    This paper deals with the determination of approximate solutions for a model of column buckling using two efficient and powerful methods called He's variational approach and variational iteration algorithm-II. These methods are used to find analytical approximate solution of nonlinear dynamic equation of a model for the column buckling. First and second order approximate solutions of the equation of the system are achieved. To validate the solutions, the analytical results have been compared with those resulted from Runge-Kutta 4th order method. A good agreement of the approximate frequencies and periodic solutions with the numerical results and the exact solution shows that the present methods can be easily extended to other nonlinear oscillation problems in engineering. The accuracy and convenience of the proposed methods are also revealed in comparisons with the other solution techniques.

  9. A Dynamic Consensus Algorithm to Adjust Virtual Impedance Loops for Discharge Rate Balancing of AC Microgrid Energy Storage Units

    DEFF Research Database (Denmark)

    Guan, Yajuan; Meng, Lexuan; Li, Chendan

    2018-01-01

    A dynamic consensus algorithm (DCA)-based coordinated secondary control with an autonomous current-sharing control strategy is proposed in this paper for balancing the discharge rate of energy storage systems (ESSs) in an islanded AC microgrid. The DCA is applied for information sharing between...... distributed generation (DG) units to regulate the output power of DGs according to the ESS capacities and state-of-charge (SoC). Power regulation is achieved by adjusting the virtual resistances of voltage-controlled inverters with an autonomous current-sharing controller. Compared with existing methods......, the proposed approach can provide higher system reliability, expandability, and flexibility due to its distributed control architecture. The proposed controller can effectively prevent operation failure caused by over-current and unintentional outage of DGs by means of balanced discharge rate control. It can...

  10. A robust construction algorithm of the centerline skeleton for complex aortic vascular structure using computational fluid dynamics.

    Science.gov (United States)

    Touati, Julien; Bologna, Marco; Schwein, Adeline; Migliavacca, Francesco; Garbey, Marc

    2017-07-01

    Centerlines of blood vessels are useful tools to make important anatomical measurements (length, diameter, area), which cannot be accurately obtained using 2D images. In this paper a brand new method for centerline extraction of vascular trees is presented. By using computational fluid dynamics (CFD) we are able to obtain a robust and purely functional centerline allowing us to support better measurements than classic purely geometrical-based centerlines. We show that the CFD-based centerline is within a few pixels from the geometrical centerline where the latter is defined (far away from inlet/outlets and from the branches). We show that the centerline computed with our method is not affected by traditional errors of other classical volume-based algorithms such as topological thinning, and could be a potential alternative to be considered for future studies. Copyright © 2017 Elsevier Ltd. All rights reserved.

  11. Equivalent construction of the infinitesimal time translation operator in algebraic dynamics algorithm for partial differential evolution equation

    Science.gov (United States)

    Liu, Chengshi

    2010-08-01

    We give an equivalent construction of the infinitesimal time translation operator for partial differential evolution equation in the algebraic dynamics algorithm proposed by Shun-Jin Wang and his students. Our construction involves only simple partial differentials and avoids the derivative terms of δ function which appear in the course of computation by means of Wang-Zhang operator. We prove Wang’s equivalent theorem which says that our construction and Wang-Zhang’s are equivalent. We use our construction to deal with several typical equations such as nonlinear advection equation, Burgers equation, nonlinear Schrodinger equation, KdV equation and sine-Gordon equation, and obtain at least second order approximate solutions to them. These equations include the cases of real and complex field variables and the cases of the first and the second order time derivatives.

  12. Application of a Dynamic Fuzzy Search Algorithm to Determine Optimal Wind Plant Sizes and Locations in Iowa

    International Nuclear Information System (INIS)

    Milligan, M. R.; Factor, T.

    2001-01-01

    This paper illustrates a method for choosing the optimal mix of wind capacity at several geographically dispersed locations. The method is based on a dynamic fuzzy search algorithm that can be applied to different optimization targets. We illustrate the method using two objective functions for the optimization: maximum economic benefit and maximum reliability. We also illustrate the sensitivity of the fuzzy economic benefit solutions to small perturbations of the capacity selections at each wind site. We find that small changes in site capacity and/or location have small effects on the economic benefit provided by wind power plants. We use electric load and generator data from Iowa, along with high-quality wind-speed data collected by the Iowa Wind Energy Institute

  13. Application of a Dynamic Fuzzy Search Algorithm to Determine Optimal Wind Plant Sizes and Locations in Iowa

    Energy Technology Data Exchange (ETDEWEB)

    Milligan, M. R., National Renewable Energy Laboratory; Factor, T., Iowa Wind Energy Institute

    2001-09-21

    This paper illustrates a method for choosing the optimal mix of wind capacity at several geographically dispersed locations. The method is based on a dynamic fuzzy search algorithm that can be applied to different optimization targets. We illustrate the method using two objective functions for the optimization: maximum economic benefit and maximum reliability. We also illustrate the sensitivity of the fuzzy economic benefit solutions to small perturbations of the capacity selections at each wind site. We find that small changes in site capacity and/or location have small effects on the economic benefit provided by wind power plants. We use electric load and generator data from Iowa, along with high-quality wind-speed data collected by the Iowa Wind Energy Institute.

  14. Comparison of two approaches for measuring household wealth via an asset-based index in rural and peri-urban settings of Hunan province, China

    Directory of Open Access Journals (Sweden)

    Balen Julie

    2010-09-01

    Full Text Available Abstract Background There are growing concerns regarding inequities in health, with poverty being an important determinant of health as well as a product of health status. Within the People's Republic of China (P.R. China, disparities in socio-economic position are apparent, with the rural-urban gap of particular concern. Our aim was to compare direct and proxy methods of estimating household wealth in a rural and a peri-urban setting of Hunan province, P.R. China. Methods We collected data on ownership of household durable assets, housing characteristics, and utility and sanitation variables in two village-wide surveys in Hunan province. We employed principal components analysis (PCA and principal axis factoring (PAF to generate household asset-based proxy wealth indices. Households were grouped into quartiles, from 'most wealthy' to 'most poor'. We compared the estimated household wealth for each approach. Asset-based proxy wealth indices were compared to those based on self-reported average annual income and savings at the household level. Results Spearman's rank correlation analysis revealed that PCA and PAF yielded similar results, indicating that either approach may be used for estimating household wealth. In both settings investigated, the two indices were significantly associated with self-reported average annual income and combined income and savings, but not with savings alone. However, low correlation coefficients between the proxy and direct measures of wealth indicated that they are not complementary. We found wide disparities in ownership of household durable assets, and utility and sanitation variables, within and between settings. Conclusion PCA and PAF yielded almost identical results and generated robust proxy wealth indices and categories. Pooled data from the rural and peri-urban settings highlighted structural differences in wealth, most likely a result of localized urbanization and modernization. Further research is needed

  15. Analysis and Classification of Stride Patterns Associated with Children Development Using Gait Signal Dynamics Parameters and Ensemble Learning Algorithms

    Directory of Open Access Journals (Sweden)

    Meihong Wu

    2016-01-01

    Full Text Available Measuring stride variability and dynamics in children is useful for the quantitative study of gait maturation and neuromotor development in childhood and adolescence. In this paper, we computed the sample entropy (SampEn and average stride interval (ASI parameters to quantify the stride series of 50 gender-matched children participants in three age groups. We also normalized the SampEn and ASI values by leg length and body mass for each participant, respectively. Results show that the original and normalized SampEn values consistently decrease over the significance level of the Mann-Whitney U test (p<0.01 in children of 3–14 years old, which indicates the stride irregularity has been significantly ameliorated with the body growth. The original and normalized ASI values are also significantly changing when comparing between any two groups of young (aged 3–5 years, middle (aged 6–8 years, and elder (aged 10–14 years children. Such results suggest that healthy children may better modulate their gait cadence rhythm with the development of their musculoskeletal and neurological systems. In addition, the AdaBoost.M2 and Bagging algorithms were used to effectively distinguish the children’s gait patterns. These ensemble learning algorithms both provided excellent gait classification results in terms of overall accuracy (≥90%, recall (≥0.8, and precision (≥0.8077.

  16. A Dynamic Enhancement With Background Reduction Algorithm: Overview and Application to Satellite-Based Dust Storm Detection

    Science.gov (United States)

    Miller, Steven D.; Bankert, Richard L.; Solbrig, Jeremy E.; Forsythe, John M.; Noh, Yoo-Jeong; Grasso, Lewis D.

    2017-12-01

    This paper describes a Dynamic Enhancement Background Reduction Algorithm (DEBRA) applicable to multispectral satellite imaging radiometers. DEBRA uses ancillary information about the clear-sky background to reduce false detections of atmospheric parameters in complex scenes. Applied here to the detection of lofted dust, DEBRA enlists a surface emissivity database coupled with a climatological database of surface temperature to approximate the clear-sky equivalent signal for selected infrared-based multispectral dust detection tests. This background allows for suppression of false alarms caused by land surface features while retaining some ability to detect dust above those problematic surfaces. The algorithm is applicable to both day and nighttime observations and enables weighted combinations of dust detection tests. The results are provided quantitatively, as a detection confidence factor [0, 1], but are also readily visualized as enhanced imagery. Utilizing the DEBRA confidence factor as a scaling factor in false color red/green/blue imagery enables depiction of the targeted parameter in the context of the local meteorology and topography. In this way, the method holds utility to both automated clients and human analysts alike. Examples of DEBRA performance from notable dust storms and comparisons against other detection methods and independent observations are presented.

  17. GENESIS 1.1: A hybrid-parallel molecular dynamics simulator with enhanced sampling algorithms on multiple computational platforms.

    Science.gov (United States)

    Kobayashi, Chigusa; Jung, Jaewoon; Matsunaga, Yasuhiro; Mori, Takaharu; Ando, Tadashi; Tamura, Koichi; Kamiya, Motoshi; Sugita, Yuji

    2017-09-30

    GENeralized-Ensemble SImulation System (GENESIS) is a software package for molecular dynamics (MD) simulation of biological systems. It is designed to extend limitations in system size and accessible time scale by adopting highly parallelized schemes and enhanced conformational sampling algorithms. In this new version, GENESIS 1.1, new functions and advanced algorithms have been added. The all-atom and coarse-grained potential energy functions used in AMBER and GROMACS packages now become available in addition to CHARMM energy functions. The performance of MD simulations has been greatly improved by further optimization, multiple time-step integration, and hybrid (CPU + GPU) computing. The string method and replica-exchange umbrella sampling with flexible collective variable choice are used for finding the minimum free-energy pathway and obtaining free-energy profiles for conformational changes of a macromolecule. These new features increase the usefulness and power of GENESIS for modeling and simulation in biological research. © 2017 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.

  18. A dynamic model of the marriage market-part 1: matching algorithm based on age preference and availability.

    Science.gov (United States)

    Matthews, A P; Garenne, M L

    2013-09-01

    The matching algorithm in a dynamic marriage market model is described in this first of two companion papers. Iterative Proportional Fitting is used to find a marriage function (an age distribution of new marriages for both sexes), in a stable reference population, that is consistent with the one-sex age distributions of new marriages, and includes age preference. The one-sex age distributions (which are the marginals of the two-sex distribution) are based on the Picrate model, and age preference on a normal distribution, both of which may be adjusted by choice of parameter values. For a population that is perturbed from the reference state, the total number of new marriages is found as the harmonic mean of target totals for men and women obtained by applying reference population marriage rates to the perturbed population. The marriage function uses the age preference function, assumed to be the same for the reference and the perturbed populations, to distribute the total number of new marriages. The marriage function also has an availability factor that varies as the population changes with time, where availability depends on the supply of unmarried men and women. To simplify exposition, only first marriage is treated, and the algorithm is illustrated by application to Zambia. In the second paper, remarriage and dissolution are included. Copyright © 2013 Elsevier Inc. All rights reserved.

  19. A Multi-Scale Method for Dynamics Simulation in Continuum Solvent Models I: Finite-Difference Algorithm for Navier-Stokes Equation.

    Science.gov (United States)

    Xiao, Li; Cai, Qin; Li, Zhilin; Zhao, Hongkai; Luo, Ray

    2014-11-25

    A multi-scale framework is proposed for more realistic molecular dynamics simulations in continuum solvent models by coupling a molecular mechanics treatment of solute with a fluid mechanics treatment of solvent. This article reports our initial efforts to formulate the physical concepts necessary for coupling the two mechanics and develop a 3D numerical algorithm to simulate the solvent fluid via the Navier-Stokes equation. The numerical algorithm was validated with multiple test cases. The validation shows that the algorithm is effective and stable, with observed accuracy consistent with our design.

  20. Combinatorial algorithms

    CERN Document Server

    Hu, T C

    2002-01-01

    Newly enlarged, updated second edition of a valuable text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discusses binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. 153 black-and-white illus. 23 tables.Newly enlarged, updated second edition of a valuable, widely used text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discussed are binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. New to this edition: Chapter 9

  1. AN IMPROVED CONTROL ALGORITHM FOR «DYNAMIC CAPACITOR» VAR COMPENSATOR

    Directory of Open Access Journals (Sweden)

    S.K. Podnebennaya

    2015-11-01

    Full Text Available Purpose. Modern approaches of VAR compensation are: using compensators with stepped regulation, STATCOMs, active power filters. Recently, more attention is paid to VAR compensator’s design based on the direct AC / AC converters, which are called dynamic capacitors. Methodology. The dynamic capacitor (D-CAP is the capacitor bank, which is connected to the mains through direct AC / AC buck converter. By varying the duty cycle of bidirectional switches, smooth control of reactive power can be achieved. However, in case of distorted mains voltage, D-CAP mains current will have a high THD. This is due to the fact that the D-CAP affects the frequency response of electric grid thus leading to the appearance of resonances. With non-sinusoidal mains voltage, capacitors are affected by harmonics. This reduces the reliability of the D-CAP, increasing the probability of their failure. To eliminate these drawbacks it is suggested to improve the D-CAP control system so that the input current of the dynamic capacitor is forced to be close to sinusoidal. This can be achieved if the duty cycle of the switching bi-directional switches is changed according to the proposed expression. Results. The research is done on a single-phase D-CAP with the proposed control system, its input current diagrams are shown. In contrast to the D-CAP with a constant duty cycle control, the resulting THD of its input current is much lower. Thus, the control system provides a form of the input current that is close to a sine wave. This reduces the influence of mains voltage harmonics on the D-CAP operation, increases its reliability and improves power quality. Originality. The proposed D-CAP control system ensures reliable operation with non-sinusoidal mains voltage. Practical value. Application of D-CAPs with the proposed control system allows for improved energy efficiency of electrical mains by providing VAR compensation and improving power quality.

  2. Dynamics Assessment of Grid-Synchronization Algorithms for Single-Phase Grid-Connected Converters

    DEFF Research Database (Denmark)

    Han, Yang; Luo, Mingyu; Guerrero, Josep M.

    2015-01-01

    and low computational burden. Meanwhile, some other techniques have been proposed to enhance system robustness and stability characteristics. In this paper, a comprehensive comparison among the OSG-based PLLs and the advanced single-phase PLLs is presented when the grid voltage undergoes disturbances......, and the performance comparison of transient response and disturbance rejection capabilities are presented. Finally, the moving average filter (MAF) is applied to enhance steady state and dynamic response of the delayed-type PLL, derivator-based PLL and the complex-coefficient filter (CCF-PLL) under grid frequency...

  3. Study on fitness functions of genetic algorithm for dynamically correcting nuclide atmospheric diffusion model

    International Nuclear Information System (INIS)

    Ji Zhilong; Ma Yuanwei; Wang Dezhong

    2014-01-01

    Background: In radioactive nuclides atmospheric diffusion models, the empirical dispersion coefficients were deduced under certain experiment conditions, whose difference with nuclear accident conditions is a source of deviation. A better estimation of the radioactive nuclide's actual dispersion process could be done by correcting dispersion coefficients with observation data, and Genetic Algorithm (GA) is an appropriate method for this correction procedure. Purpose: This study is to analyze the fitness functions' influence on the correction procedure and the forecast ability of diffusion model. Methods: GA, coupled with Lagrange dispersion model, was used in a numerical simulation to compare 4 fitness functions' impact on the correction result. Results: In the numerical simulation, the fitness function with observation deviation taken into consideration stands out when significant deviation exists in the observed data. After performing the correction procedure on the Kincaid experiment data, a significant boost was observed in the diffusion model's forecast ability. Conclusion: As the result shows, in order to improve dispersion models' forecast ability using GA, observation data should be given different weight in the fitness function corresponding to their error. (authors)

  4. Digital image processing algorithms for automated inspection of dynamic effects in roller bearings

    Science.gov (United States)

    Altmann, Bettina; Pape, Christian; Reithmeier, Eduard

    2017-06-01

    Unstable movement in roller bearings like cage or roller slip can lead to damages or eventually even to an early break of the bearing. To prevent slip, inadequate operating states should be avoided. Therefore, it is necessary to study the dynamic behavior of the bearing. Unfortunately, there is only a limited range of measurement methods for the dynamic of bearing components. Two possible approaches are using solely a high-speed camera or the combination of an optomechanical image derotator and a high-speed camera. This work focuses on a proposal which is suitable for both. Initially, the influence of the rotational velocity in the images is eliminated. In the next step the measurement data is reduced to a region of interest which displays a particular rolling-element. A rolling element is equipped with a linear marker which, in the next stage, is segmented by a thresholding method to multiple regions. The region representing the marker is extracted from the background and the position is calculated by a Principle Component Analysis. Depending on the shift of the angular position and the lag time between two images, the rotational velocity of the rolling element is calculated. Thus, it is possible to determine whether the rolling element is operating under ideal conditions. In conclusion, it can be said that this approach enables a simple and flexible non-invasive method to depict the occurrence of roller slip in roller bearings.

  5. Eigenvectors determination of the ribosome dynamics model during mRNA translation using the Kleene Star algorithm

    Science.gov (United States)

    Ernawati; Carnia, E.; Supriatna, A. K.

    2018-03-01

    Eigenvalues and eigenvectors in max-plus algebra have the same important role as eigenvalues and eigenvectors in conventional algebra. In max-plus algebra, eigenvalues and eigenvectors are useful for knowing dynamics of the system such as in train system scheduling, scheduling production systems and scheduling learning activities in moving classes. In the translation of proteins in which the ribosome move uni-directionally along the mRNA strand to recruit the amino acids that make up the protein, eigenvalues and eigenvectors are used to calculate protein production rates and density of ribosomes on the mRNA. Based on this, it is important to examine the eigenvalues and eigenvectors in the process of protein translation. In this paper an eigenvector formula is given for a ribosome dynamics during mRNA translation by using the Kleene star algorithm in which the resulting eigenvector formula is simpler and easier to apply to the system than that introduced elsewhere. This paper also discusses the properties of the matrix {B}λ \\otimes n of model. Among the important properties, it always has the same elements in the first column for n = 1, 2,… if the eigenvalue is the time of initiation, λ = τin , and the column is the eigenvector of the model corresponding to λ.

  6. Comparison of Dijkstra's algorithm and dynamic programming method in finding shortest path for order picker in a warehouse

    Science.gov (United States)

    Nordin, Noraimi Azlin Mohd; Omar, Mohd; Sharif, S. Sarifah Radiah

    2017-04-01

    Companies are looking forward to improve their productivity within their warehouse operations and distribution centres. In a typical warehouse operation, order picking contributes more than half percentage of the operating costs. Order picking is a benchmark in measuring the performance and productivity improvement of any warehouse management. Solving order picking problem is crucial in reducing response time and waiting time of a customer in receiving his demands. To reduce the response time, proper routing for picking orders is vital. Moreover, in production line, it is vital to always make sure the supplies arrive on time. Hence, a sample routing network will be applied on EP Manufacturing Berhad (EPMB) as a case study. The Dijkstra's algorithm and Dynamic Programming method are applied to find the shortest distance for an order picker in order picking. The results show that the Dynamic programming method is a simple yet competent approach in finding the shortest distance to pick an order that is applicable in a warehouse within a short time period.

  7. A novel multiple cues based image fusing algorithm for high dynamic range image generation

    Science.gov (United States)

    Wu, Xiaojun; Song, Zhan; Yu, Gang; Zheng, Feng

    2012-01-01

    Multiple-exposure-based methods have been an effective means for high dynamic range (HDR) imaging technology. The current methods are greatly dependent on tone mapping, and most of them are unable to accurately recover the local details and colors of the scene. In this work, we present a novel HDR method by using multiple image cues for the image merging process. Firstly, all the images with various exposure times are divided into some uniform sub-regions and an exposure estimation technique is implemented to judge the well exposed one. With all the image blocks have best exposing quality are selected, a blending function is proposed to remove the transition boundaries between these blocks. A fidelity metric index is introduced to assess the final fusion image, and experimental results on public image libraries are given to demonstrate its high performance.

  8. A new logistic dynamic particle swarm optimization algorithm based on random topology.

    Science.gov (United States)

    Ni, Qingjian; Deng, Jianming

    2013-01-01

    Population topology of particle swarm optimization (PSO) will directly affect the dissemination of optimal information during the evolutionary process and will have a significant impact on the performance of PSO. Classic static population topologies are usually used in PSO, such as fully connected topology, ring topology, star topology, and square topology. In this paper, the performance of PSO with the proposed random topologies is analyzed, and the relationship between population topology and the performance of PSO is also explored from the perspective of graph theory characteristics in population topologies. Further, in a relatively new PSO variant which named logistic dynamic particle optimization, an extensive simulation study is presented to discuss the effectiveness of the random topology and the design strategies of population topology. Finally, the experimental data are analyzed and discussed. And about the design and use of population topology on PSO, some useful conclusions are proposed which can provide a basis for further discussion and research.

  9. A New Logistic Dynamic Particle Swarm Optimization Algorithm Based on Random Topology

    Directory of Open Access Journals (Sweden)

    Qingjian Ni

    2013-01-01

    Full Text Available Population topology of particle swarm optimization (PSO will directly affect the dissemination of optimal information during the evolutionary process and will have a significant impact on the performance of PSO. Classic static population topologies are usually used in PSO, such as fully connected topology, ring topology, star topology, and square topology. In this paper, the performance of PSO with the proposed random topologies is analyzed, and the relationship between population topology and the performance of PSO is also explored from the perspective of graph theory characteristics in population topologies. Further, in a relatively new PSO variant which named logistic dynamic particle optimization, an extensive simulation study is presented to discuss the effectiveness of the random topology and the design strategies of population topology. Finally, the experimental data are analyzed and discussed. And about the design and use of population topology on PSO, some useful conclusions are proposed which can provide a basis for further discussion and research.

  10. A Simplified Mass Conserving Algorithm for Journal Bearing under Large Dynamic Loads

    Directory of Open Access Journals (Sweden)

    H. Hirani

    2001-01-01

    Full Text Available A simplified mass conserving solution approach, consisting of analytical and numerical methods, for performance evaluation of dynamically loaded journal bearings is presented. The analytical technique is used to determine position and velocity of journal center for given force components. Subsequently a finite difference formulation of universal Reynolds equation is used to calculate realistic oil flow. The proposed formulation is applied for analysis of an engine main bearing. The entry and exit flow and maximum pressure in the bearing are determined over complete cycle and matched with published results obtained by numerical scheme. The suggested hybrid computational method typically takes 55 s on ICL DRS 6000, and 29 s on 150 MHz Pentium-Pro computer.

  11. Dynamic Water Surface Detection Algorithm Applied on PROBA-V Multispectral Data

    Directory of Open Access Journals (Sweden)

    Luc Bertels

    2016-12-01

    Full Text Available Water body detection worldwide using spaceborne remote sensing is a challenging task. A global scale multi-temporal and multi-spectral image analysis method for water body detection was developed. The PROBA-V microsatellite has been fully operational since December 2013 and delivers daily near-global synthesis with a spatial resolution of 1 km and 333 m. The Red, Near-InfRared (NIR and Short Wave InfRared (SWIR bands of the atmospherically corrected 10-day synthesis images are first Hue, Saturation and Value (HSV color transformed and subsequently used in a decision tree classification for water body detection. To minimize commission errors four additional data layers are used: the Normalized Difference Vegetation Index (NDVI, Water Body Potential Mask (WBPM, Permanent Glacier Mask (PGM and Volcanic Soil Mask (VSM. Threshold values on the hue and value bands, expressed by a parabolic function, are used to detect the water bodies. Beside the water bodies layer, a quality layer, based on the water bodies occurrences, is available in the output product. The performance of the Water Bodies Detection Algorithm (WBDA was assessed using Landsat 8 scenes over 15 regions selected worldwide. A mean Commission Error (CE of 1.5% was obtained while a mean Omission Error (OE of 15.4% was obtained for minimum Water Surface Ratio (WSR = 0.5 and drops to 9.8% for minimum WSR = 0.6. Here, WSR is defined as the fraction of the PROBA-V pixel covered by water as derived from high spatial resolution images, e.g., Landsat 8. Both the CE = 1.5% and OE = 9.8% (WSR = 0.6 fall within the user requirements of 15%. The WBDA is fully operational in the Copernicus Global Land Service and products are freely available.

  12. Dynamic Source Inversion of a M6.5 Intraslab Earthquake in Mexico: Application of a New Parallel Genetic Algorithm

    Science.gov (United States)

    Díaz-Mojica, J. J.; Cruz-Atienza, V. M.; Madariaga, R.; Singh, S. K.; Iglesias, A.

    2013-05-01

    We introduce a novel approach for imaging the earthquakes dynamics from ground motion records based on a parallel genetic algorithm (GA). The method follows the elliptical dynamic-rupture-patch approach introduced by Di Carli et al. (2010) and has been carefully verified through different numerical tests (Díaz-Mojica et al., 2012). Apart from the five model parameters defining the patch geometry, our dynamic source description has four more parameters: the stress drop inside the nucleation and the elliptical patches; and two friction parameters, the slip weakening distance and the change of the friction coefficient. These parameters are constant within the rupture surface. The forward dynamic source problem, involved in the GA inverse method, uses a highly accurate computational solver for the problem, namely the staggered-grid split-node. The synthetic inversion presented here shows that the source model parameterization is suitable for the GA, and that short-scale source dynamic features are well resolved in spite of low-pass filtering of the data for periods comparable to the source duration. Since there is always uncertainty in the propagation medium as well as in the source location and the focal mechanisms, we have introduced a statistical approach to generate a set of solution models so that the envelope of the corresponding synthetic waveforms explains as much as possible the observed data. We applied the method to the 2012 Mw6.5 intraslab Zumpango, Mexico earthquake and determined several fundamental source parameters that are in accordance with different and completely independent estimates for Mexican and worldwide earthquakes. Our weighted-average final model satisfactorily explains eastward rupture directivity observed in the recorded data. Some parameters found for the Zumpango earthquake are: Δτ = 30.2+/-6.2 MPa, Er = 0.68+/-0.36x10^15 J, G = 1.74+/-0.44x10^15 J, η = 0.27+/-0.11, Vr/Vs = 0.52+/-0.09 and Mw = 6.64+/-0.07; for the stress drop

  13. HBonanza: a computer algorithm for molecular-dynamics-trajectory hydrogen-bond analysis.

    Science.gov (United States)

    Durrant, Jacob D; McCammon, J Andrew

    2011-11-01

    In the current work, we present a hydrogen-bond analysis of 2673 ligand-receptor complexes that suggests the total number of hydrogen bonds formed between a ligand and its receptor is a poor predictor of ligand potency; furthermore, even that poor prediction does not suggest a statistically significant correlation between hydrogen-bond formation and potency. While we are not the first to suggest that hydrogen bonds on average do not generally contribute to ligand binding affinities, this additional evidence is nevertheless interesting. The primary role of hydrogen bonds may instead be to ensure specificity, to correctly position the ligand within the active site, and to hold the protein active site in a ligand-friendly conformation. We also present a new computer program called HBonanza (hydrogen-bond analyzer) that aids the analysis and visualization of hydrogen-bond networks. HBonanza, which can be used to analyze single structures or the many structures of a molecular dynamics trajectory, is open source and python implemented, making it easily editable, customizable, and platform independent. Unlike many other freely available hydrogen-bond analysis tools, HBonanza provides not only a text-based table describing the hydrogen-bond network, but also a Tcl script to facilitate visualization in VMD, a popular molecular visualization program. Visualization in other programs is also possible. A copy of HBonanza can be obtained free of charge from http://www.nbcr.net/hbonanza. Copyright © 2011 Elsevier Inc. All rights reserved.

  14. The algorithm of numerical calculation of constraints reactions in a dynamic system of transport machine

    Science.gov (United States)

    Akhtulov, A. L.

    2018-01-01

    The questions of construction and practical application of the automation system for the design of components and aggregates for the construction of transport vehicles are considered, taking into account their dynamic characteristics. Based on the results of the studies, a unified method for determining the reactions of bonds of a complex spatial structure is proposed. The technique, based on the method of substructures, allows us to determine the values of the transfer functions taking into account the reactions of the bonds. After the carried out researches it is necessary to note, that such approach gives the most satisfactory results and can be used for calculations of complex mechanical systems of machines and units of different purposes. The directions of increasing the degree of validity of technical decisions are shown, especially in the early stages of design, when the cost of errors is high, with careful thorough working out of all the elements of the design, which is really feasible only on the basis of automation of design and technological work.

  15. Autodriver algorithm

    Directory of Open Access Journals (Sweden)

    Anna Bourmistrova

    2011-02-01

    Full Text Available The autodriver algorithm is an intelligent method to eliminate the need of steering by a driver on a well-defined road. The proposed method performs best on a four-wheel steering (4WS vehicle, though it is also applicable to two-wheel-steering (TWS vehicles. The algorithm is based on coinciding the actual vehicle center of rotation and road center of curvature, by adjusting the kinematic center of rotation. The road center of curvature is assumed prior information for a given road, while the dynamic center of rotation is the output of dynamic equations of motion of the vehicle using steering angle and velocity measurements as inputs. We use kinematic condition of steering to set the steering angles in such a way that the kinematic center of rotation of the vehicle sits at a desired point. At low speeds the ideal and actual paths of the vehicle are very close. With increase of forward speed the road and tire characteristics, along with the motion dynamics of the vehicle cause the vehicle to turn about time-varying points. By adjusting the steering angles, our algorithm controls the dynamic turning center of the vehicle so that it coincides with the road curvature center, hence keeping the vehicle on a given road autonomously. The position and orientation errors are used as feedback signals in a closed loop control to adjust the steering angles. The application of the presented autodriver algorithm demonstrates reliable performance under different driving conditions.

  16. Impact of fitting algorithms on errors of parameter estimates in dynamic contrast-enhanced MRI

    Science.gov (United States)

    Debus, C.; Floca, R.; Nörenberg, D.; Abdollahi, A.; Ingrisch, M.

    2017-12-01

    Parameter estimation in dynamic contrast-enhanced MRI (DCE MRI) is usually performed by non-linear least square (NLLS) fitting of a pharmacokinetic model to a measured concentration-time curve. The two-compartment exchange model (2CXM) describes the compartments ‘plasma’ and ‘interstitial volume’ and their exchange in terms of plasma flow and capillary permeability. The model function can be defined by either a system of two coupled differential equations or a closed-form analytical solution. The aim of this study was to compare these two representations in terms of accuracy, robustness and computation speed, depending on parameter combination and temporal sampling. The impact on parameter estimation errors was investigated by fitting the 2CXM to simulated concentration-time curves. Parameter combinations representing five tissue types were used, together with two arterial input functions, a measured and a theoretical population based one, to generate 4D concentration images at three different temporal resolutions. Images were fitted by NLLS techniques, where the sum of squared residuals was calculated by either numeric integration with the Runge–Kutta method or convolution. Furthermore two example cases, a prostate carcinoma and a glioblastoma multiforme patient, were analyzed in order to investigate the validity of our findings in real patient data. The convolution approach yields improved results in precision and robustness of determined parameters. Precision and stability are limited in curves with low blood flow. The model parameter ve shows great instability and little reliability in all cases. Decreased temporal resolution results in significant errors for the differential equation approach in several curve types. The convolution excelled in computational speed by three orders of magnitude. Uncertainties in parameter estimation at low temporal resolution cannot be compensated by usage of the differential equations. Fitting with the convolution

  17. Improvement of the Koradi parallel algorithm for molecular dynamics and application to the economic organization and optimization of recycling costs of waste electrical and electronic equipment

    Science.gov (United States)

    Cabria, I.; Queiruga, D.

    2005-09-01

    A parallel algorithm for molecular dynamics, MD, the Koradi point-centered decomposition algorithm, especially designed for inhomogeneous systems, is improved and applied to the organization and optimization of recycling costs of Waste Electrical and Electronic Equipment, WEEE, and also to systems of atoms. This organization requires the numbers and locations of storage centers and recycling plants of the WEEE that minimize the recycling cost. The Koradi algorithm finds these optimal numbers and locations, dealing very fast with large numbers of data, in contrast with other methods. The changes of the original algorithm (different ways of generating the initial centers and especially the requirement of location convergence) improve its performance for this economic problem and also for MD simulations.

  18. Study on Magneto-Hydro-Dynamics Disturbance Signal Feature Classification Using Improved S-Transform Algorithm and Radial Basis Function Neural Network

    Directory of Open Access Journals (Sweden)

    Nan YU

    2014-09-01

    Full Text Available The interference signal in magneto-hydro-dynamics (MHD may be the disturbance from the power supply, the equipment itself, or the electromagnetic radiation. Interference signal mixed in normal signal, brings difficulties for signal analysis and processing. Recently proposed S-Transform algorithm combines advantages of short time Fourier transform and wavelet transform. It uses Fourier kernel and wavelet like Gauss window whose width is inversely proportional to the frequency. Therefore, S-Transform algorithm not only preserves the phase information of the signals but also has variable resolution like wavelet transform. This paper proposes a new method to establish a MHD signal classifier using S-transform algorithm and radial basis function neural network (RBFNN. Because RBFNN centers ascertained by k-means clustering algorithm probably are the local optimum, this paper analyzes the characteristics of k-means clustering algorithm and proposes an improved k-means clustering algorithm called GCW (Group-cluster-weight k-means clustering algorithm to improve the centers distribution. The experiment results show that the improvement greatly enhances the RBFNN performance.

  19. Protocol for a feasibility trial for improving breast feeding initiation and continuation: assets-based infant feeding help before and after birth (ABA)

    Science.gov (United States)

    Jolly, Kate; Ingram, Jenny; Clarke, Joanne; Johnson, Debbie; Trickey, Heather; Thomson, Gill; Dombrowski, Stephan U; Sitch, Alice; Dykes, Fiona; Feltham, Max G; Darwent, Kirsty; MacArthur, Christine; Roberts, Tracy

    2018-01-01

    Introduction Breast feeding improves the health of mothers and infants; the UK has low rates, with marked socioeconomic inequalities. While trials of peer support services have been effective in some settings, UK trials have not improved breast feeding rates. Qualitative research suggests that many women are alienated by the focus on breast feeding. We propose a change from breast feeding-focused interactions to respecting a woman’s feeding choices, inclusion of behaviour change theory and an increased intensity of contacts in the 2 weeks after birth when many women cease to breast feed. This will take place alongside an assets-based approach that focuses on the positive capability of individuals, their social networks and communities. We propose a feasibility study for a multicentre randomised controlled trial of the Assets feeding help Before and After birth (ABA) infant feeding service versus usual care. Methods and analysis A two-arm, non-blinded randomised feasibility study will be conducted in two UK localities. Women expecting their first baby will be eligible, regardless of feeding intention. The ABA infant feeding intervention will apply a proactive, assets-based, woman-centred, non-judgemental approach, delivered antenatally and postnatally tailored through face-to-face contacts, telephone and SMS texts. Outcomes will test the feasibility of delivering the intervention with recommended intensity and duration to disadvantaged women; acceptability to women, feeding helpers and professionals; and feasibility of a future randomised controlled trial (RCT), detailing recruitment rates, willingness to be randomised, follow-up rates at 3 days, 8 weeks and 6 months, and level of outcome completion. Outcomes of the proposed full trial will also be collected. Mixed methods will include qualitative interviews with women/partners, feeding helpers and health service staff; feeding helper logs; and review of audio-recorded helper–women interactions to assess

  20. Algorithms for GPU-based molecular dynamics simulations of complex fluids: Applications to water, mixtures, and liquid crystals.

    Science.gov (United States)

    Kazachenko, Sergey; Giovinazzo, Mark; Hall, Kyle Wm; Cann, Natalie M

    2015-09-15

    A custom code for molecular dynamics simulations has been designed to run on CUDA-enabled NVIDIA graphics processing units (GPUs). The double-precision code simulates multicomponent fluids, with intramolecular and intermolecular forces, coarse-grained and atomistic models, holonomic constraints, Nosé-Hoover thermostats, and the generation of distribution functions. Algorithms to compute Lennard-Jones and Gay-Berne interactions, and the electrostatic force using Ewald summations, are discussed. A neighbor list is introduced to improve scaling with respect to system size. Three test systems are examined: SPC/E water; an n-hexane/2-propanol mixture; and a liquid crystal mesogen, 2-(4-butyloxyphenyl)-5-octyloxypyrimidine. Code performance is analyzed for each system. With one GPU, a 33-119 fold increase in performance is achieved compared with the serial code while the use of two GPUs leads to a 69-287 fold improvement and three GPUs yield a 101-377 fold speedup. © 2015 Wiley Periodicals, Inc.

  1. Analyses of sex and individual differences in vocalizations of Australasian gannets using a dynamic time warping algorithm.

    Science.gov (United States)

    Krull, C R; Ranjard, L; Landers, T J; Ismar, S M H; Matthews, J L; Hauber, M E

    2012-08-01

    The study of the evolution of sexual differences in behavioral and morphological displays requires analyses of the extent of sexual dimorphism across various sensory modalities. In the seabird family Sulidae, boobies show dramatic sexual dimorphism in their vocalizations, and gannet calls have also been suggested to be dimorphic to human observers. This study aimed to evaluate the presence of sexually dimorphic calls in the Australasian gannet (Morus serrator) through the first comprehensive description of its vocalizations recorded at two localities; Cape Kidnappers, where individuals were banded and sexed from DNA samples, and at the Muriwai gannetry, both on the North Island of New Zealand. Calls were first inspected using basic bioacoustic features to establish a library of call element types for general reference. Extensive multivariate tests, based on a dynamic time warping algorithm, subsequently revealed that no sexual differences could be detected in Australasian gannet calls. The analyses, however, indicated extensive and consistent vocal variation between individuals, particularly so in female gannets, which may serve to signal individual identity to conspecifics. This study generates predictions to identify whether differences in Australasian gannet vocalizations play perceptual and functional roles in the breeding and social biology of this long-lived biparental seabird species.

  2. A comparative study of three model-based algorithms for estimating state-of-charge of lithium-ion batteries under a new combined dynamic loading profile

    International Nuclear Information System (INIS)

    Yang, Fangfang; Xing, Yinjiao; Wang, Dong; Tsui, Kwok-Leung

    2016-01-01

    Highlights: • Three different model-based filtering algorithms for SOC estimation are compared. • A combined dynamic loading profile is proposed to evaluate the three algorithms. • Robustness against uncertainty of initial states of SOC estimators are investigated. • Battery capacity degradation is considered in SOC estimation. - Abstract: Accurate state-of-charge (SOC) estimation is critical for the safety and reliability of battery management systems in electric vehicles. Because SOC cannot be directly measured and SOC estimation is affected by many factors, such as ambient temperature, battery aging, and current rate, a robust SOC estimation approach is necessary to be developed so as to deal with time-varying and nonlinear battery systems. In this paper, three popular model-based filtering algorithms, including extended Kalman filter, unscented Kalman filter, and particle filter, are respectively used to estimate SOC and their performances regarding to tracking accuracy, computation time, robustness against uncertainty of initial values of SOC, and battery degradation, are compared. To evaluate the performances of these algorithms, a new combined dynamic loading profile composed of the dynamic stress test, the federal urban driving schedule and the US06 is proposed. The comparison results showed that the unscented Kalman filter is the most robust to different initial values of SOC, while the particle filter owns the fastest convergence ability when an initial guess of SOC is far from a true initial SOC.

  3. Genetic algorithm-based fuzzy-PID control methodologies for enhancement of energy efficiency of a dynamic energy system

    International Nuclear Information System (INIS)

    Jahedi, G.; Ardehali, M.M.

    2011-01-01

    The simplicity in coding the heuristic judgment of experienced operator by means of fuzzy logic can be exploited for enhancement of energy efficiency. Fuzzy logic has been used as an effective tool for scheduling conventional PID controllers gain coefficients (F-PID). However, to search for the most desirable fuzzy system characteristics that allow for best performance of the energy system with minimum energy input, optimization techniques such as genetic algorithm (GA) could be utilized and the control methodology is identified as GA-based F-PID (GA-F-PID). The objective of this study is to examine the performance of PID, F-PID, and GA-F-PID controllers for enhancement of energy efficiency of a dynamic energy system. The performance evaluation of the controllers is accomplished by means of two cost functions that are based on the quadratic forms of the energy input and deviation from a setpoint temperature, referred to as energy and comfort costs, respectively. The GA-F-PID controller is examined in two different forms, namely, global form and local form. For the global form, all possible combinations of fuzzy system characteristics in the search domain are explored by GA for finding the fittest chromosome for all discrete time intervals during the entire operation period. For the local form, however, GA is used in each discrete time interval to find the fittest chromosome for implementation. The results show that the global form GA-F-PID and local form GA-F-PID control methodologies, in comparison with PID controller, achieve higher energy efficiency by lowering energy costs by 51.2%, and 67.8%, respectively. Similarly, the comfort costs for deviation from setpoint are enhanced by 54.4%, and 62.4%, respectively. It is determined that GA-F-PID performs better in local from than global form.

  4. An algorithmic approach for the dynamic reliability analysis of non-repairable multi-state weighted k-out-of-n:G system

    International Nuclear Information System (INIS)

    Eryilmaz, Serkan; Rıza Bozbulut, Ali

    2014-01-01

    In this paper, we study a multi-state weighted k-out-of-n:G system model in a dynamic setup. In particular, we study the random time spent by the system with a minimum performance level of k. Our method is based on ordering the lifetimes of the system's components in different state subsets. Using this ordering along with the Monte-Carlo simulation algorithm, we obtain estimates of the mean and survival function of the time spent by the system in state k or above. We present illustrative computational results when the degradation in the components follows a Markov process. - Highlights: • A multi-state weighted k-out-of-n:G system is studied. • A Monte-Carlo simulation algorithm is provided for the dynamic analysis. • Numerics are presented when the components' degradation follow the Markov process

  5. A novel grooming algorithm with the adaptive weight and load balancing for dynamic holding-time-aware traffic in optical networks

    Science.gov (United States)

    Xu, Zhanqi; Huang, Jiangjiang; Zhou, Zhiqiang; Ding, Zhe; Ma, Tao; Wang, Junping

    2013-10-01

    To maximize the resource utilization of optical networks, the dynamic traffic grooming, which could efficiently multiplex many low-speed services arriving dynamically onto high-capacity optical channels, has been studied extensively and used widely. However, the link weights in the existing research works can be improved since they do not adapt to the network status and load well. By exploiting the information on the holding times of the preexisting and new lightpaths, and the requested bandwidth of a user service, this paper proposes a grooming algorithm using Adaptively Weighted Links for Holding-Time-Aware (HTA) (abbreviated as AWL-HTA) traffic, especially in the setup process of new lightpath(s). Therefore, the proposed algorithm can not only establish a lightpath that uses network resource efficiently, but also achieve load balancing. In this paper, the key issues on the link weight assignment and procedure within the AWL-HTA are addressed in detail. Comprehensive simulation and experimental results show that the proposed algorithm has a much lower blocking ratio and latency than other existing algorithms.

  6. Content-based and algorithmic classifications of journals: perspectives on the dynamics of scientific communication and indexer effects

    NARCIS (Netherlands)

    Rafols, I.; Leydesdorff, L.; Larsen, B.; Leta, J.

    2009-01-01

    The aggregated journal-journal citation matrix—based on the Journal Citation Reports (JCR) of the Science Citation Index—can be decomposed by indexers and/or algorithmically. In this study, we test the results of two recently available algorithms for the decomposition of large matrices against two

  7. Content-based and algorithmic classifications of journals: Perspectives on the dynamics of scientific communication and indexer effects

    NARCIS (Netherlands)

    Rafols, I; Leydesdorff, L.

    2009-01-01

    The aggregated journal-journal citation matrix—based on the Journal Citation Reports (JCR) of the Science Citation Index—can be decomposed by indexers or algorithmically. In this study, we test the results of two recently available algorithms for the decomposition of large matrices against two

  8. A Flight Simulator for ATF2 - A Mechanism for International Collaboration in the Writing and Deployment of Online Beam Dynamics Algorithms

    Energy Technology Data Exchange (ETDEWEB)

    White, Glen; /Orsay, LAL /SLAC; Molloy, Stephen; Seryi, Andrei; /SLAC; Schulte, Daniel; Tomas, Rogelio; /CERN; Kuroda, Shigeru; /KEK, Tsukuba; Bambade, Philip; Renier, Yves; /Orsay, LAL

    2008-07-25

    The goals of ATF2 are to test a novel compact final focus optics design with local chromaticity correction intended for use in future linear colliders. The newly designed extraction line and final focus system will be used to produce a 37nm vertical waist from an extracted beam from the ATF ring of {approx}30nm vertical normalized emittance, and to stabilize it at the IP-waist to the {approx}2nm level. Static and dynamic tolerances on all accelerator components are very tight; the achievement of the ATF2 goals is reliant on the application of multiple high-level beam dynamics control algorithms to align and tune the electron beam in the extraction line and final focus system. Much algorithmic development work has been done in Japan and by colleagues in collaborating nations in North America and Europe. We describe here development work towards realizing a 'flight simulator' environment for the shared development and implementation of beam dynamics code. This software exists as a 'middle-layer' between the lower-level control systems (EPICS and V-SYSTEM) and the multiple higher-level beam dynamics modeling tools in use by the three regions (SAD, Lucretia, PLACET, MAD...).

  9. Monitoring Forest Dynamics in the Andean Amazon: The Applicability of Breakpoint Detection Methods Using Landsat Time-Series and Genetic Algorithms

    Directory of Open Access Journals (Sweden)

    Fabián Santos

    2017-01-01

    Full Text Available The Andean Amazon is an endangered biodiversity hot spot but its forest dynamics are less studied than those of the Amazon lowland and forests from middle or high latitudes. This is because its landscape variability, complex topography and cloudy conditions constitute a challenging environment for any remote-sensing assessment. Breakpoint detection with Landsat time-series data is an established robust approach for monitoring forest dynamics around the globe but has not been properly evaluated for implementation in the Andean Amazon. We analyzed breakpoint detection-generated forest dynamics in order to determine its limitations when applied to three different study areas located along an altitude gradient in the Andean Amazon in Ecuador. Using all available Landsat imagery for the period 1997–2016, we evaluated different pre-processing approaches, noise reduction techniques, and breakpoint detection algorithms. These procedures were integrated into a complex function called the processing chain generator. Calibration was not straightforward since it required us to define values for 24 parameters. To solve this problem, we implemented a novel approach using genetic algorithms. We calibrated the processing chain generator by applying a stratified training sampling and a reference dataset based on high resolution imagery. After the best calibration solution was found and the processing chain generator executed, we assessed accuracy and found that data gaps, inaccurate co-registration, radiometric variability in sensor calibration, unmasked cloud, and shadows can drastically affect the results, compromising the application of breakpoint detection in mountainous areas of the Andean Amazon. Moreover, since breakpoint detection analysis of landscape variability in the Andean Amazon requires a unique calibration of algorithms, the time required to optimize analysis could complicate its proper implementation and undermine its application for large

  10. Adaptive swarm cluster-based dynamic multi-objective synthetic minority oversampling technique algorithm for tackling binary imbalanced datasets in biomedical data classification.

    Science.gov (United States)

    Li, Jinyan; Fong, Simon; Sung, Yunsick; Cho, Kyungeun; Wong, Raymond; Wong, Kelvin K L

    2016-01-01

    An imbalanced dataset is defined as a training dataset that has imbalanced proportions of data in both interesting and uninteresting classes. Often in biomedical applications, samples from the stimulating class are rare in a population, such as medical anomalies, positive clinical tests, and particular diseases. Although the target samples in the primitive dataset are small in number, the induction of a classification model over such training data leads to poor prediction performance due to insufficient training from the minority class. In this paper, we use a novel class-balancing method named adaptive swarm cluster-based dynamic multi-objective synthetic minority oversampling technique (ASCB_DmSMOTE) to solve this imbalanced dataset problem, which is common in biomedical applications. The proposed method combines under-sampling and over-sampling into a swarm optimisation algorithm. It adaptively selects suitable parameters for the rebalancing algorithm to find the best solution. Compared with the other versions of the SMOTE algorithm, significant improvements, which include higher accuracy and credibility, are observed with ASCB_DmSMOTE. Our proposed method tactfully combines two rebalancing techniques together. It reasonably re-allocates the majority class in the details and dynamically optimises the two parameters of SMOTE to synthesise a reasonable scale of minority class for each clustered sub-imbalanced dataset. The proposed methods ultimately overcome other conventional methods and attains higher credibility with even greater accuracy of the classification model.

  11. Algorithming the Algorithm

    DEFF Research Database (Denmark)

    Mahnke, Martina; Uprichard, Emma

    2014-01-01

    changes: it’s not the ocean, it’s the internet we’re talking about, and it’s not a TV show producer, but algorithms that constitute a sort of invisible wall. Building on this assumption, most research is trying to ‘tame the algorithmic tiger’. While this is a valuable and often inspiring approach, we...

  12. Polar Bear Optimization Algorithm: Meta-Heuristic with Fast Population Movement and Dynamic Birth and Death Mechanism

    Directory of Open Access Journals (Sweden)

    Dawid Połap

    2017-09-01

    Full Text Available In the proposed article, we present a nature-inspired optimization algorithm, which we called Polar Bear Optimization Algorithm (PBO. The inspiration to develop the algorithm comes from the way polar bears hunt to survive in harsh arctic conditions. These carnivorous mammals are active all year round. Frosty climate, unfavorable to other animals, has made polar bears adapt to the specific mode of exploration and hunting in large areas, not only over ice but also water. The proposed novel mathematical model of the way polar bears move in the search for food and hunt can be a valuable method of optimization for various theoretical and practical problems. Optimization is very similar to nature, similarly to search for optimal solutions for mathematical models animals search for optimal conditions to develop in their natural environments. In this method. we have used a model of polar bear behaviors as a search engine for optimal solutions. Proposed simulated adaptation to harsh winter conditions is an advantage for local and global search, while birth and death mechanism controls the population. Proposed PBO was evaluated and compared to other meta-heuristic algorithms using sample test functions and some classical engineering problems. Experimental research results were compared to other algorithms and analyzed using various parameters. The analysis allowed us to identify the leading advantages which are rapid recognition of the area by the relevant population and efficient birth and death mechanism to improve global and local search within the solution space.

  13. A Synthetic Algorithm for Tracking a Moving Object in a Multiple-Dynamic Obstacles Environment Based on Kinematically Planar Redundant Manipulators

    Directory of Open Access Journals (Sweden)

    Hongzhe Jin

    2017-01-01

    Full Text Available This paper presents a synthetic algorithm for tracking a moving object in a multiple-dynamic obstacles environment based on kinematically planar manipulators. By observing the motions of the object and obstacles, Spline filter associated with polynomial fitting is utilized to predict their moving paths for a period of time in the future. Several feasible paths for the manipulator in Cartesian space can be planned according to the predicted moving paths and the defined feasibility criterion. The shortest one among these feasible paths is selected as the optimized path. Then the real-time path along the optimized path is planned for the manipulator to track the moving object in real-time. To improve the convergence rate of tracking, a virtual controller based on PD controller is designed to adaptively adjust the real-time path. In the process of tracking, the null space of inverse kinematic and the local rotation coordinate method (LRCM are utilized for the arms and the end-effector to avoid obstacles, respectively. Finally, the moving object in a multiple-dynamic obstacles environment is thus tracked via real-time updating the joint angles of manipulator according to the iterative method. Simulation results show that the proposed algorithm is feasible to track a moving object in a multiple-dynamic obstacles environment.

  14. Deviation from Trajectory Detection in Vision based Robotic Navigation using SURF and Subsequent Restoration by Dynamic Auto Correction Algorithm

    Directory of Open Access Journals (Sweden)

    Ray Debraj

    2015-01-01

    Full Text Available Speeded Up Robust Feature (SURF is used to position a robot with respect to an environment and aid in vision-based robotic navigation. During the course of navigation irregularities in the terrain, especially in an outdoor environment may deviate a robot from the track. Another reason for deviation can be unequal speed of the left and right robot wheels. Hence it is essential to detect such deviations and perform corrective operations to bring the robot back to the track. In this paper we propose a novel algorithm that uses image matching using SURF to detect deviation of a robot from the trajectory and subsequent restoration by corrective operations. This algorithm is executed in parallel to positioning and navigation algorithms by distributing tasks among different CPU cores using Open Multi-Processing (OpenMP API.

  15. Fast adaptive OFDM-PON over single fiber loopback transmission using dynamic rate adaptation-based algorithm for channel performance improvement

    Science.gov (United States)

    Kartiwa, Iwa; Jung, Sang-Min; Hong, Moon-Ki; Han, Sang-Kook

    2014-03-01

    In this paper, we propose a novel fast adaptive approach that was applied to an OFDM-PON 20-km single fiber loopback transmission system to improve channel performance in term of stabilized BER below 2 × 10-3 and higher throughput beyond 10 Gb/s. The upstream transmission is performed through light source-seeded modulation using 1-GHz RSOA at the ONU. Experimental results indicated that the dynamic rate adaptation algorithm based on greedy Levin-Campello could be an effective solution to mitigate channel instability and data rate degradation caused by the Rayleigh back scattering effect and inefficient resource subcarrier allocation.

  16. A real-time dynamic-MLC control algorithm for delivering IMRT to targets undergoing 2D rigid motion in the beam's eye view

    International Nuclear Information System (INIS)

    McMahon, Ryan; Berbeco, Ross; Nishioka, Seiko; Ishikawa, Masayori; Papiez, Lech

    2008-01-01

    An MLC control algorithm for delivering intensity modulated radiation therapy (IMRT) to targets that are undergoing two-dimensional (2D) rigid motion in the beam's eye view (BEV) is presented. The goal of this method is to deliver 3D-derived fluence maps over a moving patient anatomy. Target motion measured prior to delivery is first used to design a set of planned dynamic-MLC (DMLC) sliding-window leaf trajectories. During actual delivery, the algorithm relies on real-time feedback to compensate for target motion that does not agree with the motion measured during planning. The methodology is based on an existing one-dimensional (1D) algorithm that uses on-the-fly intensity calculations to appropriately adjust the DMLC leaf trajectories in real-time during exposure delivery [McMahon et al., Med. Phys. 34, 3211-3223 (2007)]. To extend the 1D algorithm's application to 2D target motion, a real-time leaf-pair shifting mechanism has been developed. Target motion that is orthogonal to leaf travel is tracked by appropriately shifting the positions of all MLC leaves. The performance of the tracking algorithm was tested for a single beam of a fractionated IMRT treatment, using a clinically derived intensity profile and a 2D target trajectory based on measured patient data. Comparisons were made between 2D tracking, 1D tracking, and no tracking. The impact of the tracking lag time and the frequency of real-time imaging were investigated. A study of the dependence of the algorithm's performance on the level of agreement between the motion measured during planning and delivery was also included. Results demonstrated that tracking both components of the 2D motion (i.e., parallel and orthogonal to leaf travel) results in delivered fluence profiles that are superior to those that track the component of motion that is parallel to leaf travel alone. Tracking lag time effects may lead to relatively large intensity delivery errors compared to the other sources of error investigated

  17. The use of multigrid techniques in the solution of the Elrod algorithm for a dynamically loaded journal bearing. M.S. Thesis. Final Report

    Science.gov (United States)

    Woods, Claudia M.

    1988-01-01

    A numerical solution to a theoretical model of vapor cavitation in a dynamically loaded journal bearing is developed, utilizing a multigrid iterative technique. The code is compared with a presently existing direct solution in terms of computational time and accuracy. The model is based on the Elrod algorithm, a control volume approach to the Reynolds equation which mimics the Jakobssen-Floberg and Olsson cavitation theory. Besides accounting for a moving cavitation boundary and conservation of mass at the boundary, it also conserves mass within the cavitated region via liquid striations. The mixed nature of the equations (elliptic in the full film zone and nonelliptic in the cavitated zone) coupled with the dynamic aspects of the problem create interesting difficulties for the present solution approach. Emphasis is placed on the methods found to eliminate solution instabilities. Excellent results are obtained for both accuracy and reduction of computational time.

  18. Discrete approximations of detonation flows with structured detonation reaction zones by discontinuous front models: A program burn algorithm based on detonation shock dynamics

    Energy Technology Data Exchange (ETDEWEB)

    Bdzil, J.B. [Los Alamos National Lab., NM (United States); Jackson, T.L. [Univ. of Illinois, Urbana, IL (United States). Center for Simulation of Advanced Rockets; Stewart, D.S. [Univ. of Illinois, Urbana, IL (United States). Theoretical and Applied Mechanics

    1999-02-02

    In the design of explosive systems the generic problem that one must consider is the propagation of a well-developed detonation wave sweeping through an explosive charge with a complex shape. At a given instant of time the lead detonation shock is a surface that occupies a region of the explosive and has a dimension that is characteristic of the explosive device, typically on the scale of meters. The detonation shock is powered by a detonation reaction zone, sitting immediately behind the shock, which is on the scale of 1 millimeter or less. Thus, the ratio of the reaction zone thickness to the device dimension is of the order of 1/1,000 or less. This scale disparity can lead to great difficulties in computing three-dimensional detonation dynamics. An attack on the dilemma for the computation of detonation systems has lead to the invention of sub-scale models for a propagating detonation front that they refer to herein as program burn models. The program burn model seeks not to resolve the fine scale of the reaction zone in the sense of a DNS simulation. The goal of a program burn simulation is to resolve the hydrodynamics in the inert product gases on a grid much coarser than that required to resolve a physical reaction zone. The authors first show that traditional program burn algorithms for detonation hydrocodes used for explosive design are inconsistent and yield incorrect shock dynamic behavior. To overcome these inconsistencies, they are developing a new class of program burn models based on detonation shock dynamic (DSD) theory. It is hoped that this new class will yield a consistent and robust algorithm which reflects the correct shock dynamic behavior.

  19. A Novel Dynamic Physical Layer Impairment-Aware Routing and Wavelength Assignment (PLI-RWA) Algorithm for Mixed Line Rate (MLR) Wavelength Division Multiplexed (WDM) Optical Networks

    Science.gov (United States)

    Iyer, Sridhar

    2016-12-01

    The ever-increasing global Internet traffic will inevitably lead to a serious upgrade of the current optical networks' capacity. The legacy infrastructure can be enhanced not only by increasing the capacity but also by adopting advance modulation formats, having increased spectral efficiency at higher data rate. In a transparent mixed-line-rate (MLR) optical network, different line rates, on different wavelengths, can coexist on the same fiber. Migration to data rates higher than 10 Gbps requires the implementation of phase modulation schemes. However, the co-existing on-off keying (OOK) channels cause critical physical layer impairments (PLIs) to the phase modulated channels, mainly due to cross-phase modulation (XPM), which in turn limits the network's performance. In order to mitigate this effect, a more sophisticated PLI-Routing and Wavelength Assignment (PLI-RWA) scheme needs to be adopted. In this paper, we investigate the critical impairment for each data rate and the way it affects the quality of transmission (QoT). In view of the aforementioned, we present a novel dynamic PLI-RWA algorithm for MLR optical networks. The proposed algorithm is compared through simulations with the shortest path and minimum hop routing schemes. The simulation results show that performance of the proposed algorithm is better than the existing schemes.

  20. Hardware-software and algorithmic provision of multipoint systems for long-term monitoring of dynamic processes

    Science.gov (United States)

    Yakunin, A. G.; Hussein, H. M.

    2017-08-01

    An example of information-measuring systems for climate monitoring and operational control of energy resources consumption of the university campus that is functioning in the Altai State Technical University since 2009. The advantages of using such systems for studying various physical processes are discussed. General principles of construction of similar systems, their software, hardware and algorithmic support are considered. It is shown that their fundamental difference from traditional SCADA - systems is the use of databases for storing the results of the observation with a specialized data structure, and by preprocessing of the input signal for its compression. Another difference is the absence of clear criteria for detecting the anomalies in the time series of the observed process. The examples of algorithms that solve this problem are given.

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

  2. GENESIS: a hybrid-parallel and multi-scale molecular dynamics simulator with enhanced sampling algorithms for biomolecular and cellular simulations.

    Science.gov (United States)

    Jung, Jaewoon; Mori, Takaharu; Kobayashi, Chigusa; Matsunaga, Yasuhiro; Yoda, Takao; Feig, Michael; Sugita, Yuji

    2015-07-01

    GENESIS (Generalized-Ensemble Simulation System) is a new software package for molecular dynamics (MD) simulations of macromolecules. It has two MD simulators, called ATDYN and SPDYN. ATDYN is parallelized based on an atomic decomposition algorithm for the simulations of all-atom force-field models as well as coarse-grained Go-like models. SPDYN is highly parallelized based on a domain decomposition scheme, allowing large-scale MD simulations on supercomputers. Hybrid schemes combining OpenMP and MPI are used in both simulators to target modern multicore computer architectures. Key advantages of GENESIS are (1) the highly parallel performance of SPDYN for very large biological systems consisting of more than one million atoms and (2) the availability of various REMD algorithms (T-REMD, REUS, multi-dimensional REMD for both all-atom and Go-like models under the NVT, NPT, NPAT, and NPγT ensembles). The former is achieved by a combination of the midpoint cell method and the efficient three-dimensional Fast Fourier Transform algorithm, where the domain decomposition space is shared in real-space and reciprocal-space calculations. Other features in SPDYN, such as avoiding concurrent memory access, reducing communication times, and usage of parallel input/output files, also contribute to the performance. We show the REMD simulation results of a mixed (POPC/DMPC) lipid bilayer as a real application using GENESIS. GENESIS is released as free software under the GPLv2 licence and can be easily modified for the development of new algorithms and molecular models. WIREs Comput Mol Sci 2015, 5:310-323. doi: 10.1002/wcms.1220.

  3. Profit maximization algorithms for utility companies in an oligopolistic energy market with dynamic prices and intelligent users

    Directory of Open Access Journals (Sweden)

    Tiansong Cui

    2016-01-01

    Full Text Available Dynamic energy pricing provides a promising solution for the utility companies to incentivize energy users to perform demand side management in order to minimize their electric bills. Moreover, the emerging decentralized smart grid, which is a likely infrastructure scenario for future electrical power networks, allows energy consumers to select their energy provider from among multiple utility companies in any billing period. This paper thus starts by considering an oligopolistic energy market with multiple non-cooperative (competitive utility companies, and addresses the problem of determining dynamic energy prices for every utility company in this market based on a modified Bertrand Competition Model of user behaviors. Two methods of dynamic energy pricing are proposed for a utility company to maximize its total profit. The first method finds the greatest lower bound on the total profit that can be achieved by the utility company, whereas the second method finds the best response of a utility company to dynamic pricing policies that the other companies have adopted in previous billing periods. To exploit the advantages of each method while compensating their shortcomings, an adaptive dynamic pricing policy is proposed based on a machine learning technique, which finds a good balance between invocations of the two aforesaid methods. Experimental results show that the adaptive policy results in consistently high profit for the utility company no matter what policies are employed by the other companies.

  4. Atomistic modeling of metal surfaces under electric fields: direct coupling of electric fields to a molecular dynamics algorithm

    CERN Document Server

    Djurabekova, Flyura; Pohjonen, Aarne; Nordlund, Kai

    2011-01-01

    The effect of electric fields on metal surfaces is fairly well studied, resulting in numerous analytical models developed to understand the mechanisms of ionization of surface atoms observed at very high electric fields, as well as the general behavior of a metal surface in this condition. However, the derivation of analytical models does not include explicitly the structural properties of metals, missing the link between the instantaneous effects owing to the applied field and the consequent response observed in the metal surface as a result of an extended application of an electric field. In the present work, we have developed a concurrent electrodynamic–molecular dynamic model for the dynamical simulation of an electric-field effect and subsequent modification of a metal surface in the framework of an atomistic molecular dynamics (MD) approach. The partial charge induced on the surface atoms by the electric field is assessed by applying the classical Gauss law. The electric forces acting on the partially...

  5. Optimized adaptation algorithm for HEVC/H.265 dynamic adaptive streaming over HTTP using variable segment duration

    Science.gov (United States)

    Irondi, Iheanyi; Wang, Qi; Grecos, Christos

    2016-04-01

    Adaptive video streaming using HTTP has become popular in recent years for commercial video delivery. The recent MPEG-DASH standard allows interoperability and adaptability between servers and clients from different vendors. The delivery of the MPD (Media Presentation Description) files in DASH and the DASH client behaviours are beyond the scope of the DASH standard. However, the different adaptation algorithms employed by the clients do affect the overall performance of the system and users' QoE (Quality of Experience), hence the need for research in this field. Moreover, standard DASH delivery is based on fixed segments of the video. However, there is no standard segment duration for DASH where various fixed segment durations have been employed by different commercial solutions and researchers with their own individual merits. Most recently, the use of variable segment duration in DASH has emerged but only a few preliminary studies without practical implementation exist. In addition, such a technique requires a DASH client to be aware of segment duration variations, and this requirement and the corresponding implications on the DASH system design have not been investigated. This paper proposes a segment-duration-aware bandwidth estimation and next-segment selection adaptation strategy for DASH. Firstly, an MPD file extension scheme to support variable segment duration is proposed and implemented in a realistic hardware testbed. The scheme is tested on a DASH client, and the tests and analysis have led to an insight on the time to download next segment and the buffer behaviour when fetching and switching between segments of different playback durations. Issues like sustained buffering when switching between segments of different durations and slow response to changing network conditions are highlighted and investigated. An enhanced adaptation algorithm is then proposed to accurately estimate the bandwidth and precisely determine the time to download the next

  6. Null Steering of Adaptive Beamforming Using Linear Constraint Minimum Variance Assisted by Particle Swarm Optimization, Dynamic Mutated Artificial Immune System, and Gravitational Search Algorithm

    Science.gov (United States)

    Sieh Kiong, Tiong; Tariqul Islam, Mohammad; Ismail, Mahamod; Salem, Balasem

    2014-01-01

    Linear constraint minimum variance (LCMV) is one of the adaptive beamforming techniques that is commonly applied to cancel interfering signals and steer or produce a strong beam to the desired signal through its computed weight vectors. However, weights computed by LCMV usually are not able to form the radiation beam towards the target user precisely and not good enough to reduce the interference by placing null at the interference sources. It is difficult to improve and optimize the LCMV beamforming technique through conventional empirical approach. To provide a solution to this problem, artificial intelligence (AI) technique is explored in order to enhance the LCMV beamforming ability. In this paper, particle swarm optimization (PSO), dynamic mutated artificial immune system (DM-AIS), and gravitational search algorithm (GSA) are incorporated into the existing LCMV technique in order to improve the weights of LCMV. The simulation result demonstrates that received signal to interference and noise ratio (SINR) of target user can be significantly improved by the integration of PSO, DM-AIS, and GSA in LCMV through the suppression of interference in undesired direction. Furthermore, the proposed GSA can be applied as a more effective technique in LCMV beamforming optimization as compared to the PSO technique. The algorithms were implemented using Matlab program. PMID:25147859

  7. The new Cloud Dynamics and Radiation Database algorithms for AMSR2 and GMI: exploitation of the GPM observational database for operational applications

    Science.gov (United States)

    Cinzia Marra, Anna; Casella, Daniele; Martins Costa do Amaral, Lia; Sanò, Paolo; Dietrich, Stefano; Panegrossi, Giulia

    2017-04-01

    Two new precipitation retrieval algorithms for the Advanced Microwave Scanning Radiometer 2 (AMSR2) and for the GPM Microwave Imager (GMI) are presented. The algorithms are based on the Cloud Dynamics and Radiation Database (CDRD) Bayesian approach and represent an evolution of the previous version applied to Special Sensor Microwave Imager/Sounder (SSMIS) observations, and used operationally within the EUMETSAT Satellite Application Facility on support to Operational Hydrology and Water Management (H-SAF). These new products present as main innovation the use of an extended database entirely empirical, derived from coincident radar and radiometer observations from the NASA/JAXA Global Precipitation Measurement Core Observatory (GPM-CO) (Dual-frequency Precipitation Radar-DPR and GMI). The other new aspects are: 1) a new rain-no-rain screening approach; 2) the use of Empirical Orthogonal Functions (EOF) and Canonical Correlation Analysis (CCA) both in the screening approach, and in the Bayesian algorithm; 2) the use of new meteorological and environmental ancillary variables to categorize the database and mitigate the problem of non-uniqueness of the retrieval solution; 3) the development and implementations of specific modules for computational time minimization. The CDRD algorithms for AMSR2 and GMI are able to handle an extremely large observational database available from GPM-CO and provide the rainfall estimate with minimum latency, making them suitable for near-real time hydrological and operational applications. As far as CDRD for AMSR2, a verification study over Italy using ground-based radar data and over the MSG full disk area using coincident GPM-CO/AMSR2 observations has been carried out. Results show remarkable AMSR2 capabilities for rainfall rate (RR) retrieval over ocean (for RR > 0.25 mm/h), good capabilities over vegetated land (for RR > 1 mm/h), while for coastal areas the results are less certain. Comparisons with NASA GPM products, and with

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

    International Nuclear Information System (INIS)

    Shimizu, Yoshiaki

    1991-01-01

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

  9. Dynamic source inversion of the M6.5 intermediate-depth Zumpango earthquake in central Mexico: A parallel genetic algorithm

    Science.gov (United States)

    Díaz-Mojica, John; Cruz-Atienza, Víctor M.; Madariaga, Raúl; Singh, Shri K.; Tago, Josué; Iglesias, Arturo

    2014-10-01

    We introduce a method for imaging the earthquake source dynamics from the inversion of ground motion records based on a parallel genetic algorithm. The source model follows an elliptical patch approach and uses the staggered-grid split-node method to simulate the earthquake dynamics. A statistical analysis is used to estimate errors in both inverted and derived source parameters. Synthetic inversion tests reveal that the average rupture speed (Vr), the rupture area, and the stress drop (Δτ) may be determined with formal errors of ~30%, ~12%, and ~10%, respectively. In contrast, derived parameters such as the radiated energy (Er), the radiation efficiency (ηr), and the fracture energy (G) have larger errors, around ~70%, ~40%, and ~25%, respectively. We applied the method to the Mw 6.5 intermediate-depth (62 km) normal-faulting earthquake of 11 December 2011 in Guerrero, Mexico. Inferred values of Δτ = 29.2 ± 6.2 MPa and ηr = 0.26 ± 0.1 are significantly higher and lower, respectively, than those of typical subduction thrust events. Fracture energy is large so that more than 73% of the available potential energy for the dynamic process of faulting was deposited in the focal region (i.e., G = (14.4 ± 3.5) × 1014J), producing a slow rupture process (Vr/VS = 0.47 ± 0.09) despite the relatively high energy radiation (Er = (0.54 ± 0.31) × 1015 J) and energy-moment ratio (Er/M0 = 5.7 × 10- 5). It is interesting to point out that such a slow and inefficient rupture along with the large stress drop in a small focal region are features also observed in both the 1994 deep Bolivian earthquake and the seismicity of the intermediate-depth Bucaramanga nest.

  10. A Refined Teaching-Learning Based Optimization Algorithm for Dynamic Economic Dispatch of Integrated Multiple Fuel and Wind Power Plants

    Directory of Open Access Journals (Sweden)

    Umamaheswari Krishnasamy

    2014-01-01

    Full Text Available Dynamic economic dispatch problem (DEDP for a multiple fuel power plant is a nonlinear and nonsmooth optimization problem when valve-point effects, multifuel effects, and ramp-rate limits are considered. Additionally wind energy is also integrated with the DEDP to supply the load for effective utilization of the renewable energy. Since the wind power may not be predicted, a radial basis function network (RBFN is presented to forecast a one-hour-ahead wind power to plan and ensure a reliable power supply. In this paper, a refined teaching-learning based optimization (TLBO is applied to minimize the overall cost of operation of wind-thermal power system. The TLBO is refined by integrating the sequential quadratic programming (SQP method to fine-tune the better solutions whenever discovered by the former method. To demonstrate the effectiveness of the proposed hybrid TLBO-SQP method, a standard DEDP and one practical DEDP with wind power forecasted are tested based on the practical information of wind speed. Simulation results validate the proposed methodology which is reasonable by ensuring quality solution throughout the scheduling horizon for secure operation of the system.

  11. Algorithms and programs for solution of static and dynamic characteristics of counterflow heat exchangers with dissociating coolant

    International Nuclear Information System (INIS)

    Nitej, N.V.; Sharovarov, G.A.

    1982-01-01

    The method of estimation of counterflow heat exchanger characteristics is presented. Mathematical description of the processes is presented by the mass, energy and pulse conservation equations for both coolants and energy conservation equation for the wall which devides them. In the presence of chemical reactions the system is supplemented by equations, characterizing the kinetics of their progress. The methods of numerical solution of static and dynamic problems have been chosen, and the computer programs on the Fortran language have been developed. The schemes of solution of both problems are so constructed, that the conservation equations are placed in the main program, and such characteristics of the coolants as properties, heat transfer and friction coefficients, the mechanism of chemical reaction are concentrated in the subprogram unit. This allows to create the single method of solution with the flow of single-phase and two-phase coolants of abovecritical and supercritical paramters. The evaluation results of three heat exchangers are given: with heating of N 2 O 4 gas phase by heat of flue gas; with cooling of N 2 O 4 supercritical parameters by water; regenerator on N 2 O 4

  12. Free-flying dynamics and control of an astronaut assistant robot based on fuzzy sliding mode algorithm

    Science.gov (United States)

    Gao, Qing; Liu, Jinguo; Tian, Tongtong; Li, Yangmin

    2017-09-01

    Space robots can perform some tasks in harsh environment as assistants of astronauts or substitutions of astronauts. Taking the limited working time and the arduous task of the astronauts in the space station into account, an astronaut assistant robot (AAR-2) applied in the space station is proposed and designed in this paper. The AAR-2 is achieved with some improvements on the basis of AAR-1 which was designed before. It can exploit its position and attitude sensors and control system to free flight or hover in the space cabin. And it also has a definite environmental awareness and artificial intelligence to complete some specified tasks under the control of astronauts or autonomously. In this paper, it mainly analyzes and controls the 6-DOF motion of the AAR-2. Firstly, the system configuration of AAR-2 is specifically described, and the movement principles are analyzed. Secondly, according to the physical model of the AAR-2, the Newton - Euler equation is applied in the preparation of space dynamics model of 6-DOF motion. Then, according to the mathematical model's characteristics which are nonlinear and strong coupling, a dual closed loop position and attitude controller based on fuzzy sliding mode control is proposed and designed. Finally, simulation experiments are appropriate to provide for AAR-2 control system by using Matlab/Simulink. From the simulation results it can be observed that the designed fuzzy sliding mode controller can control the 6-DOF motion of AAR-2 quickly and precisely.

  13. Algorithmic cryptanalysis

    CERN Document Server

    Joux, Antoine

    2009-01-01

    Illustrating the power of algorithms, Algorithmic Cryptanalysis describes algorithmic methods with cryptographically relevant examples. Focusing on both private- and public-key cryptographic algorithms, it presents each algorithm either as a textual description, in pseudo-code, or in a C code program.Divided into three parts, the book begins with a short introduction to cryptography and a background chapter on elementary number theory and algebra. It then moves on to algorithms, with each chapter in this section dedicated to a single topic and often illustrated with simple cryptographic applic

  14. A parallel efficient partitioning algorithm for the statistical model of dynamic sea clutter at low grazing angle

    Science.gov (United States)

    Wu, Tao; Wu, Zhensen; Linghu, Longxiang

    2017-10-01

    Study of characteristics of sea clutter is very important for signal processing of radar, detection of targets on sea surface and remote sensing. The sea state is complex at Low grazing angle (LGA), and it is difficult with its large irradiation area and a great deal simulation facets. A practical and efficient model to obtain radar clutter of dynamic sea in different sea condition is proposed, basing on the physical mechanism of interaction between electromagnetic wave and sea wave. The classical analysis method for sea clutter is basing on amplitude and spectrum distribution, taking the clutter as random processing model, which is equivocal in its physical mechanism. To achieve electromagnetic field from sea surface, a modified phase from facets is considered, and the backscattering coefficient is calculated by Wu's improved two-scale model, which can solve the statistical sea backscattering problem less than 5 degree, considering the effects of the surface slopes joint probability density, the shadowing function, the skewness of sea waves and the curvature of the surface on the backscattering from the ocean surface. We make the assumption that the scattering contribution of each facet is independent, the total field is the superposition of each facet in the receiving direction. Such data characters are very suitable to compute on GPU threads. So we can make the best of GPU resource. We have achieved a speedup of 155-fold for S band and 162-fold for Ku/Χ band on the Tesla K80 GPU as compared with Intel® Core™ CPU. In this paper, we mainly study the high resolution data, and the time resolution is millisecond, so we may have 10,00 time points, and we analyze amplitude probability density distribution of radar clutter.

  15. An improved optimization algorithm of the three-compartment model with spillover and partial volume corrections for dynamic FDG PET images of small animal hearts in vivo

    Science.gov (United States)

    Li, Yinlin; Kundu, Bijoy K.

    2018-03-01

    The three-compartment model with spillover (SP) and partial volume (PV) corrections has been widely used for noninvasive kinetic parameter studies of dynamic 2-[18F] fluoro-2deoxy-D-glucose (FDG) positron emission tomography images of small animal hearts in vivo. However, the approach still suffers from estimation uncertainty or slow convergence caused by the commonly used optimization algorithms. The aim of this study was to develop an improved optimization algorithm with better estimation performance. Femoral artery blood samples, image-derived input functions from heart ventricles and myocardial time-activity curves (TACs) were derived from data on 16 C57BL/6 mice obtained from the UCLA Mouse Quantitation Program. Parametric equations of the average myocardium and the blood pool TACs with SP and PV corrections in a three-compartment tracer kinetic model were formulated. A hybrid method integrating artificial immune-system and interior-reflective Newton methods were developed to solve the equations. Two penalty functions and one late time-point tail vein blood sample were used to constrain the objective function. The estimation accuracy of the method was validated by comparing results with experimental values using the errors in the areas under curves (AUCs) of the model corrected input function (MCIF) and the 18F-FDG influx constant K i . Moreover, the elapsed time was used to measure the convergence speed. The overall AUC error of MCIF for the 16 mice averaged  -1.4  ±  8.2%, with correlation coefficients of 0.9706. Similar results can be seen in the overall K i error percentage, which was 0.4  ±  5.8% with a correlation coefficient of 0.9912. The t-test P value for both showed no significant difference. The mean and standard deviation of the MCIF AUC and K i percentage errors have lower values compared to the previously published methods. The computation time of the hybrid method is also several times lower than using just a stochastic

  16. Algorithmic mathematics

    CERN Document Server

    Hougardy, Stefan

    2016-01-01

    Algorithms play an increasingly important role in nearly all fields of mathematics. This book allows readers to develop basic mathematical abilities, in particular those concerning the design and analysis of algorithms as well as their implementation. It presents not only fundamental algorithms like the sieve of Eratosthenes, the Euclidean algorithm, sorting algorithms, algorithms on graphs, and Gaussian elimination, but also discusses elementary data structures, basic graph theory, and numerical questions. In addition, it provides an introduction to programming and demonstrates in detail how to implement algorithms in C++. This textbook is suitable for students who are new to the subject and covers a basic mathematical lecture course, complementing traditional courses on analysis and linear algebra. Both authors have given this "Algorithmic Mathematics" course at the University of Bonn several times in recent years.

  17. Total algorithms

    NARCIS (Netherlands)

    Tel, G.

    We define the notion of total algorithms for networks of processes. A total algorithm enforces that a "decision" is taken by a subset of the processes, and that participation of all processes is required to reach this decision. Total algorithms are an important building block in the design of

  18. Mechanical Model of Geometric Cell and Topological Algorithm for Cell Dynamics from Single-Cell to Formation of Monolayered Tissues with Pattern

    KAUST Repository

    Kachalo, Sëma

    2015-05-14

    Geometric and mechanical properties of individual cells and interactions among neighboring cells are the basis of formation of tissue patterns. Understanding the complex interplay of cells is essential for gaining insight into embryogenesis, tissue development, and other emerging behavior. Here we describe a cell model and an efficient geometric algorithm for studying the dynamic process of tissue formation in 2D (e.g. epithelial tissues). Our approach improves upon previous methods by incorporating properties of individual cells as well as detailed description of the dynamic growth process, with all topological changes accounted for. Cell size, shape, and division plane orientation are modeled realistically. In addition, cell birth, cell growth, cell shrinkage, cell death, cell division, cell collision, and cell rearrangements are now fully accounted for. Different models of cell-cell interactions, such as lateral inhibition during the process of growth, can be studied in detail. Cellular pattern formation for monolayered tissues from arbitrary initial conditions, including that of a single cell, can also be studied in detail. Computational efficiency is achieved through the employment of a special data structure that ensures access to neighboring cells in constant time, without additional space requirement. We have successfully generated tissues consisting of more than 20,000 cells starting from 2 cells within 1 hour. We show that our model can be used to study embryogenesis, tissue fusion, and cell apoptosis. We give detailed study of the classical developmental process of bristle formation on the epidermis of D. melanogaster and the fundamental problem of homeostatic size control in epithelial tissues. Simulation results reveal significant roles of solubility of secreted factors in both the bristle formation and the homeostatic control of tissue size. Our method can be used to study broad problems in monolayered tissue formation. Our software is publicly

  19. Mechanical model of geometric cell and topological algorithm for cell dynamics from single-cell to formation of monolayered tissues with pattern.

    Directory of Open Access Journals (Sweden)

    Sëma Kachalo

    Full Text Available Geometric and mechanical properties of individual cells and interactions among neighboring cells are the basis of formation of tissue patterns. Understanding the complex interplay of cells is essential for gaining insight into embryogenesis, tissue development, and other emerging behavior. Here we describe a cell model and an efficient geometric algorithm for studying the dynamic process of tissue formation in 2D (e.g. epithelial tissues. Our approach improves upon previous methods by incorporating properties of individual cells as well as detailed description of the dynamic growth process, with all topological changes accounted for. Cell size, shape, and division plane orientation are modeled realistically. In addition, cell birth, cell growth, cell shrinkage, cell death, cell division, cell collision, and cell rearrangements are now fully accounted for. Different models of cell-cell interactions, such as lateral inhibition during the process of growth, can be studied in detail. Cellular pattern formation for monolayered tissues from arbitrary initial conditions, including that of a single cell, can also be studied in detail. Computational efficiency is achieved through the employment of a special data structure that ensures access to neighboring cells in constant time, without additional space requirement. We have successfully generated tissues consisting of more than 20,000 cells starting from 2 cells within 1 hour. We show that our model can be used to study embryogenesis, tissue fusion, and cell apoptosis. We give detailed study of the classical developmental process of bristle formation on the epidermis of D. melanogaster and the fundamental problem of homeostatic size control in epithelial tissues. Simulation results reveal significant roles of solubility of secreted factors in both the bristle formation and the homeostatic control of tissue size. Our method can be used to study broad problems in monolayered tissue formation. Our software

  20. A new finite element formulation for computational fluid dynamics. IX - Fourier analysis of space-time Galerkin/least-squares algorithms

    Science.gov (United States)

    Shakib, Farzin; Hughes, Thomas J. R.

    1991-01-01

    A Fourier stability and accuracy analysis of the space-time Galerkin/least-squares method as applied to a time-dependent advective-diffusive model problem is presented. Two time discretizations are studied: a constant-in-time approximation and a linear-in-time approximation. Corresponding space-time predictor multi-corrector algorithms are also derived and studied. The behavior of the space-time algorithms is compared to algorithms based on semidiscrete formulations.

  1. On exact algorithms for treewidth

    NARCIS (Netherlands)

    Bodlaender, H.L.; Fomin, F.V.; Koster, A.M.C.A.; Kratsch, D.; Thilikos, D.M.

    2006-01-01

    We give experimental and theoretical results on the problem of computing the treewidth of a graph by exact exponential time algorithms using exponential space or using only polynomial space. We first report on an implementation of a dynamic programming algorithm for computing the treewidth of a

  2. Model order reduction using eigen algorithm | Singh | International ...

    African Journals Online (AJOL)

    -scale dynamic systems where denominator polynomial determined through Eigen algorithm and numerator polynomial via factor division algorithm. In Eigen algorithm, the most dominant Eigen value of both original and reduced order ...

  3. Algorithmic trends in computational fluid dynamics; The Institute for Computer Applications in Science and Engineering (ICASE)/LaRC Workshop, NASA Langley Research Center, Hampton, VA, US, Sep. 15-17, 1991

    Science.gov (United States)

    Hussaini, M. Y. (Editor); Kumar, A. (Editor); Salas, M. D. (Editor)

    1993-01-01

    The purpose here is to assess the state of the art in the areas of numerical analysis that are particularly relevant to computational fluid dynamics (CFD), to identify promising new developments in various areas of numerical analysis that will impact CFD, and to establish a long-term perspective focusing on opportunities and needs. Overviews are given of discretization schemes, computational fluid dynamics, algorithmic trends in CFD for aerospace flow field calculations, simulation of compressible viscous flow, and massively parallel computation. Also discussed are accerelation methods, spectral and high-order methods, multi-resolution and subcell resolution schemes, and inherently multidimensional schemes.

  4. Dynamics

    CERN Document Server

    Goodman, Lawrence E

    2001-01-01

    Beginning text presents complete theoretical treatment of mechanical model systems and deals with technological applications. Topics include introduction to calculus of vectors, particle motion, dynamics of particle systems and plane rigid bodies, technical applications in plane motions, theory of mechanical vibrations, and more. Exercises and answers appear in each chapter.

  5. An algorithm for reduct cardinality minimization

    KAUST Repository

    AbouEisha, Hassan M.

    2013-12-01

    This is devoted to the consideration of a new algorithm for reduct cardinality minimization. This algorithm transforms the initial table to a decision table of a special kind, simplify this table, and use a dynamic programming algorithm to finish the construction of an optimal reduct. Results of computer experiments with decision tables from UCI ML Repository are discussed. © 2013 IEEE.

  6. Agency and Algorithms

    Directory of Open Access Journals (Sweden)

    Hanns Holger Rutz

    2016-11-01

    Full Text Available Although the concept of algorithms has been established a long time ago, their current topicality indicates a shift in the discourse. Classical definitions based on logic seem to be inadequate to describe their aesthetic capabilities. New approaches stress their involvement in material practices as well as their incompleteness. Algorithmic aesthetics can no longer be tied to the static analysis of programs, but must take into account the dynamic and experimental nature of coding practices. It is suggested that the aesthetic objects thus produced articulate something that could be called algorithmicity or the space of algorithmic agency. This is the space or the medium – following Luhmann’s form/medium distinction – where human and machine undergo mutual incursions. In the resulting coupled “extimate” writing process, human initiative and algorithmic speculation cannot be clearly divided out any longer. An observation is attempted of defining aspects of such a medium by drawing a trajectory across a number of sound pieces. The operation of exchange between form and medium I call reconfiguration and it is indicated by this trajectory. 

  7. Algorithmic Self

    DEFF Research Database (Denmark)

    Markham, Annette

    layered set of accounts to help build our understanding of how individuals relate to their devices, search systems, and social network sites. This work extends critical analyses of the power of algorithms in implicating the social self by offering narrative accounts from multiple perspectives. It also...

  8. Genetic algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Grefenstette, J.J.

    1994-12-31

    Genetic algorithms solve problems by using principles inspired by natural population genetics: They maintain a population of knowledge structures that represent candidate solutions, and then let that population evolve over time through competition and controlled variation. GAs are being applied to a wide range of optimization and learning problems in many domains.

  9. An Efficient Algorithm for Simulating the Real-Time Quantum Dynamics of a Single Spin-1/2 Coupled to Specific Spin-1/2 Baths

    NARCIS (Netherlands)

    Novotny, M.A.; Guerra, M.; Raedt, H. De; Michielsen, K.; Jin, F.

    2012-01-01

    An efficient algorithm for the computation of the real-time dependence of a single quantum spin-1/2 coupled to a specific set of quantum spin-1/2 baths is presented. The specific spin baths have couplings only with the spin operators Sx between bath spins and the central spin. We calculate spin

  10. Enhanced sampling algorithms.

    Science.gov (United States)

    Mitsutake, Ayori; Mori, Yoshiharu; Okamoto, Yuko

    2013-01-01

    In biomolecular systems (especially all-atom models) with many degrees of freedom such as proteins and nucleic acids, there exist an astronomically large number of local-minimum-energy states. Conventional simulations in the canonical ensemble are of little use, because they tend to get trapped in states of these energy local minima. Enhanced conformational sampling techniques are thus in great demand. A simulation in generalized ensemble performs a random walk in potential energy space and can overcome this difficulty. From only one simulation run, one can obtain canonical-ensemble averages of physical quantities as functions of temperature by the single-histogram and/or multiple-histogram reweighting techniques. In this article we review uses of the generalized-ensemble algorithms in biomolecular systems. Three well-known methods, namely, multicanonical algorithm, simulated tempering, and replica-exchange method, are described first. Both Monte Carlo and molecular dynamics versions of the algorithms are given. We then present various extensions of these three generalized-ensemble algorithms. The effectiveness of the methods is tested with short peptide and protein systems.

  11. Cognitive radio resource allocation based on coupled chaotic genetic algorithm

    International Nuclear Information System (INIS)

    Zu Yun-Xiao; Zhou Jie; Zeng Chang-Chang

    2010-01-01

    A coupled chaotic genetic algorithm for cognitive radio resource allocation which is based on genetic algorithm and coupled Logistic map is proposed. A fitness function for cognitive radio resource allocation is provided. Simulations are conducted for cognitive radio resource allocation by using the coupled chaotic genetic algorithm, simple genetic algorithm and dynamic allocation algorithm respectively. The simulation results show that, compared with simple genetic and dynamic allocation algorithm, coupled chaotic genetic algorithm reduces the total transmission power and bit error rate in cognitive radio system, and has faster convergence speed

  12. Comparative efficiencies of three parallel algorithms for nonlinear ...

    Indian Academy of Sciences (India)

    Transient dynamic analysis; parallel processing; Newmark algorithm; group implicit algorithm; domain decomposition. ... The prime aim of the research work reported here is to test the portability of the parallel algorithms and also to study and understand the comparative efficiencies of three parallel algorithms developed for ...

  13. Parallel algorithms

    CERN Document Server

    Casanova, Henri; Robert, Yves

    2008-01-01

    ""…The authors of the present book, who have extensive credentials in both research and instruction in the area of parallelism, present a sound, principled treatment of parallel algorithms. … This book is very well written and extremely well designed from an instructional point of view. … The authors have created an instructive and fascinating text. The book will serve researchers as well as instructors who need a solid, readable text for a course on parallelism in computing. Indeed, for anyone who wants an understandable text from which to acquire a current, rigorous, and broad vi

  14. Dynamic normal forms and dynamic characteristic polynomial

    DEFF Research Database (Denmark)

    Frandsen, Gudmund Skovbjerg; Sankowski, Piotr

    2011-01-01

    We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case, our algorithm supports rank-one updates in O(n2logn) randomized time and queries in constant time, whereas in the general case the algorithm works in O(n2klogn......) randomized time, where k is the number of invariant factors of the matrix. The algorithm is based on the first dynamic algorithm for computing normal forms of a matrix such as the Frobenius normal form or the tridiagonal symmetric form. The algorithm can be extended to solve the matrix eigenproblem...... with relative error 2−b in additional O(nlog2nlogb) time. Furthermore, it can be used to dynamically maintain the singular value decomposition (SVD) of a generic matrix. Together with the algorithm, the hardness of the problem is studied. For the symmetric case, we present an Ω(n2) lower bound for rank...

  15. Analyzing the effect of dynamic loads on economic dispatch in the presence of interline power flow controller using modified BAT algorithm

    Directory of Open Access Journals (Sweden)

    Y.N. Vijay Kumar

    2016-05-01

    Full Text Available Now a day, non-uniform increase of demand on a power system turns the research toward the dynamic analysis. In this paper, to perform dynamic analysis and to solve economic load dispatch problem using optimal power flow (OPF, four realistic load levels are considered. Further, the effectiveness of the objective has been enhanced in the presence of interline power flow controller (IPFC. An optimal location identification methodology for IPFC based on line stability index (LSI is also presented. The effect of ramp-rate limits on generations and the effect of dynamic loads on generation fuel cost and transmission losses are also analyzed on standard IEEE-30 bus and real time 23 bus test systems with supporting validations, numerical and graphical results.

  16. Computerized Segmentation and Characterization of Breast Lesions in Dynamic Contrast-Enhanced MR Images Using Fuzzy c-Means Clustering and Snake Algorithm

    Directory of Open Access Journals (Sweden)

    Yachun Pang

    2012-01-01

    Full Text Available This paper presents a novel two-step approach that incorporates fuzzy c-means (FCMs clustering and gradient vector flow (GVF snake algorithm for lesions contour segmentation on breast magnetic resonance imaging (BMRI. Manual delineation of the lesions by expert MR radiologists was taken as a reference standard in evaluating the computerized segmentation approach. The proposed algorithm was also compared with the FCMs clustering based method. With a database of 60 mass-like lesions (22 benign and 38 malignant cases, the proposed method demonstrated sufficiently good segmentation performance. The morphological and texture features were extracted and used to classify the benign and malignant lesions based on the proposed computerized segmentation contour and radiologists’ delineation, respectively. Features extracted by the computerized characterization method were employed to differentiate the lesions with an area under the receiver-operating characteristic curve (AUC of 0.968, in comparison with an AUC of 0.914 based on the features extracted from radiologists’ delineation. The proposed method in current study can assist radiologists to delineate and characterize BMRI lesion, such as quantifying morphological and texture features and improving the objectivity and efficiency of BMRI interpretation with a certain clinical value.

  17. Cascade Error Projection: An Efficient Hardware Learning Algorithm

    Science.gov (United States)

    Duong, T. A.

    1995-01-01

    A new learning algorithm termed cascade error projection (CEP) is presented. CEP is an adaption of a constructive architecture from cascade correlation and the dynamical stepsize of A/D conversion from the cascade back propagation algorithm.

  18. An auxiliary graph based dynamic traffic grooming algorithm in spatial division multiplexing enabled elastic optical networks with multi-core fibers

    Science.gov (United States)

    Zhao, Yongli; Tian, Rui; Yu, Xiaosong; Zhang, Jiawei; Zhang, Jie

    2017-03-01

    A proper traffic grooming strategy in dynamic optical networks can improve the utilization of bandwidth resources. An auxiliary graph (AG) is designed to solve the traffic grooming problem under a dynamic traffic scenario in spatial division multiplexing enabled elastic optical networks (SDM-EON) with multi-core fibers. Five traffic grooming policies achieved by adjusting the edge weights of an AG are proposed and evaluated through simulation: maximal electrical grooming (MEG), maximal optical grooming (MOG), maximal SDM grooming (MSG), minimize virtual hops (MVH), and minimize physical hops (MPH). Numeric results show that each traffic grooming policy has its own features. Among different traffic grooming policies, an MPH policy can achieve the lowest bandwidth blocking ratio, MEG can save the most transponders, and MSG can obtain the fewest cores for each request.

  19. ALGORITHM OF OBJECT RECOGNITION

    Directory of Open Access Journals (Sweden)

    Loktev Alexey Alexeevich

    2012-10-01

    Full Text Available The second important problem to be resolved to the algorithm and its software, that comprises an automatic design of a complex closed circuit television system, represents object recognition, by virtue of which an image is transmitted by the video camera. Since imaging of almost any object is dependent on many factors, including its orientation in respect of the camera, lighting conditions, parameters of the registering system, static and dynamic parameters of the object itself, it is quite difficult to formalize the image and represent it in the form of a certain mathematical model. Therefore, methods of computer-aided visualization depend substantially on the problems to be solved. They can be rarely generalized. The majority of these methods are non-linear; therefore, there is a need to increase the computing power and complexity of algorithms to be able to process the image. This paper covers the research of visual object recognition and implementation of the algorithm in the view of the software application that operates in the real-time mode

  20. Particle detection algorithms for complex plasmas

    Science.gov (United States)

    Mohr, D. P.; Knapek, C. A.; Huber, P.; Zaehringer, E.

    2018-01-01

    The micrometer-sized particles in a complex plasma can be directly visualized and recorded by digital video cameras. To analyze the dynamics of single particles, reliable algorithms are required to accurately determine their positions to sub-pixel accuracy from the recorded images. Here, we combine the algorithms with common techniques for image processing, and we study several algorithms, pre- and post-processing methods, and the impact of the choice of threshold parameters.

  1. The global Minmax k-means algorithm

    OpenAIRE

    Wang, Xiaoyan; Bai, Yanping

    2016-01-01

    The global k-means algorithm is an incremental approach to clustering that dynamically adds one cluster center at a time through a deterministic global search procedure from suitable initial positions, and employs k-means to minimize the sum of the intra-cluster variances. However the global k-means algorithm sometimes results singleton clusters and the initial positions sometimes are bad, after a bad initialization, poor local optimal can be easily obtained by k-means algorithm. In this pape...

  2. Scalable high-performance algorithm for the simulation of exciton-dynamics. Application to the light harvesting complex II in the presence of resonant vibrational modes

    DEFF Research Database (Denmark)

    Kreisbeck, Christoph; Kramer, Tobias; Aspuru-Guzik, Alán

    2014-01-01

    the exciton dynamics within a density-matrix formalism are known, but are restricted to small systems with less than ten sites due to their computational complexity. To study the excitonic energy transfer in larger systems, we adapt and extend the exact hierarchical equation of motion (HEOM) method to various...... high-performance many-core platforms using the Open Compute Language (OpenCL). For the light-harvesting complex II (LHC II) found in spinach, the HEOM results deviate from predictions of approximate theories and clarify the time-scale of the transfer-process. We investigate the impact of resonantly...

  3. Asynchronous Event-Driven Particle Algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Donev, A

    2007-08-30

    We present, in a unifying way, the main components of three asynchronous event-driven algorithms for simulating physical systems of interacting particles. The first example, hard-particle molecular dynamics (MD), is well-known. We also present a recently-developed diffusion kinetic Monte Carlo (DKMC) algorithm, as well as a novel stochastic molecular-dynamics algorithm that builds on the Direct Simulation Monte Carlo (DSMC). We explain how to effectively combine event-driven and classical time-driven handling, and discuss some promises and challenges for event-driven simulation of realistic physical systems.

  4. Non-renormalizability of the HMC algorithm

    Science.gov (United States)

    Lüscher, Martin; Schaefer, Stefan

    2011-04-01

    In lattice field theory, renormalizable simulation algorithms are attractive, because their scaling behaviour as a function of the lattice spacing is predictable. Algorithms implementing the Langevin equation, for example, are known to be renormalizable if the simulated theory is. In this paper we show that the situation is different in the case of the molecular-dynamics evolution on which the HMC algorithm is based. More precisely, studying the ϕ 4 theory, we find that the hyperbolic character of the molecular-dynamics equations leads to non-local (and thus non-removable) ultraviolet singularities already at one-loop order of perturbation theory.

  5. Non-renormalizability of the HMC algorithm

    CERN Document Server

    Lüscher, Martin

    2011-01-01

    In lattice field theory, renormalizable simulation algorithms are attractive, because their scaling behaviour as a function of the lattice spacing is predictable. Algorithms implementing the Langevin equation, for example, are known to be renormalizable if the simulated theory is. In this paper we show that the situation is different in the case of the molecular-dynamics evolution on which the HMC algorithm is based. More precisely, studying the phi^4 theory, we find that the hyperbolic character of the molecular-dynamics equations leads to non-local (and thus non-removable) ultraviolet singularities already at one-loop order of perturbation theory.

  6. An improved affine projection algorithm for active noise cancellation

    Science.gov (United States)

    Zhang, Congyan; Wang, Mingjiang; Han, Yufei; Sun, Yunzhuo

    2017-08-01

    Affine projection algorithm is a signal reuse algorithm, and it has a good convergence rate compared to other traditional adaptive filtering algorithm. There are two factors that affect the performance of the algorithm, which are step factor and the projection length. In the paper, we propose a new variable step size affine projection algorithm (VSS-APA). It dynamically changes the step size according to certain rules, so that it can get smaller steady-state error and faster convergence speed. Simulation results can prove that its performance is superior to the traditional affine projection algorithm and in the active noise control (ANC) applications, the new algorithm can get very good results.

  7. Stability and chaos of LMSER PCA learning algorithm

    International Nuclear Information System (INIS)

    Lv Jiancheng; Y, Zhang

    2007-01-01

    LMSER PCA algorithm is a principal components analysis algorithm. It is used to extract principal components on-line from input data. The algorithm has both stability and chaotic dynamic behavior under some conditions. This paper studies the local stability of the LMSER PCA algorithm via a corresponding deterministic discrete time system. Conditions for local stability are derived. The paper also explores the chaotic behavior of this algorithm. It shows that the LMSER PCA algorithm can produce chaos. Waveform plots, Lyapunov exponents and bifurcation diagrams are presented to illustrate the existence of chaotic behavior of this algorithm

  8. Diagnosis of major depressive disorder by combining multimodal information from heart rate dynamics and serum proteomics using machine-learning algorithm.

    Science.gov (United States)

    Kim, Eun Young; Lee, Min Young; Kim, Se Hyun; Ha, Kyooseob; Kim, Kwang Pyo; Ahn, Yong Min

    2017-06-02

    Major depressive disorder (MDD) is a systemic and multifactorial disorder that involves abnormalities in multiple biochemical pathways and the autonomic nervous system. This study applied a machine-learning method to classify MDD and control groups by incorporating data from serum proteomic analysis and heart rate variability (HRV) analysis for the identification of novel peripheral biomarkers. The study subjects consisted of 25 drug-free female MDD patients and 25 age- and sex-matched healthy controls. First, quantitative serum proteome profiles were analyzed by liquid chromatography-tandem mass spectrometry using pooled serum samples from 10 patients and 10 controls. Next, candidate proteins were quantified with multiple reaction monitoring (MRM) in 50 subjects. We also analyzed 22 linear and nonlinear HRV parameters in 50 subjects. Finally, we identified a combined biomarker panel consisting of proteins and HRV indexes using a support vector machine with recursive feature elimination. A separation between MDD and control groups was achieved using five parameters (apolipoprotein B, group-specific component, ceruloplasmin, RMSSD, and SampEn) at 80.1% classification accuracy. A combination of HRV and proteomic data achieved better classification accuracy. A high classification accuracy can be achieved by combining multimodal information from heart rate dynamics and serum proteomics in MDD. Our approach can be helpful for accurate clinical diagnosis of MDD. Further studies using larger, independent cohorts are needed to verify the role of these candidate biomarkers for MDD diagnosis. Copyright © 2017 Elsevier Inc. All rights reserved.

  9. The global Minmax k-means algorithm.

    Science.gov (United States)

    Wang, Xiaoyan; Bai, Yanping

    2016-01-01

    The global k -means algorithm is an incremental approach to clustering that dynamically adds one cluster center at a time through a deterministic global search procedure from suitable initial positions, and employs k -means to minimize the sum of the intra-cluster variances. However the global k -means algorithm sometimes results singleton clusters and the initial positions sometimes are bad, after a bad initialization, poor local optimal can be easily obtained by k -means algorithm. In this paper, we modified the global k -means algorithm to eliminate the singleton clusters at first, and then we apply MinMax k -means clustering error method to global k -means algorithm to overcome the effect of bad initialization, proposed the global Minmax k -means algorithm. The proposed clustering method is tested on some popular data sets and compared to the k -means algorithm, the global k -means algorithm and the MinMax k -means algorithm. The experiment results show our proposed algorithm outperforms other algorithms mentioned in the paper.

  10. Local simulation algorithms for Coulombic interactions

    Indian Academy of Sciences (India)

    Abstract. We consider a problem in dynamically constrained Monte Carlo dynamics and show that this leads to the generation of long ranged effective interactions. This allows us to construct a local algorithm for the simulation of charged systems without ever having to evaluate pair potentials or solve the Poisson equation.

  11. Fighting Censorship with Algorithms

    Science.gov (United States)

    Mahdian, Mohammad

    In countries such as China or Iran where Internet censorship is prevalent, users usually rely on proxies or anonymizers to freely access the web. The obvious difficulty with this approach is that once the address of a proxy or an anonymizer is announced for use to the public, the authorities can easily filter all traffic to that address. This poses a challenge as to how proxy addresses can be announced to users without leaking too much information to the censorship authorities. In this paper, we formulate this question as an interesting algorithmic problem. We study this problem in a static and a dynamic model, and give almost tight bounds on the number of proxy servers required to give access to n people k of whom are adversaries. We will also discuss how trust networks can be used in this context.

  12. Online Planning Algorithm

    Science.gov (United States)

    Rabideau, Gregg R.; Chien, Steve A.

    2010-01-01

    AVA v2 software selects goals for execution from a set of goals that oversubscribe shared resources. The term goal refers to a science or engineering request to execute a possibly complex command sequence, such as image targets or ground-station downlinks. Developed as an extension to the Virtual Machine Language (VML) execution system, the software enables onboard and remote goal triggering through the use of an embedded, dynamic goal set that can oversubscribe resources. From the set of conflicting goals, a subset must be chosen that maximizes a given quality metric, which in this case is strict priority selection. A goal can never be pre-empted by a lower priority goal, and high-level goals can be added, removed, or updated at any time, and the "best" goals will be selected for execution. The software addresses the issue of re-planning that must be performed in a short time frame by the embedded system where computational resources are constrained. In particular, the algorithm addresses problems with well-defined goal requests without temporal flexibility that oversubscribes available resources. By using a fast, incremental algorithm, goal selection can be postponed in a "just-in-time" fashion allowing requests to be changed or added at the last minute. Thereby enabling shorter response times and greater autonomy for the system under control.

  13. Universal algorithm of time sharing

    International Nuclear Information System (INIS)

    Silin, I.N.; Fedyun'kin, E.D.

    1979-01-01

    Timesharing system algorithm is proposed for the wide class of one- and multiprocessor computer configurations. Dynamical priority is the piece constant function of the channel characteristic and system time quantum. The interactive job quantum has variable length. Characteristic recurrent formula is received. The concept of the background job is introduced. Background job loads processor if high priority jobs are inactive. Background quality function is given on the base of the statistical data received in the timesharing process. Algorithm includes optimal trashing off procedure for the jobs replacements in the memory. Sharing of the system time in proportion to the external priorities is guaranteed for the all active enough computing channels (back-ground too). The fast answer is guaranteed for the interactive jobs, which use small time and memory. The external priority control is saved for the high level scheduler. The experience of the algorithm realization on the BESM-6 computer in JINR is discussed

  14. Fault Tolerant External Memory Algorithms

    DEFF Research Database (Denmark)

    Jørgensen, Allan Grønlund; Brodal, Gerth Stølting; Mølhave, Thomas

    2009-01-01

    Algorithms dealing with massive data sets are usually designed for I/O-efficiency, often captured by the I/O model by Aggarwal and Vitter. Another aspect of dealing with massive data is how to deal with memory faults, e.g. captured by the adversary based faulty memory RAM by Finocchi and Italiano....... However, current fault tolerant algorithms do not scale beyond the internal memory. In this paper we investigate for the first time the connection between I/O-efficiency in the I/O model and fault tolerance in the faulty memory RAM, and we assume that both memory and disk are unreliable. We show a lower...... bound on the number of I/Os required for any deterministic dictionary that is resilient to memory faults. We design a static and a dynamic deterministic dictionary with optimal query performance as well as an optimal sorting algorithm and an optimal priority queue. Finally, we consider scenarios where...

  15. Accelerating population balance-Monte Carlo simulation for coagulation dynamics from the Markov jump model, stochastic algorithm and GPU parallel computing

    International Nuclear Information System (INIS)

    Xu, Zuwei; Zhao, Haibo; Zheng, Chuguang

    2015-01-01

    This paper proposes a comprehensive framework for accelerating population balance-Monte Carlo (PBMC) simulation of particle coagulation dynamics. By combining Markov jump model, weighted majorant kernel and GPU (graphics processing unit) parallel computing, a significant gain in computational efficiency is achieved. The Markov jump model constructs a coagulation-rule matrix of differentially-weighted simulation particles, so as to capture the time evolution of particle size distribution with low statistical noise over the full size range and as far as possible to reduce the number of time loopings. Here three coagulation rules are highlighted and it is found that constructing appropriate coagulation rule provides a route to attain the compromise between accuracy and cost of PBMC methods. Further, in order to avoid double looping over all simulation particles when considering the two-particle events (typically, particle coagulation), the weighted majorant kernel is introduced to estimate the maximum coagulation rates being used for acceptance–rejection processes by single-looping over all particles, and meanwhile the mean time-step of coagulation event is estimated by summing the coagulation kernels of rejected and accepted particle pairs. The computational load of these fast differentially-weighted PBMC simulations (based on the Markov jump model) is reduced greatly to be proportional to the number of simulation particles in a zero-dimensional system (single cell). Finally, for a spatially inhomogeneous multi-dimensional (multi-cell) simulation, the proposed fast PBMC is performed in each cell, and multiple cells are parallel processed by multi-cores on a GPU that can implement the massively threaded data-parallel tasks to obtain remarkable speedup ratio (comparing with CPU computation, the speedup ratio of GPU parallel computing is as high as 200 in a case of 100 cells with 10 000 simulation particles per cell). These accelerating approaches of PBMC are

  16. An efficient and fast detection algorithm for multimode FBG sensing

    DEFF Research Database (Denmark)

    Ganziy, Denis; Jespersen, O.; Rose, B.

    2015-01-01

    We propose a novel dynamic gate algorithm (DGA) for fast and accurate peak detection. The algorithm uses threshold determined detection window and Center of gravity algorithm with bias compensation. We analyze the wavelength fit resolution of the DGA for different values of signal to noise ratio ...

  17. Discrete dynamics versus analytic dynamics

    DEFF Research Database (Denmark)

    Toxværd, Søren

    2014-01-01

    For discrete classical Molecular dynamics obtained by the “Verlet” algorithm (VA) with the time increment h there exists a shadow Hamiltonian H˜ with energy E˜(h) , for which the discrete particle positions lie on the analytic trajectories for H˜ . Here, we proof that there, independent of such a......For discrete classical Molecular dynamics obtained by the “Verlet” algorithm (VA) with the time increment h there exists a shadow Hamiltonian H˜ with energy E˜(h) , for which the discrete particle positions lie on the analytic trajectories for H˜ . Here, we proof that there, independent...... of such an analytic analogy, exists an exact hidden energy invariance E * for VA dynamics. The fact that the discrete VA dynamics has the same invariances as Newtonian dynamics raises the question, which of the formulations that are correct, or alternatively, the most appropriate formulation of classical dynamics....... In this context the relation between the discrete VA dynamics and the (general) discrete dynamics investigated by Lee [Phys. Lett. B122, 217 (1983)] is presented and discussed....

  18. SDR Input Power Estimation Algorithms

    Science.gov (United States)

    Nappier, Jennifer M.; Briones, Janette C.

    2013-01-01

    The General Dynamics (GD) S-Band software defined radio (SDR) in the Space Communications and Navigation (SCAN) Testbed on the International Space Station (ISS) provides experimenters an opportunity to develop and demonstrate experimental waveforms in space. The SDR has an analog and a digital automatic gain control (AGC) and the response of the AGCs to changes in SDR input power and temperature was characterized prior to the launch and installation of the SCAN Testbed on the ISS. The AGCs were used to estimate the SDR input power and SNR of the received signal and the characterization results showed a nonlinear response to SDR input power and temperature. In order to estimate the SDR input from the AGCs, three algorithms were developed and implemented on the ground software of the SCAN Testbed. The algorithms include a linear straight line estimator, which used the digital AGC and the temperature to estimate the SDR input power over a narrower section of the SDR input power range. There is a linear adaptive filter algorithm that uses both AGCs and the temperature to estimate the SDR input power over a wide input power range. Finally, an algorithm that uses neural networks was designed to estimate the input power over a wide range. This paper describes the algorithms in detail and their associated performance in estimating the SDR input power.

  19. The algorithm design manual

    CERN Document Server

    Skiena, Steven S

    2008-01-01

    Explaining designing algorithms, and analyzing their efficacy and efficiency, this book covers combinatorial algorithms technology, stressing design over analysis. It presents instruction on methods for designing and analyzing computer algorithms. It contains the catalog of algorithmic resources, implementations and a bibliography

  20. The Algorithmic Imaginary

    DEFF Research Database (Denmark)

    Bucher, Taina

    2017-01-01

    of algorithms affect people's use of these platforms, if at all? To help answer these questions, this article examines people's personal stories about the Facebook algorithm through tweets and interviews with 25 ordinary users. To understand the spaces where people and algorithms meet, this article develops....... Examining how algorithms make people feel, then, seems crucial if we want to understand their social power....

  1. Algorithmically specialized parallel computers

    CERN Document Server

    Snyder, Lawrence; Gannon, Dennis B

    1985-01-01

    Algorithmically Specialized Parallel Computers focuses on the concept and characteristics of an algorithmically specialized computer.This book discusses the algorithmically specialized computers, algorithmic specialization using VLSI, and innovative architectures. The architectures and algorithms for digital signal, speech, and image processing and specialized architectures for numerical computations are also elaborated. Other topics include the model for analyzing generalized inter-processor, pipelined architecture for search tree maintenance, and specialized computer organization for raster

  2. A New Aloha Anti-Collision Algorithm Based on CDMA

    Science.gov (United States)

    Bai, Enjian; Feng, Zhu

    The tags' collision is a common problem in RFID (radio frequency identification) system. The problem has affected the integrity of the data transmission during the process of communication in the RFID system. Based on analysis of the existing anti-collision algorithm, a novel anti-collision algorithm is presented. The new algorithm combines the group dynamic frame slotted Aloha algorithm with code division multiple access technology. The algorithm can effectively reduce the collision probability between tags. Under the same number of tags, the algorithm is effective in reducing the reader recognition time and improve overall system throughput rate.

  3. Optimal tracking algorithm: a DSP approach

    Science.gov (United States)

    Salvatti, Fred; Meshkat, Sy; Stufflebeam, Joseph L.

    1995-05-01

    This paper investigates the problem of tracking highly dynamic targets in real-time. The advantages and disadvantages of various control and interpolation techniques are discussed. Algorithms appropriate for real- time tracking are compared with algorithms that are common in applications with a priori knowledge of the trajectory. A unique command interpolation technique combined with a state feedback control structure, implemented on a commercial DSP controller, demonstrates a significant performance improvement.

  4. Simulated annealing algorithm for optimal capital growth

    Science.gov (United States)

    Luo, Yong; Zhu, Bo; Tang, Yong

    2014-08-01

    We investigate the problem of dynamic optimal capital growth of a portfolio. A general framework that one strives to maximize the expected logarithm utility of long term growth rate was developed. Exact optimization algorithms run into difficulties in this framework and this motivates the investigation of applying simulated annealing optimized algorithm to optimize the capital growth of a given portfolio. Empirical results with real financial data indicate that the approach is inspiring for capital growth portfolio.

  5. Some experiences with the Eigensystem Realization Algorithm

    Science.gov (United States)

    Pappa, Richard S.; Juang, Jer-Nan

    1988-01-01

    The Eigensystem Realization Algorithm (ERA) is a multiinput/multioutput time-domain algorithm for minimum-order system realization and modal parameter identification. It has been used for structural dynamics data analysis at the Langley Research Center for several years. Some of the practical experiences encountered in these projects are discussed in this paper. Three examples are used: the Galileo spacecraft, the Solar Array Flight Experiment, and a laboratory space-truss model. Several techniques for assessing identification accuracy are illustrated.

  6. Quantum Genetic Algorithms for Computer Scientists

    OpenAIRE

    Lahoz Beltrá, Rafael

    2016-01-01

    Genetic algorithms (GAs) are a class of evolutionary algorithms inspired by Darwinian natural selection. They are popular heuristic optimisation methods based on simulated genetic mechanisms, i.e., mutation, crossover, etc. and population dynamical processes such as reproduction, selection, etc. Over the last decade, the possibility to emulate a quantum computer (a computer using quantum-mechanical phenomena to perform operations on data) has led to a new class of GAs known as “Quantum Geneti...

  7. Dynamic Algorithms for Transition Matrix Generation

    Science.gov (United States)

    Yevick, David; Lee, Yong Hwan

    The methods of [D. Yevick, Int. J. Mod. Phys. C, 1650041] for constructing transition matrices are applied to the two dimensional Ising model. Decreasing the system temperature during the acquisition of the matrix elements yields a reasonably precise specific heat curve for a 32x32 spin system for a limited number (50-100M) of realizations. If the system is instead evolved to first higher and then lower energies within a restricted interval that is steadily displaced in energy as the computation proceeds, a modification which permits backward displacements up to a certain lower bound for each forward step ensures acceptable accuracy. Additional constraints on the transition rule are also investigated. The Natural Sciences and Engineering Research Council of Canada (NSERC) and CIENA are acknowledged for financial support.

  8. Dynamic Algorithm for LQGPC Predictive Control

    DEFF Research Database (Denmark)

    Hangstrup, M.; Ordys, A.W.; Grimble, M.J.

    1998-01-01

    into the controller design and the solution is derived using the method of Lagrange multipliers. It is shown how well-known GPC controller can be obtained as a special case of the LQGPC controller design. The important advantage of using the LQGPC framework for designing predictive, e.g. GPS is that LQGPC enables...

  9. Incremental Centrality Algorithms for Dynamic Network Analysis

    Science.gov (United States)

    2013-08-01

    identification of primarily face-to-face contacts. The power and frequency of the RFID badges were adjusted such that face-to-face communication ...can be captured with more than 99% reliability. For about 2.5 days, communication between RFID badges is recorded every 20 seconds based on the RFID ...distribution unlimited 13. SUPPLEMENTARY NOTES 14. ABSTRACT The increasing availability of online resources such as digital libraries and social

  10. Computational Fluid Dynamics: Algorithms and Supercomputers

    Science.gov (United States)

    1988-03-01

    as possible, containing long code blocks, instead of many short-code vectorizable blocks. Consider the following sequence: CALL VADD (A,B,C,N) CALL...VMULT(C,A,E,N) CALL VADD (E,B,A,N) Here one uses the vector subroutines VADD and VMULT. This version vectorizes, but the expanded combination DO 1 I = 1

  11. An algorithm for gluinos on the lattice

    International Nuclear Information System (INIS)

    Montvay, I.

    1995-10-01

    Luescher's local bosonic algorithm for Monte Carlo simulations of quantum field theories with fermions is applied to the simulation of a possibly supersymmetric Yang-Mills theory with a Majorana fermion in the adjoint representation. Combined with a correction step in a two-step polynomial approximation scheme, the obtained algorithm seems to be promising and could be competitive with more conventional algorithms based on discretized classical (''molecular dynamics'') equations of motion. The application of the considered polynomial approximation scheme to optimized hopping parameter expansions is also discussed. (orig.)

  12. Full QCD algorithms towards the chiral limit

    CERN Document Server

    Hasenbusch, M

    2003-01-01

    I discuss the behaviour of algorithms for dynamical fermions as the sea-quark mass decreases. I focus on the Hybrid-Monte-Carlo (HMC) algorithm applied to two degenerate flavours of Wilson fermions. First, I briefly review the performance obtained in large scale HMC simulations. Then I discuss a modified pseudo-fermion action for the HMC simulation that has been introduced three years ago. I summarize recent results obtained with this pseudo-fermion action by the QCDSF and the ALPHA collaborations. I comment on alternatives to the HMC, like the Multiboson algorithm and variants of it.

  13. Approximate iterative algorithms

    CERN Document Server

    Almudevar, Anthony Louis

    2014-01-01

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

  14. Autonomous Star Tracker Algorithms

    DEFF Research Database (Denmark)

    Betto, Maurizio; Jørgensen, John Leif; Kilsgaard, Søren

    1998-01-01

    Proposal, in response to an ESA R.f.P., to design algorithms for autonomous star tracker operations.The proposal also included the development of a star tracker breadboard to test the algorithms performances.......Proposal, in response to an ESA R.f.P., to design algorithms for autonomous star tracker operations.The proposal also included the development of a star tracker breadboard to test the algorithms performances....

  15. Some chaotic behaviors in a MCA learning algorithm with a constant learning rate

    International Nuclear Information System (INIS)

    Lv Jiancheng; Yi Zhang

    2007-01-01

    Douglas's minor component analysis algorithm with a constant learning rate has both stability and chaotic dynamical behavior under some conditions. The paper explores such dynamical behavior of this algorithm. Certain stability and chaos of this algorithm are derived. Waveform plots, Lyapunov exponents and bifurcation diagrams are presented to illustrate the existence of chaotic behavior

  16. A verified LLL algorithm

    NARCIS (Netherlands)

    Divasón, Jose; Joosten, Sebastiaan; Thiemann, René; Yamada, Akihisa

    2018-01-01

    The Lenstra-Lenstra-Lovász basis reduction algorithm, also known as LLL algorithm, is an algorithm to find a basis with short, nearly orthogonal vectors of an integer lattice. Thereby, it can also be seen as an approximation to solve the shortest vector problem (SVP), which is an NP-hard problem,

  17. Static and dynamic properties of dissipative particle dynamics

    NARCIS (Netherlands)

    Marsh, C.A.; Backx, G.; Ernst, M.H.

    The algorithm for the dissipative particle dynamics (DPD) fluid, the dynamics of which is conceptually a combination of molecular dynamics, Brownian dynamics, and lattice gas automata, is designed for simulating rheological properties of complex fluids on hydrodynamic time scales. This paper

  18. Toward an Algorithmic Pedagogy

    Directory of Open Access Journals (Sweden)

    Holly Willis

    2007-01-01

    Full Text Available The demand for an expanded definition of literacy to accommodate visual and aural media is not particularly new, but it gains urgency as college students transform, becoming producers of media in many of their everyday social activities. The response among those who grapple with these issues as instructors has been to advocate for new definitions of literacy and particularly, an understanding of visual literacy. These efforts are exemplary, and promote a much needed rethinking of literacy and models of pedagogy. However, in what is more akin to a manifesto than a polished argument, this essay argues that we need to push farther: What if we moved beyond visual rhetoric, as well as a game-based pedagogy and the adoption of a broad range of media tools on campus, toward a pedagogy grounded fundamentally in a media ecology? Framing this investigation in terms of a media ecology allows us to take account of the multiply determining relationships wrought not just by individual media, but by the interrelationships, dependencies and symbioses that take place within the dynamic system that is today’s high-tech university. An ecological approach allows us to examine what happens when new media practices collide with computational models, providing a glimpse of possible transformations not only ways of being but ways of teaching and learning. How, then, may pedagogical practices be transformed computationally or algorithmically and to what ends?

  19. Nature-inspired optimization algorithms

    CERN Document Server

    Yang, Xin-She

    2014-01-01

    Nature-Inspired Optimization Algorithms provides a systematic introduction to all major nature-inspired algorithms for optimization. The book's unified approach, balancing algorithm introduction, theoretical background and practical implementation, complements extensive literature with well-chosen case studies to illustrate how these algorithms work. Topics include particle swarm optimization, ant and bee algorithms, simulated annealing, cuckoo search, firefly algorithm, bat algorithm, flower algorithm, harmony search, algorithm analysis, constraint handling, hybrid methods, parameter tuning

  20. Parallel sorting algorithms

    CERN Document Server

    Akl, Selim G

    1985-01-01

    Parallel Sorting Algorithms explains how to use parallel algorithms to sort a sequence of items on a variety of parallel computers. The book reviews the sorting problem, the parallel models of computation, parallel algorithms, and the lower bounds on the parallel sorting problems. The text also presents twenty different algorithms, such as linear arrays, mesh-connected computers, cube-connected computers. Another example where algorithm can be applied is on the shared-memory SIMD (single instruction stream multiple data stream) computers in which the whole sequence to be sorted can fit in the