An offline approach for output-only Bayesian identification of stochastic nonlinear systems using unscented Kalman filtering

NASA Astrophysics Data System (ADS)

Erazo, Kalil; Nagarajaiah, Satish

2017-06-01

In this paper an offline approach for output-only Bayesian identification of stochastic nonlinear systems is presented. The approach is based on a re-parameterization of the joint posterior distribution of the parameters that define a postulated state-space stochastic model class. In the re-parameterization the state predictive distribution is included, marginalized, and estimated recursively in a state estimation step using an unscented Kalman filter, bypassing state augmentation as required by existing online methods. In applications expectations of functions of the parameters are of interest, which requires the evaluation of potentially high-dimensional integrals; Markov chain Monte Carlo is adopted to sample the posterior distribution and estimate the expectations. The proposed approach is suitable for nonlinear systems subjected to non-stationary inputs whose realization is unknown, and that are modeled as stochastic processes. Numerical verification and experimental validation examples illustrate the effectiveness and advantages of the approach, including: (i) an increased numerical stability with respect to augmented-state unscented Kalman filtering, avoiding divergence of the estimates when the forcing input is unmeasured; (ii) the ability to handle arbitrary prior and posterior distributions. The experimental validation of the approach is conducted using data from a large-scale structure tested on a shake table. It is shown that the approach is robust to inherent modeling errors in the description of the system and forcing input, providing accurate prediction of the dynamic response when the excitation history is unknown.

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.

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 new Bayesian recursive technique for parameter estimation

NASA Astrophysics Data System (ADS)

Kaheil, Yasir H.; Gill, M. Kashif; McKee, Mac; Bastidas, Luis

2006-08-01

The performance of any model depends on how well its associated parameters are estimated. In the current application, a localized Bayesian recursive estimation (LOBARE) approach is devised for parameter estimation. The LOBARE methodology is an extension of the Bayesian recursive estimation (BARE) method. It is applied in this paper on two different types of models: an artificial intelligence (AI) model in the form of a support vector machine (SVM) application for forecasting soil moisture and a conceptual rainfall-runoff (CRR) model represented by the Sacramento soil moisture accounting (SAC-SMA) model. Support vector machines, based on statistical learning theory (SLT), represent the modeling task as a quadratic optimization problem and have already been used in various applications in hydrology. They require estimation of three parameters. SAC-SMA is a very well known model that estimates runoff. It has a 13-dimensional parameter space. In the LOBARE approach presented here, Bayesian inference is used in an iterative fashion to estimate the parameter space that will most likely enclose a best parameter set. This is done by narrowing the sampling space through updating the "parent" bounds based on their fitness. These bounds are actually the parameter sets that were selected by BARE runs on subspaces of the initial parameter space. The new approach results in faster convergence toward the optimal parameter set using minimum training/calibration data and fewer sets of parameter values. The efficacy of the localized methodology is also compared with the previously used BARE algorithm.

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.

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.

ReHypar: A Recursive Hybrid Chunk Partitioning Method Using NAND-Flash Memory SSD

PubMed Central

Park, Sung-Soon; Lim, Cheol-Su

2014-01-01

Due to the rapid development of flash memory, SSD is considered to be the replacement of HDD in the storage market. Although SSD retains several promising characteristics, such as high random I/O performance and nonvolatility, its high expense per capacity is the main obstacle in replacing HDD in all storage solutions. An alternative is to provide a hybrid structure where a small portion of SSD address space is combined with the much larger HDD address space. In such a structure, maximizing the space utilization of SSD in a cost-effective way is extremely important to generate high I/O performance. We developed ReHypar (recursive hybrid chunk partitioning) that enables improving the space utilization of SSD in the hybrid structure. The first objective of ReHypar is to mitigate the fragmentation overhead of SSD address space, by reusing the remaining free space of I/O units as much as possible. Furthermore, ReHypar allows defining several, logical data sections in SSD address space, with each of those sections being configured with the different I/O unit. We integrated ReHypar with ext2 and ext4 and evaluated it using two public benchmarks including IOzone and Postmark. PMID:24987741

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.

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.

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.

Adaptive control of large space structures using recursive lattice filters

NASA Technical Reports Server (NTRS)

Sundararajan, N.; Goglia, G. L.

1985-01-01

The use of recursive lattice filters for identification and adaptive control of large space structures is studied. Lattice filters were used to identify the structural dynamics model of the flexible structures. This identification 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 is control engaged. This type of validation scheme prevents instability when the overall loop is closed. Another important area of research, namely that of robust controller synthesis, was investigated using frequency domain multivariable controller synthesis methods. The method uses the Linear Quadratic Guassian/Loop Transfer Recovery (LQG/LTR) approach to ensure stability against unmodeled higher frequency modes and achieves the desired performance.

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

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.

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.

Stockholder projector analysis: A Hilbert-space partitioning of the molecular one-electron density matrix with orthogonal projectors

NASA Astrophysics Data System (ADS)

Vanfleteren, Diederik; Van Neck, Dimitri; Bultinck, Patrick; Ayers, Paul W.; Waroquier, Michel

2012-01-01

A previously introduced partitioning of the molecular one-electron density matrix over atoms and bonds [D. Vanfleteren et al., J. Chem. Phys. 133, 231103 (2010)] is investigated in detail. Orthogonal projection operators are used to define atomic subspaces, as in Natural Population Analysis. The orthogonal projection operators are constructed with a recursive scheme. These operators are chemically relevant and obey a stockholder principle, familiar from the Hirshfeld-I partitioning of the electron density. The stockholder principle is extended to density matrices, where the orthogonal projectors are considered to be atomic fractions of the summed contributions. All calculations are performed as matrix manipulations in one-electron Hilbert space. Mathematical proofs and numerical evidence concerning this recursive scheme are provided in the present paper. The advantages associated with the use of these stockholder projection operators are examined with respect to covalent bond orders, bond polarization, and transferability.

Open-Ended Recursive Approach for the Calculation of Multiphoton Absorption Matrix Elements

PubMed Central

2015-01-01

We present an implementation of single residues for response functions to arbitrary order using a recursive approach. Explicit expressions in terms of density-matrix-based response theory for the single residues of the linear, quadratic, cubic, and quartic response functions are also presented. These residues correspond to one-, two-, three- and four-photon transition matrix elements. The newly developed code is used to calculate the one-, two-, three- and four-photon absorption cross sections of para-nitroaniline and para-nitroaminostilbene, making this the first treatment of four-photon absorption in the framework of response theory. We find that the calculated multiphoton absorption cross sections are not very sensitive to the size of the basis set as long as a reasonably large basis set with diffuse functions is used. The choice of exchange–correlation functional, however, significantly affects the calculated cross sections of both charge-transfer transitions and other transitions, in particular, for the larger para-nitroaminostilbene molecule. We therefore recommend the use of a range-separated exchange–correlation functional in combination with the augmented correlation-consistent double-ζ basis set aug-cc-pVDZ for the calculation of multiphoton absorption properties. PMID:25821415

Application of the Feynman-tree theorem together with BCFW recursion relations

NASA Astrophysics Data System (ADS)

Maniatis, M.

2018-03-01

Recently, it has been shown that on-shell scattering amplitudes can be constructed by the Feynman-tree theorem combined with the BCFW recursion relations. Since the BCFW relations are restricted to tree diagrams, the preceding application of the Feynman-tree theorem is essential. In this way, amplitudes can be constructed by on-shell and gauge-invariant tree amplitudes. Here, we want to apply this method to the electron-photon vertex correction. We present all the single, double, and triple phase-space tensor integrals explicitly and show that the sum of amplitudes coincides with the result of the conventional calculation of a virtual loop correction.

Multiple Identities, Negotiations, and Agency across Time and Space: A Narrative Inquiry of a Foreign Language Teacher Candidate

ERIC Educational Resources Information Center

Kayi-Aydar, Hayriye

2015-01-01

Drawing on the post-structural views and the literature on teacher identity and agency, and using narrative inquiry, this paper describes how one teacher candidate majoring in Spanish negotiated her identities across time and space and how her identity negotiations interacted with her agency. The recursive analysis of qualitative data sources…

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.

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

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.

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.

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.

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.

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.

Recursively constructing analytic expressions for equilibrium distributions of stochastic biochemical reaction networks.

PubMed

Meng, X Flora; Baetica, Ania-Ariadna; Singhal, Vipul; Murray, Richard M

2017-05-01

Noise is often indispensable to key cellular activities, such as gene expression, necessitating the use of stochastic models to capture its dynamics. The chemical master equation (CME) is a commonly used stochastic model of Kolmogorov forward equations that describe how the probability distribution of a chemically reacting system varies with time. Finding analytic solutions to the CME can have benefits, such as expediting simulations of multiscale biochemical reaction networks and aiding the design of distributional responses. However, analytic solutions are rarely known. A recent method of computing analytic stationary solutions relies on gluing simple state spaces together recursively at one or two states. We explore the capabilities of this method and introduce algorithms to derive analytic stationary solutions to the CME. We first formally characterize state spaces that can be constructed by performing single-state gluing of paths, cycles or both sequentially. We then study stochastic biochemical reaction networks that consist of reversible, elementary reactions with two-dimensional state spaces. We also discuss extending the method to infinite state spaces and designing the stationary behaviour of stochastic biochemical reaction networks. Finally, we illustrate the aforementioned ideas using examples that include two interconnected transcriptional components and biochemical reactions with two-dimensional state spaces. © 2017 The Author(s).

Recursively constructing analytic expressions for equilibrium distributions of stochastic biochemical reaction networks

PubMed Central

Baetica, Ania-Ariadna; Singhal, Vipul; Murray, Richard M.

2017-01-01

Noise is often indispensable to key cellular activities, such as gene expression, necessitating the use of stochastic models to capture its dynamics. The chemical master equation (CME) is a commonly used stochastic model of Kolmogorov forward equations that describe how the probability distribution of a chemically reacting system varies with time. Finding analytic solutions to the CME can have benefits, such as expediting simulations of multiscale biochemical reaction networks and aiding the design of distributional responses. However, analytic solutions are rarely known. A recent method of computing analytic stationary solutions relies on gluing simple state spaces together recursively at one or two states. We explore the capabilities of this method and introduce algorithms to derive analytic stationary solutions to the CME. We first formally characterize state spaces that can be constructed by performing single-state gluing of paths, cycles or both sequentially. We then study stochastic biochemical reaction networks that consist of reversible, elementary reactions with two-dimensional state spaces. We also discuss extending the method to infinite state spaces and designing the stationary behaviour of stochastic biochemical reaction networks. Finally, we illustrate the aforementioned ideas using examples that include two interconnected transcriptional components and biochemical reactions with two-dimensional state spaces. PMID:28566513

Space-based augmentation for global navigation satellite systems.

PubMed

Grewal, Mohinder S

2012-03-01

This paper describes space-based augmentation for global navigation satellite systems (GNSS). Space-based augmentations increase the accuracy and integrity of the GNSS, thereby enhancing users' safety. The corrections for ephemeris, ionospheric delay, and clocks are calculated from reference station measurements of GNSS data in wide-area master stations and broadcast via geostationary earth orbit (GEO) satellites. This paper discusses the clock models, satellite orbit determination, ionospheric delay estimation, multipath mitigation, and GEO uplink subsystem (GUS) as used in the Wide Area Augmentation System developed by the FAA.

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.

A spatial operator algebra for manipulator modeling and control

NASA Technical Reports Server (NTRS)

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

1991-01-01

A recently developed spatial operator algebra for manipulator modeling, control, and trajectory design 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 for 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.

A recursive solution for a fading memory filter derived from Kalman filter theory

NASA Technical Reports Server (NTRS)

Statman, J. I.

1986-01-01

A simple recursive solution for a class of fading memory tracking filters is presented. A fading memory filter provides estimates of filter states based on past measurements, similar to a traditional Kalman filter. Unlike a Kalman filter, an exponentially decaying weight is applied to older measurements, discounting their effect on present state estimates. It is shown that Kalman filters and fading memory filters are closely related solutions to a general least squares estimator problem. Closed form filter transfer functions are derived for a time invariant, steady state, fading memory filter. These can be applied in loop filter implementation of the Deep Space Network (DSN) Advanced Receiver carrier phase locked loop (PLL).

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.

Quantitative analysis of eyes and other optical systems in linear optics.

PubMed

Harris, William F; Evans, Tanya; van Gool, Radboud D

2017-05-01

To show that 14-dimensional spaces of augmented point P and angle Q characteristics, matrices obtained from the ray transference, are suitable for quantitative analysis although only the latter define an inner-product space and only on it can one define distances and angles. The paper examines the nature of the spaces and their relationships to other spaces including symmetric dioptric power space. The paper makes use of linear optics, a three-dimensional generalization of Gaussian optics. Symmetric 2 × 2 dioptric power matrices F define a three-dimensional inner-product space which provides a sound basis for quantitative analysis (calculation of changes, arithmetic means, etc.) of refractive errors and thin systems. For general systems the optical character is defined by the dimensionally-heterogeneous 4 × 4 symplectic matrix S, the transference, or if explicit allowance is made for heterocentricity, the 5 × 5 augmented symplectic matrix T. Ordinary quantitative analysis cannot be performed on them because matrices of neither of these types constitute vector spaces. Suitable transformations have been proposed but because the transforms are dimensionally heterogeneous the spaces are not naturally inner-product spaces. The paper obtains 14-dimensional spaces of augmented point P and angle Q characteristics. The 14-dimensional space defined by the augmented angle characteristics Q is dimensionally homogenous and an inner-product space. A 10-dimensional subspace of the space of augmented point characteristics P is also an inner-product space. The spaces are suitable for quantitative analysis of the optical character of eyes and many other systems. Distances and angles can be defined in the inner-product spaces. The optical systems may have multiple separated astigmatic and decentred refracting elements. © 2017 The Authors Ophthalmic & Physiological Optics © 2017 The College of Optometrists.

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.

Concatenated shift registers generating maximally spaced phase shifts of PN-sequences

NASA Technical Reports Server (NTRS)

Hurd, W. J.; Welch, L. R.

1977-01-01

A large class of linearly concatenated shift registers is shown to generate approximately maximally spaced phase shifts of pn-sequences, for use in pseudorandom number generation. A constructive method is presented for finding members of this class, for almost all degrees for which primitive trinomials exist. The sequences which result are not normally characterized by trinomial recursions, which is desirable since trinomial sequences can have some undesirable randomness properties.

Recursive Branching Simulated Annealing Algorithm

NASA Technical Reports Server (NTRS)

Bolcar, Matthew; Smith, J. Scott; Aronstein, David

2012-01-01

This innovation is a variation of a simulated-annealing optimization algorithm that uses a recursive-branching structure to parallelize the search of a parameter space for the globally optimal solution to an objective. The algorithm has been demonstrated to be more effective at searching a parameter space than traditional simulated-annealing methods for a particular problem of interest, and it can readily be applied to a wide variety of optimization problems, including those with a parameter space having both discrete-value parameters (combinatorial) and continuous-variable parameters. It can take the place of a conventional simulated- annealing, Monte-Carlo, or random- walk algorithm. In a conventional simulated-annealing (SA) algorithm, a starting configuration is randomly selected within the parameter space. The algorithm randomly selects another configuration from the parameter space and evaluates the objective function for that configuration. If the objective function value is better than the previous value, the new configuration is adopted as the new point of interest in the parameter space. If the objective function value is worse than the previous value, the new configuration may be adopted, with a probability determined by a temperature parameter, used in analogy to annealing in metals. As the optimization continues, the region of the parameter space from which new configurations can be selected shrinks, and in conjunction with lowering the annealing temperature (and thus lowering the probability for adopting configurations in parameter space with worse objective functions), the algorithm can converge on the globally optimal configuration. The Recursive Branching Simulated Annealing (RBSA) algorithm shares some features with the SA algorithm, notably including the basic principles that a starting configuration is randomly selected from within the parameter space, the algorithm tests other configurations with the goal of finding the globally optimal solution, and the region from which new configurations can be selected shrinks as the search continues. The key difference between these algorithms is that in the SA algorithm, a single path, or trajectory, is taken in parameter space, from the starting point to the globally optimal solution, while in the RBSA algorithm, many trajectories are taken; by exploring multiple regions of the parameter space simultaneously, the algorithm has been shown to converge on the globally optimal solution about an order of magnitude faster than when using conventional algorithms. Novel features of the RBSA algorithm include: 1. More efficient searching of the parameter space due to the branching structure, in which multiple random configurations are generated and multiple promising regions of the parameter space are explored; 2. The implementation of a trust region for each parameter in the parameter space, which provides a natural way of enforcing upper- and lower-bound constraints on the parameters; and 3. The optional use of a constrained gradient- search optimization, performed on the continuous variables around each branch s configuration in parameter space to improve search efficiency by allowing for fast fine-tuning of the continuous variables within the trust region at that configuration point.

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.

Navigation for space shuttle approach and landing using an inertial navigation system augmented by data from a precision ranging system or a microwave scan beam landing guidance system

NASA Technical Reports Server (NTRS)

Mcgee, L. A.; Smith, G. L.; Hegarty, D. M.; Merrick, R. B.; Carson, T. M.; Schmidt, S. F.

1970-01-01

A preliminary study has been made of the navigation performance which might be achieved for the high cross-range space shuttle orbiter during final approach and landing by using an optimally augmented inertial navigation system. Computed navigation accuracies are presented for an on-board inertial navigation system augmented (by means of an optimal filter algorithm) with data from two different ground navigation aids; a precision ranging system and a microwave scanning beam landing guidance system. These results show that augmentation with either type of ground navigation aid is capable of providing a navigation performance at touchdown which should be adequate for the space shuttle. In addition, adequate navigation performance for space shuttle landing is obtainable from the precision ranging system even with a complete dropout of precision range measurements as much as 100 seconds before touchdown.

14 CFR 25.945 - Thrust or power augmentation system.

Code of Federal Regulations, 2014 CFR

2014-01-01

... 14 Aeronautics and Space 1 2014-01-01 2014-01-01 false Thrust or power augmentation system. 25.945 Section 25.945 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION, DEPARTMENT OF TRANSPORTATION... must have an expansion space of not less than 2 percent of the tank capacity. It must be impossible to...

14 CFR 25.945 - Thrust or power augmentation system.

Code of Federal Regulations, 2013 CFR

2013-01-01

... 14 Aeronautics and Space 1 2013-01-01 2013-01-01 false Thrust or power augmentation system. 25.945 Section 25.945 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION, DEPARTMENT OF TRANSPORTATION... must have an expansion space of not less than 2 percent of the tank capacity. It must be impossible to...

14 CFR 25.945 - Thrust or power augmentation system.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 14 Aeronautics and Space 1 2010-01-01 2010-01-01 false Thrust or power augmentation system. 25.945 Section 25.945 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION, DEPARTMENT OF TRANSPORTATION... must have an expansion space of not less than 2 percent of the tank capacity. It must be impossible to...

14 CFR 25.945 - Thrust or power augmentation system.

Code of Federal Regulations, 2011 CFR

2011-01-01

... 14 Aeronautics and Space 1 2011-01-01 2011-01-01 false Thrust or power augmentation system. 25.945 Section 25.945 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION, DEPARTMENT OF TRANSPORTATION... must have an expansion space of not less than 2 percent of the tank capacity. It must be impossible to...

14 CFR 25.945 - Thrust or power augmentation system.

Code of Federal Regulations, 2012 CFR

2012-01-01

... 14 Aeronautics and Space 1 2012-01-01 2012-01-01 false Thrust or power augmentation system. 25.945 Section 25.945 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION, DEPARTMENT OF TRANSPORTATION... must have an expansion space of not less than 2 percent of the tank capacity. It must be impossible to...

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…

RMS active damping augmentation

NASA Technical Reports Server (NTRS)

Gilbert, Michael G.; Scott, Michael A.; Demeo, Martha E.

1992-01-01

The topics are presented in viewgraph form and include: RMS active damping augmentation; potential space station assembly benefits to CSI; LaRC/JSC bridge program; control law design process; draper RMS simulator; MIMO acceleration control laws improve damping; potential load reduction benefit; DRS modified to model distributed accelerations; accelerometer location; Space Shuttle aft cockpit simulator; simulated shuttle video displays; SES test goals and objectives; and SES modifications to support RMS active damping augmentation.

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.

Complex sample survey estimation in static state-space

Treesearch

Raymond L. Czaplewski

2010-01-01

Increased use of remotely sensed data is a key strategy adopted by the Forest Inventory and Analysis Program. However, multiple sensor technologies require complex sampling units and sampling designs. The Recursive Restriction Estimator (RRE) accommodates this complexity. It is a design-consistent Empirical Best Linear Unbiased Prediction for the state-vector, which...

Spherical-wave expansions of piston-radiator fields.

PubMed

Wittmann, R C; Yaghjian, A D

1991-09-01

Simple spherical-wave expansions of the continuous-wave fields of a circular piston radiator in a rigid baffle are derived. These expansions are valid throughout the illuminated half-space and are useful for efficient numerical computation in the near-field region. Multipole coefficients are given by closed-form expressions which can be evaluated recursively.

Multiple Perforations of the Sinus Floor During Maxillary Sinus Floor Augmentation to Provide Access to the Bone Marrow Space: A Technical Report.

PubMed

Ulm, Christian; Bertl, Kristina; Strbac, Georg D; Esfandeyari, Azadeh; Stavropoulos, Andreas; Zechner, Werner

2017-12-01

Sinus floor augmentation is a routinely used surgical technique for increasing the bone height/volume of the atrophic posterior maxilla. Optimal integration of the implanted augmentation material within the newly formed bone will-at least partly-depend on adequate vascularization to ensure sufficient recruitment of osteoblast and osteoclast precursor cells. The present technical note describes a modification intended to facilitate increased blood inflow into the augmented space. After preparation of the lateral window and elevation of the Schneiderian membrane, the cortical bone of the sinus floor is perforated several times either by using a piezoelectric device or a microsurgical handpiece with the corresponding tip or bur; these perforations should extend into the trabecular bone. The experiences with this modified technique after 12 patients are presented and discussed. It is expected that by means of this relatively simple technique, increased blood and cell inflow into the augmented space is achieved. This may, in turn, enhance new bone formation and improve the integration of the augmentation material.

Multi-particle phase space integration with arbitrary set of singularities in CompHEP

NASA Astrophysics Data System (ADS)

Kovalenko, D. N.; Pukhov, A. E.

1997-02-01

We describe an algorithm of multi-particle phase space integration for collision and decay processes realized in CompHEP package version 3.2. In the framework of this algorithm it is possible to regularize an arbitrary set of singularities caused by virtual particle propagators. The algorithm is based on the method of the recursive representation of kinematics and on the multichannel Monte Carlo approach. CompHEP package is available by WWW: http://theory.npi.msu.su/pukhov/comphep.html

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

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.

Stationary Random Metrics on Hierarchical Graphs Via {(min,+)}-type Recursive Distributional Equations

NASA Astrophysics Data System (ADS)

Khristoforov, Mikhail; Kleptsyn, Victor; Triestino, Michele

2016-07-01

This paper is inspired by the problem of understanding in a mathematical sense the Liouville quantum gravity on surfaces. Here we show how to define a stationary random metric on self-similar spaces which are the limit of nice finite graphs: these are the so-called hierarchical graphs. They possess a well-defined level structure and any level is built using a simple recursion. Stopping the construction at any finite level, we have a discrete random metric space when we set the edges to have random length (using a multiplicative cascade with fixed law {m}). We introduce a tool, the cut-off process, by means of which one finds that renormalizing the sequence of metrics by an exponential factor, they converge in law to a non-trivial metric on the limit space. Such limit law is stationary, in the sense that glueing together a certain number of copies of the random limit space, according to the combinatorics of the brick graph, the obtained random metric has the same law when rescaled by a random factor of law {m} . In other words, the stationary random metric is the solution of a distributional equation. When the measure m has continuous positive density on {mathbf{R}+}, the stationary law is unique up to rescaling and any other distribution tends to a rescaled stationary law under the iterations of the hierarchical transformation. We also investigate topological and geometric properties of the random space when m is log-normal, detecting a phase transition influenced by the branching random walk associated to the multiplicative cascade.

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

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…

Weighted augmented Jacobian matrix with a variable coefficient method for kinematics mapping of space teleoperation based on human-robot motion similarity

NASA Astrophysics Data System (ADS)

Shi, Zhong; Huang, Xuexiang; Hu, Tianjian; Tan, Qian; Hou, Yuzhuo

2016-10-01

Space teleoperation is an important space technology, and human-robot motion similarity can improve the flexibility and intuition of space teleoperation. This paper aims to obtain an appropriate kinematics mapping method of coupled Cartesian-joint space for space teleoperation. First, the coupled Cartesian-joint similarity principles concerning kinematics differences are defined. Then, a novel weighted augmented Jacobian matrix with a variable coefficient (WAJM-VC) method for kinematics mapping is proposed. The Jacobian matrix is augmented to achieve a global similarity of human-robot motion. A clamping weighted least norm scheme is introduced to achieve local optimizations, and the operating ratio coefficient is variable to pursue similarity in the elbow joint. Similarity in Cartesian space and the property of joint constraint satisfaction is analysed to determine the damping factor and clamping velocity. Finally, a teleoperation system based on human motion capture is established, and the experimental results indicate that the proposed WAJM-VC method can improve the flexibility and intuition of space teleoperation to complete complex space tasks.

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.

Self-tuning control of attitude and momentum management for the Space Station

NASA Technical Reports Server (NTRS)

Shieh, L. S.; Sunkel, J. W.; Yuan, Z. Z.; Zhao, X. M.

1992-01-01

This paper presents a hybrid state-space self-tuning design methodology using dual-rate sampling for suboptimal digital adaptive control of attitude and momentum management for the Space Station. This new hybrid adaptive control scheme combines an on-line recursive estimation algorithm for indirectly identifying the parameters of a continuous-time system from the available fast-rate sampled data of the inputs and states and a controller synthesis algorithm for indirectly finding the slow-rate suboptimal digital controller from the designed optimal analog controller. The proposed method enables the development of digitally implementable control algorithms for the robust control of Space Station Freedom with unknown environmental disturbances and slowly time-varying dynamics.

Gravity with a cosmological constant from rational curves

NASA Astrophysics Data System (ADS)

Adamo, Tim

2015-11-01

We give a new formula for all tree-level correlators of boundary field insertions in gauged N=8 supergravity in AdS4; this is an analogue of the tree-level S-matrix in anti-de Sitter space. The formula is written in terms of rational maps from the Riemann sphere to twistor space, with no reference to bulk perturbation theory. It is polynomial in the cosmological constant, and equal to the classical scattering amplitudes of supergravity in the flat space limit. The formula is manifestly supersymmetric, independent of gauge choices on twistor space, and equivalent to expressions computed via perturbation theory at 3-point overline{MHV} and n-point MHV. We also show that the formula factorizes and obeys BCFW recursion in twistor space.

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…

Recursive Objects--An Object Oriented Presentation of Recursion

ERIC Educational Resources Information Center

Sher, David B.

2004-01-01

Generally, when recursion is introduced to students the concept is illustrated with a toy (Towers of Hanoi) and some abstract mathematical functions (factorial, power, Fibonacci). These illustrate recursion in the same sense that counting to 10 can be used to illustrate a for loop. These are all good illustrations, but do not represent serious…

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

Diagrammatic exponentiation for products of Wilson lines

NASA Astrophysics Data System (ADS)

Mitov, Alexander; Sterman, George; Sung, Ilmo

2010-11-01

We provide a recursive diagrammatic prescription for the exponentiation of gauge theory amplitudes involving products of Wilson lines and loops. This construction generalizes the concept of webs, originally developed for eikonal form factors and cross sections with two eikonal lines, to general soft functions in QCD and related gauge theories. Our coordinate space arguments apply to arbitrary paths for the lines.

Standardized shrinking LORETA-FOCUSS (SSLOFO): a new algorithm for spatio-temporal EEG source reconstruction.

PubMed

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

2005-10-01

This paper presents a new algorithm called Standardized Shrinking LORETA-FOCUSS (SSLOFO) for solving the electroencephalogram (EEG) inverse problem. Multiple techniques are combined in a single procedure to robustly reconstruct the underlying source distribution with high spatial resolution. This algorithm uses a recursive process which takes the smooth estimate of sLORETA as initialization and then employs the re-weighted minimum norm introduced by FOCUSS. An important technique called standardization is involved in the recursive process to enhance the localization ability. The algorithm is further improved by automatically adjusting the source space according to the estimate of the previous step, and by the inclusion of temporal information. Simulation studies are carried out on both spherical and realistic head models. The algorithm achieves very good localization ability on noise-free data. It is capable of recovering complex source configurations with arbitrary shapes and can produce high quality images of extended source distributions. We also characterized the performance with noisy data in a realistic head model. An important feature of this algorithm is that the temporal waveforms are clearly reconstructed, even for closely spaced sources. This provides a convenient way to estimate neural dynamics directly from the cortical sources.

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.

X-ray and neutron total scattering analysis of Hy·(Bi0.2Ca0.55Sr0.25)(Ag0.25Na0.75)Nb3O10·xH2O perovskite nanosheet booklets with stacking disorder

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

Metz, Peter; Koch, Robert; Cladek, Bernadette

