DecisionMaker software and extracting fuzzy rules under uncertainty

NASA Technical Reports Server (NTRS)

Walker, Kevin B.

1992-01-01

Knowledge acquisition under uncertainty is examined. Theories proposed in deKorvin's paper 'Extracting Fuzzy Rules Under Uncertainty and Measuring Definability Using Rough Sets' are discussed as they relate to rule calculation algorithms. A data structure for holding an arbitrary number of data fields is described. Limitations of Pascal for loops in the generation of combinations are also discussed. Finally, recursive algorithms for generating all possible combination of attributes and for calculating the intersection of an arbitrary number of fuzzy sets are presented.

Sequential design of discrete linear quadratic regulators via optimal root-locus techniques

NASA Technical Reports Server (NTRS)

Shieh, Leang S.; Yates, Robert E.; Ganesan, Sekar

1989-01-01

A sequential method employing classical root-locus techniques has been developed in order to determine the quadratic weighting matrices and discrete linear quadratic regulators of multivariable control systems. At each recursive step, an intermediate unity rank state-weighting matrix that contains some invariant eigenvectors of that open-loop matrix is assigned, and an intermediate characteristic equation of the closed-loop system containing the invariant eigenvalues is created.

A closed expression for the UV-divergent parts of one-loop tensor integrals in dimensional regularization

NASA Astrophysics Data System (ADS)

Sulyok, G.

2017-07-01

Starting from the general definition of a one-loop tensor N-point function, we use its Feynman parametrization to calculate the ultraviolet (UV-)divergent part of an arbitrary tensor coefficient in the framework of dimensional regularization. In contrast to existing recursion schemes, we are able to present a general analytic result in closed form that enables direct determination of the UV-divergent part of any one-loop tensor N-point coefficient independent from UV-divergent parts of other one-loop tensor N-point coefficients. Simplified formulas and explicit expressions are presented for A-, B-, C-, D-, E-, and F-functions.

An estimator-predictor approach to PLL loop filter design

NASA Technical Reports Server (NTRS)

Statman, J. I.; Hurd, W. J.

1986-01-01

An approach to the design of digital phase locked loops (DPLLs), using estimation theory concepts in the selection of a loop filter, is presented. The key concept is that the DPLL closed-loop transfer function is decomposed into an estimator and a predictor. The estimator provides recursive estimates of phase, frequency, and higher order derivatives, while the predictor compensates for the transport lag inherent in the loop. This decomposition results in a straightforward loop filter design procedure, enabling use of techniques from optimal and sub-optimal estimation theory. A design example for a particular choice of estimator is presented, followed by analysis of the associated bandwidth, gain margin, and steady state errors caused by unmodeled dynamics. This approach is under consideration for the design of the Deep Space Network (DSN) Advanced Receiver Carrier DPLL.

Category Learning in the Brain

PubMed Central

Seger, Carol A.; Miller, Earl K.

2013-01-01

The ability to group items and events into functional categories is a fundamental characteristic of sophisticated thought. It is subserved by plasticity in many neural systems, including neocortical regions (sensory, prefrontal, parietal, and motor cortex), the medial temporal lobe, the basal ganglia, and midbrain dopaminergic systems. These systems interact during category learning. Corticostriatal loops may mediate recursive, bootstrapping interactions between fast reward-gated plasticity in the basal ganglia and slow reward-shaded plasticity in the cortex. This can provide a balance between acquisition of details of experiences and generalization across them. Interactions between the corticostriatal loops can integrate perceptual, response, and feedback-related aspects of the task and mediate the shift from novice to skilled performance. The basal ganglia and medial temporal lobe interact competitively or cooperatively, depending on the demands of the learning task. PMID:20572771

Indirect Identification of Linear Stochastic Systems with Known Feedback Dynamics

NASA Technical Reports Server (NTRS)

Huang, Jen-Kuang; Hsiao, Min-Hung; Cox, David E.

1996-01-01

An algorithm is presented for identifying a state-space model of linear stochastic systems operating under known feedback controller. In this algorithm, only the reference input and output of closed-loop data are required. No feedback signal needs to be recorded. The overall closed-loop system dynamics is first identified. Then a recursive formulation is derived to compute the open-loop plant dynamics from the identified closed-loop system dynamics and known feedback controller dynamics. The controller can be a dynamic or constant-gain full-state feedback controller. Numerical simulations and test data of a highly unstable large-gap magnetic suspension system are presented to demonstrate the feasibility of this indirect identification method.

Conceptualizing the dynamics of workplace stress: a systems-based study of nursing aides.

PubMed

Jetha, Arif; Kernan, Laura; Kurowski, Alicia

2017-01-05

Workplace stress is a complex phenomenon that may often be dynamic and evolving over time. Traditional linear modeling does not allow representation of recursive feedback loops among the implicated factors. The objective of this study was to develop a multidimensional system dynamics model (SDM) of workplace stress among nursing aides and conduct simulations to illustrate how changes in psychosocial perceptions and workplace factors might influence workplace stress over time. Eight key informants with prior experience in a large study of US nursing home workers participated in model building. Participants brainstormed the range of components related to workplace stress. Components were grouped together based on common themes and translated into feedback loops. The SDM was parameterized through key informant insight on the shape and magnitude of the relationship between model components. Model construction was also supported utilizing survey data collected as part of the larger study. All data was entered into the software program, Vensim. Simulations were conducted to examine how adaptations to model components would influence workplace stress. The SDM included perceptions of organizational conditions (e.g., job demands and job control), workplace social support (i.e., managerial and coworker social support), workplace safety, and demands outside of work (i.e. work-family conflict). Each component was part of a reinforcing feedback loop. Simulations exhibited that scenarios with increasing job control and decreasing job demands led to a decline in workplace stress. Within the context of the system, the effects of workplace social support, workplace safety, and work-family conflict were relatively minor. SDM methodology offers a unique perspective for researchers and practitioners to view workplace stress as a dynamic process. The portrayal of multiple recursive feedback loops can guide the development of policies and programs within complex organizational contexts with attention both to interactions among causes and avoidance of adverse unintended consequences. While additional research is needed to further test the modeling approach, findings might underscore the need to direct workplace interventions towards changing organizational conditions for nursing aides.

Hidden simplicity of gauge theory amplitudes

NASA Astrophysics Data System (ADS)

Drummond, J. M.

2010-11-01

These notes were given as lectures at the CERN Winter School on Supergravity, Strings and Gauge Theory 2010. We describe the structure of scattering amplitudes in gauge theories, focussing on the maximally supersymmetric theory to highlight the hidden symmetries which appear. Using the Britto, Cachzo, Feng and Witten (BCFW) recursion relations we solve the tree-level S-matrix in \\ {N}=4 super Yang-Mills theory and describe how it produces a sum of invariants of a large symmetry algebra. We review amplitudes in the planar theory beyond tree level, describing the connection between amplitudes and Wilson loops, and discuss the implications of the hidden symmetries.

Simultaneous learning and filtering without delusions: a Bayes-optimal combination of Predictive Inference and Adaptive Filtering.

PubMed

Kneissler, Jan; Drugowitsch, Jan; Friston, Karl; Butz, Martin V

2015-01-01

Predictive coding appears to be one of the fundamental working principles of brain processing. Amongst other aspects, brains often predict the sensory consequences of their own actions. Predictive coding resembles Kalman filtering, where incoming sensory information is filtered to produce prediction errors for subsequent adaptation and learning. However, to generate prediction errors given motor commands, a suitable temporal forward model is required to generate predictions. While in engineering applications, it is usually assumed that this forward model is known, the brain has to learn it. When filtering sensory input and learning from the residual signal in parallel, a fundamental problem arises: the system can enter a delusional loop when filtering the sensory information using an overly trusted forward model. In this case, learning stalls before accurate convergence because uncertainty about the forward model is not properly accommodated. We present a Bayes-optimal solution to this generic and pernicious problem for the case of linear forward models, which we call Predictive Inference and Adaptive Filtering (PIAF). PIAF filters incoming sensory information and learns the forward model simultaneously. We show that PIAF is formally related to Kalman filtering and to the Recursive Least Squares linear approximation method, but combines these procedures in a Bayes optimal fashion. Numerical evaluations confirm that the delusional loop is precluded and that the learning of the forward model is more than 10-times faster when compared to a naive combination of Kalman filtering and Recursive Least Squares.

Scattering amplitudes from multivariate polynomial division

NASA Astrophysics Data System (ADS)

Mastrolia, Pierpaolo; Mirabella, Edoardo; Ossola, Giovanni; Peraro, Tiziano

2012-11-01

We show that the evaluation of scattering amplitudes can be formulated as a problem of multivariate polynomial division, with the components of the integration-momenta as indeterminates. We present a recurrence relation which, independently of the number of loops, leads to the multi-particle pole decomposition of the integrands of the scattering amplitudes. The recursive algorithm is based on the weak Nullstellensatz theorem and on the division modulo the Gröbner basis associated to all possible multi-particle cuts. We apply it to dimensionally regulated one-loop amplitudes, recovering the well-known integrand-decomposition formula. Finally, we focus on the maximum-cut, defined as a system of on-shell conditions constraining the components of all the integration-momenta. By means of the Finiteness Theorem and of the Shape Lemma, we prove that the residue at the maximum-cut is parametrized by a number of coefficients equal to the number of solutions of the cut itself.

A probabilistic, distributed, recursive mechanism for decision-making in the brain

PubMed Central

Gurney, Kevin N.

2018-01-01

Decision formation recruits many brain regions, but the procedure they jointly execute is unknown. Here we characterize its essential composition, using as a framework a novel recursive Bayesian algorithm that makes decisions based on spike-trains with the statistics of those in sensory cortex (MT). Using it to simulate the random-dot-motion task, we demonstrate it quantitatively replicates the choice behaviour of monkeys, whilst predicting losses of otherwise usable information from MT. Its architecture maps to the recurrent cortico-basal-ganglia-thalamo-cortical loops, whose components are all implicated in decision-making. We show that the dynamics of its mapped computations match those of neural activity in the sensorimotor cortex and striatum during decisions, and forecast those of basal ganglia output and thalamus. This also predicts which aspects of neural dynamics are and are not part of inference. Our single-equation algorithm is probabilistic, distributed, recursive, and parallel. Its success at capturing anatomy, behaviour, and electrophysiology suggests that the mechanism implemented by the brain has these same characteristics. PMID:29614077

A Method to Predict the Structure and Stability of RNA/RNA Complexes.

PubMed

Xu, Xiaojun; Chen, Shi-Jie

2016-01-01

RNA/RNA interactions are essential for genomic RNA dimerization and regulation of gene expression. Intermolecular loop-loop base pairing is a widespread and functionally important tertiary structure motif in RNA machinery. However, computational prediction of intermolecular loop-loop base pairing is challenged by the entropy and free energy calculation due to the conformational constraint and the intermolecular interactions. In this chapter, we describe a recently developed statistical mechanics-based method for the prediction of RNA/RNA complex structures and stabilities. The method is based on the virtual bond RNA folding model (Vfold). The main emphasis in the method is placed on the evaluation of the entropy and free energy for the loops, especially tertiary kissing loops. The method also uses recursive partition function calculations and two-step screening algorithm for large, complicated structures of RNA/RNA complexes. As case studies, we use the HIV-1 Mal dimer and the siRNA/HIV-1 mutant (T4) to illustrate the method.

The Situation in Industry and the Loss of Interest in Science Education

ERIC Educational Resources Information Center

HAAS, JOACHIM

2005-01-01

The case of Germany is taken as an example of cyclical variation in higher education enrolment in the sciences. The article argues that the mechanism underpinning these fluctuations is the cobweb model. This model establishes a recursive loop between trends in enrolments in a discipline and trends in the labour market associated with this…

The Situation in Industry and the Loss of Interest in Science Education

ERIC Educational Resources Information Center

Haas, Joachim

2005-01-01

The case of Germany is taken as an example of cyclical variation in higher education enrolment in the sciences. This article looks at the causes of this "oscillation," focusing on the cycle of the 1990s and argues that the mechanism underpinning these fluctuations is the cobweb model. This model establishes a recursive loop between…

Synthesis and evaluation of phase detectors for active bit synchronizers

NASA Technical Reports Server (NTRS)

Mcbride, A. L.

1974-01-01

Self-synchronizing digital data communication systems usually use active or phase-locked loop (PLL) bit synchronizers. The three main elements of PLL synchronizers are the phase detector, loop filter, and the voltage controlled oscillator. Of these three elements, phase detector synthesis is the main source of difficulty, particularly when the received signals are demodulated square-wave signals. A phase detector synthesis technique is reviewed that provides a physically realizable design for bit synchronizer phase detectors. The development is based upon nonlinear recursive estimation methods. The phase detector portion of the algorithm is isolated and analyzed.

Decoupling PI Controller Design for a Normal Conducting RF Cavity Using a Recursive LEVENBERG-MARQUARDT Algorithm

NASA Astrophysics Data System (ADS)

Kwon, Sung-il; Lynch, M.; Prokop, M.

2005-02-01

This paper addresses the system identification and the decoupling PI controller design for a normal conducting RF cavity. Based on the open-loop measurement data of an SNS DTL cavity, the open-loop system's bandwidths and loop time delays are estimated by using batched least square. With the identified system, a PI controller is designed in such a way that it suppresses the time varying klystron droop and decouples the In-phase and Quadrature of the cavity field. The Levenberg-Marquardt algorithm is applied for nonlinear least squares to obtain the optimal PI controller parameters. The tuned PI controller gains are downloaded to the low-level RF system by using channel access. The experiment of the closed-loop system is performed and the performance is investigated. The proposed tuning method is running automatically in real time interface between a host computer with controller hardware through ActiveX Channel Access.

Learning from adaptive neural dynamic surface control of strict-feedback systems.

PubMed

Wang, Min; Wang, Cong

2015-06-01

Learning plays an essential role in autonomous control systems. However, how to achieve learning in the nonstationary environment for nonlinear systems is a challenging problem. In this paper, we present learning method for a class of n th-order strict-feedback systems by adaptive dynamic surface control (DSC) technology, which achieves the human-like ability of learning by doing and doing with learned knowledge. To achieve the learning, this paper first proposes stable adaptive DSC with auxiliary first-order filters, which ensures the boundedness of all the signals in the closed-loop system and the convergence of tracking errors in a finite time. With the help of DSC, the derivative of the filter output variable is used as the neural network (NN) input instead of traditional intermediate variables. As a result, the proposed adaptive DSC method reduces greatly the dimension of NN inputs, especially for high-order systems. After the stable DSC design, we decompose the stable closed-loop system into a series of linear time-varying perturbed subsystems. Using a recursive design, the recurrent property of NN input variables is easily verified since the complexity is overcome using DSC. Subsequently, the partial persistent excitation condition of the radial basis function NN is satisfied. By combining a state transformation, accurate approximations of the closed-loop system dynamics are recursively achieved in a local region along recurrent orbits. Then, the learning control method using the learned knowledge is proposed to achieve the closed-loop stability and the improved control performance. Simulation studies are performed to demonstrate the proposed scheme can not only reuse the learned knowledge to achieve the better control performance with the faster tracking convergence rate and the smaller tracking error but also greatly alleviate the computational burden because of reducing the number and complexity of NN input variables.

On-the-fly reduction of open loops

NASA Astrophysics Data System (ADS)

Buccioni, Federico; Pozzorini, Stefano; Zoller, Max

2018-01-01

Building on the open-loop algorithm we introduce a new method for the automated construction of one-loop amplitudes and their reduction to scalar integrals. The key idea is that the factorisation of one-loop integrands in a product of loop segments makes it possible to perform various operations on-the-fly while constructing the integrand. Reducing the integrand on-the-fly, after each segment multiplication, the construction of loop diagrams and their reduction are unified in a single numerical recursion. In this way we entirely avoid objects with high tensor rank, thereby reducing the complexity of the calculations in a drastic way. Thanks to the on-the-fly approach, which is applied also to helicity summation and for the merging of different diagrams, the speed of the original open-loop algorithm can be further augmented in a very significant way. Moreover, addressing spurious singularities of the employed reduction identities by means of simple expansions in rank-two Gram determinants, we achieve a remarkably high level of numerical stability. These features of the new algorithm, which will be made publicly available in a forthcoming release of the OpenLoops program, are particularly attractive for NLO multi-leg and NNLO real-virtual calculations.

Human motion planning based on recursive dynamics and optimal control techniques

NASA Technical Reports Server (NTRS)

Lo, Janzen; Huang, Gang; Metaxas, Dimitris

2002-01-01

This paper presents an efficient optimal control and recursive dynamics-based computer animation system for simulating and controlling the motion of articulated figures. A quasi-Newton nonlinear programming technique (super-linear convergence) is implemented to solve minimum torque-based human motion-planning problems. The explicit analytical gradients needed in the dynamics are derived using a matrix exponential formulation and Lie algebra. Cubic spline functions are used to make the search space for an optimal solution finite. Based on our formulations, our method is well conditioned and robust, in addition to being computationally efficient. To better illustrate the efficiency of our method, we present results of natural looking and physically correct human motions for a variety of human motion tasks involving open and closed loop kinematic chains.

Contact stiffness and damping identification for hardware-in-the-loop contact simulator with measurement delay compensation

NASA Astrophysics Data System (ADS)

Qi, Chenkun; Zhao, Xianchao; Gao, Feng; Ren, Anye; Sun, Qiao

2016-06-01

The hardware-in-the-loop (HIL) contact simulator is to simulate the contact process of two flying objects in space. The contact stiffness and damping are important parameters used for the process monitoring, compliant contact control and force compensation control. In this study, a contact stiffness and damping identification approach is proposed for the HIL contact simulation with the force measurement delay. The actual relative position of two flying objects can be accurately measured. However, the force measurement delay needs to be compensated because it will lead to incorrect stiffness and damping identification. Here, the phase lead compensation is used to reconstruct the actual contact force from the delayed force measurement. From the force and position data, the contact stiffness and damping are identified in real time using the recursive least squares (RLS) method. The simulations and experiments are used to verify that the proposed stiffness and damping identification approach is effective.

Spatial operator algebra framework for multibody system dynamics

NASA Technical Reports Server (NTRS)

Rodriguez, G.; Jain, Abhinandan; Kreutz, K.

1989-01-01

The Spatial Operator Algebra framework for the dynamics of general multibody systems is described. The use of a spatial operator-based methodology permits the formulation of the dynamical equations of motion of multibody systems in a concise and systematic way. The dynamical equations of progressively more complex grid multibody systems are developed in an evolutionary manner beginning with a serial chain system, followed by a tree topology system and finally, systems with arbitrary closed loops. Operator factorizations and identities are used to develop novel recursive algorithms for the forward dynamics of systems with closed loops. Extensions required to deal with flexible elements are also discussed.

Spatial Operator Algebra for multibody system dynamics

NASA Technical Reports Server (NTRS)

Rodriguez, G.; Jain, A.; Kreutz-Delgado, K.

1992-01-01

The Spatial Operator Algebra framework for the dynamics of general multibody systems is described. The use of a spatial operator-based methodology permits the formulation of the dynamical equations of motion of multibody systems in a concise and systematic way. The dynamical equations of progressively more complex grid multibody systems are developed in an evolutionary manner beginning with a serial chain system, followed by a tree topology system and finally, systems with arbitrary closed loops. Operator factorizations and identities are used to develop novel recursive algorithms for the forward dynamics of systems with closed loops. Extensions required to deal with flexible elements are also discussed.

Unified sensor management in unknown dynamic clutter

NASA Astrophysics Data System (ADS)

Mahler, Ronald; El-Fallah, Adel

2010-04-01

In recent years the first author has developed a unified, computationally tractable approach to multisensor-multitarget sensor management. This approach consists of closed-loop recursion of a PHD or CPHD filter with maximization of a "natural" sensor management objective function called PENT (posterior expected number of targets). In this paper we extend this approach so that it can be used in unknown, dynamic clutter backgrounds.

Teaching and learning recursive programming: a review of the research literature

NASA Astrophysics Data System (ADS)

McCauley, Renée; Grissom, Scott; Fitzgerald, Sue; Murphy, Laurie

2015-01-01

Hundreds of articles have been published on the topics of teaching and learning recursion, yet fewer than 50 of them have published research results. This article surveys the computing education research literature and presents findings on challenges students encounter in learning recursion, mental models students develop as they learn recursion, and best practices in introducing recursion. Effective strategies for introducing the topic include using different contexts such as recurrence relations, programming examples, fractal images, and a description of how recursive methods are processed using a call stack. Several studies compared the efficacy of introducing iteration before recursion and vice versa. The paper concludes with suggestions for future research into how students learn and understand recursion, including a look at the possible impact of instructor attitude and newer pedagogies.

A Recursive Method for Calculating Certain Partition Functions.

ERIC Educational Resources Information Center

Woodrum, Luther; And Others

1978-01-01

Describes a simple recursive method for calculating the partition function and average energy of a system consisting of N electrons and L energy levels. Also, presents an efficient APL computer program to utilize the recursion relation. (Author/GA)

Simple recursion relations for general field theories

DOE PAGES

Cheung, Clifford; Shen, Chia -Hsien; Trnka, Jaroslav

2015-06-17

On-shell methods offer an alternative definition of quantum field theory at tree-level, replacing Feynman diagrams with recursion relations and interaction vertices with a handful of seed scattering amplitudes. In this paper we determine the simplest recursion relations needed to construct a general four-dimensional quantum field theory of massless particles. For this purpose we define a covering space of recursion relations which naturally generalizes all existing constructions, including those of BCFW and Risager. The validity of each recursion relation hinges on the large momentum behavior of an n-point scattering amplitude under an m-line momentum shift, which we determine solely from dimensionalmore » analysis, Lorentz invariance, and locality. We show that all amplitudes in a renormalizable theory are 5-line constructible. Amplitudes are 3-line constructible if an external particle carries spin or if the scalars in the theory carry equal charge under a global or gauge symmetry. Remarkably, this implies the 3-line constructibility of all gauge theories with fermions and complex scalars in arbitrary representations, all supersymmetric theories, and the standard model. Moreover, all amplitudes in non-renormalizable theories without derivative interactions are constructible; with derivative interactions, a subset of amplitudes is constructible. We illustrate our results with examples from both renormalizable and non-renormalizable theories. In conclusion, our study demonstrates both the power and limitations of recursion relations as a self-contained formulation of quantum field theory.« less

Transportable Maps Software. Volume I.

DTIC Science & Technology

1982-07-01

being collected at the beginning or end of the routine. This allows the interaction to be followed sequentially through its steps by anyone reading the...flow is either simple sequential , simple conditional (the equivalent of ’if-then-else’), simple iteration (’DO-loop’), or the non-linear recursion...input raster images to be in the form of sequential binary files with a SEGMENTED record type. The advantage of this form is that large logical records

Unintended consequences of information technologies in health care--an interactive sociotechnical analysis.

PubMed

Harrison, Michael I; Koppel, Ross; Bar-Lev, Shirly

2007-01-01

Many unintended and undesired consequences of Healthcare Information Technologies (HIT) flow from interactions between the HIT and the healthcare organization's sociotechnical system-its workflows, culture, social interactions, and technologies. This paper develops and illustrates a conceptual model of these processes that we call Interactive Sociotechnical Analysis (ISTA). ISTA captures common types of interaction with special emphasis on recursive processes, i.e., feedback loops that alter the newly introduced HIT and promote second-level changes in the social system. ISTA draws on prior studies of unintended consequences, along with research in sociotechnical systems, ergonomics, social informatics, technology-in-practice, and social construction of technology. We present five types of sociotechnical interaction and illustrate each with cases from published research. The ISTA model should further research on emergent and recursive processes in HIT implementation and their unintended consequences. Familiarity with the model can also foster practitioners' awareness of unanticipated consequences that only become evident during HIT implementation.

Potential implementation of reservoir computing models based on magnetic skyrmions

NASA Astrophysics Data System (ADS)

Bourianoff, George; Pinna, Daniele; Sitte, Matthias; Everschor-Sitte, Karin

2018-05-01

Reservoir Computing is a type of recursive neural network commonly used for recognizing and predicting spatio-temporal events relying on a complex hierarchy of nested feedback loops to generate a memory functionality. The Reservoir Computing paradigm does not require any knowledge of the reservoir topology or node weights for training purposes and can therefore utilize naturally existing networks formed by a wide variety of physical processes. Most efforts to implement reservoir computing prior to this have focused on utilizing memristor techniques to implement recursive neural networks. This paper examines the potential of magnetic skyrmion fabrics and the complex current patterns which form in them as an attractive physical instantiation for Reservoir Computing. We argue that their nonlinear dynamical interplay resulting from anisotropic magnetoresistance and spin-torque effects allows for an effective and energy efficient nonlinear processing of spatial temporal events with the aim of event recognition and prediction.

Explicit formulae for Yang-Mills-Einstein amplitudes from the double copy

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

Chiodaroli, Marco; Günaydin, Murat; Johansson, Henrik

Using the double-copy construction of Yang-Mills-Einstein theories formulated in our earlier work, we obtain compact presentations for single-trace Yang-Mills-Einstein tree amplitudes with up to five external gravitons and an arbitrary number of gluons. These are written as linear combinations of color-ordered Yang-Mills trees, where the coefficients are given by color/kinematics-satisfying numerators in a Yang-Mills + φ 3 theory. The construction outlined in this paper holds in general dimension and extends straightforwardly to supergravity theories. For one, two, and three external gravitons, our expressions give identical or simpler presentations of amplitudes already constructed through string-theory considerations or the scattering equations formalism.more » Our results are based on color/kinematics duality and gauge invariance, and strongly hint at a recursive structure underlying the single-trace amplitudes with an arbitrary number of gravitons. We also present explicit expressions for all-loop single-graviton Einstein-Yang-Mills amplitudes in terms of Yang-Mills amplitudes and, through gauge invariance, derive new all-loop amplitude relations for Yang-Mills theory.« less

Explicit formulae for Yang-Mills-Einstein amplitudes from the double copy

DOE PAGES

Chiodaroli, Marco; Günaydin, Murat; Johansson, Henrik; ...

2017-07-03

Using the double-copy construction of Yang-Mills-Einstein theories formulated in our earlier work, we obtain compact presentations for single-trace Yang-Mills-Einstein tree amplitudes with up to five external gravitons and an arbitrary number of gluons. These are written as linear combinations of color-ordered Yang-Mills trees, where the coefficients are given by color/kinematics-satisfying numerators in a Yang-Mills + φ 3 theory. The construction outlined in this paper holds in general dimension and extends straightforwardly to supergravity theories. For one, two, and three external gravitons, our expressions give identical or simpler presentations of amplitudes already constructed through string-theory considerations or the scattering equations formalism.more » Our results are based on color/kinematics duality and gauge invariance, and strongly hint at a recursive structure underlying the single-trace amplitudes with an arbitrary number of gravitons. We also present explicit expressions for all-loop single-graviton Einstein-Yang-Mills amplitudes in terms of Yang-Mills amplitudes and, through gauge invariance, derive new all-loop amplitude relations for Yang-Mills theory.« less

Nonlinear control for a class of hydraulic servo system.

PubMed

Yu, Hong; Feng, Zheng-jin; Wang, Xu-yong

2004-11-01

The dynamics of hydraulic systems are highly nonlinear and the system may be subjected to non-smooth and discontinuous nonlinearities due to directional change of valve opening, friction, etc. Aside from the nonlinear nature of hydraulic dynamics, hydraulic servo systems also have large extent of model uncertainties. To address these challenging issues, a robust state-feedback controller is designed by employing backstepping design technique such that the system output tracks a given signal arbitrarily well, and all signals in the closed-loop system remain bounded. Moreover, a relevant disturbance attenuation inequality is satisfied by the closed-loop signals. Compared with previously proposed robust controllers, this paper's robust controller based on backstepping recursive design method is easier to design, and is more suitable for implementation.

Optimal Recursive Digital Filters for Active Bending Stabilization

NASA Technical Reports Server (NTRS)

Orr, Jeb S.

2013-01-01

In the design of flight control systems for large flexible boosters, it is common practice to utilize active feedback control of the first lateral structural bending mode so as to suppress transients and reduce gust loading. Typically, active stabilization or phase stabilization is achieved by carefully shaping the loop transfer function in the frequency domain via the use of compensating filters combined with the frequency response characteristics of the nozzle/actuator system. In this paper we present a new approach for parameterizing and determining optimal low-order recursive linear digital filters so as to satisfy phase shaping constraints for bending and sloshing dynamics while simultaneously maximizing attenuation in other frequency bands of interest, e.g. near higher frequency parasitic structural modes. By parameterizing the filter directly in the z-plane with certain restrictions, the search space of candidate filter designs that satisfy the constraints is restricted to stable, minimum phase recursive low-pass filters with well-conditioned coefficients. Combined with optimal output feedback blending from multiple rate gyros, the present approach enables rapid and robust parametrization of autopilot bending filters to attain flight control performance objectives. Numerical results are presented that illustrate the application of the present technique to the development of rate gyro filters for an exploration-class multi-engined space launch vehicle.

Europe, the professions and interprofessional education: an exploration in inter-culture relativity.

PubMed

Lorenz, Walter

2009-09-01

This paper seeks to understand the inter-cultural relationships between the notions of Europe, the professions and interprofessional education (IPE) in developing an argument for the necessity of interprofessional education for meeting the complex challenges for the professions and society in the 21st century. The concept of "strange loops" is used to explore the paradoxes and recursions in understanding what Europe, the professions and interprofessional education really are. After questioning perceptions of the professions in a changing Europe, I challenge interprofessional education to greater heights. IPE has to accompany all professional exchanges across borders as a critical, constructive process that focuses on differences in theory and practice within the different professional fields to overcome their problems of adjustment to changing user needs and cultural requirements.

Categorial Compositionality III: F-(co)algebras and the Systematicity of Recursive Capacities in Human Cognition

PubMed Central

Phillips, Steven; Wilson, William H.

2012-01-01

Human cognitive capacity includes recursively definable concepts, which are prevalent in domains involving lists, numbers, and languages. Cognitive science currently lacks a satisfactory explanation for the systematic nature of such capacities (i.e., why the capacity for some recursive cognitive abilities–e.g., finding the smallest number in a list–implies the capacity for certain others–finding the largest number, given knowledge of number order). The category-theoretic constructs of initial F-algebra, catamorphism, and their duals, final coalgebra and anamorphism provide a formal, systematic treatment of recursion in computer science. Here, we use this formalism to explain the systematicity of recursive cognitive capacities without ad hoc assumptions (i.e., to the same explanatory standard used in our account of systematicity for non-recursive capacities). The presence of an initial algebra/final coalgebra explains systematicity because all recursive cognitive capacities, in the domain of interest, factor through (are composed of) the same component process. Moreover, this factorization is unique, hence no further (ad hoc) assumptions are required to establish the intrinsic connection between members of a group of systematically-related capacities. This formulation also provides a new perspective on the relationship between recursive cognitive capacities. In particular, the link between number and language does not depend on recursion, as such, but on the underlying functor on which the group of recursive capacities is based. Thus, many species (and infants) can employ recursive processes without having a full-blown capacity for number and language. PMID:22514704

Adventures in Topological Field Theory

NASA Astrophysics Data System (ADS)

Horne, James H.

1990-01-01

This thesis consists of 5 parts. In part I, the topological Yang-Mills theory and the topological sigma model are presented in a superspace formulation. This greatly simplifies the field content of the theories, and makes the Q-invariance more obvious. The Feynman rules for the topological Yang -Mills theory are derived. We calculate the one-loop beta-functions of the topological sigma model in superspace. The lattice version of these theories is presented. The self-duality constraints of both models lead to spectrum doubling. In part II, we show that conformally invariant gravity in three dimensions is equivalent to the Yang-Mills gauge theory of the conformal group in three dimensions, with a Chern-Simons action. This means that conformal gravity is finite and exactly soluble. In part III, we derive the skein relations for the fundamental representations of SO(N), Sp(2n), Su(m| n), and OSp(m| 2n). These relations can be used recursively to calculate the expectation values of Wilson lines in three-dimensional Chern-Simons gauge theory with these gauge groups. A combination of braiding and tying of Wilson lines completely describes the skein relations. In part IV, we show that the k = 1 two dimensional gravity amplitudes at genus 3 agree precisely with the results from intersection theory on moduli space. Predictions for the genus 4 intersection numbers follow from the two dimensional gravity theory. In part V, we discuss the partition function in two dimensional gravity. For the one matrix model at genus 2, we use the partition function to derive a recursion relation. We show that the k = 1 amplitudes completely determine the partition function at arbitrary genus. We present a conjecture for the partition function for the arbitrary topological field theory coupled to topological gravity.

Suboptimal Scheduling in Switched Systems With Continuous-Time Dynamics: A Least Squares Approach.

PubMed

Sardarmehni, Tohid; Heydari, Ali

2018-06-01

Two approximate solutions for optimal control of switched systems with autonomous subsystems and continuous-time dynamics are presented. The first solution formulates a policy iteration (PI) algorithm for the switched systems with recursive least squares. To reduce the computational burden imposed by the PI algorithm, a second solution, called single loop PI, is presented. Online and concurrent training algorithms are discussed for implementing each solution. At last, effectiveness of the presented algorithms is evaluated through numerical simulations.

Development and Evaluation of an Order-N Formulation for Multi-Flexible Body Space Systems

NASA Technical Reports Server (NTRS)

Ghosh, Tushar K.; Quiocho, Leslie J.

2013-01-01

This paper presents development of a generic recursive Order-N algorithm for systems with rigid and flexible bodies, in tree or closed-loop topology, with N being the number of bodies of the system. Simulation results are presented for several test cases to verify and evaluate the performance of the code compared to an existing efficient dense mass matrix-based code. The comparison brought out situations where Order-N or mass matrix-based algorithms could be useful.

Lord-Wingersky Algorithm Version 2.0 for Hierarchical Item Factor Models with Applications in Test Scoring, Scale Alignment, and Model Fit Testing. CRESST Report 830

ERIC Educational Resources Information Center

Cai, Li

2013-01-01

Lord and Wingersky's (1984) recursive algorithm for creating summed score based likelihoods and posteriors has a proven track record in unidimensional item response theory (IRT) applications. Extending the recursive algorithm to handle multidimensionality is relatively simple, especially with fixed quadrature because the recursions can be defined…

Self-tuning regulators for multicyclic control of helicopter vibration

NASA Technical Reports Server (NTRS)

Johnson, W.

1982-01-01

A class of algorithms for the multicyclic control of helicopter vibration and loads is derived and discussed. This class is characterized by a linear, quasi-static, frequency-domain model of the helicopter response to control; identification of the helicopter model by least-squared-error or Kalman filter methods; and a minimum variance or quadratic performance function controller. Previous research on such controllers is reviewed. The derivations and discussions cover the helicopter model; the identification problem, including both off-line and on-line (recursive) algorithms; the control problem, including both open-loop and closed-loop feedback; and the various regulator configurations possible within this class. Conclusions from analysis and numerical simulations of the regulators provide guidance in the design and selection of algorithms for further development, including wind tunnel and flight tests.

All two-loop maximally helicity-violating amplitudes in multi-Regge kinematics from applied symbology

NASA Astrophysics Data System (ADS)

Prygarin, Alexander; Spradlin, Marcus; Vergu, Cristian; Volovich, Anastasia

2012-04-01

Recent progress on scattering amplitudes has benefited from the mathematical technology of symbols for efficiently handling the types of polylogarithm functions which frequently appear in multiloop computations. The symbol for all two-loop maximally helicity violating amplitudes in planar supersymmetric Yang-Mills theory is known, but explicit analytic formulas for the amplitudes are hard to come by except in special limits where things simplify, such as multi-Regge kinematics. By applying symbology we obtain a formula for the leading behavior of the imaginary part (the Mandelstam cut contribution) of this amplitude in multi-Regge kinematics for any number of gluons. Our result predicts a simple recursive structure which agrees with a direct Balitsky-Fadin-Kuraev-Lipatov computation carried out in a parallel publication.

Self-medication among traumatized youth: structural equation modeling of pathways between trauma history, substance misuse, and psychological distress

PubMed Central

Pettus-Davis, Carrie; Howard, Matthew O.

2012-01-01

In an effort to self-medicate psychological distress stemming from exposure to traumatic life events, at-risk youth may be likely to seek intoxication via substance use. Concomitantly, self-medication with psychoactive substances is theorized to confer risk of developing future psychiatric and substance use disorders. The present study employed structural equation modeling to examine self-medication among a sample of 723 youth in residential treatment for antisocial behavior via recursive and non-recursive relationships between trauma history, substance misuse, and psychological distress. Results supported study hypotheses that: (a) the effects of trauma history on psychological distress are partially mediated by substance misuse, and (b) exposure to traumatic life events drives a feedback loop between substance misuse and psychological distress. Findings from this large-scale survey of adolescents exhibiting behavioral dysfunction suggest that identification of self-medication processes among traumatized youth may be crucial for developing targeted prevention and treatment initiatives. PMID:22454227

Adaptive control of large space structures using recursive lattice filters

NASA Technical Reports Server (NTRS)

Goglia, G. L.

1985-01-01

The use of recursive lattice filters for identification and adaptive control of large space structures was studied. Lattice filters are used widely in the areas of speech and signal processing. Herein, they are used to identify the structural dynamics model of the flexible structures. This identified model is then used for adaptive control. Before the identified model and control laws are integrated, the identified model is passed through a series of validation procedures and only when the model passes these validation procedures control is engaged. This type of validation scheme prevents instability when the overall loop is closed. The results obtained from simulation were compared to those obtained from experiments. In this regard, the flexible beam and grid apparatus at the Aerospace Control Research Lab (ACRL) of NASA Langley Research Center were used as the principal candidates for carrying out the above tasks. Another important area of research, namely that of robust controller synthesis, was investigated using frequency domain multivariable controller synthesis methods.

Recursive Fact-finding: A Streaming Approach to Truth Estimation in Crowdsourcing Applications

DTIC Science & Technology

2013-07-01

are reported over the course of the campaign, lending themselves better to the abstraction of a data stream arriving from the community of sources. In...EM Recursive EM Figure 4. Recursive EM Algorithm Convergence V. RELATED WORK Social sensing which is also referred to as human- centric sensing [4...systems, where different sources offer reviews on products (or brands, companies) they have experienced [16]. Customers are affected by those reviews

Distinctive signatures of recursion.

PubMed

Martins, Maurício Dias

2012-07-19

Although recursion has been hypothesized to be a necessary capacity for the evolution of language, the multiplicity of definitions being used has undermined the broader interpretation of empirical results. I propose that only a definition focused on representational abilities allows the prediction of specific behavioural traits that enable us to distinguish recursion from non-recursive iteration and from hierarchical embedding: only subjects able to represent recursion, i.e. to represent different hierarchical dependencies (related by parenthood) with the same set of rules, are able to generalize and produce new levels of embedding beyond those specified a priori (in the algorithm or in the input). The ability to use such representations may be advantageous in several domains: action sequencing, problem-solving, spatial navigation, social navigation and for the emergence of conventionalized communication systems. The ability to represent contiguous hierarchical levels with the same rules may lead subjects to expect unknown levels and constituents to behave similarly, and this prior knowledge may bias learning positively. Finally, a new paradigm to test for recursion is presented. Preliminary results suggest that the ability to represent recursion in the spatial domain recruits both visual and verbal resources. Implications regarding language evolution are discussed.

Adaptive identification and control of structural dynamics systems using recursive lattice filters

NASA Technical Reports Server (NTRS)

Sundararajan, N.; Montgomery, R. C.; Williams, J. P.

1985-01-01

A new approach for adaptive identification and control of structural dynamic systems by using least squares lattice filters thar are widely used in the signal processing area is presented. Testing procedures for interfacing the lattice filter identification methods and modal control method for stable closed loop adaptive control are presented. The methods are illustrated for a free-free beam and for a complex flexible grid, with the basic control objective being vibration suppression. The approach is validated by using both simulations and experimental facilities available at the Langley Research Center.

Control of linear uncertain systems utilizing mismatched state observers

NASA Technical Reports Server (NTRS)

Goldstein, B.

1972-01-01

The control of linear continuous dynamical systems is investigated as a problem of limited state feedback control. The equations which describe the structure of an observer are developed constrained to time-invarient systems. The optimal control problem is formulated, accounting for the uncertainty in the design parameters. Expressions for bounds on closed loop stability are also developed. The results indicate that very little uncertainty may be tolerated before divergence occurs in the recursive computation algorithms, and the derived stability bound yields extremely conservative estimates of regions of allowable parameter variations.

Positivity, Grassmannian geometry and simplex-like structures of scattering amplitudes

NASA Astrophysics Data System (ADS)

Rao, Junjie

2017-12-01

This article revisits and elaborates the significant role of positive geometry of momentum twistor Grassmannian for planar N=4 SYM scattering amplitudes. First we establish the fundamentals of positive Grassmannian geometry for tree amplitudes, including the ubiquitous Plücker coordinates and the representation of reduced Grassmannian geometry. Then we formulate this subject, without making reference to on-shell diagrams and decorated permutations, around these four major facets: 1. Deriving the tree and 1-loop BCFW recursion relations solely from positivity, after introducing the simple building blocks called positive components for a positive matrix. 2. Applying Grassmannian geometry and Plücker coordinates to determine the signs of N2MHV homological identities, which interconnect various Yangian invariants. It reveals that most of the signs are in fact the secret incarnation of the simple 6-term NMHV identity. 3. Deriving the stacking positivity relation, which is powerful for parameterizing matrix representatives in terms of positive variables in the d log form. It will be used with the reduced Grassmannian geometry representation to produce the positive matrix of a given geometric configuration, which is an independent approach besides the combinatoric way involving a sequence of BCFW bridges. 4. Introducing an elegant and highly refined formalism of BCFW recursion relation for tree amplitudes, which reveals its two-fold simplex-like structures. First, the BCFW contour in terms of (reduced) Grassmannian geometry representatives is delicately dissected into a triangle-shape sum, as only a small fraction of the sum needs to be explicitly identified. Second, this fraction can be further dissected, according to different growing modes with corresponding growing parameters. The growing modes possess the shapes of solid simplices of various dimensions, with which infinite number of BCFW cells can be entirely captured by the characteristic objects called fully-spanning cells. We find that for a given k, beyond n =4 k+1 there is no more new fully-spanning cell, which signifies the essential termination of the recursive growth of BCFW cells. As n increases beyond the termination point, the BCFW contour simply replicates itself according to the simplex-like patterns, which enables us to master all BCFW cells once for all without actually identifying most of them.

Learning from ISS-modular adaptive NN control of nonlinear strict-feedback systems.

PubMed

Wang, Cong; Wang, Min; Liu, Tengfei; Hill, David J

2012-10-01

This paper studies learning from adaptive neural control (ANC) for a class of nonlinear strict-feedback systems with unknown affine terms. To achieve the purpose of learning, a simple input-to-state stability (ISS) modular ANC method is first presented to ensure the boundedness of all the signals in the closed-loop system and the convergence of tracking errors in finite time. Subsequently, it is proven that learning with the proposed stable ISS-modular ANC can be achieved. The cascade structure and unknown affine terms of the considered systems make it very difficult to achieve learning using existing methods. To overcome these difficulties, the stable closed-loop system in the control process is decomposed into a series of linear time-varying (LTV) perturbed subsystems with the appropriate state transformation. Using a recursive design, the partial persistent excitation condition for the radial basis function neural network (NN) is established, which guarantees exponential stability of LTV perturbed subsystems. Consequently, accurate approximation of the closed-loop system dynamics is achieved in a local region along recurrent orbits of closed-loop signals, and learning is implemented during a closed-loop feedback control process. The learned knowledge is reused to achieve stability and an improved performance, thereby avoiding the tremendous repeated training process of NNs. Simulation studies are given to demonstrate the effectiveness of the proposed method.

Recursive analytical solution describing artificial satellite motion perturbed by an arbitrary number of zonal terms

NASA Technical Reports Server (NTRS)

Mueller, A. C.

1977-01-01

An analytical first order solution has been developed which describes the motion of an artificial satellite perturbed by an arbitrary number of zonal harmonics of the geopotential. A set of recursive relations for the solution, which was deduced from recursive relations of the geopotential, was derived. The method of solution is based on Von-Zeipel's technique applied to a canonical set of two-body elements in the extended phase space which incorporates the true anomaly as a canonical element. The elements are of Poincare type, that is, they are regular for vanishing eccentricities and inclinations. Numerical results show that this solution is accurate to within a few meters after 500 revolutions.

Theory of Mind Development in Adolescence and Early Adulthood: The Growing Complexity of Recursive Thinking Ability

PubMed Central

Valle, Annalisa; Massaro, Davide; Castelli, Ilaria; Marchetti, Antonella

2015-01-01

This study explores the development of theory of mind, operationalized as recursive thinking ability, from adolescence to early adulthood (N = 110; young adolescents = 47; adolescents = 43; young adults = 20). The construct of theory of mind has been operationalized in two different ways: as the ability to recognize the correct mental state of a character, and as the ability to attribute the correct mental state in order to predict the character’s behaviour. The Imposing Memory Task, with five recursive thinking levels, and a third-order false-belief task with three recursive thinking levels (devised for this study) have been used. The relationship among working memory, executive functions, and linguistic skills are also analysed. Results show that subjects exhibit less understanding of elevated recursive thinking levels (third, fourth, and fifth) compared to the first and second levels. Working memory is correlated with total recursive thinking, whereas performance on the linguistic comprehension task is related to third level recursive thinking in both theory of mind tasks. An effect of age on third-order false-belief task performance was also found. A key finding of the present study is that the third-order false-belief task shows significant age differences in the application of recursive thinking that involves the prediction of others’ behaviour. In contrast, such an age effect is not observed in the Imposing Memory Task. These results may support the extension of the investigation of the third order false belief after childhood. PMID:27247645

Recursive computation of mutual potential between two polyhedra

NASA Astrophysics Data System (ADS)

Hirabayashi, Masatoshi; Scheeres, Daniel J.

2013-11-01

Recursive computation of mutual potential, force, and torque between two polyhedra is studied. Based on formulations by Werner and Scheeres (Celest Mech Dyn Astron 91:337-349, 2005) and Fahnestock and Scheeres (Celest Mech Dyn Astron 96:317-339, 2006) who applied the Legendre polynomial expansion to gravity interactions and expressed each order term by a shape-dependent part and a shape-independent part, this paper generalizes the computation of each order term, giving recursive relations of the shape-dependent part. To consider the potential, force, and torque, we introduce three tensors. This method is applicable to any multi-body systems. Finally, we implement this recursive computation to simulate the dynamics of a two rigid-body system that consists of two equal-sized parallelepipeds.

Three applications of a bonus relation for gravity amplitudes

NASA Astrophysics Data System (ADS)

Spradlin, Marcus; Volovich, Anastasia; Wen, Congkao

2009-04-01

Arkani-Hamed et al. have recently shown that all tree-level scattering amplitudes in maximal supergravity exhibit exceptionally soft behavior when two supermomenta are taken to infinity in a particular complex direction, and that this behavior implies new non-trivial relations amongst amplitudes in addition to the well-known on-shell recursion relations. We consider the application of these new 'bonus relations' to MHV amplitudes, showing that they can be used quite generally to relate (n - 2) !-term formulas typically obtained from recursion relations to (n - 3) !-term formulas related to the original BGK conjecture. Specifically we provide (1) a direct proof of a formula presented by Elvang and Freedman, (2) a new formula based on one due to Bedford et al., and (3) an alternate proof of a formula recently obtained by Mason and Skinner. Our results also provide the first direct proof that the conjectured BGK formula, only very recently proven via completely different methods, satisfies the on-shell recursion.

Computation of transform domain covariance matrices

NASA Technical Reports Server (NTRS)

Fino, B. J.; Algazi, V. R.

1975-01-01

It is often of interest in applications to compute the covariance matrix of a random process transformed by a fast unitary transform. Here, the recursive definition of fast unitary transforms is used to derive recursive relations for the covariance matrices of the transformed process. These relations lead to fast methods of computation of covariance matrices and to substantial reductions of the number of arithmetic operations required.

Condensate statistics and thermodynamics of weakly interacting Bose gas: Recursion relation approach

NASA Astrophysics Data System (ADS)

Dorfman, K. E.; Kim, M.; Svidzinsky, A. A.

2011-03-01

We study condensate statistics and thermodynamics of weakly interacting Bose gas with a fixed total number N of particles in a cubic box. We find the exact recursion relation for the canonical ensemble partition function. Using this relation, we calculate the distribution function of condensate particles for N=200. We also calculate the distribution function based on multinomial expansion of the characteristic function. Similar to the ideal gas, both approaches give exact statistical moments for all temperatures in the framework of Bogoliubov model. We compare them with the results of unconstraint canonical ensemble quasiparticle formalism and the hybrid master equation approach. The present recursion relation can be used for any external potential and boundary conditions. We investigate the temperature dependence of the first few statistical moments of condensate fluctuations as well as thermodynamic potentials and heat capacity analytically and numerically in the whole temperature range.

Contribution of zonal harmonics to gravitational moment

NASA Technical Reports Server (NTRS)

Roithmayr, Carlos M.

1991-01-01

It is presently demonstrated that a recursive vector-dyadic expression for the contribution of a zonal harmonic of degree n to the gravitational moment about a small body's center-of-mass is obtainable with a procedure that involves twice differentiating a celestial body's gravitational potential with respect to a vector. The recursive property proceeds from taking advantage of a recursion relation for Legendre polynomials which appear in the gravitational potential. The contribution of the zonal harmonic of degree 2 is consistent with the gravitational moment exerted by an oblate spheroid.

Contribution of zonal harmonics to gravitational moment

NASA Astrophysics Data System (ADS)

Roithmayr, Carlos M.

1991-02-01

It is presently demonstrated that a recursive vector-dyadic expression for the contribution of a zonal harmonic of degree n to the gravitational moment about a small body's center-of-mass is obtainable with a procedure that involves twice differentiating a celestial body's gravitational potential with respect to a vector. The recursive property proceeds from taking advantage of a recursion relation for Legendre polynomials which appear in the gravitational potential. The contribution of the zonal harmonic of degree 2 is consistent with the gravitational moment exerted by an oblate spheroid.

Deciding Termination for Ancestor Match- Bounded String Rewriting Systems

NASA Technical Reports Server (NTRS)

Geser, Alfons; Hofbauer, Dieter; Waldmann, Johannes

2005-01-01

Termination of a string rewriting system can be characterized by termination on suitable recursively defined languages. This kind of termination criteria has been criticized for its lack of automation. In an earlier paper we have shown how to construct an automated termination criterion if the recursion is aligned with the rewrite relation. We have demonstrated the technique with Dershowitz's forward closure criterion. In this paper we show that a different approach is suitable when the recursion is aligned with the inverse of the rewrite relation. We apply this idea to Kurth's ancestor graphs and obtain ancestor match-bounded string rewriting systems. Termination is shown to be decidable for this class. The resulting method improves upon those based on match-boundedness or inverse match-boundedness.

Recursion and the Competence/Performance Distinction in AGL Tasks

ERIC Educational Resources Information Center

Lobina, David J.

2011-01-01

The term "recursion" is used in at least four distinct theoretical senses within cognitive science. Some of these senses in turn relate to the different levels of analysis described by David Marr some 20 years ago; namely, the underlying competence capacity (the "computational" level), the performance operations used in real-time processing (the…

Experiments with recursive estimation in astronomical image processing

NASA Technical Reports Server (NTRS)

Busko, I.

1992-01-01

Recursive estimation concepts were applied to image enhancement problems since the 70's. However, very few applications in the particular area of astronomical image processing are known. These concepts were derived, for 2-dimensional images, from the well-known theory of Kalman filtering in one dimension. The historic reasons for application of these techniques to digital images are related to the images' scanned nature, in which the temporal output of a scanner device can be processed on-line by techniques borrowed directly from 1-dimensional recursive signal analysis. However, recursive estimation has particular properties that make it attractive even in modern days, when big computer memories make the full scanned image available to the processor at any given time. One particularly important aspect is the ability of recursive techniques to deal with non-stationary phenomena, that is, phenomena which have their statistical properties variable in time (or position in a 2-D image). Many image processing methods make underlying stationary assumptions either for the stochastic field being imaged, for the imaging system properties, or both. They will underperform, or even fail, when applied to images that deviate significantly from stationarity. Recursive methods, on the contrary, make it feasible to perform adaptive processing, that is, to process the image by a processor with properties tuned to the image's local statistical properties. Recursive estimation can be used to build estimates of images degraded by such phenomena as noise and blur. We show examples of recursive adaptive processing of astronomical images, using several local statistical properties to drive the adaptive processor, as average signal intensity, signal-to-noise and autocorrelation function. Software was developed under IRAF, and as such will be made available to interested users.

Hybrid recursive active filters for duplexing in RF transmitter front-ends

NASA Astrophysics Data System (ADS)

Gottardo, Giuseppe; Donati, Giovanni; Musolff, Christian; Fischer, Georg; Felgentreff, Tilman

2016-08-01

Duplex filters in modern base transceiver stations shape the channel in order to perform common frequency division duplex operations. Usually, they are designed as cavity filters, which are expensive and have large dimensions. Thanks to the emerging digital technology and fast digital converters, it is possible to transfer the efforts of designing analog duplex filters into digital numeric algorithms applied to feedback structures, operating on power. This solution provides the shaping of the signal spectrum directly at the output of the radio frequency (RF) power amplifiers (PAs) relaxing the transmitter design especially in the duplexer and in the antenna sections. The design of a digital baseband feedback applied to the analog power RF amplifiers (hybrid filter) is presented and verified by measurements. A model to describe the hybrid system is investigated, and the relation between phase and resonance peaks of the resulting periodic band-pass transfer function is described. The stability condition of the system is analyzed using Nyquist criterion. A solution involving a number of digital feedback and forward branches is investigated defining the parameters of the recursive structure. This solution allows the closed loop system to show a periodic band pass with up to 500 kHz bandwidth at the output of the RF amplifier. The band-pass magnitude reaches up to 17 dB selectivity. The rejection of the PA noise in the out-of-band frequencies is verified by measurements. The filter is tested with a modulated LTE (Long Term Evolution) signal showing an ACPR (Adjacent Channel Power Ratio) enhancement of 10 dB of the transmitted signal.

Distributed flow sensing for closed-loop speed control of a flexible fish robot.

PubMed

Zhang, Feitian; Lagor, Francis D; Yeo, Derrick; Washington, Patrick; Paley, Derek A

2015-10-23

Flexibility plays an important role in fish behavior by enabling high maneuverability for predator avoidance and swimming in turbulent flow. This paper presents a novel flexible fish robot equipped with distributed pressure sensors for flow sensing. The body of the robot is molded from soft, hyperelastic material, which provides flexibility. Its Joukowski-foil shape is conducive to modeling the fluid analytically. A quasi-steady potential-flow model is adopted for real-time flow estimation, whereas a discrete-time vortex-shedding flow model is used for higher-fidelity simulation. The dynamics for the flexible fish robot yield a reduced model for one-dimensional swimming. A recursive Bayesian filter assimilates pressure measurements to estimate flow speed, angle of attack, and foil camber. The closed-loop speed-control strategy combines an inverse-mapping feedforward controller based on an average model derived for periodic actuation of angle-of-attack and a proportional-integral feedback controller utilizing the estimated flow information. Simulation and experimental results are presented to show the effectiveness of the estimation and control strategy. The paper provides a systematic approach to distributed flow sensing for closed-loop speed control of a flexible fish robot by regulating the flapping amplitude.

Motion adaptive Kalman filter for super-resolution

NASA Astrophysics Data System (ADS)

Richter, Martin; Nasse, Fabian; Schröder, Hartmut

2011-01-01

Superresolution is a sophisticated strategy to enhance image quality of both low and high resolution video, performing tasks like artifact reduction, scaling and sharpness enhancement in one algorithm, all of them reconstructing high frequency components (above Nyquist frequency) in some way. Especially recursive superresolution algorithms can fulfill high quality aspects because they control the video output using a feed-back loop and adapt the result in the next iteration. In addition to excellent output quality, temporal recursive methods are very hardware efficient and therefore even attractive for real-time video processing. A very promising approach is the utilization of Kalman filters as proposed by Farsiu et al. Reliable motion estimation is crucial for the performance of superresolution. Therefore, robust global motion models are mainly used, but this also limits the application of superresolution algorithm. Thus, handling sequences with complex object motion is essential for a wider field of application. Hence, this paper proposes improvements by extending the Kalman filter approach using motion adaptive variance estimation and segmentation techniques. Experiments confirm the potential of our proposal for ideal and real video sequences with complex motion and further compare its performance to state-of-the-art methods like trainable filters.

P-HARP: A parallel dynamic spectral partitioner

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

Sohn, A.; Biswas, R.; Simon, H.D.

1997-05-01

Partitioning unstructured graphs is central to the parallel solution of problems in computational science and engineering. The authors have introduced earlier the sequential version of an inertial spectral partitioner called HARP which maintains the quality of recursive spectral bisection (RSB) while forming the partitions an order of magnitude faster than RSB. The serial HARP is known to be the fastest spectral partitioner to date, three to four times faster than similar partitioners on a variety of meshes. This paper presents a parallel version of HARP, called P-HARP. Two types of parallelism have been exploited: loop level parallelism and recursive parallelism.more » P-HARP has been implemented in MPI on the SGI/Cray T3E and the IBM SP2. Experimental results demonstrate that P-HARP can partition a mesh of over 100,000 vertices into 256 partitions in 0.25 seconds on a 64-processor T3E. Experimental results further show that P-HARP can give nearly a 20-fold speedup on 64 processors. These results indicate that graph partitioning is no longer a major bottleneck that hinders the advancement of computational science and engineering for dynamically-changing real-world applications.« less

Dissociative Electron Attachment to Rovibrationally Excited Molecules

DTIC Science & Technology

1987-08-31

obtained in some recent papers.4’ - In Sec. IV of the present L,(0, (00 paper we will obtain some general recursion relations among where these matrix... general five-term From the generating function of Hermite polynomials , recursion relation (32) is obtained which is valid for the matrix elements of...for the generation of the functions for increasing 1. One convenient way to evaluate a Q, function is to write it in terms of Gaussian hypergeometric

Nonplanar on-shell diagrams and leading singularities of scattering amplitudes

NASA Astrophysics Data System (ADS)

Chen, Baoyi; Chen, Gang; Cheung, Yeuk-Kwan E.; Li, Yunxuan; Xie, Ruofei; Xin, Yuan

2017-02-01

Bipartite on-shell diagrams are the latest tool in constructing scattering amplitudes. In this paper we prove that a Britto-Cachazo-Feng-Witten (BCFW) decomposable on-shell diagram process a rational top form if and only if the algebraic ideal comprised the geometrical constraints are shifted linearly during successive BCFW integrations. With a proper geometric interpretation of the constraints in the Grassmannian manifold, the rational top form integration contours can thus be obtained, and understood, in a straightforward way. All rational top form integrands of arbitrary higher loops leading singularities can therefore be derived recursively, as long as the corresponding on-shell diagram is BCFW decomposable.

Zimmermann's forest formula, infrared divergences and the QCD beta function

NASA Astrophysics Data System (ADS)

Herzog, Franz

2018-01-01

We review Zimmermann's forest formula, which solves Bogoliubov's recursive R-operation for the subtraction of ultraviolet divergences in perturbative Quantum Field Theory. We further discuss a generalisation of the R-operation which subtracts besides ultraviolet also Euclidean infrared divergences. This generalisation, which goes under the name of the R*-operation, can be used efficiently to compute renormalisation constants. We will discuss several results obtained by this method with focus on the QCD beta function at five loops as well as the application to hadronic Higgs boson decay rates at N4LO. This article summarizes a talk given at the Wolfhart Zimmermann Memorial Symposium.

Finite-time stabilisation of a class of switched nonlinear systems with state constraints

NASA Astrophysics Data System (ADS)

Huang, Shipei; Xiang, Zhengrong

2018-06-01

This paper investigates the finite-time stabilisation for a class of switched nonlinear systems with state constraints. Some power orders of the system are allowed to be ratios of positive even integers over odd integers. A Barrier Lyapunov function is introduced to guarantee that the state constraint is not violated at any time. Using the convex combination method and a recursive design approach, a state-dependent switching law and state feedback controllers of individual subsystems are constructed such that the closed-loop system is finite-time stable without violation of the state constraint. Two examples are provided to show the effectiveness of the proposed method.

AEKF-SLAM: A New Algorithm for Robotic Underwater Navigation

PubMed Central

Yuan, Xin; Martínez-Ortega, José-Fernán; Fernández, José Antonio Sánchez; Eckert, Martina

2017-01-01

In this work, we focus on key topics related to underwater Simultaneous Localization and Mapping (SLAM) applications. Moreover, a detailed review of major studies in the literature and our proposed solutions for addressing the problem are presented. The main goal of this paper is the enhancement of the accuracy and robustness of the SLAM-based navigation problem for underwater robotics with low computational costs. Therefore, we present a new method called AEKF-SLAM that employs an Augmented Extended Kalman Filter (AEKF)-based SLAM algorithm. The AEKF-based SLAM approach stores the robot poses and map landmarks in a single state vector, while estimating the state parameters via a recursive and iterative estimation-update process. Hereby, the prediction and update state (which exist as well in the conventional EKF) are complemented by a newly proposed augmentation stage. Applied to underwater robot navigation, the AEKF-SLAM has been compared with the classic and popular FastSLAM 2.0 algorithm. Concerning the dense loop mapping and line mapping experiments, it shows much better performances in map management with respect to landmark addition and removal, which avoid the long-term accumulation of errors and clutters in the created map. Additionally, the underwater robot achieves more precise and efficient self-localization and a mapping of the surrounding landmarks with much lower processing times. Altogether, the presented AEKF-SLAM method achieves reliably map revisiting, and consistent map upgrading on loop closure. PMID:28531135

Expansion of all multitrace tree level EYM amplitudes

NASA Astrophysics Data System (ADS)

Du, Yi-Jian; Feng, Bo; Teng, Fei

2017-12-01

In this paper, we investigate the expansion of tree level multitrace Einstein-Yang-Mills (EYM) amplitudes. First, we propose two types of recursive expansions of tree level EYM amplitudes with an arbitrary number of gluons, gravitons and traces by those amplitudes with fewer traces or/and gravitons. Then we give many support evidence, including proofs using the Cachazo-He-Yuan (CHY) formula and Britto-Cachazo-Feng-Witten (BCFW) recursive relation. As a byproduct, two types of generalized BCJ relations for multitrace EYM are further proposed, which will be useful in the BCFW proof. After one applies the recursive expansions repeatedly, any multitrace EYM amplitudes can be given in the Kleiss-Kuijf (KK) basis of tree level color ordered Yang-Mills (YM) amplitudes. Thus the Bern-Carrasco-Johansson (BCJ) numerators, as the expansion coefficients, for all multitrace EYM amplitudes are naturally constructed.

Aspects of holography

NASA Astrophysics Data System (ADS)

Kaplan, Jared Daniel

The principle of holography---that theories of gravity should be described in terms of their boundaries---has been the driving force behind many great strides in quantum gravity, gauge theory, and even in phenomenology. The most concrete example of holographic duality is the AdS/CFT correspondence, which relates quantum gravity in Anti-deSitter space to a Conformal Field Theory in Minkowski space. In this thesis we begin with a chapter on black holes in the AdS/CFT duality, and then move on to the main line of development, where we describe the exciting first steps towards the discovery of a holographic duality for quantum gravity in flat spacetime. A holographic description of flat spacetime would be a theory of the Scattering Matrix, which contains the quantum mechanical amplitudes that determine how incoming states from past infinity scatter into outgoing states at future infinity. We suspect that a holographic duality between a local spacetime description of quantum gravity and a non-local boundary description of the S-Matrix would be a weak coupling-weak coupling duality. We work towards this concrete goal from the bottom up by studying new methods for computing scattering amplitudes. We begin by studying the BCFW Recursion Relations, which are an explicitly non-local, boundary oriented method for computing tree-level scattering amplitudes. We give an elementary derivation of these relations for general theories in any number of dimensions, showing that their existence is a deep feature of field theory. Next we argue that, counter to naive expectations, N = 8 Supergravity may be the simplest quantum field theory. We demonstrate this by explicitly solving its one-loop S-Matrix with techniques that rely on our understanding of tree amplitudes to vastly simplify calculations. Finally, we show that the BCFW recursion relations find their natural home in Twistor Space, where it is possible to formulate classical scattering theory in a beautiful and manifestly holographic way. This investigation takes us beyond the BCFW relations; it suggests that scattering amplitudes can be calculated in terms of holographic "words" whose "grammar" has yet to be uncovered.

Lord-Wingersky Algorithm Version 2.0 for Hierarchical Item Factor Models with Applications in Test Scoring, Scale Alignment, and Model Fit Testing.

PubMed

Cai, Li

2015-06-01

Lord and Wingersky's (Appl Psychol Meas 8:453-461, 1984) recursive algorithm for creating summed score based likelihoods and posteriors has a proven track record in unidimensional item response theory (IRT) applications. Extending the recursive algorithm to handle multidimensionality is relatively simple, especially with fixed quadrature because the recursions can be defined on a grid formed by direct products of quadrature points. However, the increase in computational burden remains exponential in the number of dimensions, making the implementation of the recursive algorithm cumbersome for truly high-dimensional models. In this paper, a dimension reduction method that is specific to the Lord-Wingersky recursions is developed. This method can take advantage of the restrictions implied by hierarchical item factor models, e.g., the bifactor model, the testlet model, or the two-tier model, such that a version of the Lord-Wingersky recursive algorithm can operate on a dramatically reduced set of quadrature points. For instance, in a bifactor model, the dimension of integration is always equal to 2, regardless of the number of factors. The new algorithm not only provides an effective mechanism to produce summed score to IRT scaled score translation tables properly adjusted for residual dependence, but leads to new applications in test scoring, linking, and model fit checking as well. Simulated and empirical examples are used to illustrate the new applications.

Method for implementation of recursive hierarchical segmentation on parallel computers

NASA Technical Reports Server (NTRS)

Tilton, James C. (Inventor)

2005-01-01

A method, computer readable storage, and apparatus for implementing a recursive hierarchical segmentation algorithm on a parallel computing platform. The method includes setting a bottom level of recursion that defines where a recursive division of an image into sections stops dividing, and setting an intermediate level of recursion where the recursive division changes from a parallel implementation into a serial implementation. The segmentation algorithm is implemented according to the set levels. The method can also include setting a convergence check level of recursion with which the first level of recursion communicates with when performing a convergence check.

Is recursion language-specific? Evidence of recursive mechanisms in the structure of intentional action.

PubMed

Vicari, Giuseppe; Adenzato, Mauro

2014-05-01

In their 2002 seminal paper Hauser, Chomsky and Fitch hypothesize that recursion is the only human-specific and language-specific mechanism of the faculty of language. While debate focused primarily on the meaning of recursion in the hypothesis and on the human-specific and syntax-specific character of recursion, the present work focuses on the claim that recursion is language-specific. We argue that there are recursive structures in the domain of motor intentionality by way of extending John R. Searle's analysis of intentional action. We then discuss evidence from cognitive science and neuroscience supporting the claim that motor-intentional recursion is language-independent and suggest some explanatory hypotheses: (1) linguistic recursion is embodied in sensory-motor processing; (2) linguistic and motor-intentional recursions are distinct and mutually independent mechanisms. Finally, we propose some reflections about the epistemic status of HCF as presenting an empirically falsifiable hypothesis, and on the possibility of testing recursion in different cognitive domains. Copyright © 2014 Elsevier Inc. All rights reserved.

Relatively Recursive Rational Choice.

DTIC Science & Technology

1981-11-01

for the decision procedure of recursively representable rational choice. Alternatively phrased, we wish to inquire into its degrees of unsolvability. We...may first make the observation that there are three classic notions of reducibility of decision procedures for subsets of the natural numbers... rational choice function defined as an effectively computable represent- ation of Richter’s [1971] concept of rational choice, attains by means of an

Practical recursive solution of degenerate Rayleigh-Schroedinger perturbation theory and application to high-order calculations of the Zeeman effect in hydrogen

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

Silverstone, H.J.; Moats, R.K.

1981-04-01

With the aim of high-order calculations, a new recursive solution for the degenerate Rayleigh-Schroedinger perturbation-theory wave function and energy has been derived. The final formulas, chi/sup (N/)/sub sigma/ = R/sup () -sigma/summation/sup N/-1/sub k/ = 0 H/sup (sigma+1+k/)/sub sigma+1/chi/sup (N/-1-k), E/sup (N/+sigma) = <0Vertical BarH/sup (N/+sigma)/sub sigma+1/Vertical Bar0> + < 0Vertical Barsummation/sup N/-2/sub k/ = 0H/sup (sigma+1+k/)/sub sigma+1/ Vertical Barchi/sup (N/-1-k)>,which involve new Hamiltonian-related operators H/sup (sigma+k/)/sub sigma/ and H/sup( sigma+k/)/sub sigma/, strongly resemble the standard nondegenerate recursive formulas. As an illustration, the perturbed energy coefficients for the 3s-3d/sub 0/ states of hydrogen in the Zeeman effect have been calculatedmore » recursively through 87th order in the square of the magnetic field. Our treatment is compared with that of Hirschfelder and Certain (J. Chem. Phys. 60, 1118 (1974)), and some relative advantages of each are pointed out.« less

Recursion equations in predicting band width under gradient elution.

PubMed

Liang, Heng; Liu, Ying

2004-06-18

The evolution of solute zone under gradient elution is a typical problem of non-linear continuity equation since the local diffusion coefficient and local migration velocity of the mass cells of solute zones are the functions of position and time due to space- and time-variable mobile phase composition. In this paper, based on the mesoscopic approaches (Lagrangian description, the continuity theory and the local equilibrium assumption), the evolution of solute zones in space- and time-dependent fields is described by the iterative addition of local probability density of the mass cells of solute zones. Furthermore, on macroscopic levels, the recursion equations have been proposed to simulate zone migration and spreading in reversed-phase high-performance liquid chromatography (RP-HPLC) through directly relating local retention factor and local diffusion coefficient to local mobile phase concentration. This new approach differs entirely from the traditional theories on plate concept with Eulerian description, since band width recursion equation is actually the accumulation of local diffusion coefficients of solute zones to discrete-time slices. Recursion equations and literature equations were used in dealing with same experimental data in RP-HPLC, and the comparison results show that the recursion equations can accurately predict band width under gradient elution.

Recent developments in learning control and system identification for robots and structures

NASA Technical Reports Server (NTRS)

Phan, M.; Juang, J.-N.; Longman, R. W.

1990-01-01

This paper reviews recent results in learning control and learning system identification, with particular emphasis on discrete-time formulation, and their relation to adaptive theory. Related continuous-time results are also discussed. Among the topics presented are proportional, derivative, and integral learning controllers, time-domain formulation of discrete learning algorithms. Newly developed techniques are described including the concept of the repetition domain, and the repetition domain formulation of learning control by linear feedback, model reference learning control, indirect learning control with parameter estimation, as well as related basic concepts, recursive and non-recursive methods for learning identification.

Recursive-operator method in vibration problems for rod systems

NASA Astrophysics Data System (ADS)

Rozhkova, E. V.

2009-12-01

Using linear differential equations with constant coefficients describing one-dimensional dynamical processes as an example, we show that the solutions of these equations and systems are related to the solution of the corresponding numerical recursion relations and one does not have to compute the roots of the corresponding characteristic equations. The arbitrary functions occurring in the general solution of the homogeneous equations are determined by the initial and boundary conditions or are chosen from various classes of analytic functions. The solutions of the inhomogeneous equations are constructed in the form of integro-differential series acting on the right-hand side of the equation, and the coefficients of the series are determined from the same recursion relations. The convergence of formal solutions as series of a more general recursive-operator construction was proved in [1]. In the special case where the solutions of the equation can be represented in separated variables, the power series can be effectively summed, i.e., expressed in terms of elementary functions, and coincide with the known solutions. In this case, to determine the natural vibration frequencies, one obtains algebraic rather than transcendental equations, which permits exactly determining the imaginary and complex roots of these equations without using the graphic method [2, pp. 448-449]. The correctness of the obtained formulas (differentiation formulas, explicit expressions for the series coefficients, etc.) can be verified directly by appropriate substitutions; therefore, we do not prove them here.

Methods for assessing movement path recursion with application to African buffalo in South Africa

USGS Publications Warehouse

Bar-David, S.; Bar-David, I.; Cross, P.C.; Ryan, S.J.; Knechtel, C.U.; Getz, W.M.

2009-01-01

Recent developments of automated methods for monitoring animal movement, e.g., global positioning systems (GPS) technology, yield high-resolution spatiotemporal data. To gain insights into the processes creating movement patterns, we present two new techniques for extracting information from these data on repeated visits to a particular site or patch ("recursions"). Identification of such patches and quantification of recursion pathways, when combined with patch-related ecological data, should contribute to our understanding of the habitat requirements of large herbivores, of factors governing their space-use patterns, and their interactions with the ecosystem. We begin by presenting output from a simple spatial model that simulates movements of large-herbivore groups based on minimal parameters: resource availability and rates of resource recovery after a local depletion. We then present the details of our new techniques of analyses (recursion analysis and circle analysis) and apply them to data generated by our model, as well as two sets of empirical data on movements of African buffalo (Syncerus coffer): the first collected in Klaserie Private Nature Reserve and the second in Kruger National Park, South Africa. Our recursion analyses of model outputs provide us with a basis for inferring aspects of the processes governing the production of buffalo recursion patterns, particularly the potential influence of resource recovery rate. Although the focus of our simulations was a comparison of movement patterns produced by different resource recovery rates, we conclude our paper with a comprehensive discussion of how recursion analyses can be used when appropriate ecological data are available to elucidate various factors influencing movement. Inter alia, these include the various limiting and preferred resources, parasites, and topographical and landscape factors. ?? 2009 by the Ecological Society of America.

Fermionic Approach to Weighted Hurwitz Numbers and Topological Recursion

NASA Astrophysics Data System (ADS)

Alexandrov, A.; Chapuy, G.; Eynard, B.; Harnad, J.

2017-12-01

A fermionic representation is given for all the quantities entering in the generating function approach to weighted Hurwitz numbers and topological recursion. This includes: KP and 2D Toda {τ} -functions of hypergeometric type, which serve as generating functions for weighted single and double Hurwitz numbers; the Baker function, which is expanded in an adapted basis obtained by applying the same dressing transformation to all vacuum basis elements; the multipair correlators and the multicurrent correlators. Multiplicative recursion relations and a linear differential system are deduced for the adapted bases and their duals, and a Christoffel-Darboux type formula is derived for the pair correlator. The quantum and classical spectral curves linking this theory with the topological recursion program are derived, as well as the generalized cut-and-join equations. The results are detailed for four special cases: the simple single and double Hurwitz numbers, the weakly monotone case, corresponding to signed enumeration of coverings, the strongly monotone case, corresponding to Belyi curves and the simplest version of quantum weighted Hurwitz numbers.

Fermionic Approach to Weighted Hurwitz Numbers and Topological Recursion

NASA Astrophysics Data System (ADS)

Alexandrov, A.; Chapuy, G.; Eynard, B.; Harnad, J.

2018-06-01

A fermionic representation is given for all the quantities entering in the generating function approach to weighted Hurwitz numbers and topological recursion. This includes: KP and 2 D Toda {τ} -functions of hypergeometric type, which serve as generating functions for weighted single and double Hurwitz numbers; the Baker function, which is expanded in an adapted basis obtained by applying the same dressing transformation to all vacuum basis elements; the multipair correlators and the multicurrent correlators. Multiplicative recursion relations and a linear differential system are deduced for the adapted bases and their duals, and a Christoffel-Darboux type formula is derived for the pair correlator. The quantum and classical spectral curves linking this theory with the topological recursion program are derived, as well as the generalized cut-and-join equations. The results are detailed for four special cases: the simple single and double Hurwitz numbers, the weakly monotone case, corresponding to signed enumeration of coverings, the strongly monotone case, corresponding to Belyi curves and the simplest version of quantum weighted Hurwitz numbers.

Generalized recursion relations for correlators in the gauge-gravity correspondence.

PubMed

Raju, Suvrat

2011-03-04

We show that a generalization of the Britto-Cachazo-Feng-Witten recursion relations gives a new and efficient method of computing correlation functions of the stress tensor or conserved currents in conformal field theories with an (d+1)-dimensional anti-de Sitter space dual, for d≥4, in the limit where the bulk theory is approximated by tree-level Yang-Mills theory or gravity. In supersymmetric theories, additional correlators of operators that live in the same multiplet as a conserved current or stress tensor can be computed by these means.

Constraint Embedding for Multibody System Dynamics

NASA Technical Reports Server (NTRS)

Jain, Abhinandan

2009-01-01

This paper describes a constraint embedding approach for the handling of local closure constraints in multibody system dynamics. The approach uses spatial operator techniques to eliminate local-loop constraints from the system and effectively convert the system into tree-topology systems. This approach allows the direct derivation of recursive O(N) techniques for solving the system dynamics and avoiding the expensive steps that would otherwise be required for handling the closedchain dynamics. The approach is very effective for systems where the constraints are confined to small-subgraphs within the system topology. The paper provides background on the spatial operator O(N) algorithms, the extensions for handling embedded constraints, and concludes with some examples of such constraints.

Constructing LDPC Codes from Loop-Free Encoding Modules

NASA Technical Reports Server (NTRS)

Divsalar, Dariush; Dolinar, Samuel; Jones, Christopher; Thorpe, Jeremy; Andrews, Kenneth

2009-01-01

A method of constructing certain low-density parity-check (LDPC) codes by use of relatively simple loop-free coding modules has been developed. The subclasses of LDPC codes to which the method applies includes accumulate-repeat-accumulate (ARA) codes, accumulate-repeat-check-accumulate codes, and the codes described in Accumulate-Repeat-Accumulate-Accumulate Codes (NPO-41305), NASA Tech Briefs, Vol. 31, No. 9 (September 2007), page 90. All of the affected codes can be characterized as serial/parallel (hybrid) concatenations of such relatively simple modules as accumulators, repetition codes, differentiators, and punctured single-parity check codes. These are error-correcting codes suitable for use in a variety of wireless data-communication systems that include noisy channels. These codes can also be characterized as hybrid turbolike codes that have projected graph or protograph representations (for example see figure); these characteristics make it possible to design high-speed iterative decoders that utilize belief-propagation algorithms. The present method comprises two related submethods for constructing LDPC codes from simple loop-free modules with circulant permutations. The first submethod is an iterative encoding method based on the erasure-decoding algorithm. The computations required by this method are well organized because they involve a parity-check matrix having a block-circulant structure. The second submethod involves the use of block-circulant generator matrices. The encoders of this method are very similar to those of recursive convolutional codes. Some encoders according to this second submethod have been implemented in a small field-programmable gate array that operates at a speed of 100 megasymbols per second. By use of density evolution (a computational- simulation technique for analyzing performances of LDPC codes), it has been shown through some examples that as the block size goes to infinity, low iterative decoding thresholds close to channel capacity limits can be achieved for the codes of the type in question having low maximum variable node degrees. The decoding thresholds in these examples are lower than those of the best-known unstructured irregular LDPC codes constrained to have the same maximum node degrees. Furthermore, the present method enables the construction of codes of any desired rate with thresholds that stay uniformly close to their respective channel capacity thresholds.

Roll Angle Estimation Using Thermopiles for a Flight Controlled Mortar

DTIC Science & Technology

2012-06-01

Using Xilinx’s System generator, the entire design was implemented at a relatively high level within Malab’s Simulink. This allowed VHDL code to...thermopile data with a Recursive Least Squares (RLS) filter implemented on a field programmable gate array (FPGA). These results demonstrate the...accurately estimated by processing the thermopile data with a Recursive Least Squares (RLS) filter implemented on a field programmable gate array (FPGA

Recursion Removal as an Instructional Method to Enhance the Understanding of Recursion Tracing

ERIC Educational Resources Information Center

Velázquez-Iturbide, J. Ángel; Castellanos, M. Eugenia; Hijón-Neira, Raquel

2016-01-01

Recursion is one of the most difficult programming topics for students. In this paper, an instructional method is proposed to enhance students' understanding of recursion tracing. The proposal is based on the use of rules to translate linear recursion algorithms into equivalent, iterative ones. The paper has two main contributions: the…

Calculating three loop ladder and V-topologies for massive operator matrix elements by computer algebra

NASA Astrophysics Data System (ADS)

Ablinger, J.; Behring, A.; Blümlein, J.; De Freitas, A.; von Manteuffel, A.; Schneider, C.

2016-05-01

Three loop ladder and V-topology diagrams contributing to the massive operator matrix element AQg are calculated. The corresponding objects can all be expressed in terms of nested sums and recurrences depending on the Mellin variable N and the dimensional parameter ε. Given these representations, the desired Laurent series expansions in ε can be obtained with the help of our computer algebra toolbox. Here we rely on generalized hypergeometric functions and Mellin-Barnes representations, on difference ring algorithms for symbolic summation, on an optimized version of the multivariate Almkvist-Zeilberger algorithm for symbolic integration, and on new methods to calculate Laurent series solutions of coupled systems of differential equations. The solutions can be computed for general coefficient matrices directly for any basis also performing the expansion in the dimensional parameter in case it is expressible in terms of indefinite nested product-sum expressions. This structural result is based on new results of our difference ring theory. In the cases discussed we deal with iterative sum- and integral-solutions over general alphabets. The final results are expressed in terms of special sums, forming quasi-shuffle algebras, such as nested harmonic sums, generalized harmonic sums, and nested binomially weighted (cyclotomic) sums. Analytic continuations to complex values of N are possible through the recursion relations obeyed by these quantities and their analytic asymptotic expansions. The latter lead to a host of new constants beyond the multiple zeta values, the infinite generalized harmonic and cyclotomic sums in the case of V-topologies.

A fast recursive algorithm for molecular dynamics simulation

NASA Technical Reports Server (NTRS)

Jain, A.; Vaidehi, N.; Rodriguez, G.

1993-01-01

The present recursive algorithm for solving molecular systems' dynamical equations of motion employs internal variable models that reduce such simulations' computation time by an order of magnitude, relative to Cartesian models. Extensive use is made of spatial operator methods recently developed for analysis and simulation of the dynamics of multibody systems. A factor-of-450 speedup over the conventional O(N-cubed) algorithm is demonstrated for the case of a polypeptide molecule with 400 residues.

Assessing the relative importance of correlates of loneliness in later life. Gaining insight using recursive partitioning.

PubMed

Ejlskov, Linda; Wulff, Jesper; Bøggild, Henrik; Kuh, Diana; Stafford, Mai

2017-09-08

Improving the design and targeting of interventions is important for alleviating loneliness among older adults. This requires identifying which correlates are the most important predictors of loneliness. This study demonstrates the use of recursive partitioning in exploring the characteristics and assessing the relative importance of correlates of loneliness in older adults. Using exploratory regression trees and random forests, we examined combinations and the relative importance of 42 correlates in relation to loneliness at age 68 among 2453 participants from the birth cohort study the MRC National Survey of Health and Development. Positive mental well-being, personal mastery, identifying the spouse as the closest confidant, being extrovert and informal social contact were the most important correlates of lower loneliness levels. Participation in organised groups and demographic correlates were poor identifiers of loneliness. The regression tree suggested that loneliness was not raised among those with poor mental wellbeing if they identified their partner as closest confidante and had frequent social contact. Recursive partitioning can identify which combinations of experiences and circumstances characterise high-risk groups. Poor mental wellbeing and sparse social contact emerged as especially important and classical demographic factors as insufficient in identifying high loneliness levels among older adults.

Recursion Relations for Double Ramification Hierarchies

NASA Astrophysics Data System (ADS)

Buryak, Alexandr; Rossi, Paolo

2016-03-01

In this paper we study various properties of the double ramification hierarchy, an integrable hierarchy of hamiltonian PDEs introduced in Buryak (CommunMath Phys 336(3):1085-1107, 2015) using intersection theory of the double ramification cycle in the moduli space of stable curves. In particular, we prove a recursion formula that recovers the full hierarchy starting from just one of the Hamiltonians, the one associated to the first descendant of the unit of a cohomological field theory. Moreover, we introduce analogues of the topological recursion relations and the divisor equation both for the Hamiltonian densities and for the string solution of the double ramification hierarchy. This machinery is very efficient and we apply it to various computations for the trivial and Hodge cohomological field theories, and for the r -spin Witten's classes. Moreover, we prove the Miura equivalence between the double ramification hierarchy and the Dubrovin-Zhang hierarchy for the Gromov-Witten theory of the complex projective line (extended Toda hierarchy).

Role of fluctuations in random compressible systems at marginal dimensionality

NASA Astrophysics Data System (ADS)

Meissner, G.; Sasvári, L.; Tadić, B.

1986-07-01

In a unified treatment we have studied the role of fluctuations in uniaxial random systems at marginal dimensionality d*=4 with the n=1 component order parameter being coupled to elastic degrees of freedom. Depending on the ratio of the nonuniversal parameters of quenched disorder Δ0 and of elastic fluctuations v~0, a first- or second-order phase transition is found to occur, separated by a tricritical point. A complete account of critical properties and of macroscopic as well as of microscopic elastic stability is given for temperatures T>Tc. Universal singularities of thermodynamic functions are determined for t=(T-Tc)/Tc-->0 including the tricritical point: for v~0/Δ0>-2, they are the same as in a rigid random system; for v~0/Δ0=-2, they are different due to lattice compressibility being related, however, to the former by Fisher renormalization. Fluctuation corrections in one-loop approximation have been evaluated in a nonuniversal critical temperature range, tx<

Multi-jagged: A scalable parallel spatial partitioning algorithm

DOE PAGES

Deveci, Mehmet; Rajamanickam, Sivasankaran; Devine, Karen D.; ...

2015-03-18

Geometric partitioning is fast and effective for load-balancing dynamic applications, particularly those requiring geometric locality of data (particle methods, crash simulations). We present, to our knowledge, the first parallel implementation of a multidimensional-jagged geometric partitioner. In contrast to the traditional recursive coordinate bisection algorithm (RCB), which recursively bisects subdomains perpendicular to their longest dimension until the desired number of parts is obtained, our algorithm does recursive multi-section with a given number of parts in each dimension. By computing multiple cut lines concurrently and intelligently deciding when to migrate data while computing the partition, we minimize data movement compared to efficientmore » implementations of recursive bisection. We demonstrate the algorithm's scalability and quality relative to the RCB implementation in Zoltan on both real and synthetic datasets. Our experiments show that the proposed algorithm performs and scales better than RCB in terms of run-time without degrading the load balance. Lastly, our implementation partitions 24 billion points into 65,536 parts within a few seconds and exhibits near perfect weak scaling up to 6K cores.« less

What's special about human language? The contents of the "narrow language faculty" revisited.

PubMed

Traxler, Matthew J; Boudewyn, Megan; Loudermilk, Jessica

2012-10-01

In this review we re-evaluate the recursion-only hypothesis, advocated by Fitch, Hauser and Chomsky (Hauser, Chomsky & Fitch, 2002; Fitch, Hauser & Chomsky, 2005). According to the recursion-only hypothesis, the property that distinguishes human language from animal communication systems is recursion, which refers to the potentially infinite embedding of one linguistic representation within another of the same type. This hypothesis predicts (1) that non-human primates and other animals lack the ability to learn recursive grammar, and (2) that recursive grammar is the sole cognitive mechanism that is unique to human language. We first review animal studies of recursive grammar, before turning to the claim that recursion is a property of all human languages. Finally, we discuss other views on what abilities may be unique to human language.

An algebraic approach to the analytic bootstrap

DOE PAGES

Alday, Luis F.; Zhiboedov, Alexander

2017-04-27

We develop an algebraic approach to the analytic bootstrap in CFTs. By acting with the Casimir operator on the crossing equation we map the problem of doing large spin sums to any desired order to the problem of solving a set of recursion relations. We compute corrections to the anomalous dimension of large spin operators due to the exchange of a primary and its descendants in the crossed channel and show that this leads to a Borel-summable expansion. Here, we analyse higher order corrections to the microscopic CFT data in the direct channel and its matching to infinite towers ofmore » operators in the crossed channel. We apply this method to the critical O(N ) model. At large N we reproduce the first few terms in the large spin expansion of the known two-loop anomalous dimensions of higher spin currents in the traceless symmetric representation of O(N ) and make further predictions. At small N we present the results for the truncated large spin expansion series of anomalous dimensions of higher spin currents.« less

Exact Correlation Functions in S U (2 ) N =2 Superconformal QCD

NASA Astrophysics Data System (ADS)

Baggio, Marco; Niarchos, Vasilis; Papadodimas, Kyriakos

2014-12-01

We report an exact solution of 2- and 3-point functions of chiral primary fields in S U (2 ) N =2 super-Yang-Mills theory coupled to four hypermultiplets. It is shown that these correlation functions are nontrivial functions of the gauge coupling, obeying differential equations which take the form of the semi-infinite Toda chain. We solve these equations recursively in terms of the Zamolodchikov metric that can be determined exactly from supersymmetric localization on the four-sphere. Our results are verified independently in perturbation theory with a Feynman diagram computation up to 2 loops. This is a short version of a companion paper that contains detailed technical remarks, additional material, and aspects of an extension to the S U (N ) gauge group.

What's special about human language? The contents of the "narrow language faculty" revisited

PubMed Central

Traxler, Matthew J.; Boudewyn, Megan; Loudermilk, Jessica

2012-01-01

In this review we re-evaluate the recursion-only hypothesis, advocated by Fitch, Hauser and Chomsky (Hauser, Chomsky & Fitch, 2002; Fitch, Hauser & Chomsky, 2005). According to the recursion-only hypothesis, the property that distinguishes human language from animal communication systems is recursion, which refers to the potentially infinite embedding of one linguistic representation within another of the same type. This hypothesis predicts (1) that non-human primates and other animals lack the ability to learn recursive grammar, and (2) that recursive grammar is the sole cognitive mechanism that is unique to human language. We first review animal studies of recursive grammar, before turning to the claim that recursion is a property of all human languages. Finally, we discuss other views on what abilities may be unique to human language. PMID:23105948

Generalized recursive solutions to Ornstein-Zernike integral equations

NASA Astrophysics Data System (ADS)

Rossky, Peter J.; Dale, William D. T.

1980-09-01

Recursive procedures for the solution of a class of integral equations based on the Ornstein-Zernike equation are developed; the hypernetted chain and Percus-Yevick equations are two special cases of the class considered. It is shown that certain variants of the new procedures developed here are formally equivalent to those recently developed by Dale and Friedman, if the new recursive expressions are initialized in the same way as theirs. However, the computational solution of the new equations is significantly more efficient. Further, the present analysis leads to the identification of various graphical quantities arising in the earlier study with more familiar quantities related to pair correlation functions. The analysis is greatly facilitated by the use of several identities relating simple chain sums whose graphical elements can be written as a sum of two or more parts. In particular, the use of these identities permits renormalization of the equivalent series solution to the integral equation to be directly incorporated into the recursive solution in a straightforward manner. Formulas appropriate to renormalization with respect to long and short range parts of the pair potential, as well as more general components of the direct correlation function, are obtained. To further illustrate the utility of this approach, we show that a simple generalization of the hypernetted chain closure relation for the direct correlation function leads directly to the reference hypernetted chain (RHNC) equation due to Lado. The form of the correlation function used in the exponential approximation of Andersen and Chandler is then seen to be equivalent to the first estimate obtained from a renormalized RHNC equation.

A Survey on Teaching and Learning Recursive Programming

ERIC Educational Resources Information Center

Rinderknecht, Christian

2014-01-01

We survey the literature about the teaching and learning of recursive programming. After a short history of the advent of recursion in programming languages and its adoption by programmers, we present curricular approaches to recursion, including a review of textbooks and some programming methodology, as well as the functional and imperative…

Recursion in aphasia.

PubMed

Bánréti, Zoltán

2010-11-01

This study investigates how aphasic impairment impinges on syntactic and/or semantic recursivity of human language. A series of tests has been conducted with the participation of five Hungarian speaking aphasic subjects and 10 control subjects. Photographs representing simple situations were presented to subjects and questions were asked about them. The responses are supposed to involve formal structural recursion, but they contain semantic-pragmatic operations instead, with 'theory of mind' type embeddings. Aphasic individuals tend to exploit the parallel between 'theory of mind' embeddings and syntactic-structural embeddings in order to avoid formal structural recursion. Formal structural recursion may be more impaired in Broca's aphasia and semantic recursivity may remain selectively unimpaired in this type of aphasia.

Teaching and Learning Recursive Programming: A Review of the Research Literature

ERIC Educational Resources Information Center

McCauley, Renée; Grissom, Scott; Fitzgerald, Sue; Murphy, Laurie

2015-01-01

Hundreds of articles have been published on the topics of teaching and learning recursion, yet fewer than 50 of them have published research results. This article surveys the computing education research literature and presents findings on challenges students encounter in learning recursion, mental models students develop as they learn recursion,…

How Learning Logic Programming Affects Recursion Comprehension

ERIC Educational Resources Information Center

Haberman, Bruria

2004-01-01

Recursion is a central concept in computer science, yet it is difficult for beginners to comprehend. Israeli high-school students learn recursion in the framework of a special modular program in computer science (Gal-Ezer & Harel, 1999). Some of them are introduced to the concept of recursion in two different paradigms: the procedural…

How children perceive fractals: Hierarchical self-similarity and cognitive development

PubMed Central

Martins, Maurício Dias; Laaha, Sabine; Freiberger, Eva Maria; Choi, Soonja; Fitch, W. Tecumseh

2014-01-01

The ability to understand and generate hierarchical structures is a crucial component of human cognition, available in language, music, mathematics and problem solving. Recursion is a particularly useful mechanism for generating complex hierarchies by means of self-embedding rules. In the visual domain, fractals are recursive structures in which simple transformation rules generate hierarchies of infinite depth. Research on how children acquire these rules can provide valuable insight into the cognitive requirements and learning constraints of recursion. Here, we used fractals to investigate the acquisition of recursion in the visual domain, and probed for correlations with grammar comprehension and general intelligence. We compared second (n = 26) and fourth graders (n = 26) in their ability to represent two types of rules for generating hierarchical structures: Recursive rules, on the one hand, which generate new hierarchical levels; and iterative rules, on the other hand, which merely insert items within hierarchies without generating new levels. We found that the majority of fourth graders, but not second graders, were able to represent both recursive and iterative rules. This difference was partially accounted by second graders’ impairment in detecting hierarchical mistakes, and correlated with between-grade differences in grammar comprehension tasks. Empirically, recursion and iteration also differed in at least one crucial aspect: While the ability to learn recursive rules seemed to depend on the previous acquisition of simple iterative representations, the opposite was not true, i.e., children were able to acquire iterative rules before they acquired recursive representations. These results suggest that the acquisition of recursion in vision follows learning constraints similar to the acquisition of recursion in language, and that both domains share cognitive resources involved in hierarchical processing. PMID:24955884

Cognitive representation of "musical fractals": Processing hierarchy and recursion in the auditory domain.

PubMed

Martins, Mauricio Dias; Gingras, Bruno; Puig-Waldmueller, Estela; Fitch, W Tecumseh

2017-04-01

The human ability to process hierarchical structures has been a longstanding research topic. However, the nature of the cognitive machinery underlying this faculty remains controversial. Recursion, the ability to embed structures within structures of the same kind, has been proposed as a key component of our ability to parse and generate complex hierarchies. Here, we investigated the cognitive representation of both recursive and iterative processes in the auditory domain. The experiment used a two-alternative forced-choice paradigm: participants were exposed to three-step processes in which pure-tone sequences were built either through recursive or iterative processes, and had to choose the correct completion. Foils were constructed according to generative processes that did not match the previous steps. Both musicians and non-musicians were able to represent recursion in the auditory domain, although musicians performed better. We also observed that general 'musical' aptitudes played a role in both recursion and iteration, although the influence of musical training was somehow independent from melodic memory. Moreover, unlike iteration, recursion in audition was well correlated with its non-auditory (recursive) analogues in the visual and action sequencing domains. These results suggest that the cognitive machinery involved in establishing recursive representations is domain-general, even though this machinery requires access to information resulting from domain-specific processes. Copyright © 2017 The Authors. Published by Elsevier B.V. All rights reserved.

[What is impaired consciousness? Revisiting impaired consciousness as psychiatric concept].

PubMed

Kanemoto, Kousuke

2004-01-01

For decades, psychiatrists have considered that concepts of impaired consciousness in the study of psychiatry were inconsistent with those applied in the field of neurology, in which the usefulness of the concept of consciousness has long been seriously doubted. Gloor concluded that the concept of consciousness does not further the understanding of seizure mechanisms or brain function, which is the current representative opinion of most epileptologists. Loss of consciousness tends to be reduced to aggregates of individual impairments of higher cognitive functions, and the concept of consciousness is preferably avoided by neurologists by assigning various behavioral disturbances during disturbed consciousness to particular neuropsychological centers. In contrast, psychiatrists, especially those in Europe, are more likely to include phenomena involving problems related to phenomenological intentionality in impaired consciousness. For the present study, we first divided consciousness into vigilance and recursive consciousness, and then attempted to determine what kind of impaired consciousness would be an ideal candidate to represent pure disturbance of recursive consciousness. Then, 4 patients, 1 each with pure amnestic states followed immediately by complex partial seizures, an akinetic mutistic state caused by absence status, and mental diplopia as a manifestation of postictal psychosis, as well as a patient with Alzheimer's disease who gracefully performed Japanese tea ceremony, were studied. Based on our findings, we concluded that impaired consciousness as a generic term in general medicine does not indicate any unitary entity corresponding to some well-demarcated physiological function or constitute a base from which recursive consciousness emerges as a superstructure. From that, we stressed that a pure form of impairment of recursive consciousness could occur without the impaired consciousness named generically in general medicine. Second, following observation of an additional 3 cases, descriptions of naissance of the first word (taken from the autobiography of Helen Keller), visual object agnosia, and chronic schizophrenia with schizophasia were discussed to examine the relationship between impairments of recursive consciousness and semantic generation dysfunction. Attempts to bridge semantic generation and recursive consciousness, performed by psychopathologists such as Bin Kimura and Hiroyuki Koide, were also briefly discussed. In light of these case presentations and related discussions, we re-examined traditional theories of impaired consciousness, including Mayer-Gross's Gestalt theory, later replaced by Conrad and Henri Ey's theory related to intentionality. Furthermore, we attempted to link Denett's theory of consciousness to those traditional theories as well as to our own postulations, and neuropsychological data such as those of implicit memory and blindsight. Finally, the significance of Freud's unconsciousness in the framework of neuroscience was discussed.

A note on NMHV form factors from the Graßmannian and the twistor string

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

Meidinger, David; Nandan, Dhritiman; Penante, Brenda

In this note we investigate Graßmannian formulas for form factors of the chiral part of the stress-tensor multiplet in N = 4 superconformal Yang-Mills theory. We present an all-n contour for the G(3, n + 2) Graßmannian integral of NMHV form factors derived from on-shell diagrams and the BCFW recursion relation. In addition, we study other G(3, n + 2) formulas obtained from the connected prescription introduced recently. We find a recursive expression for all n and study its properties. For n ≥ 6, our formula has the same recursive structure as its amplitude counterpart, making its soft behaviour manifest.more » Finally, we explore the connection between the two Graßmannian formulations, using the global residue theorem, and find that it is much more intricate compared to scattering amplitudes.« less

A note on NMHV form factors from the Graßmannian and the twistor string

DOE PAGES

Meidinger, David; Nandan, Dhritiman; Penante, Brenda; ...

2017-09-06

In this note we investigate Graßmannian formulas for form factors of the chiral part of the stress-tensor multiplet in N = 4 superconformal Yang-Mills theory. We present an all-n contour for the G(3, n + 2) Graßmannian integral of NMHV form factors derived from on-shell diagrams and the BCFW recursion relation. In addition, we study other G(3, n + 2) formulas obtained from the connected prescription introduced recently. We find a recursive expression for all n and study its properties. For n ≥ 6, our formula has the same recursive structure as its amplitude counterpart, making its soft behaviour manifest.more » Finally, we explore the connection between the two Graßmannian formulations, using the global residue theorem, and find that it is much more intricate compared to scattering amplitudes.« less

Modelling and Closed-Loop System Identification of a Quadrotor-Based Aerial Manipulator

NASA Astrophysics Data System (ADS)

Dube, Chioniso; Pedro, Jimoh O.

2018-05-01

This paper presents the modelling and system identification of a quadrotor-based aerial manipulator. The aerial manipulator model is first derived analytically using the Newton-Euler formulation for the quadrotor and Recursive Newton-Euler formulation for the manipulator. The aerial manipulator is then simulated with the quadrotor under Proportional Derivative (PD) control, with the manipulator in motion. The simulation data is then used for system identification of the aerial manipulator. Auto Regressive with eXogenous inputs (ARX) models are obtained from the system identification for linear accelerations \\ddot{X} and \\ddot{Y} and yaw angular acceleration \\ddot{\\psi }. For linear acceleration \\ddot{Z}, and pitch and roll angular accelerations \\ddot{θ } and \\ddot{φ }, Auto Regressive Moving Average with eXogenous inputs (ARMAX) models are identified.

Recursive Subsystems in Aphasia and Alzheimer's Disease: Case Studies in Syntax and Theory of Mind.

PubMed

Bánréti, Zoltán; Hoffmann, Ildikó; Vincze, Veronika

2016-01-01

The relationship between recursive sentence embedding and theory-of-mind (ToM) inference is investigated in three persons with Broca's aphasia, two persons with Wernicke's aphasia, and six persons with mild and moderate Alzheimer's disease (AD). We asked questions of four types about photographs of various real-life situations. Type 4 questions asked participants about intentions, thoughts, or utterances of the characters in the pictures ("What may X be thinking/asking Y to do?"). The expected answers typically involved subordinate clauses introduced by conjunctions or direct quotations of the characters' utterances. Broca's aphasics did not produce answers with recursive sentence embedding. Rather, they projected themselves into the characters' mental states and gave direct answers in the first person singular, with relevant ToM content. We call such replies "situative statements." Where the question concerned the mental state of the character but did not require an answer with sentence embedding ("What does X hate?"), aphasics gave descriptive answers rather than situative statements. Most replies given by persons with AD to Type 4 questions were grammatical instances of recursive sentence embedding. They also gave a few situative statements but the ToM content of these was irrelevant. In more than one third of their well-formed sentence embeddings, too, they conveyed irrelevant ToM contents. Persons with moderate AD were unable to pass secondary false belief tests. The results reveal double dissociation: Broca's aphasics are unable to access recursive sentence embedding but they can make appropriate ToM inferences; moderate AD persons make the wrong ToM inferences but they are able to access recursive sentence embedding. The double dissociation may be relevant for the nature of the relationship between the two recursive capacities. Broca's aphasics compensated for the lack of recursive sentence embedding by recursive ToM reasoning represented in very simple syntactic forms: they used one recursive subsystem to stand in for another recursive subsystem.

Recursive Subsystems in Aphasia and Alzheimer's Disease: Case Studies in Syntax and Theory of Mind

PubMed Central

Bánréti, Zoltán; Hoffmann, Ildikó; Vincze, Veronika

2016-01-01

The relationship between recursive sentence embedding and theory-of-mind (ToM) inference is investigated in three persons with Broca's aphasia, two persons with Wernicke's aphasia, and six persons with mild and moderate Alzheimer's disease (AD). We asked questions of four types about photographs of various real-life situations. Type 4 questions asked participants about intentions, thoughts, or utterances of the characters in the pictures (“What may X be thinking/asking Y to do?”). The expected answers typically involved subordinate clauses introduced by conjunctions or direct quotations of the characters' utterances. Broca's aphasics did not produce answers with recursive sentence embedding. Rather, they projected themselves into the characters' mental states and gave direct answers in the first person singular, with relevant ToM content. We call such replies “situative statements.” Where the question concerned the mental state of the character but did not require an answer with sentence embedding (“What does X hate?”), aphasics gave descriptive answers rather than situative statements. Most replies given by persons with AD to Type 4 questions were grammatical instances of recursive sentence embedding. They also gave a few situative statements but the ToM content of these was irrelevant. In more than one third of their well-formed sentence embeddings, too, they conveyed irrelevant ToM contents. Persons with moderate AD were unable to pass secondary false belief tests. The results reveal double dissociation: Broca's aphasics are unable to access recursive sentence embedding but they can make appropriate ToM inferences; moderate AD persons make the wrong ToM inferences but they are able to access recursive sentence embedding. The double dissociation may be relevant for the nature of the relationship between the two recursive capacities. Broca's aphasics compensated for the lack of recursive sentence embedding by recursive ToM reasoning represented in very simple syntactic forms: they used one recursive subsystem to stand in for another recursive subsystem. PMID:27064887

Topological Phenotypes Constitute a New Dimension in the Phenotypic Space of Leaf Venation Networks

PubMed Central

Ronellenfitsch, Henrik; Lasser, Jana; Daly, Douglas C.; Katifori, Eleni

2015-01-01

The leaves of angiosperms contain highly complex venation networks consisting of recursively nested, hierarchically organized loops. We describe a new phenotypic trait of reticulate vascular networks based on the topology of the nested loops. This phenotypic trait encodes information orthogonal to widely used geometric phenotypic traits, and thus constitutes a new dimension in the leaf venation phenotypic space. We apply our metric to a database of 186 leaves and leaflets representing 137 species, predominantly from the Burseraceae family, revealing diverse topological network traits even within this single family. We show that topological information significantly improves identification of leaves from fragments by calculating a “leaf venation fingerprint” from topology and geometry. Further, we present a phenomenological model suggesting that the topological traits can be explained by noise effects unique to specimen during development of each leaf which leave their imprint on the final network. This work opens the path to new quantitative identification techniques for leaves which go beyond simple geometric traits such as vein density and is directly applicable to other planar or sub-planar networks such as blood vessels in the brain. PMID:26700471

Flatness-based control in successive loops for stabilization of heart's electrical activity

NASA Astrophysics Data System (ADS)

Rigatos, Gerasimos; Melkikh, Alexey

2016-12-01

The article proposes a new flatness-based control method implemented in successive loops which allows for stabilization of the heart's electrical activity. Heart's pacemaking function is modeled as a set of coupled oscillators which potentially can exhibit chaotic behavior. It is shown that this model satisfies differential flatness properties. Next, the control and stabilization of this model is performed with the use of flatness-based control implemented in cascading loops. By applying a per-row decomposition of the state-space model of the coupled oscillators a set of nonlinear differential equations is obtained. Differential flatness properties are shown to hold for the subsystems associated with the each one of the aforementioned differential equations and next a local flatness-based controller is designed for each subsystem. For the i-th subsystem, state variable xi is chosen to be the flat output and state variable xi+1 is taken to be a virtual control input. Then the value of the virtual control input which eliminates the output tracking error for the i-th subsystem becomes reference setpoint for the i + 1-th subsystem. In this manner the control of the entire state-space model is performed by successive flatness-based control loops. By arriving at the n-th row of the state-space model one computes the control input that can be actually exerted on the aforementioned biosystem. This real control input of the coupled oscillators' system, contains recursively all virtual control inputs associated with the previous n - 1 rows of the state-space model. This control approach achieves asymptotically the elimination of the chaotic oscillation effects and the stabilization of the heart's pulsation rhythm. The stability of the proposed control scheme is proven with the use of Lyapunov analysis.

Framework for Detection and Localization of Extreme Climate Event with Pixel Recursive Super Resolution

NASA Astrophysics Data System (ADS)

Kim, S. K.; Lee, J.; Zhang, C.; Ames, S.; Williams, D. N.

2017-12-01

Deep learning techniques have been successfully applied to solve many problems in climate and geoscience using massive-scaled observed and modeled data. For extreme climate event detections, several models based on deep neural networks have been recently proposed and attend superior performance that overshadows all previous handcrafted expert based method. The issue arising, though, is that accurate localization of events requires high quality of climate data. In this work, we propose framework capable of detecting and localizing extreme climate events in very coarse climate data. Our framework is based on two models using deep neural networks, (1) Convolutional Neural Networks (CNNs) to detect and localize extreme climate events, and (2) Pixel recursive recursive super resolution model to reconstruct high resolution climate data from low resolution climate data. Based on our preliminary work, we have presented two CNNs in our framework for different purposes, detection and localization. Our results using CNNs for extreme climate events detection shows that simple neural nets can capture the pattern of extreme climate events with high accuracy from very coarse reanalysis data. However, localization accuracy is relatively low due to the coarse resolution. To resolve this issue, the pixel recursive super resolution model reconstructs the resolution of input of localization CNNs. We present a best networks using pixel recursive super resolution model that synthesizes details of tropical cyclone in ground truth data while enhancing their resolution. Therefore, this approach not only dramat- ically reduces the human effort, but also suggests possibility to reduce computing cost required for downscaling process to increase resolution of data.

Structure of the conversion laws in quantum integrable spin chains with short range interactions

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

Grabowski, M.P.; Mathieu, P.

1995-11-01

The authors present a detailed analysis of the structure of the conservation laws in quantum integrable chains of the XYZ-type and in the Hubbard model. The essential tool for the former class of models is the boost operator, which provides a recursive way of calculating the integrals of motion. With its help, they establish the general form of the XYZ conserved charges in terms of simple polynomials in spin variables and derive recursion relations for the relative coefficients of these polynomials. Although these relations are difficult to solve in general, a subset of the coefficients can be determined. Moreover, formore » two submodels of the XYZ chain, namely the XXX and XY cases, all the charges can be calculated in closed form. Using this approach, the authors rederive the known expressions for the XY charges in a novel way. For the XXX case. a simple description of conserved charges is found in terms of a Catalan tree. This construction is generalized for the su(M) invariant integrable chain. They also investigate the circumstances permitting the existence of a recursive (ladder) operator in general quantum integrable systems. They indicate that a quantum ladder operator can be traced back to the presence of a Hamiltonian mastersymmetry of degree one in the classical continuous version of the model. In this way, quantum chains endowed with a recursive structure can be identified from the properties of their classical relatives. The authors also show that in the quantum continuous limits of the XYZ model, the ladder property of the boost operator disappears. For the Hubbard model they demonstrate the nonexistence of a ladder operator. Nevertheless, the general structure of the conserved charges is indicated, and the expression for the terms linear in the model`s free parameter for all charges is derived in closed form. 62 refs., 4 figs.« less

Space-Use Patterns of the Asiatic Wild Ass (Equus hemionus): Complementary Insights from Displacement, Recursion Movement and Habitat Selection Analyses.

PubMed

Giotto, Nina; Gerard, Jean-François; Ziv, Alon; Bouskila, Amos; Bar-David, Shirli

2015-01-01

The way in which animals move and use the landscape is influenced by the spatial distribution of resources, and is of importance when considering species conservation. We aimed at exploring how landscape-related factors affect a large herbivore's space-use patterns by using a combined approach, integrating movement (displacement and recursions) and habitat selection analyses. We studied the endangered Asiatic wild ass (Equus hemionus) in the Negev Desert, Israel, using GPS monitoring and direct observation. We found that the main landscape-related factors affecting the species' space-use patterns, on a daily and seasonal basis, were vegetation cover, water sources and topography. Two main habitat types were selected: high-elevation sites during the day (specific microclimate: windy on warm summer days) and streambed surroundings during the night (coupled with high vegetation when the animals were active in summer). Distribution of recursion times (duration between visits) revealed a 24-hour periodicity, a pattern that could be widespread among large herbivores. Characterizing frequently revisited sites suggested that recursion movements were mainly driven by a few landscape features (water sources, vegetation patches, high-elevation points), but also by social factors, such as territoriality, which should be further explored. This study provided complementary insights into the space-use patterns of E. hemionus. Understanding of the species' space-use patterns, at both large and fine spatial scale, is required for developing appropriate conservation protocols. Our approach could be further applied for studying the space-use patterns of other species in heterogeneous landscapes.

Space-Use Patterns of the Asiatic Wild Ass (Equus hemionus): Complementary Insights from Displacement, Recursion Movement and Habitat Selection Analyses

PubMed Central

Giotto, Nina; Gerard, Jean-François; Ziv, Alon; Bouskila, Amos; Bar-David, Shirli

2015-01-01

The way in which animals move and use the landscape is influenced by the spatial distribution of resources, and is of importance when considering species conservation. We aimed at exploring how landscape-related factors affect a large herbivore’s space-use patterns by using a combined approach, integrating movement (displacement and recursions) and habitat selection analyses. We studied the endangered Asiatic wild ass (Equus hemionus) in the Negev Desert, Israel, using GPS monitoring and direct observation. We found that the main landscape-related factors affecting the species’ space-use patterns, on a daily and seasonal basis, were vegetation cover, water sources and topography. Two main habitat types were selected: high-elevation sites during the day (specific microclimate: windy on warm summer days) and streambed surroundings during the night (coupled with high vegetation when the animals were active in summer). Distribution of recursion times (duration between visits) revealed a 24-hour periodicity, a pattern that could be widespread among large herbivores. Characterizing frequently revisited sites suggested that recursion movements were mainly driven by a few landscape features (water sources, vegetation patches, high-elevation points), but also by social factors, such as territoriality, which should be further explored. This study provided complementary insights into the space-use patterns of E. hemionus. Understanding of the species’ space-use patterns, at both large and fine spatial scale, is required for developing appropriate conservation protocols. Our approach could be further applied for studying the space-use patterns of other species in heterogeneous landscapes. PMID:26630393

Recursive linearization of multibody dynamics equations of motion

NASA Technical Reports Server (NTRS)

Lin, Tsung-Chieh; Yae, K. Harold

1989-01-01

The equations of motion of a multibody system are nonlinear in nature, and thus pose a difficult problem in linear control design. One approach is to have a first-order approximation through the numerical perturbations at a given configuration, and to design a control law based on the linearized model. Here, a linearized model is generated analytically by following the footsteps of the recursive derivation of the equations of motion. The equations of motion are first written in a Newton-Euler form, which is systematic and easy to construct; then, they are transformed into a relative coordinate representation, which is more efficient in computation. A new computational method for linearization is obtained by applying a series of first-order analytical approximations to the recursive kinematic relationships. The method has proved to be computationally more efficient because of its recursive nature. It has also turned out to be more accurate because of the fact that analytical perturbation circumvents numerical differentiation and other associated numerical operations that may accumulate computational error, thus requiring only analytical operations of matrices and vectors. The power of the proposed linearization algorithm is demonstrated, in comparison to a numerical perturbation method, with a two-link manipulator and a seven degrees of freedom robotic manipulator. Its application to control design is also demonstrated.

Algebraic function operator expectation value based quantum eigenstate determination: A case of twisted or bent Hamiltonian, or, a spatially univariate quantum system on a curved space

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

Baykara, N. A.

Recent studies on quantum evolutionary problems in Demiralp’s group have arrived at a stage where the construction of an expectation value formula for a given algebraic function operator depending on only position operator becomes possible. It has also been shown that this formula turns into an algebraic recursion amongst some finite number of consecutive elements in a set of expectation values of an appropriately chosen basis set over the natural number powers of the position operator as long as the function under consideration and the system Hamiltonian are both autonomous. This recursion corresponds to a denumerable infinite number of algebraicmore » equations whose solutions can or can not be obtained analytically. This idea is not completely original. There are many recursive relations amongst the expectation values of the natural number powers of position operator. However, those recursions may not be always efficient to get the system energy values and especially the eigenstate wavefunctions. The present approach is somehow improved and generalized form of those expansions. We focus on this issue for a specific system where the Hamiltonian is defined on the coordinate of a curved space instead of the Cartesian one.« less

An application of change-point recursive models to the relationship between litter size and number of stillborns in pigs.

PubMed

Ibáñez-Escriche, N; López de Maturana, E; Noguera, J L; Varona, L

2010-11-01

We developed and implemented change-point recursive models and compared them with a linear recursive model and a standard mixed model (SMM), in the scope of the relationship between litter size (LS) and number of stillborns (NSB) in pigs. The proposed approach allows us to estimate the point of change in multiple-segment modeling of a nonlinear relationship between phenotypes. We applied the procedure to a data set provided by a commercial Large White selection nucleus. The data file consisted of LS and NSB records of 4,462 parities. The results of the analysis clearly identified the location of the change points between different structural regression coefficients. The magnitude of these coefficients increased with LS, indicating an increasing incidence of LS on the NSB ratio. However, posterior distributions of correlations were similar across subpopulations (defined by the change points on LS), except for those between residuals. The heritability estimates of NSB did not present differences between recursive models. Nevertheless, these heritabilities were greater than those obtained for SMM (0.05) with a posterior probability of 85%. These results suggest a nonlinear relationship between LS and NSB, which supports the adequacy of a change-point recursive model for its analysis. Furthermore, the results from model comparisons support the use of recursive models. However, the adequacy of the different recursive models depended on the criteria used: the linear recursive model was preferred on account of its smallest deviance value, whereas nonlinear recursive models provided a better fit and predictive ability based on the cross-validation approach.

Recursive inverse factorization.

PubMed

Rubensson, Emanuel H; Bock, Nicolas; Holmström, Erik; Niklasson, Anders M N

2008-03-14

A recursive algorithm for the inverse factorization S(-1)=ZZ(*) of Hermitian positive definite matrices S is proposed. The inverse factorization is based on iterative refinement [A.M.N. Niklasson, Phys. Rev. B 70, 193102 (2004)] combined with a recursive decomposition of S. As the computational kernel is matrix-matrix multiplication, the algorithm can be parallelized and the computational effort increases linearly with system size for systems with sufficiently sparse matrices. Recent advances in network theory are used to find appropriate recursive decompositions. We show that optimization of the so-called network modularity results in an improved partitioning compared to other approaches. In particular, when the recursive inverse factorization is applied to overlap matrices of irregularly structured three-dimensional molecules.

Scoring and staging systems using cox linear regression modeling and recursive partitioning.

PubMed

Lee, J W; Um, S H; Lee, J B; Mun, J; Cho, H

2006-01-01

Scoring and staging systems are used to determine the order and class of data according to predictors. Systems used for medical data, such as the Child-Turcotte-Pugh scoring and staging systems for ordering and classifying patients with liver disease, are often derived strictly from physicians' experience and intuition. We construct objective and data-based scoring/staging systems using statistical methods. We consider Cox linear regression modeling and recursive partitioning techniques for censored survival data. In particular, to obtain a target number of stages we propose cross-validation and amalgamation algorithms. We also propose an algorithm for constructing scoring and staging systems by integrating local Cox linear regression models into recursive partitioning, so that we can retain the merits of both methods such as superior predictive accuracy, ease of use, and detection of interactions between predictors. The staging system construction algorithms are compared by cross-validation evaluation of real data. The data-based cross-validation comparison shows that Cox linear regression modeling is somewhat better than recursive partitioning when there are only continuous predictors, while recursive partitioning is better when there are significant categorical predictors. The proposed local Cox linear recursive partitioning has better predictive accuracy than Cox linear modeling and simple recursive partitioning. This study indicates that integrating local linear modeling into recursive partitioning can significantly improve prediction accuracy in constructing scoring and staging systems.

Recursion to food plants by free-ranging Bornean elephant

PubMed Central

Gillespie, Graeme; Goossens, Benoit; Ismail, Sulaiman; Ancrenaz, Marc; Linklater, Wayne

2015-01-01

Plant recovery rates after herbivory are thought to be a key factor driving recursion by herbivores to sites and plants to optimise resource-use but have not been investigated as an explanation for recursion in large herbivores. We investigated the relationship between plant recovery and recursion by elephants (Elephas maximus borneensis) in the Lower Kinabatangan Wildlife Sanctuary, Sabah. We identified 182 recently eaten food plants, from 30 species, along 14 × 50 m transects and measured their recovery growth each month over nine months or until they were re-browsed by elephants. The monthly growth in leaf and branch or shoot length for each plant was used to calculate the time required (months) for each species to recover to its pre-eaten length. Elephant returned to all but two transects with 10 eaten plants, a further 26 plants died leaving 146 plants that could be re-eaten. Recursion occurred to 58% of all plants and 12 of the 30 species. Seventy-seven percent of the re-eaten plants were grasses. Recovery times to all plants varied from two to twenty months depending on the species. Recursion to all grasses coincided with plant recovery whereas recursion to most browsed plants occurred four to twelve months before they had recovered to their previous length. The small sample size of many browsed plants that received recursion and uneven plant species distribution across transects limits our ability to generalise for most browsed species but a prominent pattern in plant-scale recursion did emerge. Plant recovery time was a good predictor of time to recursion but varied as a function of growth form (grass, ginger, palm, liana and woody) and differences between sites. Time to plant recursion coincided with plant recovery time for the elephant’s preferred food, grasses, and perhaps also gingers, but not the other browsed species. Elephants are bulk feeders so it is likely that they time their returns to bulk feed on these grass species when quantities have recovered sufficiently to meet their intake requirements. The implications for habitat and elephant management are discussed. PMID:26290779

Recursion to food plants by free-ranging Bornean elephant.

PubMed

English, Megan; Gillespie, Graeme; Goossens, Benoit; Ismail, Sulaiman; Ancrenaz, Marc; Linklater, Wayne

2015-01-01

Plant recovery rates after herbivory are thought to be a key factor driving recursion by herbivores to sites and plants to optimise resource-use but have not been investigated as an explanation for recursion in large herbivores. We investigated the relationship between plant recovery and recursion by elephants (Elephas maximus borneensis) in the Lower Kinabatangan Wildlife Sanctuary, Sabah. We identified 182 recently eaten food plants, from 30 species, along 14 × 50 m transects and measured their recovery growth each month over nine months or until they were re-browsed by elephants. The monthly growth in leaf and branch or shoot length for each plant was used to calculate the time required (months) for each species to recover to its pre-eaten length. Elephant returned to all but two transects with 10 eaten plants, a further 26 plants died leaving 146 plants that could be re-eaten. Recursion occurred to 58% of all plants and 12 of the 30 species. Seventy-seven percent of the re-eaten plants were grasses. Recovery times to all plants varied from two to twenty months depending on the species. Recursion to all grasses coincided with plant recovery whereas recursion to most browsed plants occurred four to twelve months before they had recovered to their previous length. The small sample size of many browsed plants that received recursion and uneven plant species distribution across transects limits our ability to generalise for most browsed species but a prominent pattern in plant-scale recursion did emerge. Plant recovery time was a good predictor of time to recursion but varied as a function of growth form (grass, ginger, palm, liana and woody) and differences between sites. Time to plant recursion coincided with plant recovery time for the elephant's preferred food, grasses, and perhaps also gingers, but not the other browsed species. Elephants are bulk feeders so it is likely that they time their returns to bulk feed on these grass species when quantities have recovered sufficiently to meet their intake requirements. The implications for habitat and elephant management are discussed.

Static Analysis of Large-Scale Multibody System Using Joint Coordinates and Spatial Algebra Operator

PubMed Central

Omar, Mohamed A.

2014-01-01

Initial transient oscillations inhibited in the dynamic simulations responses of multibody systems can lead to inaccurate results, unrealistic load prediction, or simulation failure. These transients could result from incompatible initial conditions, initial constraints violation, and inadequate kinematic assembly. Performing static equilibrium analysis before the dynamic simulation can eliminate these transients and lead to stable simulation. Most exiting multibody formulations determine the static equilibrium position by minimizing the system potential energy. This paper presents a new general purpose approach for solving the static equilibrium in large-scale articulated multibody. The proposed approach introduces an energy drainage mechanism based on Baumgarte constraint stabilization approach to determine the static equilibrium position. The spatial algebra operator is used to express the kinematic and dynamic equations of the closed-loop multibody system. The proposed multibody system formulation utilizes the joint coordinates and modal elastic coordinates as the system generalized coordinates. The recursive nonlinear equations of motion are formulated using the Cartesian coordinates and the joint coordinates to form an augmented set of differential algebraic equations. Then system connectivity matrix is derived from the system topological relations and used to project the Cartesian quantities into the joint subspace leading to minimum set of differential equations. PMID:25045732

Static analysis of large-scale multibody system using joint coordinates and spatial algebra operator.

PubMed

Omar, Mohamed A

2014-01-01

Initial transient oscillations inhibited in the dynamic simulations responses of multibody systems can lead to inaccurate results, unrealistic load prediction, or simulation failure. These transients could result from incompatible initial conditions, initial constraints violation, and inadequate kinematic assembly. Performing static equilibrium analysis before the dynamic simulation can eliminate these transients and lead to stable simulation. Most exiting multibody formulations determine the static equilibrium position by minimizing the system potential energy. This paper presents a new general purpose approach for solving the static equilibrium in large-scale articulated multibody. The proposed approach introduces an energy drainage mechanism based on Baumgarte constraint stabilization approach to determine the static equilibrium position. The spatial algebra operator is used to express the kinematic and dynamic equations of the closed-loop multibody system. The proposed multibody system formulation utilizes the joint coordinates and modal elastic coordinates as the system generalized coordinates. The recursive nonlinear equations of motion are formulated using the Cartesian coordinates and the joint coordinates to form an augmented set of differential algebraic equations. Then system connectivity matrix is derived from the system topological relations and used to project the Cartesian quantities into the joint subspace leading to minimum set of differential equations.

A hybrid video codec based on extended block sizes, recursive integer transforms, improved interpolation, and flexible motion representation

NASA Astrophysics Data System (ADS)

Karczewicz, Marta; Chen, Peisong; Joshi, Rajan; Wang, Xianglin; Chien, Wei-Jung; Panchal, Rahul; Coban, Muhammed; Chong, In Suk; Reznik, Yuriy A.

2011-01-01

This paper describes video coding technology proposal submitted by Qualcomm Inc. in response to a joint call for proposal (CfP) issued by ITU-T SG16 Q.6 (VCEG) and ISO/IEC JTC1/SC29/WG11 (MPEG) in January 2010. Proposed video codec follows a hybrid coding approach based on temporal prediction, followed by transform, quantization, and entropy coding of the residual. Some of its key features are extended block sizes (up to 64x64), recursive integer transforms, single pass switched interpolation filters with offsets (single pass SIFO), mode dependent directional transform (MDDT) for intra-coding, luma and chroma high precision filtering, geometry motion partitioning, adaptive motion vector resolution. It also incorporates internal bit-depth increase (IBDI), and modified quadtree based adaptive loop filtering (QALF). Simulation results are presented for a variety of bit rates, resolutions and coding configurations to demonstrate the high compression efficiency achieved by the proposed video codec at moderate level of encoding and decoding complexity. For random access hierarchical B configuration (HierB), the proposed video codec achieves an average BD-rate reduction of 30.88c/o compared to the H.264/AVC alpha anchor. For low delay hierarchical P (HierP) configuration, the proposed video codec achieves an average BD-rate reduction of 32.96c/o and 48.57c/o, compared to the H.264/AVC beta and gamma anchors, respectively.

The Recursive Paradigm: Suppose We Already Knew.

ERIC Educational Resources Information Center

Maurer, Stephen B.

1995-01-01

Explains the recursive model in discrete mathematics through five examples and problems. Discusses the relationship between the recursive model, mathematical induction, and inductive reasoning and the relevance of these concepts in the school curriculum. Provides ideas for approaching this material with students. (Author/DDD)

Towards rigorous analysis of the Levitov-Mirlin-Evers recursion

NASA Astrophysics Data System (ADS)

Fyodorov, Y. V.; Kupiainen, A.; Webb, C.

2016-12-01

This paper aims to develop a rigorous asymptotic analysis of an approximate renormalization group recursion for inverse participation ratios P q of critical powerlaw random band matrices. The recursion goes back to the work by Mirlin and Evers (2000 Phys. Rev. B 62 7920) and earlier works by Levitov (1990 Phys. Rev. Lett. 64 547, 1999 Ann. Phys. 8 697-706) and is aimed to describe the ensuing multifractality of the eigenvectors of such matrices. We point out both similarities and dissimilarities between the LME recursion and those appearing in the theory of multiplicative cascades and branching random walks and show that the methods developed in those fields can be adapted to the present case. In particular the LME recursion is shown to exhibit a phase transition, which we expect is a freezing transition, where the role of temperature is played by the exponent q. However, the LME recursion has features that make its rigorous analysis considerably harder and we point out several open problems for further study.

The language faculty that wasn't: a usage-based account of natural language recursion

PubMed Central

Christiansen, Morten H.; Chater, Nick

2015-01-01

In the generative tradition, the language faculty has been shrinking—perhaps to include only the mechanism of recursion. This paper argues that even this view of the language faculty is too expansive. We first argue that a language faculty is difficult to reconcile with evolutionary considerations. We then focus on recursion as a detailed case study, arguing that our ability to process recursive structure does not rely on recursion as a property of the grammar, but instead emerges gradually by piggybacking on domain-general sequence learning abilities. Evidence from genetics, comparative work on non-human primates, and cognitive neuroscience suggests that humans have evolved complex sequence learning skills, which were subsequently pressed into service to accommodate language. Constraints on sequence learning therefore have played an important role in shaping the cultural evolution of linguistic structure, including our limited abilities for processing recursive structure. Finally, we re-evaluate some of the key considerations that have often been taken to require the postulation of a language faculty. PMID:26379567

The language faculty that wasn't: a usage-based account of natural language recursion.

PubMed

Christiansen, Morten H; Chater, Nick

2015-01-01

In the generative tradition, the language faculty has been shrinking-perhaps to include only the mechanism of recursion. This paper argues that even this view of the language faculty is too expansive. We first argue that a language faculty is difficult to reconcile with evolutionary considerations. We then focus on recursion as a detailed case study, arguing that our ability to process recursive structure does not rely on recursion as a property of the grammar, but instead emerges gradually by piggybacking on domain-general sequence learning abilities. Evidence from genetics, comparative work on non-human primates, and cognitive neuroscience suggests that humans have evolved complex sequence learning skills, which were subsequently pressed into service to accommodate language. Constraints on sequence learning therefore have played an important role in shaping the cultural evolution of linguistic structure, including our limited abilities for processing recursive structure. Finally, we re-evaluate some of the key considerations that have often been taken to require the postulation of a language faculty.

Improved Accuracy Using Recursive Bayesian Estimation Based Language Model Fusion in ERP-Based BCI Typing Systems

PubMed Central

Orhan, U.; Erdogmus, D.; Roark, B.; Oken, B.; Purwar, S.; Hild, K. E.; Fowler, A.; Fried-Oken, M.

2013-01-01

RSVP Keyboard™ is an electroencephalography (EEG) based brain computer interface (BCI) typing system, designed as an assistive technology for the communication needs of people with locked-in syndrome (LIS). It relies on rapid serial visual presentation (RSVP) and does not require precise eye gaze control. Existing BCI typing systems which uses event related potentials (ERP) in EEG suffer from low accuracy due to low signal-to-noise ratio. Henceforth, RSVP Keyboard™ utilizes a context based decision making via incorporating a language model, to improve the accuracy of letter decisions. To further improve the contributions of the language model, we propose recursive Bayesian estimation, which relies on non-committing string decisions, and conduct an offline analysis, which compares it with the existing naïve Bayesian fusion approach. The results indicate the superiority of the recursive Bayesian fusion and in the next generation of RSVP Keyboard™ we plan to incorporate this new approach. PMID:23366432

The nondeterministic divide

NASA Technical Reports Server (NTRS)

Charlesworth, Arthur

1990-01-01

The nondeterministic divide partitions a vector into two non-empty slices by allowing the point of division to be chosen nondeterministically. Support for high-level divide-and-conquer programming provided by the nondeterministic divide is investigated. A diva algorithm is a recursive divide-and-conquer sequential algorithm on one or more vectors of the same range, whose division point for a new pair of recursive calls is chosen nondeterministically before any computation is performed and whose recursive calls are made immediately after the choice of division point; also, access to vector components is only permitted during activations in which the vector parameters have unit length. The notion of diva algorithm is formulated precisely as a diva call, a restricted call on a sequential procedure. Diva calls are proven to be intimately related to associativity. Numerous applications of diva calls are given and strategies are described for translating a diva call into code for a variety of parallel computers. Thus diva algorithms separate logical correctness concerns from implementation concerns.

Multi-fidelity Gaussian process regression for prediction of random fields

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

Parussini, L.; Venturi, D., E-mail: venturi@ucsc.edu; Perdikaris, P.

We propose a new multi-fidelity Gaussian process regression (GPR) approach for prediction of random fields based on observations of surrogate models or hierarchies of surrogate models. Our method builds upon recent work on recursive Bayesian techniques, in particular recursive co-kriging, and extends it to vector-valued fields and various types of covariances, including separable and non-separable ones. The framework we propose is general and can be used to perform uncertainty propagation and quantification in model-based simulations, multi-fidelity data fusion, and surrogate-based optimization. We demonstrate the effectiveness of the proposed recursive GPR techniques through various examples. Specifically, we study the stochastic Burgersmore » equation and the stochastic Oberbeck–Boussinesq equations describing natural convection within a square enclosure. In both cases we find that the standard deviation of the Gaussian predictors as well as the absolute errors relative to benchmark stochastic solutions are very small, suggesting that the proposed multi-fidelity GPR approaches can yield highly accurate results.« less

Are Khovanov-Rozansky polynomials consistent with evolution in the space of knots?

NASA Astrophysics Data System (ADS)

Anokhina, A.; Morozov, A.

2018-04-01

R-coloured knot polynomials for m-strand torus knots Torus [ m, n] are described by the Rosso-Jones formula, which is an example of evolution in n with Lyapunov exponents, labelled by Young diagrams from R ⊗ m . This means that they satisfy a finite-difference equation (recursion) of finite degree. For the gauge group SL( N ) only diagrams with no more than N lines can contribute and the recursion degree is reduced. We claim that these properties (evolution/recursion and reduction) persist for Khovanov-Rozansky (KR) polynomials, obtained by additional factorization modulo 1 + t, which is not yet adequately described in quantum field theory. Also preserved is some weakened version of differential expansion, which is responsible at least for a simple relation between reduced and unreduced Khovanov polynomials. However, in the KR case evolution is incompatible with the mirror symmetry under the change n -→ - n, what can signal about an ambiguity in the KR factorization even for torus knots.

Predictive IP controller for robust position control of linear servo system.

PubMed

Lu, Shaowu; Zhou, Fengxing; Ma, Yajie; Tang, Xiaoqi

2016-07-01

Position control is a typical application of linear servo system. In this paper, to reduce the system overshoot, an integral plus proportional (IP) controller is used in the position control implementation. To further improve the control performance, a gain-tuning IP controller based on a generalized predictive control (GPC) law is proposed. Firstly, to represent the dynamics of the position loop, a second-order linear model is used and its model parameters are estimated on-line by using a recursive least squares method. Secondly, based on the GPC law, an optimal control sequence is obtained by using receding horizon, then directly supplies the IP controller with the corresponding control parameters in the real operations. Finally, simulation and experimental results are presented to show the efficiency of proposed scheme. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

Matrix pentagons

NASA Astrophysics Data System (ADS)

Belitsky, A. V.

2017-10-01

The Operator Product Expansion for null polygonal Wilson loop in planar maximally supersymmetric Yang-Mills theory runs systematically in terms of multi-particle pentagon transitions which encode the physics of excitations propagating on the color flux tube ending on the sides of the four-dimensional contour. Their dynamics was unraveled in the past several years and culminated in a complete description of pentagons as an exact function of the 't Hooft coupling. In this paper we provide a solution for the last building block in this program, the SU(4) matrix structure arising from internal symmetry indices of scalars and fermions. This is achieved by a recursive solution of the Mirror and Watson equations obeyed by the so-called singlet pentagons and fixing the form of the twisted component in their tensor decomposition. The non-singlet, or charged, pentagons are deduced from these by a limiting procedure.

Connectivity-Preserving Approach for Distributed Adaptive Synchronized Tracking of Networked Uncertain Nonholonomic Mobile Robots.

PubMed

Yoo, Sung Jin; Park, Bong Seok

2017-09-06

This paper addresses a distributed connectivity-preserving synchronized tracking problem of multiple uncertain nonholonomic mobile robots with limited communication ranges. The information of the time-varying leader robot is assumed to be accessible to only a small fraction of follower robots. The main contribution of this paper is to introduce a new distributed nonlinear error surface for dealing with both the synchronized tracking and the preservation of the initial connectivity patterns among nonholonomic robots. Based on this nonlinear error surface, the recursive design methodology is presented to construct the approximation-based local adaptive tracking scheme at the robot dynamic level. Furthermore, a technical lemma is established to analyze the stability and the connectivity preservation of the total closed-loop control system in the Lyapunov sense. An example is provided to illustrate the effectiveness of the proposed methodology.

Recursive sequences in first-year calculus

NASA Astrophysics Data System (ADS)

Krainer, Thomas

2016-02-01

This article provides ready-to-use supplementary material on recursive sequences for a second-semester calculus class. It equips first-year calculus students with a basic methodical procedure based on which they can conduct a rigorous convergence or divergence analysis of many simple recursive sequences on their own without the need to invoke inductive arguments as is typically required in calculus textbooks. The sequences that are accessible to this kind of analysis are predominantly (eventually) monotonic, but also certain recursive sequences that alternate around their limit point as they converge can be considered.

Hawking from Catalan

DOE PAGES

Fitzpatrick, A. Liam; Kaplan, Jared; Walters, Matthew T.; ...

2016-05-12

The Virasoro algebra determines all ‘graviton’ matrix elements in AdS 3/CFT 2. We study the explicit exchange of any number of Virasoro gravitons between heavy and light CFT 2 operators at large central charge. These graviton exchanges can be written in terms of new on-shell tree diagrams, organized in a perturbative expansion in h H/c, the heavy operator dimension divided by the central charge. The Virasoro vacuum conformal block, which is the sum of all the tree diagrams, obeys a differential recursion relation generalizing that of the Catalan numbers. Here, we use this recursion relation to sum the on-shell diagramsmore » to all orders, computing the Virasoro vacuum block. Extrapolating to large h H/c determines the Hawking temperature of a BTZ black hole in dual AdS 3 theories.« less

Hawking from Catalan

NASA Astrophysics Data System (ADS)

Fitzpatrick, A. Liam; Kaplan, Jared; Walters, Matthew T.; Wang, Junpu

2016-05-01

The Virasoro algebra determines all `graviton' matrix elements in AdS3/CFT2. We study the explicit exchange of any number of Virasoro gravitons between heavy and light CFT2 operators at large central charge. These graviton exchanges can be written in terms of new on-shell tree diagrams, organized in a perturbative expansion in h H /c, the heavy operator dimension divided by the central charge. The Virasoro vacuum conformal block, which is the sum of all the tree diagrams, obeys a differential recursion relation generalizing that of the Catalan numbers. We use this recursion relation to sum the on-shell diagrams to all orders, computing the Virasoro vacuum block. Extrapolating to large h H /c determines the Hawking temperature of a BTZ black hole in dual AdS3 theories.

Combinatorial games with a pass: a dynamical systems approach.

PubMed

Morrison, Rebecca E; Friedman, Eric J; Landsberg, Adam S

2011-12-01

By treating combinatorial games as dynamical systems, we are able to address a longstanding open question in combinatorial game theory, namely, how the introduction of a "pass" move into a game affects its behavior. We consider two well known combinatorial games, 3-pile Nim and 3-row Chomp. In the case of Nim, we observe that the introduction of the pass dramatically alters the game's underlying structure, rendering it considerably more complex, while for Chomp, the pass move is found to have relatively minimal impact. We show how these results can be understood by recasting these games as dynamical systems describable by dynamical recursion relations. From these recursion relations, we are able to identify underlying structural connections between these "games with passes" and a recently introduced class of "generic (perturbed) games." This connection, together with a (non-rigorous) numerical stability analysis, allows one to understand and predict the effect of a pass on a game.

How Resource Phenology Affects Consumer Population Dynamics.

PubMed

Bewick, Sharon; Cantrell, R Stephen; Cosner, Chris; Fagan, William F

2016-02-01

Climate change drives uneven phenology shifts across taxa, and this can result in changes to the phenological match between interacting species. Shifts in the relative phenology of partner species are well documented, but few studies have addressed the effects of such changes on population dynamics. To explore this, we develop a phenologically explicit model describing consumer-resource interactions. Focusing on scenarios for univoltine insects, we show how changes in resource phenology can be reinterpreted as transformations in the year-to-year recursion relationships defining consumer population dynamics. This perspective provides a straightforward path for interpreting the long-term population consequences of phenology change. Specifically, by relating the outcome of phenological shifts to species traits governing recursion relationships (e.g., consumer fecundity or competitive scenario), we demonstrate how changes in relative phenology can force systems into different dynamical regimes, with major implications for resource management, conservation, and other areas of applied dynamics.

Recursive Feature Extraction in Graphs

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

2014-08-14

ReFeX extracts recursive topological features from graph data. The input is a graph as a csv file and the output is a csv file containing feature values for each node in the graph. The features are based on topological counts in the neighborhoods of each nodes, as well as recursive summaries of neighbors' features.

Recursion, Language, and Starlings

ERIC Educational Resources Information Center

Corballis, Michael C.

2007-01-01

It has been claimed that recursion is one of the properties that distinguishes human language from any other form of animal communication. Contrary to this claim, a recent study purports to demonstrate center-embedded recursion in starlings. I show that the performance of the birds in this study can be explained by a counting strategy, without any…

Parametric output-only identification of time-varying structures using a kernel recursive extended least squares TARMA approach

NASA Astrophysics Data System (ADS)

Ma, Zhi-Sai; Liu, Li; Zhou, Si-Da; Yu, Lei; Naets, Frank; Heylen, Ward; Desmet, Wim

2018-01-01

The problem of parametric output-only identification of time-varying structures in a recursive manner is considered. A kernelized time-dependent autoregressive moving average (TARMA) model is proposed by expanding the time-varying model parameters onto the basis set of kernel functions in a reproducing kernel Hilbert space. An exponentially weighted kernel recursive extended least squares TARMA identification scheme is proposed, and a sliding-window technique is subsequently applied to fix the computational complexity for each consecutive update, allowing the method to operate online in time-varying environments. The proposed sliding-window exponentially weighted kernel recursive extended least squares TARMA method is employed for the identification of a laboratory time-varying structure consisting of a simply supported beam and a moving mass sliding on it. The proposed method is comparatively assessed against an existing recursive pseudo-linear regression TARMA method via Monte Carlo experiments and shown to be capable of accurately tracking the time-varying dynamics. Furthermore, the comparisons demonstrate the superior achievable accuracy, lower computational complexity and enhanced online identification capability of the proposed kernel recursive extended least squares TARMA approach.

A general transfer-function approach to noise filtering in open-loop quantum control

NASA Astrophysics Data System (ADS)

Viola, Lorenza

2015-03-01

Hamiltonian engineering via unitary open-loop quantum control provides a versatile and experimentally validated framework for manipulating a broad class of non-Markovian open quantum systems of interest, with applications ranging from dynamical decoupling and dynamically corrected quantum gates, to noise spectroscopy and quantum simulation. In this context, transfer-function techniques directly motivated by control engineering have proved invaluable for obtaining a transparent picture of the controlled dynamics in the frequency domain and for quantitatively analyzing performance. In this talk, I will show how to identify a computationally tractable set of ``fundamental filter functions,'' out of which arbitrary filter functions may be assembled up to arbitrary high order in principle. Besides avoiding the infinite recursive hierarchy of filter functions that arises in general control scenarios, this fundamental set suffices to characterize the error suppression capabilities of the control protocol in both the time and frequency domain. I will show, in particular, how the resulting notion of ``filtering order'' reveals conceptually distinct, albeit complementary, features of the controlled dynamics as compared to the ``cancellation order,'' traditionally defined in the Magnus sense. Implications for current quantum control experiments will be discussed. Work supported by the U.S. Army Research Office under Contract No. W911NF-14-1-0682.

Inner and Outer Recursive Neural Networks for Chemoinformatics Applications.

PubMed

Urban, Gregor; Subrahmanya, Niranjan; Baldi, Pierre

2018-02-26

Deep learning methods applied to problems in chemoinformatics often require the use of recursive neural networks to handle data with graphical structure and variable size. We present a useful classification of recursive neural network approaches into two classes, the inner and outer approach. The inner approach uses recursion inside the underlying graph, to essentially "crawl" the edges of the graph, while the outer approach uses recursion outside the underlying graph, to aggregate information over progressively longer distances in an orthogonal direction. We illustrate the inner and outer approaches on several examples. More importantly, we provide open-source implementations [available at www.github.com/Chemoinformatics/InnerOuterRNN and cdb.ics.uci.edu ] for both approaches in Tensorflow which can be used in combination with training data to produce efficient models for predicting the physical, chemical, and biological properties of small molecules.

Recursive Deadbeat Controller Design

NASA Technical Reports Server (NTRS)

Juang, Jer-Nan; Phan, Minh Q.

1997-01-01

This paper presents a recursive algorithm for a deadbeat predictive controller design. The method combines together the concepts of system identification and deadbeat controller designs. It starts with the multi-step output prediction equation and derives the control force in terms of past input and output time histories. The formulation thus derived satisfies simultaneously system identification and deadbeat controller design requirements. As soon as the coefficient matrices are identified satisfying the output prediction equation, no further work is required to compute the deadbeat control gain matrices. The method can be implemented recursively just as any typical recursive system identification techniques.

A basic recursion concept inventory

NASA Astrophysics Data System (ADS)

Hamouda, Sally; Edwards, Stephen H.; Elmongui, Hicham G.; Ernst, Jeremy V.; Shaffer, Clifford A.

2017-04-01

Recursion is both an important and a difficult topic for introductory Computer Science students. Students often develop misconceptions about the topic that need to be diagnosed and corrected. In this paper, we report on our initial attempts to develop a concept inventory that measures student misconceptions on basic recursion topics. We present a collection of misconceptions and difficulties encountered by students when learning introductory recursion as presented in a typical CS2 course. Based on this collection, a draft concept inventory in the form of a series of questions was developed and evaluated, with the question rubric tagged to the list of misconceptions and difficulties.

The Paradigm Recursion: Is It More Accessible When Introduced in Middle School?

ERIC Educational Resources Information Center

Gunion, Katherine; Milford, Todd; Stege, Ulrike

2009-01-01

Recursion is a programming paradigm as well as a problem solving strategy thought to be very challenging to grasp for university students. This article outlines a pilot study, which expands the age range of students exposed to the concept of recursion in computer science through instruction in a series of interesting and engaging activities. In…

A Preliminary Instrument for Measuring Students' Subjective Perceptions of Difficulties in Learning Recursion

ERIC Educational Resources Information Center

Lacave, Carmen; Molina, Ana I.; Redondo, Miguel A.

2018-01-01

Contribution: Findings are provided from an initial survey to evaluate the magnitude of the recursion problem from the student point of view. Background: A major difficulty that programming students must overcome--the learning of recursion--has been addressed by many authors, using various approaches, but none have considered how students perceive…

Using Spreadsheets to Help Students Think Recursively

ERIC Educational Resources Information Center

Webber, Robert P.

2012-01-01

Spreadsheets lend themselves naturally to recursive computations, since a formula can be defined as a function of one of more preceding cells. A hypothesized closed form for the "n"th term of a recursive sequence can be tested easily by using a spreadsheet to compute a large number of the terms. Similarly, a conjecture about the limit of a series…

Generalized Path Analysis and Generalized Simultaneous Equations Model for Recursive Systems with Responses of Mixed Types

ERIC Educational Resources Information Center

Tsai, Tien-Lung; Shau, Wen-Yi; Hu, Fu-Chang

2006-01-01

This article generalizes linear path analysis (PA) and simultaneous equations models (SiEM) to deal with mixed responses of different types in a recursive or triangular system. An efficient instrumental variable (IV) method for estimating the structural coefficients of a 2-equation partially recursive generalized path analysis (GPA) model and…

CREATIVE COMPUTATION.

DTIC Science & Technology

ARTIFICIAL INTELLIGENCE , RECURSIVE FUNCTIONS), (*RECURSIVE FUNCTIONS, ARTIFICIAL INTELLIGENCE ), (*MATHEMATICAL LOGIC, ARTIFICIAL INTELLIGENCE ), METAMATHEMATICS, AUTOMATA, NUMBER THEORY, INFORMATION THEORY, COMBINATORIAL ANALYSIS

On recursion.

PubMed

Watumull, Jeffrey; Hauser, Marc D; Roberts, Ian G; Hornstein, Norbert

2014-01-08

It is a truism that conceptual understanding of a hypothesis is required for its empirical investigation. However, the concept of recursion as articulated in the context of linguistic analysis has been perennially confused. Nowhere has this been more evident than in attempts to critique and extend Hauseretal's. (2002) articulation. These authors put forward the hypothesis that what is uniquely human and unique to the faculty of language-the faculty of language in the narrow sense (FLN)-is a recursive system that generates and maps syntactic objects to conceptual-intentional and sensory-motor systems. This thesis was based on the standard mathematical definition of recursion as understood by Gödel and Turing, and yet has commonly been interpreted in other ways, most notably and incorrectly as a thesis about the capacity for syntactic embedding. As we explain, the recursiveness of a function is defined independent of such output, whether infinite or finite, embedded or unembedded-existent or non-existent. And to the extent that embedding is a sufficient, though not necessary, diagnostic of recursion, it has not been established that the apparent restriction on embedding in some languages is of any theoretical import. Misunderstanding of these facts has generated research that is often irrelevant to the FLN thesis as well as to other theories of language competence that focus on its generative power of expression. This essay is an attempt to bring conceptual clarity to such discussions as well as to future empirical investigations by explaining three criterial properties of recursion: computability (i.e., rules in intension rather than lists in extension); definition by induction (i.e., rules strongly generative of structure); and mathematical induction (i.e., rules for the principled-and potentially unbounded-expansion of strongly generated structure). By these necessary and sufficient criteria, the grammars of all natural languages are recursive.

On recursion

PubMed Central

Watumull, Jeffrey; Hauser, Marc D.; Roberts, Ian G.; Hornstein, Norbert

2014-01-01

It is a truism that conceptual understanding of a hypothesis is required for its empirical investigation. However, the concept of recursion as articulated in the context of linguistic analysis has been perennially confused. Nowhere has this been more evident than in attempts to critique and extend Hauseretal's. (2002) articulation. These authors put forward the hypothesis that what is uniquely human and unique to the faculty of language—the faculty of language in the narrow sense (FLN)—is a recursive system that generates and maps syntactic objects to conceptual-intentional and sensory-motor systems. This thesis was based on the standard mathematical definition of recursion as understood by Gödel and Turing, and yet has commonly been interpreted in other ways, most notably and incorrectly as a thesis about the capacity for syntactic embedding. As we explain, the recursiveness of a function is defined independent of such output, whether infinite or finite, embedded or unembedded—existent or non-existent. And to the extent that embedding is a sufficient, though not necessary, diagnostic of recursion, it has not been established that the apparent restriction on embedding in some languages is of any theoretical import. Misunderstanding of these facts has generated research that is often irrelevant to the FLN thesis as well as to other theories of language competence that focus on its generative power of expression. This essay is an attempt to bring conceptual clarity to such discussions as well as to future empirical investigations by explaining three criterial properties of recursion: computability (i.e., rules in intension rather than lists in extension); definition by induction (i.e., rules strongly generative of structure); and mathematical induction (i.e., rules for the principled—and potentially unbounded—expansion of strongly generated structure). By these necessary and sufficient criteria, the grammars of all natural languages are recursive. PMID:24409164

Serial turbo trellis coded modulation using a serially concatenated coder

NASA Technical Reports Server (NTRS)

Divsalar, Dariush (Inventor); Dolinar, Samuel J. (Inventor); Pollara, Fabrizio (Inventor)

2010-01-01

Serial concatenated trellis coded modulation (SCTCM) includes an outer coder, an interleaver, a recursive inner coder and a mapping element. The outer coder receives data to be coded and produces outer coded data. The interleaver permutes the outer coded data to produce interleaved data. The recursive inner coder codes the interleaved data to produce inner coded data. The mapping element maps the inner coded data to a symbol. The recursive inner coder has a structure which facilitates iterative decoding of the symbols at a decoder system. The recursive inner coder and the mapping element are selected to maximize the effective free Euclidean distance of a trellis coded modulator formed from the recursive inner coder and the mapping element. The decoder system includes a demodulation unit, an inner SISO (soft-input soft-output) decoder, a deinterleaver, an outer SISO decoder, and an interleaver.

Things Fall Apart: A Recurrence of Tiling

ERIC Educational Resources Information Center

Rogers, Douglas G.

2005-01-01

A study investigates recurrence relations, sequences in which each term is determined by one or more previous terms. Results provide another approach to the problem of finding closed forms for recursively-defined sequences.

Full Gradient Solution to Adaptive Hybrid Control

NASA Technical Reports Server (NTRS)

Bean, Jacob; Schiller, Noah H.; Fuller, Chris

2017-01-01

This paper focuses on the adaptation mechanisms in adaptive hybrid controllers. Most adaptive hybrid controllers update two filters individually according to the filtered reference least mean squares (FxLMS) algorithm. Because this algorithm was derived for feedforward control, it does not take into account the presence of a feedback loop in the gradient calculation. This paper provides a derivation of the proper weight vector gradient for hybrid (or feedback) controllers that takes into account the presence of feedback. In this formulation, a single weight vector is updated rather than two individually. An internal model structure is assumed for the feedback part of the controller. The full gradient is equivalent to that used in the standard FxLMS algorithm with the addition of a recursive term that is a function of the modeling error. Some simulations are provided to highlight the advantages of using the full gradient in the weight vector update rather than the approximation.

Full Gradient Solution to Adaptive Hybrid Control

NASA Technical Reports Server (NTRS)

Bean, Jacob; Schiller, Noah H.; Fuller, Chris

2016-01-01

This paper focuses on the adaptation mechanisms in adaptive hybrid controllers. Most adaptive hybrid controllers update two filters individually according to the filtered-reference least mean squares (FxLMS) algorithm. Because this algorithm was derived for feedforward control, it does not take into account the presence of a feedback loop in the gradient calculation. This paper provides a derivation of the proper weight vector gradient for hybrid (or feedback) controllers that takes into account the presence of feedback. In this formulation, a single weight vector is updated rather than two individually. An internal model structure is assumed for the feedback part of the controller. The full gradient is equivalent to that used in the standard FxLMS algorithm with the addition of a recursive term that is a function of the modeling error. Some simulations are provided to highlight the advantages of using the full gradient in the weight vector update rather than the approximation.

Cascade control of superheated steam temperature with neuro-PID controller.

PubMed

Zhang, Jianhua; Zhang, Fenfang; Ren, Mifeng; Hou, Guolian; Fang, Fang

2012-11-01

In this paper, an improved cascade control methodology for superheated processes is developed, in which the primary PID controller is implemented by neural networks trained by minimizing error entropy criterion. The entropy of the tracking error can be estimated recursively by utilizing receding horizon window technique. The measurable disturbances in superheated processes are input to the neuro-PID controller besides the sequences of tracking error in outer loop control system, hence, feedback control is combined with feedforward control in the proposed neuro-PID controller. The convergent condition of the neural networks is analyzed. The implementation procedures of the proposed cascade control approach are summarized. Compared with the neuro-PID controller using minimizing squared error criterion, the proposed neuro-PID controller using minimizing error entropy criterion may decrease fluctuations of the superheated steam temperature. A simulation example shows the advantages of the proposed method. Copyright © 2012 ISA. Published by Elsevier Ltd. All rights reserved.

Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes. Part 3; A Recursive Maximum Likelihood Decoding

NASA Technical Reports Server (NTRS)

Lin, Shu; Fossorier, Marc

1998-01-01

The Viterbi algorithm is indeed a very simple and efficient method of implementing the maximum likelihood decoding. However, if we take advantage of the structural properties in a trellis section, other efficient trellis-based decoding algorithms can be devised. Recently, an efficient trellis-based recursive maximum likelihood decoding (RMLD) algorithm for linear block codes has been proposed. This algorithm is more efficient than the conventional Viterbi algorithm in both computation and hardware requirements. Most importantly, the implementation of this algorithm does not require the construction of the entire code trellis, only some special one-section trellises of relatively small state and branch complexities are needed for constructing path (or branch) metric tables recursively. At the end, there is only one table which contains only the most likely code-word and its metric for a given received sequence r = (r(sub 1), r(sub 2),...,r(sub n)). This algorithm basically uses the divide and conquer strategy. Furthermore, it allows parallel/pipeline processing of received sequences to speed up decoding.

Language, Mind, Practice: Families of Recursive Thinking in Human Reasoning

ERIC Educational Resources Information Center

Josephson, Marika

2011-01-01

In 2002, Chomsky, Hauser, and Fitch asserted that recursion may be the one aspect of the human language faculty that makes human language unique in the narrow sense--unique to language and unique to human beings. They also argue somewhat more quietly (as do Pinker and Jackendoff 2005) that recursion may be possible outside of language: navigation,…

Recursive regularization for inferring gene networks from time-course gene expression profiles

PubMed Central

Shimamura, Teppei; Imoto, Seiya; Yamaguchi, Rui; Fujita, André; Nagasaki, Masao; Miyano, Satoru

2009-01-01

Background Inferring gene networks from time-course microarray experiments with vector autoregressive (VAR) model is the process of identifying functional associations between genes through multivariate time series. This problem can be cast as a variable selection problem in Statistics. One of the promising methods for variable selection is the elastic net proposed by Zou and Hastie (2005). However, VAR modeling with the elastic net succeeds in increasing the number of true positives while it also results in increasing the number of false positives. Results By incorporating relative importance of the VAR coefficients into the elastic net, we propose a new class of regularization, called recursive elastic net, to increase the capability of the elastic net and estimate gene networks based on the VAR model. The recursive elastic net can reduce the number of false positives gradually by updating the importance. Numerical simulations and comparisons demonstrate that the proposed method succeeds in reducing the number of false positives drastically while keeping the high number of true positives in the network inference and achieves two or more times higher true discovery rate (the proportion of true positives among the selected edges) than the competing methods even when the number of time points is small. We also compared our method with various reverse-engineering algorithms on experimental data of MCF-7 breast cancer cells stimulated with two ErbB ligands, EGF and HRG. Conclusion The recursive elastic net is a powerful tool for inferring gene networks from time-course gene expression profiles. PMID:19386091

Binary recursive partitioning: background, methods, and application to psychology.

PubMed

Merkle, Edgar C; Shaffer, Victoria A

2011-02-01

Binary recursive partitioning (BRP) is a computationally intensive statistical method that can be used in situations where linear models are often used. Instead of imposing many assumptions to arrive at a tractable statistical model, BRP simply seeks to accurately predict a response variable based on values of predictor variables. The method outputs a decision tree depicting the predictor variables that were related to the response variable, along with the nature of the variables' relationships. No significance tests are involved, and the tree's 'goodness' is judged based on its predictive accuracy. In this paper, we describe BRP methods in a detailed manner and illustrate their use in psychological research. We also provide R code for carrying out the methods.

Recursiveness in learning processes: An analogy to help software development for ABA intervention for autistic kids

NASA Astrophysics Data System (ADS)

Presti, Giovambattista; Premarini, Claudio; Leuzzi, Martina; Di Blasi, Melina; Squatrito, Valeria

2017-11-01

The operant was conceptualized by Skinner as a class of behaviors which have common effect on the environment and that, as a class can be shown to vary lawfully in their relations to the other environmental variables, namely antecedents and consequences. And Skinner himself underlined the fact that "operant field is the very field purpose of behavior". The operant offers interesting basic and applied characteristic to conceptualize complex behavior as a recursive process of learning. In this paper we will discuss how the operant concept can be applied in the implementation of software oriented to increase cognitive skills in autistic children and provide an example.

Off-shell amplitudes as boundary integrals of analytically continued Wilson line slope

NASA Astrophysics Data System (ADS)

Kotko, P.; Serino, M.; Stasto, A. M.

2016-08-01

One of the methods to calculate tree-level multi-gluon scattering amplitudes is to use the Berends-Giele recursion relation involving off-shell currents or off-shell amplitudes, if working in the light cone gauge. As shown in recent works using the light-front perturbation theory, solutions to these recursions naturally collapse into gauge invariant and gauge-dependent components, at least for some helicity configurations. In this work, we show that such structure is helicity independent and emerges from analytic properties of matrix elements of Wilson line operators, where the slope of the straight gauge path is shifted in a certain complex direction. This is similar to the procedure leading to the Britto-Cachazo-Feng-Witten (BCFW) recursion, however we apply a complex shift to the Wilson line slope instead of the external momenta. While in the original BCFW procedure the boundary integrals over the complex shift vanish for certain deformations, here they are non-zero and are equal to the off-shell amplitudes. The main result can thus be summarized as follows: we derive a decomposition of a helicity-fixed off-shell current into gauge invariant component given by a matrix element of a straight Wilson line plus a reminder given by a sum of products of gauge invariant and gauge dependent quantities. We give several examples realizing this relation, including the five-point next-to-MHV helicity configuration.

Recursive heuristic classification

NASA Technical Reports Server (NTRS)

Wilkins, David C.

1994-01-01

The author will describe a new problem-solving approach called recursive heuristic classification, whereby a subproblem of heuristic classification is itself formulated and solved by heuristic classification. This allows the construction of more knowledge-intensive classification programs in a way that yields a clean organization. Further, standard knowledge acquisition and learning techniques for heuristic classification can be used to create, refine, and maintain the knowledge base associated with the recursively called classification expert system. The method of recursive heuristic classification was used in the Minerva blackboard shell for heuristic classification. Minerva recursively calls itself every problem-solving cycle to solve the important blackboard scheduler task, which involves assigning a desirability rating to alternative problem-solving actions. Knowing these ratings is critical to the use of an expert system as a component of a critiquing or apprenticeship tutoring system. One innovation of this research is a method called dynamic heuristic classification, which allows selection among dynamically generated classification categories instead of requiring them to be prenumerated.

Syntactic Recursion Facilitates and Working Memory Predicts Recursive Theory of Mind

PubMed Central

Arslan, Burcu; Hohenberger, Annette; Verbrugge, Rineke

2017-01-01

In this study, we focus on the possible roles of second-order syntactic recursion and working memory in terms of simple and complex span tasks in the development of second-order false belief reasoning. We tested 89 Turkish children in two age groups, one younger (4;6–6;5 years) and one older (6;7–8;10 years). Although second-order syntactic recursion is significantly correlated with the second-order false belief task, results of ordinal logistic regressions revealed that the main predictor of second-order false belief reasoning is complex working memory span. Unlike simple working memory and second-order syntactic recursion tasks, the complex working memory task required processing information serially with additional reasoning demands that require complex working memory strategies. Based on our results, we propose that children’s second-order theory of mind develops when they have efficient reasoning rules to process embedded beliefs serially, thus overcoming a possible serial processing bottleneck. PMID:28072823

Recursive formulas for determining perturbing accelerations in intermediate satellite motion

NASA Astrophysics Data System (ADS)

Stoianov, L.

Recursive formulas for Legendre polynomials and associated Legendre functions are used to obtain recursive relationships for determining acceleration components which perturb intermediate satellite motion. The formulas are applicable in all cases when the perturbation force function is presented as a series in spherical functions (gravitational, tidal, thermal, geomagnetic, and other perturbations of intermediate motion). These formulas can be used to determine the order of perturbing accelerations.

Power and Roots by Recursion.

ERIC Educational Resources Information Center

Aieta, Joseph F.

1987-01-01

This article illustrates how questions from elementary finance can serve as motivation for studying high order powers, roots, and exponential functions using Logo procedures. A second discussion addresses a relatively unknown algorithm for the trigonometric exponential and hyperbolic functions. (PK)

Comparison of methods for developing the dynamics of rigid-body systems

NASA Technical Reports Server (NTRS)

Ju, M. S.; Mansour, J. M.

1989-01-01

Several approaches for developing the equations of motion for a three-degree-of-freedom PUMA robot were compared on the basis of computational efficiency (i.e., the number of additions, subtractions, multiplications, and divisions). Of particular interest was the investigation of the use of computer algebra as a tool for developing the equations of motion. Three approaches were implemented algebraically: Lagrange's method, Kane's method, and Wittenburg's method. Each formulation was developed in absolute and relative coordinates. These six cases were compared to each other and to a recursive numerical formulation. The results showed that all of the formulations implemented algebraically required fewer calculations than the recursive numerical algorithm. The algebraic formulations required fewer calculations in absolute coordinates than in relative coordinates. Each of the algebraic formulations could be simplified, using patterns from Kane's method, to yield the same number of calculations in a given coordinate system.

Application of recursive approaches to differential orbit correction of near Earth asteroids

NASA Astrophysics Data System (ADS)

Dmitriev, Vasily; Lupovka, Valery; Gritsevich, Maria

2016-10-01

Comparison of three approaches to the differential orbit correction of celestial bodies was performed: batch least squares fitting, Kalman filter, and recursive least squares filter. The first two techniques are well known and widely used (Montenbruck, O. & Gill, E., 2000). The most attention is paid to the algorithm and details of program realization of recursive least squares filter. The filter's algorithm was derived based on recursive least squares technique that are widely used in data processing applications (Simon, D, 2006). Usage recursive least squares filter, makes possible to process a new set of observational data, without reprocessing data, which has been processed before. Specific feature of such approach is that number of observation in data set may be variable. This feature makes recursive least squares filter more flexible approach compare to batch least squares (process complete set of observations in each iteration) and Kalman filtering (suppose updating state vector on each epoch with measurements).Advantages of proposed approach are demonstrated by processing of real astrometric observations of near Earth asteroids. The case of 2008 TC3 was studied. 2008 TC3 was discovered just before its impact with Earth. There are a many closely spaced observations of 2008 TC3 on the interval between discovering and impact, which creates favorable conditions for usage of recursive approaches. Each of approaches has very similar precision in case of 2008 TC3. At the same time, recursive least squares approaches have much higher performance. Thus, this approach more favorable for orbit fitting of a celestial body, which was detected shortly before the collision or close approach to the Earth.This work was carried out at MIIGAiK and supported by the Russian Science Foundation, Project no. 14-22-00197.References:O. Montenbruck and E. Gill, "Satellite Orbits, Models, Methods and Applications," Springer-Verlag, 2000, pp. 1-369.D. Simon, "Optimal State Estimation: Kalman, H Infinity, and Nonlinear Approaches",1 edition. Hoboken, N.J.: Wiley-Interscience, 2006.

Sliding-mode control combined with improved adaptive feedforward for wafer scanner

NASA Astrophysics Data System (ADS)

Li, Xiaojie; Wang, Yiguang

2018-03-01

In this paper, a sliding-mode control method combined with improved adaptive feedforward is proposed for wafer scanner to improve the tracking performance of the closed-loop system. Particularly, In addition to the inverse model, the nonlinear force ripple effect which may degrade the tracking accuracy of permanent magnet linear motor (PMLM) is considered in the proposed method. The dominant position periodicity of force ripple is determined by using the Fast Fourier Transform (FFT) analysis for experimental data and the improved feedforward control is achieved by the online recursive least-squares (RLS) estimation of the inverse model and the force ripple. The improved adaptive feedforward is given in a general form of nth-order model with force ripple effect. This proposed method is motivated by the motion controller design of the long-stroke PMLM and short-stroke voice coil motor for wafer scanner. The stability of the closed-loop control system and the convergence of the motion tracking are guaranteed by the proposed sliding-mode feedback and adaptive feedforward methods theoretically. Comparative experiments on a precision linear motion platform can verify the correctness and effectiveness of the proposed method. The experimental results show that comparing to traditional method the proposed one has better performance of rapidity and robustness, especially for high speed motion trajectory. And, the improvements on both tracking accuracy and settling time can be achieved.

Finite-Horizon H∞ Consensus Control of Time-Varying Multiagent Systems With Stochastic Communication Protocol.

PubMed

Zou, Lei; Wang, Zidong; Gao, Huijun; Alsaadi, Fuad E

2017-03-31

This paper is concerned with the distributed H∞ consensus control problem for a discrete time-varying multiagent system with the stochastic communication protocol (SCP). A directed graph is used to characterize the communication topology of the multiagent network. The data transmission between each agent and the neighboring ones is implemented via a constrained communication channel where only one neighboring agent is allowed to transmit data at each time instant. The SCP is applied to schedule the signal transmission of the multiagent system. A sequence of random variables is utilized to capture the scheduling behavior of the SCP. By using the mapping technology combined with the Hadamard product, the closed-loop multiagent system is modeled as a time-varying system with a stochastic parameter matrix. The purpose of the addressed problem is to design a cooperative controller for each agent such that, for all probabilistic scheduling behaviors, the H∞ consensus performance is achieved over a given finite horizon for the closed-loop multiagent system. A necessary and sufficient condition is derived to ensure the H∞ consensus performance based on the completing squares approach and the stochastic analysis technique. Then, the controller parameters are obtained by solving two coupled backward recursive Riccati difference equations. Finally, a numerical example is given to illustrate the effectiveness of the proposed controller design scheme.

Fostering Recursive Thinking in Combinatorics through the Use of Manipulatives and Computing Technology.

ERIC Educational Resources Information Center

Abramovich, Sergei; Pieper, Anne

1996-01-01

Describes the use of manipulatives for solving simple combinatorial problems which can lead to the discovery of recurrence relations for permutations and combinations. Numerical evidence and visual imagery generated by a computer spreadsheet through modeling these relations can enable students to experience the ease and power of combinatorial…

Virasoro constraints and polynomial recursion for the linear Hodge integrals

NASA Astrophysics Data System (ADS)

Guo, Shuai; Wang, Gehao

2017-04-01

The Hodge tau-function is a generating function for the linear Hodge integrals. It is also a tau-function of the KP hierarchy. In this paper, we first present the Virasoro constraints for the Hodge tau-function in the explicit form of the Virasoro equations. The expression of our Virasoro constraints is simply a linear combination of the Virasoro operators, where the coefficients are restored from a power series for the Lambert W function. Then, using this result, we deduce a simple version of the Virasoro constraints for the linear Hodge partition function, where the coefficients are restored from the Gamma function. Finally, we establish the equivalence relation between the Virasoro constraints and polynomial recursion formula for the linear Hodge integrals.

Estimation of correlation functions by stochastic approximation.

NASA Technical Reports Server (NTRS)

Habibi, A.; Wintz, P. A.

1972-01-01

Consideration of the autocorrelation function of a zero-mean stationary random process. The techniques are applicable to processes with nonzero mean provided the mean is estimated first and subtracted. Two recursive techniques are proposed, both of which are based on the method of stochastic approximation and assume a functional form for the correlation function that depends on a number of parameters that are recursively estimated from successive records. One technique uses a standard point estimator of the correlation function to provide estimates of the parameters that minimize the mean-square error between the point estimates and the parametric function. The other technique provides estimates of the parameters that maximize a likelihood function relating the parameters of the function to the random process. Examples are presented.

Improvement in Recursive Hierarchical Segmentation of Data

NASA Technical Reports Server (NTRS)

Tilton, James C.

2006-01-01

A further modification has been made in the algorithm and implementing software reported in Modified Recursive Hierarchical Segmentation of Data (GSC- 14681-1), NASA Tech Briefs, Vol. 30, No. 6 (June 2006), page 51. That software performs recursive hierarchical segmentation of data having spatial characteristics (e.g., spectral-image data). The output of a prior version of the software contained artifacts, including spurious segmentation-image regions bounded by processing-window edges. The modification for suppressing the artifacts, mentioned in the cited article, was addition of a subroutine that analyzes data in the vicinities of seams to find pairs of regions that tend to lie adjacent to each other on opposite sides of the seams. Within each such pair, pixels in one region that are more similar to pixels in the other region are reassigned to the other region. The present modification provides for a parameter ranging from 0 to 1 for controlling the relative priority of merges between spatially adjacent and spatially non-adjacent regions. At 1, spatially-adjacent-/spatially- non-adjacent-region merges have equal priority. At 0, only spatially-adjacent-region merges (no spectral clustering) are allowed. Between 0 and 1, spatially-adjacent- region merges have priority over spatially- non-adjacent ones.

Probabilistic multi-person localisation and tracking in image sequences

NASA Astrophysics Data System (ADS)

Klinger, T.; Rottensteiner, F.; Heipke, C.

2017-05-01

The localisation and tracking of persons in image sequences in commonly guided by recursive filters. Especially in a multi-object tracking environment, where mutual occlusions are inherent, the predictive model is prone to drift away from the actual target position when not taking context into account. Further, if the image-based observations are imprecise, the trajectory is prone to be updated towards a wrong position. In this work we address both these problems by using a new predictive model on the basis of Gaussian Process Regression, and by using generic object detection, as well as instance-specific classification, for refined localisation. The predictive model takes into account the motion of every tracked pedestrian in the scene and the prediction is executed with respect to the velocities of neighbouring persons. In contrast to existing methods our approach uses a Dynamic Bayesian Network in which the state vector of a recursive Bayes filter, as well as the location of the tracked object in the image, are modelled as unknowns. This allows the detection to be corrected before it is incorporated into the recursive filter. Our method is evaluated on a publicly available benchmark dataset and outperforms related methods in terms of geometric precision and tracking accuracy.

Adaptive mesh refinement for characteristic grids

NASA Astrophysics Data System (ADS)

Thornburg, Jonathan

2011-05-01

I consider techniques for Berger-Oliger adaptive mesh refinement (AMR) when numerically solving partial differential equations with wave-like solutions, using characteristic (double-null) grids. Such AMR algorithms are naturally recursive, and the best-known past Berger-Oliger characteristic AMR algorithm, that of Pretorius and Lehner (J Comp Phys 198:10, 2004), recurses on individual "diamond" characteristic grid cells. This leads to the use of fine-grained memory management, with individual grid cells kept in two-dimensional linked lists at each refinement level. This complicates the implementation and adds overhead in both space and time. Here I describe a Berger-Oliger characteristic AMR algorithm which instead recurses on null slices. This algorithm is very similar to the usual Cauchy Berger-Oliger algorithm, and uses relatively coarse-grained memory management, allowing entire null slices to be stored in contiguous arrays in memory. The algorithm is very efficient in both space and time. I describe discretizations yielding both second and fourth order global accuracy. My code implementing the algorithm described here is included in the electronic supplementary materials accompanying this paper, and is freely available to other researchers under the terms of the GNU general public license.

Drug drug interaction extraction from the literature using a recursive neural network

PubMed Central

Lim, Sangrak; Lee, Kyubum

2018-01-01

Detecting drug-drug interactions (DDI) is important because information on DDIs can help prevent adverse effects from drug combinations. Since there are many new DDI-related papers published in the biomedical domain, manually extracting DDI information from the literature is a laborious task. However, text mining can be used to find DDIs in the biomedical literature. Among the recently developed neural networks, we use a Recursive Neural Network to improve the performance of DDI extraction. Our recursive neural network model uses a position feature, a subtree containment feature, and an ensemble method to improve the performance of DDI extraction. Compared with the state-of-the-art models, the DDI detection and type classifiers of our model performed 4.4% and 2.8% better, respectively, on the DDIExtraction Challenge’13 test data. We also validated our model on the PK DDI corpus that consists of two types of DDIs data: in vivo DDI and in vitro DDI. Compared with the existing model, our detection classifier performed 2.3% and 6.7% better on in vivo and in vitro data respectively. The results of our validation demonstrate that our model can automatically extract DDIs better than existing models. PMID:29373599

A combination of spatial and recursive temporal filtering for noise reduction when using region of interest (ROI) fluoroscopy for patient dose reduction in image guided vascular interventions with significant anatomical motion

NASA Astrophysics Data System (ADS)

Setlur Nagesh, S. V.; Khobragade, P.; Ionita, C.; Bednarek, D. R.; Rudin, S.

2015-03-01

Because x-ray based image-guided vascular interventions are minimally invasive they are currently the most preferred method of treating disorders such as stroke, arterial stenosis, and aneurysms; however, the x-ray exposure to the patient during long image-guided interventional procedures could cause harmful effects such as cancer in the long run and even tissue damage in the short term. ROI fluoroscopy reduces patient dose by differentially attenuating the incident x-rays outside the region-of-interest. To reduce the noise in the dose-reduced regions previously recursive temporal filtering was successfully demonstrated for neurovascular interventions. However, in cardiac interventions, anatomical motion is significant and excessive recursive filtering could cause blur. In this work the effects of three noise-reduction schemes, including recursive temporal filtering, spatial mean filtering, and a combination of spatial and recursive temporal filtering, were investigated in a simulated ROI dose-reduced cardiac intervention. First a model to simulate the aortic arch and its movement was built. A coronary stent was used to simulate a bioprosthetic valve used in TAVR procedures and was deployed under dose-reduced ROI fluoroscopy during the simulated heart motion. The images were then retrospectively processed for noise reduction in the periphery, using recursive temporal filtering, spatial filtering and a combination of both. Quantitative metrics for all three noise reduction schemes are calculated and are presented as results. From these it can be concluded that with significant anatomical motion, a combination of spatial and recursive temporal filtering scheme is best suited for reducing the excess quantum noise in the periphery. This new noise-reduction technique in combination with ROI fluoroscopy has the potential for substantial patient-dose savings in cardiac interventions.

Recursive Implementations of the Consider Filter

NASA Technical Reports Server (NTRS)

Zanetti, Renato; DSouza, Chris

2012-01-01

One method to account for parameters errors in the Kalman filter is to consider their effect in the so-called Schmidt-Kalman filter. This work addresses issues that arise when implementing a consider Kalman filter as a real-time, recursive algorithm. A favorite implementation of the Kalman filter as an onboard navigation subsystem is the UDU formulation. A new way to implement a UDU consider filter is proposed. The non-optimality of the recursive consider filter is also analyzed, and a modified algorithm is proposed to overcome this limitation.

Recursive computer architecture for VLSI

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

Treleaven, P.C.; Hopkins, R.P.

1982-01-01

A general-purpose computer architecture based on the concept of recursion and suitable for VLSI computer systems built from replicated (lego-like) computing elements is presented. The recursive computer architecture is defined by presenting a program organisation, a machine organisation and an experimental machine implementation oriented to VLSI. The experimental implementation is being restricted to simple, identical microcomputers each containing a memory, a processor and a communications capability. This future generation of lego-like computer systems are termed fifth generation computers by the Japanese. 30 references.

A Synthetic Recursive “+1” Pathway for Carbon Chain Elongation

PubMed Central

Marcheschi, Ryan J.; Li, Han; Zhang, Kechun; Noey, Elizabeth L.; Kim, Seonah; Chaubey, Asha; Houk, K. N.; Liao, James C.

2013-01-01

Nature uses four methods of carbon chain elongation for the production of 2-ketoacids, fatty acids, polyketides, and isoprenoids. Using a combination of quantum mechanical (QM) modeling, protein–substrate modeling, and protein and metabolic engineering, we have engineered the enzymes involved in leucine biosynthesis for use as a synthetic “+1” recursive metabolic pathway to extend the carbon chain of 2-ketoacids. This modified pathway preferentially selects longer-chain substrates for catalysis, as compared to the non-recursive natural pathway, and can recursively catalyze five elongation cycles to synthesize bulk chemicals, such as 1-heptanol, 1-octanol, and phenylpropanol directly from glucose. The “+1” chemistry is a valuable metabolic tool in addition to the “+5” chemistry and “+2” chemistry for the biosynthesis of isoprenoids, fatty acids, or polyketides. PMID:22242720

A recursive field-normalized bibliometric performance indicator: an application to the field of library and information science.

PubMed

Waltman, Ludo; Yan, Erjia; van Eck, Nees Jan

2011-10-01

Two commonly used ideas in the development of citation-based research performance indicators are the idea of normalizing citation counts based on a field classification scheme and the idea of recursive citation weighing (like in PageRank-inspired indicators). We combine these two ideas in a single indicator, referred to as the recursive mean normalized citation score indicator, and we study the validity of this indicator. Our empirical analysis shows that the proposed indicator is highly sensitive to the field classification scheme that is used. The indicator also has a strong tendency to reinforce biases caused by the classification scheme. Based on these observations, we advise against the use of indicators in which the idea of normalization based on a field classification scheme and the idea of recursive citation weighing are combined.

A spatial operator algebra for manipulator modeling and control

NASA Technical Reports Server (NTRS)

Rodriguez, G.; Kreutz, K.; Milman, M.

1988-01-01

A powerful new spatial operator algebra for modeling, control, and trajectory design of manipulators is discussed along with its implementation in the Ada programming language. Applications of this algebra to robotics include an operator representation of the manipulator Jacobian matrix; the robot dynamical equations formulated in terms of the spatial algebra, showing the complete equivalence between the recursive Newton-Euler formulations to robot dynamics; the operator factorization and inversion of the manipulator mass matrix which immediately results in O(N) recursive forward dynamics algorithms; the joint accelerations of a manipulator due to a tip contact force; the recursive computation of the equivalent mass matrix as seen at the tip of a manipulator; and recursive forward dynamics of a closed chain system. Finally, additional applications and current research involving the use of the spatial operator algebra are discussed in general terms.

Mining IP to Domain Name Interactions to Detect DNS Flood Attacks on Recursive DNS Servers.

PubMed

Alonso, Roberto; Monroy, Raúl; Trejo, Luis A

2016-08-17

The Domain Name System (DNS) is a critical infrastructure of any network, and, not surprisingly a common target of cybercrime. There are numerous works that analyse higher level DNS traffic to detect anomalies in the DNS or any other network service. By contrast, few efforts have been made to study and protect the recursive DNS level. In this paper, we introduce a novel abstraction of the recursive DNS traffic to detect a flooding attack, a kind of Distributed Denial of Service (DDoS). The crux of our abstraction lies on a simple observation: Recursive DNS queries, from IP addresses to domain names, form social groups; hence, a DDoS attack should result in drastic changes on DNS social structure. We have built an anomaly-based detection mechanism, which, given a time window of DNS usage, makes use of features that attempt to capture the DNS social structure, including a heuristic that estimates group composition. Our detection mechanism has been successfully validated (in a simulated and controlled setting) and with it the suitability of our abstraction to detect flooding attacks. To the best of our knowledge, this is the first time that work is successful in using this abstraction to detect these kinds of attacks at the recursive level. Before concluding the paper, we motivate further research directions considering this new abstraction, so we have designed and tested two additional experiments which exhibit promising results to detect other types of anomalies in recursive DNS servers.

Mining IP to Domain Name Interactions to Detect DNS Flood Attacks on Recursive DNS Servers

PubMed Central

Alonso, Roberto; Monroy, Raúl; Trejo, Luis A.

2016-01-01

The Domain Name System (DNS) is a critical infrastructure of any network, and, not surprisingly a common target of cybercrime. There are numerous works that analyse higher level DNS traffic to detect anomalies in the DNS or any other network service. By contrast, few efforts have been made to study and protect the recursive DNS level. In this paper, we introduce a novel abstraction of the recursive DNS traffic to detect a flooding attack, a kind of Distributed Denial of Service (DDoS). The crux of our abstraction lies on a simple observation: Recursive DNS queries, from IP addresses to domain names, form social groups; hence, a DDoS attack should result in drastic changes on DNS social structure. We have built an anomaly-based detection mechanism, which, given a time window of DNS usage, makes use of features that attempt to capture the DNS social structure, including a heuristic that estimates group composition. Our detection mechanism has been successfully validated (in a simulated and controlled setting) and with it the suitability of our abstraction to detect flooding attacks. To the best of our knowledge, this is the first time that work is successful in using this abstraction to detect these kinds of attacks at the recursive level. Before concluding the paper, we motivate further research directions considering this new abstraction, so we have designed and tested two additional experiments which exhibit promising results to detect other types of anomalies in recursive DNS servers. PMID:27548169

Model-based observer and feedback control design for a rigid Joukowski foil in a Kármán vortex street.

PubMed

Free, Brian A; Paley, Derek A

2018-03-14

Obstacles and swimming fish in flow create a wake with an alternating left/right vortex pattern known as a Kármán vortex street and reverse Kármán vortex street, respectively. An energy-efficient fish behavior resembling slaloming through the vortex street is called Kármán gaiting. This paper describes the use of a bioinspired array of pressure sensors on a Joukowski foil to estimate and control flow-relative position in a Kármán vortex street using potential flow theory, recursive Bayesian filtering, and trajectory-tracking feedback control. The Joukowski foil is fixed in downstream position in a flowing water channel and free to move on air bearings in the cross-stream direction by controlling its angle of attack to generate lift. Inspired by the lateral-line neuromasts found in fish, the sensing and control scheme is validated using off-the-shelf pressure sensors in an experimental testbed that includes a flapping device to create vortices. We derive a potential flow model that describes the flow over a Joukowski foil in a Kármán vortex street and identify an optimal path through a Kármán vortex street using empirical observability. The optimally observable trajectory is one that passes through each vortex in the street. The estimated vorticity and location of the Kármán vortex street are used in a closed-loop control to track either the optimally observable path or the energetically efficient gait exhibited by fish. Results from the closed-loop control experiments in the flow tank show that the artificial lateral line in conjunction with a potential flow model and Bayesian estimator allow the robot to perform fish-like slaloming behavior in a Kármán vortex street. This work is a precursor to an autonomous robotic fish sensing the wake of another fish and/or performing pursuit and schooling behavior.

[The prehistory of mathematics and the modern mind: mathematical thought and resourcefulness in the Palaeolithic Franco-Cantabrian region].

PubMed

González Redondo, Francisco A; Martín-Loeches, Manuel; Silván Pobes, Enrique

2010-01-01

In the present article, we begin by reviewing the different types of symbolic records produced by prehistoric groups from the oldest probable origins of the modern human mind. Next, we review some of the most outstanding prehistoric pieces related to counting, enhancing the relevance (both quantitatively and qualitatively) of this type of piece in the Franco-Cantabrian region. These reviews lead us finally to note the tremendous relevance, within this context, of four horse-bone plaques from the Altamira Cave, dated in the Solutrean period (18,500 years). These small plaques, apparently constituting a coherent group of interrelated elements, are proposed here as the representation of a recursive process, recursion being a feature proposed as proper and exclusive of human language.

Method to study complex systems of mesons in lattice QCD

DOE PAGES

Detmold, William; Savage, Martin J.

2010-07-30

Correlation functions involving many hadrons allow finite density systems to be explored with Lattice QCD. Recently, systems with up to 12more » $$\\pi^+$$'s or $K^+$'s have been studied to determine the the $3$-$$\\pi^+$$ and $3$-$K^+$ interactions and the corresponding chemical potential has been determined as a function of density in each case. We derive recursion relations between correlation functions that allow us to extend this work to systems of arbitrary numbers of mesons and to systems containing arbitrary different types of mesons such as $$\\pi^+$$'s, $K^+$'s, $D^0$'s and $B^+$'s. These relations allow for the study of finite-density systems in arbitrary volumes, and the study of high-density systems. Systems comprised of up to N=12 m mesons can be explored with Lattice QCD calculations utilizing $m$ different sources for the quark propagators. As the recursion relations require only a small, N-independent, number of operations to derive the N+1 meson contractions from the N meson contractions, they are compuationally feasible.« less

Recursive inverse kinematics for robot arms via Kalman filtering and Bryson-Frazier smoothing

NASA Technical Reports Server (NTRS)

Rodriguez, G.; Scheid, R. E., Jr.

1987-01-01

This paper applies linear filtering and smoothing theory to solve recursively the inverse kinematics problem for serial multilink manipulators. This problem is to find a set of joint angles that achieve a prescribed tip position and/or orientation. A widely applicable numerical search solution is presented. The approach finds the minimum of a generalized distance between the desired and the actual manipulator tip position and/or orientation. Both a first-order steepest-descent gradient search and a second-order Newton-Raphson search are developed. The optimal relaxation factor required for the steepest descent method is computed recursively using an outward/inward procedure similar to those used typically for recursive inverse dynamics calculations. The second-order search requires evaluation of a gradient and an approximate Hessian. A Gauss-Markov approach is used to approximate the Hessian matrix in terms of products of first-order derivatives. This matrix is inverted recursively using a two-stage process of inward Kalman filtering followed by outward smoothing. This two-stage process is analogous to that recently developed by the author to solve by means of spatial filtering and smoothing the forward dynamics problem for serial manipulators.

RECOLA2: REcursive Computation of One-Loop Amplitudes 2

NASA Astrophysics Data System (ADS)

Denner, Ansgar; Lang, Jean-Nicolas; Uccirati, Sandro

2018-03-01

We present the Fortran95 program RECOLA2 for the perturbative computation of next-to-leading-order transition amplitudes in the Standard Model of particle physics and extended Higgs sectors. New theories are implemented via model files in the 't Hooft-Feynman gauge in the conventional formulation of quantum field theory and in the Background-Field method. The present version includes model files for Two-Higgs-Doublet Model and the Higgs-Singlet Extension of the Standard Model. We support standard renormalization schemes for the Standard Model as well as many commonly used renormalization schemes in extended Higgs sectors. Within these models the computation of next-to-leading-order polarized amplitudes and squared amplitudes, optionally summed over spin and colour, is fully automated for any process. RECOLA2 allows the computation of colour- and spin-correlated leading-order squared amplitudes that are needed in the dipole subtraction formalism. RECOLA2 is publicly available for download at http://recola.hepforge.org.

Minimal-Approximation-Based Distributed Consensus Tracking of a Class of Uncertain Nonlinear Multiagent Systems With Unknown Control Directions.

PubMed

Choi, Yun Ho; Yoo, Sung Jin

2017-03-28

A minimal-approximation-based distributed adaptive consensus tracking approach is presented for strict-feedback multiagent systems with unknown heterogeneous nonlinearities and control directions under a directed network. Existing approximation-based consensus results for uncertain nonlinear multiagent systems in lower-triangular form have used multiple function approximators in each local controller to approximate unmatched nonlinearities of each follower. Thus, as the follower's order increases, the number of the approximators used in its local controller increases. However, the proposed approach employs only one function approximator to construct the local controller of each follower regardless of the order of the follower. The recursive design methodology using a new error transformation is derived for the proposed minimal-approximation-based design. Furthermore, a bounding lemma on parameters of Nussbaum functions is presented to handle the unknown control direction problem in the minimal-approximation-based distributed consensus tracking framework and the stability of the overall closed-loop system is rigorously analyzed in the Lyapunov sense.

BMI cyberworkstation: enabling dynamic data-driven brain-machine interface research through cyberinfrastructure.

PubMed

Zhao, Ming; Rattanatamrong, Prapaporn; DiGiovanna, Jack; Mahmoudi, Babak; Figueiredo, Renato J; Sanchez, Justin C; Príncipe, José C; Fortes, José A B

2008-01-01

Dynamic data-driven brain-machine interfaces (DDDBMI) have great potential to advance the understanding of neural systems and improve the design of brain-inspired rehabilitative systems. This paper presents a novel cyberinfrastructure that couples in vivo neurophysiology experimentation with massive computational resources to provide seamless and efficient support of DDDBMI research. Closed-loop experiments can be conducted with in vivo data acquisition, reliable network transfer, parallel model computation, and real-time robot control. Behavioral experiments with live animals are supported with real-time guarantees. Offline studies can be performed with various configurations for extensive analysis and training. A Web-based portal is also provided to allow users to conveniently interact with the cyberinfrastructure, conducting both experimentation and analysis. New motor control models are developed based on this approach, which include recursive least square based (RLS) and reinforcement learning based (RLBMI) algorithms. The results from an online RLBMI experiment shows that the cyberinfrastructure can successfully support DDDBMI experiments and meet the desired real-time requirements.

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

Ferraioli, Luigi; Hueller, Mauro; Vitale, Stefano

The scientific objectives of the LISA Technology Package experiment on board of the LISA Pathfinder mission demand accurate calibration and validation of the data analysis tools in advance of the mission launch. The level of confidence required in the mission outcomes can be reached only by intensively testing the tools on synthetically generated data. A flexible procedure allowing the generation of a cross-correlated stationary noise time series was set up. A multichannel time series with the desired cross-correlation behavior can be generated once a model for a multichannel cross-spectral matrix is provided. The core of the procedure comprises a noisemore » coloring, multichannel filter designed via a frequency-by-frequency eigendecomposition of the model cross-spectral matrix and a subsequent fit in the Z domain. The common problem of initial transients in a filtered time series is solved with a proper initialization of the filter recursion equations. The noise generator performance was tested in a two-dimensional case study of the closed-loop LISA Technology Package dynamics along the two principal degrees of freedom.« less

Adaptive Backstepping-Based Neural Tracking Control for MIMO Nonlinear Switched Systems Subject to Input Delays.

PubMed

Niu, Ben; Li, Lu

2018-06-01

This brief proposes a new neural-network (NN)-based adaptive output tracking control scheme for a class of disturbed multiple-input multiple-output uncertain nonlinear switched systems with input delays. By combining the universal approximation ability of radial basis function NNs and adaptive backstepping recursive design with an improved multiple Lyapunov function (MLF) scheme, a novel adaptive neural output tracking controller design method is presented for the switched system. The feature of the developed design is that different coordinate transformations are adopted to overcome the conservativeness caused by adopting a common coordinate transformation for all subsystems. It is shown that all the variables of the resulting closed-loop system are semiglobally uniformly ultimately bounded under a class of switching signals in the presence of MLF and that the system output can follow the desired reference signal. To demonstrate the practicability of the obtained result, an adaptive neural output tracking controller is designed for a mass-spring-damper system.

Recursive multibody dynamics and discrete-time optimal control

NASA Technical Reports Server (NTRS)

Deleuterio, G. M. T.; Damaren, C. J.

1989-01-01

A recursive algorithm is developed for the solution of the simulation dynamics problem for a chain of rigid bodies. Arbitrary joint constraints are permitted, that is, joints may allow translational and/or rotational degrees of freedom. The recursive procedure is shown to be identical to that encountered in a discrete-time optimal control problem. For each relevant quantity in the multibody dynamics problem, there exists an analog in the context of optimal control. The performance index that is minimized in the control problem is identified as Gibbs' function for the chain of bodies.

Recursive Directional Ligation Approach for Cloning Recombinant Spider Silks.

PubMed

Dinjaski, Nina; Huang, Wenwen; Kaplan, David L

2018-01-01

Recent advances in genetic engineering have provided a route to produce various types of recombinant spider silks. Different cloning strategies have been applied to achieve this goal (e.g., concatemerization, step-by-step ligation, recursive directional ligation). Here we describe recursive directional ligation as an approach that allows for facile modularity and control over the size of the genetic cassettes. This approach is based on sequential ligation of genetic cassettes (monomers) where the junctions between them are formed without interrupting key gene sequences with additional base pairs.

Recursive Construction of Noiseless Subsystem for Qudits

NASA Astrophysics Data System (ADS)

Güngördü, Utkan; Li, Chi-Kwong; Nakahara, Mikio; Poon, Yiu-Tung; Sze, Nung-Sing

2014-03-01

When the environmental noise acting on the system has certain symmetries, a subsystem of the total system can avoid errors. Encoding information into such a subsystem is advantageous since it does not require any error syndrome measurements, which may introduce further errors to the system. However, utilizing such a subsystem for large systems gets impractical with the increasing number of qudits. A recursive scheme offers a solution to this problem. Here, we review the recursive construct introduced in, which can asymptotically protect 1/d of the qudits in system against collective errors.

Parallel scheduling of recursively defined arrays

NASA Technical Reports Server (NTRS)

Myers, T. J.; Gokhale, M. B.

1986-01-01

A new method of automatic generation of concurrent programs which constructs arrays defined by sets of recursive equations is described. It is assumed that the time of computation of an array element is a linear combination of its indices, and integer programming is used to seek a succession of hyperplanes along which array elements can be computed concurrently. The method can be used to schedule equations involving variable length dependency vectors and mutually recursive arrays. Portions of the work reported here have been implemented in the PS automatic program generation system.

Hierarchical Recursive Organization and the Free Energy Principle: From Biological Self-Organization to the Psychoanalytic Mind

PubMed Central

Connolly, Patrick; van Deventer, Vasi

2017-01-01

The present paper argues that a systems theory epistemology (and particularly the notion of hierarchical recursive organization) provides the critical theoretical context within which the significance of Friston's (2010a) Free Energy Principle (FEP) for both evolution and psychoanalysis is best understood. Within this perspective, the FEP occupies a particular level of the hierarchical organization of the organism, which is the level of biological self-organization. This form of biological self-organization is in turn understood as foundational and pervasive to the higher levels of organization of the human organism that are of interest to both neuroscience as well as psychoanalysis. Consequently, central psychoanalytic claims should be restated, in order to be located in their proper place within a hierarchical recursive organization of the (situated) organism. In light of the FEP the realization of the psychoanalytic mind by the brain should be seen in terms of the evolution of different levels of systematic organization where the concepts of psychoanalysis describe a level of hierarchical recursive organization superordinate to that of biological self-organization and the FEP. The implication of this formulation is that while “psychoanalytic” mental processes are fundamentally subject to the FEP, they nonetheless also add their own principles of process over and above that of the FEP. A model found in Grobbelaar (1989) offers a recursive bottom-up description of the self-organization of the psychoanalytic ego as dependent on the organization of language (and affect), which is itself founded upon the tendency toward autopoiesis (self-making) within the organism, which is in turn described as formally similar to the FEP. Meaningful consilience between Grobbelaar's model and the hierarchical recursive description available in Friston's (2010a) theory is described. The paper concludes that the valuable contribution of the FEP to psychoanalysis underscores the necessity of reengagement with the core concepts of psychoanalytic theory, and the usefulness that a systems theory epistemology—particularly hierarchical recursive description—can have for this goal. PMID:29038652

Hierarchical Recursive Organization and the Free Energy Principle: From Biological Self-Organization to the Psychoanalytic Mind.

PubMed

Connolly, Patrick; van Deventer, Vasi

2017-01-01

The present paper argues that a systems theory epistemology (and particularly the notion of hierarchical recursive organization) provides the critical theoretical context within which the significance of Friston's (2010a) Free Energy Principle (FEP) for both evolution and psychoanalysis is best understood. Within this perspective, the FEP occupies a particular level of the hierarchical organization of the organism, which is the level of biological self-organization. This form of biological self-organization is in turn understood as foundational and pervasive to the higher levels of organization of the human organism that are of interest to both neuroscience as well as psychoanalysis. Consequently, central psychoanalytic claims should be restated, in order to be located in their proper place within a hierarchical recursive organization of the (situated) organism. In light of the FEP the realization of the psychoanalytic mind by the brain should be seen in terms of the evolution of different levels of systematic organization where the concepts of psychoanalysis describe a level of hierarchical recursive organization superordinate to that of biological self-organization and the FEP. The implication of this formulation is that while "psychoanalytic" mental processes are fundamentally subject to the FEP, they nonetheless also add their own principles of process over and above that of the FEP. A model found in Grobbelaar (1989) offers a recursive bottom-up description of the self-organization of the psychoanalytic ego as dependent on the organization of language (and affect), which is itself founded upon the tendency toward autopoiesis (self-making) within the organism, which is in turn described as formally similar to the FEP. Meaningful consilience between Grobbelaar's model and the hierarchical recursive description available in Friston's (2010a) theory is described. The paper concludes that the valuable contribution of the FEP to psychoanalysis underscores the necessity of reengagement with the core concepts of psychoanalytic theory, and the usefulness that a systems theory epistemology-particularly hierarchical recursive description-can have for this goal.

Language and Recursion

NASA Astrophysics Data System (ADS)

Lowenthal, Francis

2010-11-01

This paper examines whether the recursive structure imbedded in some exercises used in the Non Verbal Communication Device (NVCD) approach is actually the factor that enables this approach to favor language acquisition and reacquisition in the case of children with cerebral lesions. For that a definition of the principle of recursion as it is used by logicians is presented. The two opposing approaches to the problem of language development are explained. For many authors such as Chomsky [1] the faculty of language is innate. This is known as the Standard Theory; the other researchers in this field, e.g. Bates and Elman [2], claim that language is entirely constructed by the young child: they thus speak of Language Acquisition. It is also shown that in both cases, a version of the principle of recursion is relevant for human language. The NVCD approach is defined and the results obtained in the domain of language while using this approach are presented: young subjects using this approach acquire a richer language structure or re-acquire such a structure in the case of cerebral lesions. Finally it is shown that exercises used in this framework imply the manipulation of recursive structures leading to regular grammars. It is thus hypothesized that language development could be favored using recursive structures with the young child. It could also be the case that the NVCD like exercises used with children lead to the elaboration of a regular language, as defined by Chomsky [3], which could be sufficient for language development but would not require full recursion. This double claim could reconcile Chomsky's approach with psychological observations made by adherents of the Language Acquisition approach, if it is confirmed by researches combining the use of NVCDs, psychometric methods and the use of Neural Networks. This paper thus suggests that a research group oriented towards this problematic should be organized.

Recursive flexible multibody system dynamics using spatial operators

NASA Technical Reports Server (NTRS)

Jain, A.; Rodriguez, G.

1992-01-01

This paper uses spatial operators to develop new spatially recursive dynamics algorithms for flexible multibody systems. The operator description of the dynamics is identical to that for rigid multibody systems. Assumed-mode models are used for the deformation of each individual body. The algorithms are based on two spatial operator factorizations of the system mass matrix. The first (Newton-Euler) factorization of the mass matrix leads to recursive algorithms for the inverse dynamics, mass matrix evaluation, and composite-body forward dynamics for the systems. The second (innovations) factorization of the mass matrix, leads to an operator expression for the mass matrix inverse and to a recursive articulated-body forward dynamics algorithm. The primary focus is on serial chains, but extensions to general topologies are also described. A comparison of computational costs shows that the articulated-body, forward dynamics algorithm is much more efficient than the composite-body algorithm for most flexible multibody systems.

Parameter Uncertainty for Aircraft Aerodynamic Modeling using Recursive Least Squares

NASA Technical Reports Server (NTRS)

Grauer, Jared A.; Morelli, Eugene A.

2016-01-01

A real-time method was demonstrated for determining accurate uncertainty levels of stability and control derivatives estimated using recursive least squares and time-domain data. The method uses a recursive formulation of the residual autocorrelation to account for colored residuals, which are routinely encountered in aircraft parameter estimation and change the predicted uncertainties. Simulation data and flight test data for a subscale jet transport aircraft were used to demonstrate the approach. Results showed that the corrected uncertainties matched the observed scatter in the parameter estimates, and did so more accurately than conventional uncertainty estimates that assume white residuals. Only small differences were observed between batch estimates and recursive estimates at the end of the maneuver. It was also demonstrated that the autocorrelation could be reduced to a small number of lags to minimize computation and memory storage requirements without significantly degrading the accuracy of predicted uncertainty levels.

Classical symmetric fourth degree potential systems in probabilistic evolution theoretical perspective: Most facilitative conicalization and squarification of telescope matrices

NASA Astrophysics Data System (ADS)

Gözükırmızı, Coşar; Kırkın, Melike Ebru

2017-01-01

Probabilistic evolution theory (PREVTH) provides a powerful framework for the solution of initial value problems of explicit ordinary differential equation sets with second degree multinomial right hand side functions. The use of the recursion between squarified telescope matrices provides the opportunity to obtain accurate results without much effort. Convergence may be considered as one of the drawbacks of PREVTH. It is related to many factors: the initial values and the coefficients in the right hand side functions are the most apparent ones. If a space extension is utilized before PREVTH, the convergence of PREVTH may also be affected by how the space extension is performed. There are works about implementations related to probabilistic evolution and how to improve the convergence by methods like analytic continuation. These works were written before squarification was introduced. Since recursion between squarified telescope matrices has given us the opportunity to obtain results corresponding to relatively higher truncation levels, it is important to obtain and analyze results related to certain problems in different areas of engineering. This manuscript may be considered to be in a series of papers and conference proceedings which serves for this purpose.

REQUEST: A Recursive QUEST Algorithm for Sequential Attitude Determination

NASA Technical Reports Server (NTRS)

Bar-Itzhack, Itzhack Y.

1996-01-01

In order to find the attitude of a spacecraft with respect to a reference coordinate system, vector measurements are taken. The vectors are pairs of measurements of the same generalized vector, taken in the spacecraft body coordinates, as well as in the reference coordinate system. We are interested in finding the best estimate of the transformation between these coordinate system.s The algorithm called QUEST yields that estimate where attitude is expressed by a quarternion. Quest is an efficient algorithm which provides a least squares fit of the quaternion of rotation to the vector measurements. Quest however, is a single time point (single frame) batch algorithm, thus measurements that were taken at previous time points are discarded. The algorithm presented in this work provides a recursive routine which considers all past measurements. The algorithm is based on on the fact that the, so called, K matrix, one of whose eigenvectors is the sought quaternion, is linerly related to the measured pairs, and on the ability to propagate K. The extraction of the appropriate eigenvector is done according to the classical QUEST algorithm. This stage, however, can be eliminated, and the computation simplified, if a standard eigenvalue-eigenvector solver algorithm is used. The development of the recursive algorithm is presented and illustrated via a numerical example.

On the sum of generalized Fibonacci sequence

NASA Astrophysics Data System (ADS)

Chong, Chin-Yoon; Ho, C. K.

2014-06-01

We consider the generalized Fibonacci sequence {Un defined by U0 = 0, U1 = 1, and Un+2 = pUn+1+qUn for all n∈Z0+ and p, q∈Z+. In this paper, we derived various sums of the generalized Fibonacci sequence from their recursive relations.

A Parallel Implementation of Multilevel Recursive Spectral Bisection for Application to Adaptive Unstructured Meshes. Chapter 1

NASA Technical Reports Server (NTRS)

Barnard, Stephen T.; Simon, Horst; Lasinski, T. A. (Technical Monitor)

1994-01-01

The design of a parallel implementation of multilevel recursive spectral bisection is described. The goal is to implement a code that is fast enough to enable dynamic repartitioning of adaptive meshes.

On the Hosoya index of a family of deterministic recursive trees

NASA Astrophysics Data System (ADS)

Chen, Xufeng; Zhang, Jingyuan; Sun, Weigang

2017-01-01

In this paper, we calculate the Hosoya index in a family of deterministic recursive trees with a special feature that includes new nodes which are connected to existing nodes with a certain rule. We then obtain a recursive solution of the Hosoya index based on the operations of a determinant. The computational complexity of our proposed algorithm is O(log2 n) with n being the network size, which is lower than that of the existing numerical methods. Finally, we give a weighted tree shrinking method as a graphical interpretation of the recurrence formula for the Hosoya index.

Ambiguous Loss after Lesbian Couples with Children Break up: A Case for Same-Gender Divorce

ERIC Educational Resources Information Center

Allen, Katherine R.

2007-01-01

The theory of ambiguous loss is applied to structural ambiguity and personal transcendence in the parent-child relationship following a same-gender relational ending. Working recursively through the six guidelines of ambiguous loss (finding meaning, tempering mastery, reconstructing identity, normalizing ambivalence, revising attachment, and…

Effects of Adolescent Sociocognitive Development on the Cortisol Response to Social Evaluation

ERIC Educational Resources Information Center

van den Bos, Esther; van Duijvenvoorde, Anna C. K.; Westenberg, P. Michiel

2016-01-01

Adolescents become increasingly sensitive to social evaluation. Some previous studies have related this change to pubertal development. The present longitudinal study examined the role of sociocognitive development. We investigated whether or not the transition to recursive thinking, the ability to think about (others') thoughts, would be…

Constructivist Approach to Teacher Education: An Integrative Model for Reflective Teaching

ERIC Educational Resources Information Center

Vijaya Kumari, S. N.

2014-01-01

The theory of constructivism states that learning is non-linear, recursive, continuous, complex and relational--Despite the difficulty of deducing constructivist pedagogy from constructivist theories, there are models and common elements to consider in planning new program. Reflective activities are a common feature of all the programs of…

Online damage detection using recursive principal component analysis and recursive condition indicators

NASA Astrophysics Data System (ADS)

Krishnan, M.; Bhowmik, B.; Tiwari, A. K.; Hazra, B.

2017-08-01

In this paper, a novel baseline free approach for continuous online damage detection of multi degree of freedom vibrating structures using recursive principal component analysis (RPCA) in conjunction with online damage indicators is proposed. In this method, the acceleration data is used to obtain recursive proper orthogonal modes in online using the rank-one perturbation method, and subsequently utilized to detect the change in the dynamic behavior of the vibrating system from its pristine state to contiguous linear/nonlinear-states that indicate damage. The RPCA algorithm iterates the eigenvector and eigenvalue estimates for sample covariance matrices and new data point at each successive time instants, using the rank-one perturbation method. An online condition indicator (CI) based on the L2 norm of the error between actual response and the response projected using recursive eigenvector matrix updates over successive iterations is proposed. This eliminates the need for offline post processing and facilitates online damage detection especially when applied to streaming data. The proposed CI, named recursive residual error, is also adopted for simultaneous spatio-temporal damage detection. Numerical simulations performed on five-degree of freedom nonlinear system under white noise and El Centro excitations, with different levels of nonlinearity simulating the damage scenarios, demonstrate the robustness of the proposed algorithm. Successful results obtained from practical case studies involving experiments performed on a cantilever beam subjected to earthquake excitation, for full sensors and underdetermined cases; and data from recorded responses of the UCLA Factor building (full data and its subset) demonstrate the efficacy of the proposed methodology as an ideal candidate for real-time, reference free structural health monitoring.

Recursive Vocal Pattern Learning and Generalization in Starlings

ERIC Educational Resources Information Center

Bloomfield, Tiffany Corinna

2012-01-01

Among known communication systems, human language alone exhibits open-ended productivity of meaning. Interest in the psychological mechanisms supporting this ability, and their evolutionary origins, has resurged following the suggestion that the only uniquely human ability underlying language is a mechanism of recursion. This "Unique…

Fibonacci Imposters

ERIC Educational Resources Information Center

Simons, C. S.; Wright, M.

2007-01-01

With Simson's 1753 paper as a starting point, the current paper reports investigations of Simson's identity (also known as Cassini's) for the Fibonacci sequence as a means to explore some fundamental ideas about recursion. Simple algebraic operations allow one to reduce the standard linear Fibonacci recursion to the nonlinear Simon's recursion…

Recursive least squares method of regression coefficients estimation as a special case of Kalman filter

NASA Astrophysics Data System (ADS)

Borodachev, S. M.

2016-06-01

The simple derivation of recursive least squares (RLS) method equations is given as special case of Kalman filter estimation of a constant system state under changing observation conditions. A numerical example illustrates application of RLS to multicollinearity problem.

A Note on Discrete Mathematics and Calculus.

ERIC Educational Resources Information Center

O'Reilly, Thomas J.

1987-01-01

Much of the current literature on the topic of discrete mathematics and calculus during the first two years of an undergraduate mathematics curriculum is cited. A relationship between the recursive integration formulas and recursively defined polynomials is described. A Pascal program is included. (Author/RH)

Dynamic State Estimation of Power Systems With Quantization Effects: A Recursive Filter Approach.

PubMed

Hu, Liang; Wang, Zidong; Liu, Xiaohui

2016-08-01

In this paper, a recursive filter algorithm is developed to deal with the state estimation problem for power systems with quantized nonlinear measurements. The measurements from both the remote terminal units and the phasor measurement unit are subject to quantizations described by a logarithmic quantizer. Attention is focused on the design of a recursive filter such that, in the simultaneous presence of nonlinear measurements and quantization effects, an upper bound for the estimation error covariance is guaranteed and subsequently minimized. Instead of using the traditional approximation methods in nonlinear estimation that simply ignore the linearization errors, we treat both the linearization and quantization errors as norm-bounded uncertainties in the algorithm development so as to improve the performance of the estimator. For the power system with such kind of introduced uncertainties, a filter is designed in the framework of robust recursive estimation, and the developed filter algorithm is tested on the IEEE benchmark power system to demonstrate its effectiveness.

Algorithm for Training a Recurrent Multilayer Perceptron

NASA Technical Reports Server (NTRS)

Parlos, Alexander G.; Rais, Omar T.; Menon, Sunil K.; Atiya, Amir F.

2004-01-01

An improved algorithm has been devised for training a recurrent multilayer perceptron (RMLP) for optimal performance in predicting the behavior of a complex, dynamic, and noisy system multiple time steps into the future. [An RMLP is a computational neural network with self-feedback and cross-talk (both delayed by one time step) among neurons in hidden layers]. Like other neural-network-training algorithms, this algorithm adjusts network biases and synaptic-connection weights according to a gradient-descent rule. The distinguishing feature of this algorithm is a combination of global feedback (the use of predictions as well as the current output value in computing the gradient at each time step) and recursiveness. The recursive aspect of the algorithm lies in the inclusion of the gradient of predictions at each time step with respect to the predictions at the preceding time step; this recursion enables the RMLP to learn the dynamics. It has been conjectured that carrying the recursion to even earlier time steps would enable the RMLP to represent a noisier, more complex system.

Discovery of a Recursive Principle: An Artificial Grammar Investigation of Human Learning of a Counting Recursion Language

PubMed Central

Cho, Pyeong Whan; Szkudlarek, Emily; Tabor, Whitney

2016-01-01

Learning is typically understood as a process in which the behavior of an organism is progressively shaped until it closely approximates a target form. It is easy to comprehend how a motor skill or a vocabulary can be progressively learned—in each case, one can conceptualize a series of intermediate steps which lead to the formation of a proficient behavior. With grammar, it is more difficult to think in these terms. For example, center embedding recursive structures seem to involve a complex interplay between multiple symbolic rules which have to be in place simultaneously for the system to work at all, so it is not obvious how the mechanism could gradually come into being. Here, we offer empirical evidence from a new artificial language (or “artificial grammar”) learning paradigm, Locus Prediction, that, despite the conceptual conundrum, recursion acquisition occurs gradually, at least for a simple formal language. In particular, we focus on a variant of the simplest recursive language, anbn, and find evidence that (i) participants trained on two levels of structure (essentially ab and aabb) generalize to the next higher level (aaabbb) more readily than participants trained on one level of structure (ab) combined with a filler sentence; nevertheless, they do not generalize immediately; (ii) participants trained up to three levels (ab, aabb, aaabbb) generalize more readily to four levels than participants trained on two levels generalize to three; (iii) when we present the levels in succession, starting with the lower levels and including more and more of the higher levels, participants show evidence of transitioning between the levels gradually, exhibiting intermediate patterns of behavior on which they were not trained; (iv) the intermediate patterns of behavior are associated with perturbations of an attractor in the sense of dynamical systems theory. We argue that all of these behaviors indicate a theory of mental representation in which recursive systems lie on a continuum of grammar systems which are organized so that grammars that produce similar behaviors are near one another, and that people learning a recursive system are navigating progressively through the space of these grammars. PMID:27375543

Discovery of a Recursive Principle: An Artificial Grammar Investigation of Human Learning of a Counting Recursion Language.

PubMed

Cho, Pyeong Whan; Szkudlarek, Emily; Tabor, Whitney

2016-01-01

Learning is typically understood as a process in which the behavior of an organism is progressively shaped until it closely approximates a target form. It is easy to comprehend how a motor skill or a vocabulary can be progressively learned-in each case, one can conceptualize a series of intermediate steps which lead to the formation of a proficient behavior. With grammar, it is more difficult to think in these terms. For example, center embedding recursive structures seem to involve a complex interplay between multiple symbolic rules which have to be in place simultaneously for the system to work at all, so it is not obvious how the mechanism could gradually come into being. Here, we offer empirical evidence from a new artificial language (or "artificial grammar") learning paradigm, Locus Prediction, that, despite the conceptual conundrum, recursion acquisition occurs gradually, at least for a simple formal language. In particular, we focus on a variant of the simplest recursive language, a (n) b (n) , and find evidence that (i) participants trained on two levels of structure (essentially ab and aabb) generalize to the next higher level (aaabbb) more readily than participants trained on one level of structure (ab) combined with a filler sentence; nevertheless, they do not generalize immediately; (ii) participants trained up to three levels (ab, aabb, aaabbb) generalize more readily to four levels than participants trained on two levels generalize to three; (iii) when we present the levels in succession, starting with the lower levels and including more and more of the higher levels, participants show evidence of transitioning between the levels gradually, exhibiting intermediate patterns of behavior on which they were not trained; (iv) the intermediate patterns of behavior are associated with perturbations of an attractor in the sense of dynamical systems theory. We argue that all of these behaviors indicate a theory of mental representation in which recursive systems lie on a continuum of grammar systems which are organized so that grammars that produce similar behaviors are near one another, and that people learning a recursive system are navigating progressively through the space of these grammars.

Recursions for the exchangeable partition function of the seedbank coalescent.

PubMed

Kurt, Noemi; Rafler, Mathias

2017-04-01

For the seedbank coalescent with mutation under the infinite alleles assumption, which describes the gene genealogy of a population with a strong seedbank effect subject to mutations, we study the distribution of the final partition with mutation. This generalizes the coalescent with freeze by Dong et al. (2007) to coalescents where ancestral lineages are blocked from coalescing. We derive an implicit recursion which we show to have a unique solution and give an interpretation in terms of absorption problems of a random walk. Moreover, we derive recursions for the distribution of the number of blocks in the final partition. Copyright © 2017 Elsevier Inc. All rights reserved.

Adaptable Iterative and Recursive Kalman Filter Schemes

NASA Technical Reports Server (NTRS)

Zanetti, Renato

2014-01-01

Nonlinear filters are often very computationally expensive and usually not suitable for real-time applications. Real-time navigation algorithms are typically based on linear estimators, such as the extended Kalman filter (EKF) and, to a much lesser extent, the unscented Kalman filter. The Iterated Kalman filter (IKF) and the Recursive Update Filter (RUF) are two algorithms that reduce the consequences of the linearization assumption of the EKF by performing N updates for each new measurement, where N is the number of recursions, a tuning parameter. This paper introduces an adaptable RUF algorithm to calculate N on the go, a similar technique can be used for the IKF as well.

Tree-manipulating systems and Church-Rosser theorems.

NASA Technical Reports Server (NTRS)

Rosen, B. K.

1973-01-01

Study of a broad class of tree-manipulating systems called subtree replacement systems. The use of this framework is illustrated by general theorems analogous to the Church-Rosser theorem and by applications of these theorems. Sufficient conditions are derived for the Church-Rosser property, and their applications to recursive definitions, the lambda calculus, and parallel programming are discussed. McCarthy's (1963) recursive calculus is extended by allowing a choice between call-by-value and call-by-name. It is shown that recursively defined functions are single-valued despite the nondeterminism of the evaluation algorithm. It is also shown that these functions solve their defining equations in a 'canonical' manner.

Teaching Non-Recursive Binary Searching: Establishing a Conceptual Framework.

ERIC Educational Resources Information Center

Magel, E. Terry

1989-01-01

Discusses problems associated with teaching non-recursive binary searching in computer language classes, and describes a teacher-directed dialog based on dictionary use that helps students use their previous searching experiences to conceptualize the binary search process. Algorithmic development is discussed and appropriate classroom discussion…

A Fractal Excursion.

ERIC Educational Resources Information Center

Camp, Dane R.

1991-01-01

After introducing the two-dimensional Koch curve, which is generated by simple recursions on an equilateral triangle, the process is extended to three dimensions with simple recursions on a regular tetrahedron. Included, for both fractal sequences, are iterative formulae, illustrations of the first several iterations, and a sample PASCAL program.…

The Free Energy in the Derrida-Retaux Recursive Model

NASA Astrophysics Data System (ADS)

Hu, Yueyun; Shi, Zhan

2018-05-01

We are interested in a simple max-type recursive model studied by Derrida and Retaux (J Stat Phys 156:268-290, 2014) in the context of a physics problem, and find a wide range for the exponent in the free energy in the nearly supercritical regime.

Estimation of object motion parameters from noisy images.

PubMed

Broida, T J; Chellappa, R

1986-01-01

An approach is presented for the estimation of object motion parameters based on a sequence of noisy images. The problem considered is that of a rigid body undergoing unknown rotational and translational motion. The measurement data consists of a sequence of noisy image coordinates of two or more object correspondence points. By modeling the object dynamics as a function of time, estimates of the model parameters (including motion parameters) can be extracted from the data using recursive and/or batch techniques. This permits a desired degree of smoothing to be achieved through the use of an arbitrarily large number of images. Some assumptions regarding object structure are presently made. Results are presented for a recursive estimation procedure: the case considered here is that of a sequence of one dimensional images of a two dimensional object. Thus, the object moves in one transverse dimension, and in depth, preserving the fundamental ambiguity of the central projection image model (loss of depth information). An iterated extended Kalman filter is used for the recursive solution. Noise levels of 5-10 percent of the object image size are used. Approximate Cramer-Rao lower bounds are derived for the model parameter estimates as a function of object trajectory and noise level. This approach may be of use in situations where it is difficult to resolve large numbers of object match points, but relatively long sequences of images (10 to 20 or more) are available.

A course in amplitudes

NASA Astrophysics Data System (ADS)

Taylor, Tomasz R.

2017-05-01

This a pedagogical introduction to scattering amplitudes in gauge theories. It proceeds from Dirac equation and Weyl fermions to the two pivot points of current developments: the recursion relations of Britto, Cachazo, Feng and Witten, and the unitarity cut method pioneered by Bern, Dixon, Dunbar and Kosower. In ten lectures, it covers the basic elements of on-shell methods.

Recursive Exercises to Help Students Engage and Recognize Sociological Shifts

ERIC Educational Resources Information Center

Whitaker, Julie

2017-01-01

Introductory sociology courses encourage students to shift from understanding social relations and inequalities through an individualistic lens toward a more sociological one. It is difficult for students to know how far they have advanced toward a sociological perspective if they do not have a good sense of where they began. This paper describes…

Implicit Learning of Recursive Context-Free Grammars

PubMed Central

Rohrmeier, Martin; Fu, Qiufang; Dienes, Zoltan

2012-01-01

Context-free grammars are fundamental for the description of linguistic syntax. However, most artificial grammar learning experiments have explored learning of simpler finite-state grammars, while studies exploring context-free grammars have not assessed awareness and implicitness. This paper explores the implicit learning of context-free grammars employing features of hierarchical organization, recursive embedding and long-distance dependencies. The grammars also featured the distinction between left- and right-branching structures, as well as between centre- and tail-embedding, both distinctions found in natural languages. People acquired unconscious knowledge of relations between grammatical classes even for dependencies over long distances, in ways that went beyond learning simpler relations (e.g. n-grams) between individual words. The structural distinctions drawn from linguistics also proved important as performance was greater for tail-embedding than centre-embedding structures. The results suggest the plausibility of implicit learning of complex context-free structures, which model some features of natural languages. They support the relevance of artificial grammar learning for probing mechanisms of language learning and challenge existing theories and computational models of implicit learning. PMID:23094021

Eigenvalues of normalized Laplacian matrices of fractal trees and dendrimers: Analytical results and applications

NASA Astrophysics Data System (ADS)

Julaiti, Alafate; Wu, Bin; Zhang, Zhongzhi

2013-05-01

The eigenvalues of the normalized Laplacian matrix of a network play an important role in its structural and dynamical aspects associated with the network. In this paper, we study the spectra and their applications of normalized Laplacian matrices of a family of fractal trees and dendrimers modeled by Cayley trees, both of which are built in an iterative way. For the fractal trees, we apply the spectral decimation approach to determine analytically all the eigenvalues and their corresponding multiplicities, with the eigenvalues provided by a recursive relation governing the eigenvalues of networks at two successive generations. For Cayley trees, we show that all their eigenvalues can be obtained by computing the roots of several small-degree polynomials defined recursively. By using the relation between normalized Laplacian spectra and eigentime identity, we derive the explicit solution to the eigentime identity for random walks on the two treelike networks, the leading scalings of which follow quite different behaviors. In addition, we corroborate the obtained eigenvalues and their degeneracies through the link between them and the number of spanning trees.

Scaffolding knowledge building in a Web-based communication and cultural competence program for international medical graduates.

PubMed

Lax, Leila R; Russell, M Lynn; Nelles, Laura J; Smith, Cathy M

2009-10-01

Professional behaviors, tacitly understood by Canadian-trained physicians, are difficult to teach and often create practice barriers for IMGs. The purpose of this design research study was to develop a Web-based program simulating Canadian medical literacy and culture, and to evaluate strategies of scaffolding individual knowledge building. Study 1 (N = 20) examined usability and pedagogic design. Studies 2 (N = 39) and 3 (N = 33) examined case participation patterns. Model design was validated in Study 1. Studies 2 and 3 demonstrated high levels of participation, on unprompted third tries, on knowledge tests. Recursive patterns were strongest on Reflective Exercises. Five strategies scaffolded knowledge building: (1) video simulations, (2) contextualized resources, (3) concurrent feedback, (4) Reflective Exercises, and (5) commentaries prompting "reflection on reflection." Scaffolded design supports complex knowledge building. These findings are concurrent with educational research on the importance of recursion and revision of knowledge for improvable and relational understanding.

Recursivity in Lingua Cosmica

NASA Astrophysics Data System (ADS)

Ollongren, Alexander

2011-02-01

In a sequence of papers on the topic of message construction for interstellar communication by means of a cosmic language, the present author has discussed various significant requirements such a lingua should satisfy. The author's Lingua Cosmica is a (meta) system for annotating contents of possibly large-scale messages for ETI. LINCOS, based on formal constructive logic, was primarily designed for dealing with logic contents of messages but is also applicable for denoting structural properties of more general abstractions embedded in such messages. The present paper explains ways and means for achieving this for a special case: recursive entities. As usual two stages are involved: first the domain of discourse is enriched with suitable representations of the entities concerned, after which properties over them can be dealt with within the system itself. As a representative example the case of Russian dolls (Matrjoshka's) is discussed in some detail and relations with linguistic structures in natural languages are briefly exploited.

The faculty of language: what is it, who has it, and how did it evolve?

PubMed

Hauser, Marc D; Chomsky, Noam; Fitch, W Tecumseh

2002-11-22

We argue that an understanding of the faculty of language requires substantial interdisciplinary cooperation. We suggest how current developments in linguistics can be profitably wedded to work in evolutionary biology, anthropology, psychology, and neuroscience. We submit that a distinction should be made between the faculty of language in the broad sense (FLB) and in the narrow sense (FLN). FLB includes a sensory-motor system, a conceptual-intentional system, and the computational mechanisms for recursion, providing the capacity to generate an infinite range of expressions from a finite set of elements. We hypothesize that FLN only includes recursion and is the only uniquely human component of the faculty of language. We further argue that FLN may have evolved for reasons other than language, hence comparative studies might look for evidence of such computations outside of the domain of communication (for example, number, navigation, and social relations).

What does Pirahã grammar have to teach us about human language and the mind?

PubMed

Everett, Daniel L

2012-11-01

Pirahã is a language isolate of the Brazilian Amazon. Among the lessons it has to teach us about human language and the mind, two are highlighted here. The first is that recursion is not a necessary condition for human syntax, because there is no evidence for recursive sentential syntax in the language. This is a stark counterexample to the claims of Chomsky and others. The second lesson is that the influence of culture on Pirahã grammar, coupled with much established and newer research, indicates that the idea of an innate, universal grammar has little if any role to play in our understanding of the nature, origins, and use of human language. WIREs Cogn Sci 2012 doi: 10.1002/wcs.1195 For further resources related to this article, please visit the WIREs website. Copyright © 2012 John Wiley & Sons, Inc.

User's Guide for the Precision Recursive Estimator for Ephemeris Refinement (PREFER)

NASA Technical Reports Server (NTRS)

Gibbs, B. P.

1982-01-01

PREFER is a recursive orbit determination program which is used to refine the ephemerides produced by a batch least squares program (e.g., GTDS). It is intended to be used primarily with GTDS and, thus, is compatible with some of the GTDS input/output files.

Split-remerge method for eliminating processing window artifacts in recursive hierarchical segmentation

NASA Technical Reports Server (NTRS)

Tilton, James C. (Inventor)

2010-01-01

A method, computer readable storage, and apparatus for implementing recursive segmentation of data with spatial characteristics into regions including splitting-remerging of pixels with contagious region designations and a user controlled parameter for providing a preference for merging adjacent regions to eliminate window artifacts.

A Recursive Theory for the Mathematical Understanding--Some Elements and Implications.

ERIC Educational Resources Information Center

Pirie, Susan; Kieren, Thomas

There has been considerable interest in mathematical understanding. Both those attempting to build, and those questioning the possibility of building intelligent artificial tutoring systems, struggle with the notions of mathematical understanding. The purpose of this essay is to show a transcendently recursive theory of mathematical understanding…

Recursion, Computers and Art

ERIC Educational Resources Information Center

Kemp, Andy

2007-01-01

"Geomlab" is a functional programming language used to describe pictures that are made up of tiles. The beauty of "Geomlab" is that it introduces students to recursion, a very powerful mathematical concept, through a very simple and enticing graphical environment. Alongside the software is a series of eight worksheets which lead into producing…

The S-matrix in twistor space

NASA Astrophysics Data System (ADS)

Arkani-Hamed, N.; Cachazo, F.; Cheung, C.; Kaplan, J.

2010-03-01

The marvelous simplicity and remarkable hidden symmetries recently uncovered in (Super) Yang-Mills and (Super)Gravity scattering amplitudes strongly suggests the existence of a “weak-weak” dual formulation of these theories where these structures are made more manifest at the expense of manifest locality. In this note we suggest that in four dimensions, this dual description lives in (2, 2) signature and is naturally formulated in twistor space. We begin at tree-level, by recasting the momentum-space BCFW recursion relation in a completely on-shell form that begs to be transformed into twistor space. Our transformation is strongly inspired by Witten’s twistor string theory, but differs in treating twistor and dual twistor variables on a more equal footing; a related transcription of the BCFW formula using only twistor space variables has been carried out independently by Mason and Skinner. Using both twistor and dual twistor variables, the three and four-point amplitudes are strikingly simple-for Yang-Mills theories they are “1” or “-1”. The BCFW computation of higher-order amplitudes can be represented by a simple set of diagrammatic rules, concretely realizing Penrose’s program of relating “twistor diagrams” to scattering amplitudes. More specifically, we give a precise definition of the twistor diagram formalism developed over the past few years by Andrew Hodges. The “Hodges diagram” representation of the BCFW rules allows us to compute amplitudes and study their remarkable properties in twistor space. For instance the diagrams for Yang-Mills theory are topologically disks and not trees, and reveal striking connections between amplitudes that are not manifest in momentum space. Twistor space also suggests a new representation of the amplitudes directly in momentum space, that is naturally determined by the Hodges diagrams. The BCFW rules and Hodges diagrams also enable a systematic twistorial formulation of gravity. All tree amplitudes can be combined into an “S-Matrix” scattering functional which is the natural holographic observable in asymptotically flat space; the BCFW formula turns into a simple quadratic equation for this “S-Matrix” in twistor space, providing a holographic description of mathcal{N} = 4 SYM and mathcal{N} = 8 Supergravity at tree level. We move on to initiate the exploration of loop amplitudes in (2, 2) signature and twistor space, beginning with a discussion of their IR behavior. We find that the natural pole prescriptions needed for transformation to twistor space make the amplitudes perfectly well-defined objects, free of IR divergences. Indeed in momentum space, the loop amplitudes so regulated vanish for generic momenta, and transformed to twistor space, are even simpler than their tree-level counterparts: the full 4-pt one-loop amplitudes in mathcal{N} = 4 SYM are simply equal to “1” or “0”! This further supports the idea that there exists a sharply defined object corresponding to the S-Matrix in (2, 2) signature, computed by a dual theory naturally living in twistor space.

Non-recursive augmented Lagrangian algorithms for the forward and inverse dynamics of constrained flexible multibodies

NASA Technical Reports Server (NTRS)

Bayo, Eduardo; Ledesma, Ragnar

1993-01-01

A technique is presented for solving the inverse dynamics of flexible planar multibody systems. This technique yields the non-causal joint efforts (inverse dynamics) as well as the internal states (inverse kinematics) that produce a prescribed nominal trajectory of the end effector. A non-recursive global Lagrangian approach is used in formulating the equations for motion as well as in solving the inverse dynamics equations. Contrary to the recursive method previously presented, the proposed method solves the inverse problem in a systematic and direct manner for both open-chain as well as closed-chain configurations. Numerical simulation shows that the proposed procedure provides an excellent tracking of the desired end effector trajectory.

Recursivity: A Working Paper on Rhetoric and "Mnesis"

ERIC Educational Resources Information Center

Stormer, Nathan

2013-01-01

This essay proposes the genealogical study of remembering and forgetting as recursive rhetorical capacities that enable discourse to place itself in an ever-changing present. "Mnesis" is a meta-concept for the arrangements of remembering and forgetting that enable rhetoric to function. Most of the essay defines the materiality of "mnesis", first…

Recursive Optimization of Digital Circuits

DTIC Science & Technology

1990-12-14

Obverse- Specification . . . A-23 A.14 Non-MDS Optimization of SAMPLE .. .. .. .. .. .. ..... A-24 Appendix B . BORIS Recursive Optimization System...Software ...... B -i B .1 DESIGN.S File . .... .. .. .. .. .. .. .. .. .. ... ... B -2 B .2 PARSE.S File. .. .. .. .. .. .. .. .. ... .. ... .... B -1i B .3...TABULAR.S File. .. .. .. .. .. .. ... .. ... .. ... B -22 B .4 MDS.S File. .. .. .. .. .. .. .. ... .. ... .. ...... B -28 B .5 COST.S File

Testing the Relationship between Three-Component Organizational/Occupational Commitment and Organizational/Occupational Turnover Intention Using a Non-Recursive Model

ERIC Educational Resources Information Center

Chang, Huo-Tsan; Chi, Nai-Wen; Miao, Min-Chih

2007-01-01

This study explored the relationship between three-component organizational/occupational commitment and organizational/occupational turnover intention, and the reciprocal relationship between organizational and occupational turnover intention with a non-recursive model in collectivist cultural settings. We selected 177 nursing staffs out of 30…

TORTIS (Toddler's Own Recursive Turtle Interpreter System).

ERIC Educational Resources Information Center

Perlman, Radia

TORTIS (Toddler's Own Recursive Turtle Interpreter System) is a device which can be used to study or nurture the cognitive development of preschool children. The device consists of a "turtle" which the child can control by use of buttons on a control panel. The "turtle" can be made to move in prescribed directions, to take a…

Recursive Inversion By Finite-Impulse-Response Filters

NASA Technical Reports Server (NTRS)

Bach, Ralph E., Jr.; Baram, Yoram

1991-01-01

Recursive approximation gives least-squares best fit to exact response. Algorithm yields finite-impulse-response approximation of unknown single-input/single-output, causal, time-invariant, linear, real system, response of which is sequence of impulses. Applicable to such system-inversion problems as suppression of echoes and identification of target from its scatter response to incident impulse.

An Accelerated Recursive Doubling Algorithm for Block Tridiagonal Systems

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

Seal, Sudip K

2014-01-01

Block tridiagonal systems of linear equations arise in a wide variety of scientific and engineering applications. Recursive doubling algorithm is a well-known prefix computation-based numerical algorithm that requires O(M^3(N/P + log P)) work to compute the solution of a block tridiagonal system with N block rows and block size M on P processors. In real-world applications, solutions of tridiagonal systems are most often sought with multiple, often hundreds and thousands, of different right hand sides but with the same tridiagonal matrix. Here, we show that a recursive doubling algorithm is sub-optimal when computing solutions of block tridiagonal systems with multiplemore » right hand sides and present a novel algorithm, called the accelerated recursive doubling algorithm, that delivers O(R) improvement when solving block tridiagonal systems with R distinct right hand sides. Since R is typically about 100 1000, this improvement translates to very significant speedups in practice. Detailed complexity analyses of the new algorithm with empirical confirmation of runtime improvements are presented. To the best of our knowledge, this algorithm has not been reported before in the literature.« less

Interacting multiple model forward filtering and backward smoothing for maneuvering target tracking

NASA Astrophysics Data System (ADS)

Nandakumaran, N.; Sutharsan, S.; Tharmarasa, R.; Lang, Tom; McDonald, Mike; Kirubarajan, T.

2009-08-01

The Interacting Multiple Model (IMM) estimator has been proven to be effective in tracking agile targets. Smoothing or retrodiction, which uses measurements beyond the current estimation time, provides better estimates of target states. Various methods have been proposed for multiple model smoothing in the literature. In this paper, a new smoothing method, which involves forward filtering followed by backward smoothing while maintaining the fundamental spirit of the IMM, is proposed. The forward filtering is performed using the standard IMM recursion, while the backward smoothing is performed using a novel interacting smoothing recursion. This backward recursion mimics the IMM estimator in the backward direction, where each mode conditioned smoother uses standard Kalman smoothing recursion. Resulting algorithm provides improved but delayed estimates of target states. Simulation studies are performed to demonstrate the improved performance with a maneuvering target scenario. The comparison with existing methods confirms the improved smoothing accuracy. This improvement results from avoiding the augmented state vector used by other algorithms. In addition, the new technique to account for model switching in smoothing is a key in improving the performance.

Do we represent intentional action as recursively embedded? The answer must be empirical. A comment on Vicari and Adenzato (2014).

PubMed

Martins, Mauricio D; Fitch, W Tecumseh

2015-12-15

The relationship between linguistic syntax and action planning is of considerable interest in cognitive science because many researchers suggest that "motor syntax" shares certain key traits with language. In a recent manuscript in this journal, Vicari and Adenzato (henceforth VA) critiqued Hauser, Chomsky and Fitch's 2002 (henceforth HCF's) hypothesis that recursion is language-specific, and that its usage in other domains is parasitic on language resources. VA's main argument is that HCF's hypothesis is falsified by the fact that recursion typifies the structure of intentional action, and recursion in the domain of action is independent of language. Here, we argue that VA's argument is incomplete, and that their formalism can be contrasted with alternative frameworks that are equally consistent with existing data. Therefore their conclusions are premature without further empirical testing and support. In particular, to accept VA's argument it would be necessary to demonstrate both that humans in fact represent self-embedding in the structure of intentional action, and that language is not used to construct these representations. Copyright © 2015 Elsevier Inc. All rights reserved.

Higher-Loop Amplitude Monodromy Relations in String and Gauge Theory.

PubMed

Tourkine, Piotr; Vanhove, Pierre

2016-11-18

The monodromy relations in string theory provide a powerful and elegant formalism to understand some of the deepest properties of tree-level field theory amplitudes, like the color-kinematics duality. This duality has been instrumental in tremendous progress on the computations of loop amplitudes in quantum field theory, but a higher-loop generalization of the monodromy construction was lacking. In this Letter, we extend the monodromy relations to higher loops in open string theory. Our construction, based on a contour deformation argument of the open string diagram integrands, leads to new identities that relate planar and nonplanar topologies in string theory. We write one and two-loop monodromy formulas explicitly at any multiplicity. In the field theory limit, at one-loop we obtain identities that reproduce known results. At two loops, we check our formulas by unitarity in the case of the four-point N=4 super-Yang-Mills amplitude.

Connections between Minkowski and cosmological correlation functions

NASA Astrophysics Data System (ADS)

Kit Chu, Shek; Lee, Mang Hei Gordon; Lu, Shiyun; Tong, Xi; Wang, Yi; Zhou, Siyi

2018-06-01

We show how cosmological correlation functions of massless fields can be rewritten in terms of Minkowski correlation functions, by extracting symmetry-breaking operators from the cosmological correlators. This technique simplifies some cosmological calculations. Also, known properties of Minkowski correlation functions can be translated to non-trivial properties of cosmological correlations. To illustrate this idea, inflation to Minkowski and matter bounce to Minkowski relations are presented for the interactions of general single field inflation. And a Minkowski recursion relation is translated to a novel relation for inflation.

The recursive combination filter approach of pre-processing for the estimation of standard deviation of RR series.

PubMed

Mishra, Alok; Swati, D

2015-09-01

Variation in the interval between the R-R peaks of the electrocardiogram represents the modulation of the cardiac oscillations by the autonomic nervous system. This variation is contaminated by anomalous signals called ectopic beats, artefacts or noise which mask the true behaviour of heart rate variability. In this paper, we have proposed a combination filter of recursive impulse rejection filter and recursive 20% filter, with recursive application and preference of replacement over removal of abnormal beats to improve the pre-processing of the inter-beat intervals. We have tested this novel recursive combinational method with median method replacement to estimate the standard deviation of normal to normal (SDNN) beat intervals of congestive heart failure (CHF) and normal sinus rhythm subjects. This work discusses the improvement in pre-processing over single use of impulse rejection filter and removal of abnormal beats for heart rate variability for the estimation of SDNN and Poncaré plot descriptors (SD1, SD2, and SD1/SD2) in detail. We have found the 22 ms value of SDNN and 36 ms value of SD2 descriptor of Poincaré plot as clinical indicators in discriminating the normal cases from CHF cases. The pre-processing is also useful in calculation of Lyapunov exponent which is a nonlinear index as Lyapunov exponents calculated after proposed pre-processing modified in a way that it start following the notion of less complex behaviour of diseased states.

Recursive mass matrix factorization and inversion: An operator approach to open- and closed-chain multibody dynamics

NASA Technical Reports Server (NTRS)

Rodriguez, G.; Kreutz, K.

1988-01-01

This report advances a linear operator approach for analyzing the dynamics of systems of joint-connected rigid bodies.It is established that the mass matrix M for such a system can be factored as M=(I+H phi L)D(I+H phi L) sup T. This yields an immediate inversion M sup -1=(I-H psi L) sup T D sup -1 (I-H psi L), where H and phi are given by known link geometric parameters, and L, psi and D are obtained recursively by a spatial discrete-step Kalman filter and by the corresponding Riccati equation associated with this filter. The factors (I+H phi L) and (I-H psi L) are lower triangular matrices which are inverses of each other, and D is a diagonal matrix. This factorization and inversion of the mass matrix leads to recursive algortihms for forward dynamics based on spatially recursive filtering and smoothing. The primary motivation for advancing the operator approach is to provide a better means to formulate, analyze and understand spatial recursions in multibody dynamics. This is achieved because the linear operator notation allows manipulation of the equations of motion using a very high-level analytical framework (a spatial operator algebra) that is easy to understand and use. Detailed lower-level recursive algorithms can readily be obtained for inspection from the expressions involving spatial operators. The report consists of two main sections. In Part 1, the problem of serial chain manipulators is analyzed and solved. Extensions to a closed-chain system formed by multiple manipulators moving a common task object are contained in Part 2. To retain ease of exposition in the report, only these two types of multibody systems are considered. However, the same methods can be easily applied to arbitrary multibody systems formed by a collection of joint-connected regid bodies.

Managing Objects in a Relational Framework

DTIC Science & Technology

1989-01-01

Database Week, San Jose CA, May.1983, pp.107-113. [Stonebraker 85] Stonebraker,M. and Rowe,L.: "The Design of POSTGRES " Tech.Report UC Berkeley, Nov...latter is equivalent to the definition of an attribute in a POSTGRES relation using the generic Quel facility. Recently, recursive query languages have...utilize rewrite rules. OSQL [Lynl 88] provides a language for associative access. 2. The POSTGRES model [Sto 86] allows Quel and C-procedures as the

Online Denoising Based on the Second-Order Adaptive Statistics Model.

PubMed

Yi, Sheng-Lun; Jin, Xue-Bo; Su, Ting-Li; Tang, Zhen-Yun; Wang, Fa-Fa; Xiang, Na; Kong, Jian-Lei

2017-07-20

Online denoising is motivated by real-time applications in the industrial process, where the data must be utilizable soon after it is collected. Since the noise in practical process is usually colored, it is quite a challenge for denoising techniques. In this paper, a novel online denoising method was proposed to achieve the processing of the practical measurement data with colored noise, and the characteristics of the colored noise were considered in the dynamic model via an adaptive parameter. The proposed method consists of two parts within a closed loop: the first one is to estimate the system state based on the second-order adaptive statistics model and the other is to update the adaptive parameter in the model using the Yule-Walker algorithm. Specifically, the state estimation process was implemented via the Kalman filter in a recursive way, and the online purpose was therefore attained. Experimental data in a reinforced concrete structure test was used to verify the effectiveness of the proposed method. Results show the proposed method not only dealt with the signals with colored noise, but also achieved a tradeoff between efficiency and accuracy.

Infinities in Quantum Field Theory and in Classical Computing: Renormalization Program

NASA Astrophysics Data System (ADS)

Manin, Yuri I.

Introduction. The main observable quantities in Quantum Field Theory, correlation functions, are expressed by the celebrated Feynman path integrals. A mathematical definition of them involving a measure and actual integration is still lacking. Instead, it is replaced by a series of ad hoc but highly efficient and suggestive heuristic formulas such as perturbation formalism. The latter interprets such an integral as a formal series of finite-dimensional but divergent integrals, indexed by Feynman graphs, the list of which is determined by the Lagrangian of the theory. Renormalization is a prescription that allows one to systematically "subtract infinities" from these divergent terms producing an asymptotic series for quantum correlation functions. On the other hand, graphs treated as "flowcharts", also form a combinatorial skeleton of the abstract computation theory. Partial recursive functions that according to Church's thesis exhaust the universe of (semi)computable maps are generally not everywhere defined due to potentially infinite searches and loops. In this paper I argue that such infinities can be addressed in the same way as Feynman divergences. More details can be found in [9,10].

Discrete-time online learning control for a class of unknown nonaffine nonlinear systems using reinforcement learning.

PubMed

Yang, Xiong; Liu, Derong; Wang, Ding; Wei, Qinglai

2014-07-01

In this paper, a reinforcement-learning-based direct adaptive control is developed to deliver a desired tracking performance for a class of discrete-time (DT) nonlinear systems with unknown bounded disturbances. We investigate multi-input-multi-output unknown nonaffine nonlinear DT systems and employ two neural networks (NNs). By using Implicit Function Theorem, an action NN is used to generate the control signal and it is also designed to cancel the nonlinearity of unknown DT systems, for purpose of utilizing feedback linearization methods. On the other hand, a critic NN is applied to estimate the cost function, which satisfies the recursive equations derived from heuristic dynamic programming. The weights of both the action NN and the critic NN are directly updated online instead of offline training. By utilizing Lyapunov's direct method, the closed-loop tracking errors and the NN estimated weights are demonstrated to be uniformly ultimately bounded. Two numerical examples are provided to show the effectiveness of the present approach. Copyright © 2014 Elsevier Ltd. All rights reserved.

Clustering analysis of moving target signatures

NASA Astrophysics Data System (ADS)

Martone, Anthony; Ranney, Kenneth; Innocenti, Roberto

2010-04-01

Previously, we developed a moving target indication (MTI) processing approach to detect and track slow-moving targets inside buildings, which successfully detected moving targets (MTs) from data collected by a low-frequency, ultra-wideband radar. Our MTI algorithms include change detection, automatic target detection (ATD), clustering, and tracking. The MTI algorithms can be implemented in a real-time or near-real-time system; however, a person-in-the-loop is needed to select input parameters for the clustering algorithm. Specifically, the number of clusters to input into the cluster algorithm is unknown and requires manual selection. A critical need exists to automate all aspects of the MTI processing formulation. In this paper, we investigate two techniques that automatically determine the number of clusters: the adaptive knee-point (KP) algorithm and the recursive pixel finding (RPF) algorithm. The KP algorithm is based on a well-known heuristic approach for determining the number of clusters. The RPF algorithm is analogous to the image processing, pixel labeling procedure. Both algorithms are used to analyze the false alarm and detection rates of three operational scenarios of personnel walking inside wood and cinderblock buildings.

Neural Approximation-Based Adaptive Control for a Class of Nonlinear Nonstrict Feedback Discrete-Time Systems.

PubMed

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

2017-07-01

In this paper, an adaptive control approach-based neural approximation is developed for a class of uncertain nonlinear discrete-time (DT) systems. The main characteristic of the considered systems is that they can be viewed as a class of multi-input multioutput systems in the nonstrict feedback structure. The similar control problem of this class of systems has been addressed in the past, but it focused on the continuous-time systems. Due to the complicacies of the system structure, it will become more difficult for the controller design and the stability analysis. To stabilize this class of systems, a new recursive procedure is developed, and the effect caused by the noncausal problem in the nonstrict feedback DT structure can be solved using a semirecurrent neural approximation. Based on the Lyapunov difference approach, it is proved that all the signals of the closed-loop system are semiglobal, ultimately uniformly bounded, and a good tracking performance can be guaranteed. The feasibility of the proposed controllers can be validated by setting a simulation example.

Adaptive Approximation-Based Regulation Control for a Class of Uncertain Nonlinear Systems Without Feedback Linearizability.

PubMed

Wang, Ning; Sun, Jing-Chao; Han, Min; Zheng, Zhongjiu; Er, Meng Joo

2017-09-06

In this paper, for a general class of uncertain nonlinear (cascade) systems, including unknown dynamics, which are not feedback linearizable and cannot be solved by existing approaches, an innovative adaptive approximation-based regulation control (AARC) scheme is developed. Within the framework of adding a power integrator (API), by deriving adaptive laws for output weights and prediction error compensation pertaining to single-hidden-layer feedforward network (SLFN) from the Lyapunov synthesis, a series of SLFN-based approximators are explicitly constructed to exactly dominate completely unknown dynamics. By the virtue of significant advancements on the API technique, an adaptive API methodology is eventually established in combination with SLFN-based adaptive approximators, and it contributes to a recursive mechanism for the AARC scheme. As a consequence, the output regulation error can asymptotically converge to the origin, and all other signals of the closed-loop system are uniformly ultimately bounded. Simulation studies and comprehensive comparisons with backstepping- and API-based approaches demonstrate that the proposed AARC scheme achieves remarkable performance and superiority in dealing with unknown dynamics.

Developing Cultural Literacy through the Writing Process: Empowering All Learners.

ERIC Educational Resources Information Center

Palmer, Barbara C.; And Others

Combining the expansion of cultural literacy with the development of process-based writing, this book addresses each stage of the writing process, with emphasis on the recursive and overlapping nature of these stages. Numerous related model activities at the end of each chapter show how to develop the writing process, while expanding the writer's…

ADHD and Writing Learning Disabilities: Overlapping Disorders and Educational Implications

ERIC Educational Resources Information Center

Rodríguez, Celestino; Areces, Débora; García, Trinidad; Cueli, Marisol; Loew, Stephen J.; González-Castro, Paloma

2015-01-01

In this review, we discuss the historic evolution of ADHD research up until the present, and explain the actual theoretical models of writing in relation to ADHD and attention. Given the characterization of writing as a recursive process, and in order to show its relationship with attention disorders, examples of applicable writing models are also…

Formation of prismatic loops from C15 Laves phase interstitial clusters in body-centered cubic iron

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

Zhang, Yongfeng; Bai, Xian-Ming; Tonks, Michael R.

2015-03-01

This Letter reports the transition of C15 phase self-interstitial clusters to loops in body-centered-cubic Iron. Molecular dynamics simulations are performed to evaluate the relative stabilities of difference interstitial cluster configurations including C15 phase structure and <100> and <111>/2 loops. Within a certain size range, C15 cluster are found more stable than loops, and the relative stabilities are reversed beyond that range. In accordance to the crossover in relative stabilities, C15 clusters may grow by absorbing individual interstitials at small sizes and transitions into loops eventually. The transition takes place by nucleation and reaction of <111>/2 loop segments. These observations explainmore » the absence of C15 phase interstitial clusters predicted by density-functional-theory calculations in previous experimental observations. More importantly, the current results provide a new formation mechanism of <100> loops which requires no interaction of loops.« less

Analysis of Loss-of-Offsite-Power Events 1997-2015

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

Johnson, Nancy Ellen; Schroeder, John Alton

2016-07-01

Loss of offsite power (LOOP) can have a major negative impact on a power plant’s ability to achieve and maintain safe shutdown conditions. LOOP event frequencies and times required for subsequent restoration of offsite power are important inputs to plant probabilistic risk assessments. This report presents a statistical and engineering analysis of LOOP frequencies and durations at U.S. commercial nuclear power plants. The data used in this study are based on the operating experience during calendar years 1997 through 2015. LOOP events during critical operation that do not result in a reactor trip, are not included. Frequencies and durations weremore » determined for four event categories: plant-centered, switchyard-centered, grid-related, and weather-related. Emergency diesel generator reliability is also considered (failure to start, failure to load and run, and failure to run more than 1 hour). There is an adverse trend in LOOP durations. The previously reported adverse trend in LOOP frequency was not statistically significant for 2006-2015. Grid-related LOOPs happen predominantly in the summer. Switchyard-centered LOOPs happen predominantly in winter and spring. Plant-centered and weather-related LOOPs do not show statistically significant seasonality. The engineering analysis of LOOP data shows that human errors have been much less frequent since 1997 than in the 1986 -1996 time period.« less

The recursive maximum likelihood proportion estimator: User's guide and test results

NASA Technical Reports Server (NTRS)

Vanrooy, D. L.

1976-01-01

Implementation of the recursive maximum likelihood proportion estimator is described. A user's guide to programs as they currently exist on the IBM 360/67 at LARS, Purdue is included, and test results on LANDSAT data are described. On Hill County data, the algorithm yields results comparable to the standard maximum likelihood proportion estimator.

An Introduction to Recursive Partitioning: Rationale, Application, and Characteristics of Classification and Regression Trees, Bagging, and Random Forests

ERIC Educational Resources Information Center

Strobl, Carolin; Malley, James; Tutz, Gerhard

2009-01-01

Recursive partitioning methods have become popular and widely used tools for nonparametric regression and classification in many scientific fields. Especially random forests, which can deal with large numbers of predictor variables even in the presence of complex interactions, have been applied successfully in genetics, clinical medicine, and…

Using Recursive Regression to Explore Nonlinear Relationships and Interactions: A Tutorial Applied to a Multicultural Education Study

ERIC Educational Resources Information Center

Strang, Kenneth David

2009-01-01

This paper discusses how a seldom-used statistical procedure, recursive regression (RR), can numerically and graphically illustrate data-driven nonlinear relationships and interaction of variables. This routine falls into the family of exploratory techniques, yet a few interesting features make it a valuable compliment to factor analysis and…

Vehicle Sprung Mass Estimation for Rough Terrain

DTIC Science & Technology

2011-03-01

distributions are greater than zero. The multivariate polynomials are functions of the Legendre polynomials (Poularikas (1999...developed methods based on polynomial chaos theory and on the maximum likelihood approach to estimate the most likely value of the vehicle sprung...mass. The polynomial chaos estimator is compared to benchmark algorithms including recursive least squares, recursive total least squares, extended

On the design of recursive digital filters

NASA Technical Reports Server (NTRS)

Shenoi, K.; Narasimha, M. J.; Peterson, A. M.

1976-01-01

A change of variables is described which transforms the problem of designing a recursive digital filter to that of approximation by a ratio of polynomials on a finite interval. Some analytic techniques for the design of low-pass filters are presented, illustrating the use of the transformation. Also considered are methods for the design of phase equalizers.

Refinement Types ML

DTIC Science & Technology

1994-03-16

105 2.10 Decidability ........ ................................ 116 3 Declaring Refinements of Recursive Data Types 165 3.1...However, when we introduce polymorphic constructors in Chapter 5, tuples will become a polymorphic data type very similar to other polymorphic data types...terminate. 0 Chapter 3 Declaring Refinements of Recursive Data Types 3.1 Introduction The previous chapter defined refinement type inference in terms of

Becoming with Data: Developing Self-Assessing Recursive Pedagogies in Schools and Using Second-Order Cybernetics as a Thinking Tool

ERIC Educational Resources Information Center

Reinertsen, Anne Beate

2014-01-01

This article is about developing school-based self-assessing recursive pedagogies and case/action research practices and/or approaches in schools, and teachers, teacher researchers and researchers simultaneously producing and theorising their own practices using second-order cybernetics as a thinking tool. It is a move towards pragmatic…

Recursive restriction estimation: an alternative to post-stratification in surveys of land and forest cover

Treesearch

Raymond L. Czaplewski

2010-01-01

Numerous government surveys of natural resources use Post-Stratification to improve statistical efficiency, where strata are defined by full-coverage, remotely sensed data and geopolitical boundaries. Recursive Restriction Estimation, which may be considered a special case of the static Kalman filter, is an attractive alternative. It decomposes a complex estimation...

"There and Back Again" in the Writing Classroom: A Graduate Student's Recursive Journey through Pedagogical Research and Theory Development

ERIC Educational Resources Information Center

Mori, Miki

2013-01-01

This article discusses my (recursive) process of theory building and the relationship between research, teaching, and theory development for graduate students. It shows how graduate students can reshape their conceptual frameworks not only through course work, but also through researching classes they teach. Specifically, while analyzing the…

Semantics Boosts Syntax in Artificial Grammar Learning Tasks with Recursion

ERIC Educational Resources Information Center

Fedor, Anna; Varga, Mate; Szathmary, Eors

2012-01-01

Center-embedded recursion (CER) in natural language is exemplified by sentences such as "The malt that the rat ate lay in the house." Parsing center-embedded structures is in the focus of attention because this could be one of the cognitive capacities that make humans distinct from all other animals. The ability to parse CER is usually…

A Cognitive Processing Account of Individual Differences in Novice Logo Programmers' Conceptualisation and Use of Recursion.

ERIC Educational Resources Information Center

Gibbons, Pamela

1995-01-01

Describes a study that investigated individual differences in the construction of mental models of recursion in LOGO programming. The learning process was investigated from the perspective of Norman's mental models theory and employed diSessa's ontology regarding distributed, functional, and surrogate mental models, and the Luria model of brain…

Attitude determination and calibration using a recursive maximum likelihood-based adaptive Kalman filter

NASA Technical Reports Server (NTRS)

Kelly, D. A.; Fermelia, A.; Lee, G. K. F.

1990-01-01

An adaptive Kalman filter design that utilizes recursive maximum likelihood parameter identification is discussed. At the center of this design is the Kalman filter itself, which has the responsibility for attitude determination. At the same time, the identification algorithm is continually identifying the system parameters. The approach is applicable to nonlinear, as well as linear systems. This adaptive Kalman filter design has much potential for real time implementation, especially considering the fast clock speeds, cache memory and internal RAM available today. The recursive maximum likelihood algorithm is discussed in detail, with special attention directed towards its unique matrix formulation. The procedure for using the algorithm is described along with comments on how this algorithm interacts with the Kalman filter.

Event-based recursive filtering for a class of nonlinear stochastic parameter systems over fading channels

NASA Astrophysics Data System (ADS)

Shen, Yuxuan; Wang, Zidong; Shen, Bo; Alsaadi, Fuad E.

2018-07-01

In this paper, the recursive filtering problem is studied for a class of time-varying nonlinear systems with stochastic parameter matrices. The measurement transmission between the sensor and the filter is conducted through a fading channel characterized by the Rice fading model. An event-based transmission mechanism is adopted to decide whether the sensor measurement should be transmitted to the filter. A recursive filter is designed such that, in the simultaneous presence of the stochastic parameter matrices and fading channels, the filtering error covariance is guaranteed to have an upper bound and such an upper bound is then minimized by appropriately choosing filter gain matrix. Finally, a simulation example is presented to demonstrate the effectiveness of the proposed filtering scheme.

Decision tree modeling using R.

PubMed

Zhang, Zhongheng

2016-08-01

In machine learning field, decision tree learner is powerful and easy to interpret. It employs recursive binary partitioning algorithm that splits the sample in partitioning variable with the strongest association with the response variable. The process continues until some stopping criteria are met. In the example I focus on conditional inference tree, which incorporates tree-structured regression models into conditional inference procedures. While growing a single tree is subject to small changes in the training data, random forests procedure is introduced to address this problem. The sources of diversity for random forests come from the random sampling and restricted set of input variables to be selected. Finally, I introduce R functions to perform model based recursive partitioning. This method incorporates recursive partitioning into conventional parametric model building.

A Note on Local Stability Conditions for Two Types of Monetary Models with Recursive Utility

NASA Astrophysics Data System (ADS)

Miyazaki, Kenji; Utsunomiya, Hitoshi

2009-09-01

This note explores local stability conditions for money-in-utility-function (MIUF) and transaction-costs (TC) models with recursive utility. Although Chen et al. [Chen, B.-L., M. Hsu, and C.-H. Lin, 2008, Inflation and growth: impatience and a qualitative equivalent, Journal of Money, Credit, and Banking, Vol. 40, No. 6, 1310-1323] investigated the relationship between inflation and growth in MIUF and TC models with recursive utility, they conducted only a comparative static analysis in a steady state. By establishing sufficient conditions for local stability, this note proves that impatience should be increasing in consumption and real balances. Increasing impatience, although less plausible from an empirical point of view, receives more support from a theoretical viewpoint.

Note on new KLT relations

NASA Astrophysics Data System (ADS)

Feng, Bo; He, Song; Huang, Rijun; Jia, Yin

2010-10-01

In this short note, we present two results about KLT relations discussed in recent several papers. Our first result is the re-derivation of Mason-Skinner MHV amplitude by applying the S n-3 permutation symmetric KLT relations directly to MHV amplitude. Our second result is the equivalence proof of the newly discovered S n-2 permutation symmetric KLT relations and the well-known S n-3 permutation symmetric KLT relations. Although both formulas have been shown to be correct by BCFW recursion relations, our result is the first direct check using the regularized definition of the new formula.

On the Number of Non-equivalent Ancestral Configurations for Matching Gene Trees and Species Trees.

PubMed

Disanto, Filippo; Rosenberg, Noah A

2017-09-14

An ancestral configuration is one of the combinatorially distinct sets of gene lineages that, for a given gene tree, can reach a given node of a specified species tree. Ancestral configurations have appeared in recursive algebraic computations of the conditional probability that a gene tree topology is produced under the multispecies coalescent model for a given species tree. For matching gene trees and species trees, we study the number of ancestral configurations, considered up to an equivalence relation introduced by Wu (Evolution 66:763-775, 2012) to reduce the complexity of the recursive probability computation. We examine the largest number of non-equivalent ancestral configurations possible for a given tree size n. Whereas the smallest number of non-equivalent ancestral configurations increases polynomially with n, we show that the largest number increases with [Formula: see text], where k is a constant that satisfies [Formula: see text]. Under a uniform distribution on the set of binary labeled trees with a given size n, the mean number of non-equivalent ancestral configurations grows exponentially with n. The results refine an earlier analysis of the number of ancestral configurations considered without applying the equivalence relation, showing that use of the equivalence relation does not alter the exponential nature of the increase with tree size.

A Model of Self-Explanation Strategies of Instructional Text and Examples in the Acquisition of Programming Skills.

ERIC Educational Resources Information Center

Recker, Margaret M.; Pirolli, Peter

Students learning to program recursive LISP functions in a typical school-like lesson on recursion were observed. The typical lesson contains text and examples and involves solving a series of programming problems. The focus of this study is on students' learning strategies in new domains. In this light, a Soar computational model of…

Recursive inversion of externally defined linear systems

NASA Technical Reports Server (NTRS)

Bach, Ralph E., Jr.; Baram, Yoram

1988-01-01

The approximate inversion of an internally unknown linear system, given by its impulse response sequence, by an inverse system having a finite impulse response, is considered. The recursive least squares procedure is shown to have an exact initialization, based on the triangular Toeplitz structure of the matrix involved. The proposed approach also suggests solutions to the problems of system identification and compensation.

The Recursive Process in and of Critical Literacy: Action Research in an Urban Elementary School

ERIC Educational Resources Information Center

Cooper, Karyn; White, Robert E.

2012-01-01

This paper provides an overview of the recursive process of initiating an action research project on literacy for students-at-risk in a Canadian urban elementary school. As this paper demonstrates, this requires development of a school-wide framework, which frames the action research project and desired outcomes, and a shared ownership of this…

Centre-Embedded Structures Are a By-Product of Associative Learning and Working Memory Constraints: Evidence from Baboons ("Papio Papio")

ERIC Educational Resources Information Center

Rey, Arnaud; Perruchet, Pierre; Fagot, Joel

2012-01-01

Influential theories have claimed that the ability for recursion forms the computational core of human language faculty distinguishing our communication system from that of other animals (Hauser, Chomsky, & Fitch, 2002). In the present study, we consider an alternative view on recursion by studying the contribution of associative and working…

Experimental evaluation of a recursive model identification technique for type 1 diabetes.

PubMed

Finan, Daniel A; Doyle, Francis J; Palerm, Cesar C; Bevier, Wendy C; Zisser, Howard C; Jovanovic, Lois; Seborg, Dale E

2009-09-01

A model-based controller for an artificial beta cell requires an accurate model of the glucose-insulin dynamics in type 1 diabetes subjects. To ensure the robustness of the controller for changing conditions (e.g., changes in insulin sensitivity due to illnesses, changes in exercise habits, or changes in stress levels), the model should be able to adapt to the new conditions by means of a recursive parameter estimation technique. Such an adaptive strategy will ensure that the most accurate model is used for the current conditions, and thus the most accurate model predictions are used in model-based control calculations. In a retrospective analysis, empirical dynamic autoregressive exogenous input (ARX) models were identified from glucose-insulin data for nine type 1 diabetes subjects in ambulatory conditions. Data sets consisted of continuous (5-minute) glucose concentration measurements obtained from a continuous glucose monitor, basal insulin infusion rates and times and amounts of insulin boluses obtained from the subjects' insulin pumps, and subject-reported estimates of the times and carbohydrate content of meals. Two identification techniques were investigated: nonrecursive, or batch methods, and recursive methods. Batch models were identified from a set of training data, whereas recursively identified models were updated at each sampling instant. Both types of models were used to make predictions of new test data. For the purpose of comparison, model predictions were compared to zero-order hold (ZOH) predictions, which were made by simply holding the current glucose value constant for p steps into the future, where p is the prediction horizon. Thus, the ZOH predictions are model free and provide a base case for the prediction metrics used to quantify the accuracy of the model predictions. In theory, recursive identification techniques are needed only when there are changing conditions in the subject that require model adaptation. Thus, the identification and validation techniques were performed with both "normal" data and data collected during conditions of reduced insulin sensitivity. The latter were achieved by having the subjects self-administer a medication, prednisone, for 3 consecutive days. The recursive models were allowed to adapt to this condition of reduced insulin sensitivity, while the batch models were only identified from normal data. Data from nine type 1 diabetes subjects in ambulatory conditions were analyzed; six of these subjects also participated in the prednisone portion of the study. For normal test data, the batch ARX models produced 30-, 45-, and 60-minute-ahead predictions that had average root mean square error (RMSE) values of 26, 34, and 40 mg/dl, respectively. For test data characterized by reduced insulin sensitivity, the batch ARX models produced 30-, 60-, and 90-minute-ahead predictions with average RMSE values of 27, 46, and 59 mg/dl, respectively; the recursive ARX models demonstrated similar performance with corresponding values of 27, 45, and 61 mg/dl, respectively. The identified ARX models (batch and recursive) produced more accurate predictions than the model-free ZOH predictions, but only marginally. For test data characterized by reduced insulin sensitivity, RMSE values for the predictions of the batch ARX models were 9, 5, and 5% more accurate than the ZOH predictions for prediction horizons of 30, 60, and 90 minutes, respectively. In terms of RMSE values, the 30-, 60-, and 90-minute predictions of the recursive models were more accurate than the ZOH predictions, by 10, 5, and 2%, respectively. In this experimental study, the recursively identified ARX models resulted in predictions of test data that were similar, but not superior, to the batch models. Even for the test data characteristic of reduced insulin sensitivity, the batch and recursive models demonstrated similar prediction accuracy. The predictions of the identified ARX models were only marginally more accurate than the model-free ZOH predictions. Given the simplicity of the ARX models and the computational ease with which they are identified, however, even modest improvements may justify the use of these models in a model-based controller for an artificial beta cell. 2009 Diabetes Technology Society.

Convergence and Periodic Solutions for the Input Impedance of a Standard Ladder Network

ERIC Educational Resources Information Center

Ucak, C.; Acar, C.

2007-01-01

The input impedance of an infinite ladder network is computed by using the recursive relation and by assuming that the input impedance does not change when a new block is added to the network. However, this assumption is not true in general and standard textbooks do not always treat these networks correctly. This paper develops a general solution…

Non-iterative determination of the stress-density relation from ramp wave data through a window

NASA Astrophysics Data System (ADS)

Dowling, Evan; Fratanduono, Dayne; Swift, Damian

2017-06-01

In the canonical ramp compression experiment, a smoothly-increasing load is applied the surface of the sample, and the particle velocity history is measured at interfaces two or more different distances into the sample. The velocity histories are used to deduce a stress-density relation by correcting for perturbations caused by reflected release waves, usually via the iterative Lagrangian analysis technique of Rothman and Maw. We previously described a non-iterative (recursive) method of analysis, which was more stable and orders of magnitude faster than iteration, but was subject to the limitation that the free surface velocity had to be sampled at uniform intervals. We have now developed more general recursive algorithms suitable for analyzing ramp data through a finite-impedance window. Free surfaces can be treated seamlessly, and the need for uniform velocity sampling has been removed. These calculations require interpolation of partially-released states using the partially-constructed isentrope, making them slower than the previous free-surface scheme, but they are still much faster than iterative analysis. This work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under Contract DE-AC52-07NA27344.

Testing for the Endogenous Nature between Women's Empowerment and Antenatal Health Care Utilization: Evidence from a Cross-Sectional Study in Egypt

PubMed Central

Hussein, Mohamed Ali

2014-01-01

Women's relative lack of decision-making power and their unequal access to employment, finances, education, basic health care, and other resources are considered to be the root causes of their ill-health and that of their children. The main purpose of this paper is to examine the interactive relation between women's empowerment and the use of maternal health care. Two model specifications are tested. One assumes no correlation between empowerment and antenatal care while the second specification allows for correlation. Both the univariate and the recursive bivariate probit models are tested. The data used in this study is EDHS 2008. Factor Analysis Technique is also used to construct some of the explanatory variables such as the availability and quality of health services indicators. The findings show that women's empowerment and receiving regular antenatal care are simultaneously determined and the recursive bivariate probit is a better approximation to the relationship between them. Women's empowerment has significant and positive impact on receiving regular antenatal care. The availability and quality of health services do significantly increase the likelihood of receiving regular antenatal care. PMID:25140310

Recursive Bayesian recurrent neural networks for time-series modeling.

PubMed

Mirikitani, Derrick T; Nikolaev, Nikolay

2010-02-01

This paper develops a probabilistic approach to recursive second-order training of recurrent neural networks (RNNs) for improved time-series modeling. A general recursive Bayesian Levenberg-Marquardt algorithm is derived to sequentially update the weights and the covariance (Hessian) matrix. The main strengths of the approach are a principled handling of the regularization hyperparameters that leads to better generalization, and stable numerical performance. The framework involves the adaptation of a noise hyperparameter and local weight prior hyperparameters, which represent the noise in the data and the uncertainties in the model parameters. Experimental investigations using artificial and real-world data sets show that RNNs equipped with the proposed approach outperform standard real-time recurrent learning and extended Kalman training algorithms for recurrent networks, as well as other contemporary nonlinear neural models, on time-series modeling.

Recursive utility in a Markov environment with stochastic growth

PubMed Central

Hansen, Lars Peter; Scheinkman, José A.

2012-01-01

Recursive utility models that feature investor concerns about the intertemporal composition of risk are used extensively in applied research in macroeconomics and asset pricing. These models represent preferences as the solution to a nonlinear forward-looking difference equation with a terminal condition. In this paper we study infinite-horizon specifications of this difference equation in the context of a Markov environment. We establish a connection between the solution to this equation and to an arguably simpler Perron–Frobenius eigenvalue equation of the type that occurs in the study of large deviations for Markov processes. By exploiting this connection, we establish existence and uniqueness results. Moreover, we explore a substantive link between large deviation bounds for tail events for stochastic consumption growth and preferences induced by recursive utility. PMID:22778428

On the Dynamics of an Incursion Describing the Interactions between Functionally Differentiated Subsystems of a Discrete-time Anticipatory System

NASA Astrophysics Data System (ADS)

Burke, Mark E.

2010-11-01

Dubois coined the term incursion, for an inclusive or implicit recursion, to describe a discrete-time anticipatory system which computes its future states by reference to its future states as well as its current and past states. In this paper, we look at a model which has been proposed in the context of a social system which has functionally differentiated subsystems. The model is derived from a discrete-time compartmental SIS epidemic model. We analyse a low order instance of the model both in its form as a recursion with no anticipatory capacity, and also as an incursion with associated anticipatory capacity. The properties of the incursion are compared and contrasted with those of the underlying recursion.

An iterative approach to region growing using associative memories

NASA Technical Reports Server (NTRS)

Snyder, W. E.; Cowart, A.

1983-01-01

Region growing, often given as a classical example of the recursive control structures used in image processing which are often awkward to implement in hardware where the intent is the segmentation of an image at raster scan rates, is addressed in light of the postulate that any computation which can be performed recursively can be performed easily and efficiently by iteration coupled with association. Attention is given to an algorithm and hardware structure able to perform region labeling iteratively at scan rates. Every pixel is individually labeled with an identifier which signifies the region to which it belongs. Difficulties otherwise requiring recursion are handled by maintaining an equivalence table in hardware transparent to the computer, which reads the labeled pixels. A simulation of the associative memory has demonstrated its effectiveness.

[Formula: see text]-regularized recursive total least squares based sparse system identification for the error-in-variables.

PubMed

Lim, Jun-Seok; Pang, Hee-Suk

2016-01-01

In this paper an [Formula: see text]-regularized recursive total least squares (RTLS) algorithm is considered for the sparse system identification. Although recursive least squares (RLS) has been successfully applied in sparse system identification, the estimation performance in RLS based algorithms becomes worse, when both input and output are contaminated by noise (the error-in-variables problem). We proposed an algorithm to handle the error-in-variables problem. The proposed [Formula: see text]-RTLS algorithm is an RLS like iteration using the [Formula: see text] regularization. The proposed algorithm not only gives excellent performance but also reduces the required complexity through the effective inversion matrix handling. Simulations demonstrate the superiority of the proposed [Formula: see text]-regularized RTLS for the sparse system identification setting.

Recursive utility in a Markov environment with stochastic growth.

PubMed

Hansen, Lars Peter; Scheinkman, José A

2012-07-24

Recursive utility models that feature investor concerns about the intertemporal composition of risk are used extensively in applied research in macroeconomics and asset pricing. These models represent preferences as the solution to a nonlinear forward-looking difference equation with a terminal condition. In this paper we study infinite-horizon specifications of this difference equation in the context of a Markov environment. We establish a connection between the solution to this equation and to an arguably simpler Perron-Frobenius eigenvalue equation of the type that occurs in the study of large deviations for Markov processes. By exploiting this connection, we establish existence and uniqueness results. Moreover, we explore a substantive link between large deviation bounds for tail events for stochastic consumption growth and preferences induced by recursive utility.

A spatial operator algebra for manipulator modeling and control

NASA Technical Reports Server (NTRS)

Rodriguez, G.; Kreutz, K.; Jain, A.

1989-01-01

A spatial operator algebra for modeling the control and trajectory design of manipulation is discussed, with emphasis on its analytical formulation and implementation in the Ada programming language. The elements of this algebra are linear operators whose domain and range spaces consist of forces, moments, velocities, and accelerations. The effect of these operators is equivalent to a spatial recursion along the span of the manipulator. Inversion is obtained using techniques of recursive filtering and smoothing. The operator alegbra provides a high-level framework for describing the dynamic and kinematic behavior of a manipulator and control and trajectory design algorithms. Implementable recursive algorithms can be immediately derived from the abstract operator expressions by inspection, thus greatly simplifying the transition from an abstract problem formulation and solution to the detailed mechanization of a specific algorithm.

a Recursive Approach to Compute Normal Forms

NASA Astrophysics Data System (ADS)

HSU, L.; MIN, L. J.; FAVRETTO, L.

2001-06-01

Normal forms are instrumental in the analysis of dynamical systems described by ordinary differential equations, particularly when singularities close to a bifurcation are to be characterized. However, the computation of a normal form up to an arbitrary order is numerically hard. This paper focuses on the computer programming of some recursive formulas developed earlier to compute higher order normal forms. A computer program to reduce the system to its normal form on a center manifold is developed using the Maple symbolic language. However, it should be stressed that the program relies essentially on recursive numerical computations, while symbolic calculations are used only for minor tasks. Some strategies are proposed to save computation time. Examples are presented to illustrate the application of the program to obtain high order normalization or to handle systems with large dimension.

Implications of Middle School Behavior Problems for High School Graduation and Employment Outcomes of Young Adults: Estimation of a Recursive Model.

PubMed

Karakus, Mustafa C; Salkever, David S; Slade, Eric P; Ialongo, Nicholas; Stuart, Elizabeth

2012-01-01

The potentially serious adverse impacts of behavior problems during adolescence on employment outcomes in adulthood provide a key economic rationale for early intervention programs. However, the extent to which lower educational attainment accounts for the total impact of adolescent behavior problems on later employment remains unclear As an initial step in exploring this issue, we specify and estimate a recursive bivariate probit model that 1) relates middle school behavior problems to high school graduation and 2) models later employment in young adulthood as a function of these behavior problems and of high school graduation. Our model thus allows for both a direct effect of behavior problems on later employment as well as an indirect effect that operates via graduation from high school. Our empirical results, based on analysis of data from the NELS, suggest that the direct effects of externalizing behavior problems on later employment are not significant but that these problems have important indirect effects operating through high school graduation.

A recursive Bayesian updating model of haptic stiffness perception.

PubMed

Wu, Bing; Klatzky, Roberta L

2018-06-01

Stiffness of many materials follows Hooke's Law, but the mechanism underlying the haptic perception of stiffness is not as simple as it seems in the physical definition. The present experiments support a model by which stiffness perception is adaptively updated during dynamic interaction. Participants actively explored virtual springs and estimated their stiffness relative to a reference. The stimuli were simulations of linear springs or nonlinear springs created by modulating a linear counterpart with low-amplitude, half-cycle (Experiment 1) or full-cycle (Experiment 2) sinusoidal force. Experiment 1 showed that subjective stiffness increased (decreased) as a linear spring was positively (negatively) modulated by a half-sinewave force. In Experiment 2, an opposite pattern was observed for full-sinewave modulations. Modeling showed that the results were best described by an adaptive process that sequentially and recursively updated an estimate of stiffness using the force and displacement information sampled over trajectory and time. (PsycINFO Database Record (c) 2018 APA, all rights reserved).

Memory for flip-flopping: detection and recollection of political contradictions.

PubMed

Putnam, Adam L; Wahlheim, Christopher N; Jacoby, Larry L

2014-10-01

During political campaigns, candidates often change their positions on controversial issues. Does changing positions create confusion and impair memory for a politician's current position? In 3 experiments, two political candidates held positions on controversial issues in two debates. Across the debates, their positions were repeated, changed, or held only in the second debate (control). Relative to the control condition, recall of the most recent position on issues was enhanced when change was detected and recollected, whereas recall was impaired when change was not recollected. Furthermore, examining the errors revealed that subjects were more likely to intrude a Debate 1 response than to recall a blend of the two positions, and that recollecting change decreased Debate 1 intrusions. We argue that detecting change produces a recursive representation that embeds the original position in memory along with the more recent position. Recollecting change then enhances memory for the politician's positions and their order of occurrence by accessing the recursive trace.

Natural product-like virtual libraries: recursive atom-based enumeration.

PubMed

Yu, Melvin J

2011-03-28

A new molecular enumerator is described that allows chemically and architecturally diverse sets of natural product-like and drug-like structures to be generated from a core structure as simple as a single carbon atom or as complex as a polycyclic ring system. Integrated with a rudimentary machine-learning algorithm, the enumerator has the ability to assemble biased virtual libraries enriched in compounds predicted to meet target criteria. The ability to dynamically generate relatively small focused libraries in a recursive manner could reduce the computational time and infrastructure necessary to construct and manage extremely large static libraries. Depending on enumeration conditions, natural product-like structures can be produced with a wide range of heterocyclic and alicyclic ring assemblies. Because natural products represent a proven source of validated structures for identifying and designing new drug candidates, mimicking the structural and topological diversity found in nature with a dynamic set of virtual natural product-like compounds may facilitate the creation of new ideas for novel, biologically relevant lead structures in areas of uncharted chemical space.

Impact of Age and Antibody Type on Progression From Single to Multiple Autoantibodies in Type 1 Diabetes Relatives.

PubMed

Bosi, Emanuele; Boulware, David C; Becker, Dorothy J; Buckner, Jane H; Geyer, Susan; Gottlieb, Peter A; Henderson, Courtney; Kinderman, Amanda; Sosenko, Jay M; Steck, Andrea K; Bingley, Polly J

2017-08-01

Islet autoantibodies are markers of type 1 diabetes, and an increase in number of autoantibodies detected during the preclinical phase predicts progression to overt disease. To refine the effect of age in relation to islet antibody type on progression from single to multiple autoantibodies in relatives of people with type 1 diabetes. We examined 994 relatives with normal glucose tolerance who were positive for a single autoantibody, followed prospectively in the TrialNet Pathway to Prevention. Antibodies to glutamic acid decarboxylase (GADA), insulin (IAA), insulinoma-associated antigen 2, and zinc transporter 8 and islet cell antibodies were tested every 6 to 12 months. The primary outcome was confirmed development of multiple autoantibodies. Age was categorized as <8 years, 8 to 11 years, 12 to 17 years, and ≥18 years, and optimal age breakpoints were identified by recursive partitioning analysis. After median follow-up of 2 years, 141 relatives had developed at least one additional autoantibodies. Five-year risk was inversely related to age, but the pattern differed by antibody type: Relatives with GADA showed a gradual decrease in risk over the four age groups, whereas relatives with IAA showed a sharp decrease above age 8 years. Recursive partitioning analysis identified age breakpoints at 14 years in relatives with GADA and at 4 years in relatives with IAA. In relatives with IAA, spread of islet autoimmunity is largely limited to early childhood, whereas immune responses initially directed at glutamic acid decarboxylase can mature over a longer period. These differences have important implications for monitoring these patients and for designing prevention trials. Copyright © 2017 Endocrine Society

Report to the High Order Language Working Group (HOLWG)

DTIC Science & Technology

1977-01-14

as running, runnable, suspended or dormant, may be synchronized by semaphore variables, may be schedaled using clock and duration data types and mpy...Recursive and non-recursive routines G6. Parallel processes, synchronization , critical regions G7. User defined parameterized exception handling G8...typed and lacks extensibility, parallel processing, synchronization and real-time features. Overall Evaluation IBM strongly recommended PL/I as a

Recursive inversion of externally defined linear systems by FIR filters

NASA Technical Reports Server (NTRS)

Bach, Ralph E., Jr.; Baram, Yoram

1989-01-01

The approximate inversion of an internally unknown linear system, given by its impulse response sequence, by an inverse system having a finite impulse response, is considered. The recursive least-squares procedure is shown to have an exact initialization, based on the triangular Toeplitz structure of the matrix involved. The proposed approach also suggests solutions to the problem of system identification and compensation.

Recursive search method for the image elements of functionally defined surfaces

NASA Astrophysics Data System (ADS)

Vyatkin, S. I.

2017-05-01

This paper touches upon the synthesis of high-quality images in real time and the technique for specifying three-dimensional objects on the basis of perturbation functions. The recursive search method for the image elements of functionally defined objects with the use of graphics processing units is proposed. The advantages of such an approach over the frame-buffer visualization method are shown.

N/om, Change, and Social Work: A Recursive Frame Analysis of the Transformative Rituals of the Ju/'hoan Bushmen

ERIC Educational Resources Information Center

Keeney, Hillary; Keeney, Bradford

2013-01-01

The Ju/'hoan Bushman origin myth is depicted as a contextual frame for their healing and transformative ways. Using Recursive Frame Analysis, these performances are shown to be an enactment of the border crossing between First and Second Creation, that is, pre-linguistic and linguistic domains of experience. Here n/om, or the presumed creative…

Aesthetic Responses to Exact Fractals Driven by Physical Complexity

PubMed Central

Bies, Alexander J.; Blanc-Goldhammer, Daryn R.; Boydston, Cooper R.; Taylor, Richard P.; Sereno, Margaret E.

2016-01-01

Fractals are physically complex due to their repetition of patterns at multiple size scales. Whereas the statistical characteristics of the patterns repeat for fractals found in natural objects, computers can generate patterns that repeat exactly. Are these exact fractals processed differently, visually and aesthetically, than their statistical counterparts? We investigated the human aesthetic response to the complexity of exact fractals by manipulating fractal dimensionality, symmetry, recursion, and the number of segments in the generator. Across two studies, a variety of fractal patterns were visually presented to human participants to determine the typical response to exact fractals. In the first study, we found that preference ratings for exact midpoint displacement fractals can be described by a linear trend with preference increasing as fractal dimension increases. For the majority of individuals, preference increased with dimension. We replicated these results for other exact fractal patterns in a second study. In the second study, we also tested the effects of symmetry and recursion by presenting asymmetric dragon fractals, symmetric dragon fractals, and Sierpinski carpets and Koch snowflakes, which have radial and mirror symmetry. We found a strong interaction among recursion, symmetry and fractal dimension. Specifically, at low levels of recursion, the presence of symmetry was enough to drive high preference ratings for patterns with moderate to high levels of fractal dimension. Most individuals required a much higher level of recursion to recover this level of preference in a pattern that lacked mirror or radial symmetry, while others were less discriminating. This suggests that exact fractals are processed differently than their statistical counterparts. We propose a set of four factors that influence complexity and preference judgments in fractals that may extend to other patterns: fractal dimension, recursion, symmetry and the number of segments in a pattern. Conceptualizations such as Berlyne’s and Redies’ theories of aesthetics also provide a suitable framework for interpretation of our data with respect to the individual differences that we detect. Future studies that incorporate physiological methods to measure the human aesthetic response to exact fractal patterns would further elucidate our responses to such timeless patterns. PMID:27242475

A recursive Bayesian approach for fatigue damage prognosis: An experimental validation at the reliability component level

NASA Astrophysics Data System (ADS)

Gobbato, Maurizio; Kosmatka, John B.; Conte, Joel P.

2014-04-01

Fatigue-induced damage is one of the most uncertain and highly unpredictable failure mechanisms for a large variety of mechanical and structural systems subjected to cyclic and random loads during their service life. A health monitoring system capable of (i) monitoring the critical components of these systems through non-destructive evaluation (NDE) techniques, (ii) assessing their structural integrity, (iii) recursively predicting their remaining fatigue life (RFL), and (iv) providing a cost-efficient reliability-based inspection and maintenance plan (RBIM) is therefore ultimately needed. In contribution to these objectives, the first part of the paper provides an overview and extension of a comprehensive reliability-based fatigue damage prognosis methodology — previously developed by the authors — for recursively predicting and updating the RFL of critical structural components and/or sub-components in aerospace structures. In the second part of the paper, a set of experimental fatigue test data, available in the literature, is used to provide a numerical verification and an experimental validation of the proposed framework at the reliability component level (i.e., single damage mechanism evolving at a single damage location). The results obtained from this study demonstrate (i) the importance and the benefits of a nearly continuous NDE monitoring system, (ii) the efficiency of the recursive Bayesian updating scheme, and (iii) the robustness of the proposed framework in recursively updating and improving the RFL estimations. This study also demonstrates that the proposed methodology can lead to either an extent of the RFL (with a consequent economical gain without compromising the minimum safety requirements) or an increase of safety by detecting a premature fault and therefore avoiding a very costly catastrophic failure.

Essential energy space random walks to accelerate molecular dynamics simulations: Convergence improvements via an adaptive-length self-healing strategy

NASA Astrophysics Data System (ADS)

Zheng, Lianqing; Yang, Wei

2008-07-01

Recently, accelerated molecular dynamics (AMD) technique was generalized to realize essential energy space random walks so that further sampling enhancement and effective localized enhanced sampling could be achieved. This method is especially meaningful when essential coordinates of the target events are not priori known; moreover, the energy space metadynamics method was also introduced so that biasing free energy functions can be robustly generated. Despite the promising features of this method, due to the nonequilibrium nature of the metadynamics recursion, it is challenging to rigorously use the data obtained at the recursion stage to perform equilibrium analysis, such as free energy surface mapping; therefore, a large amount of data ought to be wasted. To resolve such problem so as to further improve simulation convergence, as promised in our original paper, we are reporting an alternate approach: the adaptive-length self-healing (ALSH) strategy for AMD simulations; this development is based on a recent self-healing umbrella sampling method. Here, the unit simulation length for each self-healing recursion is increasingly updated based on the Wang-Landau flattening judgment. When the unit simulation length for each update is long enough, all the following unit simulations naturally run into the equilibrium regime. Thereafter, these unit simulations can serve for the dual purposes of recursion and equilibrium analysis. As demonstrated in our model studies, by applying ALSH, both fast recursion and short nonequilibrium data waste can be compromised. As a result, combining all the data obtained from all the unit simulations that are in the equilibrium regime via the weighted histogram analysis method, efficient convergence can be robustly ensured, especially for the purpose of free energy surface mapping.

Patellar segmentation from 3D magnetic resonance images using guided recursive ray-tracing for edge pattern detection

NASA Astrophysics Data System (ADS)

Cheng, Ruida; Jackson, Jennifer N.; McCreedy, Evan S.; Gandler, William; Eijkenboom, J. J. F. A.; van Middelkoop, M.; McAuliffe, Matthew J.; Sheehan, Frances T.

2016-03-01

The paper presents an automatic segmentation methodology for the patellar bone, based on 3D gradient recalled echo and gradient recalled echo with fat suppression magnetic resonance images. Constricted search space outlines are incorporated into recursive ray-tracing to segment the outer cortical bone. A statistical analysis based on the dependence of information in adjacent slices is used to limit the search in each image to between an outer and inner search region. A section based recursive ray-tracing mechanism is used to skip inner noise regions and detect the edge boundary. The proposed method achieves higher segmentation accuracy (0.23mm) than the current state-of-the-art methods with the average dice similarity coefficient of 96.0% (SD 1.3%) agreement between the auto-segmentation and ground truth surfaces.

Cooperating reduction machines

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

Kluge, W.E.

1983-11-01

This paper presents a concept and a system architecture for the concurrent execution of program expressions of a concrete reduction language based on lamda-expressions. If formulated appropriately, these expressions are well-suited for concurrent execution, following a demand-driven model of computation. In particular, recursive program expressions with nonlinear expansion may, at run time, recursively be partitioned into a hierarchy of independent subexpressions which can be reduced by a corresponding hierarchy of virtual reduction machines. This hierarchy unfolds and collapses dynamically, with virtual machines recursively assuming the role of masters that create and eventually terminate, or synchronize with, slaves. The paper alsomore » proposes a nonhierarchically organized system of reduction machines, each featuring a stack architecture, that effectively supports the allocation of virtual machines to the real machines of the system in compliance with their hierarchical order of creation and termination. 25 references.« less

Health monitoring system for transmission shafts based on adaptive parameter identification

NASA Astrophysics Data System (ADS)

Souflas, I.; Pezouvanis, A.; Ebrahimi, K. M.

2018-05-01

A health monitoring system for a transmission shaft is proposed. The solution is based on the real-time identification of the physical characteristics of the transmission shaft i.e. stiffness and damping coefficients, by using a physical oriented model and linear recursive identification. The efficacy of the suggested condition monitoring system is demonstrated on a prototype transient engine testing facility equipped with a transmission shaft capable of varying its physical properties. Simulation studies reveal that coupling shaft faults can be detected and isolated using the proposed condition monitoring system. Besides, the performance of various recursive identification algorithms is addressed. The results of this work recommend that the health status of engine dynamometer shafts can be monitored using a simple lumped-parameter shaft model and a linear recursive identification algorithm which makes the concept practically viable.

A recursively formulated first-order semianalytic artificial satellite theory based on the generalized method of averaging. Volume 1: The generalized method of averaging applied to the artificial satellite problem

NASA Technical Reports Server (NTRS)

Mcclain, W. D.

1977-01-01

A recursively formulated, first-order, semianalytic artificial satellite theory, based on the generalized method of averaging is presented in two volumes. Volume I comprehensively discusses the theory of the generalized method of averaging applied to the artificial satellite problem. Volume II presents the explicit development in the nonsingular equinoctial elements of the first-order average equations of motion. The recursive algorithms used to evaluate the first-order averaged equations of motion are also presented in Volume II. This semianalytic theory is, in principle, valid for a term of arbitrary degree in the expansion of the third-body disturbing function (nonresonant cases only) and for a term of arbitrary degree and order in the expansion of the nonspherical gravitational potential function.

Geomagnetic modeling by optimal recursive filtering

NASA Technical Reports Server (NTRS)

Gibbs, B. P.; Estes, R. H.

1981-01-01

The results of a preliminary study to determine the feasibility of using Kalman filter techniques for geomagnetic field modeling are given. Specifically, five separate field models were computed using observatory annual means, satellite, survey and airborne data for the years 1950 to 1976. Each of the individual field models used approximately five years of data. These five models were combined using a recursive information filter (a Kalman filter written in terms of information matrices rather than covariance matrices.) The resulting estimate of the geomagnetic field and its secular variation was propogated four years past the data to the time of the MAGSAT data. The accuracy with which this field model matched the MAGSAT data was evaluated by comparisons with predictions from other pre-MAGSAT field models. The field estimate obtained by recursive estimation was found to be superior to all other models.

Renormalization group estimates of transport coefficients in the advection of a passive scalar by incompressible turbulence

NASA Technical Reports Server (NTRS)

Zhou, YE; Vahala, George

1993-01-01

The advection of a passive scalar by incompressible turbulence is considered using recursive renormalization group procedures in the differential sub grid shell thickness limit. It is shown explicitly that the higher order nonlinearities induced by the recursive renormalization group procedure preserve Galilean invariance. Differential equations, valid for the entire resolvable wave number k range, are determined for the eddy viscosity and eddy diffusivity coefficients, and it is shown that higher order nonlinearities do not contribute as k goes to 0, but have an essential role as k goes to k(sub c) the cutoff wave number separating the resolvable scales from the sub grid scales. The recursive renormalization transport coefficients and the associated eddy Prandtl number are in good agreement with the k-dependent transport coefficients derived from closure theories and experiments.

A recursive linear predictive vocoder

NASA Astrophysics Data System (ADS)

Janssen, W. A.

1983-12-01

A non-real time 10 pole recursive autocorrelation linear predictive coding vocoder was created for use in studying effects of recursive autocorrelation on speech. The vocoder is composed of two interchangeable pitch detectors, a speech analyzer, and speech synthesizer. The time between updating filter coefficients is allowed to vary from .125 msec to 20 msec. The best quality was found using .125 msec between each update. The greatest change in quality was noted when changing from 20 msec/update to 10 msec/update. Pitch period plots for the center clipping autocorrelation pitch detector and simplified inverse filtering technique are provided. Plots of speech into and out of the vocoder are given. Formant versus time three dimensional plots are shown. Effects of noise on pitch detection and formants are shown. Noise effects the voiced/unvoiced decision process causing voiced speech to be re-constructed as unvoiced.

Recursion Operators and Bi-Hamiltonian Structures in Multidimensions II,

DTIC Science & Technology

1986-07-01

a Symmifetry (1.2). For example the Kadomtsev - Petviashvili (KP) equation and the Davey-Stewartson (DS) equation admit two such hierarchies of...Degasperis, Nuovo Cimento, 398, 1 (1977). [16] P. Caudrey, Discrete and Periodic Spectral Transforms Related to the Kadomtsev - Petviashvili Equation ...these equations possess infinitely many time dependent symmetries and constants of motion. The master symmetries T for these equations are simply derived

Planting a Tree while Envisioning the Forest--The Recursive Relation between Theory and Research: Reply to Blustein (2003).

ERIC Educational Resources Information Center

Tokar, David M.; Hall, Rosalie J.; Moradi, Bonnie

2003-01-01

In his comments regarding Tokar et al.'s article (this issue) Blustein offered several useful suggestions for future research in the area of relationship variables and career development and raised several concerns about the rationale for and use of structural equation modeling in testing their models. In this reply, the authors note points of…

Re-Turning Feminist Methodologies: From a Social to an Ecological Epistemology

ERIC Educational Resources Information Center

Hughes, Christina; Lury, Celia

2013-01-01

This paper proposes an ecological methodology in order to re-think the concept of situatedness in ways that can take into account that we live in relation to, and are of, a more-and-other-than-human world. In doing so, the paper proposes that situatedness should be understood in terms of processes of co-invention that, fractally and recursively,…

The zig-zag walk with scattering and absorption on the real half line and in a lattice model

NASA Astrophysics Data System (ADS)

Wuttke, Joachim

2014-05-01

The Darwin-Hamilton equations, describing one-dimensional transport with scattering and absorption, are expanded into a recursion. The solution involves ballot numbers. The recurrence probability as function of scattering order is given by Catalan numbers. To reproduce this analytical result in a lattice model, a novel relation between Narayana and Catalan numbers is derived.

Recursion Operators and Tri-Hamiltonian Structure of the First Heavenly Equation of Plebański

NASA Astrophysics Data System (ADS)

Sheftel, Mikhail; Yazıcı, Devrim

2016-09-01

We present first heavenly equation of Plebański in a two-component evolutionary form and obtain Lagrangian and Hamiltonian representations of this system. We study all point symmetries of the two-component system and, using the inverse Noether theorem in the Hamiltonian form, obtain all the integrals of motion corresponding to each variational (Noether) symmetry. We derive two linearly independent recursion operators for symmetries of this system related by a discrete symmetry of both the two-component system and its symmetry condition. Acting by these operators on the first Hamiltonian operator J_0 we obtain second and third Hamiltonian operators. However, we were not able to find Hamiltonian densities corresponding to the latter two operators. Therefore, we construct two recursion operators, which are either even or odd, respectively, under the above-mentioned discrete symmetry. Acting with them on J_0, we generate another two Hamiltonian operators J_+ and J_- and find the corresponding Hamiltonian densities, thus obtaining second and third Hamiltonian representations for the first heavenly equation in a two-component form. Using P. Olver's theory of the functional multi-vectors, we check that the linear combination of J_0, J_+ and J_- with arbitrary constant coefficients satisfies Jacobi identities. Since their skew symmetry is obvious, these three operators are compatible Hamiltonian operators and hence we obtain a tri-Hamiltonian representation of the first heavenly equation. Our well-founded conjecture applied here is that P. Olver's method works fine for nonlocal operators and our proof of the Jacobi identities and bi-Hamiltonian structures crucially depends on the validity of this conjecture.

Recursive Hierarchical Image Segmentation by Region Growing and Constrained Spectral Clustering

NASA Technical Reports Server (NTRS)

Tilton, James C.

2002-01-01

This paper describes an algorithm for hierarchical image segmentation (referred to as HSEG) and its recursive formulation (referred to as RHSEG). The HSEG algorithm is a hybrid of region growing and constrained spectral clustering that produces a hierarchical set of image segmentations based on detected convergence points. In the main, HSEG employs the hierarchical stepwise optimization (HS WO) approach to region growing, which seeks to produce segmentations that are more optimized than those produced by more classic approaches to region growing. In addition, HSEG optionally interjects between HSWO region growing iterations merges between spatially non-adjacent regions (i.e., spectrally based merging or clustering) constrained by a threshold derived from the previous HSWO region growing iteration. While the addition of constrained spectral clustering improves the segmentation results, especially for larger images, it also significantly increases HSEG's computational requirements. To counteract this, a computationally efficient recursive, divide-and-conquer, implementation of HSEG (RHSEG) has been devised and is described herein. Included in this description is special code that is required to avoid processing artifacts caused by RHSEG s recursive subdivision of the image data. Implementations for single processor and for multiple processor computer systems are described. Results with Landsat TM data are included comparing HSEG with classic region growing. Finally, an application to image information mining and knowledge discovery is discussed.

Toward using games to teach fundamental computer science concepts

NASA Astrophysics Data System (ADS)

Edgington, Jeffrey Michael

Video and computer games have become an important area of study in the field of education. Games have been designed to teach mathematics, physics, raise social awareness, teach history and geography, and train soldiers in the military. Recent work has created computer games for teaching computer programming and understanding basic algorithms. We present an investigation where computer games are used to teach two fundamental computer science concepts: boolean expressions and recursion. The games are intended to teach the concepts and not how to implement them in a programming language. For this investigation, two computer games were created. One is designed to teach basic boolean expressions and operators and the other to teach fundamental concepts of recursion. We describe the design and implementation of both games. We evaluate the effectiveness of these games using before and after surveys. The surveys were designed to ascertain basic understanding, attitudes and beliefs regarding the concepts. The boolean game was evaluated with local high school students and students in a college level introductory computer science course. The recursion game was evaluated with students in a college level introductory computer science course. We present the analysis of the collected survey information for both games. This analysis shows a significant positive change in student attitude towards recursion and modest gains in student learning outcomes for both topics.

New recursive-least-squares algorithms for nonlinear active control of sound and vibration using neural networks.

PubMed

Bouchard, M

2001-01-01

In recent years, a few articles describing the use of neural networks for nonlinear active control of sound and vibration were published. Using a control structure with two multilayer feedforward neural networks (one as a nonlinear controller and one as a nonlinear plant model), steepest descent algorithms based on two distinct gradient approaches were introduced for the training of the controller network. The two gradient approaches were sometimes called the filtered-x approach and the adjoint approach. Some recursive-least-squares algorithms were also introduced, using the adjoint approach. In this paper, an heuristic procedure is introduced for the development of recursive-least-squares algorithms based on the filtered-x and the adjoint gradient approaches. This leads to the development of new recursive-least-squares algorithms for the training of the controller neural network in the two networks structure. These new algorithms produce a better convergence performance than previously published algorithms. Differences in the performance of algorithms using the filtered-x and the adjoint gradient approaches are discussed in the paper. The computational load of the algorithms discussed in the paper is evaluated for multichannel systems of nonlinear active control. Simulation results are presented to compare the convergence performance of the algorithms, showing the convergence gain provided by the new algorithms.

Perturbative Quantum Gravity from Gauge Theory

NASA Astrophysics Data System (ADS)

Carrasco, John Joseph

In this dissertation we present the graphical techniques recently developed in the construction of multi-loop scattering amplitudes using the method of generalized unitarity. We construct the three-loop and four-loop four-point amplitudes of N = 8 supergravity using these methods and the Kawaii, Lewellen and Tye tree-level relations which map tree-level gauge theory amplitudes to tree-level gravity theory amplitudes. We conclude by extending a tree-level duality between color and kinematics, generic to gauge theories, to a loop level conjecture, allowing the easy relation between loop-level gauge and gravity kinematics. We provide non-trivial evidence for this conjecture at three-loops in the particular case of maximal supersymmetry.

An improved standardization procedure to remove systematic low frequency variability biases in GCM simulations

NASA Astrophysics Data System (ADS)

Mehrotra, Rajeshwar; Sharma, Ashish

2012-12-01

The quality of the absolute estimates of general circulation models (GCMs) calls into question the direct use of GCM outputs for climate change impact assessment studies, particularly at regional scales. Statistical correction of GCM output is often necessary when significant systematic biasesoccur between the modeled output and observations. A common procedure is to correct the GCM output by removing the systematic biases in low-order moments relative to observations or to reanalysis data at daily, monthly, or seasonal timescales. In this paper, we present an extension of a recently published nested bias correction (NBC) technique to correct for the low- as well as higher-order moments biases in the GCM-derived variables across selected multiple time-scales. The proposed recursive nested bias correction (RNBC) approach offers an improved basis for applying bias correction at multiple timescales over the original NBC procedure. The method ensures that the bias-corrected series exhibits improvements that are consistently spread over all of the timescales considered. Different variations of the approach starting from the standard NBC to the more complex recursive alternatives are tested to assess their impacts on a range of GCM-simulated atmospheric variables of interest in downscaling applications related to hydrology and water resources. Results of the study suggest that three to five iteration RNBCs are the most effective in removing distributional and persistence related biases across the timescales considered.

Genetic analysis of the heparan modification network in Caenorhabditis elegans.

PubMed

Townley, Robert A; Bülow, Hannes E

2011-05-13

Heparan sulfates (HS) are highly modified sugar polymers in multicellular organisms that function in cell adhesion and cellular responses to protein signaling. Functionally distinct, cell type-dependent HS modification patterns arise as the result of a conserved network of enzymes that catalyze deacetylations, sulfations, and epimerizations in specific positions of the sugar residues. To understand the genetic interactions of the enzymes during the HS modification process, we have measured the composition of HS purified from mutant strains of Caenorhabditis elegans. From these measurements we have developed a genetic network model of HS modification. We find the interactions to be highly recursive positive feed-forward and negative feedback loops. Our genetic analyses show that the HS C-5 epimerase hse-5, the HS 2-O-sulfotransferase hst-2, or the HS 6-O-sulfotransferase hst-6 inhibit N-sulfation. In contrast, hse-5 stimulates both 2-O- and 6-O-sulfation and, hst-2 and hst-6 inhibit 6-O- and 2-O-sulfation, respectively. The effects of hst-2 and hst-6 on N-sulfation, 6-O-sulfation, and 2-O-sulfation appear largely dependent on hse-5 function. This core of regulatory interactions is further modulated by 6-O-endosulfatase activity (sul-1). 47% of all 6-O-sulfates get removed from HS and this editing process is dependent on hst-2, thereby providing additional negative feedback between 2-O- and 6-O-sulfation. These findings suggest that the modification patterns are highly sensitive to the relative composition of the HS modification enzymes. Our comprehensive genetic analysis forms the basis of understanding the HS modification network in metazoans.

Travel Time Estimation Using Freeway Point Detector Data Based on Evolving Fuzzy Neural Inference System.

PubMed

Tang, Jinjun; Zou, Yajie; Ash, John; Zhang, Shen; Liu, Fang; Wang, Yinhai

2016-01-01

Travel time is an important measurement used to evaluate the extent of congestion within road networks. This paper presents a new method to estimate the travel time based on an evolving fuzzy neural inference system. The input variables in the system are traffic flow data (volume, occupancy, and speed) collected from loop detectors located at points both upstream and downstream of a given link, and the output variable is the link travel time. A first order Takagi-Sugeno fuzzy rule set is used to complete the inference. For training the evolving fuzzy neural network (EFNN), two learning processes are proposed: (1) a K-means method is employed to partition input samples into different clusters, and a Gaussian fuzzy membership function is designed for each cluster to measure the membership degree of samples to the cluster centers. As the number of input samples increases, the cluster centers are modified and membership functions are also updated; (2) a weighted recursive least squares estimator is used to optimize the parameters of the linear functions in the Takagi-Sugeno type fuzzy rules. Testing datasets consisting of actual and simulated data are used to test the proposed method. Three common criteria including mean absolute error (MAE), root mean square error (RMSE), and mean absolute relative error (MARE) are utilized to evaluate the estimation performance. Estimation results demonstrate the accuracy and effectiveness of the EFNN method through comparison with existing methods including: multiple linear regression (MLR), instantaneous model (IM), linear model (LM), neural network (NN), and cumulative plots (CP).

Travel Time Estimation Using Freeway Point Detector Data Based on Evolving Fuzzy Neural Inference System

PubMed Central

Tang, Jinjun; Zou, Yajie; Ash, John; Zhang, Shen; Liu, Fang; Wang, Yinhai

2016-01-01

Travel time is an important measurement used to evaluate the extent of congestion within road networks. This paper presents a new method to estimate the travel time based on an evolving fuzzy neural inference system. The input variables in the system are traffic flow data (volume, occupancy, and speed) collected from loop detectors located at points both upstream and downstream of a given link, and the output variable is the link travel time. A first order Takagi-Sugeno fuzzy rule set is used to complete the inference. For training the evolving fuzzy neural network (EFNN), two learning processes are proposed: (1) a K-means method is employed to partition input samples into different clusters, and a Gaussian fuzzy membership function is designed for each cluster to measure the membership degree of samples to the cluster centers. As the number of input samples increases, the cluster centers are modified and membership functions are also updated; (2) a weighted recursive least squares estimator is used to optimize the parameters of the linear functions in the Takagi-Sugeno type fuzzy rules. Testing datasets consisting of actual and simulated data are used to test the proposed method. Three common criteria including mean absolute error (MAE), root mean square error (RMSE), and mean absolute relative error (MARE) are utilized to evaluate the estimation performance. Estimation results demonstrate the accuracy and effectiveness of the EFNN method through comparison with existing methods including: multiple linear regression (MLR), instantaneous model (IM), linear model (LM), neural network (NN), and cumulative plots (CP). PMID:26829639

A Scalable Distributed Syntactic, Semantic, and Lexical Language Model

DTIC Science & Technology

2012-09-01

Here pa(τ) denotes the set of parent states of τ. If the recursive factorization refers to a graph , then we have a Bayesian network (Lauritzen 1996...Broadly speaking, however, the recursive factorization can refer to a representation more complicated than a graph with a fixed set of nodes and edges...factored language (FL) model (Bilmes and Kirchhoff 2003) is close to the smoothing technique we propose here, the major difference is that FL

A recursive algorithm for Zernike polynomials

NASA Technical Reports Server (NTRS)

Davenport, J. W.

1982-01-01

The analysis of a function defined on a rotationally symmetric system, with either a circular or annular pupil is discussed. In order to numerically analyze such systems it is typical to expand the given function in terms of a class of orthogonal polynomials. Because of their particular properties, the Zernike polynomials are especially suited for numerical calculations. Developed is a recursive algorithm that can be used to generate the Zernike polynomials up to a given order. The algorithm is recursively defined over J where R(J,N) is the Zernike polynomial of degree N obtained by orthogonalizing the sequence R(J), R(J+2), ..., R(J+2N) over (epsilon, 1). The terms in the preceding row - the (J-1) row - up to the N+1 term is needed for generating the (J,N)th term. Thus, the algorith generates an upper left-triangular table. This algorithm was placed in the computer with the necessary support program also included.

A recursive vesicle-based model protocell with a primitive model cell cycle

NASA Astrophysics Data System (ADS)

Kurihara, Kensuke; Okura, Yusaku; Matsuo, Muneyuki; Toyota, Taro; Suzuki, Kentaro; Sugawara, Tadashi

2015-09-01

Self-organized lipid structures (protocells) have been proposed as an intermediate between nonliving material and cellular life. Synthetic production of model protocells can demonstrate the potential processes by which living cells first arose. While we have previously described a giant vesicle (GV)-based model protocell in which amplification of DNA was linked to self-reproduction, the ability of a protocell to recursively self-proliferate for multiple generations has not been demonstrated. Here we show that newborn daughter GVs can be restored to the status of their parental GVs by pH-induced vesicular fusion of daughter GVs with conveyer GVs filled with depleted substrates. We describe a primitive model cell cycle comprising four discrete phases (ingestion, replication, maturity and division), each of which is selectively activated by a specific external stimulus. The production of recursive self-proliferating model protocells represents a step towards eventual production of model protocells that are able to mimic evolution.

The TAR effect: when the ones who dislike become the ones who are disliked.

PubMed

Gawronski, Bertram; Walther, Eva

2008-09-01

Four studies tested whether a source's evaluations of other individuals can recursively transfer to the source, such that people who like others acquire a positive valence, whereas people who dislike others acquire a negative valence (Transfer of Attitudes Recursively; TAR). Experiment 1 provides first evidence for TAR effects, showing recursive transfers of evaluations regardless of whether participants did or did not have prior knowledge about the (dis)liking source. Experiment 2 shows that previously but not subsequently acquired knowledge about targets that were (dis)liked by a source overrode TAR effects in a manner consistent with cognitive balance. Finally, Experiments 3 and 4 demonstrate that TAR effects are mediated by higher order propositional inferences (in contrast to lower order associative processes), in that TAR effects on implicit attitude measures were fully mediated by TAR effects on explicit attitude measures. Commonalities and differences between the TAR effect and previously established phenomena are discussed.

Development of a recursion RNG-based turbulence model

NASA Technical Reports Server (NTRS)

Zhou, YE; Vahala, George; Thangam, S.

1993-01-01

Reynolds stress closure models based on the recursion renormalization group theory are developed for the prediction of turbulent separated flows. The proposed model uses a finite wavenumber truncation scheme to account for the spectral distribution of energy. In particular, the model incorporates effects of both local and nonlocal interactions. The nonlocal interactions are shown to yield a contribution identical to that from the epsilon-renormalization group (RNG), while the local interactions introduce higher order dispersive effects. A formal analysis of the model is presented and its ability to accurately predict separated flows is analyzed from a combined theoretical and computational stand point. Turbulent flow past a backward facing step is chosen as a test case and the results obtained based on detailed computations demonstrate that the proposed recursion -RNG model with finite cut-off wavenumber can yield very good predictions for the backstep problem.

Multiple concurrent recursive least squares identification with application to on-line spacecraft mass-property identification

NASA Technical Reports Server (NTRS)

Wilson, Edward (Inventor)

2006-01-01

The present invention is a method for identifying unknown parameters in a system having a set of governing equations describing its behavior that cannot be put into regression form with the unknown parameters linearly represented. In this method, the vector of unknown parameters is segmented into a plurality of groups where each individual group of unknown parameters may be isolated linearly by manipulation of said equations. Multiple concurrent and independent recursive least squares identification of each said group run, treating other unknown parameters appearing in their regression equation as if they were known perfectly, with said values provided by recursive least squares estimation from the other groups, thereby enabling the use of fast, compact, efficient linear algorithms to solve problems that would otherwise require nonlinear solution approaches. This invention is presented with application to identification of mass and thruster properties for a thruster-controlled spacecraft.

EEG and MEG source localization using recursively applied (RAP) MUSIC

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

Mosher, J.C.; Leahy, R.M.

1996-12-31

The multiple signal characterization (MUSIC) algorithm locates multiple asynchronous dipolar sources from electroencephalography (EEG) and magnetoencephalography (MEG) data. A signal subspace is estimated from the data, then the algorithm scans a single dipole model through a three-dimensional head volume and computes projections onto this subspace. To locate the sources, the user must search the head volume for local peaks in the projection metric. Here we describe a novel extension of this approach which we refer to as RAP (Recursively APplied) MUSIC. This new procedure automatically extracts the locations of the sources through a recursive use of subspace projections, which usesmore » the metric of principal correlations as a multidimensional form of correlation analysis between the model subspace and the data subspace. The dipolar orientations, a form of `diverse polarization,` are easily extracted using the associated principal vectors.« less

Spatial event cluster detection using an approximate normal distribution.

PubMed

Torabi, Mahmoud; Rosychuk, Rhonda J

2008-12-12

In geographic surveillance of disease, areas with large numbers of disease cases are to be identified so that investigations of the causes of high disease rates can be pursued. Areas with high rates are called disease clusters and statistical cluster detection tests are used to identify geographic areas with higher disease rates than expected by chance alone. Typically cluster detection tests are applied to incident or prevalent cases of disease, but surveillance of disease-related events, where an individual may have multiple events, may also be of interest. Previously, a compound Poisson approach that detects clusters of events by testing individual areas that may be combined with their neighbours has been proposed. However, the relevant probabilities from the compound Poisson distribution are obtained from a recursion relation that can be cumbersome if the number of events are large or analyses by strata are performed. We propose a simpler approach that uses an approximate normal distribution. This method is very easy to implement and is applicable to situations where the population sizes are large and the population distribution by important strata may differ by area. We demonstrate the approach on pediatric self-inflicted injury presentations to emergency departments and compare the results for probabilities based on the recursion and the normal approach. We also implement a Monte Carlo simulation to study the performance of the proposed approach. In a self-inflicted injury data example, the normal approach identifies twelve out of thirteen of the same clusters as the compound Poisson approach, noting that the compound Poisson method detects twelve significant clusters in total. Through simulation studies, the normal approach well approximates the compound Poisson approach for a variety of different population sizes and case and event thresholds. A drawback of the compound Poisson approach is that the relevant probabilities must be determined through a recursion relation and such calculations can be computationally intensive if the cluster size is relatively large or if analyses are conducted with strata variables. On the other hand, the normal approach is very flexible, easily implemented, and hence, more appealing for users. Moreover, the concepts may be more easily conveyed to non-statisticians interested in understanding the methodology associated with cluster detection test results.

Inferring relationships between clinical mastitis, productivity and fertility: a recursive model application including genetics, farm associated herd management, and cow-specific antibiotic treatments.

PubMed

Rehbein, Pia; Brügemann, Kerstin; Yin, Tong; V Borstel, U König; Wu, Xiao-Lin; König, Sven

2013-10-01

A dataset of test-day records, fertility traits, and one health trait including 1275 Brown Swiss cows kept in 46 small-scale organic farms was used to infer relationships among these traits based on recursive Gaussian-threshold models. Test-day records included milk yield (MY), protein percentage (PROT-%), fat percentage (FAT-%), somatic cell score (SCS), the ratio of FAT-% to PROT-% (FPR), lactose percentage (LAC-%), and milk urea nitrogen (MUN). Female fertility traits were defined as the interval from calving to first insemination (CTFS) and success of a first insemination (SFI), and the health trait was clinical mastitis (CM). First, a tri-trait model was used which postulated the recursive effect of a test-day observation in the early period of lactation on liability to CM (LCM), and further the recursive effect of LCM on the following test-day observation. For CM and female fertility traits, a bi-trait recursive Gaussian-threshold model was employed to estimate the effects from CM to CTFS and from CM on SFI. The recursive effects from CTFS and SFI onto CM were not relevant, because CM was recorded prior to the measurements for CTFS and SFI. Results show that the posterior heritability for LCM was 0.05, and for all other traits, heritability estimates were in reasonable ranges, each with a small posterior SD. Lowest heritability estimates were obtained for female reproduction traits, i.e. h(2)=0.02 for SFI, and h(2)≈0 for CTFS. Posterior estimates of genetic correlations between LCM and production traits (MY and MUN), and between LCM and somatic cell score (SCS), were large and positive (0.56-0.68). Results confirm the genetic antagonism between MY and LCM, and the suitability of SCS as an indicator trait for CM. Structural equation coefficients describe the impact of one trait on a second trait on the phenotypic pathway. Higher values for FAT-% and FPR were associated with a higher LCM. The rate of change in FAT-% and in FPR in the ongoing lactation with respect to the previous LCM was close to zero. Estimated recursive effects between SCS and CM were positive, implying strong phenotypic impacts between both traits. Structural equation coefficients explained a detrimental impact of CM on female fertility traits CTFS and SFI. The cow-specific CM treatment had no significant impact on performance traits in the ongoing lactation. For most treatments, beta-lactam-antibiotics were used, but test-day SCS and production traits after the beta-lactam-treatment were comparable to those after other antibiotic as well as homeopathic treatments. Copyright © 2013 Elsevier B.V. All rights reserved.

Bacteria as computers making computers

PubMed Central

Danchin, Antoine

2009-01-01

Various efforts to integrate biological knowledge into networks of interactions have produced a lively microbial systems biology. Putting molecular biology and computer sciences in perspective, we review another trend in systems biology, in which recursivity and information replace the usual concepts of differential equations, feedback and feedforward loops and the like. Noting that the processes of gene expression separate the genome from the cell machinery, we analyse the role of the separation between machine and program in computers. However, computers do not make computers. For cells to make cells requires a specific organization of the genetic program, which we investigate using available knowledge. Microbial genomes are organized into a paleome (the name emphasizes the role of the corresponding functions from the time of the origin of life), comprising a constructor and a replicator, and a cenome (emphasizing community-relevant genes), made up of genes that permit life in a particular context. The cell duplication process supposes rejuvenation of the machine and replication of the program. The paleome also possesses genes that enable information to accumulate in a ratchet-like process down the generations. The systems biology must include the dynamics of information creation in its future developments. PMID:19016882

Reinforcement learning controller design for affine nonlinear discrete-time systems using online approximators.

PubMed

Yang, Qinmin; Jagannathan, Sarangapani

2012-04-01

In this paper, reinforcement learning state- and output-feedback-based adaptive critic controller designs are proposed by using the online approximators (OLAs) for a general multi-input and multioutput affine unknown nonlinear discretetime systems in the presence of bounded disturbances. The proposed controller design has two entities, an action network that is designed to produce optimal signal and a critic network that evaluates the performance of the action network. The critic estimates the cost-to-go function which is tuned online using recursive equations derived from heuristic dynamic programming. Here, neural networks (NNs) are used both for the action and critic whereas any OLAs, such as radial basis functions, splines, fuzzy logic, etc., can be utilized. For the output-feedback counterpart, an additional NN is designated as the observer to estimate the unavailable system states, and thus, separation principle is not required. The NN weight tuning laws for the controller schemes are also derived while ensuring uniform ultimate boundedness of the closed-loop system using Lyapunov theory. Finally, the effectiveness of the two controllers is tested in simulation on a pendulum balancing system and a two-link robotic arm system.

A nonlinear Kalman filtering approach to embedded control of turbocharged diesel engines

NASA Astrophysics Data System (ADS)

Rigatos, Gerasimos; Siano, Pierluigi; Arsie, Ivan

2014-10-01

The development of efficient embedded control for turbocharged Diesel engines, requires the programming of elaborated nonlinear control and filtering methods. To this end, in this paper nonlinear control for turbocharged Diesel engines is developed with the use of Differential flatness theory and the Derivative-free nonlinear Kalman Filter. It is shown that the dynamic model of the turbocharged Diesel engine is differentially flat and admits dynamic feedback linearization. It is also shown that the dynamic model can be written in the linear Brunovsky canonical form for which a state feedback controller can be easily designed. To compensate for modeling errors and external disturbances the Derivative-free nonlinear Kalman Filter is used and redesigned as a disturbance observer. The filter consists of the Kalman Filter recursion on the linearized equivalent of the Diesel engine model and of an inverse transformation based on differential flatness theory which enables to obtain estimates for the state variables of the initial nonlinear model. Once the disturbances variables are identified it is possible to compensate them by including an additional control term in the feedback loop. The efficiency of the proposed control method is tested through simulation experiments.

An optimized routing algorithm for the automated assembly of standard multimode ribbon fibers in a full-mesh optical backplane

NASA Astrophysics Data System (ADS)

Basile, Vito; Guadagno, Gianluca; Ferrario, Maddalena; Fassi, Irene

2018-03-01

In this paper a parametric, modular and scalable algorithm allowing a fully automated assembly of a backplane fiber-optic interconnection circuit is presented. This approach guarantees the optimization of the optical fiber routing inside the backplane with respect to specific criteria (i.e. bending power losses), addressing both transmission performance and overall costs issues. Graph theory has been exploited to simplify the complexity of the NxN full-mesh backplane interconnection topology, firstly, into N independent sub-circuits and then, recursively, into a limited number of loops easier to be generated. Afterwards, the proposed algorithm selects a set of geometrical and architectural parameters whose optimization allows to identify the optimal fiber optic routing for each sub-circuit of the backplane. The topological and numerical information provided by the algorithm are then exploited to control a robot which performs the automated assembly of the backplane sub-circuits. The proposed routing algorithm can be extended to any array architecture and number of connections thanks to its modularity and scalability. Finally, the algorithm has been exploited for the automated assembly of an 8x8 optical backplane realized with standard multimode (MM) 12-fiber ribbons.

Decentralized Adaptive Neural Output-Feedback DSC for Switched Large-Scale Nonlinear Systems.

PubMed

Lijun Long; Jun Zhao

2017-04-01

In this paper, for a class of switched large-scale uncertain nonlinear systems with unknown control coefficients and unmeasurable states, a switched-dynamic-surface-based decentralized adaptive neural output-feedback control approach is developed. The approach proposed extends the classical dynamic surface control (DSC) technique for nonswitched version to switched version by designing switched first-order filters, which overcomes the problem of multiple "explosion of complexity." Also, a dual common coordinates transformation of all subsystems is exploited to avoid individual coordinate transformations for subsystems that are required when applying the backstepping recursive design scheme. Nussbaum-type functions are utilized to handle the unknown control coefficients, and a switched neural network observer is constructed to estimate the unmeasurable states. Combining with the average dwell time method and backstepping and the DSC technique, decentralized adaptive neural controllers of subsystems are explicitly designed. It is proved that the approach provided can guarantee the semiglobal uniformly ultimately boundedness for all the signals in the closed-loop system under a class of switching signals with average dwell time, and the tracking errors to a small neighborhood of the origin. A two inverted pendulums system is provided to demonstrate the effectiveness of the method proposed.

Bacteria as computers making computers.

PubMed

Danchin, Antoine

2009-01-01

Various efforts to integrate biological knowledge into networks of interactions have produced a lively microbial systems biology. Putting molecular biology and computer sciences in perspective, we review another trend in systems biology, in which recursivity and information replace the usual concepts of differential equations, feedback and feedforward loops and the like. Noting that the processes of gene expression separate the genome from the cell machinery, we analyse the role of the separation between machine and program in computers. However, computers do not make computers. For cells to make cells requires a specific organization of the genetic program, which we investigate using available knowledge. Microbial genomes are organized into a paleome (the name emphasizes the role of the corresponding functions from the time of the origin of life), comprising a constructor and a replicator, and a cenome (emphasizing community-relevant genes), made up of genes that permit life in a particular context. The cell duplication process supposes rejuvenation of the machine and replication of the program. The paleome also possesses genes that enable information to accumulate in a ratchet-like process down the generations. The systems biology must include the dynamics of information creation in its future developments.

Experimental verification of a GPC-LPV method with RLS and P1-TS fuzzy-based estimation for limiting the transient and residual vibration of a crane system

NASA Astrophysics Data System (ADS)

Smoczek, Jaroslaw

2015-10-01

The paper deals with the problem of reducing the residual vibration and limiting the transient oscillations of a flexible and underactuated system with respect to the variation of operating conditions. The comparative study of generalized predictive control (GPC) and fuzzy scheduling scheme developed based on the P1-TS fuzzy theory, local pole placement method and interval analysis of closed-loop system polynomial coefficients is addressed to the problem of flexible crane control. The two alternatives of a GPC-based method are proposed that enable to realize this technique either with or without a sensor of payload deflection. The first control technique is based on the recursive least squares (RLS) method applied to on-line estimate the parameters of a linear parameter varying (LPV) model of a crane dynamic system. The second GPC-based approach is based on a payload deflection feedback estimated using a pendulum model with the parameters interpolated using the P1-TS fuzzy system. Feasibility and applicability of the developed methods were confirmed through experimental verification performed on a laboratory scaled overhead crane.

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

PubMed Central

Weare, Jonathan; Dinner, Aaron R.; Roux, Benoît

2016-01-01

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

Meromorphic solutions of recurrence relations and DRA method for multicomponent master integrals

NASA Astrophysics Data System (ADS)

Lee, Roman N.; Mingulov, Kirill T.

2018-04-01

We formulate a method to find the meromorphic solutions of higher-order recurrence relations in the form of the sum over poles with coefficients defined recursively. Several explicit examples of the application of this technique are given. The main advantage of the described approach is that the analytical properties of the solutions are very clear (the position of poles is explicit, the behavior at infinity can be easily determined). These are exactly the properties that are required for the application of the multiloop calculation method based on dimensional recurrence relations and analyticity (the DRA method).

Structure-function analyses of human kallikrein-related peptidase 2 establish the 99-loop as master regulator of activity.

PubMed

Skala, Wolfgang; Utzschneider, Daniel T; Magdolen, Viktor; Debela, Mekdes; Guo, Shihui; Craik, Charles S; Brandstetter, Hans; Goettig, Peter

2014-12-05

Human kallikrein-related peptidase 2 (KLK2) is a tryptic serine protease predominantly expressed in prostatic tissue and secreted into prostatic fluid, a major component of seminal fluid. Most likely it activates and complements chymotryptic KLK3 (prostate-specific antigen) in cleaving seminal clotting proteins, resulting in sperm liquefaction. KLK2 belongs to the "classical" KLKs 1-3, which share an extended 99- or kallikrein loop near their non-primed substrate binding site. Here, we report the 1.9 Å crystal structures of two KLK2-small molecule inhibitor complexes. In both structures discontinuous electron density for the 99-loop indicates that this loop is largely disordered. We provide evidence that the 99-loop is responsible for two biochemical peculiarities of KLK2, i.e. reversible inhibition by micromolar Zn(2+) concentrations and permanent inactivation by autocatalytic cleavage. Indeed, several 99-loop mutants of KLK2 displayed an altered susceptibility to Zn(2+), which located the Zn(2+) binding site at the 99-loop/active site interface. In addition, we identified an autolysis site between residues 95e and 95f in the 99-loop, whose elimination prevented the mature enzyme from limited autolysis and irreversible inactivation. An exhaustive comparison of KLK2 with related structures revealed that in the KLK family the 99-, 148-, and 220-loop exist in open and closed conformations, allowing or preventing substrate access, which extends the concept of conformational selection in trypsin-related proteases. Taken together, our novel biochemical and structural data on KLK2 identify its 99-loop as a key player in activity regulation. © 2014 by The American Society for Biochemistry and Molecular Biology, Inc.

Structure-Function Analyses of Human Kallikrein-related Peptidase 2 Establish the 99-Loop as Master Regulator of Activity*

PubMed Central

Skala, Wolfgang; Utzschneider, Daniel T.; Magdolen, Viktor; Debela, Mekdes; Guo, Shihui; Craik, Charles S.; Brandstetter, Hans; Goettig, Peter

2014-01-01

Human kallikrein-related peptidase 2 (KLK2) is a tryptic serine protease predominantly expressed in prostatic tissue and secreted into prostatic fluid, a major component of seminal fluid. Most likely it activates and complements chymotryptic KLK3 (prostate-specific antigen) in cleaving seminal clotting proteins, resulting in sperm liquefaction. KLK2 belongs to the “classical” KLKs 1–3, which share an extended 99- or kallikrein loop near their non-primed substrate binding site. Here, we report the 1.9 Å crystal structures of two KLK2-small molecule inhibitor complexes. In both structures discontinuous electron density for the 99-loop indicates that this loop is largely disordered. We provide evidence that the 99-loop is responsible for two biochemical peculiarities of KLK2, i.e. reversible inhibition by micromolar Zn2+ concentrations and permanent inactivation by autocatalytic cleavage. Indeed, several 99-loop mutants of KLK2 displayed an altered susceptibility to Zn2+, which located the Zn2+ binding site at the 99-loop/active site interface. In addition, we identified an autolysis site between residues 95e and 95f in the 99-loop, whose elimination prevented the mature enzyme from limited autolysis and irreversible inactivation. An exhaustive comparison of KLK2 with related structures revealed that in the KLK family the 99-, 148-, and 220-loop exist in open and closed conformations, allowing or preventing substrate access, which extends the concept of conformational selection in trypsin-related proteases. Taken together, our novel biochemical and structural data on KLK2 identify its 99-loop as a key player in activity regulation. PMID:25326387

An innovations approach to decoupling of multibody dynamics and control

NASA Technical Reports Server (NTRS)

Rodriguez, G.

1989-01-01

The problem of hinged multibody dynamics is solved using an extension of the innovations approach of linear filtering and prediction theory to the problem of mechanical system modeling and control. This approach has been used quite effectively to diagonalize the equations for filtering and prediction for linear state space systems. It has similar advantages in the study of dynamics and control of multibody systems. The innovations approach advanced here consists of expressing the equations of motion in terms of two closely related processes: (1) the innovations process e, a sequence of moments, obtained from the applied moments T by means of a spatially recursive Kalman filter that goes from the tip of the manipulator to its base; (2) a residual process, a sequence of velocities, obtained from the joint-angle velocities by means of an outward smoothing operations. The innovations e and the applied moments T are related by means of the relationships e = (I - L)T and T = (I + K)e. The operation (I - L) is a causal lower triangular matrix which is generated by a spatially recursive Kalman filter and the corresponding discrete-step Riccati equation. Hence, the innovations and the applied moments can be obtained from each other by means of a causal operation which is itself casually invertible.

Strong Generative Capacity and the Empirical Base of Linguistic Theory

PubMed Central

Ott, Dennis

2017-01-01

This Perspective traces the evolution of certain central notions in the theory of Generative Grammar (GG). The founding documents of the field suggested a relation between the grammar, construed as recursively enumerating an infinite set of sentences, and the idealized native speaker that was essentially equivalent to the relation between a formal language (a set of well-formed formulas) and an automaton that recognizes strings as belonging to the language or not. But this early view was later abandoned, when the focus of the field shifted to the grammar's strong generative capacity as recursive generation of hierarchically structured objects as opposed to strings. The grammar is now no longer seen as specifying a set of well-formed expressions and in fact necessarily constructs expressions of any degree of intuitive “acceptability.” The field of GG, however, has not sufficiently acknowledged the significance of this shift in perspective, as evidenced by the fact that (informal and experimentally-controlled) observations about string acceptability continue to be treated as bona fide data and generalizations for the theory of GG. The focus on strong generative capacity, it is argued, requires a new discussion of what constitutes valid empirical evidence for GG beyond observations pertaining to weak generation. PMID:28983268

Triple loop heat exchanger for an absorption refrigeration system

DOEpatents

Reimann, Robert C.

1984-01-01

A triple loop heat exchanger for an absorption refrigeration system is disclosed. The triple loop heat exchanger comprises portions of a strong solution line for conducting relatively hot, strong solution from a generator to a solution heat exchanger of the absorption refrigeration system, conduit means for conducting relatively cool, weak solution from the solution heat exchanger to the generator, and a bypass system for conducting strong solution from the generator around the strong solution line and around the solution heat exchanger to an absorber of the refrigeration system when strong solution builds up in the generator to an undesirable level. The strong solution line and the conduit means are in heat exchange relationship with each other in the triple loop heat exchanger so that, during normal operation of the refrigeration system, heat is exchanged between the relatively hot, strong solution flowing through the strong solution line and the relatively cool, weak solution flowing through the conduit means. Also, the strong solution line and the bypass system are in heat exchange relationship in the triple loop heat exchanger so that if the normal flow path of relatively hot, strong solution flowing from the generator to an absorber is blocked, then this relatively, hot strong solution which will then be flowing through the bypass system in the triple loop heat exchanger, is brought into heat exchange relationship with any strong solution which may have solidified in the strong solution line in the triple loop heat exchanger to thereby aid in desolidifying any such solidified strong solution.

A linear quadratic Gaussian with loop transfer recovery proximity operations autopilot for spacecraft. M.S. Thesis - MIT

NASA Technical Reports Server (NTRS)

Chen, George T.

1987-01-01

An automatic control scheme for spacecraft proximity operations is presented. The controller is capable of holding the vehicle at a prescribed location relative to a target, or maneuvering it to a different relative position using straight line-of-sight translations. The autopilot uses a feedforward loop to initiate and terminate maneuvers, and for operations at nonequilibrium set-points. A multivariate feedback loop facilitates precise position and velocity control in the presence of sensor noise. The feedback loop is formulated using the Linear Quadratic Gaussian (LQG) with Loop Transfer Recovery (LTR) design procedure. Linear models of spacecraft dynamics, adapted from Clohessey-Wiltshire Equations, are augmented and loop shaping techniques are applied to design a target feedback loop. The loop transfer recovery procedure is used to recover the frequency domain properties of the target feedback loop. The resulting compensator is integrated into an autopilot which is tested in a high fidelity Space Shuttle Simulator. The autopilot performance is evaluated for a variety of proximity operations tasks envisioned for future Shuttle flights.

Moderate deviations-based importance sampling for stochastic recursive equations

DOE PAGES

Dupuis, Paul; Johnson, Dane

2017-11-17

Abstract Subsolutions to the Hamilton–Jacobi–Bellman equation associated with a moderate deviations approximation are used to design importance sampling changes of measure for stochastic recursive equations. Analogous to what has been done for large deviations subsolution-based importance sampling, these schemes are shown to be asymptotically optimal under the moderate deviations scaling. We present various implementations and numerical results to contrast their performance, and also discuss the circumstances under which a moderate deviation scaling might be appropriate.

Moderate deviations-based importance sampling for stochastic recursive equations

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

Dupuis, Paul; Johnson, Dane

Abstract Subsolutions to the Hamilton–Jacobi–Bellman equation associated with a moderate deviations approximation are used to design importance sampling changes of measure for stochastic recursive equations. Analogous to what has been done for large deviations subsolution-based importance sampling, these schemes are shown to be asymptotically optimal under the moderate deviations scaling. We present various implementations and numerical results to contrast their performance, and also discuss the circumstances under which a moderate deviation scaling might be appropriate.

Observability under recurrent loss of data

NASA Technical Reports Server (NTRS)

Luck, Rogelio; Ray, Asok; Halevi, Yoram

1992-01-01

An account is given of the concept of extended observability in finite-dimensional linear time-invariant systems under recurrent loss of data, where the state vector has to be reconstructed from an ensemble of sensor data at nonconsecutive samples. An at once necessary and sufficient condition for extended observability that can be expressed via a recursive relation is presented, together with such conditions for this as may be related to the characteristic polynomial of the state transition matrix in a discrete-time setting, or of the system matrix in a continuous-time setting.

Recursive regularization step for high-order lattice Boltzmann methods

NASA Astrophysics Data System (ADS)

Coreixas, Christophe; Wissocq, Gauthier; Puigt, Guillaume; Boussuge, Jean-François; Sagaut, Pierre

2017-09-01

A lattice Boltzmann method (LBM) with enhanced stability and accuracy is presented for various Hermite tensor-based lattice structures. The collision operator relies on a regularization step, which is here improved through a recursive computation of nonequilibrium Hermite polynomial coefficients. In addition to the reduced computational cost of this procedure with respect to the standard one, the recursive step allows to considerably enhance the stability and accuracy of the numerical scheme by properly filtering out second- (and higher-) order nonhydrodynamic contributions in under-resolved conditions. This is first shown in the isothermal case where the simulation of the doubly periodic shear layer is performed with a Reynolds number ranging from 104 to 106, and where a thorough analysis of the case at Re=3 ×104 is conducted. In the latter, results obtained using both regularization steps are compared against the Bhatnagar-Gross-Krook LBM for standard (D2Q9) and high-order (D2V17 and D2V37) lattice structures, confirming the tremendous increase of stability range of the proposed approach. Further comparisons on thermal and fully compressible flows, using the general extension of this procedure, are then conducted through the numerical simulation of Sod shock tubes with the D2V37 lattice. They confirm the stability increase induced by the recursive approach as compared with the standard one.

Co-Adapting Water Demand and Supply to Changing Climate in Agricultural Water Systems, A Case Study in Northern Italy

NASA Astrophysics Data System (ADS)

Giuliani, M.; Li, Y.; Mainardi, M.; Arias Munoz, C.; Castelletti, A.; Gandolfi, C.

2013-12-01

Exponentially growing water demands and increasing uncertainties in the hydrologic cycle due to changes in climate and land use will challenge water resources planning and management in the next decade. Improving agricultural productivity is particularly critical, being this sector the one characterized by the highest water demand. Moreover, to meet projected growth in human population and per-capita food demand, agricultural production will have to significantly increase in the next decades, even though water availability is expected to decrease due to climate change impacts. Agricultural systems are called to adapt their strategies (e.g., changing crop patterns and the corresponding water demand, or maximizing the efficiency in the water supply modifying irrigation scheduling and adopting high efficiency irrigation techniques) in order to re-optimize the use of limited water resources. Although many studies have assessed climate change impacts on agricultural practices and water management, most of them assume few scenarios of water demand or water supply separately, while an analysis of their reciprocal feedbacks is still missing. Moreover, current practices are generally established according to historical agreements and normative constraints and, in the absence of dramatic failures, the shift toward more efficient water management is not easily achievable. In this work, we propose to activate an information loop between farmers and water managers to improve the effectiveness of agricultural water management practices by matching the needs of the farmers with the design of water supply strategies. The proposed approach is tested on a real-world case study, namely the Lake Como serving the Muzza-Bassa Lodigiana irrigation district (Italy). A distributed-parameter, dynamic model of the system allows to simulate crop growth and the final yield over a range of hydro-climatic conditions, irrigation strategies and water-related stresses. The spatial component of the model is managed by a Web GIS to support the visualization of the results and the participation of the stakeholders. The activation of the information loop allows farmers to decide the most profitable crop option on the basis of an expected water supply. Knowing the farmers decisions, the water supply strategy (i.e., the regulation of Lake Como) is then optimized with respect to the actual irrigation demand of the crops. By recursively running this procedure, the farmers and the water manager will exchange information until the system converges to an equilibrium. Our results show that the proposed co-adaptation loop is able to enhance the efficiency of agricultural water management practices and foster crop production. Moreover, the analysis of the co-evolution of the two systems under change allows to estimate the potential for the approach to mitigate climate change adverse impacts.

A stabilized Runge–Kutta–Legendre method for explicit super-time-stepping of parabolic and mixed equations

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

Meyer, Chad D.; Balsara, Dinshaw S.; Aslam, Tariq D.

2014-01-15

Parabolic partial differential equations appear in several physical problems, including problems that have a dominant hyperbolic part coupled to a sub-dominant parabolic component. Explicit methods for their solution are easy to implement but have very restrictive time step constraints. Implicit solution methods can be unconditionally stable but have the disadvantage of being computationally costly or difficult to implement. Super-time-stepping methods for treating parabolic terms in mixed type partial differential equations occupy an intermediate position. In such methods each superstep takes “s” explicit Runge–Kutta-like time-steps to advance the parabolic terms by a time-step that is s{sup 2} times larger than amore » single explicit time-step. The expanded stability is usually obtained by mapping the short recursion relation of the explicit Runge–Kutta scheme to the recursion relation of some well-known, stable polynomial. Prior work has built temporally first- and second-order accurate super-time-stepping methods around the recursion relation associated with Chebyshev polynomials. Since their stability is based on the boundedness of the Chebyshev polynomials, these methods have been called RKC1 and RKC2. In this work we build temporally first- and second-order accurate super-time-stepping methods around the recursion relation associated with Legendre polynomials. We call these methods RKL1 and RKL2. The RKL1 method is first-order accurate in time; the RKL2 method is second-order accurate in time. We verify that the newly-designed RKL1 and RKL2 schemes have a very desirable monotonicity preserving property for one-dimensional problems – a solution that is monotone at the beginning of a time step retains that property at the end of that time step. It is shown that RKL1 and RKL2 methods are stable for all values of the diffusion coefficient up to the maximum value. We call this a convex monotonicity preserving property and show by examples that it is very useful in parabolic problems with variable diffusion coefficients. This includes variable coefficient parabolic equations that might give rise to skew symmetric terms. The RKC1 and RKC2 schemes do not share this convex monotonicity preserving property. One-dimensional and two-dimensional von Neumann stability analyses of RKC1, RKC2, RKL1 and RKL2 are also presented, showing that the latter two have some advantages. The paper includes several details to facilitate implementation. A detailed accuracy analysis is presented to show that the methods reach their design accuracies. A stringent set of test problems is also presented. To demonstrate the robustness and versatility of our methods, we show their successful operation on problems involving linear and non-linear heat conduction and viscosity, resistive magnetohydrodynamics, ambipolar diffusion dominated magnetohydrodynamics, level set methods and flux limited radiation diffusion. In a prior paper (Meyer, Balsara and Aslam 2012 [36]) we have also presented an extensive test-suite showing that the RKL2 method works robustly in the presence of shocks in an anisotropically conducting, magnetized plasma.« less

A stabilized Runge-Kutta-Legendre method for explicit super-time-stepping of parabolic and mixed equations

NASA Astrophysics Data System (ADS)

Meyer, Chad D.; Balsara, Dinshaw S.; Aslam, Tariq D.

2014-01-01

Parabolic partial differential equations appear in several physical problems, including problems that have a dominant hyperbolic part coupled to a sub-dominant parabolic component. Explicit methods for their solution are easy to implement but have very restrictive time step constraints. Implicit solution methods can be unconditionally stable but have the disadvantage of being computationally costly or difficult to implement. Super-time-stepping methods for treating parabolic terms in mixed type partial differential equations occupy an intermediate position. In such methods each superstep takes “s” explicit Runge-Kutta-like time-steps to advance the parabolic terms by a time-step that is s2 times larger than a single explicit time-step. The expanded stability is usually obtained by mapping the short recursion relation of the explicit Runge-Kutta scheme to the recursion relation of some well-known, stable polynomial. Prior work has built temporally first- and second-order accurate super-time-stepping methods around the recursion relation associated with Chebyshev polynomials. Since their stability is based on the boundedness of the Chebyshev polynomials, these methods have been called RKC1 and RKC2. In this work we build temporally first- and second-order accurate super-time-stepping methods around the recursion relation associated with Legendre polynomials. We call these methods RKL1 and RKL2. The RKL1 method is first-order accurate in time; the RKL2 method is second-order accurate in time. We verify that the newly-designed RKL1 and RKL2 schemes have a very desirable monotonicity preserving property for one-dimensional problems - a solution that is monotone at the beginning of a time step retains that property at the end of that time step. It is shown that RKL1 and RKL2 methods are stable for all values of the diffusion coefficient up to the maximum value. We call this a convex monotonicity preserving property and show by examples that it is very useful in parabolic problems with variable diffusion coefficients. This includes variable coefficient parabolic equations that might give rise to skew symmetric terms. The RKC1 and RKC2 schemes do not share this convex monotonicity preserving property. One-dimensional and two-dimensional von Neumann stability analyses of RKC1, RKC2, RKL1 and RKL2 are also presented, showing that the latter two have some advantages. The paper includes several details to facilitate implementation. A detailed accuracy analysis is presented to show that the methods reach their design accuracies. A stringent set of test problems is also presented. To demonstrate the robustness and versatility of our methods, we show their successful operation on problems involving linear and non-linear heat conduction and viscosity, resistive magnetohydrodynamics, ambipolar diffusion dominated magnetohydrodynamics, level set methods and flux limited radiation diffusion. In a prior paper (Meyer, Balsara and Aslam 2012 [36]) we have also presented an extensive test-suite showing that the RKL2 method works robustly in the presence of shocks in an anisotropically conducting, magnetized plasma.

DOP-2 D2-Like Receptor Regulates UNC-7 Innexins to Attenuate Recurrent Sensory Motor Neurons during C. elegans Copulation

PubMed Central

Correa, Paola A.; Gruninger, Todd

2015-01-01

Neuromodulation of self-amplifying circuits directs context-dependent behavioral executions. Although recurrent networks are found throughout the Caenorhabditis elegans connectome, few reports describe the mechanisms that regulate reciprocal neural activity during complex behavior. We used C. elegans male copulation to dissect how a goal-oriented motor behavior is regulated by recurrently wired sensory-motor neurons. As the male tail presses against the hermaphrodite's vulva, cholinergic and glutamatergic reciprocal innervations of post cloaca sensilla (PCS) neurons (PCA, PCB, and PCC), hook neurons (HOA, HOB), and their postsynaptic sex muscles execute rhythmic copulatory spicule thrusts. These repetitive spicule movements continue until the male shifts off the vulva or genital penetration is accomplished. However, the signaling mechanism that temporally and spatially restricts repetitive intromission attempts to vulva cues was unclear. Here, we report that confinement of spicule insertion attempts to the vulva is facilitated by D2-like receptor modulation of gap-junctions between PCB and the hook sensillum. We isolated a missense mutation in the UNC-7(L) gap-junction isoform, which perturbs DOP-2 signaling in the PCB neuron and its electrical partner, HOA. The glutamate-gated chloride channel AVR-14 is expressed in HOA. Our analysis of the unc-7 mutant allele indicates that when DOP-2 promotes UNC-7 electrical communication, AVR-14-mediated inhibitory signals pass from HOA to PCB. As a consequence, PCB is less receptive to be stimulated by its recurrent synaptic partner, PCA. Behavioral observations suggest that dopamine neuromodulation of UNC-7 ensures attenuation of recursive intromission attempts when the male disengages or is dislodged from the hermaphrodite genitalia. SIGNIFICANCE STATEMENT Using C. elegans male copulation as a model, we found that the neurotransmitter dopamine stimulates D2-like receptors in two sensory circuits to terminate futile behavioral loops. The D2-like receptors promote inhibitory electrical junction activity between a chemosensory and a mechanosensory circuit. Therefore, both systems are attenuated and the animal ceases the recursive behavior. PMID:26156999

Implications of Middle School Behavior Problems for High School Graduation and Employment Outcomes of Young Adults: Estimation of a Recursive Model

PubMed Central

Karakus, Mustafa C.; Salkever, David S.; Slade, Eric P.; Ialongo, Nicholas; Stuart, Elizabeth

2013-01-01

The potentially serious adverse impacts of behavior problems during adolescence on employment outcomes in adulthood provide a key economic rationale for early intervention programs. However, the extent to which lower educational attainment accounts for the total impact of adolescent behavior problems on later employment remains unclear As an initial step in exploring this issue, we specify and estimate a recursive bivariate probit model that 1) relates middle school behavior problems to high school graduation and 2) models later employment in young adulthood as a function of these behavior problems and of high school graduation. Our model thus allows for both a direct effect of behavior problems on later employment as well as an indirect effect that operates via graduation from high school. Our empirical results, based on analysis of data from the NELS, suggest that the direct effects of externalizing behavior problems on later employment are not significant but that these problems have important indirect effects operating through high school graduation. PMID:23576834

Fragment-based prediction of skin sensitization using recursive partitioning

NASA Astrophysics Data System (ADS)

Lu, Jing; Zheng, Mingyue; Wang, Yong; Shen, Qiancheng; Luo, Xiaomin; Jiang, Hualiang; Chen, Kaixian

2011-09-01

Skin sensitization is an important toxic endpoint in the risk assessment of chemicals. In this paper, structure-activity relationships analysis was performed on the skin sensitization potential of 357 compounds with local lymph node assay data. Structural fragments were extracted by GASTON (GrAph/Sequence/Tree extractiON) from the training set. Eight fragments with accuracy significantly higher than 0.73 ( p < 0.1) were retained to make up an indicator descriptor fragment. The fragment descriptor and eight other physicochemical descriptors closely related to the endpoint were calculated to construct the recursive partitioning tree (RP tree) for classification. The balanced accuracy of the training set, test set I, and test set II in the leave-one-out model were 0.846, 0.800, and 0.809, respectively. The results highlight that fragment-based RP tree is a preferable method for identifying skin sensitizers. Moreover, the selected fragments provide useful structural information for exploring sensitization mechanisms, and RP tree creates a graphic tree to identify the most important properties associated with skin sensitization. They can provide some guidance for designing of drugs with lower sensitization level.

Recursive processes in self-affirmation: intervening to close the minority achievement gap.

PubMed

Cohen, Geoffrey L; Garcia, Julio; Purdie-Vaughns, Valerie; Apfel, Nancy; Brzustoski, Patricia

2009-04-17

A 2-year follow-up of a randomized field experiment previously reported in Science is presented. A subtle intervention to lessen minority students' psychological threat related to being negatively stereotyped in school was tested in an experiment conducted three times with three independent cohorts (N = 133, 149, and 134). The intervention, a series of brief but structured writing assignments focusing students on a self-affirming value, reduced the racial achievement gap. Over 2 years, the grade point average (GPA) of African Americans was, on average, raised by 0.24 grade points. Low-achieving African Americans were particularly benefited. Their GPA improved, on average, 0.41 points, and their rate of remediation or grade repetition was less (5% versus 18%). Additionally, treated students' self-perceptions showed long-term benefits. Findings suggest that because initial psychological states and performance determine later outcomes by providing a baseline and initial trajectory for a recursive process, apparently small but early alterations in trajectory can have long-term effects. Implications for psychological theory and educational practice are discussed.

Hypoglycemia early alarm systems based on recursive autoregressive partial least squares models.

PubMed

Bayrak, Elif Seyma; Turksoy, Kamuran; Cinar, Ali; Quinn, Lauretta; Littlejohn, Elizabeth; Rollins, Derrick

2013-01-01

Hypoglycemia caused by intensive insulin therapy is a major challenge for artificial pancreas systems. Early detection and prevention of potential hypoglycemia are essential for the acceptance of fully automated artificial pancreas systems. Many of the proposed alarm systems are based on interpretation of recent values or trends in glucose values. In the present study, subject-specific linear models are introduced to capture glucose variations and predict future blood glucose concentrations. These models can be used in early alarm systems of potential hypoglycemia. A recursive autoregressive partial least squares (RARPLS) algorithm is used to model the continuous glucose monitoring sensor data and predict future glucose concentrations for use in hypoglycemia alarm systems. The partial least squares models constructed are updated recursively at each sampling step with a moving window. An early hypoglycemia alarm algorithm using these models is proposed and evaluated. Glucose prediction models based on real-time filtered data has a root mean squared error of 7.79 and a sum of squares of glucose prediction error of 7.35% for six-step-ahead (30 min) glucose predictions. The early alarm systems based on RARPLS shows good performance. A sensitivity of 86% and a false alarm rate of 0.42 false positive/day are obtained for the early alarm system based on six-step-ahead predicted glucose values with an average early detection time of 25.25 min. The RARPLS models developed provide satisfactory glucose prediction with relatively smaller error than other proposed algorithms and are good candidates to forecast and warn about potential hypoglycemia unless preventive action is taken far in advance. © 2012 Diabetes Technology Society.

Hypoglycemia Early Alarm Systems Based on Recursive Autoregressive Partial Least Squares Models

PubMed Central

Bayrak, Elif Seyma; Turksoy, Kamuran; Cinar, Ali; Quinn, Lauretta; Littlejohn, Elizabeth; Rollins, Derrick

2013-01-01

Background Hypoglycemia caused by intensive insulin therapy is a major challenge for artificial pancreas systems. Early detection and prevention of potential hypoglycemia are essential for the acceptance of fully automated artificial pancreas systems. Many of the proposed alarm systems are based on interpretation of recent values or trends in glucose values. In the present study, subject-specific linear models are introduced to capture glucose variations and predict future blood glucose concentrations. These models can be used in early alarm systems of potential hypoglycemia. Methods A recursive autoregressive partial least squares (RARPLS) algorithm is used to model the continuous glucose monitoring sensor data and predict future glucose concentrations for use in hypoglycemia alarm systems. The partial least squares models constructed are updated recursively at each sampling step with a moving window. An early hypoglycemia alarm algorithm using these models is proposed and evaluated. Results Glucose prediction models based on real-time filtered data has a root mean squared error of 7.79 and a sum of squares of glucose prediction error of 7.35% for six-step-ahead (30 min) glucose predictions. The early alarm systems based on RARPLS shows good performance. A sensitivity of 86% and a false alarm rate of 0.42 false positive/day are obtained for the early alarm system based on six-step-ahead predicted glucose values with an average early detection time of 25.25 min. Conclusions The RARPLS models developed provide satisfactory glucose prediction with relatively smaller error than other proposed algorithms and are good candidates to forecast and warn about potential hypoglycemia unless preventive action is taken far in advance. PMID:23439179

Learning to play Go using recursive neural networks.

PubMed

Wu, Lin; Baldi, Pierre

2008-11-01

Go is an ancient board game that poses unique opportunities and challenges for artificial intelligence. Currently, there are no computer Go programs that can play at the level of a good human player. However, the emergence of large repositories of games is opening the door for new machine learning approaches to address this challenge. Here we develop a machine learning approach to Go, and related board games, focusing primarily on the problem of learning a good evaluation function in a scalable way. Scalability is essential at multiple levels, from the library of local tactical patterns, to the integration of patterns across the board, to the size of the board itself. The system we propose is capable of automatically learning the propensity of local patterns from a library of games. Propensity and other local tactical information are fed into recursive neural networks, derived from a probabilistic Bayesian network architecture. The recursive neural networks in turn integrate local information across the board in all four cardinal directions and produce local outputs that represent local territory ownership probabilities. The aggregation of these probabilities provides an effective strategic evaluation function that is an estimate of the expected area at the end, or at various other stages, of the game. Local area targets for training can be derived from datasets of games played by human players. In this approach, while requiring a learning time proportional to N(4), skills learned on a board of size N(2) can easily be transferred to boards of other sizes. A system trained using only 9 x 9 amateur game data performs surprisingly well on a test set derived from 19 x 19 professional game data. Possible directions for further improvements are briefly discussed.

Model-based recursive partitioning to identify risk clusters for metabolic syndrome and its components: findings from the International Mobility in Aging Study

PubMed Central

Pirkle, Catherine M; Wu, Yan Yan; Zunzunegui, Maria-Victoria; Gómez, José Fernando

2018-01-01

Objective Conceptual models underpinning much epidemiological research on ageing acknowledge that environmental, social and biological systems interact to influence health outcomes. Recursive partitioning is a data-driven approach that allows for concurrent exploration of distinct mixtures, or clusters, of individuals that have a particular outcome. Our aim is to use recursive partitioning to examine risk clusters for metabolic syndrome (MetS) and its components, in order to identify vulnerable populations. Study design Cross-sectional analysis of baseline data from a prospective longitudinal cohort called the International Mobility in Aging Study (IMIAS). Setting IMIAS includes sites from three middle-income countries—Tirana (Albania), Natal (Brazil) and Manizales (Colombia)—and two from Canada—Kingston (Ontario) and Saint-Hyacinthe (Quebec). Participants Community-dwelling male and female adults, aged 64–75 years (n=2002). Primary and secondary outcome measures We apply recursive partitioning to investigate social and behavioural risk factors for MetS and its components. Model-based recursive partitioning (MOB) was used to cluster participants into age-adjusted risk groups based on variabilities in: study site, sex, education, living arrangements, childhood adversities, adult occupation, current employment status, income, perceived income sufficiency, smoking status and weekly minutes of physical activity. Results 43% of participants had MetS. Using MOB, the primary partitioning variable was participant sex. Among women from middle-incomes sites, the predicted proportion with MetS ranged from 58% to 68%. Canadian women with limited physical activity had elevated predicted proportions of MetS (49%, 95% CI 39% to 58%). Among men, MetS ranged from 26% to 41% depending on childhood social adversity and education. Clustering for MetS components differed from the syndrome and across components. Study site was a primary partitioning variable for all components except HDL cholesterol. Sex was important for most components. Conclusion MOB is a promising technique for identifying disease risk clusters (eg, vulnerable populations) in modestly sized samples. PMID:29500203

Use of genomic recursions and algorithm for proven and young animals for single-step genomic BLUP analyses--a simulation study.

PubMed

Fragomeni, B O; Lourenco, D A L; Tsuruta, S; Masuda, Y; Aguilar, I; Misztal, I

2015-10-01

The purpose of this study was to examine accuracy of genomic selection via single-step genomic BLUP (ssGBLUP) when the direct inverse of the genomic relationship matrix (G) is replaced by an approximation of G(-1) based on recursions for young genotyped animals conditioned on a subset of proven animals, termed algorithm for proven and young animals (APY). With the efficient implementation, this algorithm has a cubic cost with proven animals and linear with young animals. Ten duplicate data sets mimicking a dairy cattle population were simulated. In a first scenario, genomic information for 20k genotyped bulls, divided in 7k proven and 13k young bulls, was generated for each replicate. In a second scenario, 5k genotyped cows with phenotypes were included in the analysis as young animals. Accuracies (average for the 10 replicates) in regular EBV were 0.72 and 0.34 for proven and young animals, respectively. When genomic information was included, they increased to 0.75 and 0.50. No differences between genomic EBV (GEBV) obtained with the regular G(-1) and the approximated G(-1) via the recursive method were observed. In the second scenario, accuracies in GEBV (0.76, 0.51 and 0.59 for proven bulls, young males and young females, respectively) were also higher than those in EBV (0.72, 0.35 and 0.49). Again, no differences between GEBV with regular G(-1) and with recursions were observed. With the recursive algorithm, the number of iterations to achieve convergence was reduced from 227 to 206 in the first scenario and from 232 to 209 in the second scenario. Cows can be treated as young animals in APY without reducing the accuracy. The proposed algorithm can be implemented to reduce computing costs and to overcome current limitations on the number of genotyped animals in the ssGBLUP method. © 2015 Blackwell Verlag GmbH.

Lattice QCD analysis for relation between quark confinement and chiral symmetry breaking

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

Doi, Takahiro M.; Suganuma, Hideo; Iritani, Takumi

2016-01-22

The Polyakov loop and the Dirac modes are connected via a simple analytical relation on the temporally odd-number lattice, where the temporal lattice size is odd with the normal (nontwisted) periodic boundary condition. Using this relation, we investigate the relation between quark confinement and chiral symmetry breaking in QCD. In this paper, we discuss the properties of this analytical relation and numerically investigate each Dirac-mode contribution to the Polyakov loop in both confinement and deconfinement phases at the quenched level. This relation indicates that low-lying Dirac modes have little contribution to the Polyakov loop, and we numerically confirmed this fact.more » From our analysis, it is suggested that there is no direct one-to-one corresponding between quark confinement and chiral symmetry breaking in QCD. Also, in the confinement phase, we numerically find that there is a new “positive/negative symmetry” in the Dirac-mode matrix elements of link-variable operator which appear in the relation and the Polyakov loop becomes zero because of this symmetry. In the deconfinement phase, this symmetry is broken and the Polyakov loop is non-zero.« less

The phase diagrams of the ± K model on the Bethe lattice

NASA Astrophysics Data System (ADS)

Albayrak, Erhan

2015-07-01

The biquadratic exchange interaction is randomized in a bimodal form with probabilities (p) and (1 - p) for the cases with K > 0 (attractive case) and K < 0 (repulsive case), respectively, and its effects on the phase diagrams of the spin-1 Blume-Emery-Griffiths model are studied on the Bethe lattice by using the recursion relations. It was found that the critical behaviors of the model change drastically.

Two AFC Loops For Low CNR And High Dynamics

NASA Technical Reports Server (NTRS)

Hinedi, Sami M.; Aguirre, Sergio

1992-01-01

Two alternative digital automatic-frequency-control (AFC) loops proposed to acquire (or reacquire) and track frequency of received carrier radio signal. Intended for use where carrier-to-noise ratios (CNR's) low and carrier frequency characterized by high Doppler shift and Doppler rate because of high relative speed and acceleration, respectively, between transmitter and receiver. Either AFC loops used in place of phase-locked loop. New loop concepts integrate ideas from classical spectrum-estimation, digital-phase-locked-loop, and Kalman-Filter theories.

The rid-redundant procedure in C-Prolog

NASA Technical Reports Server (NTRS)

Chen, Huo-Yan; Wah, Benjamin W.

1987-01-01

C-Prolog can conveniently be used for logical inferences on knowledge bases. However, as similar to many search methods using backward chaining, a large number of redundant computation may be produced in recursive calls. To overcome this problem, the 'rid-redundant' procedure was designed to rid all redundant computations in running multi-recursive procedures. Experimental results obtained for C-Prolog on the Vax 11/780 computer show that there is an order of magnitude improvement in the running time and solvable problem size.

Adaptive Control and Parameter Identification of a Doubly-Fed Induction Generator for Wind Power

DTIC Science & Technology

2011-09-01

Computer Controlled Systems, Theory and Design, Third Edition, Prentice Hall, New Jersey, 1997. [27] R. G. Brown and P. Y.C. Hwang , Introduction to...V n y iT iT , (0.0) with Ts as the sampling interval. From [26], the recursive estimate can be interpreted as a Kalman Filter for the process...by substituting t with n. The recursive equations for the RLS can then be derived from the Kalman filter equations used in [27]: 29 $ $ $ 1 1

Attitude estimation of earth orbiting satellites by decomposed linear recursive filters

NASA Technical Reports Server (NTRS)

Kou, S. R.

1975-01-01

Attitude estimation of earth orbiting satellites (including Large Space Telescope) subjected to environmental disturbances and noises was investigated. Modern control and estimation theory is used as a tool to design an efficient estimator for attitude estimation. Decomposed linear recursive filters for both continuous-time systems and discrete-time systems are derived. By using this accurate estimation of the attitude of spacecrafts, state variable feedback controller may be designed to achieve (or satisfy) high requirements of system performance.

Efficient method for computing the electronic transport properties of a multiterminal system

NASA Astrophysics Data System (ADS)

Lima, Leandro R. F.; Dusko, Amintor; Lewenkopf, Caio

2018-04-01

We present a multiprobe recursive Green's function method to compute the transport properties of mesoscopic systems using the Landauer-Büttiker approach. By introducing an adaptive partition scheme, we map the multiprobe problem into the standard two-probe recursive Green's function method. We apply the method to compute the longitudinal and Hall resistances of a disordered graphene sample, a system of current interest. We show that the performance and accuracy of our method compares very well with other state-of-the-art schemes.

Corona graphs as a model of small-world networks

NASA Astrophysics Data System (ADS)

Lv, Qian; Yi, Yuhao; Zhang, Zhongzhi

2015-11-01

We introduce recursive corona graphs as a model of small-world networks. We investigate analytically the critical characteristics of the model, including order and size, degree distribution, average path length, clustering coefficient, and the number of spanning trees, as well as Kirchhoff index. Furthermore, we study the spectra for the adjacency matrix and the Laplacian matrix for the model. We obtain explicit results for all the quantities of the recursive corona graphs, which are similar to those observed in real-life networks.

Event Compression Using Recursive Least Squares Signal Processing.

DTIC Science & Technology

1980-07-01

decimation of the Burstl signal with and without all-pole prefiltering to reduce aliasing . Figures 3.32a-c and 3.33a-c show the same examples but with 4/1...to reduce aliasing , w~t found that it did not improve the quality of the event compressed signals . If filtering must be performed, all-pole filtering...A-AO89 785 MASSACHUSETTS IN T OF TECH CAMBRIDGE RESEARCH LAB OF--ETC F/B 17/9 EVENT COMPRESSION USING RECURSIVE LEAST SQUARES SIGNAL PROCESSI-ETC(t

The Lehmer Matrix and Its Recursive Analogue

DTIC Science & Technology

2010-01-01

LU factorization of matrix A by considering det A = det U = ∏n i=1 2i−1 i2 . The nth Catalan number is given in terms of binomial coefficients by Cn...for failing to comply with a collection of information if it does not display a currently valid OMB control number . 1. REPORT DATE 2010 2. REPORT...TYPE 3. DATES COVERED 00-00-2010 to 00-00-2010 4. TITLE AND SUBTITLE The Lehmer matrix and its recursive analogue 5a. CONTRACT NUMBER 5b

Molecular dynamics simulations of electrostatics and hydration distributions around RNA and DNA motifs

NASA Astrophysics Data System (ADS)

Marlowe, Ashley E.; Singh, Abhishek; Semichaevsky, Andrey V.; Yingling, Yaroslava G.

2009-03-01

Nucleic acid nanoparticles can self-assembly through the formation of complementary loop-loop interactions or stem-stem interactions. Presence and concentration of ions can significantly affect the self-assembly process and the stability of the nanostructure. In this presentation we use explicit molecular dynamics simulations to examine the variations in cationic distributions and hydration environment around DNA and RNA helices and loop-loop interactions. Our simulations show that the potassium and sodium ionic distributions are different around RNA and DNA motifs which could be indicative of ion mediated relative stability of loop-loop complexes. Moreover in RNA loop-loop motifs ions are consistently present and exchanged through a distinct electronegative channel. We will also show how we used the specific RNA loop-loop motif to design a RNA hexagonal nanoparticle.

Quark mass relations to four-loop order in perturbative QCD.

PubMed

Marquard, Peter; Smirnov, Alexander V; Smirnov, Vladimir A; Steinhauser, Matthias

2015-04-10

We present results for the relation between a heavy quark mass defined in the on-shell and minimal subtraction (MS[over ¯]) scheme to four-loop order. The method to compute the four-loop on-shell integral is briefly described and the new results are used to establish relations between various short-distance masses and the MS[over ¯] quark mass to next-to-next-to-next-to-leading order accuracy. These relations play an important role in the accurate determination of the MS[over ¯] heavy quark masses.

From Loops to Trees By-passing Feynman's Theorem

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

Catani, Stefano; Gleisberg, Tanju; Krauss, Frank

2008-04-22

We derive a duality relation between one-loop integrals and phase-space integrals emerging from them through single cuts. The duality relation is realized by a modification of the customary + i0 prescription of the Feynman propagators. The new prescription regularizing the propagators, which we write in a Lorentz covariant form, compensates for the absence of multiple cut contributions that appear in the Feynman Tree Theorem. The duality relation can be applied to generic one-loop quantities in any relativistic, local and unitary field theories. It is suitable for applications to the analytical calculation of one-loop scattering amplitudes, and to the numerical evaluationmore » of cross-sections at next-to-leading order.« less

A recursive algorithm for the three-dimensional imaging of brain electric activity: Shrinking LORETA-FOCUSS.

PubMed

Liu, Hesheng; Gao, Xiaorong; Schimpf, Paul H; Yang, Fusheng; Gao, Shangkai

2004-10-01

Estimation of intracranial electric activity from the scalp electroencephalogram (EEG) requires a solution to the EEG inverse problem, which is known as an ill-conditioned problem. In order to yield a unique solution, weighted minimum norm least square (MNLS) inverse methods are generally used. This paper proposes a recursive algorithm, termed Shrinking LORETA-FOCUSS, which combines and expands upon the central features of two well-known weighted MNLS methods: LORETA and FOCUSS. This recursive algorithm makes iterative adjustments to the solution space as well as the weighting matrix, thereby dramatically reducing the computation load, and increasing local source resolution. Simulations are conducted on a 3-shell spherical head model registered to the Talairach human brain atlas. A comparative study of four different inverse methods, standard Weighted Minimum Norm, L1-norm, LORETA-FOCUSS and Shrinking LORETA-FOCUSS are presented. The results demonstrate that Shrinking LORETA-FOCUSS is able to reconstruct a three-dimensional source distribution with smaller localization and energy errors compared to the other methods.

A fast iterative recursive least squares algorithm for Wiener model identification of highly nonlinear systems.

PubMed

Kazemi, Mahdi; Arefi, Mohammad Mehdi

2017-03-01

In this paper, an online identification algorithm is presented for nonlinear systems in the presence of output colored noise. The proposed method is based on extended recursive least squares (ERLS) algorithm, where the identified system is in polynomial Wiener form. To this end, an unknown intermediate signal is estimated by using an inner iterative algorithm. The iterative recursive algorithm adaptively modifies the vector of parameters of the presented Wiener model when the system parameters vary. In addition, to increase the robustness of the proposed method against variations, a robust RLS algorithm is applied to the model. Simulation results are provided to show the effectiveness of the proposed approach. Results confirm that the proposed method has fast convergence rate with robust characteristics, which increases the efficiency of the proposed model and identification approach. For instance, the FIT criterion will be achieved 92% in CSTR process where about 400 data is used. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

Parsing recursive sentences with a connectionist model including a neural stack and synaptic gating.

PubMed

Fedor, Anna; Ittzés, Péter; Szathmáry, Eörs

2011-02-21

It is supposed that humans are genetically predisposed to be able to recognize sequences of context-free grammars with centre-embedded recursion while other primates are restricted to the recognition of finite state grammars with tail-recursion. Our aim was to construct a minimalist neural network that is able to parse artificial sentences of both grammars in an efficient way without using the biologically unrealistic backpropagation algorithm. The core of this network is a neural stack-like memory where the push and pop operations are regulated by synaptic gating on the connections between the layers of the stack. The network correctly categorizes novel sentences of both grammars after training. We suggest that the introduction of the neural stack memory will turn out to be substantial for any biological 'hierarchical processor' and the minimalist design of the model suggests a quest for similar, realistic neural architectures. Copyright © 2010 Elsevier Ltd. All rights reserved.

A recursive vesicle-based model protocell with a primitive model cell cycle

PubMed Central

Kurihara, Kensuke; Okura, Yusaku; Matsuo, Muneyuki; Toyota, Taro; Suzuki, Kentaro; Sugawara, Tadashi

2015-01-01

Self-organized lipid structures (protocells) have been proposed as an intermediate between nonliving material and cellular life. Synthetic production of model protocells can demonstrate the potential processes by which living cells first arose. While we have previously described a giant vesicle (GV)-based model protocell in which amplification of DNA was linked to self-reproduction, the ability of a protocell to recursively self-proliferate for multiple generations has not been demonstrated. Here we show that newborn daughter GVs can be restored to the status of their parental GVs by pH-induced vesicular fusion of daughter GVs with conveyer GVs filled with depleted substrates. We describe a primitive model cell cycle comprising four discrete phases (ingestion, replication, maturity and division), each of which is selectively activated by a specific external stimulus. The production of recursive self-proliferating model protocells represents a step towards eventual production of model protocells that are able to mimic evolution. PMID:26418735

Implementation of 3-D isoparametric finite elements on supercomputer for the formulation of recursive dynamical equations of multi-body systems

NASA Technical Reports Server (NTRS)

Shareef, N. H.; Amirouche, F. M. L.

1991-01-01

A computational algorithmic procedure is developed and implemented for the dynamic analysis of a multibody system with rigid/flexible interconnected bodies. The algorithm takes into consideration the large rotation/translation and small elastic deformations associated with the rigid-body degrees of freedom and the flexibility of the bodies in the system respectively. Versatile three-dimensional isoparametric brick elements are employed for the modeling of the geometric configurations of the bodies. The formulation of the recursive dynamical equations of motion is based on the recursive Kane's equations, strain energy concepts, and the techniques of component mode synthesis. In order to minimize CPU-intensive matrix multiplication operations and speed up the execution process, the concepts of indexed arrays is utilized in the formulation of the equations of motion. A spin-up maneuver of a space robot with three flexible links carrying a solar panel is used as an illustrative example.

Face recognition using tridiagonal matrix enhanced multivariance products representation

NASA Astrophysics Data System (ADS)

Ã-zay, Evrim Korkmaz

2017-01-01

This study aims to retrieve face images from a database according to a target face image. For this purpose, Tridiagonal Matrix Enhanced Multivariance Products Representation (TMEMPR) is taken into consideration. TMEMPR is a recursive algorithm based on Enhanced Multivariance Products Representation (EMPR). TMEMPR decomposes a matrix into three components which are a matrix of left support terms, a tridiagonal matrix of weight parameters for each recursion, and a matrix of right support terms, respectively. In this sense, there is an analogy between Singular Value Decomposition (SVD) and TMEMPR. However TMEMPR is a more flexible algorithm since its initial support terms (or vectors) can be chosen as desired. Low computational complexity is another advantage of TMEMPR because the algorithm has been constructed with recursions of certain arithmetic operations without requiring any iteration. The algorithm has been trained and tested with ORL face image database with 400 different grayscale images of 40 different people. TMEMPR's performance has been compared with SVD's performance as a result.

WKB solutions of difference equations and reconstruction by the topological recursion

NASA Astrophysics Data System (ADS)

Marchal, Olivier

2018-01-01

The purpose of this article is to analyze the connection between Eynard-Orantin topological recursion and formal WKB solutions of a \\hbar -difference equation: \\Psi(x+\\hbar)=≤ft(e\\hbar\\fracd{dx}\\right) \\Psi(x)=L(x;\\hbar)\\Psi(x) with L(x;\\hbar)\\in GL_2( ({C}(x))[\\hbar]) . In particular, we extend the notion of determinantal formulas and topological type property proposed for formal WKB solutions of \\hbar -differential systems to this setting. We apply our results to a specific \\hbar -difference system associated to the quantum curve of the Gromov-Witten invariants of {P}1 for which we are able to prove that the correlation functions are reconstructed from the Eynard-Orantin differentials computed from the topological recursion applied to the spectral curve y=\\cosh-1\\frac{x}{2} . Finally, identifying the large x expansion of the correlation functions, proves a recent conjecture made by Dubrovin and Yang regarding a new generating series for Gromov-Witten invariants of {P}1 .

Testing the Stability of 2-D Recursive QP, NSHP and General Digital Filters of Second Order

NASA Astrophysics Data System (ADS)

Rathinam, Ananthanarayanan; Ramesh, Rengaswamy; Reddy, P. Subbarami; Ramaswami, Ramaswamy

Several methods for testing stability of first quadrant quarter-plane two dimensional (2-D) recursive digital filters have been suggested in 1970's and 80's. Though Jury's row and column algorithms, row and column concatenation stability tests have been considered as highly efficient mapping methods. They still fall short of accuracy as they need infinite number of steps to conclude about the exact stability of the filters and also the computational time required is enormous. In this paper, we present procedurally very simple algebraic method requiring only two steps when applied to the second order 2-D quarter - plane filter. We extend the same method to the second order Non-Symmetric Half-plane (NSHP) filters. Enough examples are given for both these types of filters as well as some lower order general recursive 2-D digital filters. We applied our method to barely stable or barely unstable filter examples available in the literature and got the same decisions thus showing that our method is accurate enough.

Soft sensor modelling by time difference, recursive partial least squares and adaptive model updating

NASA Astrophysics Data System (ADS)

Fu, Y.; Yang, W.; Xu, O.; Zhou, L.; Wang, J.

2017-04-01

To investigate time-variant and nonlinear characteristics in industrial processes, a soft sensor modelling method based on time difference, moving-window recursive partial least square (PLS) and adaptive model updating is proposed. In this method, time difference values of input and output variables are used as training samples to construct the model, which can reduce the effects of the nonlinear characteristic on modelling accuracy and retain the advantages of recursive PLS algorithm. To solve the high updating frequency of the model, a confidence value is introduced, which can be updated adaptively according to the results of the model performance assessment. Once the confidence value is updated, the model can be updated. The proposed method has been used to predict the 4-carboxy-benz-aldehyde (CBA) content in the purified terephthalic acid (PTA) oxidation reaction process. The results show that the proposed soft sensor modelling method can reduce computation effectively, improve prediction accuracy by making use of process information and reflect the process characteristics accurately.

Statistical learning and the challenge of syntax: Beyond finite state automata

NASA Astrophysics Data System (ADS)

Elman, Jeff

2003-10-01

Over the past decade, it has been clear that even very young infants are sensitive to the statistical structure of language input presented to them, and use the distributional regularities to induce simple grammars. But can such statistically-driven learning also explain the acquisition of more complex grammar, particularly when the grammar includes recursion? Recent claims (e.g., Hauser, Chomsky, and Fitch, 2002) have suggested that the answer is no, and that at least recursion must be an innate capacity of the human language acquisition device. In this talk evidence will be presented that indicates that, in fact, statistically-driven learning (embodied in recurrent neural networks) can indeed enable the learning of complex grammatical patterns, including those that involve recursion. When the results are generalized to idealized machines, it is found that the networks are at least equivalent to Push Down Automata. Perhaps more interestingly, with limited and finite resources (such as are presumed to exist in the human brain) these systems demonstrate patterns of performance that resemble those in humans.

Kernel Recursive Least-Squares Temporal Difference Algorithms with Sparsification and Regularization

PubMed Central

Zhu, Qingxin; Niu, Xinzheng

2016-01-01

By combining with sparse kernel methods, least-squares temporal difference (LSTD) algorithms can construct the feature dictionary automatically and obtain a better generalization ability. However, the previous kernel-based LSTD algorithms do not consider regularization and their sparsification processes are batch or offline, which hinder their widespread applications in online learning problems. In this paper, we combine the following five techniques and propose two novel kernel recursive LSTD algorithms: (i) online sparsification, which can cope with unknown state regions and be used for online learning, (ii) L 2 and L 1 regularization, which can avoid overfitting and eliminate the influence of noise, (iii) recursive least squares, which can eliminate matrix-inversion operations and reduce computational complexity, (iv) a sliding-window approach, which can avoid caching all history samples and reduce the computational cost, and (v) the fixed-point subiteration and online pruning, which can make L 1 regularization easy to implement. Finally, simulation results on two 50-state chain problems demonstrate the effectiveness of our algorithms. PMID:27436996

Trigonometrical sums connected with the chiral Potts model, Verlinde dimension formula, two-dimensional resistor network, and number theory

NASA Astrophysics Data System (ADS)

Chair, Noureddine

2014-02-01

We have recently developed methods for obtaining exact two-point resistance of the complete graph minus N edges. We use these methods to obtain closed formulas of certain trigonometrical sums that arise in connection with one-dimensional lattice, in proving Scott's conjecture on permanent of Cauchy matrix, and in the perturbative chiral Potts model. The generalized trigonometrical sums of the chiral Potts model are shown to satisfy recursion formulas that are transparent and direct, and differ from those of Gervois and Mehta. By making a change of variables in these recursion formulas, the dimension of the space of conformal blocks of SU(2) and SO(3) WZW models may be computed recursively. Our methods are then extended to compute the corner-to-corner resistance, and the Kirchhoff index of the first non-trivial two-dimensional resistor network, 2×N. Finally, we obtain new closed formulas for variant of trigonometrical sums, some of which appear in connection with number theory.

Kernel Recursive Least-Squares Temporal Difference Algorithms with Sparsification and Regularization.

PubMed

Zhang, Chunyuan; Zhu, Qingxin; Niu, Xinzheng

2016-01-01

By combining with sparse kernel methods, least-squares temporal difference (LSTD) algorithms can construct the feature dictionary automatically and obtain a better generalization ability. However, the previous kernel-based LSTD algorithms do not consider regularization and their sparsification processes are batch or offline, which hinder their widespread applications in online learning problems. In this paper, we combine the following five techniques and propose two novel kernel recursive LSTD algorithms: (i) online sparsification, which can cope with unknown state regions and be used for online learning, (ii) L 2 and L 1 regularization, which can avoid overfitting and eliminate the influence of noise, (iii) recursive least squares, which can eliminate matrix-inversion operations and reduce computational complexity, (iv) a sliding-window approach, which can avoid caching all history samples and reduce the computational cost, and (v) the fixed-point subiteration and online pruning, which can make L 1 regularization easy to implement. Finally, simulation results on two 50-state chain problems demonstrate the effectiveness of our algorithms.

A spatial operator algebra for manipulator modeling and control

NASA Technical Reports Server (NTRS)

Rodriguez, G.; Kreutz, Kenneth; Jain, Abhinandan

1989-01-01

A recently developed spatial operator algebra, useful for modeling, control, and trajectory design of manipulators is discussed. The elements of this algebra are linear operators whose domain and range spaces consist of forces, moments, velocities, and accelerations. The effect of these operators is equivalent to a spatial recursion along the span of a manipulator. Inversion of operators can be efficiently obtained via techniques of recursive filtering and smoothing. The operator algebra provides a high level framework for describing the dynamic and kinematic behavior of a manipulator and control and trajectory design algorithms. The interpretation of expressions within the algebraic framework leads to enhanced conceptual and physical understanding of manipulator dynamics and kinematics. Furthermore, implementable recursive algorithms can be immediately derived from the abstract operator expressions by inspection. Thus, the transition from an abstract problem formulation and solution to the detailed mechanizaton of specific algorithms is greatly simplified. The analytical formulation of the operator algebra, as well as its implementation in the Ada programming language are discussed.

Rotational-path decomposition based recursive planning for spacecraft attitude reorientation

NASA Astrophysics Data System (ADS)

Xu, Rui; Wang, Hui; Xu, Wenming; Cui, Pingyuan; Zhu, Shengying

2018-02-01

The spacecraft reorientation is a common task in many space missions. With multiple pointing constraints, it is greatly difficult to solve the constrained spacecraft reorientation planning problem. To deal with this problem, an efficient rotational-path decomposition based recursive planning (RDRP) method is proposed in this paper. The uniform pointing-constraint-ignored attitude rotation planning process is designed to solve all rotations without considering pointing constraints. Then the whole path is checked node by node. If any pointing constraint is violated, the nearest critical increment approach will be used to generate feasible alternative nodes in the process of rotational-path decomposition. As the planning path of each subdivision may still violate pointing constraints, multiple decomposition is needed and the reorientation planning is designed as a recursive manner. Simulation results demonstrate the effectiveness of the proposed method. The proposed method has been successfully applied in two SPARK microsatellites to solve onboard constrained attitude reorientation planning problem, which were developed by the Shanghai Engineering Center for Microsatellites and launched on 22 December 2016.

Livermore Compiler Analysis Loop Suite

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

Hornung, R. D.

2013-03-01

LCALS is designed to evaluate compiler optimizations and performance of a variety of loop kernels and loop traversal software constructs. Some of the loop kernels are pulled directly from "Livermore Loops Coded in C", developed at LLNL (see item 11 below for details of earlier code versions). The older suites were used to evaluate floating-point performances of hardware platforms prior to porting larger application codes. The LCALS suite is geared toward assissing C++ compiler optimizations and platform performance related to SIMD vectorization, OpenMP threading, and advanced C++ language features. LCALS contains 20 of 24 loop kernels from the older Livermoremore » Loop suites, plus various others representative of loops found in current production appkication codes at LLNL. The latter loops emphasize more diverse loop constructs and data access patterns than the others, such as multi-dimensional difference stencils. The loops are included in a configurable framework, which allows control of compilation, loop sampling for execution timing, which loops are run and their lengths. It generates timing statistics for analysis and comparing variants of individual loops. Also, it is easy to add loops to the suite as desired.« less

Conformal correlation functions in the Brownian loop soup

NASA Astrophysics Data System (ADS)

Camia, Federico; Gandolfi, Alberto; Kleban, Matthew

2016-01-01

We define and study a set of operators that compute statistical properties of the Brownian loop soup, a conformally invariant gas of random Brownian loops (Brownian paths constrained to begin and end at the same point) in two dimensions. We prove that the correlation functions of these operators have many of the properties of conformal primaries in a conformal field theory, and compute their conformal dimension. The dimensions are real and positive, but have the novel feature that they vary continuously as a periodic function of a real parameter. We comment on the relation of the Brownian loop soup to the free field, and use this relation to establish that the central charge of the loop soup is twice its intensity.

Two-loop renormalization of gaugino masses in general supersymmetric gauge models

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

Yamada, Y.

1994-01-03

We calculate the two-loop renormalization group equations for the running gaugino masses in general supersymmetry (SUSY) gauge models, improving our previous result. We also study its consequences on the unification of the gaugino masses in the SUSY SU(5) model. The two-loop correction to the one-loop relation [ital m][sub [ital i

Generalized and efficient algorithm for computing multipole energies and gradients based on Cartesian tensors

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

Lin, Dejun, E-mail: dejun.lin@gmail.com

2015-09-21

Accurate representation of intermolecular forces has been the central task of classical atomic simulations, known as molecular mechanics. Recent advancements in molecular mechanics models have put forward the explicit representation of permanent and/or induced electric multipole (EMP) moments. The formulas developed so far to calculate EMP interactions tend to have complicated expressions, especially in Cartesian coordinates, which can only be applied to a specific kernel potential function. For example, one needs to develop a new formula each time a new kernel function is encountered. The complication of these formalisms arises from an intriguing and yet obscured mathematical relation between themore » kernel functions and the gradient operators. Here, I uncover this relation via rigorous derivation and find that the formula to calculate EMP interactions is basically invariant to the potential kernel functions as long as they are of the form f(r), i.e., any Green’s function that depends on inter-particle distance. I provide an algorithm for efficient evaluation of EMP interaction energies, forces, and torques for any kernel f(r) up to any arbitrary rank of EMP moments in Cartesian coordinates. The working equations of this algorithm are essentially the same for any kernel f(r). Recently, a few recursive algorithms were proposed to calculate EMP interactions. Depending on the kernel functions, the algorithm here is about 4–16 times faster than these algorithms in terms of the required number of floating point operations and is much more memory efficient. I show that it is even faster than a theoretically ideal recursion scheme, i.e., one that requires 1 floating point multiplication and 1 addition per recursion step. This algorithm has a compact vector-based expression that is optimal for computer programming. The Cartesian nature of this algorithm makes it fit easily into modern molecular simulation packages as compared with spherical coordinate-based algorithms. A software library based on this algorithm has been implemented in C++11 and has been released.« less

A Nodal-independent and tissue-intrinsic mechanism controls heart-looping chirality

NASA Astrophysics Data System (ADS)

Noël, Emily S.; Verhoeven, Manon; Lagendijk, Anne Karine; Tessadori, Federico; Smith, Kelly; Choorapoikayil, Suma; den Hertog, Jeroen; Bakkers, Jeroen

2013-11-01

Breaking left-right symmetry in bilateria is a major event during embryo development that is required for asymmetric organ position, directional organ looping and lateralized organ function in the adult. Asymmetric expression of Nodal-related genes is hypothesized to be the driving force behind regulation of organ laterality. Here we identify a Nodal-independent mechanism that drives asymmetric heart looping in zebrafish embryos. In a unique mutant defective for the Nodal-related southpaw gene, preferential dextral looping in the heart is maintained, whereas gut and brain asymmetries are randomized. As genetic and pharmacological inhibition of Nodal signalling does not abolish heart asymmetry, a yet undiscovered mechanism controls heart chirality. This mechanism is tissue intrinsic, as explanted hearts maintain ex vivo retain chiral looping behaviour and require actin polymerization and myosin II activity. We find that Nodal signalling regulates actin gene expression, supporting a model in which Nodal signalling amplifies this tissue-intrinsic mechanism of heart looping.

A comparative approach to closed-loop computation.

PubMed

Roth, E; Sponberg, S; Cowan, N J

2014-04-01

Neural computation is inescapably closed-loop: the nervous system processes sensory signals to shape motor output, and motor output consequently shapes sensory input. Technological advances have enabled neuroscientists to close, open, and alter feedback loops in a wide range of experimental preparations. The experimental capability of manipulating the topology-that is, how information can flow between subsystems-provides new opportunities to understand the mechanisms and computations underlying behavior. These experiments encompass a spectrum of approaches from fully open-loop, restrained preparations to the fully closed-loop character of free behavior. Control theory and system identification provide a clear computational framework for relating these experimental approaches. We describe recent progress and new directions for translating experiments at one level in this spectrum to predictions at another level. Operating across this spectrum can reveal new understanding of how low-level neural mechanisms relate to high-level function during closed-loop behavior. Copyright © 2013 Elsevier Ltd. All rights reserved.

Recursive causality in evolution: a model for epigenetic mechanisms in cancer development.

PubMed

Haslberger, A; Varga, F; Karlic, H

2006-01-01

Interactions between adaptative and selective processes are illustrated in the model of recursive causality as defined in Rupert Riedl's systems theory of evolution. One of the main features of this theory also termed as theory of evolving complexity is the centrality of the notion of 'recursive' or 'feedback' causality - 'the idea that every biological effect in living systems, in some way, feeds back to its own cause'. Our hypothesis is that "recursive" or "feedback" causality provides a model for explaining the consequences of interacting genetic and epigenetic mechanisms which are known to play a key role in development of cancer. Epigenetics includes any process that alters gene activity without changes of the DNA sequence. The most important epigenetic mechanisms are DNA-methylation and chromatin remodeling. Hypomethylation of so-called oncogenes and hypermethylation of tumor suppressor genes appear to be critical determinants of cancer. Folic acid, vitamin B12 and other nutrients influence the function of enzymes that participate in various methylation processes by affecting the supply of methyl groups into a variety of molecules which may be directly or indirectly associated with cancerogenesis. We present an example from our own studies by showing that vitamin D3 has the potential to de-methylate the osteocalcin-promoter in MG63 osteosarcoma cells. Consequently, a stimulation of osteocalcin synthesis can be observed. The above mentioned enzymes also play a role in development and differentiation of cells and organisms and thus illustrate the close association between evolutionary and developmental mechanisms. This enabled new ways to understand the interaction between the genome and environment and may improve biomedical concepts including environmental health aspects where epigenetic and genetic modifications are closely associated. Recent observations showed that methylated nucleotides in the gene promoter may serve as a target for solar UV-induced mutations of the p53 tumor suppressor gene. This illustrates the close interaction of genetic and epigenetic mechanisms in cancerogenesis resulting from changes in transcriptional regulation and its contribution to a phenotype at the micro- or macroevolutionary level. Above-mentioned interactions of genetic and epigenetic mechanisms in oncogenesis defy explanation by plain linear causality, things like the continuing adaptability of complex systems. They can be explained by the concept of recursive causality and has introduced molecular biology into the realm of cognition science and systems theory: based on the notion of so-called feedback- or recursive causality a model for epigenetic mechanisms with relevance for oncology and biomedicine is provided.

Genetic Analysis of the Heparan Modification Network in Caenorhabditis elegans*

PubMed Central

Townley, Robert A.; Bülow, Hannes E.

2011-01-01

Heparan sulfates (HS) are highly modified sugar polymers in multicellular organisms that function in cell adhesion and cellular responses to protein signaling. Functionally distinct, cell type-dependent HS modification patterns arise as the result of a conserved network of enzymes that catalyze deacetylations, sulfations, and epimerizations in specific positions of the sugar residues. To understand the genetic interactions of the enzymes during the HS modification process, we have measured the composition of HS purified from mutant strains of Caenorhabditis elegans. From these measurements we have developed a genetic network model of HS modification. We find the interactions to be highly recursive positive feed-forward and negative feedback loops. Our genetic analyses show that the HS C-5 epimerase hse-5, the HS 2-O-sulfotransferase hst-2, or the HS 6-O-sulfotransferase hst-6 inhibit N-sulfation. In contrast, hse-5 stimulates both 2-O- and 6-O-sulfation and, hst-2 and hst-6 inhibit 6-O- and 2-O-sulfation, respectively. The effects of hst-2 and hst-6 on N-sulfation, 6-O-sulfation, and 2-O-sulfation appear largely dependent on hse-5 function. This core of regulatory interactions is further modulated by 6-O-endosulfatase activity (sul-1). 47% of all 6-O-sulfates get removed from HS and this editing process is dependent on hst-2, thereby providing additional negative feedback between 2-O- and 6-O-sulfation. These findings suggest that the modification patterns are highly sensitive to the relative composition of the HS modification enzymes. Our comprehensive genetic analysis forms the basis of understanding the HS modification network in metazoans. PMID:21454666

Organ donation video messaging in motor vehicle offices: results of a randomized trial.

PubMed

Rodrigue, James R; Fleishman, Aaron; Fitzpatrick, Sean; Boger, Matthew

2015-12-01

Since nearly all registered organ donors in the United States signed up via a driver's license transaction, motor vehicle (MV) offices represent an important venue for organ donation education. To evaluate the impact of organ donation video messaging in MV offices. A 2-group (usual care vs usual care+video messaging) randomized trial with baseline, intervention, and follow-up assessment phases. Twenty-eight MV offices in Massachusetts. Usual care comprised education of MV clerks, display of organ donation print materials (ie, posters, brochures, signing mats), and a volunteer ambassador program. The intervention included video messaging with silent (subtitled) segments highlighting individuals affected by donation, playing on a recursive loop on monitors in MV waiting rooms. Aggregate monthly donor designation rates at MV offices (primary) and percentage of MV customers who registered as donors after viewing the video (secondary). Controlling for baseline donor designation rate, analysis of covariance showed a significant group effect for intervention phase (F=7.3, P=.01). The usual-care group had a significantly higher aggregate monthly donor designation rate than the intervention group had. In the logistic regression model of customer surveys (n=912), prior donor designation (β=-1.29, odds ratio [OR]=0.27 [95% CI=0.20-0.37], P<.001), white race (β=0.57 OR=1.77 [95% CI=1.23-2.54], P=.002), and viewing the intervention video (β=0.73, OR=1.54 [95% CI=1.24-2.60], P=.01) were statistically significant predictors of donor registration on the day of the survey. The relatively low uptake of the video intervention by customers most likely contributed to the negative trial finding.

Real-time supervisor system based on trinary logic to control experiments with behaving animals and humans.

PubMed

Kutz, D F; Marzocchi, N; Fattori, P; Cavalcanti, S; Galletti, C

2005-06-01

A new method is presented based on trinary logic able to check the state of different control variables and synchronously record the physiological and behavioral data of behaving animals and humans. The basic information structure of the method is a time interval of defined maximum duration, called time slice, during which the supervisor system periodically checks the status of a specific subset of input channels. An experimental condition is a sequence of time slices subsequently executed according to the final status of the previous time slice. The proposed method implements in its data structure the possibility to branch like an if-else cascade and the possibility to repeat parts of it recursively like the while-loop. Therefore its data structure contains the most basic control structures of programming languages. The method was implemented using a real-time version of LabVIEW programming environment to program and control our experimental setup. Using this supervision system, we synchronously record four analog data channels at 500 Hz (including eye movements) and the time stamps of up to six neurons at 100 kHz. The system reacts with a resolution within 1 ms to changes of state of digital input channels. The system is set to react to changes in eye position with a resolution within 4 ms. The time slices, experimental conditions, and data are handled by relational databases. This facilitates the construction of new experimental conditions and data analysis. The proposed implementation allows continuous recording without an inter-trial gap for data storage or task management. The implementation can be used to drive electrophysiological experiments of behaving animals and psychophysical studies with human subjects.

Gluon amplitudes as 2 d conformal correlators

NASA Astrophysics Data System (ADS)

Pasterski, Sabrina; Shao, Shu-Heng; Strominger, Andrew

2017-10-01

Recently, spin-one wave functions in four dimensions that are conformal primaries of the Lorentz group S L (2 ,C ) were constructed. We compute low-point, tree-level gluon scattering amplitudes in the space of these conformal primary wave functions. The answers have the same conformal covariance as correlators of spin-one primaries in a 2 d CFT. The Britto-Cachazo-Feng-Witten (BCFW) recursion relation between three- and four-point gluon amplitudes is recast into this conformal basis.

Aspects of Integrability in One and Several Dimensions,

DTIC Science & Technology

1986-01-01

Kadomtsev - Petviashvili (KP) equation , the modified KdV to the modified KP, the non-linear Schr6d- inger to the Davey-Stewartson, etc. Furthermore...but a function de- noted in 20 by T12. This function also generates recursion operators in analogy with T. i % 61 4. THE KADOMTSEV - PETVIASHVILI EQUATION ...and its Appl., 19 L • 11 (1985). [41] Caudrey, P.J., Discrete and Periodic Spectral Transforms Related to the Kadomtsev - Petviashvili Equation (preprint

Transverse momentum correlations of quarks in recursive jet models

NASA Astrophysics Data System (ADS)

Artru, X.; Belghobsi, Z.; Redouane-Salah, E.

2016-08-01

In the symmetric string fragmentation recipe adopted by PYTHIA for jet simulations, the transverse momenta of successive quarks are uncorrelated. This is a simplification but has no theoretical basis. Transverse momentum correlations are naturally expected, for instance, in a covariant multiperipheral model of quark hadronization. We propose a simple recipe of string fragmentation which leads to such correlations. The definition of the jet axis and its relation with the primordial transverse momentum of the quark is also discussed.

Aspects of perturbation theory in quantum mechanics: The BenderWuMATHEMATICA® package

NASA Astrophysics Data System (ADS)

Sulejmanpasic, Tin; Ünsal, Mithat

2018-07-01

We discuss a general setup which allows the study of the perturbation theory of an arbitrary, locally harmonic 1D quantum mechanical potential as well as its multi-variable (many-body) generalization. The latter may form a prototype for regularized quantum field theory. We first generalize the method of Bender-Wu,and derive exact recursion relations which allow the determination of the perturbative wave-function and energy corrections to an arbitrary order, at least in principle. For 1D systems, we implement these equations in an easy to use MATHEMATICA® package we call BenderWu. Our package enables quick home-computer computation of high orders of perturbation theory (about 100 orders in 10-30 s, and 250 orders in 1-2 h) and enables practical study of a large class of problems in Quantum Mechanics. We have two hopes concerning the BenderWu package. One is that due to resurgence, large amount of non-perturbative information, such as non-perturbative energies and wave-functions (e.g. WKB wave functions), can in principle be extracted from the perturbative data. We also hope that the package may be used as a teaching tool, providing an effective bridge between perturbation theory and non-perturbative physics in textbooks. Finally, we show that for the multi-variable case, the recursion relation acquires a geometric character, and has a structure which allows parallelization to computer clusters.

Two dimensional J-matrix approach to quantum scattering

NASA Astrophysics Data System (ADS)

Olumegbon, Ismail Adewale

We present an extension of the J-matrix method of scattering to two dimensions in cylindrical coordinates. In the J-matrix approach we select a zeroth order Hamiltonian, H0, which is exactly solvable in the sense that we select a square integrable basis set that enable us to have an infinite tridiagonal representation for H0. Expanding the wavefunction in this basis makes the wave equation equivalent to a three-term recursion relation for the expansion coefficients. Consequently, finding solutions of the recursion relation is equivalent to solving the original H0 problem (i.e., determining the expansion coefficients of the system's wavefunction). The part of the original potential interaction which cannot be brought to an exact tridiagonal form is cut in an NxN basis space and its matrix elements are computed numerically using Gauss quadrature approach. Hence, this approach embodies powerful tools in the analysis of solutions of the wave equation by exploiting the intimate connection and interplay between tridiagonal matrices and the theory of orthogonal polynomials. In such analysis, one is at liberty to employ a wide range of well established methods and numerical techniques associated with these settings such as quadrature approximation and continued fractions. To demonstrate the utility, usefulness, and accuracy of the extended method we use it to obtain the bound states for an illustrative short range potential problem.

Two dimensional J-matrix approach to quantum scattering

NASA Astrophysics Data System (ADS)

Olumegbon, Ismail Adewale

2013-01-01

We present an extension of the J-matrix method of scattering to two dimensions in cylindrical coordinates. In the J-matrix approach we select a zeroth order Hamiltonian, H0, which is exactly solvable in the sense that we select a square integrable basis set that enable us to have an infinite tridiagonal representation for H0. Expanding the wavefunction in this basis makes the wave equation equivalent to a three-term recursion relation for the expansion coefficients. Consequently, finding solutions of the recursion relation is equivalent to solving the original H0 problem (i.e., determining the expansion coefficients of the system's wavefunction). The part of the original potential interaction which cannot be brought to an exact tridiagonal form is cut in an NxN basis space and its matrix elements are computed numerically using Gauss quadrature approach. Hence, this approach embodies powerful tools in the analysis of solutions of the wave equation by exploiting the intimate connection and interplay between tridiagonal matrices and the theory of orthogonal polynomials. In such analysis, one is at liberty to employ a wide range of well established methods and numerical techniques associated with these settings such as quadrature approximation and continued fractions. To demonstrate the utility, usefulness, and accuracy of the extended method we use it to obtain the bound states for an illustrative short range potential problem.

Fast-sausage oscillations in coronal loops with smooth boundary

NASA Astrophysics Data System (ADS)

Lopin, I.; Nagorny, I.

2014-12-01

Aims: The effect of the transition layer (shell) in nonuniform coronal loops with a continuous radial density profile on the properties of fast-sausage modes are studied analytically and numerically. Methods: We modeled the coronal waveguide as a structured tube consisting of a cord and a transition region (shell) embedded within a magnetic uniform environment. The derived general dispersion relation was investigated analytically and numerically in the context of frequency, cut-off wave number, and the damping rate of fast-sausage oscillations for various values of loop parameters. Results: The frequency of the global fast-sausage mode in the loops with a diffuse (or smooth) boundary is determined mainly by the external Alfvén speed and longitudinal wave number. The damping rate of such a mode can be relatively low. The model of coronal loop with diffuse boundary can support a comparatively low-frequency, global fast-sausage mode of detectable quality without involving extremely low values of the density contrast. The effect of thin transition layer (corresponds to the loops with steep boundary) is negligible and produces small reductions of oscillation frequency and relative damping rate in comparison with the case of step-function density profile. Seismological application of obtained results gives the estimated Alfvén speed outside the flaring loop about 3.25 Mm/s.

Equilibrium models of coronal loops that involve curvature and buoyancy

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

Hindman, Bradley W.; Jain, Rekha, E-mail: hindman@solarz.colorado.edu

2013-12-01

We construct magnetostatic models of coronal loops in which the thermodynamics of the loop is fully consistent with the shape and geometry of the loop. This is achieved by treating the loop as a thin, compact, magnetic fibril that is a small departure from a force-free state. The density along the loop is related to the loop's curvature by requiring that the Lorentz force arising from this deviation is balanced by buoyancy. This equilibrium, coupled with hydrostatic balance and the ideal gas law, then connects the temperature of the loop with the curvature of the loop without resorting to amore » detailed treatment of heating and cooling. We present two example solutions: one with a spatially invariant magnetic Bond number (the dimensionless ratio of buoyancy to Lorentz forces) and the other with a constant radius of the curvature of the loop's axis. We find that the density and temperature profiles are quite sensitive to curvature variations along the loop, even for loops with similar aspect ratios.« less

Confirmatory Analytic Tests of Three Causal Models Relating Job Perceptions to Job Satisfaction.

DTIC Science & Technology

1984-12-01

Perceptions ~Job SatisfactionD I~i- Confirmatory Analysi s Precognitive Postcognitive L ft A e S T R A f T I ( C O n" " n ," , V fV f f vv r e # d o i t c e...in the causal order, and job perceptions and job satisfaction are reciprocally related; (b) a precognitive -recursive model in which job perceptions...occur after job satisfaction in the causal order and are effects but not causes of job satisfaction; and (c) a precognitive DD FOR 1473 EDITION 01O NOV

Algebraic criteria for positive realness relative to the unit circle.

NASA Technical Reports Server (NTRS)

Siljak, D. D.

1973-01-01

A definition is presented of the circle positive realness of real rational functions relative to the unit circle in the complex variable plane. The problem of testing this kind of positive reality is reduced to the algebraic problem of determining the distribution of zeros of a real polynomial with respect to and on the unit circle. Such reformulation of the problem avoids the search for explicit information about imaginary poles of rational functions. The stated algebraic problem is solved by applying the polynomial criteria of Marden (1966) and Jury (1964), and a completely recursive algorithm for circle positive realness is obtained.

Double soft limit of the graviton amplitude from the Cachazo-He-Yuan formalism

NASA Astrophysics Data System (ADS)

Saha, Arnab Priya

2017-08-01

We present a complete analysis for double soft limit of graviton scattering amplitude using the formalism proposed by Cachazo, He, and Yuan. Our results agree with that obtained via Britto-Cachazo-Feng-Witten (BCFW) recursion relations in [T. Klose, T. McLoughlin, D. Nandan, J. Plefka, and G. Travaglini, Double-soft limits of gluons and gravitons, J. High Energy Phys. 07 (2015) 135., 10.1007/JHEP07(2015)135]. In addition we find precise relations between degenerate and nondegenerate solutions of scattering equations with local and nonlocal terms in the soft factor.

An efficient parallel algorithm for the solution of a tridiagonal linear system of equations

NASA Technical Reports Server (NTRS)

Stone, H. S.

1971-01-01

Tridiagonal linear systems of equations are solved on conventional serial machines in a time proportional to N, where N is the number of equations. The conventional algorithms do not lend themselves directly to parallel computations on computers of the ILLIAC IV class, in the sense that they appear to be inherently serial. An efficient parallel algorithm is presented in which computation time grows as log sub 2 N. The algorithm is based on recursive doubling solutions of linear recurrence relations, and can be used to solve recurrence relations of all orders.

A novel noncommutative KdV-type equation, its recursion operator, and solitons

NASA Astrophysics Data System (ADS)

Carillo, Sandra; Lo Schiavo, Mauro; Porten, Egmont; Schiebold, Cornelia

2018-04-01

A noncommutative KdV-type equation is introduced extending the Bäcklund chart in Carillo et al. [Symmetry Integrability Geom.: Methods Appl. 12, 087 (2016)]. This equation, called meta-mKdV here, is linked by Cole-Hopf transformations to the two noncommutative versions of the mKdV equations listed in Olver and Sokolov [Commun. Math. Phys. 193, 245 (1998), Theorem 3.6]. For this meta-mKdV, and its mirror counterpart, recursion operators, hierarchies, and an explicit solution class are derived.

FRPA: A Framework for Recursive Parallel Algorithms

DTIC Science & Technology

2015-05-01

a t o i ( argv [ 1 ] ) ; s td : : s t r i n g i n t e r l e a v i n g = ( argc > 2) ? argv [ 2 ] : " " ; double ∗ A = randomArray ( l e n g t h...actually determines how deep the recursion is. For example, a configuration with schedule ‘BBDB’ and depth 3 represents the in- terleaving ‘ BBD ’. This means...depth 3 represents the same interleaving as the configuration with schedule ‘BBDD’ and depth 3, namely ‘ BBD ’. In our experiments, this redundancy did

Recursive Algorithms for Real-Time Digital CR-RCn Pulse Shaping

NASA Astrophysics Data System (ADS)

Nakhostin, M.

2011-10-01

This paper reports on recursive algorithms for real-time implementation of CR-(RC)n filters in digital nuclear spectroscopy systems. The algorithms are derived by calculating the Z-transfer function of the filters for filter orders up to n=4 . The performances of the filters are compared with the performance of the conventional digital trapezoidal filter using a noise generator which separately generates pure series, 1/f and parallel noise. The results of our study enable one to select the optimum digital filter for different noise and rate conditions.

Recursive solution of number of reachable states of a simple subclass of FMS

NASA Astrophysics Data System (ADS)

Chao, Daniel Yuh

2014-03-01

This paper aims to compute the number of reachable (forbidden, live and deadlock) states for flexible manufacturing systems (FMS) without the construction of reachability graph. The problem is nontrivial and takes, in general, an exponential amount of time to solve. Hence, this paper focusses on a simple version of Systems of Simple Sequential Processes with Resources (S3PR), called kth-order system, where each resource place holds one token to be shared between two processes. The exact number of reachable (forbidden, live and deadlock) states can be computed recursively.

Stability analysis and compensation of a boost regulator with two-loop control

NASA Technical Reports Server (NTRS)

Wester, G. W.

1974-01-01

A useful stability measure has been demonstrated by Wester (1973) for switching regulators with a single feedback loop by applying the Nyquist criterion to the approximate loop gain determined by a time-averaging technique. This approach is extended and applied to the characterization, stability analysis, and compensation design of a switching regulator with two-loop control. The role and relative significance of each control loop is clarified on the basis of a description of circuit operation, and the major and minor loops are identified. In view of the inapplicability of linear feedback theory, describing functions of the feedback loops and power stage are derived, using small-signal analysis. Several phenomena revealed from an analysis of the major loop gain are discussed.

A social feedback loop for speech development and its reduction in autism

PubMed Central

Warlaumont, Anne S.; Richards, Jeffrey A.; Gilkerson, Jill; Oller, D. Kimbrough

2014-01-01

We analyze the microstructure of child-adult interaction during naturalistic, daylong, automatically labeled audio recordings (13,836 hours total) of children (8- to 48-month-olds) with and without autism. We find that adult responses are more likely when child vocalizations are speech-related. In turn, a child vocalization is more likely to be speech-related if the previous speech-related child vocalization received an immediate adult response. Taken together, these results are consistent with the idea that there is a social feedback loop between child and caregiver that promotes speech-language development. Although this feedback loop applies in both typical development and autism, children with autism produce proportionally fewer speech-related vocalizations and the responses they receive are less contingent on whether their vocalizations are speech-related. We argue that such differences will diminish the strength of the social feedback loop with cascading effects on speech development over time. Differences related to socioeconomic status are also reported. PMID:24840717

Experimental Investigation of DC-Bias Related Core Losses in a Boost Inductor (Postprint)

DTIC Science & Technology

2014-08-01

dc bias-flux conditions. These dc bias conditions result in distorted hysteresis loops , increased core losses, and have been shown to be independent...These dc bias conditions result in dis- torted hysteresis loops , increased core losses, and have been shown to be independent of core material. The...controllable converter load currents, this topology is ideal to study dc-related losses. Inductor core hysteresis loop characterization was accomplished

A minimal approach to the scattering of physical massless bosons

NASA Astrophysics Data System (ADS)

Boels, Rutger H.; Luo, Hui

2018-05-01

Tree and loop level scattering amplitudes which involve physical massless bosons are derived directly from physical constraints such as locality, symmetry and unitarity, bypassing path integral constructions. Amplitudes can be projected onto a minimal basis of kinematic factors through linear algebra, by employing four dimensional spinor helicity methods or at its most general using projection techniques. The linear algebra analysis is closely related to amplitude relations, especially the Bern-Carrasco-Johansson relations for gluon amplitudes and the Kawai-Lewellen-Tye relations between gluons and graviton amplitudes. Projection techniques are known to reduce the computation of loop amplitudes with spinning particles to scalar integrals. Unitarity, locality and integration-by-parts identities can then be used to fix complete tree and loop amplitudes efficiently. The loop amplitudes follow algorithmically from the trees. A number of proof-of-concept examples are presented. These include the planar four point two-loop amplitude in pure Yang-Mills theory as well as a range of one loop amplitudes with internal and external scalars, gluons and gravitons. Several interesting features of the results are highlighted, such as the vanishing of certain basis coefficients for gluon and graviton amplitudes. Effective field theories are naturally and efficiently included into the framework. Dimensional regularisation is employed throughout; different regularisation schemes are worked out explicitly. The presented methods appear most powerful in non-supersymmetric theories in cases with relatively few legs, but with potentially many loops. For instance, in the introduced approach iterated unitarity cuts of four point amplitudes for non-supersymmetric gauge and gravity theories can be computed by matrix multiplication, generalising the so-called rung-rule of maximally supersymmetric theories. The philosophy of the approach to kinematics also leads to a technique to control colour quantum numbers of scattering amplitudes with matter, especially efficient in the adjoint and fundamental representations.

Canonical structure of general relativity with a limiting curvature and its relation to loop quantum gravity

NASA Astrophysics Data System (ADS)

Bodendorfer, N.; Schäfer, A.; Schliemann, J.

2018-04-01

Chamseddine and Mukhanov recently proposed a modified version of general relativity that implements the idea of a limiting curvature. In the spatially flat, homogeneous, and isotropic sector, their theory turns out to agree with the effective dynamics of the simplest version of loop quantum gravity if one identifies their limiting curvature with a multiple of the Planck curvature. At the same time, it extends to full general relativity without any symmetry assumptions and thus provides an ideal toy model for full loop quantum gravity in the form of a generally covariant effective action known to all orders. In this paper, we study the canonical structure of this theory and point out some interesting lessons for loop quantum gravity. We also highlight in detail how the two theories are connected in the spatially flat, homogeneous, and isotropic sector.

Immirzi parameter without Immirzi ambiguity: Conformal loop quantization of scalar-tensor gravity

NASA Astrophysics Data System (ADS)

Veraguth, Olivier J.; Wang, Charles H.-T.

2017-10-01

Conformal loop quantum gravity provides an approach to loop quantization through an underlying conformal structure i.e. conformally equivalent class of metrics. The property that general relativity itself has no conformal invariance is reinstated with a constrained scalar field setting the physical scale. Conformally equivalent metrics have recently been shown to be amenable to loop quantization including matter coupling. It has been suggested that conformal geometry may provide an extended symmetry to allow a reformulated Immirzi parameter necessary for loop quantization to behave like an arbitrary group parameter that requires no further fixing as its present standard form does. Here, we find that this can be naturally realized via conformal frame transformations in scalar-tensor gravity. Such a theory generally incorporates a dynamical scalar gravitational field and reduces to general relativity when the scalar field becomes a pure gauge. In particular, we introduce a conformal Einstein frame in which loop quantization is implemented. We then discuss how different Immirzi parameters under this description may be related by conformal frame transformations and yet share the same quantization having, for example, the same area gaps, modulated by the scalar gravitational field.

Double-winding Wilson loops in SU(N) Yang-Mills theory - A criterion for testing the confinement models -

NASA Astrophysics Data System (ADS)

Matsudo, Ryutaro; Kondo, Kei-Ichi; Shibata, Akihiro

2018-03-01

We examine how the average of double-winding Wilson loops depends on the number of color N in the SU(N) Yang-Mills theory. In the case where the two loops C1 and C2 are identical, we derive the exact operator relation which relates the doublewinding Wilson loop operator in the fundamental representation to that in the higher dimensional representations depending on N. By taking the average of the relation, we find that the difference-of-areas law for the area law falloff recently claimed for N = 2 is excluded for N ⩾ 3, provided that the string tension obeys the Casimir scaling for the higher representations. In the case where the two loops are distinct, we argue that the area law follows a novel law (N - 3)A1/(N - 1) + A2 with A1 and A2(A1 < A2) being the minimal areas spanned respectively by the loops C1 and C2, which is neither sum-ofareas (A1 + A2) nor difference-of-areas (A2 - A1) law when (N ⩾ 3). Indeed, this behavior can be confirmed in the two-dimensional SU(N) Yang-Mills theory exactly.

The AdS3 propagator and the fate of locality

NASA Astrophysics Data System (ADS)

Chen, Hongbin; Fitzpatrick, A. Liam; Kaplan, Jared; Li, Daliang

2018-04-01

We recently used Virasoro symmetry considerations to propose an exact formula for a bulk proto-field ϕ in AdS3. In this paper we study the propagator < ϕϕ>. We show that many techniques from the study of conformal blocks can be generalized to compute it, including the semiclassical monodromy method and both forms of the Zamolodchikov recursion relations. When the results from recursion are expanded at large central charge, they match gravitational perturbation theory for a free scalar field coupled to gravity in our chosen gauge. We find that although the propagator is finite and well-defined at long distances, its perturbative expansion in {G}_N=3/2c exhibits UV/IR mixing effects. If we nevertheless interpret < ϕϕ> as a probe of bulk locality, then when {G}_{N{m}_{φ }}≪ 1 locality breaks down at the new short-distance scale {σ}_{\\ast}˜ √[4]{G_N{R}_{AdS}^3} . For ϕ with very large bulk mass, or at small central charge, bulk locality fails at the AdS length scale. In all cases, locality `breakdown' manifests as singularities or branch cuts at spacelike separation arising from non-perturbative quantum gravitational effects.

Fast and simple high-capacity quantum cryptography with error detection

PubMed Central

Lai, Hong; Luo, Ming-Xing; Pieprzyk, Josef; Zhang, Jun; Pan, Lei; Li, Shudong; Orgun, Mehmet A.

2017-01-01

Quantum cryptography is commonly used to generate fresh secure keys with quantum signal transmission for instant use between two parties. However, research shows that the relatively low key generation rate hinders its practical use where a symmetric cryptography component consumes the shared key. That is, the security of the symmetric cryptography demands frequent rate of key updates, which leads to a higher consumption of the internal one-time-pad communication bandwidth, since it requires the length of the key to be as long as that of the secret. In order to alleviate these issues, we develop a matrix algorithm for fast and simple high-capacity quantum cryptography. Our scheme can achieve secure private communication with fresh keys generated from Fibonacci- and Lucas- valued orbital angular momentum (OAM) states for the seed to construct recursive Fibonacci and Lucas matrices. Moreover, the proposed matrix algorithm for quantum cryptography can ultimately be simplified to matrix multiplication, which is implemented and optimized in modern computers. Most importantly, considerably information capacity can be improved effectively and efficiently by the recursive property of Fibonacci and Lucas matrices, thereby avoiding the restriction of physical conditions, such as the communication bandwidth. PMID:28406240

Fast and simple high-capacity quantum cryptography with error detection.

PubMed

Lai, Hong; Luo, Ming-Xing; Pieprzyk, Josef; Zhang, Jun; Pan, Lei; Li, Shudong; Orgun, Mehmet A

2017-04-13

Quantum cryptography is commonly used to generate fresh secure keys with quantum signal transmission for instant use between two parties. However, research shows that the relatively low key generation rate hinders its practical use where a symmetric cryptography component consumes the shared key. That is, the security of the symmetric cryptography demands frequent rate of key updates, which leads to a higher consumption of the internal one-time-pad communication bandwidth, since it requires the length of the key to be as long as that of the secret. In order to alleviate these issues, we develop a matrix algorithm for fast and simple high-capacity quantum cryptography. Our scheme can achieve secure private communication with fresh keys generated from Fibonacci- and Lucas- valued orbital angular momentum (OAM) states for the seed to construct recursive Fibonacci and Lucas matrices. Moreover, the proposed matrix algorithm for quantum cryptography can ultimately be simplified to matrix multiplication, which is implemented and optimized in modern computers. Most importantly, considerably information capacity can be improved effectively and efficiently by the recursive property of Fibonacci and Lucas matrices, thereby avoiding the restriction of physical conditions, such as the communication bandwidth.

Fast and simple high-capacity quantum cryptography with error detection

NASA Astrophysics Data System (ADS)

Lai, Hong; Luo, Ming-Xing; Pieprzyk, Josef; Zhang, Jun; Pan, Lei; Li, Shudong; Orgun, Mehmet A.

2017-04-01

Quantum cryptography is commonly used to generate fresh secure keys with quantum signal transmission for instant use between two parties. However, research shows that the relatively low key generation rate hinders its practical use where a symmetric cryptography component consumes the shared key. That is, the security of the symmetric cryptography demands frequent rate of key updates, which leads to a higher consumption of the internal one-time-pad communication bandwidth, since it requires the length of the key to be as long as that of the secret. In order to alleviate these issues, we develop a matrix algorithm for fast and simple high-capacity quantum cryptography. Our scheme can achieve secure private communication with fresh keys generated from Fibonacci- and Lucas- valued orbital angular momentum (OAM) states for the seed to construct recursive Fibonacci and Lucas matrices. Moreover, the proposed matrix algorithm for quantum cryptography can ultimately be simplified to matrix multiplication, which is implemented and optimized in modern computers. Most importantly, considerably information capacity can be improved effectively and efficiently by the recursive property of Fibonacci and Lucas matrices, thereby avoiding the restriction of physical conditions, such as the communication bandwidth.

Application of recursive Gibbs-Appell formulation in deriving the equations of motion of N-viscoelastic robotic manipulators in 3D space using Timoshenko Beam Theory

NASA Astrophysics Data System (ADS)

Korayem, M. H.; Shafei, A. M.

2013-02-01

The goal of this paper is to describe the application of Gibbs-Appell (G-A) formulation and the assumed modes method to the mathematical modeling of N-viscoelastic link manipulators. The paper's focus is on obtaining accurate and complete equations of motion which encompass the most related structural properties of lightweight elastic manipulators. In this study, two important damping mechanisms, namely, the structural viscoelasticity (Kelvin-Voigt) effect (as internal damping) and the viscous air effect (as external damping) have been considered. To include the effects of shear and rotational inertia, the assumption of Timoshenko beam (TB) theory (TBT) has been applied. Gravity, torsion, and longitudinal elongation effects have also been included in the formulations. To systematically derive the equations of motion and improve the computational efficiency, a recursive algorithm has been used in the modeling of the system. In this algorithm, all the mathematical operations are carried out by only 3×3 and 3×1 matrices. Finally, a computational simulation for a manipulator with two elastic links is performed in order to verify the proposed method.

The robust model predictive control based on mixed H2/H∞ approach with separated performance formulations and its ISpS analysis

NASA Astrophysics Data System (ADS)

Li, Dewei; Li, Jiwei; Xi, Yugeng; Gao, Furong

2017-12-01

In practical applications, systems are always influenced by parameter uncertainties and external disturbance. Both the H2 performance and the H∞ performance are important for the real applications. For a constrained system, the previous designs of mixed H2/H∞ robust model predictive control (RMPC) optimise one performance with the other performance requirement as a constraint. But the two performances cannot be optimised at the same time. In this paper, an improved design of mixed H2/H∞ RMPC for polytopic uncertain systems with external disturbances is proposed to optimise them simultaneously. In the proposed design, the original uncertain system is decomposed into two subsystems by the additive character of linear systems. Two different Lyapunov functions are used to separately formulate the two performance indices for the two subsystems. Then, the proposed RMPC is designed to optimise both the two performances by the weighting method with the satisfaction of the H∞ performance requirement. Meanwhile, to make the design more practical, a simplified design is also developed. The recursive feasible conditions of the proposed RMPC are discussed and the closed-loop input state practical stable is proven. The numerical examples reflect the enlarged feasible region and the improved performance of the proposed design.

Coding tools investigation for next generation video coding based on HEVC

NASA Astrophysics Data System (ADS)

Chen, Jianle; Chen, Ying; Karczewicz, Marta; Li, Xiang; Liu, Hongbin; Zhang, Li; Zhao, Xin

2015-09-01

The new state-of-the-art video coding standard, H.265/HEVC, has been finalized in 2013 and it achieves roughly 50% bit rate saving compared to its predecessor, H.264/MPEG-4 AVC. This paper provides the evidence that there is still potential for further coding efficiency improvements. A brief overview of HEVC is firstly given in the paper. Then, our improvements on each main module of HEVC are presented. For instance, the recursive quadtree block structure is extended to support larger coding unit and transform unit. The motion information prediction scheme is improved by advanced temporal motion vector prediction, which inherits the motion information of each small block within a large block from a temporal reference picture. Cross component prediction with linear prediction model improves intra prediction and overlapped block motion compensation improves the efficiency of inter prediction. Furthermore, coding of both intra and inter prediction residual is improved by adaptive multiple transform technique. Finally, in addition to deblocking filter and SAO, adaptive loop filter is applied to further enhance the reconstructed picture quality. This paper describes above-mentioned techniques in detail and evaluates their coding performance benefits based on the common test condition during HEVC development. The simulation results show that significant performance improvement over HEVC standard can be achieved, especially for the high resolution video materials.

Effect of random vacancies on the electronic properties of graphene and T graphene: a theoretical approach

NASA Astrophysics Data System (ADS)

Sadhukhan, B.; Nayak, A.; Mookerjee, A.

2017-12-01

In this communication we present together four distinct techniques for the study of electronic structure of solids: the tight-binding linear muffin-tin orbitals, the real space and augmented space recursions and the modified exchange-correlation. Using this we investigate the effect of random vacancies on the electronic properties of the carbon hexagonal allotrope, graphene, and the non-hexagonal allotrope, planar T graphene. We have inserted random vacancies at different concentrations, to simulate disorder in pristine graphene and planar T graphene sheets. The resulting disorder, both on-site (diagonal disorder) as well as in the hopping integrals (off-diagonal disorder), introduces sharp peaks in the vicinity of the Dirac point built up from localized states for both hexagonal and non-hexagonal structures. These peaks become resonances with increasing vacancy concentration. We find that in presence of vacancies, graphene-like linear dispersion appears in planar T graphene and the cross points form a loop in the first Brillouin zone similar to buckled T graphene that originates from π and π* bands without regular hexagonal symmetry. We also calculate the single-particle relaxation time, τ (ěc {q}) of ěc {q} labeled quantum electronic states which originates from scattering due to presence of vacancies, causing quantum level broadening.

S-HARP: A parallel dynamic spectral partitioner

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

Sohn, A.; Simon, H.

1998-01-01

Computational science problems with adaptive meshes involve dynamic load balancing when implemented on parallel machines. This dynamic load balancing requires fast partitioning of computational meshes at run time. The authors present in this report a fast parallel dynamic partitioner, called S-HARP. The underlying principles of S-HARP are the fast feature of inertial partitioning and the quality feature of spectral partitioning. S-HARP partitions a graph from scratch, requiring no partition information from previous iterations. Two types of parallelism have been exploited in S-HARP, fine grain loop level parallelism and coarse grain recursive parallelism. The parallel partitioner has been implemented in Messagemore » Passing Interface on Cray T3E and IBM SP2 for portability. Experimental results indicate that S-HARP can partition a mesh of over 100,000 vertices into 256 partitions in 0.2 seconds on a 64 processor Cray T3E. S-HARP is much more scalable than other dynamic partitioners, giving over 15 fold speedup on 64 processors while ParaMeTiS1.0 gives a few fold speedup. Experimental results demonstrate that S-HARP is three to 10 times faster than the dynamic partitioners ParaMeTiS and Jostle on six computational meshes of size over 100,000 vertices.« less

TOPICAL REVIEW: Nonlinear aspects of the renormalization group flows of Dyson's hierarchical model

NASA Astrophysics Data System (ADS)

Meurice, Y.

2007-06-01

We review recent results concerning the renormalization group (RG) transformation of Dyson's hierarchical model (HM). This model can be seen as an approximation of a scalar field theory on a lattice. We introduce the HM and show that its large group of symmetry simplifies drastically the blockspinning procedure. Several equivalent forms of the recursion formula are presented with unified notations. Rigourous and numerical results concerning the recursion formula are summarized. It is pointed out that the recursion formula of the HM is inequivalent to both Wilson's approximate recursion formula and Polchinski's equation in the local potential approximation (despite the very small difference with the exponents of the latter). We draw a comparison between the RG of the HM and functional RG equations in the local potential approximation. The construction of the linear and nonlinear scaling variables is discussed in an operational way. We describe the calculation of non-universal critical amplitudes in terms of the scaling variables of two fixed points. This question appears as a problem of interpolation between these fixed points. Universal amplitude ratios are calculated. We discuss the large-N limit and the complex singularities of the critical potential calculable in this limit. The interpolation between the HM and more conventional lattice models is presented as a symmetry breaking problem. We briefly introduce models with an approximate supersymmetry. One important goal of this review is to present a configuration space counterpart, suitable for lattice formulations, of functional RG equations formulated in momentum space (often called exact RG equations and abbreviated ERGE).

Parallel tiled Nussinov RNA folding loop nest generated using both dependence graph transitive closure and loop skewing.

PubMed

Palkowski, Marek; Bielecki, Wlodzimierz

2017-06-02

RNA secondary structure prediction is a compute intensive task that lies at the core of several search algorithms in bioinformatics. Fortunately, the RNA folding approaches, such as the Nussinov base pair maximization, involve mathematical operations over affine control loops whose iteration space can be represented by the polyhedral model. Polyhedral compilation techniques have proven to be a powerful tool for optimization of dense array codes. However, classical affine loop nest transformations used with these techniques do not optimize effectively codes of dynamic programming of RNA structure predictions. The purpose of this paper is to present a novel approach allowing for generation of a parallel tiled Nussinov RNA loop nest exposing significantly higher performance than that of known related code. This effect is achieved due to improving code locality and calculation parallelization. In order to improve code locality, we apply our previously published technique of automatic loop nest tiling to all the three loops of the Nussinov loop nest. This approach first forms original rectangular 3D tiles and then corrects them to establish their validity by means of applying the transitive closure of a dependence graph. To produce parallel code, we apply the loop skewing technique to a tiled Nussinov loop nest. The technique is implemented as a part of the publicly available polyhedral source-to-source TRACO compiler. Generated code was run on modern Intel multi-core processors and coprocessors. We present the speed-up factor of generated Nussinov RNA parallel code and demonstrate that it is considerably faster than related codes in which only the two outer loops of the Nussinov loop nest are tiled.

STEREOSCOPIC OBSERVATION OF SLIPPING RECONNECTION IN A DOUBLE CANDLE-FLAME-SHAPED SOLAR FLARE

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

Gou, Tingyu; Liu, Rui; Wang, Yuming

2016-04-20

The 2011 January 28 M1.4 flare exhibits two side-by-side candle-flame-shaped flare loop systems underneath a larger cusp-shaped structure during the decay phase, as observed at the northwestern solar limb by the Solar Dynamics Observatory . The northern loop system brightens following the initiation of the flare within the southern loop system, but all three cusp-shaped structures are characterized by ∼10 MK temperatures, hotter than the arch-shaped loops underneath. The “Ahead” satellite of the Solar Terrestrial Relations Observatory provides a top view, in which the post-flare loops brighten sequentially, with one end fixed while the other apparently slipping eastward. By performingmore » stereoscopic reconstruction of the post-flare loops in EUV and mapping out magnetic connectivities, we found that the footpoints of the post-flare loops are slipping along the footprint of a hyperbolic flux tube (HFT) separating the two loop systems and that the reconstructed loops share similarity with the magnetic field lines that are traced starting from the same HFT footprint, where the field lines are relatively flexible. These results argue strongly in favor of slipping magnetic reconnection at the HFT. The slipping reconnection was likely triggered by the flare and manifested as propagative dimmings before the loop slippage is observed. It may contribute to the late-phase peak in Fe xvi 33.5 nm, which is even higher than its main-phase counterpart, and may also play a role in the density and temperature asymmetry observed in the northern loop system through heat conduction.« less

A social feedback loop for speech development and its reduction in autism.

PubMed

Warlaumont, Anne S; Richards, Jeffrey A; Gilkerson, Jill; Oller, D Kimbrough

2014-07-01

We analyzed the microstructure of child-adult interaction during naturalistic, daylong, automatically labeled audio recordings (13,836 hr total) of children (8- to 48-month-olds) with and without autism. We found that an adult was more likely to respond when the child's vocalization was speech related rather than not speech related. In turn, a child's vocalization was more likely to be speech related if the child's previous speech-related vocalization had received an immediate adult response rather than no response. Taken together, these results are consistent with the idea that there is a social feedback loop between child and caregiver that promotes speech development. Although this feedback loop applies in both typical development and autism, children with autism produced proportionally fewer speech-related vocalizations, and the responses they received were less contingent on whether their vocalizations were speech related. We argue that such differences will diminish the strength of the social feedback loop and have cascading effects on speech development over time. Differences related to socioeconomic status are also reported. © The Author(s) 2014.

Constructing increment-decrement life tables.

PubMed

Schoen, R

1975-05-01

A life table model which can recognize increments (or entrants) as well as decrements has proven to be of considerable value in the analysis of marital status patterns, labor force participation patterns, and other areas of substantive interest. Nonetheless, relatively little work has been done on the methodology of increment-decrement (or combined) life tables. The present paper reviews the general, recursive solution of Schoen and Nelson (1974), develops explicit solutions for three cases of particular interest, and compares alternative approaches to the construction of increment-decrement tables.

Efficient dynamic optimization of logic programs

NASA Technical Reports Server (NTRS)

Laird, Phil

1992-01-01

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

Superresolution restoration of an image sequence: adaptive filtering approach.

PubMed

Elad, M; Feuer, A

1999-01-01

This paper presents a new method based on adaptive filtering theory for superresolution restoration of continuous image sequences. The proposed methodology suggests least squares (LS) estimators which adapt in time, based on adaptive filters, least mean squares (LMS) or recursive least squares (RLS). The adaptation enables the treatment of linear space and time-variant blurring and arbitrary motion, both of them assumed known. The proposed new approach is shown to be of relatively low computational requirements. Simulations demonstrating the superresolution restoration algorithms are presented.

Early symptom burden predicts recovery after sport-related concussion

PubMed Central

Mannix, Rebekah; Monuteaux, Michael C.; Stein, Cynthia J.; Bachur, Richard G.

2014-01-01

Objective: To identify independent predictors of and use recursive partitioning to develop a multivariate regression tree predicting symptom duration greater than 28 days after a sport-related concussion. Methods: We conducted a prospective cohort study of patients in a sports concussion clinic. Participants completed questionnaires that included the Post-Concussion Symptom Scale (PCSS). Participants were asked to record the date on which they last experienced symptoms. Potential predictor variables included age, sex, score on symptom inventories, history of prior concussions, performance on computerized neurocognitive assessments, loss of consciousness and amnesia at the time of injury, history of prior medical treatment for headaches, history of migraines, and family history of concussion. We used recursive partitioning analysis to develop a multivariate prediction model for identifying athletes at risk for a prolonged recovery from concussion. Results: A total of 531 patients ranged in age from 7 to 26 years (mean 14.6 ± 2.9 years). The mean PCSS score at the initial visit was 26 ± 26; mean time to presentation was 12 ± 5 days. Only total score on symptom inventory was independently associated with symptoms lasting longer than 28 days (adjusted odds ratio 1.044; 95% confidence interval [CI] 1.034, 1.054 for PCSS). No other potential predictor variables were independently associated with symptom duration or useful in developing the optimal regression decision tree. Most participants (86%; 95% CI 80%, 90%) with an initial PCSS score of <13 had resolution of their symptoms within 28 days of injury. Conclusions: The only independent predictor of prolonged symptoms after sport-related concussion is overall symptom burden. PMID:25381296

Early symptom burden predicts recovery after sport-related concussion.

PubMed

Meehan, William P; Mannix, Rebekah; Monuteaux, Michael C; Stein, Cynthia J; Bachur, Richard G

2014-12-09

To identify independent predictors of and use recursive partitioning to develop a multivariate regression tree predicting symptom duration greater than 28 days after a sport-related concussion. We conducted a prospective cohort study of patients in a sports concussion clinic. Participants completed questionnaires that included the Post-Concussion Symptom Scale (PCSS). Participants were asked to record the date on which they last experienced symptoms. Potential predictor variables included age, sex, score on symptom inventories, history of prior concussions, performance on computerized neurocognitive assessments, loss of consciousness and amnesia at the time of injury, history of prior medical treatment for headaches, history of migraines, and family history of concussion. We used recursive partitioning analysis to develop a multivariate prediction model for identifying athletes at risk for a prolonged recovery from concussion. A total of 531 patients ranged in age from 7 to 26 years (mean 14.6 ± 2.9 years). The mean PCSS score at the initial visit was 26 ± 26; mean time to presentation was 12 ± 5 days. Only total score on symptom inventory was independently associated with symptoms lasting longer than 28 days (adjusted odds ratio 1.044; 95% confidence interval [CI] 1.034, 1.054 for PCSS). No other potential predictor variables were independently associated with symptom duration or useful in developing the optimal regression decision tree. Most participants (86%; 95% CI 80%, 90%) with an initial PCSS score of <13 had resolution of their symptoms within 28 days of injury. The only independent predictor of prolonged symptoms after sport-related concussion is overall symptom burden. © 2014 American Academy of Neurology.

Phase Response Design of Recursive All-Pass Digital Filters Using a Modified PSO Algorithm

PubMed Central

2015-01-01

This paper develops a new design scheme for the phase response of an all-pass recursive digital filter. A variant of particle swarm optimization (PSO) algorithm will be utilized for solving this kind of filter design problem. It is here called the modified PSO (MPSO) algorithm in which another adjusting factor is more introduced in the velocity updating formula of the algorithm in order to improve the searching ability. In the proposed method, all of the designed filter coefficients are firstly collected to be a parameter vector and this vector is regarded as a particle of the algorithm. The MPSO with a modified velocity formula will force all particles into moving toward the optimal or near optimal solution by minimizing some defined objective function of the optimization problem. To show the effectiveness of the proposed method, two different kinds of linear phase response design examples are illustrated and the general PSO algorithm is compared as well. The obtained results show that the MPSO is superior to the general PSO for the phase response design of digital recursive all-pass filter. PMID:26366168

Atmospheric turbulence simulation for Shuttle orbiter

NASA Technical Reports Server (NTRS)

Tatom, F. B.; Smith, S. R.

1979-01-01

An improved non-recursive model for atmospheric turbulence along the flight path of the Shuttle Orbiter is developed which provides for simulation of instantaneous vertical and horizontal gusts at the vehicle center-of-gravity, and also for simulation of instantaneous gust gradients. Based on this model the time series for both gusts and gust gradients are generated and stored on a series of magnetic tapes. Section 2 provides a description of the various technical considerations associated with the turbulence simulation model. Included in this section are descriptions of the digital filter simulation model, the von Karman spectra with finite upper limits, and the final non recursive turbulence simulation model which was used to generate the time series. Section 2 provides a description of the various technical considerations associated with the turbulence simulation model. Included in this section are descriptions of the digial filter simulation model, the von Karman spectra with finite upper limits, and the final non recursive turbulence simulation model which was used to generate the time series. Section 3 provides a description of the time series as currently recorded on magnetic tape. Conclusions and recommendations are presented in Section 4.

Stability of recursive out-of-sequence measurement filters: an open problem

NASA Astrophysics Data System (ADS)

Chen, Lingji; Moshtagh, Nima; Mehra, Raman K.

2011-06-01

In many applications where communication delays are present, measurements with earlier time stamps can arrive out-of-sequence, i.e., after state estimates have been obtained for the current time instant. To incorporate such an Out-Of-Sequence Measurement (OOSM), many algorithms have been proposed in the literature to obtain or approximate the optimal estimate that would have been obtained if the OOSM had arrived in-sequence. When OOSM occurs repeatedly, approximate estimations as a result of incorporating one OOSM have to serve as the basis for incorporating yet another OOSM. The question of whether the "approximation of approximation" is well behaved, i.e., whether approximation errors accumulate in a recursive setting, has not been adequately addressed in the literature. This paper draws attention to the stability question of recursive OOSM processing filters, formulates the problem in a specific setting, and presents some simulation results that suggest that such filters are indeed well-behaved. Our hope is that more research will be conducted in the future to rigorously establish stability properties of these filters.

Toward quantitative estimation of material properties with dynamic mode atomic force microscopy: a comparative study.

PubMed

Ghosal, Sayan; Gannepalli, Anil; Salapaka, Murti

2017-08-11

In this article, we explore methods that enable estimation of material properties with the dynamic mode atomic force microscopy suitable for soft matter investigation. The article presents the viewpoint of casting the system, comprising of a flexure probe interacting with the sample, as an equivalent cantilever system and compares a steady-state analysis based method with a recursive estimation technique for determining the parameters of the equivalent cantilever system in real time. The steady-state analysis of the equivalent cantilever model, which has been implicitly assumed in studies on material property determination, is validated analytically and experimentally. We show that the steady-state based technique yields results that quantitatively agree with the recursive method in the domain of its validity. The steady-state technique is considerably simpler to implement, however, slower compared to the recursive technique. The parameters of the equivalent system are utilized to interpret storage and dissipative properties of the sample. Finally, the article identifies key pitfalls that need to be avoided toward the quantitative estimation of material properties.

Wilson loops in supersymmetric gauge theories

NASA Astrophysics Data System (ADS)

Pestun, Vasily

This thesis is devoted to several exact computations in four-dimensional supersymmetric gauge field theories. In the first part of the thesis we prove conjecture due to Erickson-Semenoff-Zarembo and Drukker-Gross which relates supersymmetric circular Wilson loop operators in the N = 4 supersymmetric Yang-Mills theory with a Gaussian matrix model. We also compute the partition function and give a new matrix model formula for the expectation value of a supersymmetric circular Wilson loop operator for the pure N = 2 and the N* = 2 supersymmetric Yang-Mills theory on a four-sphere. Circular supersymmetric Wilson loops in four-dimensional N = 2 superconformal gauge theory are treated similarly. In the second part we consider supersymmetric Wilson loops of arbitrary shape restricted to a two-dimensional sphere in the four-dimensional N = 4 supersymmetric Yang-Mills theory. We show that expectation value for these Wilson loops can be exactly computed using a two-dimensional theory closely related to the topological two-dimensional Higgs-Yang-Mills theory, or two-dimensional Yang-Mills theory for the complexified gauge group.

Extension of loop quantum gravity to f(R) theories.

PubMed

Zhang, Xiangdong; Ma, Yongge

2011-04-29

The four-dimensional metric f(R) theories of gravity are cast into connection-dynamical formalism with real su(2) connections as configuration variables. Through this formalism, the classical metric f(R) theories are quantized by extending the loop quantization scheme of general relativity. Our results imply that the nonperturbative quantization procedure of loop quantum gravity is valid not only for general relativity but also for a rather general class of four-dimensional metric theories of gravity.

Chiral topological insulating phases from three-dimensional nodal loop semimetals

NASA Astrophysics Data System (ADS)

Li, Linhu; Yin, Chuanhao; Chen, Shu; Araujo, Miguel

We begin with a minimal model of three-dimensional nodal loop semimetals, and study the effect of anticommuting gap terms. The resulting topological insulating phases are protected by a chiral symmetry, and can be characterized by a winding number defined along the nodal loop. We illustrate the geometric relation between the nodal loop and the gap terms, which has a correspondence to the nodal loop winding number. We further investigate a lattice model and study its edge states under open boundary condition. The edge states hold Dirac cones with the same number as the summation of the winding numbers of each nodal loop in the first Brillouin zone.

Multivariable adaptive closed-loop control of an artificial pancreas without meal and activity announcement.

PubMed

Turksoy, Kamuran; Bayrak, Elif Seyma; Quinn, Lauretta; Littlejohn, Elizabeth; Cinar, Ali

2013-05-01

Accurate closed-loop control is essential for developing artificial pancreas (AP) systems that adjust insulin infusion rates from insulin pumps. Glucose concentration information from continuous glucose monitoring (CGM) systems is the most important information for the control system. Additional physiological measurements can provide valuable information that can enhance the accuracy of the control system. Proportional-integral-derivative control and model predictive control have been popular in AP development. Their implementations to date rely on meal announcements (e.g., bolus insulin dose based on insulin:carbohydrate ratios) by the user. Adaptive control techniques provide a powerful alternative that do not necessitate any meal or activity announcements. Adaptive control systems based on the generalized predictive control framework are developed by extending the recursive modeling techniques. Physiological signals such as energy expenditure and galvanic skin response are used along with glucose measurements to generate a multiple-input-single-output model for predicting future glucose concentrations used by the controller. Insulin-on-board (IOB) is also estimated and used in control decisions. The controllers were tested with clinical studies that include seven cases with three different patients with type 1 diabetes for 32 or 60 h without any meal or activity announcements. The adaptive control system kept glucose concentration in the normal preprandial and postprandial range (70-180 mg/dL) without any meal or activity announcements during the test period. After IOB estimation was added to the control system, mild hypoglycemic episodes were observed only in one of the four experiments. This was reflected in a plasma glucose value of 56 mg/dL (YSI 2300 STAT; Yellow Springs Instrument, Yellow Springs, OH) and a CGM value of 63 mg/dL). Regulation of blood glucose concentration with an AP using adaptive control techniques was successful in clinical studies, even without any meal and physical activity announcement.

Recurrence relations in one-dimensional Ising models.

PubMed

da Conceição, C M Silva; Maia, R N P

2017-09-01

The exact finite-size partition function for the nonhomogeneous one-dimensional (1D) Ising model is found through an approach using algebra operators. Specifically, in this paper we show that the partition function can be computed through a trace from a linear second-order recurrence relation with nonconstant coefficients in matrix form. A relation between the finite-size partition function and the generalized Lucas polynomials is found for the simple homogeneous model, thus establishing a recursive formula for the partition function. This is an important property and it might indicate the possible existence of recurrence relations in higher-dimensional Ising models. Moreover, assuming quenched disorder for the interactions within the model, the quenched averaged magnetic susceptibility displays a nontrivial behavior due to changes in the ferromagnetic concentration probability.

Inverse spin Hall effect in a closed loop circuit

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

Omori, Y.; Auvray, F.; Wakamura, T.

We present measurements of inverse spin Hall effects (ISHEs), in which the conversion of a spin current into a charge current via the ISHE is detected not as a voltage in a standard open circuit but directly as the charge current generated in a closed loop. The method is applied to the ISHEs of Bi-doped Cu and Pt. The derived expression of ISHE for the loop structure can relate the charge current flowing into the loop to the spin Hall angle of the SHE material and the resistance of the loop.

The diversity of H3 loops determines the antigen-binding tendencies of antibody CDR loops.

PubMed

Tsuchiya, Yuko; Mizuguchi, Kenji

2016-04-01

Of the complementarity-determining regions (CDRs) of antibodies, H3 loops, with varying amino acid sequences and loop lengths, adopt particularly diverse loop conformations. The diversity of H3 conformations produces an array of antigen recognition patterns involving all the CDRs, in which the residue positions actually in contact with the antigen vary considerably. Therefore, for a deeper understanding of antigen recognition, it is necessary to relate the sequence and structural properties of each residue position in each CDR loop to its ability to bind antigens. In this study, we proposed a new method for characterizing the structural features of the CDR loops and obtained the antigen-binding ability of each residue position in each CDR loop. This analysis led to a simple set of rules for identifying probable antigen-binding residues. We also found that the diversity of H3 loop lengths and conformations affects the antigen-binding tendencies of all the CDR loops. © 2016 The Protein Society.

Multichannel signal enhancement

DOEpatents

Lewis, Paul S.

1990-01-01

A mixed adaptive filter is formulated for the signal processing problem where desired a priori signal information is not available. The formulation generates a least squares problem which enables the filter output to be calculated directly from an input data matrix. In one embodiment, a folded processor array enables bidirectional data flow to solve the recursive problem by back substitution without global communications. In another embodiment, a balanced processor array solves the recursive problem by forward elimination through the array. In a particular application to magnetoencephalography, the mixed adaptive filter enables an evoked response to an auditory stimulus to be identified from only a single trial.

System Simulation by Recursive Feedback: Coupling A Set of Stand-Alone Subsystem Simulations

NASA Technical Reports Server (NTRS)

Nixon, Douglas D.; Hanson, John M. (Technical Monitor)

2002-01-01

Recursive feedback is defined and discussed as a framework for development of specific algorithms and procedures that propagate the time-domain solution for a dynamical system simulation consisting of multiple numerically coupled self-contained stand-alone subsystem simulations. A satellite motion example containing three subsystems (other dynamics, attitude dynamics, and aerodynamics) has been defined and constructed using this approach. Conventional solution methods are used in the subsystem simulations. Centralized and distributed versions of coupling structure have been addressed. Numerical results are evaluated by direct comparison with a standard total-system simultaneous-solution approach.

Harnessing molecular excited states with Lanczos chains.

PubMed

Baroni, Stefano; Gebauer, Ralph; Bariş Malcioğlu, O; Saad, Yousef; Umari, Paolo; Xian, Jiawei

2010-02-24

The recursion method of Haydock, Heine and Kelly is a powerful tool for calculating diagonal matrix elements of the resolvent of quantum-mechanical Hamiltonian operators by elegantly expressing them in terms of continued fractions. In this paper we extend the recursion method to off-diagonal matrix elements of general (possibly non-Hermitian) operators and apply it to the simulation of molecular optical absorption and photoemission spectra within time-dependent density-functional and many-body perturbation theories, respectively. This method is demonstrated with a couple of applications to the optical absorption and photoemission spectra of the caffeine molecule.

Painlevé equations, topological type property and reconstruction by the topological recursion

NASA Astrophysics Data System (ADS)

Iwaki, K.; Marchal, O.; Saenz, A.

2018-01-01

In this article we prove that Lax pairs associated with ħ-dependent six Painlevé equations satisfy the topological type property proposed by Bergère, Borot and Eynard for any generic choice of the monodromy parameters. Consequently we show that one can reconstruct the formal ħ-expansion of the isomonodromic τ-function and of the determinantal formulas by applying the so-called topological recursion to the spectral curve attached to the Lax pair in all six Painlevé cases. Finally we illustrate the former results with the explicit computations of the first orders of the six τ-functions.

Analytical recursive method to ascertain multisite entanglement in doped quantum spin ladders

NASA Astrophysics Data System (ADS)

Roy, Sudipto Singha; Dhar, Himadri Shekhar; Rakshit, Debraj; SenDe, Aditi; Sen, Ujjwal

2017-08-01

We formulate an analytical recursive method to generate the wave function of doped short-range resonating valence bond (RVB) states as a tool to efficiently estimate multisite entanglement as well as other physical quantities in doped quantum spin ladders. We prove that doped RVB ladder states are always genuine multipartite entangled. Importantly, our results show that within specific doping concentration and model parameter regimes, the doped RVB state essentially characterizes the trends of genuine multiparty entanglement in the exact ground states of the Hubbard model with large on-site interactions, in the limit that yields the t -J Hamiltonian.

Computer simulation results of attitude estimation of earth orbiting satellites

NASA Technical Reports Server (NTRS)

Kou, S. R.

1976-01-01

Computer simulation results of attitude estimation of Earth-orbiting satellites (including Space Telescope) subjected to environmental disturbances and noises are presented. Decomposed linear recursive filter and Kalman filter were used as estimation tools. Six programs were developed for this simulation, and all were written in the basic language and were run on HP 9830A and HP 9866A computers. Simulation results show that a decomposed linear recursive filter is accurate in estimation and fast in response time. Furthermore, for higher order systems, this filter has computational advantages (i.e., less integration errors and roundoff errors) over a Kalman filter.

Harnessing molecular excited states with Lanczos chains

NASA Astrophysics Data System (ADS)

Baroni, Stefano; Gebauer, Ralph; Bariş Malcioğlu, O.; Saad, Yousef; Umari, Paolo; Xian, Jiawei

2010-02-01

The recursion method of Haydock, Heine and Kelly is a powerful tool for calculating diagonal matrix elements of the resolvent of quantum-mechanical Hamiltonian operators by elegantly expressing them in terms of continued fractions. In this paper we extend the recursion method to off-diagonal matrix elements of general (possibly non-Hermitian) operators and apply it to the simulation of molecular optical absorption and photoemission spectra within time-dependent density-functional and many-body perturbation theories, respectively. This method is demonstrated with a couple of applications to the optical absorption and photoemission spectra of the caffeine molecule.

Least square neural network model of the crude oil blending process.

PubMed

Rubio, José de Jesús

2016-06-01

In this paper, the recursive least square algorithm is designed for the big data learning of a feedforward neural network. The proposed method as the combination of the recursive least square and feedforward neural network obtains four advantages over the alone algorithms: it requires less number of regressors, it is fast, it has the learning ability, and it is more compact. Stability, convergence, boundedness of parameters, and local minimum avoidance of the proposed technique are guaranteed. The introduced strategy is applied for the modeling of the crude oil blending process. Copyright © 2016 Elsevier Ltd. All rights reserved.

Chandrasekhar-type algorithms for fast recursive estimation in linear systems with constant parameters

NASA Technical Reports Server (NTRS)

Choudhury, A. K.; Djalali, M.

1975-01-01

In this recursive method proposed, the gain matrix for the Kalman filter and the convariance of the state vector are computed not via the Riccati equation, but from certain other equations. These differential equations are of Chandrasekhar-type. The 'invariant imbedding' idea resulted in the reduction of the basic boundary value problem of transport theory to an equivalent initial value system, a significant computational advance. Initial value experience showed that there is some computational savings in the method and the loss of positive definiteness of the covariance matrix is less vulnerable.

Heptagons from the Steinmann cluster bootstrap

DOE PAGES

Dixon, Lance J.; Drummond, James; Harrington, Thomas; ...

2017-02-28

We reformulate the heptagon cluster bootstrap to take advantage of the Steinmann relations, which require certain double discontinuities of any amplitude to vanish. These constraints vastly reduce the number of functions needed to bootstrap seven-point amplitudes in planarmore » $$ \\mathcal{N} $$ = 4 supersymmetric Yang-Mills theory, making higher-loop contributions to these amplitudes more computationally accessible. In particular, dual superconformal symmetry and well-defined collinear limits suffice to determine uniquely the symbols of the three-loop NMHV and four-loop MHV seven-point amplitudes. We also show that at three loops, relaxing the dual superconformal $$\\bar{Q}$$ relations and imposing dihedral symmetry (and for NMHV the absence of spurious poles) leaves only a single ambiguity in the heptagon amplitudes. These results point to a strong tension between the collinear properties of the amplitudes and the Steinmann relations.« less

Proposal for extension of ORSA to include phasing in to prove successive encounters of an asteroid between Earth and Mars

NASA Astrophysics Data System (ADS)

Jolitz, Benjamin

Ben Jolitz 2/6/10 Proposal for extension of ORSA to include phasing in to prove successive encounters of an asteroid between Earth and Mars Phasing is the act of changing the phase angle between two sinusoidal functions. In the case of orbits, which are ellipses drawn by sinusoidal functions, phasing is the act of matching one orbit to another. Finding the phasing parameters of a captured asteroid, a non-Keplarian object, in a resonant bi-elliptic orbit and simulation thereof is rather difficult without specialized and esoteric applications. However, open source in the last ten years has made incredible advance-ments, and some projects originally designed for orbital reconstruction have been released to the public on an AS IS basis; one such project is ORSA -Orbital Reconstruction, Simulation, Analysis. ORSA, however, does not have methods for evaluating the relative changes to a phase angle of a bi-elliptic orbit in a recursive manner for successive encounters. For years, space shuttles and other celestial transport vessels have been faced with the difficulty of docking with the International Space Station, a task which involves matching the craft to the unique elliptical orbit of the ISS such that the shuttle will meet the ISS with the appropriate orbital parameters. However, calculation of such requires consideration of only the Earth and it's effect on rather small, man-made objects. In electrical engineering, the concept of a phase lock loop is used to match the frequency and phase of a controlled oscillator with a given set of input signals. In our test case, we wish compute the successive bi-elliptic half orbits of a captured asteroid that traverses between Earth and Mars using gravitational interactions with the intent of computing the relative phase angle between the desired half orbit and current orbit such that a timed encounter with Earth or Mars is possible. The goal of this proposal is to extend ORSA to maintain relative phase angle between bi-elliptic orbits for successive encounters.

Analysis and application of a velocity command motor as a reaction mass actuator

NASA Technical Reports Server (NTRS)

Sulla, Jeffrey L.; Juang, Jer-Nan; Horta, Lucas G.

1990-01-01

A commercially available linear stepper motor is applied as a reaction mass (RM) actuator. With the actuator operating in the (RM) relative-velocity command mode, open-loop and closed-loop testing is performed to determine operational limits. With the actuator mounted on a simple beam structure, root strain, RM acceleration, or beam acceleration is used in the feedback loop to augment the structural damping. The RM relative position is also used as feedback to ensure that the RM remains centered.

Digital second-order phase-locked loop

NASA Technical Reports Server (NTRS)

Holmes, J. K.; Carl, C. C.; Tagnelia, C. R.

1975-01-01

Actual tests with second-order digital phase-locked loop at simulated relative Doppler shift of 1x0.0001 produced phase lock with timing error of 6.5 deg and no appreciable Doppler bias. Loop thus appears to achieve subcarrier synchronization and to remove bias due to Doppler shift in range of interest.

A study of digital gyro compensation loops. [data conversion routines and breadboard models

NASA Technical Reports Server (NTRS)

1975-01-01

The feasibility is discussed of replacing existing state-of-the-art analog gyro compensation loops with digital computations. This was accomplished by designing appropriate compensation loops for the dry turned TDF gyro, selecting appropriate data conversion and processing techniques and algorithms, and breadboarding the design for laboratory evaluation. A breadboard design was established in which one axis of a Teledyne turned-gimbal TDF gyro was caged digitally while the other was caged using conventional analog electronics. The digital loop was designed analytically to closely resemble the analog loop in performance. The breadboard was subjected to various static and dynamic tests in order to establish the relative stability characteristics and frequency responses of the digital and analog loops. Several variations of the digital loop configuration were evaluated. The results were favorable.

Isolated and coupled superquadric loop antennas for mobile communications applications

NASA Technical Reports Server (NTRS)

Jensen, Michael A.; Rahmat-Samii, Yahya

1993-01-01

This work provides an investigation of the performance of loop antennas for use in mobile communications applications. The analysis tools developed allow for high flexibility by representing the loop antenna as a superquadric curve, which includes the case of circular, elliptical, and rectangular loops. The antenna may be in an isolated environment, located above an infinite ground plane, or placed near a finite conducting plate or box. In cases where coupled loops are used, the two loops may have arbitrary relative positions and orientations. Several design examples are included to illustrate the versatility of the analysis capabilities. The performance of coupled loops arranged in a diversity scheme is also evaluated, and it is found that high diversity gain can be achieved even when the antennas are closely spaced.

Noncoherent pseudonoise code tracking performance of spread spectrum receivers

NASA Technical Reports Server (NTRS)

Simon, M. K.

1977-01-01

The optimum design and performance of two noncoherent PN tracking loop configurations, namely, the delay-locked loop and tau-dither loop, are described. In particular, the bandlimiting effects of the bandpass arm filters are considered by demonstrating that for a fixed data rate and data signal-to-noise ratio, there exists an optimum filter bandwidth in the sense of minimizing the loop's tracking jitter. Both the linear and nonlinear loop analyses are presented, and the region of validity of the former relative to the latter is indicated. In addition, numerical results are given for several filter types. For example, assuming ideal bandpass arm filters, it is shown that the tau-dither loop requires approximately 1 dB more signal-to-noise ratio than the delay-locked loop for equal rms tracking jitters.