A dynamic programming approach to adaptive fractionation
NASA Astrophysics Data System (ADS)
Ramakrishnan, Jagdish; Craft, David; Bortfeld, Thomas; Tsitsiklis, John N.
2012-03-01
We conduct a theoretical study of various solution methods for the adaptive fractionation problem. The two messages of this paper are as follows: (i) dynamic programming (DP) is a useful framework for adaptive radiation therapy, particularly adaptive fractionation, because it allows us to assess how close to optimal different methods are, and (ii) heuristic methods proposed in this paper are near-optimal, and therefore, can be used to evaluate the best possible benefit of using an adaptive fraction size. The essence of adaptive fractionation is to increase the fraction size when the tumor and organ-at-risk (OAR) are far apart (a ‘favorable’ anatomy) and to decrease the fraction size when they are close together. Given that a fixed prescribed dose must be delivered to the tumor over the course of the treatment, such an approach results in a lower cumulative dose to the OAR when compared to that resulting from standard fractionation. We first establish a benchmark by using the DP algorithm to solve the problem exactly. In this case, we characterize the structure of an optimal policy, which provides guidance for our choice of heuristics. We develop two intuitive, numerically near-optimal heuristic policies, which could be used for more complex, high-dimensional problems. Furthermore, one of the heuristics requires only a statistic of the motion probability distribution, making it a reasonable method for use in a realistic setting. Numerically, we find that the amount of decrease in dose to the OAR can vary significantly (5-85%) depending on the amount of motion in the anatomy, the number of fractions and the range of fraction sizes allowed. In general, the decrease in dose to the OAR is more pronounced when: (i) we have a high probability of large tumor-OAR distances, (ii) we use many fractions (as in a hyper-fractionated setting) and (iii) we allow large daily fraction size deviations.
Robust adaptive dynamic programming and feedback stabilization of nonlinear systems.
Jiang, Yu; Jiang, Zhong-Ping
2014-05-01
This paper studies the robust optimal control design for a class of uncertain nonlinear systems from a perspective of robust adaptive dynamic programming (RADP). The objective is to fill up a gap in the past literature of adaptive dynamic programming (ADP) where dynamic uncertainties or unmodeled dynamics are not addressed. A key strategy is to integrate tools from modern nonlinear control theory, such as the robust redesign and the backstepping techniques as well as the nonlinear small-gain theorem, with the theory of ADP. The proposed RADP methodology can be viewed as an extension of ADP to uncertain nonlinear systems. Practical learning algorithms are developed in this paper, and have been applied to the controller design problems for a jet engine and a one-machine power system.
Adaptive dynamic programming for auto-resilient video streaming
NASA Astrophysics Data System (ADS)
Zhao, Juan; Li, Xingmei; Wang, Wei; Wu, Guoping
2007-11-01
Wireless video transmission encounters higher error rate than in wired network, which introduces distortion into the error-sensitive compressed data, reducing the quality of the playback video. Therefore, to ensure the end-to-end quality, wireless video needs a transmission system including both efficient source coding scheme and transmission technology against the influence of the channel error. This paper tackles a dynamic programming algorithm for robust video streaming over error-prone channels. An auto-resilient multiple-description coding with optimized transmission strategy has been proposed. Further study is done on the computational complexity of rate-distortion optimized video streaming and a dynamic programming algorithm is considered. Experiment results show that video streaming with adaptive dynamic programming gains better playback video quality at the receiver when transmitted through error-prone mobile channel.
Adaption of a corrector module to the IMP dynamics program
NASA Technical Reports Server (NTRS)
1972-01-01
The corrector module of the RAEIOS program and the IMP dynamics computer program were combined to achieve a date-fitting capability with the more general spacecraft dynamics models of the IMP program. The IMP dynamics program presents models of spacecraft dynamics for satellites with long, flexible booms. The properties of the corrector are discussed and a description is presented of the performance criteria and search logic for parameter estimation. A description is also given of the modifications made to add the corrector to the IMP program. This includes subroutine descriptions, common definitions, definition of input, and a description of output.
Recursive dynamic programming for adaptive sequence and structure alignment
Thiele, R.; Zimmer, R.; Lengauer, T.
1995-12-31
We propose a new alignment procedure that is capable of aligning protein sequences and structures in a unified manner. Recursive dynamic programming (RDP) is a hierarchical method which, on each level of the hierarchy, identifies locally optimal solutions and assembles them into partial alignments of sequences and/or structures. In contrast to classical dynamic programming, RDP can also handle alignment problems that use objective functions not obeying the principle of prefix optimality, e.g. scoring schemes derived from energy potentials of mean force. For such alignment problems, RDP aims at computing solutions that are near-optimal with respect to the involved cost function and biologically meaningful at the same time. Towards this goal, RDP maintains a dynamic balance between different factors governing alignment fitness such as evolutionary relationships and structural preferences. As in the RDP method gaps are not scored explicitly, the problematic assignment of gap cost parameters is circumvented. In order to evaluate the RDP approach we analyse whether known and accepted multiple alignments based on structural information can be reproduced with the RDP method.
Hamiltonian-Driven Adaptive Dynamic Programming for Continuous Nonlinear Dynamical Systems.
Yang, Yongliang; Wunsch, Donald; Yin, Yixin
2017-02-01
This paper presents a Hamiltonian-driven framework of adaptive dynamic programming (ADP) for continuous time nonlinear systems, which consists of evaluation of an admissible control, comparison between two different admissible policies with respect to the corresponding the performance function, and the performance improvement of an admissible control. It is showed that the Hamiltonian can serve as the temporal difference for continuous-time systems. In the Hamiltonian-driven ADP, the critic network is trained to output the value gradient. Then, the inner product between the critic and the system dynamics produces the value derivative. Under some conditions, the minimization of the Hamiltonian functional is equivalent to the value function approximation. An iterative algorithm starting from an arbitrary admissible control is presented for the optimal control approximation with its convergence proof. The implementation is accomplished by a neural network approximation. Two simulation studies demonstrate the effectiveness of Hamiltonian-driven ADP.
NASA Astrophysics Data System (ADS)
Qin, Chunbin; Zhang, Huaguang; Luo, Yanhong
2014-05-01
In this paper, a novel theoretic formulation based on adaptive dynamic programming (ADP) is developed to solve online the optimal tracking problem of the continuous-time linear system with unknown dynamics. First, the original system dynamics and the reference trajectory dynamics are transformed into an augmented system. Then, under the same performance index with the original system dynamics, an augmented algebraic Riccati equation is derived. Furthermore, the solutions for the optimal control problem of the augmented system are proven to be equal to the standard solutions for the optimal tracking problem of the original system dynamics. Moreover, a new online algorithm based on the ADP technique is presented to solve the optimal tracking problem of the linear system with unknown system dynamics. Finally, simulation results are given to verify the effectiveness of the theoretic results.
Luo, Biao; Wu, Huai-Ning; Li, Han-Xiong
2015-04-01
Highly dissipative nonlinear partial differential equations (PDEs) are widely employed to describe the system dynamics of industrial spatially distributed processes (SDPs). In this paper, we consider the optimal control problem of the general highly dissipative SDPs, and propose an adaptive optimal control approach based on neuro-dynamic programming (NDP). Initially, Karhunen-Loève decomposition is employed to compute empirical eigenfunctions (EEFs) of the SDP based on the method of snapshots. These EEFs together with singular perturbation technique are then used to obtain a finite-dimensional slow subsystem of ordinary differential equations that accurately describes the dominant dynamics of the PDE system. Subsequently, the optimal control problem is reformulated on the basis of the slow subsystem, which is further converted to solve a Hamilton-Jacobi-Bellman (HJB) equation. HJB equation is a nonlinear PDE that has proven to be impossible to solve analytically. Thus, an adaptive optimal control method is developed via NDP that solves the HJB equation online using neural network (NN) for approximating the value function; and an online NN weight tuning law is proposed without requiring an initial stabilizing control policy. Moreover, by involving the NN estimation error, we prove that the original closed-loop PDE system with the adaptive optimal control policy is semiglobally uniformly ultimately bounded. Finally, the developed method is tested on a nonlinear diffusion-convection-reaction process and applied to a temperature cooling fin of high-speed aerospace vehicle, and the achieved results show its effectiveness.
Lewis, F L; Vamvoudakis, Kyriakos G
2011-02-01
Approximate dynamic programming (ADP) is a class of reinforcement learning methods that have shown their importance in a variety of applications, including feedback control of dynamical systems. ADP generally requires full information about the system internal states, which is usually not available in practical situations. In this paper, we show how to implement ADP methods using only measured input/output data from the system. Linear dynamical systems with deterministic behavior are considered herein, which are systems of great interest in the control system community. In control system theory, these types of methods are referred to as output feedback (OPFB). The stochastic equivalent of the systems dealt with in this paper is a class of partially observable Markov decision processes. We develop both policy iteration and value iteration algorithms that converge to an optimal controller that requires only OPFB. It is shown that, similar to Q -learning, the new methods have the important advantage that knowledge of the system dynamics is not needed for the implementation of these learning algorithms or for the OPFB control. Only the order of the system, as well as an upper bound on its "observability index," must be known. The learned OPFB controller is in the form of a polynomial autoregressive moving-average controller that has equivalent performance with the optimal state variable feedback gain.
Air-Breathing Hypersonic Vehicle Tracking Control Based on Adaptive Dynamic Programming.
Mu, Chaoxu; Ni, Zhen; Sun, Changyin; He, Haibo
2017-03-01
In this paper, we propose a data-driven supplementary control approach with adaptive learning capability for air-breathing hypersonic vehicle tracking control based on action-dependent heuristic dynamic programming (ADHDP). The control action is generated by the combination of sliding mode control (SMC) and the ADHDP controller to track the desired velocity and the desired altitude. In particular, the ADHDP controller observes the differences between the actual velocity/altitude and the desired velocity/altitude, and then provides a supplementary control action accordingly. The ADHDP controller does not rely on the accurate mathematical model function and is data driven. Meanwhile, it is capable to adjust its parameters online over time under various working conditions, which is very suitable for hypersonic vehicle system with parameter uncertainties and disturbances. We verify the adaptive supplementary control approach versus the traditional SMC in the cruising flight, and provide three simulation studies to illustrate the improved performance with the proposed approach.
Sahoo, Avimanyu; Jagannathan, Sarangapani
2017-02-01
In this paper, an event-driven stochastic adaptive dynamic programming (ADP)-based technique is introduced for nonlinear systems with a communication network within its feedback loop. A near optimal control policy is designed using an actor-critic framework and ADP with event sampled state vector. First, the system dynamics are approximated by using a novel neural network (NN) identifier with event sampled state vector. The optimal control policy is generated via an actor NN by using the NN identifier and value function approximated by a critic NN through ADP. The stochastic NN identifier, actor, and critic NN weights are tuned at the event sampled instants leading to aperiodic weight tuning laws. Above all, an adaptive event sampling condition based on estimated NN weights is designed by using the Lyapunov technique to ensure ultimate boundedness of all the closed-loop signals along with the approximation accuracy. The net result is event-driven stochastic ADP technique that can significantly reduce the computation and network transmissions. Finally, the analytical design is substantiated with simulation results.
Liu, Derong; Li, Hongliang; Wang, Ding
2015-06-01
In this paper, we establish error bounds of adaptive dynamic programming algorithms for solving undiscounted infinite-horizon optimal control problems of discrete-time deterministic nonlinear systems. We consider approximation errors in the update equations of both value function and control policy. We utilize a new assumption instead of the contraction assumption in discounted optimal control problems. We establish the error bounds for approximate value iteration based on a new error condition. Furthermore, we also establish the error bounds for approximate policy iteration and approximate optimistic policy iteration algorithms. It is shown that the iterative approximate value function can converge to a finite neighborhood of the optimal value function under some conditions. To implement the developed algorithms, critic and action neural networks are used to approximate the value function and control policy, respectively. Finally, a simulation example is given to demonstrate the effectiveness of the developed algorithms.
NASA Astrophysics Data System (ADS)
Wei, Qing-Lai; Liu, De-Rong; Xu, Yan-Cai
2015-03-01
A policy iteration algorithm of adaptive dynamic programming (ADP) is developed to solve the optimal tracking control for a class of discrete-time chaotic systems. By system transformations, the optimal tracking problem is transformed into an optimal regulation one. The policy iteration algorithm for discrete-time chaotic systems is first described. Then, the convergence and admissibility properties of the developed policy iteration algorithm are presented, which show that the transformed chaotic system can be stabilized under an arbitrary iterative control law and the iterative performance index function simultaneously converges to the optimum. By implementing the policy iteration algorithm via neural networks, the developed optimal tracking control scheme for chaotic systems is verified by a simulation. Project supported by the National Natural Science Foundation of China (Grant Nos. 61034002, 61233001, 61273140, 61304086, and 61374105) and the Beijing Natural Science Foundation, China (Grant No. 4132078).
Zhu, Yuanheng; Zhao, Dongbin; Li, Xiangjun
2017-03-01
H∞ control is a powerful method to solve the disturbance attenuation problems that occur in some control systems. The design of such controllers relies on solving the zero-sum game (ZSG). But in practical applications, the exact dynamics is mostly unknown. Identification of dynamics also produces errors that are detrimental to the control performance. To overcome this problem, an iterative adaptive dynamic programming algorithm is proposed in this paper to solve the continuous-time, unknown nonlinear ZSG with only online data. A model-free approach to the Hamilton-Jacobi-Isaacs equation is developed based on the policy iteration method. Control and disturbance policies and value are approximated by neural networks (NNs) under the critic-actor-disturber structure. The NN weights are solved by the least-squares method. According to the theoretical analysis, our algorithm is equivalent to a Gauss-Newton method solving an optimization problem, and it converges uniformly to the optimal solution. The online data can also be used repeatedly, which is highly efficient. Simulation results demonstrate its feasibility to solve the unknown nonlinear ZSG. When compared with other algorithms, it saves a significant amount of online measurement time.
Policy iteration adaptive dynamic programming algorithm for discrete-time nonlinear systems.
Liu, Derong; Wei, Qinglai
2014-03-01
This paper is concerned with a new discrete-time policy iteration adaptive dynamic programming (ADP) method for solving the infinite horizon optimal control problem of nonlinear systems. The idea is to use an iterative ADP technique to obtain the iterative control law, which optimizes the iterative performance index function. The main contribution of this paper is to analyze the convergence and stability properties of policy iteration method for discrete-time nonlinear systems for the first time. It shows that the iterative performance index function is nonincreasingly convergent to the optimal solution of the Hamilton-Jacobi-Bellman equation. It is also proven that any of the iterative control laws can stabilize the nonlinear systems. Neural networks are used to approximate the performance index function and compute the optimal control law, respectively, for facilitating the implementation of the iterative ADP algorithm, where the convergence of the weight matrices is analyzed. Finally, the numerical results and analysis are presented to illustrate the performance of the developed method.
Fair Energy Scheduling for Vehicle-to-Grid Networks Using Adaptive Dynamic Programming.
Xie, Shengli; Zhong, Weifeng; Xie, Kan; Yu, Rong; Zhang, Yan
2016-08-01
Research on the smart grid is being given enormous supports worldwide due to its great significance in solving environmental and energy crises. Electric vehicles (EVs), which are powered by clean energy, are adopted increasingly year by year. It is predictable that the huge charge load caused by high EV penetration will have a considerable impact on the reliability of the smart grid. Therefore, fair energy scheduling for EV charge and discharge is proposed in this paper. By using the vehicle-to-grid technology, the scheduler controls the electricity loads of EVs considering fairness in the residential distribution network. We propose contribution-based fairness, in which EVs with high contributions have high priorities to obtain charge energy. The contribution value is defined by both the charge/discharge energy and the timing of the action. EVs can achieve higher contribution values when discharging during the load peak hours. However, charging during this time will decrease the contribution values seriously. We formulate the fair energy scheduling problem as an infinite-horizon Markov decision process. The methodology of adaptive dynamic programming is employed to maximize the long-term fairness by processing online network training. The numerical results illustrate that the proposed EV energy scheduling is able to mitigate and flatten the peak load in the distribution network. Furthermore, contribution-based fairness achieves a fast recovery of EV batteries that have deeply discharged and guarantee fairness in the full charge time of all EVs.
Value Iteration Adaptive Dynamic Programming for Optimal Control of Discrete-Time Nonlinear Systems.
Wei, Qinglai; Liu, Derong; Lin, Hanquan
2016-03-01
In this paper, a value iteration adaptive dynamic programming (ADP) algorithm is developed to solve infinite horizon undiscounted optimal control problems for discrete-time nonlinear systems. The present value iteration ADP algorithm permits an arbitrary positive semi-definite function to initialize the algorithm. A novel convergence analysis is developed to guarantee that the iterative value function converges to the optimal performance index function. Initialized by different initial functions, it is proven that the iterative value function will be monotonically nonincreasing, monotonically nondecreasing, or nonmonotonic and will converge to the optimum. In this paper, for the first time, the admissibility properties of the iterative control laws are developed for value iteration algorithms. It is emphasized that new termination criteria are established to guarantee the effectiveness of the iterative control laws. Neural networks are used to approximate the iterative value function and compute the iterative control law, respectively, for facilitating the implementation of the iterative ADP algorithm. Finally, two simulation examples are given to illustrate the performance of the present method.
Nalbantoğlu, Ö Ufuk
2014-01-01
Independent scoring of the aligned sections to determine the quality of biological sequence alignments enables recursive definitions of the overall alignment score. This property is not only biologically meaningful but it also provides the opportunity to find the optimal alignments using dynamic programming-based algorithms. Dynamic programming is an efficient problem solving technique for a class of problems that can be solved by dividing into overlapping subproblems. Pairwise sequence alignment techniques such as Needleman-Wunsch and Smith-Waterman algorithms are applications of dynamic programming on pairwise sequence alignment problems. These algorithms offer polynomial time and space solutions. In this chapter, we introduce the basic dynamic programming solutions for global, semi-global, and local alignment problems. Algorithmic improvements offering quadratic-time and linear-space programs and approximate solutions with space-reduction and seeding heuristics are discussed. We finally introduce the application of these techniques on multiple sequence alignment briefly.
Water Resource Adaptation Program
The Water Resource Adaptation Program (WRAP) contributes to the U.S. Environmental Protection Agency’s (U.S. EPA) efforts to provide water resource managers and decision makers with the tools needed to adapt water resources to demographic and economic development, and future clim...
Karemere, Hermès; Ribesse, Nathalie; Kahindo, Jean-Bosco; Macq, Jean
2015-01-01
Introduction In many African countries, first referral hospitals received little attention from development agencies until recently. We report the evolution of two of them in an unstable region like Eastern Democratic Republic of Congo when receiving the support from development aid program. Specifically, we aimed at studying how actors’ network and institutional framework evolved over time and what could matter the most when looking at their performance in such an environment. Methods We performed two cases studies between 2006 and 2010. We used multiple sources of data: reports to document events; health information system for hospital services production, and “key-informants” interviews to interpret the relation between interventions and services production. Our analysis was inspired from complex adaptive system theory. It started from the analysis of events implementation, to explore interaction process between the main agents in each hospital, and the consequence it could have on hospital health services production. This led to the development of new theoretical propositions. Results Two events implemented in the frame of the development aid program were identified by most of the key-informants interviewed as having the greatest impact on hospital performance: the development of a hospital plan and the performance based financing. They resulted in contrasting interaction process between the main agents between the two hospitals. Two groups of services production were reviewed: consultation at outpatient department and admissions, and surgery. The evolution of both groups of services production were different between both hospitals. Conclusion By studying two first referral hospitals through the lens of a Complex Adaptive System, their performance in a context of development aid takes a different meaning. Success is not only measured through increased hospital production but through meaningful process of hospital agents’” network adaptation. Expected
Mu, Chaoxu; Ni, Zhen; Sun, Changyin; He, Haibo
2016-04-22
A data-driven adaptive tracking control approach is proposed for a class of continuous-time nonlinear systems using a recent developed goal representation heuristic dynamic programming (GrHDP) architecture. The major focus of this paper is on designing a multivariable tracking scheme, including the filter-based action network (FAN) architecture, and the stability analysis in continuous-time fashion. In this design, the FAN is used to observe the system function, and then generates the corresponding control action together with the reference signals. The goal network will provide an internal reward signal adaptively based on the current system states and the control action. This internal reward signal is assigned as the input for the critic network, which approximates the cost function over time. We demonstrate its improved tracking performance in comparison with the existing heuristic dynamic programming (HDP) approach under the same parameter and environment settings. The simulation results of the multivariable tracking control on two examples have been presented to show that the proposed scheme can achieve better control in terms of learning speed and overall performance.
Zhang, Huaguang; Jiang, He; Luo, Chaomin; Xiao, Geyang
2016-10-03
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.
Yu, Rong; Zhong, Weifeng; Xie, Shengli; Zhang, Yan; Zhang, Yun
2016-02-01
As the next-generation power grid, smart grid will be integrated with a variety of novel communication technologies to support the explosive data traffic and the diverse requirements of quality of service (QoS). Cognitive radio (CR), which has the favorable ability to improve the spectrum utilization, provides an efficient and reliable solution for smart grid communications networks. In this paper, we study the QoS differential scheduling problem in the CR-based smart grid communications networks. The scheduler is responsible for managing the spectrum resources and arranging the data transmissions of smart grid users (SGUs). To guarantee the differential QoS, the SGUs are assigned to have different priorities according to their roles and their current situations in the smart grid. Based on the QoS-aware priority policy, the scheduler adjusts the channels allocation to minimize the transmission delay of SGUs. The entire transmission scheduling problem is formulated as a semi-Markov decision process and solved by the methodology of adaptive dynamic programming. A heuristic dynamic programming (HDP) architecture is established for the scheduling problem. By the online network training, the HDP can learn from the activities of primary users and SGUs, and adjust the scheduling decision to achieve the purpose of transmission delay minimization. Simulation results illustrate that the proposed priority policy ensures the low transmission delay of high priority SGUs. In addition, the emergency data transmission delay is also reduced to a significantly low level, guaranteeing the differential QoS in smart grid.
Adaptive Dynamic Bayesian Networks
Ng, B M
2007-10-26
A discrete-time Markov process can be compactly modeled as a dynamic Bayesian network (DBN)--a graphical model with nodes representing random variables and directed edges indicating causality between variables. Each node has a probability distribution, conditional on the variables represented by the parent nodes. A DBN's graphical structure encodes fixed conditional dependencies between variables. But in real-world systems, conditional dependencies between variables may be unknown a priori or may vary over time. Model errors can result if the DBN fails to capture all possible interactions between variables. Thus, we explore the representational framework of adaptive DBNs, whose structure and parameters can change from one time step to the next: a distribution's parameters and its set of conditional variables are dynamic. This work builds on recent work in nonparametric Bayesian modeling, such as hierarchical Dirichlet processes, infinite-state hidden Markov networks and structured priors for Bayes net learning. In this paper, we will explain the motivation for our interest in adaptive DBNs, show how popular nonparametric methods are combined to formulate the foundations for adaptive DBNs, and present preliminary results.
Multiprocessor Adaptive Control Of A Dynamic System
NASA Technical Reports Server (NTRS)
Juang, Jer-Nan; Hyland, David C.
1995-01-01
Architecture for fully autonomous digital electronic control system developed for use in identification and adaptive control of dynamic system. Architecture modular and hierarchical. Combines relatively simple, standardized processing units into complex parallel-processing subsystems. Although architecture based on neural-network concept, processing units themselves not neural networks; processing units implemented by programming of currently available microprocessors.
Parallel Programming Strategies for Irregular Adaptive Applications
NASA Technical Reports Server (NTRS)
Biswas, Rupak; Biegel, Bryan (Technical Monitor)
2001-01-01
Achieving scalable performance for dynamic irregular applications is eminently challenging. Traditional message-passing approaches have been making steady progress towards this goal; however, they suffer from complex implementation requirements. The use of a global address space greatly simplifies the programming task, but can degrade the performance for such computations. In this work, we examine two typical irregular adaptive applications, Dynamic Remeshing and N-Body, under competing programming methodologies and across various parallel architectures. The Dynamic Remeshing application simulates flow over an airfoil, and refines localized regions of the underlying unstructured mesh. The N-Body experiment models two neighboring Plummer galaxies that are about to undergo a merger. Both problems demonstrate dramatic changes in processor workloads and interprocessor communication with time; thus, dynamic load balancing is a required component.
Dynamic patterns of adaptive radiation.
Gavrilets, Sergey; Vose, Aaron
2005-12-13
Adaptive radiation is defined as the evolution of ecological and phenotypic diversity within a rapidly multiplying lineage. When it occurs, adaptive radiation typically follows the colonization of a new environment or the establishment of a "key innovation," which opens new ecological niches and/or new paths for evolution. Here, we take advantage of recent developments in speciation theory and modern computing power to build and explore a large-scale, stochastic, spatially explicit, individual-based model of adaptive radiation driven by adaptation to multidimensional ecological niches. We are able to model evolutionary dynamics of populations with hundreds of thousands of sexual diploid individuals over a time span of 100,000 generations assuming realistic mutation rates and allowing for genetic variation in a large number of both selected and neutral loci. Our results provide theoretical support and explanation for a number of empirical patterns including "area effect," "overshooting effect," and "least action effect," as well as for the idea of a "porous genome." Our findings suggest that the genetic architecture of traits involved in the most spectacular radiations might be rather simple. We show that a great majority of speciation events are concentrated early in the phylogeny. Our results emphasize the importance of ecological opportunity and genetic constraints in controlling the dynamics of adaptive radiation.
Adaptive Dynamic Event Tree in RAVEN code
Alfonsi, Andrea; Rabiti, Cristian; Mandelli, Diego; Cogliati, Joshua Joseph; Kinoshita, Robert Arthur
2014-11-01
RAVEN is a software tool that is focused on performing statistical analysis of stochastic dynamic systems. RAVEN has been designed in a high modular and pluggable way in order to enable easy integration of different programming languages (i.e., C++, Python) and coupling with other applications (system codes). Among the several capabilities currently present in RAVEN, there are five different sampling strategies: Monte Carlo, Latin Hyper Cube, Grid, Adaptive and Dynamic Event Tree (DET) sampling methodologies. The scope of this paper is to present a new sampling approach, currently under definition and implementation: an evolution of the DET me
Mission Adaptive Wing test program
NASA Technical Reports Server (NTRS)
Birk, Frank T.; Smith, Rogers E.
1986-01-01
With the completion of the F-111 test-bed Mission Adaptive Wing (MAW) test program's manual flight control system, emphasis has been shifted to flight testing of MAW automatic control modes. These encompass (1) cruise camber control, (2) maneuver camber control, (3) maneuver load control, and (4) maneuver enhancement and load alleviation control. The aircraft is currently cleared to a 2.5-g maneuvering limit due to generally higher variable-incidence wing pivot loads than had been anticipated, especially at the higher wing-camber settings. Buffet is noted to be somewhat higher than expected at the higher camber settings.
Dynamic Adaption of Vascular Morphology
Okkels, Fridolin; Jacobsen, Jens Christian Brings
2012-01-01
The structure of vascular networks adapts continuously to meet changes in demand of the surrounding tissue. Most of the known vascular adaptation mechanisms are based on local reactions to local stimuli such as pressure and flow, which in turn reflects influence from the surrounding tissue. Here we present a simple two-dimensional model in which, as an alternative approach, the tissue is modeled as a porous medium with intervening sharply defined flow channels. Based on simple, physiologically realistic assumptions, flow-channel structure adapts so as to reach a configuration in which all parts of the tissue are supplied. A set of model parameters uniquely determine the model dynamics, and we have identified the region of the best-performing model parameters (a global optimum). This region is surrounded in parameter space by less optimal model parameter values, and this separation is characterized by steep gradients in the related fitness landscape. Hence it appears that the optimal set of parameters tends to localize close to critical transition zones. Consequently, while the optimal solution is stable for modest parameter perturbations, larger perturbations may cause a profound and permanent shift in systems characteristics. We suggest that the system is driven toward a critical state as a consequence of the ongoing parameter optimization, mimicking an evolutionary pressure on the system. PMID:23060814
Elements of Dynamic Programming,
1981-02-02
m §15. Stochastic Tasks of Dynamic Programming ....... 270 § 16 . Example Stochastic Task of the Dynamic Programming: the Combined Fire Control and of...simple ar3....wtu xad algebraic operations. Howevar, for the conscicus imas.#uLa.ng of material is required the known stress/voltage of -cxo~.,az.. )I...figuring in them d-3sig.aaticns is in detail dXi.... La cha text. For the understanding of two laer/A.a.*. rarlgapas (§§ 15 and 16 ) is required the
Adaptive EAGLE dynamic solution adaptation and grid quality enhancement
NASA Technical Reports Server (NTRS)
Luong, Phu Vinh; Thompson, J. F.; Gatlin, B.; Mastin, C. W.; Kim, H. J.
1992-01-01
In the effort described here, the elliptic grid generation procedure in the EAGLE grid code was separated from the main code into a subroutine, and a new subroutine which evaluates several grid quality measures at each grid point was added. The elliptic grid routine can now be called, either by a computational fluid dynamics (CFD) code to generate a new adaptive grid based on flow variables and quality measures through multiple adaptation, or by the EAGLE main code to generate a grid based on quality measure variables through static adaptation. Arrays of flow variables can be read into the EAGLE grid code for use in static adaptation as well. These major changes in the EAGLE adaptive grid system make it easier to convert any CFD code that operates on a block-structured grid (or single-block grid) into a multiple adaptive code.
Dynamic optimization and adaptive controller design
NASA Astrophysics Data System (ADS)
Inamdar, S. R.
2010-10-01
In this work I present a new type of controller which is an adaptive tracking controller which employs dynamic optimization for optimizing current value of controller action for the temperature control of nonisothermal continuously stirred tank reactor (CSTR). We begin with a two-state model of nonisothermal CSTR which are mass and heat balance equations and then add cooling system dynamics to eliminate input multiplicity. The initial design value is obtained using local stability of steady states where approach temperature for cooling action is specified as a steady state and a design specification. Later we make a correction in the dynamics where material balance is manipulated to use feed concentration as a system parameter as an adaptive control measure in order to avoid actuator saturation for the main control loop. The analysis leading to design of dynamic optimization based parameter adaptive controller is presented. The important component of this mathematical framework is reference trajectory generation to form an adaptive control measure.
Multithreaded Model for Dynamic Load Balancing Parallel Adaptive PDE Computations
NASA Technical Reports Server (NTRS)
Chrisochoides, Nikos
1995-01-01
We present a multithreaded model for the dynamic load-balancing of numerical, adaptive computations required for the solution of Partial Differential Equations (PDE's) on multiprocessors. Multithreading is used as a means of exploring concurrency in the processor level in order to tolerate synchronization costs inherent to traditional (non-threaded) parallel adaptive PDE solvers. Our preliminary analysis for parallel, adaptive PDE solvers indicates that multithreading can be used an a mechanism to mask overheads required for the dynamic balancing of processor workloads with computations required for the actual numerical solution of the PDE's. Also, multithreading can simplify the implementation of dynamic load-balancing algorithms, a task that is very difficult for traditional data parallel adaptive PDE computations. Unfortunately, multithreading does not always simplify program complexity, often makes code re-usability not an easy task, and increases software complexity.
Wittler, R.; McBain, S.; Stalnaker, C.; Bizier, P.; DeBarry, P.
2003-01-01
Two adaptive management programs, the Glen Canyon Dam Adaptive Management Program (GCDAMP) and the Trinity River Restoration Program (TRRP) are examined. In both cases, the focus is on managing the aquatic and riparian systems downstream of a large dam and water supply project. The status of the two programs, lessons learned by the program managers and the Adaptive Environmental Assessment and Management (AEAM) evolution of the TRRP are discussed. The Trinity River illustrates some of the scientific uncertainities that a program faces and the ways the program evolves from concept through implementation.
Earth and ocean dynamics program
NASA Technical Reports Server (NTRS)
Vonbun, F. O.
1976-01-01
The objectives and requirements of the Earth and Ocean Dynamics Programs are outlined along with major goals and experiments. Spaceborne as well as ground systems needed to accomplish program goals are listed and discussed along with program accomplishments.
Adaptive control of force microscope cantilever dynamics
NASA Astrophysics Data System (ADS)
Jensen, S. E.; Dougherty, W. M.; Garbini, J. L.; Sidles, J. A.
2007-09-01
Magnetic resonance force microscopy (MRFM) and other emerging scanning probe microscopies entail the detection of attonewton-scale forces. Requisite force sensitivities are achieved through the use of soft force microscope cantilevers as high resonant-Q micromechanical oscillators. In practice, the dynamics of these oscillators are greatly improved by the application of force feedback control computed in real time by a digital signal processor (DSP). Improvements include increased sensitive bandwidth, reduced oscillator ring up/down time, and reduced cantilever thermal vibration amplitude. However, when the cantilever tip and the sample are in close proximity, electrostatic and Casimir tip-sample force gradients can significantly alter the cantilever resonance frequency, foiling fixed-gain narrow-band control schemes. We report an improved, adaptive control algorithm that uses a Hilbert transform technique to continuously measure the vibration frequency of the thermally-excited cantilever and seamlessly adjust the DSP program coefficients. The closed-loop vibration amplitude is typically 0.05 nm. This adaptive algorithm enables narrow-band formally-optimal control over a wide range of resonance frequencies, and preserves the thermally-limited signal to noise ratio (SNR).
An Adaptive Superintendent Induction Program
ERIC Educational Resources Information Center
Brandon, Jim; Donlevy, Kent; Hanna, Paulette; Gereluk, Dianne; Patterson, Peggy; Rhyason, Kath
2014-01-01
This study examined a recently established induction program for new superintendents in the Canadian province of Alberta over a three-year period. In keeping with principles of design-based research data were collected from a variety of sources from the 26 new superintendents and their 25 mentors to assess and adjust programming through three…
ERIC Educational Resources Information Center
Shih, Ching-Hsiang; Shih, Ching-Tien; Wu, Hsiao-Ling
2010-01-01
The latest research adopted software technology to redesign the mouse driver, and turned a mouse into a useful pointing assistive device for people with multiple disabilities who cannot easily or possibly use a standard mouse, to improve their pointing performance through a new operation method, Extended Dynamic Pointing Assistive Program (EDPAP),…
Adaptive Networks Foundations: Modeling, Dynamics, and Applications
2013-02-13
22-Mar. 2, 2012. • Shaw, L.B., Long, Y., and Gross, T. Simultaneous spread of infection and information in adaptive networks. Casablanca ...International Workshop on Mathematical Biology, Casablanca , Morocco, Jun. 20-24, 2011. • Tunc, I. and Shaw, L.B. Dynamics of infection spreading in adaptive...Defense The number of undergraduates funded by your agreement who graduated during this period and will receive scholarships or fellowships for further
Syntactic adaptability of programming languages
Gusev, V.V.
1994-11-01
Development of programming languages has to contend with a variety of conflicting criteria. Moreover, as in any other creative field, it is not always possible to arrive at a clear formulation of these criteria. Nevertheless, one of the main criteria is problem orientation, be it numerical algorithms, database management, simulation of hydraulic systems, or other applications. Idealizing, we can say that the programming language is based on a model of the application domain. This model may vary in its scope, covering some aspects of the application domain and ignoring others. Thus, for one application domain we may have a whole spectrum of models and correspondingly a whole spectrum of languages. Some are special-purpose languages designed for a specific class of problems, others are more general. Both special-purpose and general-purpose languages have definite advantages and find their own clientele, who are willing to ignore their shortcomings.
Automated adaptive inference of phenomenological dynamical models
NASA Astrophysics Data System (ADS)
Daniels, Bryan C.; Nemenman, Ilya
2015-08-01
Dynamics of complex systems is often driven by large and intricate networks of microscopic interactions, whose sheer size obfuscates understanding. With limited experimental data, many parameters of such dynamics are unknown, and thus detailed, mechanistic models risk overfitting and making faulty predictions. At the other extreme, simple ad hoc models often miss defining features of the underlying systems. Here we develop an approach that instead constructs phenomenological, coarse-grained models of network dynamics that automatically adapt their complexity to the available data. Such adaptive models produce accurate predictions even when microscopic details are unknown. The approach is computationally tractable, even for a relatively large number of dynamical variables. Using simulated data, it correctly infers the phase space structure for planetary motion, avoids overfitting in a biological signalling system and produces accurate predictions for yeast glycolysis with tens of data points and over half of the interacting species unobserved.
Automated adaptive inference of phenomenological dynamical models
Daniels, Bryan C.; Nemenman, Ilya
2015-01-01
Dynamics of complex systems is often driven by large and intricate networks of microscopic interactions, whose sheer size obfuscates understanding. With limited experimental data, many parameters of such dynamics are unknown, and thus detailed, mechanistic models risk overfitting and making faulty predictions. At the other extreme, simple ad hoc models often miss defining features of the underlying systems. Here we develop an approach that instead constructs phenomenological, coarse-grained models of network dynamics that automatically adapt their complexity to the available data. Such adaptive models produce accurate predictions even when microscopic details are unknown. The approach is computationally tractable, even for a relatively large number of dynamical variables. Using simulated data, it correctly infers the phase space structure for planetary motion, avoids overfitting in a biological signalling system and produces accurate predictions for yeast glycolysis with tens of data points and over half of the interacting species unobserved. PMID:26293508
Adaptive optics program at TMT
NASA Astrophysics Data System (ADS)
Boyer, C.; Adkins, Sean; Andersen, David R.; Atwood, Jenny; Bo, Yong; Byrnes, Peter; Caputa, Kris; Cavaco, Jeff; Ellerbroek, Brent; Gilles, Luc; Gregory, James; Herriot, Glen; Hickson, Paul; Ljusic, Zoran; Manter, Darren; Marois, Christian; Otárola, Angel; Pagès, Hubert; Schoeck, Matthias; Sinquin, Jean-Christophe; Smith, Malcolm; Spano, Paolo; Szeto, Kei; Tang, Jinlong; Travouillon, Tony; Véran, Jean-Pierre; Wang, Lianqi; Wei, Kai
2014-07-01
The TMT first light Adaptive Optics (AO) facility consists of the Narrow Field Infra-Red AO System (NFIRAOS) and the associated Laser Guide Star Facility (LGSF). NFIRAOS is a 60 × 60 laser guide star (LGS) multi-conjugate AO (MCAO) system, which provides uniform, diffraction-limited performance in the J, H, and K bands over 17-30 arc sec diameter fields with 50 per cent sky coverage at the galactic pole, as required to support the TMT science cases. NFIRAOS includes two deformable mirrors, six laser guide star wavefront sensors, and three low-order, infrared, natural guide star wavefront sensors within each client instrument. The first light LGSF system includes six sodium lasers required to generate the NFIRAOS laser guide stars. In this paper, we will provide an update on the progress in designing, modeling and validating the TMT first light AO systems and their components over the last two years. This will include pre-final design and prototyping activities for NFIRAOS, preliminary design and prototyping activities for the LGSF, design and prototyping for the deformable mirrors, fabrication and tests for the visible detectors, benchmarking and comparison of different algorithms and processing architecture for the Real Time Controller (RTC) and development and tests of prototype candidate lasers. Comprehensive and detailed AO modeling is continuing to support the design and development of the first light AO facility. Main modeling topics studied during the last two years include further studies in the area of wavefront error budget, sky coverage, high precision astrometry for the galactic center and other observations, high contrast imaging with NFIRAOS and its first light instruments, Point Spread Function (PSF) reconstruction for LGS MCAO, LGS photon return and sophisticated low order mode temporal filtering.
Advanced solar dynamic technology program
NASA Technical Reports Server (NTRS)
Calogeras, James
1990-01-01
Viewgraphs and discussion on Advanced Solar Dynamic Technology Program are presented. Topics covered include: advanced solar dynamic technology program; advanced concentrators; advanced heat receivers; power conversion systems; dished all metal honeycomb sandwich panels; Stirling cavity heat pipe receiver; Brayton solar receiver; and thermal energy storage technology.
Dynamics of Adaptation in Spatially Heterogeneous Metapopulations
Papaïx, Julien; David, Olivier; Lannou, Christian; Monod, Hervé
2013-01-01
The selection pressure experienced by organisms often varies across the species range. It is hence crucial to characterise the link between environmental spatial heterogeneity and the adaptive dynamics of species or populations. We address this issue by studying the phenotypic evolution of a spatial metapopulation using an adaptive dynamics approach. The singular strategy is found to be the mean of the optimal phenotypes in each habitat with larger weights for habitats present in large and well connected patches. The presence of spatial clusters of habitats in the metapopulation is found to facilitate specialisation and to increase both the level of adaptation and the evolutionary speed of the population when dispersal is limited. By showing that spatial structures are crucial in determining the specialisation level and the evolutionary speed of a population, our results give insight into the influence of spatial heterogeneity on the niche breadth of species. PMID:23424618
Adaptive wavelet simulation of global ocean dynamics
NASA Astrophysics Data System (ADS)
Kevlahan, N. K.-R.; Dubos, T.; Aechtner, M.
2015-07-01
In order to easily enforce solid-wall boundary conditions in the presence of complex coastlines, we propose a new mass and energy conserving Brinkman penalization for the rotating shallow water equations. This penalization does not lead to higher wave speeds in the solid region. The error estimates for the penalization are derived analytically and verified numerically for linearized one dimensional equations. The penalization is implemented in a conservative dynamically adaptive wavelet method for the rotating shallow water equations on the sphere with bathymetry and coastline data from NOAA's ETOPO1 database. This code could form the dynamical core for a future global ocean model. The potential of the dynamically adaptive ocean model is illustrated by using it to simulate the 2004 Indonesian tsunami and wind-driven gyres.
Adaptation dynamics of the quasispecies model
NASA Astrophysics Data System (ADS)
Jain, Kavita
2009-02-01
We study the adaptation dynamics of an initially maladapted population evolving via the elementary processes of mutation and selection. The evolution occurs on rugged fitness landscapes which are defined on the multi-dimensional genotypic space and have many local peaks separated by low fitness valleys. We mainly focus on the Eigen's model that describes the deterministic dynamics of an infinite number of self-replicating molecules. In the stationary state, for small mutation rates such a population forms a {\\it quasispecies} which consists of the fittest genotype and its closely related mutants. The quasispecies dynamics on rugged fitness landscape follow a punctuated (or step-like) pattern in which a population jumps from a low fitness peak to a higher one, stays there for a considerable time before shifting the peak again and eventually reaches the global maximum of the fitness landscape. We calculate exactly several properties of this dynamical process within a simplified version of the quasispecies model.
Target tracking with dynamically adaptive correlation
NASA Astrophysics Data System (ADS)
Gaxiola, Leopoldo N.; Diaz-Ramirez, Victor H.; Tapia, Juan J.; García-Martínez, Pascuala
2016-04-01
A reliable algorithm for target tracking based on dynamically adaptive correlation filtering is presented. The algorithm is capable of tracking with high accuracy the location of a target in an input video sequence without using an offline training process. The target is selected at the beginning of the algorithm. Afterwards, a composite correlation filter optimized for distortion tolerant pattern recognition is designed to recognize the target in the next frame. The filter is dynamically adapted to each frame using information of current and past scene observations. Results obtained with the proposed algorithm in synthetic and real-life video sequences, are analyzed and compared with those obtained with recent state-of-the-art tracking algorithms in terms of objective metrics.
Adaptive synchronization and anticipatory dynamical systems
NASA Astrophysics Data System (ADS)
Yang, Ying-Jen; Chen, Chun-Chung; Lai, Pik-Yin; Chan, C. K.
2015-09-01
Many biological systems can sense periodical variations in a stimulus input and produce well-timed, anticipatory responses after the input is removed. Such systems show memory effects for retaining timing information in the stimulus and cannot be understood from traditional synchronization consideration of passive oscillatory systems. To understand this anticipatory phenomena, we consider oscillators built from excitable systems with the addition of an adaptive dynamics. With such systems, well-timed post-stimulus responses similar to those from experiments can be obtained. Furthermore, a well-known model of working memory is shown to possess similar anticipatory dynamics when the adaptive mechanism is identified with synaptic facilitation. The last finding suggests that this type of oscillator can be common in neuronal systems with plasticity.
Improvements to the adaptive maneuvering logic program
NASA Technical Reports Server (NTRS)
Burgin, George H.
1986-01-01
The Adaptive Maneuvering Logic (AML) computer program simulates close-in, one-on-one air-to-air combat between two fighter aircraft. Three important improvements are described. First, the previously available versions of AML were examined for their suitability as a baseline program. The selected program was then revised to eliminate some programming bugs which were uncovered over the years. A listing of this baseline program is included. Second, the equations governing the motion of the aircraft were completely revised. This resulted in a model with substantially higher fidelity than the original equations of motion provided. It also completely eliminated the over-the-top problem, which occurred in the older versions when the AML-driven aircraft attempted a vertical or near vertical loop. Third, the requirements for a versatile generic, yet realistic, aircraft model were studied and implemented in the program. The report contains detailed tables which make the generic aircraft to be either a modern, high performance aircraft, an older high performance aircraft, or a previous generation jet fighter.
Cardiac fluid dynamics anticipates heart adaptation.
Pedrizzetti, Gianni; Martiniello, Alfonso R; Bianchi, Valter; D'Onofrio, Antonio; Caso, Pio; Tonti, Giovanni
2015-01-21
Hemodynamic forces represent an epigenetic factor during heart development and are supposed to influence the pathology of the grown heart. Cardiac blood motion is characterized by a vortical dynamics, and it is common belief that the cardiac vortex has a role in disease progressions or regression. Here we provide a preliminary demonstration about the relevance of maladaptive intra-cardiac vortex dynamics in the geometrical adaptation of the dysfunctional heart. We employed an in vivo model of patients who present a stable normal heart function in virtue of the cardiac resynchronization therapy (CRT, bi-ventricular pace-maker) and who are expected to develop left ventricle remodeling if pace-maker was switched off. Intra-ventricular fluid dynamics is analyzed by echocardiography (Echo-PIV). Under normal conditions, the flow presents a longitudinal alignment of the intraventricular hemodynamic forces. When pacing is temporarily switched off, flow forces develop a misalignment hammering onto lateral walls, despite no other electro-mechanical change is noticed. Hemodynamic forces result to be the first event that evokes a physiological activity anticipating cardiac changes and could help in the prediction of longer term heart adaptations.
Emerging hierarchies in dynamically adapting webs
NASA Astrophysics Data System (ADS)
Katifori, Eleni; Graewer, Johannes; Magnasco, Marcelo; Modes, Carl
Transport networks play a key role across four realms of eukaryotic life: slime molds, fungi, plants, and animals. In addition to the developmental algorithms that build them, many also employ adaptive strategies to respond to stimuli, damage, and other environmental changes. We model these adapting network architectures using a generic dynamical system on weighted graphs and find in simulation that these networks ultimately develop a hierarchical organization of the final weighted architecture accompanied by the formation of a system-spanning backbone. We quantify the hierarchical organization of the networks by developing an algorithm that decomposes the architecture to multiple scales and analyzes how the organization in each scale relates to that of the scale above and below it. The methodologies developed in this work are applicable to a wide range of systems including the slime mold physarum polycephalum, human microvasculature, and force chains in granular media.
Software Acquisition Program Dynamics
2011-10-24
acquisition and development of software-reliant systems . Novak has more than 25 years of experience with real-time embedded software product development...Problem Poor acquisition program performance inhibits military performance by depriving the warfighter of critical systems to achieve mission...objectives • Delayed systems withhold needed capabilities • Wasted resources drain funding needed for new systems Acquisitions fail for both technical
Adaptive typography for dynamic mapping environments
NASA Astrophysics Data System (ADS)
Bardon, Didier
1991-08-01
When typography moves across a map, it passes over areas of different colors, densities, and textures. In such a dynamic environment, the aspect of typography must be constantly adapted to provide disernibility for every new background. Adaptive typography undergoes two adaptive operations: background control and contrast control. The background control prevents the features of the map (edges, lines, abrupt changes of densities) from destroying the integrity of the letterform. This is achieved by smoothing the features of the map in the area where a text label is displayed. The modified area is limited to the space covered by the characters of the label. Dispositions are taken to insure that the smoothing operation does not introduce any new visual noise. The contrast control assures that there are sufficient lightness differences between the typography and its ever-changing background. For every new situation, background color and foreground color are compared and the foreground color lightness is adjusted according to a chosen contrast value. Criteria and methods of choosing the appropriate contrast value are presented as well as the experiments that led to them.
Ultra-Low Power Dynamic Knob in Adaptive Compressed Sensing Towards Biosignal Dynamics.
Wang, Aosen; Lin, Feng; Jin, Zhanpeng; Xu, Wenyao
2016-06-01
Compressed sensing (CS) is an emerging sampling paradigm in data acquisition. Its integrated analog-to-information structure can perform simultaneous data sensing and compression with low-complexity hardware. To date, most of the existing CS implementations have a fixed architectural setup, which lacks flexibility and adaptivity for efficient dynamic data sensing. In this paper, we propose a dynamic knob (DK) design to effectively reconfigure the CS architecture by recognizing the biosignals. Specifically, the dynamic knob design is a template-based structure that comprises a supervised learning module and a look-up table module. We model the DK performance in a closed analytic form and optimize the design via a dynamic programming formulation. We present the design on a 130 nm process, with a 0.058 mm (2) fingerprint and a 187.88 nJ/event energy-consumption. Furthermore, we benchmark the design performance using a publicly available dataset. Given the energy constraint in wireless sensing, the adaptive CS architecture can consistently improve the signal reconstruction quality by more than 70%, compared with the traditional CS. The experimental results indicate that the ultra-low power dynamic knob can provide an effective adaptivity and improve the signal quality in compressed sensing towards biosignal dynamics.
Constitutional dynamic chemistry: bridge from supramolecular chemistry to adaptive chemistry.
Lehn, Jean-Marie
2012-01-01
Supramolecular chemistry aims at implementing highly complex chemical systems from molecular components held together by non-covalent intermolecular forces and effecting molecular recognition, catalysis and transport processes. A further step consists in the investigation of chemical systems undergoing self-organization, i.e. systems capable of spontaneously generating well-defined functional supramolecular architectures by self-assembly from their components, thus behaving as programmed chemical systems. Supramolecular chemistry is intrinsically a dynamic chemistry in view of the lability of the interactions connecting the molecular components of a supramolecular entity and the resulting ability of supramolecular species to exchange their constituents. The same holds for molecular chemistry when the molecular entity contains covalent bonds that may form and break reversibility, so as to allow a continuous change in constitution by reorganization and exchange of building blocks. These features define a Constitutional Dynamic Chemistry (CDC) on both the molecular and supramolecular levels.CDC introduces a paradigm shift with respect to constitutionally static chemistry. The latter relies on design for the generation of a target entity, whereas CDC takes advantage of dynamic diversity to allow variation and selection. The implementation of selection in chemistry introduces a fundamental change in outlook. Whereas self-organization by design strives to achieve full control over the output molecular or supramolecular entity by explicit programming, self-organization with selection operates on dynamic constitutional diversity in response to either internal or external factors to achieve adaptation.The merging of the features: -information and programmability, -dynamics and reversibility, -constitution and structural diversity, points to the emergence of adaptive and evolutive chemistry, towards a chemistry of complex matter.
Middleware for dynamic adaptation of component applications.
Norris, B.; Bhowmick, S.; Kaushik, D.; McInnes, L. C.
2007-01-01
Component- and service-based software engineering approaches have been gaining popularity in high-performance scientific computing, facilitating the creation and management of large multidisciplinary, multideveloper applications, and providing opportunities for improved performance and numerical accuracy. These software engineering approaches enable the development of middleware infrastructure for computational quality of service (CQoS), which provides performance optimizations through dynamic algorithm selection and configuration in a mostly automated fashion. The factors that affect performance are closely tied to a component's parallel implementation, its management of parallel communication and memory, the algorithms executed, the algorithmic parameters employed, and other operational characteristics. We present the design of a component middleware CQoS architecture for automated composition and adaptation of high-performance component- or service-based applications. We describe its initial implementation and corresponding experimental results for parallel simulations involving time-dependent nonlinear partial differential equations.
Dynamical genetic programming in XCSF.
Preen, Richard J; Bull, Larry
2013-01-01
A number of representation schemes have been presented for use within learning classifier systems, ranging from binary encodings to artificial neural networks. This paper presents results from an investigation into using a temporally dynamic symbolic representation within the XCSF learning classifier system. In particular, dynamical arithmetic networks are used to represent the traditional condition-action production system rules to solve continuous-valued reinforcement learning problems and to perform symbolic regression, finding competitive performance with traditional genetic programming on a number of composite polynomial tasks. In addition, the network outputs are later repeatedly sampled at varying temporal intervals to perform multistep-ahead predictions of a financial time series.
The CHARA Array Adaptive Optics Program
NASA Astrophysics Data System (ADS)
Ten Brummelaar, Theo; Che, Xiao; McAlister, Harold A.; Ireland, Michael; Monnier, John D.; Mourard, Denis; Ridgway, Stephen T.; sturmann, judit; Sturmann, Laszlo; Turner, Nils H.; Tuthill, Peter
2016-01-01
The CHARA array is an optical/near infrared interferometer consisting of six 1-meter diameter telescopes the longest baseline of which is 331 meters. With sub-millisecond angular resolution, the CHARA array is able to spatially resolve nearby stellar systems to reveal the detailed structures. To improve the sensitivity and scientific throughput, the CHARA array was funded by NSF-ATI in 2011, and by NSF-MRI in 2015, for an upgrade of adaptive optics (AO) systems to all six telescopes. The initial grant covers Phase I of the adaptive optics system, which includes an on-telescope Wavefront Sensor and non-common-path (NCP) error correction. The WFS use a fairly standard Shack-Hartman design and will initially close the tip tilt servo and log wavefront errors for use in data reduction and calibration. The second grant provides the funding for deformable mirrors for each telescope which will be used closed loop to remove atmospheric aberrations from the beams. There are then over twenty reflections after the WFS at the telescopes that bring the light several hundred meters into the beam combining laboratory. Some of these, including the delay line and beam reducing optics, are powered elements, and some of them, in particular the delay lines and telescope Coude optics, are continually moving. This means that the NCP problems in an interferometer are much greater than those found in more standard telescope systems. A second, slow AO system is required in the laboratory to correct for these NCP errors. We will breifly describe the AO system, and it's current status, as well as discuss the new science enabled by the system with a focus on our YSO program.
Adaptive dynamics of extortion and compliance.
Hilbe, Christian; Nowak, Martin A; Traulsen, Arne
2013-01-01
Direct reciprocity is a mechanism for the evolution of cooperation. For the iterated prisoner's dilemma, a new class of strategies has recently been described, the so-called zero-determinant strategies. Using such a strategy, a player can unilaterally enforce a linear relationship between his own payoff and the co-player's payoff. In particular the player may act in such a way that it becomes optimal for the co-player to cooperate unconditionally. In this way, a player can manipulate and extort his co-player, thereby ensuring that the own payoff never falls below the co-player's payoff. However, using a compliant strategy instead, a player can also ensure that his own payoff never exceeds the co-player's payoff. Here, we use adaptive dynamics to study when evolution leads to extortion and when it leads to compliance. We find a remarkable cyclic dynamics: in sufficiently large populations, extortioners play a transient role, helping the population to move from selfish strategies to compliance. Compliant strategies, however, can be subverted by altruists, which in turn give rise to selfish strategies. Whether cooperative strategies are favored in the long run critically depends on the size of the population; we show that cooperation is most abundant in large populations, in which case average payoffs approach the social optimum. Our results are not restricted to the case of the prisoners dilemma, but can be extended to other social dilemmas, such as the snowdrift game. Iterated social dilemmas in large populations do not lead to the evolution of strategies that aim to dominate their co-player. Instead, generosity succeeds.
Designing and Implementing Effective Adapted Physical Education Programs
ERIC Educational Resources Information Center
Kelly, Luke E.
2011-01-01
"Designing and Implementing Effective Adapted Physical Education Programs" was written to assist adapted and general physical educators who are dedicated to ensuring that the physical and motor needs of all their students are addressed in physical education. While it is anticipated that adapted physical educators, where available, will typically…
Examining adaptations of evidence-based programs in natural contexts.
Moore, Julia E; Bumbarger, Brian K; Cooper, Brittany Rhoades
2013-06-01
When evidence-based programs (EBPs) are scaled up in natural, or non-research, settings, adaptations are commonly made. Given the fidelity-versus-adaptation debate, theoretical rationales have been provided for the pros and cons of adaptations. Yet the basis of this debate is theoretical; thus, empirical evidence is needed to understand the types of adaptations made in natural settings. In the present study, we introduce a taxonomy for understanding adaptations. This taxonomy addresses several aspects of adaptations made to programs including the fit (philosophical or logistical), timing (proactive or reactive), and valence, or the degree to which the adaptations align with the program's goals and theory, (positive, negative, or neutral). Self-reported qualitative data from communities delivering one of ten state-funded EBPs were coded based on the taxonomy constructs; additionally, quantitative data were used to examine the types and reasons for making adaptations under natural conditions. Forty-four percent of respondents reported making adaptations. Adaptations to the procedures, dosage, and content were cited most often. Lack of time, limited resources, and difficulty retaining participants were listed as the most common reasons for making adaptations. Most adaptations were made reactively, as a result of issues of logistical fit, and were not aligned with, or deviated from, the program's goals and theory.
Conservation program participation and adaptive rangeland decision-making
Technology Transfer Automated Retrieval System (TEKTRAN)
This paper analyzes rancher participation in conservation programs in the context of a social-ecological framework for adaptive rangeland management. We argue that conservation programs are best understood as one of many strategies of adaptively managing rangelands in ways that sustain livelihoods a...
Fluid dynamics computer programs for NERVA turbopump
NASA Technical Reports Server (NTRS)
Brunner, J. J.
1972-01-01
During the design of the NERVA turbopump, numerous computer programs were developed for the analyses of fluid dynamic problems within the machine. Program descriptions, example cases, users instructions, and listings for the majority of these programs are presented.
Microcomputer Network for Computerized Adaptive Testing (CAT): Program Listing.
ERIC Educational Resources Information Center
Quan, Baldwin; And Others
This program listing is a supplement to the Microcomputer Network for Computerized Adaptive Testing (CAT). The driver textfile program allows access to major subprograms of the CAT project. The test administration textfile program gives examinees a prescribed set of subtests. The parameter management textfile program establishes a file containing…
A Dynamic Program Assessment Framework for Learning Communities
ERIC Educational Resources Information Center
Kahn, Gabrielle; Calienes, Christian M.; Thompson, Tara A.
2016-01-01
This research builds upon Malnarich, Pettitt, and Mino's (2014) investigation of students' reflections on their learning community (LC) experiences. Adapting their Peer-to-Peer Reflection Protocol for use at Kingsborough Community College, CUNY, we present a framework for dynamic LC program assessment. To obtain feedback about theory-practice…
Neural network with dynamically adaptable neurons
NASA Technical Reports Server (NTRS)
Tawel, Raoul (Inventor)
1994-01-01
This invention is an adaptive neuron for use in neural network processors. The adaptive neuron participates in the supervised learning phase of operation on a co-equal basis with the synapse matrix elements by adaptively changing its gain in a similar manner to the change of weights in the synapse IO elements. In this manner, training time is decreased by as much as three orders of magnitude.
Reinschmidt, Kerstin M; Teufel-Shone, Nicolette I; Bradford, Gail; Drummond, Rebecca L; Torres, Emma; Redondo, Floribella; Elenes, Jo Jean; Sanders, Alicia; Gastelum, Sylvia; Moore-Monroy, Martha; Barajas, Salvador; Fernandez, Lourdes; Alvidrez, Rosy; de Zapien, Jill Guernsey; Staten, Lisa K
2010-04-01
Diabetes health disparities among Hispanic populations have been countered with federally funded health promotion and disease prevention programs. Dissemination has focused on program adaptation to local cultural contexts for greater acceptability and sustainability. Taking a broader approach and drawing on our experience in Mexican American communities at the U.S.-Mexico Border, we demonstrate how interventions are adapted at the intersection of multiple cultural contexts: the populations targeted, the community- and university-based entities designing and implementing interventions, and the field team delivering the materials. Program adaptation involves negotiations between representatives of all contexts and is imperative in promoting local ownership and program sustainability.
Programming smooth muscle plasticity with chromatin dynamics.
McDonald, Oliver G; Owens, Gary K
2007-05-25
Smooth muscle cells (SMCs) possess remarkable phenotypic plasticity that allows rapid adaptation to fluctuating environmental cues. For example, vascular SMCs undergo profound changes in their phenotype during neointimal formation in response to vessel injury or within atherosclerotic plaques. Recent studies have shown that interaction of serum response factor (SRF) and its numerous accessory cofactors with CArG box DNA sequences within promoter chromatin of SMC genes is a nexus for integrating signals that influence SMC differentiation in development and disease. During development, SMC-restricted sets of posttranslational histone modifications are acquired within the CArG box chromatin of SMC genes. These modifications in turn control the chromatin-binding properties of SRF. The histone modifications appear to encode a SMC-specific epigenetic program that is used by extracellular cues to influence SMC differentiation, by regulating binding of SRF and its partners to the chromatin template. Thus, SMC differentiation is dynamically regulated by the interplay between SRF accessory cofactors, the SRF-CArG interaction, and the underlying histone modification program. As such, the inherent plasticity of the SMC lineage offers unique glimpses into how cellular differentiation is dynamically controlled at the level of chromatin within the context of changing microenvironments. Further elucidation of how chromatin regulates SMC differentiation will undoubtedly yield valuable insights into both normal developmental processes and the pathogenesis of several vascular diseases that display detrimental SMC phenotypic behavior.
Recruitment dynamics in adaptive social networks
NASA Astrophysics Data System (ADS)
Shkarayev, Maxim S.; Schwartz, Ira B.; Shaw, Leah B.
2013-06-01
We model recruitment in adaptive social networks in the presence of birth and death processes. Recruitment is characterized by nodes changing their status to that of the recruiting class as a result of contact with recruiting nodes. Only a susceptible subset of nodes can be recruited. The recruiting individuals may adapt their connections in order to improve recruitment capabilities, thus changing the network structure adaptively. We derive a mean-field theory to predict the dependence of the growth threshold of the recruiting class on the adaptation parameter. Furthermore, we investigate the effect of adaptation on the recruitment level, as well as on network topology. The theoretical predictions are compared with direct simulations of the full system. We identify two parameter regimes with qualitatively different bifurcation diagrams depending on whether nodes become susceptible frequently (multiple times in their lifetime) or rarely (much less than once per lifetime).
Adaptation Planning for the National Estuary Program
This document is a resource for coastal communities to start planning to adapt to climate change. It describes elements, such as vulnerability assessments and stakeholder outreach, and provides examples as well as suggestions for additional resources.
A Pilot Program in Adapted Physical Education: Hillsborough High School.
ERIC Educational Resources Information Center
Thompson, Vince
The instructor of an adapted physical education program describes his experiences and suggests guidelines for implementing other programs. Reviewed are such aspects as program orientation, class procedures, identification of student participants, and grading procedures. Objectives, lesson plans and evaluations are presented for the following units…
Lessons Learned from the Everglades Collaborative Adaptive Management Program
Recent technical papers explore whether adaptive management (AM) is useful for environmental management and restoration efforts and discuss the many challenges to overcome for successful implementation, especially for large-scale restoration programs (McLain and Lee 1996; Levine ...
Everglades Collaborative Adaptive Management Program Progress
When the Comprehensive Everglades Restoration Plan (CERP) was authorized in 2000, adaptive management (AM) was recognized as a necessary tool to address uncertainty in achieving the broad goals and objectives for restoring a highly managed system. The Everglades covers18,000 squ...
Revisiting approximate dynamic programming and its convergence.
Heydari, Ali
2014-12-01
Value iteration-based approximate/adaptive dynamic programming (ADP) as an approximate solution to infinite-horizon optimal control problems with deterministic dynamics and continuous state and action spaces is investigated. The learning iterations are decomposed into an outer loop and an inner loop. A relatively simple proof for the convergence of the outer-loop iterations to the optimal solution is provided using a novel idea with some new features. It presents an analogy between the value function during the iterations and the value function of a fixed-final-time optimal control problem. The inner loop is utilized to avoid the need for solving a set of nonlinear equations or a nonlinear optimization problem numerically, at each iteration of ADP for the policy update. Sufficient conditions for the uniqueness of the solution to the policy update equation and for the convergence of the inner-loop iterations to the solution are obtained. Afterwards, the results are formed as a learning algorithm for training a neurocontroller or creating a look-up table to be used for optimal control of nonlinear systems with different initial conditions. Finally, some of the features of the investigated method are numerically analyzed.
Dynamics of adaptive agents with asymmetric information
NASA Astrophysics Data System (ADS)
DeMartino, Andrea; Galla, Tobias
2005-08-01
We apply path integral techniques to study the dynamics of agent-based models with asymmetric information structures. In particular, we devise a batch version of a model proposed originally by Berg et al (2001 Quantitative Finance 1 203), and convert the coupled multi-agent processes into an effective-agent problem from which the dynamical order parameters in ergodic regimes can be derived self-consistently together with the corresponding phase structure. Our dynamical study complements and extends the available static theory. Results are confirmed by numerical simulations.
Dynamics of adaptive structures: Design through simulations
NASA Technical Reports Server (NTRS)
Park, K. C.; Alexander, S.
1993-01-01
The use of a helical bi-morph actuator/sensor concept by mimicking the change of helical waveform in bacterial flagella is perhaps the first application of bacterial motions (living species) to longitudinal deployment of space structures. However, no dynamical considerations were analyzed to explain the waveform change mechanisms. The objective is to review various deployment concepts from the dynamics point of view and introduce the dynamical considerations from the outset as part of design considerations. Specifically, the impact of the incorporation of the combined static mechanisms and dynamic design considerations on the deployment performance during the reconfiguration stage is studied in terms of improved controllability, maneuvering duration, and joint singularity index. It is shown that intermediate configurations during articulations play an important role for improved joint mechanisms design and overall structural deployability.
Modifications to the Flexible Spacecraft Dynamics Program
NASA Technical Reports Server (NTRS)
1980-01-01
Modifications to existing subroutines are briefly described and a detailed description of new subroutines is given. The capability to simulate the Dynamics Explorer-B control system new developed and the formulation for this addition is given. The program variables in new labelled COMMON blocks are described in detail and the modified input and output for the d Flexible Spacecraft Dynamics Program is described.
Boundary detection via dynamic programming
NASA Astrophysics Data System (ADS)
Udupa, Jayaram K.; Samarasekera, Supun; Barrett, William A.
1992-09-01
This paper reports a new method for detecting optimal boundaries in multidimensional scene data via dynamic programming (DP). In its current form the algorithm detects 2-D contours on slices and differs from other reported DP-based algorithms in an essential way in that it allows freedom in 2-D for finding optimal contour paths (as opposed to a single degree of freedom in the published methods). The method is being successfully used in segmenting object boundaries in a variety of medical applications including orbital volume from CT images (for craniofacial surgical planning), segmenting bone in MR images for kinematic analysis of the joints of the foot, segmenting the surface of the brain from the inner surface of the cranial vault, segmenting pituitary gland tumor for following the effect of a drug on the tumor, segmenting the boundaries of the heart in MR images, and segmenting the olfactory bulb for verifying hypotheses related to the size of this bulb in certain disease states.
Teaching Adaptability of Object-Oriented Programming Language Curriculum
ERIC Educational Resources Information Center
Zhu, Xiao-dong
2012-01-01
The evolution of object-oriented programming languages includes update of their own versions, update of development environments, and reform of new languages upon old languages. In this paper, the evolution analysis of object-oriented programming languages is presented in term of the characters and development. The notion of adaptive teaching upon…
The Evolution of a Prison Adaptive-Health Program.
ERIC Educational Resources Information Center
Thomas, Robert G.; Thomas, R. Murray
1988-01-01
Describes an adaptive-health program created by officials at the California Men's Colony in San Luis Obispo for inmates who suffer physical or psychological disabilities. Discusses program goals, admission requirements, learning activities, techniques for motivating participants, evaluation methods, and staffing. (JOW)
Applications of analysis of dynamic adaptations in parameter trajectories
van Riel, Natal A. W.; Tiemann, Christian A.; Vanlier, Joep; Hilbers, Peter A. J.
2013-01-01
Metabolic profiling in combination with pathway-based analyses and computational modelling are becoming increasingly important in clinical and preclinical research. Modelling multi-factorial, progressive diseases requires the integration of molecular data at the metabolome, proteome and transcriptome levels. Also the dynamic interaction of organs and tissues needs to be considered. The processes involved cover time scales that are several orders of magnitude different. We report applications of a computational approach to bridge the scales and different levels of biological detail. Analysis of dynamic adaptations in parameter trajectories (ADAPTs) aims to investigate phenotype transitions during disease development and after a therapeutic intervention. ADAPT is based on a time-dependent evolution of model parameters to describe the dynamics of metabolic adaptations. The progression of metabolic adaptations is predicted by identifying necessary dynamic changes in the model parameters to describe the transition between experimental data obtained during different stages. To get a better understanding of the concept, the ADAPT approach is illustrated in a theoretical study. Its application in research on progressive changes in lipoprotein metabolism is also discussed. PMID:23853705
Analog forecasting with dynamics-adapted kernels
NASA Astrophysics Data System (ADS)
Zhao, Zhizhen; Giannakis, Dimitrios
2016-09-01
Analog forecasting is a nonparametric technique introduced by Lorenz in 1969 which predicts the evolution of states of a dynamical system (or observables defined on the states) by following the evolution of the sample in a historical record of observations which most closely resembles the current initial data. Here, we introduce a suite of forecasting methods which improve traditional analog forecasting by combining ideas from kernel methods developed in harmonic analysis and machine learning and state-space reconstruction for dynamical systems. A key ingredient of our approach is to replace single-analog forecasting with weighted ensembles of analogs constructed using local similarity kernels. The kernels used here employ a number of dynamics-dependent features designed to improve forecast skill, including Takens’ delay-coordinate maps (to recover information in the initial data lost through partial observations) and a directional dependence on the dynamical vector field generating the data. Mathematically, our approach is closely related to kernel methods for out-of-sample extension of functions, and we discuss alternative strategies based on the Nyström method and the multiscale Laplacian pyramids technique. We illustrate these techniques in applications to forecasting in a low-order deterministic model for atmospheric dynamics with chaotic metastability, and interannual-scale forecasting in the North Pacific sector of a comprehensive climate model. We find that forecasts based on kernel-weighted ensembles have significantly higher skill than the conventional approach following a single analog.
Adaptive Programming Improves Outcomes in Drug Court: An Experimental Trial
Marlowe, Douglas B.; Festinger, David S.; Dugosh, Karen L.; Benasutti, Kathleen M.; Fox, Gloria; Croft, Jason R.
2011-01-01
Prior studies in Drug Courts reported improved outcomes when participants were matched to schedules of judicial status hearings based on their criminological risk level. The current experiment determined whether incremental efficacy could be gained by periodically adjusting the schedule of status hearings and clinical case-management sessions in response to participants’ ensuing performance in the program. The adjustments were made pursuant to a priori criteria specified in an adaptive algorithm. Results confirmed that participants in the full adaptive condition (n = 62) were more than twice as likely as those assigned to baseline-matching only (n = 63) to be drug-abstinent during the first 18 weeks of the program; however, graduation rates and the average time to case resolution were not significantly different. The positive effects of the adaptive program appear to have stemmed from holding noncompliant participants more accountable for meeting their attendance obligations in the program. Directions for future research and practice implications are discussed. PMID:22923854
Adaptive Programming Improves Outcomes in Drug Court: An Experimental Trial.
Marlowe, Douglas B; Festinger, David S; Dugosh, Karen L; Benasutti, Kathleen M; Fox, Gloria; Croft, Jason R
2012-04-01
Prior studies in Drug Courts reported improved outcomes when participants were matched to schedules of judicial status hearings based on their criminological risk level. The current experiment determined whether incremental efficacy could be gained by periodically adjusting the schedule of status hearings and clinical case-management sessions in response to participants' ensuing performance in the program. The adjustments were made pursuant to a priori criteria specified in an adaptive algorithm. Results confirmed that participants in the full adaptive condition (n = 62) were more than twice as likely as those assigned to baseline-matching only (n = 63) to be drug-abstinent during the first 18 weeks of the program; however, graduation rates and the average time to case resolution were not significantly different. The positive effects of the adaptive program appear to have stemmed from holding noncompliant participants more accountable for meeting their attendance obligations in the program. Directions for future research and practice implications are discussed.
Leadership: Enhancing Team Adaptability in Dynamic Settings
2008-04-01
regulatory processes (Karoly, 1993), team development ( Tuckman , 1965), and multilevel theory (Rousseau, 1985) to develop a normative theory of dynamic...De Meuse, K. P., & Futrell, D. (1990). Work teams: Applications and effectiveness. American Psychologist, 45, 120-133. Tuckman , B.W. (1965
ERIC Educational Resources Information Center
Reinschmidt, Kerstin M.; Teufel-Shone, Nicolette I.; Bradford, Gail; Drummond, Rebecca L.; Torres, Emma; Redondo, Floribella; Elenes, Jo Jean; Sanders, Alicia; Gastelum, Sylvia; Moore-Monroy, Martha; Barajas, Salvador; Fernandez, Lourdes; Alvidrez, Rosy; de Zapien, Jill Guernsey; Staten, Lisa K.
2010-01-01
Diabetes health disparities among Hispanic populations have been countered with federally funded health promotion and disease prevention programs. Dissemination has focused on program adaptation to local cultural contexts for greater acceptability and sustainability. Taking a broader approach and drawing on our experience in Mexican American…
Brain-wide neuronal dynamics during motor adaptation in zebrafish.
Ahrens, Misha B; Li, Jennifer M; Orger, Michael B; Robson, Drew N; Schier, Alexander F; Engert, Florian; Portugues, Ruben
2012-05-09
A fundamental question in neuroscience is how entire neural circuits generate behaviour and adapt it to changes in sensory feedback. Here we use two-photon calcium imaging to record the activity of large populations of neurons at the cellular level, throughout the brain of larval zebrafish expressing a genetically encoded calcium sensor, while the paralysed animals interact fictively with a virtual environment and rapidly adapt their motor output to changes in visual feedback. We decompose the network dynamics involved in adaptive locomotion into four types of neuronal response properties, and provide anatomical maps of the corresponding sites. A subset of these signals occurred during behavioural adjustments and are candidates for the functional elements that drive motor learning. Lesions to the inferior olive indicate a specific functional role for olivocerebellar circuitry in adaptive locomotion. This study enables the analysis of brain-wide dynamics at single-cell resolution during behaviour.
Brain-wide neuronal dynamics during motor adaptation in zebrafish
Ahrens, Misha B; Li, Jennifer M; Orger, Michael B; Robson, Drew N; Schier, Alexander F; Engert, Florian; Portugues, Ruben
2013-01-01
A fundamental question in neuroscience is how entire neural circuits generate behavior and adapt it to changes in sensory feedback. Here we use two-photon calcium imaging to record activity of large populations of neurons at the cellular level throughout the brain of larval zebrafish expressing a genetically-encoded calcium sensor, while the paralyzed animals interact fictively with a virtual environment and rapidly adapt their motor output to changes in visual feedback. We decompose the network dynamics involved in adaptive locomotion into four types of neural response properties, and provide anatomical maps of the corresponding sites. A subset of these signals occurred during behavioral adjustments and are candidates for the functional elements that drive motor learning. Lesions to the inferior olive indicate a specific functional role for olivocerebellar circuitry in adaptive locomotion. This study enables the analysis of brain-wide dynamics at single-cell resolution during behavior. PMID:22622571
Concurrency and Complexity in Verifying Dynamic Adaptation: A Case Study
2005-01-01
Concurrency and Complexity in Verifying Dynamic Adaptation: A Case Study ? Karun N. Biyani?? Sandeep S. Kulkarni? ? ? Department of Computer Science...lattice. References 1. Sandeep S. Kulkarni, Karun N. Biyani, and Umamaheswaran Arumugam. Compos- ing distributed fault-tolerance components. In...and Autonomic Computing. PhD thesis, Michigan State University, 2004. 7. Sandeep Kulkarni and Karun Biyani. Correctness of component-based adaptation
Improving Voluntary Environmental Management Programs: Facilitating Learning and Adaptation
NASA Astrophysics Data System (ADS)
Genskow, Kenneth D.; Wood, Danielle M.
2011-05-01
Environmental planners and managers face unique challenges understanding and documenting the effectiveness of programs that rely on voluntary actions by private landowners. Programs, such as those aimed at reducing nonpoint source pollution or improving habitat, intend to reach those goals by persuading landowners to adopt behaviors and management practices consistent with environmental restoration and protection. Our purpose with this paper is to identify barriers for improving voluntary environmental management programs and ways to overcome them. We first draw upon insights regarding data, learning, and adaptation from the adaptive management and performance management literatures, describing three key issues: overcoming information constraints, structural limitations, and organizational culture. Although these lessons are applicable to a variety of voluntary environmental management programs, we then present the issues in the context of on-going research for nonpoint source water quality pollution. We end the discussion by highlighting important elements for advancing voluntary program efforts.
Dynamical weights and enhanced synchronization in adaptive complex networks.
Zhou, Changsong; Kurths, Jürgen
2006-04-28
Dynamical organization of connection weights is studied in scale-free networks of chaotic oscillators, where the coupling strength of a node from its neighbors develops adaptively according to the local synchronization property between the node and its neighbors. We find that when complete synchronization is achieved, the coupling strength becomes weighted and correlated with the topology due to a hierarchical transition to synchronization in heterogeneous networks. Importantly, such an adaptive process enhances significantly the synchronizability of the networks, which could have meaningful implications in the manipulation of dynamical networks.
Enhancing Functional Performance using Sensorimotor Adaptability Training Programs
NASA Technical Reports Server (NTRS)
Bloomberg, J. J.; Mulavara, A. P.; Peters, B. T.; Brady, R.; Audas, C.; Ruttley, T. M.; Cohen, H. S.
2009-01-01
During the acute phase of adaptation to novel gravitational environments, sensorimotor disturbances have the potential to disrupt the ability of astronauts to perform functional tasks. The goal of this project is to develop a sensorimotor adaptability (SA) training program designed to facilitate recovery of functional capabilities when astronauts transition to different gravitational environments. The project conducted a series of studies that investigated the efficacy of treadmill training combined with a variety of sensory challenges designed to increase adaptability including alterations in visual flow, body loading, and support surface stability.
On the dynamics of some grid adaption schemes
NASA Technical Reports Server (NTRS)
Sweby, Peter K.; Yee, Helen C.
1994-01-01
The dynamics of a one-parameter family of mesh equidistribution schemes coupled with finite difference discretisations of linear and nonlinear convection-diffusion model equations is studied numerically. It is shown that, when time marched to steady state, the grid adaption not only influences the stability and convergence rate of the overall scheme, but can also introduce spurious dynamics to the numerical solution procedure.
Cheung, Ying Kuen; Chakraborty, Bibhas; Davidson, Karina W
2015-06-01
Implementation study is an important tool for deploying state-of-the-art treatments from clinical efficacy studies into a treatment program, with the dual goals of learning about effectiveness of the treatments and improving the quality of care for patients enrolled into the program. In this article, we deal with the design of a treatment program of dynamic treatment regimens (DTRs) for patients with depression post-acute coronary syndrome. We introduce a novel adaptive randomization scheme for a sequential multiple assignment randomized trial of DTRs. Our approach adapts the randomization probabilities to favor treatment sequences having comparatively superior Q-functions used in Q-learning. The proposed approach addresses three main concerns of an implementation study: it allows incorporation of historical data or opinions, it includes randomization for learning purposes, and it aims to improve care via adaptation throughout the program. We demonstrate how to apply our method to design a depression treatment program using data from a previous study. By simulation, we illustrate that the inputs from historical data are important for the program performance measured by the expected outcomes of the enrollees, but also show that the adaptive randomization scheme is able to compensate poorly specified historical inputs by improving patient outcomes within a reasonable horizon. The simulation results also confirm that the proposed design allows efficient learning of the treatments by alleviating the curse of dimensionality.
Dynamics and Adaptive Control for Stability Recovery of Damaged Aircraft
NASA Technical Reports Server (NTRS)
Nguyen, Nhan; Krishnakumar, Kalmanje; Kaneshige, John; Nespeca, Pascal
2006-01-01
This paper presents a recent study of a damaged generic transport model as part of a NASA research project to investigate adaptive control methods for stability recovery of damaged aircraft operating in off-nominal flight conditions under damage and or failures. Aerodynamic modeling of damage effects is performed using an aerodynamic code to assess changes in the stability and control derivatives of a generic transport aircraft. Certain types of damage such as damage to one of the wings or horizontal stabilizers can cause the aircraft to become asymmetric, thus resulting in a coupling between the longitudinal and lateral motions. Flight dynamics for a general asymmetric aircraft is derived to account for changes in the center of gravity that can compromise the stability of the damaged aircraft. An iterative trim analysis for the translational motion is developed to refine the trim procedure by accounting for the effects of the control surface deflection. A hybrid direct-indirect neural network, adaptive flight control is proposed as an adaptive law for stabilizing the rotational motion of the damaged aircraft. The indirect adaptation is designed to estimate the plant dynamics of the damaged aircraft in conjunction with the direct adaptation that computes the control augmentation. Two approaches are presented 1) an adaptive law derived from the Lyapunov stability theory to ensure that the signals are bounded, and 2) a recursive least-square method for parameter identification. A hardware-in-the-loop simulation is conducted and demonstrates the effectiveness of the direct neural network adaptive flight control in the stability recovery of the damaged aircraft. A preliminary simulation of the hybrid adaptive flight control has been performed and initial data have shown the effectiveness of the proposed hybrid approach. Future work will include further investigations and high-fidelity simulations of the proposed hybrid adaptive Bight control approach.
An adaptive multi-swarm optimizer for dynamic optimization problems.
Li, Changhe; Yang, Shengxiang; Yang, Ming
2014-01-01
The multipopulation method has been widely used to solve dynamic optimization problems (DOPs) with the aim of maintaining multiple populations on different peaks to locate and track multiple changing optima simultaneously. However, to make this approach effective for solving DOPs, two challenging issues need to be addressed. They are how to adapt the number of populations to changes and how to adaptively maintain the population diversity in a situation where changes are complicated or hard to detect or predict. Tracking the changing global optimum in dynamic environments is difficult because we cannot know when and where changes occur and what the characteristics of changes would be. Therefore, it is necessary to take these challenging issues into account in designing such adaptive algorithms. To address the issues when multipopulation methods are applied for solving DOPs, this paper proposes an adaptive multi-swarm algorithm, where the populations are enabled to be adaptive in dynamic environments without change detection. An experimental study is conducted based on the moving peaks problem to investigate the behavior of the proposed method. The performance of the proposed algorithm is also compared with a set of algorithms that are based on multipopulation methods from different research areas in the literature of evolutionary computation.
Sex Speeds Adaptation by Altering the Dynamics of Molecular Evolution
McDonald, Michael J.; Rice, Daniel P.; Desai, Michael M.
2016-01-01
Sex and recombination are pervasive throughout nature despite their substantial costs1. Understanding the evolutionary forces that maintain these phenomena is a central challenge in biology2,3. One longstanding hypothesis argues that sex is beneficial because recombination speeds adaptation4. Theory has proposed a number of distinct population genetic mechanisms that could underlie this advantage. For example, sex can promote the fixation of beneficial mutations either by alleviating interference competition (the Fisher-Muller effect)5,6 or by separating them from deleterious load (the ruby in the rubbish effect)7,8. Previous experiments confirm that sex can increase the rate of adaptation9–17, but these studies did not observe the evolutionary dynamics that drive this effect at the genomic level. Here, we present the first comparison between the sequence-level dynamics of adaptation in experimental sexual and asexual populations, which allows us to identify the specific mechanisms by which sex speeds adaptation. We find that sex alters the molecular signatures of evolution by changing the spectrum of mutations that fix, and confirm theoretical predictions that it does so by alleviating clonal interference. We also show that substantially deleterious mutations hitchhike to fixation in adapting asexual populations. In contrast, recombination prevents such mutations from fixing. Our results demonstrate that sex both speeds adaptation and alters its molecular signature by allowing natural selection to more efficiently sort beneficial from deleterious mutations. PMID:26909573
Sex speeds adaptation by altering the dynamics of molecular evolution.
McDonald, Michael J; Rice, Daniel P; Desai, Michael M
2016-03-10
Sex and recombination are pervasive throughout nature despite their substantial costs. Understanding the evolutionary forces that maintain these phenomena is a central challenge in biology. One longstanding hypothesis argues that sex is beneficial because recombination speeds adaptation. Theory has proposed several distinct population genetic mechanisms that could underlie this advantage. For example, sex can promote the fixation of beneficial mutations either by alleviating interference competition (the Fisher-Muller effect) or by separating them from deleterious load (the ruby in the rubbish effect). Previous experiments confirm that sex can increase the rate of adaptation, but these studies did not observe the evolutionary dynamics that drive this effect at the genomic level. Here we present the first, to our knowledge, comparison between the sequence-level dynamics of adaptation in experimental sexual and asexual Saccharomyces cerevisiae populations, which allows us to identify the specific mechanisms by which sex speeds adaptation. We find that sex alters the molecular signatures of evolution by changing the spectrum of mutations that fix, and confirm theoretical predictions that it does so by alleviating clonal interference. We also show that substantially deleterious mutations hitchhike to fixation in adapting asexual populations. In contrast, recombination prevents such mutations from fixing. Our results demonstrate that sex both speeds adaptation and alters its molecular signature by allowing natural selection to more efficiently sort beneficial from deleterious mutations.
Dynamic Adaptive Neural Network Arrays: A Neuromorphic Architecture
Disney, Adam; Reynolds, John
2015-01-01
Dynamic Adaptive Neural Network Array (DANNA) is a neuromorphic hardware implementation. It differs from most other neuromorphic projects in that it allows for programmability of structure, and it is trained or designed using evolutionary optimization. This paper describes the DANNA structure, how DANNA is trained using evolutionary optimization, and an application of DANNA to a very simple classification task.
Dynamic Programming: An Introduction by Example
ERIC Educational Resources Information Center
Zietz, Joachim
2007-01-01
The author introduces some basic dynamic programming techniques, using examples, with the help of the computer algebra system "Maple". The emphasis is on building confidence and intuition for the solution of dynamic problems in economics. To integrate the material better, the same examples are used to introduce different techniques. One covers the…
Adaptable Constrained Genetic Programming: Extensions and Applications
NASA Technical Reports Server (NTRS)
Janikow, Cezary Z.
2005-01-01
An evolutionary algorithm applies evolution-based principles to problem solving. To solve a problem, the user defines the space of potential solutions, the representation space. Sample solutions are encoded in a chromosome-like structure. The algorithm maintains a population of such samples, which undergo simulated evolution by means of mutation, crossover, and survival of the fittest principles. Genetic Programming (GP) uses tree-like chromosomes, providing very rich representation suitable for many problems of interest. GP has been successfully applied to a number of practical problems such as learning Boolean functions and designing hardware circuits. To apply GP to a problem, the user needs to define the actual representation space, by defining the atomic functions and terminals labeling the actual trees. The sufficiency principle requires that the label set be sufficient to build the desired solution trees. The closure principle allows the labels to mix in any arity-consistent manner. To satisfy both principles, the user is often forced to provide a large label set, with ad hoc interpretations or penalties to deal with undesired local contexts. This unfortunately enlarges the actual representation space, and thus usually slows down the search. In the past few years, three different methodologies have been proposed to allow the user to alleviate the closure principle by providing means to define, and to process, constraints on mixing the labels in the trees. Last summer we proposed a new methodology to further alleviate the problem by discovering local heuristics for building quality solution trees. A pilot system was implemented last summer and tested throughout the year. This summer we have implemented a new revision, and produced a User's Manual so that the pilot system can be made available to other practitioners and researchers. We have also designed, and partly implemented, a larger system capable of dealing with much more powerful heuristics.
Guidelines for dynamic international programs
Gold, M.A. )
1993-06-01
Matters of global concern-deforestation, global warming, biodiversity loss, sustainable development, fuelwood crises, watershed destruction, and large-scale flooding-frequently involve forests and natural resources. In the future, university students will enter a global setting that more than ever depends on a strong knowledge of international issues. USA land-grant universities are attempting to prepare students for this challenge by improving their international programs including forestry. To improve university programs, several factors will need to be addressed and are discussed, with examples, in this article: commitment of the faculty; program specialization; geographic specialization; reward systems for international contributions; international collaboration; recycled dollars within the university; active teaching programs; research; extention and outreach; language training; international faculty; travel grants; twinning relationships with sister institutions; selective in pursuit of international development assistance; and study centers. 6 refs.
Gradient-based adaptation of continuous dynamic model structures
NASA Astrophysics Data System (ADS)
La Cava, William G.; Danai, Kourosh
2016-01-01
A gradient-based method of symbolic adaptation is introduced for a class of continuous dynamic models. The proposed model structure adaptation method starts with the first-principles model of the system and adapts its structure after adjusting its individual components in symbolic form. A key contribution of this work is its introduction of the model's parameter sensitivity as the measure of symbolic changes to the model. This measure, which is essential to defining the structural sensitivity of the model, not only accommodates algebraic evaluation of candidate models in lieu of more computationally expensive simulation-based evaluation, but also makes possible the implementation of gradient-based optimisation in symbolic adaptation. The proposed method is applied to models of several virtual and real-world systems that demonstrate its potential utility.
Solution Methods for Stochastic Dynamic Linear Programs.
1980-12-01
Linear Programming, IIASA , Laxenburg, Austria, June 2-6, 1980. [2] Aghili, P., R.H., Cramer and H.W. Thompson, "On the applicability of two- stage...Laxenburg, Austria, May, 1978. [52] Propoi, A. and V. Krivonozhko, ’The simplex method for dynamic linear programs", RR-78-14, IIASA , Vienna, Austria
A Comparison of Three Programming Models for Adaptive Applications
NASA Technical Reports Server (NTRS)
Shan, Hong-Zhang; Singh, Jaswinder Pal; Oliker, Leonid; Biswa, Rupak; Kwak, Dochan (Technical Monitor)
2000-01-01
We study the performance and programming effort for two major classes of adaptive applications under three leading parallel programming models. We find that all three models can achieve scalable performance on the state-of-the-art multiprocessor machines. The basic parallel algorithms needed for different programming models to deliver their best performance are similar, but the implementations differ greatly, far beyond the fact of using explicit messages versus implicit loads/stores. Compared with MPI and SHMEM, CC-SAS (cache-coherent shared address space) provides substantial ease of programming at the conceptual and program orchestration level, which often leads to the performance gain. However it may also suffer from the poor spatial locality of physically distributed shared data on large number of processors. Our CC-SAS implementation of the PARMETIS partitioner itself runs faster than in the other two programming models, and generates more balanced result for our application.
Serial and parallel dynamic adaptation of general hybrid meshes
NASA Astrophysics Data System (ADS)
Kavouklis, Christos
The Navier-Stokes equations are a standard mathematical representation of viscous fluid flow. Their numerical solution in three dimensions remains a computationally intensive and challenging task, despite recent advances in computer speed and memory. A strategy to increase accuracy of Navier-Stokes simulations, while maintaining computing resources to a minimum, is local refinement of the associated computational mesh in regions of large solution gradients and coarsening in regions where the solution does not vary appreciably. In this work we consider adaptation of general hybrid meshes for Computational Fluid Dynamics (CFD) applications. Hybrid meshes are composed of four types of elements; hexahedra, prisms, pyramids and tetrahedra, and have been proven a promising technology in accurately resolving fluid flow for complex geometries. The first part of this dissertation is concerned with the design and implementation of a serial scheme for the adaptation of general three dimensional hybrid meshes. We have defined 29 refinement types, for all four kinds of elements. The core of the present adaptation scheme is an iterative algorithm that flags mesh edges for refinement, so that the adapted mesh is conformal. Of primary importance is considered the design of a suitable dynamic data structure that facilitates refinement and coarsening operations and furthermore minimizes memory requirements. A special dynamic list is defined for mesh elements, in contrast with the usual tree structures. It contains only elements of the current adaptation step and minimal information that is utilized to reconstruct parent elements when the mesh is coarsened. In the second part of this work, a new parallel dynamic mesh adaptation and load balancing algorithm for general hybrid meshes is presented. Partitioning of a hybrid mesh reduces to partitioning of the corresponding dual graph. Communication among processors is based on the faces of the interpartition boundary. The distributed
Space station structures and dynamics test program
NASA Technical Reports Server (NTRS)
Moore, Carleton J.; Townsend, John S.; Ivey, Edward W.
1987-01-01
The design, construction, and operation of a low-Earth orbit space station poses unique challenges for development and implementation of new technology. The technology arises from the special requirement that the station be built and constructed to function in a weightless environment, where static loads are minimal and secondary to system dynamics and control problems. One specific challenge confronting NASA is the development of a dynamics test program for: (1) defining space station design requirements, and (2) identifying the characterizing phenomena affecting the station's design and development. A general definition of the space station dynamic test program, as proposed by MSFC, forms the subject of this report. The test proposal is a comprehensive structural dynamics program to be launched in support of the space station. The test program will help to define the key issues and/or problems inherent to large space structure analysis, design, and testing. Development of a parametric data base and verification of the math models and analytical analysis tools necessary for engineering support of the station's design, construction, and operation provide the impetus for the dynamics test program. The philosophy is to integrate dynamics into the design phase through extensive ground testing and analytical ground simulations of generic systems, prototype elements, and subassemblies. On-orbit testing of the station will also be used to define its capability.
Hybrid Differential Dynamic Programming with Stochastic Search
NASA Technical Reports Server (NTRS)
Aziz, Jonathan; Parker, Jeffrey; Englander, Jacob
2016-01-01
Differential dynamic programming (DDP) has been demonstrated as a viable approach to low-thrust trajectory optimization, namely with the recent success of NASAs Dawn mission. The Dawn trajectory was designed with the DDP-based Static Dynamic Optimal Control algorithm used in the Mystic software. Another recently developed method, Hybrid Differential Dynamic Programming (HDDP) is a variant of the standard DDP formulation that leverages both first-order and second-order state transition matrices in addition to nonlinear programming (NLP) techniques. Areas of improvement over standard DDP include constraint handling, convergence properties, continuous dynamics, and multi-phase capability. DDP is a gradient based method and will converge to a solution nearby an initial guess. In this study, monotonic basin hopping (MBH) is employed as a stochastic search method to overcome this limitation, by augmenting the HDDP algorithm for a wider search of the solution space.
Hybrid Differential Dynamic Programming with Stochastic Search
NASA Technical Reports Server (NTRS)
Aziz, Jonathan; Parker, Jeffrey; Englander, Jacob A.
2016-01-01
Differential dynamic programming (DDP) has been demonstrated as a viable approach to low-thrust trajectory optimization, namely with the recent success of NASA's Dawn mission. The Dawn trajectory was designed with the DDP-based Static/Dynamic Optimal Control algorithm used in the Mystic software.1 Another recently developed method, Hybrid Differential Dynamic Programming (HDDP),2, 3 is a variant of the standard DDP formulation that leverages both first-order and second-order state transition matrices in addition to nonlinear programming (NLP) techniques. Areas of improvement over standard DDP include constraint handling, convergence properties, continuous dynamics, and multi-phase capability. DDP is a gradient based method and will converge to a solution nearby an initial guess. In this study, monotonic basin hopping (MBH) is employed as a stochastic search method to overcome this limitation, by augmenting the HDDP algorithm for a wider search of the solution space.
Model-adaptive hybrid dynamic control for robotic assembly tasks
Austin, D.J.; McCarragher, B.J.
1999-10-01
A new task-level adaptive controller is presented for the hybrid dynamic control of robotic assembly tasks. Using a hybrid dynamic model of the assembly task, velocity constraints are derived from which satisfactory velocity commands are obtained. Due to modeling errors and parametric uncertainties, the velocity commands may be erroneous and may result in suboptimal performance. Task-level adaptive control schemes, based on the occurrence of discrete events, are used to change the model parameters from which the velocity commands are determined. Two adaptive schemes are presented: the first is based on intuitive reasoning about the vector spaces involved whereas the second uses a search region that is reduced with each iteration. For the first adaptation law, asymptotic convergence to the correct model parameters is proven except for one case. This weakness motivated the development of the second adaptation law, for which asymptotic convergence is proven in all cases. Automated control of a peg-in-hole assembly task is given as an example, and simulations and experiments for this task are presented. These results demonstrate the success of the method and also indicate properties for rapid convergence.
Parallel tetrahedral mesh adaptation with dynamic load balancing
Oliker, Leonid; Biswas, Rupak; Gabow, Harold N.
2000-06-28
The ability to dynamically adapt an unstructured grid is a powerful tool for efficiently solving computational problems with evolving physical features. In this paper, we report on our experience parallelizing an edge-based adaptation scheme, called 3D-TAG, using message passing. Results show excellent speedup when a realistic helicopter rotor mesh is randomly refined. However, performance deteriorates when the mesh is refined using a solution-based error indicator since mesh adaptation for practical problems occurs in a localized region, creating a severe load imbalance. To address this problem, we have developed PLUM, a global dynamic load balancing framework for adaptive numerical computations. Even though PLUM primarily balances processor workloads for the solution phase, it reduces the load imbalance problem within mesh adaptation by repartitioning the mesh after targeting edges for refinement but before the actual subdivision. This dramatically improves the performance of parallel 3D-TAG since refinement occurs in a more load balanced fashion. We also present optimal and heuristic algorithms that, when applied to the default mapping of a parallel repartitioner, significantly reduce the data redistribution overhead. Finally, portability is examined by comparing performance on three state-of-the-art parallel machines.
Parallel Tetrahedral Mesh Adaptation with Dynamic Load Balancing
NASA Technical Reports Server (NTRS)
Oliker, Leonid; Biswas, Rupak; Gabow, Harold N.
1999-01-01
The ability to dynamically adapt an unstructured grid is a powerful tool for efficiently solving computational problems with evolving physical features. In this paper, we report on our experience parallelizing an edge-based adaptation scheme, called 3D_TAG. using message passing. Results show excellent speedup when a realistic helicopter rotor mesh is randomly refined. However. performance deteriorates when the mesh is refined using a solution-based error indicator since mesh adaptation for practical problems occurs in a localized region., creating a severe load imbalance. To address this problem, we have developed PLUM, a global dynamic load balancing framework for adaptive numerical computations. Even though PLUM primarily balances processor workloads for the solution phase, it reduces the load imbalance problem within mesh adaptation by repartitioning the mesh after targeting edges for refinement but before the actual subdivision. This dramatically improves the performance of parallel 3D_TAG since refinement occurs in a more load balanced fashion. We also present optimal and heuristic algorithms that, when applied to the default mapping of a parallel repartitioner, significantly reduce the data redistribution overhead. Finally, portability is examined by comparing performance on three state-of-the-art parallel machines.
Dynamic model of heat inactivation kinetics for bacterial adaptation.
Corradini, Maria G; Peleg, Micha
2009-04-01
The Weibullian-log logistic (WeLL) inactivation model was modified to account for heat adaptation by introducing a logistic adaptation factor, which rendered its "rate parameter" a function of both temperature and heating rate. The resulting model is consistent with the observation that adaptation is primarily noticeable in slow heat processes in which the cells are exposed to sublethal temperatures for a sufficiently long time. Dynamic survival patterns generated with the proposed model were in general agreement with those of Escherichia coli and Listeria monocytogenes as reported in the literature. Although the modified model's rate equation has a cumbersome appearance, especially for thermal processes having a variable heating rate, it can be solved numerically with commercial mathematical software. The dynamic model has five survival/adaptation parameters whose determination will require a large experimental database. However, with assumed or estimated parameter values, the model can simulate survival patterns of adapting pathogens in cooked foods that can be used in risk assessment and the establishment of safe preparation conditions.
Eco-evolutionary feedbacks, adaptive dynamics and evolutionary rescue theory.
Ferriere, Regis; Legendre, Stéphane
2013-01-19
Adaptive dynamics theory has been devised to account for feedbacks between ecological and evolutionary processes. Doing so opens new dimensions to and raises new challenges about evolutionary rescue. Adaptive dynamics theory predicts that successive trait substitutions driven by eco-evolutionary feedbacks can gradually erode population size or growth rate, thus potentially raising the extinction risk. Even a single trait substitution can suffice to degrade population viability drastically at once and cause 'evolutionary suicide'. In a changing environment, a population may track a viable evolutionary attractor that leads to evolutionary suicide, a phenomenon called 'evolutionary trapping'. Evolutionary trapping and suicide are commonly observed in adaptive dynamics models in which the smooth variation of traits causes catastrophic changes in ecological state. In the face of trapping and suicide, evolutionary rescue requires that the population overcome evolutionary threats generated by the adaptive process itself. Evolutionary repellors play an important role in determining how variation in environmental conditions correlates with the occurrence of evolutionary trapping and suicide, and what evolutionary pathways rescue may follow. In contrast with standard predictions of evolutionary rescue theory, low genetic variation may attenuate the threat of evolutionary suicide and small population sizes may facilitate escape from evolutionary traps.
Nonhydrostatic adaptive mesh dynamics for multiscale climate models (Invited)
NASA Astrophysics Data System (ADS)
Collins, W.; Johansen, H.; McCorquodale, P.; Colella, P.; Ullrich, P. A.
2013-12-01
Many of the atmospheric phenomena with the greatest potential impact in future warmer climates are inherently multiscale. Such meteorological systems include hurricanes and tropical cyclones, atmospheric rivers, and other types of hydrometeorological extremes. These phenomena are challenging to simulate in conventional climate models due to the relatively coarse uniform model resolutions relative to the native nonhydrostatic scales of the phenomonological dynamics. To enable studies of these systems with sufficient local resolution for the multiscale dynamics yet with sufficient speed for climate-change studies, we have adapted existing adaptive mesh dynamics for the DOE-NSF Community Atmosphere Model (CAM). In this talk, we present an adaptive, conservative finite volume approach for moist non-hydrostatic atmospheric dynamics. The approach is based on the compressible Euler equations on 3D thin spherical shells, where the radial direction is treated implicitly (using a fourth-order Runga-Kutta IMEX scheme) to eliminate time step constraints from vertical acoustic waves. Refinement is performed only in the horizontal directions. The spatial discretization is the equiangular cubed-sphere mapping, with a fourth-order accurate discretization to compute flux averages on faces. By using both space-and time-adaptive mesh refinement, the solver allocates computational effort only where greater accuracy is needed. The resulting method is demonstrated to be fourth-order accurate for model problems, and robust at solution discontinuities and stable for large aspect ratios. We present comparisons using a simplified physics package for dycore comparisons of moist physics. Hadley cell lifting an advected tracer into upper atmosphere, with horizontal adaptivity
Adaptive primal-dual genetic algorithms in dynamic environments.
Wang, Hongfeng; Yang, Shengxiang; Ip, W H; Wang, Dingwei
2009-12-01
Recently, there has been an increasing interest in applying genetic algorithms (GAs) in dynamic environments. Inspired by the complementary and dominance mechanisms in nature, a primal-dual GA (PDGA) has been proposed for dynamic optimization problems (DOPs). In this paper, an important operator in PDGA, i.e., the primal-dual mapping (PDM) scheme, is further investigated to improve the robustness and adaptability of PDGA in dynamic environments. In the improved scheme, two different probability-based PDM operators, where the mapping probability of each allele in the chromosome string is calculated through the statistical information of the distribution of alleles in the corresponding gene locus over the population, are effectively combined according to an adaptive Lamarckian learning mechanism. In addition, an adaptive dominant replacement scheme, which can probabilistically accept inferior chromosomes, is also introduced into the proposed algorithm to enhance the diversity level of the population. Experimental results on a series of dynamic problems generated from several stationary benchmark problems show that the proposed algorithm is a good optimizer for DOPs.
Adaptive network dynamics and evolution of leadership in collective migration
NASA Astrophysics Data System (ADS)
Pais, Darren; Leonard, Naomi E.
2014-01-01
The evolution of leadership in migratory populations depends not only on costs and benefits of leadership investments but also on the opportunities for individuals to rely on cues from others through social interactions. We derive an analytically tractable adaptive dynamic network model of collective migration with fast timescale migration dynamics and slow timescale adaptive dynamics of individual leadership investment and social interaction. For large populations, our analysis of bifurcations with respect to investment cost explains the observed hysteretic effect associated with recovery of migration in fragmented environments. Further, we show a minimum connectivity threshold above which there is evolutionary branching into leader and follower populations. For small populations, we show how the topology of the underlying social interaction network influences the emergence and location of leaders in the adaptive system. Our model and analysis can be extended to study the dynamics of collective tracking or collective learning more generally. Thus, this work may inform the design of robotic networks where agents use decentralized strategies that balance direct environmental measurements with agent interactions.
NASA Astrophysics Data System (ADS)
Chai, Runqi; Savvaris, Al; Tsourdos, Antonios
2016-06-01
In this paper, a fuzzy physical programming (FPP) method has been introduced for solving multi-objective Space Manoeuvre Vehicles (SMV) skip trajectory optimization problem based on hp-adaptive pseudospectral methods. The dynamic model of SMV is elaborated and then, by employing hp-adaptive pseudospectral methods, the problem has been transformed to nonlinear programming (NLP) problem. According to the mission requirements, the solutions were calculated for each single-objective scenario. To get a compromised solution for each target, the fuzzy physical programming (FPP) model is proposed. The preference function is established with considering the fuzzy factor of the system such that a proper compromised trajectory can be acquired. In addition, the NSGA-II is tested to obtain the Pareto-optimal solution set and verify the Pareto optimality of the FPP solution. Simulation results indicate that the proposed method is effective and feasible in terms of dealing with the multi-objective skip trajectory optimization for the SMV.
Dynamic Load Balancing for Adaptive Meshes using Symmetric Broadcast Networks
NASA Technical Reports Server (NTRS)
Das, Sajal K.; Harvey, Daniel J.; Biswas, Rupak; Saini, Subhash (Technical Monitor)
1998-01-01
Many scientific applications involve grids that lack a uniform underlying structure. These applications are often dynamic in the sense that the grid structure significantly changes between successive phases of execution. In parallel computing environments, mesh adaptation of grids through selective refinement/coarsening has proven to be an effective approach. However, achieving load balance while minimizing inter-processor communication and redistribution costs is a difficult problem. Traditional dynamic load balancers are mostly inadequate because they lack a global view across processors. In this paper, we compare a novel load balancer that utilizes symmetric broadcast networks (SBN) to a successful global load balancing environment (PLUM) created to handle adaptive unstructured applications. Our experimental results on the IBM SP2 demonstrate that performance of the proposed SBN load balancer is comparable to results achieved under PLUM.
Configuring Airspace Sectors with Approximate Dynamic Programming
NASA Technical Reports Server (NTRS)
Bloem, Michael; Gupta, Pramod
2010-01-01
In response to changing traffic and staffing conditions, supervisors dynamically configure airspace sectors by assigning them to control positions. A finite horizon airspace sector configuration problem models this supervisor decision. The problem is to select an airspace configuration at each time step while considering a workload cost, a reconfiguration cost, and a constraint on the number of control positions at each time step. Three algorithms for this problem are proposed and evaluated: a myopic heuristic, an exact dynamic programming algorithm, and a rollouts approximate dynamic programming algorithm. On problem instances from current operations with only dozens of possible configurations, an exact dynamic programming solution gives the optimal cost value. The rollouts algorithm achieves costs within 2% of optimal for these instances, on average. For larger problem instances that are representative of future operations and have thousands of possible configurations, excessive computation time prohibits the use of exact dynamic programming. On such problem instances, the rollouts algorithm reduces the cost achieved by the heuristic by more than 15% on average with an acceptable computation time.
Dynamic Programming Based Segmentation in Biomedical Imaging.
Ungru, Kathrin; Jiang, Xiaoyi
2017-01-01
Many applications in biomedical imaging have a demand on automatic detection of lines, contours, or boundaries of bones, organs, vessels, and cells. Aim is to support expert decisions in interactive applications or to include it as part of a processing pipeline for automatic image analysis. Biomedical images often suffer from noisy data and fuzzy edges. Therefore, there is a need for robust methods for contour and line detection. Dynamic programming is a popular technique that satisfies these requirements in many ways. This work gives a brief overview over approaches and applications that utilize dynamic programming to solve problems in the challenging field of biomedical imaging.
Reconfigurable systems for sequence alignment and for general dynamic programming.
Jacobi, Ricardo P; Ayala-Rincón, Mauricio; Carvalho, Luis G A; Llanos, Carlos H; Hartenstein, Reiner W
2005-09-30
Reconfigurable systolic arrays can be adapted to efficiently resolve a wide spectrum of computational problems; parallelism is naturally explored in systolic arrays and reconfigurability allows for redefinition of the interconnections and operations even during run time (dynamically). We present a reconfigurable systolic architecture that can be applied for the efficient treatment of several dynamic programming methods for resolving well-known problems, such as global and local sequence alignment, approximate string matching and longest common subsequence. The dynamicity of the reconfigurability was found to be useful for practical applications in the construction of sequence alignments. A VHDL (VHSIC hardware description language) version of this new architecture was implemented on an APEX FPGA (Field programmable gate array). It would be several magnitudes faster than the software algorithm alternatives.
A comparison of three programming models for adaptive applications on the Origin2000
Shan, Hongzhang; Singh, Jaswinder Pal; Oliker, Leonid; Biswas, Rupak
2001-05-30
Adaptive applications have computational workloads and communication patterns which change unpredictably at runtime, requiring dynamic load balancing to achieve scalable performance on parallel machines. Efficient parallel implementations of such adaptive applications is therefore a challenging task. In this paper, we compare the performance of and the programming effort required for two major classes of adaptive applications under three leading parallel programming models on an SGI Origin2000 system, a machine which supports all three models efficiently. Results indicate that the three models deliver comparable performance; however, the implementations differ significantly beyond merely using explicit messages versus implicit loads/stores even though the basic parallel algorithms are similar. Compared with the message-passing (using MPI) and SHMEM programming models, the cache-coherent shared address space (CC-SAS) model provides substantial ease of programming at both the conceptual and program orchestration levels, often accompanied by performance gains. However, CC-SAS currently has portability limitations and may suffer from poor spatial locality of physically distributed shared data on large numbers of processors.
Efficient dynamic optimization of logic programs
NASA Technical Reports Server (NTRS)
Laird, Phil
1992-01-01
A summary is given of the dynamic optimization approach to speed up learning for logic programs. The problem is to restructure a recursive program into an equivalent program whose expected performance is optimal for an unknown but fixed population of problem instances. We define the term 'optimal' relative to the source of input instances and sketch an algorithm that can come within a logarithmic factor of optimal with high probability. Finally, we show that finding high-utility unfolding operations (such as EBG) can be reduced to clause reordering.
Automatic cone photoreceptor segmentation using graph theory and dynamic programming.
Chiu, Stephanie J; Lokhnygina, Yuliya; Dubis, Adam M; Dubra, Alfredo; Carroll, Joseph; Izatt, Joseph A; Farsiu, Sina
2013-06-01
Geometrical analysis of the photoreceptor mosaic can reveal subclinical ocular pathologies. In this paper, we describe a fully automatic algorithm to identify and segment photoreceptors in adaptive optics ophthalmoscope images of the photoreceptor mosaic. This method is an extension of our previously described closed contour segmentation framework based on graph theory and dynamic programming (GTDP). We validated the performance of the proposed algorithm by comparing it to the state-of-the-art technique on a large data set consisting of over 200,000 cones and posted the results online. We found that the GTDP method achieved a higher detection rate, decreasing the cone miss rate by over a factor of five.
Distributed Adaptive Particle Swarm Optimizer in Dynamic Environment
Cui, Xiaohui; Potok, Thomas E
2007-01-01
In the real world, we have to frequently deal with searching and tracking an optimal solution in a dynamical and noisy environment. This demands that the algorithm not only find the optimal solution but also track the trajectory of the changing solution. Particle Swarm Optimization (PSO) is a population-based stochastic optimization technique, which can find an optimal, or near optimal, solution to a numerical and qualitative problem. In PSO algorithm, the problem solution emerges from the interactions between many simple individual agents called particles, which make PSO an inherently distributed algorithm. However, the traditional PSO algorithm lacks the ability to track the optimal solution in a dynamic and noisy environment. In this paper, we present a distributed adaptive PSO (DAPSO) algorithm that can be used for tracking a non-stationary optimal solution in a dynamically changing and noisy environment.
Glassy Dynamics in the Adaptive Immune Response Prevents Autoimmune Disease
NASA Astrophysics Data System (ADS)
Sun, Jun; Earl, David J.; Deem, Michael W.
2005-09-01
The immune system normally protects the human host against death by infection. However, when an immune response is mistakenly directed at self-antigens, autoimmune disease can occur. We describe a model of protein evolution to simulate the dynamics of the adaptive immune response to antigens. Computer simulations of the dynamics of antibody evolution show that different evolutionary mechanisms, namely, gene segment swapping and point mutation, lead to different evolved antibody binding affinities. Although a combination of gene segment swapping and point mutation can yield a greater affinity to a specific antigen than point mutation alone, the antibodies so evolved are highly cross reactive and would cause autoimmune disease, and this is not the chosen dynamics of the immune system. We suggest that in the immune system’s search for antibodies, a balance has evolved between binding affinity and specificity.
An Evolutionary Dynamics Model Adapted to Eusocial Insects
van Oudenhove, Louise; Cerdá, Xim; Bernstein, Carlos
2013-01-01
This study aims to better understand the evolutionary processes allowing species coexistence in eusocial insect communities. We develop a mathematical model that applies adaptive dynamics theory to the evolutionary dynamics of eusocial insects, focusing on the colony as the unit of selection. The model links long-term evolutionary processes to ecological interactions among colonies and seasonal worker production within the colony. Colony population dynamics is defined by both worker production and colony reproduction. Random mutations occur in strategies, and mutant colonies enter the community. The interactions of colonies at the ecological timescale drive the evolution of strategies at the evolutionary timescale by natural selection. This model is used to study two specific traits in ants: worker body size and the degree of collective foraging. For both traits, trade-offs in competitive ability and other fitness components allows to determine conditions in which selection becomes disruptive. Our results illustrate that asymmetric competition underpins diversity in ant communities. PMID:23469162
An evolutionary dynamics model adapted to eusocial insects.
van Oudenhove, Louise; Cerdá, Xim; Bernstein, Carlos
2013-01-01
This study aims to better understand the evolutionary processes allowing species coexistence in eusocial insect communities. We develop a mathematical model that applies adaptive dynamics theory to the evolutionary dynamics of eusocial insects, focusing on the colony as the unit of selection. The model links long-term evolutionary processes to ecological interactions among colonies and seasonal worker production within the colony. Colony population dynamics is defined by both worker production and colony reproduction. Random mutations occur in strategies, and mutant colonies enter the community. The interactions of colonies at the ecological timescale drive the evolution of strategies at the evolutionary timescale by natural selection. This model is used to study two specific traits in ants: worker body size and the degree of collective foraging. For both traits, trade-offs in competitive ability and other fitness components allows to determine conditions in which selection becomes disruptive. Our results illustrate that asymmetric competition underpins diversity in ant communities.
NASA Astrophysics Data System (ADS)
Lv, Yongfeng; Na, Jing; Yang, Qinmin; Wu, Xing; Guo, Yu
2016-01-01
An online adaptive optimal control is proposed for continuous-time nonlinear systems with completely unknown dynamics, which is achieved by developing a novel identifier-critic-based approximate dynamic programming algorithm with a dual neural network (NN) approximation structure. First, an adaptive NN identifier is designed to obviate the requirement of complete knowledge of system dynamics, and a critic NN is employed to approximate the optimal value function. Then, the optimal control law is computed based on the information from the identifier NN and the critic NN, so that the actor NN is not needed. In particular, a novel adaptive law design method with the parameter estimation error is proposed to online update the weights of both identifier NN and critic NN simultaneously, which converge to small neighbourhoods around their ideal values. The closed-loop system stability and the convergence to small vicinity around the optimal solution are all proved by means of the Lyapunov theory. The proposed adaptation algorithm is also improved to achieve finite-time convergence of the NN weights. Finally, simulation results are provided to exemplify the efficacy of the proposed methods.
Two Characterizations of Optimality in Dynamic Programming
Karatzas, Ioannis; Sudderth, William D.
2010-06-15
It holds in great generality that a plan is optimal for a dynamic programming problem, if and only if it is 'thrifty' and 'equalizing.' An alternative characterization of an optimal plan, that applies in many economic models, is that the plan must satisfy an appropriate Euler equation and a transversality condition. Here we explore the connections between these two characterizations.
Two stage gear tooth dynamics program
NASA Technical Reports Server (NTRS)
Boyd, Linda S.
1989-01-01
The epicyclic gear dynamics program was expanded to add the option of evaluating the tooth pair dynamics for two epicyclic gear stages with peripheral components. This was a practical extension to the program as multiple gear stages are often used for speed reduction, space, weight, and/or auxiliary units. The option was developed for either stage to be a basic planetary, star, single external-external mesh, or single external-internal mesh. The two stage system allows for modeling of the peripherals with an input mass and shaft, an output mass and shaft, and a connecting shaft. Execution of the initial test case indicated an instability in the solution with the tooth paid loads growing to excessive magnitudes. A procedure to trace the instability is recommended as well as a method of reducing the program's computation time by reducing the number of boundary condition iterations.
Adaptive learning by extremal dynamics and negative feedback
Bak, Per; Chialvo, Dante R.
2001-03-01
We describe a mechanism for biological learning and adaptation based on two simple principles: (i) Neuronal activity propagates only through the network's strongest synaptic connections (extremal dynamics), and (ii) the strengths of active synapses are reduced if mistakes are made, otherwise no changes occur (negative feedback). The balancing of those two tendencies typically shapes a synaptic landscape with configurations which are barely stable, and therefore highly flexible. This allows for swift adaptation to new situations. Recollection of past successes is achieved by punishing synapses which have once participated in activity associated with successful outputs much less than neurons that have never been successful. Despite its simplicity, the model can readily learn to solve complicated nonlinear tasks, even in the presence of noise. In particular, the learning time for the benchmark parity problem scales algebraically with the problem size N, with an exponent k{approx}1.4.
Elucidating Microbial Adaptation Dynamics via Autonomous Exposure and Sampling
NASA Astrophysics Data System (ADS)
Grace, J. M.; Verseux, C.; Gentry, D.; Moffet, A.; Thayabaran, R.; Wong, N.; Rothschild, L.
2013-12-01
The adaptation of micro-organisms to their environments is a complex process of interaction between the pressures of the environment and of competition. Reducing this multifactorial process to environmental exposure in the laboratory is a common tool for elucidating individual mechanisms of evolution, such as mutation rates[Wielgoss et al., 2013]. Although such studies inform fundamental questions about the way adaptation and even speciation occur, they are often limited by labor-intensive manual techniques[Wassmann et al., 2010]. Current methods for controlled study of microbial adaptation limit the length of time, the depth of collected data, and the breadth of applied environmental conditions. Small idiosyncrasies in manual techniques can have large effects on outcomes; for example, there are significant variations in induced radiation resistances following similar repeated exposure protocols[Alcántara-Díaz et al., 2004; Goldman and Travisano, 2011]. We describe here a project under development to allow rapid cycling of multiple types of microbial environmental exposure. The system allows continuous autonomous monitoring and data collection of both single species and sampled communities, independently and concurrently providing multiple types of controlled environmental pressure (temperature, radiation, chemical presence or absence, and so on) to a microbial community in dynamic response to the ecosystem's current status. When combined with DNA sequencing and extraction, such a controlled environment can cast light on microbial functional development, population dynamics, inter- and intra-species competition, and microbe-environment interaction. The project's goal is to allow rapid, repeatable iteration of studies of both natural and artificial microbial adaptation. As an example, the same system can be used both to increase the pH of a wet soil aliquot over time while periodically sampling it for genetic activity analysis, or to repeatedly expose a culture of
Direct Adaptive Aircraft Control Using Dynamic Cell Structure Neural Networks
NASA Technical Reports Server (NTRS)
Jorgensen, Charles C.
1997-01-01
A Dynamic Cell Structure (DCS) Neural Network was developed which learns topology representing networks (TRNS) of F-15 aircraft aerodynamic stability and control derivatives. The network is integrated into a direct adaptive tracking controller. The combination produces a robust adaptive architecture capable of handling multiple accident and off- nominal flight scenarios. This paper describes the DCS network and modifications to the parameter estimation procedure. The work represents one step towards an integrated real-time reconfiguration control architecture for rapid prototyping of new aircraft designs. Performance was evaluated using three off-line benchmarks and on-line nonlinear Virtual Reality simulation. Flight control was evaluated under scenarios including differential stabilator lock, soft sensor failure, control and stability derivative variations, and air turbulence.
Expansion of epicyclic gear dynamic analysis program
NASA Technical Reports Server (NTRS)
Boyd, Linda Smith; Pike, James A.
1987-01-01
The multiple mesh/single stage dynamics program is a gear tooth analysis program which determines detailed geometry, dynamic loads, stresses, and surface damage factors. The program can analyze a variety of both epicyclic and single mesh systems with spur or helical gear teeth including internal, external, and buttress tooth forms. The modifications refine the options for the flexible carrier and flexible ring gear rim and adds three options: a floating Sun gear option; a natural frequency option; and a finite element compliance formulation for helical gear teeth. The option for a floating Sun incorporates two additional degrees of freedom at the Sun center. The natural frequency option evaluates the frequencies of planetary, star, or differential systems as well as the effect of additional springs at the Sun center and those due to a flexible carrier and/or ring gear rim. The helical tooth pair finite element calculated compliance is obtained from an automated element breakup of the helical teeth and then is used with the basic gear dynamic solution and stress postprocessing routines. The flexible carrier or ring gear rim option for planetary and star spur gear systems allows the output torque per carrier and ring gear rim segment to vary based on the dynamic response of the entire system, while the total output torque remains constant.
Elucidating Microbial Adaptation Dynamics via Autonomous Exposure and Sampling
NASA Technical Reports Server (NTRS)
Grace, Joseph M.; Verseux, Cyprien; Gentry, Diana; Moffet, Amy; Thayabaran, Ramanen; Wong, Nathan; Rothschild, Lynn
2013-01-01
The adaptation of micro-organisms to their environments is a complex process of interaction between the pressures of the environment and of competition. Reducing this multifactorial process to environmental exposure in the laboratory is a common tool for elucidating individual mechanisms of evolution, such as mutation rates. Although such studies inform fundamental questions about the way adaptation and even speciation occur, they are often limited by labor-intensive manual techniques. Current methods for controlled study of microbial adaptation limit the length of time, the depth of collected data, and the breadth of applied environmental conditions. Small idiosyncrasies in manual techniques can have large effects on outcomes; for example, there are significant variations in induced radiation resistances following similar repeated exposure protocols. We describe here a project under development to allow rapid cycling of multiple types of microbial environmental exposure. The system allows continuous autonomous monitoring and data collection of both single species and sampled communities, independently and concurrently providing multiple types of controlled environmental pressure (temperature, radiation, chemical presence or absence, and so on) to a microbial community in dynamic response to the ecosystem's current status. When combined with DNA sequencing and extraction, such a controlled environment can cast light on microbial functional development, population dynamics, inter- and intra-species competition, and microbe-environment interaction. The project's goal is to allow rapid, repeatable iteration of studies of both natural and artificial microbial adaptation. As an example, the same system can be used both to increase the pH of a wet soil aliquot over time while periodically sampling it for genetic activity analysis, or to repeatedly expose a culture of bacteria to the presence of a toxic metal, automatically adjusting the level of toxicity based on the
Adaptive and neuroadaptive control for nonnegative and compartmental dynamical systems
NASA Astrophysics Data System (ADS)
Volyanskyy, Kostyantyn Y.
Neural networks have been extensively used for adaptive system identification as well as adaptive and neuroadaptive control of highly uncertain systems. The goal of adaptive and neuroadaptive control is to achieve system performance without excessive reliance on system models. To improve robustness and the speed of adaptation of adaptive and neuroadaptive controllers several controller architectures have been proposed in the literature. In this dissertation, we develop a new neuroadaptive control architecture for nonlinear uncertain dynamical systems. The proposed framework involves a novel controller architecture with additional terms in the update laws that are constructed using a moving window of the integrated system uncertainty. These terms can be used to identify the ideal system weights of the neural network as well as effectively suppress system uncertainty. Linear and nonlinear parameterizations of the system uncertainty are considered and state and output feedback neuroadaptive controllers are developed. Furthermore, we extend the developed framework to discrete-time dynamical systems. To illustrate the efficacy of the proposed approach we apply our results to an aircraft model with wing rock dynamics, a spacecraft model with unknown moment of inertia, and an unmanned combat aerial vehicle undergoing actuator failures, and compare our results with standard neuroadaptive control methods. Nonnegative systems are essential in capturing the behavior of a wide range of dynamical systems involving dynamic states whose values are nonnegative. A sub-class of nonnegative dynamical systems are compartmental systems. These systems are derived from mass and energy balance considerations and are comprised of homogeneous interconnected microscopic subsystems or compartments which exchange variable quantities of material via intercompartmental flow laws. In this dissertation, we develop direct adaptive and neuroadaptive control framework for stabilization, disturbance
Hydrodynamics in adaptive resolution particle simulations: Multiparticle collision dynamics
Alekseeva, Uliana; Winkler, Roland G.; Sutmann, Godehard
2016-06-01
A new adaptive resolution technique for particle-based multi-level simulations of fluids is presented. In the approach, the representation of fluid and solvent particles is changed on the fly between an atomistic and a coarse-grained description. The present approach is based on a hybrid coupling of the multiparticle collision dynamics (MPC) method and molecular dynamics (MD), thereby coupling stochastic and deterministic particle-based methods. Hydrodynamics is examined by calculating velocity and current correlation functions for various mixed and coupled systems. We demonstrate that hydrodynamic properties of the mixed fluid are conserved by a suitable coupling of the two particle methods, and that the simulation results agree well with theoretical expectations.
Effect of Adaptive Delivery Capacity on Networked Traffic Dynamics
NASA Astrophysics Data System (ADS)
Cao, Xian-Bin; Du, Wen-Bo; Chen, Cai-Long; Zhang, Jun
2011-05-01
We introduce an adaptive delivering capacity mechanism into the traffic dynamic model on scale-free networks under shortest path routing strategy and focus on its effect on the network capacity measured by the critical point (Rc) of phase transition from free now to congestion. Under this mechanism, the total node's delivering capacity is fixed and the allocation of delivering capacity on node i is proportional to nivarphi, where ni is the queue length of node i and varphi is the adjustable parameter. It is found that the network capacity monotonously increases with the increment of varphi, but there exists an optimal value of parameter varphi leading to the highest transportation efficiency measured by average travelling time (
Dynamics of epidemic diseases on a growing adaptive network
NASA Astrophysics Data System (ADS)
Demirel, Güven; Barter, Edmund; Gross, Thilo
2017-02-01
The study of epidemics on static networks has revealed important effects on disease prevalence of network topological features such as the variance of the degree distribution, i.e. the distribution of the number of neighbors of nodes, and the maximum degree. Here, we analyze an adaptive network where the degree distribution is not independent of epidemics but is shaped through disease-induced dynamics and mortality in a complex interplay. We study the dynamics of a network that grows according to a preferential attachment rule, while nodes are simultaneously removed from the network due to disease-induced mortality. We investigate the prevalence of the disease using individual-based simulations and a heterogeneous node approximation. Our results suggest that in this system in the thermodynamic limit no epidemic thresholds exist, while the interplay between network growth and epidemic spreading leads to exponential networks for any finite rate of infectiousness when the disease persists.
Experimental Dynamic Characterization of a Reconfigurable Adaptive Precision Truss
NASA Technical Reports Server (NTRS)
Hinkle, J. D.; Peterson, L. D.
1994-01-01
The dynamic behavior of a reconfigurable adaptive truss structure with non-linear joints is investigated. The objective is to experimentally examine the effects of the local non-linearities on the global dynamics of the structure. Amplitude changes in the frequency response functions are measured at micron levels of motion. The amplitude and frequency variations of a number of modes indicate a non-linear Coulomb friction response. Hysteretic bifurcation behavior is also measured at an amplitude approximately equal to the specified free-play in the joint. Under the 1 g pre-load, however, the non-linearity was dominantly characteristic of Coulomb friction with little evidence of free-play stiffening.
Adaptive integral dynamic surface control of a hypersonic flight vehicle
NASA Astrophysics Data System (ADS)
Aslam Butt, Waseem; Yan, Lin; Amezquita S., Kendrick
2015-07-01
In this article, non-linear adaptive dynamic surface air speed and flight path angle control designs are presented for the longitudinal dynamics of a flexible hypersonic flight vehicle. The tracking performance of the control design is enhanced by introducing a novel integral term that caters to avoiding a large initial control signal. To ensure feasibility, the design scheme incorporates magnitude and rate constraints on the actuator commands. The uncertain non-linear functions are approximated by an efficient use of the neural networks to reduce the computational load. A detailed stability analysis shows that all closed-loop signals are uniformly ultimately bounded and the ? tracking performance is guaranteed. The robustness of the design scheme is verified through numerical simulations of the flexible flight vehicle model.
Dynamics of epidemic diseases on a growing adaptive network
Demirel, Güven; Barter, Edmund; Gross, Thilo
2017-01-01
The study of epidemics on static networks has revealed important effects on disease prevalence of network topological features such as the variance of the degree distribution, i.e. the distribution of the number of neighbors of nodes, and the maximum degree. Here, we analyze an adaptive network where the degree distribution is not independent of epidemics but is shaped through disease-induced dynamics and mortality in a complex interplay. We study the dynamics of a network that grows according to a preferential attachment rule, while nodes are simultaneously removed from the network due to disease-induced mortality. We investigate the prevalence of the disease using individual-based simulations and a heterogeneous node approximation. Our results suggest that in this system in the thermodynamic limit no epidemic thresholds exist, while the interplay between network growth and epidemic spreading leads to exponential networks for any finite rate of infectiousness when the disease persists. PMID:28186146
Selective host molecules obtained by dynamic adaptive chemistry.
Matache, Mihaela; Bogdan, Elena; Hădade, Niculina D
2014-02-17
Up till 20 years ago, in order to endow molecules with function there were two mainstream lines of thought. One was to rationally design the positioning of chemical functionalities within candidate molecules, followed by an iterative synthesis-optimization process. The second was the use of a "brutal force" approach of combinatorial chemistry coupled with advanced screening for function. Although both methods provided important results, "rational design" often resulted in time-consuming efforts of modeling and synthesis only to find that the candidate molecule was not performing the designed job. "Combinatorial chemistry" suffered from a fundamental limitation related to the focusing of the libraries employed, often using lead compounds that limit its scope. Dynamic constitutional chemistry has developed as a combination of the two approaches above. Through the rational use of reversible chemical bonds together with a large plethora of precursor libraries, one is now able to build functional structures, ranging from quite simple molecules up to large polymeric structures. Thus, by introduction of the dynamic component within the molecular recognition processes, a new perspective of deciphering the world of the molecular events has aroused together with a new field of chemistry. Since its birth dynamic constitutional chemistry has continuously gained attention, in particular due to its ability to easily create from scratch outstanding molecular structures as well as the addition of adaptive features. The fundamental concepts defining the dynamic constitutional chemistry have been continuously extended to currently place it at the intersection between the supramolecular chemistry and newly defined adaptive chemistry, a pivotal feature towards evolutive chemistry.
Velocity fluctuation analysis via dynamic programming
Schlossberg, D. J.; Gupta, D. K.; Fonck, R. J.; McKee, G. R.; Shafer, M. W.
2006-10-15
A new method of calculating one-dimensional velocity fluctuations from spatially resolved density fluctuation measurements is presented. The algorithm uses vector-matching methods of dynamic programming that match structures, such as turbulent fluctuations, in two data sets. The associated time delay between data sets is estimated by determining an optimal path to transform one vector to another. This time-delay-estimation (TDE) method establishes a new benchmark for velocity analysis by achieving higher sensitivity and frequency response than previously developed methods, such as time-resolved cross correlations and wavelets. TDE has been successfully applied to beam emission spectroscopy measurements of density fluctuations to obtain poloidal flow fluctuations associated with such phenomena as the geodesic acoustic mode. The dynamic programming algorithm should allow extension to high frequency velocity fluctuations associated with underlying electrostatic potential and resulting ExB fluctuations.
Eradication of Ebola Based on Dynamic Programming
Zhu, Jia-Ming; Wang, Lu; Liu, Jia-Bao
2016-01-01
This paper mainly studies the eradication of the Ebola virus, proposing a scientific system, including three modules for the eradication of Ebola virus. Firstly, we build a basic model combined with nonlinear incidence rate and maximum treatment capacity. Secondly, we use the dynamic programming method and the Dijkstra Algorithm to set up M-S (storage) and several delivery locations in West Africa. Finally, we apply the previous results to calculate the total cost, production cost, storage cost, and shortage cost. PMID:27313655
Optimal spectral tracking--adapting to dynamic regime change.
Brittain, John-Stuart; Halliday, David M
2011-01-30
Real world data do not always obey the statistical restraints imposed upon them by sophisticated analysis techniques. In spectral analysis for instance, an ergodic process--the interchangeability of temporal for spatial averaging--is assumed for a repeat-trial design. Many evolutionary scenarios, such as learning and motor consolidation, do not conform to such linear behaviour and should be approached from a more flexible perspective. To this end we previously introduced the method of optimal spectral tracking (OST) in the study of trial-varying parameters. In this extension to our work we modify the OST routines to provide an adaptive implementation capable of reacting to dynamic transitions in the underlying system state. In so doing, we generalise our approach to characterise both slow-varying and rapid fluctuations in time-series, simultaneously providing a metric of system stability. The approach is first applied to a surrogate dataset and compared to both our original non-adaptive solution and spectrogram approaches. The adaptive OST is seen to display fast convergence and desirable statistical properties. All three approaches are then applied to a neurophysiological recording obtained during a study on anaesthetic monitoring. Local field potentials acquired from the posterior hypothalamic region of a deep brain stimulation patient undergoing anaesthesia were analysed. The characterisation of features such as response delay, time-to-peak and modulation brevity are considered.
Joint Chance-Constrained Dynamic Programming
NASA Technical Reports Server (NTRS)
Ono, Masahiro; Kuwata, Yoshiaki; Balaram, J. Bob
2012-01-01
This paper presents a novel dynamic programming algorithm with a joint chance constraint, which explicitly bounds the risk of failure in order to maintain the state within a specified feasible region. A joint chance constraint cannot be handled by existing constrained dynamic programming approaches since their application is limited to constraints in the same form as the cost function, that is, an expectation over a sum of one-stage costs. We overcome this challenge by reformulating the joint chance constraint into a constraint on an expectation over a sum of indicator functions, which can be incorporated into the cost function by dualizing the optimization problem. As a result, the primal variables can be optimized by a standard dynamic programming, while the dual variable is optimized by a root-finding algorithm that converges exponentially. Error bounds on the primal and dual objective values are rigorously derived. We demonstrate the algorithm on a path planning problem, as well as an optimal control problem for Mars entry, descent and landing. The simulations are conducted using a real terrain data of Mars, with four million discrete states at each time step.
A Dynamical System that Describes Vein Graft Adaptation and Failure
Garbey, Marc; Berceli, Scott A.
2013-01-01
Adaptation of vein bypass grafts to the mechanical stresses imposed by the arterial circulation is thought to be the primary determinant for lesion development, yet an understanding of how the various forces dictate local wall remodeling is lacking. We develop a dynamical system that summarizes the complex interplay between the mechanical environment and cell/matrix kinetics, ultimately dictating changes in the vein graft architecture. Based on a systematic mapping of the parameter space, three general remodeling response patterns are observed: 1) shear stabilized intimal thickening, 2) tension induced wall thinning and lumen expansion, and 3) tension stabilized wall thickening. Notable is our observation that the integration of multiple feedback mechanisms leads to a variety of non-linear responses that would be unanticipated by an analysis of each system component independently. This dynamic analysis supports the clinical observation that the majority of vein grafts proceed along an adaptive trajectory, where grafts dilate and mildly thicken in response to the increased tension and shear, but a small portion of the grafts demonstrate a maladaptive phenotype, where progressive inward remodeling and accentuated wall thickening lead to graft failure. PMID:23871714
Adaptation tunes cortical dynamics to a critical regime during vision
NASA Astrophysics Data System (ADS)
Shew, Woodrow; Clawson, Wesley; Pobst, Jeff; Karimipanah, Yahya; Wright, Nathaniel; Wessel, Ralf; Shew Lab Team; Wessel Lab Team
2015-03-01
A long-standing hypothesis at the interface of physics and neuroscience is that neural networks self-organize to the critical point of a phase transition, thereby optimizing aspects of sensory information processing. This idea is partially supported by strong evidence for critical dynamics observed in the cerebral cortex, but has not been tested in systems with significant sensory input. Thus, the foundations of this hypothesis - the self-organization process and how it manifests during strong sensory input - remain unstudied experimentally. Here we report microelectrode array measurements from visual cortex of turtles during visual stimulation of the retina. We show experimentally and in a computational model that strong sensory input initially elicits cortical network dynamics that are not critical, but adaptive changes in the network rapidly tune the system to criticality. This conclusion is based on observations of multifaceted scaling laws predicted to occur at criticality. Our findings establish sensory adaptation as a self-organizing mechanism which maintains criticality in visual cortex during sensory information processing. Supported by NSF CRCNS Grant 1308174.
An Adaptive Multipopulation Differential Evolution With Dynamic Population Reduction.
Ali, Mostafa Z; Awad, Noor H; Suganthan, Ponnuthurai Nagaratnam; Reynolds, Robert G
2016-10-25
Developing efficient evolutionary algorithms attracts many researchers due to the existence of optimization problems in numerous real-world applications. A new differential evolution algorithm, sTDE-dR, is proposed to improve the search quality, avoid premature convergence, and stagnation. The population is clustered in multiple tribes and utilizes an ensemble of different mutation and crossover strategies. In this algorithm, a competitive success-based scheme is introduced to determine the life cycle of each tribe and its participation ratio for the next generation. In each tribe, a different adaptive scheme is used to control the scaling factor and crossover rate. The mean success of each subgroup is used to calculate the ratio of its participation for the next generation. This guarantees that successful tribes with the best adaptive schemes are only the ones that guide the search toward the optimal solution. The population size is dynamically reduced using a dynamic reduction method. Comprehensive comparison of the proposed heuristic over a challenging set of benchmarks from the CEC2014 real parameter single objective competition against several state-of-the-art algorithms is performed. The results affirm robustness of the proposed approach compared to other state-of-the-art algorithms.
iAPBS: a programming interface to Adaptive Poisson-Boltzmann Solver
Konecny, Robert; Baker, Nathan A.; McCammon, J. A.
2012-07-26
The Adaptive Poisson-Boltzmann Solver (APBS) is a state-of-the-art suite for performing Poisson-Boltzmann electrostatic calculations on biomolecules. The iAPBS package provides a modular programmatic interface to the APBS library of electrostatic calculation routines. The iAPBS interface library can be linked with a Fortran or C/C++ program thus making all of the APBS functionality available from within the application. Several application modules for popular molecular dynamics simulation packages -- Amber, NAMD and CHARMM are distributed with iAPBS allowing users of these packages to perform implicit solvent electrostatic calculations with APBS.
Adaptive Optics Correction in Real-Time for Dynamic Wavefront Errors
1990-03-15
This paper reports on the principles for the use of, and the experimental results obtained from, an adaptive optics system for correcting dynamic...control system. Keywords: Adaptive optics ; Wavefront sensing; Deformable mirror; Chinese translations.
Glassy Dynamics in the Adaptive Immune Response Prevents Autoimmune Disease
NASA Astrophysics Data System (ADS)
Sun, Jun; Deem, Michael
2006-03-01
The immune system normally protects the human host against death by infection. However, when an immune response is mistakenly directed at self antigens, autoimmune disease can occur. We describe a model of protein evolution to simulate the dynamics of the adaptive immune response to antigens. Computer simulations of the dynamics of antibody evolution show that different evolutionary mechanisms, namely gene segment swapping and point mutation, lead to different evolved antibody binding affinities. Although a combination of gene segment swapping and point mutation can yield a greater affinity to a specific antigen than point mutation alone, the antibodies so evolved are highly cross-reactive and would cause autoimmune disease, and this is not the chosen dynamics of the immune system. We suggest that in the immune system a balance has evolved between binding affinity and specificity in the mechanism for searching the amino acid sequence space of antibodies. Our model predicts that chronic infection may lead to autoimmune disease as well due to cross-reactivity and suggests a broad distribution for the time of onset of autoimmune disease due to chronic exposure. The slow search of antibody sequence space by point mutation leads to the broad of distribution times.
Dynamic modeling and adaptive control for space stations
NASA Technical Reports Server (NTRS)
Ih, C. H. C.; Wang, S. J.
1985-01-01
Of all large space structural systems, space stations present a unique challenge and requirement to advanced control technology. Their operations require control system stability over an extremely broad range of parameter changes and high level of disturbances. During shuttle docking the system mass may suddenly increase by more than 100% and during station assembly the mass may vary even more drastically. These coupled with the inherent dynamic model uncertainties associated with large space structural systems require highly sophisticated control systems that can grow as the stations evolve and cope with the uncertainties and time-varying elements to maintain the stability and pointing of the space stations. The aspects of space station operational properties are first examined, including configurations, dynamic models, shuttle docking contact dynamics, solar panel interaction, and load reduction to yield a set of system models and conditions. A model reference adaptive control algorithm along with the inner-loop plant augmentation design for controlling the space stations under severe operational conditions of shuttle docking, excessive model parameter errors, and model truncation are then investigated. The instability problem caused by the zero-frequency rigid body modes and a proposed solution using plant augmentation are addressed. Two sets of sufficient conditions which guarantee the globablly asymptotic stability for the space station systems are obtained.
IOPA: I/O-aware parallelism adaption for parallel programs
Liu, Tao; Liu, Yi; Qian, Chen; Qian, Depei
2017-01-01
With the development of multi-/many-core processors, applications need to be written as parallel programs to improve execution efficiency. For data-intensive applications that use multiple threads to read/write files simultaneously, an I/O sub-system can easily become a bottleneck when too many of these types of threads exist; on the contrary, too few threads will cause insufficient resource utilization and hurt performance. Therefore, programmers must pay much attention to parallelism control to find the appropriate number of I/O threads for an application. This paper proposes a parallelism control mechanism named IOPA that can adjust the parallelism of applications to adapt to the I/O capability of a system and balance computing resources and I/O bandwidth. The programming interface of IOPA is also provided to programmers to simplify parallel programming. IOPA is evaluated using multiple applications with both solid state and hard disk drives. The results show that the parallel applications using IOPA can achieve higher efficiency than those with a fixed number of threads. PMID:28278236
Nonlinear adaptive trajectory tracking using dynamic neural networks.
Poznyak, A S; Yu, W; Sanchez, E N; Perez, J P
1999-01-01
In this paper the adaptive nonlinear identification and trajectory tracking are discussed via dynamic neural networks. By means of a Lyapunov-like analysis we determine stability conditions for the identification error. Then we analyze the trajectory tracking error by a local optimal controller. An algebraic Riccati equation and a differential one are used for the identification and the tracking error analysis. As our main original contributions, we establish two theorems: the first one gives a bound for the identification error and the second one establishes a bound for the tracking error. We illustrate the effectiveness of these results by two examples: the second-order relay system with multiple isolated equilibrium points and the chaotic system given by Duffing equation.
Algebraic Dynamic Programming over general data structures
2015-01-01
Background Dynamic programming algorithms provide exact solutions to many problems in computational biology, such as sequence alignment, RNA folding, hidden Markov models (HMMs), and scoring of phylogenetic trees. Structurally analogous algorithms compute optimal solutions, evaluate score distributions, and perform stochastic sampling. This is explained in the theory of Algebraic Dynamic Programming (ADP) by a strict separation of state space traversal (usually represented by a context free grammar), scoring (encoded as an algebra), and choice rule. A key ingredient in this theory is the use of yield parsers that operate on the ordered input data structure, usually strings or ordered trees. The computation of ensemble properties, such as a posteriori probabilities of HMMs or partition functions in RNA folding, requires the combination of two distinct, but intimately related algorithms, known as the inside and the outside recursion. Only the inside recursions are covered by the classical ADP theory. Results The ideas of ADP are generalized to a much wider scope of data structures by relaxing the concept of parsing. This allows us to formalize the conceptual complementarity of inside and outside variables in a natural way. We demonstrate that outside recursions are generically derivable from inside decomposition schemes. In addition to rephrasing the well-known algorithms for HMMs, pairwise sequence alignment, and RNA folding we show how the TSP and the shortest Hamiltonian path problem can be implemented efficiently in the extended ADP framework. As a showcase application we investigate the ancient evolution of HOX gene clusters in terms of shortest Hamiltonian paths. Conclusions The generalized ADP framework presented here greatly facilitates the development and implementation of dynamic programming algorithms for a wide spectrum of applications. PMID:26695390
Navigating sensory conflict in dynamic environments using adaptive state estimation.
Klein, Theresa J; Jeka, John; Kiemel, Tim; Lewis, M Anthony
2011-12-01
Most conventional robots rely on controlling the location of the center of pressure to maintain balance, relying mainly on foot pressure sensors for information. By contrast,humans rely on sensory data from multiple sources, including proprioceptive, visual, and vestibular sources. Several models have been developed to explain how humans reconcile information from disparate sources to form a stable sense of balance. These models may be useful for developing robots that are able to maintain dynamic balance more readily using multiple sensory sources. Since these information sources may conflict, reliance by the nervous system on any one channel can lead to ambiguity in the system state. In humans, experiments that create conflicts between different sensory channels by moving the visual field or the support surface indicate that sensory information is adaptively reweighted. Unreliable information is rapidly down-weighted,then gradually up-weighted when it becomes valid again.Human balance can also be studied by building robots that model features of human bodies and testing them under similar experimental conditions. We implement a sensory reweighting model based on an adaptive Kalman filter in abipedal robot, and subject it to sensory tests similar to those used on human subjects. Unlike other implementations of sensory reweighting in robots, our implementation includes vision, by using optic flow to calculate forward rotation using a camera (visual modality), as well as a three-axis gyro to represent the vestibular system (non-visual modality), and foot pressure sensors (proprioceptive modality). Our model estimates measurement noise in real time, which is then used to recompute the Kalman gain on each iteration, improving the ability of the robot to dynamically balance. We observe that we can duplicate many important features of postural sw ay in humans, including automatic sensory reweighting,effects, constant phase with respect to amplitude, and a temporal
Adaptive strategies in designing the simultaneous global drug development program.
Yuan, Zhilong; Chen, Gang; Huang, Qin
2016-01-01
Many methods have been proposed to account for the potential impact of ethnic/regional factors when extrapolating results from multiregional clinical trials (MRCTs) to targeted ethnic (TE) patients, i.e., "bridging." Most of them either focused on TE patients in the MRCT (i.e., internal bridging) or a separate local clinical trial (LCT) (i.e., external bridging). Huang et al. (2012) integrated both bridging concepts in their method for the Simultaneous Global Drug Development Program (SGDDP) which designs both the MRCT and the LCT prospectively and combines patients in both trials by ethnic origin, i.e., TE vs. non-TE (NTE). The weighted Z test was used to combine information from TE and NTE patients to test with statistical rigor whether a new treatment is effective in the TE population. Practically, the MRCT is often completed before the LCT. Thus to increase the power for the SGDDP and/or obtain more informative data in TE patients, we may use the final results from the MRCT to re-evaluate initial assumptions (e.g., effect sizes, variances, weight), and modify the LCT accordingly. We discuss various adaptive strategies for the LCT such as sample size reassessment, population enrichment, endpoint change, and dose adjustment. As an example, we extend a popular adaptive design method to re-estimate the sample size for the LCT, and illustrate it for a normally distributed endpoint.
Dynamic skeletal muscle stimulation and its potential in bone adaptation
Qin, Y-X.; Lam, H.; Ferreri, S.; Rubin, C.
2016-01-01
To identify mechanotransductive signals for combating musculoskeletal deterioration, it is essential to determine the components and mechanisms critical to the anabolic processes of musculoskeletal tissues. It is hypothesized that the interaction between bone and muscle may depend on fluid exchange in these tissues by mechanical loading. It has been shown that intramedullary pressure (ImP) and low-level bone strain induced by muscle stimulation (MS) has the potential to mitigate bone loss induced by disuse osteopenia. Optimized MS signals, i.e., low-intensity and high frequency, may be critical in maintaining bone mass and mitigating muscle atrophy. The objectives for this review are to discuss the potential for MS to induce ImP and strains on bone, to regulate bone adaptation, and to identify optimized stimulation frequency in the loading regimen. The potential for MS to regulate blood and fluid flow will also be discussed. The results suggest that oscillatory MS regulates fluid dynamics with minimal mechanical strain in bone. The response was shown to be dependent on loading frequency, serving as a critical mediator in mitigating bone loss. A specific regimen of dynamic MS may be optimized in vivo to attenuate disuse osteopenia and serve as a biomechanical intervention in the clinical setting. PMID:20190376
Runway Scheduling Using Generalized Dynamic Programming
NASA Technical Reports Server (NTRS)
Montoya, Justin; Wood, Zachary; Rathinam, Sivakumar
2011-01-01
A generalized dynamic programming method for finding a set of pareto optimal solutions for a runway scheduling problem is introduced. The algorithm generates a set of runway fight sequences that are optimal for both runway throughput and delay. Realistic time-based operational constraints are considered, including miles-in-trail separation, runway crossings, and wake vortex separation. The authors also model divergent runway takeoff operations to allow for reduced wake vortex separation. A modeled Dallas/Fort Worth International airport and three baseline heuristics are used to illustrate preliminary benefits of using the generalized dynamic programming method. Simulated traffic levels ranged from 10 aircraft to 30 aircraft with each test case spanning 15 minutes. The optimal solution shows a 40-70 percent decrease in the expected delay per aircraft over the baseline schedulers. Computational results suggest that the algorithm is promising for real-time application with an average computation time of 4.5 seconds. For even faster computation times, two heuristics are developed. As compared to the optimal, the heuristics are within 5% of the expected delay per aircraft and 1% of the expected number of runway operations per hour ad can be 100x faster.
Automated Flight Routing Using Stochastic Dynamic Programming
NASA Technical Reports Server (NTRS)
Ng, Hok K.; Morando, Alex; Grabbe, Shon
2010-01-01
Airspace capacity reduction due to convective weather impedes air traffic flows and causes traffic congestion. This study presents an algorithm that reroutes flights in the presence of winds, enroute convective weather, and congested airspace based on stochastic dynamic programming. A stochastic disturbance model incorporates into the reroute design process the capacity uncertainty. A trajectory-based airspace demand model is employed for calculating current and future airspace demand. The optimal routes minimize the total expected traveling time, weather incursion, and induced congestion costs. They are compared to weather-avoidance routes calculated using deterministic dynamic programming. The stochastic reroutes have smaller deviation probability than the deterministic counterpart when both reroutes have similar total flight distance. The stochastic rerouting algorithm takes into account all convective weather fields with all severity levels while the deterministic algorithm only accounts for convective weather systems exceeding a specified level of severity. When the stochastic reroutes are compared to the actual flight routes, they have similar total flight time, and both have about 1% of travel time crossing congested enroute sectors on average. The actual flight routes induce slightly less traffic congestion than the stochastic reroutes but intercept more severe convective weather.
ERIC Educational Resources Information Center
Olson, Jonathan R.; Welsh, Janet A.; Perkins, Daniel F.
2015-01-01
In this article, we describe how the recent movement towards evidence-based programming has impacted Extension. We review how the emphasis on implementing such programs with strict fidelity to an underlying program model may be at odds with Extension's strong history of adapting programming to meet the unique needs of children, youth, families,…
Simplified partial digest problem: enumerative and dynamic programming algorithms.
Blazewicz, Jacek; Burke, Edmund; Kasprzak, Marta; Kovalev, Alexandr; Kovalyov, Mikhail
2007-01-01
We study the Simplified Partial Digest Problem (SPDP), which is a mathematical model for a new simplified partial digest method of genome mapping. This method is easy for laboratory implementation and robust with respect to the experimental errors. SPDP is NP-hard in the strong sense. We present an $O(n2;n)$ time enumerative algorithm and an O(n(2q)) time dynamic programming algorithm for the error-free SPDP, where $n$ is the number of restriction sites and n is the number of distinct intersite distances. We also give examples of the problem, in which there are 2(n+2)/(3)-1 non-congruent solutions. These examples partially answer a question recently posed in the literature about the number of solutions of SPDP. We adapt our enumerative algorithm for handling SPDP with imprecise input data. Finally, we describe and discuss the results of the computer experiments with our algorithms.
Fostering Healthy Futures for Teens: Adaptation of an Evidence-Based Program
Taussig, Heather; Weiler, Lindsey; Rhodes, Tara; Hambrick, Erin; Wertheimer, Robyn; Fireman, Orah; Combs, Melody
2015-01-01
Objective This article describes the process of adapting and implementing a complex, multicomponent intervention for a new population. Specifically, the article delineates the development and implementation of the Fostering Healthy Futures for Teens (FHF-T) program, which is an adaptation and extension of the Fostering Healthy Futures® (FHF) preventive intervention. FHF is a 9-month mentoring and skills group program for 9 to 11 year olds recently placed in foster care. Following the designation of FHF as an evidence-based intervention, there was increasing demand for the program. However, the narrow population for which FHF had demonstrated efficacy limited broader implementation of the existing intervention. FHF-T was designed to extend the reach of the program by adapting the FHF intervention for adolescents in the early years of high school who have a history of out-of-home care. Specifically, this adaptation recognizes key developmental differences between preadolescent and adolescent populations. Method After designing a program model and adapting the program components, the FHF-T mentoring program was implemented with 42 youth over 2 program years. Results Of the teens who were offered the program, 75% chose to enroll, and 88% of those graduated 9 months later. Although the program evidenced high rates of uptake and participant satisfaction, some unexpected challenges were encountered that will need to be addressed in future iterations of the program. Conclusions Too often program adaptations are made without careful consideration of important contextual issues, and too infrequently, these adapted programs are studied. Our process of program adaptation with rigorous measurement of program implementation provides a useful model for other evidence-based programs seeking thoughtful adaptation. PMID:27019678
A mathematical programming approach for sequential clustering of dynamic networks
NASA Astrophysics Data System (ADS)
Silva, Jonathan C.; Bennett, Laura; Papageorgiou, Lazaros G.; Tsoka, Sophia
2016-02-01
A common analysis performed on dynamic networks is community structure detection, a challenging problem that aims to track the temporal evolution of network modules. An emerging area in this field is evolutionary clustering, where the community structure of a network snapshot is identified by taking into account both its current state as well as previous time points. Based on this concept, we have developed a mixed integer non-linear programming (MINLP) model, SeqMod, that sequentially clusters each snapshot of a dynamic network. The modularity metric is used to determine the quality of community structure of the current snapshot and the historical cost is accounted for by optimising the number of node pairs co-clustered at the previous time point that remain so in the current snapshot partition. Our method is tested on social networks of interactions among high school students, college students and members of the Brazilian Congress. We show that, for an adequate parameter setting, our algorithm detects the classes that these students belong more accurately than partitioning each time step individually or by partitioning the aggregated snapshots. Our method also detects drastic discontinuities in interaction patterns across network snapshots. Finally, we present comparative results with similar community detection methods for time-dependent networks from the literature. Overall, we illustrate the applicability of mathematical programming as a flexible, adaptable and systematic approach for these community detection problems. Contribution to the Topical Issue "Temporal Network Theory and Applications", edited by Petter Holme.
Thom, Ronald M.; Anderson, Michael G.; Tyre, Drew; Fleming, Craig A.
2009-02-28
The paper, “Adaptive Management: Background for Stakeholders in the Missouri River Recovery Program,” introduced the concept of adaptive management (AM), its principles and how they relate to one-another, how AM is applied, and challenges for its implementation. This companion paper describes how the AM principles were applied to specific management actions within the Missouri River Recovery Program to facilitate understanding, decision-making, and stakeholder engagement. For context, we begin with a brief synopsis of the Missouri River Recovery Program (MRRP) and the strategy for implementing adaptive management (AM) within the program; we finish with an example of AM in action within Phase I of the MRPP.
Versatile and declarative dynamic programming using pair algebras
Steffen, Peter; Giegerich, Robert
2005-01-01
Background Dynamic programming is a widely used programming technique in bioinformatics. In sharp contrast to the simplicity of textbook examples, implementing a dynamic programming algorithm for a novel and non-trivial application is a tedious and error prone task. The algebraic dynamic programming approach seeks to alleviate this situation by clearly separating the dynamic programming recurrences and scoring schemes. Results Based on this programming style, we introduce a generic product operation of scoring schemes. This leads to a remarkable variety of applications, allowing us to achieve optimizations under multiple objective functions, alternative solutions and backtracing, holistic search space analysis, ambiguity checking, and more, without additional programming effort. We demonstrate the method on several applications for RNA secondary structure prediction. Conclusion The product operation as introduced here adds a significant amount of flexibility to dynamic programming. It provides a versatile testbed for the development of new algorithmic ideas, which can immediately be put to practice. PMID:16156887
A Knowledge-Structure-Based Adaptive Dynamic Assessment System for Calculus Learning
ERIC Educational Resources Information Center
Ting, M.-Y.; Kuo, B.-C.
2016-01-01
The purpose of this study was to investigate the effect of a calculus system that was designed using an adaptive dynamic assessment (DA) framework on performance in the "finding an area using an integral". In this study, adaptive testing and dynamic assessment were combined to provide different test items depending on students'…
ERIC Educational Resources Information Center
Wu, Huey-Min; Kuo, Bor-Chen; Wang, Su-Chen
2017-01-01
In this study, a computerized dynamic assessment test with both immediately individualized feedback and adaptively property was applied to Mathematics learning in primary school. For evaluating the effectiveness of the computerized dynamic adaptive test, the performances of three types of remedial instructions were compared by a pre-test/post-test…
An adaptation of ACQI to calculate the data for MSXALPHA program
NASA Astrophysics Data System (ADS)
Klobukowski, M.
1982-01-01
Title of adaptation: ADAPT HFS FOR MSXALPHA Adaptation number: 0001 Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland (see application form in this issue) Reference to original program Cat. number: ACQI; Title: H.F.S. SELF-CONSISTENT FIELD; Ref. in CPC: 1 (1969) 216 Author of original program: J.-P. Desclaux Computer: Amdahl 470/V7; Installation: University of Alberta, Edmonton, Canada Operating system: MTS Programming language used in adapted program: FORTRAN IV High-speed core required: 75656 bytes Number of bits in a byte: 8 Peripherals used: card reader, line printer, disk No. of cards required to effect adaptation (including directive cards): 254 Card punching code: EBCDIC 027
Robot trajectory planning via dynamic programming
Dohrmann, C.R.; Robinett, R.D.
1994-03-01
The method of dynamic programming is applied to three example problems dealing with robot trajectory planning. The first two examples involve end-effector tracking of a straight line with rest-to-rest motions of planar two-link and three-link rigid robots. These examples illustrate the usefulness of the method for producing smooth trajectories either in the presence or absence of joint redundancies. The last example demonstrates the use of the method for rest-to-rest maneuvers of a single-link manipulator with a flexible payload. Simulation results for this example display interesting symmetries that are characteristic of such maneuvers. Details concerning the implementation and computational aspects of the method are discussed.
Cultural Adaptation of the Strengthening Families Program 10-14 to Italian Families
ERIC Educational Resources Information Center
Ortega, Enrique; Giannotta, Fabrizia; Latina, Delia; Ciairano, Silvia
2012-01-01
Background: The family context has proven to be a useful target in which to apply prevention efforts aimed at child and adolescent health risk behaviors. There are currently a variety of cultural adaptation models that serve to guide the international adaptation of intervention programs. Objective: The cultural adaptation process and program…
Pareto optimization in algebraic dynamic programming.
Saule, Cédric; Giegerich, Robert
2015-01-01
Pareto optimization combines independent objectives by computing the Pareto front of its search space, defined as the set of all solutions for which no other candidate solution scores better under all objectives. This gives, in a precise sense, better information than an artificial amalgamation of different scores into a single objective, but is more costly to compute. Pareto optimization naturally occurs with genetic algorithms, albeit in a heuristic fashion. Non-heuristic Pareto optimization so far has been used only with a few applications in bioinformatics. We study exact Pareto optimization for two objectives in a dynamic programming framework. We define a binary Pareto product operator [Formula: see text] on arbitrary scoring schemes. Independent of a particular algorithm, we prove that for two scoring schemes A and B used in dynamic programming, the scoring scheme [Formula: see text] correctly performs Pareto optimization over the same search space. We study different implementations of the Pareto operator with respect to their asymptotic and empirical efficiency. Without artificial amalgamation of objectives, and with no heuristics involved, Pareto optimization is faster than computing the same number of answers separately for each objective. For RNA structure prediction under the minimum free energy versus the maximum expected accuracy model, we show that the empirical size of the Pareto front remains within reasonable bounds. Pareto optimization lends itself to the comparative investigation of the behavior of two alternative scoring schemes for the same purpose. For the above scoring schemes, we observe that the Pareto front can be seen as a composition of a few macrostates, each consisting of several microstates that differ in the same limited way. We also study the relationship between abstract shape analysis and the Pareto front, and find that they extract information of a different nature from the folding space and can be meaningfully combined.
Adaptive control of unknown unstable steady states of dynamical systems.
Pyragas, K; Pyragas, V; Kiss, I Z; Hudson, J L
2004-08-01
A simple adaptive controller based on a low-pass filter to stabilize unstable steady states of dynamical systems is considered. The controller is reference-free; it does not require knowledge of the location of the fixed point in the phase space. A topological limitation similar to that of the delayed feedback controller is discussed. We show that the saddle-type steady states cannot be stabilized by using the conventional low-pass filter. The limitation can be overcome by using an unstable low-pass filter. The use of the controller is demonstrated for several physical models, including the pendulum driven by a constant torque, the Lorenz system, and an electrochemical oscillator. Linear and nonlinear analyses of the models are performed and the problem of the basins of attraction of the stabilized steady states is discussed. The robustness of the controller is demonstrated in experiments and numerical simulations with an electrochemical oscillator, the dissolution of nickel in sulfuric acid; a comparison of the effect of using direct and indirect variables in the control is made. With the use of the controller, all unstable phase-space objects are successfully reconstructed experimentally.
Adaptive optics optical coherence tomography with dynamic retinal tracking
Kocaoglu, Omer P.; Ferguson, R. Daniel; Jonnal, Ravi S.; Liu, Zhuolin; Wang, Qiang; Hammer, Daniel X.; Miller, Donald T.
2014-01-01
Adaptive optics optical coherence tomography (AO-OCT) is a highly sensitive and noninvasive method for three dimensional imaging of the microscopic retina. Like all in vivo retinal imaging techniques, however, it suffers the effects of involuntary eye movements that occur even under normal fixation. In this study we investigated dynamic retinal tracking to measure and correct eye motion at KHz rates for AO-OCT imaging. A customized retina tracking module was integrated into the sample arm of the 2nd-generation Indiana AO-OCT system and images were acquired on three subjects. Analyses were developed based on temporal amplitude and spatial power spectra in conjunction with strip-wise registration to independently measure AO-OCT tracking performance. After optimization of the tracker parameters, the system was found to correct eye movements up to 100 Hz and reduce residual motion to 10 µm root mean square. Between session precision was 33 µm. Performance was limited by tracker-generated noise at high temporal frequencies. PMID:25071963
Function-valued adaptive dynamics and optimal control theory.
Parvinen, Kalle; Heino, Mikko; Dieckmann, Ulf
2013-09-01
In this article we further develop the theory of adaptive dynamics of function-valued traits. Previous work has concentrated on models for which invasion fitness can be written as an integral in which the integrand for each argument value is a function of the strategy value at that argument value only. For this type of models of direct effect, singular strategies can be found using the calculus of variations, with singular strategies needing to satisfy Euler's equation with environmental feedback. In a broader, more mechanistically oriented class of models, the function-valued strategy affects a process described by differential equations, and fitness can be expressed as an integral in which the integrand for each argument value depends both on the strategy and on process variables at that argument value. In general, the calculus of variations cannot help analyzing this much broader class of models. Here we explain how to find singular strategies in this class of process-mediated models using optimal control theory. In particular, we show that singular strategies need to satisfy Pontryagin's maximum principle with environmental feedback. We demonstrate the utility of this approach by studying the evolution of strategies determining seasonal flowering schedules.
Plant toxicity, adaptive herbivory, and plant community dynamics
Feng, Z.; Liu, R.; DeAngelis, D.L.; Bryant, J.P.; Kielland, K.; Stuart, Chapin F.; Swihart, R.K.
2009-01-01
We model effects of interspecific plant competition, herbivory, and a plant's toxic defenses against herbivores on vegetation dynamics. The model predicts that, when a generalist herbivore feeds in the absence of plant toxins, adaptive foraging generally increases the probability of coexistence of plant species populations, because the herbivore switches more of its effort to whichever plant species is more common and accessible. In contrast, toxin-determined selective herbivory can drive plant succession toward dominance by the more toxic species, as previously documented in boreal forests and prairies. When the toxin concentrations in different plant species are similar, but species have different toxins with nonadditive effects, herbivores tend to diversify foraging efforts to avoid high intakes of any one toxin. This diversification leads the herbivore to focus more feeding on the less common plant species. Thus, uncommon plants may experience depensatory mortality from herbivory, reducing local species diversity. The depensatory effect of herbivory may inhibit the invasion of other plant species that are more palatable or have different toxins. These predictions were tested and confirmed in the Alaskan boreal forest. ?? 2009 Springer Science+Business Media, LLC.
Dynamics of adaptive immunity against phage in bacterial populations
NASA Astrophysics Data System (ADS)
Bradde, Serena; Vucelja, Marija; Tesileanu, Tiberiu; Balasubramanian, Vijay
The CRISPR (clustered regularly interspaced short palindromic repeats) mechanism allows bacteria to adaptively defend against phages by acquiring short genomic sequences (spacers) that target specific sequences in the viral genome. We propose a population dynamical model where immunity can be both acquired and lost. The model predicts regimes where bacterial and phage populations can co-exist, others where the populations oscillate, and still others where one population is driven to extinction. Our model considers two key parameters: (1) ease of acquisition and (2) spacer effectiveness in conferring immunity. Analytical calculations and numerical simulations show that if spacers differ mainly in ease of acquisition, or if the probability of acquiring them is sufficiently high, bacteria develop a diverse population of spacers. On the other hand, if spacers differ mainly in their effectiveness, their final distribution will be highly peaked, akin to a ``winner-take-all'' scenario, leading to a specialized spacer distribution. Bacteria can interpolate between these limiting behaviors by actively tuning their overall acquisition rate.
Adaptive optics optical coherence tomography with dynamic retinal tracking.
Kocaoglu, Omer P; Ferguson, R Daniel; Jonnal, Ravi S; Liu, Zhuolin; Wang, Qiang; Hammer, Daniel X; Miller, Donald T
2014-07-01
Adaptive optics optical coherence tomography (AO-OCT) is a highly sensitive and noninvasive method for three dimensional imaging of the microscopic retina. Like all in vivo retinal imaging techniques, however, it suffers the effects of involuntary eye movements that occur even under normal fixation. In this study we investigated dynamic retinal tracking to measure and correct eye motion at KHz rates for AO-OCT imaging. A customized retina tracking module was integrated into the sample arm of the 2nd-generation Indiana AO-OCT system and images were acquired on three subjects. Analyses were developed based on temporal amplitude and spatial power spectra in conjunction with strip-wise registration to independently measure AO-OCT tracking performance. After optimization of the tracker parameters, the system was found to correct eye movements up to 100 Hz and reduce residual motion to 10 µm root mean square. Between session precision was 33 µm. Performance was limited by tracker-generated noise at high temporal frequencies.
An Approximate Dynamic Programming Mode for Optimal MEDEVAC Dispatching
2015-03-26
An Approximate Dynamic Programming Model For MEDEVAC Dispatching THESIS MARCH 2015 Aaron J. Rettke, Captain, USA AFIT-ENS-MS-15-M-115 DEPARTMENT OF...and is not subject to copyright protection in the United States. AFIT-ENS-MS-15-M-115 AN APPROXIMATE DYNAMIC PROGRAMMING MODEL FOR MEDEVAC... APPROXIMATE DYNAMIC PROGRAMMING MODEL FOR MEDEVAC DISPATCHING THESIS Aaron J. Rettke, BS, MS Captain, USA Committee Membership: Lt Col Matthew J
Adaptive Competency Acquisition: Why LPN-to-ADN Career Mobility Education Programs Work.
ERIC Educational Resources Information Center
Coyle-Rogers, Patricia G.
Adaptive competencies are the skills required to effectively complete a particular task and are the congruencies (balance) between personal skills and task demands. The differences between the adaptive competency acquisition of students in licensed practical nurse (LPN) programs and associate degree nurse (ADN) programs were examined in a…
ERIC Educational Resources Information Center
Massachusetts Inst. of Tech., Cambridge. Dept. of Urban Studies and Planning.
The report of Project ADAPT (Aerospace and Defense Adaptation to Public Technology), describes the design, execution, and forthcoming evaluation of the program. The program's objective was to demonstrate the feasibility of redeploying surplus technical manpower into public service at State and local levels of government. The development of the…
Indoor human thermal adaptation: dynamic processes and weighting factors.
Luo, M; Cao, B; Ouyang, Q; Zhu, Y
2017-03-01
In this study, we explore the correlations between indoor climate change and human thermal adaptation, especially with regard to the timescale and weighting factors of physiological adaptation. A comparative experiment was conducted in China where wintertime indoor climate in the southern region (devoid of space heating) is much colder than in the northern region (with pervasive district heating). Four subject groups with different indoor thermal experiences participated in this climate chamber experiment. The results indicate that previous indoor thermal exposure is an important contributor to occupants' physiological adaptation. More specifically, subjects acclimated to neutral-warm indoors tended to have stronger physiological responses and felt more uncomfortable in moderate cold exposures than those adapted to the cold. As for the driving force of thermal adaptation, physiological acclimation is an important aspect among all the supposed adaptive layers. However, the physiological adaptation speed lags behind changes in the overall subjective perception.
Genetic adaptation to captivity in species conservation programs.
Frankham, Richard
2008-01-01
As wild environments are often inhospitable, many species have to be captive-bred to save them from extinction. In captivity, species adapt genetically to the captive environment and these genetic adaptations are overwhelmingly deleterious when populations are returned to wild environments. I review empirical evidence on (i) the genetic basis of adaptive changes in captivity, (ii) factors affecting the extent of genetic adaptation to captivity, and (iii) means for minimizing its deleterious impacts. Genetic adaptation to captivity is primarily due to rare alleles that in the wild were deleterious and partially recessive. The extent of adaptation to captivity depends upon selection intensity, genetic diversity, effective population size and number of generation in captivity, as predicted by quantitative genetic theory. Minimizing generations in captivity provides a highly effective means for minimizing genetic adaptation to captivity, but is not a practical option for most animal species. Population fragmentation and crossing replicate captive populations provide practical means for minimizing the deleterious effects of genetic adaptation to captivity upon populations reintroduced into the wild. Surprisingly, equalization of family sizes reduces the rate of genetic adaptation, but not the deleterious impacts upon reintroduced populations. Genetic adaptation to captivity is expected to have major effects on reintroduction success for species that have spent many generations in captivity. This issue deserves a much higher priority than it is currently receiving.
A Simulation Program for Dynamic Infrared (IR) Spectra
ERIC Educational Resources Information Center
Zoerb, Matthew C.; Harris, Charles B.
2013-01-01
A free program for the simulation of dynamic infrared (IR) spectra is presented. The program simulates the spectrum of two exchanging IR peaks based on simple input parameters. Larger systems can be simulated with minor modifications. The program is available as an executable program for PCs or can be run in MATLAB on any operating system. Source…
ALEGRA -- A massively parallel h-adaptive code for solid dynamics
Summers, R.M.; Wong, M.K.; Boucheron, E.A.; Weatherby, J.R.
1997-12-31
ALEGRA is a multi-material, arbitrary-Lagrangian-Eulerian (ALE) code for solid dynamics designed to run on massively parallel (MP) computers. It combines the features of modern Eulerian shock codes, such as CTH, with modern Lagrangian structural analysis codes using an unstructured grid. ALEGRA is being developed for use on the teraflop supercomputers to conduct advanced three-dimensional (3D) simulations of shock phenomena important to a variety of systems. ALEGRA was designed with the Single Program Multiple Data (SPMD) paradigm, in which the mesh is decomposed into sub-meshes so that each processor gets a single sub-mesh with approximately the same number of elements. Using this approach the authors have been able to produce a single code that can scale from one processor to thousands of processors. A current major effort is to develop efficient, high precision simulation capabilities for ALEGRA, without the computational cost of using a global highly resolved mesh, through flexible, robust h-adaptivity of finite elements. H-adaptivity is the dynamic refinement of the mesh by subdividing elements, thus changing the characteristic element size and reducing numerical error. The authors are working on several major technical challenges that must be met to make effective use of HAMMER on MP computers.
Adaptive inverse control of linear and nonlinear systems using dynamic neural networks.
Plett, G L
2003-01-01
In this paper, we see adaptive control as a three-part adaptive-filtering problem. First, the dynamical system we wish to control is modeled using adaptive system-identification techniques. Second, the dynamic response of the system is controlled using an adaptive feedforward controller. No direct feedback is used, except that the system output is monitored and used by an adaptive algorithm to adjust the parameters of the controller. Third, disturbance canceling is performed using an additional adaptive filter. The canceler does not affect system dynamics, but feeds back plant disturbance in a way that minimizes output disturbance power. The techniques work to control minimum-phase or nonminimum-phase, linear or nonlinear, single-input-single-output (SISO) or multiple-input-multiple-ouput (MIMO), stable or stabilized systems. Constraints may additionally be placed on control effort for a practical implementation. Simulation examples are presented to demonstrate that the proposed methods work very well.
Facilitating adaptive management in a government program: A household energy efficiency case study.
Curtis, Jim; Graham, Alex; Ghafoori, Eraj; Pyke, Susan; Kaufman, Stefan; Boulet, Mark
2017-02-01
Interim evaluations of government programs can sometimes reveal lower than expected outcomes, leading to the question of how adjustments can be made while the program is still underway. Although adaptive management frameworks can provide a practical roadmap to address this question, a lack of successful learnings and poor implementation have hampered the progress and wider application of adaptive management. Using a case study involving an energy efficiency government program targeting low-income households, this article provides supporting evidence on how adaptive management can be facilitated and applied. Factors such as proactive and responsive leadership, establishing a research-practice interface, and recognizing the skills, expertise, and contributions of multiple stakeholders guided adjustments to the program, and later paved the way for longer-term organizational learning that impacted how other programs are delivered. Implications for knowledge and practice, and a discussion of the challenges faced in the program, advance current thinking in adaptive management.
Adaptive control in the presence of unmodeled dynamics. Ph.D. Thesis
NASA Technical Reports Server (NTRS)
Rohrs, C. E.
1982-01-01
Stability and robustness properties of a wide class of adaptive control algorithms in the presence of unmodeled dynamics and output disturbances were investigated. The class of adaptive algorithms considered are those commonly referred to as model reference adaptive control algorithms, self-tuning controllers, and dead beat adaptive controllers, developed for both continuous-time systems and discrete-time systems. A unified analytical approach was developed to examine the class of existing adaptive algorithms. It was discovered that all existing algorithms contain an infinite gain operator in the dynamic system that defines command reference errors and parameter errors; it is argued that such an infinite gain operator appears to be generic to all adaptive algorithms, whether they exhibit explicit or implicit parameter identification. It is concluded that none of the adaptive algorithms considered can be used with confidence in a practical control system design, because instability will set in with a high probability.
Adaptive fusion of infrared and visible images in dynamic scene
NASA Astrophysics Data System (ADS)
Yang, Guang; Yin, Yafeng; Man, Hong; Desai, Sachi
2011-11-01
Multiple modalities sensor fusion has been widely employed in various surveillance and military applications. A variety of image fusion techniques including PCA, wavelet, curvelet and HSV has been proposed in recent years to improve human visual perception for object detection. One of the main challenges for visible and infrared image fusion is to automatically determine an optimal fusion strategy for different input scenes along with an acceptable computational cost. This paper, we propose a fast and adaptive feature selection based image fusion method to obtain high a contrast image from visible and infrared sensors for targets detection. At first, fuzzy c-means clustering is applied on the infrared image to highlight possible hotspot regions, which will be considered as potential targets' locations. After that, the region surrounding the target area is segmented as the background regions. Then image fusion is locally applied on the selected target and background regions by computing different linear combination of color components from registered visible and infrared images. After obtaining different fused images, histogram distributions are computed on these local fusion images as the fusion feature set. The variance ratio which is based on Linear Discriminative Analysis (LDA) measure is employed to sort the feature set and the most discriminative one is selected for the whole image fusion. As the feature selection is performed over time, the process will dynamically determine the most suitable feature for the image fusion in different scenes. Experiment is conducted on the OSU Color-Thermal database, and TNO Human Factor dataset. The fusion results indicate that our proposed method achieved a competitive performance compared with other fusion algorithms at a relatively low computational cost.
Learning to adapt: Dynamics of readaptation to geometrical distortions.
Yehezkel, Oren; Sagi, Dov; Sterkin, Anna; Belkin, Michael; Polat, Uri
2010-07-21
The visual system can adapt to optical blur, whereby the adapted image is perceived as sharp. Here we show that adaptation reduces blur-induced biases in shape perception, with repeated adaptations (perceptual learning), leading to unbiased perception upon re-exposure to blur. Observers wore a cylindrical lens of +1.00 D on one eye, thus simulating monocular astigmatism. The other eye was either masked with a translucent blurred lens (monocular) or unmasked (dichoptic). Adaptation was tested in several repeated sessions with a proximity-grouping task, using horizontally or vertically arranged dot-arrays, without feedback, before, after, and throughout the adaptation period. A robust bias in global-orientation judgment was observed with the lens, in accordance with the blur axes. After the observer wore the lens for 2 h, there was no significant change in the bias, but after 4 h, the monocular condition, but not the dichoptic, resulted in reduced bias. The adaptation effect of the monocular 4-h adaptation was preserved, and even improved, when the lens was re-applied the next day, indicating learning. After-effects were observed under all experimental conditions except for the 4-h monocular condition, where learning took place. We suggest that, with long experience, adaptation is transferred to a long-term memory that can be instantly engaged when blur is re-applied, or disengaged when blur is removed, thus leaving no after-effects. The comparison between the monocular and dichoptic conditions indicates a binocular cortical site of plasticity.
University of Rhode Island Adapted Aquatics Program Manual. Second Edition.
ERIC Educational Resources Information Center
Bloomquist, Lorraine E.
This manual provides guidelines for aquatic teachers of people with disabilities. It is based on experience in teaching American Red Cross Adapted Aquatics and is to be used to complement and accompany the Red Cross Adapted Aquatics materials. Emphasis is placed on successful experiences in a positive, safe, reinforcing environment stressing…
Time-and-Spatially Adapting Simulations for Efficient Dynamic Stall Predictions
2015-09-01
SIMULATIONS FOR EFFICIENTDYNAMIC STALL PREDICTIONS The ability to accurately and efficiently predict the occurrence and severity of dynamic stall...The ability to accurately and efficiently predict the occurrence and severity of dynamic stall remains a major roadblock in the design and analysis...SPATIALLY ADAPTING SIMULATIONS FOR EFFICIENT DYNAMIC STALL PREDICTIONS Marilyn J. Smith Professor Georgia Tech Rohit Jain Aerospace Engineer US Army
Integrated Network Decompositions and Dynamic Programming for Graph Optimization (INDDGO)
2012-05-31
The INDDGO software package offers a set of tools for finding exact solutions to graph optimization problems via tree decompositions and dynamic programming algorithms. Currently the framework offers serial and parallel (distributed memory) algorithms for finding tree decompositions and solving the maximum weighted independent set problem. The parallel dynamic programming algorithm is implemented on top of the MADNESS task-based runtime.
Students' Adaptation in the Social and Cultural Dynamics
ERIC Educational Resources Information Center
Sadyrin, Vladimir Vitalievich; Potapova, Marina Vladimirovna; Gnatyshina, Elena Alexandrovna; Uvarina, Nataliya Viktorovna; Danilova, Viktoriya Valerievna
2016-01-01
Modern scientific literature views issues on adaptation based on various aspects: biological, medical, pedagogical, sociological, cybernetic, interdisciplinary, etc. The given article is devoted to the analysis of the problem of adaptation as social and psychological phenomenon including peculiarities of its functioning in the conditions of social…
Dynamic Adaptive Runtime Systems for Advanced Multipole Method-based Science Achievement
NASA Astrophysics Data System (ADS)
Debuhr, Jackson; Anderson, Matthew; Sterling, Thomas; Zhang, Bo
2015-04-01
Multipole methods are a key computational kernel for a large class of scientific applications spanning multiple disciplines. Yet many of these applications are strong scaling constrained when using conventional programming practices. Hardware parallelism continues to grow, emphasizing medium and fine-grained thread parallelism rather than the coarse-grained process parallelism favored by conventional programming practices. Emerging, dynamic task management execution models can go beyond these conventional practices to significantly improve both efficiency and scalability for algorithms like multipole methods which exhibit irregular and time-varying execution properties. We present a new scientific library, DASHMM, built on the ParalleX HPX-5 runtime system, which explores the use of dynamic adaptive runtime techniques to improve scalability and efficiency for multipole-method based scientific computing. DASHMM allows application scientists to rapidly create custom, scalable, and efficient multipole methods, especially targeting the Fast Multipole Method and the Barnes-Hut N-body algorithm. After a discussion of the system and its goals, some application examples will be presented.
Evolution of taxis responses in virtual bacteria: non-adaptive dynamics.
Goldstein, Richard A; Soyer, Orkun S
2008-05-23
Bacteria are able to sense and respond to a variety of external stimuli, with responses that vary from stimuli to stimuli and from species to species. The best-understood is chemotaxis in the model organism Escherichia coli, where the dynamics and the structure of the underlying pathway are well characterised. It is not clear, however, how well this detailed knowledge applies to mechanisms mediating responses to other stimuli or to pathways in other species. Furthermore, there is increasing experimental evidence that bacteria integrate responses from different stimuli to generate a coherent taxis response. We currently lack a full understanding of the different pathway structures and dynamics and how this integration is achieved. In order to explore different pathway structures and dynamics that can underlie taxis responses in bacteria, we perform a computational simulation of the evolution of taxis. This approach starts with a population of virtual bacteria that move in a virtual environment based on the dynamics of the simple biochemical pathways they harbour. As mutations lead to changes in pathway structure and dynamics, bacteria better able to localise with favourable conditions gain a selective advantage. We find that a certain dynamics evolves consistently under different model assumptions and environments. These dynamics, which we call non-adaptive dynamics, directly couple tumbling probability of the cell to increasing stimuli. Dynamics that are adaptive under a wide range of conditions, as seen in the chemotaxis pathway of E. coli, do not evolve in these evolutionary simulations. However, we find that stimulus scarcity and fluctuations during evolution results in complex pathway dynamics that result both in adaptive and non-adaptive dynamics depending on basal stimuli levels. Further analyses of evolved pathway structures show that effective taxis dynamics can be mediated with as few as two components. The non-adaptive dynamics mediating taxis responses
Yang, Cheng-Hsiung; Wu, Cheng-Lin
2014-01-01
An adaptive control scheme is developed to study the generalized adaptive chaos synchronization with uncertain chaotic parameters behavior between two identical chaotic dynamic systems. This generalized adaptive chaos synchronization controller is designed based on Lyapunov stability theory and an analytic expression of the adaptive controller with its update laws of uncertain chaotic parameters is shown. The generalized adaptive synchronization with uncertain parameters between two identical new Lorenz-Stenflo systems is taken as three examples to show the effectiveness of the proposed method. The numerical simulations are shown to verify the results. PMID:25295292
Long-time atomistic dynamics through a new self-adaptive accelerated molecular dynamics method
NASA Astrophysics Data System (ADS)
Gao, N.; Yang, L.; Gao, F.; Kurtz, R. J.; West, D.; Zhang, S.
2017-04-01
A self-adaptive accelerated molecular dynamics method is developed to model infrequent atomic-scale events, especially those events that occur on a rugged free-energy surface. Key in the new development is the use of the total displacement of the system at a given temperature to construct a boost-potential, which is slowly increased to accelerate the dynamics. The temperature is slowly increased to accelerate the dynamics. By allowing the system to evolve from one steady-state configuration to another by overcoming the transition state, this self-evolving approach makes it possible to explore the coupled motion of species that migrate on vastly different time scales. The migrations of single vacancy (V) and small He-V clusters, and the growth of nano-sized He-V clusters in Fe for times in the order of seconds are studied by this new method. An interstitial-assisted mechanism is first explored for the migration of a helium-rich He-V cluster, while a new two-component Ostwald ripening mechanism is suggested for He-V cluster growth.
Long-time atomistic dynamics through a new self-adaptive accelerated molecular dynamics method.
Gao, N; Yang, L; Gao, F; Kurtz, R J; West, D; Zhang, S
2017-04-12
A self-adaptive accelerated molecular dynamics method is developed to model infrequent atomic-scale events, especially those events that occur on a rugged free-energy surface. Key in the new development is the use of the total displacement of the system at a given temperature to construct a boost-potential, which is slowly increased to accelerate the dynamics. The temperature is slowly increased to accelerate the dynamics. By allowing the system to evolve from one steady-state configuration to another by overcoming the transition state, this self-evolving approach makes it possible to explore the coupled motion of species that migrate on vastly different time scales. The migrations of single vacancy (V) and small He-V clusters, and the growth of nano-sized He-V clusters in Fe for times in the order of seconds are studied by this new method. An interstitial-assisted mechanism is first explored for the migration of a helium-rich He-V cluster, while a new two-component Ostwald ripening mechanism is suggested for He-V cluster growth.
Adapting a Multifaceted U.S. HIV Prevention Education Program for Girls in Ghana
ERIC Educational Resources Information Center
Fiscian, Vivian Sarpomaa; Obeng, E. Kwame; Goldstein, Karen; Shea, Judy A.; Turner, Barbara J.
2009-01-01
We adapted a U.S. HIV prevention program to address knowledge gaps and cultural pressures that increase the risk of infection in adolescent Ghanaian girls. The theory-based nine-module HIV prevention program combines didactics and games, an interactive computer program about sugar daddies, and tie-and-dye training to demonstrate an economic…
Multicriteria adaptation of robotic groups to dynamically changing conditions
NASA Astrophysics Data System (ADS)
Misyurin, S. Yu; Nelyubin, A. P.; Ivlev, V. I.
2017-01-01
A new approach is proposed to design complex robotic systems composed of many robots that can operate under different conditions and perform various tasks. Bio-inspired ideas of adaptation of robotic groups are discussed.
Dynamics modeling and adaptive control of flexible manipulators
NASA Technical Reports Server (NTRS)
Sasiadek, J. Z.
1991-01-01
An application of Model Reference Adaptive Control (MRAC) to the position and force control of flexible manipulators and robots is presented. A single-link flexible manipulator is analyzed. The problem was to develop a mathematical model of a flexible robot that is accurate. The objective is to show that the adaptive control works better than 'conventional' systems and is suitable for flexible structure control.
ERIC Educational Resources Information Center
Benseler, David P., Ed.
This collection papers begins with "Introduction: The Dynamics of Successful Leadership in Foreign Language Programs," then features the following: "The Undergraduate Program: Autonomy and Empowerment" (Wilga M. Rivers); "TA Supervision: Are We Preparing a Future Professoriate?" (Cathy Pons); "Applied Scholarship…
Adapting Physical Education: A Guide for Individualizing Physical Education Programs.
ERIC Educational Resources Information Center
Buckanavage, Robert, Ed.; And Others
Guidelines are presented for organizing programs and modifying activities in physical education programs for children with a wide range of physical and emotional disabilities. The guidelines should result in a program that allows students to work to their maximum potential within the framework of regular physical education classes. In planning the…
Sims, Katharine R E; Alix-Garcia, Jennifer M; Shapiro-Garza, Elizabeth; Fine, Leah R; Radeloff, Volker C; Aronson, Glen; Castillo, Selene; Ramirez-Reyes, Carlos; Yañez-Pagans, Patricia
2014-10-01
Natural resource managers are often expected to achieve both environmental protection and economic development even when there are fundamental trade-offs between these goals. Adaptive management provides a theoretical structure for program administrators to balance social priorities in the presence of trade-offs and to improve conservation targeting. We used the case of Mexico's federal Payments for Hydrological Services program (PSAH) to illustrate the importance of adaptive management for improving program targeting. We documented adaptive elements of PSAH and corresponding changes in program eligibility and selection criteria. To evaluate whether these changes resulted in enrollment of lands of high environmental and social priority, we compared the environmental and social characteristics of the areas enrolled in the program with the characteristics of all forested areas in Mexico, all areas eligible for the program, and all areas submitted for application to the program. The program successfully enrolled areas of both high ecological and social priority, and over time, adaptive changes in the program's criteria for eligibility and selection led to increased enrollment of land scoring high on both dimensions. Three factors facilitated adaptive management in Mexico and are likely to be generally important for conservation managers: a supportive political environment, including financial backing and encouragement to experiment from the federal government; availability of relatively good social and environmental data; and active participation in the review process by stakeholders and outside evaluators.
Stochastic Dynamic Mixed-Integer Programming (SD-MIP)
2015-05-05
door to stochastic optimization models, which are typically dynamic in nature. This project lays the foundation for stochastic dynamic mixed...project lays the foundation for stochastic dynamic mixed-integer and linear programming (SD-MIP). This project has produced several new ideas in...models. Recent research has opened the door to stochastic optimization models, which are typically dynamic in nature. This project lays the foundation for
Adapting GNU random forest program for Unix and Windows
NASA Astrophysics Data System (ADS)
Jirina, Marcel; Krayem, M. Said; Jirina, Marcel, Jr.
2013-10-01
The Random Forest is a well-known method and also a program for data clustering and classification. Unfortunately, the original Random Forest program is rather difficult to use. Here we describe a new version of this program originally written in Fortran 77. The modified program in Fortran 95 needs to be compiled only once and information for different tasks is passed with help of arguments. The program was tested with 24 data sets from UCI MLR and results are available on the net.
2014-01-01
Background Anastrepha fraterculus is one of the most important fruit fly plagues in the American continent and only chemical control is applied in the field to diminish its population densities. A better understanding of the genetic variability during the introduction and adaptation of wild A. fraterculus populations to laboratory conditions is required for the development of stable and vigorous experimental colonies and mass-reared strains in support of successful Sterile Insect Technique (SIT) efforts. Methods The present study aims to analyze the dynamics of changes in genetic variability during the first six generations under artificial rearing conditions in two populations: a) a wild population recently introduced to laboratory culture, named TW and, b) a long-established control line, named CL. Results Results showed a declining tendency of genetic variability in TW. In CL, the relatively high values of genetic variability appear to be maintained across generations and could denote an intrinsic capacity to avoid the loss of genetic diversity in time. Discussion The impact of evolutionary forces on this species during the adaptation process as well as the best approach to choose strategies to introduce experimental and mass-reared A. fraterculus strains for SIT programs are discussed. PMID:25471362
Kampfner, Roberto R
2006-07-01
The structure of a system influences its adaptability. An important result of adaptability theory is that subsystem independence increases adaptability [Conrad, M., 1983. Adaptability. Plenum Press, New York]. Adaptability is essential in systems that face an uncertain environment such as biological systems and organizations. Modern organizations are the product of human design. And so it is their structure and the effect that it has on their adaptability. In this paper we explore the potential effects of computer-based information processing on the adaptability of organizations. The integration of computer-based processes into the dynamics of the functions they support and the effect it has on subsystem independence are especially relevant to our analysis.
ADAPT: A Piagetian-based Program for College Freshmen, University of Nebraska-Lincoln.
ERIC Educational Resources Information Center
Nebraska Univ., Lincoln.
College students need a learning environment that encourages them to develop their reasoning abilities, as well as to master course content. This booklet discusses an attempt to create such an environment: the ADAPT program at the University of Nebraska. ADAPT, Accent on Developing Abstract Processes of Thought, is a comprehensive,…
Atkinson, A.J.; Trenham, P.C.; Fisher, R.N.; Hathaway, S.A.; Johnson, B.S.; Torres, S.G.; Moore, Y.C.
2004-01-01
critical management uncertainties; and 3) implementing long-term monitoring and adaptive management. Ultimately, the success of regional conservation planning depends on the ability of monitoring programs to confront the challenges of adaptively managing and monitoring complex ecosystems and diverse arrays of sensitive species.
An Extension Education Program to Help Local Governments with Flood Adaptation
ERIC Educational Resources Information Center
Gary, Gretchen; Allred, Shorna; LoGiudice, Elizabeth
2014-01-01
Education is an important tool to increase the capacity of local government officials for community flood adaptation. To address flood adaptation and post-flood stream management in municipalities, Cornell Cooperative Extension and collaborators developed an educational program to increase municipal officials' knowledge about how to work…
A Theory of Secondary Teachers' Adaptations When Implementing a Reading Intervention Program
ERIC Educational Resources Information Center
Leko, Melinda M.; Roberts, Carly A.; Pek, Yvonne
2015-01-01
This study examined the causes and consequences of secondary teachers' adaptations when implementing a research-based reading intervention program. Interview, observation, and artifact data were collected on five middle school intervention teachers, leading to a grounded theory composed of the core component, reconciliation through adaptation, and…
2015-04-02
Sequence 03705-001B 30 September 1991 (3 SOFTWARE TECHNOLOGY FOR ADAPTABLE, RELIABLE SYSTEMS ( STARS ) PROGRAM ELEGTE m AUG15 1991 Ö I 0 SPMS Training...September 1991 SOFTWARE TECHNOLOGY FOR ADAPTABLE, RELIABLE SYSTEMS ( STARS ) PROGRAM SPMS Training Class: Student Handout Addendum to: Software...document is the student handout prepared for the "SEI/ STARS P.3 Asset Acquisition Sub-task" training class. The student handout covers basic aspects
Techniques for grid manipulation and adaptation. [computational fluid dynamics
NASA Technical Reports Server (NTRS)
Choo, Yung K.; Eisemann, Peter R.; Lee, Ki D.
1992-01-01
Two approaches have been taken to provide systematic grid manipulation for improved grid quality. One is the control point form (CPF) of algebraic grid generation. It provides explicit control of the physical grid shape and grid spacing through the movement of the control points. It works well in the interactive computer graphics environment and hence can be a good candidate for integration with other emerging technologies. The other approach is grid adaptation using a numerical mapping between the physical space and a parametric space. Grid adaptation is achieved by modifying the mapping functions through the effects of grid control sources. The adaptation process can be repeated in a cyclic manner if satisfactory results are not achieved after a single application.
PSF halo reduction in adaptive optics using dynamic pupil masking.
Osborn, James; Myers, Richard M; Love, Gordon D
2009-09-28
We describe a method to reduce residual speckles in an adaptive optics system which add to the halo of the point spread function (PSF). The halo is particularly problematic in astronomical applications involving the detection of faint companions. Areas of the pupil are selected where the residual wavefront aberrations are large and these are masked using a spatial light modulator. The method is also suitable for smaller telescopes without adaptive optics as a relatively simple method to increase the resolution of the telescope. We describe the principle of the technique and show simulation results.
University of Rhode Island Adapted Aquatics Program Manual.
ERIC Educational Resources Information Center
Scraba, Paula J.; Bloomquist, Lorraine E.
An overview is presented of the aquatics course, adapted for persons with disabilities, at the University of Rhode Island. A description of the course includes information on course requirements, objectives, content and learning activities, assignments, modules used in the course, and a course syllabus. A description of the course organization and…
Computer Adaptive Testing for Small Scale Programs and Instructional Systems
ERIC Educational Resources Information Center
Rudner, Lawrence M.; Guo, Fanmin
2011-01-01
This study investigates measurement decision theory (MDT) as an underlying model for computer adaptive testing when the goal is to classify examinees into one of a finite number of groups. The first analysis compares MDT with a popular item response theory model and finds little difference in terms of the percentage of correct classifications. The…
Community Programs, Sport Clubs, and Clinics for Adapted Sports
ERIC Educational Resources Information Center
Hunter, Darlene
2012-01-01
Community programs associated with the Paralympic movement provide recreational or competitive opportunities for individuals with a disability who wish to participate in a sport or leisure activity. These community programs provide the background knowledge and specialized equipment needed for individuals with disabilities to participate safely and…
A Rural Special Education Teacher Training Program: Successful Adaptations.
ERIC Educational Resources Information Center
Prater, Greg; And Others
The Rural Special Education Program (RSEP), a partnership between Northern Arizona University (NAU) and Kayenta Unified School District (KUSD), provides training for preservice special education teachers to work with Native American students and their families. To date, the program has provided training for 63 preservice special education…
ADAPTING A BEGINNING READING PROGRAM FOR SPANISH-SPEAKING CHILDREN.
ERIC Educational Resources Information Center
MCNEIL, JOHN D.
A BEGINNING READING PROGRAM FOR SPANISH-SPEAKING CHILDREN IS REPORTED. A STUDY, SPONSORED BY THE SOUTHWEST REGIONAL LABORATORY FOR EDUCATIONAL RESEARCH AND DEVELOPMENT (SWRL), DEVELOPED LEARNING SEQUENCES FOR A BEGINNING READING PROGRAM FOR KINDERGARTEN CLASSROOMS WITH SPANISH-SPEAKING CHILDREN THROUGHOUT THE SOUTHWEST REGION. EACH OF 21 10-MINUTE…
Yoo, Sung Jin; Park, Jin Bae; Choi, Yoon Ho
2006-12-01
A new method for the robust control of flexible-joint (FJ) robots with model uncertainties in both robot dynamics and actuator dynamics is proposed. The proposed control system is a combination of the adaptive dynamic surface control (DSC) technique and the self-recurrent wavelet neural network (SRWNN). The adaptive DSC technique provides the ability to overcome the "explosion of complexity" problem in backstepping controllers. The SRWNNs are used to observe the arbitrary model uncertainties of FJ robots, and all their weights are trained online. From the Lyapunov stability analysis, their adaptation laws are induced, and the uniformly ultimately boundedness of all signals in a closed-loop adaptive system is proved. Finally, simulation results for a three-link FJ robot are utilized to validate the good position tracking performance and robustness against payload uncertainties and external disturbances of the proposed control system.
Mega-evolutionary dynamics of the adaptive radiation of birds.
Cooney, Christopher R; Bright, Jen A; Capp, Elliot J R; Chira, Angela M; Hughes, Emma C; Moody, Christopher J A; Nouri, Lara O; Varley, Zoë K; Thomas, Gavin H
2017-02-16
The origin and expansion of biological diversity is regulated by both developmental trajectories and limits on available ecological niches. As lineages diversify, an early and often rapid phase of species and trait proliferation gives way to evolutionary slow-downs as new species pack into ever more densely occupied regions of ecological niche space. Small clades such as Darwin's finches demonstrate that natural selection is the driving force of adaptive radiations, but how microevolutionary processes scale up to shape the expansion of phenotypic diversity over much longer evolutionary timescales is unclear. Here we address this problem on a global scale by analysing a crowdsourced dataset of three-dimensional scanned bill morphology from more than 2,000 species. We find that bill diversity expanded early in extant avian evolutionary history, before transitioning to a phase dominated by packing of morphological space. However, this early phenotypic diversification is decoupled from temporal variation in evolutionary rate: rates of bill evolution vary among lineages but are comparatively stable through time. We find that rare, but major, discontinuities in phenotype emerge from rapid increases in rate along single branches, sometimes leading to depauperate clades with unusual bill morphologies. Despite these jumps between groups, the major axes of within-group bill-shape evolution are remarkably consistent across birds. We reveal that macroevolutionary processes underlying global-scale adaptive radiations support Darwinian and Simpsonian ideas of microevolution within adaptive zones and accelerated evolution between distinct adaptive peaks.
New developments in adaptive methods for computational fluid dynamics
NASA Technical Reports Server (NTRS)
Oden, J. T.; Bass, Jon M.
1990-01-01
New developments in a posteriori error estimates, smart algorithms, and h- and h-p adaptive finite element methods are discussed in the context of two- and three-dimensional compressible and incompressible flow simulations. Applications to rotor-stator interaction, rotorcraft aerodynamics, shock and viscous boundary layer interaction and fluid-structure interaction problems are discussed.
Adaptive and Optimal Control of Stochastic Dynamical Systems
2015-09-14
control and stochastic differential games . Stochastic linear-quadratic, continuous time, stochastic control problems are solved for systems with noise...control problems for systems with arbitrary correlated n 15. SUBJECT TERMS Adaptive control, optimal control, stochastic differential games 16. SECURITY...explicit results have been obtained for problems of stochastic control and stochastic differential games . Stochastic linear- quadratic, continuous time
Evolutionary programming for goal-driven dynamic planning
NASA Astrophysics Data System (ADS)
Vaccaro, James M.; Guest, Clark C.; Ross, David O.
2002-03-01
Many complex artificial intelligence (IA) problems are goal- driven in nature and the opportunity exists to realize the benefits of a goal-oriented solution. In many cases, such as in command and control, a goal-oriented approach may be the only option. One of many appropriate applications for such an approach is War Gaming. War Gaming is an important tool for command and control because it provides a set of alternative courses of actions so that military leaders can contemplate their next move in the battlefield. For instance, when making decisions that save lives, it is necessary to completely understand the consequences of a given order. A goal-oriented approach provides a slowly evolving tractably reasoned solution that inherently follows one of the principles of war: namely concentration on the objective. Future decision-making will depend not only on the battlefield, but also on a virtual world where military leaders can wage wars and determine their options by playing computer war games much like the real world. The problem with these games is that the built-in AI does not learn nor adapt and many times cheats, because the intelligent player has access to all the information, while the user has access to limited information provided on a display. These games are written for the purpose of entertainment and actions are calculated a priori and off-line, and are made prior or during their development. With these games getting more sophisticated in structure and less domain specific in scope, there needs to be a more general intelligent player that can adapt and learn in case the battlefield situations or the rules of engagement change. One such war game that might be considered is Risk. Risk incorporates the principles of war, is a top-down scalable model, and provides a good application for testing a variety of goal- oriented AI approaches. By integrating a goal-oriented hybrid approach, one can develop a program that plays the Risk game effectively and move
Satellite-tracking and earth-dynamics research programs
NASA Technical Reports Server (NTRS)
1975-01-01
The activities and progress in the satellite tracking and earth dynamics research during the first half of calendar year 1975 are described. Satellite tracking network operations, satellite geodesy and geophysics programs, GEOS 3 project support, and atmospheric research are covered.
Quantitative adaptation analytics for assessing dynamic systems of systems: LDRD Final Report
Gauthier, John H.; Miner, Nadine E.; Wilson, Michael L.; Le, Hai D.; Kao, Gio K.; Melander, Darryl J.; Longsine, Dennis Earl; Vander Meer, Jr., Robert C.
2015-01-01
Our society is increasingly reliant on systems and interoperating collections of systems, known as systems of systems (SoS). These SoS are often subject to changing missions (e.g., nation- building, arms-control treaties), threats (e.g., asymmetric warfare, terrorism), natural environments (e.g., climate, weather, natural disasters) and budgets. How well can SoS adapt to these types of dynamic conditions? This report details the results of a three year Laboratory Directed Research and Development (LDRD) project aimed at developing metrics and methodologies for quantifying the adaptability of systems and SoS. Work products include: derivation of a set of adaptability metrics, a method for combining the metrics into a system of systems adaptability index (SoSAI) used to compare adaptability of SoS designs, development of a prototype dynamic SoS (proto-dSoS) simulation environment which provides the ability to investigate the validity of the adaptability metric set, and two test cases that evaluate the usefulness of a subset of the adaptability metrics and SoSAI for distinguishing good from poor adaptability in a SoS. Intellectual property results include three patents pending: A Method For Quantifying Relative System Adaptability, Method for Evaluating System Performance, and A Method for Determining Systems Re-Tasking.
NASA Astrophysics Data System (ADS)
Yucelen, Tansel; De La Torre, Gerardo; Johnson, Eric N.
2014-11-01
Although adaptive control theory offers mathematical tools to achieve system performance without excessive reliance on dynamical system models, its applications to safety-critical systems can be limited due to poor transient performance and robustness. In this paper, we develop an adaptive control architecture to achieve stabilisation and command following of uncertain dynamical systems with improved transient performance. Our framework consists of a new reference system and an adaptive controller. The proposed reference system captures a desired closed-loop dynamical system behaviour modified by a mismatch term representing the high-frequency content between the uncertain dynamical system and this reference system, i.e., the system error. In particular, this mismatch term allows the frequency content of the system error dynamics to be limited, which is used to drive the adaptive controller. It is shown that this key feature of our framework yields fast adaptation without incurring high-frequency oscillations in the transient performance. We further show the effects of design parameters on the system performance, analyse closeness of the uncertain dynamical system to the unmodified (ideal) reference system, discuss robustness of the proposed approach with respect to time-varying uncertainties and disturbances, and make connections to gradient minimisation and classical control theory. A numerical example is provided to demonstrate the efficacy of the proposed architecture.
Applying Parallel Adaptive Methods with GeoFEST/PYRAMID to Simulate Earth Surface Crustal Dynamics
NASA Technical Reports Server (NTRS)
Norton, Charles D.; Lyzenga, Greg; Parker, Jay; Glasscoe, Margaret; Donnellan, Andrea; Li, Peggy
2006-01-01
This viewgraph presentation reviews the use Adaptive Mesh Refinement (AMR) in simulating the Crustal Dynamics of Earth's Surface. AMR simultaneously improves solution quality, time to solution, and computer memory requirements when compared to generating/running on a globally fine mesh. The use of AMR in simulating the dynamics of the Earth's Surface is spurred by future proposed NASA missions, such as InSAR for Earth surface deformation and other measurements. These missions will require support for large-scale adaptive numerical methods using AMR to model observations. AMR was chosen because it has been successful in computation fluid dynamics for predictive simulation of complex flows around complex structures.
Wang, Tianbo; Zhou, Wuneng; Zhao, Shouwei; Yu, Weiqin
2014-03-01
In this paper, the robust exponential synchronization problem for a class of uncertain delayed master-slave dynamical system is investigated by using the adaptive control method. Different from some existing master-slave models, the considered master-slave system includes bounded unmodeled dynamics. In order to compensate the effect of unmodeled dynamics and effectively achieve synchronization, a novel adaptive controller with simple updated laws is proposed. Moreover, the results are given in terms of LMIs, which can be easily solved by LMI Toolbox in Matlab. A numerical example is given to illustrate the effectiveness of the method.
Improve Problem Solving Skills through Adapting Programming Tools
NASA Technical Reports Server (NTRS)
Shaykhian, Linda H.; Shaykhian, Gholam Ali
2007-01-01
There are numerous ways for engineers and students to become better problem-solvers. The use of command line and visual programming tools can help to model a problem and formulate a solution through visualization. The analysis of problem attributes and constraints provide insight into the scope and complexity of the problem. The visualization aspect of the problem-solving approach tends to make students and engineers more systematic in their thought process and help them catch errors before proceeding too far in the wrong direction. The problem-solver identifies and defines important terms, variables, rules, and procedures required for solving a problem. Every step required to construct the problem solution can be defined in program commands that produce intermediate output. This paper advocates improved problem solving skills through using a programming tool. MatLab created by MathWorks, is an interactive numerical computing environment and programming language. It is a matrix-based system that easily lends itself to matrix manipulation, and plotting of functions and data. MatLab can be used as an interactive command line or a sequence of commands that can be saved in a file as a script or named functions. Prior programming experience is not required to use MatLab commands. The GNU Octave, part of the GNU project, a free computer program for performing numerical computations, is comparable to MatLab. MatLab visual and command programming are presented here.
Modeling for deformable mirrors and the adaptive optics optimization program
Henesian, M.A.; Haney, S.W.; Trenholme, J.B.; Thomas, M.
1997-03-18
We discuss aspects of adaptive optics optimization for large fusion laser systems such as the 192-arm National Ignition Facility (NIF) at LLNL. By way of example, we considered the discrete actuator deformable mirror and Hartmann sensor system used on the Beamlet laser. Beamlet is a single-aperture prototype of the 11-0-5 slab amplifier design for NIF, and so we expect similar optical distortion levels and deformable mirror correction requirements. We are now in the process of developing a numerically efficient object oriented C++ language implementation of our adaptive optics and wavefront sensor code, but this code is not yet operational. Results are based instead on the prototype algorithms, coded-up in an interpreted array processing computer language.
ADAPTUBL. Adaptive Digitizing and Programming of Turbine Blades
Ray, L.; Loucks, C.
1994-04-01
ADAPTUBL involves adaptively machining cast turbine blades. Due to uncontrollable warpage during solidification of cast parts, each part has unique dimensions. A structured lighting sensor, added to the workspace of a 5-axis machining center, discerns the unique geometry of each part. The processed sensor data is then used to generate the unique, 5-axis tool paths required to perform a high precision machining operation on the tip of each blade.
Missouri River Recovery Program Adaptive Management Process Framework, Version 2
2011-04-01
projects (e.g., Yellowstone Intake, Montana). The Sub-Programs and projects that comprise the MRRP, as well as the congressional authorities can... Yellowstone Intake). The role of the SPgM is to ensure successful implementation of the overall program through communication of the USACE strategic...effects of the Annual Operating Plan [AOP]) in coordination with the ISP. 1.2.10 PM for Other Congressionally and WRDA Directed Work (e.g. Yellowstone
Advanced Dynamically Adaptive Algorithms for Stochastic Simulations on Extreme Scales
Xiu, Dongbin
2016-06-21
The focus of the project is the development of mathematical methods and high-performance com- putational tools for stochastic simulations, with a particular emphasis on computations on extreme scales. The core of the project revolves around the design of highly e cient and scalable numer- ical algorithms that can adaptively and accurately, in high dimensional spaces, resolve stochastic problems with limited smoothness, even containing discontinuities.
A Dynamically Adaptive Arbitrary Lagrangian-Eulerian Method for Hydrodynamics
Anderson, R W; Pember, R B; Elliott, N S
2002-10-19
A new method that combines staggered grid Arbitrary Lagrangian-Eulerian (ALE) techniques with structured local adaptive mesh refinement (AMR) has been developed for solution of the Euler equations. The novel components of the combined ALE-AMR method hinge upon the integration of traditional AMR techniques with both staggered grid Lagrangian operators as well as elliptic relaxation operators on moving, deforming mesh hierarchies. Numerical examples demonstrate the utility of the method in performing detailed three-dimensional shock-driven instability calculations.
A Dynamically Adaptive Arbitrary Lagrangian-Eulerian Method for Hydrodynamics
Anderson, R W; Pember, R B; Elliott, N S
2004-01-28
A new method that combines staggered grid Arbitrary Lagrangian-Eulerian (ALE) techniques with structured local adaptive mesh refinement (AMR) has been developed for solution of the Euler equations. The novel components of the combined ALE-AMR method hinge upon the integration of traditional AMR techniques with both staggered grid Lagrangian operators as well as elliptic relaxation operators on moving, deforming mesh hierarchies. Numerical examples demonstrate the utility of the method in performing detailed three-dimensional shock-driven instability calculations.
INDDGO: Integrated Network Decomposition & Dynamic programming for Graph Optimization
Groer, Christopher S; Sullivan, Blair D; Weerapurage, Dinesh P
2012-10-01
It is well-known that dynamic programming algorithms can utilize tree decompositions to provide a way to solve some \\emph{NP}-hard problems on graphs where the complexity is polynomial in the number of nodes and edges in the graph, but exponential in the width of the underlying tree decomposition. However, there has been relatively little computational work done to determine the practical utility of such dynamic programming algorithms. We have developed software to construct tree decompositions using various heuristics and have created a fast, memory-efficient dynamic programming implementation for solving maximum weighted independent set. We describe our software and the algorithms we have implemented, focusing on memory saving techniques for the dynamic programming. We compare the running time and memory usage of our implementation with other techniques for solving maximum weighted independent set, including a commercial integer programming solver and a semi-definite programming solver. Our results indicate that it is possible to solve some instances where the underlying decomposition has width much larger than suggested by the literature. For certain types of problems, our dynamic programming code runs several times faster than these other methods.
ERIC Educational Resources Information Center
Ross, Steven M.; Rakow, Ernest A.
1981-01-01
Subjects completed a self-paced lesson on math rules in which the number of supporting examples was adapted to pretest scores through program control, selected through learner control, or kept constant (nonadaptive). Program control means were consistently highest while learner control means were lowest. (Author/BW)
SIMCA T 1.0: A SAS Computer Program for Simulating Computer Adaptive Testing
ERIC Educational Resources Information Center
Raiche, Gilles; Blais, Jean-Guy
2006-01-01
Monte Carlo methodologies are frequently applied to study the sampling distribution of the estimated proficiency level in adaptive testing. These methods eliminate real situational constraints. However, these Monte Carlo methodologies are not currently supported by the available software programs, and when these programs are available, their…
Arévalo, Orlando; Bornschlegl, Mona A.; Eberhardt, Sven; Ernst, Udo; Pawelzik, Klaus; Fahle, Manfred
2013-01-01
In everyday life, humans interact with a dynamic environment often requiring rapid adaptation of visual perception and motor control. In particular, new visuo–motor mappings must be learned while old skills have to be kept, such that after adaptation, subjects may be able to quickly change between two different modes of generating movements (‘dual–adaptation’). A fundamental question is how the adaptation schedule determines the acquisition speed of new skills. Given a fixed number of movements in two different environments, will dual–adaptation be faster if switches (‘phase changes’) between the environments occur more frequently? We investigated the dynamics of dual–adaptation under different training schedules in a virtual pointing experiment. Surprisingly, we found that acquisition speed of dual visuo–motor mappings in a pointing task is largely independent of the number of phase changes. Next, we studied the neuronal mechanisms underlying this result and other key phenomena of dual–adaptation by relating model simulations to experimental data. We propose a simple and yet biologically plausible neural model consisting of a spatial mapping from an input layer to a pointing angle which is subjected to a global gain modulation. Adaptation is performed by reinforcement learning on the model parameters. Despite its simplicity, the model provides a unifying account for a broad range of experimental data: It quantitatively reproduced the learning rates in dual–adaptation experiments for both direct effect, i.e. adaptation to prisms, and aftereffect, i.e. behavior after removal of prisms, and their independence on the number of phase changes. Several other phenomena, e.g. initial pointing errors that are far smaller than the induced optical shift, were also captured. Moreover, the underlying mechanisms, a local adaptation of a spatial mapping and a global adaptation of a gain factor, explained asymmetric spatial transfer and generalization of
Foshee, Vangie A; Dixon, Kimberly S; Ennett, Susan T; Moracco, Kathryn E; Bowling, J Michael; Chang, Ling-Yin; Moss, Jennifer L
2015-07-01
Adolescents exposed to domestic violence are at increased risk of dating abuse, yet no evaluated dating abuse prevention programs have been designed specifically for this high-risk population. This article describes the process of adapting Families for Safe Dates (FSD), an evidenced-based universal dating abuse prevention program, to this high-risk population, including conducting 12 focus groups and 107 interviews with the target audience. FSD includes six booklets of dating abuse prevention information, and activities for parents and adolescents to do together at home. We adapted FSD for mothers who were victims of domestic violence, but who no longer lived with the abuser, to do with their adolescents who had been exposed to the violence. Through the adaptation process, we learned that families liked the program structure and valued being offered the program and that some of our initial assumptions about this population were incorrect. We identified practices and beliefs of mother victims and attributes of these adolescents that might increase their risk of dating abuse that we had not previously considered. In addition, we learned that some of the content of the original program generated negative family interactions for some. The findings demonstrate the utility of using a careful process to adapt evidence-based interventions (EBIs) to cultural sub-groups, particularly the importance of obtaining feedback on the program from the target audience. Others can follow this process to adapt EBIs to groups other than the ones for which the original EBI was designed.
NASA Astrophysics Data System (ADS)
Yi, Guosheng; Wang, Jiang; Deng, Bin; Wei, Xile
2015-05-01
In this paper, we address how adaptation mediated by different biophysical mechanisms modulates neuronal spike initiating dynamics to extracellular electric fields. We incorporate two adaptation currents, i.e., voltage-sensitive potassium current (IM) and calcium-sensitive potassium current (IAHP), into a reduced two-compartment neuron model, and extensively investigate the modeling behavior to a range of electric fields. With phase plane analysis, it is shown whether neuron continues to spike depends on whether adaptation currents could be sufficiently activated to stabilize membrane potential at subthreshold voltages. With stability and bifurcation analysis, we find the steady-state spiking in the neuron with IM occurs through a Hopf bifurcation, whereas it is generated through a saddle-node on invariant circle (SNIC) bifurcation in the cases of IAHP or no adaptation. By identifying the biophysical basis for these dynamics, we observe that IM could alter the competitive outcomes between kinetically mismatched opposite currents to result in a Hopf bifurcation, while IAHP cannot alter these competitive outcomes. From this, we conclude that different modulations of spike initiating dynamics derive from the biophysical mechanism responsible for distinct adaptation currents. Our study suggests that the adaptation mediated by different mechanisms indeed has different effects on neuronal dynamics to electric field stimulus. It could contribute to uncover the underlying mechanism of how neuron encodes electric field signals.
Dynamic Learning Objects to Teach Java Programming Language
ERIC Educational Resources Information Center
Narasimhamurthy, Uma; Al Shawkani, Khuloud
2010-01-01
This article describes a model for teaching Java Programming Language through Dynamic Learning Objects. The design of the learning objects was based on effective learning design principles to help students learn the complex topic of Java Programming. Visualization was also used to facilitate the learning of the concepts. (Contains 1 figure and 2…
Understanding barriers to implementation of an adaptive land management program
Jacobson, S.K.; Morris, J.K.; Sanders, J.S.; Wiley, E.N.; Brooks, M.; Bennetts, R.E.; Percival, H.F.; Marynowski, S.
2006-01-01
The Florida Fish and Wildlife Conservation Commission manages over 650,000 ha, including 26 wildlife management and environmental areas. To improve management, they developed an objective-based vegetation management (OBVM) process that focuses on desired conditions of plant communities through an adaptive management framework. Our goals were to understand potential barriers to implementing OBVM and to recommend strategies to overcome barriers. A literature review identified 47 potential barriers in six categories to implementation of adaptive and ecosystem management: logistical, communication, attitudinal, institutional, conceptual, and educational. We explored these barriers through a bureau-wide survey of 90 staff involved in OBVM and personal interviews with area managers, scientists, and administrators. The survey incorporated an organizational culture assessment instrument to gauge how institutional factors might influence OBVM implementation. The survey response rate was 69%. Logistics and communications were the greatest barriers to implementing OBVM. Respondents perceived that the agency had inadequate resources for implementing OBVM and provided inadequate information. About one-third of the respondents believed OBVM would decrease their job flexibility and perceived greater institutional barriers to the approach. The 43% of respondents who believed they would have more responsibility under OBVM also had greater attitudinal barriers. A similar percentage of respondents reported OBVM would not give enough priority to wildlife. Staff believed that current agency culture was hierarchical but preferred a culture that would provide more flexibility for adaptive management and would foster learning from land management activities. In light of the barriers to OBVM, we recommend the following: (1) mitigation of logistical barriers by addressing real and perceived constraints of staff, funds, and other resources in a participatory manner; (2) mitigation of
Adaptation in hindsight: dynamics and drivers shaping urban wastewater systems.
Neumann, Marc B; Rieckermann, Jörg; Hug, Thomas; Gujer, Willi
2015-03-15
Well-planned urban infrastructure should meet critical loads during its design lifetime. In order to proceed with design, engineers are forced to make numerous assumptions with very little supporting information about the development of various drivers. For the wastewater sector, these drivers include the future amount and composition of the generated wastewater, effluent requirements, technologies, prices of inputs such as energy or chemicals, and the value of outputs produced such as nutrients for fertilizer use. When planning wastewater systems, there is a lack of methods to address discrepancies between the timescales at which fundamental changes in these drivers can occur, and the long physical life expectancy of infrastructure (on the order of 25-80 years). To explore these discrepancies, we take a hindsight perspective of the long-term development of wastewater infrastructure and assess the stability of assumptions made during previous designs. Repeatedly we find that the drivers influencing wastewater loads, environmental requirements or technological innovation can change at smaller timescales than the infrastructure design lifetime, often in less than a decade. Our analysis shows that i) built infrastructure is continuously confronted with challenges it was not conceived for, ii) significant adaptation occurs during a structure's lifetime, and iii) "muddling-through" is the pre-dominant strategy for adaptive management. As a consequence, we argue, there is a need to explore robust design strategies which require the systematic use of scenario planning methods and instruments to increase operational, structural, managerial, institutional and financial flexibility. Hindsight studies, such as this one, may inform the development of robust design strategies and assist in the transition to more explicit forms of adaptive management for urban infrastructures.
Integrating expert systems with dynamic programming in generation expansion planning
David, A.K.; Rong-da, Z.
1989-08-01
Interactive software developed for integrating engineering experience and judgement from the planning dept. with a powerful mathematic optimisation method is described. The excessive size of the state space generated by conventional multidimensional dynamic programming is reduced to real world engineering proportions by rule based procedures for implementing Windows in state space and Controls in policy space. Project Frames describing generation options and State Frames describing future conditions of the system are established and manipulated by rules. Dynamic programming simultaneously tracks a feasible set of sub-optimal scenarios. The program is interactive and is written in PROLOG with numerically intensive portions in C.
Interdisciplinary Research Programs in Geophysical Fluid Dynamics
2007-09-30
scientific disciplines that deal with the dynamics of stratified fluids, rotating fluids, fluid with phase changes and non-Newtonian fluids. To formulate...clearing-house for the mathematical, experimental and computational techniques which serve astrophysics, climate science, geodynamics, meteorology and... Zika , Physical Oceanography, University of New South Wales, “The stability of cascading flows”. RESULTS The Principal Lectures and Fellows
Dynamic Programming Method for Impulsive Control Problems
ERIC Educational Resources Information Center
Balkew, Teshome Mogessie
2015-01-01
In many control systems changes in the dynamics occur unexpectedly or are applied by a controller as needed. The time at which a controller implements changes is not necessarily known a priori. For example, many manufacturing systems and flight operations have complicated control systems, and changes in the control systems may be automatically…
Adapting the Behavior Education Program for Preschool Settings
ERIC Educational Resources Information Center
Steed, Elizabeth A.
2011-01-01
Behavior Education Program (BEP) is the most researched targeted intervention that is used in schoolwide positive behavior intervention and supports (PBIS). It is a daily check-in and check-out system in which students receive extra attention for positive social behavior throughout their school day. This extra attention is intended to prevent…
Architectural Adaptability in Parallel Programming via Control Abstraction
1991-01-01
Technical Report 359 January 1991 Abstract Parallel programming involves finding the potential parallelism in an application, choos - ing an...during the development of this paper. 34 References [Albert et ai, 1988] Eugene Albert, Kathleen Knobe, Joan D. Lukas, and Guy L. Steele, Jr
Adaptive optimal spectral range for dynamically changing scene
NASA Astrophysics Data System (ADS)
Pinsky, Ephi; Siman-tov, Avihay; Peles, David
2012-06-01
A novel multispectral video system that continuously optimizes both its spectral range channels and the exposure time of each channel autonomously, under dynamic scenes, varying from short range-clear scene to long range-poor visibility, is currently being developed. Transparency and contrast of high scattering medium of channels with spectral ranges in the near infrared is superior to the visible channels, particularly to the blue range. Longer wavelength spectral ranges that induce higher contrast are therefore favored. Images of 3 spectral channels are fused and displayed for (pseudo) color visualization, as an integrated high contrast video stream. In addition to the dynamic optimization of the spectral channels, optimal real-time exposure time is adjusted simultaneously and autonomously for each channel. A criterion of maximum average signal, derived dynamically from previous frames of the video stream is used (Patent Application - International Publication Number: WO2009/093110 A2, 30.07.2009). This configuration enables dynamic compatibility with the optimal exposure time of a dynamically changing scene. It also maximizes the signal to noise ratio and compensates each channel for the specified value of daylight reflections and sensors response for each spectral range. A possible implementation is a color video camera based on 4 synchronized, highly responsive, CCD imaging detectors, attached to a 4CCD dichroic prism and combined with a common, color corrected, lens. Principal Components Analysis (PCA) technique is then applied for real time "dimensional collapse" in color space, in order to select and fuse, for clear color visualization, the 3 most significant principal channels out of at least 4 characterized by high contrast and rich details in the image data.
Dynamic Reconstruction and Multivariable Control for Force-Actuated, Thin Facesheet Adaptive Optics
NASA Technical Reports Server (NTRS)
Grocott, Simon C. O.; Miller, David W.
1997-01-01
The Multiple Mirror Telescope (MMT) under development at the University of Arizona takes a new approach in adaptive optics placing a large (0.65 m) force-actuated, thin facesheet deformable mirror at the secondary of an astronomical telescope, thus reducing the effects of emissivity which are important in IR astronomy. However, The large size of the mirror and low stiffness actuators used drive the natural frequencies of the mirror down into the bandwidth of the atmospheric distortion. Conventional adaptive optics takes a quasi-static approach to controlling the, deformable mirror. However, flexibility within the control bandwidth calls for a new approach to adaptive optics. Dynamic influence functions are used to characterize the influence of each actuator on the surface of the deformable mirror. A linearized model of atmospheric distortion is combined with dynamic influence functions to produce a dynamic reconstructor. This dynamic reconstructor is recognized as an optimal control problem. Solving the optimal control problem for a system with hundreds of actuators and sensors is formidable. Exploiting the circularly symmetric geometry of the mirror, and a suitable model of atmospheric distortion, the control problem is divided into a number of smaller decoupled control problems using circulant matrix theory. A hierarchic control scheme which seeks to emulate the quasi-static control approach that is generally used in adaptive optics is compared to the proposed dynamic reconstruction technique. Although dynamic reconstruction requires somewhat more computational power to implement, it achieves better performance with less power usage, and is less sensitive than the hierarchic technique.
Interdisciplinary Research Programs in Geophysical Fluid Dynamics
2009-06-01
mathematical, experimental and computational techniques which serve astrophysics , climate science, geodynamics, meteorology and oceanography. APPROACH We...The letters illustrated how the program has made immense difference to their own careers and to those of a number of their students who attended as
Adaptive Quality of Service Engine with Dynamic Queue Control
2011-03-24
tables in ns2, Alexander Stirling for the editing of the Winter Simulation conference paper that was published with this thesis, and Mark Duncan for...MONITORING AGENCY NAME(S) AND ADDRESS(ES) Robert Bonneau Program Manager Air Force Office of Scientific Research (AFOSR/NL) Software and Systems
Satellite tracking and earth dynamics research programs
NASA Technical Reports Server (NTRS)
1982-01-01
The SAO laser site in Arequipa continued routine operations throughout the reporting period except for the months of March and April when upgrading was underway. The laser in Orroral Valley was operational through March. Together with the cooperating stations in Wettzell, Grasse, Kootwikj, San Fernando, Helwan, and Metsahove the laser stations obtained a total of 37,099 quick-look observations on 978 passes of BE-C, Starlette, and LAGEOS. The Network continued to track LAGEOS at highest priority for polar motion and Earth rotation studies, and for other geophysical investigations, including crustal dynamics, Earth and ocean tides, and the general development of precision orbit determination. The Network performed regular tracking of BE-C and Starlette for refined determinations of station coordinate and the Earth's gravity field and for studies of solid earth dynamics. Monthly statistics of the passes and points are given by station and by satellite.
Adaptive superposition of finite element meshes in linear and nonlinear dynamic analysis
NASA Astrophysics Data System (ADS)
Yue, Zhihua
2005-11-01
The numerical analysis of transient phenomena in solids, for instance, wave propagation and structural dynamics, is a very important and active area of study in engineering. Despite the current evolutionary state of modern computer hardware, practical analysis of large scale, nonlinear transient problems requires the use of adaptive methods where computational resources are locally allocated according to the interpolation requirements of the solution form. Adaptive analysis of transient problems involves obtaining solutions at many different time steps, each of which requires a sequence of adaptive meshes. Therefore, the execution speed of the adaptive algorithm is of paramount importance. In addition, transient problems require that the solution must be passed from one adaptive mesh to the next adaptive mesh with a bare minimum of solution-transfer error since this form of error compromises the initial conditions used for the next time step. A new adaptive finite element procedure (s-adaptive) is developed in this study for modeling transient phenomena in both linear elastic solids and nonlinear elastic solids caused by progressive damage. The adaptive procedure automatically updates the time step size and the spatial mesh discretization in transient analysis, achieving the accuracy and the efficiency requirements simultaneously. The novel feature of the s-adaptive procedure is the original use of finite element mesh superposition to produce spatial refinement in transient problems. The use of mesh superposition enables the s-adaptive procedure to completely avoid the need for cumbersome multipoint constraint algorithms and mesh generators, which makes the s-adaptive procedure extremely fast. Moreover, the use of mesh superposition enables the s-adaptive procedure to minimize the solution-transfer error. In a series of different solid mechanics problem types including 2-D and 3-D linear elastic quasi-static problems, 2-D material nonlinear quasi-static problems
Evolution experiments with microorganisms: the dynamics and genetic bases of adaptation.
Elena, Santiago F; Lenski, Richard E
2003-06-01
Microorganisms have been mutating and evolving on Earth for billions of years. Now, a field of research has developed around the idea of using microorganisms to study evolution in action. Controlled and replicated experiments are using viruses, bacteria and yeast to investigate how their genomes and phenotypic properties evolve over hundreds and even thousands of generations. Here, we examine the dynamics of evolutionary adaptation, the genetic bases of adaptation, tradeoffs and the environmental specificity of adaptation, the origin and evolutionary consequences of mutators, and the process of drift decay in very small populations.
Intelligent control of non-linear dynamical system based on the adaptive neurocontroller
NASA Astrophysics Data System (ADS)
Engel, E.; Kovalev, I. V.; Kobezhicov, V.
2015-10-01
This paper presents an adaptive neuro-controller for intelligent control of non-linear dynamical system. The formed as the fuzzy selective neural net the adaptive neuro-controller on the base of system's state, creates the effective control signal under random perturbations. The validity and advantages of the proposed adaptive neuro-controller are demonstrated by numerical simulations. The simulation results show that the proposed controller scheme achieves real-time control speed and the competitive performance, as compared to PID, fuzzy logic controllers.
2014-01-01
determine which provided the most useful data and provided a set of final materials to AWG based on these results. A third objective was to provide... materials suitable not only for evaluating AWALP but also for evaluating other courses or events that include adaptability training or training that...adaptability train- ing, we recommend that AWG create a training support package for AWALP with a program of instruction and supplementary materials
Measuring Fidelity and Adaptation: Reliability of a Instrument for School-Based Prevention Programs.
Bishop, Dana C; Pankratz, Melinda M; Hansen, William B; Albritton, Jordan; Albritton, Lauren; Strack, Joann
2014-06-01
There is a need to standardize methods for assessing fidelity and adaptation. Such standardization would allow program implementation to be examined in a manner that will be useful for understanding the moderating role of fidelity in dissemination research. This article describes a method for collecting data about fidelity of implementation for school-based prevention programs, including measures of adherence, quality of delivery, dosage, participant engagement, and adaptation. We report about the reliability of these methods when applied by four observers who coded video recordings of teachers delivering All Stars, a middle school drug prevention program. Interrater agreement for scaled items was assessed for an instrument designed to evaluate program fidelity. Results indicated sound interrater reliability for items assessing adherence, dosage, quality of teaching, teacher understanding of concepts, and program adaptations. The interrater reliability for items assessing potential program effectiveness, classroom management, achievement of activity objectives, and adaptation valences was improved by dichotomizing the response options for these items. The item that assessed student engagement demonstrated only modest interrater reliability and was not improved through dichotomization. Several coder pairs were discordant on items that overall demonstrated good interrater reliability. Proposed modifications to the coding manual and protocol are discussed.
Design and realization of dynamic self-adaptive technology based on disc quality
NASA Astrophysics Data System (ADS)
Zhou, Gongye; Wang, Jingqi; Fang, Xiaojing; Xie, Changsheng; Liu, Tong
2003-04-01
Dynamic self-adaptive technology makes it possible to adjust the spindle motor speed of optical disc drive based on the different quality of optical discs. It guarantees the read process have the optimal speed to read data smoothly and protect the optical-head components. This paper presents a dynamic self-adaptive technology based on disc quality which uses fussy logic control to make the speed adjusting process fast. It is applied to the servo system of high-speed CD-ROM driver system and good results are obtained.
Nanostructural self-organization and dynamic adaptation of metal-polymer tribosystems
NASA Astrophysics Data System (ADS)
Mashkov, Yu. K.
2017-02-01
The results of investigating the effect of nanosize modifiers of a polymer matrix on the nanostructural self-organization of polymer composites and dynamic adaptation of metal-polymer tribosystems, which considerably affect the wear resistance of polymer composite materials, have been analyzed. It has been shown that the physicochemical nanostructural self-organization processes are developed in metal-polymer tribosystems with the formation of thermotropic liquid-crystal structures of the polymer matrix, followed by the transition of the system to the stationary state with a negative feedback that ensures dynamic adaptation of the tribosystem to given operating conditions.
Structural self-assembly and avalanchelike dynamics in locally adaptive networks
NASA Astrophysics Data System (ADS)
Gräwer, Johannes; Modes, Carl D.; Magnasco, Marcelo O.; Katifori, Eleni
2015-07-01
Transport networks play a key role across four realms of eukaryotic life: slime molds, fungi, plants, and animals. In addition to the developmental algorithms that build them, many also employ adaptive strategies to respond to stimuli, damage, and other environmental changes. We model these adapting network architectures using a generic dynamical system on weighted graphs and find in simulation that these networks ultimately develop a hierarchical organization of the final weighted architecture accompanied by the formation of a system-spanning backbone. In addition, we find that the long term equilibration dynamics exhibit behavior reminiscent of glassy systems characterized by long periods of slow changes punctuated by bursts of reorganization events.
ERIC Educational Resources Information Center
Burns, Edward
This manual is intended as a guide and source of ideas for using single switches in adaptive software programming for people with disabilities who cannot use a traditional keyboard. The manual and associated program disk are comprised of over 100 programs, routines and files illustrating various uses of single switch and adaptive input devices.…
Program For Simulating Dynamics Of Aerospace Vehicles
NASA Technical Reports Server (NTRS)
Berning, M. J.; Sagis, K. D.
1995-01-01
SORT (Simulation and Optimization of Rocket Trajectories) is general-purpose three-degree-of-freedom with three axis static moment balance simulation of flight dynamics of arbitrary aerospace vehicle. Modular structure facilitates application to variety of trajectory-analysis problems. Contains math model of aerodynamics completely generalized. Computes both longitudinal and lateral forces and moments. In addition to fore-body coefficients, computes longitudinal base effect aerodynamic forces and moments. Simplified ballistic-coefficient model also available for analysis of ballistic entry. Written using ANSI FORTRAN 77.
[Community Health Agent: status adapted with Family Health Program reality?].
dos Santos, Karina Tonini; Saliba, Nemre Adas; Moimaz, Suzely Adas Saliba; Arcieri, Renato Moreira; Carvalho, Maria de Lourdes
2011-01-01
This study analyses the status and work reality of Community Health Agents, with the purpose of contributing to the improvement of the Brazilian Health System (SUS) in small cities. It was discussed aspects related to their participation in the team of the Family Health Program (PSF) and their interaction with the community. It was observed a lack of motivation and experience, which compromises the quality of Agents performance in the community. It is known that these findings are reflex and consequence of an established context. It is necessary the team rethink their practice, specially the managers, having always as a fundament the principles that guide the SUS and PSF.
Wang, Sue-Jane; Hung, H M James; O'Neill, Robert
2011-07-01
A clinical research program for drug development often consists of a sequence of clinical trials that may begin with uncontrolled and nonrandomized trials, followed by randomized trials or randomized controlled trials. Adaptive designs are not infrequently proposed for use. In the regulatory setting, the success of a drug development program can be defined to be that the experimental treatment at a specific dose level including regimen and frequency is approved based on replicated evidence from at least two confirmatory trials. In the early stage of clinical research, multiplicity issues are very broad. What is the maximum tolerable dose in an adaptive dose escalation trial? What should the dose range be to consider in an adaptive dose-ranging trial? What is the minimum effective dose in an adaptive dose-response study given the tolerability and the toxicity observable in short term or premarketing trials? Is establishing the dose-response relationship important or the ability to select a superior treatment with high probability more important? In the later stage of clinical research, multiplicity problems can be formulated with better focus, depending on whether the study is for exploration to estimate or select design elements or for labeling consideration. What is the study objective for an early-phase versus a later phase adaptive clinical trial? How many doses are to be studied in the early exploratory adaptive trial versus in the confirmatory adaptive trial? Is the intended patient population well defined or is the applicable patient population yet to be adaptively selected in the trial due to the potential patient and/or disease heterogeneity? Is the primary efficacy endpoint well defined or still under discussion providing room for adaptation? What are the potential treatment indications that may adaptively lead to an intended-to-treat patient population and the primary efficacy endpoint? In this work we stipulate the multiplicity issues with adaptive
SPOT: an optimization software for dynamic observation programming
NASA Astrophysics Data System (ADS)
Lagrange, Anne-Marie; Rubini, Pascal; Brauner-Vettier, Nadia; Cambazard, Hadrien; Catusse, Nicolas; Lemaire, Pierre; Baude, Laurence
2016-07-01
The surveys dedicated to the search for extrasolar planets with the recently installed extreme-AO, high contrast Planet Imagers generally include hundreds of targets, to be observed sometimes repeatedly, generally in Angular Differential Imaging Mode. Each observation has to fulfill several time-dependent constraints, which makes a manual elaboration of an optimized planning impossible. We have developed a software (SPOT), an easy to use tool with graphical interface that allows both long term (months, years) and dynamic (nights) optimized scheduling of such surveys, taking into account all relevant constraints. Tests show that excellent schedules and high filling efficiencies can be obtained with execution times compatible with real-time scheduling, making possible to take in account complex constraints and to dynamically adapt planning to unexpected circumstances even during their execution. Moreover, such a tool is very valuable during survey preparations to build target lists and calendars. SPOT could be easily adapted for scheduling observations other instruments or telescopes.
Fast Dynamical Coupling Enhances Frequency Adaptation of Oscillators for Robotic Locomotion Control
Nachstedt, Timo; Tetzlaff, Christian; Manoonpong, Poramate
2017-01-01
Rhythmic neural signals serve as basis of many brain processes, in particular of locomotion control and generation of rhythmic movements. It has been found that specific neural circuits, named central pattern generators (CPGs), are able to autonomously produce such rhythmic activities. In order to tune, shape and coordinate the produced rhythmic activity, CPGs require sensory feedback, i.e., external signals. Nonlinear oscillators are a standard model of CPGs and are used in various robotic applications. A special class of nonlinear oscillators are adaptive frequency oscillators (AFOs). AFOs are able to adapt their frequency toward the frequency of an external periodic signal and to keep this learned frequency once the external signal vanishes. AFOs have been successfully used, for instance, for resonant tuning of robotic locomotion control. However, the choice of parameters for a standard AFO is characterized by a trade-off between the speed of the adaptation and its precision and, additionally, is strongly dependent on the range of frequencies the AFO is confronted with. As a result, AFOs are typically tuned such that they require a comparably long time for their adaptation. To overcome the problem, here, we improve the standard AFO by introducing a novel adaptation mechanism based on dynamical coupling strengths. The dynamical adaptation mechanism enhances both the speed and precision of the frequency adaptation. In contrast to standard AFOs, in this system, the interplay of dynamics on short and long time scales enables fast as well as precise adaptation of the oscillator for a wide range of frequencies. Amongst others, a very natural implementation of this mechanism is in terms of neural networks. The proposed system enables robotic applications which require fast retuning of locomotion control in order to react to environmental changes or conditions. PMID:28377710
Broom, Donald M
2006-01-01
The term adaptation is used in biology in three different ways. It may refer to changes which occur at the cell and organ level, or at the individual level, or at the level of gene action and evolutionary processes. Adaptation by cells, especially nerve cells helps in: communication within the body, the distinguishing of stimuli, the avoidance of overload and the conservation of energy. The time course and complexity of these mechanisms varies. Adaptive characters of organisms, including adaptive behaviours, increase fitness so this adaptation is evolutionary. The major part of this paper concerns adaptation by individuals and its relationships to welfare. In complex animals, feed forward control is widely used. Individuals predict problems and adapt by acting before the environmental effect is substantial. Much of adaptation involves brain control and animals have a set of needs, located in the brain and acting largely via motivational mechanisms, to regulate life. Needs may be for resources but are also for actions and stimuli which are part of the mechanism which has evolved to obtain the resources. Hence pigs do not just need food but need to be able to carry out actions like rooting in earth or manipulating materials which are part of foraging behaviour. The welfare of an individual is its state as regards its attempts to cope with its environment. This state includes various adaptive mechanisms including feelings and those which cope with disease. The part of welfare which is concerned with coping with pathology is health. Disease, which implies some significant effect of pathology, always results in poor welfare. Welfare varies over a range from very good, when adaptation is effective and there are feelings of pleasure or contentment, to very poor. A key point concerning the concept of individual adaptation in relation to welfare is that welfare may be good or poor while adaptation is occurring. Some adaptation is very easy and energetically cheap and
Workload Model Based Dynamic Adaptation of Social Internet of Vehicles.
Alam, Kazi Masudul; Saini, Mukesh; El Saddik, Abdulmotaleb
2015-09-15
Social Internet of Things (SIoT) has gained much interest among different research groups in recent times. As a key member of a smart city, the vehicular domain of SIoT (SIoV) is also undergoing steep development. In the SIoV, vehicles work as sensor-hub to capture surrounding information using the in-vehicle and Smartphone sensors and later publish them for the consumers. A cloud centric cyber-physical system better describes the SIoV model where physical sensing-actuation process affects the cloud based service sharing or computation in a feedback loop or vice versa. The cyber based social relationship abstraction enables distributed, easily navigable and scalable peer-to-peer communication among the SIoV subsystems. These cyber-physical interactions involve a huge amount of data and it is difficult to form a real instance of the system to test the feasibility of SIoV applications. In this paper, we propose an analytical model to measure the workloads of various subsystems involved in the SIoV process. We present the basic model which is further extended to incorporate complex scenarios. We provide extensive simulation results for different parameter settings of the SIoV system. The findings of the analyses are further used to design example adaptation strategies for the SIoV subsystems which would foster deployment of intelligent transport systems.
Workload Model Based Dynamic Adaptation of Social Internet of Vehicles
Alam, Kazi Masudul; Saini, Mukesh; El Saddik, Abdulmotaleb
2015-01-01
Social Internet of Things (SIoT) has gained much interest among different research groups in recent times. As a key member of a smart city, the vehicular domain of SIoT (SIoV) is also undergoing steep development. In the SIoV, vehicles work as sensor-hub to capture surrounding information using the in-vehicle and Smartphone sensors and later publish them for the consumers. A cloud centric cyber-physical system better describes the SIoV model where physical sensing-actuation process affects the cloud based service sharing or computation in a feedback loop or vice versa. The cyber based social relationship abstraction enables distributed, easily navigable and scalable peer-to-peer communication among the SIoV subsystems. These cyber-physical interactions involve a huge amount of data and it is difficult to form a real instance of the system to test the feasibility of SIoV applications. In this paper, we propose an analytical model to measure the workloads of various subsystems involved in the SIoV process. We present the basic model which is further extended to incorporate complex scenarios. We provide extensive simulation results for different parameter settings of the SIoV system. The findings of the analyses are further used to design example adaptation strategies for the SIoV subsystems which would foster deployment of intelligent transport systems. PMID:26389905
Sensor Web Dynamic Measurement Techniques and Adaptive Observing Strategies
NASA Technical Reports Server (NTRS)
Talabac, Stephen J.
2004-01-01
Sensor Web observing systems may have the potential to significantly improve our ability to monitor, understand, and predict the evolution of rapidly evolving, transient, or variable environmental features and events. This improvement will come about by integrating novel data collection techniques, new or improved instruments, emerging communications technologies and protocols, sensor mark-up languages, and interoperable planning and scheduling systems. In contrast to today's observing systems, "event-driven" sensor webs will synthesize real- or near-real time measurements and information from other platforms and then react by reconfiguring the platforms and instruments to invoke new measurement modes and adaptive observation strategies. Similarly, "model-driven" sensor webs will utilize environmental prediction models to initiate targeted sensor measurements or to use a new observing strategy. The sensor web concept contrasts with today's data collection techniques and observing system operations concepts where independent measurements are made by remote sensing and in situ platforms that do not share, and therefore cannot act upon, potentially useful complementary sensor measurement data and platform state information. This presentation describes NASA's view of event-driven and model-driven Sensor Webs and highlights several research and development activities at the Goddard Space Flight Center.
MPH program adaptability in a competitive marketplace: the case for continued assessment.
Caron, Rosemary M; Tutko, Holly
2010-06-01
In the last several years, the number of Master of Public Health (MPH) programs has increased rapidly in the US. As such, MPH programs, particularly smaller-sized ones, need to critically examine how their programs are meeting the needs and preferences of local public health practitioners. To assist in this necessity, the University of New Hampshire conducted a comprehensive educational assessment of its effectiveness as a smaller-sized, accredited MPH program. The aim of the assessment was to review the MPH program from the perspective of all stakeholders and then to agree on changes that would contribute to the fulfillment of the program's mission, as well as improve program quality and reach. The program's stakeholders examined the following components: policy development and implementation; target audience; marketing strategies; marketplace position; delivery model; curriculum design; and continuing education. Though assessment activities explored a wide array of program attributes, target audience, curriculum design, and delivery strategy presented significant challenges and opportunities for our smaller MPH Program to remain competitive. The effort put forth into conducting an in-depth assessment of the core components of our program also allowed for a comparison to the increasing number of MPH programs developing regionally. Since public health practice is changing and the education of public health practitioners must be adaptable, we propose that a routine assessment of an institution's MPH program could not only meet this need but also assist with keeping smaller, unbranded MPH programs competitive in a burgeoning marketplace.
Eucb: A C++ program for molecular dynamics trajectory analysis
NASA Astrophysics Data System (ADS)
Tsoulos, Ioannis G.; Stavrakoudis, Athanassios
2011-03-01
Eucb is a standalone program for geometrical analysis of molecular dynamics trajectories of protein systems. The program is written in GNU C++ and it can be installed in any operating system running a C++ compiler. The program performs its analytical tasks based on user supplied keywords. The source code is freely available from http://stavrakoudis.econ.uoi.gr/eucb under LGPL 3 license. Program summaryProgram title:Eucb Catalogue identifier: AEIC_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEIC_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 31 169 No. of bytes in distributed program, including test data, etc.: 297 364 Distribution format: tar.gz Programming language: GNU C++ Computer: The tool is designed and tested on GNU/Linux systems Operating system: Unix/Linux systems RAM: 2 MB Supplementary material: Sample data files are available Classification: 3 Nature of problem: Analysis of molecular dynamics trajectories. Solution method: The program finds all possible interactions according to input files and the user instructions. Then it reads all the trajectory frames and finds those frames in which these interactions occur, under certain geometrical criteria. This is a blind search, without a priori knowledge if a certain interaction occurs or not. The program exports time series of these quantities (distance, angles, etc.) and appropriate descriptive statistics. Running time: Depends on the input data and the required options.
Spacecraft Dynamics and Control Program at AFRPL
NASA Technical Reports Server (NTRS)
Das, A.; Slimak, L. K. S.; Schloegel, W. T.
1986-01-01
A number of future DOD and NASA spacecraft such as the space based radar will be not only an order of magnitude larger in dimension than the current spacecraft, but will exhibit extreme structural flexibility with very low structural vibration frequencies. Another class of spacecraft (such as the space defense platforms) will combine large physical size with extremely precise pointing requirement. Such problems require a total departure from the traditional methods of modeling and control system design of spacecraft where structural flexibility is treated as a secondary effect. With these problems in mind, the Air Force Rocket Propulsion Laboratory (AFRPL) initiated research to develop dynamics and control technology so as to enable the future large space structures (LSS). AFRPL's effort in this area can be subdivided into the following three overlapping areas: (1) ground experiments, (2) spacecraft modeling and control, and (3) sensors and actuators. Both the in-house and contractual efforts of the AFRPL in LSS are summarized.
Inverse dynamics of adaptive space cranes with tip point adjustment
NASA Technical Reports Server (NTRS)
Das, S. K.; Utku, S.; Wada, B. K.
1990-01-01
The 'space crane', which resembles a conventional solid-link robot but employs truss sections in place of links and length-adjustable bars in place of torque-generating motors, is presently characterized by means of two different inverse-dynamics schemes. While in the first of these the nominal angles are maintained between the links constituting the crane, the second scheme adjusts the nominal angles as a function of time in order to always maintain the tip of the crane along the desired (nomical) trajectory. Attention is given to the second scheme, and to a tip-adjustment method which keeps the high frequency flexibility vibration within limits and ensures numerical stability.
Adaptive model of plankton dynamics for the North Atlantic
NASA Astrophysics Data System (ADS)
Pahlow, Markus; Vézina, Alain F.; Casault, Benoit; Maass, Heidi; Malloch, Louise; Wright, Daniel G.; Lu, Youyu
2008-02-01
Plankton ecosystems in the North Atlantic display strong regional and interannual variability in productivity and trophic structure, which cannot be captured by simple plankton models. Additional compartments subdividing functional groups can increase predictive power, but the high number of parameters tends to compromise portability and robustness of model predictions. An alternative strategy is to use property state variables, such as cell size, normally considered constant parameters in ecosystem models, to define the structure of functional groups in terms of both behaviour and response to physical forcing. This strategy may allow us to simulate realistically regional and temporal differences among plankton communities while keeping model complexity at a minimum. We fit a model of plankton and DOM dynamics globally and individually to observed climatologies at three diverse locations in the North Atlantic. Introducing additional property state variables is shown to improve the model fit both locally and globally, make the model more portable, and help identify model deficiencies. The zooplankton formulation exerts strong control on model performance. Our results suggest that the current paradigm on zooplankton allometric functional relationships might be at odds with observed plankton dynamics. Our parameter estimation resulted in more realistic estimates of parameters important for primary production than previous data assimilation studies. Property state variables generate complex emergent functional relationships, and might be used like tracers to differentiate between locally produced and advected biomass. The model results suggest that the observed temperature dependence of heterotrophic growth efficiency [Rivkin, R.B., Legendre, L., 2001. Biogenic carbon cycling in the upper ocean: effects of microbial respiration. Science 291 (5512) 2398-2400] could be an emergent relation due to intercorrelations among temperature, nutrient concentration and growth
Qualification of a computer program for drill string dynamics
Stone, C.M.; Carne, T.G.; Caskey, B.C.
1985-01-01
A four point plan for the qualification of the GEODYN drill string dynamics computer program is described. The qualification plan investigates both modal response and transient response of a short drill string subjected to simulated cutting loads applied through a polycrystalline diamond compact (PDC) bit. The experimentally based qualification shows that the analytical techniques included in Phase 1 GEODYN correctly simulate the dynamic response of the bit-drill string system. 6 refs., 8 figs.
Satellite tracking and Earth dynamics research programs
NASA Technical Reports Server (NTRS)
Pearlman, M. R.
1984-01-01
Following an upgrading program, ranging performance capabilities of a satellite-tracking pulsed laser system were assessed in terms of range accuracy, range noise, data yield, and reliability. With a shorter laser pulse duration (2.5 to 3.0 NSEC) and a new analog pulse processing system, the systematic range errors were reduced to 3 to 5 cm and range noise was reduced to 5 to 16 cm and range noise was reduced to 5 to 15 cm on Starlette and BE-C, and 10 to 18 cm on LAGEOS. Maximum pulse repetition rate was increased to 30 pulses per minute and significant improvement was made in signal to noise ratio by installing a 3 A interference filter and by reducing the range gate window to 200 to 400 nsec. The solution to a problem involving leakage of a fraction of the laser oscillator pulse through the pulse chopper was outlined.
Development of a scalable gas-dynamics solver with adaptive mesh refinement
NASA Astrophysics Data System (ADS)
Korkut, Burak
There are various computational physics areas in which Direct Simulation Monte Carlo (DSMC) and Particle in Cell (PIC) methods are being employed. The accuracy of results from such simulations depend on the fidelity of the physical models being used. The computationally demanding nature of these problems make them ideal candidates to make use of modern supercomputers. The software developed to run such simulations also needs special attention so that the maintainability and extendability is considered with the recent numerical methods and programming paradigms. Suited for gas-dynamics problems, a software called SUGAR (Scalable Unstructured Gas dynamics with Adaptive mesh Refinement) has recently been developed and written in C++ and MPI. Physical and numerical models were added to this framework to simulate ion thruster plumes. SUGAR is used to model the charge-exchange (CEX) reactions occurring between the neutral and ion species as well as the induced electric field effect due to ions. Multiple adaptive mesh refinement (AMR) meshes were used in order to capture different physical length scales present in the flow. A multiple-thruster configuration was run to extend the studies to cases for which there is no axial or radial symmetry present that could only be modeled with a three-dimensional simulation capability. The combined plume structure showed interactions between individual thrusters where AMR capability captured this in an automated way. The back flow for ions was found to occur when CEX and momentum-exchange (MEX) collisions are present and strongly enhanced when the induced electric field is considered. The ion energy distributions in the back flow region were obtained and it was found that the inclusion of the electric field modeling is the most important factor in determining its shape. The plume back flow structure was also examined for a triple-thruster, 3-D geometry case and it was found that the ion velocity in the back flow region appears to be
Application of dynamic programming to the correlation of paleoclimate records
NASA Astrophysics Data System (ADS)
Lisiecki, Lorraine E.; Lisiecki, Philip A.
2002-12-01
Signal matching is a powerful tool frequently used in paleoclimate research, but it is enormously time-consuming when performed by hand. Previously proposed automatic correlation techniques require very good initial fits to find the correct alignment of two records. A new technique presented in this paper utilizes dynamic programming to find the globally optimal alignment of two records. Geological realism is instilled in the solution through the definition of penalty functions for undesirable behavior such as unlikely changes in accumulation rate. Examples with synthetic and real data demonstrate that the dynamic programming technique produces accurate, high-resolution results with much less effort than hand tuning or preexisting automated correlation techniques.
Multi-mesh gear dynamics program evaluation and enhancements
NASA Technical Reports Server (NTRS)
Boyd, L. S.; Pike, J.
1985-01-01
A multiple mesh gear dynamics computer program was continually developed and modified during the last four years. The program can handle epicyclic gear systems as well as single mesh systems with internal, buttress, or helical tooth forms. The following modifications were added under the current funding: variable contact friction, planet cage and ring gear rim flexibility options, user friendly options, dynamic side bands, a speed survey option and the combining of the single and multiple mesh options into one general program. The modified program was evaluated by comparing calculated values to published test data and to test data taken on a Hamilton Standard turboprop reduction gear-box. In general, the correlation between the test data and the analytical data is good.
The dynamic replicon: adapting to a changing cellular environment.
Herrick, John
2010-02-01
Eukaryotic cells are often exposed to fluctuations in growth conditions as well as endogenous and exogenous stress-related agents. During development, global patterns of gene transcription change substantially, and these changes are associated with altered patterns of DNA replication and larger distances between replication origins in somatic cells compared to embryos. Conversely, when cells experience difficulties while replicating DNA, the replication program is dramatically altered and distances between replication origins decrease. Recent evidence indicates that each unit of replication, or replicon, can correspond to one or more potential replication origins, but in the case of multiple potential origins, only one is selected to initiate replication of the replicon. How one origin is selected from multiple potential origins and how origin densities are regulated during genome duplication remains unclear. The following review addresses some of the mechanisms involved in regulating replication origins during both a normal and perturbed eukaryotic cell cycle.
NASA Astrophysics Data System (ADS)
Chiang, Y.; Chiang, W.; Sui, C.; Tung, C.; Ho, H.; Li, M.; Chan, S.; Climate Change Adaptation Technologies Program, National Science Council, Taiwan
2010-12-01
Climate changes adaptation needs innovative technological revolution on demand for transdisciplinary studies in various temporal and spatial scales. In our proposed program, a systematic and scientific framework will be developed to promote innovative adaptation technologies with respect to providing decision making information for government sectors, enhancing applicability of scientific research output, strengthening national research capabilities, and integrating both academic and non-academic resources. The objectives of this program are to identify key issues, required technologies, and scientific knowledge for climate change adaptations, and to build a transdisciplinary platform bridging science-supported technologies required by government sectors and demand-oriented scientific research conducted by academic communities. The approach proposed herein will be practiced in vulnerable regions, such as urban, rural, mountain, river basin, and coastal areas, which are particularly sensitive to climate change. The first phase of 3-year (2011~2013) work is to deploy framework and strategies of climate change impact assessment and adaptation measures between related government sectors and researchers from academic communities. The proposed framework involves three principle research groups, namely Environmental System, Vulnerability Assessment, and Risk Management and Adaptation Technology. The goal of the first group, Environmental System, is to combine climate change projections with enhanced scientific and environmental monitoring technologies for better adaptations to future scenarios in different social, economic, and environmental sectors to support adaptation measures planning and to reduce uncertainties on assessing vulnerability. The goal of the second group, Vulnerability Assessment, is to identify interfaces and information structures of climate change vulnerably issues and to develop protocol, models, and indices for vulnerability assessment. The goal of
The AFDM (advanced fluid dynamics model) program: Scope and significance
Bohl, W.R.; Parker, F.R. ); Wilhelm, D. . Inst. fuer Neutronenphysik und Reaktortechnik); Berthier, J. )
1990-01-01
The origins and goals of the advanced fluid dynamics model (AFDM) program are described, and the models, algorithm, and coding used in the resulting AFDM computer program are summarized. A sample fuel-steel boiling pool calculation is presented and compared with a similar SIMMER-II calculation. A subjective assessment of the AFDM developments is given, and areas where future work is possible are detailed. 10 refs.
Robustness of continuous-time adaptive control algorithms in the presence of unmodeled dynamics
NASA Technical Reports Server (NTRS)
Rohrs, C. E.; Valavani, L.; Athans, M.; Stein, G.
1985-01-01
This paper examines the robustness properties of existing adaptive control algorithms to unmodeled plant high-frequency dynamics and unmeasurable output disturbances. It is demonstrated that there exist two infinite-gain operators in the nonlinear dynamic system which determines the time-evolution of output and parameter errors. The pragmatic implications of the existence of such infinite-gain operators is that: (1) sinusoidal reference inputs at specific frequencies and/or (2) sinusoidal output disturbances at any frequency (including dc), can cause the loop gain to increase without bound, thereby exciting the unmodeled high-frequency dynamics, and yielding an unstable control system. Hence, it is concluded that existing adaptive control algorithms as they are presented in the literature referenced in this paper, cannot be used with confidence in practical designs where the plant contains unmodeled dynamics because instability is likely to result. Further understanding is required to ascertain how the currently implemented adaptive systems differ from the theoretical systems studied here and how further theoretical development can improve the robustness of adaptive controllers.
Adaptive control for space debris removal with uncertain kinematics, dynamics and states
NASA Astrophysics Data System (ADS)
Huang, Panfeng; Zhang, Fan; Meng, Zhongjie; Liu, Zhengxiong
2016-11-01
As the Tethered Space Robot is considered to be a promising solution for the Active Debris Removal, a lot of problems arise in the approaching, capturing and removing phases. Particularly, kinematics and dynamics parameters of the debris are unknown, and parts of the states are unmeasurable according to the specifics of tether, which is a tough problem for the target retrieval/de-orbiting. This work proposes a full adaptive control strategy for the space debris removal via a Tethered Space Robot with unknown kinematics, dynamics and part of the states. First we derive a dynamics model for the retrieval by treating the base satellite (chaser) and the unknown space debris (target) as rigid bodies in the presence of offsets, and involving the flexibility and elasticity of tether. Then, a full adaptive controller is presented including a control law, a dynamic adaption law, and a kinematic adaption law. A modified controller is also presented according to the peculiarities of this system. Finally, simulation results are presented to illustrate the performance of two proposed controllers.
Method and system for training dynamic nonlinear adaptive filters which have embedded memory
NASA Technical Reports Server (NTRS)
Rabinowitz, Matthew (Inventor)
2002-01-01
Described herein is a method and system for training nonlinear adaptive filters (or neural networks) which have embedded memory. Such memory can arise in a multi-layer finite impulse response (FIR) architecture, or an infinite impulse response (IIR) architecture. We focus on filter architectures with separate linear dynamic components and static nonlinear components. Such filters can be structured so as to restrict their degrees of computational freedom based on a priori knowledge about the dynamic operation to be emulated. The method is detailed for an FIR architecture which consists of linear FIR filters together with nonlinear generalized single layer subnets. For the IIR case, we extend the methodology to a general nonlinear architecture which uses feedback. For these dynamic architectures, we describe how one can apply optimization techniques which make updates closer to the Newton direction than those of a steepest descent method, such as backpropagation. We detail a novel adaptive modified Gauss-Newton optimization technique, which uses an adaptive learning rate to determine both the magnitude and direction of update steps. For a wide range of adaptive filtering applications, the new training algorithm converges faster and to a smaller value of cost than both steepest-descent methods such as backpropagation-through-time, and standard quasi-Newton methods. We apply the algorithm to modeling the inverse of a nonlinear dynamic tracking system 5, as well as a nonlinear amplifier 6.
Design implementation and control of MRAS error dynamics. [Model-Reference Adaptive System
NASA Technical Reports Server (NTRS)
Colburn, B. K.; Boland, J. S., III
1974-01-01
Use is made of linearized error characteristic equation for model-reference adaptive systems to determine a parameter adjustment rule for obtaining time-invariant error dynamics. Theoretical justification of error stability is given and an illustrative example included to demonstrate the utility of the proposed technique.
NASA Astrophysics Data System (ADS)
Dilling, L.; Daly, M.; Travis, W.; Wilhelmi, O.; Klein, R.; Kenney, D.; Ray, A. J.; Miller, K.
2013-12-01
Recent reports and scholarship have suggested that adapting to current climate variability may represent a "no regrets" strategy for adapting to climate change. Filling "adaptation deficits" and other approaches that rely on addressing current vulnerabilities are of course helpful for responding to current climate variability, but we find here that they are not sufficient for adapting to climate change. First, following a comprehensive review and unique synthesis of the natural hazards and climate adaptation literatures, we advance six reasons why adapting to climate variability is not sufficient for adapting to climate change: 1) Vulnerability is different at different levels of exposure; 2) Coping with climate variability is not equivalent to adaptation to longer term change; 3) The socioeconomic context for vulnerability is constantly changing; 4) The perception of risk associated with climate variability does not necessarily promote adaptive behavior in the face of climate change; 5) Adaptations made to short term climate variability may reduce the flexibility of the system in the long term; and 6) Adaptive actions may shift vulnerabilities to other parts of the system or to other people. Instead we suggest that decision makers faced with choices to adapt to climate change must consider the dynamics of vulnerability in a connected system-- how choices made in one part of the system might impact other valued outcomes or even create new vulnerabilities. Furthermore we suggest that rather than expressing climate change adaptation as an extension of adaptation to climate variability, the research and practice communities would do well to articulate adaptation as an imperfect policy, with tradeoffs and consequences and that decisions be prioritized to preserve flexibility be revisited often as climate change unfolds. We then present the results of a number of empirical studies of decision making for drought in urban water systems in the United States to understand
Segmentation of Tracking Sequences Using Dynamically Updated Adaptive Learning
Michailovich, Oleg; Tannenbaum, Allen
2009-01-01
The problem of segmentation of tracking sequences is of central importance in a multitude of applications. In the current paper, a different approach to the problem is discussed. Specifically, the proposed segmentation algorithm is implemented in conjunction with estimation of the dynamic parameters of moving objects represented by the tracking sequence. While the information on objects’ motion allows one to transfer some valuable segmentation priors along the tracking sequence, the segmentation allows substantially reducing the complexity of motion estimation, thereby facilitating the computation. Thus, in the proposed methodology, the processes of segmentation and motion estimation work simultaneously, in a sort of “collaborative” manner. The Bayesian estimation framework is used here to perform the segmentation, while Kalman filtering is used to estimate the motion and to convey useful segmentation information along the image sequence. The proposed method is demonstrated on a number of both computed-simulated and real-life examples, and the obtained results indicate its advantages over some alternative approaches. PMID:19004712
The tug-of-war: fidelity versus adaptation throughout the health promotion program life cycle.
Bopp, Melissa; Saunders, Ruth P; Lattimore, Diana
2013-06-01
Researchers across multiple fields have described the iterative and nonlinear phases of the translational research process from program development to dissemination. This process can be conceptualized within a "program life cycle" framework that includes overlapping and nonlinear phases: development, adoption, implementation, maintenance, sustainability or termination, and dissemination or diffusion, characterized by tensions between fidelity to the original plan and adaptation for the setting and population. In this article, we describe the life cycle (phases) for research-based health promotion programs, the key influences at each phase, and the issues related to the tug-of-war between fidelity and adaptation throughout the process using a fictionalized case study based on our previous research. This article suggests the importance of reconceptualizing intervention design, involving stakeholders, and monitoring fidelity and adaptation throughout all phases to maintain implementation fidelity and completeness. Intervention fidelity should be based on causal mechanisms to ensure effectiveness, while allowing for appropriate adaption to ensure maximum implementation and sustainability. Recommendations for future interventions include considering the determinants of implementation including contextual factors at each phase, the roles of stakeholders, and the importance of developing a rigorous, adaptive, and flexible definition of implementation fidelity and completeness.
NASA Astrophysics Data System (ADS)
Jin, Xiao-Zheng; Yang, Guang-Hong
2011-03-01
In this article, a robust tracking control problem of a class of dynamical complex networks is presented through a distributed adaptive approach. Uncertain network topology with unknown coupling strength, delayed and perturbed communications and external disturbances are considered, while the bounds of channel noises and coupling delays and disturbances are assumed to be unknown. Adaptation laws are proposed to estimate the network coupling strength and the upper and lower bounds of communication state errors and disturbances on-line. Based on the information from adaptive schemes, a class of distributed robust adaptive controllers is constructed to automatically compensate for the imperfect network and disturbance effects. Then, according to the Lyapunov stability theory, it is shown that the achievement of tracking for complex networks is effective on imperfect communications and disturbances. The effectiveness of the proposed design is illustrated via a decoupled longitudinal model of an F-18 aircraft.
Neural network-based adaptive dynamic surface control for permanent magnet synchronous motors.
Yu, Jinpeng; Shi, Peng; Dong, Wenjie; Chen, Bing; Lin, Chong
2015-03-01
This brief considers the problem of neural networks (NNs)-based adaptive dynamic surface control (DSC) for permanent magnet synchronous motors (PMSMs) with parameter uncertainties and load torque disturbance. First, NNs are used to approximate the unknown and nonlinear functions of PMSM drive system and a novel adaptive DSC is constructed to avoid the explosion of complexity in the backstepping design. Next, under the proposed adaptive neural DSC, the number of adaptive parameters required is reduced to only one, and the designed neural controllers structure is much simpler than some existing results in literature, which can guarantee that the tracking error converges to a small neighborhood of the origin. Then, simulations are given to illustrate the effectiveness and potential of the new design technique.
NASA Technical Reports Server (NTRS)
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.
ERIC Educational Resources Information Center
Hull, Peter
1978-01-01
Describes an interactive computer program which can be used by students to construct adaptive landscapes of two types as an illustration of the expected effects of selection. Simulates effects of selection on populations of this type and changes of gene frequency can be plotted on the same contour map. (Author/MA)
Exploring the Identity Formation of Youth Involved in an Adapted Sports Program.
ERIC Educational Resources Information Center
Groff, Diane G.; Kleiber, Douglas A.
2001-01-01
Investigated the relationship between involvement in an after-school adapted sports program and identity formation among adolescents with physical disabilities. Participant interviews indicated that participation provided most adolescents with a heightened sense of competence and opportunities to express their true selves. It also led to decreased…
Establishing Adaptive Sports Programs for Youth with Moderate to Severe Disabilities
ERIC Educational Resources Information Center
Ryan, Joseph B.; Katsiyannis, Antonis; Cadorette, Deborah; Hodge, Janie; Markham, Michelle
2014-01-01
Children with disabilities are at increased risk of health risk factors including obesity, often because of low levels of physical activity and limited participation in sports. However, organized adaptive sports programs are increasingly available for individuals with disabilities. This article provides recommendations for establishing successful…
Program of Adaptation Assistance in Foster Families and Particular Features of Its Implementation
ERIC Educational Resources Information Center
Zakirova, Venera G.; Gaysina, Guzel I.; Zhumabaeva, Asia
2015-01-01
Relevance of the problem stated in the article, conditioned by the fact that the successful adaptation of orphans in a foster family requires specialized knowledge and skills, as well as the need of professional support. Therefore, this article aims at substantiation of the effectiveness of the developed pilot program psycho-pedagogical support of…
ERIC Educational Resources Information Center
Scholl, Mark B.; Cascone, Jason
2010-01-01
The authors present the constructivist resume, an original approach developed to promote professional identity development and career adaptability (i.e., concern, curiosity, confidence, and control) in students completing graduate-level counselor training programs. The authors discuss underlying theories, including Super's (1990; Super, Savickas,…
Adapting to Changing Expectations: Post-Graduate Students' Experience of an E-Learning Tax Program
ERIC Educational Resources Information Center
Engelbrecht, Elmarie
2005-01-01
In response to the impact of information and communication technology on traditional business and commerce practices, and the empowerment of individuals by the growth of information available on the Internet, educators are challenged to adapt the curricula and delivery modes of educational programs for knowledge workers, such as tax accountants.…
ERIC Educational Resources Information Center
KANTER, EARL F.; BENDER, RALPH E.
THE PURPOSE OF THIS NATIONAL STUDY WAS TO SUGGEST WAYS OF ADAPTING THE FUTURE FARMERS OF AMERICA (FFA) TO A CHANGING PROGRAM OF VOCATIONAL AGRICULTURE THROUGH IDENTIFYING NEW PURPOSES OF THE FFA AND EVALUATING SELECTED OPERATIONAL GUIDELINES AND NATIONAL AND STATE FFA ACTIVITIES. MEMBERS OF THE UNITED STATES OFFICE OF EDUCATION, HEAD STATE…
An Adapted Dialogic Reading Program for Turkish Kindergarteners from Low Socio-Economic Backgrounds
ERIC Educational Resources Information Center
Ergül, Cevriye; Akoglu, Gözde; Sarica, Ayse D.; Karaman, Gökçe; Tufan, Mümin; Bahap-Kudret, Zeynep; Zülfikar, Deniz
2016-01-01
The study aimed to examine the effectiveness of the Adapted Dialogic Reading Program (ADR) on the language and early literacy skills of Turkish kindergarteners from low socio-economic (SES) backgrounds. The effectiveness of ADR was investigated across six different treatment conditions including classroom and home based implementations in various…
A reduced adaptive observer for multivariable systems. [using reduced dynamic ordering
NASA Technical Reports Server (NTRS)
Carroll, R. L.; Lindorff, D. P.
1973-01-01
An adaptive observer for multivariable systems is presented for which the dynamic order of the observer is reduced, subject to mild restrictions. The observer structure depends directly upon the multivariable structure of the system rather than a transformation to a single-output system. The number of adaptive gains is at most the sum of the order of the system and the number of input parameters being adapted. Moreover, for the relatively frequent specific cases for which the number of required adaptive gains is less than the sum of system order and input parameters, the number of these gains is easily determined by inspection of the system structure. This adaptive observer possesses all the properties ascribed to the single-input single-output adpative observer. Like the other adaptive observers some restriction is required of the allowable system command input to guarantee convergence of the adaptive algorithm, but the restriction is more lenient than that required by the full-order multivariable observer. This reduced observer is not restricted to cycle systems.
Adaptive wavelet simulation of global ocean dynamics using a new Brinkman volume penalization
NASA Astrophysics Data System (ADS)
Kevlahan, N. K.-R.; Dubos, T.; Aechtner, M.
2015-12-01
In order to easily enforce solid-wall boundary conditions in the presence of complex coastlines, we propose a new mass and energy conserving Brinkman penalization for the rotating shallow water equations. This penalization does not lead to higher wave speeds in the solid region. The error estimates for the penalization are derived analytically and verified numerically for linearized one-dimensional equations. The penalization is implemented in a conservative dynamically adaptive wavelet method for the rotating shallow water equations on the sphere with bathymetry and coastline data from NOAA's ETOPO1 database. This code could form the dynamical core for a future global ocean model. The potential of the dynamically adaptive ocean model is illustrated by using it to simulate the 2004 Indonesian tsunami and wind-driven gyres.
Group Dynamics and Initiative Activities with Outdoor Programs.
ERIC Educational Resources Information Center
Zwaagstra, Lynn
This paper focuses on group dynamics and introduces the use of initiative activities as a means of facilitating a more cohesive group experience in outdoor programs. Specific topics addressed and defined include: (1) curative factors of groups (universality, didactic learning, altruism, socialization, peer learning, group cohesiveness); (2) stages…
Dynamic Programming Algorithms and Analyses for Nonserial Networks. Part I.
1983-01-01
Journal of Mathematical Analysis and Applications , Vol...Multistage Systems," Journal of Mathematical Analysis and Applications , Vol. 21, 1968, pp. 426-430. 4. Bellman, R.E.,A.O. Esogbue, and I. Nabeshima...the Secondary Optimization Problem in Nonserial Dynamic Programming," Journal of Mathematical Analysis and Applications , Vol. 27, 1969, pp. 565-574.
Dynamic reconstruction and multivariable control for force-actuated, thin facesheet adaptive optics
NASA Astrophysics Data System (ADS)
Grocott, Simon C. O.
1997-10-01
The Multiple Mirror Telescope (MMT) under development at the University of Arizona takes a new approach in adaptive optics placing a large (0.65 m) force-actuated, thin facesheet deformable mirror at the secondary of an astronomical telescope, thus reducing the effects of emissivity which are important in IR astronomy. However, the large size of the mirror and low stiffness actuators used drive the natural frequencies of the mirror down into the bandwidth of the atmospheric distortion. Conventional adaptive optics takes a quasi-static approach to controlling the deformable mirror. However, flexibility within the control bandwidth calls for a new approach to adaptive optics. Dynamic influence functions are used to characterize the influence of each actuator on the surface of the deformable mirror. A linearized model of atmospheric distortion is combined with dynamic influence functions to produce a dynamic reconstructor. This dynamic reconstructor is recognized as an optimal control problem. Solving the optimal control problem for a system with hundreds of actuators and sensors is formidable. Exploiting the circularly symmetric geometry of the mirror, and a suitable model of atmospheric distortion, the control problem is divided into a number of smaller decoupled control problems using circulant matrix theory. A hierarchic control scheme which seeks to emulate the quasi-static control approach that is generally used in adaptive optics is compared to the proposed dynamic reconstruction technique. Although dynamic reconstruction requires somewhat more computational power to implement, it achieves better performance with less power usage, and is less sensitive than the hierarchic technique. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253- 1690).
Dynamic analysis of spur gears using computer program DANST
NASA Astrophysics Data System (ADS)
Oswald, Fred B.; Lin, Hsiang Hsi; Liou, Chuen-Huei; Valco, Mark J.
1993-06-01
DANST is a computer program for static and dynamic analysis of spur gear systems. The program can be used for parametric studies to predict the effect on dynamic load and tooth bending stress of spur gears due to operating speed, torque, stiffness, damping, inertia, and tooth profile. DANST performs geometric modeling and dynamic analysis for low- or high-contact-ratio spur gears. DANST can simulate gear systems with contact ratio ranging from one to three. It was designed to be easy to use, and it is extensively documented by comments in the source code. This report describes the installation and use of DANST. It covers input data requirements and presents examples. The report also compares DANST predictions for gear tooth loads and bending stress to experimental and finite element results.
Dynamic analysis of spur gears using computer program DANST
NASA Technical Reports Server (NTRS)
Oswald, Fred B.; Lin, Hsiang Hsi; Liou, Chuen-Huei; Valco, Mark J.
1993-01-01
DANST is a computer program for static and dynamic analysis of spur gear systems. The program can be used for parametric studies to predict the effect on dynamic load and tooth bending stress of spur gears due to operating speed, torque, stiffness, damping, inertia, and tooth profile. DANST performs geometric modeling and dynamic analysis for low- or high-contact-ratio spur gears. DANST can simulate gear systems with contact ratio ranging from one to three. It was designed to be easy to use, and it is extensively documented by comments in the source code. This report describes the installation and use of DANST. It covers input data requirements and presents examples. The report also compares DANST predictions for gear tooth loads and bending stress to experimental and finite element results.
Dynamic analysis of spur gears using computer program DANST
Oswald, F.B.; Lin, H.H.; Liou, Chuenheui; Valco, M.J.
1993-06-01
DANST is a computer program for static and dynamic analysis of spur gear systems. The program can be used for parametric studies to predict the effect on dynamic load and tooth bending stress of spur gears due to operating speed, torque, stiffness, damping, inertia, and tooth profile. DANST performs geometric modeling and dynamic analysis for low- or high-contact-ratio spur gears. DANST can simulate gear systems with contact ratio ranging from one to three. It was designed to be easy to use, and it is extensively documented by comments in the source code. This report describes the installation and use of DANST. It covers input data requirements and presents examples. The report also compares DANST predictions for gear tooth loads and bending stress to experimental and finite element results. 14 refs.
Effects of an adapted physical activity program on psychophysical health in elderly women
Battaglia, Giuseppe; Bellafiore, Marianna; Alesi, Marianna; Paoli, Antonio; Bianco, Antonino; Palma, Antonio
2016-01-01
Background Several studies have shown the positive effects of adapted physical activity (APA) on physical and mental health (MH) during the lifetime. The aim of this study was to assess the effectiveness of a specific APA intervention program in the improvement of the health-related quality of life (QOL) and functional condition of spine in elderly women. Methods Thirty women were recruited from a senior center and randomly assigned to two groups: control group (CG; age: 69.69±7.94 years, height: 1.57±0.06 m, weight: 68.42±8.18 kg, body mass index [BMI]: 27.88±2.81) and trained group (TG; age: 68.35±6.04 years, height: 1.55±0.05 m, weight: 64.78±10.16 kg, BMI: 26.98±3.07). The APA program was conducted for 8 weeks, with two training sessions/week. CG did not perform any physical activity during the study. Spinal angles were evaluated by SpinalMouse® (Idiag, Volkerswill, Switzerland); health-related QOL was evaluated by SF-36 Health Survey, which assesses physical component summary (PCS-36), mental component summary (MCS-36), and eight subscales: physical functioning, role-physical, bodily pain, general health perception, role-emotional, social functioning, vitality, and MH. All measures were recorded before and after the experimental period. Results In TG, compared to CG, the two-way analysis of variance with repeated measures with Bonferroni post hoc test showed a relevant improvement in lumbar spinal angle (°) and in SF-36 outcomes after the intervention period. We showed a significant increase in physical functioning, bodily pain, and MH subscales and in PCS-36 and MCS-36 scores in TG compared to CG. In particular, from baseline to posttest, we found that in TG, the PCS-36 and MCS-36 scores increased by 13.20% and 11.64%, respectively. Conclusion We believe that an 8-week APA intervention program is able to improve psychophysical heath in elderly people. During the aging process, a dynamic lifestyle, including regular physical activity, is a crucial
BRANECODE: A program for simulations of braneworld dynamics
NASA Astrophysics Data System (ADS)
Martin, Johannes U.; Felder, Gary N.; Frolov, Andrei V.; Kofman, Lev; Peloso, Marco
2005-09-01
We describe an algorithm and a C++ implementation that we have written and made available for calculating the fully nonlinear evolution of 5D braneworld models with scalar fields. Bulk fields allow for the stabilization of the extra dimension. However, they complicate the dynamics of the system, so that analytic calculations (performed within an effective 4D theory) are usually only reliable for static bulk configurations or when the evolution of the extra dimension is negligible. In the general case, the nonlinear 5D dynamics can be studied numerically, and the algorithm and code we describe are the first ones of that type designed for this task. The program and its full documentation are available on the Web at http://www.cita.utoronto.ca/~jmartin/BRANECODE/.1We also maintain a mirror of the BRANECODE website at http://www.cita.utoronto.ca/~kofman/BRANECODE/. In this paper we provide a brief overview of what the program does and how to use it. Catalogue identifier: ADVX Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADVX Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Licensing provisions: none Operating systems under which the program has been tested: Linux Programming language used: C++ Memory required to execute with typical data: less than 1 MB Has the code been vectorized?: no Peripherals used: none No. of lines in distributed program, including test data, etc.: 8277 No. of bytes in distributed program, including test data, etc.: 74 939 CPC Program Library subprograms used: none Nature of physical problem: Dynamics of two co-dimension one branes in a five-dimensional spacetime with a bulk scalar field and arbitrary potentials. The dynamics is governed by the five dimensional Einstein equations of gravity and the junction conditions at the position of the branes. Method of solution: Leapfrog algorithm to solve system of (1+1)-dimensional partial differential equations; Initial and boundary value problem
Dynamic Load Balancing for Adaptive Computations on Distributed-Memory Machines
NASA Technical Reports Server (NTRS)
1999-01-01
Dynamic load balancing is central to adaptive mesh-based computations on large-scale parallel computers. The principal investigator has investigated various issues on the dynamic load balancing problem under NASA JOVE and JAG rants. The major accomplishments of the project are two graph partitioning algorithms and a load balancing framework. The S-HARP dynamic graph partitioner is known to be the fastest among the known dynamic graph partitioners to date. It can partition a graph of over 100,000 vertices in 0.25 seconds on a 64- processor Cray T3E distributed-memory multiprocessor while maintaining the scalability of over 16-fold speedup. Other known and widely used dynamic graph partitioners take over a second or two while giving low scalability of a few fold speedup on 64 processors. These results have been published in journals and peer-reviewed flagship conferences.
An adaptive structure data acquisition system using a graphical-based programming language
NASA Technical Reports Server (NTRS)
Baroth, Edmund C.; Clark, Douglas J.; Losey, Robert W.
1992-01-01
An example of the implementation of data fusion using a PC and a graphical programming language is discussed. A schematic of the data acquisition system and user interface panel for an adaptive structure test are presented. The computer programs (a series of icons 'wired' together) are also discussed. The way in which using graphical-based programming software to control a data acquisition system can simplify analysis of data, promote multidisciplinary interaction, and provide users a more visual key to understanding their data are shown.
Adaptive Kalman filtering methods for tracking GPS signals in high noise/high dynamic environments
NASA Astrophysics Data System (ADS)
Zuo, Qiyao; Yuan, Hong; Lin, Baojun
2007-11-01
GPS C/A signal tracking algorithms have been developed based on adaptive Kalman filtering theory. In the research, an adaptive Kalman filter is used to substitute for standard tracking loop filters. The goal is to improve estimation accuracy and tracking stabilization in high noise and high dynamic environments. The linear dynamics model and the measurements model are designed to estimate code phase, carrier phase, Doppler shift, and rate of change of Doppler shift. Two adaptive algorithms are applied to improve robustness and adaptive faculty of the tracking, one is Sage adaptive filtering approach and the other is strong tracking method. Both the new algorithms and the conventional tracking loop have been tested by using simulation data. In the simulation experiment, the highest jerk of the receiver is set to 10G m/s 3 with the lowest C/No 30dBHz. The results indicate that the Kalman filtering algorithms are more robust than the standard tracking loop, and performance of tracking loop using the algorithms is satisfactory in such extremely adverse circumstances.
Sharif, Behzad; Derbyshire, J. Andrew; Faranesh, Anthony Z.; Bresler, Yoram
2010-01-01
MR imaging of the human heart without explicit cardiac synchronization promises to extend the applicability of cardiac MR to a larger patient population and potentially expand its diagnostic capabilities. However, conventional non-gated imaging techniques typically suffer from low image quality or inadequate spatio-temporal resolution and fidelity. Patient-Adaptive Reconstruction and Acquisition in Dynamic Imaging with Sensitivity Encoding (PARADISE) is a highly-accelerated non-gated dynamic imaging method that enables artifact-free imaging with high spatio-temporal resolutions by utilizing novel computational techniques to optimize the imaging process. In addition to using parallel imaging, the method gains acceleration from a physiologically-driven spatio-temporal support model; hence, it is doubly accelerated. The support model is patient-adaptive, i.e., its geometry depends on dynamics of the imaged slice, e.g., subject’s heart-rate and heart location within the slice. The proposed method is also doubly adaptive as it adapts both the acquisition and reconstruction schemes. Based on the theory of time-sequential sampling, the proposed framework explicitly accounts for speed limitations of gradient encoding and provides performance guarantees on achievable image quality. The presented in-vivo results demonstrate the effectiveness and feasibility of the PARADISE method for high resolution non-gated cardiac MRI during a short breath-hold. PMID:20665794
Fonteyn, Ella M R; Heeren, Anita; Engels, Jasper-Jan C; Boer, Jasper J Den; van de Warrenburg, Bart P C; Weerdesteyn, Vivian
2014-01-01
Balance and gait problems in patients with cerebellar degeneration lead to reduced mobility, loss of independence, and frequent falls. It is currently unclear, however, whether balance and gait capacities can be improved by training in this group of patients. Therefore, the aim of this study was to examine the effects of gait adaptability training on obstacle avoidance and dynamic stability during adaptive gait. Ten patients with degenerative cerebellar ataxia received 10 protocolized gait adaptability training sessions of 1 h each during 5 weeks. Training was performed on a treadmill with visual stepping targets and obstacles projected on the belt's surface. As the primary outcome, we used an obstacle avoidance task while walking on a treadmill. We determined avoidance success rates, as well as dynamic stability during the avoidance manoeuvre. Clinical ratings included the scale for the assessment of ataxia (SARA), 10 m walking test, timed up-and-go test, berg balance scale, and the obstacle subtask of the emory functional ambulation profile (EFAP). Following the intervention, success rates on the obstacle avoidance task had significantly improved compared to pre-intervention. For successful avoidance, participants allowed themselves smaller stability margins in the sagittal plane in the (shortened) pre-crossing step. However, in the subsequent steps they returned to baseline stability values more effectively than before training. SARA scores and the EFAP obstacle subtask improved significantly as well. This pilot study provides preliminary evidence of a beneficial effect of gait adaptability training on obstacle avoidance capacity and dynamic stability in patients with cerebellar degeneration.
Adapting an evidence based parenting program for child welfare involved teens and their caregivers
Barkan, Susan E.; Salazar, Amy M.; Estep, Kara; Mattos, Leah M.; Eichenlaub, Caroline; Haggerty, Kevin P.
2015-01-01
The scarcity of caregivers and the unique vulnerability of teens involved with the child welfare system necessitate effective strategies for ensuring that caregivers are prepared and supported in the important role they play with children and youth within the child welfare system. They are in a position, through the establishment of a strong, positive, supportive connection with the youth, to potentially minimize the impacts of recent trauma and interrupt a negative trajectory by preventing the youth’s initiation of high-risk behavior. In this paper we describe the process used to systematically adapt Staying Connected with Your Teen™, an evidence-based, prevention-focused parenting program found in other studies to reduce the initiation of teens‘ risky behaviors, for use with foster teens and their relative or foster caregivers. This work has been guided by the ADAPT-ITT framework developed by Wingood and DiClemente (2008) for adapting evidence-based interventions. Qualitative work conducted in Phase 1 of this study identified the need for the development of a trusted connection between foster youth and their caregivers, as well as tools for helping them access community resources, social services, and educational supports. This paper describes the process used to develop new and adapted program activities in response to the needs identified in Phase 1. We conducted a theater test with dyads of foster youth and their caregivers to get feedback on the new activities. Findings from the theater test are provided and next steps in the research are discussed which include examining program usability, fidelity, feasibility, and testing this new prevention program that has been tailored for child welfare involved youth and their caregivers. This intervention program has the potential to fill an important gap in the availability of preventive programming for caregivers of teens in foster care. PMID:26052172
An adaptable neuromorphic model of orientation selectivity based on floating gate dynamics
Gupta, Priti; Markan, C. M.
2014-01-01
The biggest challenge that the neuromorphic community faces today is to build systems that can be considered truly cognitive. Adaptation and self-organization are the two basic principles that underlie any cognitive function that the brain performs. If we can replicate this behavior in hardware, we move a step closer to our goal of having cognitive neuromorphic systems. Adaptive feature selectivity is a mechanism by which nature optimizes resources so as to have greater acuity for more abundant features. Developing neuromorphic feature maps can help design generic machines that can emulate this adaptive behavior. Most neuromorphic models that have attempted to build self-organizing systems, follow the approach of modeling abstract theoretical frameworks in hardware. While this is good from a modeling and analysis perspective, it may not lead to the most efficient hardware. On the other hand, exploiting hardware dynamics to build adaptive systems rather than forcing the hardware to behave like mathematical equations, seems to be a more robust methodology when it comes to developing actual hardware for real world applications. In this paper we use a novel time-staggered Winner Take All circuit, that exploits the adaptation dynamics of floating gate transistors, to model an adaptive cortical cell that demonstrates Orientation Selectivity, a well-known biological phenomenon observed in the visual cortex. The cell performs competitive learning, refining its weights in response to input patterns resembling different oriented bars, becoming selective to a particular oriented pattern. Different analysis performed on the cell such as orientation tuning, application of abnormal inputs, response to spatial frequency and periodic patterns reveal close similarity between our cell and its biological counterpart. Embedded in a RC grid, these cells interact diffusively exhibiting cluster formation, making way for adaptively building orientation selective maps in silicon. PMID
Abakumov, A I
2000-01-01
The general approach for modelling of abundance dynamic of biological populations and communities is offered. The mechanisms of individual adaptation in changing environment are considered. The approach is detailed for population models without structure and with age structure. The property of solutions are investigated. As examples the author studies the concrete definitions of general models by analogy with models of Ricker and May. Theoretical analysis and calculations shows that survival of model population in extreme situation increases if adaptive behaviour is taking into account.
NASA Technical Reports Server (NTRS)
Campbell, Stefan F.; Kaneshige, John T.
2010-01-01
Presented here is a Predictor-Based Model Reference Adaptive Control (PMRAC) architecture for a generic transport aircraft. At its core, this architecture features a three-axis, non-linear, dynamic-inversion controller. Command inputs for this baseline controller are provided by pilot roll-rate, pitch-rate, and sideslip commands. This paper will first thoroughly present the baseline controller followed by a description of the PMRAC adaptive augmentation to this control system. Results are presented via a full-scale, nonlinear simulation of NASA s Generic Transport Model (GTM).
Adaptive identification and control of structural dynamics systems using recursive lattice filters
NASA Technical Reports Server (NTRS)
Sundararajan, N.; Montgomery, R. C.; Williams, J. P.
1985-01-01
A new approach for adaptive identification and control of structural dynamic systems by using least squares lattice filters thar are widely used in the signal processing area is presented. Testing procedures for interfacing the lattice filter identification methods and modal control method for stable closed loop adaptive control are presented. The methods are illustrated for a free-free beam and for a complex flexible grid, with the basic control objective being vibration suppression. The approach is validated by using both simulations and experimental facilities available at the Langley Research Center.
Adaptive Network Dynamics - Modeling and Control of Time-Dependent Social Contacts
Schwartz, Ira B.; Shaw, Leah B.; Shkarayev, Maxim S.
2013-01-01
Real networks consisting of social contacts do not possess static connections. That is, social connections may be time dependent due to a variety of individual behavioral decisions based on current network connections. Examples of adaptive networks occur in epidemics, where information about infectious individuals may change the rewiring of healthy people, or in the recruitment of individuals to a cause or fad, where rewiring may optimize recruitment of susceptible individuals. In this paper, we will review some of the dynamical properties of adaptive networks, and show how they predict novel phenomena as well as yield insight into new controls. The applications will be control of epidemic outbreaks and terrorist recruitment modeling. PMID:25414913
NASA Astrophysics Data System (ADS)
Bargatze, L. F.
2015-12-01
Active Data Archive Product Tracking (ADAPT) is a collection of software routines that permits one to generate XML metadata files to describe and register data products in support of the NASA Heliophysics Virtual Observatory VxO effort. ADAPT is also a philosophy. The ADAPT concept is to use any and all available metadata associated with scientific data to produce XML metadata descriptions in a consistent, uniform, and organized fashion to provide blanket access to the full complement of data stored on a targeted data server. In this poster, we present an application of ADAPT to describe all of the data products that are stored by using the Common Data File (CDF) format served out by the CDAWEB and SPDF data servers hosted at the NASA Goddard Space Flight Center. These data servers are the primary repositories for NASA Heliophysics data. For this purpose, the ADAPT routines have been used to generate data resource descriptions by using an XML schema named Space Physics Archive, Search, and Extract (SPASE). SPASE is the designated standard for documenting Heliophysics data products, as adopted by the Heliophysics Data and Model Consortium. The set of SPASE XML resource descriptions produced by ADAPT includes high-level descriptions of numerical data products, display data products, or catalogs and also includes low-level "Granule" descriptions. A SPASE Granule is effectively a universal access metadata resource; a Granule associates an individual data file (e.g. a CDF file) with a "parent" high-level data resource description, assigns a resource identifier to the file, and lists the corresponding assess URL(s). The CDAWEB and SPDF file systems were queried to provide the input required by the ADAPT software to create an initial set of SPASE metadata resource descriptions. Then, the CDAWEB and SPDF data repositories were queried subsequently on a nightly basis and the CDF file lists were checked for any changes such as the occurrence of new, modified, or deleted
An Experimental Trial of Adaptive Programming in Drug Court: Outcomes at 6, 12 and 18 Months
Marlowe, Douglas B.; Festinger, David S.; Dugosh, Karen L.; Benasutti, Kathleen M.; Fox, Gloria; Harron, Ashley
2013-01-01
Objectives Test whether an adaptive program improves outcomes in drug court by adjusting the schedule of court hearings and clinical case-management sessions pursuant to a priori performance criteria. Methods Consenting participants in a misdemeanor drug court were randomly assigned to the adaptive program (n = 62) or to a baseline-matching condition (n = 63) in which they attended court hearings based on the results of a criminal risk assessment. Outcome measures were re-arrest rates at 18 months post-entry to the drug court and urine drug test results and structured interview results at 6 and 12 months post-entry. Results Although previously published analyses revealed significantly fewer positive drug tests for participants in the adaptive condition during the first 18 weeks of drug court, current analyses indicate the effects converged during the ensuing year. Between-group differences in new arrest rates, urine drug test results and self-reported psychosocial problems were small and non-statistically significant at 6, 12 and 18 months post-entry. A non-significant trend (p = .10) suggests there may have been a small residual impact (Cramer's ν = .15) on new misdemeanor arrests after 18 months. Conclusions Adaptive programming shows promise for enhancing short-term outcomes in drug courts; however, additional efforts are needed to extend the effects beyond the first 4 to 6 months of enrollment. PMID:25346652
Melis, Theodore S.; Walters, Carl; Korman, Josh
2015-01-01
With a focus on resources of the Colorado River ecosystem below Glen Canyon Dam, the Glen Canyon Dam Adaptive Management Program has included a variety of experimental policy tests, ranging from manipulation of water releases from the dam to removal of non-native fish within Grand Canyon National Park. None of these field-scale experiments has yet produced unambiguous results in terms of management prescriptions. But there has been adaptive learning, mostly from unanticipated or surprising resource responses relative to predictions from ecosystem modeling. Surprise learning opportunities may often be viewed with dismay by some stakeholders who might not be clear about the purpose of science and modeling in adaptive management. However, the experimental results from the Glen Canyon Dam program actually represent scientific successes in terms of revealing new opportunities for developing better river management policies. A new long-term experimental management planning process for Glen Canyon Dam operations, started in 2011 by the U.S. Department of the Interior, provides an opportunity to refocus management objectives, identify and evaluate key uncertainties about the influence of dam releases, and refine monitoring for learning over the next several decades. Adaptive learning since 1995 is critical input to this long-term planning effort. Embracing uncertainty and surprise outcomes revealed by monitoring and ecosystem modeling will likely continue the advancement of resource objectives below the dam, and may also promote efficient learning in other complex programs.
NASA Astrophysics Data System (ADS)
Schwing, Alan Michael
For computational fluid dynamics, the governing equations are solved on a discretized domain of nodes, faces, and cells. The quality of the grid or mesh can be a driving source for error in the results. While refinement studies can help guide the creation of a mesh, grid quality is largely determined by user expertise and understanding of the flow physics. Adaptive mesh refinement is a technique for enriching the mesh during a simulation based on metrics for error, impact on important parameters, or location of important flow features. This can offload from the user some of the difficult and ambiguous decisions necessary when discretizing the domain. This work explores the implementation of adaptive mesh refinement in an implicit, unstructured, finite-volume solver. Consideration is made for applying modern computational techniques in the presence of hanging nodes and refined cells. The approach is developed to be independent of the flow solver in order to provide a path for augmenting existing codes. It is designed to be applicable for unsteady simulations and refinement and coarsening of the grid does not impact the conservatism of the underlying numerics. The effect on high-order numerical fluxes of fourth- and sixth-order are explored. Provided the criteria for refinement is appropriately selected, solutions obtained using adapted meshes have no additional error when compared to results obtained on traditional, unadapted meshes. In order to leverage large-scale computational resources common today, the methods are parallelized using MPI. Parallel performance is considered for several test problems in order to assess scalability of both adapted and unadapted grids. Dynamic repartitioning of the mesh during refinement is crucial for load balancing an evolving grid. Development of the methods outlined here depend on a dual-memory approach that is described in detail. Validation of the solver developed here against a number of motivating problems shows favorable
The adaptive dynamic community detection algorithm based on the non-homogeneous random walking
NASA Astrophysics Data System (ADS)
Xin, Yu; Xie, Zhi-Qiang; Yang, Jing
2016-05-01
With the changing of the habit and custom, people's social activity tends to be changeable. It is required to have a community evolution analyzing method to mine the dynamic information in social network. For that, we design the random walking possibility function and the topology gain function to calculate the global influence matrix of the nodes. By the analysis of the global influence matrix, the clustering directions of the nodes can be obtained, thus the NRW (Non-Homogeneous Random Walk) method for detecting the static overlapping communities can be established. We design the ANRW (Adaptive Non-Homogeneous Random Walk) method via adapting the nodes impacted by the dynamic events based on the NRW. The ANRW combines the local community detection with dynamic adaptive adjustment to decrease the computational cost for ANRW. Furthermore, the ANRW treats the node as the calculating unity, thus the running manner of the ANRW is suitable to the parallel computing, which could meet the requirement of large dataset mining. Finally, by the experiment analysis, the efficiency of ANRW on dynamic community detection is verified.
Cetinbaş, Murat; Shakhnovich, Eugene I
2013-01-01
Although molecular chaperones are essential components of protein homeostatic machinery, their mechanism of action and impact on adaptation and evolutionary dynamics remain controversial. Here we developed a physics-based ab initio multi-scale model of a living cell for population dynamics simulations to elucidate the effect of chaperones on adaptive evolution. The 6-loci genomes of model cells encode model proteins, whose folding and interactions in cellular milieu can be evaluated exactly from their genome sequences. A genotype-phenotype relationship that is based on a simple yet non-trivially postulated protein-protein interaction (PPI) network determines the cell division rate. Model proteins can exist in native and molten globule states and participate in functional and all possible promiscuous non-functional PPIs. We find that an active chaperone mechanism, whereby chaperones directly catalyze protein folding, has a significant impact on the cellular fitness and the rate of evolutionary dynamics, while passive chaperones, which just maintain misfolded proteins in soluble complexes have a negligible effect on the fitness. We find that by partially releasing the constraint on protein stability, active chaperones promote a deeper exploration of sequence space to strengthen functional PPIs, and diminish the non-functional PPIs. A key experimentally testable prediction emerging from our analysis is that down-regulation of chaperones that catalyze protein folding significantly slows down the adaptation dynamics.
Macroscopic description of complex adaptive networks coevolving with dynamic node states.
Wiedermann, Marc; Donges, Jonathan F; Heitzig, Jobst; Lucht, Wolfgang; Kurths, Jürgen
2015-05-01
In many real-world complex systems, the time evolution of the network's structure and the dynamic state of its nodes are closely entangled. Here we study opinion formation and imitation on an adaptive complex network which is dependent on the individual dynamic state of each node and vice versa to model the coevolution of renewable resources with the dynamics of harvesting agents on a social network. The adaptive voter model is coupled to a set of identical logistic growth models and we mainly find that, in such systems, the rate of interactions between nodes as well as the adaptive rewiring probability are crucial parameters for controlling the sustainability of the system's equilibrium state. We derive a macroscopic description of the system in terms of ordinary differential equations which provides a general framework to model and quantify the influence of single node dynamics on the macroscopic state of the network. The thus obtained framework is applicable to many fields of study, such as epidemic spreading, opinion formation, or socioecological modeling.
Jansen-Osmann, Petra; Richter, Stefanie; Konczak, Jürgen; Kalveram, Karl-Theodor
2002-03-01
When humans perform goal-directed arm movements under the influence of an external damping force, they learn to adapt to these external dynamics. After removal of the external force field, they reveal kinematic aftereffects that are indicative of a neural controller that still compensates the no longer existing force. Such behavior suggests that the adult human nervous system uses a neural representation of inverse arm dynamics to control upper-extremity motion. Central to the notion of an inverse dynamic model (IDM) is that learning generalizes. Consequently, aftereffects should be observable even in untrained workspace regions. Adults have shown such behavior, but the ontogenetic development of this process remains unclear. This study examines the adaptive behavior of children and investigates whether learning a force field in one hemifield of the right arm workspace has an effect on force adaptation in the other hemifield. Thirty children (aged 6-10 years) and ten adults performed 30 degrees elbow flexion movements under two conditions of external damping (negative and null). We found that learning to compensate an external damping force transferred to the opposite hemifield, which indicates that a model of the limb dynamics rather than an association of visited space and experienced force was acquired. Aftereffects were more pronounced in the younger children and readaptation to a null-force condition was prolonged. This finding is consistent with the view that IDMs in children are imprecise neural representations of the actual arm dynamics. It indicates that the acquisition of IDMs is a developmental achievement and that the human motor system is inherently flexible enough to adapt to any novel force within the limits of the organism's biomechanics.
Yao, Yao; Marchal, Kathleen; Van de Peer, Yves
2014-01-01
One of the important challenges in the field of evolutionary robotics is the development of systems that can adapt to a changing environment. However, the ability to adapt to unknown and fluctuating environments is not straightforward. Here, we explore the adaptive potential of simulated swarm robots that contain a genomic encoding of a bio-inspired gene regulatory network (GRN). An artificial genome is combined with a flexible agent-based system, representing the activated part of the regulatory network that transduces environmental cues into phenotypic behaviour. Using an artificial life simulation framework that mimics a dynamically changing environment, we show that separating the static from the conditionally active part of the network contributes to a better adaptive behaviour. Furthermore, in contrast with most hitherto developed ANN-based systems that need to re-optimize their complete controller network from scratch each time they are subjected to novel conditions, our system uses its genome to store GRNs whose performance was optimized under a particular environmental condition for a sufficiently long time. When subjected to a new environment, the previous condition-specific GRN might become inactivated, but remains present. This ability to store 'good behaviour' and to disconnect it from the novel rewiring that is essential under a new condition allows faster re-adaptation if any of the previously observed environmental conditions is reencountered. As we show here, applying these evolutionary-based principles leads to accelerated and improved adaptive evolution in a non-stable environment.
Fetal programming: adaptive life-history tactics or making the best of a bad start?
Jones, James Holland
2005-01-01
Fetal programming is an ontogenetic phenomenon of increasing interest to human biologists. Because the downstream consequences of fetal programming have clear impacts on specific life-history traits (e.g., age at first reproduction and the general age-pattern of reproductive investments), a number of authors have raised the question of the adaptive significance of fetal programming. In this paper, I review in some detail several classical models in life-history theory and discuss their relative merits and weaknesses for human biology. I suggest that an adequate model of human life-history evolution must account for the highly structured nature of the human life cycle, with its late age at first reproduction, large degree of iteroparity, highly overlapping generations, and extensive, post-weaning parental investment. I further suggest that an understanding of stochastic demography is essential for answering the question of the adaptive significance of fetal programming, and specifically the finding of low birth weight on smaller adult body size and earlier age at first reproduction. Using a stage-structured stochastic population model, I show that the downstream consequences of early deprivation may be "making the best of a bad start" rather than an adaptation per se. When a high-investment strategy entails survival costs, the alternate strategy of early reproduction with relatively low investment may have higher fitness than trying to play the high-investment strategy and failing.
Dynamic Programming for Structured Continuous Markov Decision Problems
NASA Technical Reports Server (NTRS)
Dearden, Richard; Meuleau, Nicholas; Washington, Richard; Feng, Zhengzhu
2004-01-01
We describe an approach for exploiting structure in Markov Decision Processes with continuous state variables. At each step of the dynamic programming, the state space is dynamically partitioned into regions where the value function is the same throughout the region. We first describe the algorithm for piecewise constant representations. We then extend it to piecewise linear representations, using techniques from POMDPs to represent and reason about linear surfaces efficiently. We show that for complex, structured problems, our approach exploits the natural structure so that optimal solutions can be computed efficiently.
Martinez, N.; Michoud, G.; Cario, A.; Ollivier, J.; Franzetti, B.; Jebbar, M.; Oger, P.; Peters, J.
2016-01-01
Water and protein dynamics on a nanometer scale were measured by quasi-elastic neutron scattering in the piezophile archaeon Thermococcus barophilus and the closely related pressure-sensitive Thermococcus kodakarensis, at 0.1 and 40 MPa. We show that cells of the pressure sensitive organism exhibit higher intrinsic stability. Both the hydration water dynamics and the fast protein and lipid dynamics are reduced under pressure. In contrast, the proteome of T. barophilus is more pressure sensitive than that of T. kodakarensis. The diffusion coefficient of hydration water is reduced, while the fast protein and lipid dynamics are slightly enhanced with increasing pressure. These findings show that the coupling between hydration water and cellular constituents might not be simply a master-slave relationship. We propose that the high flexibility of the T. barophilus proteome associated with reduced hydration water may be the keys to the molecular adaptation of the cells to high hydrostatic pressure. PMID:27595789
NASA Astrophysics Data System (ADS)
Martinez, N.; Michoud, G.; Cario, A.; Ollivier, J.; Franzetti, B.; Jebbar, M.; Oger, P.; Peters, J.
2016-09-01
Water and protein dynamics on a nanometer scale were measured by quasi-elastic neutron scattering in the piezophile archaeon Thermococcus barophilus and the closely related pressure-sensitive Thermococcus kodakarensis, at 0.1 and 40 MPa. We show that cells of the pressure sensitive organism exhibit higher intrinsic stability. Both the hydration water dynamics and the fast protein and lipid dynamics are reduced under pressure. In contrast, the proteome of T. barophilus is more pressure sensitive than that of T. kodakarensis. The diffusion coefficient of hydration water is reduced, while the fast protein and lipid dynamics are slightly enhanced with increasing pressure. These findings show that the coupling between hydration water and cellular constituents might not be simply a master-slave relationship. We propose that the high flexibility of the T. barophilus proteome associated with reduced hydration water may be the keys to the molecular adaptation of the cells to high hydrostatic pressure.
Wei, Heming; Tao, Chuanyi; Zhu, Yinian; Krishnaswamy, Sridhar
2016-04-01
In this paper, a reflective semiconductor optical amplifier (RSOA) is configured to demodulate dynamic spectral shifts of a fiber Bragg grating (FBG) dynamic strain sensor. The FBG sensor and the RSOA source form an adaptive fiber cavity laser. As the reflective spectrum of the FBG sensor changes due to dynamic strains, the wavelength of the laser output shifts accordingly, which is subsequently converted into a corresponding phase shift and demodulated by an unbalanced Michelson interferometer. Due to the short transition time of the RSOA, the RSOA-FBG cavity can respond to dynamic strains at high frequencies extending to megahertz. A demodulator using a PID controller is used to compensate for low-frequency drifts induced by temperature and large quasi-static strains. As the sensitivity of the demodulator is a function of the optical path difference and the FBG spectral width, optimal parameters to obtain high sensitivity are presented. Multiplexing to demodulate multiple FBG sensors is also discussed.
Quantum Information Biology: From Theory of Open Quantum Systems to Adaptive Dynamics
NASA Astrophysics Data System (ADS)
Asano, Masanari; Basieva, Irina; Khrennikov, Andrei; Ohya, Masanori; Tanaka, Yoshiharu; Yamato, Ichiro
This chapter reviews quantum(-like) information biology (QIB). Here biology is treated widely as even covering cognition and its derivatives: psychology and decision making, sociology, and behavioral economics and finances. QIB provides an integrative description of information processing by bio-systems at all scales of life: from proteins and cells to cognition, ecological and social systems. Mathematically QIB is based on the theory of adaptive quantum systems (which covers also open quantum systems). Ideologically QIB is based on the quantum-like (QL) paradigm: complex bio-systems process information in accordance with the laws of quantum information and probability. This paradigm is supported by plenty of statistical bio-data collected at all bio-scales. QIB re ects the two fundamental principles: a) adaptivity; and, b) openness (bio-systems are fundamentally open). In addition, quantum adaptive dynamics provides the most generally possible mathematical representation of these principles.
Collective Fluctuations in the Dynamics of Adaptation and Other Traveling Waves
Hallatschek, Oskar; Geyrhofer, Lukas
2016-01-01
The dynamics of adaptation are difficult to predict because it is highly stochastic even in large populations. The uncertainty emerges from random genetic drift arising in a vanguard of particularly fit individuals of the population. Several approaches have been developed to analyze the crucial role of genetic drift on the expected dynamics of adaptation, including the mean fitness of the entire population, or the fate of newly arising beneficial deleterious mutations. However, little is known about how genetic drift causes fluctuations to emerge on the population level, where it becomes palpable as variations in the adaptation speed and the fitness distribution. Yet these phenomena control the decay of genetic diversity and variability in evolution experiments and are key to a truly predictive understanding of evolutionary processes. Here, we show that correlations induced by these emergent fluctuations can be computed at any arbitrary order by a suitable choice of a dynamical constraint. The resulting linear equations exhibit fluctuation-induced terms that amplify short-distance correlations and suppress long-distance ones. These terms, which are in general not small, control the decay of genetic diversity and, for wave-tip dominated (“pulled”) waves, lead to anticorrelations between the tip of the wave and the lagging bulk of the population. While it is natural to consider the process of adaptation as a branching random walk in fitness space subject to a constraint (due to finite resources), we show that other traveling wave phenomena in ecology and evolution likewise fall into this class of constrained branching random walks. Our methods, therefore, provide a systematic approach toward analyzing fluctuations in a wide range of population biological processes, such as adaptation, genetic meltdown, species invasions, or epidemics. PMID:26819246
Gresham, David; Desai, Michael M; Tucker, Cheryl M; Jenq, Harry T; Pai, Dave A; Ward, Alexandra; DeSevo, Christopher G; Botstein, David; Dunham, Maitreya J
2008-12-01
The experimental evolution of laboratory populations of microbes provides an opportunity to observe the evolutionary dynamics of adaptation in real time. Until very recently, however, such studies have been limited by our inability to systematically find mutations in evolved organisms. We overcome this limitation by using a variety of DNA microarray-based techniques to characterize genetic changes -- including point mutations, structural changes, and insertion variation -- that resulted from the experimental adaptation of 24 haploid and diploid cultures of Saccharomyces cerevisiae to growth in either glucose, sulfate, or phosphate-limited chemostats for approximately 200 generations. We identified frequent genomic amplifications and rearrangements as well as novel retrotransposition events associated with adaptation. Global nucleotide variation detection in ten clonal isolates identified 32 point mutations. On the basis of mutation frequencies, we infer that these mutations and the subsequent dynamics of adaptation are determined by the batch phase of growth prior to initiation of the continuous phase in the chemostat. We relate these genotypic changes to phenotypic outcomes, namely global patterns of gene expression, and to increases in fitness by 5-50%. We found that the spectrum of available mutations in glucose- or phosphate-limited environments combined with the batch phase population dynamics early in our experiments allowed several distinct genotypic and phenotypic evolutionary pathways in response to these nutrient limitations. By contrast, sulfate-limited populations were much more constrained in both genotypic and phenotypic outcomes. Thus, the reproducibility of evolution varies with specific selective pressures, reflecting the constraints inherent in the system-level organization of metabolic processes in the cell. We were able to relate some of the observed adaptive mutations (e.g., transporter gene amplifications) to known features of the relevant
Zhang, Zhihua; Sheng, Zheng; Shi, Hanqing; Fan, Zhiqiang
2016-01-01
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.
Zhang, Zhihua; Sheng, Zheng; Shi, Hanqing; Fan, Zhiqiang
2016-01-01
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. PMID:27212938
NASA Astrophysics Data System (ADS)
Zhao, Dongya; Li, Shaoyuan; Zhu, Quanmin
2016-03-01
In this study, a new adaptive synchronised tracking control approach is developed for the operation of multiple robotic manipulators in the presence of uncertain kinematics and dynamics. In terms of the system synchronisation and adaptive control, the proposed approach can stabilise position tracking of each robotic manipulator while coordinating its motion with the other robotic manipulators. On the other hand, the developed approach can cope with kinematic and dynamic uncertainties. The corresponding stability analysis is presented to lay a foundation for theoretical understanding of the underlying issues as well as an assurance for safely operating real systems. Illustrative examples are bench tested to validate the effectiveness of the proposed approach. In addition, to face the challenging issues, this study provides an exemplary showcase with effectively to integrate several cross boundary theoretical results to formulate an interdisciplinary solution.
Behavioral and neural Darwinism: selectionist function and mechanism in adaptive behavior dynamics.
McDowell, J J
2010-05-01
An evolutionary theory of behavior dynamics and a theory of neuronal group selection share a common selectionist framework. The theory of behavior dynamics instantiates abstractly the idea that behavior is selected by its consequences. It implements Darwinian principles of selection, reproduction, and mutation to generate adaptive behavior in virtual organisms. The behavior generated by the theory has been shown to be quantitatively indistinguishable from that of live organisms. The theory of neuronal group selection suggests a mechanism whereby the abstract principles of the evolutionary theory may be implemented in the nervous systems of biological organisms. According to this theory, groups of neurons subserving behavior may be selected by synaptic modifications that occur when the consequences of behavior activate value systems in the brain. Together, these theories constitute a framework for a comprehensive account of adaptive behavior that extends from brain function to the behavior of whole organisms in quantitative detail.
HyFIS: adaptive neuro-fuzzy inference systems and their application to nonlinear dynamical systems.
Kim, J; Kasabov, N
1999-11-01
This paper proposes an adaptive neuro-fuzzy system, HyFIS (Hybrid neural Fuzzy Inference System), for building and optimising fuzzy models. The proposed model introduces the learning power of neural networks to fuzzy logic systems and provides linguistic meaning to the connectionist architectures. Heuristic fuzzy logic rules and input-output fuzzy membership functions can be optimally tuned from training examples by a hybrid learning scheme comprised of two phases: rule generation phase from data; and rule tuning phase using error backpropagation learning scheme for a neural fuzzy system. To illustrate the performance and applicability of the proposed neuro-fuzzy hybrid model, extensive simulation studies of nonlinear complex dynamic systems are carried out. The proposed method can be applied to an on-line incremental adaptive learning for the prediction and control of nonlinear dynamical systems. Two benchmark case studies are used to demonstrate that the proposed HyFIS system is a superior neuro-fuzzy modelling technique.
Satellite-tracking and earth-dynamics research programs
NASA Technical Reports Server (NTRS)
Weiffenbach, G. C.
1973-01-01
The following activities in Smithsonian Astrophysical Observatory's (SAO) earth-dynamics programs are covered: (1) satellite-tracking network operations; (2) satellite geodesy and geophysics programs; (3) atmospheric research. Approximately 46,000 successful range measurements were acquired by the SAO laser stations in Peru, South Africa, Brazil, and Arizona. The Peole satellite-tracking campaign conducted in conjunction with the Centre National d'Etudes Spatiales was completed in August 1973. The SAO network obtained 4482 validated returns of 310 arcs of Peole. These data are of particular value for obtaining more accurate gravity-field and zonal-harmonics coefficients.
Overview of the solar dynamic ground test demonstration program
NASA Technical Reports Server (NTRS)
Shaltens, Richard K.; Boyle, Robert V.
1993-01-01
The Solar Dynamic (SD) Ground Test Demonstration (GTD) program demonstrates the availability of SD technologies in a simulated space environment at the NASA Lewis Research Center (LeRC) vacuum facility. An aerospace industry/ government team is working together to design, fabricate, build, and test a complete SD system. This paper reviews the goals and status of the SD GTD program. A description of the SD system includes key design features of the system, subsystems, and components as reported at the Critical Design Review (CDR).
Synthesizing Dynamic Programming Algorithms from Linear Temporal Logic Formulae
NASA Technical Reports Server (NTRS)
Rosu, Grigore; Havelund, Klaus
2001-01-01
The problem of testing a linear temporal logic (LTL) formula on a finite execution trace of events, generated by an executing program, occurs naturally in runtime analysis of software. We present an algorithm which takes an LTL formula and generates an efficient dynamic programming algorithm. The generated algorithm tests whether the LTL formula is satisfied by a finite trace of events given as input. The generated algorithm runs in linear time, its constant depending on the size of the LTL formula. The memory needed is constant, also depending on the size of the formula.
Passivity of Directed and Undirected Complex Dynamical Networks With Adaptive Coupling Weights.
Wang, Jin-Liang; Wu, Huai-Ning; Huang, Tingwen; Ren, Shun-Yan; Wu, Jigang
2016-05-05
A complex dynamical network consisting of $N$ identical neural networks with reaction-diffusion terms is considered in this paper. First, several passivity definitions for the systems with different dimensions of input and output are given. By utilizing some inequality techniques, several criteria are presented, ensuring the passivity of the complex dynamical network under the designed adaptive law. Then, we discuss the relationship between the synchronization and output strict passivity of the proposed network model. Furthermore, these results are extended to the case when the topological structure of the network is undirected. Finally, two examples with numerical simulations are provided to illustrate the correctness and effectiveness of the proposed results.
Differentially Private Histogram Publication For Dynamic Datasets: An Adaptive Sampling Approach.
Li, Haoran; Jiang, Xiaoqian; Xiong, Li; Liu, Jinfei
2015-10-01
Differential privacy has recently become a de facto standard for private statistical data release. Many algorithms have been proposed to generate differentially private histograms or synthetic data. However, most of them focus on "one-time" release of a static dataset and do not adequately address the increasing need of releasing series of dynamic datasets in real time. A straightforward application of existing histogram methods on each snapshot of such dynamic datasets will incur high accumulated error due to the composibility of differential privacy and correlations or overlapping users between the snapshots. In this paper, we address the problem of releasing series of dynamic datasets in real time with differential privacy, using a novel adaptive distance-based sampling approach. Our first method, DSFT, uses a fixed distance threshold and releases a differentially private histogram only when the current snapshot is sufficiently different from the previous one, i.e., with a distance greater than a predefined threshold. Our second method, DSAT, further improves DSFT and uses a dynamic threshold adaptively adjusted by a feedback control mechanism to capture the data dynamics. Extensive experiments on real and synthetic datasets demonstrate that our approach achieves better utility than baseline methods and existing state-of-the-art methods.
Differentially Private Histogram Publication For Dynamic Datasets: An Adaptive Sampling Approach
Li, Haoran; Jiang, Xiaoqian; Xiong, Li; Liu, Jinfei
2016-01-01
Differential privacy has recently become a de facto standard for private statistical data release. Many algorithms have been proposed to generate differentially private histograms or synthetic data. However, most of them focus on “one-time” release of a static dataset and do not adequately address the increasing need of releasing series of dynamic datasets in real time. A straightforward application of existing histogram methods on each snapshot of such dynamic datasets will incur high accumulated error due to the composibility of differential privacy and correlations or overlapping users between the snapshots. In this paper, we address the problem of releasing series of dynamic datasets in real time with differential privacy, using a novel adaptive distance-based sampling approach. Our first method, DSFT, uses a fixed distance threshold and releases a differentially private histogram only when the current snapshot is sufficiently different from the previous one, i.e., with a distance greater than a predefined threshold. Our second method, DSAT, further improves DSFT and uses a dynamic threshold adaptively adjusted by a feedback control mechanism to capture the data dynamics. Extensive experiments on real and synthetic datasets demonstrate that our approach achieves better utility than baseline methods and existing state-of-the-art methods. PMID:26973795
Fournier-Level, Alexandre; Perry, Emily O; Wang, Jonathan A; Braun, Peter T; Migneault, Andrew; Cooper, Martha D; Metcalf, C Jessica E; Schmitt, Johanna
2016-05-17
Predicting whether and how populations will adapt to rapid climate change is a critical goal for evolutionary biology. To examine the genetic basis of fitness and predict adaptive evolution in novel climates with seasonal variation, we grew a diverse panel of the annual plant Arabidopsis thaliana (multiparent advanced generation intercross lines) in controlled conditions simulating four climates: a present-day reference climate, an increased-temperature climate, a winter-warming only climate, and a poleward-migration climate with increased photoperiod amplitude. In each climate, four successive seasonal cohorts experienced dynamic daily temperature and photoperiod variation over a year. We measured 12 traits and developed a genomic prediction model for fitness evolution in each seasonal environment. This model was used to simulate evolutionary trajectories of the base population over 50 y in each climate, as well as 100-y scenarios of gradual climate change following adaptation to a reference climate. Patterns of plastic and evolutionary fitness response varied across seasons and climates. The increased-temperature climate promoted genetic divergence of subpopulations across seasons, whereas in the winter-warming and poleward-migration climates, seasonal genetic differentiation was reduced. In silico "resurrection experiments" showed limited evolutionary rescue compared with the plastic response of fitness to seasonal climate change. The genetic basis of adaptation and, consequently, the dynamics of evolutionary change differed qualitatively among scenarios. Populations with fewer founding genotypes and populations with genetic diversity reduced by prior selection adapted less well to novel conditions, demonstrating that adaptation to rapid climate change requires the maintenance of sufficient standing variation.
Fournier-Level, Alexandre; Perry, Emily O.; Wang, Jonathan A.; Braun, Peter T.; Migneault, Andrew; Cooper, Martha D.; Metcalf, C. Jessica E.; Schmitt, Johanna
2016-01-01
Predicting whether and how populations will adapt to rapid climate change is a critical goal for evolutionary biology. To examine the genetic basis of fitness and predict adaptive evolution in novel climates with seasonal variation, we grew a diverse panel of the annual plant Arabidopsis thaliana (multiparent advanced generation intercross lines) in controlled conditions simulating four climates: a present-day reference climate, an increased-temperature climate, a winter-warming only climate, and a poleward-migration climate with increased photoperiod amplitude. In each climate, four successive seasonal cohorts experienced dynamic daily temperature and photoperiod variation over a year. We measured 12 traits and developed a genomic prediction model for fitness evolution in each seasonal environment. This model was used to simulate evolutionary trajectories of the base population over 50 y in each climate, as well as 100-y scenarios of gradual climate change following adaptation to a reference climate. Patterns of plastic and evolutionary fitness response varied across seasons and climates. The increased-temperature climate promoted genetic divergence of subpopulations across seasons, whereas in the winter-warming and poleward-migration climates, seasonal genetic differentiation was reduced. In silico “resurrection experiments” showed limited evolutionary rescue compared with the plastic response of fitness to seasonal climate change. The genetic basis of adaptation and, consequently, the dynamics of evolutionary change differed qualitatively among scenarios. Populations with fewer founding genotypes and populations with genetic diversity reduced by prior selection adapted less well to novel conditions, demonstrating that adaptation to rapid climate change requires the maintenance of sufficient standing variation. PMID:27140640
Altered temporal dynamics of neural adaptation in the aging human auditory cortex.
Herrmann, Björn; Henry, Molly J; Johnsrude, Ingrid S; Obleser, Jonas
2016-09-01
Neural response adaptation plays an important role in perception and cognition. Here, we used electroencephalography to investigate how aging affects the temporal dynamics of neural adaptation in human auditory cortex. Younger (18-31 years) and older (51-70 years) normal hearing adults listened to tone sequences with varying onset-to-onset intervals. Our results show long-lasting neural adaptation such that the response to a particular tone is a nonlinear function of the extended temporal history of sound events. Most important, aging is associated with multiple changes in auditory cortex; older adults exhibit larger and less variable response magnitudes, a larger dynamic response range, and a reduced sensitivity to temporal context. Computational modeling suggests that reduced adaptation recovery times underlie these changes in the aging auditory cortex and that the extended temporal stimulation has less influence on the neural response to the current sound in older compared with younger individuals. Our human electroencephalography results critically narrow the gap to animal electrophysiology work suggesting a compensatory release from cortical inhibition accompanying hearing loss and aging.
A chaos detectable and time step-size adaptive numerical scheme for nonlinear dynamical systems
NASA Astrophysics Data System (ADS)
Chen, Yung-Wei; Liu, Chein-Shan; Chang, Jiang-Ren
2007-02-01
The first step in investigation the dynamics of a continuous time system described by ordinary differential equations is to integrate them to obtain trajectories. In this paper, we convert the group-preserving scheme (GPS) developed by Liu [International Journal of Non-Linear Mechanics 36 (2001) 1047-1068] to a time step-size adaptive scheme, x=x+hf(x,t), where x∈R is the system variables we are concerned with, and f(x,t)∈R is a time-varying vector field. The scheme has the form similar to the Euler scheme, x=x+Δtf(x,t), but our step-size h is adaptive automatically. Very interestingly, the ratio h/Δt, which we call the adaptive factor, can forecast the appearance of chaos if the considered dynamical system becomes chaotical. The numerical examples of the Duffing equation, the Lorenz equation and the Rossler equation, which may exhibit chaotic behaviors under certain parameters values, are used to demonstrate these phenomena. Two other non-chaotic examples are included to compare the performance of the GPS and the adaptive one.
NASA Astrophysics Data System (ADS)
Li, Xiaofeng; Xiang, Suying; Zhu, Pengfei; Wu, Min
2015-12-01
In order to avoid the inherent deficiencies of the traditional BP neural network, such as slow convergence speed, that easily leading to local minima, poor generalization ability and difficulty in determining the network structure, the dynamic self-adaptive learning algorithm of the BP neural network is put forward to improve the function of the BP neural network. The new algorithm combines the merit of principal component analysis, particle swarm optimization, correlation analysis and self-adaptive model, hence can effectively solve the problems of selecting structural parameters, initial connection weights and thresholds and learning rates of the BP neural network. This new algorithm not only reduces the human intervention, optimizes the topological structures of BP neural networks and improves the network generalization ability, but also accelerates the convergence speed of a network, avoids trapping into local minima, and enhances network adaptation ability and prediction ability. The dynamic self-adaptive learning algorithm of the BP neural network is used to forecast the total retail sale of consumer goods of Sichuan Province, China. Empirical results indicate that the new algorithm is superior to the traditional BP network algorithm in predicting accuracy and time consumption, which shows the feasibility and effectiveness of the new algorithm.
NASA Astrophysics Data System (ADS)
Kozdon, J. E.; Wilcox, L.; Aranda, A. R.
2014-12-01
The goal of this work is to develop a new set of simulation tools for earthquake rupture dynamics based on state-of-the-art high-order, adaptive numerical methods capable of handling complex geometries. High-order methods are ideal for earthquake rupture simulations as the problems are wave-dominated and the waves excited in simulations propagate over distance much larger than their fundamental wavelength. When high-order methods are used for such problems significantly fewer degrees of freedom are required as compared with low-order methods. The base numerical method in our new software elements is a discontinuous Galerkin method based on curved, Kronecker product hexahedral elements. We currently use MPI for off-node parallelism and are in the process of exploring strategies for on-node parallelism. Spatial mesh adaptivity is handled using the p4est library and temporal adaptivity is achieved through an Adams-Bashforth based local time stepping method; we are presently in the process of including dynamic spatial adaptivity which we believe will be valuable for capturing the small-scale features around the propagating rupture front. One of the key features of our software elements is that the method is provably stable, even after the inclusion of the nonlinear frictions laws which govern rupture dynamics. In this presentation we will both outline the structure of the software elements as well as validate the rupture dynamics with SCEC benchmark test problems. We are also presently developing several realistic simulation geometries which may also be reported on. Finally, the software elements that we have designed are fully public domain and have been designed with tightly coupled, wave dominated multiphysics applications in mind. This latter design decisions means the software elements are applicable to many other geophysical and non-geophysical applications.
Dynamic Adaptive Binning: An Improved Quantification Technique for NMR Spectroscopic Data
2010-01-01
adaptive intelligent binning, which recursively identifies bin edges in existing bins (De Meyer et al. 2008). Another dynamic binning method is...43. Cancino-De-Greiff, H. F., Ramos-Garcia, R., & Lorenzo -Ginori, J. V. (2002). Signal de-noising in magnetic resonance spectroscopy using wavelet...for metabolomics data using the undecimated wavelet transform. Chemometrics and Intelligent Laboratory Systems, 85, 144–154. De Meyer , T., Sinnaeve, D
GLOBEC (Global Ocean Ecosystems Dynamics: Northwest Atlantic program
NASA Technical Reports Server (NTRS)
1991-01-01
The specific objective of the meeting was to plan an experiment in the Northwestern Atlantic to study the marine ecosystem and its role, together with that of climate and physical dynamics, in determining fisheries recruitment. The underlying focus of the GLOBEC initiative is to understand the marine ecosystem as it related to marine living resources and to understand how fluctuation in these resources are driven by climate change and exploitation. In this sense the goal is a solid scientific program to provide basic information concerning major fisheries stocks and the environment that sustains them. The plan is to attempt to reach this understanding through a multidisciplinary program that brings to bear new techniques as disparate as numerical fluid dynamic models of ocean circulation, molecular biology and modern acoustic imaging. The effort will also make use of the massive historical data sets on fisheries and the state of the climate in a coordinated manner.
Satellite-tracking and Earth dynamics research programs
NASA Technical Reports Server (NTRS)
1982-01-01
The activities carried out by the Smithsonian Astrophysical Observatory (SAO) are described. The SAO network continued to track LAGEOS at highest priority for polar motion and Earth rotation studies, and for other geophysical investigations, including crustal dynamics, Earth and ocean tides, and the general development of precision orbit determination. The network performed regular tracking of several other retroreflector satellites including GEOS-1, GEOS-3, BE-C, and Starlette for refined determinations of station coordinates and the Earth's gravity field and for studies of solid Earth dynamics. A major program in laser upgrading continued to improve ranging accuracy and data yield. This program includes an increase in pulse repetition rate from 8 ppm to 30 ppm, a reduction in laser pulse width from 6 nsec to 2 to 3 nsec, improvements in the photoreceiver and the electronics to improve daylight ranging, and an analog pulse detection system to improve range noise and accuracy. Data processing hardware and software are discussed.
Demonstrating the impact of flood adaptation using an online dynamic flood mapper
NASA Astrophysics Data System (ADS)
Orton, P. M.; MacManus, K.; Doxsey-Whitfield, E.; Yetman, G.; Fisher, K.; Sanderson, E. W.; Giampieri, M.; Blumberg, A. F.
2015-12-01
Municipalities across the nation are weighing the value of coastal natural and nature-based features (NNBF) for flood risk reduction and the many ecosystem services they provide, yet there is limited quantitative information available to help make these decisions. Here, we describe a new "dynamic" flood mapping web-tool that demonstrates the modeled effects of NNBF on flood hazard zones for the highly populated areas surrounding Jamaica Bay, New York City. The tool also provides information on damages from flooding as well as cost-benefit analyses for NNBF adaptations for the bay. The project researchers are involved with development of a Jamaica Bay Coastal Master Plan, and the mapper will play an important role for increasing the public understanding of adaptation options. More broadly, dynamic flood mappers have many more possibilities than "static" mappers that simply add sea level rise onto pre-defined flood levels and bathtub them over flood plains. Dynamic modeling can enable inclusion of the response of coastal systems, imposed human adaptation, as well as flooding by surge, tide and precipitation.
NASA Astrophysics Data System (ADS)
Pathak, Anand; Sinha, Sitabhra
2015-09-01
Many complex systems can be represented as networks of dynamical elements whose states evolve in response to interactions with neighboring elements, noise and external stimuli. The collective behavior of such systems can exhibit remarkable ordering phenomena such as chimera order corresponding to coexistence of ordered and disordered regions. Often, the interactions in such systems can also evolve over time responding to changes in the dynamical states of the elements. Link adaptation inspired by Hebbian learning, the dominant paradigm for neuronal plasticity, has been earlier shown to result in structural balance by removing any initial frustration in a system that arises through conflicting interactions. Here we show that the rate of the adaptive dynamics for the interactions is crucial in deciding the emergence of different ordering behavior (including chimera) and frustration in networks of Ising spins. In particular, we observe that small changes in the link adaptation rate about a critical value result in the system exhibiting radically different energy landscapes, viz., smooth landscape corresponding to balanced systems seen for fast learning, and rugged landscapes corresponding to frustrated systems seen for slow learning.
On the global dynamics of adaptive systems - A study of an elementary example
NASA Technical Reports Server (NTRS)
Espana, Martin D.; Praly, Laurent
1993-01-01
The inherent nonlinear character of adaptive systems poses serious theoretical problems for the analysis of their dynamics. On the other hand, the importance of their dynamic behavior is directly related to the practical interest in predicting such undesirable phenomena as nonlinear oscillations, abrupt transients, intermittence or a high sensitivity with respect to initial conditions. A geometrical/qualitative description of the phase portrait of a discrete-time adaptive system with unmodeled disturbances is given. For this, the motions in the phase space are referred to normally hyperbolic (structurally stable) locally invariant sets. The study is complemented with a local stability analysis of the equilibrium point and periodic solutions. The critical character of adaptive systems under rather usual working conditions is discussed. Special emphasis is put on the causes leading to intermittence. A geometric interpretation of the effects of some commonly used palliatives to this problem is given. The 'dead-zone' approach is studied in more detail. The predicted dynamics are compared with simulation results.
Evolution dynamics of a model for gene duplication under adaptive conflict
NASA Astrophysics Data System (ADS)
Ancliff, Mark; Park, Jeong-Man
2014-06-01
We present and solve the dynamics of a model for gene duplication showing escape from adaptive conflict. We use a Crow-Kimura quasispecies model of evolution where the fitness landscape is a function of Hamming distances from two reference sequences, which are assumed to optimize two different gene functions, to describe the dynamics of a mixed population of individuals with single and double copies of a pleiotropic gene. The evolution equations are solved through a spin coherent state path integral, and we find two phases: one is an escape from an adaptive conflict phase, where each copy of a duplicated gene evolves toward subfunctionalization, and the other is a duplication loss of function phase, where one copy maintains its pleiotropic form and the other copy undergoes neutral mutation. The phase is determined by a competition between the fitness benefits of subfunctionalization and the greater mutational load associated with maintaining two gene copies. In the escape phase, we find a dynamics of an initial population of single gene sequences only which escape adaptive conflict through gene duplication and find that there are two time regimes: until a time t* single gene sequences dominate, and after t* double gene sequences outgrow single gene sequences. The time t* is identified as the time necessary for subfunctionalization to evolve and spread throughout the double gene sequences, and we show that there is an optimum mutation rate which minimizes this time scale.
Architecture-Adaptive Computing Environment: A Tool for Teaching Parallel Programming
NASA Technical Reports Server (NTRS)
Dorband, John E.; Aburdene, Maurice F.
2002-01-01
Recently, networked and cluster computation have become very popular. This paper is an introduction to a new C based parallel language for architecture-adaptive programming, aCe C. The primary purpose of aCe (Architecture-adaptive Computing Environment) is to encourage programmers to implement applications on parallel architectures by providing them the assurance that future architectures will be able to run their applications with a minimum of modification. A secondary purpose is to encourage computer architects to develop new types of architectures by providing an easily implemented software development environment and a library of test applications. This new language should be an ideal tool to teach parallel programming. In this paper, we will focus on some fundamental features of aCe C.
Bikard, David; Marraffini, Luciano A
2012-02-01
Bacteria are constantly challenged by bacteriophages (viruses that infect bacteria), the most abundant microorganism on earth. Bacteria have evolved a variety of immunity mechanisms to resist bacteriophage infection. In response, bacteriophages can evolve counter-resistance mechanisms and launch a 'virus versus host' evolutionary arms race. In this context, rapid evolution is fundamental for the survival of the bacterial cell. Programmed genetic variation mechanisms at loci involved in immunity against bacteriophages generate diversity at a much faster rate than random point mutation and enable bacteria to quickly adapt and repel infection. Diversity-generating retroelements (DGRs) and phase variation mechanisms enhance the generic (innate) immune response against bacteriophages. On the other hand, the integration of small bacteriophage sequences in CRISPR loci provide bacteria with a virus-specific and sequence-specific adaptive immune response. Therefore, although using different molecular mechanisms, both prokaryotes and higher organisms rely on programmed genetic variation to increase genetic diversity and fight rapidly evolving infectious agents.
On-line replacement of program modules using AdaPT
NASA Technical Reports Server (NTRS)
Waldrop, Raymond S.; Volz, Richard A.; Smith, Gary W.; Holzbacher-Valero, A. A.; Goldsack, Stephen J.
1992-01-01
One purpose of our research is the investigation of the effectiveness and expressiveness of AdaPT(1), a set of language extensions to Ada 83, for distributed systems. As a part of that effort, we are now investigating the subject of replacing, e.g., upgrading, software modules while the software system remains in operation. The AdaPT language extension provide a good basis for this investigation for several reasons: (1) they include the concept of specific, self-contained program modules which can be manipulated; (2) support for program configuration is included in the language; and (3) although the discussion will be in terms of the AdaPT language, the AdaPT to Ada 83 conversion methodology being developed as another part of this project will provide a basis for the application of our findings to Ada 83 systems. The purpose of this investigation is to explore the basic mechanisms to the replacement process. Thus, while replacement in the presence of real-time deadlines, heterogeneous systems, and unreliable networks is certainly a topic of interest, we will first gain an understanding of the basic processes in the absence of such concerns. The extension of the replacement process to more complex situations can be made later. This report will establish an overview of the on-line upgrade problem, and present a taxonomy of the various aspects of the replacement process.
Johnson-Jennings, Michelle; Baumann, Ana A.; Proctor, Enola
2015-01-01
Introduction Diabetes disproportionately affects underserved racial/ethnic groups in the United States. Diabetes prevention interventions positively influence health; however, further evaluation is necessary to determine what role culture plays in effective programming. We report on the status of research that examines cultural adaptations of diabetes prevention programs. Methods We conducted database searches in March and April 2014. We included studies that were conducted in the United States and that focused on diabetes prevention among African Americans, American Indians/Alaska Natives, Asian Americans/Pacific Islanders, and Latinos. Results A total of 58 studies were identified for review; 29 were excluded from evaluation. Few adaptations referenced or followed recommendations for cultural adaptation nor did they justify the content modifications by providing a rationale or evidence. Cultural elements unique to racial/ethnic populations were not assessed. Conclusion Future cultural adaptations should use recommended processes to ensure that culture’s role in diabetes prevention–related behavioral changes contributes to research. PMID:25950567
Kim, D.; Ghanem, R.
1994-12-31
Multigrid solution technique to solve a material nonlinear problem in a visual programming environment using the finite element method is discussed. The nonlinear equation of equilibrium is linearized to incremental form using Newton-Rapson technique, then multigrid solution technique is used to solve linear equations at each Newton-Rapson step. In the process, adaptive mesh refinement, which is based on the bisection of a pair of triangles, is used to form grid hierarchy for multigrid iteration. The solution process is implemented in a visual programming environment with distributed computing capability, which enables more intuitive understanding of solution process, and more effective use of resources.
Translation, cultural adaptation and field-testing of the Thinking Healthy Program for Vietnam
2014-01-01
Background Depression and anxiety are prevalent among women in low- and lower-middle income countries who are pregnant or have recently given birth. There is promising evidence that culturally-adapted, evidence-informed, perinatal psycho-educational programs implemented in local communities are effective in reducing mental health problems. The Thinking Healthy Program (THP) has proved effective in Pakistan. The aims were to adapt the THP for rural Vietnam; establish the program’s comprehensibility, acceptability and salience for universal use, and investigate whether administration to small groups of women might be of equivalent effectiveness to administration in home visits to individual women. Methods The THP Handbook and Calendar were made available in English by the program developers and translated into Vietnamese. Cultural adaptation and field-testing were undertaken using WHO guidance. Field-testing of the four sessions of THP Module One was undertaken in weekly sessions with a small group in a rural commune and evaluated using baseline, process and endline surveys. Results The adapted Vietnamese version of the Thinking Healthy Program (THP-V) was found to be understandable, meaningful and relevant to pregnant women, and commune health centre and Women’s Union representatives in a rural district. It was delivered effectively by trained local facilitators. Role-play, brainstorming and small-group discussions to find shared solutions to common problems were appraised as helpful learning opportunities. Conclusions The THP-V is safe and comprehensible, acceptable and salient to pregnant women without mental health problems in rural Vietnam. Delivery in facilitated small groups provided valued opportunities for role-play rehearsal and shared problem solving. Local observers found the content and approach highly relevant to local needs and endorsed the approach as a mental health promotion strategy with potential for integration into local universal maternal
2002-01-01
the Cameron project. The goal of the Cameron project is to make FPGAs and other adaptive computer systems available to more applications programmers...loops onto an FPGA , but this is invisible. SA-C therefore makes recon- gurable processors accessible to applications programmers with no hardware...happens that for SA-C programs, the host executable off-loads the processing of loops onto an FPGA , but this is invisible. SA-C therefore makes
Wardill, Trevor J.; O'Kane, Cahir J.; de Polavieja, Gonzalo G.; Juusola, Mikko
2009-01-01
Because of the limited processing capacity of eyes, retinal networks must adapt constantly to best present the ever changing visual world to the brain. However, we still know little about how adaptation in retinal networks shapes neural encoding of changing information. To study this question, we recorded voltage responses from photoreceptors (R1–R6) and their output neurons (LMCs) in the Drosophila eye to repeated patterns of contrast values, collected from natural scenes. By analyzing the continuous photoreceptor-to-LMC transformations of these graded-potential neurons, we show that the efficiency of coding is dynamically improved by adaptation. In particular, adaptation enhances both the frequency and amplitude distribution of LMC output by improving sensitivity to under-represented signals within seconds. Moreover, the signal-to-noise ratio of LMC output increases in the same time scale. We suggest that these coding properties can be used to study network adaptation using the genetic tools in Drosophila, as shown in a companion paper (Part II). PMID:19180196
Application of dynamic programming to control khuzestan water resources system
Jamshidi, M.; Heidari, M.
1977-01-01
An approximate optimization technique based on discrete dynamic programming called discrete differential dynamic programming (DDDP), is employed to obtain the near optimal operation policies of a water resources system in the Khuzestan Province of Iran. The technique makes use of an initial nominal state trajectory for each state variable, and forms corridors around the trajectories. These corridors represent a set of subdomains of the entire feasible domain. Starting with such a set of nominal state trajectories, improvements in objective function are sought within the corridors formed around them. This leads to a set of new nominal trajectories upon which more improvements may be sought. Since optimization is confined to a set of subdomains, considerable savings in memory and computer time are achieved over that of conventional dynamic programming. The Kuzestan water resources system considered in this study is located in southwest Iran, and consists of two rivers, three reservoirs, three hydropower plants, and three irrigable areas. Data and cost benefit functions for the analysis were obtained either from the historical records or from similar studies. ?? 1977.
Developmental Cascade Effects of the New Beginnings Program on Adolescent Adaptation Outcomes
Bonds, Darya D.; Wolchik, Sharlene A.; Winslow, Emily; Tein, Jenn-Yun; Sandler, Irwin N.; Millsap, Roger E.
2010-01-01
Using data from a 6-year longitudinal follow-up sample of 240 youth who participated in a randomized experimental trial of a preventive intervention for divorced families with children ages 9–12, the current study tested alternative cascading pathways by which the intervention decreased symptoms of internalizing disorders, symptoms of externalizing disorders, substance use, and risky sexual behavior, and increased self-esteem and academic performance in mid-to late-adolescence (15–19 years old). It was hypothesized that the impact of the program on adolescent adaptation outcomes would be explained by progressive associations between program-induced changes in parenting and youth adaptation outcomes. The results supported a cascading model of program effects in which the program was related to increased mother-child relationship quality, which was related to subsequent decreases in child internalizing problems, which then was related to subsequent increases in self-esteem and decreases in symptoms of internalizing disorders in adolescence. The results also were consistent with a model in which the program was related to increased maternal effective discipline, which was related to subsequent decreases in child externalizing problems, which then was related to subsequent decreases in symptoms of externalizing disorders, less substance use and better academic performance in adolescence. There were no significant differences in the model based on level of baseline risk or adolescent gender. These results provide support for a cascading pathways model of child and adolescent development. PMID:20883581
Outcomes of a type 2 diabetes education program adapted to the cultural contexts of Saudi women
Al-Bannay, Hana R.; Jongbloed, Lyn E.; Jarus, Tal; Alabdulwahab, Sami S.; Khoja, Tawfik A.; Dean, Elizabeth
2015-01-01
Objective: To explore the outcomes of a pilot intervention of a type 2 diabetes (T2D) education program, based on international standards, and adapted to the cultural and religious contexts of Saudi women. Methods: This study is an experiment of a pilot intervention carried out between August 2011 and January 2012 at the primary health clinics in Dammam. Women at risk of or diagnosed with T2D (N=35 including dropouts) were assigned to one of 2 groups; an intervention group participated in a pilot intervention of T2D education program, based on international standards and tailored to their cultural and religious contexts; and a usual care group received the usual care for diabetes in Saudi Arabia. Outcomes included blood glucose, body composition, 6-minute walk distance, life satisfaction, quality of life, and diabetes knowledge. The intervention group participated in a focus group of their program experience. Data analysis was based on mixed methods. Results: Based on 95% confidence interval comparisons, improvements were noted in blood sugar, 6-minute walk distance, quality of life, and diabetes knowledge in participants of the intervention group. They also reported improvements in lifestyle-related health behaviors after the education program. Conclusion: Saudi women may benefit from a T2D education program based on international standards and adapted to their cultural and religious contexts. PMID:26108595
An algorithm for the solution of dynamic linear programs
NASA Technical Reports Server (NTRS)
Psiaki, Mark L.
1989-01-01
The algorithm's objective is to efficiently solve Dynamic Linear Programs (DLP) by taking advantage of their special staircase structure. This algorithm constitutes a stepping stone to an improved algorithm for solving Dynamic Quadratic Programs, which, in turn, would make the nonlinear programming method of Successive Quadratic Programs more practical for solving trajectory optimization problems. The ultimate goal is to being trajectory optimization solution speeds into the realm of real-time control. The algorithm exploits the staircase nature of the large constraint matrix of the equality-constrained DLPs encountered when solving inequality-constrained DLPs by an active set approach. A numerically-stable, staircase QL factorization of the staircase constraint matrix is carried out starting from its last rows and columns. The resulting recursion is like the time-varying Riccati equation from multi-stage LQR theory. The resulting factorization increases the efficiency of all of the typical LP solution operations over that of a dense matrix LP code. At the same time numerical stability is ensured. The algorithm also takes advantage of dynamic programming ideas about the cost-to-go by relaxing active pseudo constraints in a backwards sweeping process. This further decreases the cost per update of the LP rank-1 updating procedure, although it may result in more changes of the active set that if pseudo constraints were relaxed in a non-stagewise fashion. The usual stability of closed-loop Linear/Quadratic optimally-controlled systems, if it carries over to strictly linear cost functions, implies that the saving due to reduced factor update effort may outweigh the cost of an increased number of updates. An aerospace example is presented in which a ground-to-ground rocket's distance is maximized. This example demonstrates the applicability of this class of algorithms to aerospace guidance. It also sheds light on the efficacy of the proposed pseudo constraint relaxation
NASA Technical Reports Server (NTRS)
Burgin, G. H.; Owens, A. J.
1975-01-01
A detailed description is presented of the computer programs in order to provide an understanding of the mathematical and geometrical relationships as implemented in the programs. The individual sbbroutines and their underlying mathematical relationships are described, and the required input data and the output provided by the program are explained. The relationship of the adaptive maneuvering logic program with the program to drive the differential maneuvering simulator is discussed.
NASA Astrophysics Data System (ADS)
Liu, Fang
2011-06-01
Image segmentation remains one of the major challenges in image analysis and computer vision. Fuzzy clustering, as a soft segmentation method, has been widely studied and successfully applied in mage clustering and segmentation. The fuzzy c-means (FCM) algorithm is the most popular method used in mage segmentation. However, most clustering algorithms such as the k-means and the FCM clustering algorithms search for the final clusters values based on the predetermined initial centers. The FCM clustering algorithms does not consider the space information of pixels and is sensitive to noise. In the paper, presents a new fuzzy c-means (FCM) algorithm with adaptive evolutionary programming that provides image clustering. The features of this algorithm are: 1) firstly, it need not predetermined initial centers. Evolutionary programming will help FCM search for better center and escape bad centers at local minima. Secondly, the spatial distance and the Euclidean distance is also considered in the FCM clustering. So this algorithm is more robust to the noises. Thirdly, the adaptive evolutionary programming is proposed. The mutation rule is adaptively changed with learning the useful knowledge in the evolving process. Experiment results shows that the new image segmentation algorithm is effective. It is providing robustness to noisy images.
Implementing efficient dynamic formal verification methods for MPI programs.
Vakkalanka, S.; DeLisi, M.; Gopalakrishnan, G.; Kirby, R. M.; Thakur, R.; Gropp, W.; Mathematics and Computer Science; Univ. of Utah; Univ. of Illinois
2008-01-01
We examine the problem of formally verifying MPI programs for safety properties through an efficient dynamic (runtime) method in which the processes of a given MPI program are executed under the control of an interleaving scheduler. To ensure full coverage for given input test data, the algorithm must take into consideration MPI's out-of-order completion semantics. The algorithm must also ensure that nondeterministic constructs (e.g., MPI wildcard receive matches) are executed in all possible ways. Our new algorithm rewrites wildcard receives to specific receives, one for each sender that can potentially match with the receive. It then recursively explores each case of the specific receives. The list of potential senders matching a receive is determined through a runtime algorithm that exploits MPI's operation ordering semantics. Our verification tool ISP that incorporates this algorithm efficiently verifies several programs and finds bugs missed by existing informal verification tools.
Adaptive dynamic surface control for a class of MIMO nonlinear systems with actuator failures
NASA Astrophysics Data System (ADS)
Amezquita S., Kendrick; Yan, Lin; Butt, Waseem A.
2013-03-01
In this article, an adaptive dynamic surface control scheme for a class of MIMO nonlinear systems with actuator failures and uncertainties is presented. In the proposed control scheme, the dynamic changes and disturbances induced by actuator failures are detected and isolated by means of radial basis function neural networks, which also compensate system uncertainties that arise from the mismatch between nominal model and real plant. In the presence of unknown actuation functions, the effectiveness of the control scheme is guaranteed by imposing a structural condition on the actuation matrix. Moreover, the singularity problem that arises from the approximation of unknown actuation functions is circumvented, and thus the use parameter projection is avoided. In this work, the nominal plant is transformed into a suitable form via diffeomorphism. Dynamic surface control design technique is used to develop the control laws. The closed-loop signals are proven to be uniformly ultimately bounded through Lyapunov approach, and the output tracking error is shown to be bounded within a residual set which can be made arbitrarily small by appropriately tuning the controller parameters. Finally, the proposed adaptive control scheme effectiveness is verified by simulation of the longitudinal dynamics of a twin otter aircraft undergoing actuator failures.
Differential flatness properties and multivariable adaptive control of ovarian system dynamics
NASA Astrophysics Data System (ADS)
Rigatos, Gerasimos
2016-12-01
The ovarian system exhibits nonlinear dynamics which is modeled by a set of coupled nonlinear differential equations. The paper proposes adaptive fuzzy control based on differential flatness theory for the complex dynamics of the ovarian system. It is proven that the dynamic model of the ovarian system, having as state variables the LH and the FSH hormones and their derivatives, is a differentially flat one. This means that all its state variables and its control inputs can be described as differential functions of the flat output. By exploiting differential flatness properties the system's dynamic model is written in the multivariable linear canonical (Brunovsky) form, for which the design of a state feedback controller becomes possible. After this transformation, the new control inputs of the system contain unknown nonlinear parts, which are identified with the use of neurofuzzy approximators. The learning procedure for these estimators is determined by the requirement the first derivative of the closed-loop's Lyapunov function to be a negative one. Moreover, Lyapunov stability analysis shows that H-infinity tracking performance is succeeded for the feedback control loop and this assures improved robustness to the aforementioned model uncertainty as well as to external perturbations. The efficiency of the proposed adaptive fuzzy control scheme is confirmed through simulation experiments.
Mansouri, Mohammad; Teshnehlab, Mohammad; Aliyari Shoorehdeli, Mahdi
2015-05-01
In this paper, a novel adaptive hierarchical fuzzy control system based on the variable structure control is developed for a class of SISO canonical nonlinear systems in the presence of bounded disturbances. It is assumed that nonlinear functions of the systems be completely unknown. Switching surfaces are incorporated into the hierarchical fuzzy control scheme to ensure the system stability. A fuzzy soft switching system decides the operation area of the hierarchical fuzzy control and variable structure control systems. All the nonlinearly appeared parameters of conclusion parts of fuzzy blocks located in different layers of the hierarchical fuzzy control system are adjusted through adaptation laws deduced from the defined Lyapunov function. The proposed hierarchical fuzzy control system reduces the number of rules and consequently the number of tunable parameters with respect to the ordinary fuzzy control system. Global boundedness of the overall adaptive system and the desired precision are achieved using the proposed adaptive control system. In this study, an adaptive hierarchical fuzzy system is used for two objectives; it can be as a function approximator or a control system based on an intelligent-classic approach. Three theorems are proven to investigate the stability of the nonlinear dynamic systems. The important point about the proposed theorems is that they can be applied not only to hierarchical fuzzy controllers with different structures of hierarchical fuzzy controller, but also to ordinary fuzzy controllers. Therefore, the proposed algorithm is more general. To show the effectiveness of the proposed method four systems (two mechanical, one mathematical and one chaotic) are considered in simulations. Simulation results demonstrate the validity, efficiency and feasibility of the proposed approach to control of nonlinear dynamic systems.
NASA Astrophysics Data System (ADS)
Pathak, Harshavardhana S.; Shukla, Ratnesh K.
2016-08-01
A high-order adaptive finite-volume method is presented for simulating inviscid compressible flows on time-dependent redistributed grids. The method achieves dynamic adaptation through a combination of time-dependent mesh node clustering in regions characterized by strong solution gradients and an optimal selection of the order of accuracy and the associated reconstruction stencil in a conservative finite-volume framework. This combined approach maximizes spatial resolution in discontinuous regions that require low-order approximations for oscillation-free shock capturing. Over smooth regions, high-order discretization through finite-volume WENO schemes minimizes numerical dissipation and provides excellent resolution of intricate flow features. The method including the moving mesh equations and the compressible flow solver is formulated entirely on a transformed time-independent computational domain discretized using a simple uniform Cartesian mesh. Approximations for the metric terms that enforce discrete geometric conservation law while preserving the fourth-order accuracy of the two-point Gaussian quadrature rule are developed. Spurious Cartesian grid induced shock instabilities such as carbuncles that feature in a local one-dimensional contact capturing treatment along the cell face normals are effectively eliminated through upwind flux calculation using a rotated Hartex-Lax-van Leer contact resolving (HLLC) approximate Riemann solver for the Euler equations in generalized coordinates. Numerical experiments with the fifth and ninth-order WENO reconstructions at the two-point Gaussian quadrature nodes, over a range of challenging test cases, indicate that the redistributed mesh effectively adapts to the dynamic flow gradients thereby improving the solution accuracy substantially even when the initial starting mesh is non-adaptive. The high adaptivity combined with the fifth and especially the ninth-order WENO reconstruction allows remarkably sharp capture of
Pairwise adaptive thermostats for improved accuracy and stability in dissipative particle dynamics
NASA Astrophysics Data System (ADS)
Leimkuhler, Benedict; Shang, Xiaocheng
2016-11-01
We examine the formulation and numerical treatment of dissipative particle dynamics (DPD) and momentum-conserving molecular dynamics. We show that it is possible to improve both the accuracy and the stability of DPD by employing a pairwise adaptive Langevin thermostat that precisely matches the dynamical characteristics of DPD simulations (e.g., autocorrelation functions) while automatically correcting thermodynamic averages using a negative feedback loop. In the low friction regime, it is possible to replace DPD by a simpler momentum-conserving variant of the Nosé-Hoover-Langevin method based on thermostatting only pairwise interactions; we show that this method has an extra order of accuracy for an important class of observables (a superconvergence result), while also allowing larger timesteps than alternatives. All the methods mentioned in the article are easily implemented. Numerical experiments are performed in both equilibrium and nonequilibrium settings; using Lees-Edwards boundary conditions to induce shear flow.
NASA Technical Reports Server (NTRS)
Everhart, J. L.
1983-01-01
A program called FLEXWAL for calculating wall modifications for solid, adaptive-wall wind tunnels is presented. The method used is the iterative technique of NASA TP-2081 and is applicable to subsonic and transonic test conditions. The program usage, program listing, and a sample case are given.
ERIC Educational Resources Information Center
BRIGGS, LESLIE J.; CAMPBELL, VINCENT N.
POTENTIAL ECONOMIC FORMS OF ADAPTIVE, SELF-INSTRUCTIONAL PROGRAMS WHICH WOULD BE OF PRACTICAL USE IN ADJUSTING TO INDIVIDUAL DIFFERENCES WERE INVESTIGATED. "PARALLEL" PROGRAMS (ONE STUDENT LEARNING BEST BY ONE PROGRAM AND A SECOND STUDENT BENEFITING MOST FROM ANOTHER) WERE FIRST EXPLORED AS A WAY TO ADJUST TO INDIVIDUAL DIFFERENCES. THIS…
ERIC Educational Resources Information Center
Ayotte, Violaine; Saucier, Jean-Francois; Bowen, Francois; Laurendeau, Marie-Claire; Fournier, Michel; Blais, Jean-Guy
2003-01-01
Evaluates a program that promoted adaptation of students in their first year of secondary school. The program focused on developing healthy self-perceptions, and cognitive, affective and behavioral skills. Analyses revealed the predicted positive effects of the program on psychological and social outcomes. Findings underline the need to address…
Adapting Animal-Assisted Therapy Trials to Prison-Based Animal Programs.
Allison, Molly; Ramaswamy, Megha
2016-09-01
Prison-based animal programs have shown promise when it comes to increased sociability, responsibility, and levels of patience for inmates who participate in these programs. Yet there remains a dearth of scientific research that demonstrates the impact of prison-based animal programs on inmates' physical and mental health. Trials of animal-assisted therapy interventions, a form of human-animal interaction therapy most often used with populations affected by depression/anxiety, mental illness, and trauma, may provide models of how prison-based animal program research can have widespread implementation in jail and prison settings, whose populations have high rates of mental health problems. This paper reviews the components of prison-based animal programs most commonly practiced in prisons today, presents five animal-assisted therapy case studies, evaluates them based on their adaptability to prison-based animal programs, and discusses the institutional constraints that act as barriers for rigorous prison-based animal program research implementation. This paper can serve to inform the development of a research approach to animal-assisted therapy that nurses and other public health researchers can use in working with correctional populations.
Schlüter, Lothar; Lohbeck, Kai T; Gröger, Joachim P; Riebesell, Ulf; Reusch, Thorsten B H
2016-07-01
Marine phytoplankton may adapt to ocean change, such as acidification or warming, because of their large population sizes and short generation times. Long-term adaptation to novel environments is a dynamic process, and phenotypic change can take place thousands of generations after exposure to novel conditions. We conducted a long-term evolution experiment (4 years = 2100 generations), starting with a single clone of the abundant and widespread coccolithophore Emiliania huxleyi exposed to three different CO2 levels simulating ocean acidification (OA). Growth rates as a proxy for Darwinian fitness increased only moderately under both levels of OA [+3.4% and +4.8%, respectively, at 1100 and 2200 μatm partial pressure of CO2 (Pco2)] relative to control treatments (ambient CO2, 400 μatm). Long-term adaptation to OA was complex, and initial phenotypic responses of ecologically important traits were later reverted. The biogeochemically important trait of calcification, in particular, that had initially been restored within the first year of evolution was later reduced to levels lower than the performance of nonadapted populations under OA. Calcification was not constitutively lost but returned to control treatment levels when high CO2-adapted isolates were transferred back to present-day control CO2 conditions. Selection under elevated CO2 exacerbated a general decrease of cell sizes under long-term laboratory evolution. Our results show that phytoplankton may evolve complex phenotypic plasticity that can affect biogeochemically important traits, such as calcification. Adaptive evolution may play out over longer time scales (>1 year) in an unforeseen way under future ocean conditions that cannot be predicted from initial adaptation responses.
Schlüter, Lothar; Lohbeck, Kai T.; Gröger, Joachim P.; Riebesell, Ulf; Reusch, Thorsten B. H.
2016-01-01
Marine phytoplankton may adapt to ocean change, such as acidification or warming, because of their large population sizes and short generation times. Long-term adaptation to novel environments is a dynamic process, and phenotypic change can take place thousands of generations after exposure to novel conditions. We conducted a long-term evolution experiment (4 years = 2100 generations), starting with a single clone of the abundant and widespread coccolithophore Emiliania huxleyi exposed to three different CO2 levels simulating ocean acidification (OA). Growth rates as a proxy for Darwinian fitness increased only moderately under both levels of OA [+3.4% and +4.8%, respectively, at 1100 and 2200 μatm partial pressure of CO2 (Pco2)] relative to control treatments (ambient CO2, 400 μatm). Long-term adaptation to OA was complex, and initial phenotypic responses of ecologically important traits were later reverted. The biogeochemically important trait of calcification, in particular, that had initially been restored within the first year of evolution was later reduced to levels lower than the performance of nonadapted populations under OA. Calcification was not constitutively lost but returned to control treatment levels when high CO2–adapted isolates were transferred back to present-day control CO2 conditions. Selection under elevated CO2 exacerbated a general decrease of cell sizes under long-term laboratory evolution. Our results show that phytoplankton may evolve complex phenotypic plasticity that can affect biogeochemically important traits, such as calcification. Adaptive evolution may play out over longer time scales (>1 year) in an unforeseen way under future ocean conditions that cannot be predicted from initial adaptation responses. PMID:27419227
Motion-adaptive spatio-temporal regularization for accelerated dynamic MRI.
Asif, M Salman; Hamilton, Lei; Brummer, Marijn; Romberg, Justin
2013-09-01
Accelerated magnetic resonance imaging techniques reduce signal acquisition time by undersampling k-space. A fundamental problem in accelerated magnetic resonance imaging is the recovery of quality images from undersampled k-space data. Current state-of-the-art recovery algorithms exploit the spatial and temporal structures in underlying images to improve the reconstruction quality. In recent years, compressed sensing theory has helped formulate mathematical principles and conditions that ensure recovery of (structured) sparse signals from undersampled, incoherent measurements. In this article, a new recovery algorithm, motion-adaptive spatio-temporal regularization, is presented that uses spatial and temporal structured sparsity of MR images in the compressed sensing framework to recover dynamic MR images from highly undersampled k-space data. In contrast to existing algorithms, our proposed algorithm models temporal sparsity using motion-adaptive linear transformations between neighboring images. The efficiency of motion-adaptive spatio-temporal regularization is demonstrated with experiments on cardiac magnetic resonance imaging for a range of reduction factors. Results are also compared with k-t FOCUSS with motion estimation and compensation-another recently proposed recovery algorithm for dynamic magnetic resonance imaging. .
Adaptive modeling, identification, and control of dynamic structural systems. I. Theory
Safak, Erdal
1989-01-01
A concise review of the theory of adaptive modeling, identification, and control of dynamic structural systems based on discrete-time recordings is presented. Adaptive methods have four major advantages over the classical methods: (1) Removal of the noise from the signal is done over the whole frequency band; (2) time-varying characteristics of systems can be tracked; (3) systems with unknown characteristics can be controlled; and (4) a small segment of the data is needed during the computations. Included in the paper are the discrete-time representation of single-input single-output (SISO) systems, models for SISO systems with noise, the concept of stochastic approximation, recursive prediction error method (RPEM) for system identification, and the adaptive control. Guidelines for model selection and model validation and the computational aspects of the method are also discussed in the paper. The present paper is the first of two companion papers. The theory given in the paper is limited to that which is necessary to follow the examples for applications in structural dynamics presented in the second paper.
Abrams, Peter A; Ruokolainen, Lasse
2011-05-21
This article uses simple models to explore the impact of adaptive movement by consumers on the population dynamics of a consumer-resource metacommunity consisting of two identical patches. Consumer-resource interactions within a patch are described by the Rosenzweig-MacArthur predator-prey model, and these dynamics are assumed to be cyclic in the absence of movement. The per capita movement rate from one patch to the other is an increasing function of the difference between the per capita birth minus death rate in the destination patch and that in the currently occupied patch. Several variations on this model are considered. Results show that adaptive movement frequently creates anti-phase cycles in the two patches; these suppress the predator-prey cycle and lead to low temporal variation of the total population sizes of both species. Paradoxically, even when movement is very sensitive to the fitness difference between patches, perfect synchrony of patches is often much less likely than in comparable systems with random movement. Under these circumstances adaptive movement of consumers often generates differences in the average properties of the two patches. In addition, mean global densities and responses to global perturbations often differ greatly from similar systems with no movement or random movement.
Dynamics of a wellness program: a conservation of resources perspective.
Kim, Sung Doo; Hollensbe, Elaine C; Schwoerer, Catherine E; Halbesleben, Jonathon R B
2015-01-01
We leverage conservation of resources theory to explain possible dynamics through which a holistic wellness program results in positive longer-term outcomes. Specifically, we hypothesize that wellness self-efficacy at the end of a wellness program will create a positive resource gain spiral, increasing psychological availability (a sense of having cognitive, physical, and emotional resources to engage oneself) 6 months later, and career satisfaction, 1 year later. To test these hypotheses, using a time-lagged with control group design, we gathered questionnaire data from 160 Episcopal priests who participated in a 10-day off-site wellness program. We developed a scale measuring self-efficacy in the 4 wellness areas the program was designed to improve: physical, spiritual, financial, and vocational. Our findings provide evidence from a field setting of a relatively untested tenet of conservation of resources theory, resource gain spirals. The wellness program that we studied served as an opportunity for participants to gain new resources in the form of wellness self-efficacy, which in turn helped participants experience positive outcomes over time. We discuss theoretical and practical implications of the findings.
ERIC Educational Resources Information Center
Karakostas, A.; Demetriadis, S.
2011-01-01
Research on computer-supported collaborative learning (CSCL) has strongly emphasized the value of providing student support of either fixed (e.g. collaboration scripts) or dynamic form (e.g. adaptive supportive interventions). Currently, however, there is not sufficient evidence corroborating the potential of adaptive support methods to improve…
Fast and intuitive programming of adaptive laser cutting of lace enabled by machine vision
NASA Astrophysics Data System (ADS)
Vaamonde, Iago; Souto-López, Álvaro; García-Díaz, Antón
2015-07-01
A machine vision system has been developed, validated, and integrated in a commercial laser robot cell. It permits an offline graphical programming of laser cutting of lace. The user interface allows loading CAD designs and aligning them with images of lace pieces. Different thread widths are discriminated to generate proper cutting program templates. During online operation, the system aligns CAD models of pieces and lace images, pre-checks quality of lace cuts and adapts laser parameters to thread widths. For pieces detected with the required quality, the program template is adjusted by transforming the coordinates of every trajectory point. A low-cost lace feeding system was also developed for demonstration of full process automation.
Sturmberg, Joachim P; Martin, Carmel M
2010-10-01
Health services demonstrate key features of complex adaptive systems (CAS), they are dynamic and unfold in unpredictable ways, and unfolding events are often unique. To better understand the complex adaptive nature of health systems around a core attractor we propose the metaphor of the health care vortex. We also suggest that in an ideal health care system the core attractor would be personal health attainment. Health care reforms around the world offer an opportunity to analyse health system change from a complex adaptive perspective. At large health care reforms have been pursued disregarding the complex adaptive nature of the health system. The paper details some recent reforms and outlines how to understand their strategies and outcomes, and what could be learnt for future efforts, utilising CAS principles. Current health systems show the inherent properties of a CAS driven by a core attractor of disease and cost containment. We content that more meaningful health systems reform requires the delicate task of shifting the core attractor from disease and cost containment towards health attainment.
Shkvarko, Yuriy; Tuxpan, José; Santos, Stewart
2011-01-01
We consider a problem of high-resolution array radar/SAR imaging formalized in terms of a nonlinear ill-posed inverse problem of nonparametric estimation of the power spatial spectrum pattern (SSP) of the random wavefield scattered from a remotely sensed scene observed through a kernel signal formation operator and contaminated with random Gaussian noise. First, the Sobolev-type solution space is constructed to specify the class of consistent kernel SSP estimators with the reproducing kernel structures adapted to the metrics in such the solution space. Next, the "model-free" variational analysis (VA)-based image enhancement approach and the "model-based" descriptive experiment design (DEED) regularization paradigm are unified into a new dynamic experiment design (DYED) regularization framework. Application of the proposed DYED framework to the adaptive array radar/SAR imaging problem leads to a class of two-level (DEED-VA) regularized SSP reconstruction techniques that aggregate the kernel adaptive anisotropic windowing with the projections onto convex sets to enforce the consistency and robustness of the overall iterative SSP estimators. We also show how the proposed DYED regularization method may be considered as a generalization of the MVDR, APES and other high-resolution nonparametric adaptive radar sensing techniques. A family of the DYED-related algorithms is constructed and their effectiveness is finally illustrated via numerical simulations.
Modeling dynamics of adaptive complex systems: From gene regulatory networks to financial markets
NASA Astrophysics Data System (ADS)
Liu, Min
This dissertation aims to model the dynamics of two types of adaptive complex systems: gene regulatory networks and financial markets. In modeling gene regulatory networks, a dynamics-driven rewiring mechanism is introduced to Boolean networks and it is found that a critical state emerges spontaneously resulting from the interplay between topology and dynamics during evolution. For biologically realized network sizes, significant finite-size effects are observed. In networks of competing Boolean nodes, we find that in small networks, the evolutionary dynamics selects for input inverting functions rather than canalizing functions in infinitely large networks. It is found that finite sizes can cause symmetry breaking in the evolutionary dynamics. Using the Polya theorem, we show the number of the function classes increases to 46, in contrast to 14 in infinitely large networks, due to the reduced symmetry which matches our simulation results well. In addition, we find that an optimum amount of stochastic noise in the signals exchanged between nodes can result in maximum excess canalization. In modeling financial markets, we simulate a double-auction virtual market by utilizing reaction-diffusion processes to describe the dynamics of limit orders. We find that the log-returns produced have a dynamical scaling exponent of 1/4 and nonstationary, negatively autocorrelated increments. By investigating the microstructure of the virtual market, we find that the mean interarrival time between transactions satisfies an increasing power-law function of time. We propose an inhomogeneous compound Poisson process with a decreasing power-law intensity rate function and demonstrate that this purely jump process captures the essential macroscopic dynamics of the virtual market.
Vasseur, David A; Fox, Jeremy W
2011-10-01
Consumers acquire essential nutrients by ingesting the tissues of resource species. When these tissues contain essential nutrients in a suboptimal ratio, consumers may benefit from ingesting a mixture of nutritionally complementary resource species. We investigate the joint ecological and evolutionary consequences of competition for complementary resources, using an adaptive dynamics model of two consumers and two resources that differ in their relative content of two essential nutrients. In the absence of competition, a nutritionally balanced diet rarely maximizes fitness because of the dynamic feedbacks between uptake rate and resource density, whereas in sympatry, nutritionally balanced diets maximize fitness because competing consumers with different nutritional requirements tend to equalize the relative abundances of the two resources. Adaptation from allopatric to sympatric fitness optima can generate character convergence, divergence, and parallel shifts, depending not on the degree of diet overlap but on the match between resource nutrient content and consumer nutrient requirements. Contrary to previous verbal arguments that suggest that character convergence leads to neutral stability, coadaptation of competing consumers always leads to stable coexistence. Furthermore, we show that incorporating costs of consuming or excreting excess nonlimiting nutrients selects for nutritionally balanced diets and so promotes character convergence. This article demonstrates that resource-use overlap has little bearing on coexistence when resources are nutritionally complementary, and it highlights the importance of using mathematical models to infer the stability of ecoevolutionary dynamics.
Dynamic optical aberration correction with adaptive coded apertures techniques in conformal imaging
NASA Astrophysics Data System (ADS)
Li, Yan; Hu, Bin; Zhang, Pengbin; Zhang, Binglong
2015-02-01
Conformal imaging systems are confronted with dynamic aberration in optical design processing. In classical optical designs, for combination high requirements of field of view, optical speed, environmental adaption and imaging quality, further enhancements can be achieved only by the introduction of increased complexity of aberration corrector. In recent years of computational imaging, the adaptive coded apertures techniques which has several potential advantages over more traditional optical systems is particularly suitable for military infrared imaging systems. The merits of this new concept include low mass, volume and moments of inertia, potentially lower costs, graceful failure modes, steerable fields of regard with no macroscopic moving parts. Example application for conformal imaging system design where the elements of a set of binary coded aperture masks are applied are optimization designed is presented in this paper, simulation results show that the optical performance is closely related to the mask design and the reconstruction algorithm optimization. As a dynamic aberration corrector, a binary-amplitude mask located at the aperture stop is optimized to mitigate dynamic optical aberrations when the field of regard changes and allow sufficient information to be recorded by the detector for the recovery of a sharp image using digital image restoration in conformal optical system.
Experience with automatic, dynamic load balancing and adaptive finite element computation
Wheat, S.R.; Devine, K.D.; Maccabe, A.B.
1993-10-01
Distributed memory, Massively Parallel (MP), MIMD technology has enabled the development of applications requiring computational resources previously unobtainable. Structural mechanics and fluid dynamics applications, for example, are often solved by finite element methods (FEMs) requiring, millions of degrees of freedom to accurately simulate physical phenomenon. Adaptive methods, which automatically refine or coarsen meshes and vary the order of accuracy of the numerical solution, offer greater robustness and computational efficiency than traditional FEMs by reducing the amount of computation required away from physical structures such as shock waves and boundary layers. On MP computers, FEMs frequently result in distributed processor load imbalances. To overcome load imbalance, many MP FEMs use static load balancing as a preprocessor to the finite element calculation. Adaptive methods complicate the load imbalance problem since the work per element is not uniform across the solution domain and changes as the computation proceeds. Therefore, dynamic load balancing is required to maintain global load balance. We describe a dynamic, fine-grained, element-based data migration system that maintains global load balance and is effective in the presence of changing work loads. Global load balance is achieved by overlapping neighborhoods of processors, where each neighborhood performs local load balancing. The method utilizes an automatic element management system library to which a programmer integrates the application`s computational description. The library`s flexibility supports a large class of finite element and finite difference based applications.
Dynamics of Excitation and Inhibition in the Light-Adapted Limulus Eye in situ
Biederman-Thorson, Marguerite; Thorson, John
1971-01-01
The dynamics of spike discharge in eccentric cell axons from the in situ lateral eye of Limulus, under small sinusoidal modulation of light to which the eye is adapted, are described over two decades of light intensity and nearly three decades of frequency. Steady-state lateral inhibition coefficients, derived from the very low-frequency response, average 0.04 at three interommatidial spacings. The gain vs. frequency of a singly illuminated ommatidium is described closely from 0.004 to 0.4 cps by the linear transfer function s0.25; this function also accounts approximately for the measured phase leads, the small signal adaptation following small step inputs, and for Pinter's (1966) earlier low-frequency generator potential data. We suggest that such dynamics could arise from a summation in the generator potential of distributed intensity-dependent relaxation processes along the dendrite and rhabdome. Analysis of the dynamic responses of an eccentric cell with and without simultaneously modulated illumination of particular neighbors indicates an effect equivalent to self-inhibition acting via a first-order low-pass filter with time constant 0.42 sec, and steady-state gain near 4.0. The corresponding filters for lateral inhibition required time constants from 0.35 to 1 sec and effective finite delay of 50–90 msec. PMID:5564759
An Adaptive Channel Access Method for Dynamic Super Dense Wireless Sensor Networks.
Lei, Chunyang; Bie, Hongxia; Fang, Gengfa; Zhang, Xuekun
2015-12-03
Super dense and distributed wireless sensor networks have become very popular with the development of small cell technology, Internet of Things (IoT), Machine-to-Machine (M2M) communications, Vehicular-to-Vehicular (V2V) communications and public safety networks. While densely deployed wireless networks provide one of the most important and sustainable solutions to improve the accuracy of sensing and spectral efficiency, a new channel access scheme needs to be designed to solve the channel congestion problem introduced by the high dynamics of competing nodes accessing the channel simultaneously. In this paper, we firstly analyzed the channel contention problem using a novel normalized channel contention analysis model which provides information on how to tune the contention window according to the state of channel contention. We then proposed an adaptive channel contention window tuning algorithm in which the contention window tuning rate is set dynamically based on the estimated channel contention level. Simulation results show that our proposed adaptive channel access algorithm based on fast contention window tuning can achieve more than 95 % of the theoretical optimal throughput and 0 . 97 of fairness index especially in dynamic and dense networks.
NASA Technical Reports Server (NTRS)
Feng, Hui-Yu; VanderWijngaart, Rob; Biswas, Rupak; Biegel, Bryan (Technical Monitor)
2001-01-01
We describe the design of a new method for the measurement of the performance of modern computer systems when solving scientific problems featuring irregular, dynamic memory accesses. The method involves the solution of a stylized heat transfer problem on an unstructured, adaptive grid. A Spectral Element Method (SEM) with an adaptive, nonconforming mesh is selected to discretize the transport equation. The relatively high order of the SEM lowers the fraction of wall clock time spent on inter-processor communication, which eases the load balancing task and allows us to concentrate on the memory accesses. The benchmark is designed to be three-dimensional. Parallelization and load balance issues of a reference implementation will be described in detail in future reports.
Adaptive iteration method for star centroid extraction under highly dynamic conditions
NASA Astrophysics Data System (ADS)
Gao, Yushan; Qin, Shiqiao; Wang, Xingshu
2016-10-01
Star centroiding accuracy decreases significantly when star sensor works under highly dynamic conditions or star images are corrupted by severe noise, reducing the output attitude precision. Herein, an adaptive iteration method is proposed to solve this problem. Firstly, initial star centroids are predicted by traditional method, and then based on initial reported star centroids and angular velocities of the star sensor, adaptive centroiding windows are generated to cover the star area and then an iterative method optimizing the location of centroiding window is used to obtain the final star spot extraction results. Simulation results shows that, compared with traditional star image restoration method and Iteratively Weighted Center of Gravity method, AWI algorithm maintains higher extraction accuracy when rotation velocities or noise level increases.
Xu, Haojie; Lu, Yunfeng; Zhu, Shanan; He, Bin
2014-07-01
It is of significance to assess the dynamic spectral causality among physiological signals. Several practical estimators adapted from spectral Granger causality have been exploited to track dynamic causality based on the framework of time-varying multivariate autoregressive (tvMVAR) models. The nonzero covariance of the model's residuals has been used to describe the instantaneous effect phenomenon in some causality estimators. However, for the situations with Gaussian residuals in some autoregressive models, it is challenging to distinguish the directed instantaneous causality if the sufficient prior information about the "causal ordering" is missing. Here, we propose a new algorithm to assess the time-varying causal ordering of tvMVAR model under the assumption that the signals follow the same acyclic causal ordering for all time lags and to estimate the instantaneous effect factor (IEF) value in order to track the dynamic directed instantaneous connectivity. The time-lagged adaptive directed transfer function (ADTF) is also estimated to assess the lagged causality after removing the instantaneous effect. In this study, we first investigated the performance of the causal-ordering estimation algorithm and the accuracy of IEF value. Then, we presented the results of IEF and time-lagged ADTF method by comparing with the conventional ADTF method through simulations of various propagation models. Statistical analysis results suggest that the new algorithm could accurately estimate the causal ordering and give a good estimation of the IEF values in the Gaussian residual conditions. Meanwhile, the time-lagged ADTF approach is also more accurate in estimating the time-lagged dynamic interactions in a complex nervous system after extracting the instantaneous effect. In addition to the simulation studies, we applied the proposed method to estimate the dynamic spectral causality on real visual evoked potential (VEP) data in a human subject. Its usefulness in time
Xu, Haojie; Lu, Yunfeng; Zhu, Shanan
2014-01-01
It is of significance to assess the dynamic spectral causality among physiological signals. Several practical estimators adapted from spectral Granger causality have been exploited to track dynamic causality based on the framework of time-varying multivariate autoregressive (tvMVAR) models. The non-zero covariance of the model’s residuals has been used to describe the instantaneous effect phenomenon in some causality estimators. However, for the situations with Gaussian residuals in some autoregressive models, it is challenging to distinguish the directed instantaneous causality if the sufficient prior information about the “causal ordering” is missing. Here, we propose a new algorithm to assess the time-varying causal ordering of tvMVAR model under the assumption that the signals follow the same acyclic causal ordering for all time lags and to estimate the instantaneous effect factor (IEF) value in order to track the dynamic directed instantaneous connectivity. The time-lagged adaptive directed transfer function (ADTF) is also estimated to assess the lagged causality after removing the instantaneous effect. In the present study, we firstly investigated the performance of the causal-ordering estimation algorithm and the accuracy of IEF value. Then, we presented the results of IEF and time-lagged ADTF method by comparing with the conventional ADTF method through simulations of various propagation models. Statistical analysis results suggest that the new algorithm could accurately estimate the causal ordering and give a good estimation of the IEF values in the Gaussian residual conditions. Meanwhile, the time-lagged ADTF approach is also more accurate in estimating the time-lagged dynamic interactions in a complex nervous system after extracting the instantaneous effect. In addition to the simulation studies, we applied the proposed method to estimate the dynamic spectral causality on real visual evoked potential (VEP) data in a human subject. Its usefulness in
ERIC Educational Resources Information Center
Maniates, Helen
2017-01-01
This article examines how three urban elementary school teachers adapted pedagogical strategies from a school district--adopted core reading program to increase their students' access to the curriculum. Using teacher interviews and classroom observations to construct a descriptive case study of teacher adaptation, analysis reveals that the…
ERIC Educational Resources Information Center
Antonakopoulou, Efi
2013-01-01
There is no evidence in the literature for direct comparison of the sociocultural adaptation brought by the participation of U.S. students in education abroad programs of different lengths. This study attempts to address this gap by comparing the sociocultural adaptation of education abroad students that results from their participation in both…
Musical structure analysis using similarity matrix and dynamic programming
NASA Astrophysics Data System (ADS)
Shiu, Yu; Jeong, Hong; Kuo, C.-C. Jay
2005-10-01
Automatic music segmentation and structure analysis from audio waveforms based on a three-level hierarchy is examined in this research, where the three-level hierarchy includes notes, measures and parts. The pitch class profile (PCP) feature is first extracted at the note level. Then, a similarity matrix is constructed at the measure level, where a dynamic time warping (DTW) technique is used to enhance the similarity computation by taking the temporal distortion of similar audio segments into account. By processing the similarity matrix, we can obtain a coarse-grain music segmentation result. Finally, dynamic programming is applied to the coarse-grain segments so that a song can be decomposed into several major parts such as intro, verse, chorus, bridge and outro. The performance of the proposed music structure analysis system is demonstrated for pop and rock music.
Heuristic reusable dynamic programming: efficient updates of local sequence alignment.
Hong, Changjin; Tewfik, Ahmed H
2009-01-01
Recomputation of the previously evaluated similarity results between biological sequences becomes inevitable when researchers realize errors in their sequenced data or when the researchers have to compare nearly similar sequences, e.g., in a family of proteins. We present an efficient scheme for updating local sequence alignments with an affine gap model. In principle, using the previous matching result between two amino acid sequences, we perform a forward-backward alignment to generate heuristic searching bands which are bounded by a set of suboptimal paths. Given a correctly updated sequence, we initially predict a new score of the alignment path for each contour to select the best candidates among them. Then, we run the Smith-Waterman algorithm in this confined space. Furthermore, our heuristic alignment for an updated sequence shows that it can be further accelerated by using reusable dynamic programming (rDP), our prior work. In this study, we successfully validate "relative node tolerance bound" (RNTB) in the pruned searching space. Furthermore, we improve the computational performance by quantifying the successful RNTB tolerance probability and switch to rDP on perturbation-resilient columns only. In our searching space derived by a threshold value of 90 percent of the optimal alignment score, we find that 98.3 percent of contours contain correctly updated paths. We also find that our method consumes only 25.36 percent of the runtime cost of sparse dynamic programming (sDP) method, and to only 2.55 percent of that of a normal dynamic programming with the Smith-Waterman algorithm.
Aperiodic dynamics in a deterministic adaptive network model of attitude formation in social groups
NASA Astrophysics Data System (ADS)
Ward, Jonathan A.; Grindrod, Peter
2014-07-01
Adaptive network models, in which node states and network topology coevolve, arise naturally in models of social dynamics that incorporate homophily and social influence. Homophily relates the similarity between pairs of nodes' states to their network coupling strength, whilst social influence causes coupled nodes' states to convergence. In this paper we propose a deterministic adaptive network model of attitude formation in social groups that includes these effects, and in which the attitudinal dynamics are represented by an activato-inhibitor process. We illustrate that consensus, corresponding to all nodes adopting the same attitudinal state and being fully connected, may destabilise via Turing instability, giving rise to aperiodic dynamics with sensitive dependence on initial conditions. These aperiodic dynamics correspond to the formation and dissolution of sub-groups that adopt contrasting attitudes. We discuss our findings in the context of cultural polarisation phenomena. Social influence. This reflects the fact that people tend to modify their behaviour and attitudes in response to the opinions of others [22-26]. We model social influence via diffusion: agents adjust their state according to a weighted sum (dictated by the evolving network) of the differences between their state and the states of their neighbours. Homophily. This relates the similarity of individuals' states to their frequency and strength of interaction [27]. Thus in our model, homophily drives the evolution of the weighted ‘social' network. A precise formulation of our model is given in Section 2. Social influence and homophily underpin models of social dynamics [21], which cover a wide range of sociological phenomena, including the diffusion of innovations [28-32], complex contagions [33-36], collective action [37-39], opinion dynamics [19,20,40,10,11,13,15,41,16], the emergence of social norms [42-44], group stability [45], social differentiation [46] and, of particular relevance
Parallel solution of sparse one-dimensional dynamic programming problems
NASA Technical Reports Server (NTRS)
Nicol, David M.
1989-01-01
Parallel computation offers the potential for quickly solving large computational problems. However, it is often a non-trivial task to effectively use parallel computers. Solution methods must sometimes be reformulated to exploit parallelism; the reformulations are often more complex than their slower serial counterparts. We illustrate these points by studying the parallelization of sparse one-dimensional dynamic programming problems, those which do not obviously admit substantial parallelization. We propose a new method for parallelizing such problems, develop analytic models which help us to identify problems which parallelize well, and compare the performance of our algorithm with existing algorithms on a multiprocessor.
Dynamic programming and graph algorithms in computer vision.
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.
Dynamics of the public concern and risk communication program implementation.
Zaryabova, Victoria; Israel, Michel
2015-09-01
The public concern about electromagnetic field (EMF) exposure varies due to different reasons. A part of them are connected with the better and higher quality of information that people receive from science, media, Internet, social networks, industry, but others are based on good communication programs performed by the responsible institutions, administration and persons. Especially, in Bulgaria, public concern follows interesting changes, some of them in correlation with the European processes of concern, but others following the economic and political processes in the country. Here, we analyze the dynamics of the public concern over the last 10 years. Our explanation of the decrease of the people's complaints against EMF exposure from base stations for mobile communication is as a result of our risk communication program that is in implementation for >10 years.
NASA/FAA general aviation crash dynamics program - An update
NASA Technical Reports Server (NTRS)
Hayduk, R. J.; Thomson, R. G.; Carden, H. D.
1979-01-01
Work in progress in the NASA/FAA General Aviation Crash Dynamics Program for the development of technology for increased crash-worthiness and occupant survivability of general aviation aircraft is presented. Full-scale crash testing facilities and procedures are outlined, and a chronological summary of full-scale tests conducted and planned is presented. The Plastic and Large Deflection Analysis of Nonlinear Structures and Modified Seat Occupant Model for Light Aircraft computer programs which form part of the effort to predict nonlinear geometric and material behavior of sheet-stringer aircraft structures subjected to large deformations are described, and excellent agreement between simulations and experiments is noted. The development of structural concepts to attenuate the load transmitted to the passenger through the seats and subfloor structure is discussed, and an apparatus built to test emergency locator transmitters in a realistic environment is presented.
Adaptive uniform grayscale coded aperture design for high dynamic range compressive spectral imaging
NASA Astrophysics Data System (ADS)
Diaz, Nelson; Rueda, Hoover; Arguello, Henry
2016-05-01
Imaging spectroscopy is an important area with many applications in surveillance, agriculture and medicine. The disadvantage of conventional spectroscopy techniques is that they collect the whole datacube. In contrast, compressive spectral imaging systems capture snapshot compressive projections, which are the input of reconstruction algorithms to yield the underlying datacube. Common compressive spectral imagers use coded apertures to perform the coded projections. The coded apertures are the key elements in these imagers since they define the sensing matrix of the system. The proper design of the coded aperture entries leads to a good quality in the reconstruction. In addition, the compressive measurements are prone to saturation due to the limited dynamic range of the sensor, hence the design of coded apertures must consider saturation. The saturation errors in compressive measurements are unbounded and compressive sensing recovery algorithms only provide solutions for bounded noise or bounded with high probability. In this paper it is proposed the design of uniform adaptive grayscale coded apertures (UAGCA) to improve the dynamic range of the estimated spectral images by reducing the saturation levels. The saturation is attenuated between snapshots using an adaptive filter which updates the entries of the grayscale coded aperture based on the previous snapshots. The coded apertures are optimized in terms of transmittance and number of grayscale levels. The advantage of the proposed method is the efficient use of the dynamic range of the image sensor. Extensive simulations show improvements in the image reconstruction of the proposed method compared with grayscale coded apertures (UGCA) and adaptive block-unblock coded apertures (ABCA) in up to 10 dB.
NASA Astrophysics Data System (ADS)
Mendoza, Edgar; Prohaska, John; Kempen, Connie; Esterkin, Yan; Sun, Sunjian; Krishnaswamy, Sridhar
2010-09-01
This paper describes preliminary results obtained under a Navy SBIR contract by Redondo Optics Inc. (ROI), in collaboration with Northwestern University towards the development and demonstration of a next generation, stand-alone and fully integrated, dynamically reconfigurable, adaptive fiber optic acoustic emission sensor (FAESense™) system for the in-situ unattended detection and localization of shock events, impact damage, cracks, voids, and delaminations in new and aging critical infrastructures found in ships, submarines, aircraft, and in next generation weapon systems. ROI's FAESense™ system is based on the integration of proven state-of-the-art technologies: 1) distributed array of in-line fiber Bragg gratings (FBGs) sensors sensitive to strain, vibration, and acoustic emissions, 2) adaptive spectral demodulation of FBG sensor dynamic signals using two-wave mixing interferometry on photorefractive semiconductors, and 3) integration of all the sensor system passive and active optoelectronic components within a 0.5-cm x 1-cm photonic integrated circuit microchip. The adaptive TWM demodulation methodology allows the measurement of dynamic high frequnency acoustic emission events, while compensating for passive quasi-static strain and temperature drifts. It features a compact, low power, environmentally robust 1-inch x 1-inch x 4-inch small form factor (SFF) package with no moving parts. The FAESense™ interrogation system is microprocessor-controlled using high data rate signal processing electronics for the FBG sensors calibration, temperature compensation and the detection and analysis of acoustic emission signals. Its miniaturized package, low power operation, state-of-the-art data communications, and low cost makes it a very attractive solution for a large number of applications in naval and maritime industries, aerospace, civil structures, the oil and chemical industry, and for homeland security applications.
Computational Fluid Dynamics Program at NASA Ames Research Center
NASA Technical Reports Server (NTRS)
Holst, Terry L.
1989-01-01
The Computational Fluid Dynamics (CFD) Program at NASA Ames Research Center is reviewed and discussed. The technical elements of the CFD Program are listed and briefly discussed. These elements include algorithm research, research and pilot code development, scientific visualization, advanced surface representation, volume grid generation, and numerical optimization. Next, the discipline of CFD is briefly discussed and related to other areas of research at NASA Ames including experimental fluid dynamics, computer science research, computational chemistry, and numerical aerodynamic simulation. These areas combine with CFD to form a larger area of research, which might collectively be called computational technology. The ultimate goal of computational technology research at NASA Ames is to increase the physical understanding of the world in which we live, solve problems of national importance, and increase the technical capabilities of the aerospace community. Next, the major programs at NASA Ames that either use CFD technology or perform research in CFD are listed and discussed. Briefly, this list includes turbulent/transition physics and modeling, high-speed real gas flows, interdisciplinary research, turbomachinery demonstration computations, complete aircraft aerodynamics, rotorcraft applications, powered lift flows, high alpha flows, multiple body aerodynamics, and incompressible flow applications. Some of the individual problems actively being worked in each of these areas is listed to help define the breadth or extent of CFD involvement in each of these major programs. State-of-the-art examples of various CFD applications are presented to highlight most of these areas. The main emphasis of this portion of the presentation is on examples which will not otherwise be treated at this conference by the individual presentations. Finally, a list of principal current limitations and expected future directions is given.
O'Connor, Mike; Paci, Emanuele; McIntosh-Smith, Simon; Glowacki, David R
2016-12-22
The past decade has seen the development of a new class of rare event methods in which molecular configuration space is divided into a set of boundaries/interfaces, and then short trajectories are run between boundaries. For all these methods, an important concern is how to generate boundaries. In this paper, we outline an algorithm for adaptively generating boundaries along a free energy surface in multi-dimensional collective variable (CV) space, building on the boxed molecular dynamics (BXD) rare event algorithm. BXD is a simple technique for accelerating the simulation of rare events and free energy sampling which has proven useful for calculating kinetics and free energy profiles in reactive and non-reactive molecular dynamics (MD) simulations across a range of systems, in both NVT and NVE ensembles. Two key developments outlined in this paper make it possible to automate BXD, and to adaptively map free energy and kinetics in complex systems. First, we have generalized BXD to multidimensional CV space. Using strategies from rigid-body dynamics, we have derived a simple and general velocity-reflection procedure that conserves energy for arbitrary collective variable definitions in multiple dimensions, and show that it is straightforward to apply BXD to sampling in multidimensional CV space so long as the Cartesian gradients ∇CV are available. Second, we have modified BXD to undertake on-the-fly statistical analysis during a trajectory, harnessing the information content latent in the dynamics to automatically determine boundary locations. Such automation not only makes BXD considerably easier to use; it also guarantees optimal boundaries, speeding up convergence. We have tested the multidimensional adaptive BXD procedure by calculating the potential of mean force for a chemical reaction recently investigated using both experimental and computational approaches - i.e., F + CD3CN → DF + D2CN in both the gas phase and a strongly coupled explicit CD3CN solvent
The Glen Canyon Dam adaptive management program: progress and immediate challenges
Hamill, John F.; Melis, Theodore S.; Boon, Philip J.; Raven, Paul J.
2012-01-01
Adaptive management emerged as an important resource management strategy for major river systems in the United States (US) in the early 1990s. The Glen Canyon Dam Adaptive Management Program (‘the Program’) was formally established in 1997 to fulfill a statutory requirement in the 1992 Grand Canyon Protection Act (GCPA). The GCPA aimed to improve natural resource conditions in the Colorado River corridor in the Glen Canyon National Recreation Area and Grand Canyon National Park, Arizona that were affected by the Glen Canyon dam. The Program achieves this by using science and a variety of stakeholder perspectives to inform decisions about dam operations. Since the Program started the ecosystem is now much better understood and several biological and physical improvements have been achieved. These improvements include: (i) an estimated 50% increase in the adult population of endangered humpback chub (Gila cypha) between 2001 and 2008, following previous decline; (ii) a 90% decrease in non-native rainbow trout (Oncorhynchus mykiss), which are known to compete with and prey on native fish, as a result of removal experiments; and (iii) the widespread reappearance of sandbars in response to an experimental high-flow release of dam water in March 2008.Although substantial progress has been made, the Program faces several immediate challenges. These include: (i) defining specific, measurable objectives and desired future conditions for important natural, cultural and recreational attributes to inform science and management decisions; (ii) implementing structural and operational changes to improve collaboration among stakeholders; (iii) establishing a long-term experimental programme and management plan; and (iv) securing long-term funding for monitoring programmes to assess ecosystem and other responses to management actions. Addressing these challenges and building on recent progress will require strong and consistent leadership from the US Department of the Interior
2008-01-01
Background Natural selection and genetic drift are major forces responsible for temporal genetic changes in populations. Furthermore, these evolutionary forces may interact with each other. Here we study the impact of an ongoing adaptive process at the molecular genetic level by analyzing the temporal genetic changes throughout 40 generations of adaptation to a common laboratory environment. Specifically, genetic variability, population differentiation and demographic structure were compared in two replicated groups of Drosophila subobscura populations recently sampled from different wild sources. Results We found evidence for a decline in genetic variability through time, along with an increase in genetic differentiation between all populations studied. The observed decline in genetic variability was higher during the first 14 generations of laboratory adaptation. The two groups of replicated populations showed overall similarity in variability patterns. Our results also revealed changing demographic structure of the populations during laboratory evolution, with lower effective population sizes in the early phase of the adaptive process. One of the ten microsatellites analyzed showed a clearly distinct temporal pattern of allele frequency change, suggesting the occurrence of positive selection affecting the region around that particular locus. Conclusion Genetic drift was responsible for most of the divergence and loss of variability between and within replicates, with most changes occurring during the first generations of laboratory adaptation. We also found evidence suggesting a selective sweep, despite the low number of molecular markers analyzed. Overall, there was a similarity of evolutionary dynamics at the molecular level in our laboratory populations, despite distinct genetic backgrounds and some differences in phenotypic evolution. PMID:18302790
The Neural Dynamics of Conflict Adaptation within a Look-to-Do Transition
Tang, Dandan; Hu, Li; Li, Hong; Zhang, Qinglin; Chen, Antao
2013-01-01
Background For optimal performance in conflict situations, conflict adaptation (conflict detection and adjustment) is necessary. However, the neural dynamics of conflict adaptation is still unclear. Methods In the present study, behavioral and electroencephalography (EEG) data were recorded from seventeen healthy participants during performance of a color-word Stroop task with a novel look-to-do transition. Within this transition, participants looked at the Stroop stimuli but no responses were required in the ‘look’ trials; or made manual responses to the Stroop stimuli in the ‘do’ trials. Results In the ‘look’ trials, the amplitude modulation of N450 occurred exclusively in the right-frontal region. Subsequently, the amplitude modulation of sustained potential (SP) emerged in the posterior parietal and right-frontal regions. A significantly positive correlation between the modulation of reconfiguration in the ‘look’ trials and the behavioral conflict adaptation in the ‘do’ trials was observed. Specially, a stronger information flow from right-frontal region to posterior parietal region in the beta band was observed for incongruent condition than for congruent condition. In the ‘do’ trials, the conflict of ‘look’ trials enhanced the amplitude modulations of N450 in the right-frontal and posterior parietal regions, but decreased the amplitude modulations of SP in these regions. Uniquely, a stronger information flow from centro-parietal region to right-frontal region in the theta band was observed for iI condition than for cI condition. Conclusion All these findings showed that top-down conflict adaptation is implemented by: (1) enhancing the sensitivity to conflict detection and the adaptation to conflict resolution; (2) modulating the effective connectivity between parietal region and right-frontal region. PMID:23469102
The Glen Canyon Dam Adaptive Management Program: An experiment in science-based resource management
NASA Astrophysics Data System (ADS)
kaplinski, m
2001-12-01
In 1996, Glen Canyon Dam Adaptive Management (GCDAMP) program was established to provide input on Glen Canyon Dam operations and their affect on the Colorado Ecosystem in Grand Canyon. The GCDAMP is a bold experiment in federal resource management that features a governing partnership with all relevant stakeholders sitting at the same table. It is a complicated, difficult process where stakeholder-derived management actions must balance resource protection with water and power delivery compacts, the Endangered Species Act, the National Historical Preservation Act, the Grand Canyon Protection Act, National Park Service Policy, and other stakeholder concerns. The program consists of four entities: the Adaptive Management Workgroup (AMWG), the Technical Workgroup (TWG), the Grand Canyon Monitoring and Research Center (GCMRC), and independent review panels. The AMWG and TWG are federal advisory committees that consists of federal and state resource managers, Native American tribes, power, environmental and recreation interests. The AMWG is develops, evaluates and recommends alternative dam operations to the Secretary. The TWG translates AMWG policy and goals into management objectives and information needs, provides questions that serve as the basis for long-term monitoring and research activities, interprets research results from the GCMRC, and prepares reports as required for the AMWG. The GCMRC is an independent science center that is responsible for all GCDAMP monitoring and research activities. The GCMRC utilizes proposal requests with external peer review and an in-house staff that directs and synthesizes monitoring and research results. The GCMRC meets regularly with the TWG and AMWG and provides scientific information on the consequences of GCDAMP actions. Independent review panels consist of external peer review panels that provide reviews of scientific activities and the program in general, technical advice to the GCMRC, TWG and AMWG, and play a critical
NASA Astrophysics Data System (ADS)
Zhao, Hui; Li, Lixiang; Peng, Haipeng; Kurths, Jürgen; Xiao, Jinghua; Yang, Yixian
2015-05-01
In this paper, exponential anti-synchronization in mean square of an uncertain memristor-based neural network is studied. The uncertain terms include non-modeled dynamics with boundary and stochastic perturbations. Based on the differential inclusions theory, linear matrix inequalities, Gronwall's inequality and adaptive control technique, an adaptive controller with update laws is developed to realize the exponential anti-synchronization. Adaptive controller can adjust itself behavior to get the best performance, according to the environment is changing or the environment has changed, which has the ability to adapt to environmental change. Furthermore, a numerical example is provided to validate the effectiveness of the proposed method.
Calculation of the exchange ratio for the Adaptive Maneuvering Logic program
NASA Technical Reports Server (NTRS)
Neuman, F.; Erzberger, H.
1985-01-01
Improvements were made to the Adaptive Maneuvering Logic (AML) computer program, a computer-generated, air-to-air combat opponent. The primary improvement was incorporating a measure of performance, the exchange ratio, defined as the statistical measure of number of enemy kills divided by number of friendly losses. This measure was used to test a new modification of the AML's combat tactics. When the new version of the AML competed against the old version, the new version won with an exchange ratio of 1.4.
Adaptation of an alcohol and HIV school-based prevention program for teens.
Chhabra, Rosy; Springer, Carolyn; Leu, Cheng-Shiun; Ghosh, Shivnath; Sharma, Sunil Kumar; Rapkin, Bruce
2010-08-01
Given the current status of HIV infection in youth in India, developing and implementing HIV education and prevention interventions is critical. The goal for School-based Teenage Education Program (STEP) was to demonstrate that a HIV/AIDS and alcohol abuse educational program built with specific cultural, linguistic, and community-specific characteristics could be effective. Utilizing the Train-the-Trainer model, the instructors (17-21 years) were trained to present the 10 session manualized program to primarily rural and tribal youth aged 13-16 years in 23 schools (N = 1,421) in the northern state of Himachal Pradesh in India. The intervention had a greater impact on girls; girls evidenced greater communication skills and a trend towards greater self efficacy and reduced risk taking behavior. The STEP has been successfully adapted by the community organizations that were involved in coordinating the program at the local level. Their intention to continue STEP beyond extra funding shows that utilizing the local community in designing, implementing and evaluating programs promotes ownership and sustainability.
Adaptation of an Alcohol and HIV School-Based Prevention Program for Teens
Springer, Carolyn; Leu, Cheng-Shiun; Ghosh, Shivnath; Sharma, Sunil Kumar; Rapkin, Bruce
2010-01-01
Given the current status of HIV infection in youth in India, developing and implementing HIV education and prevention interventions is critical. The goal for School-based Teenage Education Program (STEP) was to demonstrate that a HIV/AIDS and alcohol abuse educational program built with specific cultural, linguistic, and community-specific characteristics could be effective. Utilizing the Train-the-Trainer model, the instructors (17–21 years) were trained to present the 10 session manualized program to primarily rural and tribal youth aged 13–16 years in 23 schools (N = 1,421) in the northern state of Himachal Pradesh in India. The intervention had a greater impact on girls; girls evidenced greater communication skills and a trend towards greater self efficacy and reduced risk taking behavior. The STEP has been successfully adapted by the community organizations that were involved in coordinating the program at the local level. Their intention to continue STEP beyond extra funding shows that utilizing the local community in designing, implementing and evaluating programs promotes ownership and sustainability. PMID:20589528
NASA Astrophysics Data System (ADS)
Han, Xinli; Dong, Bing; Li, Yan; Wang, Rui; Hu, Bin
2016-10-01
For missiles and airplanes with high Mach number, traditional spherical or flat window can cause a lot of air drag. Conformal window that follow the general contour of surrounding surface can substantially decrease air drag and extend operational range. However, the local shape of conformal window changes across the Field Of Regard (FOR), leading to time-varying FOR-dependent wavefront aberration and degraded image. So the correction of dynamic aberration is necessary. In this paper, model-based Wavefront Sensorless Adaptive Optics (WSAO) algorithm is investigated both by simulation and experiment for central-obscured pupil. The algorithm is proved to be effective and the correction accuracy of using DM modes is higher than Lukosz modes. For dynamic aberration in our system, the SR can be better than 0.8 when the change of looking angle is less than 2° after t seconds which is the time delay of the control system.
Ma, Cheng; Xu, Xiao; Liu, Yan; Wang, Lihong V.
2014-01-01
The ability to steer and focus light inside scattering media has long been sought for a multitude of applications. To form optical foci inside scattering media, the only feasible strategy at present is to guide photons by using either implanted1 or virtual2–4 guide stars, which can be inconvenient and limits potential applications. Here, we report a scheme for focusing light inside scattering media by employing intrinsic dynamics as guide stars. By time-reversing the perturbed component of the scattered light adaptively, we show that it is possible to focus light to the origin of the perturbation. Using the approach, we demonstrate non-invasive dynamic light focusing onto moving targets and imaging of a time-variant object obscured by highly scattering media. Anticipated applications include imaging and photoablation of angiogenic vessels in tumours as well as other biomedical uses. PMID:25530797
Adaptive coded spreading OFDM signal for dynamic-λ optical access network
NASA Astrophysics Data System (ADS)
Liu, Bo; Zhang, Lijia; Xin, Xiangjun
2015-12-01
This paper proposes and experimentally demonstrates a novel adaptive coded spreading (ACS) orthogonal frequency division multiplexing (OFDM) signal for dynamic distributed optical ring-based access network. The wavelength can be assigned to different remote nodes (RNs) according to the traffic demand of optical network unit (ONU). The ACS can provide dynamic spreading gain to different signals according to the split ratio or transmission length, which offers flexible power budget for the network. A 10×13.12 Gb/s OFDM access with ACS is successfully demonstrated over two RNs and 120 km transmission in the experiment. The demonstrated method may be viewed as one promising for future optical metro access network.
Adaptive pulsed laser line extraction for terrain reconstruction using a dynamic vision sensor
Brandli, Christian; Mantel, Thomas A.; Hutter, Marco; Höpflinger, Markus A.; Berner, Raphael; Siegwart, Roland; Delbruck, Tobi
2014-01-01
Mobile robots need to know the terrain in which they are moving for path planning and obstacle avoidance. This paper proposes the combination of a bio-inspired, redundancy-suppressing dynamic vision sensor (DVS) with a pulsed line laser to allow fast terrain reconstruction. A stable laser stripe extraction is achieved by exploiting the sensor's ability to capture the temporal dynamics in a scene. An adaptive temporal filter for the sensor output allows a reliable reconstruction of 3D terrain surfaces. Laser stripe extractions up to pulsing frequencies of 500 Hz were achieved using a line laser of 3 mW at a distance of 45 cm using an event-based algorithm that exploits the sparseness of the sensor output. As a proof of concept, unstructured rapid prototype terrain samples have been successfully reconstructed with an accuracy of 2 mm. PMID:24478619
Adaptive pulsed laser line extraction for terrain reconstruction using a dynamic vision sensor.
Brandli, Christian; Mantel, Thomas A; Hutter, Marco; Höpflinger, Markus A; Berner, Raphael; Siegwart, Roland; Delbruck, Tobi
2013-01-01
Mobile robots need to know the terrain in which they are moving for path planning and obstacle avoidance. This paper proposes the combination of a bio-inspired, redundancy-suppressing dynamic vision sensor (DVS) with a pulsed line laser to allow fast terrain reconstruction. A stable laser stripe extraction is achieved by exploiting the sensor's ability to capture the temporal dynamics in a scene. An adaptive temporal filter for the sensor output allows a reliable reconstruction of 3D terrain surfaces. Laser stripe extractions up to pulsing frequencies of 500 Hz were achieved using a line laser of 3 mW at a distance of 45 cm using an event-based algorithm that exploits the sparseness of the sensor output. As a proof of concept, unstructured rapid prototype terrain samples have been successfully reconstructed with an accuracy of 2 mm.
An adaptive, self-organizing dynamical system for hierarchical control of bio-inspired locomotion.
Arena, Paolo; Fortuna, Luigi; Frasca, Mattia; Sicurella, Giovanni
2004-08-01
In this paper, dynamical systems made up of locally coupled nonlinear units are used to control the locomotion of bio-inspired robots and, in particular, a simulation of an insect-like hexapod robot. These controllers are inspired by the biological paradigm of central pattern generators and are responsible for generating a locomotion gait. A general structure, which is able to change the locomotion gait according to environmental conditions, is introduced. This structure is based on an adaptive system, implemented by motor maps, and is able to learn the correct locomotion gait on the basis of a reward function. The proposed control system is validated by a large number of simulations carried out in a dynamic environment for simulating legged robots.
NASA Astrophysics Data System (ADS)
Tang, Song; Ye, Mao; Zhu, Ce; Liu, Yiguang
2017-01-01
How to transfer the trained detector into the target scenarios has been an important topic for a long time in the field of computer vision. Unfortunately, most of the existing transfer methods need to keep source samples or label target samples in the detection phase. Therefore, they are difficult to apply to real applications. For this problem, we propose a framework that consists of a controlled convolutional neural network (CCNN) and a modulating neural network (MNN). In a CCNN, the parameters of the last layer, i.e., the classifier, are dynamically adjusted by a MNN. For each target sample, the CCNN adaptively generates a proprietary classifier. Our contributions include (1) the first detector-based unsupervised transfer method that is very suitable for real applications and (2) a new scheme of a dynamically adjusting classifier in which a new object function is invented. Experimental results confirm that our method can achieve state-of-the-art results on two pedestrian datasets.
Peng, Zhouhua; Wang, Dan; Zhang, Hongwei; Sun, Gang
2014-08-01
This paper addresses the leader-follower synchronization problem of uncertain dynamical multiagent systems with nonlinear dynamics. Distributed adaptive synchronization controllers are proposed based on the state information of neighboring agents. The control design is developed for both undirected and directed communication topologies without requiring the accurate model of each agent. This result is further extended to the output feedback case where a neighborhood observer is proposed based on relative output information of neighboring agents. Then, distributed observer-based synchronization controllers are derived and a parameter-dependent Riccati inequality is employed to prove the stability. This design has a favorable decouple property between the observer and the controller designs for nonlinear multiagent systems. For both cases, the developed controllers guarantee that the state of each agent synchronizes to that of the leader with bounded residual errors. Two illustrative examples validate the efficacy of the proposed methods.
NASA Astrophysics Data System (ADS)
Yao, Zhenjian; Wang, Zhongyu; Yi-Lin Forrest, Jeffrey; Wang, Qiyue; Lv, Jing
2017-04-01
In this paper, an approach combining empirical mode decomposition (EMD) with adaptive least squares (ALS) is proposed to improve the dynamic calibration accuracy of pressure sensors. With EMD, the original output of the sensor can be represented as sums of zero-mean amplitude modulation frequency modulation components. By identifying and excluding those components involved in noises, the noise-free output could be reconstructed with the useful frequency modulation ones. Then the least squares method is iteratively performed to estimate the optimal order and parameters of the mathematical model. The dynamic characteristic parameters of the sensor can be derived from the model in both time and frequency domains. A series of shock tube calibration tests are carried out to validate the performance of this method. Experimental results show that the proposed method works well in reducing the influence of noise and yields an appropriate mathematical model. Furthermore, comparative experiments also demonstrate the superiority of the proposed method over the existing ones.
Robust adaptive control of spacecraft proximity maneuvers under dynamic coupling and uncertainty
NASA Astrophysics Data System (ADS)
Sun, Liang; Huo, Wei
2015-11-01
This paper provides a solution for the position tracking and attitude synchronization problem of the close proximity phase in spacecraft rendezvous and docking. The chaser spacecraft must be driven to a certain fixed position along the docking port direction of the target spacecraft, while the attitude of the two spacecraft must be synchronized for subsequent docking operations. The kinematics and dynamics for relative position and relative attitude are modeled considering dynamic coupling, parametric uncertainties and external disturbances. The relative motion model has a new form with a novel definition of the unknown parameters. An original robust adaptive control method is developed for the concerned problem, and a proof of the asymptotic stability is given for the six degrees of freedom closed-loop system. A numerical example is displayed in simulation to verify the theoretical results.
Montgomery, Rebecca A; Givnish, Thomas J
2008-03-01
Hawaiian lobeliads have radiated into habitats from open alpine bogs to densely shaded rainforest interiors, and show corresponding adaptations in steady-state photosynthetic light responses and associated leaf traits. Shaded environments are not uniformly dark, however, but punctuated by sunflecks that carry most of the photosynthetically active light that strikes plants. We asked whether lobeliads have diversified in their dynamic photosynthetic light responses and how dynamic responses influence daily leaf carbon gain. We quantified gas exchange and dynamic light regimes under field conditions for ten species representing each major Hawaiian sublineage. Species in shadier habitats experienced shorter and less numerous sunflecks: average sunfleck length varied from 1.4 +/- 1.7 min for Cyanea floribunda in shaded forest understories to 31.2 +/- 2.1 min for Trematolobelia kauaiensis on open ridges. As expected, the rate of photosynthetic induction increased significantly toward shadier sites, with assimilation after 60 s rising from ca. 30% of fully induced rates in species from open environments to 60% in those from densely shaded habitats. Uninduced light use efficiency-actual photosynthesis versus that expected under steady-state conditions-increased from 10 to 70% across the same gradient. In silico transplants-modeling daily carbon gain using one species' photosynthetic light response in its own and other species' dynamic light regimes-demonstrated the potential adaptive nature of species differences: understory Cyanea pilosa in its light regimes outperformed gap-dwelling Clermontia parviflora, while Clermontia in its light regimes outperformed Cyanea. The apparent crossover in daily photosynthesis occurred at about the same photon flux density where dominance shifts from Cyanea to Clermontia in the field. Our results further support our hypothesis that the lobeliads have diversified physiologically across light environments in Hawaiian ecosystems and that
Evaluation of Electric Power Procurement Strategies by Stochastic Dynamic Programming
NASA Astrophysics Data System (ADS)
Saisho, Yuichi; Hayashi, Taketo; Fujii, Yasumasa; Yamaji, Kenji
In deregulated electricity markets, the role of a distribution company is to purchase electricity from the wholesale electricity market at randomly fluctuating prices and to provide it to its customers at a given fixed price. Therefore the company has to take risk stemming from the uncertainties of electricity prices and/or demand fluctuation instead of the customers. The way to avoid the risk is to make a bilateral contact with generating companies or install its own power generation facility. This entails the necessity to develop a certain method to make an optimal strategy for electric power procurement. In such a circumstance, this research has the purpose for proposing a mathematical method based on stochastic dynamic programming and additionally considering the characteristics of the start-up cost of electric power generation facility to evaluate strategies of combination of the bilateral contract and power auto-generation with its own facility for procuring electric power in deregulated electricity market. In the beginning we proposed two approaches to solve the stochastic dynamic programming, and they are a Monte Carlo simulation method and a finite difference method to derive the solution of a partial differential equation of the total procurement cost of electric power. Finally we discussed the influences of the price uncertainty on optimal strategies of power procurement.
NASA Technical Reports Server (NTRS)
Carey, L. D.; Petersen, W. A.; Deierling, W.; Roeder, W. P.
2009-01-01
A new weather radar is being acquired for use in support of America s space program at Cape Canaveral Air Force Station, NASA Kennedy Space Center, and Patrick AFB on the east coast of central Florida. This new radar replaces the modified WSR-74C at Patrick AFB that has been in use since 1984. The new radar is a Radtec TDR 43-250, which has Doppler and dual polarization capability. A new fixed scan strategy was designed to best support the space program. The fixed scan strategy represents a complex compromise between many competing factors and relies on climatological heights of various temperatures that are important for improved lightning forecasting and evaluation of Lightning Launch Commit Criteria (LCC), which are the weather rules to avoid lightning strikes to in-flight rockets. The 0 C to -20 C layer is vital since most generation of electric charge occurs within it and so it is critical in evaluating Lightning LCC and in forecasting lightning. These are two of the most important duties of 45 WS. While the fixed scan strategy that covers most of the climatological variation of the 0 C to -20 C levels with high resolution ensures that these critical temperatures are well covered most of the time, it also means that on any particular day the radar is spending precious time scanning at angles covering less important heights. The goal of this project is to develop a user-friendly, Interactive Data Language (IDL) computer program that will automatically generate optimized radar scan strategies that adapt to user input of the temperature profile and other important parameters. By using only the required scan angles output by the temperature profile adaptive scan strategy program, faster update times for volume scans and/or collection of more samples per gate for better data quality is possible, while maintaining high resolution at the critical temperature levels. The temperature profile adaptive technique will also take into account earth curvature and refraction
Digital computer program for generating dynamic turbofan engine models (DIGTEM)
NASA Technical Reports Server (NTRS)
Daniele, C. J.; Krosel, S. M.; Szuch, J. R.; Westerkamp, E. J.
1983-01-01
This report describes DIGTEM, a digital computer program that simulates two spool, two-stream turbofan engines. The turbofan engine model in DIGTEM contains steady-state performance maps for all of the components and has control volumes where continuity and energy balances are maintained. Rotor dynamics and duct momentum dynamics are also included. Altogether there are 16 state variables and state equations. DIGTEM features a backward-differnce integration scheme for integrating stiff systems. It trims the model equations to match a prescribed design point by calculating correction coefficients that balance out the dynamic equations. It uses the same coefficients at off-design points and iterates to a balanced engine condition. Transients can also be run. They are generated by defining controls as a function of time (open-loop control) in a user-written subroutine (TMRSP). DIGTEM has run on the IBM 370/3033 computer using implicit integration with time steps ranging from 1.0 msec to 1.0 sec. DIGTEM is generalized in the aerothermodynamic treatment of components.
Dynamic Analysis of a Helicopter Rotor by Dymore Program
NASA Astrophysics Data System (ADS)
Doğan, Vedat; Kırca, Mesut
The dynamic behavior of hingeless and bearingless blades of a light commercial helicopter which has been under design process at ITU (İstanbul Technical University, Rotorcraft Research and Development Centre) is investigated. Since the helicopter rotor consists of several parts connected to each other by joints and hinges; rotors in general can be considered as an assembly of the rigid and elastic parts. Dynamics of rotor system in rotation is complicated due to coupling of elastic forces (bending, torsion and tension), inertial forces, control and aerodynamic forces on the rotor blades. In this study, the dynamic behavior of the rotor for a real helicopter design project is analyzed by using DYMORE. Blades are modeled as elastic beams, hub as a rigid body, torque tubes as rigid bodies, control links as rigid bodies plus springs and several joints. Geometric and material cross-sectional properties of blades (Stiffness-Matrix and Mass-Matrix) are calculated by using VABS programs on a CATIA model. Natural frequencies and natural modes of the rotating (and non-rotating) blades are obtained by using DYMORE. Fan-Plots which show the variation of the natural frequencies for different modes (Lead-Lag, Flapping, Feathering, etc.) vs. rotor RPM are presented.
NASA Astrophysics Data System (ADS)
Zhong, X.; Ichchou, M.; Gillot, F.; Saidi, A.
2010-04-01
The inherent uncertainties of vehicle suspension systems challenge not only the capability of ride comfort and handling performance, but also the reliability requirement. In this research, a dynamic-reliable multiple model adaptive (MMA) controller is developed to overcome the difficulty of suspension uncertainties while considering performance and reliability at the same time. The MMA system consists of a finite number of optimal sub-controllers and employs a continuous-time based Markov chain to guide the jumping among the sub-controllers. The failure mode considered is the bottoming and topping of suspension components. A limitation on the failure probability is imposed to penalize the performance of the sub-controllers and a gradient-based genetic algorithm yields their optimal feedback gains. Finally, the dynamic reliability of the MMA controller is approximated by using the integration of state covariances and a judging condition is induced to assert that the MMA system is dynamic-reliable. In numerical simulation, a long scheme with piecewise time-invariant parameters is employed to examine the performance and reliability under the uncertainties of sprung mass, road condition and driving velocity. It is shown that the dynamic-reliable MMA controller is able to trade a small amount of model performance for extra reliability.
Tu, Jia-Ying; Hsiao, Wei-De; Chen, Chih-Ying
2014-01-01
Testing techniques of dynamically substructured systems dissects an entire engineering system into parts. Components can be tested via numerical simulation or physical experiments and run synchronously. Additional actuator systems, which interface numerical and physical parts, are required within the physical substructure. A high-quality controller, which is designed to cancel unwanted dynamics introduced by the actuators, is important in order to synchronize the numerical and physical outputs and ensure successful tests. An adaptive forward prediction (AFP) algorithm based on delay compensation concepts has been proposed to deal with substructuring control issues. Although the settling performance and numerical conditions of the AFP controller are improved using new direct-compensation and singular value decomposition methods, the experimental results show that a linear dynamics-based controller still outperforms the AFP controller. Based on experimental observations, the least-squares fitting technique, effectiveness of the AFP compensation and differences between delay and ordinary differential equations are discussed herein, in order to reflect the fundamental issues of actuator modelling in relevant literature and, more specifically, to show that the actuator and numerical substructure are heterogeneous dynamic components and should not be collectively modelled as a homogeneous delay differential equation. PMID:25104902
Tu, Jia-Ying; Hsiao, Wei-De; Chen, Chih-Ying
2014-08-08
Testing techniques of dynamically substructured systems dissects an entire engineering system into parts. Components can be tested via numerical simulation or physical experiments and run synchronously. Additional actuator systems, which interface numerical and physical parts, are required within the physical substructure. A high-quality controller, which is designed to cancel unwanted dynamics introduced by the actuators, is important in order to synchronize the numerical and physical outputs and ensure successful tests. An adaptive forward prediction (AFP) algorithm based on delay compensation concepts has been proposed to deal with substructuring control issues. Although the settling performance and numerical conditions of the AFP controller are improved using new direct-compensation and singular value decomposition methods, the experimental results show that a linear dynamics-based controller still outperforms the AFP controller. Based on experimental observations, the least-squares fitting technique, effectiveness of the AFP compensation and differences between delay and ordinary differential equations are discussed herein, in order to reflect the fundamental issues of actuator modelling in relevant literature and, more specifically, to show that the actuator and numerical substructure are heterogeneous dynamic components and should not be collectively modelled as a homogeneous delay differential equation.
NASA Technical Reports Server (NTRS)
Nguyen, Nhan
2013-01-01
This paper presents the optimal control modification for linear uncertain plants. The Lyapunov analysis shows that the modification parameter has a limiting value depending on the nature of the uncertainty. The optimal control modification exhibits a linear asymptotic property that enables it to be analyzed in a linear time invariant framework for linear uncertain plants. The linear asymptotic property shows that the closed-loop plants in the limit possess a scaled input-output mapping. Using this property, we can derive an analytical closed-loop transfer function in the limit as the adaptive gain tends to infinity. The paper revisits the Rohrs counterexample problem that illustrates the nature of non-robustness of model-reference adaptive control in the presence of unmodeled dynamics. An analytical approach is developed to compute exactly the modification parameter for the optimal control modification that stabilizes the plant in the Rohrs counterexample. The linear asymptotic property is also used to address output feedback adaptive control for non-minimum phase plants with a relative degree 1.
NASA Technical Reports Server (NTRS)
Tesar, Delbert; Tosunoglu, Sabri; Lin, Shyng-Her
1990-01-01
Research results on general serial robotic manipulators modeled with structural compliances are presented. Two compliant manipulator modeling approaches, distributed and lumped parameter models, are used in this study. System dynamic equations for both compliant models are derived by using the first and second order influence coefficients. Also, the properties of compliant manipulator system dynamics are investigated. One of the properties, which is defined as inaccessibility of vibratory modes, is shown to display a distinct character associated with compliant manipulators. This property indicates the impact of robot geometry on the control of structural oscillations. Example studies are provided to illustrate the physical interpretation of inaccessibility of vibratory modes. Two types of controllers are designed for compliant manipulators modeled by either lumped or distributed parameter techniques. In order to maintain the generality of the results, neither linearization is introduced. Example simulations are given to demonstrate the controller performance. The second type controller is also built for general serial robot arms and is adaptive in nature which can estimate uncertain payload parameters on-line and simultaneously maintain trajectory tracking properties. The relation between manipulator motion tracking capability and convergence of parameter estimation properties is discussed through example case studies. The effect of control input update delays on adaptive controller performance is also studied.
Exploiting the Adaptation Dynamics to Predict the Distribution of Beneficial Fitness Effects.
John, Sona; Seetharaman, Sarada
2016-01-01
Adaptation of asexual populations is driven by beneficial mutations and therefore the dynamics of this process, besides other factors, depends on the distribution of beneficial fitness effects. It is known that on uncorrelated fitness landscapes, this distribution can only be of three types: truncated, exponential and power law. We performed extensive stochastic simulations to study the adaptation dynamics on rugged fitness landscapes, and identified two quantities that can be used to distinguish the underlying distribution of beneficial fitness effects. The first quantity studied here is the fitness difference between successive mutations that spread in the population, which is found to decrease in the case of truncated distributions, remains nearly a constant for exponentially decaying distributions and increases when the fitness distribution decays as a power law. The second quantity of interest, namely, the rate of change of fitness with time also shows quantitatively different behaviour for different beneficial fitness distributions. The patterns displayed by the two aforementioned quantities are found to hold good for both low and high mutation rates. We discuss how these patterns can be exploited to determine the distribution of beneficial fitness effects in microbial experiments.
Khezri, Mahdi; Firoozabadi, Mohammad; Sharafat, Ahmad Reza
2015-11-01
In this study, we proposed a new adaptive method for fusing multiple emotional modalities to improve the performance of the emotion recognition system. Three-channel forehead biosignals along with peripheral physiological measurements (blood volume pressure, skin conductance, and interbeat intervals) were utilized as emotional modalities. Six basic emotions, i.e., anger, sadness, fear, disgust, happiness, and surprise were elicited by displaying preselected video clips for each of the 25 participants in the experiment; the physiological signals were collected simultaneously. In our multimodal emotion recognition system, recorded signals with the formation of several classification units identified the emotions independently. Then the results were fused using the adaptive weighted linear model to produce the final result. Each classification unit is assigned a weight that is determined dynamically by considering the performance of the units during the testing phase and the training phase results. This dynamic weighting scheme enables the emotion recognition system to adapt itself to each new user. The results showed that the suggested method outperformed conventional fusion of the features and classification units using the majority voting method. In addition, a considerable improvement, compared to the systems that used the static weighting schemes for fusing classification units, was also shown. Using support vector machine (SVM) and k-nearest neighbors (KNN) classifiers, the overall classification accuracies of 84.7% and 80% were obtained in identifying the emotions, respectively. In addition, applying the forehead or physiological signals in the proposed scheme indicates that designing a reliable emotion recognition system is feasible without the need for additional emotional modalities.
Learning from adaptive neural dynamic surface control of strict-feedback systems.
Wang, Min; Wang, Cong
2015-06-01
Learning plays an essential role in autonomous control systems. However, how to achieve learning in the nonstationary environment for nonlinear systems is a challenging problem. In this paper, we present learning method for a class of n th-order strict-feedback systems by adaptive dynamic surface control (DSC) technology, which achieves the human-like ability of learning by doing and doing with learned knowledge. To achieve the learning, this paper first proposes stable adaptive DSC with auxiliary first-order filters, which ensures the boundedness of all the signals in the closed-loop system and the convergence of tracking errors in a finite time. With the help of DSC, the derivative of the filter output variable is used as the neural network (NN) input instead of traditional intermediate variables. As a result, the proposed adaptive DSC method reduces greatly the dimension of NN inputs, especially for high-order systems. After the stable DSC design, we decompose the stable closed-loop system into a series of linear time-varying perturbed subsystems. Using a recursive design, the recurrent property of NN input variables is easily verified since the complexity is overcome using DSC. Subsequently, the partial persistent excitation condition of the radial basis function NN is satisfied. By combining a state transformation, accurate approximations of the closed-loop system dynamics are recursively achieved in a local region along recurrent orbits. Then, the learning control method using the learned knowledge is proposed to achieve the closed-loop stability and the improved control performance. Simulation studies are performed to demonstrate the proposed scheme can not only reuse the learned knowledge to achieve the better control performance with the faster tracking convergence rate and the smaller tracking error but also greatly alleviate the computational burden because of reducing the number and complexity of NN input variables.
Federal Register 2010, 2011, 2012, 2013, 2014
2012-03-30
... Dynamic Mobility Applications and Data Capture Management Programs; Notice of Public Meeting AGENCY: ITS... Data Capture and Management (DCM) and Dynamic Mobility Applications (DMA) programs in the Washington DC... to garner stakeholder feedback. About the Dynamic Mobility Application and Data Capture...
Going with the wind--adaptive dynamics of plant secondary meristems.
Agusti, Javier; Greb, Thomas
2013-01-01
The developmental plasticity of organisms is a natural consequence of adaptation. Classical approaches targeting developmental processes usually focus on genetics as the essential factor underlying phenotypic differences. However, such differences are often based on the inherent plasticity of developmental programs. Due to their dependence on environmental stimuli, plants represent ideal experimental systems in which to dissect the contribution of genetic and environmental variation to phenotypic plasticity. An evident example is the vast repertoire of growth forms observed in plant shoot systems. A fundamental factor underlying the broadness of this repertoire is the activity of secondary meristems, namely the axillary meristems that give rise to side shoots, and the cambium essential for stem thickening. Differential activities of both meristem types are crucial to the tremendous variation seen in higher plant architecture. In this review, we discuss the role of secondary meristems in the adaptation of plant growth forms, and the ways in which they integrate environmental input. In particular, we explore potential approaches for dissecting the degree to which this flexibility and its consequences for plant architecture is genetically predetermined and how much it represents an adaptive value.
ERIC Educational Resources Information Center
Willis, Mike
2004-01-01
Many universities now deliver courses and programs in overseas markets such as China. Often these programs are delivered by foreign academics who teach in these overseas locations. This style and format of educational delivery raises the issue of the degree to which subject material and teaching styles need to be adapted to meet the needs of…
ERIC Educational Resources Information Center
Carvajal-Rodriguez, Antonio
2012-01-01
Mutate is a program developed for teaching purposes to impart a virtual laboratory class for undergraduate students of Genetics in Biology. The program emulates the so-called fluctuation test whose aim is to distinguish between spontaneous and adaptive mutation hypotheses in bacteria. The plan is to train students in certain key multidisciplinary…
ERIC Educational Resources Information Center
Kumpfer, Karol L.; Xie, Jing; O'Driscoll, Robert
2012-01-01
Background: Evidence-based programs (EBPs) targeting effective family skills are the most cost effective for improving adolescent behavioural health. Cochrane Reviews have found the "Strengthening Families Program" (SFP) to be the most effective substance abuse prevention intervention. Standardized cultural adaptation processes resulted…
ERIC Educational Resources Information Center
Iowa State Dept. of Natural Resources, Des Moines.
This document summarizes materials on aquatic education used by state programs. Emphasis is on materials developed by, or adapted for use with, programs in various states and territories. The 234 entries are categorized as activity books, brochures, newsletters, posters, videos, and other materials. Major subjects include fishing, boating and…
Kersting, Anna R.; Bornberg-Bauer, Erich; Moore, Andrew D.; Grath, Sonja
2012-01-01
Plant genomes are generally very large, mostly paleopolyploid, and have numerous gene duplicates and complex genomic features such as repeats and transposable elements. Many of these features have been hypothesized to enable plants, which cannot easily escape environmental challenges, to rapidly adapt. Another mechanism, which has recently been well described as a major facilitator of rapid adaptation in bacteria, animals, and fungi but not yet for plants, is modular rearrangement of protein-coding genes. Due to the high precision of profile-based methods, rearrangements can be well captured at the protein level by characterizing the emergence, loss, and rearrangements of protein domains, their structural, functional, and evolutionary building blocks. Here, we study the dynamics of domain rearrangements and explore their adaptive benefit in 27 plant and 3 algal genomes. We use a phylogenomic approach by which we can explain the formation of 88% of all arrangements by single-step events, such as fusion, fission, and terminal loss of domains. We find many domains are lost along every lineage, but at least 500 domains are novel, that is, they are unique to green plants and emerged more or less recently. These novel domains duplicate and rearrange more readily within their genomes than ancient domains and are overproportionally involved in stress response and developmental innovations. Novel domains more often affect regulatory proteins and show a higher degree of structural disorder than ancient domains. Whereas a relatively large and well-conserved core set of single-domain proteins exists, long multi-domain arrangements tend to be species-specific. We find that duplicated genes are more often involved in rearrangements. Although fission events typically impact metabolic proteins, fusion events often create new signaling proteins essential for environmental sensing. Taken together, the high volatility of single domains and complex arrangements in plant genomes
Adaptive management of large aquatic ecosystem recovery programs in the United States.
Thom, Ronald; St Clair, Tom; Burns, Rebecca; Anderson, Michael
2016-12-01
Adaptive management (AM) is being employed in a number of programs in the United States to guide actions to restore aquatic ecosystems because these programs are both expensive and are faced with significant uncertainties. Many of these uncertainties are associated with prioritizing when, where, and what kind of actions are needed to meet the objectives of enhancing ecosystem services and recovering threatened and endangered species. We interviewed nine large-scale aquatic ecosystem restoration programs across the United States to document the lessons learned from implementing AM. In addition, we recorded information on ecological drivers (e.g., endangered fish species) for the program, and inferred how these drivers reflected more generic ecosystem services. Ecosystem services (e.g., genetic diversity, cultural heritage), albeit not explicit drivers, were either important to the recovery or enhancement of the drivers, or were additional benefits associated with actions to recover or enhance the program drivers. Implementing programs using AM lessons learned has apparently helped achieve better results regarding enhancing ecosystem services and restoring target species populations. The interviews yielded several recommendations. The science and AM program must be integrated into how the overall restoration program operates in order to gain understanding and support, and effectively inform management decision-making. Governance and decision-making varied based on its particular circumstances. Open communication within and among agency and stakeholder groups and extensive vetting lead up to decisions. It was important to have an internal agency staff member to implement the AM plan, and a clear designation of roles and responsibilities, and long-term commitment of other involved parties. The most important management questions and information needs must be identified up front. It was imperative to clearly identify, link and continually reinforce the essential
NASA Astrophysics Data System (ADS)
Patriarca, M.; Kuronen, A.; Robles, M.; Kaski, K.
2007-01-01
The study of crystal defects and the complex processes underlying their formation and time evolution has motivated the development of the program ALINE for interactive molecular dynamics experiments. This program couples a molecular dynamics code to a Graphical User Interface and runs on a UNIX-X11 Window System platform with the MOTIF library, which is contained in many standard Linux releases. ALINE is written in C, thus giving the user the possibility to modify the source code, and, at the same time, provides an effective and user-friendly framework for numerical experiments, in which the main parameters can be interactively varied and the system visualized in various ways. We illustrate the main features of the program through some examples of detection and dynamical tracking of point-defects, linear defects, and planar defects, such as stacking faults in lattice-mismatched heterostructures. Program summaryTitle of program:ALINE Catalogue identifier:ADYJ_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADYJ_v1_0 Program obtainable from: CPC Program Library, Queen University of Belfast, N. Ireland Computer for which the program is designed and others on which it has been tested: Computers:DEC ALPHA 300, Intel i386 compatible computers, G4 Apple Computers Installations:Laboratory of Computational Engineering, Helsinki University of Technology, Helsinki, Finland Operating systems under which the program has been tested:True64 UNIX, Linux-i386, Mac OS X 10.3 and 10.4 Programming language used:Standard C and MOTIF libraries Memory required to execute with typical data:6 Mbytes but may be larger depending on the system size No. of lines in distributed program, including test data, etc.:16 901 No. of bytes in distributed program, including test data, etc.:449 559 Distribution format:tar.gz Nature of physical problem:Some phenomena involving defects take place inside three-dimensional crystals at times which can be hardly predicted. For this reason they are
The puzzle of partial migration: Adaptive dynamics and evolutionary game theory perspectives.
De Leenheer, Patrick; Mohapatra, Anushaya; Ohms, Haley A; Lytle, David A; Cushing, J M
2017-01-07
We consider the phenomenon of partial migration which is exhibited by populations in which some individuals migrate between habitats during their lifetime, but others do not. First, using an adaptive dynamics approach, we show that partial migration can be explained on the basis of negative density dependence in the per capita fertilities alone, provided that this density dependence is attenuated for increasing abundances of the subtypes that make up the population. We present an exact formula for the optimal proportion of migrants which is expressed in terms of the vital rates of migrant and non-migrant subtypes only. We show that this allocation strategy is both an evolutionary stable strategy (ESS) as well as a convergence stable strategy (CSS). To establish the former, we generalize the classical notion of an ESS because it is based on invasion exponents obtained from linearization arguments, which fail to capture the stabilizing effects of the nonlinear density dependence. These results clarify precisely when the notion of a "weak ESS", as proposed in Lundberg (2013) for a related model, is a genuine ESS. Secondly, we use an evolutionary game theory approach, and confirm, once again, that partial migration can be attributed to negative density dependence alone. In this context, the result holds even when density dependence is not attenuated. In this case, the optimal allocation strategy towards migrants is the same as the ESS stemming from the analysis based on the adaptive dynamics. The key feature of the population models considered here is that they are monotone dynamical systems, which enables a rather comprehensive mathematical analysis.
Adaptive accelerated ReaxFF reactive dynamics with validation from simulating hydrogen combustion.
Cheng, Tao; Jaramillo-Botero, Andrés; Goddard, William A; Sun, Huai
2014-07-02
We develop here the methodology for dramatically accelerating the ReaxFF reactive force field based reactive molecular dynamics (RMD) simulations through use of the bond boost concept (BB), which we validate here for describing hydrogen combustion. The bond order, undercoordination, and overcoordination concepts of ReaxFF ensure that the BB correctly adapts to the instantaneous configurations in the reactive system to automatically identify the reactions appropriate to receive the bond boost. We refer to this as adaptive Accelerated ReaxFF Reactive Dynamics or aARRDyn. To validate the aARRDyn methodology, we determined the detailed sequence of reactions for hydrogen combustion with and without the BB. We validate that the kinetics and reaction mechanisms (that is the detailed sequences of reactive intermediates and their subsequent transformation to others) for H2 oxidation obtained from aARRDyn agrees well with the brute force reactive molecular dynamics (BF-RMD) at 2498 K. Using aARRDyn, we then extend our simulations to the whole range of combustion temperatures from ignition (798 K) to flame temperature (2998K), and demonstrate that, over this full temperature range, the reaction rates predicted by aARRDyn agree well with the BF-RMD values, extrapolated to lower temperatures. For the aARRDyn simulation at 798 K we find that the time period for half the H2 to form H2O product is ∼538 s, whereas the computational cost was just 1289 ps, a speed increase of ∼0.42 trillion (10(12)) over BF-RMD. In carrying out these RMD simulations we found that the ReaxFF-COH2008 version of the ReaxFF force field was not accurate for such intermediates as H3O. Consequently we reoptimized the fit to a quantum mechanics (QM) level, leading to the ReaxFF-OH2014 force field that was used in the simulations.
NASA Astrophysics Data System (ADS)
Sakata, Ren; Tomioka, Tazuko; Kobayashi, Takahiro
When a cognitive radio system dynamically utilizes a frequency band, channel control information must be communicated over the network in order for the currently available carrier frequencies to be shared. In order to keep efficient spectrum utilization, this control information should also be dynamically transmitted through channels such as cognitive pilot channels based on the channel conditions. If transmitters dynamically select carrier frequencies, receivers must receive the control signal without knowledge of its carrier frequencies. A novel scheme called differential code parallel transmission (DCPT) enables receivers to receive low-rate information without any knowledge of the carrier frequency. The transmitter simultaneously transmits two signals whose carrier frequencies are separated by a predefined value. The absolute values of the carrier frequencies can be varied. When the receiver receives the DCPT signal, it multiplies the signal by a frequency-shifted version of itself; this yields a DC component that represents the data signal, which is then demodulated. However, the multiplication process results in the noise power being squared, necessitating high received signal power. In this paper, to realize a bandpass filter that passes only DCPT signals of unknown frequency and that suppresses noise and interference at other frequencies, a DCPT-adaptive bandpass filter (ABF) that employs an adaptive equalizer is proposed. In the training phase, the received signal is the filter input and the frequency-shifted signal is the training input. Then, the filter is trained to pass the higher-frequency signal of the two DCPT signals. The performance of DCPT-ABF is evaluated through computer simulations. We find that DCPT-ABF operates successfully even under strong interference.
Kusev, Petko; van Schaik, Paul; Tsaneva-Atanasova, Krasimira; Juliusson, Asgeir; Chater, Nick
2017-04-06
When attempting to predict future events, people commonly rely on historical data. One psychological characteristic of judgmental forecasting of time series, established by research, is that when people make forecasts from series, they tend to underestimate future values for upward trends and overestimate them for downward ones, so-called trend-damping (modeled by anchoring on, and insufficient adjustment from, the average of recent time series values). Events in a time series can be experienced sequentially (dynamic mode), or they can also be retrospectively viewed simultaneously (static mode), not experienced individually in real time. In one experiment, we studied the influence of presentation mode (dynamic and static) on two sorts of judgment: (a) predictions of the next event (forecast) and (b) estimation of the average value of all the events in the presented series (average estimation). Participants' responses in dynamic mode were anchored on more recent events than in static mode for all types of judgment but with different consequences; hence, dynamic presentation improved prediction accuracy, but not estimation. These results are not anticipated by existing theoretical accounts; we develop and present an agent-based model-the adaptive anchoring model (ADAM)-to account for the difference between processing sequences of dynamically and statically presented stimuli (visually presented data). ADAM captures how variation in presentation mode produces variation in responses (and the accuracy of these responses) in both forecasting and judgment tasks. ADAM's model predictions for the forecasting and judgment tasks fit better with the response data than a linear-regression time series model. Moreover, ADAM outperformed autoregressive-integrated-moving-average (ARIMA) and exponential-smoothing models, while neither of these models accounts for people's responses on the average estimation task.
Satellite-tracking and Earth dynamics research programs
NASA Technical Reports Server (NTRS)
1983-01-01
The Arequipa station obtained a total of 31,989 quick-look range observations on 719 passes in the six months. Data were acquired from Metsahovi, San Fernando, Kootwijk, Wettzell, Grasse, Simosato, Graz, Dodaira and Herstmonceux. Work progressed on the setup of SAO 1. Discussions were also initiated with the Israelis on the relocation of SAO-3 to a site in southern Israel in FY-1984. Arequipa and the cooperating stations continued to track LAGEOS at highest priority for polar motion and Earth rotation studies, and for other geophysical investigations, including crustal dynamics, earth and ocean tides, and the general development of precision orbit determination. SAO completed the revisions to its field software as a part of its recent upgrading program. With cesium standards Omega receivers, and other timekeeping aids, the station was able to maintain a timing accuracy of better than plus or minus 6 to 8 microseconds.
Dynamic programming on a shared-memory multiprocessor
NASA Technical Reports Server (NTRS)
Edmonds, Phil; Chu, Eleanor; George, Alan
1993-01-01
Three new algorithms for solving dynamic programming problems on a shared-memory parallel computer are described. All three algorithms attempt to balance work load, while keeping synchronization cost low. In particular, for a multiprocessor having p processors, an analysis of the best algorithm shows that the arithmetic cost is O(n-cubed/6p) and that the synchronization cost is O(absolute value of log sub C n) if p much less than n, where C = (2p-1)/(2p + 1) and n is the size of the problem. The low synchronization cost is important for machines where synchronization is expensive. Analysis and experiments show that the best algorithm is effective in balancing the work load and producing high efficiency.
Survey of Dynamic Simulation Programs for Nuclear Fuel Reprocessing
Troy J. Tranter; Daryl R. Haefner
2008-06-01
The absence of any industrial scale nuclear fuel reprocessing in the U.S. has precluded the necessary driver for developing the advanced simulation capability now prevalent in so many other industries. Modeling programs to simulate the dynamic behavior of nuclear fuel separations and processing were originally developed to support the US government’s mission of weapons production and defense fuel recovery. Consequently there has been little effort is the US devoted towards improving this specific process simulation capability during the last two or three decades. More recent work has been focused on elucidating chemical thermodynamics and developing better models of predicting equilibrium in actinide solvent extraction systems. These equilibrium models have been used to augment flowsheet development and testing primarily at laboratory scales. The development of more robust and complete process models has not kept pace with the vast improvements in computational power and user interface and is significantly behind simulation capability in other chemical processing and separation fields.
Programming microbial population dynamics by engineered cell-cell communication.
Song, Hao; Payne, Stephen; Tan, Cheemeng; You, Lingchong
2011-07-01
A major aim of synthetic biology is to program novel cellular behavior using engineered gene circuits. Early endeavors focused on building simple circuits that fulfill simple functions, such as logic gates, bistable toggle switches, and oscillators. These gene circuits have primarily focused on single-cell behaviors since they operate intracellularly. Thus, they are often susceptible to cell-cell variations due to stochastic gene expression. Cell-cell communication offers an efficient strategy to coordinate cellular behavior at the population level. To this end, we review recent advances in engineering cell-cell communication to achieve reliable population dynamics, spanning from communication within single species to multispecies, from one-way sender-receiver communication to two-way communication in synthetic microbial ecosystems. These engineered systems serve as well-defined model systems to better understand design principles of their naturally occurring counterparts and to facilitate novel biotechnology applications.
Estimating Arrhenius parameters using temperature programmed molecular dynamics
NASA Astrophysics Data System (ADS)
Imandi, Venkataramana; Chatterjee, Abhijit
2016-07-01
Kinetic rates at different temperatures and the associated Arrhenius parameters, whenever Arrhenius law is obeyed, are efficiently estimated by applying maximum likelihood analysis to waiting times collected using the temperature programmed molecular dynamics method. When transitions involving many activated pathways are available in the dataset, their rates may be calculated using the same collection of waiting times. Arrhenius behaviour is ascertained by comparing rates at the sampled temperatures with ones from the Arrhenius expression. Three prototype systems with corrugated energy landscapes, namely, solvated alanine dipeptide, diffusion at the metal-solvent interphase, and lithium diffusion in silicon, are studied to highlight various aspects of the method. The method becomes particularly appealing when the Arrhenius parameters can be used to find rates at low temperatures where transitions are rare. Systematic coarse-graining of states can further extend the time scales accessible to the method. Good estimates for the rate parameters are obtained with 500-1000 waiting times.
Automatic Dynamic Aircraft Modeler (ADAM) for the Computer Program NASTRAN
NASA Technical Reports Server (NTRS)
Griffis, H.
1985-01-01
Large general purpose finite element programs require users to develop large quantities of input data. General purpose pre-processors are used to decrease the effort required to develop structural models. Further reduction of effort can be achieved by specific application pre-processors. Automatic Dynamic Aircraft Modeler (ADAM) is one such application specific pre-processor. General purpose pre-processors use points, lines and surfaces to describe geometric shapes. Specifying that ADAM is used only for aircraft structures allows generic structural sections, wing boxes and bodies, to be pre-defined. Hence with only gross dimensions, thicknesses, material properties and pre-defined boundary conditions a complete model of an aircraft can be created.
Chimeric alignment by dynamic programming: Algorithm and biological uses
Komatsoulis, G.A.; Waterman, M.S.
1997-12-01
A new nearest-neighbor method for detecting chimeric 16S rRNA artifacts generated during PCR amplification from mixed populations has been developed. The method uses dynamic programming to generate an optimal chimeric alignment, defined as the highest scoring alignment between a query and a concatenation of a 5{prime} and a 3{prime} segment from two separate entries from a database of related sequences. Chimeras are detected by studying the scores and form of the chimeric and global sequence alignments. The chimeric alignment method was found to be marginally more effective than k-tuple based nearest-neighbor methods in simulation studies, but its most effective use is in concert with k-tuple methods. 15 refs., 3 figs., 1 tab.
Dynamic programming on a tree for ultrasound elastography
NASA Astrophysics Data System (ADS)
Shams, Roozbeh; Boily, Mathieu; Martineau, Paul A.; Rivaz, Hassan
2016-04-01
Ultrasound Elastography is an emerging imaging technique that allows estimation of the mechanical characteristics of tissue. Two issues that need to be addressed before widespread use of elastography in clinical environments are real time constraints and deteriorating effects of signal decorrelation between pre- and post-compression images. Previous work has used Dynamic Programming (DP) to estimate tissue deformation. However, in case of large signal decorrelation, DP can fail. In this paper we, have proposed a novel solution to this problem by solving DP on a tree instead of a single Radio-Frequency line. Formulation of DP on a tree allows exploiting significantly more information, and as such, is more robust and accurate. Our results on phantom and in-vivo human data show that DP on tree significantly outperforms traditional DP in ultrasound elastography.
2011-01-01
Background It is known that healthy adults can quickly adapt to a novel dynamic environment, generated by a robotic manipulandum as a structured disturbing force field. We suggest that it may be of clinical interest to evaluate to which extent this kind of motor learning capability is impaired in children affected by cerebal palsy. Methods We adapted the protocol already used with adults, which employs a velocity dependant viscous field, and compared the performance of a group of subjects affected by Cerebral Palsy (CP group, 7 subjects) with a Control group of unimpaired age-matched children. The protocol included a familiarization phase (FA), during which no force was applied, a force field adaptation phase (CF), and a wash-out phase (WO) in which the field was removed. During the CF phase the field was shut down in a number of randomly selected "catch" trials, which were used in order to evaluate the "learning index" for each single subject and the two groups. Lateral deviation, speed and acceleration peaks and average speed were evaluated for each trajectory; a directional analysis was performed in order to inspect the role of the limb's inertial anisotropy in the different experimental phases. Results During the FA phase the movements of the CP subjects were more curved, displaying greater and variable directional error; over the course of the CF phase both groups showed a decreasing trend in the lateral error and an after-effect at the beginning of the wash-out, but the CP group had a non significant adaptation rate and a lower learning index, suggesting that CP subjects have reduced ability to learn to compensate external force. Moreover, a directional analysis of trajectories confirms that the control group is able to better predict the force field by tuning the kinematic features of the movements along different directions in order to account for the inertial anisotropy of arm. Conclusions Spatial abnormalities in children affected by cerebral palsy may be
Inference for Optimal Dynamic Treatment Regimes using an Adaptive m-out-of-n Bootstrap Scheme
Chakraborty, Bibhas; Laber, Eric B.; Zhao, Yingqi
2013-01-01
Summary A dynamic treatment regime consists of a set of decision rules that dictate how to individualize treatment to patients based on available treatment and covariate history. A common method for estimating an optimal dynamic treatment regime from data is Q-learning which involves nonsmooth operations of the data. This nonsmoothness causes standard asymptotic approaches for inference like the bootstrap or Taylor series arguments to breakdown if applied without correction. Here, we consider the m-out-of-n bootstrap for constructing confidence intervals for the parameters indexing the optimal dynamic regime. We propose an adaptive choice of m and show that it produces asymptotically correct confidence sets under fixed alternatives. Furthermore, the proposed method has the advantage of being conceptually and computationally much more simple than competing methods possessing this same theoretical property. We provide an extensive simulation study to compare the proposed method with currently available inference procedures. The results suggest that the proposed method delivers nominal coverage while being less conservative than alternatives. The proposed methods are implemented in the qLearn R-package and have been made available on the Comprehensive R-Archive Network (http://cran.r-project.org/). Analysis of the Sequenced Treatment Alternatives to Relieve Depression (STAR*D) study is used as an illustrative example. PMID:23845276
Robust dynamic sliding-mode control using adaptive RENN for magnetic levitation system.
Lin, Faa-Jeng; Chen, Syuan-Yi; Shyu, Kuo-Kai
2009-06-01
In this paper, a robust dynamic sliding mode control system (RDSMC) using a recurrent Elman neural network (RENN) is proposed to control the position of a levitated object of a magnetic levitation system considering the uncertainties. First, a dynamic model of the magnetic levitation system is derived. Then, a proportional-integral-derivative (PID)-type sliding-mode control system (SMC) is adopted for tracking of the reference trajectories. Moreover, a new PID-type dynamic sliding-mode control system (DSMC) is proposed to reduce the chattering phenomenon. However, due to the hardware being limited and the uncertainty bound being unknown of the switching function for the DSMC, an RDSMC is proposed to improve the control performance and further increase the robustness of the magnetic levitation system. In the RDSMC, an RENN estimator is used to estimate an unknown nonlinear function of lumped uncertainty online and replace the switching function in the hitting control of the DSMC directly. The adaptive learning algorithms that trained the parameters of the RENN online are derived using Lyapunov stability theorem. Furthermore, a robust compensator is proposed to confront the uncertainties including approximation error, optimal parameter vectors, and higher order terms in Taylor series. Finally, some experimental results of tracking the various periodic trajectories demonstrate the validity of the proposed RDSMC for practical applications.
Sun, Tao; Liu, Hongbo; Yu, Hong; Chen, C L Philip
2016-06-28
The central time series crystallizes the common patterns of the set it represents. In this paper, we propose a global constrained degree-pruning dynamic programming (g(dp)²) approach to obtain the central time series through minimizing dynamic time warping (DTW) distance between two time series. The DTW matching path theory with global constraints is proved theoretically for our degree-pruning strategy, which is helpful to reduce the time complexity and computational cost. Our approach can achieve the optimal solution between two time series. An approximate method to the central time series of multiple time series [called as m_g(dp)²] is presented based on DTW barycenter averaging and our g(dp)² approach by considering hierarchically merging strategy. As illustrated by the experimental results, our approaches provide better within-group sum of squares and robustness than other relevant algorithms.
NASA Technical Reports Server (NTRS)
Johnson, C. R., Jr.
1979-01-01
The widespread modal analysis of flexible spacecraft and recognition of the poor a priori parameterization possible of the modal descriptions of individual structures have prompted the consideration of adaptive modal control strategies for distributed parameter systems. The current major approaches to computationally efficient adaptive digital control useful in these endeavors are explained in an original, lucid manner using modal second order structure dynamics for algorithm explication. Difficulties in extending these lumped-parameter techniques to distributed-parameter system expansion control are cited.
Family physician program in Iran: considerations for adapting the policy in urban settings.
Khayatzadeh-Mahani, Akram; Takian, Amirhossein
2014-11-01
Nationwide implementation of Family Physician (FP) program started in 2005 and targeted almost 25,000,000 citizens residing in rural areas and cities with less than 20,000 populations in Iran. Despite its blatant initiation that resulted in some modest achievements, the future of FP looks unclear in Iran. Thus far, no longitudinal evaluation of the implementation and impact of FP program has been conducted. However, meager evidence highlights the facilitating role of an existing and strong Primary Health Care (PHC) network in the implementation of FP in rural areas in Iran. A longstanding challenge, however, as emphasized by most stakeholders, remains to be the expansion of FP program into urban settings, where the PHC is undeveloped and fragile as well as the powerful private sector is resistant. Using an adapted conceptual framework of institutions, ideas, and interests, this policy perspective aims to shed light on main difficulties of FP implementation in urban areas of Iran. We analyze FP policy in the context of ongoing interactions and conflicts among institutions (the structures and rules that shape policies), interests (the groups and individuals influencing policy), and ideas (discourses around policies). Our argument will, we envisage, help plan for more appropriate implementation of FP in cities in Iran, and hopefully beyond.
Real Time Updating Genetic Network Programming for Adapting to the Change of Stock Prices
NASA Astrophysics Data System (ADS)
Chen, Yan; Mabu, Shingo; Shimada, Kaoru; Hirasawa, Kotaro
The key in stock trading model is to take the right actions for trading at the right time, primarily based on the accurate forecast of future stock trends. Since an effective trading with given information of stock prices needs an intelligent strategy for the decision making, we applied Genetic Network Programming (GNP) to creating a stock trading model. In this paper, we propose a new method called Real Time Updating Genetic Network Programming (RTU-GNP) for adapting to the change of stock prices. There are three important points in this paper: First, the RTU-GNP method makes a stock trading decision considering both the recommendable information of technical indices and the candlestick charts according to the real time stock prices. Second, we combine RTU-GNP with a Sarsa learning algorithm to create the programs efficiently. Also, sub-nodes are introduced in each judgment and processing node to determine appropriate actions (buying/selling) and to select appropriate stock price information depending on the situation. Third, a Real Time Updating system has been firstly introduced in our paper considering the change of the trend of stock prices. The experimental results on the Japanese stock market show that the trading model with the proposed RTU-GNP method outperforms other models without real time updating. We also compared the experimental results using the proposed method with Buy&Hold method to confirm its effectiveness, and it is clarified that the proposed trading model can obtain much higher profits than Buy&Hold method.
Adaptation to environmental change is not a new concept. Humans have shown throughout history a capacity for adapting to different climates and environmental changes. Farmers, foresters, civil engineers, have all been forced to adapt to numerous challenges to overcome adversity...
Dynamic Line Rating Oncor Electric Delivery Smart Grid Program
Johnson, Justin; Smith, Cale; Young, Mike; Donohoo, Ken; Owen, Ross; Clark, Eddit; Espejo, Raul; Aivaliotis, Sandy; Stelmak, Ron; Mohr, Ron; Barba, Cristian; Gonzalez, Guillermo; Malkin, Stuart; Dimitrova, Vessela; Ragsdale, Gary; Mitchem, Sean; Jeirath, Nakul; Loomis, Joe; Trevino, Gerardo; Syracuse, Steve; Hurst, Neil; Mereness, Matt; Johnson, Chad; Bivens, Carrie
2013-05-04
Electric transmission lines are the lifeline of the electric utility industry, delivering its product from source to consumer. This critical infrastructure is often constrained such that there is inadequate capacity on existing transmission lines to efficiently deliver the power to meet demand in certain areas or to transport energy from high-generation areas to high-consumption regions. When this happens, the cost of the energy rises; more costly sources of power are used to meet the demand or the system operates less reliably. These economic impacts are known as congestion, and they can amount to substantial dollars for any time frame of reference: hour, day or year. There are several solutions to the transmission constraint problem, including: construction of new generation, construction of new transmission facilities, rebuilding and reconductoring of existing transmission assets, and Dynamic Line Rating (DLR). All of these options except DLR are capital intensive, have long lead times and often experience strong public and regulatory opposition. The Smart Grid Demonstration Program (SGDP) project co-funded by the Department of Energy (DOE) and Oncor Electric Delivery Company developed and deployed the most extensive and advanced DLR installation to demonstrate that DLR technology is capable of resolving many transmission capacity constraint problems with a system that is reliable, safe and very cost competitive. The SGDP DLR deployment is the first application of DLR technology to feed transmission line real-time dynamic ratings directly into the system operation’s State Estimator and load dispatch program, which optimizes the matching of generation with load demand on a security, reliability and economic basis. The integrated Dynamic Line Rating (iDLR)1 collects transmission line parameters at remote locations on the lines, calculates the real-time line rating based on the equivalent conductor temperature, ambient temperature and influence of wind and solar
AN INTRODUCTION TO THE APPLICATION OF DYNAMIC PROGRAMMING TO LINEAR CONTROL SYSTEMS
DYNAMIC PROGRAMMING APPLIED TO OPTIMIZE LINEAR CONTROL SYSTEMS WITH QUADRATIC PERFORMANCE MEASURES. MATHEMATICAL METHODS WHICH MAY BE APPLIED TO SPACE VEHICLE AND RELATED GUIDANCE AND CONTROL PROBLEMS.
NASA Technical Reports Server (NTRS)
Oakley, David R.; Knight, Norman F., Jr.
1994-01-01
A parallel adaptive dynamic relaxation (ADR) algorithm has been developed for nonlinear structural analysis. This algorithm has minimal memory requirements, is easily parallelizable and scalable to many processors, and is generally very reliable and efficient for highly nonlinear problems. Performance evaluations on single-processor computers have shown that the ADR algorithm is reliable and highly vectorizable, and that it is competitive with direct solution methods for the highly nonlinear problems considered. The present algorithm is implemented on the 512-processor Intel Touchstone DELTA system at Caltech, and it is designed to minimize the extent and frequency of interprocessor communication. The algorithm has been used to solve for the nonlinear static response of two and three dimensional hyperelastic systems involving contact. Impressive relative speedups have been achieved and demonstrate the high scalability of the ADR algorithm. For the class of problems addressed, the ADR algorithm represents a very promising approach for parallel-vector processing.
Vencels, Juris; Delzanno, Gian Luca; Johnson, Alec; Peng, Ivy Bo; Laure, Erwin; Markidis, Stefano
2015-06-01
A spectral method for kinetic plasma simulations based on the expansion of the velocity distribution function in a variable number of Hermite polynomials is presented. The method is based on a set of non-linear equations that is solved to determine the coefficients of the Hermite expansion satisfying the Vlasov and Poisson equations. In this paper, we first show that this technique combines the fluid and kinetic approaches into one framework. Second, we present an adaptive strategy to increase and decrease the number of Hermite functions dynamically during the simulation. The technique is applied to the Landau damping and two-stream instability test problems. Performance results show 21% and 47% saving of total simulation time in the Landau and two-stream instability test cases, respectively.
Emerging roles of tRNA in adaptive translation, signalling dynamics and disease.
Kirchner, Sebastian; Ignatova, Zoya
2015-02-01
tRNAs, nexus molecules between mRNAs and proteins, have a central role in translation. Recent discoveries have revealed unprecedented complexity of tRNA biosynthesis, modification patterns, regulation and function. In this Review, we present emerging concepts regarding how tRNA abundance is dynamically regulated and how tRNAs (and their nucleolytic fragments) are centrally involved in stress signalling and adaptive translation, operating across a wide range of timescales. Mutations in tRNAs or in genes affecting tRNA biogenesis are also linked to complex human diseases with surprising heterogeneity in tissue vulnerability, and we highlight cell-specific aspects that modulate the disease penetrance of tRNA-based pathologies.
Vencels, Juris; Delzanno, Gian Luca; Johnson, Alec; ...
2015-06-01
A spectral method for kinetic plasma simulations based on the expansion of the velocity distribution function in a variable number of Hermite polynomials is presented. The method is based on a set of non-linear equations that is solved to determine the coefficients of the Hermite expansion satisfying the Vlasov and Poisson equations. In this paper, we first show that this technique combines the fluid and kinetic approaches into one framework. Second, we present an adaptive strategy to increase and decrease the number of Hermite functions dynamically during the simulation. The technique is applied to the Landau damping and two-stream instabilitymore » test problems. Performance results show 21% and 47% saving of total simulation time in the Landau and two-stream instability test cases, respectively.« less
Luo, Shaohua
2014-09-01
This paper is concerned with the problem of adaptive fuzzy dynamic surface control (DSC) for the permanent magnet synchronous motor (PMSM) system with chaotic behavior, disturbance and unknown control gain and parameters. Nussbaum gain is adopted to cope with the situation that the control gain is unknown. And the unknown items can be estimated by fuzzy logic system. The proposed controller guarantees that all the signals in the closed-loop system are bounded and the system output eventually converges to a small neighborhood of the desired reference signal. Finally, the numerical simulations indicate that the proposed scheme can suppress the chaos of PMSM and show the effectiveness and robustness of the proposed method.
Luo, Shaohua
2014-09-01
This paper is concerned with the problem of adaptive fuzzy dynamic surface control (DSC) for the permanent magnet synchronous motor (PMSM) system with chaotic behavior, disturbance and unknown control gain and parameters. Nussbaum gain is adopted to cope with the situation that the control gain is unknown. And the unknown items can be estimated by fuzzy logic system. The proposed controller guarantees that all the signals in the closed-loop system are bounded and the system output eventually converges to a small neighborhood of the desired reference signal. Finally, the numerical simulations indicate that the proposed scheme can suppress the chaos of PMSM and show the effectiveness and robustness of the proposed method.
Subjective evaluation of H.265/HEVC based dynamic adaptive video streaming over HTTP (HEVC-DASH)
NASA Astrophysics Data System (ADS)
Irondi, Iheanyi; Wang, Qi; Grecos, Christos
2015-02-01
The Dynamic Adaptive Streaming over HTTP (DASH) standard is becoming increasingly popular for real-time adaptive HTTP streaming of internet video in response to unstable network conditions. Integration of DASH streaming techniques with the new H.265/HEVC video coding standard is a promising area of research. The performance of HEVC-DASH systems has been previously evaluated by a few researchers using objective metrics, however subjective evaluation would provide a better measure of the user's Quality of Experience (QoE) and overall performance of the system. This paper presents a subjective evaluation of an HEVC-DASH system implemented in a hardware testbed. Previous studies in this area have focused on using the current H.264/AVC (Advanced Video Coding) or H.264/SVC (Scalable Video Coding) codecs and moreover, there has been no established standard test procedure for the subjective evaluation of DASH adaptive streaming. In this paper, we define a test plan for HEVC-DASH with a carefully justified data set employing longer video sequences that would be sufficient to demonstrate the bitrate switching operations in response to various network condition patterns. We evaluate the end user's real-time QoE online by investigating the perceived impact of delay, different packet loss rates, fluctuating bandwidth, and the perceived quality of using different DASH video stream segment sizes on a video streaming session using different video sequences. The Mean Opinion Score (MOS) results give an insight into the performance of the system and expectation of the users. The results from this study show the impact of different network impairments and different video segments on users' QoE and further analysis and study may help in optimizing system performance.