Ion-exchanged Aurivillius materials form perovskite nanosheet booklets wherein well-defined bi-periodic sheets, with ~11.5 Å thickness, exhibit extensive stacking disorder. The perovskite layer contents were defined initially using combined synchrotron X-ray and neutron Rietveld refinement of the parent Aurivillius structure. The structure of the subsequently ion-exchanged material, which is disordered in its stacking sequence, is analyzed using both pair distribution function (PDF) analysis and recursive method simulations of the scattered intensity. Combined X-ray and neutron PDF refinement of supercell stacking models demonstrates sensitivity of the PDF to both perpendicular and transverse stacking vector components. Further, hierarchical ensembles of stacking models weightedmore » by a standard normal distribution are demonstrated to improve PDF fit over 1–25 Å. Recursive method simulations of the X-ray scattering profile demonstrate agreement between the real space stacking analysis and more conventional reciprocal space methods. The local structure of the perovskite sheet is demonstrated to relax only slightly from the Aurivillius structure after ion exchange.« less

Hyperspace geography: visualizing fitness landscapes beyond 4D.

PubMed

Wiles, Janet; Tonkes, Bradley

2006-01-01

Human perception is finely tuned to extract structure about the 4D world of time and space as well as properties such as color and texture. Developing intuitions about spatial structure beyond 4D requires exploiting other perceptual and cognitive abilities. One of the most natural ways to explore complex spaces is for a user to actively navigate through them, using local explorations and global summaries to develop intuitions about structure, and then testing the developing ideas by further exploration. This article provides a brief overview of a technique for visualizing surfaces defined over moderate-dimensional binary spaces, by recursively unfolding them onto a 2D hypergraph. We briefly summarize the uses of a freely available Web-based visualization tool, Hyperspace Graph Paper (HSGP), for exploring fitness landscapes and search algorithms in evolutionary computation. HSGP provides a way for a user to actively explore a landscape, from simple tasks such as mapping the neighborhood structure of different points, to seeing global properties such as the size and distribution of basins of attraction or how different search algorithms interact with landscape structure. It has been most useful for exploring recursive and repetitive landscapes, and its strength is that it allows intuitions to be developed through active navigation by the user, and exploits the visual system's ability to detect pattern and texture. The technique is most effective when applied to continuous functions over Boolean variables using 4 to 16 dimensions.

Transduction between worlds: using virtual and mixed reality for earth and planetary science

NASA Astrophysics Data System (ADS)

Hedley, N.; Lochhead, I.; Aagesen, S.; Lonergan, C. D.; Benoy, N.

2017-12-01

Virtual reality (VR) and augmented reality (AR) have the potential to transform the way we visualize multidimensional geospatial datasets in support of geoscience research, exploration and analysis. The beauty of virtual environments is that they can be built at any scale, users can view them at many levels of abstraction, move through them in unconventional ways, and experience spatial phenomena as if they had superpowers. Similarly, augmented reality allows you to bring the power of virtual 3D data visualizations into everyday spaces. Spliced together, these interface technologies hold incredible potential to support 21st-century geoscience. In my ongoing research, my team and I have made significant advances to connect data and virtual simulations with real geographic spaces, using virtual environments, geospatial augmented reality and mixed reality. These research efforts have yielded new capabilities to connect users with spatial data and phenomena. These innovations include: geospatial x-ray vision; flexible mixed reality; augmented 3D GIS; situated augmented reality 3D simulations of tsunamis and other phenomena interacting with real geomorphology; augmented visual analytics; and immersive GIS. These new modalities redefine the ways in which we can connect digital spaces of spatial analysis, simulation and geovisualization, with geographic spaces of data collection, fieldwork, interpretation and communication. In a way, we are talking about transduction between real and virtual worlds. Taking a mixed reality approach to this, we can link real and virtual worlds. This paper presents a selection of our 3D geovisual interface projects in terrestrial, coastal, underwater and other environments. Using rigorous applied geoscience data, analyses and simulations, our research aims to transform the novelty of virtual and augmented reality interface technologies into game-changing mixed reality geoscience.

14 CFR Table C to Part 117 - Flight Duty Period: Augmented Operations

Code of Federal Regulations, 2014 CFR

2014-01-01

... 14 Aeronautics and Space 3 2014-01-01 2014-01-01 false Flight Duty Period: Augmented Operations C Table C to Part 117 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION, DEPARTMENT OF TRANSPORTATION... LIMITATIONS AND REST REQUIREMENTS: FLIGHTCREW MEMBERS Pt. 117, Table C Table C to Part 117—Flight Duty Period...

Identification of observer/Kalman filter Markov parameters: Theory and experiments

NASA Technical Reports Server (NTRS)

Juang, Jer-Nan; Phan, Minh; Horta, Lucas G.; Longman, Richard W.

1991-01-01

An algorithm to compute Markov parameters of an observer or Kalman filter from experimental input and output data is discussed. The Markov parameters can then be used for identification of a state space representation, with associated Kalman gain or observer gain, for the purpose of controller design. The algorithm is a non-recursive matrix version of two recursive algorithms developed in previous works for different purposes. The relationship between these other algorithms is developed. The new matrix formulation here gives insight into the existence and uniqueness of solutions of certain equations and gives bounds on the proper choice of observer order. It is shown that if one uses data containing noise, and seeks the fastest possible deterministic observer, the deadbeat observer, one instead obtains the Kalman filter, which is the fastest possible observer in the stochastic environment. Results are demonstrated in numerical studies and in experiments on an ten-bay truss structure.

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.

14 CFR 29.672 - Stability augmentation, automatic, and power-operated systems.

Code of Federal Regulations, 2011 CFR

2011-01-01

... power-operated systems. 29.672 Section 29.672 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION... Construction Control Systems § 29.672 Stability augmentation, automatic, and power-operated systems. If the functioning of stability augmentation or other automatic or power-operated system is necessary to show...

14 CFR 29.672 - Stability augmentation, automatic, and power-operated systems.

Code of Federal Regulations, 2014 CFR

2014-01-01

... power-operated systems. 29.672 Section 29.672 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION... Construction Control Systems § 29.672 Stability augmentation, automatic, and power-operated systems. If the functioning of stability augmentation or other automatic or power-operated system is necessary to show...

14 CFR 27.672 - Stability augmentation, automatic, and power-operated systems.

Code of Federal Regulations, 2014 CFR

2014-01-01

... power-operated systems. 27.672 Section 27.672 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION... Construction Control Systems § 27.672 Stability augmentation, automatic, and power-operated systems. If the functioning of stability augmentation or other automatic or power-operated systems is necessary to show...

14 CFR 29.672 - Stability augmentation, automatic, and power-operated systems.

Code of Federal Regulations, 2010 CFR

2010-01-01

... power-operated systems. 29.672 Section 29.672 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION... Construction Control Systems § 29.672 Stability augmentation, automatic, and power-operated systems. If the functioning of stability augmentation or other automatic or power-operated system is necessary to show...

14 CFR 27.672 - Stability augmentation, automatic, and power-operated systems.

Code of Federal Regulations, 2011 CFR

2011-01-01

... power-operated systems. 27.672 Section 27.672 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION... Construction Control Systems § 27.672 Stability augmentation, automatic, and power-operated systems. If the functioning of stability augmentation or other automatic or power-operated systems is necessary to show...

14 CFR 29.672 - Stability augmentation, automatic, and power-operated systems.

Code of Federal Regulations, 2012 CFR

2012-01-01

... power-operated systems. 29.672 Section 29.672 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION... Construction Control Systems § 29.672 Stability augmentation, automatic, and power-operated systems. If the functioning of stability augmentation or other automatic or power-operated system is necessary to show...

14 CFR 27.672 - Stability augmentation, automatic, and power-operated systems.

Code of Federal Regulations, 2010 CFR

2010-01-01

... power-operated systems. 27.672 Section 27.672 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION... Construction Control Systems § 27.672 Stability augmentation, automatic, and power-operated systems. If the functioning of stability augmentation or other automatic or power-operated systems is necessary to show...

14 CFR 27.672 - Stability augmentation, automatic, and power-operated systems.

Code of Federal Regulations, 2012 CFR

2012-01-01

... power-operated systems. 27.672 Section 27.672 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION... Construction Control Systems § 27.672 Stability augmentation, automatic, and power-operated systems. If the functioning of stability augmentation or other automatic or power-operated systems is necessary to show...

Augmentation of UK Space Debris Observing Capabilities Using Univiersity Optical Telescopes

NASA Astrophysics Data System (ADS)

Herridge, Philip; Brown, David; Crowther, Richard

2013-08-01

The study of space debris requires a range of different sensors. Debris population monitoring requires survey, follow-on and characterisation capable sensors. In order to fully participate in space debris measurement the range of sensors available to the UK Space Agency needs to be augmented with additional capability. One source of untapped resource resides within the UK university sector. This paper discusses investigation into extending the optical sensor diversity available to the UK for participation in study of the debris environment through a collaboration between Space Insight Limited, a commercial company providing Space Situational Awareness (SSA) services to the UK Space Agency, and the Astronomy Group at the University of St Andrews.

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

14 CFR 91.1061 - Augmented flight crews.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 14 Aeronautics and Space 2 2010-01-01 2010-01-01 false Augmented flight crews. 91.1061 Section 91...) AIR TRAFFIC AND GENERAL OPERATING RULES GENERAL OPERATING AND FLIGHT RULES Fractional Ownership Operations Program Management § 91.1061 Augmented flight crews. (a) No program manager may assign any flight...

14 CFR 91.1061 - Augmented flight crews.

Code of Federal Regulations, 2012 CFR

2012-01-01

... 14 Aeronautics and Space 2 2012-01-01 2012-01-01 false Augmented flight crews. 91.1061 Section 91...) AIR TRAFFIC AND GENERAL OPERATING RULES GENERAL OPERATING AND FLIGHT RULES Fractional Ownership Operations Program Management § 91.1061 Augmented flight crews. (a) No program manager may assign any flight...

14 CFR 25.672 - Stability augmentation and automatic and power-operated systems.

Code of Federal Regulations, 2013 CFR

2013-01-01

... power-operated systems. 25.672 Section 25.672 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION... Construction Control Systems § 25.672 Stability augmentation and automatic and power-operated systems. If the functioning of stability augmentation or other automatic or power-operated systems is necessary to show...

Mockingbirds

NASA Astrophysics Data System (ADS)

Stewart, Arthur J.

2018-03-01

"Science flavored" poetry offers an aesthetic way to explore spaces between facts. This poem, through recursively introducing a central metaphor—a mockingbird—may encourage new ways to think about teaching science. Important context for the poem is this: a cohort of about 250 students arrived at the Department of Energy's Oak Ridge National Laboratory in east Tennessee on a beautiful day in June, 2016, ready to start their summer research experience.

Spatial operator algebra for flexible multibody dynamics

NASA Technical Reports Server (NTRS)

Jain, A.; Rodriguez, G.

1993-01-01

This paper presents an approach to modeling the dynamics of flexible multibody systems such as flexible spacecraft and limber space robotic systems. A large number of degrees of freedom and complex dynamic interactions are typical in these systems. This paper uses spatial operators to develop efficient recursive algorithms for the dynamics of these systems. This approach very efficiently manages complexity by means of a hierarchy of mathematical operations.

Transfer matrix method for dynamics modeling and independent modal space vibration control design of linear hybrid multibody system

NASA Astrophysics Data System (ADS)

Rong, Bao; Rui, Xiaoting; Lu, Kun; Tao, Ling; Wang, Guoping; Ni, Xiaojun

2018-05-01

In this paper, an efficient method of dynamics modeling and vibration control design of a linear hybrid multibody system (MS) is studied based on the transfer matrix method. The natural vibration characteristics of a linear hybrid MS are solved by using low-order transfer equations. Then, by constructing the brand-new body dynamics equation, augmented operator and augmented eigenvector, the orthogonality of augmented eigenvector of a linear hybrid MS is satisfied, and its state space model expressed in each independent model space is obtained easily. According to this dynamics model, a robust independent modal space-fuzzy controller is designed for vibration control of a general MS, and the genetic optimization of some critical control parameters of fuzzy tuners is also presented. Two illustrative examples are performed, which results show that this method is computationally efficient and with perfect control performance.

A preliminary look at control augmented dynamic response of structures

NASA Technical Reports Server (NTRS)

Ryan, R. S.; Jewell, R. E.

1983-01-01

The augmentation of structural characteristics, mass, damping, and stiffness through the use of control theory in lieu of structural redesign or augmentation was reported. The standard single-degree-of-freedom system was followed by a treatment of the same system using control augmentation. The system was extended to elastic structures using single and multisensor approaches and concludes with a brief discussion of potential application to large orbiting space structures.

Human-in-the-loop evaluation of RMS Active Damping Augmentation

NASA Technical Reports Server (NTRS)

Demeo, Martha E.; Gilbert, Michael G.; Scott, Michael A.; Lepanto, Janet A.; Bains, Elizabeth M.; Jensen, Mary C.

1993-01-01

Active Damping Augmentation is the insertion of Controls-Structures Integration Technology to benefit the on-orbit performance of the Space Shuttle Remote Manipulator System. The goal is to reduce the vibration decay time of the Remote Manipulator System following normal payload maneuvers and operations. Simulation of Active Damping Augmentation was conducted in the realtime human-in-the-loop Systems Engineering Simulator at the NASA Johnson Space Center. The objective of this study was to obtain a qualitative measure of operational performance improvement from astronaut operators and to obtain supporting quantitative performance data. Sensing of vibratory motions was simulated using a three-axis accelerometer mounted at the end of the lower boom of the Remote Manipulator System. The sensed motions were used in a feedback control law to generate commands to the joint servo mechanisms which reduced the unwanted oscillations. Active damping of the Remote Manipulator System with an attached 3990 lb. payload was successfully demonstrated. Six astronaut operators examined the performance of an Active Damping Augmentation control law following single-joint and coordinated six-joint translational and rotational maneuvers. Active Damping Augmentation disturbance rejection of Orbiter thruster firings was also evaluated. Significant reductions in the dynamic response of the 3990 lb. payload were observed. Astronaut operators recommended investigation of Active Damping Augmentation benefits to heavier payloads where oscillations are a bigger problem (e.g. Space Station Freedom assembly operators).

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.

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)

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.

Surprise-Based Learning for Autonomous Systems

DTIC Science & Technology

2009-02-28

paradigm stems from Piaget’s theory of Developmental Psychology [5], Herben Simon’s theory on dual-space search for knowledge and problem solving [6...for scientific theories containing recursive theoretical terms". British Journal of Philosophy of Science, 44. 641-652, 1993. Piaget J.. "The Origins...34Learning to use a lever", Child Development , 43:790-799, 1972. Nolfi S ., Floreano D.. "Evolutionary robotics: The biology, intelligence, and

Resonance Phenomena in Goupillaud-type Media

DTIC Science & Technology

2010-10-01

time-harmonic forcing function at one end, with the other end fixed. Analytical stress solutions are derived from a global system of recursion...relationships using z-transform methods, where the determinant of the resulting global system matrix |Am| in the z-space is a palindromic polynomial with real...media (35). The present treatment uses a global matrix method that is attributed to Knopoff (36), rather than the Thomsen-Haskell transfer matrix

Solving Graph Laplacian Systems Through Recursive Bisections and Two-Grid Preconditioning

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

Ponce, Colin; Vassilevski, Panayot S.

2016-02-18

We present a parallelizable direct method for computing the solution to graph Laplacian-based linear systems derived from graphs that can be hierarchically bipartitioned with small edge cuts. For a graph of size n with constant-size edge cuts, our method decomposes a graph Laplacian in time O(n log n), and then uses that decomposition to perform a linear solve in time O(n log n). We then use the developed technique to design a preconditioner for graph Laplacians that do not have this property. Finally, we augment this preconditioner with a two-grid method that accounts for much of the preconditioner's weaknesses. Wemore » present an analysis of this method, as well as a general theorem for the condition number of a general class of two-grid support graph-based preconditioners. Numerical experiments illustrate the performance of the studied methods.« less

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.

Augmented Reality for Close Quarters Combat

ScienceCinema

None

2018-01-16

Sandia National Laboratories has developed a state-of-the-art augmented reality training system for close-quarters combat (CQB). This system uses a wearable augmented reality system to place the user in a real environment while engaging enemy combatants in virtual space (Boston Dynamics DI-Guy). Umbra modeling and simulation environment is used to integrate and control the AR system.

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)

Augmented Reality-Guided Lumbar Facet Joint Injections.

PubMed

Agten, Christoph A; Dennler, Cyrill; Rosskopf, Andrea B; Jaberg, Laurenz; Pfirrmann, Christian W A; Farshad, Mazda

2018-05-08

The aim of this study was to assess feasibility and accuracy of augmented reality-guided lumbar facet joint injections. A spine phantom completely embedded in hardened opaque agar with 3 ring markers was built. A 3-dimensional model of the phantom was uploaded to an augmented reality headset (Microsoft HoloLens). Two radiologists independently performed 20 augmented reality-guided and 20 computed tomography (CT)-guided facet joint injections each: for each augmented reality-guided injection, the hologram was manually aligned with the phantom container using the ring markers. The radiologists targeted the virtual facet joint and tried to place the needle tip in the holographic joint space. Computed tomography was performed after each needle placement to document final needle tip position. Time needed from grabbing the needle to final needle placement was measured for each simulated injection. An independent radiologist rated images of all needle placements in a randomized order blinded to modality (augmented reality vs CT) and performer as perfect, acceptable, incorrect, or unsafe. Accuracy and time to place needles were compared between augmented reality-guided and CT-guided facet joint injections. In total, 39/40 (97.5%) of augmented reality-guided needle placements were either perfect or acceptable compared with 40/40 (100%) CT-guided needle placements (P = 0.5). One augmented reality-guided injection missed the facet joint space by 2 mm. No unsafe needle placements occurred. Time to final needle placement was substantially faster with augmented reality guidance (mean 14 ± 6 seconds vs 39 ± 15 seconds, P < 0.001 for both readers). Augmented reality-guided facet joint injections are feasible and accurate without potentially harmful needle placement in an experimental setting.

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.

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

TDRSS Augmentation System for Satellites

NASA Technical Reports Server (NTRS)

Heckler, Gregory W.; Gramling, Cheryl; Valdez, Jennifer; Baldwin, Philip

2016-01-01

In 2015, NASA Goddard Space Flight Center (GSFC) reinvigorated the development of the TDRSS Augmentation Service for Satellites (TASS). TASS is a global, space-based, communications and navigation service for users of Global Navigation Satellite Systems(GNSS) and the Tracking and Data Relay Satellite System (TDRSS). TASS leverages the existing TDRSS to provide an S-band beacon radio navigation and messaging source to users at orbital altitudes 1400 km and below.

TDRSS Augmentation Service for Satellites (TASS)

NASA Technical Reports Server (NTRS)

Heckler, Gregory W.; Gramling, Cheryl; Valdez, Jennifer; Baldwin, Philip

2016-01-01

In 2015, NASA Goddard Space Flight Center (GSFC) reinvigorated the development of the TDRSS Augmentation Service for Satellites (TASS). TASS is a global, space-based, communications and navigation service for users of Global Navigation Satellite Systems (GNSS) and the Tracking and Data Relay Satellite System (TDRSS). TASS leverages the existing TDRSS to provide an S-band beacon radio navigation and messaging source to users at orbital altitudes 1400 km and below.

Advanced Response Surface Modeling of Ares I Roll Control Jet Aerodynamic Interactions

NASA Technical Reports Server (NTRS)

Favaregh, Noah M.

2010-01-01

The Ares I rocket uses roll control jets. These jets have aerodynamic implications as they impinge on the surface and protuberances of the vehicle. The jet interaction on the body can cause an amplification or a reduction of the rolling moment produced by the jet itself, either increasing the jet effectiveness or creating an adverse effect. A design of experiments test was planned and carried out using computation fluid dynamics, and a subsequent response surface analysis ensued on the available data to characterize the jet interaction across the ascent portion of the Ares I flight envelope. Four response surface schemes were compared including a single response surface covering the entire design space, separate sector responses that did not overlap, continuously overlapping surfaces, and recursive weighted response surfaces. These surfaces were evaluated on traditional statistical metrics as well as visual inspection. Validation of the recursive weighted response surface was performed using additionally available data at off-design point locations.

Some error bounds for K-iterated Gaussian recursive filters

NASA Astrophysics Data System (ADS)

Cuomo, Salvatore; Galletti, Ardelio; Giunta, Giulio; Marcellino, Livia

2016-10-01

Recursive filters (RFs) have achieved a central role in several research fields over the last few years. For example, they are used in image processing, in data assimilation and in electrocardiogram denoising. More in particular, among RFs, the Gaussian RFs are an efficient computational tool for approximating Gaussian-based convolutions and are suitable for digital image processing and applications of the scale-space theory. As is a common knowledge, the Gaussian RFs, applied to signals with support in a finite domain, generate distortions and artifacts, mostly localized at the boundaries. Heuristic and theoretical improvements have been proposed in literature to deal with this issue (namely boundary conditions). They include the case in which a Gaussian RF is applied more than once, i.e. the so called K-iterated Gaussian RFs. In this paper, starting from a summary of the comprehensive mathematical background, we consider the case of the K-iterated first-order Gaussian RF and provide the study of its numerical stability and some component-wise theoretical error bounds.

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.

A fast new algorithm for a robot neurocontroller using inverse QR decomposition

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

Morris, A.S.; Khemaissia, S.

2000-01-01

A new adaptive neural network controller for robots is presented. The controller is based on direct adaptive techniques. Unlike many neural network controllers in the literature, inverse dynamical model evaluation is not required. A numerically robust, computationally efficient processing scheme for neutral network weight estimation is described, namely, the inverse QR decomposition (INVQR). The inverse QR decomposition and a weighted recursive least-squares (WRLS) method for neural network weight estimation is derived using Cholesky factorization of the data matrix. The algorithm that performs the efficient INVQR of the underlying space-time data matrix may be implemented in parallel on a triangular array.more » Furthermore, its systolic architecture is well suited for VLSI implementation. Another important benefit is well suited for VLSI implementation. Another important benefit of the INVQR decomposition is that it solves directly for the time-recursive least-squares filter vector, while avoiding the sequential back-substitution step required by the QR decomposition approaches.« less

Thrust Augmentation Measurements for a Pulse Detonation Engine Driven Ejector

NASA Technical Reports Server (NTRS)

Pal, S.; Santoro, Robert J.; Shehadeh, R.; Saretto, S.; Lee, S.-Y.

2005-01-01

Thrust augmentation results of an ongoing study of pulse detonation engine driven ejectors are presented and discussed. The experiments were conducted using a pulse detonation engine (PDE) setup with various ejector configurations. The PDE used in these experiments utilizes ethylene (C2H4) as the fuel, and an equi-molar mixture of oxygen and nitrogen as the oxidizer at an equivalence ratio of one. High fidelity thrust measurements were made using an integrated spring damper system. The baseline thrust of the PDE engine was first measured and agrees with experimental and modeling results found in the literature. Thrust augmentation measurements were then made for constant diameter ejectors. The parameter space for the study included ejector length, PDE tube exit to ejector tube inlet overlap distance, and straight versus rounded ejector inlets. The relationship between the thrust augmentation results and various physical phenomena is described. To further understand the flow dynamics, shadow graph images of the exiting shock wave front from the PDE were also made. For the studied parameter space, the results showed a maximum augmentation of 40%. Further increase in augmentation is possible if the geometry of the ejector is tailored, a topic currently studied by numerous groups in the field.

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.

On Fusing Recursive Traversals of K-d Trees

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

Rajbhandari, Samyam; Kim, Jinsung; Krishnamoorthy, Sriram

Loop fusion is a key program transformation for data locality optimization that is implemented in production compilers. But optimizing compilers currently cannot exploit fusion opportunities across a set of recursive tree traversal computations with producer-consumer relationships. In this paper, we develop a compile-time approach to dependence characterization and program transformation to enable fusion across recursively specified traversals over k-ary trees. We present the FuseT source-to-source code transformation framework to automatically generate fused composite recursive operators from an input program containing a sequence of primitive recursive operators. We use our framework to implement fused operators for MADNESS, Multiresolution Adaptive Numerical Environmentmore » for Scientific Simulation. We show that locality optimization through fusion can offer more than an order of magnitude performance improvement.« less

A geometrical interpretation of the 2n-th central difference

NASA Technical Reports Server (NTRS)

Tapia, R. A.

1972-01-01

Many algorithms used for data smoothing, data classification and error detection require the calculation of the distance from a point to the polynomial interpolating its 2n neighbors (n on each side). This computation, if performed naively, would require the solution of a system of equations and could create numerical problems. This note shows that if the data is equally spaced, then this calculation can be performed using a simple recursion formula.

14 CFR 117.17 - Flight duty period: Augmented flightcrew.

Code of Federal Regulations, 2014 CFR

2014-01-01

... the flight controls. ... 14 Aeronautics and Space 3 2014-01-01 2014-01-01 false Flight duty period: Augmented flightcrew... FLIGHT AND DUTY LIMITATIONS AND REST REQUIREMENTS: FLIGHTCREW MEMBERS § 117.17 Flight duty period...

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

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…

Generalised Spin Dynamics and Induced Bounds of Automorphic [A]nX, [AX]n NMR Systems via Dual Tensorial Sets: An Invariant Cardinality Role for CFP

NASA Astrophysics Data System (ADS)

Temme, Francis P.

For uniform spins and their indistinguishable point sets of tensorial bases defining automorphic group-based Liouvillian NMR spin dynamics, the role of recursively-derived coefficients of fractional parentage (CFP) bijections and Schur duality-defined CFP(0)(n) ≡ ¦GI¦(n) group invariant cardinality is central both to understanding the impact of time-reversal invariance(TRI) spin physics, and to analysis as density-matrix formalisms over democratic recoupled (DR) dual tensorial sets, {T{ṽ}k(11.1)(SU2 × ln)}. Over abstract spin space, these tensorial sets are (ṽ) invariant-theoretic forms which lie beyond the Liouvillian graph recoupling and Racah-forms envisaged by Sanctuary [1]. This is a direct consequence of the dominance of the ln group. It leads to new views on the value of projective group actions as mappings over specialised Liouvillian carrier spaces, and on the need for the replacement of Racah-Wigner (R-W) orthogonality for distinct point sets, by criteria based on explicit properties of invariants [J. Phys.: Math. & Theor. A 41, 015210 (2008)] for multiple invariant systems. Ũ × P group actions over disjoint (L) carrier subspaces, leading to exclusively combinatorial views of the nature of quantal completeness for indistinguishable point-based tensorial sets. Such generalised invariant-theoretic approaches lie beyond the range of Lévi-Civitá generator views, or of Lévy-Leblond and Lévy-Nahas [9] with its additional cyclic-commutators defining mono-invariant DR forms. Comparison of the latter with generalised multiple-invariant techniques provides an answer to the question of precisely why [A]n≥4(X) and [AX]n≥4 NMR system spin dynamics are not ameniable to conventional R-W analysis of recoupled discrete-point tensorial systems. Our work augments earlier Hilbert space views, both of Louck and Biedenharn [21] on boson pattern projective mapping, and of Corio [19]. The roles of recent ln group action and (λ ⊢ n)-Schur combinatorial concepts, as well as of polyhedral-combinatorial modelling over invariance algebras, contribute significantly to our understanding of invariant-based techniques of Liouville dual tensorial sets for automorphic NMR spin physics.1

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.

Hands in space: gesture interaction with augmented-reality interfaces.

PubMed

Billinghurst, Mark; Piumsomboon, Tham; Huidong Bai

2014-01-01

Researchers at the Human Interface Technology Laboratory New Zealand (HIT Lab NZ) are investigating free-hand gestures for natural interaction with augmented-reality interfaces. They've applied the results to systems for desktop computers and mobile devices.

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…

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.

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

Statistical learning from nonrecurrent experience with discrete input variables and recursive-error-minimization equations

NASA Astrophysics Data System (ADS)

Carter, Jeffrey R.; Simon, Wayne E.

1990-08-01

Neural networks are trained using Recursive Error Minimization (REM) equations to perform statistical classification. Using REM equations with continuous input variables reduces the required number of training experiences by factors of one to two orders of magnitude over standard back propagation. Replacing the continuous input variables with discrete binary representations reduces the number of connections by a factor proportional to the number of variables reducing the required number of experiences by another order of magnitude. Undesirable effects of using recurrent experience to train neural networks for statistical classification problems are demonstrated and nonrecurrent experience used to avoid these undesirable effects. 1. THE 1-41 PROBLEM The statistical classification problem which we address is is that of assigning points in ddimensional space to one of two classes. The first class has a covariance matrix of I (the identity matrix) the covariance matrix of the second class is 41. For this reason the problem is known as the 1-41 problem. Both classes have equal probability of occurrence and samples from both classes may appear anywhere throughout the ddimensional space. Most samples near the origin of the coordinate system will be from the first class while most samples away from the origin will be from the second class. Since the two classes completely overlap it is impossible to have a classifier with zero error. The minimum possible error is known as the Bayes error and

Virtual landmarks

NASA Astrophysics Data System (ADS)

Tong, Yubing; Udupa, Jayaram K.; Odhner, Dewey; Bai, Peirui; Torigian, Drew A.

2017-03-01

Much has been published on finding landmarks on object surfaces in the context of shape modeling. While this is still an open problem, many of the challenges of past approaches can be overcome by removing the restriction that landmarks must be on the object surface. The virtual landmarks we propose may reside inside, on the boundary of, or outside the object and are tethered to the object. Our solution is straightforward, simple, and recursive in nature, proceeding from global features initially to local features in later levels to detect landmarks. Principal component analysis (PCA) is used as an engine to recursively subdivide the object region. The object itself may be represented in binary or fuzzy form or with gray values. The method is illustrated in 3D space (although it generalizes readily to spaces of any dimensionality) on four objects (liver, trachea and bronchi, and outer boundaries of left and right lungs along pleura) derived from 5 patient computed tomography (CT) image data sets of the thorax and abdomen. The virtual landmark identification approach seems to work well on different structures in different subjects and seems to detect landmarks that are homologously located in different samples of the same object. The approach guarantees that virtual landmarks are invariant to translation, scaling, and rotation of the object/image. Landmarking techniques are fundamental for many computer vision and image processing applications, and we are currently exploring the use virtual landmarks in automatic anatomy recognition and object analytics.

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.

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.

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.

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,…

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…

