A Spectral Lyapunov Function for Exponentially Stable LTV Systems

NASA Technical Reports Server (NTRS)

Zhu, J. Jim; Liu, Yong; Hang, Rui

2010-01-01

This paper presents the formulation of a Lyapunov function for an exponentially stable linear timevarying (LTV) system using a well-defined PD-spectrum and the associated PD-eigenvectors. It provides a bridge between the first and second methods of Lyapunov for stability assessment, and will find significant applications in the analysis and control law design for LTV systems and linearizable nonlinear time-varying systems.

Lyapunov exponents of stochastic systems—from micro to macro

NASA Astrophysics Data System (ADS)

Laffargue, Tanguy; Tailleur, Julien; van Wijland, Frédéric

2016-03-01

Lyapunov exponents of dynamical systems are defined from the rates of divergence of nearby trajectories. For stochastic systems, one typically assumes that these trajectories are generated under the ‘same noise realization’. The purpose of this work is to critically examine what this expression means. For Brownian particles, we consider two natural interpretations of the noise: intrinsic to the particles or stemming from the fluctuations of the environment. We show how they lead to different distributions of the largest Lyapunov exponent as well as different fluctuating hydrodynamics for the collective density field. We discuss, both at microscopic and macroscopic levels, the limits in which these noise prescriptions become equivalent. We close this paper by providing an estimate of the largest Lyapunov exponent and of its fluctuations for interacting particles evolving with Dean-Kawasaki dynamics.

Dynamical behaviors determined by the Lyapunov function in competitive Lotka-Volterra systems.

PubMed

Tang, Ying; Yuan, Ruoshi; Ma, Yian

2013-01-01

Dynamical behaviors of the competitive Lotka-Volterra system even for 3 species are not fully understood. In this paper, we study this problem from the perspective of the Lyapunov function. We construct explicitly the Lyapunov function using three examples of the competitive Lotka-Volterra system for the whole state space: (1) the general 2-species case, (2) a 3-species model, and (3) the model of May-Leonard. The basins of attraction for these examples are demonstrated, including cases with bistability and cyclical behavior. The first two examples are the generalized gradient system, where the energy dissipation may not follow the gradient of the Lyapunov function. In addition, under a new type of stochastic interpretation, the Lyapunov function also leads to the Boltzmann-Gibbs distribution on the final steady state when multiplicative noise is added.

Dynamical behaviors determined by the Lyapunov function in competitive Lotka-Volterra systems

NASA Astrophysics Data System (ADS)

Tang, Ying; Yuan, Ruoshi; Ma, Yian

2013-01-01

Dynamical behaviors of the competitive Lotka-Volterra system even for 3 species are not fully understood. In this paper, we study this problem from the perspective of the Lyapunov function. We construct explicitly the Lyapunov function using three examples of the competitive Lotka-Volterra system for the whole state space: (1) the general 2-species case, (2) a 3-species model, and (3) the model of May-Leonard. The basins of attraction for these examples are demonstrated, including cases with bistability and cyclical behavior. The first two examples are the generalized gradient system, where the energy dissipation may not follow the gradient of the Lyapunov function. In addition, under a new type of stochastic interpretation, the Lyapunov function also leads to the Boltzmann-Gibbs distribution on the final steady state when multiplicative noise is added.

Numerical Analysis and Improved Algorithms for Lyapunov-Exponent Calculation of Discrete-Time Chaotic Systems

NASA Astrophysics Data System (ADS)

He, Jianbin; Yu, Simin; Cai, Jianping

2016-12-01

Lyapunov exponent is an important index for describing chaotic systems behavior, and the largest Lyapunov exponent can be used to determine whether a system is chaotic or not. For discrete-time dynamical systems, the Lyapunov exponents are calculated by an eigenvalue method. In theory, according to eigenvalue method, the more accurate calculations of Lyapunov exponent can be obtained with the increment of iterations, and the limits also exist. However, due to the finite precision of computer and other reasons, the results will be numeric overflow, unrecognized, or inaccurate, which can be stated as follows: (1) The iterations cannot be too large, otherwise, the simulation result will appear as an error message of NaN or Inf; (2) If the error message of NaN or Inf does not appear, then with the increment of iterations, all Lyapunov exponents will get close to the largest Lyapunov exponent, which leads to inaccurate calculation results; (3) From the viewpoint of numerical calculation, obviously, if the iterations are too small, then the results are also inaccurate. Based on the analysis of Lyapunov-exponent calculation in discrete-time systems, this paper investigates two improved algorithms via QR orthogonal decomposition and SVD orthogonal decomposition approaches so as to solve the above-mentioned problems. Finally, some examples are given to illustrate the feasibility and effectiveness of the improved algorithms.

Stabilisation of time-varying linear systems via Lyapunov differential equations

NASA Astrophysics Data System (ADS)

Zhou, Bin; Cai, Guang-Bin; Duan, Guang-Ren

2013-02-01

This article studies stabilisation problem for time-varying linear systems via state feedback. Two types of controllers are designed by utilising solutions to Lyapunov differential equations. The first type of feedback controllers involves the unique positive-definite solution to a parametric Lyapunov differential equation, which can be solved when either the state transition matrix of the open-loop system is exactly known, or the future information of the system matrices are accessible in advance. Different from the first class of controllers which may be difficult to implement in practice, the second type of controllers can be easily implemented by solving a state-dependent Lyapunov differential equation with a given positive-definite initial condition. In both cases, explicit conditions are obtained to guarantee the exponentially asymptotic stability of the associated closed-loop systems. Numerical examples show the effectiveness of the proposed approaches.

Computing the optimal path in stochastic dynamical systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bauver, Martha; Forgoston, Eric, E-mail: eric.forgoston@montclair.edu; Billings, Lora

2016-08-15

In stochastic systems, one is often interested in finding the optimal path that maximizes the probability of escape from a metastable state or of switching between metastable states. Even for simple systems, it may be impossible to find an analytic form of the optimal path, and in high-dimensional systems, this is almost always the case. In this article, we formulate a constructive methodology that is used to compute the optimal path numerically. The method utilizes finite-time Lyapunov exponents, statistical selection criteria, and a Newton-based iterative minimizing scheme. The method is applied to four examples. The first example is a two-dimensionalmore » system that describes a single population with internal noise. This model has an analytical solution for the optimal path. The numerical solution found using our computational method agrees well with the analytical result. The second example is a more complicated four-dimensional system where our numerical method must be used to find the optimal path. The third example, although a seemingly simple two-dimensional system, demonstrates the success of our method in finding the optimal path where other numerical methods are known to fail. In the fourth example, the optimal path lies in six-dimensional space and demonstrates the power of our method in computing paths in higher-dimensional spaces.« less

Predictors of initial weight loss among women with abdominal obesity: a path model using self-efficacy and health-promoting behaviour.

PubMed

Choo, Jina; Kang, Hyuncheol

2015-05-01

To identify predictors of initial weight loss among women with abdominal obesity by using a path model. Successful weight loss in the initial stages of long-term weight management may promote weight loss maintenance. A longitudinal study design. Study participants were 75 women with abdominal obesity, who were enrolled in a 12-month Community-based Heart and Weight Management Trial and followed until a 6-month assessment. The Weight Efficacy Lifestyle, Exercise Self-Efficacy and Health Promoting Lifestyle Profile-II measured diet self-efficacy, exercise self-efficacy and health-promoting behaviour respectively. All endogenous and exogenous variables used in our path model were change variables from baseline to 6 months. Data were collected between May 2011-May 2012. Based on the path model, increases in both diet and exercise self-efficacy had significant effects on increases in health-promoting behaviour. Increases in diet self-efficacy had a significant indirect effect on initial weight loss via increases in health-promoting behaviour. Increases in health-promoting behaviour had a significant effect on initial weight loss. Among women with abdominal obesity, increased diet self-efficacy and health-promoting behaviour were predictors of initial weight loss. A mechanism by which increased diet self-efficacy predicts initial weight loss may be partially attributable to health-promoting behavioural change. However, more work is still needed to verify causality. Based on the current findings, intensive nursing strategies for increasing self-efficacy for weight control and health-promoting behaviour may be essential components for better weight loss in the initial stage of a weight management intervention. © 2015 John Wiley & Sons Ltd.

Toward a new task assignment and path evolution (TAPE) for missile defense system (MDS) using intelligent adaptive SOM with recurrent neural networks (RNNs).

PubMed

Wang, Chi-Hsu; Chen, Chun-Yao; Hung, Kun-Neng

2015-06-01

In this paper, a new adaptive self-organizing map (SOM) with recurrent neural network (RNN) controller is proposed for task assignment and path evolution of missile defense system (MDS). We address the problem of N agents (defending missiles) and D targets (incoming missiles) in MDS. A new RNN controller is designed to force an agent (or defending missile) toward a target (or incoming missile), and a monitoring controller is also designed to reduce the error between RNN controller and ideal controller. A new SOM with RNN controller is then designed to dispatch agents to their corresponding targets by minimizing total damaging cost. This is actually an important application of the multiagent system. The SOM with RNN controller is the main controller. After task assignment, the weighting factors of our new SOM with RNN controller are activated to dispatch the agents toward their corresponding targets. Using the Lyapunov constraints, the weighting factors for the proposed SOM with RNN controller are updated to guarantee the stability of the path evolution (or planning) system. Excellent simulations are obtained using this new approach for MDS, which show that our RNN has the lowest average miss distance among the several techniques.

Regeneration cycle and the covariant Lyapunov vectors in a minimal wall turbulence.

PubMed

Inubushi, Masanobu; Takehiro, Shin-ichi; Yamada, Michio

2015-08-01

Considering a wall turbulence as a chaotic dynamical system, we study regeneration cycles in a minimal wall turbulence from the viewpoint of orbital instability by employing the covariant Lyapunov analysis developed by [F. Ginelli et al. Phys. Rev. Lett. 99, 130601 (2007)]. We divide the regeneration cycle into two phases and characterize them with the local Lyapunov exponents and the covariant Lyapunov vectors of the Navier-Stokes turbulence. In particular, we show numerically that phase (i) is dominated by instabilities related to the sinuous mode and the streamwise vorticity, and there is no instability in phase (ii). Furthermore, we discuss a mechanism of the regeneration cycle, making use of an energy budget analysis.

Application of largest Lyapunov exponent analysis on the studies of dynamics under external forces

NASA Astrophysics Data System (ADS)

Odavić, Jovan; Mali, Petar; Tekić, Jasmina; Pantić, Milan; Pavkov-Hrvojević, Milica

2017-06-01

Dynamics of driven dissipative Frenkel-Kontorova model is examined by using largest Lyapunov exponent computational technique. Obtained results show that besides the usual way where behavior of the system in the presence of external forces is studied by analyzing its dynamical response function, the largest Lyapunov exponent analysis can represent a very convenient tool to examine system dynamics. In the dc driven systems, the critical depinning force for particular structure could be estimated by computing the largest Lyapunov exponent. In the dc+ac driven systems, if the substrate potential is the standard sinusoidal one, calculation of the largest Lyapunov exponent offers a more sensitive way to detect the presence of Shapiro steps. When the amplitude of the ac force is varied the behavior of the largest Lyapunov exponent in the pinned regime completely reflects the behavior of Shapiro steps and the critical depinning force, in particular, it represents the mirror image of the amplitude dependence of critical depinning force. This points out an advantage of this technique since by calculating the largest Lyapunov exponent in the pinned regime we can get an insight into the dynamics of the system when driving forces are applied. Additionally, the system is shown to be not chaotic even in the case of incommensurate structures and large amplitudes of external force, which is a consequence of overdampness of the model and the Middleton's no passing rule.

Lyapunov Stability of Fuzzy Discrete Event Systems

NASA Astrophysics Data System (ADS)

Liu, Fuchun; Qiu, Daowen

Fuzzy discrete event systems (FDESs) as a generalization of (crisp) discrete event systems (DESs) may better deal with the problems of fuzziness, impreciseness, and subjectivity. Qiu, Cao and Ying, Liu and Qiu interestingly developed the theory of FDESs. As a continuation of Qiu's work, this paper is to deal with the Lyapunov stability of FDESs, some main results of crisp DESs are generalized. We formalize the notions of the reachability of fuzzy states defined on a metric space. A linear algorithm of computing the r-reachable fuzzy state set is presented. Then we introduce the definitions of stability and asymptotical stability in the sense of Lyapunov to guarantee the convergence of the behaviors of fuzzy automaton to the desired fuzzy states when system engages in some illegal behaviors which can be tolerated. In particular, we present a necessary and sufficient condition for stability and another for asymptotical stability of FDESs.

Lyapunov exponents for one-dimensional aperiodic photonic bandgap structures

NASA Astrophysics Data System (ADS)

Kissel, Glen J.

2011-10-01

Existing in the "gray area" between perfectly periodic and purely randomized photonic bandgap structures are the socalled aperoidic structures whose layers are chosen according to some deterministic rule. We consider here a onedimensional photonic bandgap structure, a quarter-wave stack, with the layer thickness of one of the bilayers subject to being either thin or thick according to five deterministic sequence rules and binary random selection. To produce these aperiodic structures we examine the following sequences: Fibonacci, Thue-Morse, Period doubling, Rudin-Shapiro, as well as the triadic Cantor sequence. We model these structures numerically with a long chain (approximately 5,000,000) of transfer matrices, and then use the reliable algorithm of Wolf to calculate the (upper) Lyapunov exponent for the long product of matrices. The Lyapunov exponent is the statistically well-behaved variable used to characterize the Anderson localization effect (exponential confinement) when the layers are randomized, so its calculation allows us to more precisely compare the purely randomized structure with its aperiodic counterparts. It is found that the aperiodic photonic systems show much fine structure in their Lyapunov exponents as a function of frequency, and, in a number of cases, the exponents are quite obviously fractal.

Universality in chaos: Lyapunov spectrum and random matrix theory

NASA Astrophysics Data System (ADS)

Hanada, Masanori; Shimada, Hidehiko; Tezuka, Masaki

2018-02-01

We propose the existence of a new universality in classical chaotic systems when the number of degrees of freedom is large: the statistical property of the Lyapunov spectrum is described by random matrix theory. We demonstrate it by studying the finite-time Lyapunov exponents of the matrix model of a stringy black hole and the mass-deformed models. The massless limit, which has a dual string theory interpretation, is special in that the universal behavior can be seen already at t =0 , while in other cases it sets in at late time. The same pattern is demonstrated also in the product of random matrices.

Generalized decompositions of dynamic systems and vector Lyapunov functions

NASA Astrophysics Data System (ADS)

Ikeda, M.; Siljak, D. D.

1981-10-01

The notion of decomposition is generalized to provide more freedom in constructing vector Lyapunov functions for stability analysis of nonlinear dynamic systems. A generalized decomposition is defined as a disjoint decomposition of a system which is obtained by expanding the state-space of a given system. An inclusion principle is formulated for the solutions of the expansion to include the solutions of the original system, so that stability of the expansion implies stability of the original system. Stability of the expansion can then be established by standard disjoint decompositions and vector Lyapunov functions. The applicability of the new approach is demonstrated using the Lotka-Volterra equations.

Universality in chaos: Lyapunov spectrum and random matrix theory.

PubMed

Hanada, Masanori; Shimada, Hidehiko; Tezuka, Masaki

2018-02-01

We propose the existence of a new universality in classical chaotic systems when the number of degrees of freedom is large: the statistical property of the Lyapunov spectrum is described by random matrix theory. We demonstrate it by studying the finite-time Lyapunov exponents of the matrix model of a stringy black hole and the mass-deformed models. The massless limit, which has a dual string theory interpretation, is special in that the universal behavior can be seen already at t=0, while in other cases it sets in at late time. The same pattern is demonstrated also in the product of random matrices.

The Multivariate Largest Lyapunov Exponent as an Age-Related Metric of Quiet Standing Balance

PubMed Central

Liu, Kun; Wang, Hongrui; Xiao, Jinzhuang

2015-01-01

The largest Lyapunov exponent has been researched as a metric of the balance ability during human quiet standing. However, the sensitivity and accuracy of this measurement method are not good enough for clinical use. The present research proposes a metric of the human body's standing balance ability based on the multivariate largest Lyapunov exponent which can quantify the human standing balance. The dynamic multivariate time series of ankle, knee, and hip were measured by multiple electrical goniometers. Thirty-six normal people of different ages participated in the test. With acquired data, the multivariate largest Lyapunov exponent was calculated. Finally, the results of the proposed approach were analysed and compared with the traditional method, for which the largest Lyapunov exponent and power spectral density from the centre of pressure were also calculated. The following conclusions can be obtained. The multivariate largest Lyapunov exponent has a higher degree of differentiation in differentiating balance in eyes-closed conditions. The MLLE value reflects the overall coordination between multisegment movements. Individuals of different ages can be distinguished by their MLLE values. The standing stability of human is reduced with the increment of age. PMID:26064182

An Isomorphism between Lyapunov Exponents and Shannon's Channel Capacity

DOE Office of Scientific and Technical Information (OSTI.GOV)

Friedland, Gerald; Metere, Alfredo

We demonstrate that discrete Lyapunov exponents are isomorphic to numeric overflows of the capacity of an arbitrary noiseless and memoryless channel in a Shannon communication model with feedback. The isomorphism allows the understanding of Lyapunov exponents in terms of Information Theory, rather than the traditional definitions in chaos theory. The result also implies alternative approaches to the calculation of related quantities, such as the Kolmogorov Sinai entropy which has been linked to thermodynamic entropy. This work provides a bridge between fundamental physics and information theory. It suggests, among other things, that machine learning and other information theory methods can bemore » employed at the core of physics simulations.« less

Conditioning of the Stable, Discrete-time Lyapunov Operator

NASA Technical Reports Server (NTRS)

Tippett, Michael K.; Cohn, Stephen E.; Todling, Ricardo; Marchesin, Dan

2000-01-01

The Schatten p-norm condition of the discrete-time Lyapunov operator L(sub A) defined on matrices P is identical with R(sup n X n) by L(sub A) P is identical with P - APA(sup T) is studied for stable matrices A is a member of R(sup n X n). Bounds are obtained for the norm of L(sub A) and its inverse that depend on the spectrum, singular values and radius of stability of A. Since the solution P of the the discrete-time algebraic Lyapunov equation (DALE) L(sub A)P = Q can be ill-conditioned only when either L(sub A) or Q is ill-conditioned, these bounds are useful in determining whether P admits a low-rank approximation, which is important in the numerical solution of the DALE for large n.

Behaviour of Lyapunov exponents near crisis points in the dissipative standard map

NASA Astrophysics Data System (ADS)

Pompe, B.; Leven, R. W.

1988-11-01

We numerically study the behaviour of the largest Lyapunov characteristic exponent λ1 in dependence on a control parameter in the 2D standard map with dissipation. In order to investigate the system's motion in parameter intervals slightly above crisis points we introduce "partial" Lyapunov exponents which characterize the average exponential divergence of nearby orbits on a semi-attractor at a boundary crisis and on distinct parts of a "large" chaotic attractor near an interior crisis. In the former case we find no significant difference between λ1 in the pre-crisis regime and the partial Lyapunov exponent describing transient chaotic motions slightly above the crisis. For the latter case we give a quantitative description of the drastic increase of λ1. Moreover, a formula which connects the critical exponent of a chaotic transient above a boundary crisis with a pointwise dimension is derived.

Relationship between birth weight, maternal smoking during pregnancy and childhood and adolescent lung function: A path analysis.

PubMed

Balte, Pallavi; Karmaus, Wilfried; Roberts, Graham; Kurukulaaratchy, Ramesh; Mitchell, Frances; Arshad, Hasan

2016-12-01

Low birth weight and gestational maternal smoking have been linked with reduced lung function in children in many cross sectional studies. However, these associations have not yet been assessed with repeated measurements of lung function. Our aim was to investigate the effects of birth weight, gestational age, and gestational maternal smoking on lung function in children at age 10 and 18 years. In the Isle of Wight birth cohort spirometry was performed at age 10 and 18 years. Information on birth weight and gestational age were obtained from hospital records. Mothers were asked about smoking during pregnancy. We employed linear mixed models to estimate the effect of these risk factors on repeated measurements of lung function. We considered maternal asthma, sex, neonatal intensive care unit admission, height, socio-economic status, personal smoking in participants at age 18, body mass index and environmental tobacco smoke exposure as potential confounders. Finally, we used path analysis to determine links between birth weight, gestational age and gestational maternal smoking on lung function at age 10 and 18 years. Linear mixed models showed that with every 1 kg increase in birth weight, Forced expiratory volume in one second (FEV 1 ) increased by 42.6 ± 17.2 mL and Forced expiratory flow between 25% and 75% (FEF 25-75 ) of Forced vital capacity (FVC) increased by 95.5 ± 41.2 mL at age 18 years after adjusting for potential confounders. Path analysis suggested that birth weight had positive direct effects on FEV 1 and FEF 25-75 and positive indirect effect on FVC at 10 years which were carried forward to 18 years. Additionally, results also suggested a positive association between gestational age and FEV 1 , FVC and FEF 25-75  at ages 10 and 18 years and an inverse association between gestational smoke exposure and FEV 1 /FVC ratio and FEF 25-75  at age 18 years. Higher birth weight and gestational age were associated with higher FEV 1 , FVC and FEF 25

Input-to-state stability of time-varying nonlinear discrete-time systems via indefinite difference Lyapunov functions.

PubMed

Li, Huijuan; Liu, Anping; Zhang, Linli

2018-06-01

In this paper, we propose new sufficient criteria for input-to-state stability (ISS) of time-varying nonlinear discrete-time systems via indefinite difference Lyapunov functions. The proposed sufficient conditions for ISS of system are more relaxed than for ISS with respect to Lyapunov functions with negative definite difference. We prove system is ISS by two methods. The first way is to prove system is ISS by indefinite difference ISS Lyapunov functions. The second method is to prove system is ISS via introducing an auxiliary system and indefinite difference robust Lyapunov functions. The comparison of the sufficient conditions for ISS obtained via the two methods is discussed. The effectiveness of our results is illustrated by three numerical examples. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.

Statistics of Lyapunov exponents of quasi-one-dimensional disordered systems

NASA Astrophysics Data System (ADS)

Zhang, Yan-Yang; Xiong, Shi-Jie

2005-10-01

Statistical properties of Lyapunov exponents (LE) are numerically calculated in a quasi-one-dimensional (1D) Anderson model, which is in a 2D or 3D lattice with a finite cross section. The single-parameter scaling (SPS) variable τ relating the Lyapunov exponents γ and their variances σ by τ≡σ2L/⟨γ⟩ is calculated for different lateral coupling t and disorder strength W . In a wide range of t , τ is approximately independent of W , but it has different values for LEs in different channels. For small t , the distribution of the smallest LE is non-Gaussian and τ strongly depends on W , remarkably different from the 1D SPS hypothesis.

Modulational estimate for the maximal Lyapunov exponent in Fermi-Pasta-Ulam chains

NASA Astrophysics Data System (ADS)

Dauxois, Thierry; Ruffo, Stefano; Torcini, Alessandro

1997-12-01

In the framework of the Fermi-Pasta-Ulam (FPU) model, we show a simple method to give an accurate analytical estimation of the maximal Lyapunov exponent at high energy density. The method is based on the computation of the mean value of the modulational instability growth rates associated to unstable modes. Moreover, we show that the strong stochasticity threshold found in the β-FPU system is closely related to a transition in tangent space, the Lyapunov eigenvector being more localized in space at high energy.

Extending the length and time scales of Gram–Schmidt Lyapunov vector computations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Costa, Anthony B., E-mail: acosta@northwestern.edu; Green, Jason R., E-mail: jason.green@umb.edu; Department of Chemistry, University of Massachusetts Boston, Boston, MA 02125

Lyapunov vectors have found growing interest recently due to their ability to characterize systems out of thermodynamic equilibrium. The computation of orthogonal Gram–Schmidt vectors requires multiplication and QR decomposition of large matrices, which grow as N{sup 2} (with the particle count). This expense has limited such calculations to relatively small systems and short time scales. Here, we detail two implementations of an algorithm for computing Gram–Schmidt vectors. The first is a distributed-memory message-passing method using Scalapack. The second uses the newly-released MAGMA library for GPUs. We compare the performance of both codes for Lennard–Jones fluids from N=100 to 1300 betweenmore » Intel Nahalem/Infiniband DDR and NVIDIA C2050 architectures. To our best knowledge, these are the largest systems for which the Gram–Schmidt Lyapunov vectors have been computed, and the first time their calculation has been GPU-accelerated. We conclude that Lyapunov vector calculations can be significantly extended in length and time by leveraging the power of GPU-accelerated linear algebra.« less

Extending the length and time scales of Gram-Schmidt Lyapunov vector computations

NASA Astrophysics Data System (ADS)

Costa, Anthony B.; Green, Jason R.

2013-08-01

Lyapunov vectors have found growing interest recently due to their ability to characterize systems out of thermodynamic equilibrium. The computation of orthogonal Gram-Schmidt vectors requires multiplication and QR decomposition of large matrices, which grow as N2 (with the particle count). This expense has limited such calculations to relatively small systems and short time scales. Here, we detail two implementations of an algorithm for computing Gram-Schmidt vectors. The first is a distributed-memory message-passing method using Scalapack. The second uses the newly-released MAGMA library for GPUs. We compare the performance of both codes for Lennard-Jones fluids from N=100 to 1300 between Intel Nahalem/Infiniband DDR and NVIDIA C2050 architectures. To our best knowledge, these are the largest systems for which the Gram-Schmidt Lyapunov vectors have been computed, and the first time their calculation has been GPU-accelerated. We conclude that Lyapunov vector calculations can be significantly extended in length and time by leveraging the power of GPU-accelerated linear algebra.

Intelligent, Robust Control of Deteriorated Turbofan Engines via Linear Parameter Varying Quadratic Lyapunov Function Design

NASA Technical Reports Server (NTRS)

Turso, James A.; Litt, Jonathan S.

2004-01-01

A method for accommodating engine deterioration via a scheduled Linear Parameter Varying Quadratic Lyapunov Function (LPVQLF)-Based controller is presented. The LPVQLF design methodology provides a means for developing unconditionally stable, robust control of Linear Parameter Varying (LPV) systems. The controller is scheduled on the Engine Deterioration Index, a function of estimated parameters that relate to engine health, and is computed using a multilayer feedforward neural network. Acceptable thrust response and tight control of exhaust gas temperature (EGT) is accomplished by adjusting the performance weights on these parameters for different levels of engine degradation. Nonlinear simulations demonstrate that the controller achieves specified performance objectives while being robust to engine deterioration as well as engine-to-engine variations.

Entropy-based link prediction in weighted networks

NASA Astrophysics Data System (ADS)

Xu, Zhongqi; Pu, Cunlai; Ramiz Sharafat, Rajput; Li, Lunbo; Yang, Jian

2017-01-01

Information entropy has been proved to be an effective tool to quantify the structural importance of complex networks. In the previous work (Xu et al, 2016 \\cite{xu2016}), we measure the contribution of a path in link prediction with information entropy. In this paper, we further quantify the contribution of a path with both path entropy and path weight, and propose a weighted prediction index based on the contributions of paths, namely Weighted Path Entropy (WPE), to improve the prediction accuracy in weighted networks. Empirical experiments on six weighted real-world networks show that WPE achieves higher prediction accuracy than three typical weighted indices.

Lyapunov exponents, covariant vectors and shadowing sensitivity analysis of 3D wakes: from laminar to chaotic regimes

NASA Astrophysics Data System (ADS)

Wang, Qiqi; Rigas, Georgios; Esclapez, Lucas; Magri, Luca; Blonigan, Patrick

2016-11-01

Bluff body flows are of fundamental importance to many engineering applications involving massive flow separation and in particular the transport industry. Coherent flow structures emanating in the wake of three-dimensional bluff bodies, such as cars, trucks and lorries, are directly linked to increased aerodynamic drag, noise and structural fatigue. For low Reynolds laminar and transitional regimes, hydrodynamic stability theory has aided the understanding and prediction of the unstable dynamics. In the same framework, sensitivity analysis provides the means for efficient and optimal control, provided the unstable modes can be accurately predicted. However, these methodologies are limited to laminar regimes where only a few unstable modes manifest. Here we extend the stability analysis to low-dimensional chaotic regimes by computing the Lyapunov covariant vectors and their associated Lyapunov exponents. We compare them to eigenvectors and eigenvalues computed in traditional hydrodynamic stability analysis. Computing Lyapunov covariant vectors and Lyapunov exponents also enables the extension of sensitivity analysis to chaotic flows via the shadowing method. We compare the computed shadowing sensitivities to traditional sensitivity analysis. These Lyapunov based methodologies do not rely on mean flow assumptions, and are mathematically rigorous for calculating sensitivities of fully unsteady flow simulations.

Two Upper Bounds for the Weighted Path Length of Binary Trees. Report No. UIUCDCS-R-73-565.

ERIC Educational Resources Information Center

Pradels, Jean Louis

Rooted binary trees with weighted nodes are structures encountered in many areas, such as coding theory, searching and sorting, information storage and retrieval. The path length is a meaningful quantity which gives indications about the expected time of a search or the length of a code, for example. In this paper, two sharp bounds for the total…

Extracting Lyapunov exponents from the echo dynamics of Bose-Einstein condensates on a lattice

NASA Astrophysics Data System (ADS)

Tarkhov, Andrei E.; Wimberger, Sandro; Fine, Boris V.

2017-08-01

We propose theoretically an experimentally realizable method to demonstrate the Lyapunov instability and to extract the value of the largest Lyapunov exponent for a chaotic many-particle interacting system. The proposal focuses specifically on a lattice of coupled Bose-Einstein condensates in the classical regime describable by the discrete Gross-Pitaevskii equation. We suggest to use imperfect time reversal of the system's dynamics known as the Loschmidt echo, which can be realized experimentally by reversing the sign of the Hamiltonian of the system. The routine involves tracking and then subtracting the noise of virtually any observable quantity before and after the time reversal. We support the theoretical analysis by direct numerical simulations demonstrating that the largest Lyapunov exponent can indeed be extracted from the Loschmidt echo routine. We also discuss possible values of experimental parameters required for implementing this proposal.

Extracting the differential inverse inelastic mean free path and differential surface excitation probability of Tungsten from X-ray photoelectron spectra and electron energy loss spectra

NASA Astrophysics Data System (ADS)

Afanas'ev, V. P.; Gryazev, A. S.; Efremenko, D. S.; Kaplya, P. S.; Kuznetcova, A. V.

2017-12-01

Precise knowledge of the differential inverse inelastic mean free path (DIIMFP) and differential surface excitation probability (DSEP) of Tungsten is essential for many fields of material science. In this paper, a fitting algorithm is applied for extracting DIIMFP and DSEP from X-ray photoelectron spectra and electron energy loss spectra. The algorithm uses the partial intensity approach as a forward model, in which a spectrum is given as a weighted sum of cross-convolved DIIMFPs and DSEPs. The weights are obtained as solutions of the Riccati and Lyapunov equations derived from the invariant imbedding principle. The inversion algorithm utilizes the parametrization of DIIMFPs and DSEPs on the base of a classical Lorentz oscillator. Unknown parameters of the model are found by using the fitting procedure, which minimizes the residual between measured spectra and forward simulations. It is found that the surface layer of Tungsten contains several sublayers with corresponding Langmuir resonances. The thicknesses of these sublayers are proportional to the periods of corresponding Langmuir oscillations, as predicted by the theory of R.H. Ritchie.

Quantum synchronization in an optomechanical system based on Lyapunov control.

PubMed

Li, Wenlin; Li, Chong; Song, Heshan

2016-06-01

We extend the concepts of quantum complete synchronization and phase synchronization, which were proposed in A. Mari et al., Phys. Rev. Lett. 111, 103605 (2013)PRLTAO0031-900710.1103/PhysRevLett.111.103605, to more widespread quantum generalized synchronization. Generalized synchronization can be considered a necessary condition or a more flexible derivative of complete synchronization, and its criterion and synchronization measure are proposed and analyzed in this paper. As examples, we consider two typical generalized synchronizations in a designed optomechanical system. Unlike the effort to construct a special coupling synchronization system, we purposefully design extra control fields based on Lyapunov control theory. We find that the Lyapunov function can adapt to more flexible control objectives, which is more suitable for generalized synchronization control, and the control fields can be achieved simply with a time-variant voltage. Finally, the existence of quantum entanglement in different generalized synchronizations is also discussed.

Lyapunov exponent and criticality in the Hamiltonian mean field model

NASA Astrophysics Data System (ADS)

Filho, L. H. Miranda; Amato, M. A.; Rocha Filho, T. M.

2018-03-01

We investigate the dependence of the largest Lyapunov exponent (LLE) of an N-particle self-gravitating ring model at equilibrium with respect to the number of particles and its dependence on energy. This model has a continuous phase-transition from a ferromagnetic to homogeneous phase, and we numerically confirm with large scale simulations the existence of a critical exponent associated to the LLE, although at variance with the theoretical estimate. The existence of strong chaos in the magnetized state evidenced by a positive Lyapunov exponent is explained by the coupling of individual particle oscillations to the diffusive motion of the center of mass of the system and also results in a change of the scaling of the LLE with the number of particles. We also discuss thoroughly for the model the validity and limits of the approximations made by a geometrical model for their analytic estimate.

A unified perspective on robot control - The energy Lyapunov function approach

NASA Technical Reports Server (NTRS)

Wen, John T.

1990-01-01

A unified framework for the stability analysis of robot tracking control is presented. By using an energy-motivated Lyapunov function candidate, the closed-loop stability is shown for a large family of control laws sharing a common structure of proportional and derivative feedback and a model-based feedforward. The feedforward can be zero, partial or complete linearized dynamics, partial or complete nonlinear dynamics, or linearized or nonlinear dynamics with parameter adaptation. As result, the dichotomous approaches to the robot control problem based on the open-loop linearization and nonlinear Lyapunov analysis are both included in this treatment. Furthermore, quantitative estimates of the trade-offs between different schemes in terms of the tracking performance, steady state error, domain of convergence, realtime computation load and required a prior model information are derived.

Computation of non-monotonic Lyapunov functions for continuous-time systems

NASA Astrophysics Data System (ADS)

Li, Huijuan; Liu, AnPing

2017-09-01

In this paper, we propose two methods to compute non-monotonic Lyapunov functions for continuous-time systems which are asymptotically stable. The first method is to solve a linear optimization problem on a compact and bounded set. The proposed linear programming based algorithm delivers a CPA1

Short paths in expander graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kleinberg, J.; Rubinfeld, R.

Graph expansion has proved to be a powerful general tool for analyzing the behavior of routing algorithms and the interconnection networks on which they run. We develop new routing algorithms and structural results for bounded-degree expander graphs. Our results are unified by the fact that they are all based upon, and extend, a body of work asserting that expanders are rich in short, disjoint paths. In particular, our work has consequences for the disjoint paths problem, multicommodify flow, and graph minor containment. We show: (i) A greedy algorithm for approximating the maximum disjoint paths problem achieves a polylogarithmic approximation ratiomore » in bounded-degree expanders. Although our algorithm is both deterministic and on-line, its performance guarantee is an improvement over previous bounds in expanders. (ii) For a multicommodily flow problem with arbitrary demands on a bounded-degree expander, there is a (1 + {epsilon})-optimal solution using only flow paths of polylogarithmic length. It follows that the multicommodity flow algorithm of Awerbuch and Leighton runs in nearly linear time per commodity in expanders. Our analysis is based on establishing the following: given edge weights on an expander G, one can increase some of the weights very slightly so the resulting shortest-path metric is smooth - the min-weight path between any pair of nodes uses a polylogarithmic number of edges. (iii) Every bounded-degree expander on n nodes contains every graph with O(n/log{sup O(1)} n) nodes and edges as a minor.« less

Driving many distant atoms into high-fidelity steady state entanglement via Lyapunov control.

PubMed

Li, Chuang; Song, Jie; Xia, Yan; Ding, Weiqiang

2018-01-22

Based on Lyapunov control theory in closed and open systems, we propose a scheme to generate W state of many distant atoms in the cavity-fiber-cavity system. In the closed system, the W state is generated successfully even when the coupling strength between the cavity and fiber is extremely weak. In the presence of atomic spontaneous emission or cavity and fiber decay, the photon-measurement and quantum feedback approaches are proposed to improve the fidelity, which enable efficient generation of high-fidelity W state in the case of large dissipation. Furthermore, the time-optimal Lyapunov control is investigated to shorten the evolution time and improve the fidelity in open systems.

Robust uniform persistence in discrete and continuous dynamical systems using Lyapunov exponents.

PubMed

Salceanu, Paul L

2011-07-01

This paper extends the work of Salceanu and Smith [12, 13] where Lyapunov exponents were used to obtain conditions for uniform persistence ina class of dissipative discrete-time dynamical systems on the positive orthant of R(m), generated by maps. Here a united approach is taken, for both discrete and continuous time, and the dissipativity assumption is relaxed. Sufficient conditions are given for compact subsets of an invariant part of the boundary of R(m+) to be robust uniform weak repellers. These conditions require Lyapunov exponents be positive on such sets. It is shown how this leads to robust uniform persistence. The results apply to the investigation of robust uniform persistence of the disease in host populations, as shown in an application.

Nonlinear stability in reaction-diffusion systems via optimal Lyapunov functions

NASA Astrophysics Data System (ADS)

Lombardo, S.; Mulone, G.; Trovato, M.

2008-06-01

We define optimal Lyapunov functions to study nonlinear stability of constant solutions to reaction-diffusion systems. A computable and finite radius of attraction for the initial data is obtained. Applications are given to the well-known Brusselator model and a three-species model for the spatial spread of rabies among foxes.

Stabilisation of discrete-time polynomial fuzzy systems via a polynomial lyapunov approach

NASA Astrophysics Data System (ADS)

Nasiri, Alireza; Nguang, Sing Kiong; Swain, Akshya; Almakhles, Dhafer

2018-02-01

This paper deals with the problem of designing a controller for a class of discrete-time nonlinear systems which is represented by discrete-time polynomial fuzzy model. Most of the existing control design methods for discrete-time fuzzy polynomial systems cannot guarantee their Lyapunov function to be a radially unbounded polynomial function, hence the global stability cannot be assured. The proposed control design in this paper guarantees a radially unbounded polynomial Lyapunov functions which ensures global stability. In the proposed design, state feedback structure is considered and non-convexity problem is solved by incorporating an integrator into the controller. Sufficient conditions of stability are derived in terms of polynomial matrix inequalities which are solved via SOSTOOLS in MATLAB. A numerical example is presented to illustrate the effectiveness of the proposed controller.

Estimation of spline function in nonparametric path analysis based on penalized weighted least square (PWLS)

NASA Astrophysics Data System (ADS)

Fernandes, Adji Achmad Rinaldo; Solimun, Arisoesilaningsih, Endang

2017-12-01

The aim of this research is to estimate the spline in Path Analysis-based on Nonparametric Regression using Penalized Weighted Least Square (PWLS) approach. Approach used is Reproducing Kernel Hilbert Space at sobolev space. Nonparametric path analysis model on the equation y1 i=f1.1(x1 i)+ε1 i; y2 i=f1.2(x1 i)+f2.2(y1 i)+ε2 i; i =1 ,2 ,…,n Nonparametric Path Analysis which meet the criteria of minimizing PWLS min fw .k∈W2m[aw .k,bw .k], k =1 ,2 { (2n ) -1(y˜-f ˜ ) TΣ-1(y ˜-f ˜ ) + ∑k =1 2 ∑w =1 2 λw .k ∫aw .k bw .k [fw.k (m )(xi) ] 2d xi } is f ˜^=Ay ˜ with A=T1(T1TU1-1∑-1T1)-1T1TU1-1∑-1+V1U1-1∑-1[I-T1(T1TU1-1∑-1T1)-1T1TU1-1∑-1] columnalign="left">+T2(T2TU2-1∑-1T2)-1T2TU2-1∑-1+V2U2-1∑-1[I1-T2(T2TU2-1∑-1T2) -1T2TU2-1∑-1

Lyapunov stability analysis for the generalized Kapitza pendulum

NASA Astrophysics Data System (ADS)

Druzhinina, O. V.; Sevastianov, L. A.; Vasilyev, S. A.; Vasilyeva, D. G.

2017-12-01

In this work generalization of Kapitza pendulum whose suspension point moves in the vertical and horizontal planes is made. Lyapunov stability analysis of the motion for this pendulum subjected to excitation of periodic driving forces and stochastic driving forces that act in the vertical and horizontal planes has been studied. The numerical study of the random motion for generalized Kapitza pendulum under stochastic driving forces has made. It is shown the existence of stable quasi-periodic motion for this pendulum.

Lyapunov exponents for infinite dimensional dynamical systems

NASA Technical Reports Server (NTRS)

Mhuiris, Nessan Mac Giolla

1987-01-01

Classically it was held that solutions to deterministic partial differential equations (i.e., ones with smooth coefficients and boundary data) could become random only through one mechanism, namely by the activation of more and more of the infinite number of degrees of freedom that are available to such a system. It is only recently that researchers have come to suspect that many infinite dimensional nonlinear systems may in fact possess finite dimensional chaotic attractors. Lyapunov exponents provide a tool for probing the nature of these attractors. This paper examines how these exponents might be measured for infinite dimensional systems.

State feedback integral control for a rotary direct drive servo valve using a Lyapunov function approach.

PubMed

Yu, Jue; Zhuang, Jian; Yu, Dehong

2015-01-01

This paper concerns a state feedback integral control using a Lyapunov function approach for a rotary direct drive servo valve (RDDV) while considering parameter uncertainties. Modeling of this RDDV servovalve reveals that its mechanical performance is deeply influenced by friction torques and flow torques; however, these torques are uncertain and mutable due to the nature of fluid flow. To eliminate load resistance and to achieve satisfactory position responses, this paper develops a state feedback control that integrates an integral action and a Lyapunov function. The integral action is introduced to address the nonzero steady-state error; in particular, the Lyapunov function is employed to improve control robustness by adjusting the varying parameters within their value ranges. This new controller also has the advantages of simple structure and ease of implementation. Simulation and experimental results demonstrate that the proposed controller can achieve higher control accuracy and stronger robustness. Copyright © 2014 ISA. Published by Elsevier Ltd. All rights reserved.

Study of Double-Weighted Graph Model and Optimal Path Planning for Tourist Scenic Area Oriented Intelligent Tour Guide

NASA Astrophysics Data System (ADS)

Shi, Y.; Long, Y.; Wi, X. L.

2014-04-01

When tourists visiting multiple tourist scenic spots, the travel line is usually the most effective road network according to the actual tour process, and maybe the travel line is different from planned travel line. For in the field of navigation, a proposed travel line is normally generated automatically by path planning algorithm, considering the scenic spots' positions and road networks. But when a scenic spot have a certain area and have multiple entrances or exits, the traditional described mechanism of single point coordinates is difficult to reflect these own structural features. In order to solve this problem, this paper focuses on the influence on the process of path planning caused by scenic spots' own structural features such as multiple entrances or exits, and then proposes a doubleweighted Graph Model, for the weight of both vertexes and edges of proposed Model can be selected dynamically. And then discusses the model building method, and the optimal path planning algorithm based on Dijkstra algorithm and Prim algorithm. Experimental results show that the optimal planned travel line derived from the proposed model and algorithm is more reasonable, and the travelling order and distance would be further optimized.

Exploring the Lyapunov instability properties of high-dimensional atmospheric and climate models

NASA Astrophysics Data System (ADS)

De Cruz, Lesley; Schubert, Sebastian; Demaeyer, Jonathan; Lucarini, Valerio; Vannitsem, Stéphane

2018-05-01

The stability properties of intermediate-order climate models are investigated by computing their Lyapunov exponents (LEs). The two models considered are PUMA (Portable University Model of the Atmosphere), a primitive-equation simple general circulation model, and MAOOAM (Modular Arbitrary-Order Ocean-Atmosphere Model), a quasi-geostrophic coupled ocean-atmosphere model on a β-plane. We wish to investigate the effect of the different levels of filtering on the instabilities and dynamics of the atmospheric flows. Moreover, we assess the impact of the oceanic coupling, the dissipation scheme, and the resolution on the spectra of LEs. The PUMA Lyapunov spectrum is computed for two different values of the meridional temperature gradient defining the Newtonian forcing to the temperature field. The increase in the gradient gives rise to a higher baroclinicity and stronger instabilities, corresponding to a larger dimension of the unstable manifold and a larger first LE. The Kaplan-Yorke dimension of the attractor increases as well. The convergence rate of the rate function for the large deviation law of the finite-time Lyapunov exponents (FTLEs) is fast for all exponents, which can be interpreted as resulting from the absence of a clear-cut atmospheric timescale separation in such a model. The MAOOAM spectra show that the dominant atmospheric instability is correctly represented even at low resolutions. However, the dynamics of the central manifold, which is mostly associated with the ocean dynamics, is not fully resolved because of its associated long timescales, even at intermediate orders. As expected, increasing the mechanical atmosphere-ocean coupling coefficient or introducing a turbulent diffusion parametrisation reduces the Kaplan-Yorke dimension and Kolmogorov-Sinai entropy. In all considered configurations, we are not yet in the regime in which one can robustly define large deviation laws describing the

Spectrum of Lyapunov exponents of non-smooth dynamical systems of integrate-and-fire type.

PubMed

Zhou, Douglas; Sun, Yi; Rangan, Aaditya V; Cai, David

2010-04-01

We discuss how to characterize long-time dynamics of non-smooth dynamical systems, such as integrate-and-fire (I&F) like neuronal network, using Lyapunov exponents and present a stable numerical method for the accurate evaluation of the spectrum of Lyapunov exponents for this large class of dynamics. These dynamics contain (i) jump conditions as in the firing-reset dynamics and (ii) degeneracy such as in the refractory period in which voltage-like variables of the network collapse to a single constant value. Using the networks of linear I&F neurons, exponential I&F neurons, and I&F neurons with adaptive threshold, we illustrate our method and discuss the rich dynamics of these networks.

No ISCOs in Charged Myers Perry Spacetimes by Measuring Lyapunov Exponent

NASA Astrophysics Data System (ADS)

Pradhan, Parthapratim

2015-01-01

By computing coordinate time Lyapunov exponent, we prove that for more than four spacetime dimensions (N ≥ 3), there are no Innermost Stable Circular Orbit (ISCO) in charged Myers Perry blackhole spacetime.Using it, we show that the instability of equatorial circular geodesics, both massive and massless particles for such types of blackhole space-times.

A Lyapunov-based Approach for Time-Coordinated 3D Path-Following of Multiple Quadrotors in SO(3)

DTIC Science & Technology

2012-12-10

January 2006. [22] T. Lee, “ Robust adaptive geometric tracking controls on so(3) with an application to the attitude dynamicsof a quadrotor uav,” 2011...in the presence of time-varying communication networks and spatial and temporal constraints. The objective is to enable n Quadrotors to track prede?ned...developing control laws to solve the Time-Coordinated 3D Path-Following task for multiple Quadrotor UAVs in the presence of time-varying communication

Passivity/Lyapunov based controller design for trajectory tracking of flexible joint manipulators

NASA Technical Reports Server (NTRS)

Sicard, Pierre; Wen, John T.; Lanari, Leonardo

1992-01-01

A passivity and Lyapunov based approach for the control design for the trajectory tracking problem of flexible joint robots is presented. The basic structure of the proposed controller is the sum of a model-based feedforward and a model-independent feedback. Feedforward selection and solution is analyzed for a general model for flexible joints, and for more specific and practical model structures. Passivity theory is used to design a motor state-based controller in order to input-output stabilize the error system formed by the feedforward. Observability conditions for asymptotic stability are stated and verified. In order to accommodate for modeling uncertainties and to allow for the implementation of a simplified feedforward compensation, the stability of the system is analyzed in presence of approximations in the feedforward by using a Lyapunov based robustness analysis. It is shown that under certain conditions, e.g., the desired trajectory is varying slowly enough, stability is maintained for various approximations of a canonical feedforward.

Riemannian theory of Hamiltonian chaos and Lyapunov exponents

NASA Astrophysics Data System (ADS)

Casetti, Lapo; Clementi, Cecilia; Pettini, Marco

1996-12-01

A nonvanishing Lyapunov exponent λ1 provides the very definition of deterministic chaos in the solutions of a dynamical system; however, no theoretical mean of predicting its value exists. This paper copes with the problem of analytically computing the largest Lyapunov exponent λ1 for many degrees of freedom Hamiltonian systems as a function of ɛ=E/N, the energy per degree of freedom. The functional dependence λ1(ɛ) is of great interest because, among other reasons, it detects the existence of weakly and strongly chaotic regimes. This aim, the analytic computation of λ1(ɛ), is successfully reached within a theoretical framework that makes use of a geometrization of Newtonian dynamics in the language of Riemannian differential geometry. An alternative point of view about the origin of chaos in these systems is obtained independently of the standard explanation based on homoclinic intersections. Dynamical instability (chaos) is here related to curvature fluctuations of the manifolds whose geodesics are natural motions and is described by means of the Jacobi-Levi-Civita equation (JLCE) for geodesic spread. In this paper it is shown how to derive from the JLCE an effective stability equation. Under general conditions, this effective equation formally describes a stochastic oscillator; an analytic formula for the instability growth rate of its solutions is worked out and applied to the Fermi-Pasta-Ulam β model and to a chain of coupled rotators. Excellent agreement is found between the theoretical prediction and numeric values of λ1(ɛ) for both models.

A semi-analytical method for the computation of the Lyapunov exponents of fractional-order systems

NASA Astrophysics Data System (ADS)

Caponetto, Riccardo; Fazzino, Stefano

2013-01-01

Fractional-order differential equations are interesting for their applications in the construction of mathematical models in finance, materials science or diffusion. In this paper, an application of a well known transformation technique, Differential Transform Method (DTM), to the area of fractional differential equation is employed for calculating Lyapunov exponents of fractional order systems. It is known that the Lyapunov exponents, first introduced by Oseledec, play a crucial role in characterizing the behaviour of dynamical systems. They can be used to analyze the sensitive dependence on initial conditions and the presence of chaotic attractors. The results reveal that the proposed method is very effective and simple and leads to accurate, approximately convergent solutions.

Neighborhood Social Predictors of Weight-related Measures in Underserved African Americans in the PATH Trial.

PubMed

McDaniel, Tyler C; Wilson, Dawn K; Coulon, Sandra M; Hand, Gregory A; Siceloff, E Rebekah

2015-11-05

African Americans have the highest rate of obesity in the United States relative to other ethnic minority groups. Bioecological factors including neighborhood social and physical environmental variables may be important predictors of weight-related measures specifically body mass index (BMI) in African American adults. Baseline data from the Positive Action for Today's Health (PATH) trial were collected from 417 African American adults. Overall a multiple regression model for BMI was significant, showing positive associations with average daily moderate-to-vigorous physical activity (MVPA) (B =-.21, P<.01) and neighborhood social interaction (B =-.13, P<.01). Consistent with previous literature, results show that neighborhood social interaction was associated with healthier BMI, highlighting it as a potential critical factor for future interventions in underserved, African American communities.

Evaluation of nonlinear properties of epileptic activity using largest Lyapunov exponent

NASA Astrophysics Data System (ADS)

Medvedeva, Tatiana M.; Lüttjohann, Annika; van Luijtelaar, Gilles; Sysoev, Ilya V.

2016-04-01

Absence seizures are known to be highly non-linear large amplitude oscillations with a well pronounced main time scale. Whilst the appearance of the main frequency is usually considered as a transition from noisy complex dynamics of baseline EEG to more regular absence activity, the dynamical properties of this type of epileptiformic activity in genetic absence models was not studied precisely. Here, the estimation of the largest Lyapunov exponent from intracranial EEGs of 10 WAG/Rij rats (genetic model of absence epilepsy) was performed. Fragments of 10 seizures and 10 episodes of on-going EEG each of 4 s length were used for each animal, 3 cortical and 2 thalamic channels were analysed. The method adapted for short noisy data was implemented. The positive values of the largest Lyapunov exponent were found as for baseline as for spike wave discharges (SWDs), with values for SWDs being significantly less than for on-going activity. Current findings may indicate that SWD is a chaotic process with a well pronounced main timescale rather than a periodic regime. Also, the absence activity was shown to be less chaotic than the baseline one.

Lyapunov stability and its application to systems of ordinary differential equations

NASA Technical Reports Server (NTRS)

Kennedy, E. W.

1979-01-01

An outline and a brief introduction to some of the concepts and implications of Lyapunov stability theory are presented. Various aspects of the theory are illustrated by the inclusion of eight examples, including the Cartesian coordinate equations of the two-body problem, linear and nonlinear (Van der Pol's equation) oscillatory systems, and the linearized Kustaanheimo-Stiefel element equations for the unperturbed two-body problem.

Computation of the spectrum of spatial Lyapunov exponents for the spatially extended beam-plasma systems and electron-wave devices

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hramov, Alexander E.; Saratov State Technical University, Politechnicheskaja str., 77, Saratov 410054; Koronovskii, Alexey A.

2012-08-15

The spectrum of Lyapunov exponents is powerful tool for the analysis of the complex system dynamics. In the general framework of nonlinear dynamics, a number of the numerical techniques have been developed to obtain the spectrum of Lyapunov exponents for the complex temporal behavior of the systems with a few degree of freedom. Unfortunately, these methods cannot be applied directly to analysis of complex spatio-temporal dynamics of plasma devices which are characterized by the infinite phase space, since they are the spatially extended active media. In the present paper, we propose the method for the calculation of the spectrum ofmore » the spatial Lyapunov exponents (SLEs) for the spatially extended beam-plasma systems. The calculation technique is applied to the analysis of chaotic spatio-temporal oscillations in three different beam-plasma model: (1) simple plasma Pierce diode, (2) coupled Pierce diodes, and (3) electron-wave system with backward electromagnetic wave. We find an excellent agreement between the system dynamics and the behavior of the spectrum of the spatial Lyapunov exponents. Along with the proposed method, the possible problems of SLEs calculation are also discussed. It is shown that for the wide class of the spatially extended systems, the set of quantities included in the system state for SLEs calculation can be reduced using the appropriate feature of the plasma systems.« less

Comparison of classical reaction paths and tunneling paths studied with the semiclassical instanton theory.

PubMed

Meisner, Jan; Markmeyer, Max N; Bohner, Matthias U; Kästner, Johannes

2017-08-30

Atom tunneling in the hydrogen atom transfer reaction of the 2,4,6-tri-tert-butylphenyl radical to 3,5-di-tert-butylneophyl, which has a short but strongly curved reaction path, was investigated using instanton theory. We found the tunneling path to deviate qualitatively from the classical intrinsic reaction coordinate, the steepest-descent path in mass-weighted Cartesian coordinates. To perform that comparison, we implemented a new variant of the predictor-corrector algorithm for the calculation of the intrinsic reaction coordinate. We used the reaction force analysis method as a means to decompose the reaction barrier into structural and electronic components. Due to the narrow energy barrier, atom tunneling is important in the abovementioned reaction, even above room temperature. Our calculated rate constants between 350 K and 100 K agree well with experimental values. We found a H/D kinetic isotope effect of almost 10 6 at 100 K. Tunneling dominates the protium transfer below 400 K and the deuterium transfer below 300 K. We compared the lengths of the tunneling path and the classical path for the hydrogen atom transfer in the reaction HCl + Cl and quantified the corner cutting in this reaction. At low temperature, the tunneling path is about 40% shorter than the classical path.

Multiple-path model of spectral reflectance of a dyed fabric.

PubMed

Rogers, Geoffrey; Dalloz, Nicolas; Fournel, Thierry; Hebert, Mathieu

2017-05-01

Experimental results are presented of the spectral reflectance of a dyed fabric as analyzed by a multiple-path model of reflection. The multiple-path model provides simple analytic expressions for reflection and transmission of turbid media by applying the Beer-Lambert law to each path through the medium and summing over all paths, each path weighted by its probability. The path-length probability is determined by a random-walk analysis. The experimental results presented here show excellent agreement with predictions made by the model.

Conditional Lyapunov exponents and transfer entropy in coupled bursting neurons under excitation and coupling mismatch

NASA Astrophysics Data System (ADS)

Soriano, Diogo C.; Santos, Odair V. dos; Suyama, Ricardo; Fazanaro, Filipe I.; Attux, Romis

2018-03-01

This work has a twofold aim: (a) to analyze an alternative approach for computing the conditional Lyapunov exponent (λcmax) aiming to evaluate the synchronization stability between nonlinear oscillators without solving the classical variational equations for the synchronization error dynamical system. In this first framework, an analytic reference value for λcmax is also provided in the context of Duffing master-slave scenario and precisely evaluated by the proposed numerical approach; (b) to apply this technique to the study of synchronization stability in chaotic Hindmarsh-Rose (HR) neuronal models under uni- and bi-directional resistive coupling and different excitation bias, which also considered the root mean square synchronization error, information theoretic measures and asymmetric transfer entropy in order to offer a better insight of the synchronization phenomenon. In particular, statistical and information theoretical measures were able to capture similarity increase between the neuronal oscillators just after a critical coupling value in accordance to the largest conditional Lyapunov exponent behavior. On the other hand, transfer entropy was able to detect neuronal emitter influence even in a weak coupling condition, i.e. under the increase of conditional Lyapunov exponent and apparently desynchronization tendency. In the performed set of numerical simulations, the synchronization measures were also evaluated for a two-dimensional parameter space defined by the neuronal coupling (emitter to a receiver neuron) and the (receiver) excitation current. Such analysis is repeated for different feedback couplings as well for different (emitter) excitation currents, revealing interesting characteristics of the attained synchronization region and conditions that facilitate the emergence of the synchronous behavior. These results provide a more detailed numerical insight of the underlying behavior of a HR in the excitation and coupling space, being in accordance

Graphs and matroids weighted in a bounded incline algebra.

PubMed

Lu, Ling-Xia; Zhang, Bei

2014-01-01

Firstly, for a graph weighted in a bounded incline algebra (or called a dioid), a longest path problem (LPP, for short) is presented, which can be considered the uniform approach to the famous shortest path problem, the widest path problem, and the most reliable path problem. The solutions for LPP and related algorithms are given. Secondly, for a matroid weighted in a linear matroid, the maximum independent set problem is studied.

Flight-Path Characteristics for Decelerating From Supercircular Speed

NASA Technical Reports Server (NTRS)

Luidens, Roger W.

1961-01-01

Characteristics of the following six flight paths for decelerating from a supercircular speed are developed in closed form: constant angle of attack, constant net acceleration, constant altitude" constant free-stream Reynolds number, and "modulated roll." The vehicles were required to remain in or near the atmosphere, and to stay within the aerodynamic capabilities of a vehicle with a maximum lift-drag ratio of 1.0 and within a maximum net acceleration G of 10 g's. The local Reynolds number for all the flight paths for a vehicle with a gross weight of 10,000 pounds and a 600 swept wing was found to be about 0.7 x 10(exp 6). With the assumption of a laminar boundary layer, the heating of the vehicle is studied as a function of type of flight path, initial G load, and initial velocity. The following heating parameters were considered: the distribution of the heating rate over the vehicle, the distribution of the heat per square foot over the vehicle, and the total heat input to the vehicle. The constant G load path at limiting G was found to give the lowest total heat input for a given initial velocity. For a vehicle with a maximum lift-drag ratio of 1.0 and a flight path with a maximum G of 10 g's, entry velocities of twice circular appear thermo- dynamically feasible, and entries at velocities of 2.8 times circular are aerodynamically possible. The predominant heating (about 85 percent) occurs at the leading edge of the vehicle. The total ablated weight for a 10,000-pound-gross-weight vehicle decelerating from an initial velocity of twice circular velocity is estimated to be 5 percent of gross weight. Modifying the constant G load flight path by a constant-angle-of-attack segment through a flight- to circular-velocity ratio of 1.0 gives essentially a "point landing" capability but also results in an increased total heat input to the vehicle.

Lyapunov Orbits in the Jupiter System Using Electrodynamic Tethers

NASA Technical Reports Server (NTRS)

Bokelmann, Kevin; Russell, Ryan P.; Lantoine, Gregory

2013-01-01

Various researchers have proposed the use of electrodynamic tethers for power generation and capture from interplanetary transfers. The effect of tether forces on periodic orbits in Jupiter-satellite systems are investigated. A perturbation force is added to the restricted three-body problem model and a series of simplifications allows development of a conservative system that retains the Jacobi integral. Expressions are developed to find modified locations of equilibrium positions. Modified families of Lyapunov orbits are generated as functions of tether size and Jacobi integral. Zero velocity curves and stability analyses are used to evaluate the dynamical properties of tether-modified orbits.

Differential-Evolution Control Parameter Optimization for Unmanned Aerial Vehicle Path Planning

PubMed Central

Kok, Kai Yit; Rajendran, Parvathy

2016-01-01

The differential evolution algorithm has been widely applied on unmanned aerial vehicle (UAV) path planning. At present, four random tuning parameters exist for differential evolution algorithm, namely, population size, differential weight, crossover, and generation number. These tuning parameters are required, together with user setting on path and computational cost weightage. However, the optimum settings of these tuning parameters vary according to application. Instead of trial and error, this paper presents an optimization method of differential evolution algorithm for tuning the parameters of UAV path planning. The parameters that this research focuses on are population size, differential weight, crossover, and generation number. The developed algorithm enables the user to simply define the weightage desired between the path and computational cost to converge with the minimum generation required based on user requirement. In conclusion, the proposed optimization of tuning parameters in differential evolution algorithm for UAV path planning expedites and improves the final output path and computational cost. PMID:26943630

On the approximation of Lyapunov exponents and a question suggested by Anatole Katok

NASA Astrophysics Data System (ADS)

Dai, Xiongping

2010-03-01

Let \\mathcal {F}\\colon X\\times\\mathbb{Z}_+\\rightarrow \\rm{GL}(n,\\mathbb{R}) be a Hölder-continuous linear cocycle whose driving semiflow f\\colon X\\times\\mathbb{Z}_+\\rightarrow X preserves a probability μ on a compact metric space X. Using the concept of two-sided quasi-Pesin orbits introduced in this paper, we show that the Lyapunov characteristic spectrum of μ can be approached arbitrarily by that of periodic points of f. So, if all periodic points of f have only positive Lyapunov exponents and such exponents are uniformly bounded away from zero, then μ also has only positive exponents. In our arguments, the exponential closing property of the driving semiflow is a basic condition, and it is easy to check that every C1-expanding map of a closed manifold obeys this closing property. Consequently, if f is a C1+Hölder local diffeomorphism of a closed manifold and if it is Hölder conjugated to some C1-expanding map, then f is itself expanding. This gives a positive answer to a question suggested by Anatole Katok.

Spatio-temporal evolution of perturbations in ensembles initialized by bred, Lyapunov and singular vectors

NASA Astrophysics Data System (ADS)

Pazó, Diego; Rodríguez, Miguel A.; López, Juan M.

2010-01-01

We study the evolution of finite perturbations in the Lorenz `96 model, a meteorological toy model of the atmosphere. The initial perturbations are chosen to be aligned along different dynamic vectors: bred, Lyapunov, and singular vectors. Using a particular vector determines not only the amplification rate of the perturbation but also the spatial structure of the perturbation and its stability under the evolution of the flow. The evolution of perturbations is systematically studied by means of the so-called mean-variance of logarithms diagram that provides in a very compact way the basic information to analyse the spatial structure. We discuss the corresponding advantages of using those different vectors for preparing initial perturbations to be used in ensemble prediction systems, focusing on key properties: dynamic adaptation to the flow, robustness, equivalence between members of the ensemble, etc. Among all the vectors considered here, the so-called characteristic Lyapunov vectors are possibly optimal, in the sense that they are both perfectly adapted to the flow and extremely robust.

Chaotic itinerancy in the oscillator neural network without Lyapunov functions.

PubMed

Uchiyama, Satoki; Fujisaka, Hirokazu

2004-09-01

Chaotic itinerancy (CI), which is defined as an incessant spontaneous switching phenomenon among attractor ruins in deterministic dynamical systems without Lyapunov functions, is numerically studied in the case of an oscillator neural network model. The model is the pseudoinverse-matrix version of the previous model [S. Uchiyama and H. Fujisaka, Phys. Rev. E 65, 061912 (2002)] that was studied theoretically with the aid of statistical neurodynamics. It is found that CI in neural nets can be understood as the intermittent dynamics of weakly destabilized chaotic retrieval solutions. Copyright 2004 American Institute of Physics

Are Bred Vectors The Same As Lyapunov Vectors?

NASA Astrophysics Data System (ADS)

Kalnay, E.; Corazza, M.; Cai, M.

Regional loss of predictability is an indication of the instability of the underlying flow, where small errors in the initial conditions (or imperfections in the model) grow to large amplitudes in finite times. The stability properties of evolving flows have been studied using Lyapunov vectors (e.g., Alligood et al, 1996, Ott, 1993, Kalnay, 2002), singular vectors (e.g., Lorenz, 1965, Farrell, 1988, Molteni and Palmer, 1993), and, more recently, with bred vectors (e.g., Szunyogh et al, 1997, Cai et al, 2001). Bred vectors (BVs) are, by construction, closely related to Lyapunov vectors (LVs). In fact, after an infinitely long breeding time, and with the use of infinitesimal ampli- tudes, bred vectors are identical to leading Lyapunov vectors. In practical applications, however, bred vectors are different from Lyapunov vectors in two important ways: a) bred vectors are never globally orthogonalized and are intrinsically local in space and time, and b) they are finite-amplitude, finite-time vectors. These two differences are very significant in a dynamical system whose size is very large. For example, the at- mosphere is large enough to have "room" for several synoptic scale instabilities (e.g., storms) to develop independently in different regions (say, North America and Aus- tralia), and it is complex enough to have several different possible types of instabilities (such as barotropic, baroclinic, convective, and even Brownian motion). Bred vectors share some of their properties with leading LVs (Corazza et al, 2001a, 2001b, Toth and Kalnay, 1993, 1997, Cai et al, 2001). For example, 1) Bred vectors are independent of the norm used to define the size of the perturba- tion. Corazza et al. (2001) showed that bred vectors obtained using a potential enstro- phy norm were indistinguishable from bred vectors obtained using a streamfunction squared norm, in contrast with singular vectors. 2) Bred vectors are independent of the length of the rescaling period as long as the

Dwell time-based stabilisation of switched delay systems using free-weighting matrices

NASA Astrophysics Data System (ADS)

Koru, Ahmet Taha; Delibaşı, Akın; Özbay, Hitay

2018-01-01

In this paper, we present a quasi-convex optimisation method to minimise an upper bound of the dwell time for stability of switched delay systems. Piecewise Lyapunov-Krasovskii functionals are introduced and the upper bound for the derivative of Lyapunov functionals is estimated by free-weighting matrices method to investigate non-switching stability of each candidate subsystems. Then, a sufficient condition for the dwell time is derived to guarantee the asymptotic stability of the switched delay system. Once these conditions are represented by a set of linear matrix inequalities , dwell time optimisation problem can be formulated as a standard quasi-convex optimisation problem. Numerical examples are given to illustrate the improvements over previously obtained dwell time bounds. Using the results obtained in the stability case, we present a nonlinear minimisation algorithm to synthesise the dwell time minimiser controllers. The algorithm solves the problem with successive linearisation of nonlinear conditions.

Stabilisation of perturbed chains of integrators using Lyapunov-based homogeneous controllers

NASA Astrophysics Data System (ADS)

Harmouche, Mohamed; Laghrouche, Salah; Chitour, Yacine; Hamerlain, Mustapha

2017-12-01

In this paper, we present a Lyapunov-based homogeneous controller for the stabilisation of a perturbed chain of integrators of arbitrary order r ≥ 1. The proposed controller is based on homogeneous controller for stabilisation of pure chain of integrators. The control of homogeneity degree is also introduced and various controllers are designed using this concept, namely a bounded-controller with minimum amplitude of discontinuous control and a controller with globally fixed-time convergence. The performance of the controller is validated through simulations.

Lyapunov spectrum of the separated flow around the NACA 0012 airfoil and its dependence on numerical discretization

NASA Astrophysics Data System (ADS)

Fernandez, P.; Wang, Q.

2017-12-01

We investigate the impact of numerical discretization on the Lyapunov spectrum of separated flow simulations. The two-dimensional chaotic flow around the NACA 0012 airfoil at a low Reynolds number and large angle of attack is considered to that end. Time, space and accuracy-order refinement studies are performed to examine each of these effects separately. Numerical results show that the time discretization has a small impact on the dynamics of the system, whereas the spatial discretization can dramatically change them. Also, the finite-time Lyapunov exponents associated to unstable modes are shown to be positively skewed, and quasi-homoclinic tangencies are observed in the attractor of the system. The implications of these results on flow physics and sensitivity analysis of chaotic flows are discussed.

Automated path planning of the Payload Inspection and Processing System

NASA Technical Reports Server (NTRS)

Byers, Robert M.

1994-01-01

The Payload Changeout Room Inspection and Processing System (PIPS) is a highly redundant manipulator intended for performing tasks in the crowded and sensitive environment of the Space Shuttle Orbiter payload bay. Its dexterity will be exploited to maneuver the end effector in a workspace populated with obstacles. A method is described by which the end effector of a highly redundant manipulator is directed toward a target via a Lyapunov stability function. A cost function is constructed which represents the distance from the manipulator links to obstacles. Obstacles are avoided by causing the vector of joint parameters to move orthogonally to the gradient of the workspace cost function. A C language program implements the algorithm to generate a joint history. The resulting motion is graphically displayed using the Interactive Graphical Robot Instruction Program (IGRIP) produced by Deneb Robotics. The graphical simulation has the potential to be a useful tool in path planning for the PIPS in the Shuttle Payload Bay environment.

Continuation of probability density functions using a generalized Lyapunov approach

DOE Office of Scientific and Technical Information (OSTI.GOV)

Baars, S., E-mail: s.baars@rug.nl; Viebahn, J.P., E-mail: viebahn@cwi.nl; Mulder, T.E., E-mail: t.e.mulder@uu.nl

Techniques from numerical bifurcation theory are very useful to study transitions between steady fluid flow patterns and the instabilities involved. Here, we provide computational methodology to use parameter continuation in determining probability density functions of systems of stochastic partial differential equations near fixed points, under a small noise approximation. Key innovation is the efficient solution of a generalized Lyapunov equation using an iterative method involving low-rank approximations. We apply and illustrate the capabilities of the method using a problem in physical oceanography, i.e. the occurrence of multiple steady states of the Atlantic Ocean circulation.

Lyapunov exponents and phase diagrams reveal multi-factorial control over TRAIL-induced apoptosis

PubMed Central

Aldridge, Bree B; Gaudet, Suzanne; Lauffenburger, Douglas A; Sorger, Peter K

2011-01-01

Receptor-mediated apoptosis proceeds via two pathways: one requiring only a cascade of initiator and effector caspases (type I behavior) and the second requiring an initiator–effector caspase cascade and mitochondrial outer membrane permeabilization (type II behavior). Here, we investigate factors controlling type I versus II phenotypes by performing Lyapunov exponent analysis of an ODE-based model of cell death. The resulting phase diagrams predict that the ratio of XIAP to pro-caspase-3 concentrations plays a key regulatory role: type I behavior predominates when the ratio is low and type II behavior when the ratio is high. Cell-to-cell variability in phenotype is observed when the ratio is close to the type I versus II boundary. By positioning multiple tumor cell lines on the phase diagram we confirm these predictions. We also extend phase space analysis to mutations affecting the rate of caspase-3 ubiquitylation by XIAP, predicting and showing that such mutations abolish all-or-none control over activation of effector caspases. Thus, phase diagrams derived from Lyapunov exponent analysis represent a means to study multi-factorial control over a complex biochemical pathway. PMID:22108795

Lyapunov-Based Sensor Failure Detection And Recovery For The Reverse Water Gas Shift Process

NASA Technical Reports Server (NTRS)

Haralambous, Michael G.

2001-01-01

Livingstone, a model-based AI software system, is planned for use in the autonomous fault diagnosis, reconfiguration, and control of the oxygen-producing reverse water gas shift (RWGS) process test-bed located in the Applied Chemistry Laboratory at KSC. In this report the RWGS process is first briefly described and an overview of Livingstone is given. Next, a Lyapunov-based approach for detecting and recovering from sensor failures, differing significantly from that used by Livingstone, is presented. In this new method, models used are in terms of the defining differential equations of system components, thus differing from the qualitative, static models used by Livingstone. An easily computed scalar inequality constraint, expressed in terms of sensed system variables, is used to determine the existence of sensor failures. In the event of sensor failure, an observer/estimator is used for determining which sensors have failed. The theory underlying the new approach is developed. Finally, a recommendation is made to use the Lyapunov-based approach to complement the capability of Livingstone and to use this combination in the RWGS process.

LYAPUNOV-Based Sensor Failure Detection and Recovery for the Reverse Water Gas Shift Process

NASA Technical Reports Server (NTRS)

Haralambous, Michael G.

2002-01-01

Livingstone, a model-based AI software system, is planned for use in the autonomous fault diagnosis, reconfiguration, and control of the oxygen-producing reverse water gas shift (RWGS) process test-bed located in the Applied Chemistry Laboratory at KSC. In this report the RWGS process is first briefly described and an overview of Livingstone is given. Next, a Lyapunov-based approach for detecting and recovering from sensor failures, differing significantly from that used by Livingstone, is presented. In this new method, models used are in t e m of the defining differential equations of system components, thus differing from the qualitative, static models used by Livingstone. An easily computed scalar inequality constraint, expressed in terms of sensed system variables, is used to determine the existence of sensor failures. In the event of sensor failure, an observer/estimator is used for determining which sensors have failed. The theory underlying the new approach is developed. Finally, a recommendation is made to use the Lyapunov-based approach to complement the capability of Livingstone and to use this combination in the RWGS process.

Spatio-temporal evolution of perturbations in ensembles initialized by bred, Lyapunov and singular vectors

NASA Astrophysics Data System (ADS)

Pazó, Diego; Rodríguez, Miguel A.; López, Juan M.

2010-05-01

We study the evolution of finite perturbations in the Lorenz ‘96 model, a meteorological toy model of the atmosphere. The initial perturbations are chosen to be aligned along different dynamic vectors: bred, Lyapunov, and singular vectors. Using a particular vector determines not only the amplification rate of the perturbation but also the spatial structure of the perturbation and its stability under the evolution of the flow. The evolution of perturbations is systematically studied by means of the so-called mean-variance of logarithms diagram that provides in a very compact way the basic information to analyse the spatial structure. We discuss the corresponding advantages of using those different vectors for preparing initial perturbations to be used in ensemble prediction systems, focusing on key properties: dynamic adaptation to the flow, robustness, equivalence between members of the ensemble, etc. Among all the vectors considered here, the so-called characteristic Lyapunov vectors are possibly optimal, in the sense that they are both perfectly adapted to the flow and extremely robust.

Lagrangian Coherent Structures, Hyperbolicity, and Lyapunov Exponents

NASA Astrophysics Data System (ADS)

Haller, George

2010-05-01

We review the fundamental physical motivation behind the definition of Lagrangian Coherent Structures (LCS) and show how it leads to the concept of finite-time hyperbolicity in non-autonomous dynamical systems. Using this concept of hyperbolicity, we obtain a self-consistent criterion for the existence of attracting and repelling material surfaces in unsteady fluid flows, such as those in the atmosphere and the ocean. The existence of LCS is often postulated in terms of features of the Finite-Time Lyapunov Exponent (FTLE) field associated with the system. As simple examples show, however, the FTLE field does not necessarily highlight LCS, or may ighlight structures that are not LCS. Under appropriate nondegeneracy conditions, we show that ridges of the FTLE field indeed coincide with LCS in volume-preserving flows. For general flows, we obtain a more general scalar field whose ridges correspond to LCS. We finally review recent applications of LCS techniques to flight safety analysis at Hong Kong International Airport.

Lyapunov exponents from CHUA's circuit time series using artificial neural networks

NASA Technical Reports Server (NTRS)

Gonzalez, J. Jesus; Espinosa, Ismael E.; Fuentes, Alberto M.

1995-01-01

In this paper we present the general problem of identifying if a nonlinear dynamic system has a chaotic behavior. If the answer is positive the system will be sensitive to small perturbations in the initial conditions which will imply that there is a chaotic attractor in its state space. A particular problem would be that of identifying a chaotic oscillator. We present an example of three well known different chaotic oscillators where we have knowledge of the equations that govern the dynamical systems and from there we can obtain the corresponding time series. In a similar example we assume that we only know the time series and, finally, in another example we have to take measurements in the Chua's circuit to obtain sample points of the time series. With the knowledge about the time series the phase plane portraits are plotted and from them, by visual inspection, it is concluded whether or not the system is chaotic. This method has the problem of uncertainty and subjectivity and for that reason a different approach is needed. A quantitative approach is the computation of the Lyapunov exponents. We describe several methods for obtaining them and apply a little known method of artificial neural networks to the different examples mentioned above. We end the paper discussing the importance of the Lyapunov exponents in the interpretation of the dynamic behavior of biological neurons and biological neural networks.

Phase space reconstruction and estimation of the largest Lyapunov exponent for gait kinematic data

DOE Office of Scientific and Technical Information (OSTI.GOV)

Josiński, Henryk; Świtoński, Adam; Silesian University of Technology, Akademicka 16, 44-100 Gliwice

The authors describe an example of application of nonlinear time series analysis directed at identifying the presence of deterministic chaos in human motion data by means of the largest Lyapunov exponent. The method was previously verified on the basis of a time series constructed from the numerical solutions of both the Lorenz and the Rössler nonlinear dynamical systems.

Path integrals and the WKB approximation in loop quantum cosmology

NASA Astrophysics Data System (ADS)

Ashtekar, Abhay; Campiglia, Miguel; Henderson, Adam

2010-12-01

We follow the Feynman procedure to obtain a path integral formulation of loop quantum cosmology starting from the Hilbert space framework. Quantum geometry effects modify the weight associated with each path so that the effective measure on the space of paths is different from that used in the Wheeler-DeWitt theory. These differences introduce some conceptual subtleties in arriving at the WKB approximation. But the approximation is well defined and provides intuition for the differences between loop quantum cosmology and the Wheeler-DeWitt theory from a path integral perspective.

Non Lyapunov stability of a constant spatially developing 2-D gas flow

NASA Astrophysics Data System (ADS)

Balint, Agneta M.; Balint, Stefan; Tanasie, Loredana

2017-01-01

Different types of stabilities (global, local) and instabilities (global absolute, local convective) of the constant spatially developing 2-D gas flow are analyzed in a particular phase space of continuously differentiable functions, endowed with the usual algebraic operations and the topology generated by the uniform convergence on the plane. For this purpose the Euler equations linearized at the constant flow are used. The Lyapunov stability analysis was presented in [1] and this paper is a continuation of [1].

Volterra-type Lyapunov functions for fractional-order epidemic systems

NASA Astrophysics Data System (ADS)

Vargas-De-León, Cruz

2015-07-01

In this paper we prove an elementary lemma which estimates fractional derivatives of Volterra-type Lyapunov functions in the sense Caputo when α ∈ (0, 1) . Moreover, by using this result, we study the uniform asymptotic stability of some Caputo-type epidemic systems with a pair of fractional-order differential equations. These epidemic systems are the Susceptible-Infected-Susceptible (SIS), Susceptible-Infected-Recovered (SIR) and Susceptible-Infected-Recovered-Susceptible (SIRS) models and Ross-Macdonald model for vector-borne diseases. We show that the unique endemic equilibrium is uniformly asymptotically stable if the basic reproductive number is greater than one. We illustrate our theoretical results with numerical simulations using the Adams-Bashforth-Moulton scheme implemented in the fde12 Matlab function.

The use of Lyapunov differential inequalities for estimating the transients of mechanical systems

NASA Astrophysics Data System (ADS)

Alyshev, A. S.; Dudarenko, N. A.; Melnikov, V. G.; Melnikov, G. I.

2018-05-01

In this paper we consider an autonomous mechanical system in a finite neighborhood of the zero of the phase space of states. The system is given as a matrix differential equation in the Cauchy form with the right-hand side of the polynomial structure. We propose a method for constructing a sequence of linear inhomogeneous differential inequalities for Lyapunov functions. As a result, we obtain estimates of transient processes in the form of functional inequalities.

Computation of entropy and Lyapunov exponent by a shift transform.

PubMed

Matsuoka, Chihiro; Hiraide, Koichi

2015-10-01

We present a novel computational method to estimate the topological entropy and Lyapunov exponent of nonlinear maps using a shift transform. Unlike the computation of periodic orbits or the symbolic dynamical approach by the Markov partition, the method presented here does not require any special techniques in computational and mathematical fields to calculate these quantities. In spite of its simplicity, our method can accurately capture not only the chaotic region but also the non-chaotic region (window region) such that it is important physically but the (Lebesgue) measure zero and usually hard to calculate or observe. Furthermore, it is shown that the Kolmogorov-Sinai entropy of the Sinai-Ruelle-Bowen measure (the physical measure) coincides with the topological entropy.

A formation control strategy with coupling weights for the multi-robot system

NASA Astrophysics Data System (ADS)

Liang, Xudong; Wang, Siming; Li, Weijie

2017-12-01

The distributed formation problem of the multi-robot system with general linear dynamic characteristics and directed communication topology is discussed. In order to avoid that the multi-robot system can not maintain the desired formation in the complex communication environment, the distributed cooperative algorithm with coupling weights based on zipf distribution is designed. The asymptotic stability condition for the formation of the multi-robot system is given, and the theory of the graph and the Lyapunov theory are used to prove that the formation can converge to the desired geometry formation and the desired motion rules of the virtual leader under this condition. Nontrivial simulations are performed to validate the effectiveness of the distributed cooperative algorithm with coupling weights.

Teleconnection Paths via Climate Network Direct Link Detection.

PubMed

Zhou, Dong; Gozolchiani, Avi; Ashkenazy, Yosef; Havlin, Shlomo

2015-12-31

Teleconnections describe remote connections (typically thousands of kilometers) of the climate system. These are of great importance in climate dynamics as they reflect the transportation of energy and climate change on global scales (like the El Niño phenomenon). Yet, the path of influence propagation between such remote regions, and weighting associated with different paths, are only partially known. Here we propose a systematic climate network approach to find and quantify the optimal paths between remotely distant interacting locations. Specifically, we separate the correlations between two grid points into direct and indirect components, where the optimal path is found based on a minimal total cost function of the direct links. We demonstrate our method using near surface air temperature reanalysis data, on identifying cross-latitude teleconnections and their corresponding optimal paths. The proposed method may be used to quantify and improve our understanding regarding the emergence of climate patterns on global scales.

Calibration of neural networks using genetic algorithms, with application to optimal path planning

NASA Technical Reports Server (NTRS)

Smith, Terence R.; Pitney, Gilbert A.; Greenwood, Daniel

1987-01-01

Genetic algorithms (GA) are used to search the synaptic weight space of artificial neural systems (ANS) for weight vectors that optimize some network performance function. GAs do not suffer from some of the architectural constraints involved with other techniques and it is straightforward to incorporate terms into the performance function concerning the metastructure of the ANS. Hence GAs offer a remarkably general approach to calibrating ANS. GAs are applied to the problem of calibrating an ANS that finds optimal paths over a given surface. This problem involves training an ANS on a relatively small set of paths and then examining whether the calibrated ANS is able to find good paths between arbitrary start and end points on the surface.

Cartographic modeling of snow avalanche path location within Glacier National Park, Montana

NASA Technical Reports Server (NTRS)

Walsh, Stephen J.; Brown, Daniel G.; Bian, Ling; Butler, David R.

1990-01-01

Geographic information system (GIS) techniques were applied to the study of snow-avalanche path location within Glacier National Park, Montana. Aerial photointerpretation and field surveys confirmed the location of 121 avalanche paths within the selected study area. Spatial and nonspatial information on each path were integrated using the ARC/INFO GIS. Lithologic, structural, hydrographic, topographic, and land-cover impacts on path location were analyzed. All path frequencies within variable classes were normalized by the area of class occurrence relative to the total area of the study area and were added to the morphometric information contained within INFO tables. The normalized values for each GIS coverage were used to cartographically model, by means of composite factor weightings, avalanche path locations.

Singular Behavior of the Leading Lyapunov Exponent of a Product of Random {2 × 2} Matrices

NASA Astrophysics Data System (ADS)

Genovese, Giuseppe; Giacomin, Giambattista; Greenblatt, Rafael Leon

2017-05-01

We consider a certain infinite product of random {2 × 2} matrices appearing in the solution of some 1 and 1 + 1 dimensional disordered models in statistical mechanics, which depends on a parameter ɛ > 0 and on a real random variable with distribution {μ}. For a large class of {μ}, we prove the prediction by Derrida and Hilhorst (J Phys A 16:2641, 1983) that the Lyapunov exponent behaves like {C ɛ^{2 α}} in the limit {ɛ \\searrow 0}, where {α \\in (0,1)} and {C > 0} are determined by {μ}. Derrida and Hilhorst performed a two-scale analysis of the integral equation for the invariant distribution of the Markov chain associated to the matrix product and obtained a probability measure that is expected to be close to the invariant one for small {ɛ}. We introduce suitable norms and exploit contractivity properties to show that such a probability measure is indeed close to the invariant one in a sense that implies a suitable control of the Lyapunov exponent.

Computation of entropy and Lyapunov exponent by a shift transform

DOE Office of Scientific and Technical Information (OSTI.GOV)

Matsuoka, Chihiro, E-mail: matsuoka.chihiro.mm@ehime-u.ac.jp; Hiraide, Koichi

2015-10-15

We present a novel computational method to estimate the topological entropy and Lyapunov exponent of nonlinear maps using a shift transform. Unlike the computation of periodic orbits or the symbolic dynamical approach by the Markov partition, the method presented here does not require any special techniques in computational and mathematical fields to calculate these quantities. In spite of its simplicity, our method can accurately capture not only the chaotic region but also the non-chaotic region (window region) such that it is important physically but the (Lebesgue) measure zero and usually hard to calculate or observe. Furthermore, it is shown thatmore » the Kolmogorov-Sinai entropy of the Sinai-Ruelle-Bowen measure (the physical measure) coincides with the topological entropy.« less

Large-Signal Lyapunov-Based Stability Analysis of DC/AC Inverters and Inverter-Based Microgrids

NASA Astrophysics Data System (ADS)

Kabalan, Mahmoud

Microgrid stability studies have been largely based on small-signal linearization techniques. However, the validity and magnitude of the linearization domain is limited to small perturbations. Thus, there is a need to examine microgrids with large-signal nonlinear techniques to fully understand and examine their stability. Large-signal stability analysis can be accomplished by Lyapunov-based mathematical methods. These Lyapunov methods estimate the domain of asymptotic stability of the studied system. A survey of Lyapunov-based large-signal stability studies showed that few large-signal studies have been completed on either individual systems (dc/ac inverters, dc/dc rectifiers, etc.) or microgrids. The research presented in this thesis addresses the large-signal stability of droop-controlled dc/ac inverters and inverter-based microgrids. Dc/ac power electronic inverters allow microgrids to be technically feasible. Thus, as a prelude to examining the stability of microgrids, the research presented in Chapter 3 analyzes the stability of inverters. First, the 13 th order large-signal nonlinear model of a droop-controlled dc/ac inverter connected to an infinite bus is presented. The singular perturbation method is used to decompose the nonlinear model into 11th, 9th, 7th, 5th, 3rd and 1st order models. Each model ignores certain control or structural components of the full order model. The aim of the study is to understand the accuracy and validity of the reduced order models in replicating the performance of the full order nonlinear model. The performance of each model is studied in three different areas: time domain simulations, Lyapunov's indirect method and domain of attraction estimation. The work aims to present the best model to use in each of the three domains of study. Results show that certain reduced order models are capable of accurately reproducing the performance of the full order model while others can be used to gain insights into those three areas of

Accelerating Sequential Gaussian Simulation with a constant path

NASA Astrophysics Data System (ADS)

Nussbaumer, Raphaël; Mariethoz, Grégoire; Gravey, Mathieu; Gloaguen, Erwan; Holliger, Klaus

2018-03-01

Sequential Gaussian Simulation (SGS) is a stochastic simulation technique commonly employed for generating realizations of Gaussian random fields. Arguably, the main limitation of this technique is the high computational cost associated with determining the kriging weights. This problem is compounded by the fact that often many realizations are required to allow for an adequate uncertainty assessment. A seemingly simple way to address this problem is to keep the same simulation path for all realizations. This results in identical neighbourhood configurations and hence the kriging weights only need to be determined once and can then be re-used in all subsequent realizations. This approach is generally not recommended because it is expected to result in correlation between the realizations. Here, we challenge this common preconception and make the case for the use of a constant path approach in SGS by systematically evaluating the associated benefits and limitations. We present a detailed implementation, particularly regarding parallelization and memory requirements. Extensive numerical tests demonstrate that using a constant path allows for substantial computational gains with very limited loss of simulation accuracy. This is especially the case for a constant multi-grid path. The computational savings can be used to increase the neighbourhood size, thus allowing for a better reproduction of the spatial statistics. The outcome of this study is a recommendation for an optimal implementation of SGS that maximizes accurate reproduction of the covariance structure as well as computational efficiency.

Tuning the control system of a nonlinear inverted pendulum by means of the new method of Lyapunov exponents estimation

NASA Astrophysics Data System (ADS)

Balcerzak, Marek; Dąbrowski, Artur; Pikunov, Danylo

2018-01-01

This paper presents a practical application of a new, simplified method of Lyapunov exponents estimation. The method has been applied to optimization of a real, nonlinear inverted pendulum system. Authors presented how the algorithm of the Largest Lyapunov Exponent (LLE) estimation can be applied to evaluate control systems performance. The new LLE-based control performance index has been proposed. Equations of the inverted pendulum system of the fourth order have been found. The nonlinear friction of the regulation object has been identified by means of the nonlinear least squares method. Three different friction models have been tested: linear, cubic and Coulomb model. The Differential Evolution (DE) algorithm has been used to search for the best set of parameters of the general linear regulator. This work proves that proposed method is efficient and results in faster perturbation rejection, especially when disturbances are significant.

Metabolic PathFinding: inferring relevant pathways in biochemical networks.

PubMed

Croes, Didier; Couche, Fabian; Wodak, Shoshana J; van Helden, Jacques

2005-07-01

Our knowledge of metabolism can be represented as a network comprising several thousands of nodes (compounds and reactions). Several groups applied graph theory to analyse the topological properties of this network and to infer metabolic pathways by path finding. This is, however, not straightforward, with a major problem caused by traversing irrelevant shortcuts through highly connected nodes, which correspond to pool metabolites and co-factors (e.g. H2O, NADP and H+). In this study, we present a web server implementing two simple approaches, which circumvent this problem, thereby improving the relevance of the inferred pathways. In the simplest approach, the shortest path is computed, while filtering out the selection of highly connected compounds. In the second approach, the shortest path is computed on the weighted metabolic graph where each compound is assigned a weight equal to its connectivity in the network. This approach significantly increases the accuracy of the inferred pathways, enabling the correct inference of relatively long pathways (e.g. with as many as eight intermediate reactions). Available options include the calculation of the k-shortest paths between two specified seed nodes (either compounds or reactions). Multiple requests can be submitted in a queue. Results are returned by email, in textual as well as graphical formats (available in http://www.scmbb.ulb.ac.be/pathfinding/).

The generalized Lyapunov theorem and its application to quantum channels

NASA Astrophysics Data System (ADS)

Burgarth, Daniel; Giovannetti, Vittorio

2007-05-01

We give a simple and physically intuitive necessary and sufficient condition for a map acting on a compact metric space to be mixing (i.e. infinitely many applications of the map transfer any input into a fixed convergency point). This is a generalization of the 'Lyapunov direct method'. First we prove this theorem in topological spaces and for arbitrary continuous maps. Finally we apply our theorem to maps which are relevant in open quantum systems and quantum information, namely quantum channels. In this context, we also discuss the relations between mixing and ergodicity (i.e. the property that there exists only a single input state which is left invariant by a single application of the map) showing that the two are equivalent when the invariant point of the ergodic map is pure.

GPU and APU computations of Finite Time Lyapunov Exponent fields

NASA Astrophysics Data System (ADS)

Conti, Christian; Rossinelli, Diego; Koumoutsakos, Petros

2012-03-01

We present GPU and APU accelerated computations of Finite-Time Lyapunov Exponent (FTLE) fields. The calculation of FTLEs is a computationally intensive process, as in order to obtain the sharp ridges associated with the Lagrangian Coherent Structures an extensive resampling of the flow field is required. The computational performance of this resampling is limited by the memory bandwidth of the underlying computer architecture. The present technique harnesses data-parallel execution of many-core architectures and relies on fast and accurate evaluations of moment conserving functions for the mesh to particle interpolations. We demonstrate how the computation of FTLEs can be efficiently performed on a GPU and on an APU through OpenCL and we report over one order of magnitude improvements over multi-threaded executions in FTLE computations of bluff body flows.

Lyapunov vector function method in the motion stabilisation problem for nonholonomic mobile robot

NASA Astrophysics Data System (ADS)

Andreev, Aleksandr; Peregudova, Olga

2017-07-01

In this paper we propose a sampled-data control law in the stabilisation problem of nonstationary motion of nonholonomic mobile robot. We assume that the robot moves on a horizontal surface without slipping. The dynamical model of a mobile robot is considered. The robot has one front free wheel and two rear wheels which are controlled by two independent electric motors. We assume that the controls are piecewise constant signals. Controller design relies on the backstepping procedure with the use of Lyapunov vector-function method. Theoretical considerations are verified by numerical simulation.

An Effective Evolutionary Approach for Bicriteria Shortest Path Routing Problems

NASA Astrophysics Data System (ADS)

Lin, Lin; Gen, Mitsuo

Routing problem is one of the important research issues in communication network fields. In this paper, we consider a bicriteria shortest path routing (bSPR) model dedicated to calculating nondominated paths for (1) the minimum total cost and (2) the minimum transmission delay. To solve this bSPR problem, we propose a new multiobjective genetic algorithm (moGA): (1) an efficient chromosome representation using the priority-based encoding method; (2) a new operator of GA parameters auto-tuning, which is adaptively regulation of exploration and exploitation based on the change of the average fitness of parents and offspring which is occurred at each generation; and (3) an interactive adaptive-weight fitness assignment mechanism is implemented that assigns weights to each objective and combines the weighted objectives into a single objective function. Numerical experiments with various scales of network design problems show the effectiveness and the efficiency of our approach by comparing with the recent researches.

Path optimization method for the sign problem

NASA Astrophysics Data System (ADS)

Ohnishi, Akira; Mori, Yuto; Kashiwa, Kouji

2018-03-01

We propose a path optimization method (POM) to evade the sign problem in the Monte-Carlo calculations for complex actions. Among many approaches to the sign problem, the Lefschetz-thimble path-integral method and the complex Langevin method are promising and extensively discussed. In these methods, real field variables are complexified and the integration manifold is determined by the flow equations or stochastically sampled. When we have singular points of the action or multiple critical points near the original integral surface, however, we have a risk to encounter the residual and global sign problems or the singular drift term problem. One of the ways to avoid the singular points is to optimize the integration path which is designed not to hit the singular points of the Boltzmann weight. By specifying the one-dimensional integration-path as z = t +if(t)(f ɛ R) and by optimizing f(t) to enhance the average phase factor, we demonstrate that we can avoid the sign problem in a one-variable toy model for which the complex Langevin method is found to fail. In this proceedings, we propose POM and discuss how we can avoid the sign problem in a toy model. We also discuss the possibility to utilize the neural network to optimize the path.

Maximum Lyapunov exponents as predictors of global gait stability: a modelling approach.

PubMed

Bruijn, Sjoerd M; Bregman, Daan J J; Meijer, Onno G; Beek, Peter J; van Dieën, Jaap H

2012-05-01

To examine the stability of human walking, methods such as local dynamic stability have been adopted from dynamical systems theory. Local dynamic stability is calculated by estimating maximal finite time Lyapunov exponents (λ(S) and λ(L)), which quantify how a system responds continuously to very small (i.e. "local") perturbations. However, it is unknown if, and to what extent, these measures are correlated to global stability, defined operationally as the probability of falling. We studied whether changes in probability of falling of a simple model of human walking (a so-called dynamic walker) could be predicted from maximum finite time Lyapunov exponents. We used an extended version of the simplest walking model with arced feet and a hip spring. This allowed us to change the probability of falling of the model by changing either the foot radius, the slope at which the model walks, the stiffness of the hip spring, or a combination of these factors. Results showed that λ(S) correlated fairly well with global stability, although this relationship was dependent upon differences in the distance between initial nearest neighbours on the divergence curve. A measure independent of such changes (the log(distance between initially nearest neighbours after 50 samples)) correlated better with global stability, and, more importantly, showed a more consistent relationship across conditions. In contrast, λ(L) showed either weak correlations, or correlations opposite to expected, thus casting doubt on the use of this measure as a predictor of global gait stability. Our findings support the use of λ(S), but not of λ(L), as measure of human gait stability. Copyright © 2011 IPEM. Published by Elsevier Ltd. All rights reserved.

Path analysis of risk factors leading to premature birth.

PubMed

Fields, S J; Livshits, G; Sirotta, L; Merlob, P

1996-01-01

The present study tested whether various sociodemographic, anthropometric, behavioral, and medical/physiological factors act in a direct or indirect manner on the risk of prematurity using path analysis on a sample of Israeli births. The path model shows that medical complications, primarily toxemia, chorioammionitis, and a previous low birth weight delivery directly and significantly act on the risk of prematurity as do low maternal pregnancy weight gain and ethnicity. Other medical complications, including chronic hypertension, preclampsia, and placental abruption, although significantly correlated with prematurity, act indirectly on prematurity through toxemia. The model further shows that the commonly accepted sociodemographic, anthropometric, and behavioral risk factors act by modifying the development of medical complications that lead to prematurity as opposed to having a direct effect on premature delivery. © 1996 Wiley-Liss, Inc. Copyright © 1996 Wiley-Liss, Inc.

Epidemic extinction paths in complex networks

NASA Astrophysics Data System (ADS)

Hindes, Jason; Schwartz, Ira B.

2017-05-01

We study the extinction of long-lived epidemics on finite complex networks induced by intrinsic noise. Applying analytical techniques to the stochastic susceptible-infected-susceptible model, we predict the distribution of large fluctuations, the most probable or optimal path through a network that leads to a disease-free state from an endemic state, and the average extinction time in general configurations. Our predictions agree with Monte Carlo simulations on several networks, including synthetic weighted and degree-distributed networks with degree correlations, and an empirical high school contact network. In addition, our approach quantifies characteristic scaling patterns for the optimal path and distribution of large fluctuations, both near and away from the epidemic threshold, in networks with heterogeneous eigenvector centrality and degree distributions.

Epidemic extinction paths in complex networks.

PubMed

Hindes, Jason; Schwartz, Ira B

2017-05-01

We study the extinction of long-lived epidemics on finite complex networks induced by intrinsic noise. Applying analytical techniques to the stochastic susceptible-infected-susceptible model, we predict the distribution of large fluctuations, the most probable or optimal path through a network that leads to a disease-free state from an endemic state, and the average extinction time in general configurations. Our predictions agree with Monte Carlo simulations on several networks, including synthetic weighted and degree-distributed networks with degree correlations, and an empirical high school contact network. In addition, our approach quantifies characteristic scaling patterns for the optimal path and distribution of large fluctuations, both near and away from the epidemic threshold, in networks with heterogeneous eigenvector centrality and degree distributions.

Comparative analysis of the numerical methods for estimation of predictability time of NEAs motion. (Russian Title: Сравнительный анализ численных методов оценивания времени предсказуемости движения АСЗ)

NASA Astrophysics Data System (ADS)

Bykova, L. E.; Galushina, T. Yu.; Razdymakhina, O. N.

2011-07-01

The paper presents the results of comparative analysis of different algorithms for determination of predictability time of Near-Earth asteroids (NEAs) motion. Three algorithms have been considered: shadow path method, variation method, MEGNO-analysis, where the characteristic of dynamic chaos is the time-weighted integral quantity of maximum characteristic Lyapunov exponent. The developed algorithms and software complex has been applied to identify the chaotic motion of some NEAs. It is shown that MEGNO-analysis allows enough accurately separate regular and chaotic motion of asteroids in a relatively short time intervals.

A Stochastic Approach to Path Planning in the Weighted-Region Problem

DTIC Science & Technology

1991-03-01

polynomial time. However, the polyhedrons in this three-dimensional obstacle-avoidance problem are all obstacles (i.e. travel is not permitted within...them). Therefore, optimal paths tend to avoid their vertices, and settle into closest approach tangents across polyhedron edges. So, in a sense...intersection update map database with new vertex for this edge 3. IF (C1 > D) and (C2 > D) THEN edge intersects ellipse at two points OR edge is

Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs

NASA Astrophysics Data System (ADS)

Chekuri, Chandra; Ene, Alina; Korula, Nitish

We consider the unsplittable flow problem (UFP) and the closely related column-restricted packing integer programs (CPIPs). In UFP we are given an edge-capacitated graph G = (V,E) and k request pairs R 1, ..., R k , where each R i consists of a source-destination pair (s i ,t i ), a demand d i and a weight w i . The goal is to find a maximum weight subset of requests that can be routed unsplittably in G. Most previous work on UFP has focused on the no-bottleneck case in which the maximum demand of the requests is at most the smallest edge capacity. Inspired by the recent work of Bansal et al. [3] on UFP on a path without the above assumption, we consider UFP on paths as well as trees. We give a simple O(logn) approximation for UFP on trees when all weights are identical; this yields an O(log2 n) approximation for the weighted case. These are the first non-trivial approximations for UFP on trees. We develop an LP relaxation for UFP on paths that has an integrality gap of O(log2 n); previously there was no relaxation with o(n) gap. We also consider UFP in general graphs and CPIPs without the no-bottleneck assumption and obtain new and useful results.

Hard paths, soft paths or no paths? Cross-cultural perceptions of water solutions

NASA Astrophysics Data System (ADS)

Wutich, A.; White, A. C.; White, D. D.; Larson, K. L.; Brewis, A.; Roberts, C.

2014-01-01

In this study, we examine how development status and water scarcity shape people's perceptions of "hard path" and "soft path" water solutions. Based on ethnographic research conducted in four semi-rural/peri-urban sites (in Bolivia, Fiji, New Zealand, and the US), we use content analysis to conduct statistical and thematic comparisons of interview data. Our results indicate clear differences associated with development status and, to a lesser extent, water scarcity. People in the two less developed sites were more likely to suggest hard path solutions, less likely to suggest soft path solutions, and more likely to see no path to solutions than people in the more developed sites. Thematically, people in the two less developed sites envisioned solutions that involve small-scale water infrastructure and decentralized, community-based solutions, while people in the more developed sites envisioned solutions that involve large-scale infrastructure and centralized, regulatory water solutions. People in the two water-scarce sites were less likely to suggest soft path solutions and more likely to see no path to solutions (but no more likely to suggest hard path solutions) than people in the water-rich sites. Thematically, people in the two water-rich sites seemed to perceive a wider array of unrealized potential soft path solutions than those in the water-scarce sites. On balance, our findings are encouraging in that they indicate that people are receptive to soft path solutions in a range of sites, even those with limited financial or water resources. Our research points to the need for more studies that investigate the social feasibility of soft path water solutions, particularly in sites with significant financial and natural resource constraints.

Hard paths, soft paths or no paths? Cross-cultural perceptions of water solutions

NASA Astrophysics Data System (ADS)

Wutich, A.; White, A. C.; Roberts, C. M.; White, D. D.; Larson, K. L.; Brewis, A.

2013-06-01

In this study, we examine how development status and water scarcity shape people's perceptions of "hard path" and "soft path" water solutions. Based on ethnographic research conducted in four semi-rural/peri-urban sites (in Bolivia, Fiji, New Zealand, and the US), we use content analysis to conduct statistical and thematic comparisons of interview data. Our results indicate clear differences based on development status and, to a lesser extent, water scarcity. People in less developed sites were more likely to suggest hard path solutions, less likely to suggest soft path solutions, and more likely to see no path to solutions than people in more developed sites. Thematically, people in less developed sites envisioned solutions that involve small-scale water infrastructure and decentralized, community based solutions, while people in more developed sites envisioned solutions that involve large-scale infrastructure and centralized, regulatory water solutions. People in water-scarce sites were less likely to suggest soft path solutions and more likely to see no path to solutions (but no more likely to suggest hard path solutions) than people in water-rich sites. Thematically, people in water-rich sites seemed to perceive a wider array of unrealized potential soft path solutions than those in water-scarce sites. On balance, our findings are encouraging in that they indicate that people are receptive to soft path solutions in a range of sites, even those with limited financial or water resources. Our research points to the need for more studies that investigate the social feasibility of soft path water solutions, particularly in sites with significant financial and natural resource constraints.

Folded path LWIR system for SWAP constrained platforms

NASA Astrophysics Data System (ADS)

Fleet, Erin F.; Wilson, Michael L.; Linne von Berg, Dale; Giallorenzi, Thomas; Mathieu, Barry

2014-06-01

Folded path reflection and catadioptric optics are of growing interest, especially in the long wave infrared (LWIR), due to continuing demands for reductions in imaging system size, weight and power (SWAP). We present the optical design and laboratory data for a 50 mm focal length low f/# folded-path compact LWIR imaging system. The optical design uses 4 concentric aspheric mirrors, each of which is described by annular aspheric functions well suited to the folded path design space. The 4 mirrors are diamond turned onto two thin air-spaced aluminum plates which can be manually focused onto the uncooled LWIR microbolometer array detector. Stray light analysis will be presented to show how specialized internal baffling can be used to reduce stray light propagation through the folded path optical train. The system achieves near diffraction limited performance across the FOV with a 15 mm long optical train and a 5 mm back focal distance. The completed system is small enough to reside within a 3 inch diameter ball gimbal.

Investigation of Lyapunov stability of a central configuration in the restricted four-body problem

NASA Astrophysics Data System (ADS)

Bardin, B. S.; Esipov, P. A.

2018-05-01

The restricted planar four-body problem is considered. It is supposed that one of four bodies has infinitesimal mass and does not affect on motions of three other bodies. If two bodies have equal masses then there exists a central configuration such that three bodies are located in vertex of an equilateral triangle and the fourth body having infinitesimal mass is located in perpendicular bisector of the triangle. By using the method of normal forms and KAM theory stability of the above configuration is studied in the sense of Lyapunov.

An implicit iterative algorithm with a tuning parameter for Itô Lyapunov matrix equations

NASA Astrophysics Data System (ADS)

Zhang, Ying; Wu, Ai-Guo; Sun, Hui-Jie

2018-01-01

In this paper, an implicit iterative algorithm is proposed for solving a class of Lyapunov matrix equations arising in Itô stochastic linear systems. A tuning parameter is introduced in this algorithm, and thus the convergence rate of the algorithm can be changed. Some conditions are presented such that the developed algorithm is convergent. In addition, an explicit expression is also derived for the optimal tuning parameter, which guarantees that the obtained algorithm achieves its fastest convergence rate. Finally, numerical examples are employed to illustrate the effectiveness of the given algorithm.

Path planning and Ground Control Station simulator for UAV

NASA Astrophysics Data System (ADS)

Ajami, A.; Balmat, J.; Gauthier, J.-P.; Maillot, T.

In this paper we present a Universal and Interoperable Ground Control Station (UIGCS) simulator for fixed and rotary wing Unmanned Aerial Vehicles (UAVs), and all types of payloads. One of the major constraints is to operate and manage multiple legacy and future UAVs, taking into account the compliance with NATO Combined/Joint Services Operational Environment (STANAG 4586). Another purpose of the station is to assign the UAV a certain degree of autonomy, via autonomous planification/replanification strategies. The paper is organized as follows. In Section 2, we describe the non-linear models of the fixed and rotary wing UAVs that we use in the simulator. In Section 3, we describe the simulator architecture, which is based upon interacting modules programmed independently. This simulator is linked with an open source flight simulator, to simulate the video flow and the moving target in 3D. To conclude this part, we tackle briefly the problem of the Matlab/Simulink software connection (used to model the UAV's dynamic) with the simulation of the virtual environment. Section 5 deals with the control module of a flight path of the UAV. The control system is divided into four distinct hierarchical layers: flight path, navigation controller, autopilot and flight control surfaces controller. In the Section 6, we focus on the trajectory planification/replanification question for fixed wing UAV. Indeed, one of the goals of this work is to increase the autonomy of the UAV. We propose two types of algorithms, based upon 1) the methods of the tangent and 2) an original Lyapunov-type method. These algorithms allow either to join a fixed pattern or to track a moving target. Finally, Section 7 presents simulation results obtained on our simulator, concerning a rather complicated scenario of mission.

Computing Finite-Time Lyapunov Exponents with Optimally Time Dependent Reduction

NASA Astrophysics Data System (ADS)

Babaee, Hessam; Farazmand, Mohammad; Sapsis, Themis; Haller, George

2016-11-01

We present a method to compute Finite-Time Lyapunov Exponents (FTLE) of a dynamical system using Optimally Time-Dependent (OTD) reduction recently introduced by H. Babaee and T. P. Sapsis. The OTD modes are a set of finite-dimensional, time-dependent, orthonormal basis {ui (x , t) } |i=1N that capture the directions associated with transient instabilities. The evolution equation of the OTD modes is derived from a minimization principle that optimally approximates the most unstable directions over finite times. To compute the FTLE, we evolve a single OTD mode along with the nonlinear dynamics. We approximate the FTLE from the reduced system obtained from projecting the instantaneous linearized dynamics onto the OTD mode. This results in a significant reduction in the computational cost compared to conventional methods for computing FTLE. We demonstrate the efficiency of our method for double Gyre and ABC flows. ARO project 66710-EG-YIP.

Classical workflow nets and workflow nets with reset arcs: using Lyapunov stability for soundness verification

NASA Astrophysics Data System (ADS)

Clempner, Julio B.

2017-01-01

This paper presents a novel analytical method for soundness verification of workflow nets and reset workflow nets, using the well-known stability results of Lyapunov for Petri nets. We also prove that the soundness property is decidable for workflow nets and reset workflow nets. In addition, we provide evidence of several outcomes related with properties such as boundedness, liveness, reversibility and blocking using stability. Our approach is validated theoretically and by a numerical example related to traffic signal-control synchronisation.

Impulsive noise suppression in color images based on the geodesic digital paths

NASA Astrophysics Data System (ADS)

Smolka, Bogdan; Cyganek, Boguslaw

2015-02-01

In the paper a novel filtering design based on the concept of exploration of the pixel neighborhood by digital paths is presented. The paths start from the boundary of a filtering window and reach its center. The cost of transitions between adjacent pixels is defined in the hybrid spatial-color space. Then, an optimal path of minimum total cost, leading from pixels of the window's boundary to its center is determined. The cost of an optimal path serves as a degree of similarity of the central pixel to the samples from the local processing window. If a pixel is an outlier, then all the paths starting from the window's boundary will have high costs and the minimum one will also be high. The filter output is calculated as a weighted mean of the central pixel and an estimate constructed using the information on the minimum cost assigned to each image pixel. So, first the costs of optimal paths are used to build a smoothed image and in the second step the minimum cost of the central pixel is utilized for construction of the weights of a soft-switching scheme. The experiments performed on a set of standard color images, revealed that the efficiency of the proposed algorithm is superior to the state-of-the-art filtering techniques in terms of the objective restoration quality measures, especially for high noise contamination ratios. The proposed filter, due to its low computational complexity, can be applied for real time image denoising and also for the enhancement of video streams.

Effective Power-Law Dependence of Lyapunov Exponents on the Central Mass in Galaxies

NASA Technical Reports Server (NTRS)

Delis, N.; Efthymiopoulos, C.; Kalapotharakos, C.

2015-01-01

Using both numerical and analytical approaches, we demonstrate the existence of an effective power-law relation L alpha m(sup p) between themean Lyapunov exponent L of stellar orbits chaotically scattered by a supermassive black hole (BH) in the centre of a galaxy and the mass parameter m, i.e. ratio of the mass of the BH over the mass of the galaxy. The exponent p is found numerically to obtain values in the range p approximately equals 0.3-0.5. We propose a theoretical interpretation of these exponents, based on estimates of local 'stretching numbers', i.e. local Lyapunov exponents at successive transits of the orbits through the BH's sphere of influence. We thus predict p = 2/3 - q with q approximately equaling 0.1-0.2. Our basic model refers to elliptical galaxy models with a central core. However, we find numerically that an effective power-law scaling of L with m holds also in models with central cusp, beyond a mass scale up to which chaos is dominated by the influence of the cusp itself. We finally show numerically that an analogous law exists also in disc galaxies with rotating bars. In the latter case, chaotic scattering by the BH affects mainly populations of thick tube-like orbits surrounding some low-order branches of the x(sub 1) family of periodic orbits, as well as its bifurcations at low-order resonances, mainly the inner Lindblad resonance and the 4/1 resonance. Implications of the correlations between L and m to determining the rate of secular evolution of galaxies are discussed.

Linear and nonlinear dynamic analysis of redundant load path bearingless rotor systems

NASA Technical Reports Server (NTRS)

Murthy, V. R.

1985-01-01

The bearingless rotorcraft offers reduced weight, less complexity and superior flying qualities. Almost all the current industrial structural dynamic programs of conventional rotors which consist of single load path rotor blades employ the transfer matrix method to determine natural vibration characteristics because this method is ideally suited for one dimensional chain like structures. This method is extended to multiple load path rotor blades without resorting to an equivalent single load path approximation. Unlike the conventional blades, it isk necessary to introduce the axial-degree-of-freedom into the solution process to account for the differential axial displacements in the different load paths. With the present extension, the current rotor dynamic programs can be modified with relative ease to account for the multiple load paths without resorting to the equivalent single load path modeling. The results obtained by the transfer matrix method are validated by comparing with the finite element solutions. A differential stiffness matrix due to blade rotation is derived to facilitate the finite element solutions.

A Lyapunov Function Based Remedial Action Screening Tool Using Real-Time Data

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mitra, Joydeep; Ben-Idris, Mohammed; Faruque, Omar

This report summarizes the outcome of a research project that comprised the development of a Lyapunov function based remedial action screening tool using real-time data (L-RAS). The L-RAS is an advanced computational tool that is intended to assist system operators in making real-time redispatch decisions to preserve power grid stability. The tool relies on screening contingencies using a homotopy method based on Lyapunov functions to avoid, to the extent possible, the use of time domain simulations. This enables transient stability evaluation at real-time speed without the use of massively parallel computational resources. The project combined the following components. 1. Developmentmore » of a methodology for contingency screening using a homotopy method based on Lyapunov functions and real-time data. 2. Development of a methodology for recommending remedial actions based on the screening results. 3. Development of a visualization and operator interaction interface. 4. Testing of screening tool, validation of control actions, and demonstration of project outcomes on a representative real system simulated on a Real-Time Digital Simulator (RTDS) cluster. The project was led by Michigan State University (MSU), where the theoretical models including homotopy-based screening, trajectory correction using real-time data, and remedial action were developed and implemented in the form of research-grade software. Los Alamos National Laboratory (LANL) contributed to the development of energy margin sensitivity dynamics, which constituted a part of the remedial action portfolio. Florida State University (FSU) and Southern California Edison (SCE) developed a model of the SCE system that was implemented on FSU's RTDS cluster to simulate real-time data that was streamed over the internet to MSU where the L-RAS tool was executed and remedial actions were communicated back to FSU to execute stabilizing controls on the simulated system. LCG Consulting developed the visualization

Scaling with System Size of the Lyapunov Exponents for the Hamiltonian Mean Field Model

NASA Astrophysics Data System (ADS)

Manos, Thanos; Ruffo, Stefano

2011-12-01

The Hamiltonian Mean Field model is a prototype for systems with long-range interactions. It describes the motion of N particles moving on a ring, coupled with an infinite-range potential. The model has a second-order phase transition at the energy density Uc =3/4 and its dynamics is exactly described by the Vlasov equation in the N→∞ limit. Its chaotic properties have been investigated in the past, but the determination of the scaling with N of the Lyapunov Spectrum (LS) of the model remains a challenging open problem. Here we show that the N -1/3 scaling of the Maximal Lyapunov Exponent (MLE), found in previous numerical and analytical studies, extends to the full LS; scaling is "precocious" for the LS, meaning that it becomes manifest for a much smaller number of particles than the one needed to check the scaling for the MLE. Besides that, the N -1/3 scaling appears to be valid not only for U>Uc , as suggested by theoretical approaches based on a random matrix approximation, but also below a threshold energy Ut ≈0.2. Using a recently proposed method (GALI) devised to rapidly check the chaotic or regular nature of an orbit, we find that Ut is also the energy at which a sharp transition from weak to strong chaos is present in the phase-space of the model. Around this energy the phase of the vector order parameter of the model becomes strongly time dependent, inducing a significant untrapping of particles from a nonlinear resonance.

Chaotic dynamics of Comet 1P/Halley: Lyapunov exponent and survival time expectancy

NASA Astrophysics Data System (ADS)

Muñoz-Gutiérrez, M. A.; Reyes-Ruiz, M.; Pichardo, B.

2015-03-01

The orbital elements of Comet Halley are known to a very high precision, suggesting that the calculation of its future dynamical evolution is straightforward. In this paper we seek to characterize the chaotic nature of the present day orbit of Comet Halley and to quantify the time-scale over which its motion can be predicted confidently. In addition, we attempt to determine the time-scale over which its present day orbit will remain stable. Numerical simulations of the dynamics of test particles in orbits similar to that of Comet Halley are carried out with the MERCURY 6.2 code. On the basis of these we construct survival time maps to assess the absolute stability of Halley's orbit, frequency analysis maps to study the variability of the orbit, and we calculate the Lyapunov exponent for the orbit for variations in initial conditions at the level of the present day uncertainties in our knowledge of its orbital parameters. On the basis of our calculations of the Lyapunov exponent for Comet Halley, the chaotic nature of its motion is demonstrated. The e-folding time-scale for the divergence of initially very similar orbits is approximately 70 yr. The sensitivity of the dynamics on initial conditions is also evident in the self-similarity character of the survival time and frequency analysis maps in the vicinity of Halley's orbit, which indicates that, on average, it is unstable on a time-scale of hundreds of thousands of years. The chaotic nature of Halley's present day orbit implies that a precise determination of its motion, at the level of the present-day observational uncertainty, is difficult to predict on a time-scale of approximately 100 yr. Furthermore, we also find that the ejection of Halley from the Solar system or its collision with another body could occur on a time-scale as short as 10 000 yr.

Optimal solution for travelling salesman problem using heuristic shortest path algorithm with imprecise arc length

NASA Astrophysics Data System (ADS)

Bakar, Sumarni Abu; Ibrahim, Milbah

2017-08-01

The shortest path problem is a popular problem in graph theory. It is about finding a path with minimum length between a specified pair of vertices. In any network the weight of each edge is usually represented in a form of crisp real number and subsequently the weight is used in the calculation of shortest path problem using deterministic algorithms. However, due to failure, uncertainty is always encountered in practice whereby the weight of edge of the network is uncertain and imprecise. In this paper, a modified algorithm which utilized heuristic shortest path method and fuzzy approach is proposed for solving a network with imprecise arc length. Here, interval number and triangular fuzzy number in representing arc length of the network are considered. The modified algorithm is then applied to a specific example of the Travelling Salesman Problem (TSP). Total shortest distance obtained from this algorithm is then compared with the total distance obtained from traditional nearest neighbour heuristic algorithm. The result shows that the modified algorithm can provide not only on the sequence of visited cities which shown to be similar with traditional approach but it also provides a good measurement of total shortest distance which is lesser as compared to the total shortest distance calculated using traditional approach. Hence, this research could contribute to the enrichment of methods used in solving TSP.

Lyapunov-based control of limit cycle oscillations in uncertain aircraft systems

NASA Astrophysics Data System (ADS)

Bialy, Brendan

Store-induced limit cycle oscillations (LCO) affect several fighter aircraft and is expected to remain an issue for next generation fighters. LCO arises from the interaction of aerodynamic and structural forces, however the primary contributor to the phenomenon is still unclear. The practical concerns regarding this phenomenon include whether or not ordnance can be safely released and the ability of the aircrew to perform mission-related tasks while in an LCO condition. The focus of this dissertation is the development of control strategies to suppress LCO in aircraft systems. The first contribution of this work (Chapter 2) is the development of a controller consisting of a continuous Robust Integral of the Sign of the Error (RISE) feedback term with a neural network (NN) feedforward term to suppress LCO behavior in an uncertain airfoil system. The second contribution of this work (Chapter 3) is the extension of the development in Chapter 2 to include actuator saturation. Suppression of LCO behavior is achieved through the implementation of an auxiliary error system that features hyperbolic functions and a saturated RISE feedback control structure. Due to the lack of clarity regarding the driving mechanism behind LCO, common practice in literature and in Chapters 2 and 3 is to replicate the symptoms of LCO by including nonlinearities in the wing structure, typically a nonlinear torsional stiffness. To improve the accuracy of the system model a partial differential equation (PDE) model of a flexible wing is derived (see Appendix F) using Hamilton's principle. Chapters 4 and 5 are focused on developing boundary control strategies for regulating the bending and twisting deformations of the derived model. The contribution of Chapter 4 is the construction of a backstepping-based boundary control strategy for a linear PDE model of an aircraft wing. The backstepping-based strategy transforms the original system to a exponentially stable system. A Lyapunov-based stability

Edge Antimagic Total Labeling on Two Copies of Path

NASA Astrophysics Data System (ADS)

Nurdin; Abrar, A. M.; Bhayangkara, A. R. M.; Muliani; Samsir, A. U.; Nahdi, M. R. An

2018-03-01

A graph G = (V(G), E(G)) denotes the vertex set and the edge set, respectively. A (p,q)-graph G is a graph such that |V(G) | = p and |E(G) | = q. Graph of order p and size q is called (a,d)-edge-anti magic total if there exists a bijection f : V(G) U E(G)→ {1,2,..., p + q} such that the edge weights w(u,v) = f(u) + f(uv) + f(v) form an arithmetic sequence {a, a + d, a + 2d,...,a + (q - 1)d} with the first term a and common difference d. Two copies of path is disjoint union of two path graph with same order (Pn ∪Pn ) denoted by 2Pn . In this paper we construct the (a,d)-edge-anti magic total labeling in two copies of path for some differences d.

The largest Lyapunov exponent of gait in young and elderly individuals: A systematic review.

PubMed

Mehdizadeh, Sina

2018-02-01

The largest Lyapunov exponent (LyE) is an accepted method to quantify gait stability in young and old adults. However, a range of LyE values has been reported in the literature for healthy young and elderly adults in normal walking. Therefore, it has been impractical to use the LyE as a clinical measure of gait stability. The aims of this systematic review were to summarize different methodological approaches of quantifying LyE, as well as to classify LyE values of different body segments and joints in young and elderly individuals during normal walking. The Pubmed, Ovid Medline, Scopus and ISI Web of Knowledge databases were searched using keywords related to gait, stability, variability, and LyE. Only English language articles using the Lyapunov exponent to quantify the stability of healthy normal young and old subjects walking on a level surface were considered. 102 papers were included for full-text review and data extraction. Data associated with the walking surface, data recording method, sampling rate, walking speed, body segments and joints, number of strides/steps, variable type, filtering, time-normalizing, state space dimension, time delay, LyE algorithm, and the LyE values were extracted. The disparity in implementation and calculation of the LyE was from, (i) experiment design, (ii) data pre-processing, and (iii) LyE calculation method. For practical implementation of LyE as a measure of gait stability in clinical settings, a standard and universally accepted approach of calculating LyE is required. Therefore, future studies should look for a standard and generalized procedure to apply and calculate LyE. Copyright © 2017 Elsevier B.V. All rights reserved.

Analytic Quasi-Perodic Cocycles with Singularities and the Lyapunov Exponent of Extended Harper's Model

NASA Astrophysics Data System (ADS)

Jitomirskaya, S.; Marx, C. A.

2012-11-01

We show how to extend (and with what limitations) Avila's global theory of analytic SL(2,C) cocycles to families of cocycles with singularities. This allows us to develop a strategy to determine the Lyapunov exponent for the extended Harper's model, for all values of parameters and all irrational frequencies. In particular, this includes the self-dual regime for which even heuristic results did not previously exist in physics literature. The extension of Avila's global theory is also shown to imply continuous behavior of the LE on the space of analytic {M_2({C})}-cocycles. This includes rational approximation of the frequency, which so far has not been available.

A Very Simple Method to Calculate the (Positive) Largest Lyapunov Exponent Using Interval Extensions

NASA Astrophysics Data System (ADS)

Mendes, Eduardo M. A. M.; Nepomuceno, Erivelton G.

2016-12-01

In this letter, a very simple method to calculate the positive Largest Lyapunov Exponent (LLE) based on the concept of interval extensions and using the original equations of motion is presented. The exponent is estimated from the slope of the line derived from the lower bound error when considering two interval extensions of the original system. It is shown that the algorithm is robust, fast and easy to implement and can be considered as alternative to other algorithms available in the literature. The method has been successfully tested in five well-known systems: Logistic, Hénon, Lorenz and Rössler equations and the Mackey-Glass system.

WEAMR-a weighted energy aware multipath reliable routing mechanism for hotline-based WSNs.

PubMed

Tufail, Ali; Qamar, Arslan; Khan, Adil Mehmood; Baig, Waleed Akram; Kim, Ki-Hyung

2013-05-13

Reliable source to sink communication is the most important factor for an efficient routing protocol especially in domains of military, healthcare and disaster recovery applications. We present weighted energy aware multipath reliable routing (WEAMR), a novel energy aware multipath routing protocol which utilizes hotline-assisted routing to meet such requirements for mission critical applications. The protocol reduces the number of average hops from source to destination and provides unmatched reliability as compared to well known reactive ad hoc protocols i.e., AODV and AOMDV. Our protocol makes efficient use of network paths based on weighted cost calculation and intelligently selects the best possible paths for data transmissions. The path cost calculation considers end to end number of hops, latency and minimum energy node value in the path. In case of path failure path recalculation is done efficiently with minimum latency and control packets overhead. Our evaluation shows that our proposal provides better end-to-end delivery with less routing overhead and higher packet delivery success ratio compared to AODV and AOMDV. The use of multipath also increases overall life time of WSN network using optimum energy available paths between sender and receiver in WDNs.

International Congress NONLINEAR DYNAMICAL ANALYSIS 2007 dedicated to the 150th Anniversary of Academician A. M. Lyapunov

DTIC Science & Technology

2010-05-14

and Coulomb friction. We consider a simple mass spring system submitted to an external force and constrained to remain in a half -space. The contact of... the mass with the boundary of the half -space is assumed to hold with Coulomb friction. The unilateral contact and Coulomb friction laws are strict...Lyapunov frequently discussed this problem with Henry Poincare (1854-1912) and George Darwin (1845 - 1912). They both considered the "pear-form" figure as

Path integral analysis of Jarzynski's equality: Analytical results

NASA Astrophysics Data System (ADS)

Minh, David D. L.; Adib, Artur B.

2009-02-01

We apply path integrals to study nonequilibrium work theorems in the context of Brownian dynamics, deriving in particular the equations of motion governing the most typical and most dominant trajectories. For the analytically soluble cases of a moving harmonic potential and a harmonic oscillator with a time-dependent natural frequency, we find such trajectories, evaluate the work-weighted propagators, and validate Jarzynski’s equality.

Using multiple travel paths to estimate daily travel distance in arboreal, group-living primates.

PubMed

Steel, Ruth Irene

2015-01-01

Primate field studies often estimate daily travel distance (DTD) in order to estimate energy expenditure and/or test foraging hypotheses. In group-living species, the center of mass (CM) method is traditionally used to measure DTD; a point is marked at the group's perceived center of mass at a set time interval or upon each move, and the distance between consecutive points is measured and summed. However, for groups using multiple travel paths, the CM method potentially creates a central path that is shorter than the individual paths and/or traverses unused areas. These problems may compromise tests of foraging hypotheses, since distance and energy expenditure could be underestimated. To better understand the magnitude of these potential biases, I designed and tested the multiple travel paths (MTP) method, in which DTD was calculated by recording all travel paths taken by the group's members, weighting each path's distance based on its proportional use by the group, and summing the weighted distances. To compare the MTP and CM methods, DTD was calculated using both methods in three groups of Udzungwa red colobus monkeys (Procolobus gordonorum; group size 30-43) for a random sample of 30 days between May 2009 and March 2010. Compared to the CM method, the MTP method provided significantly longer estimates of DTD that were more representative of the actual distance traveled and the areas used by a group. The MTP method is more time-intensive and requires multiple observers compared to the CM method. However, it provides greater accuracy for testing ecological and foraging models.

Using path analysis to understand parents' perceptions of their children's weight, physical activity and eating habits in the Champlain region of Ontario.

PubMed

Adamo, Kristi B; Papadakis, Sophia; Dojeiji, Laurie; Turnau, Micheline; Simmons, Louise; Parameswaran, Meena; Cunningham, John; Pipe, Andrew L; Reid, Robert D

2010-11-01

Parents have a fundamental role in promoting the healthy weight of their children. To determine parental perceptions of their child's body weight, eating and physical activity (PA) behaviours, and to test a predictive model of parental perceptions regarding their child's PA and healthy eating behaviours. A random-digit telephone survey was conducted among parents of children four to 12 years of age living in the Champlain region of Ontario. Descriptive statistics were used to summarize the responses. Path analysis was used to identify predictors of parental perceptions of PA and healthy eating. The study sample consisted of 1940 parents/caregivers. Only 0.2% of parents reported their child as being obese; 8.6% reported their child as being overweight. Most parents perceived their child to be physically active and eating healthily. Approximately 25% of parents reported that their child spent 2 h/day or more in front of a screen, and that their child consumed less than three servings of fruits and vegetables daily, and regularly consumed fast food. Variables that correlated with PA perceptions included time spent reading/doing homework, interest in PA, perceived importance of PA, frequency of PA, level of parental PA, participation in organized sport, child weight and parental concern for weight. Variables that predicted perceptions regarding healthy eating were parental education, household income, preparation of home-cooked meals, fruit and vegetable intake, and concern for and influence on the child's weight. Parents in the present study sample did not appear to understand, or had little knowledge of the recommendations for PA and healthy eating in children. Parents appeared to base their judgment of healthy levels of PA or healthy eating behaviours using minimal criteria; these criteria are inconsistent with those used by health professionals to define adequate PA and healthy eating. The present survey highlights an important knowledge gap between scientific

Hardware Simulations of Spacecraft Attitude Synchronization Using Lyapunov-Based Controllers

NASA Astrophysics Data System (ADS)

Jung, Juno; Park, Sang-Young; Eun, Youngho; Kim, Sung-Woo; Park, Chandeok

2018-04-01

In the near future, space missions with multiple spacecraft are expected to replace traditional missions with a single large spacecraft. These spacecraft formation flying missions generally require precise knowledge of relative position and attitude between neighboring agents. In this study, among the several challenging issues, we focus on the technique to control spacecraft attitude synchronization in formation. We develop a number of nonlinear control schemes based on the Lyapunov stability theorem and considering special situations: full-state feedback control, full-state feedback control with unknown inertia parameters, and output feedback control without angular velocity measurements. All the proposed controllers offer absolute and relative control using reaction wheel assembly for both regulator and tracking problems. In addition to the numerical simulations, an air-bearing-based hardware-in-the-loop (HIL) system is used to verify the proposed control laws in real-time hardware environments. The pointing errors converge to 0.5{°} with numerical simulations and to 2{°} using the HIL system. Consequently, both numerical and hardware simulations confirm the performance of the spacecraft attitude synchronization algorithms developed in this study.

A weighted information criterion for multiple minor components and its adaptive extraction algorithms.

PubMed

Gao, Yingbin; Kong, Xiangyu; Zhang, Huihui; Hou, Li'an

2017-05-01

Minor component (MC) plays an important role in signal processing and data analysis, so it is a valuable work to develop MC extraction algorithms. Based on the concepts of weighted subspace and optimum theory, a weighted information criterion is proposed for searching the optimum solution of a linear neural network. This information criterion exhibits a unique global minimum attained if and only if the state matrix is composed of the desired MCs of an autocorrelation matrix of an input signal. By using gradient ascent method and recursive least square (RLS) method, two algorithms are developed for multiple MCs extraction. The global convergences of the proposed algorithms are also analyzed by the Lyapunov method. The proposed algorithms can extract the multiple MCs in parallel and has advantage in dealing with high dimension matrices. Since the weighted matrix does not require an accurate value, it facilitates the system design of the proposed algorithms for practical applications. The speed and computation advantages of the proposed algorithms are verified through simulations. Copyright © 2017 Elsevier Ltd. All rights reserved.

Summarisation of weighted networks

NASA Astrophysics Data System (ADS)

Zhou, Fang; Qu, Qiang; Toivonen, Hannu

2017-09-01

Networks often contain implicit structure. We introduce novel problems and methods that look for structure in networks, by grouping nodes into supernodes and edges to superedges, and then make this structure visible to the user in a smaller generalised network. This task of finding generalisations of nodes and edges is formulated as 'network Summarisation'. We propose models and algorithms for networks that have weights on edges, on nodes or on both, and study three new variants of the network summarisation problem. In edge-based weighted network summarisation, the summarised network should preserve edge weights as well as possible. A wider class of settings is considered in path-based weighted network summarisation, where the resulting summarised network should preserve longer range connectivities between nodes. Node-based weighted network summarisation in turn allows weights also on nodes and summarisation aims to preserve more information related to high weight nodes. We study theoretical properties of these problems and show them to be NP-hard. We propose a range of heuristic generalisation algorithms with different trade-offs between complexity and quality of the result. Comprehensive experiments on real data show that weighted networks can be summarised efficiently with relatively little error.

Importance sampling with imperfect cloning for the computation of generalized Lyapunov exponents

NASA Astrophysics Data System (ADS)

Anteneodo, Celia; Camargo, Sabrina; Vallejos, Raúl O.

2017-12-01

We revisit the numerical calculation of generalized Lyapunov exponents, L (q ) , in deterministic dynamical systems. The standard method consists of adding noise to the dynamics in order to use importance sampling algorithms. Then L (q ) is obtained by taking the limit noise-amplitude → 0 after the calculation. We focus on a particular method that involves periodic cloning and pruning of a set of trajectories. However, instead of considering a noisy dynamics, we implement an imperfect (noisy) cloning. This alternative method is compared with the standard one and, when possible, with analytical results. As a workbench we use the asymmetric tent map, the standard map, and a system of coupled symplectic maps. The general conclusion of this study is that the imperfect-cloning method performs as well as the standard one, with the advantage of preserving the deterministic dynamics.

pathChirp: Efficient Available Bandwidth Estimation for Network Paths

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cottrell, Les

2003-04-30

This paper presents pathChirp, a new active probing tool for estimating the available bandwidth on a communication network path. Based on the concept of ''self-induced congestion,'' pathChirp features an exponential flight pattern of probes we call a chirp. Packet chips offer several significant advantages over current probing schemes based on packet pairs or packet trains. By rapidly increasing the probing rate within each chirp, pathChirp obtains a rich set of information from which to dynamically estimate the available bandwidth. Since it uses only packet interarrival times for estimation, pathChirp does not require synchronous nor highly stable clocks at the sendermore » and receiver. We test pathChirp with simulations and Internet experiments and find that it provides good estimates of the available bandwidth while using only a fraction of the number of probe bytes that current state-of-the-art techniques use.« less

Extended charge banking model of dual path shocks for implantable cardioverter defibrillators

PubMed Central

Dosdall, Derek J; Sweeney, James D

2008-01-01

Background Single path defibrillation shock methods have been improved through the use of the Charge Banking Model of defibrillation, which predicts the response of the heart to shocks as a simple resistor-capacitor (RC) circuit. While dual path defibrillation configurations have significantly reduced defibrillation thresholds, improvements to dual path defibrillation techniques have been limited to experimental observations without a practical model to aid in improving dual path defibrillation techniques. Methods The Charge Banking Model has been extended into a new Extended Charge Banking Model of defibrillation that represents small sections of the heart as separate RC circuits, uses a weighting factor based on published defibrillation shock field gradient measures, and implements a critical mass criteria to predict the relative efficacy of single and dual path defibrillation shocks. Results The new model reproduced the results from several published experimental protocols that demonstrated the relative efficacy of dual path defibrillation shocks. The model predicts that time between phases or pulses of dual path defibrillation shock configurations should be minimized to maximize shock efficacy. Discussion Through this approach the Extended Charge Banking Model predictions may be used to improve dual path and multi-pulse defibrillation techniques, which have been shown experimentally to lower defibrillation thresholds substantially. The new model may be a useful tool to help in further improving dual path and multiple pulse defibrillation techniques by predicting optimal pulse durations and shock timing parameters. PMID:18673561

WEAMR — A Weighted Energy Aware Multipath Reliable Routing Mechanism for Hotline-Based WSNs

PubMed Central

Tufail, Ali; Qamar, Arslan; Khan, Adil Mehmood; Baig, Waleed Akram; Kim, Ki-Hyung

2013-01-01

Reliable source to sink communication is the most important factor for an efficient routing protocol especially in domains of military, healthcare and disaster recovery applications. We present weighted energy aware multipath reliable routing (WEAMR), a novel energy aware multipath routing protocol which utilizes hotline-assisted routing to meet such requirements for mission critical applications. The protocol reduces the number of average hops from source to destination and provides unmatched reliability as compared to well known reactive ad hoc protocols i.e., AODV and AOMDV. Our protocol makes efficient use of network paths based on weighted cost calculation and intelligently selects the best possible paths for data transmissions. The path cost calculation considers end to end number of hops, latency and minimum energy node value in the path. In case of path failure path recalculation is done efficiently with minimum latency and control packets overhead. Our evaluation shows that our proposal provides better end-to-end delivery with less routing overhead and higher packet delivery success ratio compared to AODV and AOMDV. The use of multipath also increases overall life time of WSN network using optimum energy available paths between sender and receiver in WDNs. PMID:23669714

A path model for Whittaker vectors

NASA Astrophysics Data System (ADS)

Di Francesco, Philippe; Kedem, Rinat; Turmunkh, Bolor

2017-06-01

In this paper we construct weighted path models to compute Whittaker vectors in the completion of Verma modules, as well as Whittaker functions of fundamental type, for all finite-dimensional simple Lie algebras, affine Lie algebras, and the quantum algebra U_q(slr+1) . This leads to series expressions for the Whittaker functions. We show how this construction leads directly to the quantum Toda equations satisfied by these functions, and to the q-difference equations in the quantum case. We investigate the critical limit of affine Whittaker functions computed in this way.

Implications of path tolerance and path characteristics on critical vehicle manoeuvres

NASA Astrophysics Data System (ADS)

Lundahl, K.; Frisk, E.; Nielsen, L.

2017-12-01

Path planning and path following are core components in safe autonomous driving. Typically, a path planner provides a path with some tolerance on how tightly the path should be followed. Based on that, and other path characteristics, for example, sharpness of curves, a speed profile needs to be assigned so that the vehicle can stay within the given tolerance without going unnecessarily slow. Here, such trajectory planning is based on optimal control formulations where critical cases arise as on-the-limit solutions. The study focuses on heavy commercial vehicles, causing rollover to be of a major concern, due to the relatively high centre of gravity. Several results are obtained on required model complexity depending on path characteristics, for example, quantification of required path tolerance for a simple model to be sufficient, quantification of when yaw inertia needs to be considered in more detail, and how the curvature rate of change interplays with available friction. Overall, in situations where the vehicle is subject to a wide range of driving conditions, from good transport roads to more tricky avoidance manoeuvres, the requirements on the path following will vary. For this, the provided results form a basis for real-time path following.

The Edge-Disjoint Path Problem on Random Graphs by Message-Passing.

PubMed

Altarelli, Fabrizio; Braunstein, Alfredo; Dall'Asta, Luca; De Bacco, Caterina; Franz, Silvio

2015-01-01

We present a message-passing algorithm to solve a series of edge-disjoint path problems on graphs based on the zero-temperature cavity equations. Edge-disjoint paths problems are important in the general context of routing, that can be defined by incorporating under a unique framework both traffic optimization and total path length minimization. The computation of the cavity equations can be performed efficiently by exploiting a mapping of a generalized edge-disjoint path problem on a star graph onto a weighted maximum matching problem. We perform extensive numerical simulations on random graphs of various types to test the performance both in terms of path length minimization and maximization of the number of accommodated paths. In addition, we test the performance on benchmark instances on various graphs by comparison with state-of-the-art algorithms and results found in the literature. Our message-passing algorithm always outperforms the others in terms of the number of accommodated paths when considering non trivial instances (otherwise it gives the same trivial results). Remarkably, the largest improvement in performance with respect to the other methods employed is found in the case of benchmarks with meshes, where the validity hypothesis behind message-passing is expected to worsen. In these cases, even though the exact message-passing equations do not converge, by introducing a reinforcement parameter to force convergence towards a sub optimal solution, we were able to always outperform the other algorithms with a peak of 27% performance improvement in terms of accommodated paths. On random graphs, we numerically observe two separated regimes: one in which all paths can be accommodated and one in which this is not possible. We also investigate the behavior of both the number of paths to be accommodated and their minimum total length.

The Edge-Disjoint Path Problem on Random Graphs by Message-Passing

PubMed Central

2015-01-01

We present a message-passing algorithm to solve a series of edge-disjoint path problems on graphs based on the zero-temperature cavity equations. Edge-disjoint paths problems are important in the general context of routing, that can be defined by incorporating under a unique framework both traffic optimization and total path length minimization. The computation of the cavity equations can be performed efficiently by exploiting a mapping of a generalized edge-disjoint path problem on a star graph onto a weighted maximum matching problem. We perform extensive numerical simulations on random graphs of various types to test the performance both in terms of path length minimization and maximization of the number of accommodated paths. In addition, we test the performance on benchmark instances on various graphs by comparison with state-of-the-art algorithms and results found in the literature. Our message-passing algorithm always outperforms the others in terms of the number of accommodated paths when considering non trivial instances (otherwise it gives the same trivial results). Remarkably, the largest improvement in performance with respect to the other methods employed is found in the case of benchmarks with meshes, where the validity hypothesis behind message-passing is expected to worsen. In these cases, even though the exact message-passing equations do not converge, by introducing a reinforcement parameter to force convergence towards a sub optimal solution, we were able to always outperform the other algorithms with a peak of 27% performance improvement in terms of accommodated paths. On random graphs, we numerically observe two separated regimes: one in which all paths can be accommodated and one in which this is not possible. We also investigate the behavior of both the number of paths to be accommodated and their minimum total length. PMID:26710102

The Lyapunov-Krasovskii theorem and a sufficient criterion for local stability of isochronal synchronization in networks of delay-coupled oscillators

NASA Astrophysics Data System (ADS)

Grzybowski, J. M. V.; Macau, E. E. N.; Yoneyama, T.

2017-05-01

This paper presents a self-contained framework for the stability assessment of isochronal synchronization in networks of chaotic and limit-cycle oscillators. The results were based on the Lyapunov-Krasovskii theorem and they establish a sufficient condition for local synchronization stability of as a function of the system and network parameters. With this in mind, a network of mutually delay-coupled oscillators subject to direct self-coupling is considered and then the resulting error equations are block-diagonalized for the purpose of studying their stability. These error equations are evaluated by means of analytical stability results derived from the Lyapunov-Krasovskii theorem. The proposed approach is shown to be a feasible option for the investigation of local stability of isochronal synchronization for a variety of oscillators coupled through linear functions of the state variables under a given undirected graph structure. This ultimately permits the systematic identification of stability regions within the high-dimensionality of the network parameter space. Examples of applications of the results to a number of networks of delay-coupled chaotic and limit-cycle oscillators are provided, such as Lorenz, Rössler, Cubic Chua's circuit, Van der Pol oscillator and the Hindmarsh-Rose neuron.

Pulled Motzkin paths

NASA Astrophysics Data System (ADS)

Janse van Rensburg, E. J.

2010-08-01

In this paper the models of pulled Dyck paths in Janse van Rensburg (2010 J. Phys. A: Math. Theor. 43 215001) are generalized to pulled Motzkin path models. The generating functions of pulled Motzkin paths are determined in terms of series over trinomial coefficients and the elastic response of a Motzkin path pulled at its endpoint (see Orlandini and Whittington (2004 J. Phys. A: Math. Gen. 37 5305-14)) is shown to be R(f) = 0 for forces pushing the endpoint toward the adsorbing line and R(f) = f(1 + 2cosh f))/(2sinh f) → f as f → ∞, for forces pulling the path away from the X-axis. In addition, the elastic response of a Motzkin path pulled at its midpoint is shown to be R(f) = 0 for forces pushing the midpoint toward the adsorbing line and R(f) = f(1 + 2cosh (f/2))/sinh (f/2) → 2f as f → ∞, for forces pulling the path away from the X-axis. Formal combinatorial identities arising from pulled Motzkin path models are also presented. These identities are the generalization of combinatorial identities obtained in directed paths models to their natural trinomial counterparts.

Stochastic stability properties of jump linear systems

NASA Technical Reports Server (NTRS)

Feng, Xiangbo; Loparo, Kenneth A.; Ji, Yuandong; Chizeck, Howard J.

1992-01-01

Jump linear systems are defined as a family of linear systems with randomly jumping parameters (usually governed by a Markov jump process) and are used to model systems subject to failures or changes in structure. The authors study stochastic stability properties in jump linear systems and the relationship among various moment and sample path stability properties. It is shown that all second moment stability properties are equivalent and are sufficient for almost sure sample path stability, and a testable necessary and sufficient condition for second moment stability is derived. The Lyapunov exponent method for the study of almost sure sample stability is discussed, and a theorem which characterizes the Lyapunov exponents of jump linear systems is presented.

Path planning of decentralized multi-quadrotor based on fuzzy-cell decomposition algorithm

NASA Astrophysics Data System (ADS)

Iswanto, Wahyunggoro, Oyas; Cahyadi, Adha Imam

2017-04-01

The paper aims to present a design algorithm for multi quadrotor lanes in order to move towards the goal quickly and avoid obstacles in an area with obstacles. There are several problems in path planning including how to get to the goal position quickly and avoid static and dynamic obstacles. To overcome the problem, therefore, the paper presents fuzzy logic algorithm and fuzzy cell decomposition algorithm. Fuzzy logic algorithm is one of the artificial intelligence algorithms which can be applied to robot path planning that is able to detect static and dynamic obstacles. Cell decomposition algorithm is an algorithm of graph theory used to make a robot path map. By using the two algorithms the robot is able to get to the goal position and avoid obstacles but it takes a considerable time because they are able to find the shortest path. Therefore, this paper describes a modification of the algorithms by adding a potential field algorithm used to provide weight values on the map applied for each quadrotor by using decentralized controlled, so that the quadrotor is able to move to the goal position quickly by finding the shortest path. The simulations conducted have shown that multi-quadrotor can avoid various obstacles and find the shortest path by using the proposed algorithms.

Presence of nonlinearity in intracranial EEG recordings: detected by Lyapunov exponents

NASA Astrophysics Data System (ADS)

Liu, Chang-Chia; Shiau, Deng-Shan; Chaovalitwongse, W. Art; Pardalos, Panos M.; Sackellares, J. C.

2007-11-01

In this communication, we performed nonlinearity analysis in the EEG signals recorded from patients with temporal lobe epilepsy (TLE). The largest Lyapunov exponent (Lmax) and phase randomization surrogate data technique were employed to form the statistical test. EEG recordings were acquired invasively from three patients in six brain regions (left and right temporal depth, sub-temporal and orbitofrontal) with 28-32 depth electrodes placed in depth and subdural of the brain. All three patients in this study have unilateral epileptic focus region on the right hippocampus(RH). Nonlinearity was detected by comparing the Lmax profiles of the EEG recordings to its surrogates. The nonlinearity was seen in all different states of the patient with the highest found in post-ictal state. Further our results for all patients exhibited higher degree of differences, quantified by paired t-test, in Lmax values between original and its surrogate from EEG signals recorded from epileptic focus regions. The results of this study demonstrated the Lmax is capable to capture spatio-temporal dynamics that may not be able to detect by linear measurements in the intracranial EEG recordings.

Path integration: effect of curved path complexity and sensory system on blindfolded walking.

PubMed

Koutakis, Panagiotis; Mukherjee, Mukul; Vallabhajosula, Srikant; Blanke, Daniel J; Stergiou, Nicholas

2013-02-01

Path integration refers to the ability to integrate continuous information of the direction and distance traveled by the system relative to the origin. Previous studies have investigated path integration through blindfolded walking along simple paths such as straight line and triangles. However, limited knowledge exists regarding the role of path complexity in path integration. Moreover, little is known about how information from different sensory input systems (like vision and proprioception) contributes to accurate path integration. The purpose of the current study was to investigate how sensory information and curved path complexity affect path integration. Forty blindfolded participants had to accurately reproduce a curved path and return to the origin. They were divided into four groups that differed in the curved path, circle (simple) or figure-eight (complex), and received either visual (previously seen) or proprioceptive (previously guided) information about the path before they reproduced it. The dependent variables used were average trajectory error, walking speed, and distance traveled. The results indicated that (a) both groups that walked on a circular path and both groups that received visual information produced greater accuracy in reproducing the path. Moreover, the performance of the group that received proprioceptive information and later walked on a figure-eight path was less accurate than their corresponding circular group. The groups that had the visual information also walked faster compared to the group that had proprioceptive information. Results of the current study highlight the roles of different sensory inputs while performing blindfolded walking for path integration. Copyright © 2012 Elsevier B.V. All rights reserved.

Heterogeneous path ensembles for conformational transitions in semi–atomistic models of adenylate kinase

PubMed Central

Bhatt, Divesh; Zuckerman, Daniel M.

2010-01-01

We performed “weighted ensemble” path–sampling simulations of adenylate kinase, using several semi–atomistic protein models. The models have an all–atom backbone with various levels of residue interactions. The primary result is that full statistically rigorous path sampling required only a few weeks of single–processor computing time with these models, indicating the addition of further chemical detail should be readily feasible. Our semi–atomistic path ensembles are consistent with previous biophysical findings: the presence of two distinct pathways, identification of intermediates, and symmetry of forward and reverse pathways. PMID:21660120

Zero-Slack, Noncritical Paths

ERIC Educational Resources Information Center

Simons, Jacob V., Jr.

2017-01-01

The critical path method/program evaluation and review technique method of project scheduling is based on the importance of managing a project's critical path(s). Although a critical path is the longest path through a network, its location in large projects is facilitated by the computation of activity slack. However, logical fallacies in…

A Lyapunov and Sacker–Sell spectral stability theory for one-step methods

DOE PAGES

Steyer, Andrew J.; Van Vleck, Erik S.

2018-04-13

Approximation theory for Lyapunov and Sacker–Sell spectra based upon QR techniques is used to analyze the stability of a one-step method solving a time-dependent (nonautonomous) linear ordinary differential equation (ODE) initial value problem in terms of the local error. Integral separation is used to characterize the conditioning of stability spectra calculations. The stability of the numerical solution by a one-step method of a nonautonomous linear ODE using real-valued, scalar, nonautonomous linear test equations is justified. This analysis is used to approximate exponential growth/decay rates on finite and infinite time intervals and establish global error bounds for one-step methods approximating uniformly,more » exponentially stable trajectories of nonautonomous and nonlinear ODEs. A time-dependent stiffness indicator and a one-step method that switches between explicit and implicit Runge–Kutta methods based upon time-dependent stiffness are developed based upon the theoretical results.« less

A Lyapunov and Sacker–Sell spectral stability theory for one-step methods

DOE Office of Scientific and Technical Information (OSTI.GOV)

Steyer, Andrew J.; Van Vleck, Erik S.

Approximation theory for Lyapunov and Sacker–Sell spectra based upon QR techniques is used to analyze the stability of a one-step method solving a time-dependent (nonautonomous) linear ordinary differential equation (ODE) initial value problem in terms of the local error. Integral separation is used to characterize the conditioning of stability spectra calculations. The stability of the numerical solution by a one-step method of a nonautonomous linear ODE using real-valued, scalar, nonautonomous linear test equations is justified. This analysis is used to approximate exponential growth/decay rates on finite and infinite time intervals and establish global error bounds for one-step methods approximating uniformly,more » exponentially stable trajectories of nonautonomous and nonlinear ODEs. A time-dependent stiffness indicator and a one-step method that switches between explicit and implicit Runge–Kutta methods based upon time-dependent stiffness are developed based upon the theoretical results.« less

A Method to Analyze and Optimize the Load Sharing of Split Path Transmissions

NASA Technical Reports Server (NTRS)

Krantz, Timothy L.

1996-01-01

Split-path transmissions are promising alternatives to the common planetary transmissions for rotorcraft. Heretofore, split-path designs proposed for or used in rotorcraft have featured load-sharing devices that add undesirable weight and complexity to the designs. A method was developed to analyze and optimize the load sharing in split-path transmissions without load-sharing devices. The method uses the clocking angle as a design parameter to optimize for equal load sharing. In addition, the clocking angle tolerance necessary to maintain acceptable load sharing can be calculated. The method evaluates the effects of gear-shaft twisting and bending, tooth bending, Hertzian deformations within bearings, and movement of bearing supports on load sharing. It was used to study the NASA split-path test gearbox and the U.S. Army's Comanche helicopter main rotor gearbox. Acceptable load sharing was found to be achievable and maintainable by using proven manufacturing processes. The analytical results compare favorably to available experimental data.

A Lyapunov based approach to energy maximization in renewable energy technologies

NASA Astrophysics Data System (ADS)

Iyasere, Erhun

This dissertation describes the design and implementation of Lyapunov-based control strategies for the maximization of the power captured by renewable energy harnessing technologies such as (i) a variable speed, variable pitch wind turbine, (ii) a variable speed wind turbine coupled to a doubly fed induction generator, and (iii) a solar power generating system charging a constant voltage battery. First, a torque control strategy is presented to maximize wind energy captured in variable speed, variable pitch wind turbines at low to medium wind speeds. The proposed strategy applies control torque to the wind turbine pitch and rotor subsystems to simultaneously control the blade pitch and tip speed ratio, via the rotor angular speed, to an optimum point at which the capture efficiency is maximum. The control method allows for aerodynamic rotor power maximization without exact knowledge of the wind turbine model. A series of numerical results show that the wind turbine can be controlled to achieve maximum energy capture. Next, a control strategy is proposed to maximize the wind energy captured in a variable speed wind turbine, with an internal induction generator, at low to medium wind speeds. The proposed strategy controls the tip speed ratio, via the rotor angular speed, to an optimum point at which the efficiency constant (or power coefficient) is maximal for a particular blade pitch angle and wind speed by using the generator rotor voltage as a control input. This control method allows for aerodynamic rotor power maximization without exact wind turbine model knowledge. Representative numerical results demonstrate that the wind turbine can be controlled to achieve near maximum energy capture. Finally, a power system consisting of a photovoltaic (PV) array panel, dc-to-dc switching converter, charging a battery is considered wherein the environmental conditions are time-varying. A backstepping PWM controller is developed to maximize the power of the solar generating

Multistructural microiteration technique for geometry optimization and reaction path calculation in large systems.

PubMed

Suzuki, Kimichi; Morokuma, Keiji; Maeda, Satoshi

2017-10-05

We propose a multistructural microiteration (MSM) method for geometry optimization and reaction path calculation in large systems. MSM is a simple extension of the geometrical microiteration technique. In conventional microiteration, the structure of the non-reaction-center (surrounding) part is optimized by fixing atoms in the reaction-center part before displacements of the reaction-center atoms. In this method, the surrounding part is described as the weighted sum of multiple surrounding structures that are independently optimized. Then, geometric displacements of the reaction-center atoms are performed in the mean field generated by the weighted sum of the surrounding parts. MSM was combined with the QM/MM-ONIOM method and applied to chemical reactions in aqueous solution or enzyme. In all three cases, MSM gave lower reaction energy profiles than the QM/MM-ONIOM-microiteration method over the entire reaction paths with comparable computational costs. © 2017 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.

Exact Lyapunov exponent of the harmonic magnon modes of one-dimensional Heisenberg-Mattis spin glasses

NASA Astrophysics Data System (ADS)

Sepehrinia, Reza; Niry, M. D.; Bozorg, B.; Tabar, M. Reza Rahimi; Sahimi, Muhammad

2008-03-01

A mapping is developed between the linearized equation of motion for the dynamics of the transverse modes at T=0 of the Heisenberg-Mattis model of one-dimensional (1D) spin glasses and the (discretized) random wave equation. The mapping is used to derive an exact expression for the Lyapunov exponent (LE) of the magnon modes of spin glasses and to show that it follows anomalous scaling at low magnon frequencies. In addition, through numerical simulations, the differences between the LE and the density of states of the wave equation in a discrete 1D model of randomly disordered media (those with a finite correlation length) and that of continuous media (with a zero correlation length) are demonstrated and emphasized.

MinePath: Mining for Phenotype Differential Sub-paths in Molecular Pathways

PubMed Central

Koumakis, Lefteris; Kartsaki, Evgenia; Chatzimina, Maria; Zervakis, Michalis; Vassou, Despoina; Marias, Kostas; Moustakis, Vassilis; Potamias, George

2016-01-01

Pathway analysis methodologies couple traditional gene expression analysis with knowledge encoded in established molecular pathway networks, offering a promising approach towards the biological interpretation of phenotype differentiating genes. Early pathway analysis methodologies, named as gene set analysis (GSA), view pathways just as plain lists of genes without taking into account either the underlying pathway network topology or the involved gene regulatory relations. These approaches, even if they achieve computational efficiency and simplicity, consider pathways that involve the same genes as equivalent in terms of their gene enrichment characteristics. Most recent pathway analysis approaches take into account the underlying gene regulatory relations by examining their consistency with gene expression profiles and computing a score for each profile. Even with this approach, assessing and scoring single-relations limits the ability to reveal key gene regulation mechanisms hidden in longer pathway sub-paths. We introduce MinePath, a pathway analysis methodology that addresses and overcomes the aforementioned problems. MinePath facilitates the decomposition of pathways into their constituent sub-paths. Decomposition leads to the transformation of single-relations to complex regulation sub-paths. Regulation sub-paths are then matched with gene expression sample profiles in order to evaluate their functional status and to assess phenotype differential power. Assessment of differential power supports the identification of the most discriminant profiles. In addition, MinePath assess the significance of the pathways as a whole, ranking them by their p-values. Comparison results with state-of-the-art pathway analysis systems are indicative for the soundness and reliability of the MinePath approach. In contrast with many pathway analysis tools, MinePath is a web-based system (www.minepath.org) offering dynamic and rich pathway visualization functionality, with the

MinePath: Mining for Phenotype Differential Sub-paths in Molecular Pathways.

PubMed

Koumakis, Lefteris; Kanterakis, Alexandros; Kartsaki, Evgenia; Chatzimina, Maria; Zervakis, Michalis; Tsiknakis, Manolis; Vassou, Despoina; Kafetzopoulos, Dimitris; Marias, Kostas; Moustakis, Vassilis; Potamias, George

2016-11-01

Pathway analysis methodologies couple traditional gene expression analysis with knowledge encoded in established molecular pathway networks, offering a promising approach towards the biological interpretation of phenotype differentiating genes. Early pathway analysis methodologies, named as gene set analysis (GSA), view pathways just as plain lists of genes without taking into account either the underlying pathway network topology or the involved gene regulatory relations. These approaches, even if they achieve computational efficiency and simplicity, consider pathways that involve the same genes as equivalent in terms of their gene enrichment characteristics. Most recent pathway analysis approaches take into account the underlying gene regulatory relations by examining their consistency with gene expression profiles and computing a score for each profile. Even with this approach, assessing and scoring single-relations limits the ability to reveal key gene regulation mechanisms hidden in longer pathway sub-paths. We introduce MinePath, a pathway analysis methodology that addresses and overcomes the aforementioned problems. MinePath facilitates the decomposition of pathways into their constituent sub-paths. Decomposition leads to the transformation of single-relations to complex regulation sub-paths. Regulation sub-paths are then matched with gene expression sample profiles in order to evaluate their functional status and to assess phenotype differential power. Assessment of differential power supports the identification of the most discriminant profiles. In addition, MinePath assess the significance of the pathways as a whole, ranking them by their p-values. Comparison results with state-of-the-art pathway analysis systems are indicative for the soundness and reliability of the MinePath approach. In contrast with many pathway analysis tools, MinePath is a web-based system (www.minepath.org) offering dynamic and rich pathway visualization functionality, with the

A Lyapunov method for stability analysis of piecewise-affine systems over non-invariant domains

NASA Astrophysics Data System (ADS)

Rubagotti, Matteo; Zaccarian, Luca; Bemporad, Alberto

2016-05-01

This paper analyses stability of discrete-time piecewise-affine systems, defined on possibly non-invariant domains, taking into account the possible presence of multiple dynamics in each of the polytopic regions of the system. An algorithm based on linear programming is proposed, in order to prove exponential stability of the origin and to find a positively invariant estimate of its region of attraction. The results are based on the definition of a piecewise-affine Lyapunov function, which is in general discontinuous on the boundaries of the regions. The proposed method is proven to lead to feasible solutions in a broader range of cases as compared to a previously proposed approach. Two numerical examples are shown, among which a case where the proposed method is applied to a closed-loop system, to which model predictive control was applied without a-priori guarantee of stability.

Designing Hyperchaotic Cat Maps With Any Desired Number of Positive Lyapunov Exponents.

PubMed

Hua, Zhongyun; Yi, Shuang; Zhou, Yicong; Li, Chengqing; Wu, Yue

2018-02-01

Generating chaotic maps with expected dynamics of users is a challenging topic. Utilizing the inherent relation between the Lyapunov exponents (LEs) of the Cat map and its associated Cat matrix, this paper proposes a simple but efficient method to construct an -dimensional ( -D) hyperchaotic Cat map (HCM) with any desired number of positive LEs. The method first generates two basic -D Cat matrices iteratively and then constructs the final -D Cat matrix by performing similarity transformation on one basic -D Cat matrix by the other. Given any number of positive LEs, it can generate an -D HCM with desired hyperchaotic complexity. Two illustrative examples of -D HCMs were constructed to show the effectiveness of the proposed method, and to verify the inherent relation between the LEs and Cat matrix. Theoretical analysis proves that the parameter space of the generated HCM is very large. Performance evaluations show that, compared with existing methods, the proposed method can construct -D HCMs with lower computation complexity and their outputs demonstrate strong randomness and complex ergodicity.

Triple-Pulsed Two-Micron Integrated Path Differential Absorption Lidar: A New Active Remote Sensing Capability with Path to Space

NASA Technical Reports Server (NTRS)

Singh, Upendra N.; Refaat, Tamer F.; Petros, Mulugeta; Yu, Jirong

2015-01-01

The two-micron wavelength is suitable for monitoring atmospheric water vapor and carbon dioxide, the two most dominant greenhouse gases. Recent advances in 2-micron laser technology paved the way for constructing state-of-the-art lidar transmitters for active remote sensing applications. In this paper, a new triple-pulsed 2-micron integrated path differential absorption lidar is presented. This lidar is capable of measuring either two species or single specie with two different weighting functions, simultaneously and independently. Development of this instrument is conducted at NASA Langley Research Center. Instrument scaling for projected future space missions will be discussed.

Integral transforms of the quantum mechanical path integral: Hit function and path-averaged potential.

PubMed

Edwards, James P; Gerber, Urs; Schubert, Christian; Trejo, Maria Anabel; Weber, Axel

2018-04-01

We introduce two integral transforms of the quantum mechanical transition kernel that represent physical information about the path integral. These transforms can be interpreted as probability distributions on particle trajectories measuring respectively the relative contribution to the path integral from paths crossing a given spatial point (the hit function) and the likelihood of values of the line integral of the potential along a path in the ensemble (the path-averaged potential).

Integral transforms of the quantum mechanical path integral: Hit function and path-averaged potential

NASA Astrophysics Data System (ADS)

Edwards, James P.; Gerber, Urs; Schubert, Christian; Trejo, Maria Anabel; Weber, Axel

2018-04-01

We introduce two integral transforms of the quantum mechanical transition kernel that represent physical information about the path integral. These transforms can be interpreted as probability distributions on particle trajectories measuring respectively the relative contribution to the path integral from paths crossing a given spatial point (the hit function) and the likelihood of values of the line integral of the potential along a path in the ensemble (the path-averaged potential).

The Thinnest Path Problem

DTIC Science & Technology

2016-07-22

their corresponding transmission powers . At first glance, one may wonder whether the thinnest path problem is simply a shortest path problem with the...nature of the shortest path problem. Another aspect that complicates the problem is the choice of the transmission power at each node (within a maximum...fixed transmission power at each node (in this case, the resulting hypergraph degenerates to a standard graph), the thinnest path problem is NP

Exploring Issues of Quality of Service in a Next Generation Internet Testbed: A Case Study Using PathMaster

PubMed Central

Shifman, Mark A.; Sayward, Frederick G.; Mattie, Mark E.; Miller, Perry L.

2002-01-01

This case study describes a project that explores issues of quality of service (QoS) relevant to the next-generation Internet (NGI), using the PathMaster application in a testbed environment. PathMaster is a prototype computer system that analyzes digitized cell images from cytology specimens and compares those images against an image database, returning a ranked set of “similar” cell images from the database. To perform NGI testbed evaluations, we used a cluster of nine parallel computation workstations configured as three subclusters using Cisco routers. This architecture provides a local “simulated Internet” in which we explored the following QoS strategies: (1) first-in-first-out queuing, (2) priority queuing, (3) weighted fair queuing, (4) weighted random early detection, and (5) traffic shaping. The study describes the results of using these strategies with a distributed version of the PathMaster system in the presence of different amounts of competing network traffic and discusses certain of the issues that arise. The goal of the study is to help introduce NGI QoS issues to the Medical Informatics community and to use the PathMaster NGI testbed to illustrate concretely certain of the QoS issues that arise. PMID:12223501

Betweenness centrality in a weighted network

NASA Astrophysics Data System (ADS)

Wang, Huijuan; Hernandez, Javier Martin; van Mieghem, Piet

2008-04-01

When transport in networks follows the shortest paths, the union of all shortest path trees G∪SPT can be regarded as the “transport overlay network.” Overlay networks such as peer-to-peer networks or virtual private networks can be considered as a subgraph of G∪SPT . The traffic through the network is examined by the betweenness Bl of links in the overlay G∪SPT . The strength of disorder can be controlled by, e.g., tuning the extreme value index α of the independent and identically distributed polynomial link weights. In the strong disorder limit (α→0) , all transport flows over a critical backbone, the minimum spanning tree (MST). We investigate the betweenness distributions of wide classes of trees, such as the MST of those well-known network models and of various real-world complex networks. All these trees with different degree distributions (e.g., uniform, exponential, or power law) are found to possess a power law betweenness distribution Pr[Bl=j]˜j-c . The exponent c seems to be positively correlated with the degree variance of the tree and to be insensitive of the size N of a network. In the weak disorder regime, transport in the network traverses many links. We show that a link with smaller link weight tends to carry more traffic. This negative correlation between link weight and betweenness depends on α and the structure of the underlying topology.

Transition path time distribution and the transition path free energy barrier.

PubMed

Pollak, Eli

2016-10-19

The recent experimental measurement of the transition path time distributions of proteins presents several challenges to theory. Firstly, why do the fits of the experimental data to a theoretical expression lead to barrier heights which are much lower than the free energies of activation of the observed transitions? Secondly, there is the theoretical question of determining the transition path time distribution, without invoking the Smoluchowski limit. In this paper, we derive an exact expression for a transition path time distribution which is valid for arbitrary memory friction using the normal mode transformation which underlies Kramers' rate theory. We then recall that for low barriers, there is a noticeable difference between the transition path time distribution obtained with absorbing boundary conditions and free boundary conditions. For the former, the transition times are shorter, since recrossings of the boundaries are disallowed. As a result, if one uses the distribution based on absorbing boundary conditions to fit the experimental data, one will find that the transition path barrier will be larger than the values found based on a theory with free boundary conditions. We then introduce the paradigm of a transition path barrier height, and show that one should always expect it to be much smaller than the activation energy.

Generating functions for weighted Hurwitz numbers

NASA Astrophysics Data System (ADS)

Guay-Paquet, Mathieu; Harnad, J.

2017-08-01

Double Hurwitz numbers enumerating weighted n-sheeted branched coverings of the Riemann sphere or, equivalently, weighted paths in the Cayley graph of Sn generated by transpositions are determined by an associated weight generating function. A uniquely determined 1-parameter family of 2D Toda τ -functions of hypergeometric type is shown to consist of generating functions for such weighted Hurwitz numbers. Four classical cases are detailed, in which the weighting is uniform: Okounkov's double Hurwitz numbers for which the ramification is simple at all but two specified branch points; the case of Belyi curves, with three branch points, two with specified profiles; the general case, with a specified number of branch points, two with fixed profiles, the rest constrained only by the genus; and the signed enumeration case, with sign determined by the parity of the number of branch points. Using the exponentiated quantum dilogarithm function as a weight generator, three new types of weighted enumerations are introduced. These determine quantum Hurwitz numbers depending on a deformation parameter q. By suitable interpretation of q, the statistical mechanics of quantum weighted branched covers may be related to that of Bosonic gases. The standard double Hurwitz numbers are recovered in the classical limit.

The Study of Intelligent Vehicle Navigation Path Based on Behavior Coordination of Particle Swarm.

PubMed

Han, Gaining; Fu, Weiping; Wang, Wen

2016-01-01

In the behavior dynamics model, behavior competition leads to the shock problem of the intelligent vehicle navigation path, because of the simultaneous occurrence of the time-variant target behavior and obstacle avoidance behavior. Considering the safety and real-time of intelligent vehicle, the particle swarm optimization (PSO) algorithm is proposed to solve these problems for the optimization of weight coefficients of the heading angle and the path velocity. Firstly, according to the behavior dynamics model, the fitness function is defined concerning the intelligent vehicle driving characteristics, the distance between intelligent vehicle and obstacle, and distance of intelligent vehicle and target. Secondly, behavior coordination parameters that minimize the fitness function are obtained by particle swarm optimization algorithms. Finally, the simulation results show that the optimization method and its fitness function can improve the perturbations of the vehicle planning path and real-time and reliability.

Transition path time distributions

NASA Astrophysics Data System (ADS)

Laleman, M.; Carlon, E.; Orland, H.

2017-12-01

Biomolecular folding, at least in simple systems, can be described as a two state transition in a free energy landscape with two deep wells separated by a high barrier. Transition paths are the short part of the trajectories that cross the barrier. Average transition path times and, recently, their full probability distribution have been measured for several biomolecular systems, e.g., in the folding of nucleic acids or proteins. Motivated by these experiments, we have calculated the full transition path time distribution for a single stochastic particle crossing a parabolic barrier, including inertial terms which were neglected in previous studies. These terms influence the short time scale dynamics of a stochastic system and can be of experimental relevance in view of the short duration of transition paths. We derive the full transition path time distribution as well as the average transition path times and discuss the similarities and differences with the high friction limit.

Prenatal risk factors influencing childhood BMI and overweight independent of birth weight and infancy BMI: a path analysis within the Danish National Birth Cohort.

PubMed

Morgen, C S; Ängquist, L; Baker, J L; Andersen, A M N; Michaelsen, K F; Sørensen, T I A

2018-04-01

Prenatal risk factors for childhood overweight may operate indirectly through development in body size in early life and/or directly independent hereof. We quantified the effects of maternal and paternal body mass index (BMI), maternal age, socioeconomic position (SEP), parity, gestational weight gain, maternal smoking during pregnancy, caesarean section, birth weight, and BMI at 5 and 12 months on BMI and overweight at 7 and 11 years. Family triads with information on maternal, paternal and child BMI at ages 7 (n=29 374) and 11 years (n=18 044) were selected from the Danish National Birth Cohort. Information originated from maternal interviews and medical health examinations. Path analysis was used to estimate the direct and indirect effects of prenatal risk factors on childhood BMI z-scores (BMIz per unit score of the risk factor). Logistic regression was used to examine associations with overweight. The strongest direct effects on BMIz at age 7 were found for maternal and paternal BMI (0.19 BMIz and 0.14 BMIz per parental BMIz), low SEP (0.08 BMIz), maternal smoking (0.12 BMIz) and higher BMIz at 5 and 12 months (up to 0.19 BMIz per infant BMIz). For BMIz at age 11 with BMIz at age 7 included in the model, similar effects were found, but the direct effects of BMIz at age 5 and 12 months were mediated through BMI at age 7 (0.62 BMIz per BMIz). Same results were found for overweight. The sum of the direct effects can be translated to approximate absolute measures: 2.4 kg at 7 years, 5.7 kg at 11 years, in a child with average height and BMI. Parental BMI, low SEP and smoking during pregnancy have persisting, strong and direct effects on child BMI and overweight independent of birth weight and infancy BMI.

A generalized Lyapunov theory for robust root clustering of linear state space models with real parameter uncertainty

NASA Technical Reports Server (NTRS)

Yedavalli, R. K.

1992-01-01

The problem of analyzing and designing controllers for linear systems subject to real parameter uncertainty is considered. An elegant, unified theory for robust eigenvalue placement is presented for a class of D-regions defined by algebraic inequalities by extending the nominal matrix root clustering theory of Gutman and Jury (1981) to linear uncertain time systems. The author presents explicit conditions for matrix root clustering for different D-regions and establishes the relationship between the eigenvalue migration range and the parameter range. The bounds are all obtained by one-shot computation in the matrix domain and do not need any frequency sweeping or parameter gridding. The method uses the generalized Lyapunov theory for getting the bounds.

Body weight, shame, guilt and oral health: a path analysis model in undergraduate students.

PubMed

Dumitrescu, Alexandrina L; Dogaru, Carmen Beatrice; Duţă, Carmen; Manolescu, B

2011-01-01

The purpose of the present study was to answer the question of whether experiences of shame, guilt and body investment can explain such the association between BMI, oral health behaviours and status in an undergraduate student population-based sample. The study was performed on a sample of 150 first year medical students (19.62 +/- 2.62 years old). Data were collected through a self-administered questionnaire, Weight- and Body-Related Shame and Guilt Scale and Body Investment Scale. 61.3% of students were of normal weight, 21.3% were underweight and 11.3% were overweight. Statistically significant differences were observed between males and females regarding the body mass index (P < 0.0001) and WEB-shame (P < 0.0001). Among females, statically significant higher values of WEB-Shame, WEB-Guilt and lower levels of Body investment were noted among normal weight compared with under-weight students (P < 0.05). The normal-weight female and underweight participants reported statistically significant different frequency of gingival involvement (P < 0.05). Among males, WEB-S was correlated with satisfaction by appearance of own teeth, current extracted teeth and self-reported gum bleeding, while WEB-G, self-reported current extracted teeth, toothbrushing and mouthrinse frequency were also correlated. Among females, WEB-S was correlated with flossing and dental visit frequency. The structural equation model demonstrated a good fit among female students but not among males. These findings highlight the importance of targeting and understanding the realm of body-related self-conscious emotions and the associated links to regulations and health investment behavior.

Path Expressions

DTIC Science & Technology

1975-06-01

ORGANIZATION NAME AND ADDRESS Carnegie-Mellon University Computer Science Dept Pittsburgh, Pa 15213 II. CONTROLLING OFFICE NAMF AND ADDRESS...programmer. Example 1. A communciation between two procasses is initiated by declaring a buffer which can hold a message whose interpretation is Known...words, the functions named in a path are automatically embedded in a critical region specific for that path.) The computation of the next state in

A variational dynamic programming approach to robot-path planning with a distance-safety criterion

NASA Technical Reports Server (NTRS)

Suh, Suk-Hwan; Shin, Kang G.

1988-01-01

An approach to robot-path planning is developed by considering both the traveling distance and the safety of the robot. A computationally-efficient algorithm is developed to find a near-optimal path with a weighted distance-safety criterion by using a variational calculus and dynamic programming (VCDP) method. The algorithm is readily applicable to any factory environment by representing the free workspace as channels. A method for deriving these channels is also proposed. Although it is developed mainly for two-dimensional problems, this method can be easily extended to a class of three-dimensional problems. Numerical examples are presented to demonstrate the utility and power of this method.

Real-time endovascular guidewire position simulation using shortest path algorithms.

PubMed

Schafer, Sebastian; Singh, Vikas; Noël, Peter B; Walczak, Alan M; Xu, Jinhui; Hoffmann, Kenneth R

2009-11-01

Treatment of vascular disease often involves endovascular interventions which use the vascular system for delivering treatment devices via a previously inserted guidewire to the diseased site. Previous studies show relative reproducibility of guidewire position after insertion, indicating that the guidewire position is constrained and could be represented by an energy minimization approach. Such representation would support the surgeon's decision process in guidewire selection. In this paper, we determine the guidewire position using a k-level graph based on 3D vessel information. Guidewire properties are incorporated into the graph as edge weights given by the local bending energy related to the local bending angle. The optimal path through this weighted directed graph is determined using a shortest path algorithm. Volumetric data of two different internal carotid artery phantoms (Ø 3.5-4.6 mm) was acquired. Two guidewires (Ø 0.33 mm) of different material properties (stainless steel, plastic-coated steel core) were inserted into the phantoms. The average RMS distance between actual and simulated guidewire positions varies from 0.9 mm (plastic coated) to 1.3 mm (stainless steel); the computation time to determine the position was <2s. The results indicate that the proposed technique yields reproducible and accurate guidewire positions within a short, clinically relevant time frame. These calculated positions may be useful in facilitating neurovascular interventions.

Influence of a glide path on apical extrusion of debris during canal preparation using single-file systems in curved canals.

PubMed

Topçuoğlu, H S; Düzgün, S; Akpek, F; Topçuoğlu, G; Aktı, A

2016-06-01

To evaluate the effect of a glide path on the amount of apically extruded debris during canal preparation using single-file systems in curved canals. Ninety extracted mandibular molar teeth were randomly assigned to six groups (n = 15 for each group) for canal instrumentation. Endodontic access cavities were prepared in each tooth. In three of the six groups, a glide path was not created whereas a glide path was created using PathFile instruments on the mesial canals of all teeth in the remaining three groups. The mesial canals of the teeth were then instrumented with the following single-file instrument systems: WaveOne, Reciproc and OneShape. Debris extruded apically during instrumentation was collected into pre-weighed Eppendorf tubes. The tubes were then stored in an incubator at 70 °C for 5 days. The weight of the dry extruded debris was established by subtracting the pre-instrumentation and post-instrumentation weight of the Eppendorf tubes for each group. The data obtained were analysed using one-way analysis of variance (anova) and Tukey's post hoc tests. The OneShape file was associated with less debris extrusion than the Reciproc and WaveOne files when canal instrumentation was performed without a glide path (P < 0.05). However, no significant difference was found between the Reciproc and WaveOne files (P > 0.05). There was no significant difference amongst the OneShape, Reciproc and WaveOne files when a glide path was created before canal preparation in curved root canals (P > 0.05). All systems extruded significantly less debris in groups with a glide path than in groups without a glide path (P < 0.05). All instruments were associated with apical extrusion of debris. Creating a glide path prior to canal instrumentation reduced the amount of apically extruded debris in curved canals. © 2015 International Endodontic Journal. Published by John Wiley & Sons Ltd.

Influence of finite-time Lyapunov exponents on winter precipitation over the Iberian Peninsula

NASA Astrophysics Data System (ADS)

Garaboa-Paz, Daniel; Lorenzo, Nieves; Pérez-Muñuzuri, Vicente

2017-05-01

Seasonal forecasts have improved during the last decades, mostly due to an increase in understanding of the coupled ocean-atmosphere dynamics, and the development of models able to predict the atmosphere variability. Correlations between different teleconnection patterns and severe weather in different parts of the world are constantly evolving and changing. This paper evaluates the connection between winter precipitation over the Iberian Peninsula and the large-scale tropospheric mixing over the eastern Atlantic Ocean. Finite-time Lyapunov exponents (FTLEs) have been calculated from 1979 to 2008 to evaluate this mixing. Our study suggests that significant negative correlations exist between summer FTLE anomalies and winter precipitation over Portugal and Spain. To understand the mechanisms behind this correlation, summer anomalies of the FTLE have also been correlated with other climatic variables such as the sea surface temperature (SST), the sea level pressure (SLP) or the geopotential. The East Atlantic (EA) teleconnection index correlates with the summer FTLE anomalies, confirming their role as a seasonal predictor for winter precipitation over the Iberian Peninsula.

The Study of Intelligent Vehicle Navigation Path Based on Behavior Coordination of Particle Swarm

PubMed Central

Han, Gaining; Fu, Weiping; Wang, Wen

2016-01-01

In the behavior dynamics model, behavior competition leads to the shock problem of the intelligent vehicle navigation path, because of the simultaneous occurrence of the time-variant target behavior and obstacle avoidance behavior. Considering the safety and real-time of intelligent vehicle, the particle swarm optimization (PSO) algorithm is proposed to solve these problems for the optimization of weight coefficients of the heading angle and the path velocity. Firstly, according to the behavior dynamics model, the fitness function is defined concerning the intelligent vehicle driving characteristics, the distance between intelligent vehicle and obstacle, and distance of intelligent vehicle and target. Secondly, behavior coordination parameters that minimize the fitness function are obtained by particle swarm optimization algorithms. Finally, the simulation results show that the optimization method and its fitness function can improve the perturbations of the vehicle planning path and real-time and reliability. PMID:26880881

Comparison of weighted and unweighted network analysis in the case of a pig trade network in Northern Germany.

PubMed

Büttner, Kathrin; Krieter, Joachim

2018-08-01

The analysis of trade networks as well as the spread of diseases within these systems focuses mainly on pure animal movements between farms. However, additional data included as edge weights can complement the informational content of the network analysis. However, the inclusion of edge weights can also alter the outcome of the network analysis. Thus, the aim of the study was to compare unweighted and weighted network analyses of a pork supply chain in Northern Germany and to evaluate the impact on the centrality parameters. Five different weighted network versions were constructed by adding the following edge weights: number of trade contacts, number of delivered livestock, average number of delivered livestock per trade contact, geographical distance and reciprocal geographical distance. Additionally, two different edge weight standardizations were used. The network observed from 2013 to 2014 contained 678 farms which were connected by 1,018 edges. General network characteristics including shortest path structure (e.g. identical shortest paths, shortest path lengths) as well as centrality parameters for each network version were calculated. Furthermore, the targeted and the random removal of farms were performed in order to evaluate the structural changes in the networks. All network versions and edge weight standardizations revealed the same number of shortest paths (1,935). Between 94.4 to 98.9% of the unweighted network and the weighted network versions were identical. Furthermore, depending on the calculated centrality parameters and the edge weight standardization used, it could be shown that the weighted network versions differed from the unweighted network (e.g. for the centrality parameters based on ingoing trade contacts) or did not differ (e.g. for the centrality parameters based on the outgoing trade contacts) with regard to the Spearman Rank Correlation and the targeted removal of farms. The choice of standardization method as well as the inclusion or

Non Lyapunov stability of the constant spatially developing 1-D gas flow in presence of solutions having strictly positive exponential growth rate

NASA Astrophysics Data System (ADS)

Balint, Stefan; Balint, Agneta M.

2017-01-01

Different types of stabilities (global, local) and instabilities (global absolute, local convective) of the constant spatially developing 1-D gas flow are analyzed in the phase space of continuously differentiable functions, endowed with the usual algebraic operations and the topology generated by the uniform convergence on the real axis. For this purpose the Euler equations linearized at the constant flow are used. The Lyapunov stability analysis was presented in [1] and this paper is a continuation of [1].

Phase space trajectories and Lyapunov exponents in the dynamics of an alpha-helical protein lattice with intra- and inter-spine interactions

DOE Office of Scientific and Technical Information (OSTI.GOV)

Angelin Jeba, K.; Latha, M. M., E-mail: lathaisaac@yahoo.com; Jain, Sudhir R.

2015-11-15

The nonlinear dynamics of intra- and inter-spine interaction models of alpha-helical proteins is investigated by proposing a Hamiltonian using the first quantized operators. Hamilton's equations of motion are derived, and the dynamics is studied by constructing the trajectories and phase space plots in both cases. The phase space plots display a chaotic behaviour in the dynamics, which opens questions about the relationship between the chaos and exciton-exciton and exciton-phonon interactions. This is verified by plotting the Lyapunov characteristic exponent curves.

Paths to nursing leadership.

PubMed

Bondas, Terese

2006-07-01

The aim was to explore why nurses enter nursing leadership and apply for a management position in health care. The study is part of a research programme in nursing leadership and evidence-based care. Nursing has not invested enough in the development of nursing leadership for the development of patient care. There is scarce research on nurses' motives and reasons for committing themselves to a career in nursing leadership. A strategic sample of 68 Finnish nurse leaders completed a semistructured questionnaire. Analytic induction was applied in an attempt to generate a theory. A theory, Paths to Nursing Leadership, is proposed for further research. Four different paths were found according to variations between the nurse leaders' education, primary commitment and situational factors. They are called the Path of Ideals, the Path of Chance, the Career Path and the Temporary Path. Situational factors and role models of good but also bad nursing leadership besides motivational and educational factors have played a significant role when Finnish nurses have entered nursing leadership. The educational requirements for nurse leaders and recruitment to nursing management positions need serious attention in order to develop a competent nursing leadership.

Analysis of convergence of an evolutionary algorithm with self-adaptation using a stochastic Lyapunov function.

PubMed

Semenov, Mikhail A; Terkel, Dmitri A

2003-01-01

This paper analyses the convergence of evolutionary algorithms using a technique which is based on a stochastic Lyapunov function and developed within the martingale theory. This technique is used to investigate the convergence of a simple evolutionary algorithm with self-adaptation, which contains two types of parameters: fitness parameters, belonging to the domain of the objective function; and control parameters, responsible for the variation of fitness parameters. Although both parameters mutate randomly and independently, they converge to the "optimum" due to the direct (for fitness parameters) and indirect (for control parameters) selection. We show that the convergence velocity of the evolutionary algorithm with self-adaptation is asymptotically exponential, similar to the velocity of the optimal deterministic algorithm on the class of unimodal functions. Although some martingale inequalities have not be proved analytically, they have been numerically validated with 0.999 confidence using Monte-Carlo simulations.

Littelmann path model for geometric crystals, Whittaker functions on Lie groups and Brownian motion

NASA Astrophysics Data System (ADS)

Chhaibi, Reda

2013-02-01

Generally speaking, this thesis focuses on the interplay between the representations of Lie groups and probability theory. It subdivides into essentially three parts. In a first rather algebraic part, we construct a path model for geometric crystals in the sense of Berenstein and Kazhdan, for complex semi-simple Lie groups. We will mainly describe the algebraic structure, its natural morphisms and parameterizations. The theory of total positivity will play a particularly important role. Then, we anticipate on the probabilistic part by exhibiting a canonical measure on geometric crystals. It uses as ingredients the superpotential for the flag manifold and a measure invariant under the crystal actions. The image measure under the weight map plays the role of Duistermaat-Heckman measure. Its Laplace transform defines Whittaker functions, providing an interesting formula for all Lie groups. Then it appears clearly that Whittaker functions are to geometric crystals, what characters are to combinatorial crystals. The Littlewood-Richardson rule is also exposed. Finally we present the probabilistic approach that allows to find the canonical measure. It is based on the fundamental idea that the Wiener measure will induce the adequate measure on the algebraic structures through the path model. In the last chapter, we show how our geometric model degenerates to the continuous classical Littelmann path model and thus recover known results. For example, the canonical measure on a geometric crystal of highest weight degenerates into a uniform measure on a polytope, and recovers the parameterizations of continuous crystals.

a Modified Genetic Algorithm for Finding Fuzzy Shortest Paths in Uncertain Networks

NASA Astrophysics Data System (ADS)

Heidari, A. A.; Delavar, M. R.

2016-06-01

In realistic network analysis, there are several uncertainties in the measurements and computation of the arcs and vertices. These uncertainties should also be considered in realizing the shortest path problem (SPP) due to the inherent fuzziness in the body of expert's knowledge. In this paper, we investigated the SPP under uncertainty to evaluate our modified genetic strategy. We improved the performance of genetic algorithm (GA) to investigate a class of shortest path problems on networks with vague arc weights. The solutions of the uncertain SPP with considering fuzzy path lengths are examined and compared in detail. As a robust metaheuristic, GA algorithm is modified and evaluated to tackle the fuzzy SPP (FSPP) with uncertain arcs. For this purpose, first, a dynamic operation is implemented to enrich the exploration/exploitation patterns of the conventional procedure and mitigate the premature convergence of GA technique. Then, the modified GA (MGA) strategy is used to resolve the FSPP. The attained results of the proposed strategy are compared to those of GA with regard to the cost, quality of paths and CPU times. Numerical instances are provided to demonstrate the success of the proposed MGA-FSPP strategy in comparison with GA. The simulations affirm that not only the proposed technique can outperform GA, but also the qualities of the paths are effectively improved. The results clarify that the competence of the proposed GA is preferred in view of quality quantities. The results also demonstrate that the proposed method can efficiently be utilized to handle FSPP in uncertain networks.

Explicit construction of quadratic Lyapunov functions for the small gain, positivity, circle, and Popov theorems and their application to robust stability

NASA Technical Reports Server (NTRS)

Haddad, Wassim M.; Bernstein, Dennis S.

1991-01-01

Lyapunov function proofs of sufficient conditions for asymptotic stability are given for feedback interconnections of bounded real and positive real transfer functions. Two cases are considered: (1) a proper bounded real (resp., positive real) transfer function with a bounded real (resp., positive real) time-varying memoryless nonlinearity; and (2) two strictly proper bounded real (resp., positive real) transfer functions. A similar treatment is given for the circle and Popov theorems. Application of these results to robust stability with time-varying bounded real, positive real, and sector-bounded uncertainty is discussed.

Novel Approach for Prediction of Localized Necking in Case of Nonlinear Strain Paths

NASA Astrophysics Data System (ADS)

Drotleff, K.; Liewald, M.

2017-09-01

Rising customer expectations regarding design complexity and weight reduction of sheet metal components alongside with further reduced time to market implicate increased demand for process validation using numerical forming simulation. Formability prediction though often is still based on the forming limit diagram first presented in the 1960s. Despite many drawbacks in case of nonlinear strain paths and major advances in research in the recent years, the forming limit curve (FLC) is still one of the most commonly used criteria for assessing formability of sheet metal materials. Especially when forming complex part geometries nonlinear strain paths may occur, which cannot be predicted using the conventional FLC-Concept. In this paper a novel approach for calculation of FLCs for nonlinear strain paths is presented. Combining an interesting approach for prediction of FLC using tensile test data and IFU-FLC-Criterion a model for prediction of localized necking for nonlinear strain paths can be derived. Presented model is purely based on experimental tensile test data making it easy to calibrate for any given material. Resulting prediction of localized necking is validated using an experimental deep drawing specimen made of AA6014 material having a sheet thickness of 1.04 mm. The results are compared to IFU-FLC-Criterion based on data of pre-stretched Nakajima specimen.

On the use of a Euclidean norm function for the estimation of local dynamic stability from 3D kinematics using time-delayed Lyapunov analyses.

PubMed

Beaudette, Shawn M; Howarth, Samuel J; Graham, Ryan B; Brown, Stephen H M

2016-10-01

Several different state-space reconstruction methods have been employed to assess the local dynamic stability (LDS) of a 3D kinematic system. One common method is to use a Euclidean norm (N) transformation of three orthogonal x, y, and z time-series' followed by the calculation of the maximum finite-time Lyapunov exponent (λmax) from the resultant N waveform (using a time-delayed state space reconstruction technique). By essentially acting as a weighted average, N has been suggested to account for simultaneous expansion and contraction along separate degrees of freedom within a 3D system (e.g. the coupling of dynamic movements between orthogonal planes). However, when estimating LDS using N, non-linear transformations inherent within the calculation of N should be accounted for. Results demonstrate that the use of N on 3D time-series data with arbitrary magnitudes of relative bias and zero-crossings cause the introduction of error in estimates of λmax obtained through N. To develop a standard for the analysis of 3D dynamic kinematic waveforms, we suggest that all dimensions of a 3D signal be independently shifted to avoid the incidence of zero-crossings prior to the calculation of N and subsequent estimation of LDS through the use of λmax. Copyright © 2016 IPEM. Published by Elsevier Ltd. All rights reserved.

The relative effects of entry parameters on thermal protection system weight. [space shuttle orbiters

NASA Technical Reports Server (NTRS)

Hirasaki, P. N.

1971-01-01

Shielding a spacecraft from the severe thermal environment of an atmospheric entry requires a sophisticated thermal protection system (TPS). Thermal computer program models were developed for two such TPS designs proposed for the space shuttle orbiter. The multilayer systems, a reusable surface insulation TPS, and a re-radiative metallic skin TPS, were sized for a cross-section of trajectories in the entry corridor. This analysis indicates the relative influence of the entry parameters on the weight of each TPS concept. The results are summarized graphically. The trajectory variables considered were down-range, cross-range, orbit inclination, entry interface velocity and flight path angle, maximum heating rate level, angle of attack, and ballistic coefficient. Variations in cross-range and flight path angle over the ranges considered had virtually no effect on the required entry TPS weight. The TPS weight was significantly more sensitive to variations in angle of attack than to dispersions in the other trajectory considered.

Birth weight and mortality: causality or confounding?

PubMed

Basso, Olga; Wilcox, Allen J; Weinberg, Clarice R

2006-08-15

The association between birth weight and mortality is among the strongest seen in epidemiology. While preterm delivery causes both small babies and high mortality, it does not explain this association. Fetal growth restriction has also been proposed, although its features are unclear because it lacks a definition independent of weight. If, as some postulate, birth weight is not itself on the causal path to mortality, its relation with mortality would have to be explained by confounding factors that decrease birth weight and increase mortality. In this paper, the authors explore the characteristics such confounders would require in order to achieve the observed association between birth weight and mortality. Through a simple simulation, they found that the observed steep gradient of risk for small babies at term can be produced by a rare condition or conditions (with a total prevalence of 0.5%) having profound effects on both fetal growth (-1.7 standard deviations) and mortality (relative risk = 160). Candidate conditions might include malformations, fetal or placental aneuploidy, infections, or imprinting disorders. If such rare factors underlie the association of birth weight with mortality, it would have broad implications for the study of fetal growth restriction and birth weight, and for the prevention of infant mortality.

DiversePathsJ: diverse shortest paths for bioimage analysis.

PubMed

Uhlmann, Virginie; Haubold, Carsten; Hamprecht, Fred A; Unser, Michael

2018-02-01

We introduce a formulation for the general task of finding diverse shortest paths between two end-points. Our approach is not linked to a specific biological problem and can be applied to a large variety of images thanks to its generic implementation as a user-friendly ImageJ/Fiji plugin. It relies on the introduction of additional layers in a Viterbi path graph, which requires slight modifications to the standard Viterbi algorithm rules. This layered graph construction allows for the specification of various constraints imposing diversity between solutions. The software allows obtaining a collection of diverse shortest paths under some user-defined constraints through a convenient and user-friendly interface. It can be used alone or be integrated into larger image analysis pipelines. http://bigwww.epfl.ch/algorithms/diversepathsj. michael.unser@epfl.ch or fred.hamprecht@iwr.uni-heidelberg.de. Supplementary data are available at Bioinformatics online. © The Author(s) 2017. Published by Oxford University Press.

A path following algorithm for the graph matching problem.

PubMed

Zaslavskiy, Mikhail; Bach, Francis; Vert, Jean-Philippe

2009-12-01

We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted graph matching problem as a least-square problem on the set of permutation matrices and relaxing it to two different optimization problems: a quadratic convex and a quadratic concave optimization problem on the set of doubly stochastic matrices. The concave relaxation has the same global minimum as the initial graph matching problem, but the search for its global minimum is also a hard combinatorial problem. We, therefore, construct an approximation of the concave problem solution by following a solution path of a convex-concave problem obtained by linear interpolation of the convex and concave formulations, starting from the convex relaxation. This method allows to easily integrate the information on graph label similarities into the optimization problem, and therefore, perform labeled weighted graph matching. The algorithm is compared with some of the best performing graph matching methods on four data sets: simulated graphs, QAPLib, retina vessel images, and handwritten Chinese characters. In all cases, the results are competitive with the state of the art.

Graph drawing using tabu search coupled with path relinking.

PubMed

Dib, Fadi K; Rodgers, Peter

2018-01-01

Graph drawing, or the automatic layout of graphs, is a challenging problem. There are several search based methods for graph drawing which are based on optimizing an objective function which is formed from a weighted sum of multiple criteria. In this paper, we propose a new neighbourhood search method which uses a tabu search coupled with path relinking to optimize such objective functions for general graph layouts with undirected straight lines. To our knowledge, before our work, neither of these methods have been previously used in general multi-criteria graph drawing. Tabu search uses a memory list to speed up searching by avoiding previously tested solutions, while the path relinking method generates new solutions by exploring paths that connect high quality solutions. We use path relinking periodically within the tabu search procedure to speed up the identification of good solutions. We have evaluated our new method against the commonly used neighbourhood search optimization techniques: hill climbing and simulated annealing. Our evaluation examines the quality of the graph layout (objective function's value) and the speed of layout in terms of the number of evaluated solutions required to draw a graph. We also examine the relative scalability of each method. Our experimental results were applied to both random graphs and a real-world dataset. We show that our method outperforms both hill climbing and simulated annealing by producing a better layout in a lower number of evaluated solutions. In addition, we demonstrate that our method has greater scalability as it can layout larger graphs than the state-of-the-art neighbourhood search methods. Finally, we show that similar results can be produced in a real world setting by testing our method against a standard public graph dataset.

Graph drawing using tabu search coupled with path relinking

PubMed Central

Rodgers, Peter

2018-01-01

Graph drawing, or the automatic layout of graphs, is a challenging problem. There are several search based methods for graph drawing which are based on optimizing an objective function which is formed from a weighted sum of multiple criteria. In this paper, we propose a new neighbourhood search method which uses a tabu search coupled with path relinking to optimize such objective functions for general graph layouts with undirected straight lines. To our knowledge, before our work, neither of these methods have been previously used in general multi-criteria graph drawing. Tabu search uses a memory list to speed up searching by avoiding previously tested solutions, while the path relinking method generates new solutions by exploring paths that connect high quality solutions. We use path relinking periodically within the tabu search procedure to speed up the identification of good solutions. We have evaluated our new method against the commonly used neighbourhood search optimization techniques: hill climbing and simulated annealing. Our evaluation examines the quality of the graph layout (objective function’s value) and the speed of layout in terms of the number of evaluated solutions required to draw a graph. We also examine the relative scalability of each method. Our experimental results were applied to both random graphs and a real-world dataset. We show that our method outperforms both hill climbing and simulated annealing by producing a better layout in a lower number of evaluated solutions. In addition, we demonstrate that our method has greater scalability as it can layout larger graphs than the state-of-the-art neighbourhood search methods. Finally, we show that similar results can be produced in a real world setting by testing our method against a standard public graph dataset. PMID:29746576

Generic Equations for Constructing Smooth Paths Along Circles and Tangent Lines With Application to Airport Ground Paths

NASA Technical Reports Server (NTRS)

Barker, L. Keith

1998-01-01

The primary purpose of this publication is to develop a mathematical model to describe smooth paths along any combination of circles and tangent lines. Two consecutive circles in a path are either tangent (externally or internally) or they appear on the same (lateral) or opposite (transverse) sides of a connecting tangent line. A path may start or end on either a segment or circle. The approach is to use mathematics common to robotics to design the path as a multilink manipulator. This approach allows a hierarchical view of the problem and keeps the notation manageable. A user simply specifies a few parameters to configure a path. Necessary and sufficient conditions automatically ensure the consistency of the inputs for a smooth path. Two example runway exit paths are given, and an angle to go assists in knowing when to switch from one path element to the next.

Path querying system on mobile devices

NASA Astrophysics Data System (ADS)

Lin, Xing; Wang, Yifei; Tian, Yuan; Wu, Lun

2006-01-01

Traditional approaches to path querying problems are not efficient and convenient under most circumstances. A more convenient and reliable approach to this problem has to be found. This paper is devoted to a path querying solution on mobile devices. By using an improved Dijkstra's shortest path algorithm and a natural language translating module, this system can help people find the shortest path between two places through their cell phones or other mobile devices. The chosen path is prompted in text of natural language, as well as a map picture. This system would be useful in solving best path querying problems and have potential to be a profitable business system.

Spreading paths in partially observed social networks

NASA Astrophysics Data System (ADS)

Onnela, Jukka-Pekka; Christakis, Nicholas A.

2012-03-01

Understanding how and how far information, behaviors, or pathogens spread in social networks is an important problem, having implications for both predicting the size of epidemics, as well as for planning effective interventions. There are, however, two main challenges for inferring spreading paths in real-world networks. One is the practical difficulty of observing a dynamic process on a network, and the other is the typical constraint of only partially observing a network. Using static, structurally realistic social networks as platforms for simulations, we juxtapose three distinct paths: (1) the stochastic path taken by a simulated spreading process from source to target; (2) the topologically shortest path in the fully observed network, and hence the single most likely stochastic path, between the two nodes; and (3) the topologically shortest path in a partially observed network. In a sampled network, how closely does the partially observed shortest path (3) emulate the unobserved spreading path (1)? Although partial observation inflates the length of the shortest path, the stochastic nature of the spreading process also frequently derails the dynamic path from the shortest path. We find that the partially observed shortest path does not necessarily give an inflated estimate of the length of the process path; in fact, partial observation may, counterintuitively, make the path seem shorter than it actually is.

Spreading paths in partially observed social networks.

PubMed

Onnela, Jukka-Pekka; Christakis, Nicholas A

2012-03-01

Understanding how and how far information, behaviors, or pathogens spread in social networks is an important problem, having implications for both predicting the size of epidemics, as well as for planning effective interventions. There are, however, two main challenges for inferring spreading paths in real-world networks. One is the practical difficulty of observing a dynamic process on a network, and the other is the typical constraint of only partially observing a network. Using static, structurally realistic social networks as platforms for simulations, we juxtapose three distinct paths: (1) the stochastic path taken by a simulated spreading process from source to target; (2) the topologically shortest path in the fully observed network, and hence the single most likely stochastic path, between the two nodes; and (3) the topologically shortest path in a partially observed network. In a sampled network, how closely does the partially observed shortest path (3) emulate the unobserved spreading path (1)? Although partial observation inflates the length of the shortest path, the stochastic nature of the spreading process also frequently derails the dynamic path from the shortest path. We find that the partially observed shortest path does not necessarily give an inflated estimate of the length of the process path; in fact, partial observation may, counterintuitively, make the path seem shorter than it actually is.

Three-in-one weight, height and body mass index charts for children and adults.

PubMed

Elizabeth, K E; Muraleedharan, Manu

2003-08-01

The aim of the study was to develop four appropriate three-in-one weight, height and built in body mass index (BMI) charts, for under-fives, 0-5-year-olds, > 5-10-year-olds, > 10-18-year-olds, and adults and to delineate the normal range, underweight, overweight and obesity on the above charts. Four different charts were designed for the various age groups as indicated above. Height was made available on the x-axis, weight on the y-axis, and corresponding BMI values on the right margin. Shading of the normal range to denote the health path and marking of the cut-off curves to denote normal status, overweight, and obesity were done selecting appropriate round figures to suit both sexes in accordance with the International Obesity Task Force (IOTF) recommendations for the various age groups. Field trials were done on appropriate subjects belonging to various age groups. 500 in each group with equal male to female ratio. The field trials showed that all the studied subjects belonging to both sexes came within the purview of the chart and those with normal nutritional status, underweight, overweight, and obesity could easily be identified looking at the chart without doing any further calculation. Early intervention also could be advised as the chart could demonstrate how much weight should be gained or reduced to come within the health path. In conclusion, the charts are applicable to both sexes and are user friendly. These are appropriate for general screening of nutritional status and to determine underweight, overweight, and obesity from birth to adulthood. They give a visual display of the ideal health path with respect to weight, height, and BMI and the adjustment in weight required to reach the normal range.

Enzymatic reaction paths as determined by transition path sampling

NASA Astrophysics Data System (ADS)

Masterson, Jean Emily

Enzymes are biological catalysts capable of enhancing the rates of chemical reactions by many orders of magnitude as compared to solution chemistry. Since the catalytic power of enzymes routinely exceeds that of the best artificial catalysts available, there is much interest in understanding the complete nature of chemical barrier crossing in enzymatic reactions. Two specific questions pertaining to the source of enzymatic rate enhancements are investigated in this work. The first is the issue of how fast protein motions of an enzyme contribute to chemical barrier crossing. Our group has previously identified sub-picosecond protein motions, termed promoting vibrations (PVs), that dynamically modulate chemical transformation in several enzymes. In the case of human heart lactate dehydrogenase (hhLDH), prior studies have shown that a specific axis of residues undergoes a compressional fluctuation towards the active site, decreasing a hydride and a proton donor--acceptor distance on a sub-picosecond timescale to promote particle transfer. To more thoroughly understand the contribution of this dynamic motion to the enzymatic reaction coordinate of hhLDH, we conducted transition path sampling (TPS) using four versions of the enzymatic system: a wild type enzyme with natural isotopic abundance; a heavy enzyme where all the carbons, nitrogens, and non-exchangeable hydrogens were replaced with heavy isotopes; and two versions of the enzyme with mutations in the axis of PV residues. We generated four separate ensembles of reaction paths and analyzed each in terms of the reaction mechanism, time of barrier crossing, dynamics of the PV, and residues involved in the enzymatic reaction coordinate. We found that heavy isotopic substitution of hhLDH altered the sub-picosecond dynamics of the PV, changed the favored reaction mechanism, dramatically increased the time of barrier crossing, but did not have an effect on the specific residues involved in the PV. In the mutant systems

Dynamic stability of running: The effects of speed and leg amputations on the maximal Lyapunov exponent

DOE Office of Scientific and Technical Information (OSTI.GOV)

Look, Nicole; Arellano, Christopher J.; Grabowski, Alena M.

2013-12-15

In this paper, we study dynamic stability during running, focusing on the effects of speed, and the use of a leg prosthesis. We compute and compare the maximal Lyapunov exponents of kinematic time-series data from subjects with and without unilateral transtibial amputations running at a wide range of speeds. We find that the dynamics of the affected leg with the running-specific prosthesis are less stable than the dynamics of the unaffected leg and also less stable than the biological legs of the non-amputee runners. Surprisingly, we find that the center-of-mass dynamics of runners with two intact biological legs are slightlymore » less stable than those of runners with amputations. Our results suggest that while leg asymmetries may be associated with instability, runners may compensate for this effect by increased control of their center-of-mass dynamics.« less

Cooperative organic mine avoidance path planning

NASA Astrophysics Data System (ADS)

McCubbin, Christopher B.; Piatko, Christine D.; Peterson, Adam V.; Donnald, Creighton R.; Cohen, David

2005-06-01

The JHU/APL Path Planning team has developed path planning techniques to look for paths that balance the utility and risk associated with different routes through a minefield. Extending on previous years' efforts, we investigated real-world Naval mine avoidance requirements and developed a tactical decision aid (TDA) that satisfies those requirements. APL has developed new mine path planning techniques using graph based and genetic algorithms which quickly produce near-minimum risk paths for complicated fitness functions incorporating risk, path length, ship kinematics, and naval doctrine. The TDA user interface, a Java Swing application that obtains data via Corba interfaces to path planning databases, allows the operator to explore a fusion of historic and in situ mine field data, control the path planner, and display the planning results. To provide a context for the minefield data, the user interface also renders data from the Digital Nautical Chart database, a database created by the National Geospatial-Intelligence Agency containing charts of the world's ports and coastal regions. This TDA has been developed in conjunction with the COMID (Cooperative Organic Mine Defense) system. This paper presents a description of the algorithms, architecture, and application produced.

Optimization of aeromedical base locations in New Mexico using a model that considers crash nodes and paths.

PubMed

Erdemir, Elif Tokar; Batta, Rajan; Spielman, Seth; Rogerson, Peter A; Blatt, Alan; Flanigan, Marie

2008-05-01

In a recent paper, Tokar Erdemir et al. (2008) introduce models for service systems with service requests originating from both nodes and paths. We demonstrate how to apply and extend their approach to an aeromedical base location application, with specific focus on the state of New Mexico (NM). The current aeromedical base locations of NM are selected without considering motor vehicle crash paths. Crash paths are the roads on which crashes occur, where each road segment has a weight signifying relative crash occurrence. We analyze the loss in accident coverage and location error for current aeromedical base locations. We also provide insights on the relevance of considering crash paths when selecting aeromedical base locations. Additionally, we look briefly at some of the tradeoff issues in locating additional trauma centers vs. additional aeromedical bases in the current aeromedical system of NM. Not surprisingly, tradeoff analysis shows that by locating additional aeromedical bases, we always attain the required coverage level with a lower cost than with locating additional trauma centers.

Formal language constrained path problems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Barrett, C.; Jacob, R.; Marathe, M.

1997-07-08

In many path finding problems arising in practice, certain patterns of edge/vertex labels in the labeled graph being traversed are allowed/preferred, while others are disallowed. Motivated by such applications as intermodal transportation planning, the authors investigate the complexity of finding feasible paths in a labeled network, where the mode choice for each traveler is specified by a formal language. The main contributions of this paper include the following: (1) the authors show that the problem of finding a shortest path between a source and destination for a traveler whose mode choice is specified as a context free language is solvablemore » efficiently in polynomial time, when the mode choice is specified as a regular language they provide algorithms with improved space and time bounds; (2) in contrast, they show that the problem of finding simple paths between a source and a given destination is NP-hard, even when restricted to very simple regular expressions and/or very simple graphs; (3) for the class of treewidth bounded graphs, they show that (i) the problem of finding a regular language constrained simple path between source and a destination is solvable in polynomial time and (ii) the extension to finding context free language constrained simple paths is NP-complete. Several extensions of these results are presented in the context of finding shortest paths with additional constraints. These results significantly extend the results in [MW95]. As a corollary of the results, they obtain a polynomial time algorithm for the BEST k-SIMILAR PATH problem studied in [SJB97]. The previous best algorithm was given by [SJB97] and takes exponential time in the worst case.« less

Time optimal paths for high speed maneuvering

DOE Office of Scientific and Technical Information (OSTI.GOV)

Reister, D.B.; Lenhart, S.M.

1993-01-01

Recent theoretical results have completely solved the problem of determining the minimum length path for a vehicle with a minimum turning radius moving from an initial configuration to a final configuration. Time optimal paths for a constant speed vehicle are a subset of the minimum length paths. This paper uses the Pontryagin maximum principle to find time optimal paths for a constant speed vehicle. The time optimal paths consist of sequences of axes of circles and straight lines. The maximum principle introduces concepts (dual variables, bang-bang solutions, singular solutions, and transversality conditions) that provide important insight into the nature ofmore » the time optimal paths. We explore the properties of the optimal paths and present some experimental results for a mobile robot following an optimal path.« less

Tortuous path chemical preconcentrator

DOEpatents

Manginell, Ronald P.; Lewis, Patrick R.; Adkins, Douglas R.; Wheeler, David R.; Simonson, Robert J.

2010-09-21

A non-planar, tortuous path chemical preconcentrator has a high internal surface area having a heatable sorptive coating that can be used to selectively collect and concentrate one or more chemical species of interest from a fluid stream that can be rapidly released as a concentrated plug into an analytical or microanalytical chain for separation and detection. The non-planar chemical preconcentrator comprises a sorptive support structure having a tortuous flow path. The tortuosity provides repeated twists, turns, and bends to the flow, thereby increasing the interfacial contact between sample fluid stream and the sorptive material. The tortuous path also provides more opportunities for desorption and readsorption of volatile species. Further, the thermal efficiency of the tortuous path chemical preconcentrator is comparable or superior to the prior non-planar chemical preconcentrator. Finally, the tortuosity can be varied in different directions to optimize flow rates during the adsorption and desorption phases of operation of the preconcentrator.

Arena geometry and path shape: when rats travel in straight or in circuitous paths?

PubMed

Yaski, Osnat; Portugali, Juval; Eilam, David

2011-12-01

We show here that the global geometry of the environment affects the shape of the paths of travel in rats. To examine this, individual rats were introduced into an unfamiliar arena. One group of rats (n=8) was tested in a square arena (2 m × 2 m), and the other group (n=8) in a round arena (2 m diameter). Testing was in a total darkness, since in the absence of visual information the geometry is not perceived immediately and the extraction of environment shape is slower. We found that while the level of the rats' activity did not seem to differ between both arenas, path shape differed significantly. When traveling along the perimeter, path shape basically followed the arena walls, with perimeter paths curving along the walls of the round arena, while being straight along the walls of the square arena. A similar impact of arena geometry was observed for travel away from the arena walls. Indeed, when the rats abandoned the arena walls to crosscut through the center of the arena, their center paths were circuitous in the round arena and relatively straight in the square arena. We suggest that the shapes of these paths are exploited for the same spatial task: returning back to a familiar location in the unsighted environment. Copyright © 2011 Elsevier B.V. All rights reserved.

Interrelationship and path coefficient analysis of yield components in F4 progenies of tef (Eragrostis tef).

PubMed

Debebe, Abel; Singh, Harijat; Tefera, Hailu

2014-01-01

This experiment was conducted at Debre Zeit and Akaki during 2004-2005 cropping season on F2-derived F4 bulk families of three crosses, viz, DZ-01-974 x DZ-01-2786, DZ-01-974 x DZ-Cr-37 and Alba x Kaye Murri. To estimate the correlations and path coefficients between yield and yield components, 63 F4 families were taken randomly from each of the three crosses. The 189 F4 families, five parents and two checks were space planted following in 14 x 14 simple lattice design. Study of associations among traits indicated that yield was positively associated with shoot biomass, harvest index, lodging index and panicle kernel weight at phenotypic level at Debre Zeit. At Akaki, yield had significant positive correlation with shoot biomass, harvest index, plant height, panicle length and panicle weight. At genotypic level, grain yield per plot exhibited positive association with harvest index, shoot biomass, lodging index and panicle kernel weight at Debre Zeit. By contrast, days to heading, days to maturity, plant height and panicle length showed negative association with yield. At Akaki, kernel yield per plot was positively correlated at genotypic level with all the traits considered where lodging index had the highest correlation followed by shoot biomass, panicle kernel weight and harvest index. Path coefficient analysis at both phenotypic and genotypic levels for both the locations suggested those shoot biomass and harvest indexes are the two important yield determining traits. These two traits might be useful in indirect selection for yield improvement in the material generated from the three crosses under consideration.

Path-Goal Theory of Leadership

DTIC Science & Technology

1975-04-01

PATH-GOAL THEORY OF LEADERSHIP Robert J. House, et al Washington University AD-A009 513 Prepared for: Office of Naval Research April 1975...NUMBER^ READ »ITRUCTIONS BEFORE COMPLETING FORM *- TITLE (mö Submit) PATH-GOAL THEORY OF LEADERSHIP t. TYPE OF REPORT ft PERIOD COVERED... Theory -Contingency Factors - Leadership Style 20. ABSTRACT (Conllnuo an rmvttc cmy an« Idonlllr kr Meek mmtbor) The paper reviews the path-goal

a Walking Disturbance Index Suggestions for Optimized Path Search for the People with Reduced Mobility

NASA Astrophysics Data System (ADS)

Moon, M.; Bang, Y.; Yu, K.; Kim, J.

2015-10-01

Recently, due to the increased penetration of smart devices and the development of geographic information system (GIS) technology, various route guidance services for pedestrians have been developed. However, until now, pedestrian navigation services for the people with reduced mobility (people who experience discomfort in transportation) including wheelchair users, the elderly, and pregnant women have not been provided. In this study, we present a walking disturbance index methodology for searching an optimized path for the people with reduced mobility by defining the factors that affect the walking of the people with reduced mobility and deriving the weights of these factors. In future research, we expect to be able to provide a navigation system that gives an optimized path for the people with reduced mobility using this method.

Optimal scheduling and its Lyapunov stability for advanced load-following energy plants with CO 2 capture

DOE PAGES

Bankole, Temitayo; Jones, Dustin; Bhattacharyya, Debangsu; ...

2017-11-03

In this study, a two-level control methodology consisting of an upper-level scheduler and a lower-level supervisory controller is proposed for an advanced load-following energy plant with CO 2 capture. With the use of an economic objective function that considers fluctuation in electricity demand and price at the upper level, optimal scheduling of energy plant electricity production and carbon capture with respect to several carbon tax scenarios is implemented. The optimal operational profiles are then passed down to corresponding lower-level supervisory controllers designed using a methodological approach that balances control complexity with performance. Finally, it is shown how optimal carbon capturemore » and electricity production rate profiles for an energy plant such as the integrated gasification combined cycle (IGCC) plant are affected by electricity demand and price fluctuations under different carbon tax scenarios. As a result, the paper also presents a Lyapunov stability analysis of the proposed scheme.« less

Optimal scheduling and its Lyapunov stability for advanced load-following energy plants with CO 2 capture

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bankole, Temitayo; Jones, Dustin; Bhattacharyya, Debangsu

In this study, a two-level control methodology consisting of an upper-level scheduler and a lower-level supervisory controller is proposed for an advanced load-following energy plant with CO 2 capture. With the use of an economic objective function that considers fluctuation in electricity demand and price at the upper level, optimal scheduling of energy plant electricity production and carbon capture with respect to several carbon tax scenarios is implemented. The optimal operational profiles are then passed down to corresponding lower-level supervisory controllers designed using a methodological approach that balances control complexity with performance. Finally, it is shown how optimal carbon capturemore » and electricity production rate profiles for an energy plant such as the integrated gasification combined cycle (IGCC) plant are affected by electricity demand and price fluctuations under different carbon tax scenarios. As a result, the paper also presents a Lyapunov stability analysis of the proposed scheme.« less

Correlation between the Hurst exponent and the maximal Lyapunov exponent: Examining some low-dimensional conservative maps

NASA Astrophysics Data System (ADS)

Tarnopolski, Mariusz

2018-01-01

The Chirikov standard map and the 2D Froeschlé map are investigated. A few thousand values of the Hurst exponent (HE) and the maximal Lyapunov exponent (mLE) are plotted in a mixed space of the nonlinear parameter versus the initial condition. Both characteristic exponents reveal remarkably similar structures in this space. A tight correlation between the HEs and mLEs is found, with the Spearman rank ρ = 0 . 83 and ρ = 0 . 75 for the Chirikov and 2D Froeschlé maps, respectively. Based on this relation, a machine learning (ML) procedure, using the nearest neighbor algorithm, is performed to reproduce the HE distribution based on the mLE distribution alone. A few thousand HE and mLE values from the mixed spaces were used for training, and then using 2 - 2 . 4 × 105 mLEs, the HEs were retrieved. The ML procedure allowed to reproduce the structure of the mixed spaces in great detail.

Psychological Factors Associated with Weight Loss in Obese and Severely Obese Women in a Behavioral Physical Activity Intervention

ERIC Educational Resources Information Center

Annesi, James J.; Whitaker, Ann C.

2010-01-01

The behavioral processes of weight reduction are poorly understood, and responses to treatments based primarily on caloric restriction have been unfavorable. A theory-based path derived from proposed relations of physical activity, changes in psychological factors, and weight loss was separately tested with women with Class I and Class II obesity…

Torsional and cyclic fatigue resistances of glide path preparation instruments: G-file and PathFile.

PubMed

Sung, Sang Yup; Ha, Jung-Hong; Kwak, Sang-Won; Abed, Rashid El; Byeon, Kyeongmin; Kim, Hyeon-Cheol

2014-01-01

This study aimed to compare cyclic fatigue and torsional resistances of glide path creating instruments with different tapers and tip sizes. Two sizes (G1 and G2) from G-File system and three sizes (PathFile #1, #2, and #3) from PathFile system were used for torsional resistance and cyclic fatigue resistance tests (n = 10). The torsional resistance was evaluated at 2-, 3-, 4-, 5-, and 6-mm from the file tip by plotting the torsional load changes until fracture by rotational loading of 2 rpm. The cyclic fatigue resistance was compared by measuring the number of cycles to failure. Data were analyzed statistically using one-way ANOVA and Duncan's post-hoc comparison. The length of the fractured file fragment was also measured. All fractured fragments were observed under a scanning electron microscope (SEM). Although G-2 file showed a lower torsional strength than PathFile #3 at 2- and 3-mm levels (p < 0.05), they had similar ultimate strengths at 4-, 5-, and 6-mm levels (p > 0.05). The smaller files of each brand had a significantly higher cyclic fatigue resistance than the bigger ones (p < 0.05). PathFile #1 and #2 had higher fatigue resistances than G-files (p < 0.05). While G-1 had a similar fatigue resistance as PathFile #3, G-2 showed the lowest and PathFile #1 showed the highest resistances among the tested groups (p < 0.05). The SEM examination showed typical appearances of cyclic fatigue and torsional fractures, regardless of the tested levels. Clinicians may consider the instruments' sizes for each clinical case in order to get efficient glide path with minimal risk of fracture. © 2014 Wiley Periodicals, Inc.

Interactive cutting path analysis programs

NASA Technical Reports Server (NTRS)

Weiner, J. M.; Williams, D. S.; Colley, S. R.

1975-01-01

The operation of numerically controlled machine tools is interactively simulated. Four programs were developed to graphically display the cutting paths for a Monarch lathe, Cintimatic mill, Strippit sheet metal punch, and the wiring path for a Standard wire wrap machine. These programs are run on a IMLAC PDS-ID graphic display system under the DOS-3 disk operating system. The cutting path analysis programs accept input via both paper tape and disk file.

Optimal Paths in Gliding Flight

NASA Astrophysics Data System (ADS)

Wolek, Artur

Underwater gliders are robust and long endurance ocean sampling platforms that are increasingly being deployed in coastal regions. This new environment is characterized by shallow waters and significant currents that can challenge the mobility of these efficient (but traditionally slow moving) vehicles. This dissertation aims to improve the performance of shallow water underwater gliders through path planning. The path planning problem is formulated for a dynamic particle (or "kinematic car") model. The objective is to identify the path which satisfies specified boundary conditions and minimizes a particular cost. Several cost functions are considered. The problem is addressed using optimal control theory. The length scales of interest for path planning are within a few turn radii. First, an approach is developed for planning minimum-time paths, for a fixed speed glider, that are sub-optimal but are guaranteed to be feasible in the presence of unknown time-varying currents. Next the minimum-time problem for a glider with speed controls, that may vary between the stall speed and the maximum speed, is solved. Last, optimal paths that minimize change in depth (equivalently, maximize range) are investigated. Recognizing that path planning alone cannot overcome all of the challenges associated with significant currents and shallow waters, the design of a novel underwater glider with improved capabilities is explored. A glider with a pneumatic buoyancy engine (allowing large, rapid buoyancy changes) and a cylindrical moving mass mechanism (generating large pitch and roll moments) is designed, manufactured, and tested to demonstrate potential improvements in speed and maneuverability.

Diagonal recurrent neural network based adaptive control of nonlinear dynamical systems using lyapunov stability criterion.

PubMed

Kumar, Rajesh; Srivastava, Smriti; Gupta, J R P

2017-03-01

In this paper adaptive control of nonlinear dynamical systems using diagonal recurrent neural network (DRNN) is proposed. The structure of DRNN is a modification of fully connected recurrent neural network (FCRNN). Presence of self-recurrent neurons in the hidden layer of DRNN gives it an ability to capture the dynamic behaviour of the nonlinear plant under consideration (to be controlled). To ensure stability, update rules are developed using lyapunov stability criterion. These rules are then used for adjusting the various parameters of DRNN. The responses of plants obtained with DRNN are compared with those obtained when multi-layer feed forward neural network (MLFFNN) is used as a controller. Also, in example 4, FCRNN is also investigated and compared with DRNN and MLFFNN. Robustness of the proposed control scheme is also tested against parameter variations and disturbance signals. Four simulation examples including one-link robotic manipulator and inverted pendulum are considered on which the proposed controller is applied. The results so obtained show the superiority of DRNN over MLFFNN as a controller. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

The Fermi-Pasta-Ulam Problem and Its Underlying Integrable Dynamics: An Approach Through Lyapunov Exponents

NASA Astrophysics Data System (ADS)

Benettin, G.; Pasquali, S.; Ponno, A.

2018-05-01

FPU models, in dimension one, are perturbations either of the linear model or of the Toda model; perturbations of the linear model include the usual β -model, perturbations of Toda include the usual α +β model. In this paper we explore and compare two families, or hierarchies, of FPU models, closer and closer to either the linear or the Toda model, by computing numerically, for each model, the maximal Lyapunov exponent χ . More precisely, we consider statistically typical trajectories and study the asymptotics of χ for large N (the number of particles) and small ɛ (the specific energy E / N), and find, for all models, asymptotic power laws χ ˜eq Cɛ ^a, C and a depending on the model. The asymptotics turns out to be, in general, rather slow, and producing accurate results requires a great computational effort. We also revisit and extend the analytic computation of χ introduced by Casetti, Livi and Pettini, originally formulated for the β -model. With great evidence the theory extends successfully to all models of the linear hierarchy, but not to models close to Toda.

Impulse Response Shaping for Ultra Wide Band SAR in a Circular Flight Path

NASA Technical Reports Server (NTRS)

Jin, Michael Y.

1996-01-01

An ultra wide band SAR (synthetic aperture radar) has potential applications on imaging underground objects. Flying this SAR in a circular flight path is an efficient way to acquire high resolution images from a localized area. This paper characterizes the impulse response of sucha system. The results indicate that to achieve an image with a more uniformed resolution over the entire imaged area, proper weighting coeficients should be applied to both the principle aperture and the complimentary aperture.

Energy consumption of ProTaper Next X1 after glide path with PathFiles and ProGlider.

PubMed

Berutti, Elio; Alovisi, Mario; Pastorelli, Michele Angelo; Chiandussi, Giorgio; Scotti, Nicola; Pasqualini, Damiano

2014-12-01

Instrument failure caused by excessive torsional stress can be controlled by creating a manual or mechanical glide path. The ProGlider single-file system (Dentsply Maillefer, Ballaigues, Switzerland) was recently introduced to perform a mechanical glide path. This study was designed to compare the effect of a glide path performed with PathFiles (Dentsply Maillefer) and ProGlider on torque, time, and pecking motion required for ProTaper Next X1 (Dentsply Maillefer) to reach the full working length in simulated root canals. Forty Endo Training Blocks (Dentsply Maillefer) were used. Twenty were prepared with a mechanical glide path using PathFiles 1 and 2 (the PathFile group), and 20 were prepared with a mechanical glide path using a ProGlider single file (the ProGlider group). All samples were shaped with ProTaper Next X1 driven by an endodontic motor connected to a digital wattmeter. The required torque for root canal instrumentation was analyzed by evaluating the electrical power consumption of the endodontic engine. Electric power consumption (mW/h), elapsed time (seconds), and number of pecking motions required to reach the full working length with ProTaper Next X1 were calculated. Differences among groups were analyzed with the parametric Student t test for independent data (P < .05). Elapsed time and electric power consumption were significantly different between groups (P = .0001 for both). ProGlider appears to perform more efficiently than PathFiles in decreasing electric power consumption of ProTaper Next X1 to reach the full working length. This study confirmed the ability of ProGlider to reduce stress in ProTaper Next X1 during shaping through a glide path and preliminary middle and coronal preflaring. Copyright © 2014 American Association of Endodontists. Published by Elsevier Inc. All rights reserved.

Hybrid feedforward-feedback active noise reduction for hearing protection and communication.

PubMed

Ray, Laura R; Solbeck, Jason A; Streeter, Alexander D; Collier, Robert D

2006-10-01

A hybrid active noise reduction (ANR) architecture is presented and validated for a circumaural earcup and a communication earplug. The hybrid system combines source-independent feedback ANR with a Lyapunov-tuned leaky LMS filter (LyLMS) improving gain stability margins over feedforward ANR alone. In flat plate testing, the earcup demonstrates an overall C-weighted total noise reduction of 40 dB and 30-32 dB, respectively, for 50-800 Hz sum-of-tones noise and for aircraft or helicopter cockpit noise, improving low frequency (<100 Hz) performance by up to 15 dB over either control component acting individually. For the earplug, a filtered-X implementation of the LyLMS accommodates its nonconstant cancellation path gain. A fast time-domain identification method provides a high-fidelity, computationally efficient, infinite impulse response cancellation path model, which is used for both the filtered-X implementation and communication feedthrough. Insertion loss measurements made with a manikin show overall C-weighted total noise reduction provided by the ANR earplug of 46-48 dB for sum-of-tones 80-2000 Hz and 40-41 dB from 63 to 3000 Hz for UH-60 helicopter noise, with negligible degradation in attenuation during speech communication. For both hearing protectors, a stability metric improves by a factor of 2 to several orders of magnitude through hybrid ANR.

Path-Following Solutions Of Nonlinear Equations

NASA Technical Reports Server (NTRS)

Barger, Raymond L.; Walters, Robert W.

1989-01-01

Report describes some path-following techniques for solution of nonlinear equations and compares with other methods. Use of multipurpose techniques applicable at more than one stage of path-following computation results in system relatively simple to understand, program, and use. Comparison of techniques with method of parametric differentiation (MPD) reveals definite advantages for path-following methods. Emphasis in investigation on multiuse techniques being applied at more than one stage of path-following computation. Incorporation of multipurpose techniques results in concise computer code relatively simple to use.

Longer breastfeeding duration reduces the positive relationships among gestational weight gain, birth weight and childhood anthropometrics.

PubMed

Zhu, Yeyi; Hernandez, Ladia M; Dong, Yongquan; Himes, John H; Hirschfeld, Steven; Forman, Michele R

2015-07-01

The relationship between gestational weight gain (GWG) and childhood growth remains controversial. An examination on whether infant feeding practices mediate this relationship may improve our understanding of it. We investigated whether the relationships among GWG, birth weight and childhood anthropometrics were mediated through infant feeding practices (breastfeeding duration and age at introduction of solid foods) in a cross-sectional multiethnic study of 1387 mothers and their children aged 0-5.9 years in the USA (2011-2012). Child anthropometrics included age-specific and sex-specific z-scores for weight-for-age (WAZ), height/length-for-age (HAZ), weight-for-height/length (WHZ) and body mass index-for-age (BMIZ); and ulnar length, a marker for limb growth. We used structural equation modelling to calculate standardised path coefficients and total, direct and indirect associations of GWG, birth weight and infant feeding practices with child anthropometrics. Maternal GWG had a positive indirect association with all anthropometrics mediated via birth weight, whereas longer breastfeeding duration reduced the positive associations of GWG and birth weight with WAZ, WHZ and BMIZ in non-Hispanics (β=-0.077, -0.064 and -0.106, respectively). Longer breastfeeding duration and introducing solid foods at a later age were positively associated with ulnar length (β=0.023 and 0.030, respectively) but not HAZ, suggesting a distinct association, for the first time, with limb growth. Findings suggest that promoting longer breastfeeding duration among women with excessive GWG who had high birthweight newborns may mitigate the potential for their offspring to develop obesity. In addition, findings reinforce the importance of promoting appropriate GWG and preventing high birth weight, which are positively associated with childhood anthropometrics. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://group.bmj.com/group/rights-licensing/permissions.

The "path" not taken: exploring structural differences in mapped- versus shortest-network-path school travel routes.

PubMed

Buliung, Ron N; Larsen, Kristian; Faulkner, Guy E J; Stone, Michelle R

2013-09-01

School route measurement often involves estimating the shortest network path. We challenged the relatively uncritical adoption of this method in school travel research and tested the route discordance hypothesis that several types of difference exist between shortest network paths and reported school routes. We constructed the mapped and shortest path through network routes for a sample of 759 children aged 9 to 13 years in grades 5 and 6 (boys = 45%, girls = 54%, unreported gender = 1%), in Toronto, Ontario, Canada. We used Wilcoxon signed-rank tests to compare reported with shortest-path route measures including distance, route directness, intersection crossings, and route overlap. Measurement difference was explored by mode and location. We found statistical evidence of route discordance for walkers and children who were driven and detected it more often for inner suburban cases. Evidence of route discordance varied by mode and school location. We found statistically significant differences for route structure and built environment variables measured along reported and geographic information systems-based shortest-path school routes. Uncertainty produced by the shortest-path approach challenges its conceptual and empirical validity in school travel research.

California PATH : 1997 annual report

DOT National Transportation Integrated Search

1997-01-01

The California Partners for Advanced Transit and Highways Program (PATH) has been leading the way in ITS (Intelligent Transportation Systems) research since PATHs founding in 1986, before the term ITS or its predecessor IVHS (Intelligent Vehicle H...

California PATH : 1996 annual report

DOT National Transportation Integrated Search

1996-01-01

The California Partners for Advanced Transit and Highways Program (PATH ) has been leading the way in ITS (Intelligent Transportation Systems) research since PATH's founding in 1986, before the term ITS or its predecessor IVHS (Intelligent Vehicle Hi...

Methodology for Augmenting Existing Paths with Additional Parallel Transects

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wilson, John E.

2013-09-30

Visual Sample Plan (VSP) is sample planning software that is used, among other purposes, to plan transect sampling paths to detect areas that were potentially used for munition training. This module was developed for application on a large site where existing roads and trails were to be used as primary sampling paths. Gap areas between these primary paths needed to found and covered with parallel transect paths. These gap areas represent areas on the site that are more than a specified distance from a primary path. These added parallel paths needed to optionally be connected together into a single path—themore » shortest path possible. The paths also needed to optionally be attached to existing primary paths, again with the shortest possible path. Finally, the process must be repeatable and predictable so that the same inputs (primary paths, specified distance, and path options) will result in the same set of new paths every time. This methodology was developed to meet those specifications.« less

Analysis of explicit model predictive control for path-following control

PubMed Central

2018-01-01

In this paper, explicit Model Predictive Control(MPC) is employed for automated lane-keeping systems. MPC has been regarded as the key to handle such constrained systems. However, the massive computational complexity of MPC, which employs online optimization, has been a major drawback that limits the range of its target application to relatively small and/or slow problems. Explicit MPC can reduce this computational burden using a multi-parametric quadratic programming technique(mp-QP). The control objective is to derive an optimal front steering wheel angle at each sampling time so that autonomous vehicles travel along desired paths, including straight, circular, and clothoid parts, at high entry speeds. In terms of the design of the proposed controller, a method of choosing weighting matrices in an optimization problem and the range of horizons for path-following control are described through simulations. For the verification of the proposed controller, simulation results obtained using other control methods such as MPC, Linear-Quadratic Regulator(LQR), and driver model are employed, and CarSim, which reflects the features of a vehicle more realistically than MATLAB/Simulink, is used for reliable demonstration. PMID:29534080

Analysis of explicit model predictive control for path-following control.

PubMed

Lee, Junho; Chang, Hyuk-Jun

2018-01-01

In this paper, explicit Model Predictive Control(MPC) is employed for automated lane-keeping systems. MPC has been regarded as the key to handle such constrained systems. However, the massive computational complexity of MPC, which employs online optimization, has been a major drawback that limits the range of its target application to relatively small and/or slow problems. Explicit MPC can reduce this computational burden using a multi-parametric quadratic programming technique(mp-QP). The control objective is to derive an optimal front steering wheel angle at each sampling time so that autonomous vehicles travel along desired paths, including straight, circular, and clothoid parts, at high entry speeds. In terms of the design of the proposed controller, a method of choosing weighting matrices in an optimization problem and the range of horizons for path-following control are described through simulations. For the verification of the proposed controller, simulation results obtained using other control methods such as MPC, Linear-Quadratic Regulator(LQR), and driver model are employed, and CarSim, which reflects the features of a vehicle more realistically than MATLAB/Simulink, is used for reliable demonstration.

Path coloring on the Mesh

DOE Office of Scientific and Technical Information (OSTI.GOV)

Rabani, Y.

In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edge disjoint. Our objective is to minimize the number of colors used. This problem was raised by Aggarwal et al and Raghavan and Upfal as a model for routing in all-optical networks. It is also related to questions in circuit routing. In this paper, we improve the O (ln N) approximation result of Kleinberg and Tardos for path coloring on the N x Nmore » mesh. We give an O(1) approximation algorithm to the number of colors needed, and a poly(ln ln N) approximation algorithm to the choice of paths and colors. To the best of our knowledge, these are the first sub-logarithmic bounds for any network other than trees, rings, or trees of rings. Our results are based on developing new techniques for randomized rounding. These techniques iteratively improve a fractional solution until it approaches integrality. They are motivated by the method used by Leighton, Maggs, and Rao for packet routing.« less

Perfect discretization of path integrals

NASA Astrophysics Data System (ADS)

Steinhaus, Sebastian

2012-05-01

In order to obtain a well-defined path integral one often employs discretizations. In the case of General Relativity these generically break diffeomorphism symmetry, which has severe consequences since these symmetries determine the dynamics of the corresponding system. In this article we consider the path integral of reparametrization invariant systems as a toy example and present an improvement procedure for the discretized propagator. Fixed points and convergence of the procedure are discussed. Furthermore we show that a reparametrization invariant path integral implies discretization independence and acts as a projector onto physical states.

Chaotic simulated annealing by a neural network with a variable delay: design and application.

PubMed

Chen, Shyan-Shiou

2011-10-01

In this paper, we have three goals: the first is to delineate the advantages of a variably delayed system, the second is to find a more intuitive Lyapunov function for a delayed neural network, and the third is to design a delayed neural network for a quadratic cost function. For delayed neural networks, most researchers construct a Lyapunov function based on the linear matrix inequality (LMI) approach. However, that approach is not intuitive. We provide a alternative candidate Lyapunov function for a delayed neural network. On the other hand, if we are first given a quadratic cost function, we can construct a delayed neural network by suitably dividing the second-order term into two parts: a self-feedback connection weight and a delayed connection weight. To demonstrate the advantage of a variably delayed neural network, we propose a transiently chaotic neural network with variable delay and show numerically that the model should possess a better searching ability than Chen-Aihara's model, Wang's model, and Zhao's model. We discuss both the chaotic and the convergent phases. During the chaotic phase, we simply present bifurcation diagrams for a single neuron with a constant delay and with a variable delay. We show that the variably delayed model possesses the stochastic property and chaotic wandering. During the convergent phase, we not only provide a novel Lyapunov function for neural networks with a delay (the Lyapunov function is independent of the LMI approach) but also establish a correlation between the Lyapunov function for a delayed neural network and an objective function for the traveling salesman problem. © 2011 IEEE

Empirical study on a directed and weighted bus transport network in China

NASA Astrophysics Data System (ADS)

Feng, Shumin; Hu, Baoyu; Nie, Cen; Shen, Xianghao

2016-01-01

Bus transport networks are directed complex networks that consist of routes, stations, and passenger flow. In this study, the concept of duplication factor is introduced to analyze the differences between uplinks and downlinks for the bus transport network of Harbin (BTN-H). Further, a new representation model for BTNs is proposed, named as directed-space P. Two empirical characteristics of BTN-H are reported in this paper. First, the cumulative distributions of weighted degree, degree, number of routes that connect to each station, and node weight (peak-hour trips at a station) uniformly follow the exponential law. Meanwhile, the node weight shows positive correlations with the corresponding weighted degree, degree, and number of routes that connect to a station. Second, a new richness parameter of a node is explored by its node weight and the connectivity, weighted connectivity, average shortest path length and efficiency between rich nodes can be fitted by composite exponential functions to demonstrate the rich-club phenomenon.

Analysis of crossing path crashes

DOT National Transportation Integrated Search

2001-07-01

This report defines the problem of crossing path crashes in the United States. This crash type involves one moving vehicle that cuts across the path of another when their initial approach comes from either lateral or opposite directions and they typi...

Processor Would Find Best Paths On Map

NASA Technical Reports Server (NTRS)

Eberhardt, Silvio P.

1990-01-01

Proposed very-large-scale integrated (VLSI) circuit image-data processor finds path of least cost from specified origin to any destination on map. Cost of traversal assigned to each picture element of map. Path of least cost from originating picture element to every other picture element computed as path that preserves as much as possible of signal transmitted by originating picture element. Dedicated microprocessor at each picture element stores cost of traversal and performs its share of computations of paths of least cost. Least-cost-path problem occurs in research, military maneuvers, and in planning routes of vehicles.

Analysis of the mobile phone effect on the heart rate variability by using the largest Lyapunov exponent.

PubMed

Yılmaz, Derya; Yıldız, Metin

2010-12-01

In this study, the effects of electromagnetic fields (EMFs) emitted by GSM900 based mobile phones (MPs) on the heart rate variability (HRV) were examined by using nonlinear analysis methods. The largest Lyapunov exponent (LLE) calculation was used to evaluate the effect of MP under various real exposure conditions. Sixteen healthy young volunteers were exposed to EMFs emitted by GSM900 based MP at two levels from a very low EMF (MP at stand-by) to a higher EMF (MP at pre-ring handshaking and ringing). A blind experimental protocol was designed and utilized with consideration to the physiological and psychological factors that may affect HRV. The results showed that the LLE values increased slightly with higher EMF produced by MP (P < 0.05). This change indicates that the degree of chaos in the HRV signals increased at higher EMF compared to low level EMF. Consequently, we have concluded that high level EMF changed the complexity of cardiac system behavior, significantly.

Path optimization with limited sensing ability

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kang, Sung Ha, E-mail: kang@math.gatech.edu; Kim, Seong Jun, E-mail: skim396@math.gatech.edu; Zhou, Haomin, E-mail: hmzhou@math.gatech.edu

2015-10-15

We propose a computational strategy to find the optimal path for a mobile sensor with limited coverage to traverse a cluttered region. The goal is to find one of the shortest feasible paths to achieve the complete scan of the environment. We pose the problem in the level set framework, and first consider a related question of placing multiple stationary sensors to obtain the full surveillance of the environment. By connecting the stationary locations using the nearest neighbor strategy, we form the initial guess for the path planning problem of the mobile sensor. Then the path is optimized by reducingmore » its length, via solving a system of ordinary differential equations (ODEs), while maintaining the complete scan of the environment. Furthermore, we use intermittent diffusion, which converts the ODEs into stochastic differential equations (SDEs), to find an optimal path whose length is globally minimal. To improve the computation efficiency, we introduce two techniques, one to remove redundant connecting points to reduce the dimension of the system, and the other to deal with the entangled path so the solution can escape the local traps. Numerical examples are shown to illustrate the effectiveness of the proposed method.« less

Spatial Interpolation of Fine Particulate Matter Concentrations Using the Shortest Wind-Field Path Distance

PubMed Central

Li, Longxiang; Gong, Jianhua; Zhou, Jieping

2014-01-01

Effective assessments of air-pollution exposure depend on the ability to accurately predict pollutant concentrations at unmonitored locations, which can be achieved through spatial interpolation. However, most interpolation approaches currently in use are based on the Euclidean distance, which cannot account for the complex nonlinear features displayed by air-pollution distributions in the wind-field. In this study, an interpolation method based on the shortest path distance is developed to characterize the impact of complex urban wind-field on the distribution of the particulate matter concentration. In this method, the wind-field is incorporated by first interpolating the observed wind-field from a meteorological-station network, then using this continuous wind-field to construct a cost surface based on Gaussian dispersion model and calculating the shortest wind-field path distances between locations, and finally replacing the Euclidean distances typically used in Inverse Distance Weighting (IDW) with the shortest wind-field path distances. This proposed methodology is used to generate daily and hourly estimation surfaces for the particulate matter concentration in the urban area of Beijing in May 2013. This study demonstrates that wind-fields can be incorporated into an interpolation framework using the shortest wind-field path distance, which leads to a remarkable improvement in both the prediction accuracy and the visual reproduction of the wind-flow effect, both of which are of great importance for the assessment of the effects of pollutants on human health. PMID:24798197

Spatial interpolation of fine particulate matter concentrations using the shortest wind-field path distance.

PubMed

Li, Longxiang; Gong, Jianhua; Zhou, Jieping

2014-01-01

Effective assessments of air-pollution exposure depend on the ability to accurately predict pollutant concentrations at unmonitored locations, which can be achieved through spatial interpolation. However, most interpolation approaches currently in use are based on the Euclidean distance, which cannot account for the complex nonlinear features displayed by air-pollution distributions in the wind-field. In this study, an interpolation method based on the shortest path distance is developed to characterize the impact of complex urban wind-field on the distribution of the particulate matter concentration. In this method, the wind-field is incorporated by first interpolating the observed wind-field from a meteorological-station network, then using this continuous wind-field to construct a cost surface based on Gaussian dispersion model and calculating the shortest wind-field path distances between locations, and finally replacing the Euclidean distances typically used in Inverse Distance Weighting (IDW) with the shortest wind-field path distances. This proposed methodology is used to generate daily and hourly estimation surfaces for the particulate matter concentration in the urban area of Beijing in May 2013. This study demonstrates that wind-fields can be incorporated into an interpolation framework using the shortest wind-field path distance, which leads to a remarkable improvement in both the prediction accuracy and the visual reproduction of the wind-flow effect, both of which are of great importance for the assessment of the effects of pollutants on human health.

PathCase-SB architecture and database design

PubMed Central

2011-01-01

Background Integration of metabolic pathways resources and regulatory metabolic network models, and deploying new tools on the integrated platform can help perform more effective and more efficient systems biology research on understanding the regulation in metabolic networks. Therefore, the tasks of (a) integrating under a single database environment regulatory metabolic networks and existing models, and (b) building tools to help with modeling and analysis are desirable and intellectually challenging computational tasks. Description PathCase Systems Biology (PathCase-SB) is built and released. The PathCase-SB database provides data and API for multiple user interfaces and software tools. The current PathCase-SB system provides a database-enabled framework and web-based computational tools towards facilitating the development of kinetic models for biological systems. PathCase-SB aims to integrate data of selected biological data sources on the web (currently, BioModels database and KEGG), and to provide more powerful and/or new capabilities via the new web-based integrative framework. This paper describes architecture and database design issues encountered in PathCase-SB's design and implementation, and presents the current design of PathCase-SB's architecture and database. Conclusions PathCase-SB architecture and database provide a highly extensible and scalable environment with easy and fast (real-time) access to the data in the database. PathCase-SB itself is already being used by researchers across the world. PMID:22070889

Slant Path Low Visibility Atmospheric Conditions.

DTIC Science & Technology

1980-09-01

precipitation rate ; humidity; aerosol concentration; Particle spectrum; local aeiosol inhomogeneities; air * -Q.!ZIBS’IRACT: A slant path for...test path , of a length over which infrared transmissometer measurements can be made that are in a magnitude range permitting accurate measurements under...and therefore do not accurately relate to absolute transmissivity. A path which is too long will result in transmission measurements which are very low

Automated flight path planning for virtual endoscopy.

PubMed

Paik, D S; Beaulieu, C F; Jeffrey, R B; Rubin, G D; Napel, S

1998-05-01

In this paper, a novel technique for rapid and automatic computation of flight paths for guiding virtual endoscopic exploration of three-dimensional medical images is described. While manually planning flight paths is a tedious and time consuming task, our algorithm is automated and fast. Our method for positioning the virtual camera is based on the medial axis transform but is much more computationally efficient. By iteratively correcting a path toward the medial axis, the necessity of evaluating simple point criteria during morphological thinning is eliminated. The virtual camera is also oriented in a stable viewing direction, avoiding sudden twists and turns. We tested our algorithm on volumetric data sets of eight colons, one aorta and one bronchial tree. The algorithm computed the flight paths in several minutes per volume on an inexpensive workstation with minimal computation time added for multiple paths through branching structures (10%-13% per extra path). The results of our algorithm are smooth, centralized paths that aid in the task of navigation in virtual endoscopic exploration of three-dimensional medical images.

Air Vehicle Path Planning

DTIC Science & Technology

2001-12-13

6-18 6.13. Apollonius Circle for the Case of Two Unequal Power Radars . . . 6-20 6.14. Solution Triangle...Voronoi edge is an Apollonius circle [32, 19]. In this section, we are concerned with the optimality of the Voronoi path for the two radar exposure...Comparison of Cost vs. Path Length for Constrained Trajectories Around and Between Two Radars 6-18 from the two radars is an Apollonius circle

Multiple paths to encephalization and technical civilizations.

PubMed

Schwartzman, David; Middendorf, George

2011-12-01

We propose consideration of at least two possible evolutionary paths for the emergence of intelligent life with the potential for technical civilization. The first is the path via encephalization of homeothermic animals; the second is the path to swarm intelligence of so-called superorganisms, in particular the social insects. The path to each appears to be facilitated by environmental change: homeothermic animals by decreased climatic temperature and for swarm intelligence by increased oxygen levels.

Stability analysis via the concept of Lyapunov exponents: a case study in optimal controlled biped standing

NASA Astrophysics Data System (ADS)

Sun, Yuming; Wu, Christine Qiong

2012-12-01

Balancing control is important for biped standing. In spite of large efforts, it is very difficult to design balancing control strategies satisfying three requirements simultaneously: maintaining postural stability, improving energy efficiency and satisfying the constraints between the biped feet and the ground. In this article, a proportional-derivative (PD) controller is proposed for a standing biped, which is simplified as a two-link inverted pendulum with one additional rigid foot-link. The genetic algorithm (GA) is used to search for the control gain meeting all three requirements. The stability analysis of such a deterministic biped control system is carried out using the concept of Lyapunov exponents (LEs), based on which, the system stability, where the disturbance comes from the initial states, and the structural stability, where the disturbance comes from the PD gains, are examined quantitively in terms of stability region. This article contributes to the biped balancing control, more significantly, the method shown in the studied case of biped provides a general framework of systematic stability analysis for certain deterministic nonlinear dynamical systems.

Dominant Lyapunov exponent and approximate entropy in heart rate variability during emotional visual elicitation

PubMed Central

Valenza, Gaetano; Allegrini, Paolo; Lanatà, Antonio; Scilingo, Enzo Pasquale

2012-01-01

In this work we characterized the non-linear complexity of Heart Rate Variability (HRV) in short time series. The complexity of HRV signal was evaluated during emotional visual elicitation by using Dominant Lyapunov Exponents (DLEs) and Approximate Entropy (ApEn). We adopted a simplified model of emotion derived from the Circumplex Model of Affects (CMAs), in which emotional mechanisms are conceptualized in two dimensions by the terms of valence and arousal. Following CMA model, a set of standardized visual stimuli in terms of arousal and valence gathered from the International Affective Picture System (IAPS) was administered to a group of 35 healthy volunteers. Experimental session consisted of eight sessions alternating neutral images with high arousal content images. Several works can be found in the literature showing a chaotic dynamics of HRV during rest or relax conditions. The outcomes of this work showed a clear switching mechanism between regular and chaotic dynamics when switching from neutral to arousal elicitation. Accordingly, the mean ApEn decreased with statistical significance during arousal elicitation and the DLE became negative. Results showed a clear distinction between the neutral and the arousal elicitation and could be profitably exploited to improve the accuracy of emotion recognition systems based on HRV time series analysis. PMID:22393320

Path Finding on High-Dimensional Free Energy Landscapes

NASA Astrophysics Data System (ADS)

Díaz Leines, Grisell; Ensing, Bernd

2012-07-01

We present a method for determining the average transition path and the free energy along this path in the space of selected collective variables. The formalism is based upon a history-dependent bias along a flexible path variable within the metadynamics framework but with a trivial scaling of the cost with the number of collective variables. Controlling the sampling of the orthogonal modes recovers the average path and the minimum free energy path as the limiting cases. The method is applied to resolve the path and the free energy of a conformational transition in alanine dipeptide.

A Path Algorithm for Constrained Estimation

PubMed Central

Zhou, Hua; Lange, Kenneth

2013-01-01

Many least-square problems involve affine equality and inequality constraints. Although there are a variety of methods for solving such problems, most statisticians find constrained estimation challenging. The current article proposes a new path-following algorithm for quadratic programming that replaces hard constraints by what are called exact penalties. Similar penalties arise in l1 regularization in model selection. In the regularization setting, penalties encapsulate prior knowledge, and penalized parameter estimates represent a trade-off between the observed data and the prior knowledge. Classical penalty methods of optimization, such as the quadratic penalty method, solve a sequence of unconstrained problems that put greater and greater stress on meeting the constraints. In the limit as the penalty constant tends to ∞, one recovers the constrained solution. In the exact penalty method, squared penalties!are replaced by absolute value penalties, and the solution is recovered for a finite value of the penalty constant. The exact path-following method starts at the unconstrained solution and follows the solution path as the penalty constant increases. In the process, the solution path hits, slides along, and exits from the various constraints. Path following in Lasso penalized regression, in contrast, starts with a large value of the penalty constant and works its way downward. In both settings, inspection of the entire solution path is revealing. Just as with the Lasso and generalized Lasso, it is possible to plot the effective degrees of freedom along the solution path. For a strictly convex quadratic program, the exact penalty algorithm can be framed entirely in terms of the sweep operator of regression analysis. A few well-chosen examples illustrate the mechanics and potential of path following. This article has supplementary materials available online. PMID:24039382

Assessing Perceptions AbouT Hazardous Substances (PATHS): The PATHS questionnaire

PubMed Central

Amlôt, Richard; Page, Lisa; Pearce, Julia; Wessely, Simon

2013-01-01

How people perceive the nature of a hazardous substance may determine how they respond when potentially exposed to it. We tested a new Perceptions AbouT Hazardous Substances (PATHS) questionnaire. In Study 1 (N = 21), we assessed the face validity of items concerning perceptions about eight properties of a hazardous substance. In Study 2 (N = 2030), we tested the factor structure, reliability and validity of the PATHS questionnaire across four qualitatively different substances. In Study 3 (N = 760), we tested the impact of information provision on Perceptions AbouT Hazardous Substances scores. Our results showed that our eight measures demonstrated good reliability and validity when used for non-contagious hazards. PMID:23104995

Potential Underlying Mechanisms for Greater Weight Gain in Massaged Preterm Infants

PubMed Central

Field, Tiffany; Diego, Miguel; Hernandez-Reif, Maria

2010-01-01

In this paper, potential underlying mechanisms for massage therapy effects on preterm infant weight gain are reviewed. Path analyses are presented suggesting that: 1) increased vagal activity was associated with 2) increased gastric motility, which, in turn, was related to 3) greater weight gain; and 4) increased IGF-1 was related to greater weight gain. The change in vagal activity during the massage explained 49% of the variance in the change in gastric activity. And, the change in vagal activity during the massage explained 62% of the variance in the change in insulin. That the change in gastric activity was not related to the change in insulin suggests two parallel pathways via which massage therapy leads to increased weight gain: 1) insulin release via the celiac branch of the vagus; and 2) increased gastric activity via the gastric branch of the vagus. PMID:21570125

Dissociable cognitive mechanisms underlying human path integration.

PubMed

Wiener, Jan M; Berthoz, Alain; Wolbers, Thomas

2011-01-01

Path integration is a fundamental mechanism of spatial navigation. In non-human species, it is assumed to be an online process in which a homing vector is updated continuously during an outward journey. In contrast, human path integration has been conceptualized as a configural process in which travelers store working memory representations of path segments, with the computation of a homing vector only occurring when required. To resolve this apparent discrepancy, we tested whether humans can employ different path integration strategies in the same task. Using a triangle completion paradigm, participants were instructed either to continuously update the start position during locomotion (continuous strategy) or to remember the shape of the outbound path and to calculate home vectors on basis of this representation (configural strategy). While overall homing accuracy was superior in the configural condition, participants were quicker to respond during continuous updating, strongly suggesting that homing vectors were computed online. Corroborating these findings, we observed reliable differences in head orientation during the outbound path: when participants applied the continuous updating strategy, the head deviated significantly from straight ahead in direction of the start place, which can be interpreted as a continuous motor expression of the homing vector. Head orientation-a novel online measure for path integration-can thus inform about the underlying updating mechanism already during locomotion. In addition to demonstrating that humans can employ different cognitive strategies during path integration, our two-systems view helps to resolve recent controversies regarding the role of the medial temporal lobe in human path integration.

Robot path planning using a genetic algorithm

NASA Technical Reports Server (NTRS)

Cleghorn, Timothy F.; Baffes, Paul T.; Wang, Liu

1988-01-01

Robot path planning can refer either to a mobile vehicle such as a Mars Rover, or to an end effector on an arm moving through a cluttered workspace. In both instances there may exist many solutions, some of which are better than others, either in terms of distance traversed, energy expended, or joint angle or reach capabilities. A path planning program has been developed based upon a genetic algorithm. This program assumes global knowledge of the terrain or workspace, and provides a family of good paths between the initial and final points. Initially, a set of valid random paths are constructed. Successive generations of valid paths are obtained using one of several possible reproduction strategies similar to those found in biological communities. A fitness function is defined to describe the goodness of the path, in this case including length, slope, and obstacle avoidance considerations. It was found that with some reproduction strategies, the average value of the fitness function improved for successive generations, and that by saving the best paths of each generation, one could quite rapidly obtain a collection of good candidate solutions.

Slant Path Low Visibility Atmospheric Conditions.

DTIC Science & Technology

1980-09-01

situation. a) An optical propagation slant test path , of a length over which infrared transmissometer measurements can be made that are in a magnitude...transmission measure - ments which are close to 100% and therefore do not accurately relate to absolute transmissivity. A path which is too long will result in...is available for measurement of backscatter cross section along the chosen transmissometer path . 3. Rough Cross Cut of the Works unde Contract in

Planning 3-D collision-free paths using spheres

NASA Technical Reports Server (NTRS)

Bonner, Susan; Kelley, Robert B.

1989-01-01

A scheme for the representation of objects, the Successive Spherical Approximation (SSA), facilitates the rapid planning of collision-free paths in a 3-D, dynamic environment. The hierarchical nature of the SSA allows collision-free paths to be determined efficiently while still providing for the exact representation of dynamic objects. The concept of a freespace cell is introduced to allow human 3-D conceptual knowledge to be used in facilitating satisfying choices for paths. Collisions can be detected at a rate better than 1 second per environment object per path. This speed enables the path planning process to apply a hierarchy of rules to create a heuristically satisfying collision-free path.

Paths with more turns are perceived as longer: misperceptions with map-based and abstracted path stimuli.

PubMed

Brunyé, Tad T; Mahoney, Caroline R; Taylor, Holly A

2015-04-01

When navigating, people tend to overestimate distances when routes contain more turns, termed the route-angularity effect. Three experiments examined the source and generality of this effect. The first two experiments examined whether route-angularity effects occur while viewing maps and might be related to sex differences or sense of direction. The third experiment tested whether the route-angularity effect would occur with stimuli devoid of spatial context, reducing influences of environmental experience and visual complexity. In the three experiments, participants (N=1,552; M=32.2 yr.; 992 men, 560 women) viewed paths plotted on maps (Exps. 1 and 2) or against a blank background (Exp. 3). The depicted paths were always the same overall length, but varied in the number of turns (from 1 to 7) connecting an origin and destination. Participants were asked to estimate the time to traverse each path (Exp. 1) or the length of each path (Exps. 2 and 3). The Santa Barbara Sense of Direction questionnaire was administered to assess whether overall spatial sense of direction would be negatively related to the magnitude of the route-angularity effect. Repeated-measures analyses of variance (ANOVAs) indicated that paths with more turns elicited estimates of greater distance and travel times, whether they were depicted on maps or blank backgrounds. Linear regressions also indicated that these effects were significantly larger in those with a relatively low sense of direction. The results support the route-angularity effect and extend it to paths plotted on map-based stimuli. Furthermore, because the route-angularity effect was shown with paths plotted against blank backgrounds, route-angularity effects are not specific to understanding environments and may arise at the level of visual perception.

14 CFR 23.61 - Takeoff flight path.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 14 Aeronautics and Space 1 2010-01-01 2010-01-01 false Takeoff flight path. 23.61 Section 23.61... STANDARDS: NORMAL, UTILITY, ACROBATIC, AND COMMUTER CATEGORY AIRPLANES Flight Performance § 23.61 Takeoff flight path. For each commuter category airplane, the takeoff flight path must be determined as follows...

14 CFR 23.61 - Takeoff flight path.

Code of Federal Regulations, 2011 CFR

2011-01-01

... 14 Aeronautics and Space 1 2011-01-01 2011-01-01 false Takeoff flight path. 23.61 Section 23.61... STANDARDS: NORMAL, UTILITY, ACROBATIC, AND COMMUTER CATEGORY AIRPLANES Flight Performance § 23.61 Takeoff flight path. For each commuter category airplane, the takeoff flight path must be determined as follows...

Momentum-weighted conjugate gradient descent algorithm for gradient coil optimization.

PubMed

Lu, Hanbing; Jesmanowicz, Andrzej; Li, Shi-Jiang; Hyde, James S

2004-01-01

MRI gradient coil design is a type of nonlinear constrained optimization. A practical problem in transverse gradient coil design using the conjugate gradient descent (CGD) method is that wire elements move at different rates along orthogonal directions (r, phi, z), and tend to cross, breaking the constraints. A momentum-weighted conjugate gradient descent (MW-CGD) method is presented to overcome this problem. This method takes advantage of the efficiency of the CGD method combined with momentum weighting, which is also an intrinsic property of the Levenberg-Marquardt algorithm, to adjust step sizes along the three orthogonal directions. A water-cooled, 12.8 cm inner diameter, three axis torque-balanced gradient coil for rat imaging was developed based on this method, with an efficiency of 2.13, 2.08, and 4.12 mT.m(-1).A(-1) along X, Y, and Z, respectively. Experimental data demonstrate that this method can improve efficiency by 40% and field uniformity by 27%. This method has also been applied to the design of a gradient coil for the human brain, employing remote current return paths. The benefits of this design include improved gradient field uniformity and efficiency, with a shorter length than gradient coil designs using coaxial return paths. Copyright 2003 Wiley-Liss, Inc.

Short-Path Statistics and the Diffusion Approximation

NASA Astrophysics Data System (ADS)

Blanco, Stéphane; Fournier, Richard

2006-12-01

In the field of first return time statistics in bounded domains, short paths may be defined as those paths for which the diffusion approximation is inappropriate. This is at the origin of numerous open questions concerning the characterization of residence time distributions. We show here how general integral constraints can be derived that make it possible to address short-path statistics indirectly by application of the diffusion approximation to long paths. Application to the moments of the distribution at the low-Knudsen limit leads to simple practical results and novel physical pictures.

Information processing versus social cognitive mediators of weight loss in a podcast-delivered health intervention.

PubMed

Ko, Linda K; Turner-McGrievy, Gabrielle M; Campbell, Marci K

2014-04-01

Podcasting is an emerging technology, and previous interventions have shown promising results using theory-based podcast for weight loss among overweight and obese individuals. This study investigated whether constructs of social cognitive theory and information processing theories (IPTs) mediate the effect of a podcast intervention on weight loss among overweight individuals. Data are from Pounds off Digitally, a study testing the efficacy of two weight loss podcast interventions (control podcast and theory-based podcast). Path models were constructed (n = 66). The IPTs, elaboration likelihood model, information control theory, and cognitive load theory mediated the effect of a theory-based podcast on weight loss. The intervention was significantly associated with all IPTs. Information control theory and cognitive load theory were related to elaboration, and elaboration was associated with weight loss. Social cognitive theory constructs did not mediate weight loss. Future podcast interventions grounded in theory may be effective in promoting weight loss.

Pedestrian paths: why path-dependence theory leaves health policy analysis lost in space.

PubMed

Brown, Lawrence D

2010-08-01

Path dependence, a model first advanced to explain puzzles in the diffusion of technology, has lately won allegiance among analysts of the politics of public policy, including health care policy. Though the central premise of the model--that past events and decisions shape options for innovation in the present and future--is indisputable (indeed path dependence is, so to speak, too shallow to be false), the approach, at least as applied to health policy, suffers from ambiguities that undercut its claims to illuminate policy projects such as managed care, on which this article focuses. Because path dependence adds little more than marginal value to familiar images of the politics of policy--incrementalism, for one--analysts might do well to put it on the back burner and pursue instead "thick descriptions" that help them to distinguish different degrees of openness to exogenous change among diverse policy arenas.

Similarity indices based on link weight assignment for link prediction of unweighted complex networks

NASA Astrophysics Data System (ADS)

Liu, Shuxin; Ji, Xinsheng; Liu, Caixia; Bai, Yi

2017-01-01

Many link prediction methods have been proposed for predicting the likelihood that a link exists between two nodes in complex networks. Among these methods, similarity indices are receiving close attention. Most similarity-based methods assume that the contribution of links with different topological structures is the same in the similarity calculations. This paper proposes a local weighted method, which weights the strength of connection between each pair of nodes. Based on the local weighted method, six local weighted similarity indices extended from unweighted similarity indices (including Common Neighbor (CN), Adamic-Adar (AA), Resource Allocation (RA), Salton, Jaccard and Local Path (LP) index) are proposed. Empirical study has shown that the local weighted method can significantly improve the prediction accuracy of these unweighted similarity indices and that in sparse and weakly clustered networks, the indices perform even better.

Path planning on satellite images for unmanned surface vehicles

NASA Astrophysics Data System (ADS)

Yang, Joe-Ming; Tseng, Chien-Ming; Tseng, P. S.

2015-01-01

In recent years, the development of autonomous surface vehicles has been a field of increasing research interest. There are two major areas in this field: control theory and path planning. This study focuses on path planning, and two objectives are discussed: path planning for Unmanned Surface Vehicles (USVs) and implementation of path planning in a real map. In this paper, satellite thermal images are converted into binary images which are used as the maps for the Finite Angle A* algorithm (FAA*), an advanced A* algorithm that is used to determine safer and suboptimal paths for USVs. To plan a collision-free path, the algorithm proposed in this article considers the dimensions of surface vehicles. Furthermore, the turning ability of a surface vehicle is also considered, and a constraint condition is introduced to improve the quality of the path planning algorithm, which makes the traveled path smoother. This study also shows a path planning experiment performed on a real satellite thermal image, and the path planning results can be used by an USV.

14 CFR 25.115 - Takeoff flight path.

Code of Federal Regulations, 2014 CFR

2014-01-01

... 14 Aeronautics and Space 1 2014-01-01 2014-01-01 false Takeoff flight path. 25.115 Section 25.115... STANDARDS: TRANSPORT CATEGORY AIRPLANES Flight Performance § 25.115 Takeoff flight path. (a) The takeoff flight path shall be considered to begin 35 feet above the takeoff surface at the end of the takeoff...

14 CFR 25.115 - Takeoff flight path.

Code of Federal Regulations, 2011 CFR

2011-01-01

... 14 Aeronautics and Space 1 2011-01-01 2011-01-01 false Takeoff flight path. 25.115 Section 25.115... STANDARDS: TRANSPORT CATEGORY AIRPLANES Flight Performance § 25.115 Takeoff flight path. (a) The takeoff flight path shall be considered to begin 35 feet above the takeoff surface at the end of the takeoff...

Path Integration on the Upper Half-Plane

NASA Astrophysics Data System (ADS)

Kubo, R.

1987-10-01

Feynman's path integral is considered on the Poincaré upper half-plane. It is shown that the fundermental solution to the heat equation partial f/partial t=Delta_{H}f can be expressed in terms of a path integral. A simple relation between the path integral and the Selberg trace formula is discussed briefly.

Electroencephalograms in epilepsy: analysis and seizure prediction within the framework of Lyapunov theory

NASA Astrophysics Data System (ADS)

Moser, H. R.; Weber, B.; Wieser, H. G.; Meier, P. F.

1999-06-01

Epileptic seizures are defined as the clinical manifestation of excessive and hypersynchronous activity of neurons in the cerebral cortex and represent one of the most frequent malfunctions of the human central nervous system. Therefore, the search for precursors and predictors of a seizure is of utmost clinical relevance and may even guide us to a deeper understanding of the seizure generating mechanisms. We extract chaos-indicators such as Lyapunov exponents and Kolmogorov entropies from different types of electroencephalograms (EEGs): this covers mainly intracranial EEGs (semi-invasive and invasive recording techniques), but also scalp-EEGs from the surface of the skin. Among the analytical methods we tested up to now, we find that the spectral density of the local expansion exponents is best suited to predict the onset of a forthcoming seizure. We also evaluate the time-evolution of the dissipation in these signals: it exhibits strongly significant variations that clearly relate to the time relative to a seizure onset. This article is mainly devoted to an assessment of these methods with respect to their sensitivity to EEG changes, e.g., prior to a seizure. Further, we investigate interictal EEGs (i.e., far away from a seizure) in order to characterize their more general properties, such as the convergence of the reconstructed quantities with respect to the number of phase space dimensions. Generally we use multichannel reconstruction, but we also present a comparison with the delay-embedding technique.

Planning Minimum-Energy Paths in an Off-Road Environment with Anisotropic Traversal Costs and Motion Constraints

DTIC Science & Technology

1989-06-01

problems, and (3) weighted-region problems. Since the minimum-energy path-planning problem addressed in this dissertation is a hybrid between the two...contains components that are strictly vehicle dependent, components that are strictly terrain dependent, and components representing a hybrid of...Single Segment Braking/Multiple Segment Hybrid Using Eq. (3.46), the traversal cost U 1,.-1 can be rewritten as Uop- 1 = mgD Itan01 , (4.12a) and the

Control algorithms for aerobraking in the Martian atmosphere

NASA Technical Reports Server (NTRS)

Ward, Donald T.; Shipley, Buford W., Jr.

1991-01-01

The Analytic Predictor Corrector (APC) and Energy Controller (EC) atmospheric guidance concepts were adapted to control an interplanetary vehicle aerobraking in the Martian atmosphere. Changes are made to the APC to improve its robustness to density variations. These changes include adaptation of a new exit phase algorithm, an adaptive transition velocity to initiate the exit phase, refinement of the reference dynamic pressure calculation and two improved density estimation techniques. The modified controller with the hybrid density estimation technique is called the Mars Hybrid Predictor Corrector (MHPC), while the modified controller with a polynomial density estimator is called the Mars Predictor Corrector (MPC). A Lyapunov Steepest Descent Controller (LSDC) is adapted to control the vehicle. The LSDC lacked robustness, so a Lyapunov tracking exit phase algorithm is developed to guide the vehicle along a reference trajectory. This algorithm, when using the hybrid density estimation technique to define the reference path, is called the Lyapunov Hybrid Tracking Controller (LHTC). With the polynomial density estimator used to define the reference trajectory, the algorithm is called the Lyapunov Tracking Controller (LTC). These four new controllers are tested using a six degree of freedom computer simulation to evaluate their robustness. The MHPC, MPC, LHTC, and LTC show dramatic improvements in robustness over the APC and EC.

A Comparison of Two Path Planners for Planetary Rovers

NASA Technical Reports Server (NTRS)

Tarokh, M.; Shiller, Z.; Hayati, S.

1999-01-01

The paper presents two path planners suitable for planetary rovers. The first is based on fuzzy description of the terrain, and genetic algorithm to find a traversable path in a rugged terrain. The second planner uses a global optimization method with a cost function that is the path distance divided by the velocity limit obtained from the consideration of the rover static and dynamic stability. A description of both methods is provided, and the results of paths produced are given which show the effectiveness of the path planners in finding near optimal paths. The features of the methods and their suitability and application for rover path planning are compared

Homing by path integration when a locomotion trajectory crosses itself.

PubMed

Yamamoto, Naohide; Meléndez, Jayleen A; Menzies, Derek T

2014-01-01

Path integration is a process with which navigators derive their current position and orientation by integrating self-motion signals along a locomotion trajectory. It has been suggested that path integration becomes disproportionately erroneous when the trajectory crosses itself. However, there is a possibility that this previous finding was confounded by effects of the length of a traveled path and the amount of turns experienced along the path, two factors that are known to affect path integration performance. The present study was designed to investigate whether the crossover of a locomotion trajectory truly increases errors of path integration. In an experiment, blindfolded human navigators were guided along four paths that varied in their lengths and turns, and attempted to walk directly back to the beginning of the paths. Only one of the four paths contained a crossover. Results showed that errors yielded from the path containing the crossover were not always larger than those observed in other paths, and the errors were attributed solely to the effects of longer path lengths or greater degrees of turns. These results demonstrated that path crossover does not always cause significant disruption in path integration processes. Implications of the present findings for models of path integration are discussed.

Peano-like paths for subaperture polishing of optical aspherical surfaces.

PubMed

Tam, Hon-Yuen; Cheng, Haobo; Dong, Zhichao

2013-05-20

Polishing can be more uniform if the polishing path provides uniform coverage of the surface. It is known that Peano paths can provide uniform coverage of planar surfaces. Peano paths also contain short path segments and turns: (1) all path segments have the same length, (2) path segments are mutually orthogonal at the turns, and (3) path segments and turns are uniformity distributed over the domain surface. These make Peano paths an attractive candidate among polishing tool paths because they enhance multidirectional approaches of the tool to each surface location. A method for constructing Peano paths for uniform coverage of aspherical surfaces is proposed in this paper. When mapped to the aspherical surface, the path also contains short path segments and turns, and the above attributes are approximately preserved. Attention is paid so that the path segments are still well distributed near the vertex of the surface. The proposed tool path was used in the polishing of a number of parabolic BK7 specimens using magnetorheological finishing (MRF) and pitch with cerium oxide. The results were rather good for optical lenses and confirm that a Peano-like path was useful for polishing, for MRF, and for pitch polishing. In the latter case, the surface roughness achieved was 0.91 nm according to WYKO measurement.

Electron Inelastic-Mean-Free-Path Database

National Institute of Standards and Technology Data Gateway

SRD 71 NIST Electron Inelastic-Mean-Free-Path Database (PC database, no charge)   This database provides values of electron inelastic mean free paths (IMFPs) for use in quantitative surface analyses by AES and XPS.

Understanding and applying open-path optical sensing data

NASA Astrophysics Data System (ADS)

Virag, Peter; Kricks, Robert J.

1999-02-01

During the last 10 years, open-path air monitors have evolved to yield reliable and effective measurements of single and multiple compounds on a real-time basis. To many individuals within the optical remote sensing community, the attributes of open-path and its the potential uses seem unlimited. Then why has the market has been stagnant for the last few years? The reason may center on how open-path information is applied and how well the end user understands that information. We constantly try to compare open-path data to risk/health or safety levels that are based for use at a single point and for a specific averaging period often far longer than a typical open-path data point. Often this approach is perceived as putting a square peg in a round hole. This perception may be well founded, as open-path data at times may need to go through extensive data manipulation and assumptions before it can be applied. This paper will review pervious open-path monitoring programs and their success in applying the data collected. We will also look at how open-path data is being currently used, some previous pitfalls in data use, alternate methods of data interpretation, and how open-path data can be best practically applied to fit current needs.

PathVisio 3: an extendable pathway analysis toolbox.

PubMed

Kutmon, Martina; van Iersel, Martijn P; Bohler, Anwesha; Kelder, Thomas; Nunes, Nuno; Pico, Alexander R; Evelo, Chris T

2015-02-01

PathVisio is a commonly used pathway editor, visualization and analysis software. Biological pathways have been used by biologists for many years to describe the detailed steps in biological processes. Those powerful, visual representations help researchers to better understand, share and discuss knowledge. Since the first publication of PathVisio in 2008, the original paper was cited more than 170 times and PathVisio was used in many different biological studies. As an online editor PathVisio is also integrated in the community curated pathway database WikiPathways. Here we present the third version of PathVisio with the newest additions and improvements of the application. The core features of PathVisio are pathway drawing, advanced data visualization and pathway statistics. Additionally, PathVisio 3 introduces a new powerful extension systems that allows other developers to contribute additional functionality in form of plugins without changing the core application. PathVisio can be downloaded from http://www.pathvisio.org and in 2014 PathVisio 3 has been downloaded over 5,500 times. There are already more than 15 plugins available in the central plugin repository. PathVisio is a freely available, open-source tool published under the Apache 2.0 license (http://www.apache.org/licenses/LICENSE-2.0). It is implemented in Java and thus runs on all major operating systems. The code repository is available at http://svn.bigcat.unimaas.nl/pathvisio. The support mailing list for users is available on https://groups.google.com/forum/#!forum/wikipathways-discuss and for developers on https://groups.google.com/forum/#!forum/wikipathways-devel.

Two-path plasmonic interferometer with integrated detector

DOEpatents

Dyer, Gregory Conrad; Shaner, Eric A.; Aizin, Gregory

2016-03-29

An electrically tunable terahertz two-path plasmonic interferometer with an integrated detection element can down convert a terahertz field to a rectified DC signal. The integrated detector utilizes a resonant plasmonic homodyne mixing mechanism that measures the component of the plasma waves in-phase with an excitation field that functions as the local oscillator in the mixer. The plasmonic interferometer comprises two independently tuned electrical paths. The plasmonic interferometer enables a spectrometer-on-a-chip where the tuning of electrical path length plays an analogous role to that of physical path length in macroscopic Fourier transform interferometers.

Optimization of educational paths for higher education

NASA Astrophysics Data System (ADS)

Tarasyev, Alexandr A.; Agarkov, Gavriil; Medvedev, Aleksandr

2017-11-01

In our research, we combine the theory of economic behavior and the methodology of increasing efficiency of the human capital to estimate the optimal educational paths. We provide an optimization model for higher education process to analyze possible educational paths for each rational individual. The preferences of each rational individual are compared to the best economically possible educational path. The main factor of the individual choice, which is formed by the formation of optimal educational path, deals with higher salaries level in the chosen economic sector after graduation. Another factor that influences on the economic profit is the reduction of educational costs or the possibility of the budget support for the student. The main outcome of this research consists in correction of the governmental policy of investment in human capital based on the results of educational paths optimal control.

Experimental validation of a Lyapunov-based controller for the plasma safety factor and plasma pressure in the TCV tokamak

NASA Astrophysics Data System (ADS)

Mavkov, B.; Witrant, E.; Prieur, C.; Maljaars, E.; Felici, F.; Sauter, O.; the TCV-Team

2018-05-01

In this paper, model-based closed-loop algorithms are derived for distributed control of the inverse of the safety factor profile and the plasma pressure parameter β of the TCV tokamak. The simultaneous control of the two plasma quantities is performed by combining two different control methods. The control design of the plasma safety factor is based on an infinite-dimensional setting using Lyapunov analysis for partial differential equations, while the control of the plasma pressure parameter is designed using control techniques for single-input and single-output systems. The performance and robustness of the proposed controller is analyzed in simulations using the fast plasma transport simulator RAPTOR. The control is then implemented and tested in experiments in TCV L-mode discharges using the RAPTOR model predicted estimates for the q-profile. The distributed control in TCV is performed using one co-current and one counter-current electron cyclotron heating actuation.

Chorioamnionitis and chronic lung disease of prematurity: a path analysis of causality.

PubMed

Dessardo, Nada Sindičić; Mustać, Elvira; Dessardo, Sandro; Banac, Srđan; Peter, Branimir; Finderle, Aleksandar; Marić, Marinko; Haller, Herman

2012-02-01

Current evidence suggests that additional pathogenetic factors could play a role in the development of chronic lung disease of prematurity, other than mechanical ventilation and free radical injury. The introduction of the concept of "fetal inflammatory response syndrome" offers a new perspective on the pathogenesis of chronic lung disease of prematurity. New statistical approaches could be useful tools in evaluating causal relationships in the development of chronic morbidity in preterm infants. The aim of this study was to test a new statistical framework incorporating path analysis to evaluate causality between exposure to chorioamnionitis and fetal inflammatory response syndrome and the development of chronic lung disease of prematurity. We designed a prospective cohort study that included consecutively born premature infants less than 32 weeks of gestation whose placentas were collected for histological analysis. Histological chorioamnionitis, clinical data, and neonatal outcomes were related to chronic lung disease. Along with standard statistical methods, a path analysis was performed to test the relationship between histological chorioamnionitis, gestational age, mechanical ventilation, and development of chronic lung disease of prematurity. Among the newborns enrolled in the study, 69/189 (36%) had histological chorioamnionitis. Of those with histological chorioamnionitis, 28/69 (37%) were classified as having fetal inflammatory response syndrome, according to the presence of severe chorioamnionitis and funisitis. Histological chorioamnionitis was associated with a lower birth weight, shorter gestation, higher frequency of patent ductus arteriosus, greater use of surfactant, and higher frequency of chronic lung disease of prematurity. Severe chorioamnionitis and funisitis were significantly associated with lower birth weight, lower gestational age, lower Apgar score at 5 minutes, more frequent use of mechanical ventilatory support and surfactant, as well

Experimental Study of Split-Path Transmission Load Sharing

NASA Technical Reports Server (NTRS)

Krantz, Timothy L.; Delgado, Irebert R.

1996-01-01

Split-path transmissions are promising, attractive alternatives to the common planetary transmissions for helicopters. The split-path design offers two parallel paths for transmitting torque from the engine to the rotor. Ideally, the transmitted torque is shared equally between the two load paths; however, because of manufacturing tolerances, the design must be sized to allow for other than equal load sharing. To study the effect of tolerances, experiments were conducted using the NASA split-path test gearbox. Two gearboxes, nominally identical except for manufacturing tolerances, were tested. The clocking angle was considered to be a design parameter and used to adjust the load sharing of an otherwise fixed design. The torque carried in each path was measured for a matrix of input torques and clocking angles. The data were used to determine the optimal value and a tolerance for the clocking angles such that the most heavily loaded split path carried no greater than 53 percent of an input shaft torque of 367 N-m. The range of clocking angles satisfying this condition was -0.0012 +/- 0.0007 rad for box 1 and -0.0023 +/- 0.0009 rad for box 2. This study indicates that split-path gearboxes can be used successfully in rotorcraft and can be manufactured with existing technology.

Kinematic path planning for space-based robotics

NASA Astrophysics Data System (ADS)

Seereeram, Sanjeev; Wen, John T.

1998-01-01

Future space robotics tasks require manipulators of significant dexterity, achievable through kinematic redundancy and modular reconfigurability, but with a corresponding complexity of motion planning. Existing research aims for full autonomy and completeness, at the expense of efficiency, generality or even user friendliness. Commercial simulators require user-taught joint paths-a significant burden for assembly tasks subject to collision avoidance, kinematic and dynamic constraints. Our research has developed a Kinematic Path Planning (KPP) algorithm which bridges the gap between research and industry to produce a powerful and useful product. KPP consists of three key components: path-space iterative search, probabilistic refinement, and an operator guidance interface. The KPP algorithm has been successfully applied to the SSRMS for PMA relocation and dual-arm truss assembly tasks. Other KPP capabilities include Cartesian path following, hybrid Cartesian endpoint/intermediate via-point planning, redundancy resolution and path optimization. KPP incorporates supervisory (operator) input at any detail to influence the solution, yielding desirable/predictable paths for multi-jointed arms, avoiding obstacles and obeying manipulator limits. This software will eventually form a marketable robotic planner suitable for commercialization in conjunction with existing robotic CAD/CAM packages.

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

NASA Astrophysics Data System (ADS)

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

2017-07-01

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

Information Processing Versus Social Cognitive Mediators of Weight Loss in a Podcast-Delivered Health Intervention

PubMed Central

Ko, Linda K.; Turner-McGrievy, Gabrielle; Campbell, Marci K.

2016-01-01

Podcasting is an emerging technology, and previous interventions have shown promising results using theory-based podcast for weight loss among overweight and obese individuals. This study investigated whether constructs of social cognitive theory and information processing theories (IPTs) mediate the effect of a podcast intervention on weight loss among overweight individuals. Data are from Pounds off Digitally, a study testing the efficacy of two weight loss podcast interventions (control podcast and theory-based podcast). Path models were constructed (n = 66). The IPTs—elaboration likelihood model, information control theory, and cognitive load theory—mediated the effect of a theory-based podcast on weight loss. The intervention was significantly associated with all IPTs. Information control theory and cognitive load theory were related to elaboration, and elaboration was associated with weight loss. Social cognitive theory constructs did not mediate weight loss. Future podcast interventions grounded in theory may be effective in promoting weight loss. PMID:24082027

Laser-Based Production of Metallic Conducting Paths

NASA Astrophysics Data System (ADS)

Vedder, Christian; Stollenwerk, Jochen; Wissenbach, Konrad; Pirch, Norbert

For numerous devices such as OLEDs, solar cells or heated windows conducting paths are needed for collecting or distributing electricity on poorly or non-conducting surfaces. With established techniques the metallic paths can only be produced with a great deal of effort, incurring high costs for plant, equipment and energy. A new laser based process to manufacture conducting paths allows for writing narrow paths (down to 35 μm width) of Al, Cu, Ag or similar materials onto flat surfaces of glass (plain or coated with ITO) and silicon wafers by melting and vaporizing a metal foil through optical energy at high speeds of up to 2.5 m/s.

Slant path rain attenuation and path diversity statistics obtained through radar modeling of rain structure

NASA Technical Reports Server (NTRS)

Goldhirsh, J.

1984-01-01

Single and joint terminal slant path attenuation statistics at frequencies of 28.56 and 19.04 GHz have been derived, employing a radar data base obtained over a three-year period at Wallops Island, VA. Statistics were independently obtained for path elevation angles of 20, 45, and 90 deg for purposes of examining how elevation angles influences both single-terminal and joint probability distributions. Both diversity gains and autocorrelation function dependence on site spacing and elevation angles were determined employing the radar modeling results. Comparisons with other investigators are presented. An independent path elevation angle prediction technique was developed and demonstrated to fit well with the radar-derived single and joint terminal radar-derived cumulative fade distributions at various elevation angles.

Path probability of stochastic motion: A functional approach

NASA Astrophysics Data System (ADS)

Hattori, Masayuki; Abe, Sumiyoshi

2016-06-01

The path probability of a particle undergoing stochastic motion is studied by the use of functional technique, and the general formula is derived for the path probability distribution functional. The probability of finding paths inside a tube/band, the center of which is stipulated by a given path, is analytically evaluated in a way analogous to continuous measurements in quantum mechanics. Then, the formalism developed here is applied to the stochastic dynamics of stock price in finance.

Land-mobile satellite excess path loss measurements

NASA Astrophysics Data System (ADS)

Hess, G. C.

1980-05-01

An experiment conducted with the ATS-6 satellite to determine the additional path loss over free-space loss experienced by land-mobile communication links is described. This excess path loss is measured as a function of 1) local environment, 2) vehicle heading, 3) link frequency, 4) satellite elevation angle, and 5) street side. A statistical description of excess loss developed from the data shows that the first two parameters dominate. Excess path loss on the order of 25 dB is typical in urban situations, but decreases to under 10 dB in suburban/rural areas. Spaced antenna selection diversity is found to provide only a slight decrease (4 dB, typically) in the urban excess path loss observed. Level crossing rates are depressed in satellite links relative to those of Rayleigh-faded terrestrial links, but increases in average fade durations tend to offset that advantage. The measurements show that the excess path loss difference between 860-MHz links and 1550-MHz links is generally negligible.

Perfect discretization of reparametrization invariant path integrals

NASA Astrophysics Data System (ADS)

Bahr, Benjamin; Dittrich, Bianca; Steinhaus, Sebastian

2011-05-01

To obtain a well-defined path integral one often employs discretizations. In the case of gravity and reparametrization-invariant systems, the latter of which we consider here as a toy example, discretizations generically break diffeomorphism and reparametrization symmetry, respectively. This has severe implications, as these symmetries determine the dynamics of the corresponding system. Indeed we will show that a discretized path integral with reparametrization-invariance is necessarily also discretization independent and therefore uniquely determined by the corresponding continuum quantum mechanical propagator. We use this insight to develop an iterative method for constructing such a discretized path integral, akin to a Wilsonian RG flow. This allows us to address the problem of discretization ambiguities and of an anomaly-free path integral measure for such systems. The latter is needed to obtain a path integral, that can act as a projector onto the physical states, satisfying the quantum constraints. We will comment on implications for discrete quantum gravity models, such as spin foams.

The path integral on the pseudosphere

NASA Astrophysics Data System (ADS)

Grosche, C.; Steiner, F.

1988-02-01

A rigorous path integral treatment for the d-dimensional pseudosphere Λd-1 , a Riemannian manifold of constant negative curvature, is presented. The path integral formulation is based on a canonical approach using Weyl-ordering and the Hamiltonian path integral defined on midpoints. The time-dependent and energy-dependent Feynman kernels obtain different expressions in the even- and odd-dimensional cases, respectively. The special case of the three-dimensional pseudosphere, which is analytically equivalent to the Poincaré upper half plane, the Poincaré disc, and the hyperbolic strip, is discussed in detail including the energy spectrum and the normalised wave-functions.

Quantum circuit dynamics via path integrals: Is there a classical action for discrete-time paths?

NASA Astrophysics Data System (ADS)

Penney, Mark D.; Enshan Koh, Dax; Spekkens, Robert W.

2017-07-01

It is straightforward to compute the transition amplitudes of a quantum circuit using the sum-over-paths methodology when the gates in the circuit are balanced, where a balanced gate is one for which all non-zero transition amplitudes are of equal magnitude. Here we consider the question of whether, for such circuits, the relative phases of different discrete-time paths through the configuration space can be defined in terms of a classical action, as they are for continuous-time paths. We show how to do so for certain kinds of quantum circuits, namely, Clifford circuits where the elementary systems are continuous-variable systems or discrete systems of odd-prime dimension. These types of circuit are distinguished by having phase-space representations that serve to define their classical counterparts. For discrete systems, the phase-space coordinates are also discrete variables. We show that for each gate in the generating set, one can associate a symplectomorphism on the phase-space and to each of these one can associate a generating function, defined on two copies of the configuration space. For discrete systems, the latter association is achieved using tools from algebraic geometry. Finally, we show that if the action functional for a discrete-time path through a sequence of gates is defined using the sum of the corresponding generating functions, then it yields the correct relative phases for the path-sum expression. These results are likely to be relevant for quantizing physical theories where time is fundamentally discrete, characterizing the classical limit of discrete-time quantum dynamics, and proving complexity results for quantum circuits.

Stress-Strain Characterization for Reversed Loading Path and Constitutive Modeling for AHSS Springback Predictions

NASA Astrophysics Data System (ADS)

Zhu, Hong; Huang, Mai; Sadagopan, Sriram; Yao, Hong

2017-09-01

With increasing vehicle fuel economy standards, automotive OEMs are widely using various AHSS grades including DP, TRIP, CP and 3rd Gen AHSS to reduce vehicle weight due to their good combination of strength and formability. As one of enabling technologies for AHSS application, the requirement for requiring accurate prediction of springback for cold stamped AHSS parts stimulated a large number of investigations in the past decade with reversed loading path at large strains followed by constitutive modeling. With a spectrum of complex loading histories occurring in production stamping processes, there were many challenges in this field including issues of test data reliability, loading path representability, constitutive model robustness and non-unique constitutive parameter-identification. In this paper, various testing approaches and constitutive modeling will be reviewed briefly and a systematic methodology from stress-strain characterization, constitutive model parameter identification for material card generation will be presented in order to support automotive OEM’s need on virtual stamping. This systematic methodology features a tension-compression test at large strain with robust anti-buckling device with concurrent friction force correction, properly selected loading paths to represent material behavior during different springback modes as well as the 10-parameter Yoshida model with knowledge-based parameter-identification through nonlinear optimization. Validation cases for lab AHSS parts will also be discussed to check applicability of this methodology.

Correlations and path analysis among agronomic and technological traits of upland cotton.

PubMed

Farias, F J C; Carvalho, L P; Silva Filho, J L; Teodoro, P E

2016-08-12

To date, path analysis has been used with the aim of breeding different cultures. However, for cotton, there have been few studies using this analysis, and all of these have used fiber productivity as the primary dependent variable. Therefore, the aim of the present study was to identify agronomic and technological properties that can be used as criteria for direct and indirect phenotypes in selecting cotton genotypes with better fibers. We evaluated 16 upland cotton genotypes in eight trials conducted during the harvest 2008/2009 in the State of Mato Grosso, using a randomized block design with four replicates. The evaluated traits were: plant height, average boll weight, percentage of fiber, cotton seed yield, fiber length, uniformity of fiber, short fiber index, fiber strength, elongation, maturity of the fibers, micronaire, reflectance, and the degree of yellowing. Phenotypic correlations between the traits and cotton fiber yield (main dependent variable) were unfolded in direct and indirect effects through path analysis. Fiber strength, uniformity of fiber, and reflectance were found to influence fiber length, and therefore, these traits are recommended for both direct and indirect selection of cotton genotypes.

Transition path time distributions for Lévy flights

NASA Astrophysics Data System (ADS)

Janakiraman, Deepika

2018-07-01

This paper presents a study of transition path time distributions for Lévy noise-induced barrier crossing. Transition paths are short segments of the reactive trajectories and span the barrier region of the potential without spilling into the reactant/product wells. The time taken to traverse this segment is referred to as the transition path time. Since the transition path is devoid of excursions in the minimum, the corresponding time will give the exclusive barrier crossing time, unlike . This work explores the distribution of transition path times for superdiffusive barrier crossing, analytically. This is made possible by approximating the barrier by an inverted parabola. Using this approximation, the distributions are evaluated in both over- and under-damped limits of friction. The short-time behaviour of the distributions, provide analytical evidence for single-step transition events—a feature in Lévy-barrier crossing as observed in prior simulation studies. The average transition path time is calculated as a function of the Lévy index (α), and the optimal value of α leading to minimum average transition path time is discussed, in both the limits of friction. Langevin dynamics simulations corroborating with the analytical results are also presented.

Complexity dynamics and Hopf bifurcation analysis based on the first Lyapunov coefficient about 3D IS-LM macroeconomics system

NASA Astrophysics Data System (ADS)

Ma, Junhai; Ren, Wenbo; Zhan, Xueli

2017-04-01

Based on the study of scholars at home and abroad, this paper improves the three-dimensional IS-LM model in macroeconomics, analyzes the equilibrium point of the system and stability conditions, focuses on the parameters and complex dynamic characteristics when Hopf bifurcation occurs in the three-dimensional IS-LM macroeconomics system. In order to analyze the stability of limit cycles when Hopf bifurcation occurs, this paper further introduces the first Lyapunov coefficient to judge the limit cycles, i.e. from a practical view of the business cycle. Numerical simulation results show that within the range of most of the parameters, the limit cycle of 3D IS-LM macroeconomics is stable, that is, the business cycle is stable; with the increase of the parameters, limit cycles becomes unstable, and the value range of the parameters in this situation is small. The research results of this paper have good guide significance for the analysis of macroeconomics system.

Weighted Distances in Scale-Free Configuration Models

NASA Astrophysics Data System (ADS)

Adriaans, Erwin; Komjáthy, Júlia

2018-01-01

In this paper we study first-passage percolation in the configuration model with empirical degree distribution that follows a power-law with exponent τ \\in (2,3) . We assign independent and identically distributed (i.i.d.) weights to the edges of the graph. We investigate the weighted distance (the length of the shortest weighted path) between two uniformly chosen vertices, called typical distances. When the underlying age-dependent branching process approximating the local neighborhoods of vertices is found to produce infinitely many individuals in finite time—called explosive branching process—Baroni, Hofstad and the second author showed in Baroni et al. (J Appl Probab 54(1):146-164, 2017) that typical distances converge in distribution to a bounded random variable. The order of magnitude of typical distances remained open for the τ \\in (2,3) case when the underlying branching process is not explosive. We close this gap by determining the first order of magnitude of typical distances in this regime for arbitrary, not necessary continuous edge-weight distributions that produce a non-explosive age-dependent branching process with infinite mean power-law offspring distributions. This sequence tends to infinity with the amount of vertices, and, by choosing an appropriate weight distribution, can be tuned to be any growing function that is O(log log n) , where n is the number of vertices in the graph. We show that the result remains valid for the the erased configuration model as well, where we delete loops and any second and further edges between two vertices.

Copper foil provides uniform heat sink path

NASA Technical Reports Server (NTRS)

Phillips, I. E., Jr.; Schreihans, F. A.

1966-01-01

Thermal path prevents voids and discontinuities which make heat sinks in electronic equipment inefficient. The thermal path combines the high thermal conductivity of copper with the resiliency of silicone rubber.

Visually based path-planning by Japanese monkeys.

PubMed

Mushiake, H; Saito, N; Sakamoto, K; Sato, Y; Tanji, J

2001-03-01

To construct an animal model of strategy formation, we designed a maze path-finding task. First, we asked monkeys to capture a goal in the maze by moving a cursor on the screen. Cursor movement was linked to movements of each wrist. When the animals learned the association between cursor movement and wrist movement, we established a start and a goal in the maze, and asked them to find a path between them. We found that the animals took the shortest pathway, rather than approaching the goal randomly. We further found that the animals adopted a strategy of selecting a fixed intermediate point in the visually presented maze to select one of the shortest pathways, suggesting a visually based path planning. To examine their capacity to use that strategy flexibly, we transformed the task by blocking pathways in the maze, providing a problem to solve. The animals then developed a strategy of solving the problem by planning a novel shortest path from the start to the goal and rerouting the path to bypass the obstacle.

14 CFR 25.123 - En route flight paths.

Code of Federal Regulations, 2011 CFR

2011-01-01

... 14 Aeronautics and Space 1 2011-01-01 2011-01-01 false En route flight paths. 25.123 Section 25... AIRWORTHINESS STANDARDS: TRANSPORT CATEGORY AIRPLANES Flight Performance § 25.123 En route flight paths. (a) For the en route configuration, the flight paths prescribed in paragraph (b) and (c) of this section must...

14 CFR 25.123 - En route flight paths.

Code of Federal Regulations, 2014 CFR

2014-01-01

... 14 Aeronautics and Space 1 2014-01-01 2014-01-01 false En route flight paths. 25.123 Section 25... AIRWORTHINESS STANDARDS: TRANSPORT CATEGORY AIRPLANES Flight Performance § 25.123 En route flight paths. (a) For the en route configuration, the flight paths prescribed in paragraph (b) and (c) of this section must...

Brain-computer interface control along instructed paths

NASA Astrophysics Data System (ADS)

Sadtler, P. T.; Ryu, S. I.; Tyler-Kabara, E. C.; Yu, B. M.; Batista, A. P.

2015-02-01

Objective. Brain-computer interfaces (BCIs) are being developed to assist paralyzed people and amputees by translating neural activity into movements of a computer cursor or prosthetic limb. Here we introduce a novel BCI task paradigm, intended to help accelerate improvements to BCI systems. Through this task, we can push the performance limits of BCI systems, we can quantify more accurately how well a BCI system captures the user’s intent, and we can increase the richness of the BCI movement repertoire. Approach. We have implemented an instructed path task, wherein the user must drive a cursor along a visible path. The instructed path task provides a versatile framework to increase the difficulty of the task and thereby push the limits of performance. Relative to traditional point-to-point tasks, the instructed path task allows more thorough analysis of decoding performance and greater richness of movement kinematics. Main results. We demonstrate that monkeys are able to perform the instructed path task in a closed-loop BCI setting. We further investigate how the performance under BCI control compares to native arm control, whether users can decrease their movement variability in the face of a more demanding task, and how the kinematic richness is enhanced in this task. Significance. The use of the instructed path task has the potential to accelerate the development of BCI systems and their clinical translation.

Lorcaserin: drug profile and illustrative model of the regulatory challenges of weight-loss drug development.

PubMed

Bays, Harold E

2011-03-01

Lorcaserin is a selective 5-hydroxytryptamine receptor 2c agonist developed as a weight-loss drug. Phase II and III clinical trials support lorcaserin as not only reducing adiposity (i.e., fat mass), but also as improving the metabolic diseases commonly associated with adiposopathy (i.e., fat dysfunction). At the time of this writing, regulatory processes continue towards evaluating lorcaserin as a potentially marketed weight-loss and weight-maintenance agent. Some of the challenges facing lorcaserin are similar to the difficulties encountered by all investigational weight-loss therapeutic agents, which include evolving paths towards approval. While important for clinicians to understand approval hurdles for all therapeutics, it is especially critical for researchers and developers to grasp the unique regulatory complexities of anti-obesity agents. This article profiles lorcaserin as an illustrative example of general drug development regulatory processes, and specifically details the unique challenge of weight-loss drug development.

Nonadiabatic quantum path analysis of high-order harmonic generation: Role of the carrier-envelope phase on short and long paths

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sansone, G.; Stagira, S.; Nisoli, M.

2004-07-01

High-order harmonic generation process in the few- and multiple-optical-cycle regime is theoretically investigated, using the saddle-point method generalized to account for nonadiabatic effects. The influence of the carrier-envelope phase of the driving pulses on the various electron quantum paths is analyzed. We demonstrate that the short and long quantum paths are influenced in different ways by the carrier-envelope phase. In particular, we show that clear phase effects are visible on the long quantum paths even in the multiple-optical-cycle regime, while the short quantum paths are significantly influenced by the carrier-envelope phase only in the few-optical-cycle regime.

A Lyapunov-Based Approach for Time-Coordinated 3D Path-Following of Multiple Quadrotors

DTIC Science & Technology

2012-12-01

presented in [10] as solutions for accommodating the nonlinear disturbances for outdoor altitude control . Finally, in [11] a trajectory- tracking ... control algorithm is formulated using the Special Orthogonal group SO(3) for attitude representation, leading to a simple and singularity-free solution for...the trajectory tracking problem. Cooperation between multiple unmanned vehicles has also received significant attention in the control community in

Mobile transporter path planning

NASA Technical Reports Server (NTRS)

Baffes, Paul; Wang, Lui

1990-01-01

The use of a genetic algorithm (GA) for solving the mobile transporter path planning problem is investigated. The mobile transporter is a traveling robotic vehicle proposed for the space station which must be able to reach any point of the structure autonomously. Elements of the genetic algorithm are explored in both a theoretical and experimental sense. Specifically, double crossover, greedy crossover, and tournament selection techniques are examined. Additionally, the use of local optimization techniques working in concert with the GA are also explored. Recent developments in genetic algorithm theory are shown to be particularly effective in a path planning problem domain, though problem areas can be cited which require more research.

STEPP--Search Tool for Exploration of Petri net Paths: a new tool for Petri net-based path analysis in biochemical networks.

PubMed

Koch, Ina; Schueler, Markus; Heiner, Monika

2005-01-01

To understand biochemical processes caused by, e. g., mutations or deletions in the genome, the knowledge of possible alternative paths between two arbitrary chemical compounds is of increasing interest for biotechnology, pharmacology, medicine, and drug design. With the steadily increasing amount of data from high-throughput experiments new biochemical networks can be constructed and existing ones can be extended, which results in many large metabolic, signal transduction, and gene regulatory networks. The search for alternative paths within these complex and large networks can provide a huge amount of solutions, which can not be handled manually. Moreover, not all of the alternative paths are generally of interest. Therefore, we have developed and implemented a method, which allows us to define constraints to reduce the set of all structurally possible paths to the truly interesting path set. The paper describes the search algorithm and the constraints definition language. We give examples for path searches using this dedicated special language for a Petri net model of the sucrose-to-starch breakdown in the potato tuber.

STEPP - Search Tool for Exploration of Petri net Paths: A New Tool for Petri Net-Based Path Analysis in Biochemical Networks.

PubMed

Koch, Ina; Schüler, Markus; Heiner, Monika

2011-01-01

To understand biochemical processes caused by, e.g., mutations or deletions in the genome, the knowledge of possible alternative paths between two arbitrary chemical compounds is of increasing interest for biotechnology, pharmacology, medicine, and drug design. With the steadily increasing amount of data from high-throughput experiments new biochemical networks can be constructed and existing ones can be extended, which results in many large metabolic, signal transduction, and gene regulatory networks. The search for alternative paths within these complex and large networks can provide a huge amount of solutions, which can not be handled manually. Moreover, not all of the alternative paths are generally of interest. Therefore, we have developed and implemented a method, which allows us to define constraints to reduce the set of all structurally possible paths to the truly interesting path set. The paper describes the search algorithm and the constraints definition language. We give examples for path searches using this dedicated special language for a Petri net model of the sucrose-to-starch breakdown in the potato tuber. http://sanaga.tfh-berlin.de/~stepp/

Comparison of tool feed influence in CNC polishing between a novel circular-random path and other pseudo-random paths.

PubMed

Takizawa, Ken; Beaucamp, Anthony

2017-09-18

A new category of circular pseudo-random paths is proposed in order to suppress repetitive patterns and improve surface waviness on ultra-precision polished surfaces. Random paths in prior research had many corners, therefore deceleration of the polishing tool affected the surface waviness. The new random path can suppress velocity changes of the polishing tool and thus restrict degradation of the surface waviness, making it suitable for applications with stringent mid-spatial-frequency requirements such as photomask blanks for EUV lithography.

Adaptive NN Control Using Integral Barrier Lyapunov Functionals for Uncertain Nonlinear Block-Triangular Constraint Systems.

PubMed

Liu, Yan-Jun; Tong, Shaocheng; Chen, C L Philip; Li, Dong-Juan

2017-11-01

A neural network (NN) adaptive control design problem is addressed for a class of uncertain multi-input-multi-output (MIMO) nonlinear systems in block-triangular form. The considered systems contain uncertainty dynamics and their states are enforced to subject to bounded constraints as well as the couplings among various inputs and outputs are inserted in each subsystem. To stabilize this class of systems, a novel adaptive control strategy is constructively framed by using the backstepping design technique and NNs. The novel integral barrier Lyapunov functionals (BLFs) are employed to overcome the violation of the full state constraints. The proposed strategy can not only guarantee the boundedness of the closed-loop system and the outputs are driven to follow the reference signals, but also can ensure all the states to remain in the predefined compact sets. Moreover, the transformed constraints on the errors are used in the previous BLF, and accordingly it is required to determine clearly the bounds of the virtual controllers. Thus, it can relax the conservative limitations in the traditional BLF-based controls for the full state constraints. This conservatism can be solved in this paper and it is for the first time to control this class of MIMO systems with the full state constraints. The performance of the proposed control strategy can be verified through a simulation example.

Quadcopter Path Following Control Design Using Output Feedback with Command Generator Tracker LOS Based At Square Path

NASA Astrophysics Data System (ADS)

Nugraha, A. T.; Agustinah, T.

2018-01-01

Quadcopter an unstable system, underactuated and nonlinear in quadcopter control research developments become an important focus of attention. In this study, following the path control method for position on the X and Y axis, used structure-Generator Tracker Command (CGT) is tested. Attitude control and position feedback quadcopter is compared using the optimal output. The addition of the H∞ performance optimal output feedback control is used to maintain the stability and robustness of quadcopter. Iterative numerical techniques Linear Matrix Inequality (LMI) is used to find the gain controller. The following path control problems is solved using the method of LQ regulators with output feedback. Simulations show that the control system can follow the paths that have been defined in the form of a reference signal square shape. The result of the simulation suggest that the method which used can bring the yaw angle at the expected value algorithm. Quadcopter can do automatically following path with cross track error mean X=0.5 m and Y=0.2 m.

Routeing of power lines through least-cost path analysis and multicriteria evaluation to minimise environmental impacts

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bagli, Stefano, E-mail: stefano.bagli@gecosistema.i; Geneletti, Davide, E-mail: davide.geneletti@ing.unitn.i; Center for International Development, Harvard University, 79 JFK Street, Cambridge, MA 02138

2011-04-15

Least-cost path analysis (LCPA) allows designers to find the 'cheapest' way to connect two locations within a cost surface, which can be computed by combining multiple criteria, and therefore by accounting for different issues (environmental impact, economic investment, etc.). This procedure can be easily implemented with modern Geographic Information System (GIS) technologies, and consequently it has been widely employed to support planning and design of different types of linear infrastructures, ranging from roads to pipelines. This paper presents an approach based on the integration of multicriteria evaluation (MCE) and LCPA to identify the most suitable route for a 132 kVmore » power line. Criteria such as cost, visibility, population density, and ecosystem naturalness were used for the analysis. Firstly, spatial MCE and LCPA were combined to generate cost surfaces, and to identify alternative paths. Subsequently, MCE was used to compare the alternatives, and rank them according to their overall suitability. Finally, a sensitivity analysis allowed the stability of the results to be tested and the most critical factors of the evaluation to be detected. The study found that small changes in the location of the power line start and end points can result in significantly different paths, and consequently impact levels. This suggested that planners should always consider alternative potential locations of terminals in order to identify the best path. Furthermore, it was shown that the use of different weight scenarios may help making the model adaptable to varying environmental and social contexts. The approach was tested on a real-world case study in north-eastern Italy.« less

Comparative study of adaptive controller using MIT rules and Lyapunov method for MPPT standalone PV systems

NASA Astrophysics Data System (ADS)

Tariba, N.; Bouknadel, A.; Haddou, A.; Ikken, N.; Omari, Hafsa El; Omari, Hamid El

2017-01-01

The Photovoltaic Generator have a nonlinear characteristic function relating the intensity at the voltage I = f (U) and depend on the variation of solar irradiation and temperature, In addition, its point of operation depends directly on the load that it supplies. To fix this drawback, and to extract the maximum power available to the terminal of the generator, an adaptation stage is introduced between the generator and the load to couple the two elements as perfectly as possible. The adaptation stage is associated with a command called MPPT MPPT (Maximum Power Point Tracker) whose is used to force the PVG to operate at the MPP (Maximum Power Point) under variation of climatic conditions and load variation. This paper presents a comparative study between the adaptive controller for PV Systems using MIT rules and Lyapunov method to regulate the PV voltage. The Incremental Conductance (IC) algorithm is used to extract the maximum power from the PVG by calculating the voltage Vref, and the adaptive controller is used to regulate and track quickly the PV voltage. The two methods of the adaptive controller will be compared to prove their performance by using the PSIM tools and experimental test, and the mathematical model of step-up with PVG model will be presented.

Minimal entropy probability paths between genome families.

PubMed

Ahlbrandt, Calvin; Benson, Gary; Casey, William

2004-05-01

We develop a metric for probability distributions with applications to biological sequence analysis. Our distance metric is obtained by minimizing a functional defined on the class of paths over probability measures on N categories. The underlying mathematical theory is connected to a constrained problem in the calculus of variations. The solution presented is a numerical solution, which approximates the true solution in a set of cases called rich paths where none of the components of the path is zero. The functional to be minimized is motivated by entropy considerations, reflecting the idea that nature might efficiently carry out mutations of genome sequences in such a way that the increase in entropy involved in transformation is as small as possible. We characterize sequences by frequency profiles or probability vectors, in the case of DNA where N is 4 and the components of the probability vector are the frequency of occurrence of each of the bases A, C, G and T. Given two probability vectors a and b, we define a distance function based as the infimum of path integrals of the entropy function H( p) over all admissible paths p(t), 0 < or = t< or =1, with p(t) a probability vector such that p(0)=a and p(1)=b. If the probability paths p(t) are parameterized as y(s) in terms of arc length s and the optimal path is smooth with arc length L, then smooth and "rich" optimal probability paths may be numerically estimated by a hybrid method of iterating Newton's method on solutions of a two point boundary value problem, with unknown distance L between the abscissas, for the Euler-Lagrange equations resulting from a multiplier rule for the constrained optimization problem together with linear regression to improve the arc length estimate L. Matlab code for these numerical methods is provided which works only for "rich" optimal probability vectors. These methods motivate a definition of an elementary distance function which is easier and faster to calculate, works on non

An improved multi-paths optimization method for video stabilization

NASA Astrophysics Data System (ADS)

Qin, Tao; Zhong, Sheng

2018-03-01

For video stabilization, the difference between original camera motion path and the optimized one is proportional to the cropping ratio and warping ratio. A good optimized path should preserve the moving tendency of the original one meanwhile the cropping ratio and warping ratio of each frame should be kept in a proper range. In this paper we use an improved warping-based motion representation model, and propose a gauss-based multi-paths optimization method to get a smoothing path and obtain a stabilized video. The proposed video stabilization method consists of two parts: camera motion path estimation and path smoothing. We estimate the perspective transform of adjacent frames according to warping-based motion representation model. It works well on some challenging videos where most previous 2D methods or 3D methods fail for lacking of long features trajectories. The multi-paths optimization method can deal well with parallax, as we calculate the space-time correlation of the adjacent grid, and then a kernel of gauss is used to weigh the motion of adjacent grid. Then the multi-paths are smoothed while minimize the crop ratio and the distortion. We test our method on a large variety of consumer videos, which have casual jitter and parallax, and achieve good results.

Computing Diffeomorphic Paths for Large Motion Interpolation.

PubMed

Seo, Dohyung; Jeffrey, Ho; Vemuri, Baba C

2013-06-01

In this paper, we introduce a novel framework for computing a path of diffeomorphisms between a pair of input diffeomorphisms. Direct computation of a geodesic path on the space of diffeomorphisms Diff (Ω) is difficult, and it can be attributed mainly to the infinite dimensionality of Diff (Ω). Our proposed framework, to some degree, bypasses this difficulty using the quotient map of Diff (Ω) to the quotient space Diff ( M )/ Diff ( M ) μ obtained by quotienting out the subgroup of volume-preserving diffeomorphisms Diff ( M ) μ . This quotient space was recently identified as the unit sphere in a Hilbert space in mathematics literature, a space with well-known geometric properties. Our framework leverages this recent result by computing the diffeomorphic path in two stages. First, we project the given diffeomorphism pair onto this sphere and then compute the geodesic path between these projected points. Second, we lift the geodesic on the sphere back to the space of diffeomerphisms, by solving a quadratic programming problem with bilinear constraints using the augmented Lagrangian technique with penalty terms. In this way, we can estimate the path of diffeomorphisms, first, staying in the space of diffeomorphisms, and second, preserving shapes/volumes in the deformed images along the path as much as possible. We have applied our framework to interpolate intermediate frames of frame-sub-sampled video sequences. In the reported experiments, our approach compares favorably with the popular Large Deformation Diffeomorphic Metric Mapping framework (LDDMM).

Path homogeneity along a horizontal line-of-sight path during the FESTER experiment: first results

NASA Astrophysics Data System (ADS)

Gunter, W. H.; Maritz, B.; Koago, M.; Wainman, C. K.; Gardener, M. E.; February, F.; van Eijk, A. M. J.

2016-10-01

The First European South African Experiment (FESTER) was conducted over about a 10 month period at the Institute of Maritime Technology (IMT) in False Bay, South Africa. One of the important goals was the establishment of the air-sea temperature difference (ASTD) homogeneity along the main propagation link atmospheric path since it is a basic assumption for most of the atmospheric turbulence models (caused by refractive index variations). The ASTD was measured from a small scientific work boat (called Sea Lab) moving along a straight in- and outbound track along the main propagation link path. The air temperature on-board was measured using standard weather sensors, while the sea surface temperature was measured using a long wavelength infrared radiometer, which was compared to the bulk sea temperature half a meter below the sea surface. This was obtained by an under water temperature sensor mounted on a `surfboard' that was towed alongside Sea Lab. Vertical water temperature profiles were also measured along the main propagation path in order to determine the depth of the surface mixed layer and thermocline using a Conductivity Temperature Depth profiler (CTD). First results investigated the ASTD variation along the horizontal line-of-sight path used by the principal electro-optic transmission link monitoring equipment (i.e. scintillometer and multi-spectral radiometer-transmissometer system).

Numerical-experimental investigation of load paths in DP800 dual phase steel during Nakajima test

NASA Astrophysics Data System (ADS)

Bergs, Thomas; Nick, Matthias; Feuerhack, Andreas; Trauth, Daniel; Klocke, Fritz

2018-05-01

Fuel efficiency requirements demand lightweight construction of vehicle body parts. The usage of advanced high strength steels permits a reduction of sheet thickness while still maintaining the overall strength required for crash safety. However, damage, internal defects (voids, inclusions, micro fractures), microstructural defects (varying grain size distribution, precipitates on grain boundaries, anisotropy) and surface defects (micro fractures, grooves) act as a concentration point for stress and consequently as an initiation point for failure both during deep drawing and in service. Considering damage evolution in the design of car body deep drawing processes allows for a further reduction in material usage and therefore body weight. Preliminary research has shown that a modification of load paths in forming processes can help mitigate the effects of damage on the material. This paper investigates the load paths in Nakajima tests of a DP800 dual phase steel to research damage in deep drawing processes. Investigation is done via a finite element model using experimentally validated material data for a DP800 dual phase steel. Numerical simulation allows for the investigation of load paths with respect to stress states, strain rates and temperature evolution, which cannot be easily observed in physical experiments. Stress triaxiality and the Lode parameter are used to describe the stress states. Their evolution during the Nakajima tests serves as an indicator for damage evolution. The large variety of sheet metal forming specific load paths in Nakajima tests allows a comprehensive evaluation of damage for deep drawing. The results of the numerical simulation conducted in this project and further physical experiments will later be used to calibrate a damage model for simulation of deep drawing processes.

Distributed multiple path routing in complex networks

NASA Astrophysics Data System (ADS)

Chen, Guang; Wang, San-Xiu; Wu, Ling-Wei; Mei, Pan; Yang, Xu-Hua; Wen, Guang-Hui

2016-12-01

Routing in complex transmission networks is an important problem that has garnered extensive research interest in the recent years. In this paper, we propose a novel routing strategy called the distributed multiple path (DMP) routing strategy. For each of the O-D node pairs in a given network, the DMP routing strategy computes and stores multiple short-length paths that overlap less with each other in advance. And during the transmission stage, it rapidly selects an actual routing path which provides low transmission cost from the pre-computed paths for each transmission task, according to the real-time network transmission status information. Computer simulation results obtained for the lattice, ER random, and scale-free networks indicate that the strategy can significantly improve the anti-congestion ability of transmission networks, as well as provide favorable routing robustness against partial network failures.

Body Weight Relationships in Early Marriage: Weight Relevance, Weight Comparisons, and Weight Talk

PubMed Central

Bove, Caron F.; Sobal, Jeffery

2011-01-01

This investigation uncovered processes underlying the dynamics of body weight and body image among individuals involved in nascent heterosexual marital relationships in Upstate New York. In-depth, semi-structured qualitative interviews conducted with 34 informants, 20 women and 14 men, just prior to marriage and again one year later were used to explore continuity and change in cognitive, affective, and behavioral factors relating to body weight and body image at the time of marriage, an important transition in the life course. Three major conceptual themes operated in the process of developing and enacting informants’ body weight relationships with their partner: weight relevance, weight comparisons, and weight talk. Weight relevance encompassed the changing significance of weight during early marriage and included attracting and capturing a mate, relaxing about weight, living healthily, and concentrating on weight. Weight comparisons between partners involved weight relativism, weight competition, weight envy, and weight role models. Weight talk employed pragmatic talk, active and passive reassurance, and complaining and critiquing criticism. Concepts emerging from this investigation may be useful in designing future studies of and approaches to managing body weight in adulthood. PMID:21864601

47 CFR 22.515 - Permissible communications paths.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 47 Telecommunication 2 2014-10-01 2014-10-01 false Permissible communications paths. 22.515 Section 22.515 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) COMMON CARRIER SERVICES PUBLIC MOBILE SERVICES Paging and Radiotelephone Service § 22.515 Permissible communications paths...

47 CFR 22.515 - Permissible communications paths.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 47 Telecommunication 2 2011-10-01 2011-10-01 false Permissible communications paths. 22.515 Section 22.515 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) COMMON CARRIER SERVICES PUBLIC MOBILE SERVICES Paging and Radiotelephone Service § 22.515 Permissible communications paths...

47 CFR 22.515 - Permissible communications paths.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 47 Telecommunication 2 2013-10-01 2013-10-01 false Permissible communications paths. 22.515 Section 22.515 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) COMMON CARRIER SERVICES PUBLIC MOBILE SERVICES Paging and Radiotelephone Service § 22.515 Permissible communications paths...

47 CFR 22.515 - Permissible communications paths.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 47 Telecommunication 2 2010-10-01 2010-10-01 false Permissible communications paths. 22.515 Section 22.515 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) COMMON CARRIER SERVICES PUBLIC MOBILE SERVICES Paging and Radiotelephone Service § 22.515 Permissible communications paths...

Social network analysis using k-Path centrality method

NASA Astrophysics Data System (ADS)

Taniarza, Natya; Adiwijaya; Maharani, Warih

2018-03-01

k-Path centrality is deemed as one of the effective methods to be applied in centrality measurement in which the influential node is estimated as the node that is being passed by information path frequently. Regarding this, k-Path centrality has been employed in the analysis of this paper specifically by adapting random-algorithm approach in order to: (1) determine the influential user’s ranking in a social media Twitter; and (2) ascertain the influence of parameter α in the numeration of k-Path centrality. According to the analysis, the findings showed that the method of k-Path centrality with random-algorithm approach can be used to determine user’s ranking which influences in the dissemination of information in Twitter. Furthermore, the findings also showed that parameter α influenced the duration and the ranking results: the less the α value, the longer the duration, yet the ranking results were more stable.

Path Planning Method in Multi-obstacle Marine Environment

NASA Astrophysics Data System (ADS)

Zhang, Jinpeng; Sun, Hanxv

2017-12-01

In this paper, an improved algorithm for particle swarm optimization is proposed for the application of underwater robot in the complex marine environment. Not only did consider to avoid obstacles when path planning, but also considered the current direction and the size effect on the performance of the robot dynamics. The algorithm uses the trunk binary tree structure to construct the path search space and A * heuristic search method is used in the search space to find a evaluation standard path. Then the particle swarm algorithm to optimize the path by adjusting evaluation function, which makes the underwater robot in the current navigation easier to control, and consume less energy.

Graph Coarsening for Path Finding in Cybersecurity Graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hogan, Emilie A.; Johnson, John R.; Halappanavar, Mahantesh

2013-01-01

n the pass-the-hash attack, hackers repeatedly steal password hashes and move through a computer network with the goal of reaching a computer with high level administrative privileges. In this paper we apply graph coarsening in network graphs for the purpose of detecting hackers using this attack or assessing the risk level of the network's current state. We repeatedly take graph minors, which preserve the existence of paths in the graph, and take powers of the adjacency matrix to count the paths. This allows us to detect the existence of paths as well as find paths that have high risk ofmore » being used by adversaries.« less

Feasible Path Generation Using Bezier Curves for Car-Like Vehicle

NASA Astrophysics Data System (ADS)

Latip, Nor Badariyah Abdul; Omar, Rosli

2017-08-01

When planning a collision-free path for an autonomous vehicle, the main criteria that have to be considered are the shortest distance, lower computation time and completeness, i.e. a path can be found if one exists. Besides that, a feasible path for the autonomous vehicle is also crucial to guarantee that the vehicle can reach the target destination considering its kinematic constraints such as non-holonomic and minimum turning radius. In order to address these constraints, Bezier curves is applied. In this paper, Bezier curves are modeled and simulated using Matlab software and the feasibility of the resulting path is analyzed. Bezier curve is derived from a piece-wise linear pre-planned path. It is found that the Bezier curves has the capability of making the planned path feasible and could be embedded in a path planning algorithm for an autonomous vehicle with kinematic constraints. It is concluded that the length of segments of the pre-planned path have to be greater than a nominal value, derived from the vehicle wheelbase, maximum steering angle and maximum speed to ensure the path for the autonomous car is feasible.

Computational path planner for product assembly in complex environments

NASA Astrophysics Data System (ADS)

Shang, Wei; Liu, Jianhua; Ning, Ruxin; Liu, Mi

2013-03-01

Assembly path planning is a crucial problem in assembly related design and manufacturing processes. Sampling based motion planning algorithms are used for computational assembly path planning. However, the performance of such algorithms may degrade much in environments with complex product structure, narrow passages or other challenging scenarios. A computational path planner for automatic assembly path planning in complex 3D environments is presented. The global planning process is divided into three phases based on the environment and specific algorithms are proposed and utilized in each phase to solve the challenging issues. A novel ray test based stochastic collision detection method is proposed to evaluate the intersection between two polyhedral objects. This method avoids fake collisions in conventional methods and degrades the geometric constraint when a part has to be removed with surface contact with other parts. A refined history based rapidly-exploring random tree (RRT) algorithm which bias the growth of the tree based on its planning history is proposed and employed in the planning phase where the path is simple but the space is highly constrained. A novel adaptive RRT algorithm is developed for the path planning problem with challenging scenarios and uncertain environment. With extending values assigned on each tree node and extending schemes applied, the tree can adapts its growth to explore complex environments more efficiently. Experiments on the key algorithms are carried out and comparisons are made between the conventional path planning algorithms and the presented ones. The comparing results show that based on the proposed algorithms, the path planner can compute assembly path in challenging complex environments more efficiently and with higher success. This research provides the references to the study of computational assembly path planning under complex environments.

Patterning in systems driven by nonlocal external forces.

PubMed

Luneville, L; Mallick, K; Pontikis, V; Simeone, D

2016-11-01

This work focuses on systems displaying domain patterns resulting from competing external and internal dynamics. To this end, we introduce a Lyapunov functional capable of describing the steady states of systems subject to external forces, by adding nonlocal terms to the Landau Ginzburg free energy of the system. Thereby, we extend the existing methodology treating long-range order interactions, to the case of external nonlocal forces. By studying the quadratic term of this Lyapunov functional, we compute the phase diagram in the temperature versus external field and we determine all possible modulated phases (domain patterns) as a function of the external forces and the temperature. Finally, we investigate patterning in chemical reactive mixtures and binary mixtures under irradiation, and we show that the last case opens the path toward micro-structural engineering of materials.

Patterning in systems driven by nonlocal external forces

NASA Astrophysics Data System (ADS)

Luneville, L.; Mallick, K.; Pontikis, V.; Simeone, D.

2016-11-01

This work focuses on systems displaying domain patterns resulting from competing external and internal dynamics. To this end, we introduce a Lyapunov functional capable of describing the steady states of systems subject to external forces, by adding nonlocal terms to the Landau Ginzburg free energy of the system. Thereby, we extend the existing methodology treating long-range order interactions, to the case of external nonlocal forces. By studying the quadratic term of this Lyapunov functional, we compute the phase diagram in the temperature versus external field and we determine all possible modulated phases (domain patterns) as a function of the external forces and the temperature. Finally, we investigate patterning in chemical reactive mixtures and binary mixtures under irradiation, and we show that the last case opens the path toward micro-structural engineering of materials.

Identifying decohering paths in closed quantum systems

NASA Technical Reports Server (NTRS)

Albrecht, Andreas

1990-01-01

A specific proposal is discussed for how to identify decohering paths in a wavefunction of the universe. The emphasis is on determining the correlations among subsystems and then considering how these correlations evolve. The proposal is similar to earlier ideas of Schroedinger and of Zeh, but in other ways it is closer to the decoherence functional of Griffiths, Omnes, and Gell-Mann and Hartle. There are interesting differences with each of these which are discussed. Once a given coarse-graining is chosen, the candidate paths are fixed in this scheme, and a single well defined number measures the degree of decoherence for each path. The normal probability sum rules are exactly obeyed (instantaneously) by these paths regardless of the level of decoherence. Also briefly discussed is how one might quantify some other aspects of classicality. The important role that concrete calculations play in testing this and other proposals is stressed.

Algorithms and Sensors for Small Robot Path Following

NASA Technical Reports Server (NTRS)

Hogg, Robert W.; Rankin, Arturo L.; Roumeliotis, Stergios I.; McHenry, Michael C.; Helmick, Daniel M.; Bergh, Charles F.; Matthies, Larry

2002-01-01

Tracked mobile robots in the 20 kg size class are under development for applications in urban reconnaissance. For efficient deployment, it is desirable for teams of robots to be able to automatically execute path following behaviors, with one or more followers tracking the path taken by a leader. The key challenges to enabling such a capability are (l) to develop sensor packages for such small robots that can accurately determine the path of the leader and (2) to develop path following algorithms for the subsequent robots. To date, we have integrated gyros, accelerometers, compass/inclinometers, odometry, and differential GPS into an effective sensing package. This paper describes the sensor package, sensor processing algorithm, and path tracking algorithm we have developed for the leader/follower problem in small robots and shows the result of performance characterization of the system. We also document pragmatic lessons learned about design, construction, and electromagnetic interference issues particular to the performance of state sensors on small robots.

Tornado Intensity Estimated from Damage Path Dimensions

PubMed Central

Elsner, James B.; Jagger, Thomas H.; Elsner, Ian J.

2014-01-01

The Newcastle/Moore and El Reno tornadoes of May 2013 are recent reminders of the destructive power of tornadoes. A direct estimate of a tornado's power is difficult and dangerous to get. An indirect estimate on a categorical scale is available from a post-storm survery of the damage. Wind speed bounds are attached to the scale, but the scale is not adequate for analyzing trends in tornado intensity separate from trends in tornado frequency. Here tornado intensity on a continuum is estimated from damage path length and width, which are measured on continuous scales and correlated to the EF rating. The wind speeds on the EF scale are treated as interval censored data and regressed onto the path dimensions and fatalities. The regression model indicates a 25% increase in expected intensity over a threshold intensity of 29 m s−1 for a 100 km increase in path length and a 17% increase in expected intensity for a one km increase in path width. The model shows a 43% increase in the expected intensity when fatalities are observed controlling for path dimensions. The estimated wind speeds correlate at a level of .77 (.34, .93) [95% confidence interval] with a small sample of wind speeds estimated independently from a doppler radar calibration. The estimated wind speeds allow analyses to be done on the tornado database that are not possible with the categorical scale. The modeled intensities can be used in climatology and in environmental and engineering applications. Research is needed to understand the upward trends in path length and width. PMID:25229242

Tornado intensity estimated from damage path dimensions.

PubMed

Elsner, James B; Jagger, Thomas H; Elsner, Ian J

2014-01-01

The Newcastle/Moore and El Reno tornadoes of May 2013 are recent reminders of the destructive power of tornadoes. A direct estimate of a tornado's power is difficult and dangerous to get. An indirect estimate on a categorical scale is available from a post-storm survery of the damage. Wind speed bounds are attached to the scale, but the scale is not adequate for analyzing trends in tornado intensity separate from trends in tornado frequency. Here tornado intensity on a continuum is estimated from damage path length and width, which are measured on continuous scales and correlated to the EF rating. The wind speeds on the EF scale are treated as interval censored data and regressed onto the path dimensions and fatalities. The regression model indicates a 25% increase in expected intensity over a threshold intensity of 29 m s(-1) for a 100 km increase in path length and a 17% increase in expected intensity for a one km increase in path width. The model shows a 43% increase in the expected intensity when fatalities are observed controlling for path dimensions. The estimated wind speeds correlate at a level of .77 (.34, .93) [95% confidence interval] with a small sample of wind speeds estimated independently from a doppler radar calibration. The estimated wind speeds allow analyses to be done on the tornado database that are not possible with the categorical scale. The modeled intensities can be used in climatology and in environmental and engineering applications. Research is needed to understand the upward trends in path length and width.

Multiple paths in complex tasks

NASA Technical Reports Server (NTRS)

Galanter, Eugene; Wiegand, Thomas; Mark, Gloria

1987-01-01

The relationship between utility judgments of subtask paths and the utility of the task as a whole was examined. The convergent validation procedure is based on the assumption that measurements of the same quantity done with different methods should covary. The utility measures of the subtasks were obtained during the performance of an aircraft flight controller navigation task. Analyses helped decide among various models of subtask utility combination, whether the utility ratings of subtask paths predict the whole tasks utility rating, and indirectly, whether judgmental models need to include the equivalent of cognitive noise.

Trajectory Generation and Path Planning for Autonomous Aerobots

NASA Technical Reports Server (NTRS)

Sharma, Shivanjli; Kulczycki, Eric A.; Elfes, Alberto

2007-01-01

This paper presents global path planning algorithms for the Titan aerobot based on user defined waypoints in 2D and 3D space. The algorithms were implemented using information obtained through a planner user interface. The trajectory planning algorithms were designed to accurately represent the aerobot's characteristics, such as minimum turning radius. Additionally, trajectory planning techniques were implemented to allow for surveying of a planar area based solely on camera fields of view, airship altitude, and the location of the planar area's perimeter. The developed paths allow for planar navigation and three-dimensional path planning. These calculated trajectories are optimized to produce the shortest possible path while still remaining within realistic bounds of airship dynamics.

The terminal area automated path generation problem

NASA Technical Reports Server (NTRS)

Hsin, C.-C.

1977-01-01

The automated terminal area path generation problem in the advanced Air Traffic Control System (ATC), has been studied. Definitions, input, output and the interrelationships with other ATC functions have been discussed. Alternatives in modeling the problem have been identified. Problem formulations and solution techniques are presented. In particular, the solution of a minimum effort path stretching problem (path generation on a given schedule) has been carried out using the Newton-Raphson trajectory optimization method. Discussions are presented on the effect of different delivery time, aircraft entry position, initial guess on the boundary conditions, etc. Recommendations are made on real-world implementations.

Mobile robot dynamic path planning based on improved genetic algorithm

NASA Astrophysics Data System (ADS)

Wang, Yong; Zhou, Heng; Wang, Ying

2017-08-01

In dynamic unknown environment, the dynamic path planning of mobile robots is a difficult problem. In this paper, a dynamic path planning method based on genetic algorithm is proposed, and a reward value model is designed to estimate the probability of dynamic obstacles on the path, and the reward value function is applied to the genetic algorithm. Unique coding techniques reduce the computational complexity of the algorithm. The fitness function of the genetic algorithm fully considers three factors: the security of the path, the shortest distance of the path and the reward value of the path. The simulation results show that the proposed genetic algorithm is efficient in all kinds of complex dynamic environments.

Harmonic-phase path-integral approximation of thermal quantum correlation functions

NASA Astrophysics Data System (ADS)

Robertson, Christopher; Habershon, Scott

2018-03-01

We present an approximation to the thermal symmetric form of the quantum time-correlation function in the standard position path-integral representation. By transforming to a sum-and-difference position representation and then Taylor-expanding the potential energy surface of the system to second order, the resulting expression provides a harmonic weighting function that approximately recovers the contribution of the phase to the time-correlation function. This method is readily implemented in a Monte Carlo sampling scheme and provides exact results for harmonic potentials (for both linear and non-linear operators) and near-quantitative results for anharmonic systems for low temperatures and times that are likely to be relevant to condensed phase experiments. This article focuses on one-dimensional examples to provide insights into convergence and sampling properties, and we also discuss how this approximation method may be extended to many-dimensional systems.

Variational nature, integration, and properties of Newton reaction path

NASA Astrophysics Data System (ADS)

Bofill, Josep Maria; Quapp, Wolfgang

2011-02-01

The distinguished coordinate path and the reduced gradient following path or its equivalent formulation, the Newton trajectory, are analyzed and unified using the theory of calculus of variations. It is shown that their minimum character is related to the fact that the curve is located in a valley region. In this case, we say that the Newton trajectory is a reaction path with the category of minimum energy path. In addition to these findings a Runge-Kutta-Fehlberg algorithm to integrate these curves is also proposed.

Variational nature, integration, and properties of Newton reaction path.

PubMed

Bofill, Josep Maria; Quapp, Wolfgang

2011-02-21

The distinguished coordinate path and the reduced gradient following path or its equivalent formulation, the Newton trajectory, are analyzed and unified using the theory of calculus of variations. It is shown that their minimum character is related to the fact that the curve is located in a valley region. In this case, we say that the Newton trajectory is a reaction path with the category of minimum energy path. In addition to these findings a Runge-Kutta-Fehlberg algorithm to integrate these curves is also proposed.

Combining path integration and remembered landmarks when navigating without vision.

PubMed

Kalia, Amy A; Schrater, Paul R; Legge, Gordon E

2013-01-01

This study investigated the interaction between remembered landmark and path integration strategies for estimating current location when walking in an environment without vision. We asked whether observers navigating without vision only rely on path integration information to judge their location, or whether remembered landmarks also influence judgments. Participants estimated their location in a hallway after viewing a target (remembered landmark cue) and then walking blindfolded to the same or a conflicting location (path integration cue). We found that participants averaged remembered landmark and path integration information when they judged that both sources provided congruent information about location, which resulted in more precise estimates compared to estimates made with only path integration. In conclusion, humans integrate remembered landmarks and path integration in a gated fashion, dependent on the congruency of the information. Humans can flexibly combine information about remembered landmarks with path integration cues while navigating without visual information.

Combining Path Integration and Remembered Landmarks When Navigating without Vision

PubMed Central

Kalia, Amy A.; Schrater, Paul R.; Legge, Gordon E.

2013-01-01

This study investigated the interaction between remembered landmark and path integration strategies for estimating current location when walking in an environment without vision. We asked whether observers navigating without vision only rely on path integration information to judge their location, or whether remembered landmarks also influence judgments. Participants estimated their location in a hallway after viewing a target (remembered landmark cue) and then walking blindfolded to the same or a conflicting location (path integration cue). We found that participants averaged remembered landmark and path integration information when they judged that both sources provided congruent information about location, which resulted in more precise estimates compared to estimates made with only path integration. In conclusion, humans integrate remembered landmarks and path integration in a gated fashion, dependent on the congruency of the information. Humans can flexibly combine information about remembered landmarks with path integration cues while navigating without visual information. PMID:24039742

A perturbation method to the tent map based on Lyapunov exponent and its application

NASA Astrophysics Data System (ADS)

Cao, Lv-Chen; Luo, Yu-Ling; Qiu, Sen-Hui; Liu, Jun-Xiu

2015-10-01

Perturbation imposed on a chaos system is an effective way to maintain its chaotic features. A novel parameter perturbation method for the tent map based on the Lyapunov exponent is proposed in this paper. The pseudo-random sequence generated by the tent map is sent to another chaos function — the Chebyshev map for the post processing. If the output value of the Chebyshev map falls into a certain range, it will be sent back to replace the parameter of the tent map. As a result, the parameter of the tent map keeps changing dynamically. The statistical analysis and experimental results prove that the disturbed tent map has a highly random distribution and achieves good cryptographic properties of a pseudo-random sequence. As a result, it weakens the phenomenon of strong correlation caused by the finite precision and effectively compensates for the digital chaos system dynamics degradation. Project supported by the Guangxi Provincial Natural Science Foundation, China (Grant No. 2014GXNSFBA118271), the Research Project of Guangxi University, China (Grant No. ZD2014022), the Fund from Guangxi Provincial Key Laboratory of Multi-source Information Mining & Security, China (Grant No. MIMS14-04), the Fund from the Guangxi Provincial Key Laboratory of Wireless Wideband Communication & Signal Processing, China (Grant No. GXKL0614205), the Education Development Foundation and the Doctoral Research Foundation of Guangxi Normal University, the State Scholarship Fund of China Scholarship Council (Grant No. [2014]3012), and the Innovation Project of Guangxi Graduate Education, China (Grant No. YCSZ2015102).

AFMS Flight Path: Building Future Leaders

DTIC Science & Technology

2009-02-12

small numbers of deactivated squadrons were reactivated. In general, the Flight Path maintains the four squadron framework of OMG with an additional...MC fill all but two. Vast differences in rank and promotion rates further bias the AFMS to a non-DOPMA corps led entity . The Flight Path has done...Aeromedical Squadron (AMDS) can combine into an Aeromedical Dental Squadron ( ADOS ) or can reside as flights under the Medical Operations Squadron

Exploring Career Paths. A Guide for Students and Their Families.

ERIC Educational Resources Information Center

Missouri Univ., Columbia. Instructional Materials Lab.

This five-section guide is designed to help students and their parents explore career paths. The first part of the guide is an introduction to the concept of career paths and an explanation of the steps students follow in exploring career paths. The second section, which makes up most of the booklet, covers five steps for exploring career paths:…

Combined Monte Carlo and path-integral method for simulated library of time-resolved reflectance curves from layered tissue models

NASA Astrophysics Data System (ADS)

Wilson, Robert H.; Vishwanath, Karthik; Mycek, Mary-Ann

2009-02-01

Monte Carlo (MC) simulations are considered the "gold standard" for mathematical description of photon transport in tissue, but they can require large computation times. Therefore, it is important to develop simple and efficient methods for accelerating MC simulations, especially when a large "library" of related simulations is needed. A semi-analytical method involving MC simulations and a path-integral (PI) based scaling technique generated time-resolved reflectance curves from layered tissue models. First, a zero-absorption MC simulation was run for a tissue model with fixed scattering properties in each layer. Then, a closed-form expression for the average classical path of a photon in tissue was used to determine the percentage of time that the photon spent in each layer, to create a weighted Beer-Lambert factor to scale the time-resolved reflectance of the simulated zero-absorption tissue model. This method is a unique alternative to other scaling techniques in that it does not require the path length or number of collisions of each photon to be stored during the initial simulation. Effects of various layer thicknesses and absorption and scattering coefficients on the accuracy of the method will be discussed.

Point and path performance of light aircraft: A review and analysis

NASA Technical Reports Server (NTRS)

Smetana, F. O.; Summey, D. C.; Johnson, W. D.

1973-01-01

The literature on methods for predicting the performance of light aircraft is reviewed. The methods discussed in the review extend from the classical instantaneous maximum or minimum technique to techniques for generating mathematically optimum flight paths. Classical point performance techniques are shown to be adequate in many cases but their accuracies are compromised by the need to use simple lift, drag, and thrust relations in order to get closed form solutions. Also the investigation of the effect of changes in weight, altitude, configuration, etc. involves many essentially repetitive calculations. Accordingly, computer programs are provided which can fit arbitrary drag polars and power curves with very high precision and which can then use the resulting fits to compute the performance under the assumption that the aircraft is not accelerating.

Evaluation of Acoustic Propagation Paths into the Human Head

DTIC Science & Technology

2005-04-01

pressure amplitude) via the alternate propagation paths. A 3D finite-element solid mesh was constructed using a digital image database of an adult...optics, rays are used to depict the path or paths taken as a light wave travels through a lens. However, in optics, the eikonal equation can be solved

Hot gas path component having near wall cooling features

DOE Office of Scientific and Technical Information (OSTI.GOV)

Miranda, Carlos Miguel; Kottilingam, Srikanth Chandrudu; Lacy, Benjamin Paul

A method for providing micro-channels in a hot gas path component includes forming a first micro-channel in an exterior surface of a substrate of the hot gas path component. A second micro-channel is formed in the exterior surface of the hot gas path component such that it is separated from the first micro-channel by a surface gap having a first width. The method also includes disposing a braze sheet onto the exterior surface of the hot gas path component such that the braze sheet covers at least of portion of the first and second micro-channels, and heating the braze sheetmore » to bond it to at least a portion of the exterior surface of the hot gas path component.« less

Quad-rotor flight path energy optimization

NASA Astrophysics Data System (ADS)

Kemper, Edward

Quad-Rotor unmanned areal vehicles (UAVs) have been a popular area of research and development in the last decade, especially with the advent of affordable microcontrollers like the MSP 430 and the Raspberry Pi. Path-Energy Optimization is an area that is well developed for linear systems. In this thesis, this idea of path-energy optimization is extended to the nonlinear model of the Quad-rotor UAV. The classical optimization technique is adapted to the nonlinear model that is derived for the problem at hand, coming up with a set of partial differential equations and boundary value conditions to solve these equations. Then, different techniques to implement energy optimization algorithms are tested using simulations in Python. First, a purely nonlinear approach is used. This method is shown to be computationally intensive, with no practical solution available in a reasonable amount of time. Second, heuristic techniques to minimize the energy of the flight path are tested, using Ziegler-Nichols' proportional integral derivative (PID) controller tuning technique. Finally, a brute force look-up table based PID controller is used. Simulation results of the heuristic method show that both reliable control of the system and path-energy optimization are achieved in a reasonable amount of time.

Star-Paths, Stones and Horizon Astronomy

NASA Astrophysics Data System (ADS)

Brady, Bernadette

2015-05-01

Archaeoastronomers tend to approach ancient monuments focusing on the landscape and the horizon calendar events of sun and moon and, due to problems with precession, generally ignore the movement of the stars. However, locating the position of solar calendar points on the horizon can have other uses apart from calendar and/or cosmological purposes. This paper firstly suggests that the stars do not need to be ignored. By considering the evidence of the Phaenomena, a sky poem by Aratus of Soli, a third century BC Greek poet, and his use of second millennium BC star lore fragments, this paper argues that the stars were a part of the knowledge of horizon astronomy. Aratus' poem implied that the horizon astronomy of the late Neolithic and Bronze Age periods included knowledge of star-paths or 'linear constellations' that were defined by particular horizon calendar events and other azimuths. Knowledge of such star-paths would have enabled navigation and orientation, and by using permanent markers, constructed or natural, to define these paths, they were immune to precession as the stones could redefine a star-path for a future generation. Finally the paper presents other possible intentions behind the diverse orientation of passage tombs and some megalithic sites.

Circular common-path point diffraction interferometer.

PubMed

Du, Yongzhao; Feng, Guoying; Li, Hongru; Vargas, J; Zhou, Shouhuan

2012-10-01

A simple and compact point-diffraction interferometer with circular common-path geometry configuration is developed. The interferometer is constructed by a beam-splitter, two reflection mirrors, and a telescope system composed by two lenses. The signal and reference waves travel along the same path. Furthermore, an opaque mask containing a reference pinhole and a test object holder or test window is positioned in the common focal plane of the telescope system. The object wave is divided into two beams that take opposite paths along the interferometer. The reference wave is filtered by the reference pinhole, while the signal wave is transmitted through the object holder. The reference and signal waves are combined again in the beam-splitter and their interference is imaged in the CCD. The new design is compact, vibration insensitive, and suitable for the measurement of moving objects or dynamic processes.

14 CFR 23.61 - Takeoff flight path.

Code of Federal Regulations, 2014 CFR

2014-01-01

... 14 Aeronautics and Space 1 2014-01-01 2014-01-01 false Takeoff flight path. 23.61 Section 23.61... STANDARDS: NORMAL, UTILITY, ACROBATIC, AND COMMUTER CATEGORY AIRPLANES Flight Performance § 23.61 Takeoff flight path. For normal, utility, and acrobatic category multiengine jets of more than 6,000 pounds...

Interactions of information transfer along separable causal paths

NASA Astrophysics Data System (ADS)

Jiang, Peishi; Kumar, Praveen

2018-04-01

Complex systems arise as a result of interdependences between multiple variables, whose causal interactions can be visualized in a time-series graph. Transfer entropy and information partitioning approaches have been used to characterize such dependences. However, these approaches capture net information transfer occurring through a multitude of pathways involved in the interaction and as a result mask our ability to discern the causal interaction within a subgraph of interest through specific pathways. We build on recent developments of momentary information transfer along causal paths proposed by Runge [Phys. Rev. E 92, 062829 (2015), 10.1103/PhysRevE.92.062829] to develop a framework for quantifying information partitioning along separable causal paths. Momentary information transfer along causal paths captures the amount of information transfer between any two variables lagged at two specific points in time. Our approach expands this concept to characterize the causal interaction in terms of synergistic, unique, and redundant information transfer through separable causal paths. Through a graphical model, we analyze the impact of the separable and nonseparable causal paths and the causality structure embedded in the graph as well as the noise effect on information partitioning by using synthetic data generated from two coupled logistic equation models. Our approach can provide a valuable reference for an autonomous information partitioning along separable causal paths which form a causal subgraph influencing a target.

Transition paths in single-molecule force spectroscopy

NASA Astrophysics Data System (ADS)

Cossio, Pilar; Hummer, Gerhard; Szabo, Attila

2018-03-01

In a typical single-molecule force spectroscopy experiment, the ends of the molecule of interest are connected by long polymer linkers to a pair of mesoscopic beads trapped in the focus of two laser beams. At constant force load, the total extension, i.e., the end-to-end distance of the molecule plus linkers, is measured as a function of time. In the simplest systems, the measured extension fluctuates about two values characteristic of folded and unfolded states, with occasional transitions between them. We have recently shown that molecular (un)folding rates can be recovered from such trajectories, with a small linker correction, as long as the characteristic time of the bead fluctuations is shorter than the residence time in the unfolded (folded) state. Here, we show that accurate measurements of the molecular transition path times require an even faster apparatus response. Transition paths, the trajectory segments in which the molecule (un)folds, are properly resolved only if the beads fluctuate more rapidly than the end-to-end distance of the molecule. Therefore, over a wide regime, the measured rates may be meaningful but not the transition path times. Analytic expressions for the measured mean transition path times are obtained for systems diffusing anisotropically on a two-dimensional free energy surface. The transition path times depend on the properties both of the molecule and of the pulling device.

A career path in clinical pathways.

PubMed

Bower, K A

1998-03-01

Much like the development of a clinical path, the creation of a career path requires knowledge of patterns of behavior, needs for standardized education and skill development, along with variance analysis and individualized care. This nationally known nursing entrepreneur tells the story of her involvement in the development of case management and clinical pathways and how she turned that into a successful business that has changed how patient care is managed nationally and internationally.

Experimental demonstration of spectrum-sliced elastic optical path network (SLICE).

PubMed

Kozicki, Bartłomiej; Takara, Hidehiko; Tsukishima, Yukio; Yoshimatsu, Toshihide; Yonenaga, Kazushige; Jinno, Masahiko

2010-10-11

We describe experimental demonstration of spectrum-sliced elastic optical path network (SLICE) architecture. We employ optical orthogonal frequency-division multiplexing (OFDM) modulation format and bandwidth-variable optical cross-connects (OXC) to generate, transmit and receive optical paths with bandwidths of up to 1 Tb/s. We experimentally demonstrate elastic optical path setup and spectrally-efficient transmission of multiple channels with bit rates ranging from 40 to 140 Gb/s between six nodes of a mesh network. We show dynamic bandwidth scalability for optical paths with bit rates of 40 to 440 Gb/s. Moreover, we demonstrate multihop transmission of a 1 Tb/s optical path over 400 km of standard single-mode fiber (SMF). Finally, we investigate the filtering properties and the required guard band width for spectrally-efficient allocation of optical paths in SLICE.

Comparison of SVM and ANFIS for Snore Related Sounds Classification by Using the Largest Lyapunov Exponent and Entropy

PubMed Central

Ankışhan, Haydar; Yılmaz, Derya

2013-01-01

Snoring, which may be decisive for many diseases, is an important indicator especially for sleep disorders. In recent years, many studies have been performed on the snore related sounds (SRSs) due to producing useful results for detection of sleep apnea/hypopnea syndrome (SAHS). The first important step of these studies is the detection of snore from SRSs by using different time and frequency domain features. The SRSs have a complex nature that is originated from several physiological and physical conditions. The nonlinear characteristics of SRSs can be examined with chaos theory methods which are widely used to evaluate the biomedical signals and systems, recently. The aim of this study is to classify the SRSs as snore/breathing/silence by using the largest Lyapunov exponent (LLE) and entropy with multiclass support vector machines (SVMs) and adaptive network fuzzy inference system (ANFIS). Two different experiments were performed for different training and test data sets. Experimental results show that the multiclass SVMs can produce the better classification results than ANFIS with used nonlinear quantities. Additionally, these nonlinear features are carrying meaningful information for classifying SRSs and are able to be used for diagnosis of sleep disorders such as SAHS. PMID:24194786

An Unplanned Path

ERIC Educational Resources Information Center

McGarvey, Lynn M.; Sterenberg, Gladys Y.; Long, Julie S.

2013-01-01

The authors elucidate what they saw as three important challenges to overcome along the path to becoming elementary school mathematics teacher leaders: marginal interest in math, low self-confidence, and teaching in isolation. To illustrate how these challenges were mitigated, they focus on the stories of two elementary school teachers--Laura and…

Interactions of the polarization and the sun compass in path integration of desert ants.

PubMed

Lebhardt, Fleur; Ronacher, Bernhard

2014-08-01

Desert ants, Cataglyphis fortis, perform large-scale foraging trips in their featureless habitat using path integration as their main navigation tool. To determine their walking direction they use primarily celestial cues, the sky's polarization pattern and the sun position. To examine the relative importance of these two celestial cues, we performed cue conflict experiments. We manipulated the polarization pattern experienced by the ants during their outbound foraging excursions, reducing it to a single electric field (e-)vector direction with a linear polarization filter. The simultaneous view of the sun created situations in which the directional information of the sun and the polarization compass disagreed. The heading directions of the homebound runs recorded on a test field with full view of the natural sky demonstrate that none of both compasses completely dominated over the other. Rather the ants seemed to compute an intermediate homing direction to which both compass systems contributed roughly equally. Direct sunlight and polarized light are detected in different regions of the ant's compound eye, suggesting two separate pathways for obtaining directional information. In the experimental paradigm applied here, these two pathways seem to feed into the path integrator with similar weights.

Image-Based Visual Servoing for Robotic Systems: A Nonlinear Lyapunov-Based Control Approach

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dixon, Warren

2004-06-01

There is significant motivation to provide robotic systems with improved autonomy as a means to significantly accelerate deactivation and decommissioning (D&D) operations while also reducing the associated costs, removing human operators from hazardous environments, and reducing the required burden and skill of human operators. To achieve improved autonomy, this project focused on the basic science challenges leading to the development of visual servo controllers. The challenge in developing these controllers is that a camera provides 2-dimensional image information about the 3-dimensional Euclidean-space through a perspective (range dependent) projection that can be corrupted by uncertainty in the camera calibration matrix andmore » by disturbances such as nonlinear radial distortion. Disturbances in this relationship (i.e., corruption in the sensor information) propagate erroneous information to the feedback controller of the robot, leading to potentially unpredictable task execution. This research project focused on the development of a visual servo control methodology that targets compensating for disturbances in the camera model (i.e., camera calibration and the recovery of range information) as a means to achieve predictable response by the robotic system operating in unstructured environments. The fundamental idea is to use nonlinear Lyapunov-based techniques along with photogrammetry methods to overcome the complex control issues and alleviate many of the restrictive assumptions that impact current robotic applications. The outcome of this control methodology is a plug-and-play visual servoing control module that can be utilized in conjunction with current technology such as feature recognition and extraction to enable robotic systems with the capabilities of increased accuracy, autonomy, and robustness, with a larger field of view (and hence a larger workspace). The developed methodology has been reported in numerous peer-reviewed publications and the

Path Following in the Exact Penalty Method of Convex Programming.

PubMed

Zhou, Hua; Lange, Kenneth

2015-07-01

Classical penalty methods solve a sequence of unconstrained problems that put greater and greater stress on meeting the constraints. In the limit as the penalty constant tends to ∞, one recovers the constrained solution. In the exact penalty method, squared penalties are replaced by absolute value penalties, and the solution is recovered for a finite value of the penalty constant. In practice, the kinks in the penalty and the unknown magnitude of the penalty constant prevent wide application of the exact penalty method in nonlinear programming. In this article, we examine a strategy of path following consistent with the exact penalty method. Instead of performing optimization at a single penalty constant, we trace the solution as a continuous function of the penalty constant. Thus, path following starts at the unconstrained solution and follows the solution path as the penalty constant increases. In the process, the solution path hits, slides along, and exits from the various constraints. For quadratic programming, the solution path is piecewise linear and takes large jumps from constraint to constraint. For a general convex program, the solution path is piecewise smooth, and path following operates by numerically solving an ordinary differential equation segment by segment. Our diverse applications to a) projection onto a convex set, b) nonnegative least squares, c) quadratically constrained quadratic programming, d) geometric programming, and e) semidefinite programming illustrate the mechanics and potential of path following. The final detour to image denoising demonstrates the relevance of path following to regularized estimation in inverse problems. In regularized estimation, one follows the solution path as the penalty constant decreases from a large value.

Path Following in the Exact Penalty Method of Convex Programming

PubMed Central

Zhou, Hua; Lange, Kenneth

2015-01-01

Classical penalty methods solve a sequence of unconstrained problems that put greater and greater stress on meeting the constraints. In the limit as the penalty constant tends to ∞, one recovers the constrained solution. In the exact penalty method, squared penalties are replaced by absolute value penalties, and the solution is recovered for a finite value of the penalty constant. In practice, the kinks in the penalty and the unknown magnitude of the penalty constant prevent wide application of the exact penalty method in nonlinear programming. In this article, we examine a strategy of path following consistent with the exact penalty method. Instead of performing optimization at a single penalty constant, we trace the solution as a continuous function of the penalty constant. Thus, path following starts at the unconstrained solution and follows the solution path as the penalty constant increases. In the process, the solution path hits, slides along, and exits from the various constraints. For quadratic programming, the solution path is piecewise linear and takes large jumps from constraint to constraint. For a general convex program, the solution path is piecewise smooth, and path following operates by numerically solving an ordinary differential equation segment by segment. Our diverse applications to a) projection onto a convex set, b) nonnegative least squares, c) quadratically constrained quadratic programming, d) geometric programming, and e) semidefinite programming illustrate the mechanics and potential of path following. The final detour to image denoising demonstrates the relevance of path following to regularized estimation in inverse problems. In regularized estimation, one follows the solution path as the penalty constant decreases from a large value. PMID:26366044

Which coordinate system for modelling path integration?

PubMed

Vickerstaff, Robert J; Cheung, Allen

2010-03-21

Path integration is a navigation strategy widely observed in nature where an animal maintains a running estimate, called the home vector, of its location during an excursion. Evidence suggests it is both ancient and ubiquitous in nature, and has been studied for over a century. In that time, canonical and neural network models have flourished, based on a wide range of assumptions, justifications and supporting data. Despite the importance of the phenomenon, consensus and unifying principles appear lacking. A fundamental issue is the neural representation of space needed for biological path integration. This paper presents a scheme to classify path integration systems on the basis of the way the home vector records and updates the spatial relationship between the animal and its home location. Four extended classes of coordinate systems are used to unify and review both canonical and neural network models of path integration, from the arthropod and mammalian literature. This scheme demonstrates analytical equivalence between models which may otherwise appear unrelated, and distinguishes between models which may superficially appear similar. A thorough analysis is carried out of the equational forms of important facets of path integration including updating, steering, searching and systematic errors, using each of the four coordinate systems. The type of available directional cue, namely allothetic or idiothetic, is also considered. It is shown that on balance, the class of home vectors which includes the geocentric Cartesian coordinate system, appears to be the most robust for biological systems. A key conclusion is that deducing computational structure from behavioural data alone will be difficult or impossible, at least in the absence of an analysis of random errors. Consequently it is likely that further theoretical insights into path integration will require an in-depth study of the effect of noise on the four classes of home vectors. Copyright 2009 Elsevier Ltd

Performance analysis of multi-radio routing protocol in cognitive radio ad hoc networks under different path failure rate

NASA Astrophysics Data System (ADS)

Che-Aron, Z.; Abdalla, A. H.; Abdullah, K.; Hassan, W. H.

2013-12-01

In recent years, Cognitive Radio (CR) technology has largely attracted significant studies and research. Cognitive Radio Ad Hoc Network (CRAHN) is an emerging self-organized, multi-hop, wireless network which allows unlicensed users to opportunistically access available licensed spectrum bands for data communication under an intelligent and cautious manner. However, in CRAHNs, a lot of failures can easily occur during data transmission caused by PU (Primary User) activity, topology change, node fault, or link degradation. In this paper, an attempt has been made to evaluate the performance of the Multi-Radio Link-Quality Source Routing (MR-LQSR) protocol in CRAHNs under different path failure rate. In the MR-LQSR protocol, the Weighted Cumulative Expected Transmission Time (WCETT) is used as the routing metric. The simulations are carried out using the NS-2 simulator. The protocol performance is evaluated with respect to performance metrics like average throughput, packet loss, average end-to-end delay and average jitter. From the simulation results, it is observed that the number of path failures depends on the PUs number and mobility rate of SUs (Secondary Users). Moreover, the protocol performance is greatly affected when the path failure rate is high, leading to major service outages.

Stochastic Evolutionary Algorithms for Planning Robot Paths

NASA Technical Reports Server (NTRS)

Fink, Wolfgang; Aghazarian, Hrand; Huntsberger, Terrance; Terrile, Richard

2006-01-01

A computer program implements stochastic evolutionary algorithms for planning and optimizing collision-free paths for robots and their jointed limbs. Stochastic evolutionary algorithms can be made to produce acceptably close approximations to exact, optimal solutions for path-planning problems while often demanding much less computation than do exhaustive-search and deterministic inverse-kinematics algorithms that have been used previously for this purpose. Hence, the present software is better suited for application aboard robots having limited computing capabilities (see figure). The stochastic aspect lies in the use of simulated annealing to (1) prevent trapping of an optimization algorithm in local minima of an energy-like error measure by which the fitness of a trial solution is evaluated while (2) ensuring that the entire multidimensional configuration and parameter space of the path-planning problem is sampled efficiently with respect to both robot joint angles and computation time. Simulated annealing is an established technique for avoiding local minima in multidimensional optimization problems, but has not, until now, been applied to planning collision-free robot paths by use of low-power computers.

A Path to Discovery

ERIC Educational Resources Information Center

Stegemoller, William; Stegemoller, Rebecca

2004-01-01

The path taken and the turns made as a turtle traces a polygon are examined to discover an important theorem in geometry. A unique tool, the Angle Adder, is implemented in the investigation. (Contains 9 figures.)

Construction of energy-stable Galerkin reduced order models.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kalashnikova, Irina; Barone, Matthew Franklin; Arunajatesan, Srinivasan

2013-05-01

This report aims to unify several approaches for building stable projection-based reduced order models (ROMs). Attention is focused on linear time-invariant (LTI) systems. The model reduction procedure consists of two steps: the computation of a reduced basis, and the projection of the governing partial differential equations (PDEs) onto this reduced basis. Two kinds of reduced bases are considered: the proper orthogonal decomposition (POD) basis and the balanced truncation basis. The projection step of the model reduction can be done in two ways: via continuous projection or via discrete projection. First, an approach for building energy-stable Galerkin ROMs for linear hyperbolicmore » or incompletely parabolic systems of PDEs using continuous projection is proposed. The idea is to apply to the set of PDEs a transformation induced by the Lyapunov function for the system, and to build the ROM in the transformed variables. The resulting ROM will be energy-stable for any choice of reduced basis. It is shown that, for many PDE systems, the desired transformation is induced by a special weighted L2 inner product, termed the %E2%80%9Csymmetry inner product%E2%80%9D. Attention is then turned to building energy-stable ROMs via discrete projection. A discrete counterpart of the continuous symmetry inner product, a weighted L2 inner product termed the %E2%80%9CLyapunov inner product%E2%80%9D, is derived. The weighting matrix that defines the Lyapunov inner product can be computed in a black-box fashion for a stable LTI system arising from the discretization of a system of PDEs in space. It is shown that a ROM constructed via discrete projection using the Lyapunov inner product will be energy-stable for any choice of reduced basis. Connections between the Lyapunov inner product and the inner product induced by the balanced truncation algorithm are made. Comparisons are also made between the symmetry inner product and the Lyapunov inner product. The performance of ROMs

Calculating Least Risk Paths in 3d Indoor Space

NASA Astrophysics Data System (ADS)

Vanclooster, A.; De Maeyer, Ph.; Fack, V.; Van de Weghe, N.

2013-08-01

Over the last couple of years, research on indoor environments has gained a fresh impetus; more specifically applications that support navigation and wayfinding have become one of the booming industries. Indoor navigation research currently covers the technological aspect of indoor positioning and the modelling of indoor space. The algorithmic development to support navigation has so far been left mostly untouched, as most applications mainly rely on adapting Dijkstra's shortest path algorithm to an indoor network. However, alternative algorithms for outdoor navigation have been proposed adding a more cognitive notion to the calculated paths and as such adhering to the natural wayfinding behaviour (e.g. simplest paths, least risk paths). These algorithms are currently restricted to outdoor applications. The need for indoor cognitive algorithms is highlighted by a more challenged navigation and orientation due to the specific indoor structure (e.g. fragmentation, less visibility, confined areas…). As such, the clarity and easiness of route instructions is of paramount importance when distributing indoor routes. A shortest or fastest path indoors not necessarily aligns with the cognitive mapping of the building. Therefore, the aim of this research is to extend those richer cognitive algorithms to three-dimensional indoor environments. More specifically for this paper, we will focus on the application of the least risk path algorithm of Grum (2005) to an indoor space. The algorithm as proposed by Grum (2005) is duplicated and tested in a complex multi-storey building. The results of several least risk path calculations are compared to the shortest paths in indoor environments in terms of total length, improvement in route description complexity and number of turns. Several scenarios are tested in this comparison: paths covering a single floor, paths crossing several building wings and/or floors. Adjustments to the algorithm are proposed to be more aligned to the

Energy aware path planning in complex four dimensional environments

NASA Astrophysics Data System (ADS)

Chakrabarty, Anjan

This dissertation addresses the problem of energy-aware path planning for small autonomous vehicles. While small autonomous vehicles can perform missions that are too risky (or infeasible) for larger vehicles, the missions are limited by the amount of energy that can be carried on board the vehicle. Path planning techniques that either minimize energy consumption or exploit energy available in the environment can thus increase range and endurance. Path planning is complicated by significant spatial (and potentially temporal) variations in the environment. While the main focus is on autonomous aircraft, this research also addresses autonomous ground vehicles. Range and endurance of small unmanned aerial vehicles (UAVs) can be greatly improved by utilizing energy from the atmosphere. Wind can be exploited to minimize energy consumption of a small UAV. But wind, like any other atmospheric component , is a space and time varying phenomenon. To effectively use wind for long range missions, both exploration and exploitation of wind is critical. This research presents a kinematics based tree algorithm which efficiently handles the four dimensional (three spatial and time) path planning problem. The Kinematic Tree algorithm provides a sequence of waypoints, airspeeds, heading and bank angle commands for each segment of the path. The planner is shown to be resolution complete and computationally efficient. Global optimality of the cost function cannot be claimed, as energy is gained from the atmosphere, making the cost function inadmissible. However the Kinematic Tree is shown to be optimal up to resolution if the cost function is admissible. Simulation results show the efficacy of this planning method for a glider in complex real wind data. Simulation results verify that the planner is able to extract energy from the atmosphere enabling long range missions. The Kinematic Tree planning framework, developed to minimize energy consumption of UAVs, is applied for path planning

Research on Taxiway Path Optimization Based on Conflict Detection

PubMed Central

Zhou, Hang; Jiang, Xinxin

2015-01-01

Taxiway path planning is one of the effective measures to make full use of the airport resources, and the optimized paths can ensure the safety of the aircraft during the sliding process. In this paper, the taxiway path planning based on conflict detection is considered. Specific steps are shown as follows: firstly, make an improvement on A * algorithm, the conflict detection strategy is added to search for the shortest and safe path in the static taxiway network. Then, according to the sliding speed of aircraft, a time table for each node is determined and the safety interval is treated as the constraint to judge whether there is a conflict or not. The intelligent initial path planning model is established based on the results. Finally, make an example in an airport simulation environment, detect and relieve the conflict to ensure the safety. The results indicate that the model established in this paper is effective and feasible. Meanwhile, make comparison with the improved A*algorithm and other intelligent algorithms, conclude that the improved A*algorithm has great advantages. It could not only optimize taxiway path, but also ensure the safety of the sliding process and improve the operational efficiency. PMID:26226485

Research on Taxiway Path Optimization Based on Conflict Detection.

PubMed

Zhou, Hang; Jiang, Xinxin

2015-01-01

Taxiway path planning is one of the effective measures to make full use of the airport resources, and the optimized paths can ensure the safety of the aircraft during the sliding process. In this paper, the taxiway path planning based on conflict detection is considered. Specific steps are shown as follows: firstly, make an improvement on A * algorithm, the conflict detection strategy is added to search for the shortest and safe path in the static taxiway network. Then, according to the sliding speed of aircraft, a time table for each node is determined and the safety interval is treated as the constraint to judge whether there is a conflict or not. The intelligent initial path planning model is established based on the results. Finally, make an example in an airport simulation environment, detect and relieve the conflict to ensure the safety. The results indicate that the model established in this paper is effective and feasible. Meanwhile, make comparison with the improved A*algorithm and other intelligent algorithms, conclude that the improved A*algorithm has great advantages. It could not only optimize taxiway path, but also ensure the safety of the sliding process and improve the operational efficiency.

Two betweenness centrality measures based on Randomized Shortest Paths

PubMed Central

Kivimäki, Ilkka; Lebichot, Bertrand; Saramäki, Jari; Saerens, Marco

2016-01-01

This paper introduces two new closely related betweenness centrality measures based on the Randomized Shortest Paths (RSP) framework, which fill a gap between traditional network centrality measures based on shortest paths and more recent methods considering random walks or current flows. The framework defines Boltzmann probability distributions over paths of the network which focus on the shortest paths, but also take into account longer paths depending on an inverse temperature parameter. RSP’s have previously proven to be useful in defining distance measures on networks. In this work we study their utility in quantifying the importance of the nodes of a network. The proposed RSP betweenness centralities combine, in an optimal way, the ideas of using the shortest and purely random paths for analysing the roles of network nodes, avoiding issues involving these two paradigms. We present the derivations of these measures and how they can be computed in an efficient way. In addition, we show with real world examples the potential of the RSP betweenness centralities in identifying interesting nodes of a network that more traditional methods might fail to notice. PMID:26838176

Tortuous Pore Path Through the Glaucomatous Lamina Cribrosa.

PubMed

Wang, Bo; Lucy, Katie A; Schuman, Joel S; Sigal, Ian A; Bilonick, Richard A; Lu, Chen; Liu, Jonathan; Grulkowski, Ireneusz; Nadler, Zachary; Ishikawa, Hiroshi; Kagemann, Larry; Fujimoto, James G; Wollstein, Gadi

2018-05-08

The lamina cribrosa is a primary site of damage in glaucoma. While mechanical distortion is hypothesized to cause reduction of axoplasmic flow, little is known about how the pores, which contains the retinal ganglion cell axons, traverse the lamina cribrosa. We investigated lamina cribrosa pore paths in vivo to quantify differences in tortuosity of pore paths between healthy and glaucomatous eyes. We imaged 16 healthy, 23 glaucoma suspect and 48 glaucomatous eyes from 70 subjects using a swept source optical coherence tomography system. The lamina cribrosa pores were automatically segmented using a previously described segmentation algorithm. Individual pore paths were automatically tracked through the depth of the lamina cribrosa using custom software. Pore path convergence to the optic nerve center and tortuosity was quantified for each eye. We found that lamina cribrosa pore pathways traverse the lamina cribrosa closer to the optic nerve center along the depth of the lamina cribrosa regardless of disease severity or diagnostic category. In addition, pores of glaucoma eyes take a more tortuous path through the lamina cribrosa compared to those of healthy eyes, suggesting a potential mechanism for reduction of axoplasmic flow in glaucoma.

Covariant path integrals on hyperbolic surfaces

NASA Astrophysics Data System (ADS)

Schaefer, Joe

1997-11-01

DeWitt's covariant formulation of path integration [B. De Witt, "Dynamical theory in curved spaces. I. A review of the classical and quantum action principles," Rev. Mod. Phys. 29, 377-397 (1957)] has two practical advantages over the traditional methods of "lattice approximations;" there is no ordering problem, and classical symmetries are manifestly preserved at the quantum level. Applying the spectral theorem for unbounded self-adjoint operators, we provide a rigorous proof of the convergence of certain path integrals on Riemann surfaces of constant curvature -1. The Pauli-DeWitt curvature correction term arises, as in DeWitt's work. Introducing a Fuchsian group Γ of the first kind, and a continuous, bounded, Γ-automorphic potential V, we obtain a Feynman-Kac formula for the automorphic Schrödinger equation on the Riemann surface ΓH. We analyze the Wick rotation and prove the strong convergence of the so-called Feynman maps [K. D. Elworthy, Path Integration on Manifolds, Mathematical Aspects of Superspace, edited by Seifert, Clarke, and Rosenblum (Reidel, Boston, 1983), pp. 47-90] on a dense set of states. Finally, we give a new proof of some results in C. Grosche and F. Steiner, "The path integral on the Poincare upper half plane and for Liouville quantum mechanics," Phys. Lett. A 123, 319-328 (1987).

Entanglement by Path Identity.

PubMed

Krenn, Mario; Hochrainer, Armin; Lahiri, Mayukh; Zeilinger, Anton

2017-02-24

Quantum entanglement is one of the most prominent features of quantum mechanics and forms the basis of quantum information technologies. Here we present a novel method for the creation of quantum entanglement in multipartite and high-dimensional systems. The two ingredients are (i) superposition of photon pairs with different origins and (ii) aligning photons such that their paths are identical. We explain the experimentally feasible creation of various classes of multiphoton entanglement encoded in polarization as well as in high-dimensional Hilbert spaces-starting only from nonentangled photon pairs. For two photons, arbitrary high-dimensional entanglement can be created. The idea of generating entanglement by path identity could also apply to quantum entities other than photons. We discovered the technique by analyzing the output of a computer algorithm. This shows that computer designed quantum experiments can be inspirations for new techniques.

Entanglement by Path Identity

NASA Astrophysics Data System (ADS)

Krenn, Mario; Hochrainer, Armin; Lahiri, Mayukh; Zeilinger, Anton

2017-02-01

Quantum entanglement is one of the most prominent features of quantum mechanics and forms the basis of quantum information technologies. Here we present a novel method for the creation of quantum entanglement in multipartite and high-dimensional systems. The two ingredients are (i) superposition of photon pairs with different origins and (ii) aligning photons such that their paths are identical. We explain the experimentally feasible creation of various classes of multiphoton entanglement encoded in polarization as well as in high-dimensional Hilbert spaces—starting only from nonentangled photon pairs. For two photons, arbitrary high-dimensional entanglement can be created. The idea of generating entanglement by path identity could also apply to quantum entities other than photons. We discovered the technique by analyzing the output of a computer algorithm. This shows that computer designed quantum experiments can be inspirations for new techniques.

Optimal Path Determination for Flying Vehicle to Search an Object

NASA Astrophysics Data System (ADS)

Heru Tjahjana, R.; Heri Soelistyo U, R.; Ratnasari, L.; Irawanto, B.

2018-01-01

In this paper, a method to determine optimal path for flying vehicle to search an object is proposed. Background of the paper is controlling air vehicle to search an object. Optimal path determination is one of the most popular problem in optimization. This paper describe model of control design for a flying vehicle to search an object, and focus on the optimal path that used to search an object. In this paper, optimal control model is used to control flying vehicle to make the vehicle move in optimal path. If the vehicle move in optimal path, then the path to reach the searched object also optimal. The cost Functional is one of the most important things in optimal control design, in this paper the cost functional make the air vehicle can move as soon as possible to reach the object. The axis reference of flying vehicle uses N-E-D (North-East-Down) coordinate system. The result of this paper are the theorems which say that the cost functional make the control optimal and make the vehicle move in optimal path are proved analytically. The other result of this paper also shows the cost functional which used is convex. The convexity of the cost functional is use for guarantee the existence of optimal control. This paper also expose some simulations to show an optimal path for flying vehicle to search an object. The optimization method which used to find the optimal control and optimal path vehicle in this paper is Pontryagin Minimum Principle.

Performance analysis of CCSDS path service

NASA Technical Reports Server (NTRS)

Johnson, Marjory J.

1989-01-01

A communications service, called Path Service, is currently being developed by the Consultative Committee for Space Data Systems (CCSDS) to provide a mechanism for the efficient transmission of telemetry data from space to ground for complex space missions of the future. This is an important service, due to the large volumes of telemetry data that will be generated during these missions. A preliminary analysis of performance of Path Service is presented with respect to protocol-processing requirements and channel utilization.

Paths and wakes of deformable nearly spheroidal rising bubbles close to the transition to path instability

NASA Astrophysics Data System (ADS)

Cano-Lozano, José Carlos; Martínez-Bazán, Carlos; Magnaudet, Jacques; Tchoufag, Joël

2016-09-01

We report on a series of results provided by three-dimensional numerical simulations of nearly spheroidal bubbles freely rising and deforming in a still liquid in the regime close to the transition to path instability. These results improve upon those of recent computational studies [Cano-Lozano et al., Int. J. Multiphase Flow 51, 11 (2013), 10.1016/j.ijmultiphaseflow.2012.11.005; Phys. Fluids 28, 014102 (2016), 10.1063/1.4939703] in which the neutral curve associated with this transition was obtained by considering realistic but frozen bubble shapes. Depending on the dimensionless parameters that characterize the system, various paths geometries are observed by letting an initially spherical bubble starting from rest rise under the effect of buoyancy and adjust its shape to the surrounding flow. These include the well-documented rectilinear axisymmetric, planar zigzagging, and spiraling (or helical) regimes. A flattened spiraling regime that most often eventually turns into either a planar zigzagging or a helical regime is also frequently observed. Finally, a chaotic regime in which the bubble experiences small horizontal displacements (typically one order of magnitude smaller than in the other regimes) is found to take place in a region of the parameter space where no standing eddy exists at the back of the bubble. The discovery of this regime provides evidence that path instability does not always result from a wake instability as previously believed. In each regime, we examine the characteristics of the path, bubble shape, and vortical structure in the wake, as well as their couplings. In particular, we observe that, depending on the fluctuations of the rise velocity, two different vortex shedding modes exist in the zigzagging regime, confirming earlier findings with falling spheres. The simulations also reveal that significant bubble deformations may take place along zigzagging or spiraling paths and that, under certain circumstances, they dramatically alter

Master equations and the theory of stochastic path integrals

NASA Astrophysics Data System (ADS)

Weber, Markus F.; Frey, Erwin

2017-04-01

This review provides a pedagogic and self-contained introduction to master equations and to their representation by path integrals. Since the 1930s, master equations have served as a fundamental tool to understand the role of fluctuations in complex biological, chemical, and physical systems. Despite their simple appearance, analyses of master equations most often rely on low-noise approximations such as the Kramers-Moyal or the system size expansion, or require ad-hoc closure schemes for the derivation of low-order moment equations. We focus on numerical and analytical methods going beyond the low-noise limit and provide a unified framework for the study of master equations. After deriving the forward and backward master equations from the Chapman-Kolmogorov equation, we show how the two master equations can be cast into either of four linear partial differential equations (PDEs). Three of these PDEs are discussed in detail. The first PDE governs the time evolution of a generalized probability generating function whose basis depends on the stochastic process under consideration. Spectral methods, WKB approximations, and a variational approach have been proposed for the analysis of the PDE. The second PDE is novel and is obeyed by a distribution that is marginalized over an initial state. It proves useful for the computation of mean extinction times. The third PDE describes the time evolution of a ‘generating functional’, which generalizes the so-called Poisson representation. Subsequently, the solutions of the PDEs are expressed in terms of two path integrals: a ‘forward’ and a ‘backward’ path integral. Combined with inverse transformations, one obtains two distinct path integral representations of the conditional probability distribution solving the master equations. We exemplify both path integrals in analysing elementary chemical reactions. Moreover, we show how a well-known path integral representation of averaged observables can be recovered from

Master equations and the theory of stochastic path integrals.

PubMed

Weber, Markus F; Frey, Erwin

2017-04-01

This review provides a pedagogic and self-contained introduction to master equations and to their representation by path integrals. Since the 1930s, master equations have served as a fundamental tool to understand the role of fluctuations in complex biological, chemical, and physical systems. Despite their simple appearance, analyses of master equations most often rely on low-noise approximations such as the Kramers-Moyal or the system size expansion, or require ad-hoc closure schemes for the derivation of low-order moment equations. We focus on numerical and analytical methods going beyond the low-noise limit and provide a unified framework for the study of master equations. After deriving the forward and backward master equations from the Chapman-Kolmogorov equation, we show how the two master equations can be cast into either of four linear partial differential equations (PDEs). Three of these PDEs are discussed in detail. The first PDE governs the time evolution of a generalized probability generating function whose basis depends on the stochastic process under consideration. Spectral methods, WKB approximations, and a variational approach have been proposed for the analysis of the PDE. The second PDE is novel and is obeyed by a distribution that is marginalized over an initial state. It proves useful for the computation of mean extinction times. The third PDE describes the time evolution of a 'generating functional', which generalizes the so-called Poisson representation. Subsequently, the solutions of the PDEs are expressed in terms of two path integrals: a 'forward' and a 'backward' path integral. Combined with inverse transformations, one obtains two distinct path integral representations of the conditional probability distribution solving the master equations. We exemplify both path integrals in analysing elementary chemical reactions. Moreover, we show how a well-known path integral representation of averaged observables can be recovered from them. Upon

Sensor Selection for Aircraft Engine Performance Estimation and Gas Path Fault Diagnostics

NASA Technical Reports Server (NTRS)

Simon, Donald L.; Rinehart, Aidan W.

2015-01-01

This paper presents analytical techniques for aiding system designers in making aircraft engine health management sensor selection decisions. The presented techniques, which are based on linear estimation and probability theory, are tailored for gas turbine engine performance estimation and gas path fault diagnostics applications. They enable quantification of the performance estimation and diagnostic accuracy offered by different candidate sensor suites. For performance estimation, sensor selection metrics are presented for two types of estimators including a Kalman filter and a maximum a posteriori estimator. For each type of performance estimator, sensor selection is based on minimizing the theoretical sum of squared estimation errors in health parameters representing performance deterioration in the major rotating modules of the engine. For gas path fault diagnostics, the sensor selection metric is set up to maximize correct classification rate for a diagnostic strategy that performs fault classification by identifying the fault type that most closely matches the observed measurement signature in a weighted least squares sense. Results from the application of the sensor selection metrics to a linear engine model are presented and discussed. Given a baseline sensor suite and a candidate list of optional sensors, an exhaustive search is performed to determine the optimal sensor suites for performance estimation and fault diagnostics. For any given sensor suite, Monte Carlo simulation results are found to exhibit good agreement with theoretical predictions of estimation and diagnostic accuracies.

Sensor Selection for Aircraft Engine Performance Estimation and Gas Path Fault Diagnostics

NASA Technical Reports Server (NTRS)

Simon, Donald L.; Rinehart, Aidan W.

2016-01-01

This paper presents analytical techniques for aiding system designers in making aircraft engine health management sensor selection decisions. The presented techniques, which are based on linear estimation and probability theory, are tailored for gas turbine engine performance estimation and gas path fault diagnostics applications. They enable quantification of the performance estimation and diagnostic accuracy offered by different candidate sensor suites. For performance estimation, sensor selection metrics are presented for two types of estimators including a Kalman filter and a maximum a posteriori estimator. For each type of performance estimator, sensor selection is based on minimizing the theoretical sum of squared estimation errors in health parameters representing performance deterioration in the major rotating modules of the engine. For gas path fault diagnostics, the sensor selection metric is set up to maximize correct classification rate for a diagnostic strategy that performs fault classification by identifying the fault type that most closely matches the observed measurement signature in a weighted least squares sense. Results from the application of the sensor selection metrics to a linear engine model are presented and discussed. Given a baseline sensor suite and a candidate list of optional sensors, an exhaustive search is performed to determine the optimal sensor suites for performance estimation and fault diagnostics. For any given sensor suite, Monte Carlo simulation results are found to exhibit good agreement with theoretical predictions of estimation and diagnostic accuracies.

Peer Status and Victimization as Possible Reinforcements of Adolescent Girls’ and Boys’ Weight-Related Behaviors and Cognitions

PubMed Central

Prinstein, Mitchell J.

2010-01-01

Objective Reciprocal longitudinal associations among weight-related behaviors and cognitions and peer relations constructs were examined among adolescent males and females. Methods Participants included 576 adolescents aged 10–14 years, in grades 6–8. Measures assessed body dissatisfaction, negative weight-related cognitions, weight management behaviors, muscle-gaining behaviors, body mass index (BMI), likeability, popularity, and victimization at two time points, approximately 11 months apart. Multiple group path analyses were conducted to examine the reciprocal longitudinal associations between the peer relations constructs and weight-related behaviors and cognitions, controlling for participants’ Time 1 BMI, pubertal development, and age. Results Higher levels of body dissatisfaction were associated longitudinally with decreases in popularity. Higher popularity and lower likeability each were associated longitudinally with increases in negative body-related cognitions. Higher popularity was associated longitudinally with muscle-gaining behaviors for boys. Conclusions Findings suggest highly popular and disliked adolescents may be at greater risk of weight-related behaviors and cognitions than other adolescents. PMID:19667053

Assessment of Crack Path Prediction in Non-Proportional Mixed-Mode Fatigue

NASA Technical Reports Server (NTRS)

Highsmith, Shelby, Jr.; Johnson, Steve; Swanson, Gregory; Sayyah, Tarek; Pettit, Richard

2008-01-01

Non-proportional mixed-mode loading is present in many systems and a growing crack can experience any manner of mixed-mode loading. Prediction of the resulting crack path is important when assessing potential failure modes or when performing a failure investigation. Current crack path selection criteria are presented along with data for Inconel 718 under non-proportional mixed-mode loading. Mixed-mode crack growth can transition between path deflection mechanisms with very different orientations. Non-proportional fatigue loadings lack a single parameter for input to current crack path criteria. Crack growth transitions were observed in proportional and non-proportional FCG tests. Different paths displayed distinct fracture surface morphologies. New crack path drivers & transition criteria must be developed.

The Path of Carbon in Photosynthesis VI.

DOE R&D Accomplishments Database

Calvin, M.

1949-06-30

This paper is a compilation of the essential results of our experimental work in the determination of the path of carbon in photosynthesis. There are discussions of the dark fixation of photosynthesis and methods of separation and identification including paper chromatography and radioautography. The definition of the path of carbon in photosynthesis by the distribution of radioactivity within the compounds is described.

A taxonomy of integral reaction path analysis

DOE Office of Scientific and Technical Information (OSTI.GOV)

Grcar, Joseph F.; Day, Marcus S.; Bell, John B.

2004-12-23

W. C. Gardiner observed that achieving understanding through combustion modeling is limited by the ability to recognize the implications of what has been computed and to draw conclusions about the elementary steps underlying the reaction mechanism. This difficulty can be overcome in part by making better use of reaction path analysis in the context of multidimensional flame simulations. Following a survey of current practice, an integral reaction flux is formulated in terms of conserved scalars that can be calculated in a fully automated way. Conditional analyses are then introduced, and a taxonomy for bidirectional path analysis is explored. Many examplesmore » illustrate the resulting path analysis and uncover some new results about nonpremixed methane-air laminar jets.« less

Paths to Licensure: Things Physicists Should Know

NASA Astrophysics Data System (ADS)

Stewart, Gay; Stewart, John

2016-03-01

The path to licensure can be quite complicated, and can thwart a physics department's efforts to produce more and better prepared high school physics teachers. Each state has different pathways to licensure. Acronyms like CAEP and SPA are not within the normal physicist's vocabulary. Some understanding of this topic can allow physics faculty advisers to help our students so that fewer are derailed on their path to the classroom, or take a path that will leave them less well prepared if they do find themselves there. Examples of different approaches that work within state licensure systems from two different states will be presented. Physics teacher preparation efforts in both Arkansas and West Virginia have been supported in part by the Physics Teacher Education Coalition (PhysTEC).

Diffractive paths for weak localization in quantum billiards

NASA Astrophysics Data System (ADS)

Březinová, Iva; Stampfer, Christoph; Wirtz, Ludger; Rotter, Stefan; Burgdörfer, Joachim

2008-04-01

We study the weak-localization effect in quantum transport through a clean ballistic cavity with regular classical dynamics. We address the question which paths account for the suppression of conductance through a system where disorder and chaos are absent. By exploiting both quantum and semiclassical methods, we unambiguously identify paths that are diffractively backscattered into the cavity (when approaching the lead mouths from the cavity interior) to play a key role. Diffractive scattering couples transmitted and reflected paths and is thus essential to reproduce the weak-localization peak in reflection and the corresponding antipeak in transmission. A comparison of semiclassical calculations featuring these diffractive paths yields good agreement with full quantum calculations and experimental data. Our theory provides system-specific predictions for the quantum regime of few open lead modes and can be expected to be relevant also for mixed as well as chaotic systems.

Path connectivity based spectral defragmentation in flexible bandwidth networks.

PubMed

Wang, Ying; Zhang, Jie; Zhao, Yongli; Zhang, Jiawei; Zhao, Jie; Wang, Xinbo; Gu, Wanyi

2013-01-28

Optical networks with flexible bandwidth provisioning have become a very promising networking architecture. It enables efficient resource utilization and supports heterogeneous bandwidth demands. In this paper, two novel spectrum defragmentation approaches, i.e. Maximum Path Connectivity (MPC) algorithm and Path Connectivity Triggering (PCT) algorithm, are proposed based on the notion of Path Connectivity, which is defined to represent the maximum variation of node switching ability along the path in flexible bandwidth networks. A cost-performance-ratio based profitability model is given to denote the prons and cons of spectrum defragmentation. We compare these two proposed algorithms with non-defragmentation algorithm in terms of blocking probability. Then we analyze the differences of defragmentation profitability between MPC and PCT algorithms.

A novel representation for planning 3-D collision-free paths

NASA Technical Reports Server (NTRS)

Bonner, Susan; Kelley, Robert B.

1990-01-01

A new scheme for the representation of objects, the successive spherical approximation (SSA), facilitates the rapid planning of collision-free paths in a dynamic three-dimensional environment. The hierarchical nature of the SSA allows collisions to be determined efficiently while still providing an exact representation of objects. The rapidity with which collisions can be detected, less than 1 sec per environment object per path, makes it possible to use a generate-and-test path-planning strategy driven by human conceptual knowledge to determine collision-free paths in a matter of seconds on a Sun 3/180 computer. A hierarchy of rules, based on the concept of a free space cell, is used to find heuristically satisfying collision-free paths in a structured environment.

Path integration in tactile perception of shapes.

PubMed

Moscatelli, Alessandro; Naceri, Abdeldjallil; Ernst, Marc O

2014-11-01

Whenever we move the hand across a surface, tactile signals provide information about the relative velocity between the skin and the surface. If the system were able to integrate the tactile velocity information over time, cutaneous touch may provide an estimate of the relative displacement between the hand and the surface. Here, we asked whether humans are able to form a reliable representation of the motion path from tactile cues only, integrating motion information over time. In order to address this issue, we conducted three experiments using tactile motion and asked participants (1) to estimate the length of a simulated triangle, (2) to reproduce the shape of a simulated triangular path, and (3) to estimate the angle between two-line segments. Participants were able to accurately indicate the length of the path, whereas the perceived direction was affected by a direction bias (inward bias). The response pattern was thus qualitatively similar to the ones reported in classical path integration studies involving locomotion. However, we explain the directional biases as the result of a tactile motion aftereffect. Copyright © 2014 Elsevier B.V. All rights reserved.

Path Similarity Analysis: A Method for Quantifying Macromolecular Pathways

PubMed Central

Seyler, Sean L.; Kumar, Avishek; Thorpe, M. F.; Beckstein, Oliver

2015-01-01

Diverse classes of proteins function through large-scale conformational changes and various sophisticated computational algorithms have been proposed to enhance sampling of these macromolecular transition paths. Because such paths are curves in a high-dimensional space, it has been difficult to quantitatively compare multiple paths, a necessary prerequisite to, for instance, assess the quality of different algorithms. We introduce a method named Path Similarity Analysis (PSA) that enables us to quantify the similarity between two arbitrary paths and extract the atomic-scale determinants responsible for their differences. PSA utilizes the full information available in 3N-dimensional configuration space trajectories by employing the Hausdorff or Fréchet metrics (adopted from computational geometry) to quantify the degree of similarity between piecewise-linear curves. It thus completely avoids relying on projections into low dimensional spaces, as used in traditional approaches. To elucidate the principles of PSA, we quantified the effect of path roughness induced by thermal fluctuations using a toy model system. Using, as an example, the closed-to-open transitions of the enzyme adenylate kinase (AdK) in its substrate-free form, we compared a range of protein transition path-generating algorithms. Molecular dynamics-based dynamic importance sampling (DIMS) MD and targeted MD (TMD) and the purely geometric FRODA (Framework Rigidity Optimized Dynamics Algorithm) were tested along with seven other methods publicly available on servers, including several based on the popular elastic network model (ENM). PSA with clustering revealed that paths produced by a given method are more similar to each other than to those from another method and, for instance, that the ENM-based methods produced relatively similar paths. PSA applied to ensembles of DIMS MD and FRODA trajectories of the conformational transition of diphtheria toxin, a particularly challenging example, showed that

Medial temporal lobe roles in human path integration.

PubMed

Yamamoto, Naohide; Philbeck, John W; Woods, Adam J; Gajewski, Daniel A; Arthur, Joeanna C; Potolicchio, Samuel J; Levy, Lucien; Caputy, Anthony J

2014-01-01

Path integration is a process in which observers derive their location by integrating self-motion signals along their locomotion trajectory. Although the medial temporal lobe (MTL) is thought to take part in path integration, the scope of its role for path integration remains unclear. To address this issue, we administered a variety of tasks involving path integration and other related processes to a group of neurosurgical patients whose MTL was unilaterally resected as therapy for epilepsy. These patients were unimpaired relative to neurologically intact controls in many tasks that required integration of various kinds of sensory self-motion information. However, the same patients (especially those who had lesions in the right hemisphere) walked farther than the controls when attempting to walk without vision to a previewed target. Importantly, this task was unique in our test battery in that it allowed participants to form a mental representation of the target location and anticipate their upcoming walking trajectory before they began moving. Thus, these results put forth a new idea that the role of MTL structures for human path integration may stem from their participation in predicting the consequences of one's locomotor actions. The strengths of this new theoretical viewpoint are discussed.

Medial Temporal Lobe Roles in Human Path Integration

PubMed Central

Yamamoto, Naohide; Philbeck, John W.; Woods, Adam J.; Gajewski, Daniel A.; Arthur, Joeanna C.; Potolicchio, Samuel J.; Levy, Lucien; Caputy, Anthony J.

2014-01-01

Path integration is a process in which observers derive their location by integrating self-motion signals along their locomotion trajectory. Although the medial temporal lobe (MTL) is thought to take part in path integration, the scope of its role for path integration remains unclear. To address this issue, we administered a variety of tasks involving path integration and other related processes to a group of neurosurgical patients whose MTL was unilaterally resected as therapy for epilepsy. These patients were unimpaired relative to neurologically intact controls in many tasks that required integration of various kinds of sensory self-motion information. However, the same patients (especially those who had lesions in the right hemisphere) walked farther than the controls when attempting to walk without vision to a previewed target. Importantly, this task was unique in our test battery in that it allowed participants to form a mental representation of the target location and anticipate their upcoming walking trajectory before they began moving. Thus, these results put forth a new idea that the role of MTL structures for human path integration may stem from their participation in predicting the consequences of one's locomotor actions. The strengths of this new theoretical viewpoint are discussed. PMID:24802000

Road networks as collections of minimum cost paths

NASA Astrophysics Data System (ADS)

Wegner, Jan Dirk; Montoya-Zegarra, Javier Alexander; Schindler, Konrad

2015-10-01

We present a probabilistic representation of network structures in images. Our target application is the extraction of urban roads from aerial images. Roads appear as thin, elongated, partially curved structures forming a loopy graph, and this complex layout requires a prior that goes beyond standard smoothness and co-occurrence assumptions. In the proposed model the network is represented as a union of 1D paths connecting distant (super-)pixels. A large set of putative candidate paths is constructed in such a way that they include the true network as much as possible, by searching for minimum cost paths in the foreground (road) likelihood. Selecting the optimal subset of candidate paths is posed as MAP inference in a higher-order conditional random field. Each path forms a higher-order clique with a type of clique potential, which attracts the member nodes of cliques with high cumulative road evidence to the foreground label. That formulation induces a robust PN -Potts model, for which a global MAP solution can be found efficiently with graph cuts. Experiments with two road data sets show that the proposed model significantly improves per-pixel accuracies as well as the overall topological network quality with respect to several baselines.

Large volume multiple-path nuclear pumped laser

NASA Technical Reports Server (NTRS)

Hohl, F.; Deyoung, R. J. (Inventor)

1981-01-01

Large volumes of gas are excited by using internal high reflectance mirrors that are arranged so that the optical path crosses back and forth through the excited gaseous medium. By adjusting the external dielectric mirrors of the laser, the number of paths through the laser cavity can be varied. Output powers were obtained that are substantially higher than the output powers of previous nuclear laser systems.

Artificial pheromone for path selection by a foraging swarm of robots.

PubMed

Campo, Alexandre; Gutiérrez, Alvaro; Nouyan, Shervin; Pinciroli, Carlo; Longchamp, Valentin; Garnier, Simon; Dorigo, Marco

2010-11-01

Foraging robots involved in a search and retrieval task may create paths to navigate faster in their environment. In this context, a swarm of robots that has found several resources and created different paths may benefit strongly from path selection. Path selection enhances the foraging behavior by allowing the swarm to focus on the most profitable resource with the possibility for unused robots to stop participating in the path maintenance and to switch to another task. In order to achieve path selection, we implement virtual ants that lay artificial pheromone inside a network of robots. Virtual ants are local messages transmitted by robots; they travel along chains of robots and deposit artificial pheromone on the robots that are literally forming the chain and indicating the path. The concentration of artificial pheromone on the robots allows them to decide whether they are part of a selected path. We parameterize the mechanism with a mathematical model and provide an experimental validation using a swarm of 20 real robots. We show that our mechanism favors the selection of the closest resource is able to select a new path if a selected resource becomes unavailable and selects a newly detected and better resource when possible. As robots use very simple messages and behaviors, the system would be particularly well suited for swarms of microrobots with minimal abilities.

On the optical path length in refracting media

NASA Astrophysics Data System (ADS)

Hasbun, Javier E.

2018-04-01

The path light follows as it travels through a substance depends on the substance's index of refraction. This path is commonly known as the optical path length (OPL). In geometrical optics, the laws of reflection and refraction are simple examples for understanding the path of light travel from source to detector for constant values of the traveled substances' refraction indices. In more complicated situations, the Euler equation can be quite useful and quite important in optics courses. Here, the well-known Euler differential equation (EDE) is used to obtain the OPL for several index of refraction models. For pedagogical completeness, the OPL is also obtained through a modified Monte Carlo (MC) method, versus which the various results obtained through the EDE are compared. The examples developed should be important in projects involving undergraduate as well as graduate students in an introductory optics course. A simple matlab script (program) is included that can be modified by students who wish to pursue the subject further.

Finding False Paths in Sequential Circuits

NASA Astrophysics Data System (ADS)

Matrosova, A. Yu.; Andreeva, V. V.; Chernyshov, S. V.; Rozhkova, S. V.; Kudin, D. V.

2018-02-01

Method of finding false paths in sequential circuits is developed. In contrast with heuristic approaches currently used abroad, the precise method based on applying operations on Reduced Ordered Binary Decision Diagrams (ROBDDs) extracted from the combinational part of a sequential controlling logic circuit is suggested. The method allows finding false paths when transfer sequence length is not more than the given value and obviates the necessity of investigation of combinational circuit equivalents of the given lengths. The possibilities of using of the developed method for more complicated circuits are discussed.

Circuity analyses of HSR network and high-speed train paths in China

PubMed Central

Zhao, Shuo; Huang, Jie; Shan, Xinghua

2017-01-01

Circuity, defined as the ratio of the shortest network distance to the Euclidean distance between one origin–destination (O-D) pair, can be adopted as a helpful evaluation method of indirect degrees of train paths. In this paper, the maximum circuity of the paths of operated trains is set to be the threshold value of the circuity of high-speed train paths. For the shortest paths of any node pairs, if their circuity is not higher than the threshold value, the paths can be regarded as the reasonable paths. With the consideration of a certain relative or absolute error, we cluster the reasonable paths on the basis of their inclusion relationship and the center path of each class represents a passenger transit corridor. We take the high-speed rail (HSR) network in China at the end of 2014 as an example, and obtain 51 passenger transit corridors, which are alternative sets of train paths. Furthermore, we analyze the circuity distribution of paths of all node pairs in the network. We find that the high circuity of train paths can be decreased with the construction of a high-speed railway line, which indicates that the structure of the HSR network in China tends to be more complete and the HSR network can make the Chinese railway network more efficient. PMID:28945757

Variability in postural control with and without balance-based torso- weighting in people with multiple sclerosis and healthy controls.

PubMed

Hunt, Charlotte M; Widener, Gail; Allen, Diane D

2014-10-01

People with multiple sclerosis (MS) have diminished postural control, and center of pressure (COP) displacement varies more in this population than in healthy controls. Balance-based torso-weighting (BBTW) can improve clinical balance and mobility in people with MS, and exploration using both linear and nonlinear measures of COP may help determine whether BBTW optimizes movement variability. The aim of this study was to investigate the effects of BBTW on people with MS and healthy controls during quiet standing. This was a quasi-experimental study comparing COP variability between groups, between eye closure conditions, and between weighting conditions in the anterior-posterior and medial-lateral directions. Twenty participants with MS and 18 healthy controls stood on a forceplate in 4 conditions: eyes open and closed and with and without BBTW. Linear measures of COP displacement included range and root mean square (RMS). Nonlinear measures included approximate entropy (ApEn) and Lyapunov exponent (LyE). Three-way repeated-measures analyses of variance compared measures across groups and conditions. The association between weighting response and baseline nonlinear variables was examined. When significant associations were found, MS subgroups were created and compared. The MS and control groups had significantly different range, RMS, and ApEn values. The eyes-open and eyes-closed conditions had significantly different range and RMS values. Change with weighting correlated with LyE (r=-.70) and ApEn (r=-.59). Two MS subgroups, with low and high baseline LyE values, responded to BBTW in opposite directions, with a significant main effect for weighting condition for the LyE variable in the medial-lateral direction. The small samples and no identification of impairments related to LyE at baseline were limitations of the study. The LyE may help differentiate subgroups who respond differently to BBTW. In both subgroups, LyE values moved toward the average of healthy

Variability in Postural Control With and Without Balance-Based Torso- Weighting in People With Multiple Sclerosis and Healthy Controls

PubMed Central

Widener, Gail; Allen, Diane D.

2014-01-01

Background People with multiple sclerosis (MS) have diminished postural control, and center of pressure (COP) displacement varies more in this population than in healthy controls. Balance-based torso-weighting (BBTW) can improve clinical balance and mobility in people with MS, and exploration using both linear and nonlinear measures of COP may help determine whether BBTW optimizes movement variability. Objective The aim of this study was to investigate the effects of BBTW on people with MS and healthy controls during quiet standing. Design This was a quasi-experimental study comparing COP variability between groups, between eye closure conditions, and between weighting conditions in the anterior-posterior and medial-lateral directions. Methods Twenty participants with MS and 18 healthy controls stood on a forceplate in 4 conditions: eyes open and closed and with and without BBTW. Linear measures of COP displacement included range and root mean square (RMS). Nonlinear measures included approximate entropy (ApEn) and Lyapunov exponent (LyE). Three-way repeated-measures analyses of variance compared measures across groups and conditions. The association between weighting response and baseline nonlinear variables was examined. When significant associations were found, MS subgroups were created and compared. Results The MS and control groups had significantly different range, RMS, and ApEn values. The eyes-open and eyes-closed conditions had significantly different range and RMS values. Change with weighting correlated with LyE (r=−.70) and ApEn (r=−.59). Two MS subgroups, with low and high baseline LyE values, responded to BBTW in opposite directions, with a significant main effect for weighting condition for the LyE variable in the medial-lateral direction. Limitations The small samples and no identification of impairments related to LyE at baseline were limitations of the study. Conclusions The LyE may help differentiate subgroups who respond differently to BBTW

Proton and electron mean free paths: The Palmer consensus revisited

NASA Technical Reports Server (NTRS)

Bieber, John W.; Matthaeus, William H.; Smith, Charles W.; Wanner, Wolfgang; Kallenrode, May-Britt; Wibberenz, Gerd

1994-01-01

We present experimental and theoretical evidence suggesting that the mean free path of cosmic-ray electrons and protons may be fundamentally different at low to intermediate (less than 50 MV) rigidities. The experimental evidence is from Helios observations of solar energetic particles, which show that the mean free path of 1.4 MV electrons is often similar to that of 187 MV protons, even though proton mean free paths continue to decrease comparatively rapidly with decreasing rigidty down to the lowest channels (about 100 MV) observed. The theoretical evidence is from computations of particle scattering in dynamical magnetic turbulence, which predict that electrons will have a larger mean free path than protons of the same rigidity. In the light of these new results, 'consensus' ideas about cosmic-ray mean free paths may require drastic revision.

Neonatal Nutrition Predicts Energy Balance in Young Adults Born Preterm at Very Low Birth Weight

PubMed Central

Matinolli, Hanna-Maria; Hovi, Petteri; Levälahti, Esko; Kaseva, Nina; Silveira, Patricia P.; Hemiö, Katri; Järvenpää, Anna-Liisa; Eriksson, Johan G.; Andersson, Sture; Lindström, Jaana; Männistö, Satu; Kajantie, Eero

2017-01-01

Epidemiological studies and animal models suggest that early postnatal nutrition and growth can influence adult health. However, few human studies have objective recordings of early nutrient intake. We studied whether nutrient intake and growth during the first 9 weeks after preterm birth with very low birth weight (VLBW, <1500 g) predict total energy intake, resting energy expenditure (REE), physical activity and food preferences in young adulthood. We collected daily nutritional intakes and weights during the initial hospital stay from hospital records for 127 unimpaired VLBW participants. At an average age 22.5 years, they completed a three-day food record and a physical activity questionnaire and underwent measurements of body composition (dual X-ray absorptiometry; n = 115 with adequate data) and REE (n = 92 with adequate data). We used linear regression and path analysis to investigate associations between neonatal nutrient intake and adult outcomes. Higher energy, protein and fat intakes during the first three weeks of life predicted lower relative (=per unit lean body mass) energy intake and relative REE in adulthood, independent of other pre- and neonatal factors. In path analysis, total effects of early nutrition and growth on relative energy intake were mostly explained by direct effects of early life nutrition. A path mediated by early growth reached statistical significance only for protein intake. There were no associations of neonatal intakes with physical activity or food preferences in adulthood. As a conclusion, higher intake of energy and nutrients during first three weeks of life of VLBW infants predicts energy balance after 20 years. This association is partly mediated through postnatal growth. PMID:29186804

Path generation algorithm for UML graphic modeling of aerospace test software

NASA Astrophysics Data System (ADS)

Qu, MingCheng; Wu, XiangHu; Tao, YongChao; Chen, Chao

2018-03-01

Aerospace traditional software testing engineers are based on their own work experience and communication with software development personnel to complete the description of the test software, manual writing test cases, time-consuming, inefficient, loopholes and more. Using the high reliability MBT tools developed by our company, the one-time modeling can automatically generate test case documents, which is efficient and accurate. UML model to describe the process accurately express the need to rely on the path is reached, the existing path generation algorithm are too simple, cannot be combined into a path and branch path with loop, or too cumbersome, too complicated arrangement generates a path is meaningless, for aerospace software testing is superfluous, I rely on our experience of ten load space, tailor developed a description of aerospace software UML graphics path generation algorithm.

Preferential flow paths in fractured rock detected by cross-borehole nano-iron tracer test

NASA Astrophysics Data System (ADS)

Chia, Yeeping; Chuang, Po-Yu

2017-04-01

Characterization of the preferential flow paths and their hydraulic properties is desirable for developing a hydrogeological conceptual model in fractured rock. However, the heterogeneity and anisotropy of the hydraulic property often make it difficult to understand groundwater flow paths through fractures. In this study, we adopted nanoscale zero-valent iron (nZVI) as a tracer to characterize fracture connectivity and hydraulic properties. A magnet array was placed in an observation well to attract arriving nZVI particles for identifying the location of incoming tracer. This novel approach was developed for the investigation of fracture flow at a hydrogeological research station in central Taiwan. A heat-pulse flowmeter test was performed to delineate the vertical distribution of permeable fractures in two boreholes, making it possible to design a field tracer test. The nZVI slurry was released in the sealed injection well. The arrival of the slurry in the observation well was evidenced by a breakthrough curve recorded by the fluid conductivity sensor as well as the nZVI particles attracted to the magnets. The iron nanoparticles attracted to the magnets provide the quantitative criteria for locating the position of tracer inlet in the observation well. The position of the magnet attracting the maximum weight of iron nanoparticles agrees well with the depth of a permeable fracture zone delineated by the flowmeter. Besides, a conventional saline tracer test was conducted in the field, producing a similar outcome as the nZVI tracer test. Our study results indicate that the nano-iron tracer test could be a promising method for the characterization of the preferential flow paths in fractured rock.

Weight-ing: the experience of waiting on weight loss.

PubMed

Glenn, Nicole M

2013-03-01

Perhaps we want to be perfect, strive for health, beauty, and the admiring gaze of others. Maybe we desire the body of our youth, the "healthy" body, the body that has just the right fit. Regardless of the motivation, we might find ourselves striving, wanting, and waiting on weight loss. What is it to wait on weight loss? I explore the meaning of this experience-as-lived using van Manen's guide to phenomenological reflection and writing. Weight has become an increasing focus of contemporary culture, demonstrated, for example, by a growing weight-loss industry and global obesity "epidemic." Weight has become synonymous with health status, and weight loss with "healthier." I examine the weight wait through experiences of the common and uncommon, considering relations to time, body, space, and the other with the aim of evoking a felt, embodied, emotive understanding of the meaning of waiting on weight loss. I also discuss the implications of the findings.

A theoretical framework to predict the most likely ion path in particle imaging.

PubMed

Collins-Fekete, Charles-Antoine; Volz, Lennart; Portillo, Stephen K N; Beaulieu, Luc; Seco, Joao

2017-03-07

In this work, a generic rigorous Bayesian formalism is introduced to predict the most likely path of any ion crossing a medium between two detection points. The path is predicted based on a combination of the particle scattering in the material and measurements of its initial and final position, direction and energy. The path estimate's precision is compared to the Monte Carlo simulated path. Every ion from hydrogen to carbon is simulated in two scenarios, (1) where the range is fixed and (2) where the initial velocity is fixed. In the scenario where the range is kept constant, the maximal root-mean-square error between the estimated path and the Monte Carlo path drops significantly between the proton path estimate (0.50 mm) and the helium path estimate (0.18 mm), but less so up to the carbon path estimate (0.09 mm). However, this scenario is identified as the configuration that maximizes the dose while minimizing the path resolution. In the scenario where the initial velocity is fixed, the maximal root-mean-square error between the estimated path and the Monte Carlo path drops significantly between the proton path estimate (0.29 mm) and the helium path estimate (0.09 mm) but increases for heavier ions up to carbon (0.12 mm). As a result, helium is found to be the particle with the most accurate path estimate for the lowest dose, potentially leading to tomographic images of higher spatial resolution.

Path integrals and large deviations in stochastic hybrid systems.

PubMed

Bressloff, Paul C; Newby, Jay M

2014-04-01

We construct a path-integral representation of solutions to a stochastic hybrid system, consisting of one or more continuous variables evolving according to a piecewise-deterministic dynamics. The differential equations for the continuous variables are coupled to a set of discrete variables that satisfy a continuous-time Markov process, which means that the differential equations are only valid between jumps in the discrete variables. Examples of stochastic hybrid systems arise in biophysical models of stochastic ion channels, motor-driven intracellular transport, gene networks, and stochastic neural networks. We use the path-integral representation to derive a large deviation action principle for a stochastic hybrid system. Minimizing the associated action functional with respect to the set of all trajectories emanating from a metastable state (assuming that such a minimization scheme exists) then determines the most probable paths of escape. Moreover, evaluating the action functional along a most probable path generates the so-called quasipotential used in the calculation of mean first passage times. We illustrate the theory by considering the optimal paths of escape from a metastable state in a bistable neural network.

Ted Irving and the Arc of APW Paths

NASA Astrophysics Data System (ADS)

Kent, D. V.

2014-12-01

Ted Irving's last two published papers neatly encapsulate his seminal contributions to the delineation of ever-important apparent polar wander (APW) paths. His final (210th) paper [Creer & Irving, 2012 Earth Sciences History] describes in detail how Ken Creer and he when still graduate students at Cambridge started to generate and assemble paleomagnetic data for the first APW path, for then only the UK; the paper was published 60 years ago and happened to be Ted's first [Creer, Irving & Runcorn, 1954 JGE]. Only 10 years later, there was already a lengthy reference list of paleomagnetic results available from most continents that had been compiled in pole lists he published in GJRAS from 1960 to 1965 and included in an appendix in his landmark book "Paleomagnetism" [Irving, 1964 Wiley] in support of wide ranging discussions of continental drift and related topics in chapters like 'Paleolatitudes and paleomeridians.' A subsequent innovation was calculating running means of poles indexed to a numerical geologic time scale [Irving, 1977 Nature], which with independent tectonic reconstructions as already for Gondwana allowed constructions of more detailed composite APW paths. His 1977 paper also coined Pangea B for an earlier albeit contentious configuration for the supercontinent that refuses to go away. Gliding over much work on APW tracks and hairpins in the Precambrian, we come to Ted's penultimate (209th) paper [Kent & Irving, 2010 JGR] in which individual poles from short-lived large igneous provinces were grouped and most sedimentary poles, many rather venerable, excluded as likely to be biased by variable degrees of inclination error. The leaner composite APW path helped to resurrect the Baja BC scenario of Cordilleran terrane motions virtually stopped in the 1980s by APW path techniques that relied on a few key but alas often badly skewed poles. The new composite APW path also revealed several major features, such as a huge polar shift of 30° in 15 Myr in the

An empirical typology of hospital nurses' individual learning paths.

PubMed

Poell, Rob F; Van der Krogt, Ferd J

2014-03-01

A relatively new theoretical concept is proposed in this paper, namely, the individual learning path. Learning paths are created by individual employees and comprise a set of learning-relevant activities that are both coherent as a whole and meaningful to them. To explore the empirical basis of this theoretical concept. A qualitative study involving semi-structured interviews. Two academic medical centers (university hospitals) and two general hospitals in the Netherlands. A total of 89 nurses were involved in the study. Semi-structured interviews were analyzed qualitatively; cluster analysis was then performed on quantified data from the interviews. Four types of learning path emerged, namely, the formal-external, self-directed, social-emotional, and information-oriented learning paths. The relatively new theoretical concept of an individual learning path can be observed in practice and a number of different learning-path types can be distinguished. Nurses were found to create their own learning paths, that is, select a theme that is relevant primarily to themselves, conduct a variety of learning activities around this theme, participate in social contexts that might help them, and mobilize learning facilities provided by their organization. These activities go way beyond the notion of employees as self-directed learners merely in a didactic sense (establishing learning goals, choosing the right learning activities for these goals, evaluating to what extent their goals have been met as a result). The findings can be interpreted as evidence of employees acting strategically when it comes to their professional development. Providers of continuing professional education/development need to take this into account. Copyright © 2013 Elsevier Ltd. All rights reserved.

Optimum flight paths of turbojet aircraft

NASA Technical Reports Server (NTRS)

Miele, Angelo

1955-01-01

The climb of turbojet aircraft is analyzed and discussed including the accelerations. Three particular flight performances are examined: minimum time of climb, climb with minimum fuel consumption, and steepest climb. The theoretical results obtained from a previous study are put in a form that is suitable for application on the following simplifying assumptions: the Mach number is considered an independent variable instead of the velocity; the variations of the airplane mass due to fuel consumption are disregarded; the airplane polar is assumed to be parabolic; the path curvatures and the squares of the path angles are disregarded in the projection of the equation of motion on the normal to the path; lastly, an ideal turbojet with performance independent of the velocity is involved. The optimum Mach number for each flight condition is obtained from the solution of a sixth order equation in which the coefficients are functions of two fundamental parameters: the ratio of minimum drag in level flight to the thrust and the Mach number which represents the flight at constant altitude and maximum lift-drag ratio.

Path description of coordinate-space amplitudes

NASA Astrophysics Data System (ADS)

Erdoǧan, Ozan; Sterman, George

2017-06-01

We develop a coordinate version of light-cone-ordered perturbation theory, for general time-ordered products of fields, by carrying out integrals over one light-cone coordinate for each interaction vertex. The resulting expressions depend on the lengths of paths, measured in the same light-cone coordinate. Each path is associated with a denominator equal to a "light-cone deficit," analogous to the "energy deficits" of momentum-space time- or light-cone-ordered perturbation theory. In effect, the role played by intermediate states in momentum space is played by paths between external fields in coordinate space. We derive a class of identities satisfied by coordinate diagrams, from which their imaginary parts can be derived. Using scalar QED as an example, we show how the eikonal approximation arises naturally when the external points in a Green function approach the light cone, and we give applications to products of Wilson lines. Although much of our discussion is directed at massless fields in four dimensions, we extend the formalism to massive fields and dimensional regularization.

Fast exploration of an optimal path on the multidimensional free energy surface

PubMed Central

Chen, Changjun

2017-01-01

In a reaction, determination of an optimal path with a high reaction rate (or a low free energy barrier) is important for the study of the reaction mechanism. This is a complicated problem that involves lots of degrees of freedom. For simple models, one can build an initial path in the collective variable space by the interpolation method first and then update the whole path constantly in the optimization. However, such interpolation method could be risky in the high dimensional space for large molecules. On the path, steric clashes between neighboring atoms could cause extremely high energy barriers and thus fail the optimization. Moreover, performing simulations for all the snapshots on the path is also time-consuming. In this paper, we build and optimize the path by a growing method on the free energy surface. The method grows a path from the reactant and extends its length in the collective variable space step by step. The growing direction is determined by both the free energy gradient at the end of the path and the direction vector pointing at the product. With fewer snapshots on the path, this strategy can let the path avoid the high energy states in the growing process and save the precious simulation time at each iteration step. Applications show that the presented method is efficient enough to produce optimal paths on either the two-dimensional or the twelve-dimensional free energy surfaces of different small molecules. PMID:28542475

Influence of visual path information on human heading perception during rotation.

PubMed

Li, Li; Chen, Jing; Peng, Xiaozhe

2009-03-31

How does visual path information influence people's perception of their instantaneous direction of self-motion (heading)? We have previously shown that humans can perceive heading without direct access to visual path information. Here we vary two key parameters for estimating heading from optic flow, the field of view (FOV) and the depth range of environmental points, to investigate the conditions under which visual path information influences human heading perception. The display simulated an observer traveling on a circular path. Observers used a joystick to rotate their line of sight until deemed aligned with true heading. Four FOV sizes (110 x 94 degrees, 48 x 41 degrees, 16 x 14 degrees, 8 x 7 degrees) and depth ranges (6-50 m, 6-25 m, 6-12.5 m, 6-9 m) were tested. Consistent with our computational modeling results, heading bias increased with the reduction of FOV or depth range when the display provided a sequence of velocity fields but no direct path information. When the display provided path information, heading bias was not influenced as much by the reduction of FOV or depth range. We conclude that human heading and path perception involve separate visual processes. Path helps heading perception when the display does not contain enough optic-flow information for heading estimation during rotation.

Parameter optimization on the convergence surface of path simulations

NASA Astrophysics Data System (ADS)

Chandrasekaran, Srinivas Niranj

Computational treatments of protein conformational changes tend to focus on the trajectories themselves, despite the fact that it is the transition state structures that contain information about the barriers that impose multi-state behavior. PATH is an algorithm that computes a transition pathway between two protein crystal structures, along with the transition state structure, by minimizing the Onsager-Machlup action functional. It is rapid but depends on several unknown input parameters whose range of different values can potentially generate different transition-state structures. Transition-state structures arising from different input parameters cannot be uniquely compared with those generated by other methods. I outline modifications that I have made to the PATH algorithm that estimates these input parameters in a manner that circumvents these difficulties, and describe two complementary tests that validate the transition-state structures found by the PATH algorithm. First, I show that although the PATH algorithm and two other approaches to computing transition pathways produce different low-energy structures connecting the initial and final ground-states with the transition state, all three methods agree closely on the configurations of their transition states. Second, I show that the PATH transition states are close to the saddle points of free-energy surfaces connecting initial and final states generated by replica-exchange Discrete Molecular Dynamics simulations. I show that aromatic side-chain rearrangements create similar potential energy barriers in the transition-state structures identified by PATH for a signaling protein, a contractile protein, and an enzyme. Finally, I observed, but cannot account for, the fact that trajectories obtained for all-atom and Calpha-only simulations identify transition state structures in which the Calpha atoms are in essentially the same positions. The consistency between transition-state structures derived by different

Path Flow Estimation Using Time Varying Coefficient State Space Model

NASA Astrophysics Data System (ADS)

Jou, Yow-Jen; Lan, Chien-Lun

2009-08-01

The dynamic path flow information is very crucial in the field of transportation operation and management, i.e., dynamic traffic assignment, scheduling plan, and signal timing. Time-dependent path information, which is important in many aspects, is nearly impossible to be obtained. Consequently, researchers have been seeking estimation methods for deriving valuable path flow information from less expensive traffic data, primarily link traffic counts of surveillance systems. This investigation considers a path flow estimation problem involving the time varying coefficient state space model, Gibbs sampler, and Kalman filter. Numerical examples with part of a real network of the Taipei Mass Rapid Transit with real O-D matrices is demonstrated to address the accuracy of proposed model. Results of this study show that this time-varying coefficient state space model is very effective in the estimation of path flow compared to time-invariant model.

Navigating the Path to a Biomedical Science Career

NASA Astrophysics Data System (ADS)

Zimmerman, Andrea McNeely

The number of biomedical PhD scientists being trained and graduated far exceeds the number of academic faculty positions and academic research jobs. If this trend is compelling biomedical PhD scientists to increasingly seek career paths outside of academia, then more should be known about their intentions, desires, training experiences, and career path navigation. Therefore, the purpose of this study was to understand the process through which biomedical PhD scientists are trained and supported for navigating future career paths. In addition, the study sought to determine whether career development support efforts and opportunities should be redesigned to account for the proportion of PhD scientists following non-academic career pathways. Guided by the social cognitive career theory (SCCT) framework this study sought to answer the following central research question: How does a southeastern tier 1 research university train and support its biomedical PhD scientists for navigating their career paths? Key findings are: Many factors influence PhD scientists' career sector preference and job search process, but the most influential were relationships with faculty, particularly the mentor advisor; Planned activities are a significant aspect of the training process and provide skills for career success; and Planned activities provided skills necessary for a career, but influential factors directed the career path navigated. Implications for practice and future research are discussed.

Spatial Updating Strategy Affects the Reference Frame in Path Integration.

PubMed

He, Qiliang; McNamara, Timothy P

2018-06-01

This study investigated how spatial updating strategies affected the selection of reference frames in path integration. Participants walked an outbound path consisting of three successive waypoints in a featureless environment and then pointed to the first waypoint. We manipulated the alignment of participants' final heading at the end of the outbound path with their initial heading to examine the adopted reference frame. We assumed that the initial heading defined the principal reference direction in an allocentric reference frame. In Experiment 1, participants were instructed to use a configural updating strategy and to monitor the shape of the outbound path while they walked it. Pointing performance was best when the final heading was aligned with the initial heading, indicating the use of an allocentric reference frame. In Experiment 2, participants were instructed to use a continuous updating strategy and to keep track of the location of the first waypoint while walking the outbound path. Pointing performance was equivalent regardless of the alignment between the final and the initial headings, indicating the use of an egocentric reference frame. These results confirmed that people could employ different spatial updating strategies in path integration (Wiener, Berthoz, & Wolbers Experimental Brain Research 208(1) 61-71, 2011), and suggested that these strategies could affect the selection of the reference frame for path integration.

Adaptive Tracking Control for Robots With an Interneural Computing Scheme.

PubMed

Tsai, Feng-Sheng; Hsu, Sheng-Yi; Shih, Mau-Hsiang

2018-04-01

Adaptive tracking control of mobile robots requires the ability to follow a trajectory generated by a moving target. The conventional analysis of adaptive tracking uses energy minimization to study the convergence and robustness of the tracking error when the mobile robot follows a desired trajectory. However, in the case that the moving target generates trajectories with uncertainties, a common Lyapunov-like function for energy minimization may be extremely difficult to determine. Here, to solve the adaptive tracking problem with uncertainties, we wish to implement an interneural computing scheme in the design of a mobile robot for behavior-based navigation. The behavior-based navigation adopts an adaptive plan of behavior patterns learning from the uncertainties of the environment. The characteristic feature of the interneural computing scheme is the use of neural path pruning with rewards and punishment interacting with the environment. On this basis, the mobile robot can be exploited to change its coupling weights in paths of neural connections systematically, which can then inhibit or enhance the effect of flow elimination in the dynamics of the evolutionary neural network. Such dynamical flow translation ultimately leads to robust sensory-to-motor transformations adapting to the uncertainties of the environment. A simulation result shows that the mobile robot with the interneural computing scheme can perform fault-tolerant behavior of tracking by maintaining suitable behavior patterns at high frequency levels.

Cooperative path following control of multiple nonholonomic mobile robots.

PubMed

Cao, Ke-Cai; Jiang, Bin; Yue, Dong

2017-11-01

Cooperative path following control problem of multiple nonholonomic mobile robots has been considered in this paper. Based on the framework of decomposition, the cooperative path following problem has been transformed into path following problem and cooperative control problem; Then cascaded theory of non-autonomous system has been employed in the design of controllers without resorting to feedback linearization. One time-varying coordinate transformation based on dilation has been introduced to solve the uncontrollable problem of nonholonomic robots when the whole group's reference converges to stationary point. Cooperative path following controllers for nonholonomic robots have been proposed under persistent reference or reference target that converges to stationary point respectively. Simulation results using Matlab have illustrated the effectiveness of the obtained theoretical results. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

The relation of stress and depression to interdialytic weight gain in hemodialysis patients.

PubMed

Everett, K D; Brantley, P J; Sletten, C; Jones, G N; McKnight, G T

1995-01-01

Nonadherence to fluid restrictions is a common problem with serious health consequences for patients with end-stage renal disease (ESRD). For the present study, the authors evaluated psychological variables of stress, as measured by major and minor life events, and depression. They sought to determine the role of these events in patients' failure to adhere to fluid restrictions as measured by increased interdialytic weight gain. Forty-two hemodialysis patients completed inventories assessing major life events, daily stressful events, and depression on three consecutive dialysis sessions. Fluid adherence was measured by interdialytic weight gain. A path analysis model found daily minor stress to have a direct effect on nonadherence, whereas there was a direct inverse effect of depression on nonadherence. Possible mechanisms and implications for future studies are discussed.

Weighting of topologically different interactions in a model of two-dimensional polymer collapse.

PubMed

Bedini, Andrea; Owczarek, Aleksander L; Prellberg, Thomas

2013-01-01

We study by computer simulation a recently introduced generalized model of self-interacting self-avoiding trails on the square lattice that distinguishes two topologically different types of self-interaction: namely, crossings where the trail passes across itself and collisions where the lattice path visits the same site without crossing. This model generalizes the canonical interacting self-avoiding trail model of polymer collapse, which has a strongly divergent specific heat at its transition point. We confirm the recent prediction that the asymmetry does not affect the universality class for a range of asymmetry. Certainly, where the weighting of collisions outweighs that of crossings this is well supported numerically. When crossings are weighted heavily relative to collisions, the collapse transition reverts to the canonical θ-point-like behavior found in interacting self-avoiding walks.

Open-path, closed-path and reconstructed aerosol extinction at a rural site.

PubMed

Gordon, Timothy D; Prenni, Anthony J; Renfro, James R; McClure, Ethan; Hicks, Bill; Onasch, Timothy B; Freedman, Andrew; McMeeking, Gavin R; Chen, Ping

2018-04-09

The Handix Scientific Open-Path Cavity Ringdown Spectrometer (OPCRDS) was deployed during summer 2016 in Great Smoky Mountains National Park (GRSM). Extinction coefficients from the relatively new OPCRDS and from a more well-established extinction instrument agreed to within 7%. Aerosol hygroscopic growth (f(RH)) was calculated from the ratio of ambient extinction measured by the OPCRDS to dry extinction measured by a closed-path extinction monitor (Aerodyne's Cavity Attenuated Phase Shift Particulate Matter Extinction Monitor, CAPS PMex). Derived hygroscopicity (RH < 95%) from this campaign agreed with data from 1995 at the same site and time of year, which is noteworthy given the decreasing trend for organics and sulfate in the eastern U.S. However, maximum f(RH) values in 1995 were less than half as large as those recorded in 2016-possibly due to nephelometer truncation losses in 1995. Two hygroscopicity parameterizations were investigated using high time resolution OPCRDS+CAPS PMex data, and the K ext model was more accurate than the γ model. Data from the two ambient optical instruments, the OPCRDS and the open-path nephelometer, generally agreed; however, significant discrepancies between ambient scattering and extinction were observed, apparently driven by a combination of hygroscopic growth effects, which tend to increase nephelometer truncation losses and decrease sensitivity to the wavelength difference between the two instruments as a function of particle size. There was not a statistically significant difference in the mean reconstructed extinction values obtained from the original and the revised IMPROVE (Interagency Monitoring of Protected Visual Environments) equations. On average IMPROVE reconstructed extinction was ~25% lower than extinction measured by the OPCRDS, which suggests that the IMPROVE equations and 24-hr aerosol data are moderately successful in estimating current haze levels at GRSM. However, this conclusion is limited by the coarse

Path perception during rotation: influence of instructions, depth range, and dot density

NASA Technical Reports Server (NTRS)

Li, Li; Warren, William H Jr

2004-01-01

How do observers perceive their direction of self-motion when traveling on a straight path while their eyes are rotating? Our previous findings suggest that information from retinal flow and extra-retinal information about eye movements are each sufficient to solve this problem for both perception and active control of self-motion [Vision Res. 40 (2000) 3873; Psych. Sci. 13 (2002) 485]. In this paper, using displays depicting translation with simulated eye rotation, we investigated how task variables such as instructions, depth range, and dot density influenced the visual system's reliance on retinal vs. extra-retinal information for path perception during rotation. We found that path errors were small when observers expected to travel on a straight path or with neutral instructions, but errors increased markedly when observers expected to travel on a curved path. Increasing depth range or dot density did not improve path judgments. We conclude that the expectation of the shape of an upcoming path can influence the interpretation of the ambiguous retinal flow. A large depth range and dense motion parallax are not essential for accurate path perception during rotation, but reference objects and a large field of view appear to improve path judgments.

Tracing Technological Development Trajectories: A Genetic Knowledge Persistence-Based Main Path Approach.

PubMed

Park, Hyunseok; Magee, Christopher L

2017-01-01

The aim of this paper is to propose a new method to identify main paths in a technological domain using patent citations. Previous approaches for using main path analysis have greatly improved our understanding of actual technological trajectories but nonetheless have some limitations. They have high potential to miss some dominant patents from the identified main paths; nonetheless, the high network complexity of their main paths makes qualitative tracing of trajectories problematic. The proposed method searches backward and forward paths from the high-persistence patents which are identified based on a standard genetic knowledge persistence algorithm. We tested the new method by applying it to the desalination and the solar photovoltaic domains and compared the results to output from the same domains using a prior method. The empirical results show that the proposed method can dramatically reduce network complexity without missing any dominantly important patents. The main paths identified by our approach for two test cases are almost 10x less complex than the main paths identified by the existing approach. The proposed approach identifies all dominantly important patents on the main paths, but the main paths identified by the existing approach miss about 20% of dominantly important patents.

Masticatory path pattern during mastication of chewing gum with regard to gender difference.

PubMed

Kobayashi, Yoshinori; Shiga, Hiroshi; Arakawa, Ichiro; Yokoyama, Masaoki; Nakajima, Kunihisa

2009-01-01

To clarify the masticatory path patterns of the mandibular incisal point during mastication of softened chewing gum with regard to gender difference. One hundred healthy subjects (50 males and 50 females) were asked to chew softened chewing gum on one side at a time (right side and left side) and the movement of the mandibular incisal point was recorded using MKG K6I. After a catalog of path patterns was made, the movement path was classified into one of the pattern groups, and then the frequency of each pattern was investigated. A catalog of path patterns consisting of the three types of opening path (op1, linear or concave path; op2, path toward the chewing side after toward the non-working side; op3, convex path) and two types of closing path (cl1, convex path; cl2, concave path) was made. The movement path was classified into one of seven patterns, with six patterns being from the catalog and a final extra pattern in which the opening and closing paths crossed. The most common pattern among the subjects was Pattern I, followed by Patterns III, II, IV, V, VII, and VI, in that order. The majority of cases, 149 (74.5%) of 200 cases, showed either Pattern I (op1 and cl1) or Pattern III (op2 and cl1). There was no significant difference between the two genders in the frequency of each pattern. The movement path could be classified into seven patterns and no gender-related difference was found in the frequency of each pattern.

Pseudo-random tool paths for CNC sub-aperture polishing and other applications.

PubMed

Dunn, Christina R; Walker, David D

2008-11-10

In this paper we first contrast classical and CNC polishing techniques in regard to the repetitiveness of the machine motions. We then present a pseudo-random tool path for use with CNC sub-aperture polishing techniques and report polishing results from equivalent random and raster tool-paths. The random tool-path used - the unicursal random tool-path - employs a random seed to generate a pattern which never crosses itself. Because of this property, this tool-path is directly compatible with dwell time maps for corrective polishing. The tool-path can be used to polish any continuous area of any boundary shape, including surfaces with interior perforations.

Mars PathFinder Rover Traverse Image

NASA Technical Reports Server (NTRS)

1998-01-01

This figure contains an azimuth-elevation projection of the 'Gallery Panorama.' The original Simple Cylindrical mosaic has been reprojected to the inside of a sphere so that lines of constant azimuth radiate from the center and lines of constant elevation are concentric circles. This projection preserves the resolution of the original panorama. Overlaid onto the projected Martian surface is a delineation of the Sojourner rover traverse path during the 83 Sols (Martian days) of Pathfinder surface operations. The rover path was reproduced using IMP camera 'end of day' and 'Rover movie' image sequences and rover vehicle telemetry data as references.

Extracting contours of oval-shaped objects by Hough transform and minimal path algorithms

NASA Astrophysics Data System (ADS)

Tleis, Mohamed; Verbeek, Fons J.

2014-04-01

Circular and oval-like objects are very common in cell and micro biology. These objects need to be analyzed, and to that end, digitized images from the microscope are used so as to come to an automated analysis pipeline. It is essential to detect all the objects in an image as well as to extract the exact contour of each individual object. In this manner it becomes possible to perform measurements on these objects, i.e. shape and texture features. Our measurement objective is achieved by probing contour detection through dynamic programming. In this paper we describe a method that uses Hough transform and two minimal path algorithms to detect contours of (ovoid-like) objects. These algorithms are based on an existing grey-weighted distance transform and a new algorithm to extract the circular shortest path in an image. The methods are tested on an artificial dataset of a 1000 images, with an F1-score of 0.972. In a case study with yeast cells, contours from our methods were compared with another solution using Pratt's figure of merit. Results indicate that our methods were more precise based on a comparison with a ground-truth dataset. As far as yeast cells are concerned, the segmentation and measurement results enable, in future work, to retrieve information from different developmental stages of the cell using complex features.

Preoperative transcutaneous electrical nerve stimulation for localizing superficial nerve paths.

PubMed

Natori, Yuhei; Yoshizawa, Hidekazu; Mizuno, Hiroshi; Hayashi, Ayato

2015-12-01

During surgery, peripheral nerves are often seen to follow unpredictable paths because of previous surgeries and/or compression caused by a tumor. Iatrogenic nerve injury is a serious complication that must be avoided, and preoperative evaluation of nerve paths is important for preventing it. In this study, transcutaneous electrical nerve stimulation (TENS) was used for an in-depth analysis of peripheral nerve paths. This study included 27 patients who underwent the TENS procedure to evaluate the peripheral nerve path (17 males and 10 females; mean age: 59.9 years, range: 18-83 years) of each patient preoperatively. An electrode pen coupled to an electrical nerve stimulator was used for superficial nerve mapping. The TENS procedure was performed on patients' major peripheral nerves that passed close to the surgical field of tumor resection or trauma surgery, and intraoperative damage to those nerves was apprehensive. The paths of the target nerve were detected in most patients preoperatively. The nerve paths of 26 patients were precisely under the markings drawn preoperatively. The nerve path of one patient substantially differed from the preoperative markings with numbness at the surgical region. During surgery, the nerve paths could be accurately mapped preoperatively using the TENS procedure as confirmed by direct visualization of the nerve. This stimulation device is easy to use and offers highly accurate mapping of nerves for surgical planning without major complications. The authors conclude that TENS is a useful tool for noninvasive nerve localization and makes tumor resection a safe and smooth procedure. Copyright © 2015 British Association of Plastic, Reconstructive and Aesthetic Surgeons. Published by Elsevier Ltd. All rights reserved.

14 CFR 25.123 - En route flight paths.

Code of Federal Regulations, 2010 CFR

2010-01-01

... must represent the actual climb performance diminished by a gradient of climb of 1.1 percent for two... degradation of the gradient of climb is greater than one-half of the applicable actual-to-net flight path...-inoperative net flight path data must represent the actual climb performance diminished by a gradient of climb...

Germany's ECEC Workforce: A Difficult Path to Professionalisation

ERIC Educational Resources Information Center

Rauschenbach, Thomas; Riedel, Birgit

2016-01-01

In a European comparison, the childcare profession in Germany has taken a distinct path of development which is closely interwoven with the history of early childhood education and care (ECEC) in general. Institutional choices critical to this path are the assignment of childcare as part of social welfare, the pursuit of a maternalist tradition in…

Crack Path Selection in Thermally Loaded Borosilicate/Steel Bibeam Specimen

DOE Office of Scientific and Technical Information (OSTI.GOV)

Grutzik, Scott Joseph; Reedy, Jr., E. D.

Here, we have developed a novel specimen for studying crack paths in glass. Under certain conditions, the specimen reaches a state where the crack must select between multiple paths satisfying the K II = 0 condition. This path selection is a simple but challenging benchmark case for both analytical and numerical methods of predicting crack propagation. We document the development of the specimen, using an uncracked and instrumented test case to study the effect of adhesive choice and validate the accuracy of both a simple beam theory model and a finite element model. In addition, we present preliminary fracture testmore » results and provide a comparison to the path predicted by two numerical methods (mesh restructuring and XFEM). The directional stability of the crack path and differences in kink angle predicted by various crack kinking criteria is analyzed with a finite element model.« less

Crack Path Selection in Thermally Loaded Borosilicate/Steel Bibeam Specimen

DOE PAGES

Grutzik, Scott Joseph; Reedy, Jr., E. D.

2017-08-04

Here, we have developed a novel specimen for studying crack paths in glass. Under certain conditions, the specimen reaches a state where the crack must select between multiple paths satisfying the K II = 0 condition. This path selection is a simple but challenging benchmark case for both analytical and numerical methods of predicting crack propagation. We document the development of the specimen, using an uncracked and instrumented test case to study the effect of adhesive choice and validate the accuracy of both a simple beam theory model and a finite element model. In addition, we present preliminary fracture testmore » results and provide a comparison to the path predicted by two numerical methods (mesh restructuring and XFEM). The directional stability of the crack path and differences in kink angle predicted by various crack kinking criteria is analyzed with a finite element model.« less

Path integration on the hyperbolic plane with a magnetic field

NASA Astrophysics Data System (ADS)

Grosche, Christian

1990-08-01

In this paper I discuss the path integrals on three formulations of hyperbolic geometry, where a constant magnetic field B is included. These are: the pseudosphere Λ2, the Poincaré disc D, and the hyperbolic strip S. The corresponding path integrals can be reformulated in terms of the path integral for the modified Pöschl-Teller potential. The wave-functions and the energy spectrum for the discrete and continuous part of the spectrum are explicitly calculated in each case. First the results are compared for the limit B → 0 with previous calculations and second with the path integration on the Poincaré upper half-plane U. This work is a continuation of the path integral calculations for the free motion on the various formulations on the hyperbolic plane and for the case of constant magnetic field on the Poincaré upper half-plane U.

Optical path switching based differential absorption radiometry for substance detection

NASA Technical Reports Server (NTRS)

Sachse, Glen W. (Inventor)

2005-01-01

An optical path switch divides sample path radiation into a time series of alternating first polarized components and second polarized components. The first polarized components are transmitted along a first optical path and the second polarized components along a second optical path. A first gasless optical filter train filters the first polarized components to isolate at least a first wavelength band thereby generating first filtered radiation. A second gasless optical filter train filters the second polarized components to isolate at least a second wavelength band thereby generating second filtered radiation. A beam combiner combines the first and second filtered radiation to form a combined beam of radiation. A detector is disposed to monitor magnitude of at least a portion of the combined beam alternately at the first wavelength band and the second wavelength band as an indication of the concentration of the substance in the sample path.

Optical path switching based differential absorption radiometry for substance detection

NASA Technical Reports Server (NTRS)

Sachse, Glen W. (Inventor)

2003-01-01

An optical path switch divides sample path radiation into a time series of alternating first polarized components and second polarized components. The first polarized components are transmitted along a first optical path and the second polarized components along a second optical path. A first gasless optical filter train filters the first polarized components to isolate at least a first wavelength band thereby generating first filtered radiation. A second gasless optical filter train filters the second polarized components to isolate at least a second wavelength band thereby generating second filtered radiation. A beam combiner combines the first and second filtered radiation to form a combined beam of radiation. A detector is disposed to monitor magnitude of at least a portion of the combined beam alternately at the first wavelength band and the second wavelength band as an indication of the concentration of the substance in the sample path.

A Bat Algorithm with Mutation for UCAV Path Planning

PubMed Central

Wang, Gaige; Guo, Lihong; Duan, Hong; Liu, Luo; Wang, Heqi

2012-01-01

Path planning for uninhabited combat air vehicle (UCAV) is a complicated high dimension optimization problem, which mainly centralizes on optimizing the flight route considering the different kinds of constrains under complicated battle field environments. Original bat algorithm (BA) is used to solve the UCAV path planning problem. Furthermore, a new bat algorithm with mutation (BAM) is proposed to solve the UCAV path planning problem, and a modification is applied to mutate between bats during the process of the new solutions updating. Then, the UCAV can find the safe path by connecting the chosen nodes of the coordinates while avoiding the threat areas and costing minimum fuel. This new approach can accelerate the global convergence speed while preserving the strong robustness of the basic BA. The realization procedure for original BA and this improved metaheuristic approach BAM is also presented. To prove the performance of this proposed metaheuristic method, BAM is compared with BA and other population-based optimization methods, such as ACO, BBO, DE, ES, GA, PBIL, PSO, and SGA. The experiment shows that the proposed approach is more effective and feasible in UCAV path planning than the other models. PMID:23365518

A bat algorithm with mutation for UCAV path planning.

PubMed

Wang, Gaige; Guo, Lihong; Duan, Hong; Liu, Luo; Wang, Heqi

2012-01-01

Path planning for uninhabited combat air vehicle (UCAV) is a complicated high dimension optimization problem, which mainly centralizes on optimizing the flight route considering the different kinds of constrains under complicated battle field environments. Original bat algorithm (BA) is used to solve the UCAV path planning problem. Furthermore, a new bat algorithm with mutation (BAM) is proposed to solve the UCAV path planning problem, and a modification is applied to mutate between bats during the process of the new solutions updating. Then, the UCAV can find the safe path by connecting the chosen nodes of the coordinates while avoiding the threat areas and costing minimum fuel. This new approach can accelerate the global convergence speed while preserving the strong robustness of the basic BA. The realization procedure for original BA and this improved metaheuristic approach BAM is also presented. To prove the performance of this proposed metaheuristic method, BAM is compared with BA and other population-based optimization methods, such as ACO, BBO, DE, ES, GA, PBIL, PSO, and SGA. The experiment shows that the proposed approach is more effective and feasible in UCAV path planning than the other models.

A Minimum Path Algorithm Among 3D-Polyhedral Objects

NASA Astrophysics Data System (ADS)

Yeltekin, Aysin

1989-03-01

In this work we introduce a minimum path theorem for 3D case. We also develop an algorithm based on the theorem we prove. The algorithm will be implemented on the software package we develop using C language. The theorem we introduce states that; "Given the initial point I, final point F and S be the set of finite number of static obstacles then an optimal path P from I to F, such that PA S = 0 is composed of straight line segments which are perpendicular to the edge segments of the objects." We prove the theorem as well as we develop the following algorithm depending on the theorem to find the minimum path among 3D-polyhedral objects. The algorithm generates the point Qi on edge ei such that at Qi one can find the line which is perpendicular to the edge and the IF line. The algorithm iteratively provides a new set of initial points from Qi and exploits all possible paths. Then the algorithm chooses the minimum path among the possible ones. The flowchart of the program as well as the examination of its numerical properties are included.

Dual stage potential field method for robotic path planning

NASA Astrophysics Data System (ADS)

Singh, Pradyumna Kumar; Parida, Pramod Kumar

2018-04-01

Path planning for autonomous mobile robots are the root for all autonomous mobile systems. Various methods are used for optimization of path to be followed by the autonomous mobile robots. Artificial potential field based path planning method is one of the most used methods for the researchers. Various algorithms have been proposed using the potential field approach. But in most of the common problems are encounters while heading towards the goal or target. i.e. local minima problem, zero potential regions problem, complex shaped obstacles problem, target near obstacle problem. In this paper we provide a new algorithm in which two types of potential functions are used one after another. The former one is to use to get the probable points and later one for getting the optimum path. In this algorithm we consider only the static obstacle and goal.

Roles of Impulsivity, Motivation, and Emotion Regulation in Procrastination - Path Analysis and Comparison Between Students and Non-students.

PubMed

Wypych, Marek; Matuszewski, Jacek; Dragan, Wojciech Ł

2018-01-01

Procrastination - an irrational delay of intended actions despite expecting to be worse off - is a complex and non-homogenous phenomenon. Previous studies have found a number of correlates of procrastination, some of which seem to be particularly important. Impulsivity is closely connected to procrastination on behavioral, genetic, and neuronal levels. Difficulties in emotion regulation have also been shown to be strongly related to procrastination. Procrastination can also be considered as a motivation-based problem. To try to disentangle the connections of impulsivity, emotion regulation, and motivation to procrastination we collected data from over 600 subjects using multiple questionnaires (PPS - Pure Procrastination Scale; UPPSP - Impulsive Behavior Scale, ERQ - Emotion Regulation Questionnaire and MDT - Motivational Diagnostic Test). Structural equation modeling was performed to test several possible relationships between the measured variables. The effects of student status and age have also been investigated. The final path model was a directional model based on six explanatory variables and accounted for 70% of the variance in procrastination. Path analysis revealed that the strongest contributions to procrastination came from lack of value, delay discounting, and lack of perseverance, suggesting the involvement of motivation and impulsivity. The model also revealed the moderating role of expressive suppression between several aspects of impulsivity and procrastination. Close inspection of the paths' weights suggests that there may be two partly competing strategies for dealing with impulsivity and negative emotions: either to suppress emotions and impulsive reactions or to react impulsively, discarding previous plans, and to procrastinate. Path invariance analysis showed the significant moderating roles of student status and age. Both in non-students and high-age groups, the path leading from suppression to procrastination was insignificant. This suggests

Tracing Technological Development Trajectories: A Genetic Knowledge Persistence-Based Main Path Approach

PubMed Central

2017-01-01

The aim of this paper is to propose a new method to identify main paths in a technological domain using patent citations. Previous approaches for using main path analysis have greatly improved our understanding of actual technological trajectories but nonetheless have some limitations. They have high potential to miss some dominant patents from the identified main paths; nonetheless, the high network complexity of their main paths makes qualitative tracing of trajectories problematic. The proposed method searches backward and forward paths from the high-persistence patents which are identified based on a standard genetic knowledge persistence algorithm. We tested the new method by applying it to the desalination and the solar photovoltaic domains and compared the results to output from the same domains using a prior method. The empirical results show that the proposed method can dramatically reduce network complexity without missing any dominantly important patents. The main paths identified by our approach for two test cases are almost 10x less complex than the main paths identified by the existing approach. The proposed approach identifies all dominantly important patents on the main paths, but the main paths identified by the existing approach miss about 20% of dominantly important patents. PMID:28135304

A novel communication mechanism based on node potential multi-path routing

NASA Astrophysics Data System (ADS)

Bu, Youjun; Zhang, Chuanhao; Jiang, YiMing; Zhang, Zhen

2016-10-01

With the network scales rapidly and new network applications emerge frequently, bandwidth supply for today's Internet could not catch up with the rapid increasing requirements. Unfortunately, irrational using of network sources makes things worse. Actual network deploys single-next-hop optimization paths for data transmission, but such "best effort" model leads to the imbalance use of network resources and usually leads to local congestion. On the other hand Multi-path routing can use the aggregation bandwidth of multi paths efficiently and improve the robustness of network, security, load balancing and quality of service. As a result, multi-path has attracted much attention in the routing and switching research fields and many important ideas and solutions have been proposed. This paper focuses on implementing the parallel transmission of multi next-hop data, balancing the network traffic and reducing the congestion. It aimed at exploring the key technologies of the multi-path communication network, which could provide a feasible academic support for subsequent applications of multi-path communication networking. It proposed a novel multi-path algorithm based on node potential in the network. And the algorithm can fully use of the network link resource and effectively balance network link resource utilization.

MapMaker and PathTracer for tracking carbon in genome-scale metabolic models

PubMed Central

Tervo, Christopher J.; Reed, Jennifer L.

2016-01-01

Constraint-based reconstruction and analysis (COBRA) modeling results can be difficult to interpret given the large numbers of reactions in genome-scale models. While paths in metabolic networks can be found, existing methods are not easily combined with constraint-based approaches. To address this limitation, two tools (MapMaker and PathTracer) were developed to find paths (including cycles) between metabolites, where each step transfers carbon from reactant to product. MapMaker predicts carbon transfer maps (CTMs) between metabolites using only information on molecular formulae and reaction stoichiometry, effectively determining which reactants and products share carbon atoms. MapMaker correctly assigned CTMs for over 97% of the 2,251 reactions in an Escherichia coli metabolic model (iJO1366). Using CTMs as inputs, PathTracer finds paths between two metabolites. PathTracer was applied to iJO1366 to investigate the importance of using CTMs and COBRA constraints when enumerating paths, to find active and high flux paths in flux balance analysis (FBA) solutions, to identify paths for putrescine utilization, and to elucidate a potential CO2 fixation pathway in E. coli. These results illustrate how MapMaker and PathTracer can be used in combination with constraint-based models to identify feasible, active, and high flux paths between metabolites. PMID:26771089

An Introduction to Path Analysis

ERIC Educational Resources Information Center

Wolfe, Lee M.

1977-01-01

The analytical procedure of path analysis is described in terms of its use in nonexperimental settings in the social sciences. The description assumes a moderate statistical background on the part of the reader. (JKS)

Completely automated open-path FT-IR spectrometry.

PubMed

Griffiths, Peter R; Shao, Limin; Leytem, April B

2009-01-01

Atmospheric analysis by open-path Fourier-transform infrared (OP/FT-IR) spectrometry has been possible for over two decades but has not been widely used because of the limitations of the software of commercial instruments. In this paper, we describe the current state-of-the-art of the hardware and software that constitutes a contemporary OP/FT-IR spectrometer. We then describe advances that have been made in our laboratory that have enabled many of the limitations of this type of instrument to be overcome. These include not having to acquire a single-beam background spectrum that compensates for absorption features in the spectra of atmospheric water vapor and carbon dioxide. Instead, an easily measured "short path-length" background spectrum is used for calculation of each absorbance spectrum that is measured over a long path-length. To accomplish this goal, the algorithm used to calculate the concentrations of trace atmospheric molecules was changed from classical least-squares regression (CLS) to partial least-squares regression (PLS). For calibration, OP/FT-IR spectra are measured in pristine air over a wide variety of path-lengths, temperatures, and humidities, ratioed against a short-path background, and converted to absorbance; the reference spectrum of each analyte is then multiplied by randomly selected coefficients and added to these background spectra. Automatic baseline correction for small molecules with resolved rotational fine structure, such as ammonia and methane, is effected using wavelet transforms. A novel method of correcting for the effect of the nonlinear response of mercury cadmium telluride detectors is also incorporated. Finally, target factor analysis may be used to detect the onset of a given pollutant when its concentration exceeds a certain threshold. In this way, the concentration of atmospheric species has been obtained from OP/FT-IR spectra measured at intervals of 1 min over a period of many hours with no operator intervention.

Path similarity skeleton graph matching.

PubMed

Bai, Xiang; Latecki, Longin Jan

2008-07-01

This paper presents a novel framework to for shape recognition based on object silhouettes. The main idea is to match skeleton graphs by comparing the shortest paths between skeleton endpoints. In contrast to typical tree or graph matching methods, we completely ignore the topological graph structure. Our approach is motivated by the fact that visually similar skeleton graphs may have completely different topological structures. The proposed comparison of shortest paths between endpoints of skeleton graphs yields correct matching results in such cases. The skeletons are pruned by contour partitioning with Discrete Curve Evolution, which implies that the endpoints of skeleton branches correspond to visual parts of the objects. The experimental results demonstrate that our method is able to produce correct results in the presence of articulations, stretching, and occlusion.

Spin Path Integrals and Generations

NASA Astrophysics Data System (ADS)

Brannen, Carl

2010-11-01

The spin of a free electron is stable but its position is not. Recent quantum information research by G. Svetlichny, J. Tolar, and G. Chadzitaskos have shown that the Feynman position path integral can be mathematically defined as a product of incompatible states; that is, as a product of mutually unbiased bases (MUBs). Since the more common use of MUBs is in finite dimensional Hilbert spaces, this raises the question “what happens when spin path integrals are computed over products of MUBs?” Such an assumption makes spin no longer stable. We show that the usual spin-1/2 is obtained in the long-time limit in three orthogonal solutions that we associate with the three elementary particle generations. We give applications to the masses of the elementary leptons.

Force characteristics in continuous path controlled crankpin grinding

NASA Astrophysics Data System (ADS)

Zhang, Manchao; Yao, Zhenqiang

2015-03-01

Recent research on the grinding force involved in cylindrical plunge grinding has focused mainly on steady-state conditions. Unlike in conventional external cylindrical plunge grinding, the conditions between the grinding wheel and the crankpin change periodically in path controlled grinding because of the eccentricity of the crankpin and the constant rotational speed of the crankshaft. The objective of this study is to investigate the effects of various grinding conditions on the characteristics of the grinding force during continuous path controlled grinding. Path controlled plunge grinding is conducted at a constant rotational speed using a cubic boron nitride (CBN) wheel. The grinding force is determined by measuring the torque. The experimental results show that the force and torque vary sinusoidally during dry grinding and load grinding. The variations in the results reveal that the resultant grinding force and torque decrease with higher grinding speeds and increase with higher peripheral speeds of the pin and higher grinding depths. In path controlled grinding, unlike in conventional external cylindrical plunge grinding, the axial grinding force cannot be disregarded. The speeds and speed ratios of the workpiece and wheel are also analyzed, and the analysis results show that up-grinding and down-grinding occur during the grinding process. This paper proposes a method for describing the force behavior under varied process conditions during continuous path controlled grinding, which provides a beneficial reference for describing the material removal mechanism and for optimizing continuous controlled crankpin grinding.

Self-organization and solution of shortest-path optimization problems with memristive networks

NASA Astrophysics Data System (ADS)

Pershin, Yuriy V.; Di Ventra, Massimiliano

2013-07-01

We show that memristive networks, namely networks of resistors with memory, can efficiently solve shortest-path optimization problems. Indeed, the presence of memory (time nonlocality) promotes self organization of the network into the shortest possible path(s). We introduce a network entropy function to characterize the self-organized evolution, show the solution of the shortest-path problem and demonstrate the healing property of the solution path. Finally, we provide an algorithm to solve the traveling salesman problem. Similar considerations apply to networks of memcapacitors and meminductors, and networks with memory in various dimensions.

Dissociable Modulation of Overt Visual Attention in Valence and Arousal Revealed by Topology of Scan Path

PubMed Central

Ni, Jianguang; Jiang, Huihui; Jin, Yixiang; Chen, Nanhui; Wang, Jianhong; Wang, Zhengbo; Luo, Yuejia; Ma, Yuanye; Hu, Xintian

2011-01-01

Emotional stimuli have evolutionary significance for the survival of organisms; therefore, they are attention-grabbing and are processed preferentially. The neural underpinnings of two principle emotional dimensions in affective space, valence (degree of pleasantness) and arousal (intensity of evoked emotion), have been shown to be dissociable in the olfactory, gustatory and memory systems. However, the separable roles of valence and arousal in scene perception are poorly understood. In this study, we asked how these two emotional dimensions modulate overt visual attention. Twenty-two healthy volunteers freely viewed images from the International Affective Picture System (IAPS) that were graded for affective levels of valence and arousal (high, medium, and low). Subjects' heads were immobilized and eye movements were recorded by camera to track overt shifts of visual attention. Algebraic graph-based approaches were introduced to model scan paths as weighted undirected path graphs, generating global topology metrics that characterize the algebraic connectivity of scan paths. Our data suggest that human subjects show different scanning patterns to stimuli with different affective ratings. Valence salient stimuli (with neutral arousal) elicited faster and larger shifts of attention, while arousal salient stimuli (with neutral valence) elicited local scanning, dense attention allocation and deep processing. Furthermore, our model revealed that the modulatory effect of valence was linearly related to the valence level, whereas the relation between the modulatory effect and the level of arousal was nonlinear. Hence, visual attention seems to be modulated by mechanisms that are separate for valence and arousal. PMID:21494331

Compensation of high order harmonic long quantum-path attosecond chirp

NASA Astrophysics Data System (ADS)

Guichard, R.; Caillat, J.; Lévêque, C.; Risoud, F.; Maquet, A.; Taïeb, R.; Zaïr, A.

2017-12-01

We propose a method to compensate for the extreme ultra violet (XUV) attosecond chirp associated with the long quantum-path in the high harmonic generation process. Our method employs an isolated attosecond pulse (IAP) issued from the short trajectory contribution in a primary target to assist the infrared driving field to produce high harmonics from the long trajectory in a secondary target. In our simulations based on the resolution of the time-dependent Schrödinger equation, the resulting high harmornics present a clear phase compensation of the long quantum-path contribution, near to Fourier transform limited attosecond XUV pulse. Employing time-frequency analysis of the high harmonic dipole, we found that the compensation is not a simple far-field photonic interference between the IAP and the long-path harmonic emission, but a coherent phase transfer from the weak IAP to the long quantum-path electronic wavepacket. Our approach opens the route to utilizing the long quantum-path for the production and applications of attosecond pulses.

Path-integral method for the source apportionment of photochemical pollutants

NASA Astrophysics Data System (ADS)

Dunker, A. M.

2015-06-01

A new, path-integral method is presented for apportioning the concentrations of pollutants predicted by a photochemical model to emissions from different sources. A novel feature of the method is that it can apportion the difference in a species concentration between two simulations. For example, the anthropogenic ozone increment, which is the difference between a simulation with all emissions present and another simulation with only the background (e.g., biogenic) emissions included, can be allocated to the anthropogenic emission sources. The method is based on an existing, exact mathematical equation. This equation is applied to relate the concentration difference between simulations to line or path integrals of first-order sensitivity coefficients. The sensitivities describe the effects of changing the emissions and are accurately calculated by the decoupled direct method. The path represents a continuous variation of emissions between the two simulations, and each path can be viewed as a separate emission-control strategy. The method does not require auxiliary assumptions, e.g., whether ozone formation is limited by the availability of volatile organic compounds (VOCs) or nitrogen oxides (NOx), and can be used for all the species predicted by the model. A simplified configuration of the Comprehensive Air Quality Model with Extensions (CAMx) is used to evaluate the accuracy of different numerical integration procedures and the dependence of the source contributions on the path. A Gauss-Legendre formula using three or four points along the path gives good accuracy for apportioning the anthropogenic increments of ozone, nitrogen dioxide, formaldehyde, and nitric acid. Source contributions to these increments were obtained for paths representing proportional control of all anthropogenic emissions together, control of NOx emissions before VOC emissions, and control of VOC emissions before NOx emissions. There are similarities in the source contributions from the

Path-integral method for the source apportionment of photochemical pollutants

NASA Astrophysics Data System (ADS)

Dunker, A. M.

2014-12-01

A new, path-integral method is presented for apportioning the concentrations of pollutants predicted by a photochemical model to emissions from different sources. A novel feature of the method is that it can apportion the difference in a species concentration between two simulations. For example, the anthropogenic ozone increment, which is the difference between a simulation with all emissions present and another simulation with only the background (e.g., biogenic) emissions included, can be allocated to the anthropogenic emission sources. The method is based on an existing, exact mathematical equation. This equation is applied to relate the concentration difference between simulations to line or path integrals of first-order sensitivity coefficients. The sensitivities describe the effects of changing the emissions and are accurately calculated by the decoupled direct method. The path represents a continuous variation of emissions between the two simulations, and each path can be viewed as a separate emission-control strategy. The method does not require auxiliary assumptions, e.g., whether ozone formation is limited by the availability of volatile organic compounds (VOC's) or nitrogen oxides (NOx), and can be used for all the species predicted by the model. A simplified configuration of the Comprehensive Air Quality Model with Extensions is used to evaluate the accuracy of different numerical integration procedures and the dependence of the source contributions on the path. A Gauss-Legendre formula using 3 or 4 points along the path gives good accuracy for apportioning the anthropogenic increments of ozone, nitrogen dioxide, formaldehyde, and nitric acid. Source contributions to these increments were obtained for paths representing proportional control of all anthropogenic emissions together, control of NOx emissions before VOC emissions, and control of VOC emissions before NOx emissions. There are similarities in the source contributions from the three paths but