Early Program Development

NASA Image and Video Library

1969-01-01

As part of the Space Task Group's recommendations for more commonality and integration in America's space program, Marshall Space Flight Center engineers proposed an orbiting propellant storage facility to augment Space Shuttle missions. In this artist's concept from 1969 an early version of the Space Shuttle is shown refueling at the facility.

Global navigation satellite systems performance analysis and augmentation strategies in aviation

NASA Astrophysics Data System (ADS)

Sabatini, Roberto; Moore, Terry; Ramasamy, Subramanian

2017-11-01

In an era of significant air traffic expansion characterized by a rising congestion of the radiofrequency spectrum and a widespread introduction of Unmanned Aircraft Systems (UAS), Global Navigation Satellite Systems (GNSS) are being exposed to a variety of threats including signal interferences, adverse propagation effects and challenging platform-satellite relative dynamics. Thus, there is a need to characterize GNSS signal degradations and assess the effects of interfering sources on the performance of avionics GNSS receivers and augmentation systems used for an increasing number of mission-essential and safety-critical aviation tasks (e.g., experimental flight testing, flight inspection/certification of ground-based radio navigation aids, wide area navigation and precision approach). GNSS signal deteriorations typically occur due to antenna obscuration caused by natural and man-made obstructions present in the environment (e.g., elevated terrain and tall buildings when flying at low altitude) or by the aircraft itself during manoeuvring (e.g., aircraft wings and empennage masking the on-board GNSS antenna), ionospheric scintillation, Doppler shift, multipath, jamming and spurious satellite transmissions. Anyone of these phenomena can result in partial to total loss of tracking and possible tracking errors, depending on the severity of the effect and the receiver characteristics. After designing GNSS performance threats, the various augmentation strategies adopted in the Communication, Navigation, Surveillance/Air Traffic Management and Avionics (CNS + A) context are addressed in detail. GNSS augmentation can take many forms but all strategies share the same fundamental principle of providing supplementary information whose objective is improving the performance and/or trustworthiness of the system. Hence it is of paramount importance to consider the synergies offered by different augmentation strategies including Space Based Augmentation System (SBAS), Ground Based Augmentation System (GBAS), Aircraft Based Augmentation System (ABAS) and Receiver Autonomous Integrity Monitoring (RAIM). Furthermore, by employing multi-GNSS constellations and multi-sensor data fusion techniques, improvements in availability and continuity can be obtained. SBAS is designed to improve GNSS system integrity and accuracy for aircraft navigation and landing, while an alternative approach to GNSS augmentation is to transmit integrity and differential correction messages from ground-based augmentation systems (GBAS). In addition to existing space and ground based augmentation systems, GNSS augmentation may take the form of additional information being provided by other on-board avionics systems, such as in ABAS. As these on-board systems normally operate via separate principles than GNSS, they are not subject to the same sources of error or interference. Using suitable data link and data processing technologies on the ground, a certified ABAS capability could be a core element of a future GNSS Space-Ground-Aircraft Augmentation Network (SGAAN). Although current augmentation systems can provide significant improvement of GNSS navigation performance, a properly designed and flight-certified SGAAN could play a key role in trusted autonomous system and cyber-physical system applications such as UAS Sense-and-Avoid (SAA).

Recursive estimators of mean-areal and local bias in precipitation products that account for conditional bias

NASA Astrophysics Data System (ADS)

Zhang, Yu; Seo, Dong-Jun

2017-03-01

This paper presents novel formulations of Mean field bias (MFB) and local bias (LB) correction schemes that incorporate conditional bias (CB) penalty. These schemes are based on the operational MFB and LB algorithms in the National Weather Service (NWS) Multisensor Precipitation Estimator (MPE). By incorporating CB penalty in the cost function of exponential smoothers, we are able to derive augmented versions of recursive estimators of MFB and LB. Two extended versions of MFB algorithms are presented, one incorporating spatial variation of gauge locations only (MFB-L), and the second integrating both gauge locations and CB penalty (MFB-X). These two MFB schemes and the extended LB scheme (LB-X) are assessed relative to the original MFB and LB algorithms (referred to as MFB-O and LB-O, respectively) through a retrospective experiment over a radar domain in north-central Texas, and through a synthetic experiment over the Mid-Atlantic region. The outcome of the former experiment indicates that introducing the CB penalty to the MFB formulation leads to small, but consistent improvements in bias and CB, while its impacts on hourly correlation and Root Mean Square Error (RMSE) are mixed. Incorporating CB penalty in LB formulation tends to improve the RMSE at high rainfall thresholds, but its impacts on bias are also mixed. The synthetic experiment suggests that beneficial impacts are more conspicuous at low gauge density (9 per 58,000 km2), and tend to diminish at higher gauge density. The improvement at high rainfall intensity is partly an outcome of the conservativeness of the extended LB scheme. This conservativeness arises in part from the more frequent presence of negative eigenvalues in the extended covariance matrix which leads to no, or smaller incremental changes to the smoothed rainfall amounts.

Mechanism of transient force augmentation varying with two distinct timescales for interacting vortex rings

NASA Astrophysics Data System (ADS)

Fu, Zhidong; Qin, Suyang; Liu, Hong

2014-01-01

The dynamics of dual vortex ring flows is studied experimentally and numerically in a model system that consists of a piston-cylinder apparatus. The flows are generated by double identical strokes which have the velocity profile characterized by the sinusoidal function of half the period. By calculating the total wake impulse in two strokes in the experiments, it is found that the average propulsive force increases by 50% in the second stroke for the sufficiently small stroke length, compared with the first stroke. In the numerical simulations, two types of transient force augmentation are revealed, there being the transient force augmentation for the small stroke lengths and the absolute transient force augmentation for the large stroke lengths. The relative transient force augmentation increases to 78% for L/D = 1, while the absolute transient force augmentation for L/D = 4 is twice as much as that for L/D = 1. Further investigation demonstrates that the force augmentation is attributed to the interaction between vortex rings, which induces transport of vortex impulse and more evident fluid entrainment. The critical situation of vortex ring separation is defined and indicated, with vortex spacing falling in a narrow gap when the stroke lengths vary. A new model is proposed concerning the limiting process of impulse, further suggesting that apart from vortex formation timescale, vortex spacing should be interpreted as an independent timescale to reflect the dynamics of vortex interaction.

Kalman filters for fractional discrete-time stochastic systems along with time-delay in the observation signal

NASA Astrophysics Data System (ADS)

Torabi, H.; Pariz, N.; Karimpour, A.

2016-02-01

This paper investigates fractional Kalman filters when time-delay is entered in the observation signal in the discrete-time stochastic fractional order state-space representation. After investigating the common fractional Kalman filter, we try to derive a fractional Kalman filter for time-delay fractional systems. A detailed derivation is given. Fractional Kalman filters will be used to estimate recursively the states of fractional order state-space systems based on minimizing the cost function when there is a constant time delay (d) in the observation signal. The problem will be solved by converting the filtering problem to a usual d-step prediction problem for delay-free fractional systems.

Dynamics and computation in functional shifts

NASA Astrophysics Data System (ADS)

Namikawa, Jun; Hashimoto, Takashi

2004-07-01

We introduce a new type of shift dynamics as an extended model of symbolic dynamics, and investigate the characteristics of shift spaces from the viewpoints of both dynamics and computation. This shift dynamics is called a functional shift, which is defined by a set of bi-infinite sequences of some functions on a set of symbols. To analyse the complexity of functional shifts, we measure them in terms of topological entropy, and locate their languages in the Chomsky hierarchy. Through this study, we argue that considering functional shifts from the viewpoints of both dynamics and computation gives us opposite results about the complexity of systems. We also describe a new class of shift spaces whose languages are not recursively enumerable.

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.

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.

Toward faster and more accurate star sensors using recursive centroiding and star identification

NASA Astrophysics Data System (ADS)

Samaan, Malak Anees

The objective of this research is to study different novel developed techniques for spacecraft attitude determination methods using star tracker sensors. This dissertation addresses various issues on developing improved star tracker software, presents new approaches for better performance of star trackers, and considers applications to realize high precision attitude estimates. Star-sensors are often included in a spacecraft attitude-system instrument suite, where high accuracy pointing capability is required. Novel methods for image processing, camera parameters ground calibration, autonomous star pattern recognition, and recursive star identification are researched and implemented to achieve high accuracy and a high frame rate star tracker that can be used for many space missions. This dissertation presents the methods and algorithms implemented for the one Field of View 'FOV'Star NavI sensor that was tested aboard the STS-107 mission in spring 2003 and the two fields of view StarNavII sensor for the EO-3 spacecraft scheduled for launch in 2007. The results of this research enable advances in spacecraft attitude determination based upon real time star sensing and pattern recognition. Building upon recent developments in image processing, pattern recognition algorithms, focal plane detectors, electro-optics, and microprocessors, the star tracker concept utilized in this research has the following key objectives for spacecraft of the future: lower cost, lower mass and smaller volume, increased robustness to environment-induced aging and instrument response variations, increased adaptability and autonomy via recursive self-calibration and health-monitoring on-orbit. Many of these attributes are consequences of improved algorithms that are derived in this dissertation.

Probing compressed mass spectra in electroweak supersymmetry with Recursive Jigsaw Reconstruction

NASA Astrophysics Data System (ADS)

Santoni, M.

2018-05-01

The lack of evidence for the production of colored supersymmetric particles at the LHC has increased interest in searches for superpartners of the electroweak SM gauge bosons, namely the neutralinos and charginos. These are challenging due to the weak nature of the production process, and the existing discovery reach has significant gaps in due to the difficulty of separating the supersymmetric signal from SM diboson events that produce similar final states and kinematics. We apply the Recursive Jigsaw Reconstruction technique to study final states enriched in charged leptons and missing transverse momentum, focusing on compressed topologies with direct production of charginos and neutralinos decaying to the lightest neutral supersymmetric particle through the emission of W and Z bosons. After presenting prototype analysis designs for future LHC runs, we demonstrate that its detectors have the potential to probe a significant amount of unexplored parameter space for chargino-neutralino associated production within the next few years, and show that the very challenging successful search for chargino pair production with compressed spectra might be possible by the end of the LHC lifetime.

14 CFR 117.17 - Flight duty period: Augmented flightcrew.

Code of Federal Regulations, 2013 CFR

2013-01-01

...)(3)(i) of this chapter must be at the flight controls. ... 14 Aeronautics and Space 3 2013-01-01 2013-01-01 false Flight duty period: Augmented flightcrew... FLIGHT AND DUTY LIMITATIONS AND REST REQUIREMENTS: FLIGHTCREW MEMBERS (EFF. 1-4-14) § 117.17 Flight duty...

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

Cross-Validation of Survival Bump Hunting by Recursive Peeling Methods.

PubMed

Dazard, Jean-Eudes; Choe, Michael; LeBlanc, Michael; Rao, J Sunil

2014-08-01

We introduce a survival/risk bump hunting framework to build a bump hunting model with a possibly censored time-to-event type of response and to validate model estimates. First, we describe the use of adequate survival peeling criteria to build a survival/risk bump hunting model based on recursive peeling methods. Our method called "Patient Recursive Survival Peeling" is a rule-induction method that makes use of specific peeling criteria such as hazard ratio or log-rank statistics. Second, to validate our model estimates and improve survival prediction accuracy, we describe a resampling-based validation technique specifically designed for the joint task of decision rule making by recursive peeling (i.e. decision-box) and survival estimation. This alternative technique, called "combined" cross-validation is done by combining test samples over the cross-validation loops, a design allowing for bump hunting by recursive peeling in a survival setting. We provide empirical results showing the importance of cross-validation and replication.

Cross-Validation of Survival Bump Hunting by Recursive Peeling Methods

PubMed Central

Dazard, Jean-Eudes; Choe, Michael; LeBlanc, Michael; Rao, J. Sunil

2015-01-01

We introduce a survival/risk bump hunting framework to build a bump hunting model with a possibly censored time-to-event type of response and to validate model estimates. First, we describe the use of adequate survival peeling criteria to build a survival/risk bump hunting model based on recursive peeling methods. Our method called “Patient Recursive Survival Peeling” is a rule-induction method that makes use of specific peeling criteria such as hazard ratio or log-rank statistics. Second, to validate our model estimates and improve survival prediction accuracy, we describe a resampling-based validation technique specifically designed for the joint task of decision rule making by recursive peeling (i.e. decision-box) and survival estimation. This alternative technique, called “combined” cross-validation is done by combining test samples over the cross-validation loops, a design allowing for bump hunting by recursive peeling in a survival setting. We provide empirical results showing the importance of cross-validation and replication. PMID:26997922

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.

Energy Monitoring and Targeting as diagnosis; Applying work analysis to adapt a statistical change detection strategy using representation aiding

NASA Astrophysics Data System (ADS)

Hilliard, Antony

Energy Monitoring and Targeting is a well-established business process that develops information about utility energy consumption in a business or institution. While M&T has persisted as a worthwhile energy conservation support activity, it has not been widely adopted. This dissertation explains M&T challenges in terms of diagnosing and controlling energy consumption, informed by a naturalistic field study of M&T work. A Cognitive Work Analysis of M&T identifies structures that diagnosis can search, information flows un-supported in canonical support tools, and opportunities to extend the most popular tool for MM&T: Cumulative Sum of Residuals (CUSUM) charts. A design application outlines how CUSUM charts were augmented with a more contemporary statistical change detection strategy, Recursive Parameter Estimates, modified to better suit the M&T task using Representation Aiding principles. The design was experimentally evaluated in a controlled M&T synthetic task, and was shown to significantly improve diagnosis performance.

Recursive dynamics for flexible multibody systems using spatial operators

NASA Technical Reports Server (NTRS)

Jain, A.; Rodriguez, G.

1990-01-01

Due to their structural flexibility, spacecraft and space manipulators are multibody systems with complex dynamics and possess a large number of degrees of freedom. Here the spatial operator algebra methodology is used to develop a new dynamics formulation and spatially recursive algorithms for such flexible multibody systems. A key feature of the formulation is that the operator description of the flexible system dynamics is identical in form to the corresponding operator description of the dynamics of rigid multibody systems. A significant advantage of this unifying approach is that it allows ideas and techniques for rigid multibody systems to be easily applied to flexible multibody systems. The algorithms use standard finite-element and assumed modes models for the individual body deformation. A Newton-Euler Operator Factorization of the mass matrix of the multibody system is first developed. It forms the basis for recursive algorithms such as for the inverse dynamics, the computation of the mass matrix, and the composite body forward dynamics for the system. Subsequently, an alternative Innovations Operator Factorization of the mass matrix, each of whose factors is invertible, is developed. It leads to an operator expression for the inverse of the mass matrix, and forms the basis for the recursive articulated body forward dynamics algorithm for the flexible multibody system. For simplicity, most of the development here focuses on serial chain multibody systems. However, extensions of the algorithms to general topology flexible multibody systems are described. While the computational cost of the algorithms depends on factors such as the topology and the amount of flexibility in the multibody system, in general, it appears that in contrast to the rigid multibody case, the articulated body forward dynamics algorithm is the more efficient algorithm for flexible multibody systems containing even a small number of flexible bodies. The variety of algorithms described here permits a user to choose the algorithm which is optimal for the multibody system at hand. The availability of a number of algorithms is even more important for real-time applications, where implementation on parallel processors or custom computing hardware is often necessary to maximize speed.

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

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.

Reflected stochastic differential equation models for constrained animal movement

USGS Publications Warehouse

Hanks, Ephraim M.; Johnson, Devin S.; Hooten, Mevin B.

2017-01-01

Movement for many animal species is constrained in space by barriers such as rivers, shorelines, or impassable cliffs. We develop an approach for modeling animal movement constrained in space by considering a class of constrained stochastic processes, reflected stochastic differential equations. Our approach generalizes existing methods for modeling unconstrained animal movement. We present methods for simulation and inference based on augmenting the constrained movement path with a latent unconstrained path and illustrate this augmentation with a simulation example and an analysis of telemetry data from a Steller sea lion (Eumatopias jubatus) in southeast Alaska.

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.

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.

Advanced Visual and Instruction Systems for Maintenance Support (AVIS-MS)

DTIC Science & Technology

2006-12-01

Hayashi , "Augmentable Reality: Situated Communication through Physical and Digital Spaces," Proc. 2nd Int’l Symp. Wearable Computers, IEEE CS Press...H. Ohno , "An Optical See-through Display for Mutual Occlusion of Real and Virtual Environments," Proc. Int’l Symp. Augmented Reality 2000 (ISARO0

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

None

Sandia National Laboratories has developed a state-of-the-art augmented reality training system for close-quarters combat (CQB). This system uses a wearable augmented reality system to place the user in a real environment while engaging enemy combatants in virtual space (Boston Dynamics DI-Guy). Umbra modeling and simulation environment is used to integrate and control the AR system.

H2OTSTUF: Appropriate Operating Regimes for Magnetohydrodynamic Augmentation

NASA Technical Reports Server (NTRS)

Jones, Jonathan E.; Hawk, Clark W.

1998-01-01

A trade study of magnetohydrodynamic (MHD) augmented propulsion reveals a unique operating regime at lower thrust levels. Substantial mass savings are realized over conventional chemical, solar, and electrical propulsion concepts when MHD augmentation is used to obtain optimal I(sub sp). However, trip times for the most conservative estimates of power plant specific impulse and accelerator efficiency may be prohibitively long. Quasi-one-dimensional calculations show that a solar or nuclear thermal system augmented by MHD can provide competitive performance while utilizing a diverse range of propellants including water, which is available from the Space Shuttle, the Moon, asteroids, and various moons and planets within our solar system. The use of in-situ propellants will reduce costs of space operations as well as enable human exploration of our Solar System. The following conclusions can be drawn from the results of the mission trade study: (1) There exists a maximum thrust or mass flow rate above which MHD augmentation increases the initial mass in low earth orbit (LEO); (2) Mass saving of over 50% can be realized for unique combination of solar/MHD systems; (3) Trip times for systems utilizing current power supply technology may be prohibitively long. Theoretical predictions of MHD performance for in space propulsion systems show that improved efficiencies can reduce trip times to acceptable levels; (4) Long trip times indicative of low thrust systems can be shortened by an increase in the MHD accelerator efficiency or a decrease in the specific mass of the power supply and power processing unit; and (5) As for all propulsion concepts, missions with larger (Delta)v's benefit more from the increased specific impulse resulting from MHD augmentation. Using a quasi-one-dimensional analysis, the required operating conditions for a MHD accelerator to reach acceptable efficiencies are outlined. This analysis shows that substantial non-equilibrium ionization is desirable.

Automation and robotics for the National Space Program

NASA Technical Reports Server (NTRS)

1985-01-01

The emphasis on automation and robotics in the augmentation of the human centered systems as it concerns the space station is discussed. How automation and robotics can amplify the capabilities of humans is detailed. A detailed developmental program for the space station is outlined.

NASA's New Orbital Space Plane: A Bridge to the Future

NASA Technical Reports Server (NTRS)

Davis, Stephan R.; Engler, Leah M.; Fisher, Mark F.; Dumbacher, Dan L.; Boswell, Barry E.

2003-01-01

NASA is developing a new spacecraft system called the Orbital Space Plane (OSP). The OSP will be launched on an expendable launch vehicle and serve to augment the shuttle in support of the International Space Station by transporting astronauts to and from the International Space Station and by providing a crew rescue system.

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.

Flight Testing of the Space Launch System (SLS) Adaptive Augmenting Control (AAC) Algorithm on an F/A-18

NASA Technical Reports Server (NTRS)

Dennehy, Cornelius J.; VanZwieten, Tannen S.; Hanson, Curtis E.; Wall, John H.; Miller, Chris J.; Gilligan, Eric T.; Orr, Jeb S.

2014-01-01

The Marshall Space Flight Center (MSFC) Flight Mechanics and Analysis Division developed an adaptive augmenting control (AAC) algorithm for launch vehicles that improves robustness and performance on an as-needed basis by adapting a classical control algorithm to unexpected environments or variations in vehicle dynamics. This was baselined as part of the Space Launch System (SLS) flight control system. The NASA Engineering and Safety Center (NESC) was asked to partner with the SLS Program and the Space Technology Mission Directorate (STMD) Game Changing Development Program (GCDP) to flight test the AAC algorithm on a manned aircraft that can achieve a high level of dynamic similarity to a launch vehicle and raise the technology readiness of the algorithm early in the program. This document reports the outcome of the NESC assessment.

Addressing the Influence of Space Weather on Airline Navigation

NASA Technical Reports Server (NTRS)

Sparks, Lawrence

2012-01-01

The advent of satellite-based augmentation systems has made it possible to navigate aircraft safely using radio signals emitted by global navigation satellite systems (GNSS) such as the Global Positioning System. As a signal propagates through the earth's ionosphere, it suffers delay that is proportional to the total electron content encountered along the raypath. Since the magnitude of this total electron content is strongly influenced by space weather, the safety and reliability of GNSS for airline navigation requires continual monitoring of the state of the ionosphere and calibration of ionospheric delay. This paper examines the impact of space weather on GNSS-based navigation and provides an overview of how the Wide Area Augmentation System protects its users from positioning error due to ionospheric disturbances

Melatonin enhances vertical bone augmentation in rat calvaria secluded spaces.

PubMed

Shino, Hiromichi; Hasuike, Akira; Arai, Yoshinori; Honda, Masaki; Isokawa, Keitaro; Sato, Shuichi

2016-01-01

Melatonin has many roles, including bone remodeling and osseointegration of dental implants. The topical application of melatonin facilitated bone regeneration in bone defects. We evaluated the effects of topical application of melatonin on vertical bone augmentation in rat calvaria secluded spaces. In total, 12 male Fischer rats were used and two plastic caps were fixed in the calvarium. One plastic cap was filled with melatonin powder and the other was left empty. Newly generated bone at bone defects and within the plastic caps was evaluated using micro-CT and histological sections. New bone regeneration within the plastic cap was increased significantly in the melatonin versus the control group. Melatonin promoted vertical bone regeneration in rat calvaria in the secluded space within the plastic cap.

A convenient basis for the Izergin-Korepin model

NASA Astrophysics Data System (ADS)

Qiao, Yi; Zhang, Xin; Hao, Kun; Cao, Junpeng; Li, Guang-Liang; Yang, Wen-Li; Shi, Kangjie

2018-05-01

We propose a convenient orthogonal basis of the Hilbert space for the quantum spin chain associated with the A2(2) algebra (or the Izergin-Korepin model). It is shown that compared with the original basis the monodromy-matrix elements acting on this basis take relatively simple forms, which is quite similar as that for the quantum spin chain associated with An algebra in the so-called F-basis. As an application of our general results, we present the explicit recursive expressions of the Bethe states in this basis for the Izergin-Korepin model.

Methods of Helium Injection and Removal for Heat Transfer Augmentation

NASA Technical Reports Server (NTRS)

Haight, Harlan; Kegley, Jeff; Bourdreaux, Meghan

2008-01-01

While augmentation of heat transfer from a test article by helium gas at low pressures is well known, the method is rarely employed during space simulation testing because the test objectives usually involve simulation of an orbital thermal environment. Test objectives of cryogenic optical testing at Marshall Space Flight Center's X-ray Cryogenic Facility (XRCF) have typically not been constrained by orbital environment parameters. As a result, several methods of helium injection have been utilized at the XRCF since 1999 to decrease thermal transition times. A brief synopsis of these injection (and removal) methods including will be presented.

Methods of Helium Injection and Removal for Heat Transfer Augmentation

NASA Technical Reports Server (NTRS)

Kegley, Jeffrey

2008-01-01

While augmentation of heat transfer from a test article by helium gas at low pressures is well known, the method is rarely employed during space simulation testing because the test objectives are to simulate an orbital thermal environment. Test objectives of cryogenic optical testing at Marshall Space Flight Center's X-ray Calibration Facility (XRCF) have typically not been constrained by orbital environment parameters. As a result, several methods of helium injection have been utilized at the XRCF since 1999 to decrease thermal transition times. A brief synopsis of these injection (and removal) methods including will be presented.

Launch Vehicle Manual Steering with Adaptive Augmenting Control In-flight Evaluations Using a Piloted Aircraft

NASA Technical Reports Server (NTRS)

Hanson, Curt

2014-01-01

An adaptive augmenting control algorithm for the Space Launch System has been developed at the Marshall Space Flight Center as part of the launch vehicles baseline flight control system. A prototype version of the SLS flight control software was hosted on a piloted aircraft at the Armstrong Flight Research Center to demonstrate the adaptive controller on a full-scale realistic application in a relevant flight environment. Concerns regarding adverse interactions between the adaptive controller and a proposed manual steering mode were investigated by giving the pilot trajectory deviation cues and pitch rate command authority.

Utilization of the Space Vision System as an Augmented Reality System For Mission Operations

NASA Technical Reports Server (NTRS)

Maida, James C.; Bowen, Charles

2003-01-01

Augmented reality is a technique whereby computer generated images are superimposed on live images for visual enhancement. Augmented reality can also be characterized as dynamic overlays when computer generated images are registered with moving objects in a live image. This technique has been successfully implemented, with low to medium levels of registration precision, in an NRA funded project entitled, "Improving Human Task Performance with Luminance Images and Dynamic Overlays". Future research is already being planned to also utilize a laboratory-based system where more extensive subject testing can be performed. However successful this might be, the problem will still be whether such a technology can be used with flight hardware. To answer this question, the Canadian Space Vision System (SVS) will be tested as an augmented reality system capable of improving human performance where the operation requires indirect viewing. This system has already been certified for flight and is currently flown on each shuttle mission for station assembly. Successful development and utilization of this system in a ground-based experiment will expand its utilization for on-orbit mission operations. Current research and development regarding the use of augmented reality technology is being simulated using ground-based equipment. This is an appropriate approach for development of symbology (graphics and annotation) optimal for human performance and for development of optimal image registration techniques. It is anticipated that this technology will become more pervasive as it matures. Because we know what and where almost everything is on ISS, this reduces the registration problem and improves the computer model of that reality, making augmented reality an attractive tool, provided we know how to use it. This is the basis for current research in this area. However, there is a missing element to this process. It is the link from this research to the current ISS video system and to flight hardware capable of utilizing this technology. This is the basis for this proposed Space Human Factors Engineering project, the determination of the display symbology within the performance limits of the Space Vision System that will objectively improve human performance. This utilization of existing flight hardware will greatly reduce the costs of implementation for flight. Besides being used onboard shuttle and space station and as a ground-based system for mission operational support, it also has great potential for science and medical training and diagnostics, remote learning, team learning, video/media conferencing, and educational outreach.

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

Chaos control in delayed phase space constructed by the Takens embedding theory

NASA Astrophysics Data System (ADS)

Hajiloo, R.; Salarieh, H.; Alasty, A.

2018-01-01

In this paper, the problem of chaos control in discrete-time chaotic systems with unknown governing equations and limited measurable states is investigated. Using the time-series of only one measurable state, an algorithm is proposed to stabilize unstable fixed points. The approach consists of three steps: first, using Takens embedding theory, a delayed phase space preserving the topological characteristics of the unknown system is reconstructed. Second, a dynamic model is identified by recursive least squares method to estimate the time-series data in the delayed phase space. Finally, based on the reconstructed model, an appropriate linear delayed feedback controller is obtained for stabilizing unstable fixed points of the system. Controller gains are computed using a systematic approach. The effectiveness of the proposed algorithm is examined by applying it to the generalized hyperchaotic Henon system, prey-predator population map, and the discrete-time Lorenz system.

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.

NASA space station automation: AI-based technology review. Executive summary

NASA Technical Reports Server (NTRS)

Firschein, O.; Georgeff, M. P.; Park, W.; Cheeseman, P. C.; Goldberg, J.; Neumann, P.; Kautz, W. H.; Levitt, K. N.; Rom, R. J.; Poggio, A. A.

1985-01-01

Research and Development projects in automation technology for the Space Station are described. Artificial Intelligence (AI) based technologies are planned to enhance crew safety through reduced need for EVA, increase crew productivity through the reduction of routine operations, increase space station autonomy, and augment space station capability through the use of teleoperation and robotics.

An avionics scenario and command model description for Space Generic Open Avionics Architecture (SGOAA)

NASA Technical Reports Server (NTRS)

Stovall, John R.; Wray, Richard B.

1994-01-01

This paper presents a description of a model for a space vehicle operational scenario and the commands for avionics. This model will be used in developing a dynamic architecture simulation model using the Statemate CASE tool for validation of the Space Generic Open Avionics Architecture (SGOAA). The SGOAA has been proposed as an avionics architecture standard to NASA through its Strategic Avionics Technology Working Group (SATWG) and has been accepted by the Society of Automotive Engineers (SAE) for conversion into an SAE Avionics Standard. This architecture was developed for the Flight Data Systems Division (FDSD) of the NASA Johnson Space Center (JSC) by the Lockheed Engineering and Sciences Company (LESC), Houston, Texas. This SGOAA includes a generic system architecture for the entities in spacecraft avionics, a generic processing external and internal hardware architecture, and a nine class model of interfaces. The SGOAA is both scalable and recursive and can be applied to any hierarchical level of hardware/software processing systems.

U.S. Space Programs: Civilian, Military, and Commercial

DTIC Science & Technology

2006-06-13

NASA) conducts the most visible space activities. For FY2006, NASA received $16.623 billion when adjusted for two rescissions and an augmentation for...postponed because of a foam-shedding event during that launch similar to that which led to the loss of Columbia. Pursuant to the Vision for Space

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.

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.

A decoupled recursive approach for constrained flexible multibody system dynamics

NASA Technical Reports Server (NTRS)

Lai, Hao-Jan; Kim, Sung-Soo; Haug, Edward J.; Bae, Dae-Sung

1989-01-01

A variational-vector calculus approach is employed to derive a recursive formulation for dynamic analysis of flexible multibody systems. Kinematic relationships for adjacent flexible bodies are derived in a companion paper, using a state vector notation that represents translational and rotational components simultaneously. Cartesian generalized coordinates are assigned for all body and joint reference frames, to explicitly formulate deformation kinematics under small deformation kinematics and an efficient flexible dynamics recursive algorithm is developed. Dynamic analysis of a closed loop robot is performed to illustrate efficiency of the algorithm.

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.

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.

A growth path for deep space communications

NASA Technical Reports Server (NTRS)

Layland, J. W.; Smith, J. G.

1987-01-01

Increased Deep Space Network (DPN) receiving capability far beyond that now available for Voyager is achievable through a mix of increased antenna aperture and increased frequency of operation. In this note a sequence of options are considered: adding midsized antennas for arraying with the existing network at X-band; converting to Ka-band and adding array elements; augmenting the DSN with an orbiting Ka-band station; and augmenting the DSN with an optical receiving capability, either on the ground or in space. Costs of these options are compared as means of achieving significantly increased receiving capability. The envelope of lowest costs projects a possible path for moving from X-band to Ka-band and thence to optical frequencies, and potentially for moving from ground-based to space-based apertures. The move to Ka-band is clearly of value now, with development of optical communications technology a good investment for the future.

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.

Teleoperator systems for manned space missions

NASA Technical Reports Server (NTRS)

Interian, A.

1972-01-01

The development of remote mechanical systems to augment man's capabilities in our manned space effort is considered. A teleoperator system extends man's innate intelligence and sensory capabilities to distant hostile and hazardous environments through a manipulator-equipped spacecraft and an RF link. Examined are space teleoperator system applications in the space station/space shuttle program, which is where the most immediate need exists and the potential return is greatest.

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.

Cache Locality Optimization for Recursive Programs

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

Lifflander, Jonathan; Krishnamoorthy, Sriram

We present an approach to optimize the cache locality for recursive programs by dynamically splicing--recursively interleaving--the execution of distinct function invocations. By utilizing data effect annotations, we identify concurrency and data reuse opportunities across function invocations and interleave them to reduce reuse distance. We present algorithms that efficiently track effects in recursive programs, detect interference and dependencies, and interleave execution of function invocations using user-level (non-kernel) lightweight threads. To enable multi-core execution, a program is parallelized using a nested fork/join programming model. Our cache optimization strategy is designed to work in the context of a random work stealing scheduler. Wemore » present an implementation using the MIT Cilk framework that demonstrates significant improvements in sequential and parallel performance, competitive with a state-of-the-art compile-time optimizer for loop programs and a domain- specific optimizer for stencil programs.« less

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.

U.S. space-based positioning, navigation, and timing policy : fact sheet.

DOT National Transportation Integrated Search

2004-12-04

The President authorized a new national policy on December 8, 2004 that establishes guidance and implementation actions for space-based positioning, navigation, and timing programs, augmentations, and activities for U.S. national and homeland securit...

The Palatal Window for Treating an Incompletely Augmented Maxillary Sinus.

PubMed

Florio, Salvatore; Suzuki, Takanori; Cho, Sang-Choon

2017-04-01

Maxillary sinus augmentation through a lateral window is reported as one of the most predictable bone augmentation procedures before implant placement. The elevation of the membrane represents a delicate and crucial step that allows the creation of the space for the bone graft material. If the elevation is not completed, the regenerated bone might be inadequate for the implant placement. In this case, a new intervention will be necessary to complete the bone augmentation. Reaccessing from a lateral window, however, would be challenging due to thickness of the buccal boney wall because of the first grafting procedure; therefore, a different approach has to be used. The aim of this case report is to present the palatal window technique for treating incompletely augmented maxillary sinus. The detailed step-by-step diagnostic and surgical procedures are described, and the advantages and limitations of the technique are discussed through a review of the literature.

A numerical identifiability test for state-space models--application to optimal experimental design.

PubMed

Hidalgo, M E; Ayesa, E

2001-01-01

This paper describes a mathematical tool for identifiability analysis, easily applicable to high order non-linear systems modelled in state-space and implementable in simulators with a time-discrete approach. This procedure also permits a rigorous analysis of the expected estimation errors (average and maximum) in calibration experiments. The methodology is based on the recursive numerical evaluation of the information matrix during the simulation of a calibration experiment and in the setting-up of a group of information parameters based on geometric interpretations of this matrix. As an example of the utility of the proposed test, the paper presents its application to an optimal experimental design of ASM Model No. 1 calibration, in order to estimate the maximum specific growth rate microH and the concentration of heterotrophic biomass XBH.

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.

Overview of NASA Cryocooler Programs

NASA Technical Reports Server (NTRS)

Boyle, R. F.; Ross, R. G., Jr.; Krebs, Carolyn A. (Technical Monitor)

2001-01-01

Mechanical cryocoolers represent a significant enabling technology for NASA's Earth and Space Science Enterprises, as well as augmenting existing capabilities in space exploration. An over-view is presented of on-going efforts at the Goddard Space Flight Center and the Jet Propulsion Laboratory in support of current flight projects, near-term flight instruments, and long-term technology development.

Navigation Architecture For A Space Mobile Network

NASA Technical Reports Server (NTRS)

Valdez, Jennifer E.; Ashman, Benjamin; Gramling, Cheryl; Heckler, Gregory W.; Carpenter, Russell

2016-01-01

The Tracking and Data Relay Satellite System (TDRSS) Augmentation Service for Satellites (TASS) is a proposed beacon service to provide a global, space-based GPS augmentation service based on the NASA Global Differential GPS (GDGPS) System. The TASS signal will be tied to the GPS time system and usable as an additional ranging and Doppler radiometric source. Additionally, it will provide data vital to autonomous navigation in the near Earth regime, including space weather information, TDRS ephemerides, Earth Orientation Parameters (EOP), and forward commanding capability. TASS benefits include enhancing situational awareness, enabling increased autonomy, and providing near real-time command access for user platforms. As NASA Headquarters Space Communication and Navigation Office (SCaN) begins to move away from a centralized network architecture and towards a Space Mobile Network (SMN) that allows for user initiated services, autonomous navigation will be a key part of such a system. This paper explores how a TASS beacon service enables the Space Mobile Networking paradigm, what a typical user platform would require, and provides an in-depth analysis of several navigation scenarios and operations concepts.

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.

Simplified Syndrome Decoding of (n, 1) Convolutional Codes

NASA Technical Reports Server (NTRS)

Reed, I. S.; Truong, T. K.

1983-01-01

A new syndrome decoding algorithm for the (n, 1) convolutional codes (CC) that is different and simpler than the previous syndrome decoding algorithm of Schalkwijk and Vinck is presented. The new algorithm uses the general solution of the polynomial linear Diophantine equation for the error polynomial vector E(D). This set of Diophantine solutions is a coset of the CC space. A recursive or Viterbi-like algorithm is developed to find the minimum weight error vector cirumflex E(D) in this error coset. An example illustrating the new decoding algorithm is given for the binary nonsymmetric (2,1)CC.

A class of least-squares filtering and identification algorithms with systolic array architectures

NASA Technical Reports Server (NTRS)

Kalson, Seth Z.; Yao, Kung

1991-01-01

A unified approach is presented for deriving a large class of new and previously known time- and order-recursive least-squares algorithms with systolic array architectures, suitable for high-throughput-rate and VLSI implementations of space-time filtering and system identification problems. The geometrical derivation given is unique in that no assumption is made concerning the rank of the sample data correlation matrix. This method utilizes and extends the concept of oblique projections, as used previously in the derivations of the least-squares lattice algorithms. Exponentially weighted least-squares criteria are considered for both sliding and growing memory.

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.

Augmented reality based real-time subcutaneous vein imaging system

PubMed Central

Ai, Danni; Yang, Jian; Fan, Jingfan; Zhao, Yitian; Song, Xianzheng; Shen, Jianbing; Shao, Ling; Wang, Yongtian

2016-01-01

A novel 3D reconstruction and fast imaging system for subcutaneous veins by augmented reality is presented. The study was performed to reduce the failure rate and time required in intravenous injection by providing augmented vein structures that back-project superimposed veins on the skin surface of the hand. Images of the subcutaneous vein are captured by two industrial cameras with extra reflective near-infrared lights. The veins are then segmented by a multiple-feature clustering method. Vein structures captured by the two cameras are matched and reconstructed based on the epipolar constraint and homographic property. The skin surface is reconstructed by active structured light with spatial encoding values and fusion displayed with the reconstructed vein. The vein and skin surface are both reconstructed in the 3D space. Results show that the structures can be precisely back-projected to the back of the hand for further augmented display and visualization. The overall system performance is evaluated in terms of vein segmentation, accuracy of vein matching, feature points distance error, duration times, accuracy of skin reconstruction, and augmented display. All experiments are validated with sets of real vein data. The imaging and augmented system produces good imaging and augmented reality results with high speed. PMID:27446690

Augmented reality based real-time subcutaneous vein imaging system.

PubMed

Ai, Danni; Yang, Jian; Fan, Jingfan; Zhao, Yitian; Song, Xianzheng; Shen, Jianbing; Shao, Ling; Wang, Yongtian

2016-07-01

A novel 3D reconstruction and fast imaging system for subcutaneous veins by augmented reality is presented. The study was performed to reduce the failure rate and time required in intravenous injection by providing augmented vein structures that back-project superimposed veins on the skin surface of the hand. Images of the subcutaneous vein are captured by two industrial cameras with extra reflective near-infrared lights. The veins are then segmented by a multiple-feature clustering method. Vein structures captured by the two cameras are matched and reconstructed based on the epipolar constraint and homographic property. The skin surface is reconstructed by active structured light with spatial encoding values and fusion displayed with the reconstructed vein. The vein and skin surface are both reconstructed in the 3D space. Results show that the structures can be precisely back-projected to the back of the hand for further augmented display and visualization. The overall system performance is evaluated in terms of vein segmentation, accuracy of vein matching, feature points distance error, duration times, accuracy of skin reconstruction, and augmented display. All experiments are validated with sets of real vein data. The imaging and augmented system produces good imaging and augmented reality results with high speed.

Augmented paper maps: Exploring the design space of a mixed reality system

NASA Astrophysics Data System (ADS)

Paelke, Volker; Sester, Monika

Paper maps and mobile electronic devices have complementary strengths and shortcomings in outdoor use. In many scenarios, like small craft sailing or cross-country trekking, a complete replacement of maps is neither useful nor desirable. Paper maps are fail-safe, relatively cheap, offer superior resolution and provide large scale overview. In uses like open-water sailing it is therefore mandatory to carry adequate maps/charts. GPS based mobile devices, on the other hand, offer useful features like automatic positioning and plotting, real-time information update and dynamic adaptation to user requirements. While paper maps are now commonly used in combination with mobile GPS devices, there is no meaningful integration between the two, and the combined use leads to a number of interaction problems and potential safety issues. In this paper we explore the design space of augmented paper maps in which maps are augmented with additional functionality through a mobile device to achieve a meaningful integration between device and map that combines their respective strengths.

Generic precise augmented reality guiding system and its calibration method based on 3D virtual model.

PubMed

Liu, Miao; Yang, Shourui; Wang, Zhangying; Huang, Shujun; Liu, Yue; Niu, Zhenqi; Zhang, Xiaoxuan; Zhu, Jigui; Zhang, Zonghua

2016-05-30

Augmented reality system can be applied to provide precise guidance for various kinds of manual works. The adaptability and guiding accuracy of such systems are decided by the computational model and the corresponding calibration method. In this paper, a novel type of augmented reality guiding system and the corresponding designing scheme are proposed. Guided by external positioning equipment, the proposed system can achieve high relative indication accuracy in a large working space. Meanwhile, the proposed system is realized with a digital projector and the general back projection model is derived with geometry relationship between digitized 3D model and the projector in free space. The corresponding calibration method is also designed for the proposed system to obtain the parameters of projector. To validate the proposed back projection model, the coordinate data collected by a 3D positioning equipment is used to calculate and optimize the extrinsic parameters. The final projecting indication accuracy of the system is verified with subpixel pattern projecting technique.

NASA space station automation: AI-based technology review

NASA Technical Reports Server (NTRS)

Firschein, O.; Georgeff, M. P.; Park, W.; Neumann, P.; Kautz, W. H.; Levitt, K. N.; Rom, R. J.; Poggio, A. A.

1985-01-01

Research and Development projects in automation for the Space Station are discussed. Artificial Intelligence (AI) based automation technologies are planned to enhance crew safety through reduced need for EVA, increase crew productivity through the reduction of routine operations, increase space station autonomy, and augment space station capability through the use of teleoperation and robotics. AI technology will also be developed for the servicing of satellites at the Space Station, system monitoring and diagnosis, space manufacturing, and the assembly of large space structures.

Panel discussion: Roles of space program in the Asia Pacific region

NASA Astrophysics Data System (ADS)

Nomura, Tamiya

1992-03-01

A panel discussion on the subject 'Roles played by space development in Asia Pacific region' was held chaired by Space Activities Commission member and attended by the representatives of the participating countries, special attendance and observers. Opinions were expressed by each representative on three subjects, that is, social effects and benefits obtained by remote sensing data, observation data desired to augment the effect, and expectation for developed countries in space development. President of NASDA (National Space Development Agency of Japan) expressed his intension to promote international cooperation for the Japanese Earth Resources Satellite-1 (JERS-1) verification program, utilization augmentation of Japanese earth observing satellites and human resource training and education. Deputy Director-General for Science and Technology Agency (STA) outlined ASCA (Association for Science Cooperation in Asia) seminar and STA fellowship in relation to human resource development. Chairman of the Japan International Space Year (ISY) Association cited the necessity of closer and extensive communication networks free from the existing commercial communication. Deputy-Minister for Posts and Telecommunications outlined the PARTNERS project (Post-operational utilization of the Engineering Test Satellite-5 (ETS-5)) for international cooperation in space activities in Asia Pacific region. President of the Institute of Space and Astronautical Science (ISAS) outlined Japan's present status of and international cooperation in space science.

Two dimensional alveolar ridge augmentation using particulate hydroxyapatite and collagen membrane: A case report

PubMed Central

Singh, Aparna; Daing, Anika; Anand, Vishal; Dixit, Jaya

2014-01-01

Background Ridge augmentation procedures require bone regeneration outside of the existing bony walls or housing and are therefore often considered to be the most challenging surgical procedures. The bony deficiencies can be managed with GBR techniques involving bone grafting material and membrane while vertical augmentation may require the use of space-creating support mechanisms. Non-degradable membranes have been used for ridge augmentation with encouraging results however; requirement of second surgery for its removal and associated infection on exposure may compromise the desired results. These problems can be overcome by employing resorbable collagen membranes. Different bone graft materials are also used in combination with resorbable membranes, for prevention of membrane collapse and maintenance of space, as they lack sufficient rigidity. Particulate hydroxyapatite bone graft may be better alternative, because it treats the underlying bone defect to restore the natural support of the tissue architecture. Moreover, its use avoids potential donor site complications associated with autogenous block grafts. Method Patient described in this report presented with missing right maxillary incisor with ridge deficiency. A treatment approach involving localised ridge augmentation with particulate hydroxyapatite and collagen membrane was used. Result Six month post-operative periapical radiograph demonstrated a significant vertical bone fill. Conclusion The clinical and radiographic findings of the present case suggests that HA in conjunction with a resorbable collagen membrane may be an acceptable alternative to the autogenous block graft and non-resorbable membrane in the treatment of compromised alveolar ridge deficiencies. PMID:25737935

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.

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.

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.

Illuminating Spaces in the Classroom with Qualitative GIS

ERIC Educational Resources Information Center

Battista, Geoffrey A.; Manaugh, Kevin

2018-01-01

As social and postmodern ontologies continue to shape our definition of space, undergraduate instructors have struggled to incorporate these paradigms in the geography classroom. Recent research suggests that practical applications using field work, qualitative research, and geographic information science can augment students' understanding of…

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.

Heating Augmentation for Short Hypersonic Protuberances

NASA Technical Reports Server (NTRS)

Mazaheri, Alireza R.; Wood, William A.

2008-01-01

Computational aeroheating analyses of the Space Shuttle Orbiter plug repair models are validated against data collected in the Calspan University of Buffalo Research Center (CUBRC) 48 inch shock tunnel. The comparison shows that the average difference between computed heat transfer results and the data is about 9:5%. Using CFD and Wind Tunnel (WT) data, an empirical correlation for estimating heating augmentation on short hyper- sonic protuberances (k/delta < 0.33) is proposed. This proposed correlation is compared with several computed flight simulation cases and good agreement is achieved. Accordingly, this correlation is proposed for further investigation on other short hypersonic protuberances for estimating heating augmentation.

Heating Augmentation for Short Hypersonic Protuberances

NASA Technical Reports Server (NTRS)

Mazaheri, Ali R.; Wood, William A.

2008-01-01

Computational aeroheating analyses of the Space Shuttle Orbiter plug repair models are validated against data collected in the Calspan University of Buffalo Research Center (CUBRC) 48 inch shock tunnel. The comparison shows that the average difference between computed heat transfer results and the data is about 9.5%. Using CFD and Wind Tunnel (WT) data, an empirical correlation for estimating heating augmentation on short hypersonic protuberances (k/delta less than 0.3) is proposed. This proposed correlation is compared with several computed flight simulation cases and good agreement is achieved. Accordingly, this correlation is proposed for further investigation on other short hypersonic protuberances for estimating heating augmentation.

Custom Titanium Ridge Augmentation Matrix (CTRAM): A Case Report.

PubMed

Connors, Christopher A; Liacouras, Peter C; Grant, Gerald T

2016-01-01

This is a case report of a custom titanium ridge augmentation matrix (CTRAM). Using cone beam computed tomography (CBCT), a custom titanium space-maintaining device was developed. Alveolar ridges were virtually augmented, a matrix was virtually designed, and the CTRAM was additively manufactured with titanium (Ti6Al4V). Two cases are presented that resulted in sufficient increased horizontal bone volume with successful dental implant placement. The CTRAM design allows for preoperative planning for increasing alveolar ridge dimensions to support dental implants, reduces surgical time, and prevents the need for a second surgical site to gain sufficient alveolar ridge bone volume for dental implant therapy.

Maxillary anterior ridge augmentation with recombinant human bone morphogenetic protein 2.

PubMed

Edmunds, Ryan K; Mealey, Brian L; Mills, Michael P; Thoma, Daniel S; Schoolfield, John; Cochran, David L; Mellonig, Jim

2014-01-01

No human studies exist on the use of recombinant human bone morphogenetic protein 2 (rhBMP-2) on an absorbable collagen sponge (ACS) as a sole graft material for lateral ridge augmentation in large ridge defect sites. This series evaluates the treatment outcome of maxillary anterior lateral ridge augmentation with rhBMP-2/ACS. Twenty patients were treated with rhBMP-2/ACS and fixation screws for space maintenance. Cone beam volumetric tomography measurements were used to determine gain in ridge width, and a bone core biopsy was obtained. The mean horizontal ridge gain was 1.2 mm across sites, and every site gained width.

Fire Prevention, Detection and Suppression

NASA Technical Reports Server (NTRS)

Ruff, Gary A.

2004-01-01

In mid-1999, the Space and Life Sciences Directorate at Johnson Space Center was challenged to develop a new paradigm for NASA human life sciences: space medicine, space biomedical research and countermeasures, advanced human support technology. A new thrust - Bioastronautics - was formulated with a budget augmentation request. The objective are: expanded extramural community participation through the National Space Biomedical Research Institute, initiated the detailed planning and implementation of Bioastronautics, an integrated approach to ensure healthy and safe human space travel, assist in the solution of earth-based problems.

TE/TM decomposition of electromagnetic sources

NASA Technical Reports Server (NTRS)

Lindell, Ismo V.

1988-01-01

Three methods are given by which bounded EM sources can be decomposed into two parts radiating transverse electric (TE) and transverse magnetic (TM) fields with respect to a given constant direction in space. The theory applies source equivalence and nonradiating source concepts, which lead to decomposition methods based on a recursive formula or two differential equations for the determination of the TE and TM components of the original source. Decompositions for a dipole in terms of point, line, and plane sources are studied in detail. The planar decomposition is seen to match to an earlier result given by Clemmow (1963). As an application of the point decomposition method, it is demonstrated that the general exact image expression for the Sommerfeld half-space problem, previously derived through heuristic reasoning, can be more straightforwardly obtained through the present decomposition method.

High-resolution wave-theory-based ultrasound reflection imaging using the split-step fourier and globally optimized fourier finite-difference methods

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

Huang, Lianjie

Methods for enhancing ultrasonic reflection imaging are taught utilizing a split-step Fourier propagator in which the reconstruction is based on recursive inward continuation of ultrasonic wavefields in the frequency-space and frequency-wave number domains. The inward continuation within each extrapolation interval consists of two steps. In the first step, a phase-shift term is applied to the data in the frequency-wave number domain for propagation in a reference medium. The second step consists of applying another phase-shift term to data in the frequency-space domain to approximately compensate for ultrasonic scattering effects of heterogeneities within the tissue being imaged (e.g., breast tissue). Resultsmore » from various data input to the method indicate significant improvements are provided in both image quality and resolution.« less

An algorithm for generating modular hierarchical neural network classifiers: a step toward larger scale applications

NASA Astrophysics Data System (ADS)

Roverso, Davide

2003-08-01

Many-class learning is the problem of training a classifier to discriminate among a large number of target classes. Together with the problem of dealing with high-dimensional patterns (i.e. a high-dimensional input space), the many class problem (i.e. a high-dimensional output space) is a major obstacle to be faced when scaling-up classifier systems and algorithms from small pilot applications to large full-scale applications. The Autonomous Recursive Task Decomposition (ARTD) algorithm is here proposed as a solution to the problem of many-class learning. Example applications of ARTD to neural classifier training are also presented. In these examples, improvements in training time are shown to range from 4-fold to more than 30-fold in pattern classification tasks of both static and dynamic character.

Fast Image Restoration for Spatially Varying Defocus Blur of Imaging Sensor

PubMed Central

Cheong, Hejin; Chae, Eunjung; Lee, Eunsung; Jo, Gwanghyun; Paik, Joonki

2015-01-01

This paper presents a fast adaptive image restoration method for removing spatially varying out-of-focus blur of a general imaging sensor. After estimating the parameters of space-variant point-spread-function (PSF) using the derivative in each uniformly blurred region, the proposed method performs spatially adaptive image restoration by selecting the optimal restoration filter according to the estimated blur parameters. Each restoration filter is implemented in the form of a combination of multiple FIR filters, which guarantees the fast image restoration without the need of iterative or recursive processing. Experimental results show that the proposed method outperforms existing space-invariant restoration methods in the sense of both objective and subjective performance measures. The proposed algorithm can be employed to a wide area of image restoration applications, such as mobile imaging devices, robot vision, and satellite image processing. PMID:25569760

Parameter estimation of a three-axis spacecraft simulator using recursive least-squares approach with tracking differentiator and Extended Kalman Filter

NASA Astrophysics Data System (ADS)

Xu, Zheyao; Qi, Naiming; Chen, Yukun

2015-12-01

Spacecraft simulators are widely used to study the dynamics, guidance, navigation, and control of a spacecraft on the ground. A spacecraft simulator can have three rotational degrees of freedom by using a spherical air-bearing to simulate a frictionless and micro-gravity space environment. The moment of inertia and center of mass are essential for control system design of ground-based three-axis spacecraft simulators. Unfortunately, they cannot be known precisely. This paper presents two approaches, i.e. a recursive least-squares (RLS) approach with tracking differentiator (TD) and Extended Kalman Filter (EKF) method, to estimate inertia parameters. The tracking differentiator (TD) filter the noise coupled with the measured signals and generate derivate of the measured signals. Combination of two TD filters in series obtains the angular accelerations that are required in RLS (TD-TD-RLS). Another method that does not need to estimate the angular accelerations is using the integrated form of dynamics equation. An extended TD (ETD) filter which can also generate the integration of the function of signals is presented for RLS (denoted as ETD-RLS). States and inertia parameters are estimated simultaneously using EKF. The observability is analyzed. All proposed methods are illustrated by simulations and experiments.

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.

Analysis of multinomial models with unknown index using data augmentation

USGS Publications Warehouse

Royle, J. Andrew; Dorazio, R.M.; Link, W.A.

2007-01-01

Multinomial models with unknown index ('sample size') arise in many practical settings. In practice, Bayesian analysis of such models has proved difficult because the dimension of the parameter space is not fixed, being in some cases a function of the unknown index. We describe a data augmentation approach to the analysis of this class of models that provides for a generic and efficient Bayesian implementation. Under this approach, the data are augmented with all-zero detection histories. The resulting augmented dataset is modeled as a zero-inflated version of the complete-data model where an estimable zero-inflation parameter takes the place of the unknown multinomial index. Interestingly, data augmentation can be justified as being equivalent to imposing a discrete uniform prior on the multinomial index. We provide three examples involving estimating the size of an animal population, estimating the number of diabetes cases in a population using the Rasch model, and the motivating example of estimating the number of species in an animal community with latent probabilities of species occurrence and detection.

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…

Development of adaptive control applied to chaotic systems

NASA Astrophysics Data System (ADS)

Rhode, Martin Andreas

1997-12-01

Continuous-time derivative control and adaptive map-based recursive feedback control techniques are used to control chaos in a variety of systems and in situations that are of practical interest. The theoretical part of the research includes the review of fundamental concept of control theory in the context of its applications to deterministic chaotic systems, the development of a new adaptive algorithm to identify the linear system properties necessary for control, and the extension of the recursive proportional feedback control technique, RPF, to high dimensional systems. Chaos control was applied to models of a thermal pulsed combustor, electro-chemical dissolution and the hyperchaotic Rossler system. Important implications for combustion engineering were suggested by successful control of the model of the thermal pulsed combustor. The system was automatically tracked while maintaining control into regions of parameter and state space where no stable attractors exist. In a simulation of the electrochemical dissolution system, application of derivative control to stabilize a steady state, and adaptive RPF to stabilize a period one orbit, was demonstrated. The high dimensional adaptive control algorithm was applied in a simulation using the Rossler hyperchaotic system, where a period-two orbit with two unstable directions was stabilized and tracked over a wide range of a system parameter. In the experimental part, the electrochemical system was studied in parameter space, by scanning the applied potential and the frequency of the rotating copper disk. The automated control algorithm is demonstrated to be effective when applied to stabilize a period-one orbit in the experiment. We show the necessity of small random perturbations applied to the system in order to both learn the dynamics and control the system at the same time. The simultaneous learning and control capability is shown to be an important part of the active feedback control.

Space Station evolution study

NASA Technical Reports Server (NTRS)

Evans, David B.

1993-01-01

This is the Space Station Freedom (SSF) Evolution Study 1993 Final Report, performed under NASA Contract NAS8-38783, Task Order 5.1. This task examined: (1) the feasibility of launching current National Space Transportation System (NSTS) compatible logistics elements on expendable launch vehicles (ELV's) and the associated modifications, and (2) new, non-NSTS logistics elements for launch on ELV's to augment current SSF logistics capability.

Maintaining space in localized ridge augmentation using guided bone regeneration with tenting screw technology.

PubMed

Chasioti, Evdokia; Chiang, Tat Fai; Drew, Howard J

2013-01-01

Prosthetic guided implant surgery requires adequate ridge dimensions for proper implant placement. Various surgical procedures can be used to augment deficient alveolar ridges. Studies have examined new bone formation on deficient ridges, utilizing numerous surgical techniques and biomaterials. The goal is to develop time efficient techniques, which have low morbidity. A crucial factor for successful bone grafting procedures is space maintenance. The article discusses space maintenance tenting screws, used in conjunction with bone allografts and resorbable barrier membranes, to ensure uneventful guided bone regeneration (GBR) enabling optimal implant positioning. The technique utilized has been described in the literature to treat severely resorbed alveolar ridges and additionally can be considered in restoring the vertical and horizontal component of deficient extraction sites. Three cases are presented to illustrate the utilization and effectiveness of tenting screw technology in the treatment of atrophic extraction sockets and for deficient ridges.

Guided bone augmentation using ceramic space-maintaining devices: the impact of chemistry

PubMed Central

Anderud, Jonas; Abrahamsson, Peter; Jimbo, Ryo; Isaksson, Sten; Adolfsson, Erik; Malmström, Johan; Naito, Yoshihito; Wennerberg, Ann

2015-01-01

The purpose of the study was to evaluate histologically, whether vertical bone augmentation can be achieved using a hollow ceramic space maintaining device in a rabbit calvaria model. Furthermore, the chemistry of microporous hydroxyapatite and zirconia were tested to determine which of these two ceramics are most suitable for guided bone generation. 24 hollow domes in two different ceramic materials were placed subperiosteal on rabbit skull bone. The rabbits were sacrificed after 12 weeks and the histology results were analyzed regarding bone-to-material contact and volume of newly formed bone. The results suggest that the effect of the microporous structure of hydroxyapatite seems to facilitate for the bone cells to adhere to the material and that zirconia enhance a slightly larger volume of newly formed bone. In conclusion, the results of the current study demonstrated that ceramic space maintaining devices permits new bone formation and osteoconduction within the dome. PMID:25792855

A method of augmenting the cheek area through SMAS, subSMAS, and subcutaneous tissue recruitment during facelift surgery.

PubMed

Brandy, Dominic A

2003-03-01

As the human face ages, there is a depletion of fat that occurs in the submalar region. Various techniques such as fat transfers, fillers, alloplastic implants, and composite rhytidectomies have been used to augment this area in the past. To describe a technique that augments the submalar areas during facelift surgery without the use of fat transfer, fillers, alloplastic implants, or a risky composite technique. An oval is scribed over the depressed submalar areas preoperatively. During facelift surgery, a fusiform area is scribed over the SMAS. This fusiform is scribed so that the medial end is directed at the center of the submalar depression, and the lateral end is toward the posterior earlobe. A defect is created within the lateral aspect of the fusiform, but not the medial portion. The fusiform is subsequently closed with a 2-0 Ethibond suture using three horizontal mattress sutures and two interrupted sutures. Upon closure of this defect, SMAS, subSMAS, and subcutaneous tissue overlying the SMAS are recruited into the submalar defect by the simple phenomenon of dog-ear formation. Additionally, there is a component of frank elevation of the tissues inferior to the medial aspect of the fusiform and submalar space. The aforementioned technique has been performed on 123 patients over 7 years and has resulted in consistently good improvement in the submalar space. The procedure is not difficult to learn, and good results can be achieved with initial cases. The learning curve was not found to be steep, with good results being achieved quickly. Depression of the submalar space plays a significant role in creating an aged face. In the past, various fillers and/or alloplastic implants have been used to augment this region. A low-risk method is described that mobilizes SMAS, subSMAS, and subcutaneous tissues into the submalar space through the phenomenon of dog-ear formation after fusiform closure.

The Architectonic Experience of Body and Space in Augmented Interiors

PubMed Central

Pasqualini, Isabella; Blefari, Maria Laura; Tadi, Tej; Serino, Andrea; Blanke, Olaf

2018-01-01

The environment shapes our experience of space in constant interaction with the body. Architectonic interiors amplify the perception of space through the bodily senses; an effect also known as embodiment. The interaction of the bodily senses with the space surrounding the body can be tested experimentally through the manipulation of multisensory stimulation and measured via a range of behaviors related to bodily self-consciousness. Many studies have used Virtual Reality to show that visuotactile conflicts mediated via a virtual body or avatar can disrupt the unified subjective experience of the body and self. In the full-body illusion paradigm, participants feel as if the avatar was their body (ownership, self-identification) and they shift their center of awareness toward the position of the avatar (self-location). However, the influence of non-bodily spatial cues around the body on embodiment remains unclear, and data about the impact of architectonic space on human perception and self-conscious states are sparse. We placed participants into a Virtual Reality arena, where large and narrow virtual interiors were displayed with and without an avatar. We then applied synchronous or asynchronous visuotactile strokes to the back of the participants and avatar, or, to the front wall of the void interiors. During conditions of illusory self-identification with the avatar, participants reported sensations of containment, drift, and touch with the architectonic environment. The absence of the avatar suppressed such feelings, yet, in the large space, we found an effect of continuity between the physical and the virtual interior depending on the full-body illusion. We discuss subjective feelings evoked by architecture and compare the full-body illusion in augmented interiors to architectonic embodiment. A relevant outcome of this study is the potential to dissociate the egocentric, first-person view from the physical point of view through augmented architectonic space. PMID:29755378

The Architectonic Experience of Body and Space in Augmented Interiors.

PubMed

Pasqualini, Isabella; Blefari, Maria Laura; Tadi, Tej; Serino, Andrea; Blanke, Olaf

2018-01-01

The environment shapes our experience of space in constant interaction with the body. Architectonic interiors amplify the perception of space through the bodily senses; an effect also known as embodiment. The interaction of the bodily senses with the space surrounding the body can be tested experimentally through the manipulation of multisensory stimulation and measured via a range of behaviors related to bodily self-consciousness. Many studies have used Virtual Reality to show that visuotactile conflicts mediated via a virtual body or avatar can disrupt the unified subjective experience of the body and self. In the full-body illusion paradigm, participants feel as if the avatar was their body (ownership, self-identification) and they shift their center of awareness toward the position of the avatar (self-location). However, the influence of non-bodily spatial cues around the body on embodiment remains unclear, and data about the impact of architectonic space on human perception and self-conscious states are sparse. We placed participants into a Virtual Reality arena, where large and narrow virtual interiors were displayed with and without an avatar. We then applied synchronous or asynchronous visuotactile strokes to the back of the participants and avatar, or, to the front wall of the void interiors. During conditions of illusory self-identification with the avatar, participants reported sensations of containment, drift, and touch with the architectonic environment. The absence of the avatar suppressed such feelings, yet, in the large space, we found an effect of continuity between the physical and the virtual interior depending on the full-body illusion. We discuss subjective feelings evoked by architecture and compare the full-body illusion in augmented interiors to architectonic embodiment. A relevant outcome of this study is the potential to dissociate the egocentric, first-person view from the physical point of view through augmented architectonic space.

Multilevel Mixture Kalman Filter

NASA Astrophysics Data System (ADS)

Guo, Dong; Wang, Xiaodong; Chen, Rong

2004-12-01

The mixture Kalman filter is a general sequential Monte Carlo technique for conditional linear dynamic systems. It generates samples of some indicator variables recursively based on sequential importance sampling (SIS) and integrates out the linear and Gaussian state variables conditioned on these indicators. Due to the marginalization process, the complexity of the mixture Kalman filter is quite high if the dimension of the indicator sampling space is high. In this paper, we address this difficulty by developing a new Monte Carlo sampling scheme, namely, the multilevel mixture Kalman filter. The basic idea is to make use of the multilevel or hierarchical structure of the space from which the indicator variables take values. That is, we draw samples in a multilevel fashion, beginning with sampling from the highest-level sampling space and then draw samples from the associate subspace of the newly drawn samples in a lower-level sampling space, until reaching the desired sampling space. Such a multilevel sampling scheme can be used in conjunction with the delayed estimation method, such as the delayed-sample method, resulting in delayed multilevel mixture Kalman filter. Examples in wireless communication, specifically the coherent and noncoherent 16-QAM over flat-fading channels, are provided to demonstrate the performance of the proposed multilevel mixture Kalman filter.

An Unscented Kalman-Particle Hybrid Filter for Space Object Tracking

NASA Astrophysics Data System (ADS)

Raihan A. V, Dilshad; Chakravorty, Suman

2018-03-01

Optimal and consistent estimation of the state of space objects is pivotal to surveillance and tracking applications. However, probabilistic estimation of space objects is made difficult by the non-Gaussianity and nonlinearity associated with orbital mechanics. In this paper, we present an unscented Kalman-particle hybrid filtering framework for recursive Bayesian estimation of space objects. The hybrid filtering scheme is designed to provide accurate and consistent estimates when measurements are sparse without incurring a large computational cost. It employs an unscented Kalman filter (UKF) for estimation when measurements are available. When the target is outside the field of view (FOV) of the sensor, it updates the state probability density function (PDF) via a sequential Monte Carlo method. The hybrid filter addresses the problem of particle depletion through a suitably designed filter transition scheme. To assess the performance of the hybrid filtering approach, we consider two test cases of space objects that are assumed to undergo full three dimensional orbital motion under the effects of J 2 and atmospheric drag perturbations. It is demonstrated that the hybrid filters can furnish fast, accurate and consistent estimates outperforming standard UKF and particle filter (PF) implementations.

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…

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

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.

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

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.

In-Flight Suppression of a De-Stabilized F/A-18 Structural Mode Using the Space Launch System Adaptive Augmenting Control System

NASA Technical Reports Server (NTRS)

Wall, John; VanZwieten, Tannen; Giiligan Eric; Miller, Chris; Hanson, Curtis; Orr, Jeb

2015-01-01

Adaptive Augmenting Control (AAC) has been developed for NASA's Space Launch System (SLS) family of launch vehicles and implemented as a baseline part of its flight control system (FCS). To raise the technical readiness level of the SLS AAC algorithm, the Launch Vehicle Adaptive Control (LVAC) flight test program was conducted in which the SLS FCS prototype software was employed to control the pitch axis of Dryden's specially outfitted F/A-18, the Full Scale Advanced Systems Test Bed (FAST). This presentation focuses on a set of special test cases which demonstrate the successful mitigation of the unstable coupling of an F/A-18 airframe structural mode with the SLS FCS.

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.

HoloLens

NASA Image and Video Library

2016-02-20

ISS046e043637 (02/20/2016) --- NASA astronaut Scott Kelly tweeted out this image to his followers Feb 20, 2016 with the tag: "This #Saturday morning checked out the @Microsoft #HoloLens aboard @Space_Station! Wow! #YearInSpace ". The device is part of NASA’s project Sidekick which is exploring the use of augmented reality to reduce crew training requirements and increase the efficiency at which astronauts can work in space.

Bell-correlated activable bound entanglement in multiqubit systems

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

Bandyopadhyay, Somshubhro; Chattopadhyay, Indrani; Roychowdhury, Vwani

2005-06-15

We show that the Hilbert space of even number ({>=}4) of qubits can always be decomposed as a direct sum of four orthogonal subspaces such that the normalized projectors onto the subspaces are activable bound entangled (ABE) states. These states also show a surprising recursive relation in the sense that the states belonging to 2N+2 qubits are Bell correlated to the states of 2N qubits; hence, we refer to these states as Bell-correlated ABE (BCABE) states. We also study the properties of noisy BCABE states and show that they are very similar to that of two qubit Bell-diagonal states.

Preliminary Assessment of Thrust Augmentation of NEP Based Missions

NASA Technical Reports Server (NTRS)

Chew, Gilbert; Pelaccio, Dennis G.; Chiroux, Robert; Pervan, Sherry; Rauwolf, Gerald A.; White, Charles

2005-01-01

Science Applications International Corporation (SAIC), with support from NASA Marshall Space Flight Center, has conducted a preliminary study to compare options for augmenting the thrust of a conventional nuclear electric propulsion (NEP) system. These options include a novel nuclear propulsion system concept known as Hybrid Indirect Nuclear Propulsion (HINP) and conventional chemical propulsion. The utility and technical feasibility of the HINP concept are assessed, and features and potential of this new in-space propulsion system concept are identified. As part of the study, SAIC developed top-level design tools to model the size and performance of an HINP system, as well as for several chemical propulsion options, including liquid and gelled propellants. A mission trade study was performed to compare a representative HINP system with chemical propulsion options for thrust augmentation of NEP systems for a mission to Saturn's moon Titan. Details pertaining to the approach, features, initial demonstration results for HINP model development, and the mission trade study are presented. Key technology and design issues associated with the HINP concept and future work recommendations are also identified.

DMS augmented monitoring and diganosis application (DMS AMDA) prototype

NASA Technical Reports Server (NTRS)

Patterson-Hine, F. A.; Boyd, Mark A.; Iverson, David L.; Donnell, Brian; Lauritsen, Janet; Doubek, Sharon; Gibson, Jim; Monahan, Christine; Rosenthal, Donald A.

1993-01-01

The Data Management System Augmented Monitoring and Diagnosis Application (DMS AMDA) is currently under development at NASA Ames Research Center (ARC). It will provide automated monitoring and diagnosis capabilities for the Space Station Freedom (SSF) Data Management System (DMS) in the Control Center Complex (CCC) at NASA Johnson Space Center. Several advanced automation applications are under development for use in the CCC for other SSF subsystems. The DMS AMDA, however, is the first application to utilize digraph failure analysis techniques and the Extended Realtime FEAT (ERF) application as the core of its diagnostic system design, since the other projects were begun before the digraph tools were available. Model-based diagnosis and expert systems techniques will provide additional capabilities and augment ERF where appropriate. Utilization of system knowledge captured in the design phase of a system in digraphs should result in both a cost savings and a technical advantage during implementation of the diagnostic software. This paper addresses both the programmatic and technical considerations of this approach, and describes the software design and initial prototyping effort.

A Trajectory Algorithm to Support En Route and Terminal Area Self-Spacing Concepts

NASA Technical Reports Server (NTRS)

Abbott, Terence S.

2007-01-01

This document describes an algorithm for the generation of a four dimensional aircraft trajectory. Input data for this algorithm are similar to an augmented Standard Terminal Arrival Route (STAR) with the augmentation in the form of altitude or speed crossing restrictions at waypoints on the route. Wind data at each waypoint are also inputs into this algorithm. The algorithm calculates the altitude, speed, along path distance, and along path time for each waypoint.

GEMINI-TITAN (GT)-9 - EARTH-SKY - AUGMENTED TARGET DOCKING ADAPTER (ATDA) - MSC

NASA Image and Video Library

1966-06-06

S66-37923 (3 June 1966) --- The Augmented Target Docking Adapter (ATDA) as seen from the Gemini-9 spacecraft during one of their three rendezvous in space. The ATDA and Gemini-9 spacecraft are 66.5 feet apart. Failure of the docking adapter protective cover to fully separate on the ATDA prevented the docking of the two spacecraft. The ATDA was described by the Gemini-9 crew as an "angry alligator." Photo credit: NASA

Spacehab

NASA Technical Reports Server (NTRS)

Rossi, David

1991-01-01

Information is given in viewgraph form on the Spacehab company and its work on a pressurized module to be carried on the Space Shuttle. The module augments the Shuttle's capability to support man-tended microgravity experiments. The augmentation modules are designed to duplicate the resources, such as power, environmental control, and data management that are available in the Shuttle's middeck. Topics covered include a company overview, company financing, system overview, module description, payload resources, locker accommodations, program status, and a listing of candidate payloads.

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

N =4 supergravity next-to-maximally-helicity-violating six-point one-loop amplitude

NASA Astrophysics Data System (ADS)

Dunbar, David C.; Perkins, Warren B.

2016-12-01

We construct the six-point, next-to-maximally-helicity-violating one-loop amplitude in N =4 supergravity using unitarity and recursion. The use of recursion requires the introduction of rational descendants of the cut-constructible pieces of the amplitude and the computation of the nonstandard factorization terms arising from the loop integrals.

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.

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.

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.

Design, implementation and evaluation of a practical pseudoknot folding algorithm based on thermodynamics

PubMed Central

Reeder, Jens; Giegerich, Robert

2004-01-01

Background The general problem of RNA secondary structure prediction under the widely used thermodynamic model is known to be NP-complete when the structures considered include arbitrary pseudoknots. For restricted classes of pseudoknots, several polynomial time algorithms have been designed, where the O(n6)time and O(n4) space algorithm by Rivas and Eddy is currently the best available program. Results We introduce the class of canonical simple recursive pseudoknots and present an algorithm that requires O(n4) time and O(n2) space to predict the energetically optimal structure of an RNA sequence, possible containing such pseudoknots. Evaluation against a large collection of known pseudoknotted structures shows the adequacy of the canonization approach and our algorithm. Conclusions RNA pseudoknots of medium size can now be predicted reliably as well as efficiently by the new algorithm. PMID:15294028

Investigation of adaptive filtering and MDL mitigation based on space-time block-coding for spatial division multiplexed coherent receivers

NASA Astrophysics Data System (ADS)

Weng, Yi; He, Xuan; Yao, Wang; Pacheco, Michelle C.; Wang, Junyi; Pan, Zhongqi

2017-07-01

In this paper, we explored the performance of space-time block-coding (STBC) assisted multiple-input multiple-output (MIMO) scheme for modal dispersion and mode-dependent loss (MDL) mitigation in spatial-division multiplexed optical communication systems, whereas the weight matrices of frequency-domain equalization (FDE) were updated heuristically using decision-directed recursive least squares (RLS) algorithm for convergence and channel estimation. The proposed STBC-RLS algorithm can achieve 43.6% enhancement on convergence rate over conventional least mean squares (LMS) for quadrature phase-shift keying (QPSK) signals with merely 16.2% increase in hardware complexity. The overall optical signal to noise ratio (OSNR) tolerance can be improved via STBC by approximately 3.1, 4.9, 7.8 dB for QPSK, 16-quadrature amplitude modulation (QAM) and 64-QAM with respective bit-error-rates (BER) and minimum-mean-square-error (MMSE).

The development rainfall forecasting using kalman filter

NASA Astrophysics Data System (ADS)

Zulfi, Mohammad; Hasan, Moh.; Dwidja Purnomo, Kosala

2018-04-01

Rainfall forecasting is very interesting for agricultural planing. Rainfall information is useful to make decisions about the plan planting certain commodities. In this studies, the rainfall forecasting by ARIMA and Kalman Filter method. Kalman Filter method is used to declare a time series model of which is shown in the form of linear state space to determine the future forecast. This method used a recursive solution to minimize error. The rainfall data in this research clustered by K-means clustering. Implementation of Kalman Filter method is for modelling and forecasting rainfall in each cluster. We used ARIMA (p,d,q) to construct a state space for KalmanFilter model. So, we have four group of the data and one model in each group. In conclusions, Kalman Filter method is better than ARIMA model for rainfall forecasting in each group. It can be showed from error of Kalman Filter method that smaller than error of ARIMA model.

Fast and accurate computation of projected two-point functions

NASA Astrophysics Data System (ADS)

Grasshorn Gebhardt, Henry S.; Jeong, Donghui

2018-01-01

We present the two-point function from the fast and accurate spherical Bessel transformation (2-FAST) algorithm1Our code is available at https://github.com/hsgg/twoFAST. for a fast and accurate computation of integrals involving one or two spherical Bessel functions. These types of integrals occur when projecting the galaxy power spectrum P (k ) onto the configuration space, ξℓν(r ), or spherical harmonic space, Cℓ(χ ,χ'). First, we employ the FFTLog transformation of the power spectrum to divide the calculation into P (k )-dependent coefficients and P (k )-independent integrations of basis functions multiplied by spherical Bessel functions. We find analytical expressions for the latter integrals in terms of special functions, for which recursion provides a fast and accurate evaluation. The algorithm, therefore, circumvents direct integration of highly oscillating spherical Bessel functions.

A Novel Space Partitioning Algorithm to Improve Current Practices in Facility Placement

PubMed Central

Jimenez, Tamara; Mikler, Armin R; Tiwari, Chetan

2012-01-01

In the presence of naturally occurring and man-made public health threats, the feasibility of regional bio-emergency contingency plans plays a crucial role in the mitigation of such emergencies. While the analysis of in-place response scenarios provides a measure of quality for a given plan, it involves human judgment to identify improvements in plans that are otherwise likely to fail. Since resource constraints and government mandates limit the availability of service provided in case of an emergency, computational techniques can determine optimal locations for providing emergency response assuming that the uniform distribution of demand across homogeneous resources will yield and optimal service outcome. This paper presents an algorithm that recursively partitions the geographic space into sub-regions while equally distributing the population across the partitions. For this method, we have proven the existence of an upper bound on the deviation from the optimal population size for sub-regions. PMID:23853502

Highway traffic estimation of improved precision using the derivative-free nonlinear Kalman Filter

NASA Astrophysics Data System (ADS)

Rigatos, Gerasimos; Siano, Pierluigi; Zervos, Nikolaos; Melkikh, Alexey

2015-12-01

The paper proves that the PDE dynamic model of the highway traffic is a differentially flat one and by applying spatial discretization its shows that the model's transformation into an equivalent linear canonical state-space form is possible. For the latter representation of the traffic's dynamics, state estimation is performed with the use of the Derivative-free nonlinear Kalman Filter. The proposed filter consists of the Kalman Filter recursion applied on the transformed state-space model of the highway traffic. Moreover, it makes use of an inverse transformation, based again on differential flatness theory which enables to obtain estimates of the state variables of the initial nonlinear PDE model. By avoiding approximate linearizations and the truncation of nonlinear terms from the PDE model of the traffic's dynamics the proposed filtering methods outperforms, in terms of accuracy, other nonlinear estimators such as the Extended Kalman Filter. The article's theoretical findings are confirmed through simulation experiments.

Ndarts

NASA Technical Reports Server (NTRS)

Jain, Abhinandan

2011-01-01

Ndarts software provides algorithms for computing quantities associated with the dynamics of articulated, rigid-link, multibody systems. It is designed as a general-purpose dynamics library that can be used for the modeling of robotic platforms, space vehicles, molecular dynamics, and other such applications. The architecture and algorithms in Ndarts are based on the Spatial Operator Algebra (SOA) theory for computational multibody and robot dynamics developed at JPL. It uses minimal, internal coordinate models. The algorithms are low-order, recursive scatter/ gather algorithms. In comparison with the earlier Darts++ software, this version has a more general and cleaner design needed to support a larger class of computational dynamics needs. It includes a frames infrastructure, allows algorithms to operate on subgraphs of the system, and implements lazy and deferred computation for better efficiency. Dynamics modeling modules such as Ndarts are core building blocks of control and simulation software for space, robotic, mechanism, bio-molecular, and material systems modeling.

A Machine-Checked Proof of A State-Space Construction Algorithm

NASA Technical Reports Server (NTRS)

Catano, Nestor; Siminiceanu, Radu I.

2010-01-01

This paper presents the correctness proof of Saturation, an algorithm for generating state spaces of concurrent systems, implemented in the SMART tool. Unlike the Breadth First Search exploration algorithm, which is easy to understand and formalise, Saturation is a complex algorithm, employing a mutually-recursive pair of procedures that compute a series of non-trivial, nested local fixed points, corresponding to a chaotic fixed point strategy. A pencil-and-paper proof of Saturation exists, but a machine checked proof had never been attempted. The key element of the proof is the characterisation theorem of saturated nodes in decision diagrams, stating that a saturated node represents a set of states encoding a local fixed-point with respect to firing all events affecting only the node s level and levels below. For our purpose, we have employed the Prototype Verification System (PVS) for formalising the Saturation algorithm, its data structures, and for conducting the proofs.

Multiresolutional schemata for unsupervised learning of autonomous robots for 3D space operation

NASA Technical Reports Server (NTRS)

Lacaze, Alberto; Meystel, Michael; Meystel, Alex

1994-01-01

This paper describes a novel approach to the development of a learning control system for autonomous space robot (ASR) which presents the ASR as a 'baby' -- that is, a system with no a priori knowledge of the world in which it operates, but with behavior acquisition techniques that allows it to build this knowledge from the experiences of actions within a particular environment (we will call it an Astro-baby). The learning techniques are rooted in the recursive algorithm for inductive generation of nested schemata molded from processes of early cognitive development in humans. The algorithm extracts data from the environment and by means of correlation and abduction, it creates schemata that are used for control. This system is robust enough to deal with a constantly changing environment because such changes provoke the creation of new schemata by generalizing from experiences, while still maintaining minimal computational complexity, thanks to the system's multiresolutional nature.

Histomorphometric analysis of newly formed bone after maxillary sinus floor augmentation using ground cortical bone allograft and internal collagen membrane.

PubMed

Kolerman, Roni; Tal, Haim; Moses, Ofer

2008-11-01

Maxillary sinus floor augmentation is the treatment of choice when insufficient alveolar bone height prevents placement of standard dental implants in the posterior edentulous maxilla. The objective of this study was to histologically and histometrically evaluate new bone formation after maxillary sinus floor augmentation using ground cortical bone allograft. Mineralized freeze-dried bone allograft (FDBA) was used for sinus floor augmentation. After 9 months, 23 biopsies were taken from 19 patients. Routine histologic processing using hematoxylin and eosin and Mallory staining was performed. Histologic evaluation revealed a mean of 29.1% newly formed bone, 51.9% connective tissue, and 19% residual graft material. Graft particles were mainly in close contact with newly formed bone, primarily with features of mature bone with numerous osteocytes, and, to a lesser extent, with marrow spaces. There was no evidence of acute inflammatory infiltrate. FDBA is biocompatible and osteoconductive when used in maxillary sinus-augmentation procedures, and it may be used safely without interfering with the normal reparative bone process.

[Ridge preservation with synthetic nanocrystalline hydroxyapatite reduces the severity of gingival invaginations-a prospective clinical study].

PubMed

Reichert, Christoph; Wenghoefer, Matthias; Kutschera, Eric; Götz, Werner; Jäger, Andreas

2014-01-01

Gingival invaginations develop after tooth extraction and subsequent orthodontic space closure. Aetiological factors and long-term effects of gingival invaginations on oral health are nearly unknown. In addition, preventive or therapeutic strategies are rare. This prospective clinical study employing the split mouth technique was performed to investigate the effect of extraction socket augmentation with a synthetic nanocrystalline hydroxyapatite (NanoBone(®) Artoss, Rostock, Germany) on the incidence and degree of gingival invaginations. A total of 10 orthodontic patients with need for symmetric premolar extractions offering a total of 28 extractions were included in this trial. The study plan provided one extraction site to be augmented with synthetic nanocrystalline hydroxyapatite (NanoBone(®)), the other served as control. After primary wound healing, space closure was performed under defined biomechanical conditions. After space closure was accomplished, occurrence and degree of gingival invaginations as well as probing depths of the adjacent teeth mesial and distal to the extractions were determined and dental radiographs were taken. The degree of gingival invaginations and probing depths mesial and distal of the extraction were significantly reduced on NanoBone(®) augmented extraction sites. In addition, 70% of the radiographs revealed translucent and hyperdense areas on the intervention side after space closure. Apical root resorption was found in 2 patients on both the NanoBone(®) side and the control side. Ridge preservation with NanoBone(®) appeared to reduce the severity of gingival invaginations. Further investigation on long-term effects is mandatory to eliminate the appearance of adverse effects.

The inertial attitude augmentation for ambiguity resolution in SF/SE-GNSS attitude determination.

PubMed

Zhu, Jiancheng; Hu, Xiaoping; Zhang, Jingyu; Li, Tao; Wang, Jinling; Wu, Meiping

2014-06-26

The Unaided Single Frequency/Single Epoch Global Navigation Satellite System (SF/SE GNSS) model is the most challenging scenario for ambiguity resolution in the GNSS attitude determination application. To improve the performance of SF/SE-GNSS ambiguity resolution without excessive cost, the Micro-Electro-Mechanical System Inertial Measurement Unit (MEMS-IMU) is a proper choice for the auxiliary sensor that carries out the inertial attitude augmentation. Firstly, based on the SF/SE-GNSS compass model, the Inertial Derived Baseline Vector (IDBV) is defined to connect the MEMS-IMU attitude measurement with the SF/SE-GNSS ambiguity search space, and the mechanism of inertial attitude augmentation is revealed from the perspective of geometry. Then, through the quantitative description of model strength by Ambiguity Dilution of Precision (ADOP), two ADOPs are specified for the unaided SF/SE-GNSS compass model and its inertial attitude augmentation counterparts, respectively, and a sufficient condition is proposed for augmenting the SF/SE-GNSS model strength with inertial attitude measurement. Finally, in the framework of an integer aperture estimator with fixed failure rate, the performance of SF/SE-GNSS ambiguity resolution with inertial attitude augmentation is analyzed when the model strength is varying from strong to weak. The simulation results show that, in the SF/SE-GNSS attitude determination application, MEMS-IMU can satisfy the requirements of ambiguity resolution with inertial attitude augmentation.

The Inertial Attitude Augmentation for Ambiguity Resolution in SF/SE-GNSS Attitude Determination

PubMed Central

Zhu, Jiancheng; Hu, Xiaoping; Zhang, Jingyu; Li, Tao; Wang, Jinling; Wu, Meiping

2014-01-01

The Unaided Single Frequency/Single Epoch Global Navigation Satellite System (SF/SE GNSS) model is the most challenging scenario for ambiguity resolution in the GNSS attitude determination application. To improve the performance of SF/SE-GNSS ambiguity resolution without excessive cost, the Micro-Electro-Mechanical System Inertial Measurement Unit (MEMS-IMU) is a proper choice for the auxiliary sensor that carries out the inertial attitude augmentation. Firstly, based on the SF/SE-GNSS compass model, the Inertial Derived Baseline Vector (IDBV) is defined to connect the MEMS-IMU attitude measurement with the SF/SE-GNSS ambiguity search space, and the mechanism of inertial attitude augmentation is revealed from the perspective of geometry. Then, through the quantitative description of model strength by Ambiguity Dilution of Precision (ADOP), two ADOPs are specified for the unaided SF/SE-GNSS compass model and its inertial attitude augmentation counterparts, respectively, and a sufficient condition is proposed for augmenting the SF/SE-GNSS model strength with inertial attitude measurement. Finally, in the framework of an integer aperture estimator with fixed failure rate, the performance of SF/SE-GNSS ambiguity resolution with inertial attitude augmentation is analyzed when the model strength is varying from strong to weak. The simulation results show that, in the SF/SE-GNSS attitude determination application, MEMS-IMU can satisfy the requirements of ambiguity resolution with inertial attitude augmentation. PMID:24971472

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.

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

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.

A resource oriented webs service for environmental modeling

NASA Astrophysics Data System (ADS)

Ferencik, Ioan

2013-04-01

Environmental modeling is a largely adopted practice in the study of natural phenomena. Environmental models can be difficult to build and use and thus sharing them within the community is an important aspect. The most common approach to share a model is to expose it as a web service. In practice the interaction with this web service is cumbersome due to lack of standardized contract and the complexity of the model being exposed. In this work we investigate the use of a resource oriented approach in exposing environmental models as web services. We view a model as a layered resource build atop the object concept from Object Oriented Programming, augmented with persistence capabilities provided by an embedded object database to keep track of its state and implementing the four basic principles of resource oriented architectures: addressability, statelessness, representation and uniform interface. For implementation we use exclusively open source software: Django framework, dyBase object oriented database and Python programming language. We developed a generic framework of resources structured into a hierarchy of types and consequently extended this typology with recurses specific to the domain of environmental modeling. To test our web service we used cURL, a robust command-line based web client.

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.

Benchmarking fully analytic DFT force fields for vibrational spectroscopy: A study on halogenated compounds

NASA Astrophysics Data System (ADS)

Pietropolli Charmet, Andrea; Cornaton, Yann

2018-05-01

This work presents an investigation of the theoretical predictions yielded by anharmonic force fields having the cubic and quartic force constants are computed analytically by means of density functional theory (DFT) using the recursive scheme developed by M. Ringholm et al. (J. Comput. Chem. 35 (2014) 622). Different functionals (namely B3LYP, PBE, PBE0 and PW86x) and basis sets were used for calculating the anharmonic vibrational spectra of two halomethanes. The benchmark analysis carried out demonstrates the reliability and overall good performances offered by hybrid approaches, where the harmonic data obtained at the coupled cluster with single and double excitations level of theory augmented by a perturbational estimate of the effects of connected triple excitations, CCSD(T), are combined with the fully analytic higher order force constants yielded by DFT functionals. These methods lead to reliable and computationally affordable calculations of anharmonic vibrational spectra with an accuracy comparable to that yielded by hybrid force fields having the anharmonic force fields computed at second order Møller-Plesset perturbation theory (MP2) level of theory using numerical differentiation but without the corresponding potential issues related to computational costs and numerical errors.

Local infiltrative anesthesia for transaxillary subpectoral breast implants.

PubMed

Mottura, A A

1995-01-01

Breast augmentations using a transaxillary subpectoral approach are usually performed under general anesthesia. This article describes a technique that uses local infiltrative anesthesia in breast augmentation, adenomastectomies with immediate breast reconstruction, and when placing breast expansors. Large anesthetic solutions with vasoconstrictor and long-acting effects are prepared. The axila, the subpectoral space, and a surrounding area of 3 cm outside the demarcation limits are infiltrated. Minimal bleeding, long-lasting effects, and a considerable postoperative analgesic effect are some of the advantages of this procedure.

Purification, crystallization and preliminary X-ray studies of human augmenter of liver regeneration.

PubMed

Ji, Chao-Neng; Cai, Zai-Long; Cao, Gen-Tao; Yin, Gang; Jiao, Bing-Hua; Jiang, Tao; Shu, Guang; Mao, Ji-Fang; Xie, Yi; Mao, Yu-Min

2002-12-01

Human augmenter of liver regeneration has been expressed in Escherichia coli, purified and crystallized. The crystals belong to space group C222, with unit-cell parameters a=51.7 A, b=78.8 A, c=63.7 A. Diffraction data were collected to 2.80 A with a completeness of 99.9% (99.9% for the last shell), a R(sym) value of 0.092(0.236) and an I/sigma(I) value of 6.2(2.7).

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…

Closed-form recursive formula for an optimal tracker with terminal constraints

NASA Technical Reports Server (NTRS)

Juang, J.-N.; Turner, J. D.; Chun, H. M.

1984-01-01

Feedback control laws are derived for a class of optimal finite time tracking problems with terminal constraints. Analytical solutions are obtained for the feedback gain and the closed-loop response trajectory. Such formulations are expressed in recursive forms so that a real-time computer implementation becomes feasible. Two examples are given to illustrate the validity and usefulness of the formulations.

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

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…

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

Selection of combined water electrolysis and resistojet propulsion for Space Station Freedom

NASA Technical Reports Server (NTRS)

Schmidt, George R.

1988-01-01

An analytical rationale is presented for the configuration of the NASA Space Station's two-element propulsion system, and attention is given to the cost benefits accruing to this system over the Space Station's service life. The principal system element uses gaseous oxygen and hydrogen obtained through water electrolysis to furnish attitude control, backup attitude control, and contingency maneuvering. The secondary element uses resistojets to augment Space Station reboost through the acceleration of waste gases in the direction opposite the Station's flight path.

Expendable launch vehicle transportation for the Space Station

NASA Technical Reports Server (NTRS)

Corban, Robert R.

1988-01-01

ELVs are presently evaluated as major components of the NASA Space Station's logistics transportation system, augmenting the cargo capacity of the Space Shuttle in support of Station productivity and operational flexibility. The ELVs in question are the Delta II, Atlas II, Titan III, Titan IV, Shuttle-C (unmanned cargo development), European Ariane 5, and Japanese H-II, as well as smaller launch vehicles and OTVs. Early definition of ELV program impacts will preclude the potentially excessive costs of future Space Station modifications.

Refining, revising, augmenting, compiling and developing computer assisted instruction K-12 aerospace materials for implementation in NASA spacelink electronic information system

NASA Technical Reports Server (NTRS)

Blake, Jean A.

1988-01-01

The NASA Spacelink is an electronic information service operated by the Marshall Space Flight Center. The Spacelink contains extensive NASA news and educational resources that can be accessed by a computer and modem. Updates and information are provided on: current NASA news; aeronautics; space exploration: before the Shuttle; space exploration: the Shuttle and beyond; NASA installations; NASA educational services; materials for classroom use; and space program spinoffs.

Launch Vehicle Manual Steering with Adaptive Augmenting Control In-flight Evaluations of Adverse Interactions Using a Piloted Aircraft

NASA Technical Reports Server (NTRS)

Hanson, Curt; Miller, Chris; Wall, John H.; Vanzwieten, Tannen S.; Gilligan, Eric; Orr, Jeb S.

2015-01-01

An adaptive augmenting control algorithm for the Space Launch System has been developed at the Marshall Space Flight Center as part of the launch vehicles baseline flight control system. A prototype version of the SLS flight control software was hosted on a piloted aircraft at the Armstrong Flight Research Center to demonstrate the adaptive controller on a full-scale realistic application in a relevant flight environment. Concerns regarding adverse interactions between the adaptive controller and a proposed manual steering mode were investigated by giving the pilot trajectory deviation cues and pitch rate command authority. Two NASA research pilots flew a total of twenty five constant pitch-rate trajectories using a prototype manual steering mode with and without adaptive control.

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.

Effect of dead space on breathing stability at exercise in hypoxia.

PubMed

Hermand, Eric; Lhuissier, François J; Richalet, Jean-Paul

2017-12-01

Recent studies have shown that normal subjects exhibit periodic breathing when submitted to concomitant environmental (hypoxia) and physiological (exercise) stresses. A mathematical model including mass balance equations confirmed the short period of ventilatory oscillations and pointed out an important role of dead space in the genesis of these phenomena. Ten healthy subjects performed mild exercise on a cycloergometer in different conditions: rest/exercise, normoxia/hypoxia and no added dead space/added dead space (aDS). Ventilatory oscillations (V˙E peak power) were augmented by exercise, hypoxia and aDS (P<0.001, P<0.001 and P<0.01, respectively) whereas V˙E period was only shortened by exercise (P<0.001), with an 11-s period. aDS also increased V˙E (P<0.001), tidal volume (VT, P<0.001), and slightly augmented PETCO 2 (P<0.05) and the respiratory frequency (P<0.05). These results confirmed our previous model, showing an exacerbation of breathing instability by increasing dead space. This underlines opposite effects observed in heart failure patients and normal subjects, in which added dead space drastically reduced periodic breathing and sleep apneas. It also points out that alveolar ventilation remains very close to metabolic needs and is not affected by an added dead space. Clinical Trial reg. n°: NCT02201875. Copyright © 2017 Elsevier B.V. All rights reserved.

Decision Variants for the Automatic Determination of Optimal Feature Subset in RF-RFE.

PubMed

Chen, Qi; Meng, Zhaopeng; Liu, Xinyi; Jin, Qianguo; Su, Ran

2018-06-15

Feature selection, which identifies a set of most informative features from the original feature space, has been widely used to simplify the predictor. Recursive feature elimination (RFE), as one of the most popular feature selection approaches, is effective in data dimension reduction and efficiency increase. A ranking of features, as well as candidate subsets with the corresponding accuracy, is produced through RFE. The subset with highest accuracy (HA) or a preset number of features (PreNum) are often used as the final subset. However, this may lead to a large number of features being selected, or if there is no prior knowledge about this preset number, it is often ambiguous and subjective regarding final subset selection. A proper decision variant is in high demand to automatically determine the optimal subset. In this study, we conduct pioneering work to explore the decision variant after obtaining a list of candidate subsets from RFE. We provide a detailed analysis and comparison of several decision variants to automatically select the optimal feature subset. Random forest (RF)-recursive feature elimination (RF-RFE) algorithm and a voting strategy are introduced. We validated the variants on two totally different molecular biology datasets, one for a toxicogenomic study and the other one for protein sequence analysis. The study provides an automated way to determine the optimal feature subset when using RF-RFE.

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.

Synthesis of Polyferrocenylsilane Block Copolymers and their Crystallization-Driven Self-Assembly in Protic Solvents

NASA Astrophysics Data System (ADS)

Zhou, Hang

Quantum walks are the quantum mechanical analogue of classical random walks. Discrete-time quantum walks have been introduced and studied mostly on the line Z or higher dimensional space Zd but rarely defined on graphs with fractal dimensions because the coin operator depends on the position and the Fourier transform on the fractals is not defined. Inspired by its nature of classical walks, different quantum walks will be defined by choosing different shift and coin operators. When the coin operator is uniform, the results of classical walks will be obtained upon measurement at each step. Moreover, with measurement at each step, our results reveal more information about the classical random walks. In this dissertation, two graphs with fractal dimensions will be considered. The first one is Sierpinski gasket, a degree-4 regular graph with Hausdorff dimension of df = ln 3/ ln 2. The second is the Cantor graph derived like Cantor set, with Hausdorff dimension of df = ln 2/ ln 3. The definitions and amplitude functions of the quantum walks will be introduced. The main part of this dissertation is to derive a recursive formula to compute the amplitude Green function. The exiting probability will be computed and compared with the classical results. When the generation of graphs goes to infinity, the recursion of the walks will be investigated and the convergence rates will be obtained and compared with the classical counterparts.

A metal artifact reduction algorithm in CT using multiple prior images by recursive active contour segmentation

PubMed Central

Nam, Haewon

2017-01-01

We propose a novel metal artifact reduction (MAR) algorithm for CT images that completes a corrupted sinogram along the metal trace region. When metal implants are located inside a field of view, they create a barrier to the transmitted X-ray beam due to the high attenuation of metals, which significantly degrades the image quality. To fill in the metal trace region efficiently, the proposed algorithm uses multiple prior images with residual error compensation in sinogram space. Multiple prior images are generated by applying a recursive active contour (RAC) segmentation algorithm to the pre-corrected image acquired by MAR with linear interpolation, where the number of prior image is controlled by RAC depending on the object complexity. A sinogram basis is then acquired by forward projection of the prior images. The metal trace region of the original sinogram is replaced by the linearly combined sinogram of the prior images. Then, the additional correction in the metal trace region is performed to compensate the residual errors occurred by non-ideal data acquisition condition. The performance of the proposed MAR algorithm is compared with MAR with linear interpolation and the normalized MAR algorithm using simulated and experimental data. The results show that the proposed algorithm outperforms other MAR algorithms, especially when the object is complex with multiple bone objects. PMID:28604794

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

Active stability augmentation of large space structures: A stochastic control problem

NASA Technical Reports Server (NTRS)

Balakrishnan, A. V.

1987-01-01

A problem in SCOLE is that of slewing an offset antenna on a long flexible beam-like truss attached to the space shuttle, with rather stringent pointing accuracy requirements. The relevant methodology aspects in robust feedback-control design for stability augmentation of the beam using on-board sensors is examined. It is framed as a stochastic control problem, boundary control of a distributed parameter system described by partial differential equations. While the framework is mathematical, the emphasis is still on an engineering solution. An abstract mathematical formulation is developed as a nonlinear wave equation in a Hilbert space. That the system is controllable is shown and a feedback control law that is robust in the sense that it does not require quantitative knowledge of system parameters is developed. The stochastic control problem that arises in instrumenting this law using appropriate sensors is treated. Using an engineering first approximation which is valid for small damping, formulas for optimal choice of the control gain are developed.

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.

Some remarks on the current status of the control theory of single space dimension hyperbolic systems

NASA Technical Reports Server (NTRS)

Russell, D. L.

1983-01-01

Various aspects of the control theory of hyperbolic systems, including controllability, stabilization, control canonical form theory, etc., are reviewed. To allow a unified and not excessively technical treatment, attention is restricted to the case of a single space variable. A newly developed procedure of canonical augmentation is discussed.

Fast alignment-free sequence comparison using spaced-word frequencies.

PubMed

Leimeister, Chris-Andre; Boden, Marcus; Horwege, Sebastian; Lindner, Sebastian; Morgenstern, Burkhard

2014-07-15

Alignment-free methods for sequence comparison are increasingly used for genome analysis and phylogeny reconstruction; they circumvent various difficulties of traditional alignment-based approaches. In particular, alignment-free methods are much faster than pairwise or multiple alignments. They are, however, less accurate than methods based on sequence alignment. Most alignment-free approaches work by comparing the word composition of sequences. A well-known problem with these methods is that neighbouring word matches are far from independent. To reduce the statistical dependency between adjacent word matches, we propose to use 'spaced words', defined by patterns of 'match' and 'don't care' positions, for alignment-free sequence comparison. We describe a fast implementation of this approach using recursive hashing and bit operations, and we show that further improvements can be achieved by using multiple patterns instead of single patterns. To evaluate our approach, we use spaced-word frequencies as a basis for fast phylogeny reconstruction. Using real-world and simulated sequence data, we demonstrate that our multiple-pattern approach produces better phylogenies than approaches relying on contiguous words. Our program is freely available at http://spaced.gobics.de/. © The Author 2014. Published by Oxford University Press.

Recursive algorithms for phylogenetic tree counting.

PubMed

Gavryushkina, Alexandra; Welch, David; Drummond, Alexei J

2013-10-28

In Bayesian phylogenetic inference we are interested in distributions over a space of trees. The number of trees in a tree space is an important characteristic of the space and is useful for specifying prior distributions. When all samples come from the same time point and no prior information available on divergence times, the tree counting problem is easy. However, when fossil evidence is used in the inference to constrain the tree or data are sampled serially, new tree spaces arise and counting the number of trees is more difficult. We describe an algorithm that is polynomial in the number of sampled individuals for counting of resolutions of a constraint tree assuming that the number of constraints is fixed. We generalise this algorithm to counting resolutions of a fully ranked constraint tree. We describe a quadratic algorithm for counting the number of possible fully ranked trees on n sampled individuals. We introduce a new type of tree, called a fully ranked tree with sampled ancestors, and describe a cubic time algorithm for counting the number of such trees on n sampled individuals. These algorithms should be employed for Bayesian Markov chain Monte Carlo inference when fossil data are included or data are serially sampled.

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

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.

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

1 λ × 1.44 Tb/s free-space IM-DD transmission employing OAM multiplexing and PDM.

PubMed

Zhu, Yixiao; Zou, Kaiheng; Zheng, Zhennan; Zhang, Fan

2016-02-22

We report the experimental demonstration of single wavelength terabit free-space intensity modulation direct detection (IM-DD) system employing both orbital angular momentum (OAM) multiplexing and polarization division multiplexing (PDM). In our experiment, 12 OAM modes with two orthogonal polarization states are used to generate 24 channels for transmission. Each channel carries 30 Gbaud Nyquist PAM-4 signal. Therefore an aggregate gross capacity record of 1.44 Tb/s (12 × 2 × 30 × 2 Gb/s) is acheived with a modulation efficiency of 48 bits/symbol. After 0.8m free-space transmission, the bit error rates (BERs) of all the channels are below the 20% hard-decision forward error correction (HD-FEC) threshold of 1.5 × 10(-2). After applying the decision directed recursive least square (DD-RLS) based filter and post filter, the BERs of two polarizations can be reduced from 5.3 × 10(-3) and 7.3 × 10(-3) to 2.2 × 10(-3) and 3.4 × 10(-3), respectively.

A periodic table of effective field theories

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

Cheung, Clifford; Kampf, Karol; Novotny, Jiri

We systematically explore the space of scalar effective field theories (EFTs) consistent with a Lorentz invariant and local S-matrix. To do so we define an EFT classification based on four parameters characterizing 1) the number of derivatives per interaction, 2) the soft properties of amplitudes, 3) the leading valency of the interactions, and 4) the spacetime dimension. Carving out the allowed space of EFTs, we prove that exceptional EFTs like the non-linear sigma model, Dirac-Born-Infeld theory, and the special Galileon lie precisely on the boundary of allowed theory space. Using on-shell momentum shifts and recursion relations, we prove that EFTsmore » with arbitrarily soft behavior are forbidden and EFTs with leading valency much greater than the spacetime dimension cannot have enhanced soft behavior. We then enumerate all single scalar EFTs in d < 6 and verify that they correspond to known theories in the literature. Finally, our results suggest that the exceptional theories are the natural EFT analogs of gauge theory and gravity because they are one-parameter theories whose interactions are strictly dictated by properties of the S-matrix.« less

A periodic table of effective field theories

DOE PAGES

Cheung, Clifford; Kampf, Karol; Novotny, Jiri; ...

2017-02-06

We systematically explore the space of scalar effective field theories (EFTs) consistent with a Lorentz invariant and local S-matrix. To do so we define an EFT classification based on four parameters characterizing 1) the number of derivatives per interaction, 2) the soft properties of amplitudes, 3) the leading valency of the interactions, and 4) the spacetime dimension. Carving out the allowed space of EFTs, we prove that exceptional EFTs like the non-linear sigma model, Dirac-Born-Infeld theory, and the special Galileon lie precisely on the boundary of allowed theory space. Using on-shell momentum shifts and recursion relations, we prove that EFTsmore » with arbitrarily soft behavior are forbidden and EFTs with leading valency much greater than the spacetime dimension cannot have enhanced soft behavior. We then enumerate all single scalar EFTs in d < 6 and verify that they correspond to known theories in the literature. Finally, our results suggest that the exceptional theories are the natural EFT analogs of gauge theory and gravity because they are one-parameter theories whose interactions are strictly dictated by properties of the S-matrix.« less

HELAC-PHEGAS: A generator for all parton level processes

NASA Astrophysics Data System (ADS)

Cafarella, Alessandro; Papadopoulos, Costas G.; Worek, Malgorzata

2009-10-01

The updated version of the HELAC-PHEGAS event generator is presented. The matrix elements are calculated through Dyson-Schwinger recursive equations using color connection representation. Phase-space generation is based on a multichannel approach, including optimization. HELAC-PHEGAS generates parton level events with all necessary information, in the most recent Les Houches Accord format, for the study of any process within the Standard Model in hadron and lepton colliders. New version program summaryProgram title: HELAC-PHEGAS Catalogue identifier: ADMS_v2_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADMS_v2_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 35 986 No. of bytes in distributed program, including test data, etc.: 380 214 Distribution format: tar.gz Programming language: Fortran Computer: All Operating system: Linux Classification: 11.1, 11.2 External routines: Optionally Les Houches Accord (LHA) PDF Interface library ( http://projects.hepforge.org/lhapdf/) Catalogue identifier of previous version: ADMS_v1_0 Journal reference of previous version: Comput. Phys. Comm. 132 (2000) 306 Does the new version supersede the previous version?: Yes, partly Nature of problem: One of the most striking features of final states in current and future colliders is the large number of events with several jets. Being able to predict their features is essential. To achieve this, the calculations need to describe as accurately as possible the full matrix elements for the underlying hard processes. Even at leading order, perturbation theory based on Feynman graphs runs into computational problems, since the number of graphs contributing to the amplitude grows as n!. Solution method: Recursive algorithms based on Dyson-Schwinger equations have been developed recently in order to overcome the computational obstacles. The calculation of the amplitude, using Dyson-Schwinger recursive equations, results in a computational cost growing asymptotically as 3 n, where n is the number of particles involved in the process. Off-shell subamplitudes are introduced, for which a recursion relation has been obtained allowing to express an n-particle amplitude in terms of subamplitudes, with 1-, 2-, … up to (n-1) particles. The color connection representation is used in order to treat amplitudes involving colored particles. In the present version HELAC-PHEGAS can be used to efficiently obtain helicity amplitudes, total cross sections, parton-level event samples in LHA format, for arbitrary multiparticle processes in the Standard Model in leptonic, pp¯ and pp collisions. Reasons for new version: Substantial improvements, major functionality upgrade. Summary of revisions: Color connection representation, efficient integration over PDF via the PARNI algorithm, interface to LHAPDF, parton level events generated in the most recent LHA format, k reweighting for Parton Shower matching, numerical predictions for amplitudes for arbitrary processes for phase-space points provided by the user, new user interface and the possibility to run over computer clusters. Running time: Depending on the process studied. Usually from seconds to hours. References:A. Kanaki, C.G. Papadopoulos, Comput. Phys. Comm. 132 (2000) 306. C.G. Papadopoulos, Comput. Phys. Comm. 137 (2001) 247. URL: http://www.cern.ch/helac-phegas.

Classical space-times from the S-matrix

NASA Astrophysics Data System (ADS)

Neill, Duff; Rothstein, Ira Z.

2013-12-01

We show that classical space-times can be derived directly from the S-matrix for a theory of massive particles coupled to a massless spin two particle. As an explicit example we derive the Schwarzchild space-time as a series in GN. At no point of the derivation is any use made of the Einstein-Hilbert action or the Einstein equations. The intermediate steps involve only on-shell S-matrix elements which are generated via BCFW recursion relations and unitarity sewing techniques. The notion of a space-time metric is only introduced at the end of the calculation where it is extracted by matching the potential determined by the S-matrix to the geodesic motion of a test particle. Other static space-times such as Kerr follow in a similar manner. Furthermore, given that the procedure is action independent and depends only upon the choice of the representation of the little group, solutions to Yang-Mills (YM) theory can be generated in the same fashion. Moreover, the squaring relation between the YM and gravity three point functions shows that the seeds that generate solutions in the two theories are algebraically related. From a technical standpoint our methodology can also be utilized to calculate quantities relevant for the binary inspiral problem more efficiently then the more traditional Feynman diagram approach.

Bayesian Community Detection in the Space of Group-Level Functional Differences

PubMed Central

Venkataraman, Archana; Yang, Daniel Y.-J.; Pelphrey, Kevin A.; Duncan, James S.

2017-01-01

We propose a unified Bayesian framework to detect both hyper- and hypo-active communities within whole-brain fMRI data. Specifically, our model identifies dense subgraphs that exhibit population-level differences in functional synchrony between a control and clinical group. We derive a variational EM algorithm to solve for the latent posterior distributions and parameter estimates, which subsequently inform us about the afflicted network topology. We demonstrate that our method provides valuable insights into the neural mechanisms underlying social dysfunction in autism, as verified by the Neurosynth meta-analytic database. In contrast, both univariate testing and community detection via recursive edge elimination fail to identify stable functional communities associated with the disorder. PMID:26955022

Bayesian Community Detection in the Space of Group-Level Functional Differences.

PubMed

Venkataraman, Archana; Yang, Daniel Y-J; Pelphrey, Kevin A; Duncan, James S

2016-08-01

We propose a unified Bayesian framework to detect both hyper- and hypo-active communities within whole-brain fMRI data. Specifically, our model identifies dense subgraphs that exhibit population-level differences in functional synchrony between a control and clinical group. We derive a variational EM algorithm to solve for the latent posterior distributions and parameter estimates, which subsequently inform us about the afflicted network topology. We demonstrate that our method provides valuable insights into the neural mechanisms underlying social dysfunction in autism, as verified by the Neurosynth meta-analytic database. In contrast, both univariate testing and community detection via recursive edge elimination fail to identify stable functional communities associated with the disorder.

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.

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.

Orion MPCV Continuum RCS Heating Augmentation Model Development

NASA Technical Reports Server (NTRS)

Hyatt, Andrew J.; White, Molly E.

2014-01-01

The reaction control system jets of the Orion Multi Purpose Crew Vehicle can have a significant impact on the magnitude and distribution of the surface heat flux on the leeside of the aft-body, when they are fired. Changes in surface heating are expressed in terms of augmentation factor over the baseline smooth body heating. Wind tunnel tests revealed heating augmentation factors as high as 13.0, 7.6, 2.8, and 5.8 for the roll, pitch down, pitch up, and yaw jets respectively. Heating augmentation factor models, based almost exclusively on data from a series of wind tunnel tests have been developed, for the purposes of thermal protection system design. The wind tunnel tests investigated several potential jet-to-freestream similarity parameters, and heating augmentation factors derived from the data showed correlation with the jet-to-freestream momentum ratio. However, this correlation was not utilized in the developed models. Instead augmentation factors were held constant throughout the potential trajectory space. This simplification was driven by the fact that ground to flight traceability and sting effects are not well understood. Given the sensitivity of the reaction control system jet heating augmentation to configuration, geometry, and orientation the focus in the present paper is on the methodology used to develop the models and the lessons learned from the data. The models that are outlined in the present work are specific to the aerothermal database used to design the thermal protection system for the Exploration Flight Test 1 vehicle.

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.

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.

In-Flight Suppression of an Unstable F/A-18 Structural Mode Using the Space Launch System Adaptive Augmenting Control System

NASA Technical Reports Server (NTRS)

VanZwieten, Tannen S.; Gilligan, Eric T.; Wall, John H.; Miller, Christopher J.; Hanson, Curtis E.; Orr, Jeb S.

2015-01-01

NASA's Space Launch System (SLS) Flight Control System (FCS) includes an Adaptive Augmenting Control (AAC) component which employs a multiplicative gain update law to enhance the performance and robustness of the baseline control system for extreme off-nominal scenarios. The SLS FCS algorithm including AAC has been flight tested utilizing a specially outfitted F/A-18 fighter jet in which the pitch axis control of the aircraft was performed by a Non-linear Dynamic Inversion (NDI) controller, SLS reference models, and the SLS flight software prototype. This paper describes test cases from the research flight campaign in which the fundamental F/A-18 airframe structural mode was identified using post-flight frequency-domain reconstruction, amplified to result in closed loop instability, and suppressed in-flight by the SLS adaptive control system.

Capabilities, Design, Construction and Commissioning of New Vibration, Acoustic, and Electromagnetic Capabilities Added to the World's Largest Thermal Vacuum Chamber at NASA's Space Power Facility

NASA Technical Reports Server (NTRS)

Motil, Susan M.; Ludwiczak, Damian R.; Carek, Gerald A.; Sorge, Richard N.; Free, James M.; Cikanek, Harry A., III

2011-01-01

NASA s human space exploration plans developed under the Exploration System Architecture Studies in 2005 included a Crew Exploration Vehicle launched on an Ares I launch vehicle. The mass of the Crew Exploration Vehicle and trajectory of the Ares I coupled with the need to be able to abort across a large percentage of the trajectory generated unprecedented testing requirements. A future lunar lander added to projected test requirements. In 2006, the basic test plan for Orion was developed. It included several types of environment tests typical of spacecraft development programs. These included thermal-vacuum, electromagnetic interference, mechanical vibration, and acoustic tests. Because of the size of the vehicle and unprecedented acoustics, NASA conducted an extensive assessment of options for testing, and as result, chose to augment the Space Power Facility at NASA Plum Brook Station, of the John H. Glenn Research Center to provide the needed test capabilities. The augmentation included designing and building the World s highest mass capable vibration table, the highest power large acoustic chamber, and adaptation of the existing World s largest thermal vacuum chamber as a reverberant electromagnetic interference test chamber. These augmentations were accomplished from 2007 through early 2011. Acceptance testing began in Spring 2011 and will be completed in the Fall of 2011. This paper provides an overview of the capabilities, design, construction and acceptance of this extraordinary facility.

Use of display technologies for augmented reality enhancement

NASA Astrophysics Data System (ADS)

Harding, Kevin

2016-06-01

Augmented reality (AR) is seen as an important tool for the future of user interfaces as well as training applications. An important application area for AR is expected to be in the digitization of training and worker instructions used in the Brilliant Factory environment. The transition of work instructions methods from printed pages in a book or taped to a machine to virtual simulations is a long step with many challenges along the way. A variety of augmented reality tools are being explored today for industrial applications that range from simple programmable projections in the work space to 3D displays and head mounted gear. This paper will review where some of these tool are today and some of the pros and cons being considered for the future worker environment.

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

Papajak, Ewa; Truhlar, Donald G.

We present sets of convergent, partially augmented basis set levels corresponding to subsets of the augmented “aug-cc-pV(n+d)Z” basis sets of Dunning and co-workers. We show that for many molecular properties a basis set fully augmented with diffuse functions is computationally expensive and almost always unnecessary. On the other hand, unaugmented cc-pV(n+d)Z basis sets are insufficient for many properties that require diffuse functions. Therefore, we propose using intermediate basis sets. We developed an efficient strategy for partial augmentation, and in this article, we test it and validate it. Sequentially deleting diffuse basis functions from the “aug” basis sets yields the “jul”,more » “jun”, “may”, “apr”, etc. basis sets. Tests of these basis sets for Møller-Plesset second-order perturbation theory (MP2) show the advantages of using these partially augmented basis sets and allow us to recommend which basis sets offer the best accuracy for a given number of basis functions for calculations on large systems. Similar truncations in the diffuse space can be performed for the aug-cc-pVxZ, aug-cc-pCVxZ, etc. basis sets.« less

Bone formation in sinus augmentation procedures using autologous bone, porcine bone, and a 50 : 50 mixture: a human clinical and histological evaluation at 2 months.

PubMed

Cassetta, Michele; Perrotti, Vittoria; Calasso, Sabrina; Piattelli, Adriano; Sinjari, Bruna; Iezzi, Giovanna

2015-10-01

The aim of this study was to perform a 2 months clinical and histological comparison of autologous bone, porcine bone, and a 50 : 50 mixture in maxillary sinus augmentation procedures. A total of 10 consecutive patients, undergoing two-stage sinus augmentation procedures using 100% autologous bone (Group A), 100% porcine bone (Group B), and a 50 : 50 mixture of autologous and porcine bone (Group C) were included in this study. After a 2-month healing period, at the time of implant insertion, clinical evaluation was performed and bone core biopsies were harvested and processed for histological analysis. The postoperative healing was uneventful regardless of the materials used for the sinus augmentation procedures. The histomorphometrical analysis revealed comparable percentages of newly formed bone, marrow spaces, and residual grafted material in the three groups. The clinical and histological results of this study indicated that porcine bone alone or in combination with autologous bone are biocompatible and osteoconductive materials and can be successfully used in sinus augmentation procedures. © 2014 John Wiley & Sons A/S. Published by John Wiley & Sons Ltd.

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

Closed-form recursive formula for an optimal tracker with terminal constraints

NASA Technical Reports Server (NTRS)

Juang, J. N.; Turner, J. D.; Chun, H. M.

1986-01-01

Feedback control laws are derived for a class of optimal finite time tracking problems with terminal constraints. Analytical solutions are obtained for the feedback gain and the closed-loop response trajectory. Such formulations are expressed in recursive forms so that a real-time computer implementation becomes feasible. An example involving the feedback slewing of a flexible spacecraft is given to illustrate the validity and usefulness of the formulations.

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.

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.

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.

Examining the Use of Facebook and Twitter as an Additional Social Space in a MOOC

ERIC Educational Resources Information Center

Liu, Min; McKelroy, Emily; Kang, Jina; Harron, Jason; Liu, Sa

2016-01-01

In this study, the researchers examined if and to what extent social media tools such as Facebook and Twitter can augment participants' learning experience in an xMOOC and offer an additional social space. Two research questions guided this inquiry: (1) What did MOOC participants consider the usefulness of the Facebook group and Twitter feed…

Process Time Refinement for Reusable Launch Vehicle Regeneration Modeling

DTIC Science & Technology

2008-03-01

predicted to fail, or have failed. 3) Augmenting existing space systems with redundant or additional capability to enhance space system performance or...Canopies, External Tanks/Pods/Pylon Ejectors , Armament Bay Doors, Missile Launchers, Wing and Fuselage Center Line Racks, Bomb Bay Release...Systems Test 04583 Thrust Maintenance Operation 04584 Silo Door Operation 04650 Initial Build-up-Recovery Vehicle (RV) 147 04610 Nondestructive

Earth-orbit mission considerations and Space Tug requirements.

NASA Technical Reports Server (NTRS)

Huber, W. G.

1973-01-01

The reusable Space Tug is a major system planned to augment the Space Shuttle's capability to deliver, retrieve, and support automated payloads. The Space Tug will be designed to perform round-trip missions from low earth orbit to geosynchronous orbit. Space Tug goals and requirements are discussed together with the characteristics of the full capability Tug. The Tug is to be operated in an unmanned 'teleoperator' fashion. Details of potential teleoperator applications are considered, giving attention to related systems studies, candidate Tug mission applications, Tug 'end-effector' alternatives, technical issues associated with Tug payload retrieval, and Tug/payload accommodations.

A Revised Trajectory Algorithm to Support En Route and Terminal Area Self-Spacing Concepts

NASA Technical Reports Server (NTRS)

Abbott, Terence S.

2010-01-01

This document describes an algorithm for the generation of a four dimensional trajectory. Input data for this algorithm are similar to an augmented Standard Terminal Arrival (STAR) with the augmentation in the form of altitude or speed crossing restrictions at waypoints on the route. This version of the algorithm accommodates descent Mach values that are different from the cruise Mach values. Wind data at each waypoint are also inputs into this algorithm. The algorithm calculates the altitude, speed, along path distance, and along path time for each waypoint.

Design of ground test suspension systems for verification of flexible space structures

NASA Technical Reports Server (NTRS)

Cooley, V. M.; Juang, J. N.; Ghaemmaghami, P.

1988-01-01

A simple model demonstrates the frequency-increasing effects of a simple cable suspension on flexible test article/suspension systems. Two passive suspension designs, namely a negative spring mechanism and a rolling cart mechanism, are presented to alleviate the undesirable frequency-increasing effects. Analysis methods are provided for systems in which the augmentations are applied to both discrete and continuous representations of test articles. The damping analyses are based on friction equivalent viscous damping. Numerical examples are given for comparing the two augmentations with respect to minimizing frequency and damping increases.

Dynamic analysis to evaluate viscoelastic passive damping augmentation for the Space Shuttle Remote Manipulator System

NASA Technical Reports Server (NTRS)

Alberts, Thomas E.; Xia, Houchun; Chen, Yung

1992-01-01

The effectiveness of constrained viscoelastic layer damping treatment designs is evaluated separately as passive control measures for low frequency joint dominated modes and higher frequency boom flexure dominated modes using a NASTRAN finite element analysis. Passive damping augmentation is proposed which is based on a constrained viscoelastic layer damping treatment applied to the surface of the manipulators's flexible booms. It is pointed out that even the joint compliance dominated modes can be damped to some degree through appropriate design of the treatment.

General post-Minkowskian expansion and application of the phase function

NASA Astrophysics Data System (ADS)

Qin, Cheng-Gang; Shao, Cheng-Gang

2017-07-01

The phase function is a useful tool to study all observations of space missions, since it can give all the information about light propagation in a gravitational field. For the extreme accuracy of the modern space missions, a precise relativistic modeling of observations is required. So, we develop a recursive procedure enabling us to expand the phase function into a perturbative series of ascending powers of the Newtonian gravitational constant. Any n th-order perturbation of the phase function can be determined by the integral along the straight line connecting two point events. To illustrate the result, we carry out the calculation of the phase function outside a static, spherically symmetric body up to the order of G2. Then, we develop a precise relativistic model that is able to calculate the phase function and the derivatives of the phase function in the gravitational field of rotating and uniformly moving bodies. This model allows the computing of the Doppler, radio science, and astrometric observables of the space missions in the Solar System. With the development of space technology, the relativistic corrections due to the motion of a planet's spin must be considered in the high-precision space missions in the near future. As an example, we give the estimates of the relativistic corrections on the observables about the space missions TianQin and BEACON.

Algorithms for System Identification and Source Location.

NASA Astrophysics Data System (ADS)

Nehorai, Arye

This thesis deals with several topics in least squares estimation and applications to source location. It begins with a derivation of a mapping between Wiener theory and Kalman filtering for nonstationary autoregressive moving average (ARMO) processes. Applying time domain analysis, connections are found between time-varying state space realizations and input-output impulse response by matrix fraction description (MFD). Using these connections, the whitening filters are derived by the two approaches, and the Kalman gain is expressed in terms of Wiener theory. Next, fast estimation algorithms are derived in a unified way as special cases of the Conjugate Direction Method. The fast algorithms included are the block Levinson, fast recursive least squares, ladder (or lattice) and fast Cholesky algorithms. The results give a novel derivation and interpretation for all these methods, which are efficient alternatives to available recursive system identification algorithms. Multivariable identification algorithms are usually designed only for left MFD models. In this work, recursive multivariable identification algorithms are derived for right MFD models with diagonal denominator matrices. The algorithms are of prediction error and model reference type. Convergence analysis results obtained by the Ordinary Differential Equation (ODE) method are presented along with simulations. Sources of energy can be located by estimating time differences of arrival (TDOA's) of waves between the receivers. A new method for TDOA estimation is proposed for multiple unknown ARMA sources and additive correlated receiver noise. The method is based on a formula that uses only the receiver cross-spectra and the source poles. Two algorithms are suggested that allow tradeoffs between computational complexity and accuracy. A new time delay model is derived and used to show the applicability of the methods for non -integer TDOA's. Results from simulations illustrate the performance of the algorithms. The last chapter analyzes the response of exact least squares predictors for enhancement of sinusoids with additive colored noise. Using the matrix inversion lemma and the Christoffel-Darboux formula, the frequency response and amplitude gain of the sinusoids are expressed as functions of the signal and noise characteristics. The results generalize the available white noise case.

A transition matrix approach to the Davenport gryo calibration scheme

NASA Technical Reports Server (NTRS)

Natanson, G. A.

1998-01-01

The in-flight gyro calibration scheme commonly used by NASA Goddard Space Flight Center (GSFC) attitude ground support teams closely follows an original version of the Davenport algorithm developed in the late seventies. Its basic idea is to minimize the least-squares differences between attitudes gyro- propagated over the course of a maneuver and those determined using post- maneuver sensor measurements. The paper represents the scheme in a recursive form by combining necessary partials into a rectangular matrix, which is propagated in exactly the same way as a Kalman filters square transition matrix. The nontrivial structure of the propagation matrix arises from the fact that attitude errors are not included in the state vector, and therefore their derivatives with respect to estimated a parameters do not appear in the transition matrix gyro defined in the conventional way. In cases when the required accuracy can be achieved by a single iteration, representation of the Davenport gyro calibration scheme in a recursive form allows one to discard each gyro measurement immediately after it was used to propagate the attitude and state transition matrix. Another advantage of the new approach is that it utilizes the same expression for the error sensitivity matrix as that used by the Kalman filter. As a result the suggested modification of the Davenport algorithm made it possible to reuse software modules implemented in the Kalman filter estimator, where both attitude errors and gyro calibration parameters are included in the state vector. The new approach has been implemented in the ground calibration utilities used to support the Tropical Rainfall Measuring Mission (TRMM). The paper analyzes some preliminary results of gyro calibration performed by the TRMM ground attitude support team. It is demonstrated that an effect of the second iteration on estimated values of calibration parameters is negligibly small, and therefore there is no need to store processed gyro data. This opens a promising opportunity for onboard implementation of the suggested recursive procedure by combining, it with the Kalman filter used to obtain necessary attitude solutions at the beginning and end of each maneuver.

Automation and Robotics for Space-Based Systems, 1991

NASA Technical Reports Server (NTRS)

Williams, Robert L., II (Editor)

1992-01-01

The purpose of this in-house workshop was to assess the state-of-the-art of automation and robotics for space operations from an LaRC perspective and to identify areas of opportunity for future research. Over half of the presentations came from the Automation Technology Branch, covering telerobotic control, extravehicular activity (EVA) and intra-vehicular activity (IVA) robotics, hand controllers for teleoperation, sensors, neural networks, and automated structural assembly, all applied to space missions. Other talks covered the Remote Manipulator System (RMS) active damping augmentation, space crane work, modeling, simulation, and control of large, flexible space manipulators, and virtual passive controller designs for space robots.

Exposure of phototrophs to 548 days in low Earth orbit: microbial selection pressures in outer space and on early earth

PubMed Central

Cockell, Charles S; Rettberg, Petra; Rabbow, Elke; Olsson-Francis, Karen

2011-01-01

An epilithic microbial community was launched into low Earth orbit, and exposed to conditions in outer space for 548 days on the European Space Agency EXPOSE-E facility outside the International Space Station. The natural phototroph biofilm was augmented with akinetes of Anabaena cylindrica and vegetative cells of Nostoc commune and Chroococcidiopsis. In space-exposed dark controls, two algae (Chlorella and Rosenvingiella spp.), a cyanobacterium (Gloeocapsa sp.) and two bacteria associated with the natural community survived. Of the augmented organisms, cells of A. cylindrica and Chroococcidiopsis survived, but no cells of N. commune. Only cells of Chroococcidiopsis were cultured from samples exposed to the unattenuated extraterrestrial ultraviolet (UV) spectrum (>110 nm or 200 nm). Raman spectroscopy and bright-field microscopy showed that under these conditions the surface cells were bleached and their carotenoids were destroyed, although cell morphology was preserved. These experiments demonstrate that outer space can act as a selection pressure on the composition of microbial communities. The results obtained from samples exposed to >200 nm UV (simulating the putative worst-case UV exposure on the early Earth) demonstrate the potential for epilithic colonization of land masses during that time, but that UV radiation on anoxic planets can act as a strong selection pressure on surface-dwelling organisms. Finally, these experiments have yielded new phototrophic organisms of potential use in biomass and oxygen production in space exploration. PMID:21593797

Exposure of phototrophs to 548 days in low Earth orbit: microbial selection pressures in outer space and on early earth.

PubMed

Cockell, Charles S; Rettberg, Petra; Rabbow, Elke; Olsson-Francis, Karen

2011-10-01

An epilithic microbial community was launched into low Earth orbit, and exposed to conditions in outer space for 548 days on the European Space Agency EXPOSE-E facility outside the International Space Station. The natural phototroph biofilm was augmented with akinetes of Anabaena cylindrica and vegetative cells of Nostoc commune and Chroococcidiopsis. In space-exposed dark controls, two algae (Chlorella and Rosenvingiella spp.), a cyanobacterium (Gloeocapsa sp.) and two bacteria associated with the natural community survived. Of the augmented organisms, cells of A. cylindrica and Chroococcidiopsis survived, but no cells of N. commune. Only cells of Chroococcidiopsis were cultured from samples exposed to the unattenuated extraterrestrial ultraviolet (UV) spectrum (>110 nm or 200 nm). Raman spectroscopy and bright-field microscopy showed that under these conditions the surface cells were bleached and their carotenoids were destroyed, although cell morphology was preserved. These experiments demonstrate that outer space can act as a selection pressure on the composition of microbial communities. The results obtained from samples exposed to >200 nm UV (simulating the putative worst-case UV exposure on the early Earth) demonstrate the potential for epilithic colonization of land masses during that time, but that UV radiation on anoxic planets can act as a strong selection pressure on surface-dwelling organisms. Finally, these experiments have yielded new phototrophic organisms of potential use in biomass and oxygen production in space exploration.

Effects of spatial attention on mental time travel in patients with neglect.

PubMed

Anelli, Filomena; Avanzi, Stefano; Arzy, Shahar; Mancuso, Mauro; Frassinetti, Francesca

2018-04-01

Numerous studies agree that time is represented in spatial terms in the brain. Here we investigate how a deficit in orienting attention in space influences the ability to mentally travel in time, that is to recall the past and anticipate the future. Right brain-damaged patients, with (RBD-N+) and without neglect (RBD-N-), and healthy controls (HC) were subjected to a Mental Time Travel (MTT) task. Participants were asked to project themselves in time to past, present or future (i.e., self-projection) and, for each self-projection, to judge whether events were located relatively in the past or the future (i.e., self-reference). The MTT-task was performed before and after a manipulation, through prismatic adaptation (PA), inducing a leftward shift of spatial attention. Before PA, RBD-N+ were slower for future than for past events, whereas RBD-N- and HC responded similarly to past and future events. A leftward shift of spatial attention by PA reduced the difference in past/future processing in RBD-N+ and fastened RBD-N- and HC's response to past events. Assuming that time concepts, such as past/future, are coded with a left-to-right order on a mental time line (MTL), a recursive search of future-events can explain neglect patients' performance. Improvement of the spatial deficit following PA reduces the recursive search of future events on the rightmost part of the MTL, facilitating exploration of past events on the leftmost part of the MTL, finally favoring the correct location of past and future events. In addition, the study of the anatomical correlates of the temporal deficit in mental time travel through voxel-based lesion-symptom mapping showed a correlation with a lesion located in the insula and in the thalamus. These findings provide new insights about the inter-relations of space and time, and can pave the way to a procedure to rehabilitate a deficit in these cognitive domains. Copyright © 2018 Elsevier Ltd. All rights reserved.

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.

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

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.

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.

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

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

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.

Space Construction Experiment Definition Study (SCEDS), part 1. Volume 2: Study results

NASA Technical Reports Server (NTRS)

1981-01-01

A basic Space Shuttle flight experiment which will provide needed data on the construction of large space systems from the Orbiter was defined. The predicted dynamic behavior of a representative large structure, on-orbit construction operations, and Orbiter control during and after construction were studied. Evolutionary or supplemental flight experiments for the development or augmentation of a basic flight experiment were identified and defined. The study was divided into six major tasks with appropriate sub-tasks noted.

Learning New Sensorimotor Contingencies: Effects of Long-Term Use of Sensory Augmentation on the Brain and Conscious Perception.

PubMed

König, Sabine U; Schumann, Frank; Keyser, Johannes; Goeke, Caspar; Krause, Carina; Wache, Susan; Lytochkin, Aleksey; Ebert, Manuel; Brunsch, Vincent; Wahn, Basil; Kaspar, Kai; Nagel, Saskia K; Meilinger, Tobias; Bülthoff, Heinrich; Wolbers, Thomas; Büchel, Christian; König, Peter

2016-01-01

Theories of embodied cognition propose that perception is shaped by sensory stimuli and by the actions of the organism. Following sensorimotor contingency theory, the mastery of lawful relations between own behavior and resulting changes in sensory signals, called sensorimotor contingencies, is constitutive of conscious perception. Sensorimotor contingency theory predicts that, after training, knowledge relating to new sensorimotor contingencies develops, leading to changes in the activation of sensorimotor systems, and concomitant changes in perception. In the present study, we spell out this hypothesis in detail and investigate whether it is possible to learn new sensorimotor contingencies by sensory augmentation. Specifically, we designed an fMRI compatible sensory augmentation device, the feelSpace belt, which gives orientation information about the direction of magnetic north via vibrotactile stimulation on the waist of participants. In a longitudinal study, participants trained with this belt for seven weeks in natural environment. Our EEG results indicate that training with the belt leads to changes in sleep architecture early in the training phase, compatible with the consolidation of procedural learning as well as increased sensorimotor processing and motor programming. The fMRI results suggest that training entails activity in sensory as well as higher motor centers and brain areas known to be involved in navigation. These neural changes are accompanied with changes in how space and the belt signal are perceived, as well as with increased trust in navigational ability. Thus, our data on physiological processes and subjective experiences are compatible with the hypothesis that new sensorimotor contingencies can be acquired using sensory augmentation.

Learning New Sensorimotor Contingencies: Effects of Long-Term Use of Sensory Augmentation on the Brain and Conscious Perception

PubMed Central

Schumann, Frank; Keyser, Johannes; Goeke, Caspar; Krause, Carina; Wache, Susan; Lytochkin, Aleksey; Ebert, Manuel; Brunsch, Vincent; Wahn, Basil; Kaspar, Kai; Nagel, Saskia K.; Meilinger, Tobias; Bülthoff, Heinrich; Wolbers, Thomas; Büchel, Christian; König, Peter

2016-01-01

Theories of embodied cognition propose that perception is shaped by sensory stimuli and by the actions of the organism. Following sensorimotor contingency theory, the mastery of lawful relations between own behavior and resulting changes in sensory signals, called sensorimotor contingencies, is constitutive of conscious perception. Sensorimotor contingency theory predicts that, after training, knowledge relating to new sensorimotor contingencies develops, leading to changes in the activation of sensorimotor systems, and concomitant changes in perception. In the present study, we spell out this hypothesis in detail and investigate whether it is possible to learn new sensorimotor contingencies by sensory augmentation. Specifically, we designed an fMRI compatible sensory augmentation device, the feelSpace belt, which gives orientation information about the direction of magnetic north via vibrotactile stimulation on the waist of participants. In a longitudinal study, participants trained with this belt for seven weeks in natural environment. Our EEG results indicate that training with the belt leads to changes in sleep architecture early in the training phase, compatible with the consolidation of procedural learning as well as increased sensorimotor processing and motor programming. The fMRI results suggest that training entails activity in sensory as well as higher motor centers and brain areas known to be involved in navigation. These neural changes are accompanied with changes in how space and the belt signal are perceived, as well as with increased trust in navigational ability. Thus, our data on physiological processes and subjective experiences are compatible with the hypothesis that new sensorimotor contingencies can be acquired using sensory augmentation. PMID:27959914

Augmenting the SCaN Link Budget Tool with Validated Atmospheric Propagation

NASA Technical Reports Server (NTRS)

Steinkerchner, Leo; Welch, Bryan

2017-01-01

In any Earth-Space or Space-Earth communications link, atmospheric effects cause significant signal attenuation. In order to develop a communications system that is cost effective while meeting appropriate performance requirements, it is important to accurately predict these effects for the given link parameters. This project aimed to develop a Matlab(TradeMark) (The MathWorks, Inc.) program that could augment the existing Space Communications and Navigation (SCaN) Link Budget Tool with accurate predictions of atmospheric attenuation of both optical and radio-frequency signals according to the SCaN Optical Link Assessment Model Version 5 and the International Telecommunications Union, Radiocommunications Sector (ITU-R) atmospheric propagation loss model, respectively. When compared to data collected from the Advance Communications Technology Satellite (ACTS), the radio-frequency model predicted attenuation to within 1.3 dB of loss for 95 of measurements. Ultimately, this tool will be integrated into the SCaN Center for Engineering, Networks, Integration, and Communications (SCENIC) user interface in order to support analysis of existing SCaN systems and planning capabilities for future NASA missions.

Maxillary Sinus Augmentation for Dental Implant Rehabilitation of the Edentulous Ridge: A Comprehensive Overview of Systematic Reviews.

PubMed

Ting, Miriam; Rice, Jeremy G; Braid, Stanton M; Lee, Cameron Y S; Suzuki, Jon B

2017-06-01

The objective of this systemic review was to perform a comprehensive overview of systematic reviews and meta-analyses of the maxillary sinus augmentation procedure for implant rehabilitation in humans. The following were evaluated in this overview: (1) anatomic variables affecting sinus augmentation, (2) histomorphometric analysis of the grafted sinus, (3) volumetric changes after sinus grafting, and (4) implant survival beyond 1 year. Electronic databases were searched for systematic reviews and meta-analyses of implant-related sinus augmentation published from 1976 to September 2015. The studies selected must identify itself as a systemic review or meta-analysis in the title or abstract and must pertain to sinus augmentation. Thirty-three publications fulfilled the review criteria. The AMSTAR ratings for the 33 chosen reviews scored greater than 3 of 11, with 8 reviews scoring greater or equal to 8 of 11. The outcome of this overview suggested that the following will increase the success of sinus augmentation and survival of implants placed in the grafted sinus: (1) the use of barrier membranes over the lateral window when using a lateral approach to graft the sinus, (2) the use of particulate autogenous bone with or without other substitute graft materials, (3) sinus augmentation without the use of grafting materials may be considered provided that the space between the sinus membrane and floor can be maintained, (4) the use of rough-surfaced implants, (5) simultaneous implant placement with residual bone height greater than 4 mm, and (6) the cessation of smoking.

Fusion of an Ensemble of Augmented Image Detectors for Robust Object Detection

PubMed Central

Wei, Pan; Anderson, Derek T.

2018-01-01

A significant challenge in object detection is accurate identification of an object’s position in image space, whereas one algorithm with one set of parameters is usually not enough, and the fusion of multiple algorithms and/or parameters can lead to more robust results. Herein, a new computational intelligence fusion approach based on the dynamic analysis of agreement among object detection outputs is proposed. Furthermore, we propose an online versus just in training image augmentation strategy. Experiments comparing the results both with and without fusion are presented. We demonstrate that the augmented and fused combination results are the best, with respect to higher accuracy rates and reduction of outlier influences. The approach is demonstrated in the context of cone, pedestrian and box detection for Advanced Driver Assistance Systems (ADAS) applications. PMID:29562609

In-Flight Suppression of a Destabilized F/A-18 Structural Mode Using the Space Launch System Adaptive Augmenting Control System

NASA Technical Reports Server (NTRS)

Wall, John H.; VanZwieten, Tannen S.; Gilligan, Eric T.; Miller, Christopher J.; Hanson, Curtis E.; Orr, Jeb S.

2015-01-01

NASA's Space Launch System (SLS) Flight Control System (FCS) includes an Adaptive Augmenting Control (AAC) component which employs a multiplicative gain update law to enhance the performance and robustness of the baseline control system for extreme off nominal scenarios. The SLS FCS algorithm including AAC has been flight tested utilizing a specially outfitted F/A-18 fighter jet in which the pitch axis control of the aircraft was performed by a Non-linear Dynamic Inversion (NDI) controller, SLS reference models, and the SLS flight software prototype. This paper describes test cases from the research flight campaign in which the fundamental F/A-18 airframe structural mode was identified using frequency-domain reconstruction of flight data, amplified to result in closed loop instability, and suppressed in-flight by the SLS adaptive control system.

NASA Communications Augmentation network

NASA Technical Reports Server (NTRS)

Omidyar, Guy C.; Butler, Thomas E.; Laios, Straton C.

1990-01-01

The NASA Communications (Nascom) Division of the Mission Operations and Data Systems Directorate (MO&DSD) is to undertake a major initiative to develop the Nascom Augmentation (NAUG) network to achieve its long-range service objectives for operational data transport to support the Space Station Freedom Program, the Earth Observing System (EOS), and other projects. The NAUG is the Nascom ground communications network being developed to accommodate the operational traffic of the mid-1990s and beyond. The NAUG network development will be based on the Open Systems Interconnection Reference Model (OSI-RM). This paper describes the NAUG network architecture, subsystems, topology, and services; addresses issues of internetworking the Nascom network with other elements of the Space Station Information System (SSIS); discusses the operations environment. This paper also notes the areas of related research and presents the current conception of how the network will provide broadband services in 1998.

The MSFC Solar Activity Future Estimation (MSAFE) Model

NASA Technical Reports Server (NTRS)

Suggs, Ronnie J.

2017-01-01

The MSAFE model provides forecasts for the solar indices SSN, F10.7, and Ap. These solar indices are used as inputs to many space environment models used in orbital spacecraft operations and space mission analysis. Forecasts from the MSAFE model are provided on the MSFC Natural Environments Branch's solar webpage and are updated as new monthly observations come available. The MSAFE prediction routine employs a statistical technique that calculates deviations of past solar cycles from the mean cycle and performs a regression analysis to predict the deviation from the mean cycle of the solar index at the next future time interval. The prediction algorithm is applied recursively to produce monthly smoothed solar index values for the remaining of the cycle. The forecasts are initiated for a given cycle after about 8 to 12 months of observations are collected. A forecast made at the beginning of cycle 24 using the MSAFE program captured the cycle fairly well with some difficulty in discerning the double peak that occurred at solar cycle maximum.

A Time-Space Domain Information Fusion Method for Specific Emitter Identification Based on Dempster-Shafer Evidence Theory.

PubMed

Jiang, Wen; Cao, Ying; Yang, Lin; He, Zichang

2017-08-28

Specific emitter identification plays an important role in contemporary military affairs. However, most of the existing specific emitter identification methods haven't taken into account the processing of uncertain information. Therefore, this paper proposes a time-space domain information fusion method based on Dempster-Shafer evidence theory, which has the ability to deal with uncertain information in the process of specific emitter identification. In this paper, radars will generate a group of evidence respectively based on the information they obtained, and our main task is to fuse the multiple groups of evidence to get a reasonable result. Within the framework of recursive centralized fusion model, the proposed method incorporates a correlation coefficient, which measures the relevance between evidence and a quantum mechanical approach, which is based on the parameters of radar itself. The simulation results of an illustrative example demonstrate that the proposed method can effectively deal with uncertain information and get a reasonable recognition result.

Early Time Dynamics of Gluon Fields in High Energy Nuclear Collisions

NASA Astrophysics Data System (ADS)

Kapusta, Joseph I.; Chen, Guangyao; Fries, Rainer J.; Li, Yang

2016-12-01

Nuclei colliding at very high energy create a strong, quasi-classical gluon field during the initial phase of their interaction. We present an analytic calculation of the initial space-time evolution of this field in the limit of very high energies using a formal recursive solution of the Yang-Mills equations. We provide analytic expressions for the initial chromo-electric and chromo-magnetic fields and for their energy-momentum tensor. In particular, we discuss event-averaged results for energy density and energy flow as well as for longitudinal and transverse pressure of this system. Our results are generally applicable if τ < 1 /Qs. The transverse energy flow of the gluon field exhibits hydrodynamic-like contributions that follow transverse gradients of the energy density. In addition, a rapidity-odd energy flow also emerges from the non-abelian analog of Gauss' Law and generates non-vanishing angular momentum of the field. We will discuss the space-time picture that emerges from our analysis and its implications for observables in heavy ion collisions.

An Asymptotically-Optimal Sampling-Based Algorithm for Bi-directional Motion Planning

PubMed Central

Starek, Joseph A.; Gomez, Javier V.; Schmerling, Edward; Janson, Lucas; Moreno, Luis; Pavone, Marco

2015-01-01

Bi-directional search is a widely used strategy to increase the success and convergence rates of sampling-based motion planning algorithms. Yet, few results are available that merge both bi-directional search and asymptotic optimality into existing optimal planners, such as PRM*, RRT*, and FMT*. The objective of this paper is to fill this gap. Specifically, this paper presents a bi-directional, sampling-based, asymptotically-optimal algorithm named Bi-directional FMT* (BFMT*) that extends the Fast Marching Tree (FMT*) algorithm to bidirectional search while preserving its key properties, chiefly lazy search and asymptotic optimality through convergence in probability. BFMT* performs a two-source, lazy dynamic programming recursion over a set of randomly-drawn samples, correspondingly generating two search trees: one in cost-to-come space from the initial configuration and another in cost-to-go space from the goal configuration. Numerical experiments illustrate the advantages of BFMT* over its unidirectional counterpart, as well as a number of other state-of-the-art planners. PMID:27004130

The WINCKELMANN300 Project: Dissemination of Culture with Virtual Reality at the Capitoline Museum in Rome

NASA Astrophysics Data System (ADS)

Gonizzi Barsanti, S.; Malatesta, S. G.; Lella, F.; Fanini, B.; Sala, F.; Dodero, E.; Petacco, L.

2018-05-01

The best way to disseminate culture is, nowadays, the creation of scenarios with virtual and augmented reality that supply the visitors of museums with a powerful, interactive tool that allows to learn sometimes difficult concepts in an easy, entertaining way. 3D models derived from reality-based techniques are nowadays used to preserve, document and restore historical artefacts. These digital contents are also powerful instrument to interactively communicate their significance to non-specialist, making easier to understand concepts sometimes complicated or not clear. Virtual and Augmented Reality are surely a valid tool to interact with 3D models and a fundamental help in making culture more accessible to the wide public. These technologies can help the museum curators to adapt the cultural proposal and the information about the artefacts based on the different type of visitor's categories. These technologies allow visitors to travel through space and time and have a great educative function permitting to explain in an easy and attractive way information and concepts that could prove to be complicated. The aim of this paper is to create a virtual scenario and an augmented reality app to recreate specific spaces in the Capitoline Museum in Rome as they were during Winckelmann's time, placing specific statues in their original position in the 18th century.

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.

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

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.

Systematic generation of multibody equations of motion suitable for recursive and parallel manipulation

NASA Technical Reports Server (NTRS)

Nikravesh, Parviz E.; Gim, Gwanghum; Arabyan, Ara; Rein, Udo

1989-01-01

The formulation of a method known as the joint coordinate method for automatic generation of the equations of motion for multibody systems is summarized. For systems containing open or closed kinematic loops, the equations of motion can be reduced systematically to a minimum number of second order differential equations. The application of recursive and nonrecursive algorithms to this formulation, computational considerations and the feasibility of implementing this formulation on multiprocessor computers are discussed.

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.

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.

Visual information processing; Proceedings of the Meeting, Orlando, FL, Apr. 20-22, 1992

NASA Technical Reports Server (NTRS)

Huck, Friedrich O. (Editor); Juday, Richard D. (Editor)

1992-01-01

Topics discussed in these proceedings include nonlinear processing and communications; feature extraction and recognition; image gathering, interpolation, and restoration; image coding; and wavelet transform. Papers are presented on noise reduction for signals from nonlinear systems; driving nonlinear systems with chaotic signals; edge detection and image segmentation of space scenes using fractal analyses; a vision system for telerobotic operation; a fidelity analysis of image gathering, interpolation, and restoration; restoration of images degraded by motion; and information, entropy, and fidelity in visual communication. Attention is also given to image coding methods and their assessment, hybrid JPEG/recursive block coding of images, modified wavelets that accommodate causality, modified wavelet transform for unbiased frequency representation, and continuous wavelet transform of one-dimensional signals by Fourier filtering.

Structural Equation Model Trees

PubMed Central

Brandmaier, Andreas M.; von Oertzen, Timo; McArdle, John J.; Lindenberger, Ulman

2015-01-01

In the behavioral and social sciences, structural equation models (SEMs) have become widely accepted as a modeling tool for the relation between latent and observed variables. SEMs can be seen as a unification of several multivariate analysis techniques. SEM Trees combine the strengths of SEMs and the decision tree paradigm by building tree structures that separate a data set recursively into subsets with significantly different parameter estimates in a SEM. SEM Trees provide means for finding covariates and covariate interactions that predict differences in structural parameters in observed as well as in latent space and facilitate theory-guided exploration of empirical data. We describe the methodology, discuss theoretical and practical implications, and demonstrate applications to a factor model and a linear growth curve model. PMID:22984789

Haptic control with environment force estimation for telesurgery.

PubMed

Bhattacharjee, Tapomayukh; Son, Hyoung Il; Lee, Doo Yong

2008-01-01

Success of telesurgical operations depends on better position tracking ability of the slave device. Improved position tracking of the slave device can lead to safer and less strenuous telesurgical operations. The two-channel force-position control architecture is widely used for better position tracking ability. This architecture requires force sensors for direct force feedback. Force sensors may not be a good choice in the telesurgical environment because of the inherent noise, and limitation in the deployable place and space. Hence, environment force estimation is developed using the concept of the robot function parameter matrix and a recursive least squares method. Simulation results show efficacy of the proposed method. The slave device successfully tracks the position of the master device, and the estimation error quickly becomes negligible.

Real-Time Parameter Estimation in the Frequency Domain

NASA Technical Reports Server (NTRS)

Morelli, Eugene A.

2000-01-01

A method for real-time estimation of parameters in a linear dynamic state-space model was developed and studied. The application is aircraft dynamic model parameter estimation from measured data in flight. Equation error in the frequency domain was used with a recursive Fourier transform for the real-time data analysis. Linear and nonlinear simulation examples and flight test data from the F-18 High Alpha Research Vehicle were used to demonstrate that the technique produces accurate model parameter estimates with appropriate error bounds. Parameter estimates converged in less than one cycle of the dominant dynamic mode, using no a priori information, with control surface inputs measured in flight during ordinary piloted maneuvers. The real-time parameter estimation method has low computational requirements and could be implemented

Ground Robotic Hand Applications for the Space Program study (GRASP)

NASA Astrophysics Data System (ADS)

Grissom, William A.; Rafla, Nader I.

1992-04-01

This document reports on a NASA-STDP effort to address research interests of the NASA Kennedy Space Center (KSC) through a study entitled, Ground Robotic-Hand Applications for the Space Program (GRASP). The primary objective of the GRASP study was to identify beneficial applications of specialized end-effectors and robotic hand devices for automating any ground operations which are performed at the Kennedy Space Center. Thus, operations for expendable vehicles, the Space Shuttle and its components, and all payloads were included in the study. Typical benefits of automating operations, or augmenting human operators performing physical tasks, include: reduced costs; enhanced safety and reliability; and reduced processing turnaround time.

Ground Robotic Hand Applications for the Space Program study (GRASP)

NASA Technical Reports Server (NTRS)

Grissom, William A.; Rafla, Nader I. (Editor)

1992-01-01

This document reports on a NASA-STDP effort to address research interests of the NASA Kennedy Space Center (KSC) through a study entitled, Ground Robotic-Hand Applications for the Space Program (GRASP). The primary objective of the GRASP study was to identify beneficial applications of specialized end-effectors and robotic hand devices for automating any ground operations which are performed at the Kennedy Space Center. Thus, operations for expendable vehicles, the Space Shuttle and its components, and all payloads were included in the study. Typical benefits of automating operations, or augmenting human operators performing physical tasks, include: reduced costs; enhanced safety and reliability; and reduced processing turnaround time.

Fast estimation of space-robots inertia parameters: A modular mathematical formulation

NASA Astrophysics Data System (ADS)

Nabavi Chashmi, Seyed Yaser; Malaek, Seyed Mohammad-Bagher

2016-10-01

This work aims to propose a new technique that considerably helps enhance time and precision needed to identify ;Inertia Parameters (IPs); of a typical Autonomous Space-Robot (ASR). Operations might include, capturing an unknown Target Space-Object (TSO), ;active space-debris removal; or ;automated in-orbit assemblies;. In these operations generating precise successive commands are essential to the success of the mission. We show how a generalized, repeatable estimation-process could play an effective role to manage the operation. With the help of the well-known Force-Based approach, a new ;modular formulation; has been developed to simultaneously identify IPs of an ASR while it captures a TSO. The idea is to reorganize the equations with associated IPs with a ;Modular Set; of matrices instead of a single matrix representing the overall system dynamics. The devised Modular Matrix Set will then facilitate the estimation process. It provides a conjugate linear model in mass and inertia terms. The new formulation is, therefore, well-suited for ;simultaneous estimation processes; using recursive algorithms like RLS. Further enhancements would be needed for cases the effect of center of mass location becomes important. Extensive case studies reveal that estimation time is drastically reduced which in-turn paves the way to acquire better results.

Geospatial Augmented Reality for the interactive exploitation of large-scale walkable orthoimage maps in museums

NASA Astrophysics Data System (ADS)

Wüest, Robert; Nebiker, Stephan

2018-05-01

In this paper we present an app framework for augmenting large-scale walkable maps and orthoimages in museums or public spaces using standard smartphones and tablets. We first introduce a novel approach for using huge orthoimage mosaic floor prints covering several hundred square meters as natural Augmented Reality (AR) markers. We then present a new app architecture and subsequent tests in the Swissarena of the Swiss National Transport Museum in Lucerne demonstrating the capabilities of accurately tracking and augmenting different map topics, including dynamic 3d data such as live air traffic. The resulting prototype was tested with everyday visitors of the museum to get feedback on the usability of the AR app and to identify pitfalls when using AR in the context of a potentially crowded museum. The prototype is to be rolled out to the public after successful testing and optimization of the app. We were able to show that AR apps on standard smartphone devices can dramatically enhance the interactive use of large-scale maps for different purposes such as education or serious gaming in a museum context.

Navigation Architecture for a Space Mobile Network

NASA Technical Reports Server (NTRS)

Valdez, Jennifer E.; Ashman, Benjamin; Gramling, Cheryl; Heckler, Gregory W.; Carpenter, Russell

2016-01-01

The Tracking and Data Relay Satellite System (TDRSS) Augmentation Service for Satellites (TASS) is a proposed beacon service to provide a global, space based GPS augmentation service based on the NASA Global Differential GPS (GDGPS) System. The TASS signal will be tied to the GPS time system and usable as an additional ranging and Doppler radiometric source. Additionally, it will provide data vital to autonomous navigation in the near Earth regime, including space weather information, TDRS ephemerides, Earth Orientation Parameters (EOP), and forward commanding capability. TASS benefits include enhancing situational awareness, enabling increased autonomy, and providing near real-time command access for user platforms. As NASA Headquarters' Space Communication and Navigation Office (SCaN) begins to move away from a centralized network architecture and towards a Space Mobile Network (SMN) that allows for user initiated services, autonomous navigation will be a key part of such a system. This paper explores how a TASS beacon service enables the Space Mobile Networking paradigm, what a typical user platform would require, and provides an in-depth analysis of several navigation scenarios and operations concepts. This paper provides an overview of the TASS beacon and its role within the SMN and user community. Supporting navigation analysis is presented for two user mission scenarios: an Earth observing spacecraft in low earth orbit (LEO), and a highly elliptical spacecraft in a lunar resonance orbit. These diverse flight scenarios indicate the breadth of applicability of the TASS beacon for upcoming users within the current network architecture and in the SMN.

Global Positioning System wide area augmentation system (WAAS) performance standard.

DOT National Transportation Integrated Search

2008-10-31

The U.S. Global Positioning System (GPS) Standard Positioning Service (SPS) consists of spacebased : positioning, navigation, and timing (PNT) signals generated from space vehicles orbiting the : earth and delivered free of direct user fees for civil...

An Improved Otsu Threshold Segmentation Method for Underwater Simultaneous Localization and Mapping-Based Navigation

PubMed Central

Yuan, Xin; Martínez, José-Fernán; Eckert, Martina; López-Santidrián, Lourdes

2016-01-01

The main focus of this paper is on extracting features with SOund Navigation And Ranging (SONAR) sensing for further underwater landmark-based Simultaneous Localization and Mapping (SLAM). According to the characteristics of sonar images, in this paper, an improved Otsu threshold segmentation method (TSM) has been developed for feature detection. In combination with a contour detection algorithm, the foreground objects, although presenting different feature shapes, are separated much faster and more precisely than by other segmentation methods. Tests have been made with side-scan sonar (SSS) and forward-looking sonar (FLS) images in comparison with other four TSMs, namely the traditional Otsu method, the local TSM, the iterative TSM and the maximum entropy TSM. For all the sonar images presented in this work, the computational time of the improved Otsu TSM is much lower than that of the maximum entropy TSM, which achieves the highest segmentation precision among the four above mentioned TSMs. As a result of the segmentations, the centroids of the main extracted regions have been computed to represent point landmarks which can be used for navigation, e.g., with the help of an Augmented Extended Kalman Filter (AEKF)-based SLAM algorithm. The AEKF-SLAM approach is a recursive and iterative estimation-update process, which besides a prediction and an update stage (as in classical Extended Kalman Filter (EKF)), includes an augmentation stage. During navigation, the robot localizes the centroids of different segments of features in sonar images, which are detected by our improved Otsu TSM, as point landmarks. Using them with the AEKF achieves more accurate and robust estimations of the robot pose and the landmark positions, than with those detected by the maximum entropy TSM. Together with the landmarks identified by the proposed segmentation algorithm, the AEKF-SLAM has achieved reliable detection of cycles in the map and consistent map update on loop closure, which is shown in simulated experiments. PMID:27455279

An Improved Otsu Threshold Segmentation Method for Underwater Simultaneous Localization and Mapping-Based Navigation.

PubMed

Yuan, Xin; Martínez, José-Fernán; Eckert, Martina; López-Santidrián, Lourdes

2016-07-22

The main focus of this paper is on extracting features with SOund Navigation And Ranging (SONAR) sensing for further underwater landmark-based Simultaneous Localization and Mapping (SLAM). According to the characteristics of sonar images, in this paper, an improved Otsu threshold segmentation method (TSM) has been developed for feature detection. In combination with a contour detection algorithm, the foreground objects, although presenting different feature shapes, are separated much faster and more precisely than by other segmentation methods. Tests have been made with side-scan sonar (SSS) and forward-looking sonar (FLS) images in comparison with other four TSMs, namely the traditional Otsu method, the local TSM, the iterative TSM and the maximum entropy TSM. For all the sonar images presented in this work, the computational time of the improved Otsu TSM is much lower than that of the maximum entropy TSM, which achieves the highest segmentation precision among the four above mentioned TSMs. As a result of the segmentations, the centroids of the main extracted regions have been computed to represent point landmarks which can be used for navigation, e.g., with the help of an Augmented Extended Kalman Filter (AEKF)-based SLAM algorithm. The AEKF-SLAM approach is a recursive and iterative estimation-update process, which besides a prediction and an update stage (as in classical Extended Kalman Filter (EKF)), includes an augmentation stage. During navigation, the robot localizes the centroids of different segments of features in sonar images, which are detected by our improved Otsu TSM, as point landmarks. Using them with the AEKF achieves more accurate and robust estimations of the robot pose and the landmark positions, than with those detected by the maximum entropy TSM. Together with the landmarks identified by the proposed segmentation algorithm, the AEKF-SLAM has achieved reliable detection of cycles in the map and consistent map update on loop closure, which is shown in simulated experiments.

Hybrid Adaptive Flight Control with Model Inversion Adaptation

NASA Technical Reports Server (NTRS)

Nguyen, Nhan

2011-01-01

This study investigates a hybrid adaptive flight control method as a design possibility for a flight control system that can enable an effective adaptation strategy to deal with off-nominal flight conditions. The hybrid adaptive control blends both direct and indirect adaptive control in a model inversion flight control architecture. The blending of both direct and indirect adaptive control provides a much more flexible and effective adaptive flight control architecture than that with either direct or indirect adaptive control alone. The indirect adaptive control is used to update the model inversion controller by an on-line parameter estimation of uncertain plant dynamics based on two methods. The first parameter estimation method is an indirect adaptive law based on the Lyapunov theory, and the second method is a recursive least-squares indirect adaptive law. The model inversion controller is therefore made to adapt to changes in the plant dynamics due to uncertainty. As a result, the modeling error is reduced that directly leads to a decrease in the tracking error. In conjunction with the indirect adaptive control that updates the model inversion controller, a direct adaptive control is implemented as an augmented command to further reduce any residual tracking error that is not entirely eliminated by the indirect adaptive control.

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.

Thinking Cap Plus Thinking Zap: tDCS of Frontopolar Cortex Improves Creative Analogical Reasoning and Facilitates Conscious Augmentation of State Creativity in Verb Generation.

PubMed

Green, Adam E; Spiegel, Katherine A; Giangrande, Evan J; Weinberger, Adam B; Gallagher, Natalie M; Turkeltaub, Peter E

2017-04-01

Recent neuroimaging evidence indicates neural mechanisms that support transient improvements in creative performance (augmented state creativity) in response to cognitive interventions (creativity cueing). Separately, neural interventions via tDCS show encouraging potential for modulating neuronal function during creative performance. If cognitive and neural interventions are separately effective, can they be combined? Does state creativity augmentation represent "real" creativity, or do interventions simply yield divergence by diminishing meaningfulness/appropriateness? Can augmenting state creativity bolster creative reasoning that supports innovation, particularly analogical reasoning? To address these questions, we combined tDCS with creativity cueing. Testing a regionally specific hypothesis from neuroimaging, high-definition tDCS-targeted frontopolar cortex activity recently shown to predict state creativity augmentation. In a novel analogy finding task, participants under tDCS formulated substantially more creative analogical connections in a large matrix search space (creativity indexed via latent semantic analysis). Critically, increased analogical creativity was not due to diminished accuracy in discerning valid analogies, indicating "real" creativity rather than inappropriate divergence. A simpler relational creativity paradigm (modified verb generation) revealed a tDCS-by-cue interaction; tDCS further enhanced creativity cue-related increases in semantic distance. Findings point to the potential of noninvasive neuromodulation to enhance creative relational cognition, including augmentation of the deliberate effort to formulate connections between distant concepts. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

EGNOS Monitoring Prepared in Space Research Centre P.A.S. for SPMS Project

NASA Astrophysics Data System (ADS)

Swiatek, Anna; Jaworski, Leszek; Tomasik, Lukasz

2017-12-01

The European Geostationary Overlay Service (EGNOS) augments Global Positioning System (GPS) by providing correction data and integrity information for improving positioning over Europe. EGNOS Service Performance Monitoring Support (SPMS) project has assumed establishment, maintenance and implementation of an EGNOS performance monitoring network. The paper presents preliminary results of analyses prepared in Space Research Centre, Polish Academy of Sciences (Warsaw), as one of partners in SPMS project.

Active vibration damping of the Space Shuttle remote manipulator system

NASA Technical Reports Server (NTRS)

Scott, Michael A.; Gilbert, Michael G.; Demeo, Martha E.

1991-01-01

The feasibility of providing active damping augmentation of the Space Shuttle Remote Manipulator System (RMS) following normal payload handling operations is investigated. The approach used in the analysis is described, and the results for both linear and nonlinear performance analysis of candidate laws are presented, demonstrating that significant improvement in the RMS dynamic response can be achieved through active control using measured RMS tip acceleration data for feedback.

The role of nucleotides in augmentation of lymphocyte locomotion: Adaptional countermeasure development in microgravity analog environments

NASA Astrophysics Data System (ADS)

Sundaresan, Alamelu; Kulkarni, Anil D.; Yamauchi, Keiko; Pellis, Neal R.

2006-09-01

Space travel and long-term space residence such as envisaged in the exploration era implicates burdens on the immune system. An optimal immune response is required to countered and with-stand exposure to pathogens. Countermeasure development is an important avenue in space research especially for long-term space exploration. Microgravity exposure causes detrimental effects in lymphocyte functions which may impair immune response. Impaired lymphocyte function can be remedied by bypassing cell membrane events. This is done by using compounds such as Phorbol Myristate Acetate (PMA). Since activation in mouse splenocytes was augmented using nucleotides, it was essential to observe their effects on human lymphocyte locomotion. A nucleotide/nucleoside (NT/NT) mixture from Otsuka Pharmaceuticals (Naruto, Japan) was used at recommended doses. In lymphocytes cultured in modeled microgravity, the NT/NT mixture used orchestrated locomotion recovery by more than 87%, similar to the response documented with PMA in lymphocytes. Both 12µM and 120µM doses worked similarly. These are preliminary results leading to the possible use of the NT/NT mixture to mitigate immune suppression in micro-gravity. More studies in this direction are required to delineate the role of NT/NT on the immune response in microgravity.

Impact on Space-Based Navigation Systems of Large Magnetic Storm-Driven Nighttime Flows in the Mid-latitude Ionosphere

NASA Astrophysics Data System (ADS)

Basu, S.; Makela, J.; Doherty, P.; Wright, J.; Coster, A.

2008-05-01

Multi-technique ground and space-based studies conducted during the intense magnetic storm of 7-8 November 2004 yielded a hitherto little-recognized means of impacting space-based navigation systems such as the Federal Aviation Administration's Wide Area Augmentation System (WAAS) that operates in the North American sector. During this superstorm, no appreciable storm-enhanced density gradients were observed. Rather the mid-latitude region was enveloped by the auroral oval and the ionospheric trough within which the sub auroral polarization stream (SAPS) was confined during the local dusk to nighttime hours. This shows that such processes can partially disable GPS-based navigation systems for many hours even in the absence of appreciable TEC gradients, provided an intense flow channel is present in the ionosphere during nighttime hours, as revealed by DMSP and Dynasonde drift results. The competing effects of irregularity amplitude ΔN/N, the background F-region density and the magnitude of SAPS or auroral convection are discussed in establishing the extent of the region of impact on the WAAS system. In order to provide inputs to operational space weather models, the current GPS network used for measuring the total electron content in North America and elsewhere should be augmented by instruments that can measure ionospheric drifts.

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

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

Automated and continual determination of radio telescope reference points with sub-mm accuracy: results from a campaign at the Onsala Space Observatory

NASA Astrophysics Data System (ADS)

Lösler, Michael; Haas, Rüdiger; Eschelbach, Cornelia

2013-08-01

The Global Geodetic Observing System (GGOS) requires sub-mm accuracy, automated and continual determinations of the so-called local tie vectors at co-location stations. Co-location stations host instrumentation for several space geodetic techniques and the local tie surveys involve the relative geometry of the reference points of these instruments. Thus, these reference points need to be determined in a common coordinate system, which is a particular challenge for rotating equipment like radio telescopes for geodetic Very Long Baseline Interferometry. In this work we describe a concept to achieve automated and continual determinations of radio telescope reference points with sub-mm accuracy. We developed a monitoring system, including Java-based sensor communication for automated surveys, network adjustment and further data analysis. This monitoring system was tested during a monitoring campaign performed at the Onsala Space Observatory in the summer of 2012. The results obtained in this campaign show that it is possible to perform automated determination of a radio telescope reference point during normal operations of the telescope. Accuracies on the sub-mm level can be achieved, and continual determinations can be realized by repeated determinations and recursive estimation methods.

Abstract Interpreters for Free

NASA Astrophysics Data System (ADS)

Might, Matthew

In small-step abstract interpretations, the concrete and abstract semantics bear an uncanny resemblance. In this work, we present an analysis-design methodology that both explains and exploits that resemblance. Specifically, we present a two-step method to convert a small-step concrete semantics into a family of sound, computable abstract interpretations. The first step re-factors the concrete state-space to eliminate recursive structure; this refactoring of the state-space simultaneously determines a store-passing-style transformation on the underlying concrete semantics. The second step uses inference rules to generate an abstract state-space and a Galois connection simultaneously. The Galois connection allows the calculation of the "optimal" abstract interpretation. The two-step process is unambiguous, but nondeterministic: at each step, analysis designers face choices. Some of these choices ultimately influence properties such as flow-, field- and context-sensitivity. Thus, under the method, we can give the emergence of these properties a graph-theoretic characterization. To illustrate the method, we systematically abstract the continuation-passing style lambda calculus to arrive at two distinct families of analyses. The first is the well-known k-CFA family of analyses. The second consists of novel "environment-centric" abstract interpretations, none of which appear in the literature on static analysis of higher-order programs.

Color: an exosomatic organ?

NASA Astrophysics Data System (ADS)

van Brakel, Jaap; Saunders, Barbara

2001-12-01

According to the dominant view in cognitive science, in particular in its more popularized versions, color sensings or perceptions are located in a 'quality space'. This space has three dimensions: hue (the chromatic aspect of color), saturation (the 'intensity' of hue), and brightness. This space is structured further via a small number of primitive hues or landmark colors, usually four (red, yellow, green, blue) or six (if white and black are included). It has also been suggested that there are eleven semantic universals - the six colors previously mentioned plus orange, pink, brown, purple, and grey. Scientific evidence for these widely accepted theories is at best minimal, based on sloppy methodology and at worst non-existent. Against the standard view, it is argued that color might better be regarded as the outcome of a social-historical developmental trajectory in which there is mutual shaping of philosophical presuppositions, scientific theories, experimental practices, technological tools, industrial products, rhetorical frameworks, and their intercalated and recursive interactions with the practices of daily life. That is: color, the domain of color, is the outcome of interactive processes of scientific, instrumental, industrial, and everyday lifeworlds. That is: color might better be called an exosomatic organ, a second nature.

Computed torque control of a free-flying cooperat ing-arm robot

NASA Technical Reports Server (NTRS)

Koningstein, Ross; Ullman, Marc; Cannon, Robert H., Jr.

1989-01-01

The unified approach to solving free-floating space robot manipulator end-point control problems is presented using a control formulation based on an extension of computed torque. Once the desired end-point accelerations have been specified, the kinematic equations are used with momentum conservation equations to solve for the joint accelerations in any of the robot's possible configurations: fixed base or free-flying with open/closed chain grasp. The joint accelerations can then be used to calculate the arm control torques and internal forces using a recursive order N algorithm. Initial experimental verification of these techniques has been performed using a laboratory model of a two-armed space robot. This fully autonomous spacecraft system experiences the drag-free, zero G characteristics of space in two dimensions through the use of an air cushion support system. Results of these initial experiments are included which validate the correctness of the proposed methodology. The further problem of control in the large where not only the manipulator tip positions but the entire system consisting of base and arms must be controlled is also presented. The availability of a physical testbed has brought a keener insight into the subtleties of the problem at hand.

Actuation Using Piezoelectric Materials: Application in Augmenters, Energy Harvesters, and Motors

NASA Technical Reports Server (NTRS)

Hasenoehrl, Jennifer

2012-01-01

Piezoelectric actuators are used in many manipulation, movement, and mobility applications as well as transducers and sensors. When used at the resonance frequencies of the piezoelectric stack, the actuator performs at its maximum actuation capability. In this Space Grant internship, three applications of piezoelectric actuators were investigated including hammering augmenters of rotary drills, energy harvesters, and piezo-motors. The augmenter shows improved drill performance over rotation only. The energy harvesters rely on moving fluid to convert mechanical energy into electrical power. Specific designs allow the harvesters more freedom to move, which creates more power. The motor uses the linear movement of the actuator with a horn applied to the side of a rotor to create rotational motion. Friction inhibits this motion and is to be minimized for best performance. Tests and measurements were made during this internship to determine the requirements for optimal performance of the studied mechanisms and devices.

Numerical analysis and design optimization of supersonic after-burning with strut fuel injectors for scramjet engines

NASA Astrophysics Data System (ADS)

Candon, M. J.; Ogawa, H.

2018-06-01

Scramjets are a class of hypersonic airbreathing engine that offer promise for economical, reliable and high-speed access-to-space and atmospheric transport. The expanding flow in the scramjet nozzle comprises of unburned hydrogen. An after-burning scheme can be used to effectively utilize the remaining hydrogen by supplying additional oxygen into the nozzle, aiming to augment the thrust. This paper presents the results of a single-objective design optimization for a strut fuel injection scheme considering four design variables with the objective of maximizing thrust augmentation. Thrust is found to be augmented significantly owing to a combination of contributions from aerodynamic and combustion effects. Further understanding and physical insights have been gained by performing variance-based global sensitivity analysis, scrutinizing the nozzle flowfields, analyzing the distributions and contributions of the forces acting on the nozzle wall, and examining the combustion efficiency.

The Use of Geometry Learning Media Based on Augmented Reality for Junior High School Students

NASA Astrophysics Data System (ADS)

Rohendi, D.; Septian, S.; Sutarno, H.

2018-02-01

Understanding the geometry especially of three-dimensional space is still considered difficult by some students. Therefore, a learning innovation is required to overcome students’ difficulties in learning geometry. In this research, we developed geometry learning media based on augmented reality in android flatform’s then it was implemented in teaching three-dimensional objects for some junior high school students to find out: how is the students response in using this new media in geometry and is this media can solve the student’s difficulties in understanding geometry concept. The results showed that the use of geometry learning media based on augmented reality in android flatform is able to get positive responses from the students in learning geometry concepts especially three-dimensional objects and students more easy to understand concept of diagonal in geometry than before using this media.

Development of a Space Station Operations Management System

NASA Technical Reports Server (NTRS)

Brandli, A. E.; Mccandless, W. T.

1988-01-01

To enhance the productivity of operations aboard the Space Station, a means must be provided to augment, and frequently to supplant, human effort in support of mission operations and management, both on the ground and onboard. The Operations Management System (OMS), under development at the Johnson Space Center, is one such means. OMS comprises the tools and procedures to facilitate automation of station monitoring, control, and mission planning tasks. OMS mechanizes, and hence rationalizes, execution of tasks traditionally performed by mission planners, the mission control center team, onboard System Management software, and the flight crew.

Development of a Space Station Operations Management System

NASA Astrophysics Data System (ADS)

Brandli, A. E.; McCandless, W. T.

To enhance the productivity of operations aboard the Space Station, a means must be provided to augment, and frequently to supplant, human effort in support of mission operations and management, both on the ground and onboard. The Operations Management System (OMS), under development at the Johnson Space Center, is one such means. OMS comprises the tools and procedures to facilitate automation of station monitoring, control, and mission planning tasks. OMS mechanizes, and hence rationalizes, execution of tasks traditionally performed by mission planners, the mission control center team, onboard System Management software, and the flight crew.

Active control of silver nanoparticles spacing using dielectrophoresis for surface-enhanced Raman scattering.

PubMed

Chrimes, Adam F; Khoshmanesh, Khashayar; Stoddart, Paul R; Kayani, Aminuddin A; Mitchell, Arnan; Daima, Hemant; Bansal, Vipul; Kalantar-zadeh, Kourosh

2012-05-01

We demonstrate an active microfluidic platform that integrates dielectrophoresis for the control of silver nanoparticles spacing, as they flow in a liquid channel. By careful control of the nanoparticles spacing, we can effectively increase the surface-enhanced Raman scattering (SERS) signal intensity based on augmenting the number of SERS-active hot-spots, while avoiding irreversible aggregation of the particles. The system is benchmarked using dipicolinate (2,6-pyridinedicarboxylic acid) (DPA), which is a biomarker of Bacillus anthracis. The validity of the results is discussed using several complementing characterization scenarios.

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

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

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

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 .

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.

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.

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.

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.

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

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

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.