Sample records for adaptable recursive binary

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

  2. An adaptable binary entropy coder

    NASA Technical Reports Server (NTRS)

    Kiely, A.; Klimesh, M.

    2001-01-01

    We present a novel entropy coding technique which is based on recursive interleaving of variable-to-variable length binary source codes. We discuss code design and performance estimation methods, as well as practical encoding and decoding algorithms.

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

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

    PubMed

    Merkle, Edgar C; Shaffer, Victoria A

    2011-02-01

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

  5. Adaptable Binary Programs

    DTIC Science & Technology

    1994-04-01

    a variation of Ziv - Lempel compression [ZL77]. We found that using a standard compression algorithm rather than semantic compression allowed simplified...mentation. In Proceedings of the Conference on Programming Language Design and Implementation, 1993. (ZL77] J. Ziv and A. Lempel . A universal algorithm ...required by adaptable binaries. Our ABS stores adaptable binary information using the conventional binary symbol table and compresses this data using

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

  7. A recursive technique for adaptive vector quantization

    NASA Technical Reports Server (NTRS)

    Lindsay, Robert A.

    1989-01-01

    Vector Quantization (VQ) is fast becoming an accepted, if not preferred method for image compression. The VQ performs well when compressing all types of imagery including Video, Electro-Optical (EO), Infrared (IR), Synthetic Aperture Radar (SAR), Multi-Spectral (MS), and digital map data. The only requirement is to change the codebook to switch the compressor from one image sensor to another. There are several approaches for designing codebooks for a vector quantizer. Adaptive Vector Quantization is a procedure that simultaneously designs codebooks as the data is being encoded or quantized. This is done by computing the centroid as a recursive moving average where the centroids move after every vector is encoded. When computing the centroid of a fixed set of vectors the resultant centroid is identical to the previous centroid calculation. This method of centroid calculation can be easily combined with VQ encoding techniques. The defined quantizer changes after every encoded vector by recursively updating the centroid of minimum distance which is the selected by the encoder. Since the quantizer is changing definition or states after every encoded vector, the decoder must now receive updates to the codebook. This is done as side information by multiplexing bits into the compressed source data.

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

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

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

  11. Adaptive model reduction for continuous systems via recursive rational interpolation

    NASA Technical Reports Server (NTRS)

    Lilly, John H.

    1994-01-01

    A method for adaptive identification of reduced-order models for continuous stable SISO and MIMO plants is presented. The method recursively finds a model whose transfer function (matrix) matches that of the plant on a set of frequencies chosen by the designer. The algorithm utilizes the Moving Discrete Fourier Transform (MDFT) to continuously monitor the frequency-domain profile of the system input and output signals. The MDFT is an efficient method of monitoring discrete points in the frequency domain of an evolving function of time. The model parameters are estimated from MDFT data using standard recursive parameter estimation techniques. The algorithm has been shown in simulations to be quite robust to additive noise in the inputs and outputs. A significant advantage of the method is that it enables a type of on-line model validation. This is accomplished by simultaneously identifying a number of models and comparing each with the plant in the frequency domain. Simulations of the method applied to an 8th-order SISO plant and a 10-state 2-input 2-output plant are presented. An example of on-line model validation applied to the SISO plant is also presented.

  12. Real-time Adaptive EEG Source Separation using Online Recursive Independent Component Analysis

    PubMed Central

    Hsu, Sheng-Hsiou; Mullen, Tim; Jung, Tzyy-Ping; Cauwenberghs, Gert

    2016-01-01

    Independent Component Analysis (ICA) has been widely applied to electroencephalographic (EEG) biosignal processing and brain-computer interfaces. The practical use of ICA, however, is limited by its computational complexity, data requirements for convergence, and assumption of data stationarity, especially for high-density data. Here we study and validate an optimized online recursive ICA algorithm (ORICA) with online recursive least squares (RLS) whitening for blind source separation of high-density EEG data, which offers instantaneous incremental convergence upon presentation of new data. Empirical results of this study demonstrate the algorithm's: (a) suitability for accurate and efficient source identification in high-density (64-channel) realistically-simulated EEG data; (b) capability to detect and adapt to non-stationarity in 64-ch simulated EEG data; and (c) utility for rapidly extracting principal brain and artifact sources in real 61-channel EEG data recorded by a dry and wearable EEG system in a cognitive experiment. ORICA was implemented as functions in BCILAB and EEGLAB and was integrated in an open-source Real-time EEG Source-mapping Toolbox (REST), supporting applications in ICA-based online artifact rejection, feature extraction for real-time biosignal monitoring in clinical environments, and adaptable classifications in brain-computer interfaces. PMID:26685257

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

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

  15. Parametric recursive system identification and self-adaptive modeling of the human energy metabolism for adaptive control of fat weight.

    PubMed

    Őri, Zsolt P

    2017-05-01

    A mathematical model has been developed to facilitate indirect measurements of difficult to measure variables of the human energy metabolism on a daily basis. The model performs recursive system identification of the parameters of the metabolic model of the human energy metabolism using the law of conservation of energy and principle of indirect calorimetry. Self-adaptive models of the utilized energy intake prediction, macronutrient oxidation rates, and daily body composition changes were created utilizing Kalman filter and the nominal trajectory methods. The accuracy of the models was tested in a simulation study utilizing data from the Minnesota starvation and overfeeding study. With biweekly macronutrient intake measurements, the average prediction error of the utilized carbohydrate intake was -23.2 ± 53.8 kcal/day, fat intake was 11.0 ± 72.3 kcal/day, and protein was 3.7 ± 16.3 kcal/day. The fat and fat-free mass changes were estimated with an error of 0.44 ± 1.16 g/day for fat and -2.6 ± 64.98 g/day for fat-free mass. The daily metabolized macronutrient energy intake and/or daily macronutrient oxidation rate and the daily body composition change from directly measured serial data are optimally predicted with a self-adaptive model with Kalman filter that uses recursive system identification.

  16. An adaptable neural-network model for recursive nonlinear traffic prediction and modeling of MPEG video sources.

    PubMed

    Doulamis, A D; Doulamis, N D; Kollias, S D

    2003-01-01

    Multimedia services and especially digital video is expected to be the major traffic component transmitted over communication networks [such as internet protocol (IP)-based networks]. For this reason, traffic characterization and modeling of such services are required for an efficient network operation. The generated models can be used as traffic rate predictors, during the network operation phase (online traffic modeling), or as video generators for estimating the network resources, during the network design phase (offline traffic modeling). In this paper, an adaptable neural-network architecture is proposed covering both cases. The scheme is based on an efficient recursive weight estimation algorithm, which adapts the network response to current conditions. In particular, the algorithm updates the network weights so that 1) the network output, after the adaptation, is approximately equal to current bit rates (current traffic statistics) and 2) a minimal degradation over the obtained network knowledge is provided. It can be shown that the proposed adaptable neural-network architecture simulates a recursive nonlinear autoregressive model (RNAR) similar to the notation used in the linear case. The algorithm presents low computational complexity and high efficiency in tracking traffic rates in contrast to conventional retraining schemes. Furthermore, for the problem of offline traffic modeling, a novel correlation mechanism is proposed for capturing the burstness of the actual MPEG video traffic. The performance of the model is evaluated using several real-life MPEG coded video sources of long duration and compared with other linear/nonlinear techniques used for both cases. The results indicate that the proposed adaptable neural-network architecture presents better performance than other examined techniques.

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

  18. Distributed Adaptive Binary Quantization for Fast Nearest Neighbor Search.

    PubMed

    Xianglong Liu; Zhujin Li; Cheng Deng; Dacheng Tao

    2017-11-01

    Hashing has been proved an attractive technique for fast nearest neighbor search over big data. Compared with the projection based hashing methods, prototype-based ones own stronger power to generate discriminative binary codes for the data with complex intrinsic structure. However, existing prototype-based methods, such as spherical hashing and K-means hashing, still suffer from the ineffective coding that utilizes the complete binary codes in a hypercube. To address this problem, we propose an adaptive binary quantization (ABQ) method that learns a discriminative hash function with prototypes associated with small unique binary codes. Our alternating optimization adaptively discovers the prototype set and the code set of a varying size in an efficient way, which together robustly approximate the data relations. Our method can be naturally generalized to the product space for long hash codes, and enjoys the fast training linear to the number of the training data. We further devise a distributed framework for the large-scale learning, which can significantly speed up the training of ABQ in the distributed environment that has been widely deployed in many areas nowadays. The extensive experiments on four large-scale (up to 80 million) data sets demonstrate that our method significantly outperforms state-of-the-art hashing methods, with up to 58.84% performance gains relatively.

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

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

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

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

  3. Binary Disassembly Block Coverage by Symbolic Execution vs. Recursive Descent

    DTIC Science & Technology

    2012-03-01

    explores the effectiveness of symbolic execution on packed or obfuscated samples of the same binaries to generate a model-based evaluation of success...24 2.3.4.1 Packing . . . . . . . . . . . . . . . . . . . . . . . . . . 25 2.3.4.2 Techniques...inner workings of UPX (Universal Packer for eXecutables), a common packing tool, on a Windows binary. Image source: GFC08 . . . . . . . . . . . 25 3.1

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

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

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

  7. Binary tree eigen solver in finite element analysis

    NASA Technical Reports Server (NTRS)

    Akl, F. A.; Janetzke, D. C.; Kiraly, L. J.

    1993-01-01

    This paper presents a transputer-based binary tree eigensolver for the solution of the generalized eigenproblem in linear elastic finite element analysis. The algorithm is based on the method of recursive doubling, which parallel implementation of a number of associative operations on an arbitrary set having N elements is of the order of o(log2N), compared to (N-1) steps if implemented sequentially. The hardware used in the implementation of the binary tree consists of 32 transputers. The algorithm is written in OCCAM which is a high-level language developed with the transputers to address parallel programming constructs and to provide the communications between processors. The algorithm can be replicated to match the size of the binary tree transputer network. Parallel and sequential finite element analysis programs have been developed to solve for the set of the least-order eigenpairs using the modified subspace method. The speed-up obtained for a typical analysis problem indicates close agreement with the theoretical prediction given by the method of recursive doubling.

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

  9. Processing of fetal heart rate through non-invasive adaptive system based on recursive least squares algorithm

    NASA Astrophysics Data System (ADS)

    Fajkus, Marcel; Nedoma, Jan; Martinek, Radek; Vasinek, Vladimir

    2017-10-01

    In this article, we describe an innovative non-invasive method of Fetal Phonocardiography (fPCG) using fiber-optic sensors and adaptive algorithm for the measurement of fetal heart rate (fHR). Conventional PCG is based on a noninvasive scanning of acoustic signals by means of a microphone placed on the thorax. As for fPCG, the microphone is placed on the maternal abdomen. Our solution is based on patent pending non-invasive scanning of acoustic signals by means of a fiber-optic interferometer. Fiber-optic sensors are resistant to technical artifacts such as electromagnetic interferences (EMI), thus they can be used in situations where it is impossible to use conventional EFM methods, e.g. during Magnetic Resonance Imaging (MRI) examination or in case of delivery in water. The adaptive evaluation system is based on Recursive least squares (RLS) algorithm. Based on real measurements provided on five volunteers with their written consent, we created a simplified dynamic signal model of a distribution of heartbeat sounds (HS) through the human body. Our created model allows us to verification of the proposed adaptive system RLS algorithm. The functionality of the proposed non-invasive adaptive system was verified by objective parameters such as Sensitivity (S+) and Signal to Noise Ratio (SNR).

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

  11. Medical image classification using spatial adjacent histogram based on adaptive local binary patterns.

    PubMed

    Liu, Dong; Wang, Shengsheng; Huang, Dezhi; Deng, Gang; Zeng, Fantao; Chen, Huiling

    2016-05-01

    Medical image recognition is an important task in both computer vision and computational biology. In the field of medical image classification, representing an image based on local binary patterns (LBP) descriptor has become popular. However, most existing LBP-based methods encode the binary patterns in a fixed neighborhood radius and ignore the spatial relationships among local patterns. The ignoring of the spatial relationships in the LBP will cause a poor performance in the process of capturing discriminative features for complex samples, such as medical images obtained by microscope. To address this problem, in this paper we propose a novel method to improve local binary patterns by assigning an adaptive neighborhood radius for each pixel. Based on these adaptive local binary patterns, we further propose a spatial adjacent histogram strategy to encode the micro-structures for image representation. An extensive set of evaluations are performed on four medical datasets which show that the proposed method significantly improves standard LBP and compares favorably with several other prevailing approaches. Copyright © 2016 Elsevier Ltd. All rights reserved.

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

  13. Adaptive feature selection using v-shaped binary particle swarm optimization.

    PubMed

    Teng, Xuyang; Dong, Hongbin; Zhou, Xiurong

    2017-01-01

    Feature selection is an important preprocessing method in machine learning and data mining. This process can be used not only to reduce the amount of data to be analyzed but also to build models with stronger interpretability based on fewer features. Traditional feature selection methods evaluate the dependency and redundancy of features separately, which leads to a lack of measurement of their combined effect. Moreover, a greedy search considers only the optimization of the current round and thus cannot be a global search. To evaluate the combined effect of different subsets in the entire feature space, an adaptive feature selection method based on V-shaped binary particle swarm optimization is proposed. In this method, the fitness function is constructed using the correlation information entropy. Feature subsets are regarded as individuals in a population, and the feature space is searched using V-shaped binary particle swarm optimization. The above procedure overcomes the hard constraint on the number of features, enables the combined evaluation of each subset as a whole, and improves the search ability of conventional binary particle swarm optimization. The proposed algorithm is an adaptive method with respect to the number of feature subsets. The experimental results show the advantages of optimizing the feature subsets using the V-shaped transfer function and confirm the effectiveness and efficiency of the feature subsets obtained under different classifiers.

  14. Adaptive feature selection using v-shaped binary particle swarm optimization

    PubMed Central

    Dong, Hongbin; Zhou, Xiurong

    2017-01-01

    Feature selection is an important preprocessing method in machine learning and data mining. This process can be used not only to reduce the amount of data to be analyzed but also to build models with stronger interpretability based on fewer features. Traditional feature selection methods evaluate the dependency and redundancy of features separately, which leads to a lack of measurement of their combined effect. Moreover, a greedy search considers only the optimization of the current round and thus cannot be a global search. To evaluate the combined effect of different subsets in the entire feature space, an adaptive feature selection method based on V-shaped binary particle swarm optimization is proposed. In this method, the fitness function is constructed using the correlation information entropy. Feature subsets are regarded as individuals in a population, and the feature space is searched using V-shaped binary particle swarm optimization. The above procedure overcomes the hard constraint on the number of features, enables the combined evaluation of each subset as a whole, and improves the search ability of conventional binary particle swarm optimization. The proposed algorithm is an adaptive method with respect to the number of feature subsets. The experimental results show the advantages of optimizing the feature subsets using the V-shaped transfer function and confirm the effectiveness and efficiency of the feature subsets obtained under different classifiers. PMID:28358850

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

  16. Practical low-cost visual communication using binary images for deaf sign language.

    PubMed

    Manoranjan, M D; Robinson, J A

    2000-03-01

    Deaf sign language transmitted by video requires a temporal resolution of 8 to 10 frames/s for effective communication. Conventional videoconferencing applications, when operated over low bandwidth telephone lines, provide very low temporal resolution of pictures, of the order of less than a frame per second, resulting in jerky movement of objects. This paper presents a practical solution for sign language communication, offering adequate temporal resolution of images using moving binary sketches or cartoons, implemented on standard personal computer hardware with low-cost cameras and communicating over telephone lines. To extract cartoon points an efficient feature extraction algorithm adaptive to the global statistics of the image is proposed. To improve the subjective quality of the binary images, irreversible preprocessing techniques, such as isolated point removal and predictive filtering, are used. A simple, efficient and fast recursive temporal prefiltering scheme, using histograms of successive frames, reduces the additive and multiplicative noise from low-cost cameras. An efficient three-dimensional (3-D) compression scheme codes the binary sketches. Subjective tests performed on the system confirm that it can be used for sign language communication over telephone lines.

  17. A novel asynchronous access method with binary interfaces

    PubMed Central

    2008-01-01

    Background Traditionally synchronous access strategies require users to comply with one or more time constraints in order to communicate intent with a binary human-machine interface (e.g., mechanical, gestural or neural switches). Asynchronous access methods are preferable, but have not been used with binary interfaces in the control of devices that require more than two commands to be successfully operated. Methods We present the mathematical development and evaluation of a novel asynchronous access method that may be used to translate sporadic activations of binary interfaces into distinct outcomes for the control of devices requiring an arbitrary number of commands to be controlled. With this method, users are required to activate their interfaces only when the device under control behaves erroneously. Then, a recursive algorithm, incorporating contextual assumptions relevant to all possible outcomes, is used to obtain an informed estimate of user intention. We evaluate this method by simulating a control task requiring a series of target commands to be tracked by a model user. Results When compared to a random selection, the proposed asynchronous access method offers a significant reduction in the number of interface activations required from the user. Conclusion This novel access method offers a variety of advantages over traditionally synchronous access strategies and may be adapted to a wide variety of contexts, with primary relevance to applications involving direct object manipulation. PMID:18959797

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

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

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

  1. Accurate human limb angle measurement: sensor fusion through Kalman, least mean squares and recursive least-squares adaptive filtering

    NASA Astrophysics Data System (ADS)

    Olivares, A.; Górriz, J. M.; Ramírez, J.; Olivares, G.

    2011-02-01

    Inertial sensors are widely used in human body motion monitoring systems since they permit us to determine the position of the subject's limbs. Limb angle measurement is carried out through the integration of the angular velocity measured by a rate sensor and the decomposition of the components of static gravity acceleration measured by an accelerometer. Different factors derived from the sensors' nature, such as the angle random walk and dynamic bias, lead to erroneous measurements. Dynamic bias effects can be reduced through the use of adaptive filtering based on sensor fusion concepts. Most existing published works use a Kalman filtering sensor fusion approach. Our aim is to perform a comparative study among different adaptive filters. Several least mean squares (LMS), recursive least squares (RLS) and Kalman filtering variations are tested for the purpose of finding the best method leading to a more accurate and robust limb angle measurement. A new angle wander compensation sensor fusion approach based on LMS and RLS filters has been developed.

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

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

  4. Exact analytical solution of irreversible binary dynamics on networks.

    PubMed

    Laurence, Edward; Young, Jean-Gabriel; Melnik, Sergey; Dubé, Louis J

    2018-03-01

    In binary cascade dynamics, the nodes of a graph are in one of two possible states (inactive, active), and nodes in the inactive state make an irreversible transition to the active state, as soon as their precursors satisfy a predetermined condition. We introduce a set of recursive equations to compute the probability of reaching any final state, given an initial state, and a specification of the transition probability function of each node. Because the naive recursive approach for solving these equations takes factorial time in the number of nodes, we also introduce an accelerated algorithm, built around a breath-first search procedure. This algorithm solves the equations as efficiently as possible in exponential time.

  5. Exact analytical solution of irreversible binary dynamics on networks

    NASA Astrophysics Data System (ADS)

    Laurence, Edward; Young, Jean-Gabriel; Melnik, Sergey; Dubé, Louis J.

    2018-03-01

    In binary cascade dynamics, the nodes of a graph are in one of two possible states (inactive, active), and nodes in the inactive state make an irreversible transition to the active state, as soon as their precursors satisfy a predetermined condition. We introduce a set of recursive equations to compute the probability of reaching any final state, given an initial state, and a specification of the transition probability function of each node. Because the naive recursive approach for solving these equations takes factorial time in the number of nodes, we also introduce an accelerated algorithm, built around a breath-first search procedure. This algorithm solves the equations as efficiently as possible in exponential time.

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

  7. A novel approach for SEMG signal classification with adaptive local binary patterns.

    PubMed

    Ertuğrul, Ömer Faruk; Kaya, Yılmaz; Tekin, Ramazan

    2016-07-01

    Feature extraction plays a major role in the pattern recognition process, and this paper presents a novel feature extraction approach, adaptive local binary pattern (aLBP). aLBP is built on the local binary pattern (LBP), which is an image processing method, and one-dimensional local binary pattern (1D-LBP). In LBP, each pixel is compared with its neighbors. Similarly, in 1D-LBP, each data in the raw is judged against its neighbors. 1D-LBP extracts feature based on local changes in the signal. Therefore, it has high a potential to be employed in medical purposes. Since, each action or abnormality, which is recorded in SEMG signals, has its own pattern, and via the 1D-LBP these (hidden) patterns may be detected. But, the positions of the neighbors in 1D-LBP are constant depending on the position of the data in the raw. Also, both LBP and 1D-LBP are very sensitive to noise. Therefore, its capacity in detecting hidden patterns is limited. To overcome these drawbacks, aLBP was proposed. In aLBP, the positions of the neighbors and their values can be assigned adaptively via the down-sampling and the smoothing coefficients. Therefore, the potential to detect (hidden) patterns, which may express an illness or an action, is really increased. To validate the proposed feature extraction approach, two different datasets were employed. Achieved accuracies by the proposed approach were higher than obtained results by employed popular feature extraction approaches and the reported results in the literature. Obtained accuracy results were brought out that the proposed method can be employed to investigate SEMG signals. In summary, this work attempts to develop an adaptive feature extraction scheme that can be utilized for extracting features from local changes in different categories of time-varying signals.

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

  9. Recursive time-varying filter banks for subband image coding

    NASA Technical Reports Server (NTRS)

    Smith, Mark J. T.; Chung, Wilson C.

    1992-01-01

    Filter banks and wavelet decompositions that employ recursive filters have been considered previously and are recognized for their efficiency in partitioning the frequency spectrum. This paper presents an analysis of a new infinite impulse response (IIR) filter bank in which these computationally efficient filters may be changed adaptively in response to the input. The filter bank is presented and discussed in the context of finite-support signals with the intended application in subband image coding. In the absence of quantization errors, exact reconstruction can be achieved and by the proper choice of an adaptation scheme, it is shown that IIR time-varying filter banks can yield improvement over conventional ones.

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

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

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

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

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

  15. SEARCHING FOR BINARY Y DWARFS WITH THE GEMINI MULTI-CONJUGATE ADAPTIVE OPTICS SYSTEM (GeMS)

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

    Opitz, Daniela; Tinney, C. G.; Faherty, Jacqueline K.

    The NASA Wide-field Infrared Survey Explorer (WISE) has discovered almost all the known members of the new class of Y-type brown dwarfs. Most of these Y dwarfs have been identified as isolated objects in the field. It is known that binaries with L- and T-type brown dwarf primaries are less prevalent than either M-dwarf or solar-type primaries, they tend to have smaller separations and are more frequently detected in near-equal mass configurations. The binary statistics for Y-type brown dwarfs, however, are sparse, and so it is unclear if the same trends that hold for L- and T-type brown dwarfs alsomore » hold for Y-type ones. In addition, the detection of binary companions to very cool Y dwarfs may well be the best means available for discovering even colder objects. We present results for binary properties of a sample of five WISE Y dwarfs with the Gemini Multi-Conjugate Adaptive Optics System. We find no evidence for binary companions in these data, which suggests these systems are not equal-luminosity (or equal-mass) binaries with separations larger than ∼0.5–1.9 AU. For equal-mass binaries at an age of 5 Gyr, we find that the binary binding energies ruled out by our observations (i.e., 10{sup 42} erg) are consistent with those observed in previous studies of hotter ultra-cool dwarfs.« less

  16. Recursive causality in evolution: a model for epigenetic mechanisms in cancer development.

    PubMed

    Haslberger, A; Varga, F; Karlic, H

    2006-01-01

    Interactions between adaptative and selective processes are illustrated in the model of recursive causality as defined in Rupert Riedl's systems theory of evolution. One of the main features of this theory also termed as theory of evolving complexity is the centrality of the notion of 'recursive' or 'feedback' causality - 'the idea that every biological effect in living systems, in some way, feeds back to its own cause'. Our hypothesis is that "recursive" or "feedback" causality provides a model for explaining the consequences of interacting genetic and epigenetic mechanisms which are known to play a key role in development of cancer. Epigenetics includes any process that alters gene activity without changes of the DNA sequence. The most important epigenetic mechanisms are DNA-methylation and chromatin remodeling. Hypomethylation of so-called oncogenes and hypermethylation of tumor suppressor genes appear to be critical determinants of cancer. Folic acid, vitamin B12 and other nutrients influence the function of enzymes that participate in various methylation processes by affecting the supply of methyl groups into a variety of molecules which may be directly or indirectly associated with cancerogenesis. We present an example from our own studies by showing that vitamin D3 has the potential to de-methylate the osteocalcin-promoter in MG63 osteosarcoma cells. Consequently, a stimulation of osteocalcin synthesis can be observed. The above mentioned enzymes also play a role in development and differentiation of cells and organisms and thus illustrate the close association between evolutionary and developmental mechanisms. This enabled new ways to understand the interaction between the genome and environment and may improve biomedical concepts including environmental health aspects where epigenetic and genetic modifications are closely associated. Recent observations showed that methylated nucleotides in the gene promoter may serve as a target for solar UV

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

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

  19. Hierarchical image segmentation via recursive superpixel with adaptive regularity

    NASA Astrophysics Data System (ADS)

    Nakamura, Kensuke; Hong, Byung-Woo

    2017-11-01

    A fast and accurate segmentation algorithm in a hierarchical way based on a recursive superpixel technique is presented. We propose a superpixel energy formulation in which the trade-off between data fidelity and regularization is dynamically determined based on the local residual in the energy optimization procedure. We also present an energy optimization algorithm that allows a pixel to be shared by multiple regions to improve the accuracy and appropriate the number of segments. The qualitative and quantitative evaluations demonstrate that our algorithm, combining the proposed energy and optimization, outperforms the conventional k-means algorithm by up to 29.10% in F-measure. We also perform comparative analysis with state-of-the-art algorithms in the hierarchical segmentation. Our algorithm yields smooth regions throughout the hierarchy as opposed to the others that include insignificant details. Our algorithm overtakes the other algorithms in terms of balance between accuracy and computational time. Specifically, our method runs 36.48% faster than the region-merging approach, which is the fastest of the comparing algorithms, while achieving a comparable accuracy.

  20. Comparison of NRZ and duo-binary format in adaptive equalization assisted 10G-optics based 25G-EPON

    NASA Astrophysics Data System (ADS)

    Xia, Junqi; Li, Zhengxuan; Li, Yingchun; Xu, Tingting; Chen, Jian; Song, Yingxiong; Wang, Min

    2018-03-01

    We investigate and compare the requirements of FFE/DFE based adaptive equalization techniques for NRZ and Duo-binary based 25-Gb/s transmission, which are two of the most promising schemes for 25G-EPON. A 25-Gb/s transmission system based on 10G optical transceivers is demonstrated and the performance of only FFE and combination of FFE and DFE with different number of taps are compared with two modulation formats. The FFE/DFE based Duo-binary receiver shows better performance than NRZ receiver. For Duo-binary receiver, only 13-tap FFE is needed for BtB case and the combination of 17-tap FFE and 5-tap DFE can achieve a sensitivity of -23.45 dBm in 25 km transmission case, which is ∼0.6 dB better than the best performance of NRZ equalization. In addition, the requirements of training sequence length for FFE/DFE based adaptive equalization is verified. Experimental results show that 400 symbols training length is optimal for the two modulations, which shows a small packet preamble in up-stream burst-mode transmission.

  1. On recursive least-squares filtering algorithms and implementations. Ph.D. Thesis

    NASA Technical Reports Server (NTRS)

    Hsieh, Shih-Fu

    1990-01-01

    In many real-time signal processing applications, fast and numerically stable algorithms for solving least-squares problems are necessary and important. In particular, under non-stationary conditions, these algorithms must be able to adapt themselves to reflect the changes in the system and take appropriate adjustments to achieve optimum performances. Among existing algorithms, the QR-decomposition (QRD)-based recursive least-squares (RLS) methods have been shown to be useful and effective for adaptive signal processing. In order to increase the speed of processing and achieve high throughput rate, many algorithms are being vectorized and/or pipelined to facilitate high degrees of parallelism. A time-recursive formulation of RLS filtering employing block QRD will be considered first. Several methods, including a new non-continuous windowing scheme based on selectively rejecting contaminated data, were investigated for adaptive processing. Based on systolic triarrays, many other forms of systolic arrays are shown to be capable of implementing different algorithms. Various updating and downdating systolic algorithms and architectures for RLS filtering are examined and compared in details, which include Householder reflector, Gram-Schmidt procedure, and Givens rotation. A unified approach encompassing existing square-root-free algorithms is also proposed. For the sinusoidal spectrum estimation problem, a judicious method of separating the noise from the signal is of great interest. Various truncated QR methods are proposed for this purpose and compared to the truncated SVD method. Computer simulations provided for detailed comparisons show the effectiveness of these methods. This thesis deals with fundamental issues of numerical stability, computational efficiency, adaptivity, and VLSI implementation for the RLS filtering problems. In all, various new and modified algorithms and architectures are proposed and analyzed; the significance of any of the new method depends

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

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

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

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

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

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

  8. Simple recursion relations for general field theories

    DOE PAGES

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

    2015-06-17

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

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

  10. Astrometric and photometric measurements of binary stars with adaptive optics: observations from 2001 to 2006

    NASA Astrophysics Data System (ADS)

    Roberts, Lewis C.; Mason, Brian D.

    2018-02-01

    The adaptive optics system at the 3.6 m Advanced Electro-Optical System telescope was used to measure the astrometry and differential magnitude in I band of binary star systems between 2002 and 2006. We report 413 astrometric and photometric measurements of 373 stellar pairs. The astrometric measurements will be of use for future orbital determination, and the photometric measurements will be of use in estimating the spectral types of the component stars. For 21 binaries that had not been observed in decades, we are able to confirm that the systems share common proper motion. Candidate new companions were detected in 24 systems; for these we show the discovery images. Follow-up observations should be able to determine if these systems share common proper motion and are gravitationally bound objects. We computed orbits for nine binaries. Of these, the orbits of five systems are improved compared to prior orbits and four systems have their orbits computed for the first time. In addition, 315 stars were unresolved and the full-width half maxima of the images are presented.

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

  12. A recursive Bayesian updating model of haptic stiffness perception.

    PubMed

    Wu, Bing; Klatzky, Roberta L

    2018-06-01

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

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

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

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

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

  17. Adaptive Two Dimensional RLS (Recursive Least Squares) Algorithms

    DTIC Science & Technology

    1989-03-01

    in Monterey wonderful. IX I. INTRODUCTION Adaptive algorithms have been used successfully for many years in a wide range of digital signal...SIMULATION RESULTS The 2-D FRLS algorithm was tested both on computer-generated data and on digitized images. For a baseline reference the 2-D L:rv1S...Alexander, S. T. Adaptivt Signal Processing: Theory and Applications. Springer- Verlag, New York. 1986. 7. Bellanger, Maurice G. Adaptive Digital

  18. Solution-Adaptive Cartesian Cell Approach for Viscous and Inviscid Flows

    NASA Technical Reports Server (NTRS)

    Coirier, William J.; Powell, Kenneth G.

    1996-01-01

    A Cartesian cell-based approach for adaptively refined solutions of the Euler and Navier-Stokes equations in two dimensions is presented. Grids about geometrically complicated bodies are generated automatically, by the recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, polygonal cut cells are created using modified polygon-clipping algorithms. The grid is stored in a binary tree data structure that provides a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive mesh refinement. The Euler and Navier-Stokes equations are solved on the resulting grids using a finite volume formulation. The convective terms are upwinded: A linear reconstruction of the primitive variables is performed, providing input states to an approximate Riemann solver for computing the fluxes between neighboring cells. The results of a study comparing the accuracy and positivity of two classes of cell-centered, viscous gradient reconstruction procedures is briefly summarized. Adaptively refined solutions of the Navier-Stokes equations are shown using the more robust of these gradient reconstruction procedures, where the results computed by the Cartesian approach are compared to theory, experiment, and other accepted computational results for a series of low and moderate Reynolds number flows.

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

  20. Adaptively Refined Euler and Navier-Stokes Solutions with a Cartesian-Cell Based Scheme

    NASA Technical Reports Server (NTRS)

    Coirier, William J.; Powell, Kenneth G.

    1995-01-01

    A Cartesian-cell based scheme with adaptive mesh refinement for solving the Euler and Navier-Stokes equations in two dimensions has been developed and tested. Grids about geometrically complicated bodies were generated automatically, by recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, N-sided 'cut' cells were created using polygon-clipping algorithms. The grid was stored in a binary-tree data structure which provided a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive mesh refinement. The Euler and Navier-Stokes equations were solved on the resulting grids using an upwind, finite-volume formulation. The inviscid fluxes were found in an upwinded manner using a linear reconstruction of the cell primitives, providing the input states to an approximate Riemann solver. The viscous fluxes were formed using a Green-Gauss type of reconstruction upon a co-volume surrounding the cell interface. Data at the vertices of this co-volume were found in a linearly K-exact manner, which ensured linear K-exactness of the gradients. Adaptively-refined solutions for the inviscid flow about a four-element airfoil (test case 3) were compared to theory. Laminar, adaptively-refined solutions were compared to accepted computational, experimental and theoretical results.

  1. Reconstruction based finger-knuckle-print verification with score level adaptive binary fusion.

    PubMed

    Gao, Guangwei; Zhang, Lei; Yang, Jian; Zhang, Lin; Zhang, David

    2013-12-01

    Recently, a new biometrics identifier, namely finger knuckle print (FKP), has been proposed for personal authentication with very interesting results. One of the advantages of FKP verification lies in its user friendliness in data collection. However, the user flexibility in positioning fingers also leads to a certain degree of pose variations in the collected query FKP images. The widely used Gabor filtering based competitive coding scheme is sensitive to such variations, resulting in many false rejections. We propose to alleviate this problem by reconstructing the query sample with a dictionary learned from the template samples in the gallery set. The reconstructed FKP image can reduce much the enlarged matching distance caused by finger pose variations; however, both the intra-class and inter-class distances will be reduced. We then propose a score level adaptive binary fusion rule to adaptively fuse the matching distances before and after reconstruction, aiming to reduce the false rejections without increasing much the false acceptances. Experimental results on the benchmark PolyU FKP database show that the proposed method significantly improves the FKP verification accuracy.

  2. Polarization-multiplexed rate-adaptive non-binary-quasi-cyclic-LDPC-coded multilevel modulation with coherent detection for optical transport networks.

    PubMed

    Arabaci, Murat; Djordjevic, Ivan B; Saunders, Ross; Marcoccia, Roberto M

    2010-02-01

    In order to achieve high-speed transmission over optical transport networks (OTNs) and maximize its throughput, we propose using a rate-adaptive polarization-multiplexed coded multilevel modulation with coherent detection based on component non-binary quasi-cyclic (QC) LDPC codes. Compared to prior-art bit-interleaved LDPC-coded modulation (BI-LDPC-CM) scheme, the proposed non-binary LDPC-coded modulation (NB-LDPC-CM) scheme not only reduces latency due to symbol- instead of bit-level processing but also provides either impressive reduction in computational complexity or striking improvements in coding gain depending on the constellation size. As the paper presents, compared to its prior-art binary counterpart, the proposed NB-LDPC-CM scheme addresses the needs of future OTNs, which are achieving the target BER performance and providing maximum possible throughput both over the entire lifetime of the OTN, better.

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

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

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

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

  7. Recursive least-squares learning algorithms for neural networks

    NASA Astrophysics Data System (ADS)

    Lewis, Paul S.; Hwang, Jenq N.

    1990-11-01

    This paper presents the development of a pair of recursive least squares (ItLS) algorithms for online training of multilayer perceptrons which are a class of feedforward artificial neural networks. These algorithms incorporate second order information about the training error surface in order to achieve faster learning rates than are possible using first order gradient descent algorithms such as the generalized delta rule. A least squares formulation is derived from a linearization of the training error function. Individual training pattern errors are linearized about the network parameters that were in effect when the pattern was presented. This permits the recursive solution of the least squares approximation either via conventional RLS recursions or by recursive QR decomposition-based techniques. The computational complexity of the update is 0(N2) where N is the number of network parameters. This is due to the estimation of the N x N inverse Hessian matrix. Less computationally intensive approximations of the ilLS algorithms can be easily derived by using only block diagonal elements of this matrix thereby partitioning the learning into independent sets. A simulation example is presented in which a neural network is trained to approximate a two dimensional Gaussian bump. In this example RLS training required an order of magnitude fewer iterations on average (527) than did training with the generalized delta rule (6 1 BACKGROUND Artificial neural networks (ANNs) offer an interesting and potentially useful paradigm for signal processing and pattern recognition. The majority of ANN applications employ the feed-forward multilayer perceptron (MLP) network architecture in which network parameters are " trained" by a supervised learning algorithm employing the generalized delta rule (GDIt) [1 2]. The GDR algorithm approximates a fixed step steepest descent algorithm using derivatives computed by error backpropagatiori. The GDII algorithm is sometimes referred to as the

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

  9. A comparison of adaptive sampling designs and binary spatial models: A simulation study using a census of Bromus inermis

    USGS Publications Warehouse

    Irvine, Kathryn M.; Thornton, Jamie; Backus, Vickie M.; Hohmann, Matthew G.; Lehnhoff, Erik A.; Maxwell, Bruce D.; Michels, Kurt; Rew, Lisa

    2013-01-01

    Commonly in environmental and ecological studies, species distribution data are recorded as presence or absence throughout a spatial domain of interest. Field based studies typically collect observations by sampling a subset of the spatial domain. We consider the effects of six different adaptive and two non-adaptive sampling designs and choice of three binary models on both predictions to unsampled locations and parameter estimation of the regression coefficients (species–environment relationships). Our simulation study is unique compared to others to date in that we virtually sample a true known spatial distribution of a nonindigenous plant species, Bromus inermis. The census of B. inermis provides a good example of a species distribution that is both sparsely (1.9 % prevalence) and patchily distributed. We find that modeling the spatial correlation using a random effect with an intrinsic Gaussian conditionally autoregressive prior distribution was equivalent or superior to Bayesian autologistic regression in terms of predicting to un-sampled areas when strip adaptive cluster sampling was used to survey B. inermis. However, inferences about the relationships between B. inermis presence and environmental predictors differed between the two spatial binary models. The strip adaptive cluster designs we investigate provided a significant advantage in terms of Markov chain Monte Carlo chain convergence when trying to model a sparsely distributed species across a large area. In general, there was little difference in the choice of neighborhood, although the adaptive king was preferred when transects were randomly placed throughout the spatial domain.

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

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

  12. Adaptive Identification and Control of Flow-Induced Cavity Oscillations

    NASA Technical Reports Server (NTRS)

    Kegerise, M. A.; Cattafesta, L. N.; Ha, C.

    2002-01-01

    Progress towards an adaptive self-tuning regulator (STR) for the cavity tone problem is discussed in this paper. Adaptive system identification algorithms were applied to an experimental cavity-flow tested as a prerequisite to control. In addition, a simple digital controller and a piezoelectric bimorph actuator were used to demonstrate multiple tone suppression. The control tests at Mach numbers of 0.275, 0.40, and 0.60 indicated approx. = 7dB tone reductions at multiple frequencies. Several different adaptive system identification algorithms were applied at a single freestream Mach number of 0.275. Adaptive finite-impulse response (FIR) filters of orders up to N = 100 were found to be unsuitable for modeling the cavity flow dynamics. Adaptive infinite-impulse response (IIR) filters of comparable order better captured the system dynamics. Two recursive algorithms, the least-mean square (LMS) and the recursive-least square (RLS), were utilized to update the adaptive filter coefficients. Given the sample-time requirements imposed by the cavity flow dynamics, the computational simplicity of the least mean squares (LMS) algorithm is advantageous for real-time control.

  13. A Cartesian, cell-based approach for adaptively-refined solutions of the Euler and Navier-Stokes equations

    NASA Technical Reports Server (NTRS)

    Coirier, William J.; Powell, Kenneth G.

    1994-01-01

    A Cartesian, cell-based approach for adaptively-refined solutions of the Euler and Navier-Stokes equations in two dimensions is developed and tested. Grids about geometrically complicated bodies are generated automatically, by recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, N-sided 'cut' cells are created using polygon-clipping algorithms. The grid is stored in a binary-tree structure which provides a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive mesh refinement. The Euler and Navier-Stokes equations are solved on the resulting grids using a finite-volume formulation. The convective terms are upwinded: a gradient-limited, linear reconstruction of the primitive variables is performed, providing input states to an approximate Riemann solver for computing the fluxes between neighboring cells. The more robust of a series of viscous flux functions is used to provide the viscous fluxes at the cell interfaces. Adaptively-refined solutions of the Navier-Stokes equations using the Cartesian, cell-based approach are obtained and compared to theory, experiment, and other accepted computational results for a series of low and moderate Reynolds number flows.

  14. A Cartesian, cell-based approach for adaptively-refined solutions of the Euler and Navier-Stokes equations

    NASA Technical Reports Server (NTRS)

    Coirier, William J.; Powell, Kenneth G.

    1995-01-01

    A Cartesian, cell-based approach for adaptively-refined solutions of the Euler and Navier-Stokes equations in two dimensions is developed and tested. Grids about geometrically complicated bodies are generated automatically, by recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, N-sided 'cut' cells are created using polygon-clipping algorithms. The grid is stored in a binary-tree data structure which provides a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive mesh refinement. The Euler and Navier-Stokes equations are solved on the resulting grids using a finite-volume formulation. The convective terms are upwinded: A gradient-limited, linear reconstruction of the primitive variables is performed, providing input states to an approximate Riemann solver for computing the fluxes between neighboring cells. The more robust of a series of viscous flux functions is used to provide the viscous fluxes at the cell interfaces. Adaptively-refined solutions of the Navier-Stokes equations using the Cartesian, cell-based approach are obtained and compared to theory, experiment and other accepted computational results for a series of low and moderate Reynolds number flows.

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

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

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

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

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

  20. Gene selection using hybrid binary black hole algorithm and modified binary particle swarm optimization.

    PubMed

    Pashaei, Elnaz; Pashaei, Elham; Aydin, Nizamettin

    2018-04-14

    In cancer classification, gene selection is an important data preprocessing technique, but it is a difficult task due to the large search space. Accordingly, the objective of this study is to develop a hybrid meta-heuristic Binary Black Hole Algorithm (BBHA) and Binary Particle Swarm Optimization (BPSO) (4-2) model that emphasizes gene selection. In this model, the BBHA is embedded in the BPSO (4-2) algorithm to make the BPSO (4-2) more effective and to facilitate the exploration and exploitation of the BPSO (4-2) algorithm to further improve the performance. This model has been associated with Random Forest Recursive Feature Elimination (RF-RFE) pre-filtering technique. The classifiers which are evaluated in the proposed framework are Sparse Partial Least Squares Discriminant Analysis (SPLSDA); k-nearest neighbor and Naive Bayes. The performance of the proposed method was evaluated on two benchmark and three clinical microarrays. The experimental results and statistical analysis confirm the better performance of the BPSO (4-2)-BBHA compared with the BBHA, the BPSO (4-2) and several state-of-the-art methods in terms of avoiding local minima, convergence rate, accuracy and number of selected genes. The results also show that the BPSO (4-2)-BBHA model can successfully identify known biologically and statistically significant genes from the clinical datasets. Copyright © 2018 Elsevier Inc. All rights reserved.

  1. Recursion equations in predicting band width under gradient elution.

    PubMed

    Liang, Heng; Liu, Ying

    2004-06-18

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

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

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

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

  5. Local binary pattern variants-based adaptive texture features analysis for posed and nonposed facial expression recognition

    NASA Astrophysics Data System (ADS)

    Sultana, Maryam; Bhatti, Naeem; Javed, Sajid; Jung, Soon Ki

    2017-09-01

    Facial expression recognition (FER) is an important task for various computer vision applications. The task becomes challenging when it requires the detection and encoding of macro- and micropatterns of facial expressions. We present a two-stage texture feature extraction framework based on the local binary pattern (LBP) variants and evaluate its significance in recognizing posed and nonposed facial expressions. We focus on the parametric limitations of the LBP variants and investigate their effects for optimal FER. The size of the local neighborhood is an important parameter of the LBP technique for its extraction in images. To make the LBP adaptive, we exploit the granulometric information of the facial images to find the local neighborhood size for the extraction of center-symmetric LBP (CS-LBP) features. Our two-stage texture representations consist of an LBP variant and the adaptive CS-LBP features. Among the presented two-stage texture feature extractions, the binarized statistical image features and adaptive CS-LBP features were found showing high FER rates. Evaluation of the adaptive texture features shows competitive and higher performance than the nonadaptive features and other state-of-the-art approaches, respectively.

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

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

  8. Adaptive Identification by Systolic Arrays.

    DTIC Science & Technology

    1987-12-01

    BIBLIOGRIAPHY Anton , Howard, Elementary Linear Algebra , John Wiley & Sons, 19S4. Cristi, Roberto, A Parallel Structure Jor Adaptive Pole Placement...10 11. SYSTEM IDENTIFICATION M*YETHODS ....................... 12 A. LINEAR SYSTEM MODELING ......................... 12 B. SOLUTION OF SYSTEMS OF... LINEAR EQUATIONS ......... 13 C. QR DECOMPOSITION ................................ 14 D. RECURSIVE LEAST SQUARES ......................... 16 E. BLOCK

  9. Learning Rotation-Invariant Local Binary Descriptor.

    PubMed

    Duan, Yueqi; Lu, Jiwen; Feng, Jianjiang; Zhou, Jie

    2017-08-01

    In this paper, we propose a rotation-invariant local binary descriptor (RI-LBD) learning method for visual recognition. Compared with hand-crafted local binary descriptors, such as local binary pattern and its variants, which require strong prior knowledge, local binary feature learning methods are more efficient and data-adaptive. Unlike existing learning-based local binary descriptors, such as compact binary face descriptor and simultaneous local binary feature learning and encoding, which are susceptible to rotations, our RI-LBD first categorizes each local patch into a rotational binary pattern (RBP), and then jointly learns the orientation for each pattern and the projection matrix to obtain RI-LBDs. As all the rotation variants of a patch belong to the same RBP, they are rotated into the same orientation and projected into the same binary descriptor. Then, we construct a codebook by a clustering method on the learned binary codes, and obtain a histogram feature for each image as the final representation. In order to exploit higher order statistical information, we extend our RI-LBD to the triple rotation-invariant co-occurrence local binary descriptor (TRICo-LBD) learning method, which learns a triple co-occurrence binary code for each local patch. Extensive experimental results on four different visual recognition tasks, including image patch matching, texture classification, face recognition, and scene classification, show that our RI-LBD and TRICo-LBD outperform most existing local descriptors.

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

  11. Adaptive semi-supervised recursive tree partitioning: The ART towards large scale patient indexing in personalized healthcare.

    PubMed

    Wang, Fei

    2015-06-01

    With the rapid development of information technologies, tremendous amount of data became readily available in various application domains. This big data era presents challenges to many conventional data analytics research directions including data capture, storage, search, sharing, analysis, and visualization. It is no surprise to see that the success of next-generation healthcare systems heavily relies on the effective utilization of gigantic amounts of medical data. The ability of analyzing big data in modern healthcare systems plays a vital role in the improvement of the quality of care delivery. Specifically, patient similarity evaluation aims at estimating the clinical affinity and diagnostic proximity of patients. As one of the successful data driven techniques adopted in healthcare systems, patient similarity evaluation plays a fundamental role in many healthcare research areas such as prognosis, risk assessment, and comparative effectiveness analysis. However, existing algorithms for patient similarity evaluation are inefficient in handling massive patient data. In this paper, we propose an Adaptive Semi-Supervised Recursive Tree Partitioning (ART) framework for large scale patient indexing such that the patients with similar clinical or diagnostic patterns can be correctly and efficiently retrieved. The framework is designed for semi-supervised settings since it is crucial to leverage experts' supervision knowledge in medical scenario, which are fairly limited compared to the available data. Starting from the proposed ART framework, we will discuss several specific instantiations and validate them on both benchmark and real world healthcare data. Our results show that with the ART framework, the patients can be efficiently and effectively indexed in the sense that (1) similarity patients can be retrieved in a very short time; (2) the retrieval performance can beat the state-of-the art indexing methods. Copyright © 2015. Published by Elsevier Inc.

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

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

  14. Hierarchical colorant-based direct binary search halftoning.

    PubMed

    He, Zhen

    2010-07-01

    Colorant-based direct binary search (CB-DBS) halftoning proposed in provides an image quality benchmark for dispersed-dot halftoning algorithms. The objective of this paper is to further push the image quality limit. An algorithm called hierarchical colorant-based direct binary search (HCB-DBS) is developed in this paper. By appropriately integrating yellow colorant into dot-overlapping and dot-positioning controls, it is demonstrated that HCB-DBS can achieve better halftone texture of both individual and joint dot-color planes, without compromising the dot distribution of more visible halftone of cyan and magenta colorants. The input color specification is first converted from colorant space to dot-color space with minimum brightness variation principle for full dot-overlapping control. The dot-colors are then split into groups based upon dot visibility. Hierarchical monochrome DBS halftoning is applied to make dot-positioning decision for each group, constrained on the already generated halftone of the groups with higher priority. And dot-coloring is decided recursively with joint monochrome DBS halftoning constrained on the related total dot distribution. Experiments show HCB-DBS improves halftone texture for both individual and joint dot-color planes. And it reduces the halftone graininess and free of color mottle artifacts, comparing to CB-DBS.

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

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

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

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

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

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

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

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

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

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

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

  6. Recursive least squares background prediction of univariate syndromic surveillance data

    PubMed Central

    2009-01-01

    Background Surveillance of univariate syndromic data as a means of potential indicator of developing public health conditions has been used extensively. This paper aims to improve the performance of detecting outbreaks by using a background forecasting algorithm based on the adaptive recursive least squares method combined with a novel treatment of the Day of the Week effect. Methods Previous work by the first author has suggested that univariate recursive least squares analysis of syndromic data can be used to characterize the background upon which a prediction and detection component of a biosurvellance system may be built. An adaptive implementation is used to deal with data non-stationarity. In this paper we develop and implement the RLS method for background estimation of univariate data. The distinctly dissimilar distribution of data for different days of the week, however, can affect filter implementations adversely, and so a novel procedure based on linear transformations of the sorted values of the daily counts is introduced. Seven-days ahead daily predicted counts are used as background estimates. A signal injection procedure is used to examine the integrated algorithm's ability to detect synthetic anomalies in real syndromic time series. We compare the method to a baseline CDC forecasting algorithm known as the W2 method. Results We present detection results in the form of Receiver Operating Characteristic curve values for four different injected signal to noise ratios using 16 sets of syndromic data. We find improvements in the false alarm probabilities when compared to the baseline W2 background forecasts. Conclusion The current paper introduces a prediction approach for city-level biosurveillance data streams such as time series of outpatient clinic visits and sales of over-the-counter remedies. This approach uses RLS filters modified by a correction for the weekly patterns often seen in these data series, and a threshold detection algorithm from the

  7. Recursive least squares background prediction of univariate syndromic surveillance data.

    PubMed

    Najmi, Amir-Homayoon; Burkom, Howard

    2009-01-16

    Surveillance of univariate syndromic data as a means of potential indicator of developing public health conditions has been used extensively. This paper aims to improve the performance of detecting outbreaks by using a background forecasting algorithm based on the adaptive recursive least squares method combined with a novel treatment of the Day of the Week effect. Previous work by the first author has suggested that univariate recursive least squares analysis of syndromic data can be used to characterize the background upon which a prediction and detection component of a biosurvellance system may be built. An adaptive implementation is used to deal with data non-stationarity. In this paper we develop and implement the RLS method for background estimation of univariate data. The distinctly dissimilar distribution of data for different days of the week, however, can affect filter implementations adversely, and so a novel procedure based on linear transformations of the sorted values of the daily counts is introduced. Seven-days ahead daily predicted counts are used as background estimates. A signal injection procedure is used to examine the integrated algorithm's ability to detect synthetic anomalies in real syndromic time series. We compare the method to a baseline CDC forecasting algorithm known as the W2 method. We present detection results in the form of Receiver Operating Characteristic curve values for four different injected signal to noise ratios using 16 sets of syndromic data. We find improvements in the false alarm probabilities when compared to the baseline W2 background forecasts. The current paper introduces a prediction approach for city-level biosurveillance data streams such as time series of outpatient clinic visits and sales of over-the-counter remedies. This approach uses RLS filters modified by a correction for the weekly patterns often seen in these data series, and a threshold detection algorithm from the residuals of the RLS forecasts. We

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

  9. Context adaptive binary arithmetic coding-based data hiding in partially encrypted H.264/AVC videos

    NASA Astrophysics Data System (ADS)

    Xu, Dawen; Wang, Rangding

    2015-05-01

    A scheme of data hiding directly in a partially encrypted version of H.264/AVC videos is proposed which includes three parts, i.e., selective encryption, data embedding and data extraction. Selective encryption is performed on context adaptive binary arithmetic coding (CABAC) bin-strings via stream ciphers. By careful selection of CABAC entropy coder syntax elements for selective encryption, the encrypted bitstream is format-compliant and has exactly the same bit rate. Then a data-hider embeds the additional data into partially encrypted H.264/AVC videos using a CABAC bin-string substitution technique without accessing the plaintext of the video content. Since bin-string substitution is carried out on those residual coefficients with approximately the same magnitude, the quality of the decrypted video is satisfactory. Video file size is strictly preserved even after data embedding. In order to adapt to different application scenarios, data extraction can be done either in the encrypted domain or in the decrypted domain. Experimental results have demonstrated the feasibility and efficiency of the proposed scheme.

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

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

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

  13. Orbital motion in pre-main sequence binaries

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

    Schaefer, G. H.; Prato, L.; Simon, M.

    2014-06-01

    We present results from our ongoing program to map the visual orbits of pre-main sequence (PMS) binaries in the Taurus star forming region using adaptive optics imaging at the Keck Observatory. We combine our results with measurements reported in the literature to analyze the orbital motion for each binary. We present preliminary orbits for DF Tau, T Tau S, ZZ Tau, and the Pleiades binary HBC 351. Seven additional binaries show curvature in their relative motion. Currently, we can place lower limits on the orbital periods for these systems; full solutions will be possible with more orbital coverage. Five othermore » binaries show motion that is indistinguishable from linear motion. We suspect that these systems are bound and might show curvature with additional measurements in the future. The observations reported herein lay critical groundwork toward the goal of measuring precise masses for low-mass PMS stars.« less

  14. Bondi-Hoyle-Lyttleton Accretion onto Binaries

    NASA Astrophysics Data System (ADS)

    Antoni, Andrea; MacLeod, Morgan; Ramírez-Ruiz, Enrico

    2018-01-01

    Binary stars are not rare. While only close binary stars will eventually interact with one another, even the widest binary systems interact with their gaseous surroundings. The rates of accretion and the gaseous drag forces arising in these interactions are the key to understanding how these systems evolve. This poster examines accretion flows around a binary system moving supersonically through a background gas. We perform three-dimensional hydrodynamic simulations of Bondi-Hoyle-Lyttleton accretion using the adaptive mesh refinement code FLASH. We simulate a range of values of semi-major axis of the orbit relative to the gravitational focusing impact parameter of the pair. On large scales, gas is gravitationally focused by the center-of-mass of the binary, leading to dynamical friction drag and to the accretion of mass and momentum. On smaller scales, the orbital motion imprints itself on the gas. Notably, the magnitude and direction of the forces acting on the binary inherit this orbital dependence. The long-term evolution of the binary is determined by the timescales for accretion, slow down of the center-of-mass, and decay of the orbit. We use our simulations to measure these timescales and to establish a hierarchy between them. In general, our simulations indicate that binaries moving through gaseous media will slow down before the orbit decays.

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

  16. Measuring Close Binary Stars with Speckle Interferometry

    DTIC Science & Technology

    2014-09-01

    extra effort to be measured. One method of observing such binary star systems is to use adaptive optics to correct the atmospheric blur in real-time...simplicity, and with no loss in generalization, this analysis will be reduced to one dimension . From equation (4), it can be seen that the frequency (u...the binary pair are systematically too large , due to the displacement of the minima of the fringes by the atmospheric OTF, when left uncorrected

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

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

  19. Binary statistics among population II stars

    NASA Astrophysics Data System (ADS)

    Zinnecker, H.; Köhler, R.; Jahreiß, H.

    2004-08-01

    Population II stars are old, metal-poor, Galactic halo stars with high proper motion. We have carried out a visual binary survey of 164 halo stars in the solar neighborhood (median distance 100 pc), using infrared speckle interferometry, adaptive optics, and wide field direct imaging. The sample is based on the lists of Population II stars of Carney et al. (1994) and Norris (1986), with reliable distances from HIPPARCOS measurements. At face value, we found 33 binaries, 6 triples, and 1 quadruple system. When we limit ourselves to K-band flux ratios larger than 0.1 (to avoid background contamination), the numbers drop to 9 binaries and 1 triple, corresponding to a binary frequency of 6 - 7 % above our angular resolution limit of about 0.1 arcsec. If we count all systems with K-band flux ratios greater than 0.01, we obtain 15 more binaries and 3 more triples, corresponding to a binary frequency for projected separations in excess of 10 AU of around 20 %. This is to be compared with the frequency of spectroscopic binaries (up to a period of 3000 days) of Population II stars of about 15 % (Latham et al. 2002). We also determined a semi-major axis distribution for our visual Population II binary and triple systems, which appears to be remarkably different from that of Population I stars. Second epoch-observations must help confirm the reality of our results.

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

  1. Adaptive optics imaging of the MBM 12 association. Seven binaries and an edge-on disk in a quadruple system

    NASA Astrophysics Data System (ADS)

    Chauvin, G.; Ménard, F.; Fusco, T.; Lagrange, A.-M.; Beuzit, J.-L.; Mouillet, D.; Augereau, J.-C.

    2002-11-01

    We report adaptive optics (AO) observations of the young and nearby association MBM 12 obtained with the Canada-France-Hawaii Telescope. Our main observational result is the discovery of six new binary systems, LkHα 264, E 0255+2018, RX J0255.4+2005, S18, MBM 12-10, RX J0255.3+1915, and the confirmation of HD 17332, already known as a binary. We also detected a possible quadruple system. It is composed of the close binary LkHα 263 AB (separation of ~ 0.41''), of LkHα 262 located ~ 15.25'' from LkHα 263 A, and of LkHα 263 C, located ~ 4.1'' from LkHα 263 A. A preliminary study of the binary fraction suggests a binary excess in the MBM 12 association as compared to the field and IC 348. Because of the high binarity rate, previous estimations of spectral types and measurements of IR excesses for several candidate members of MBM 12 have to be revised. LkHα 263 C is a nebulous object that we interpret as a disk oriented almost perfectly edge-on and seen in scattered light. This object has already been reported by Jayawardhana et al. (\\cite{Jayawardhana2002}). Scattered light models allow us to estimate some of the structural parameters (i.e. inclination, diameter and to a lesser extent dust mass) of the circumstellar disk. We find an inclination of 89o and a outer radius for the disk, ~ 165 AU if the distance to MBM 12 is 275 pc. With the present data set, we do not attempt to re-assess the distance to MBM 12. We estimate however that the distance to the candidate member RX J0255.3+1915 is d > 175 pc. Based on data collected at the Canada-France-Hawaii Telescope. The CFHT corporation is funded by the Governments of Canada and France, and by the University of Hawaii.

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

  3. Hidden Markov model tracking of continuous gravitational waves from a binary neutron star with wandering spin. II. Binary orbital phase tracking

    NASA Astrophysics Data System (ADS)

    Suvorova, S.; Clearwater, P.; Melatos, A.; Sun, L.; Moran, W.; Evans, R. J.

    2017-11-01

    A hidden Markov model (HMM) scheme for tracking continuous-wave gravitational radiation from neutron stars in low-mass x-ray binaries (LMXBs) with wandering spin is extended by introducing a frequency-domain matched filter, called the J -statistic, which sums the signal power in orbital sidebands coherently. The J -statistic is similar but not identical to the binary-modulated F -statistic computed by demodulation or resampling. By injecting synthetic LMXB signals into Gaussian noise characteristic of the Advanced Laser Interferometer Gravitational-wave Observatory (Advanced LIGO), it is shown that the J -statistic HMM tracker detects signals with characteristic wave strain h0≥2 ×10-26 in 370 d of data from two interferometers, divided into 37 coherent blocks of equal length. When applied to data from Stage I of the Scorpius X-1 Mock Data Challenge organized by the LIGO Scientific Collaboration, the tracker detects all 50 closed injections (h0≥6.84 ×10-26), recovering the frequency with a root-mean-square accuracy of ≤1.95 ×10-5 Hz . Of the 50 injections, 43 (with h0≥1.09 ×10-25) are detected in a single, coherent 10 d block of data. The tracker employs an efficient, recursive HMM solver based on the Viterbi algorithm, which requires ˜105 CPU-hours for a typical broadband (0.5 kHz) LMXB search.

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

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

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

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

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

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

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

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

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

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

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

  15. Cross-validation and Peeling Strategies for Survival Bump Hunting using Recursive Peeling Methods

    PubMed Central

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

    2015-01-01

    We introduce a framework to build a survival/risk bump hunting model with a censored time-to-event response. Our Survival Bump Hunting (SBH) method is based on a recursive peeling procedure that uses a specific survival peeling criterion derived from non/semi-parametric statistics such as the hazards-ratio, the log-rank test or the Nelson--Aalen estimator. To optimize the tuning parameter of the model and validate it, we introduce an objective function based on survival or prediction-error statistics, such as the log-rank test and the concordance error rate. We also describe two alternative cross-validation techniques adapted to the joint task of decision-rule making by recursive peeling and survival estimation. Numerical analyses show the importance of replicated cross-validation and the differences between criteria and techniques in both low and high-dimensional settings. Although several non-parametric survival models exist, none addresses the problem of directly identifying local extrema. We show how SBH efficiently estimates extreme survival/risk subgroups unlike other models. This provides an insight into the behavior of commonly used models and suggests alternatives to be adopted in practice. Finally, our SBH framework was applied to a clinical dataset. In it, we identified subsets of patients characterized by clinical and demographic covariates with a distinct extreme survival outcome, for which tailored medical interventions could be made. An R package PRIMsrc (Patient Rule Induction Method in Survival, Regression and Classification settings) is available on CRAN (Comprehensive R Archive Network) and GitHub. PMID:27034730

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

  17. Hybrid Black-Hole Binary Initial Data

    NASA Technical Reports Server (NTRS)

    Mundim, Bruno C.; Kelly, Bernard J.; Nakano, Hiroyuki; Zlochower, Yosef; Campanelli, Manuela

    2010-01-01

    "Traditional black-hole binary puncture initial data is conformally flat. This unphysical assumption is coupled with a lack of radiation signature from the binary's past life. As a result, waveforms extracted from evolutions of this data display an abrupt jump. In Kelly et al. [Class. Quantum Grav. 27:114005 (2010)], a new binary black-hole initial data with radiation contents derived in the post-Newtonian (PN) calculations was adapted to puncture evolutions in numerical relativity. This data satisfies the constraint equations to the 2.5PN order, and contains a transverse-traceless "wavy" metric contribution, violating the standard assumption of conformal flatness. Although the evolution contained less spurious radiation, there were undesired features; the unphysical horizon mass loss and the large initial orbital eccentricity. Introducing a hybrid approach to the initial data evaluation, we significantly reduce these undesired features."

  18. Motion adaptive Kalman filter for super-resolution

    NASA Astrophysics Data System (ADS)

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

    2011-01-01

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

  19. Arbitrary-level hanging nodes for adaptive hphp-FEM approximations in 3D

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

    Pavel Kus; Pavel Solin; David Andrs

    2014-11-01

    In this paper we discuss constrained approximation with arbitrary-level hanging nodes in adaptive higher-order finite element methods (hphp-FEM) for three-dimensional problems. This technique enables using highly irregular meshes, and it greatly simplifies the design of adaptive algorithms as it prevents refinements from propagating recursively through the finite element mesh. The technique makes it possible to design efficient adaptive algorithms for purely hexahedral meshes. We present a detailed mathematical description of the method and illustrate it with numerical examples.

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

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

    NASA Astrophysics Data System (ADS)

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

    2018-01-01

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

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

  3. Generalized recursive solutions to Ornstein-Zernike integral equations

    NASA Astrophysics Data System (ADS)

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

    1980-09-01

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

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

  5. The Impact of Binary Companions on Planetary Systems

    NASA Astrophysics Data System (ADS)

    Kraus, Adam L.; Ireland, Michael; Dupuy, Trent; Mann, Andrew; Huber, Daniel

    2018-01-01

    The majority of solar-type stars are found in binary systems, and the dynamical influence of binary companions is expected to profoundly influence planetary systems. However, the difficulty of identifying planets in binary systems has left the magnitude of this effect uncertain; despite numerous theoretical hurdles to their formation and survival, at least some binary systems clearly host planets. We present high-resolution imaging of nearly 500 Kepler Objects of Interest (KOIs) obtained using adaptive-optics imaging and nonredundant aperture-mask interferometry on the Keck II telescope. We super-resolve some binary systems to projected separations of under 5 AU, showing that planets might form in these dynamically active environments. However, the full distribution of projected separations for our planet-host sample more broadly reveals a deep paucity of binary companions at solar-system scales. Our results demonstrate that a fifth of all solar-type stars in the Milky Way are disallowed from hosting planetary systems due to the influence of a binary companion. We now update these results with multi-epoch imaging to reject non-comoving background stars and securely identify even the least massive stellar companions, as well as tracing out the orbital motion of stellar companions. These results are beginning to reveal not just the fraction of binaries that do not host planets, but also potential explanations for planet survival even in some very close, dynamically active binary systems.

  6. Black hole binaries dynamically formed in globular clusters

    NASA Astrophysics Data System (ADS)

    Park, Dawoo; Kim, Chunglee; Lee, Hyung Mok; Bae, Yeong-Bok; Belczynski, Krzysztof

    2017-08-01

    We investigate properties of black hole (BH) binaries formed in globular clusters via dynamical processes, using directN-body simulations. We pay attention to effects of BH mass function on the total mass and mass ratio distributions of BH binaries ejected from clusters. First, we consider BH populations with two different masses in order to learn basic differences from models with single-mass BHs only. Secondly, we consider continuous BH mass functions adapted from recent studies on massive star evolution in a low metallicity environment, where globular clusters are formed. In this work, we consider only binaries that are formed by three-body processes and ignore stellar evolution and primordial binaries for simplicity. Our results imply that most BH binary mergers take place after they get ejected from the cluster. Also, mass ratios of dynamically formed binaries should be close to 1 or likely to be less than 2:1. Since the binary formation efficiency is larger for higher-mass BHs, it is likely that a BH mass function sampled by gravitational-wave observations would be weighed towards higher masses than the mass function of single BHs for a dynamically formed population. Applying conservative assumptions regarding globular cluster populations such as small BH mass fraction and no primordial binaries, the merger rate of BH binaries originated from globular clusters is estimated to be at least 6.5 yr-1 Gpc-3. Actual rate can be up to more than several times of our conservative estimate.

  7. A simple transferable adaptive potential to study phase separation in large-scale xMgO-(1-x)SiO2 binary glasses.

    PubMed

    Bidault, Xavier; Chaussedent, Stéphane; Blanc, Wilfried

    2015-10-21

    A simple transferable adaptive model is developed and it allows for the first time to simulate by molecular dynamics the separation of large phases in the MgO-SiO2 binary system, as experimentally observed and as predicted by the phase diagram, meaning that separated phases have various compositions. This is a real improvement over fixed-charge models, which are often limited to an interpretation involving the formation of pure clusters, or involving the modified random network model. Our adaptive model, efficient to reproduce known crystalline and glassy structures, allows us to track the formation of large amorphous Mg-rich Si-poor nanoparticles in an Mg-poor Si-rich matrix from a 0.1MgO-0.9SiO2 melt.

  8. A Telescopic Binary Learning Machine for Training Neural Networks.

    PubMed

    Brunato, Mauro; Battiti, Roberto

    2017-03-01

    This paper proposes a new algorithm based on multiscale stochastic local search with binary representation for training neural networks [binary learning machine (BLM)]. We study the effects of neighborhood evaluation strategies, the effect of the number of bits per weight and that of the maximum weight range used for mapping binary strings to real values. Following this preliminary investigation, we propose a telescopic multiscale version of local search, where the number of bits is increased in an adaptive manner, leading to a faster search and to local minima of better quality. An analysis related to adapting the number of bits in a dynamic way is presented. The control on the number of bits, which happens in a natural manner in the proposed method, is effective to increase the generalization performance. The learning dynamics are discussed and validated on a highly nonlinear artificial problem and on real-world tasks in many application domains; BLM is finally applied to a problem requiring either feedforward or recurrent architectures for feedback control.

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

  10. Parameter Estimation for a Hybrid Adaptive Flight Controller

    NASA Technical Reports Server (NTRS)

    Campbell, Stefan F.; Nguyen, Nhan T.; Kaneshige, John; Krishnakumar, Kalmanje

    2009-01-01

    This paper expands on the hybrid control architecture developed at the NASA Ames Research Center by addressing issues related to indirect adaptation using the recursive least squares (RLS) algorithm. Specifically, the hybrid control architecture is an adaptive flight controller that features both direct and indirect adaptation techniques. This paper will focus almost exclusively on the modifications necessary to achieve quality indirect adaptive control. Additionally this paper will present results that, using a full non -linear aircraft model, demonstrate the effectiveness of the hybrid control architecture given drastic changes in an aircraft s dynamics. Throughout the development of this topic, a thorough discussion of the RLS algorithm as a system identification technique will be provided along with results from seven well-known modifications to the popular RLS algorithm.

  11. Processing Of Binary Images

    NASA Astrophysics Data System (ADS)

    Hou, H. S.

    1985-07-01

    An overview of the recent progress in the area of digital processing of binary images in the context of document processing is presented here. The topics covered include input scan, adaptive thresholding, halftoning, scaling and resolution conversion, data compression, character recognition, electronic mail, digital typography, and output scan. Emphasis has been placed on illustrating the basic principles rather than descriptions of a particular system. Recent technology advances and research in this field are also mentioned.

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

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

  14. Close Binaries in the η Chamaeleontis Cluster

    NASA Astrophysics Data System (ADS)

    Köhler, Rainer; Petr-Gotzens, Monika G.

    2002-11-01

    We have used speckle interferometry and adaptive optics observations to search for multiple systems among 13 stars in the η Chamaeleontis cluster. We discovered two previously unknown subarcsecond binaries. Placing the components in infrared color-magnitude diagrams shows that most members of η Cha are coeval. Repeated observations of the binary RECX 1 allow us to determine a preliminary orbit and derive a system mass of about 2 Msolar. Based on observations obtained at the European Southern Observatory, La Silla, proposals 56.E-0197, 62.I-0399, 65.I-0350, 65.I-0086, 67.C-0354, and 68.C-0539.

  15. The Young Visual Binary Database

    NASA Astrophysics Data System (ADS)

    Prato, Lisa A.; Avilez, Ian; Allen, Thomas; Zoonematkermani, Saeid; Biddle, Lauren; Muzzio, Ryan; Wittal, Matthew; Schaefer, Gail; Simon, Michal

    2017-01-01

    We have obtained adaptive optics imaging and high-resolution H-band and in some cases K-band spectra of each component in close to 100 young multiple systems in the nearby star forming regions of Taurus, Ophiuchus, TW Hya, and Orion. The binary separations for the pairs in our sample range from 30 mas to 3 arcseconds. The imaging and most of our spectra were obtained with instruments behind adaptive optics systems in order to resolve even the closest companions. We are in the process of determining fundamental stellar and circumstellar properties, such as effective temperature, Vsin(i), veiling, and radial velocity, for each component in the entire sample. The beta version of our database includes systems in the Taurus region and provides plots, downloadable ascii spectra, and values of the stellar and circumstellar properties for both stars in each system. This resource is openly available to the community at http://jumar.lowell.edu/BinaryStars/. In this poster we describe initial results from our analysis of the survey data. Support for this research was provided in part by NSF award AST-1313399 and by NASA Keck KPDA funding.

  16. Likelihood Methods for Adaptive Filtering and Smoothing. Technical Report #455.

    ERIC Educational Resources Information Center

    Butler, Ronald W.

    The dynamic linear model or Kalman filtering model provides a useful methodology for predicting the past, present, and future states of a dynamic system, such as an object in motion or an economic or social indicator that is changing systematically with time. Recursive likelihood methods for adaptive Kalman filtering and smoothing are developed.…

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

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

  19. New Binaries in the ɛ Cha Association

    NASA Astrophysics Data System (ADS)

    Briceño, César; Tokovinin, Andrei

    2017-11-01

    We present Adaptive Optics-aided speckle observations of 47 young stars in the ɛ Cha association made at the 4 m Southern Astrophysical Research Telescope in the I-band. We resolved 10 new binary pairs, 5 previously known binaries, and 2 triple systems, also previously known. In the separation range between 4 and 300 au, the 30 association members of spectral types G0 and later host 6 binary companions, leading to the raw companion frequency of 0.010 ± 0.04 per decade of separation, comparable to the main sequence dwarfs in the field. On the other hand, all five massive association members of spectral types A and B have companions in this range. We discuss the newly resolved and known binaries in our sample. Observed motions in the triple system ɛ Cha, composed of three similar B9V stars, can be described by tentative orbits with periods 13 and ˜900 years and a large mutual inclination. Based on observations obtained at the Southern Astrophysical Research (SOAR) telescope.

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

  1. Young Binaries and Early Stellar Evolution

    NASA Astrophysics Data System (ADS)

    Brandner, Wolfgang

    1996-07-01

    Most main-sequence stars are members of binary or multiple systems. The same is true for pre-main-sequence (PMS) stars, as recent surveys have shown. Therefore studying star formation means to a large extent studying the formation of binary systems. Similarly, studying early stellar evolution primarily involves PMS binary systems. In this thesis I have studied the binary frequency among ROSAT selected T Tauri stars in the Chamaeleon T association and the Scorpius-Centaurus OB association, and the evolutionary status of Hα-selected PMS binaries in the T associations of Chamaeleon, Lupus, and ρ Ophiuchi. The direct imaging and spectroscopic observations in the optical have been carried out under subarcsec seeing conditions at the ESO New Technology Telescope (NTT) at La Silla. Furthermore, high-spatial resolution images of selected PMS stars in the near infrared were obtained with the ESO adaptive optics system COME-ON+/ADONIS. Among 195 T Tauri stars observed using direct imaging 31 binaries could be identified, 12 of them with subarcsec separation. Based on statistical arguments alone I conclude that almost all of them are indeed physical (i.e. gravitationally bound) binary or multiple systems. Using astrometric measurements of some binaries I showed that the components of these binaries are common proper motion pairs, very likely in a gravitationally bound orbit around each other. The overall binary frequency among T Tauri stars with a range of separations between 120 and 1800 AU is in agreement with the binary frequency observed among main-sequence stars in the solar neighbourhood. However, within individual regions the spatial distribution of binaries is non-uniform. In particular, in Upper Scorpius, weak-line T Tauri stars in the vicinity of early type stars seem to be almost devoid of multiple systems, whereas in another area in Upper Scorpius half of all weak-line T Tauri stars have a companion in a range of separation between 0.''7 and 3.''0. For a sample

  2. Improvement in Recursive Hierarchical Segmentation of Data

    NASA Technical Reports Server (NTRS)

    Tilton, James C.

    2006-01-01

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

  3. The Ruinous Influence of Close Binary Companions on Planetary Systems

    NASA Astrophysics Data System (ADS)

    Kraus, Adam L.; Ireland, Michael; Mann, Andrew; Huber, Daniel; Dupuy, Trent J.

    2017-01-01

    The majority of solar-type stars are found in binary systems, and the dynamical influence of binary companions is expected to profoundly influence planetary systems. However, the difficulty of identifying planets in binary systems has left the magnitude of this effect uncertain; despite numerous theoretical hurdles to their formation and survival, at least some binary systems clearly host planets. We present high-resolution imaging of nearly 500 Kepler Objects of Interest (KOIs) obtained using adaptive-optics imaging and nonredundant aperture-mask interferometry on the Keck II telescope. We super-resolve some binary systems to projected separations of under 5 AU, showing that planets might form in these dynamically active environments. However, the full distribution of projected separations for our planet-host sample more broadly reveals a deep paucity of binary companions at solar-system scales. When the binary population is parametrized with a semimajor axis cutoff a cut and a suppression factor inside that cutoff S bin, we find with correlated uncertainties that inside acut = 47 +59/-23 AU, the planet occurrence rate in binary systems is only Sbin = 0.34 +0.14/-0.15 times that of wider binaries or single stars. Our results demonstrate that a fifth of all solar-type stars in the Milky Way are disallowed from hosting planetary systems due to the influence of a binary companion.

  4. The Ruinous Influence of Close Binary Companions on Planetary Systems

    NASA Astrophysics Data System (ADS)

    Kraus, Adam L.; Ireland, Michael; Mann, Andrew; Huber, Daniel; Dupuy, Trent J.

    2017-06-01

    The majority of solar-type stars are found in binary systems, and the dynamical influence of binary companions is expected to profoundly influence planetary systems. However, the difficulty of identifying planets in binary systems has left the magnitude of this effect uncertain; despite numerous theoretical hurdles to their formation and survival, at least some binary systems clearly host planets. We present high-resolution imaging of nearly 500 Kepler Objects of Interest (KOIs) obtained using adaptive-optics imaging and nonredundant aperture-mask interferometry on the Keck II telescope. We super-resolve some binary systems to projected separations of under 5 AU, showing that planets might form in these dynamically active environments. However, the full distribution of projected separations for our planet-host sample more broadly reveals a deep paucity of binary companions at solar-system scales. When the binary population is parametrized with a semimajor axis cutoff a cut and a suppression factor inside that cutoff S bin, we find with correlated uncertainties that inside acut = 47 +59/-23 AU, the planet occurrence rate in binary systems is only Sbin = 0.34+0.14/-0.15 times that of wider binaries or single stars. Our results demonstrate that a fifth of all solar-type stars in the Milky Way are disallowed from hosting planetary systems due to the influence of a binary companion.

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

    NASA Technical Reports Server (NTRS)

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

    1985-01-01

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

  6. Improvements to the construction of binary black hole initial data

    NASA Astrophysics Data System (ADS)

    Ossokine, Serguei; Foucart, Francois; Pfeiffer, Harald P.; Boyle, Michael; Szilágyi, Béla

    2015-12-01

    Construction of binary black hole initial data is a prerequisite for numerical evolutions of binary black holes. This paper reports improvements to the binary black hole initial data solver in the spectral Einstein code, to allow robust construction of initial data for mass-ratio above 10:1, and for dimensionless black hole spins above 0.9, while improving efficiency for lower mass-ratios and spins. We implement a more flexible domain decomposition, adaptive mesh refinement and an updated method for choosing free parameters. We also introduce a new method to control and eliminate residual linear momentum in initial data for precessing systems, and demonstrate that it eliminates gravitational mode mixing during the evolution. Finally, the new code is applied to construct initial data for hyperbolic scattering and for binaries with very small separation.

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

  8. Flare Activity of Wide Binary Stars with Kepler

    NASA Astrophysics Data System (ADS)

    Clarke, Riley W.; Davenport, James R. A.; Covey, Kevin R.; Baranec, Christoph

    2018-01-01

    We present an analysis of flare activity in wide binary stars using a combination of value-added data sets from the NASA Kepler mission. The target list contains a set of previously discovered wide binary star systems identified by proper motions in the Kepler field. We cross-matched these systems with estimates of flare activity for ∼200,000 stars in the Kepler field, allowing us to compare relative flare luminosity between stars in coeval binaries. From a sample of 184 previously known wide binaries in the Kepler field, we find 58 with detectable flare activity in at least 1 component, 33 of which are similar in mass (q > 0.8). Of these 33 equal-mass binaries, the majority display similar (±1 dex) flare luminosity between both stars, as expected for stars of equal mass and age. However, we find two equal-mass pairs where the secondary (lower mass) star is more active than its counterpart, and two equal-mass pairs where the primary star is more active. The stellar rotation periods are also anomalously fast for stars with elevated flare activity. Pairs with discrepant rotation and activity qualitatively seem to have lower mass ratios. These outliers may be due to tidal spin-up, indicating these wide binaries could be hierarchical triple systems. We additionally present high-resolution adaptive optics images for two wide binary systems to test this hypothesis. The demographics of stellar rotation and magnetic activity between stars in wide binaries may be useful indicators for discerning the formation scenarios of these systems.

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

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

  11. Deficit of Wide Binaries in the η Chamaeleontis Young Cluster

    NASA Astrophysics Data System (ADS)

    Brandeker, Alexis; Jayawardhana, Ray; Khavari, Parandis; Haisch, Karl E., Jr.; Mardones, Diego

    2006-12-01

    We have carried out a sensitive high-resolution imaging survey of stars in the young (6-8 Myr), nearby (97 pc) compact cluster around η Chamaeleontis to search for stellar and substellar companions. Our data were obtained using the NACO adaptive optics system on the ESO Very Large Telescope (VLT). Given its youth and proximity, any substellar companions are expected to be luminous, especially in the near-infrared, and thus easier to detect next to their parent stars. Here, we present VLT NACO adaptive optics imaging with companion detection limits for 17 η Cha cluster members, and follow-up VLT ISAAC near-infrared spectroscopy for companion candidates. The widest binary detected is ~0.2", corresponding to the projected separation 20 AU, despite our survey being sensitive down to substellar companions outside 0.3", and planetary-mass objects outside 0.5". This implies that the stellar companion probability outside 0.3" and the brown dwarf companion probability outside 0.5" are less than 0.16 with 95% confidence. We compare the wide binary frequency of η Cha to that of the similarly aged TW Hydrae association and estimate the statistical likelihood that the wide binary probability is equal in both groups to be less than 2×10-4. Even though the η Cha cluster is relatively dense, stellar encounters in its present configuration cannot account for the relative deficit of wide binaries. We thus conclude that the difference in wide binary probability in these two groups provides strong evidence for multiplicity properties being dependent on environment. In two appendices we derive the projected separation probability distribution for binaries, used to constrain physical separations from observed projected separations, and summarize statistical tools useful for multiplicity studies.

  12. The True Ultracool Binary Fraction Using Spectral Binaries

    NASA Astrophysics Data System (ADS)

    Bardalez Gagliuffi, Daniella; Burgasser, Adam J.; Schmidt, Sarah J.; Gagné, Jonathan; Faherty, Jacqueline K.; Cruz, Kelle; Gelino, Chris

    2018-01-01

    Brown dwarfs bridge the gap between stars and giant planets. While the essential mechanisms governing their formation are not well constrained, binary statistics are a direct outcome of the formation process, and thus provide a means to test formation theories. Observational constraints on the brown dwarf binary fraction place it at 10 ‑ 20%, dominated by imaging studies (85% of systems) with the most common separation at 4 AU. This coincides with the resolution limit of state-of-the-art imaging techniques, suggesting that the binary fraction is underestimated. We have developed a separation-independent method to identify and characterize tightly-separated (< 5 AU) binary systems of brown dwarfs as spectral binaries by identifying traces of methane in the spectra of late-M and early-L dwarfs. Imaging follow-up of 17 spectral binaries yielded 3 (18%) resolved systems, corroborating the observed binary fraction, but 5 (29%) known binaries were missed, reinforcing the hypothesis that the short-separation systems are undercounted. In order to find the true binary fraction of brown dwarfs, we have compiled a volume-limited, spectroscopic sample of M7-L5 dwarfs and searched for T dwarf companions. In the 25 pc volume, 4 candidates were found, three of which are already confirmed, leading to a spectral binary fraction of 0.95 ± 0.50%, albeit for a specific combination of spectral types. To extract the true binary fraction and determine the biases of the spectral binary method, we have produced a binary population simulation based on different assumptions of the mass function, age distribution, evolutionary models and mass ratio distribution. Applying the correction fraction resulting from this method to the observed spectral binary fraction yields a true binary fraction of 27 ± 4%, which is roughly within 1σ of the binary fraction obtained from high resolution imaging studies, radial velocity and astrometric monitoring. This method can be extended to identify giant

  13. BINARY STORAGE ELEMENT

    DOEpatents

    Chu, J.C.

    1958-06-10

    A binary storage device is described comprising a toggle provided with associsted improved driver circuits adapted to produce reliable action of the toggle during clearing of the toggle to one of its two states. or transferring information into and out of the toggle. The invention resides in the development of a self-regulating driver circuit to minimize the fluctuation of the driving voltages for the toggle. The disclosed driver circuit produces two pulses in response to an input pulse: a first or ''clear'' pulse beginning nt substantially the same time but endlrg slightly sooner than the second or ''transfer'' output pulse.

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

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

  16. Adaptive Optics Imaging of the Circumbinary Disk around the T Tauri Binary UY Aurigae: Estimates of the Binary Mass and Circumbinary Dust Grain Size Distribution

    NASA Astrophysics Data System (ADS)

    Close, L. M.; Dutrey, A.; Roddier, F.; Guilloteau, S.; Roddier, C.; Northcott, M.; Ménard, F.; Duvert, G.; Graves, J. E.; Potter, D.

    1998-05-01

    We have obtained high-resolution (FWHM = 0.15") deep images of the UY Aur binary at J, H, and K' with the University of Hawaii adaptive optics instrument. We clearly detect an R ~ 500 AU circumbinary disk discovered with millimeter interferometry, making UY Aur the second young binary with a confirmed circumbinary disk. It appears that the disk is inclined ~42° from face on. We find that the near side of the disk is brighter than the far side by factors of 2.6, 2.7, and 6.5 times at K', H, and J, respectively. The original GG Tau circumbinary disk has been reexamined and is found to have similar flux ratios of 1.5, 2.6, and 3.6 at K', H, and J, respectively. A realistic power-law distribution (p = 4.7) of spherical dust aggregates (composed of silicates, amorphous carbon, and graphite) that reproduces the observed ISM extinction curve also predicts these observed flux ratios from Mie scattering theory. We find the observed preference of forward-scattering over back-scattering is well fitted (global χ2 minimization) by Mie scattering off particles in the range amin = 0.03 μm to amax = 0.5-0.6 μm. The existence of a significant population of grain radii larger than 0.6 μm is not supported by the scattering observations. Based on the observed disk inclination we derive an orbit for UY Aur where the mass for the binary is 1.6+0.47-0.67 M⊙. Based on the observed K7 and M0 spectral types for UY Aur A and B, accretion disk models for the inner disks around the central stars were constructed. The models suggest that small (lower limit R ~ 5-10 AU) inner disks exist around B and A. It appears that B is accreting ~5 times faster than A, and that both inner disks may be exhausted in ~102-103 yr without replenishment from the outer circumbinary disk. Our images suggest that these inner disks may indeed be resupplied with material through thin streamers of material that penetrate inside the circumbinary disk. Currently it appears that such a streamer may be a close to UY

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

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

  19. Learning to assign binary weights to binary descriptor

    NASA Astrophysics Data System (ADS)

    Huang, Zhoudi; Wei, Zhenzhong; Zhang, Guangjun

    2016-10-01

    Constructing robust binary local feature descriptors are receiving increasing interest due to their binary nature, which can enable fast processing while requiring significantly less memory than their floating-point competitors. To bridge the performance gap between the binary and floating-point descriptors without increasing the computational cost of computing and matching, optimal binary weights are learning to assign to binary descriptor for considering each bit might contribute differently to the distinctiveness and robustness. Technically, a large-scale regularized optimization method is applied to learn float weights for each bit of the binary descriptor. Furthermore, binary approximation for the float weights is performed by utilizing an efficient alternatively greedy strategy, which can significantly improve the discriminative power while preserve fast matching advantage. Extensive experimental results on two challenging datasets (Brown dataset and Oxford dataset) demonstrate the effectiveness and efficiency of the proposed method.

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

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

  2. Adaptive Fading Memory H∞ Filter Design for Compensation of Delayed Components in Self Powered Flux Detectors

    NASA Astrophysics Data System (ADS)

    Tamboli, Prakash Kumar; Duttagupta, Siddhartha P.; Roy, Kallol

    2015-08-01

    The paper deals with dynamic compensation of delayed Self Powered Flux Detectors (SPFDs) using discrete time H∞ filtering method for improving the response of SPFDs with significant delayed components such as Platinum and Vanadium SPFD. We also present a comparative study between the Linear Matrix Inequality (LMI) based H∞ filtering and Algebraic Riccati Equation (ARE) based Kalman filtering methods with respect to their delay compensation capabilities. Finally an improved recursive H∞ filter based on the adaptive fading memory technique is proposed which provides an improved performance over existing methods. The existing delay compensation algorithms do not account for the rate of change in the signal for determining the filter gain and therefore add significant noise during the delay compensation process. The proposed adaptive fading memory H∞ filter minimizes the overall noise very effectively at the same time keeps the response time at minimum values. The recursive algorithm is easy to implement in real time as compared to the LMI (or ARE) based solutions.

  3. Constructing binary black hole initial data with high mass ratios and spins

    NASA Astrophysics Data System (ADS)

    Ossokine, Serguei; Foucart, Francois; Pfeiffer, Harald; Szilagyi, Bela; Simulating Extreme Spacetimes Collaboration

    2015-04-01

    Binary black hole systems have now been successfully modelled in full numerical relativity by many groups. In order to explore high-mass-ratio (larger than 1:10), high-spin systems (above 0.9 of the maximal BH spin), we revisit the initial-data problem for binary black holes. The initial-data solver in the Spectral Einstein Code (SpEC) was not able to solve for such initial data reliably and robustly. I will present recent improvements to this solver, among them adaptive mesh refinement and control of motion of the center of mass of the binary, and will discuss the much larger region of parameter space this code can now address.

  4. Recursive feature selection with significant variables of support vectors.

    PubMed

    Tsai, Chen-An; Huang, Chien-Hsun; Chang, Ching-Wei; Chen, Chun-Houh

    2012-01-01

    The development of DNA microarray makes researchers screen thousands of genes simultaneously and it also helps determine high- and low-expression level genes in normal and disease tissues. Selecting relevant genes for cancer classification is an important issue. Most of the gene selection methods use univariate ranking criteria and arbitrarily choose a threshold to choose genes. However, the parameter setting may not be compatible to the selected classification algorithms. In this paper, we propose a new gene selection method (SVM-t) based on the use of t-statistics embedded in support vector machine. We compared the performance to two similar SVM-based methods: SVM recursive feature elimination (SVMRFE) and recursive support vector machine (RSVM). The three methods were compared based on extensive simulation experiments and analyses of two published microarray datasets. In the simulation experiments, we found that the proposed method is more robust in selecting informative genes than SVMRFE and RSVM and capable to attain good classification performance when the variations of informative and noninformative genes are different. In the analysis of two microarray datasets, the proposed method yields better performance in identifying fewer genes with good prediction accuracy, compared to SVMRFE and RSVM.

  5. Recursive mentalizing and common knowledge in the bystander effect.

    PubMed

    Thomas, Kyle A; De Freitas, Julian; DeScioli, Peter; Pinker, Steven

    2016-05-01

    The more potential helpers there are, the less likely any individual is to help. A traditional explanation for this bystander effect is that responsibility diffuses across the multiple bystanders, diluting the responsibility of each. We investigate an alternative, which combines the volunteer's dilemma (each bystander is best off if another responds) with recursive theory of mind (each infers what the others know about what he knows) to predict that actors will strategically shirk when they think others feel compelled to help. In 3 experiments, participants responded to a (fictional) person who needed help from at least 1 volunteer. Participants were in groups of 2 or 5 and had varying information about whether other group members knew that help was needed. As predicted, people's decision to help zigzagged with the depth of their asymmetric, recursive knowledge (e.g., "John knows that Michael knows that John knows help is needed"), and replicated the classic bystander effect when they had common knowledge (everyone knowing what everyone knows). The results demonstrate that the bystander effect may result not from a mere diffusion of responsibility but specifically from actors' strategic computations. (c) 2016 APA, all rights reserved).

  6. Recursivity in Lingua Cosmica

    NASA Astrophysics Data System (ADS)

    Ollongren, Alexander

    2011-02-01

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

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

  8. High Resolution Imaging of Very Low Mass Spectral Binaries: Three Resolved Systems and Detection of Orbital Motion in an L/T Transition Binary

    NASA Astrophysics Data System (ADS)

    Bardalez Gagliuffi, Daniella C.; Gelino, Christopher R.; Burgasser, Adam J.

    2015-11-01

    We present high resolution Laser Guide Star Adaptive Optics imaging of 43 late-M, L and T dwarf systems with Keck/NIRC2. These include 17 spectral binary candidates, systems whose spectra suggest the presence of a T dwarf secondary. We resolve three systems: 2MASS J1341-3052, SDSS J1511+0607 and SDSS J2052-1609 the first two are resolved for the first time. All three have projected separations <8 AU and estimated periods of 14-80 years. We also report a preliminary orbit determination for SDSS J2052-1609 based on six epochs of resolved astrometry between 2005 and 2010. Among the 14 unresolved spectral binaries, 5 systems were confirmed binaries but remained unresolved, implying a minimum binary fraction of {47}-11+12% for this sample. Our inability to resolve most of the spectral binaries, including the confirmed binaries, supports the hypothesis that a large fraction of very low mass systems have relatively small separations and are missed with direct imaging. Some of the data presented herein were obtained at the W.M. Keck Observatory, which is operated as a scientific partnership among the California Institute of Technology, the University of California, and the National Aeronautics and Space Administration. The Observatory was made possible by the generous financial support of the W.M. Keck Foundation.

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

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

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

  12. Seeing the unseen: Complete volcano deformation fields by recursive filtering of satellite radar interferograms

    NASA Astrophysics Data System (ADS)

    Gonzalez, Pablo J.

    2017-04-01

    Automatic interferometric processing of satellite radar data has emerged as a solution to the increasing amount of acquired SAR data. Automatic SAR and InSAR processing ranges from focusing raw echoes to the computation of displacement time series using large stacks of co-registered radar images. However, this type of interferometric processing approach demands the pre-described or adaptive selection of multiple processing parameters. One of the interferometric processing steps that much strongly influences the final results (displacement maps) is the interferometric phase filtering. There are a large number of phase filtering methods, however the "so-called" Goldstein filtering method is the most popular [Goldstein and Werner, 1998; Baran et al., 2003]. The Goldstein filter needs basically two parameters, the size of the window filter and a parameter to indicate the filter smoothing intensity. The modified Goldstein method removes the need to select the smoothing parameter based on the local interferometric coherence level, but still requires to specify the dimension of the filtering window. An optimal filtered phase quality usually requires careful selection of those parameters. Therefore, there is an strong need to develop automatic filtering methods to adapt for automatic processing, while maximizing filtered phase quality. Here, in this paper, I present a recursive adaptive phase filtering algorithm for accurate estimation of differential interferometric ground deformation and local coherence measurements. The proposed filter is based upon the modified Goldstein filter [Baran et al., 2003]. This filtering method improves the quality of the interferograms by performing a recursive iteration using variable (cascade) kernel sizes, and improving the coherence estimation by locally defringing the interferometric phase. The method has been tested using simulations and real cases relevant to the characteristics of the Sentinel-1 mission. Here, I present real examples

  13. Stability of binaries. Part 1: Rigid binaries

    NASA Astrophysics Data System (ADS)

    Sharma, Ishan

    2015-09-01

    We consider the stability of binary asteroids whose members are possibly granular aggregates held together by self-gravity alone. A binary is said to be stable whenever each member is orbitally and structurally stable to both orbital and structural perturbations. To this end, we extend the stability test for rotating granular aggregates introduced by Sharma (Sharma, I. [2012]. J. Fluid Mech., 708, 71-99; Sharma, I. [2013]. Icarus, 223, 367-382; Sharma, I. [2014]. Icarus, 229, 278-294) to the case of binary systems comprised of rubble members. In part I, we specialize to the case of a binary with rigid members subjected to full three-dimensional perturbations. Finally, we employ the stability test to critically appraise shape models of four suspected binary systems, viz., 216 Kleopatra, 25143 Itokawa, 624 Hektor and 90 Antiope.

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

  15. DISCOVERY OF A HIGHLY UNEQUAL-MASS BINARY T DWARF WITH KECK LASER GUIDE STAR ADAPTIVE OPTICS: A COEVALITY TEST OF SUBSTELLAR THEORETICAL MODELS AND EFFECTIVE TEMPERATURES

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

    Liu, Michael C.; Dupuy, Trent J.; Leggett, S. K., E-mail: mliu@ifa.hawaii.ed

    Highly unequal-mass ratio binaries are rare among field brown dwarfs, with the mass ratio distribution of the known census described by q {sup (4.9{+-}0.7)}. However, such systems enable a unique test of the joint accuracy of evolutionary and atmospheric models, under the constraint of coevality for the individual components (the 'isochrone test'). We carry out this test using two of the most extreme field substellar binaries currently known, the T1 + T6 {epsilon} Ind Bab binary and a newly discovered 0.''14 T2.0 + T7.5 binary, 2MASS J12095613-1004008AB, identified with Keck laser guide star adaptive optics. The latter is the mostmore » extreme tight binary resolved to date (q {approx} 0.5). Based on the locations of the binary components on the Hertzsprung-Russell (H-R) diagram, current models successfully indicate that these two systems are coeval, with internal age differences of log(age) = -0.8 {+-} 1.3(-1.0{sup +1.2}{sub -1.3}) dex and 0.5{sup +0.4}{sub -0.3}(0.3{sup +0.3}{sub -0.4}) dex for 2MASS J1209-1004AB and {epsilon} Ind Bab, respectively, as inferred from the Lyon (Tucson) models. However, the total mass of {epsilon} Ind Bab derived from the H-R diagram ({approx} 80 M{sub Jup} using the Lyon models) is strongly discrepant with the reported dynamical mass. This problem, which is independent of the assumed age of the {epsilon} Ind Bab system, can be explained by a {approx} 50-100 K systematic error in the model atmosphere fitting, indicating slightly warmer temperatures for both components; bringing the mass determinations from the H-R diagram and the visual orbit into consistency leads to an inferred age of {approx} 6 Gyr for {epsilon} Ind Bab, older than previously assumed. Overall, the two T dwarf binaries studied here, along with recent results from T dwarfs in age and mass benchmark systems, yield evidence for small ({approx}100 K) errors in the evolutionary models and/or model atmospheres, but not significantly larger. Future parallax, resolved

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

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

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

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

  20. Adaptive MPC based on MIMO ARX-Laguerre model.

    PubMed

    Ben Abdelwahed, Imen; Mbarek, Abdelkader; Bouzrara, Kais

    2017-03-01

    This paper proposes a method for synthesizing an adaptive predictive controller using a reduced complexity model. This latter is given by the projection of the ARX model on Laguerre bases. The resulting model is entitled MIMO ARX-Laguerre and it is characterized by an easy recursive representation. The adaptive predictive control law is computed based on multi-step-ahead finite-element predictors, identified directly from experimental input/output data. The model is tuned in each iteration by an online identification algorithms of both model parameters and Laguerre poles. The proposed approach avoids time consuming numerical optimization algorithms associated with most common linear predictive control strategies, which makes it suitable for real-time implementation. The method is used to synthesize and test in numerical simulations adaptive predictive controllers for the CSTR process benchmark. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

  1. FRPA: A Framework for Recursive Parallel Algorithms

    DTIC Science & Technology

    2015-05-01

    a t o i ( argv [ 1 ] ) ; s td : : s t r i n g i n t e r l e a v i n g = ( argc > 2) ? argv [ 2 ] : " " ; double ∗ A = randomArray ( l e n g t h...actually determines how deep the recursion is. For example, a configuration with schedule ‘BBDB’ and depth 3 represents the in- terleaving ‘ BBD ’. This means...depth 3 represents the same interleaving as the configuration with schedule ‘BBDD’ and depth 3, namely ‘ BBD ’. In our experiments, this redundancy did

  2. Binary Plutinos

    NASA Astrophysics Data System (ADS)

    Noll, Keith S.

    2015-08-01

    The Pluto-Charon binary was the first trans-neptunian binary to be identified in 1978. Pluto-Charon is a true binary with both components orbiting a barycenter located between them. The Pluto system is also the first, and to date only, known binary with a satellite system consisting of four small satellites in near-resonant orbits around the common center of mass. Seven other Plutinos, objects in 3:2 mean motion resonance with Neptune, have orbital companions including 2004 KB19 reported here for the first time. Compared to the Cold Classical population, the Plutinos differ in the frequency of binaries, the relative sizes of the components, and their inclination distribution. These differences point to distinct dynamical histories and binary formation processes encountered by Plutinos.

  3. The Binary Toxin CDT of Clostridium difficile as a Tool for Intracellular Delivery of Bacterial Glucosyltransferase Domains.

    PubMed

    Beer, Lara-Antonia; Tatge, Helma; Schneider, Carmen; Ruschig, Maximilian; Hust, Michael; Barton, Jessica; Thiemann, Stefan; Fühner, Viola; Russo, Giulio; Gerhard, Ralf

    2018-06-01

    Binary toxins are produced by several pathogenic bacteria. Examples are the C2 toxin from Clostridium botulinum , the iota toxin from Clostridium perfringens, and the CDT from Clostridium difficile . All these binary toxins have ADP-ribosyltransferases (ADPRT) as their enzymatically active component that modify monomeric actin in their target cells. The binary C2 toxin was intensively described as a tool for intracellular delivery of allogenic ADPRTs. Here, we firstly describe the binary toxin CDT from C. difficile as an effective tool for heterologous intracellular delivery. Even 60 kDa glucosyltransferase domains of large clostridial glucosyltransferases can be delivered into cells. The glucosyltransferase domains of five tested large clostridial glucosyltransferases were successfully introduced into cells as chimeric fusions to the CDTa adapter domain (CDTaN). Cell uptake was demonstrated by the analysis of cell morphology, cytoskeleton staining, and intracellular substrate glucosylation. The fusion toxins were functional only when the adapter domain of CDTa was N -terminally located, according to its native orientation. Thus, like other binary toxins, the CDTaN/b system can be used for standardized delivery systems not only for bacterial ADPRTs but also for a variety of bacterial glucosyltransferase domains.

  4. ASIC implementation of recursive scaled discrete cosine transform algorithm

    NASA Astrophysics Data System (ADS)

    On, Bill N.; Narasimhan, Sam; Huang, Victor K.

    1994-05-01

    A program to implement the Recursive Scaled Discrete Cosine Transform (DCT) algorithm as proposed by H. S. Hou has been undertaken at the Institute of Microelectronics. Implementation of the design was done using top-down design methodology with VHDL (VHSIC Hardware Description Language) for chip modeling. When the VHDL simulation has been satisfactorily completed, the design is synthesized into gates using a synthesis tool. The architecture of the design consists of two processing units together with a memory module for data storage and transpose. Each processing unit is composed of four pipelined stages which allow the internal clock to run at one-eighth (1/8) the speed of the pixel clock. Each stage operates on eight pixels in parallel. As the data flows through each stage, there are various adders and multipliers to transform them into the desired coefficients. The Scaled IDCT was implemented in a similar fashion with the adders and multipliers rearranged to perform the inverse DCT algorithm. The chip has been verified using Field Programmable Gate Array devices. The design is operational. The combination of fewer multiplications required and pipelined architecture give Hou's Recursive Scaled DCT good potential of achieving high performance at a low cost in using Very Large Scale Integration implementation.

  5. REQUEST: A Recursive QUEST Algorithm for Sequential Attitude Determination

    NASA Technical Reports Server (NTRS)

    Bar-Itzhack, Itzhack Y.

    1996-01-01

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

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

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

  8. Dynamic fisheye grids for binary black hole simulations

    NASA Astrophysics Data System (ADS)

    Zilhão, Miguel; Noble, Scott C.

    2014-03-01

    We present a new warped gridding scheme adapted to simulating gas dynamics in binary black hole spacetimes. The grid concentrates grid points in the vicinity of each black hole to resolve the smaller scale structures there, and rarefies grid points away from each black hole to keep the overall problem size at a practical level. In this respect, our system can be thought of as a ‘double’ version of the fisheye coordinate system, used before in numerical relativity codes for evolving binary black holes. The gridding scheme is constructed as a mapping between a uniform coordinate system—in which the equations of motion are solved—to the distorted system representing the spatial locations of our grid points. Since we are motivated to eventually use this system for circumbinary disc calculations, we demonstrate how the distorted system can be constructed to asymptote to the typical spherical polar coordinate system, amenable to efficiently simulating orbiting gas flows about central objects with little numerical diffusion. We discuss its implementation in the Harm3d code, tailored to evolve the magnetohydrodynamics equations in curved spacetimes. We evaluate the performance of the system’s implementation in Harm3d with a series of tests, such as the advected magnetic field loop test, magnetized Bondi accretion, and evolutions of hydrodynamic discs about a single black hole and about a binary black hole. Like we have done with Harm3d, this gridding scheme can be implemented in other unigrid codes as a (possibly) simpler alternative to adaptive mesh refinement.

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

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

  11. Fast frequency acquisition via adaptive least squares algorithm

    NASA Technical Reports Server (NTRS)

    Kumar, R.

    1986-01-01

    A new least squares algorithm is proposed and investigated for fast frequency and phase acquisition of sinusoids in the presence of noise. This algorithm is a special case of more general, adaptive parameter-estimation techniques. The advantages of the algorithms are their conceptual simplicity, flexibility and applicability to general situations. For example, the frequency to be acquired can be time varying, and the noise can be nonGaussian, nonstationary and colored. As the proposed algorithm can be made recursive in the number of observations, it is not necessary to have a priori knowledge of the received signal-to-noise ratio or to specify the measurement time. This would be required for batch processing techniques, such as the fast Fourier transform (FFT). The proposed algorithm improves the frequency estimate on a recursive basis as more and more observations are obtained. When the algorithm is applied in real time, it has the extra advantage that the observations need not be stored. The algorithm also yields a real time confidence measure as to the accuracy of the estimator.

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

  13. Stability of binaries. Part II: Rubble-pile binaries

    NASA Astrophysics Data System (ADS)

    Sharma, Ishan

    2016-10-01

    We consider the stability of the binary asteroids whose members are granular aggregates held together by self-gravity alone. A binary is said to be stable whenever both its members are orbitally and structurally stable to both orbital and structural perturbations. To this end, we extend the stability analysis of Sharma (Sharma [2015] Icarus, 258, 438-453), that is applicable to binaries with rigid members, to the case of binary systems with rubble members. We employ volume averaging (Sharma et al. [2009] Icarus, 200, 304-322), which was inspired by past work on elastic/fluid, rotating and gravitating ellipsoids. This technique has shown promise when applied to rubble-pile ellipsoids, but requires further work to settle some of its underlying assumptions. The stability test is finally applied to some suspected binary systems, viz., 216 Kleopatra, 624 Hektor and 90 Antiope. We also see that equilibrated binaries that are close to mobilizing their maximum friction can sustain only a narrow range of shapes and, generally, congruent shapes are preferred.

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

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

    PubMed Central

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

    2009-01-01

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

  16. Full Gradient Solution to Adaptive Hybrid Control

    NASA Technical Reports Server (NTRS)

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

    2017-01-01

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

  17. Full Gradient Solution to Adaptive Hybrid Control

    NASA Technical Reports Server (NTRS)

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

    2016-01-01

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

  18. R144: a very massive binary likely ejected from R136 through a binary-binary encounter

    NASA Astrophysics Data System (ADS)

    Oh, Seungkyung; Kroupa, Pavel; Banerjee, Sambaran

    2014-02-01

    R144 is a recently confirmed very massive, spectroscopic binary which appears isolated from the core of the massive young star cluster R136. The dynamical ejection hypothesis as an origin for its location is claimed improbable by Sana et al. due to its binary nature and high mass. We demonstrate here by means of direct N-body calculations that a very massive binary system can be readily dynamically ejected from an R136-like cluster, through a close encounter with a very massive system. One out of four N-body cluster models produces a dynamically ejected very massive binary system with a mass comparable to R144. The system has a system mass of ≈355 M⊙ and is located at 36.8 pc from the centre of its parent cluster, moving away from the cluster with a velocity of 57 km s-1 at 2 Myr as a result of a binary-binary interaction. This implies that R144 could have been ejected from R136 through a strong encounter with another massive binary or single star. In addition, we discuss all massive binaries and single stars which are ejected dynamically from their parent cluster in the N-body models.

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

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

    NASA Technical Reports Server (NTRS)

    Mueller, A. C.

    1977-01-01

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

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

  2. Evolving RBF neural networks for adaptive soft-sensor design.

    PubMed

    Alexandridis, Alex

    2013-12-01

    This work presents an adaptive framework for building soft-sensors based on radial basis function (RBF) neural network models. The adaptive fuzzy means algorithm is utilized in order to evolve an RBF network, which approximates the unknown system based on input-output data from it. The methodology gradually builds the RBF network model, based on two separate levels of adaptation: On the first level, the structure of the hidden layer is modified by adding or deleting RBF centers, while on the second level, the synaptic weights are adjusted with the recursive least squares with exponential forgetting algorithm. The proposed approach is tested on two different systems, namely a simulated nonlinear DC Motor and a real industrial reactor. The results show that the produced soft-sensors can be successfully applied to model the two nonlinear systems. A comparison with two different adaptive modeling techniques, namely a dynamic evolving neural-fuzzy inference system (DENFIS) and neural networks trained with online backpropagation, highlights the advantages of the proposed methodology.

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

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

  5. Stellar and Circumstellar Properties of Low-Mass, Young, Subarcsecond Binaries

    NASA Astrophysics Data System (ADS)

    Bruhns, Sara; Prato, L. A.

    2014-01-01

    We present a study of the stellar and circumstellar characteristics of close (< 1''), young (< 2 to 3 Myr), low-mass (<1 solar mass) binary stars in the Taurus star forming region. Low-resolution (R ~ 2000) spectra were taken in the K-band using adaptive optics to separate the observations for each component and identify the individual spectral types, extinction, and K-band excess. Combining these data with stellar luminosities allows us to estimate the stellar masses and ages. We also measured equivalent widths of the hydrogen Brackett gamma line in order to estimate the strength of gas accretion. We obtained spectra for six binary systems with separations from 1'' down to 0.3''. In the CZ Tau binary we found that the fainter secondary star spectrum appears to be of earlier spectral type than the primary; we speculate on the origin of this inversion.

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

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

  8. Stability of recursive out-of-sequence measurement filters: an open problem

    NASA Astrophysics Data System (ADS)

    Chen, Lingji; Moshtagh, Nima; Mehra, Raman K.

    2011-06-01

    In many applications where communication delays are present, measurements with earlier time stamps can arrive out-of-sequence, i.e., after state estimates have been obtained for the current time instant. To incorporate such an Out-Of-Sequence Measurement (OOSM), many algorithms have been proposed in the literature to obtain or approximate the optimal estimate that would have been obtained if the OOSM had arrived in-sequence. When OOSM occurs repeatedly, approximate estimations as a result of incorporating one OOSM have to serve as the basis for incorporating yet another OOSM. The question of whether the "approximation of approximation" is well behaved, i.e., whether approximation errors accumulate in a recursive setting, has not been adequately addressed in the literature. This paper draws attention to the stability question of recursive OOSM processing filters, formulates the problem in a specific setting, and presents some simulation results that suggest that such filters are indeed well-behaved. Our hope is that more research will be conducted in the future to rigorously establish stability properties of these filters.

  9. Robust Adaptive Thresholder For Document Scanning Applications

    NASA Astrophysics Data System (ADS)

    Hsing, To R.

    1982-12-01

    In document scanning applications, thresholding is used to obtain binary data from a scanner. However, due to: (1) a wide range of different color backgrounds; (2) density variations of printed text information; and (3) the shading effect caused by the optical systems, the use of adaptive thresholding to enhance the useful information is highly desired. This paper describes a new robust adaptive thresholder for obtaining valid binary images. It is basically a memory type algorithm which can dynamically update the black and white reference level to optimize a local adaptive threshold function. The results of high image quality from different types of simulate test patterns can be obtained by this algorithm. The software algorithm is described and experiment results are present to describe the procedures. Results also show that the techniques described here can be used for real-time signal processing in the varied applications.

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

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

  12. Real-Time Adaptive Least-Squares Drag Minimization for Performance Adaptive Aeroelastic Wing

    NASA Technical Reports Server (NTRS)

    Ferrier, Yvonne L.; Nguyen, Nhan T.; Ting, Eric

    2016-01-01

    This paper contains a simulation study of a real-time adaptive least-squares drag minimization algorithm for an aeroelastic model of a flexible wing aircraft. The aircraft model is based on the NASA Generic Transport Model (GTM). The wing structures incorporate a novel aerodynamic control surface known as the Variable Camber Continuous Trailing Edge Flap (VCCTEF). The drag minimization algorithm uses the Newton-Raphson method to find the optimal VCCTEF deflections for minimum drag in the context of an altitude-hold flight control mode at cruise conditions. The aerodynamic coefficient parameters used in this optimization method are identified in real-time using Recursive Least Squares (RLS). The results demonstrate the potential of the VCCTEF to improve aerodynamic efficiency for drag minimization for transport aircraft.

  13. Parsimonious extreme learning machine using recursive orthogonal least squares.

    PubMed

    Wang, Ning; Er, Meng Joo; Han, Min

    2014-10-01

    Novel constructive and destructive parsimonious extreme learning machines (CP- and DP-ELM) are proposed in this paper. By virtue of the proposed ELMs, parsimonious structure and excellent generalization of multiinput-multioutput single hidden-layer feedforward networks (SLFNs) are obtained. The proposed ELMs are developed by innovative decomposition of the recursive orthogonal least squares procedure into sequential partial orthogonalization (SPO). The salient features of the proposed approaches are as follows: 1) Initial hidden nodes are randomly generated by the ELM methodology and recursively orthogonalized into an upper triangular matrix with dramatic reduction in matrix size; 2) the constructive SPO in the CP-ELM focuses on the partial matrix with the subcolumn of the selected regressor including nonzeros as the first column while the destructive SPO in the DP-ELM operates on the partial matrix including elements determined by the removed regressor; 3) termination criteria for CP- and DP-ELM are simplified by the additional residual error reduction method; and 4) the output weights of the SLFN need not be solved in the model selection procedure and is derived from the final upper triangular equation by backward substitution. Both single- and multi-output real-world regression data sets are used to verify the effectiveness and superiority of the CP- and DP-ELM in terms of parsimonious architecture and generalization accuracy. Innovative applications to nonlinear time-series modeling demonstrate superior identification results.

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

  15. Final binary star results from the ESO VLT Lunar occultations program

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

    Richichi, A.; Fors, O.; Cusano, F.

    2014-03-01

    We report on 13 subarcsecond binaries, detected by means of lunar occultations in the near-infrared at the ESO Very Large Telescope (VLT). They are all first-time detections except for the visual binary HD 158122, which we resolved for the first time in the near-infrared. The primaries have magnitudes in the range K = 4.5-10.0, and companions in the range K = 6.8-11.1. The magnitude differences have a median value of 2.4, with the largest being 4.6. The projected separations are in the range of 4-168 mas, with a median of 13 mas. We discuss and compare our results with themore » available literature. With this paper, we conclude the mining for binary star detections in the 1226 occultations recorded at the VLT with the ISAAC instrument. We expect that the majority of these binaries may be unresolvable by adaptive optics on current telescopes, and they might be challenging for long-baseline interferometry. However, they constitute an interesting sample for future larger telescopes and for astrometric missions such as GAIA.« less

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

    NASA Technical Reports Server (NTRS)

    Bayo, Eduardo; Ledesma, Ragnar

    1993-01-01

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

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

  18. KIC 7177553: A QUADRUPLE SYSTEM OF TWO CLOSE BINARIES

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

    Lehmann, H.; Borkovits, T.; Rappaport, S. A.

    2016-03-01

    KIC 7177553 was observed by the Kepler satellite to be an eclipsing eccentric binary star system with an 18-day orbital period. Recently, an eclipse timing study of the Kepler binaries has revealed eclipse timing variations (ETVs) in this object with an amplitude of ∼100 s and an outer period of 529 days. The implied mass of the third body is that of a super-Jupiter, but below the mass of a brown dwarf. We therefore embarked on a radial velocity (RV) study of this binary to determine its system configuration and to check the hypothesis that it hosts a giant planet. Frommore » the RV measurements, it became immediately obvious that the same Kepler target contains another eccentric binary, this one with a 16.5-day orbital period. Direct imaging using adaptive optics reveals that the two binaries are separated by 0.″4 (∼167 AU) and have nearly the same magnitude (to within 2%). The close angular proximity of the two binaries and very similar γ velocities strongly suggest that KIC 7177553 is one of the rare SB4 systems consisting of two eccentric binaries where at least one system is eclipsing. Both systems consist of slowly rotating, nonevolved, solar-like stars of comparable masses. From the orbital separation and the small difference in γ velocity, we infer that the period of the outer orbit most likely lies in the range of 1000–3000 yr. New images taken over the next few years, as well as the high-precision astrometry of the Gaia satellite mission, will allow us to set much narrower constraints on the system geometry. Finally, we note that the observed ETVs in the Kepler data cannot be produced by the second binary. Further spectroscopic observations on a longer timescale will be required to prove the existence of the massive planet.« less

  19. Reduced kernel recursive least squares algorithm for aero-engine degradation prediction

    NASA Astrophysics Data System (ADS)

    Zhou, Haowen; Huang, Jinquan; Lu, Feng

    2017-10-01

    Kernel adaptive filters (KAFs) generate a linear growing radial basis function (RBF) network with the number of training samples, thereby lacking sparseness. To deal with this drawback, traditional sparsification techniques select a subset of original training data based on a certain criterion to train the network and discard the redundant data directly. Although these methods curb the growth of the network effectively, it should be noted that information conveyed by these redundant samples is omitted, which may lead to accuracy degradation. In this paper, we present a novel online sparsification method which requires much less training time without sacrificing the accuracy performance. Specifically, a reduced kernel recursive least squares (RKRLS) algorithm is developed based on the reduced technique and the linear independency. Unlike conventional methods, our novel methodology employs these redundant data to update the coefficients of the existing network. Due to the effective utilization of the redundant data, the novel algorithm achieves a better accuracy performance, although the network size is significantly reduced. Experiments on time series prediction and online regression demonstrate that RKRLS algorithm requires much less computational consumption and maintains the satisfactory accuracy performance. Finally, we propose an enhanced multi-sensor prognostic model based on RKRLS and Hidden Markov Model (HMM) for remaining useful life (RUL) estimation. A case study in a turbofan degradation dataset is performed to evaluate the performance of the novel prognostic approach.

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

  1. Application of adaptive filters in denoising magnetocardiogram signals

    NASA Astrophysics Data System (ADS)

    Khan, Pathan Fayaz; Patel, Rajesh; Sengottuvel, S.; Saipriya, S.; Swain, Pragyna Parimita; Gireesan, K.

    2017-05-01

    Magnetocardiography (MCG) is the measurement of weak magnetic fields from the heart using Superconducting QUantum Interference Devices (SQUID). Though the measurements are performed inside magnetically shielded rooms (MSR) to reduce external electromagnetic disturbances, interferences which are caused by sources inside the shielded room could not be attenuated. The work presented here reports the application of adaptive filters to denoise MCG signals. Two adaptive noise cancellation approaches namely least mean squared (LMS) algorithm and recursive least squared (RLS) algorithm are applied to denoise MCG signals and the results are compared. It is found that both the algorithms effectively remove noisy wiggles from MCG traces; significantly improving the quality of the cardiac features in MCG traces. The calculated signal-to-noise ratio (SNR) for the denoised MCG traces is found to be slightly higher in the LMS algorithm as compared to the RLS algorithm. The results encourage the use of adaptive techniques to suppress noise due to power line frequency and its harmonics which occur frequently in biomedical measurements.

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

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

  4. Discovery of a Highly Unequal-mass Binary T Dwarf with Keck Laser Guide Star Adaptive Optics: A Coevality Test of Substellar Theoretical Models and Effective Temperatures

    NASA Astrophysics Data System (ADS)

    Liu, Michael C.; Dupuy, Trent J.; Leggett, S. K.

    2010-10-01

    Highly unequal-mass ratio binaries are rare among field brown dwarfs, with the mass ratio distribution of the known census described by q (4.9±0.7). However, such systems enable a unique test of the joint accuracy of evolutionary and atmospheric models, under the constraint of coevality for the individual components (the "isochrone test"). We carry out this test using two of the most extreme field substellar binaries currently known, the T1 + T6 epsilon Ind Bab binary and a newly discovered 0farcs14 T2.0 + T7.5 binary, 2MASS J12095613-1004008AB, identified with Keck laser guide star adaptive optics. The latter is the most extreme tight binary resolved to date (q ≈ 0.5). Based on the locations of the binary components on the Hertzsprung-Russell (H-R) diagram, current models successfully indicate that these two systems are coeval, with internal age differences of log(age) = -0.8 ± 1.3(-1.0+1.2 -1.3) dex and 0.5+0.4 -0.3(0.3+0.3 -0.4) dex for 2MASS J1209-1004AB and epsilon Ind Bab, respectively, as inferred from the Lyon (Tucson) models. However, the total mass of epsilon Ind Bab derived from the H-R diagram (≈ 80 M Jup using the Lyon models) is strongly discrepant with the reported dynamical mass. This problem, which is independent of the assumed age of the epsilon Ind Bab system, can be explained by a ≈ 50-100 K systematic error in the model atmosphere fitting, indicating slightly warmer temperatures for both components; bringing the mass determinations from the H-R diagram and the visual orbit into consistency leads to an inferred age of ≈ 6 Gyr for epsilon Ind Bab, older than previously assumed. Overall, the two T dwarf binaries studied here, along with recent results from T dwarfs in age and mass benchmark systems, yield evidence for small (≈100 K) errors in the evolutionary models and/or model atmospheres, but not significantly larger. Future parallax, resolved spectroscopy, and dynamical mass measurements for 2MASS J1209-1004AB will enable a more

  5. An adaptive optimal control for smart structures based on the subspace tracking identification technique

    NASA Astrophysics Data System (ADS)

    Ripamonti, Francesco; Resta, Ferruccio; Borroni, Massimo; Cazzulani, Gabriele

    2014-04-01

    A new method for the real-time identification of mechanical system modal parameters is used in order to design different adaptive control logics aiming to reduce the vibrations in a carbon fiber plate smart structure. It is instrumented with three piezoelectric actuators, three accelerometers and three strain gauges. The real-time identification is based on a recursive subspace tracking algorithm whose outputs are elaborated by an ARMA model. A statistical approach is finally applied to choose the modal parameter correct values. These are given in input to model-based control logics such as a gain scheduling and an adaptive LQR control.

  6. Adaptive allocation for binary outcomes using decreasingly informative priors.

    PubMed

    Sabo, Roy T

    2014-01-01

    A method of outcome-adaptive allocation is presented using Bayes methods, where a natural lead-in is incorporated through the use of informative yet skeptical prior distributions for each treatment group. These prior distributions are modeled on unobserved data in such a way that their influence on the allocation scheme decreases as the trial progresses. Simulation studies show this method to behave comparably to the Bayesian adaptive allocation method described by Thall and Wathen (2007), who incorporate a natural lead-in through sample-size-based exponents.

  7. GUIELOA: Adaptive Optics System for the 2.1-m SPM UNAM Telescope

    NASA Astrophysics Data System (ADS)

    Cuevas, S.; Iriarte, A.; Martínez, L. A.; Garfias, F.; Sánchez, L.; Chapa, O.; Ruelas, R. A.

    2004-08-01

    GUIELOA is the adaptive optics system project for the 2.1-m SPM telescope. This is a 19 sub-apertures curvature-type system. It corrects 8 Zernike terms. GUIELOA is very similar to PUEO, the CFHT adaptive optics system and compensates the atmospheric turbulence from the R band to the K band. Among the planned applications of GUIELOA are the study of OB binary systems, the detection of close binary stars, and the study of disks, jets and other phenomena associated with young stars.

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

  9. Dynamic and scalable audio classification by collective network of binary classifiers framework: an evolutionary approach.

    PubMed

    Kiranyaz, Serkan; Mäkinen, Toni; Gabbouj, Moncef

    2012-10-01

    In this paper, we propose a novel framework based on a collective network of evolutionary binary classifiers (CNBC) to address the problems of feature and class scalability. The main goal of the proposed framework is to achieve a high classification performance over dynamic audio and video repositories. The proposed framework adopts a "Divide and Conquer" approach in which an individual network of binary classifiers (NBC) is allocated to discriminate each audio class. An evolutionary search is applied to find the best binary classifier in each NBC with respect to a given criterion. Through the incremental evolution sessions, the CNBC framework can dynamically adapt to each new incoming class or feature set without resorting to a full-scale re-training or re-configuration. Therefore, the CNBC framework is particularly designed for dynamically varying databases where no conventional static classifiers can adapt to such changes. In short, it is entirely a novel topology, an unprecedented approach for dynamic, content/data adaptive and scalable audio classification. A large set of audio features can be effectively used in the framework, where the CNBCs make appropriate selections and combinations so as to achieve the highest discrimination among individual audio classes. Experiments demonstrate a high classification accuracy (above 90%) and efficiency of the proposed framework over large and dynamic audio databases. Copyright © 2012 Elsevier Ltd. All rights reserved.

  10. A cellular automaton - finite volume method for the simulation of dendritic and eutectic growth in binary alloys using an adaptive mesh refinement

    NASA Astrophysics Data System (ADS)

    Dobravec, Tadej; Mavrič, Boštjan; Šarler, Božidar

    2017-11-01

    A two-dimensional model to simulate the dendritic and eutectic growth in binary alloys is developed. A cellular automaton method is adopted to track the movement of the solid-liquid interface. The diffusion equation is solved in the solid and liquid phases by using an explicit finite volume method. The computational domain is divided into square cells that can be hierarchically refined or coarsened using an adaptive mesh based on the quadtree algorithm. Such a mesh refines the regions of the domain near the solid-liquid interface, where the highest concentration gradients are observed. In the regions where the lowest concentration gradients are observed the cells are coarsened. The originality of the work is in the novel, adaptive approach to the efficient and accurate solution of the posed multiscale problem. The model is verified and assessed by comparison with the analytical results of the Lipton-Glicksman-Kurz model for the steady growth of a dendrite tip and the Jackson-Hunt model for regular eutectic growth. Several examples of typical microstructures are simulated and the features of the method as well as further developments are discussed.

  11. Integrated direct/indirect adaptive robust motion trajectory tracking control of pneumatic cylinders

    NASA Astrophysics Data System (ADS)

    Meng, Deyuan; Tao, Guoliang; Zhu, Xiaocong

    2013-09-01

    This paper studies the precision motion trajectory tracking control of a pneumatic cylinder driven by a proportional-directional control valve. An integrated direct/indirect adaptive robust controller is proposed. The controller employs a physical model based indirect-type parameter estimation to obtain reliable estimates of unknown model parameters, and utilises a robust control method with dynamic compensation type fast adaptation to attenuate the effects of parameter estimation errors, unmodelled dynamics and disturbances. Due to the use of projection mapping, the robust control law and the parameter adaption algorithm can be designed separately. Since the system model uncertainties are unmatched, the recursive backstepping technology is adopted to design the robust control law. Extensive comparative experimental results are presented to illustrate the effectiveness of the proposed controller and its performance robustness to parameter variations and sudden disturbances.

  12. Neutron-Star-Black-Hole Binaries Produced by Binary-Driven Hypernovae

    NASA Astrophysics Data System (ADS)

    Fryer, Chris L.; Oliveira, F. G.; Rueda, J. A.; Ruffini, R.

    2015-12-01

    Binary-driven hypernovae (BdHNe) within the induced gravitational collapse paradigm have been introduced to explain energetic (Eiso≳1052 erg ), long gamma-ray bursts (GRBs) associated with type Ic supernovae (SNe). The progenitor is a tight binary composed of a carbon-oxygen (CO) core and a neutron-star (NS) companion, a subclass of the newly proposed "ultrastripped" binaries. The CO-NS short-period orbit causes the NS to accrete appreciable matter from the SN ejecta when the CO core collapses, ultimately causing it to collapse to a black hole (BH) and producing a GRB. These tight binaries evolve through the SN explosion very differently than compact binaries studied in population synthesis calculations. First, the hypercritical accretion onto the NS companion alters both the mass and the momentum of the binary. Second, because the explosion time scale is on par with the orbital period, the mass ejection cannot be assumed to be instantaneous. This dramatically affects the post-SN fate of the binary. Finally, the bow shock created as the accreting NS plows through the SN ejecta transfers angular momentum, braking the orbit. These systems remain bound even if a large fraction of the binary mass is lost in the explosion (well above the canonical 50% limit), and even large kicks are unlikely to unbind the system. Indeed, BdHNe produce a new family of NS-BH binaries unaccounted for in current population synthesis analyses and, although they may be rare, the fact that nearly 100% remain bound implies that they may play an important role in the compact merger rate, important for gravitational waves that, in turn, can produce a new class of ultrashort GRBs.

  13. Pulsars in binary systems: probing binary stellar evolution and general relativity.

    PubMed

    Stairs, Ingrid H

    2004-04-23

    Radio pulsars in binary orbits often have short millisecond spin periods as a result of mass transfer from their companion stars. They therefore act as very precise, stable, moving clocks that allow us to investigate a large set of otherwise inaccessible astrophysical problems. The orbital parameters derived from high-precision binary pulsar timing provide constraints on binary evolution, characteristics of the binary pulsar population, and the masses of neutron stars with different mass-transfer histories. These binary systems also test gravitational theories, setting strong limits on deviations from general relativity. Surveys for new pulsars yield new binary systems that increase our understanding of all these fields and may open up whole new areas of physics, as most spectacularly evidenced by the recent discovery of an extremely relativistic double-pulsar system.

  14. Recursive Newton-Euler formulation of manipulator dynamics

    NASA Technical Reports Server (NTRS)

    Nasser, M. G.

    1989-01-01

    A recursive Newton-Euler procedure is presented for the formulation and solution of manipulator dynamical equations. The procedure includes rotational and translational joints and a topological tree. This model was verified analytically using a planar two-link manipulator. Also, the model was tested numerically against the Walker-Orin model using the Shuttle Remote Manipulator System data. The hinge accelerations obtained from both models were identical. The computational requirements of the model vary linearly with the number of joints. The computational efficiency of this method exceeds that of Walker-Orin methods. This procedure may be viewed as a considerable generalization of Armstrong's method. A six-by-six formulation is adopted which enhances both the computational efficiency and simplicity of the model.

  15. How I Learned to Stop Worrying and Love Eclipsing Binaries

    NASA Astrophysics Data System (ADS)

    Moe, Maxwell Cassady

    producing sinusoidal variations in perceived brightness as they orbit. These nascent eclipsing binaries are embedded in the hearts of star-forming emission nebulae, and therefore provide a unique snapshot into the formation and evolution of massive binaries and stellar nurseries. We next examine a large sample of B-type eclipsing binaries with intermediate orbital periods. To achieve such a task, we develop an automated pipeline to classify the eclipsing binaries, measure their physical properties from the observed light curves, and recover the intrinsic binary statistics by correcting for selection effects. We find the population of massive binaries at intermediate separations differ from those orbiting in close proximity. Close massive binaries favor small eccentricities and have correlated component masses, demonstrating they coevolved via competitive accretion during their formation in the circumbinary disk. Meanwhile, B-type binaries at slightly wider separations are born with large eccentricities and are weighted toward extreme mass ratios, indicating the components formed relatively independently and subsequently evolved to their current configurations via dynamical interactions. By using eclipsing binaries as accurate age indicators, we also reveal that the binary orbital eccentricities and the line-of-sight dust extinctions are anticorrelated with respect to time. These empirical relations provide robust constraints for tidal evolution in massive binaries and the evolution of the dust content in their surrounding environments. Finally, we compile observations of early-type binaries identified via spectroscopy, eclipses, long-baseline interferometry, adaptive optics, lucky imaging, high-contrast photometry, and common proper motion. We combine the samples from the various surveys and correct for their respective selection effects to determine a comprehensive nature of the intrinsic binary statistics of massive stars. We find the probability distributions of primary

  16. Adaptive particle filter for robust visual tracking

    NASA Astrophysics Data System (ADS)

    Dai, Jianghua; Yu, Shengsheng; Sun, Weiping; Chen, Xiaoping; Xiang, Jinhai

    2009-10-01

    Object tracking plays a key role in the field of computer vision. Particle filter has been widely used for visual tracking under nonlinear and/or non-Gaussian circumstances. In particle filter, the state transition model for predicting the next location of tracked object assumes the object motion is invariable, which cannot well approximate the varying dynamics of the motion changes. In addition, the state estimate calculated by the mean of all the weighted particles is coarse or inaccurate due to various noise disturbances. Both these two factors may degrade tracking performance greatly. In this work, an adaptive particle filter (APF) with a velocity-updating based transition model (VTM) and an adaptive state estimate approach (ASEA) is proposed to improve object tracking. In APF, the motion velocity embedded into the state transition model is updated continuously by a recursive equation, and the state estimate is obtained adaptively according to the state posterior distribution. The experiment results show that the APF can increase the tracking accuracy and efficiency in complex environments.

  17. Communication-Avoiding Parallel Recursive Algorithms for Matrix Multiplication

    DTIC Science & Technology

    2013-05-17

    cost recurrence is FUM(n, P ) = 15 ( n2 4P ) + FUM ( n 2 , P 7 ) with base case FUM(n, 1) = csn ω0 − 5n2, where cs is the constant of Strassen-Winograd...message varies according to the recursion depth, and is the number of words a processor owns of any Si, Ti, or Qi, namely n2 4P words. 1If one does not...recurrence for the entire UM scheme: WUM(n, P ) = 36 n2 4P +WUM ( n 2 , P 7 ) SUM(n, P ) = 36 + SUM ( n 2 , P 7 ) with base case SUM(n, 1) = WUM(n, 1

  18. Neutron-star–black-hole binaries produced by binary-driven hypernovae

    DOE PAGES

    Fryer, Chris L.; Oliveira, F. G.; Rueda, Jorge A.; ...

    2015-12-04

    Here, binary-driven hypernovae (BdHNe) within the induced gravitational collapse paradigm have been introduced to explain energetic (E iso ≳10 52 erg), long gamma-ray bursts (GRBs) associated with type Ic supernovae (SNe). The progenitor is a tight binary composed of a carbon-oxygen (CO) core and a neutron-star (NS) companion, a subclass of the newly proposed “ultrastripped” binaries. The CO-NS short-period orbit causes the NS to accrete appreciable matter from the SN ejecta when the CO core collapses, ultimately causing it to collapse to a black hole (BH) and producing a GRB. These tight binaries evolve through the SN explosion very differentlymore » than compact binaries studied in population synthesis calculations. First, the hypercritical accretion onto the NS companion alters both the mass and the momentum of the binary. Second, because the explosion time scale is on par with the orbital period, the mass ejection cannot be assumed to be instantaneous. This dramatically affects the post-SN fate of the binary. Finally, the bow shock created as the accreting NS plows through the SN ejecta transfers angular momentum, braking the orbit. These systems remain bound even if a large fraction of the binary mass is lost in the explosion (well above the canonical 50% limit), and even large kicks are unlikely to unbind the system. Indeed, BdHNe produce a new family of NS-BH binaries unaccounted for in current population synthesis analyses and, although they may be rare, the fact that nearly 100% remain bound implies that they may play an important role in the compact merger rate, important for gravitational waves that, in turn, can produce a new class of ultrashort GRBs.« less

  19. Neutron-Star-Black-Hole Binaries Produced by Binary-Driven Hypernovae.

    PubMed

    Fryer, Chris L; Oliveira, F G; Rueda, J A; Ruffini, R

    2015-12-04

    Binary-driven hypernovae (BdHNe) within the induced gravitational collapse paradigm have been introduced to explain energetic (E_{iso}≳10^{52}  erg), long gamma-ray bursts (GRBs) associated with type Ic supernovae (SNe). The progenitor is a tight binary composed of a carbon-oxygen (CO) core and a neutron-star (NS) companion, a subclass of the newly proposed "ultrastripped" binaries. The CO-NS short-period orbit causes the NS to accrete appreciable matter from the SN ejecta when the CO core collapses, ultimately causing it to collapse to a black hole (BH) and producing a GRB. These tight binaries evolve through the SN explosion very differently than compact binaries studied in population synthesis calculations. First, the hypercritical accretion onto the NS companion alters both the mass and the momentum of the binary. Second, because the explosion time scale is on par with the orbital period, the mass ejection cannot be assumed to be instantaneous. This dramatically affects the post-SN fate of the binary. Finally, the bow shock created as the accreting NS plows through the SN ejecta transfers angular momentum, braking the orbit. These systems remain bound even if a large fraction of the binary mass is lost in the explosion (well above the canonical 50% limit), and even large kicks are unlikely to unbind the system. Indeed, BdHNe produce a new family of NS-BH binaries unaccounted for in current population synthesis analyses and, although they may be rare, the fact that nearly 100% remain bound implies that they may play an important role in the compact merger rate, important for gravitational waves that, in turn, can produce a new class of ultrashort GRBs.

  20. Multireader multicase reader studies with binary agreement data: simulation, analysis, validation, and sizing.

    PubMed

    Chen, Weijie; Wunderlich, Adam; Petrick, Nicholas; Gallas, Brandon D

    2014-10-01

    We treat multireader multicase (MRMC) reader studies for which a reader's diagnostic assessment is converted to binary agreement (1: agree with the truth state, 0: disagree with the truth state). We present a mathematical model for simulating binary MRMC data with a desired correlation structure across readers, cases, and two modalities, assuming the expected probability of agreement is equal for the two modalities ([Formula: see text]). This model can be used to validate the coverage probabilities of 95% confidence intervals (of [Formula: see text], [Formula: see text], or [Formula: see text] when [Formula: see text]), validate the type I error of a superiority hypothesis test, and size a noninferiority hypothesis test (which assumes [Formula: see text]). To illustrate the utility of our simulation model, we adapt the Obuchowski-Rockette-Hillis (ORH) method for the analysis of MRMC binary agreement data. Moreover, we use our simulation model to validate the ORH method for binary data and to illustrate sizing in a noninferiority setting. Our software package is publicly available on the Google code project hosting site for use in simulation, analysis, validation, and sizing of MRMC reader studies with binary agreement data.

  1. Trojan Binaries

    NASA Astrophysics Data System (ADS)

    Noll, K. S.

    2017-12-01

    The Jupiter Trojans, in the context of giant planet migration models, can be thought of as an extension of the small body populations found beyond Neptune in the Kuiper Belt. Binaries are a distinctive feature of small body populations in the Kuiper Belt with an especially high fraction apparent among the brightest Cold Classicals. The binary fraction, relative sizes, and separations in the dynamically excited populations (Scattered, Resonant) reflects processes that may have eroded a more abundant initial population. This trend continues in the Centaurs and Trojans where few binaries have been found. We review new evidence including a third resolved Trojan binary and lightcurve studies to understand how the Trojans are related to the small body populations that originated in the outer protoplanetary disk.

  2. Robust image region descriptor using local derivative ordinal binary pattern

    NASA Astrophysics Data System (ADS)

    Shang, Jun; Chen, Chuanbo; Pei, Xiaobing; Liang, Hu; Tang, He; Sarem, Mudar

    2015-05-01

    Binary image descriptors have received a lot of attention in recent years, since they provide numerous advantages, such as low memory footprint and efficient matching strategy. However, they utilize intermediate representations and are generally less discriminative than floating-point descriptors. We propose an image region descriptor, namely local derivative ordinal binary pattern, for object recognition and image categorization. In order to preserve more local contrast and edge information, we quantize the intensity differences between the central pixels and their neighbors of the detected local affine covariant regions in an adaptive way. These differences are then sorted and mapped into binary codes and histogrammed with a weight of the sum of the absolute value of the differences. Furthermore, the gray level of the central pixel is quantized to further improve the discriminative ability. Finally, we combine them to form a joint histogram to represent the features of the image. We observe that our descriptor preserves more local brightness and edge information than traditional binary descriptors. Also, our descriptor is robust to rotation, illumination variations, and other geometric transformations. We conduct extensive experiments on the standard ETHZ and Kentucky datasets for object recognition and PASCAL for image classification. The experimental results show that our descriptor outperforms existing state-of-the-art methods.

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

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

  5. Binary Decision Trees for Preoperative Periapical Cyst Screening Using Cone-beam Computed Tomography.

    PubMed

    Pitcher, Brandon; Alaqla, Ali; Noujeim, Marcel; Wealleans, James A; Kotsakis, Georgios; Chrepa, Vanessa

    2017-03-01

    Cone-beam computed tomographic (CBCT) analysis allows for 3-dimensional assessment of periradicular lesions and may facilitate preoperative periapical cyst screening. The purpose of this study was to develop and assess the predictive validity of a cyst screening method based on CBCT volumetric analysis alone or combined with designated radiologic criteria. Three independent examiners evaluated 118 presurgical CBCT scans from cases that underwent apicoectomies and had an accompanying gold standard histopathological diagnosis of either a cyst or granuloma. Lesion volume, density, and specific radiologic characteristics were assessed using specialized software. Logistic regression models with histopathological diagnosis as the dependent variable were constructed for cyst prediction, and receiver operating characteristic curves were used to assess the predictive validity of the models. A conditional inference binary decision tree based on a recursive partitioning algorithm was constructed to facilitate preoperative screening. Interobserver agreement was excellent for volume and density, but it varied from poor to good for the radiologic criteria. Volume and root displacement were strong predictors for cyst screening in all analyses. The binary decision tree classifier determined that if the volume of the lesion was >247 mm 3 , there was 80% probability of a cyst. If volume was <247 mm 3 and root displacement was present, cyst probability was 60% (78% accuracy). The good accuracy and high specificity of the decision tree classifier renders it a useful preoperative cyst screening tool that can aid in clinical decision making but not a substitute for definitive histopathological diagnosis after biopsy. Confirmatory studies are required to validate the present findings. Published by Elsevier Inc.

  6. Numerical Simulations of Wind Accretion in Symbiotic Binaries

    NASA Astrophysics Data System (ADS)

    de Val-Borro, M.; Karovska, M.; Sasselov, D.

    2009-08-01

    About half of the binary systems are close enough to each other for mass to be exchanged between them at some point in their evolution, yet the accretion mechanism in wind accreting binaries is not well understood. We study the dynamical effects of gravitational focusing by a binary companion on winds from late-type stars. In particular, we investigate the mass transfer and formation of accretion disks around the secondary in detached systems consisting of an asymptotic giant branch (AGB) mass-losing star and an accreting companion. The presence of mass outflows is studied as a function of mass-loss rate, wind temperature, and binary orbital parameters. A two-dimensional hydrodynamical model is used to study the stability of mass transfer in wind accreting symbiotic binary systems. In our simulations we use an adiabatic equation of state and a modified version of the isothermal approximation, where the temperature depends on the distance from the mass losing star and its companion. The code uses a block-structured adaptive mesh refinement method that allows us to have high resolution at the position of the secondary and resolve the formation of bow shocks and accretion disks. We explore the accretion flow between the components and formation of accretion disks for a range of orbital separations and wind parameters. Our results show the formation of stream flow between the stars and accretion disks of various sizes for certain orbital configurations. For a typical slow and massive wind from an AGB star the flow pattern is similar to a Roche lobe overflow with accretion rates of 10% of the mass loss from the primary. Stable disks with exponentially decreasing density profiles and masses of the order 10-4 solar masses are formed when wind acceleration occurs at several stellar radii. The disks are geometrically thin with eccentric streamlines and close to Keplerian velocity profiles. The formation of tidal streams and accretion disks is found to be weakly dependent on

  7. Testing the Binary Black Hole Nature of a Compact Binary Coalescence

    NASA Astrophysics Data System (ADS)

    Krishnendu, N. V.; Arun, K. G.; Mishra, Chandra Kant

    2017-09-01

    We propose a novel method to test the binary black hole nature of compact binaries detectable by gravitational wave (GW) interferometers and, hence, constrain the parameter space of other exotic compact objects. The spirit of the test lies in the "no-hair" conjecture for black holes where all properties of a Kerr black hole are characterized by its mass and spin. The method relies on observationally measuring the quadrupole moments of the compact binary constituents induced due to their spins. If the compact object is a Kerr black hole (BH), its quadrupole moment is expressible solely in terms of its mass and spin. Otherwise, the quadrupole moment can depend on additional parameters (such as the equation of state of the object). The higher order spin effects in phase and amplitude of a gravitational waveform, which explicitly contains the spin-induced quadrupole moments of compact objects, hence, uniquely encode the nature of the compact binary. Thus, we argue that an independent measurement of the spin-induced quadrupole moment of the compact binaries from GW observations can provide a unique way to distinguish binary BH systems from binaries consisting of exotic compact objects.

  8. Testing the Binary Black Hole Nature of a Compact Binary Coalescence.

    PubMed

    Krishnendu, N V; Arun, K G; Mishra, Chandra Kant

    2017-09-01

    We propose a novel method to test the binary black hole nature of compact binaries detectable by gravitational wave (GW) interferometers and, hence, constrain the parameter space of other exotic compact objects. The spirit of the test lies in the "no-hair" conjecture for black holes where all properties of a Kerr black hole are characterized by its mass and spin. The method relies on observationally measuring the quadrupole moments of the compact binary constituents induced due to their spins. If the compact object is a Kerr black hole (BH), its quadrupole moment is expressible solely in terms of its mass and spin. Otherwise, the quadrupole moment can depend on additional parameters (such as the equation of state of the object). The higher order spin effects in phase and amplitude of a gravitational waveform, which explicitly contains the spin-induced quadrupole moments of compact objects, hence, uniquely encode the nature of the compact binary. Thus, we argue that an independent measurement of the spin-induced quadrupole moment of the compact binaries from GW observations can provide a unique way to distinguish binary BH systems from binaries consisting of exotic compact objects.

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

    NASA Astrophysics Data System (ADS)

    Zheng, Lianqing; Yang, Wei

    2008-07-01

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

  10. An Application of the Rasch Model to Computerized Adaptive Testing.

    ERIC Educational Resources Information Center

    Wisniewski, Dennis R.

    Three questions concerning the Binary Search Method (BSM) of computerized adaptive testing were studied: (1) whether it provided a reliable and valid estimation of examinee ability; (2) its effect on examinee attitudes toward computerized adaptive testing and conventional paper-and-pencil testing; and (3) the relationship between item response…

  11. Predicting cannabis abuse screening test (CAST) scores: a recursive partitioning analysis using survey data from Czech Republic, Italy, the Netherlands and Sweden.

    PubMed

    Blankers, Matthijs; Frijns, Tom; Belackova, Vendula; Rossi, Carla; Svensson, Bengt; Trautmann, Franz; van Laar, Margriet

    2014-01-01

    Cannabis is Europe's most commonly used illicit drug. Some users do not develop dependence or other problems, whereas others do. Many factors are associated with the occurrence of cannabis-related disorders. This makes it difficult to identify key risk factors and markers to profile at-risk cannabis users using traditional hypothesis-driven approaches. Therefore, the use of a data-mining technique called binary recursive partitioning is demonstrated in this study by creating a classification tree to profile at-risk users. 59 variables on cannabis use and drug market experiences were extracted from an internet-based survey dataset collected in four European countries (Czech Republic, Italy, Netherlands and Sweden), n = 2617. These 59 potential predictors of problematic cannabis use were used to partition individual respondents into subgroups with low and high risk of having a cannabis use disorder, based on their responses on the Cannabis Abuse Screening Test. Both a generic model for the four countries combined and four country-specific models were constructed. Of the 59 variables included in the first analysis step, only three variables were required to construct a generic partitioning model to classify high risk cannabis users with 65-73% accuracy. Based on the generic model for the four countries combined, the highest risk for cannabis use disorder is seen in participants reporting a cannabis use on more than 200 days in the last 12 months. In comparison to the generic model, the country-specific models led to modest, non-significant improvements in classification accuracy, with an exception for Italy (p = 0.01). Using recursive partitioning, it is feasible to construct classification trees based on only a few variables with acceptable performance to classify cannabis users into groups with low or high risk of meeting criteria for cannabis use disorder. The number of cannabis use days in the last 12 months is the most relevant variable. The identified

  12. Learning to play Go using recursive neural networks.

    PubMed

    Wu, Lin; Baldi, Pierre

    2008-11-01

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

  13. Adaptive variational mode decomposition method for signal processing based on mode characteristic

    NASA Astrophysics Data System (ADS)

    Lian, Jijian; Liu, Zhuo; Wang, Haijun; Dong, Xiaofeng

    2018-07-01

    Variational mode decomposition is a completely non-recursive decomposition model, where all the modes are extracted concurrently. However, the model requires a preset mode number, which limits the adaptability of the method since a large deviation in the number of mode set will cause the discard or mixing of the mode. Hence, a method called Adaptive Variational Mode Decomposition (AVMD) was proposed to automatically determine the mode number based on the characteristic of intrinsic mode function. The method was used to analyze the simulation signals and the measured signals in the hydropower plant. Comparisons have also been conducted to evaluate the performance by using VMD, EMD and EWT. It is indicated that the proposed method has strong adaptability and is robust to noise. It can determine the mode number appropriately without modulation even when the signal frequencies are relatively close.

  14. XAPiir: A recursive digital filtering package

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

    Harris, D.

    1990-09-21

    XAPiir is a basic recursive digital filtering package, containing both design and implementation subroutines. XAPiir was developed for the experimental array processor (XAP) software package, and is written in FORTRAN. However, it is intended to be incorporated into any general- or special-purpose signal analysis program. It replaces the older package RECFIL, offering several enhancements. RECFIL is used in several large analysis programs developed at LLNL, including the seismic analysis package SAC, several expert systems (NORSEA and NETSEA), and two general purpose signal analysis packages (SIG and VIEW). This report is divided into two sections: the first describes the use ofmore » the subroutine package, and the second, its internal organization. In the first section, the filter design problem is briefly reviewed, along with the definitions of the filter design parameters and their relationship to the subroutine input parameters. In the second section, the internal organization is documented to simplify maintenance and extensions to the package. 5 refs., 9 figs.« less

  15. Full Ionisation In Binary-Binary Encounters With Small Positive Energies

    NASA Astrophysics Data System (ADS)

    Sweatman, W. L.

    2006-08-01

    Interactions between binary stars and single stars and binary stars and other binary stars play a key role in the dynamics of a dense stellar system. Energy can be transferred between the internal dynamics of a binary and the larger scale dynamics of the interacting objects. Binaries can be destroyed and created by the interaction. In a binary-binary encounter, full ionisation occurs when both of the binary stars are destroyed in the interaction to create four single stars. This is only possible when the total energy of the system is positive. For very small energies the probability of this occurring is very low and it tends towards zero as the total energy tends towards zero. Here the case is considered for which all the stars have equal masses. An asymptotic power law is predicted relating the probability of full ionisation with the total energy when this latter quantity is small. The exponent, which is approximately 2.31, is compared with the results from numerical scattering experiments. The theoretical approach taken is similar to one used previously in the three-body problem. It makes use of the fact that the most dramatic changes in scale and energies of a few-body system occur when its components pass near to a central configuration. The position, and number, of these configurations is not known for the general four-body problem, however, with equal masses there are known to be exactly five different cases. Separate consideration and comparison of the properties of orbits close to each of these five central configurations enables the prediction of the form of the cross-section for full ionisation for the case of small positive total energy. This is the relation between total energy and the probability of total ionisation described above.

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

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

    PubMed Central

    Lim, Sangrak; Lee, Kyubum

    2018-01-01

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

  18. A Stochastic Total Least Squares Solution of Adaptive Filtering Problem

    PubMed Central

    Ahmad, Noor Atinah

    2014-01-01

    An efficient and computationally linear algorithm is derived for total least squares solution of adaptive filtering problem, when both input and output signals are contaminated by noise. The proposed total least mean squares (TLMS) algorithm is designed by recursively computing an optimal solution of adaptive TLS problem by minimizing instantaneous value of weighted cost function. Convergence analysis of the algorithm is given to show the global convergence of the proposed algorithm, provided that the stepsize parameter is appropriately chosen. The TLMS algorithm is computationally simpler than the other TLS algorithms and demonstrates a better performance as compared with the least mean square (LMS) and normalized least mean square (NLMS) algorithms. It provides minimum mean square deviation by exhibiting better convergence in misalignment for unknown system identification under noisy inputs. PMID:24688412

  19. Adaptive Environmental Source Localization and Tracking with Unknown Permittivity and Path Loss Coefficients †

    PubMed Central

    Fidan, Barış; Umay, Ilknur

    2015-01-01

    Accurate signal-source and signal-reflector target localization tasks via mobile sensory units and wireless sensor networks (WSNs), including those for environmental monitoring via sensory UAVs, require precise knowledge of specific signal propagation properties of the environment, which are permittivity and path loss coefficients for the electromagnetic signal case. Thus, accurate estimation of these coefficients has significant importance for the accuracy of location estimates. In this paper, we propose a geometric cooperative technique to instantaneously estimate such coefficients, with details provided for received signal strength (RSS) and time-of-flight (TOF)-based range sensors. The proposed technique is integrated to a recursive least squares (RLS)-based adaptive localization scheme and an adaptive motion control law, to construct adaptive target localization and adaptive target tracking algorithms, respectively, that are robust to uncertainties in aforementioned environmental signal propagation coefficients. The efficiency of the proposed adaptive localization and tracking techniques are both mathematically analysed and verified via simulation experiments. PMID:26690441

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

  1. Fast large-scale object retrieval with binary quantization

    NASA Astrophysics Data System (ADS)

    Zhou, Shifu; Zeng, Dan; Shen, Wei; Zhang, Zhijiang; Tian, Qi

    2015-11-01

    The objective of large-scale object retrieval systems is to search for images that contain the target object in an image database. Where state-of-the-art approaches rely on global image representations to conduct searches, we consider many boxes per image as candidates to search locally in a picture. In this paper, a feature quantization algorithm called binary quantization is proposed. In binary quantization, a scale-invariant feature transform (SIFT) feature is quantized into a descriptive and discriminative bit-vector, which allows itself to adapt to the classic inverted file structure for box indexing. The inverted file, which stores the bit-vector and box ID where the SIFT feature is located inside, is compact and can be loaded into the main memory for efficient box indexing. We evaluate our approach on available object retrieval datasets. Experimental results demonstrate that the proposed approach is fast and achieves excellent search quality. Therefore, the proposed approach is an improvement over state-of-the-art approaches for object retrieval.

  2. Multireader multicase reader studies with binary agreement data: simulation, analysis, validation, and sizing

    PubMed Central

    Chen, Weijie; Wunderlich, Adam; Petrick, Nicholas; Gallas, Brandon D.

    2014-01-01

    Abstract. We treat multireader multicase (MRMC) reader studies for which a reader’s diagnostic assessment is converted to binary agreement (1: agree with the truth state, 0: disagree with the truth state). We present a mathematical model for simulating binary MRMC data with a desired correlation structure across readers, cases, and two modalities, assuming the expected probability of agreement is equal for the two modalities (P1=P2). This model can be used to validate the coverage probabilities of 95% confidence intervals (of P1, P2, or P1−P2 when P1−P2=0), validate the type I error of a superiority hypothesis test, and size a noninferiority hypothesis test (which assumes P1=P2). To illustrate the utility of our simulation model, we adapt the Obuchowski–Rockette–Hillis (ORH) method for the analysis of MRMC binary agreement data. Moreover, we use our simulation model to validate the ORH method for binary data and to illustrate sizing in a noninferiority setting. Our software package is publicly available on the Google code project hosting site for use in simulation, analysis, validation, and sizing of MRMC reader studies with binary agreement data. PMID:26158051

  3. In-situ observation of switchable nanoscale topography for y-shaped binary brushes in fluids.

    PubMed

    Lin, Yen-Hsi; Teng, Jing; Zubarev, Eugene R; Shulha, Hennady; Tsukruk, Vladimir V

    2005-03-01

    Direct, in-fluid observation of the surface morphology and nanomechanical properties of the mixed brushes composed of Y-shaped binary molecules PS-PAA revealed nanoscale network-like surface topography formed by coexisting stretched soluble PAA arms and collapsed insoluble PS chains in water. Placement of Y-shaped brushes in different fluids resulted in dramatic reorganization ranging from soft repellent layer covered by swollen PS arms in toluene to an adhesive, mixed layer composed of coexisting swollen PAA and collapsed PS arms in water. These binary layers with the overall nanoscale thickness can serve as adaptive nanocoatings with stimuli-responsive properties.

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

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

  6. Recursive Algorithms for Real-Time Digital CR-RCn Pulse Shaping

    NASA Astrophysics Data System (ADS)

    Nakhostin, M.

    2011-10-01

    This paper reports on recursive algorithms for real-time implementation of CR-(RC)n filters in digital nuclear spectroscopy systems. The algorithms are derived by calculating the Z-transfer function of the filters for filter orders up to n=4 . The performances of the filters are compared with the performance of the conventional digital trapezoidal filter using a noise generator which separately generates pure series, 1/f and parallel noise. The results of our study enable one to select the optimum digital filter for different noise and rate conditions.

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

    PubMed

    Wang, Min; Wang, Cong

    2015-06-01

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

  8. A Precise Physical Orbit for the M-dwarf Binary Gliese 268

    NASA Astrophysics Data System (ADS)

    Barry, R. K.; Demory, B.-O.; Ségransan, D.; Forveille, T.; Danchi, W. C.; Di Folco, E.; Queloz, D.; Spooner, H. R.; Torres, G.; Traub, W. A.; Delfosse, X.; Mayor, M.; Perrier, C.; Udry, S.

    2012-11-01

    We report high-precision interferometric and radial velocity (RV) observations of the M-dwarf binary Gl 268. Combining measurements conducted using the IOTA interferometer and the ELODIE and Harvard Center for Astrophysics RV instruments leads to a mass of 0.22596 ± 0.00084 M ⊙ for component A and 0.19230 ± 0.00071 M ⊙ for component B. The system parallax as determined by these observations is 0.1560 ± 0.0030 arcsec—a measurement with 1.9% uncertainty in excellent agreement with Hipparcos (0.1572 ± 0.0033). The absolute H-band magnitudes of the component stars are not well constrained by these measurements; however, we can place an approximate upper limit of 7.95 and 8.1 for Gl 268A and B, respectively. We test these physical parameters against the predictions of theoretical models that combine stellar evolution with high fidelity, non-gray atmospheric models. Measured and predicted values are compatible within 2σ. These results are among the most precise masses measured for visual binaries and compete with the best adaptive optics and eclipsing binary results.

  9. Binary Sources and Binary Lenses in Microlensing Surveys of MACHOs

    NASA Astrophysics Data System (ADS)

    Petrovic, N.; Di Stefano, R.; Perna, R.

    2003-12-01

    Microlensing is an intriguing phenomenon which may yield information about the nature of dark matter. Early observational searches identified hundreds of microlensing light curves. The data set consisted mainly of point-lens light curves and binary-lens events in which the light curves exhibit caustic crossings. Very few mildly perturbed light curves were observed, although this latter type should constitute the majority of binary lens light curves. Di Stefano (2001) has suggested that the failure to take binary effects into account may have influenced the estimates of optical depth derived from microlensing surveys. The work we report on here is the first step in a systematic analysis of binary lenses and binary sources and their impact on the results of statistical microlensing surveys. In order to asses the problem, we ran Monte-Carlo simulations of various microlensing events involving binary stars (both as the source and as the lens). For each event with peak magnification > 1.34, we sampled the characteristic light curve and recorded the chi squared value when fitting the curve with a point lens model; we used this to asses the perturbation rate. We also recorded the parameters of each system, the maximum magnification, the times at which each light curve started and ended and the number of caustic crossings. We found that both the binarity of sources and the binarity of lenses increased the lensing rate. While the binarity of sources had a negligible effect on the perturbation rates of the light curves, the binarity of lenses had a notable effect. The combination of binary sources and binary lenses produces an observable rate of interesting events exhibiting multiple "repeats" in which the magnification rises above and dips below 1.34 several times. Finally, the binarity of lenses impacted both the durations of the events and the maximum magnifications. This work was supported in part by the SAO intern program (NSF grant AST-9731923) and NASA contracts NAS8

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

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

  12. Automatic target detection using binary template matching

    NASA Astrophysics Data System (ADS)

    Jun, Dong-San; Sun, Sun-Gu; Park, HyunWook

    2005-03-01

    This paper presents a new automatic target detection (ATD) algorithm to detect targets such as battle tanks and armored personal carriers in ground-to-ground scenarios. Whereas most ATD algorithms were developed for forward-looking infrared (FLIR) images, we have developed an ATD algorithm for charge-coupled device (CCD) images, which have superior quality to FLIR images in daylight. The proposed algorithm uses fast binary template matching with an adaptive binarization, which is robust to various light conditions in CCD images and saves computation time. Experimental results show that the proposed method has good detection performance.

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

  14. Adaptive h -refinement for reduced-order models: ADAPTIVE h -refinement for reduced-order models

    DOE PAGES

    Carlberg, Kevin T.

    2014-11-05

    Our work presents a method to adaptively refine reduced-order models a posteriori without requiring additional full-order-model solves. The technique is analogous to mesh-adaptive h-refinement: it enriches the reduced-basis space online by ‘splitting’ a given basis vector into several vectors with disjoint support. The splitting scheme is defined by a tree structure constructed offline via recursive k-means clustering of the state variables using snapshot data. This method identifies the vectors to split online using a dual-weighted-residual approach that aims to reduce error in an output quantity of interest. The resulting method generates a hierarchy of subspaces online without requiring large-scale operationsmore » or full-order-model solves. Furthermore, it enables the reduced-order model to satisfy any prescribed error tolerance regardless of its original fidelity, as a completely refined reduced-order model is mathematically equivalent to the original full-order model. Experiments on a parameterized inviscid Burgers equation highlight the ability of the method to capture phenomena (e.g., moving shocks) not contained in the span of the original reduced basis.« less

  15. Interference and Shaping in Sensorimotor Adaptations with Rewards

    PubMed Central

    Darshan, Ran; Leblois, Arthur; Hansel, David

    2014-01-01

    When a perturbation is applied in a sensorimotor transformation task, subjects can adapt and maintain performance by either relying on sensory feedback, or, in the absence of such feedback, on information provided by rewards. For example, in a classical rotation task where movement endpoints must be rotated to reach a fixed target, human subjects can successfully adapt their reaching movements solely on the basis of binary rewards, although this proves much more difficult than with visual feedback. Here, we investigate such a reward-driven sensorimotor adaptation process in a minimal computational model of the task. The key assumption of the model is that synaptic plasticity is gated by the reward. We study how the learning dynamics depend on the target size, the movement variability, the rotation angle and the number of targets. We show that when the movement is perturbed for multiple targets, the adaptation process for the different targets can interfere destructively or constructively depending on the similarities between the sensory stimuli (the targets) and the overlap in their neuronal representations. Destructive interferences can result in a drastic slowdown of the adaptation. As a result of interference, the time to adapt varies non-linearly with the number of targets. Our analysis shows that these interferences are weaker if the reward varies smoothly with the subject's performance instead of being binary. We demonstrate how shaping the reward or shaping the task can accelerate the adaptation dramatically by reducing the destructive interferences. We argue that experimentally investigating the dynamics of reward-driven sensorimotor adaptation for more than one sensory stimulus can shed light on the underlying learning rules. PMID:24415925

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

  17. Phase Response Design of Recursive All-Pass Digital Filters Using a Modified PSO Algorithm

    PubMed Central

    2015-01-01

    This paper develops a new design scheme for the phase response of an all-pass recursive digital filter. A variant of particle swarm optimization (PSO) algorithm will be utilized for solving this kind of filter design problem. It is here called the modified PSO (MPSO) algorithm in which another adjusting factor is more introduced in the velocity updating formula of the algorithm in order to improve the searching ability. In the proposed method, all of the designed filter coefficients are firstly collected to be a parameter vector and this vector is regarded as a particle of the algorithm. The MPSO with a modified velocity formula will force all particles into moving toward the optimal or near optimal solution by minimizing some defined objective function of the optimization problem. To show the effectiveness of the proposed method, two different kinds of linear phase response design examples are illustrated and the general PSO algorithm is compared as well. The obtained results show that the MPSO is superior to the general PSO for the phase response design of digital recursive all-pass filter. PMID:26366168

  18. Recursive partitioned inversion of large (1500 x 1500) symmetric matrices

    NASA Technical Reports Server (NTRS)

    Putney, B. H.; Brownd, J. E.; Gomez, R. A.

    1976-01-01

    A recursive algorithm was designed to invert large, dense, symmetric, positive definite matrices using small amounts of computer core, i.e., a small fraction of the core needed to store the complete matrix. The described algorithm is a generalized Gaussian elimination technique. Other algorithms are also discussed for the Cholesky decomposition and step inversion techniques. The purpose of the inversion algorithm is to solve large linear systems of normal equations generated by working geodetic problems. The algorithm was incorporated into a computer program called SOLVE. In the past the SOLVE program has been used in obtaining solutions published as the Goddard earth models.

  19. A neural net based architecture for the segmentation of mixed gray-level and binary pictures

    NASA Technical Reports Server (NTRS)

    Tabatabai, Ali; Troudet, Terry P.

    1991-01-01

    A neural-net-based architecture is proposed to perform segmentation in real time for mixed gray-level and binary pictures. In this approach, the composite picture is divided into 16 x 16 pixel blocks, which are identified as character blocks or image blocks on the basis of a dichotomy measure computed by an adaptive 16 x 16 neural net. For compression purposes, each image block is further divided into 4 x 4 subblocks; a one-bit nonparametric quantizer is used to encode 16 x 16 character and 4 x 4 image blocks; and the binary map and quantizer levels are obtained through a neural net segmentor over each block. The efficiency of the neural segmentation in terms of computational speed, data compression, and quality of the compressed picture is demonstrated. The effect of weight quantization is also discussed. VLSI implementations of such adaptive neural nets in CMOS technology are described and simulated in real time for a maximum block size of 256 pixels.

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

  1. Binary-disk interaction. II. Gap-opening criteria for unequal-mass binaries

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

    Del Valle, Luciano; Escala, Andrés, E-mail: ldelvalleb@gmail.com

    We study the interaction of an unequal-mass binary with an isothermal circumbinary disk, motivated by the theoretical and observational evidence that after a major merger of gas-rich galaxies, a massive gaseous disk with a supermassive black hole binary will be formed in the nuclear region. We focus on the gravitational torques that the binary exerts on the disk and how these torques can drive the formation of a gap in the disk. This exchange of angular momentum between the binary and the disk is mainly driven by the gravitational interaction between the binary and a strong nonaxisymmetric density perturbation thatmore » is produced in the disk, in response to the presence of the binary. Using smoothed particle hydrodynamics numerical simulations, we test two gap-opening criteria, one that assumes the geometry of the density perturbation is an ellipsoid/thick spiral and another that assumes a flat spiral geometry for the density perturbation. We find that the flat spiral gap-opening criterion successfully predicts which simulations will have a gap in the disk and which will not. We also study the limiting cases predicted by the gap-opening criteria. Since the viscosity in our simulations is considerably smaller than the expected value in the nuclear regions of gas-rich merging galaxies, we conclude that in such environments the formation of a circumbinary gap is unlikely.« less

  2. Multitarget mixture reduction algorithm with incorporated target existence recursions

    NASA Astrophysics Data System (ADS)

    Ristic, Branko; Arulampalam, Sanjeev

    2000-07-01

    The paper derives a deferred logic data association algorithm based on the mixture reduction approach originally due to Salmond [SPIE vol.1305, 1990]. The novelty of the proposed algorithm provides the recursive formulae for both data association and target existence (confidence) estimation, thus allowing automatic track initiation and termination. T he track initiation performance of the proposed filter is investigated by computer simulations. It is observed that at moderately high levels of clutter density the proposed filter initiates tracks more reliably than its corresponding PDA filter. An extension of the proposed filter to the multi-target case is also presented. In addition, the paper compares the track maintenance performance of the MR algorithm with an MHT implementation.

  3. Fuzzy Adaptive Decentralized Optimal Control for Strict Feedback Nonlinear Large-Scale Systems.

    PubMed

    Sun, Kangkang; Sui, Shuai; Tong, Shaocheng

    2018-04-01

    This paper considers the optimal decentralized fuzzy adaptive control design problem for a class of interconnected large-scale nonlinear systems in strict feedback form and with unknown nonlinear functions. The fuzzy logic systems are introduced to learn the unknown dynamics and cost functions, respectively, and a state estimator is developed. By applying the state estimator and the backstepping recursive design algorithm, a decentralized feedforward controller is established. By using the backstepping decentralized feedforward control scheme, the considered interconnected large-scale nonlinear system in strict feedback form is changed into an equivalent affine large-scale nonlinear system. Subsequently, an optimal decentralized fuzzy adaptive control scheme is constructed. The whole optimal decentralized fuzzy adaptive controller is composed of a decentralized feedforward control and an optimal decentralized control. It is proved that the developed optimal decentralized controller can ensure that all the variables of the control system are uniformly ultimately bounded, and the cost functions are the smallest. Two simulation examples are provided to illustrate the validity of the developed optimal decentralized fuzzy adaptive control scheme.

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

    NASA Astrophysics Data System (ADS)

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

    2011-01-01

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

  5. Commission 42: Close Binary Stars

    NASA Astrophysics Data System (ADS)

    Rucinski, Slavek M.; Ribas, Ignasi; Giménez, Alvaro; Harmanec, Petr; Hilditch, Ronald W.; Kaluzny, Janusz; Niarchos, Panayiotis; Nordström, Birgitta; Oláh, Katalin; Richards, Mercedes T.; Scarfe, Colin D.; Sion, Edward M.; Torres, Guillermo; Vrielmann, Sonja

    Two meetings of interest to close binaries took place during the reporting period: A full day session on short-period binary stars mostly CV's (Milone et al. 2008) during the 2006 AAS Spring meeting in Calgary and the very broadly designed IAU Symposium No. 240 on Binary Stars as Critical Tools and Tests in Contemporary Astrophysics in Prague, 2006, with many papers on close binaries [Hartkopf et al. 2007]. In addition, the book by Eggleton (2006), which is a comprehensive summary of evolutionary processes in binary and multiple stars, was published.

  6. The fate of close encounters between binary stars and binary supermassive black holes

    NASA Astrophysics Data System (ADS)

    Wang, Yi-Han; Leigh, Nathan; Yuan, Ye-Fei; Perna, Rosalba

    2018-04-01

    The evolution of main-sequence binaries that reside in the Galactic Centre can be heavily influenced by the central supermassive black hole (SMBH). Due to these perturbative effects, the stellar binaries in dense environments are likely to experience mergers, collisions, or ejections through secular and/or non-secular interactions. More direct interactions with the central SMBH are thought to produce hypervelocity stars (HVSs) and tidal disruption events (TDEs). In this paper, we use N-body simulations to study the dynamics of stellar binaries orbiting a central SMBH primary with an outer SMBH secondary orbiting this inner triple. The effects of the secondary SMBH on the event rates of HVSs, TDEs, and stellar mergers are investigated, as a function of the SMBH-SMBH binary mass ratio. Our numerical experiments reveal that, relative to the isolated SMBH case, the TDE and HVS rates are enhanced for, respectively, the smallest and largest mass ratio SMBH-SMBH binaries. This suggests that the observed event rates of TDEs and HVSs have the potential to serve as a diagnostic of the mass ratio of a central SMBH-SMBH binary. The presence of a secondary SMBH also allows for the creation of hypervelocity binaries. Observations of these systems could thus constrain the presence of a secondary SMBH in the Galactic Centre.

  7. Recursive stochastic effects in valley hybrid inflation

    NASA Astrophysics Data System (ADS)

    Levasseur, Laurence Perreault; Vennin, Vincent; Brandenberger, Robert

    2013-10-01

    Hybrid inflation is a two-field model where inflation ends because of a tachyonic instability, the duration of which is determined by stochastic effects and has important observational implications. Making use of the recursive approach to the stochastic formalism presented in [L. P. Levasseur, preceding article, Phys. Rev. D 88, 083537 (2013)], these effects are consistently computed. Through an analysis of backreaction, this method is shown to converge in the valley but points toward an (expected) instability in the waterfall. It is further shown that the quasistationarity of the auxiliary field distribution breaks down in the case of a short-lived waterfall. We find that the typical dispersion of the waterfall field at the critical point is then diminished, thus increasing the duration of the waterfall phase and jeopardizing the possibility of a short transition. Finally, we find that stochastic effects worsen the blue tilt of the curvature perturbations by an O(1) factor when compared with the usual slow-roll contribution.

  8. High accuracy binary black hole simulations with an extended wave zone

    NASA Astrophysics Data System (ADS)

    Pollney, Denis; Reisswig, Christian; Schnetter, Erik; Dorband, Nils; Diener, Peter

    2011-02-01

    We present results from a new code for binary black hole evolutions using the moving-puncture approach, implementing finite differences in generalized coordinates, and allowing the spacetime to be covered with multiple communicating nonsingular coordinate patches. Here we consider a regular Cartesian near-zone, with adapted spherical grids covering the wave zone. The efficiencies resulting from the use of adapted coordinates allow us to maintain sufficient grid resolution to an artificial outer boundary location which is causally disconnected from the measurement. For the well-studied test case of the inspiral of an equal-mass nonspinning binary (evolved for more than 8 orbits before merger), we determine the phase and amplitude to numerical accuracies better than 0.010% and 0.090% during inspiral, respectively, and 0.003% and 0.153% during merger. The waveforms, including the resolved higher harmonics, are convergent and can be consistently extrapolated to r→∞ throughout the simulation, including the merger and ringdown. Ringdown frequencies for these modes (to (ℓ,m)=(6,6)) match perturbative calculations to within 0.01%, providing a strong confirmation that the remnant settles to a Kerr black hole with irreducible mass Mirr=0.884355±20×10-6 and spin Sf/Mf2=0.686923±10×10-6.

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

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

  11. A proposed study of multiple scattering through clouds up to 1 THz

    NASA Technical Reports Server (NTRS)

    Gerace, G. C.; Smith, E. K.

    1992-01-01

    A rigorous computation of the electromagnetic field scattered from an atmospheric liquid water cloud is proposed. The recent development of a fast recursive algorithm (Chew algorithm) for computing the fields scattered from numerous scatterers now makes a rigorous computation feasible. A method is presented for adapting this algorithm to a general case where there are an extremely large number of scatterers. It is also proposed to extend a new binary PAM channel coding technique (El-Khamy coding) to multiple levels with non-square pulse shapes. The Chew algorithm can be used to compute the transfer function of a cloud channel. Then the transfer function can be used to design an optimum El-Khamy code. In principle, these concepts can be applied directly to the realistic case of a time-varying cloud (adaptive channel coding and adaptive equalization). A brief review is included of some preliminary work on cloud dispersive effects on digital communication signals and on cloud liquid water spectra and correlations.

  12. A Precise Physical Orbit For The M-Dwarf Binary Gliese 268

    NASA Technical Reports Server (NTRS)

    Barry, R. K.; Demory, B. -O.; Segransan, D.; Forveille, T.; Danchi, W. C.; Di Folco, E.; Queloz, D.; Spooner, H. R.; Torres, G.; Traub, W. A.; hide

    2012-01-01

    We report high-precision interferometric and radial velocity (RV) observations of the M-dwarf binary Gl 268. Combining measurements conducted using the IOTA interferometer and the ELODIE and Harvard Center for Astrophysics RV instruments leads to a mass of 0.22596 plus-minus 0.00084 Mass compared to the sun for component A and 0.19230 plus-minus 0.00071 Mass compared to the sun for component B. The system parallax as determined by these observations is 0.1560 plus-minus 0.0030 arcsec - a measurement with 1.9% uncertainty in excellent agreement with Hipparcos (0.1572 plus-minus 0.0033). The absolute H-band magnitudes of the component stars are not well constrained by these measurements; however, we can place an approximate upper limit of 7.95 and 8.1 for Gl 268A and B, respectively.We test these physical parameters against the predictions of theoretical models that combine stellar evolution with high fidelity, non-gray atmospheric models. Measured and predicted values are compatible within 2sigma. These results are among the most precise masses measured for visual binaries and compete with the best adaptive optics and eclipsing binary results.

  13. Binary YORP Effect and Evolution of Binary Asteroids

    NASA Astrophysics Data System (ADS)

    Steinberg, Elad; Sari, Re'em

    2011-02-01

    The rotation states of kilometer-sized near-Earth asteroids are known to be affected by the Yarkevsky O'Keefe-Radzievskii-Paddack (YORP) effect. In a related effect, binary YORP (BYORP), the orbital properties of a binary asteroid evolve under a radiation effect mostly acting on a tidally locked secondary. The BYORP effect can alter the orbital elements over ~104-105 years for a Dp = 2 km primary with a Ds = 0.4 km secondary at 1 AU. It can either separate the binary components or cause them to collide. In this paper, we devise a simple approach to calculate the YORP effect on asteroids and the BYORP effect on binaries including J 2 effects due to primary oblateness and the Sun. We apply this to asteroids with known shapes as well as a set of randomly generated bodies with various degrees of smoothness. We find a strong correlation between the strengths of an asteroid's YORP and BYORP effects. Therefore, statistical knowledge of one could be used to estimate the effect of the other. We show that the action of BYORP preferentially shrinks rather than expands the binary orbit and that YORP preferentially slows down asteroids. This conclusion holds for the two extremes of thermal conductivities studied in this work and the assumption that the asteroid reaches a stable point, but may break down for moderate thermal conductivity. The YORP and BYORP effects are shown to be smaller than could be naively expected due to near cancellation of the effects at small scales. Taking this near cancellation into account, a simple order-of-magnitude estimate of the YORP and BYORP effects as a function of the sizes and smoothness of the bodies is calculated. Finally, we provide a simple proof showing that there is no secular effect due to absorption of radiation in BYORP.

  14. New spectroscopic binary companions of giant stars and updated metallicity distribution for binary systems

    NASA Astrophysics Data System (ADS)

    Bluhm, P.; Jones, M. I.; Vanzi, L.; Soto, M. G.; Vos, J.; Wittenmyer, R. A.; Drass, H.; Jenkins, J. S.; Olivares, F.; Mennickent, R. E.; Vučković, M.; Rojo, P.; Melo, C. H. F.

    2016-10-01

    We report the discovery of 24 spectroscopic binary companions to giant stars. We fully constrain the orbital solution for 6 of these systems. We cannot unambiguously derive the orbital elements for the remaining stars because the phase coverage is incomplete. Of these stars, 6 present radial velocity trends that are compatible with long-period brown dwarf companions. The orbital solutions of the 24 binary systems indicate that these giant binary systems have a wide range in orbital periods, eccentricities, and companion masses. For the binaries with restricted orbital solutions, we find a range of orbital periods of between ~97-1600 days and eccentricities of between ~0.1-0.4. In addition, we studied the metallicity distribution of single and binary giant stars. We computed the metallicity of a total of 395 evolved stars, 59 of wich are in binary systems. We find a flat distribution for these binary stars and therefore conclude that stellar binary systems, and potentially brown dwarfs, have a different formation mechanism than planets. This result is confirmed by recent works showing that extrasolar planets orbiting giants are more frequent around metal-rich stars. Finally, we investigate the eccentricity as a function of the orbital period. We analyzed a total of 130 spectroscopic binaries, including those presented here and systems from the literature. We find that most of the binary stars with periods ≲30 days have circular orbits, while at longer orbital periods we observe a wide spread in their eccentricities. Based on observations collected at La Silla - Paranal Observatory under programs IDs IDs 085.C-0557, 087.C.0476, 089.C-0524, 090.C-0345, 096.A-9020 and through the Chilean Telescope Time under programs IDs CN2012A-73, CN2012B-47, CN2013A-111, CN2013B-51, CN2014A-52 and CN2015A-48.

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

    PubMed

    Niu, Ben; Li, Lu

    2018-06-01

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

  16. Heber Binary Project. Binary Cycle Geothermal Demonstration Power Plant (RP1900-1)

    NASA Astrophysics Data System (ADS)

    Lacy, R. G.; Nelson, T. T.

    1982-12-01

    The Heber Binary Project (1) demonstrates the potential of moderate temperature (below 410 F) geothermal energy to produce economic electric power with binary cycle conversion technology; (2) allows the scaling up and evaluation of the performance of binary cycle technology in geothermal service; (3) establishes schedule, cost and equipment performance, reservoir performance, and the environmental acceptability of such plants; and (4) resolves uncertainties associated with the reservoir performance, plant operation, and economics.

  17. New Results on Contact Binary Stars

    NASA Astrophysics Data System (ADS)

    He, J.; Qian, S.; Zhu, L.; Liu, L.; Liao, W.

    2014-08-01

    Contact binary star is a kind of close binary with the strongest interaction binary system. Their formations and evolutions are unsolved problems in astrophysics. Since 2000, our groups have observed and studied more than half a hundred of contact binaries. In this report, I will summarize our new results of some contact binary stars (e.g. UZ CMi, GSC 03526-01995, FU Dra, GSC 0763-0572, V524 Mon, MR Com, etc.). They are as follow: (1) We discovered that V524 Mon and MR Com are shallow-contact binaries with their period decreasing; (2) GSC 03526-01995 is middle-contact binary without a period increasing or decreasing continuously; (3) UZ CMi, GSC 0763-0572 and FU Dra are middle-contact binaries with the period increasing continuously; (4) UZ CMi, GSC 03526-01995, FU Dra and V524 Mon show period oscillation which may imply the presence of additional components in these contact binaries.

  18. The Tarantula Massive Binary Monitoring. I. Observational campaign and OB-type spectroscopic binaries

    NASA Astrophysics Data System (ADS)

    Almeida, L. A.; Sana, H.; Taylor, W.; Barbá, R.; Bonanos, A. Z.; Crowther, P.; Damineli, A.; de Koter, A.; de Mink, S. E.; Evans, C. J.; Gieles, M.; Grin, N. J.; Hénault-Brunet, V.; Langer, N.; Lennon, D.; Lockwood, S.; Maíz Apellániz, J.; Moffat, A. F. J.; Neijssel, C.; Norman, C.; Ramírez-Agudelo, O. H.; Richardson, N. D.; Schootemeijer, A.; Shenar, T.; Soszyński, I.; Tramper, F.; Vink, J. S.

    2017-02-01

    Context. Massive binaries play a crucial role in the Universe. Knowing the distributions of their orbital parameters is important for a wide range of topics from stellar feedback to binary evolution channels and from the distribution of supernova types to gravitational wave progenitors, yet no direct measurements exist outside the Milky Way. Aims: The Tarantula Massive Binary Monitoring project was designed to help fill this gap by obtaining multi-epoch radial velocity (RV) monitoring of 102 massive binaries in the 30 Doradus region. Methods: In this paper we analyze 32 FLAMES/GIRAFFE observations of 93 O- and 7 B-type binaries. We performed a Fourier analysis and obtained orbital solutions for 82 systems: 51 single-lined (SB1) and 31 double-lined (SB2) spectroscopic binaries. Results: Overall, the binary fraction and orbital properties across the 30 Doradus region are found to be similar to existing Galactic samples. This indicates that within these domains environmental effects are of second order in shaping the properties of massive binary systems. A small difference is found in the distribution of orbital periods, which is slightly flatter (in log space) in 30 Doradus than in the Galaxy, although this may be compatible within error estimates and differences in the fitting methodology. Also, orbital periods in 30 Doradus can be as short as 1.1 d, somewhat shorter than seen in Galactic samples. Equal mass binaries (q> 0.95) in 30 Doradus are all found outside NGC 2070, the central association that surrounds R136a, the very young and massive cluster at 30 Doradus's core. Most of the differences, albeit small, are compatible with expectations from binary evolution. One outstanding exception, however, is the fact that earlier spectral types (O2-O7) tend to have shorter orbital periods than later spectral types (O9.2-O9.7). Conclusions: Our results point to a relative universality of the incidence rate of massive binaries and their orbital properties in the

  19. EPIC 219217635: A Doubly Eclipsing Quadruple System Containing an Evolved Binary

    NASA Astrophysics Data System (ADS)

    Borkovits, T.; Albrecht, S.; Rappaport, S.; Nelson, L.; Vanderburg, A.; Gary, B. L.; Tan, T. G.; Justesen, A. B.; Kristiansen, M. H.; Jacobs, T. L.; LaCourse, D.; Ngo, H.; Wallack, N.; Ruane, G.; Mawet, D.; Howell, S. B.; Tronsgaard, R.

    2018-05-01

    We have discovered a doubly eclipsing, bound, quadruple star system in the field of K2 Campaign 7. EPIC 219217635 is a stellar image with Kp = 12.7 that contains an eclipsing binary (`EB') with PA = 3.59470 d and a second EB with PB = 0.61825 d. We have obtained followup radial-velocity (`RV') spectroscopy observations, adaptive optics imaging, as well as ground-based photometric observations. From our analysis of all the observations, we derive good estimates for a number of the system parameters. We conclude that (1) both binaries are bound in a quadruple star system; (2) a linear trend to the RV curve of binary A is found over a 2-year interval, corresponding to an acceleration, \\dot{γ }= 0.0024 ± 0.0007 cm s-2; (3) small irregular variations are seen in the eclipse-timing variations (`ETVs') detected over the same interval; (4) the orbital separation of the quadruple system is probably in the range of 8-25 AU; and (5) the orbital planes of the two binaries must be inclined with respect to each other by at least 25°. In addition, we find that binary B is evolved, and the cooler and currently less massive star has transferred much of its envelope to the currently more massive star. We have also demonstrated that the system is sufficiently bright that the eclipses can be followed using small ground-based telescopes, and that this system may be profitably studied over the next decade when the outer orbit of the quadruple is expected to manifest itself in the ETV and/or RV curves.

  20. Recursive model for the fragmentation of polarized quarks

    NASA Astrophysics Data System (ADS)

    Kerbizi, A.; Artru, X.; Belghobsi, Z.; Bradamante, F.; Martin, A.

    2018-04-01

    We present a model for Monte Carlo simulation of the fragmentation of a polarized quark. The model is based on string dynamics and the 3P0 mechanism of quark pair creation at string breaking. The fragmentation is treated as a recursive process, where the splitting function of the subprocess q →h +q' depends on the spin density matrix of the quark q . The 3P0 mechanism is parametrized by a complex mass parameter μ , the imaginary part of which is responsible for single spin asymmetries. The model has been implemented in a Monte Carlo program to simulate jets made of pseudoscalar mesons. Results for single hadron and hadron pair transverse-spin asymmetries are found to be in agreement with experimental data from SIDIS and e+e- annihilation. The model predictions on the jet-handedness are also discussed.

  1. Stream Kriging: Incremental and recursive ordinary Kriging over spatiotemporal data streams

    NASA Astrophysics Data System (ADS)

    Zhong, Xu; Kealy, Allison; Duckham, Matt

    2016-05-01

    Ordinary Kriging is widely used for geospatial interpolation and estimation. Due to the O (n3) time complexity of solving the system of linear equations, ordinary Kriging for a large set of source points is computationally intensive. Conducting real-time Kriging interpolation over continuously varying spatiotemporal data streams can therefore be especially challenging. This paper develops and tests two new strategies for improving the performance of an ordinary Kriging interpolator adapted to a stream-processing environment. These strategies rely on the expectation that, over time, source data points will frequently refer to the same spatial locations (for example, where static sensor nodes are generating repeated observations of a dynamic field). First, an incremental strategy improves efficiency in cases where a relatively small proportion of previously processed spatial locations are absent from the source points at any given iteration. Second, a recursive strategy improves efficiency in cases where there is substantial set overlap between the sets of spatial locations of source points at the current and previous iterations. These two strategies are evaluated in terms of their computational efficiency in comparison to ordinary Kriging algorithm. The results show that these two strategies can reduce the time taken to perform the interpolation by up to 90%, and approach average-case time complexity of O (n2) when most but not all source points refer to the same locations over time. By combining the approaches developed in this paper with existing heuristic ordinary Kriging algorithms, the conclusions indicate how further efficiency gains could potentially be accrued. The work ultimately contributes to the development of online ordinary Kriging interpolation algorithms, capable of real-time spatial interpolation with large streaming data sets.

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

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

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

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

  6. Binary optics: Trends and limitations

    NASA Technical Reports Server (NTRS)

    Farn, Michael W.; Veldkamp, Wilfrid B.

    1993-01-01

    We describe the current state of binary optics, addressing both the technology and the industry (i.e., marketplace). With respect to the technology, the two dominant aspects are optical design methods and fabrication capabilities, with the optical design problem being limited by human innovation in the search for new applications and the fabrication issue being limited by the availability of resources required to improve fabrication capabilities. With respect to the industry, the current marketplace does not favor binary optics as a separate product line and so we expect that companies whose primary purpose is the production of binary optics will not represent the bulk of binary optics production. Rather, binary optics' more natural role is as an enabling technology - a technology which will directly result in a competitive advantage in a company's other business areas - and so we expect that the majority of binary optics will be produced for internal use.

  7. Photometric binary stars in Praesepe and the search for globular cluster binaries

    NASA Technical Reports Server (NTRS)

    Bolte, Michael

    1991-01-01

    A radial velocity study of the stars which are located on a second sequence above the single-star zero-age main sequence at a given color in the color-magnitude diagram of the open cluster Praesepe, (NGC 2632) shows that 10, and possibly 11, of 17 are binary systems. Of the binary systems, five have full amplitudes for their velocity variations that are greater than 50 km/s. To the extent that they can be applied to globular clusters, these results suggests that (1) observations of 'second-sequence' stars in globular clusters would be an efficient way of finding main-sequence binary systems in globulars, and (2) current instrumentation on large telescopes is sufficient for establishing unambiguously the existence of main-sequence binary systems in nearby globular clusters.

  8. BINARY ASTROMETRIC MICROLENSING WITH GAIA

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

    Sajadian, Sedighe, E-mail: sajadian@ipm.ir; Department of Physics, Sharif University of Technology, P.O. Box 11155-9161, Tehran

    2015-04-15

    We investigate whether or not Gaia can specify the binary fractions of massive stellar populations in the Galactic disk through astrometric microlensing. Furthermore, we study whether or not some information about their mass distributions can be inferred via this method. In this regard, we simulate the binary astrometric microlensing events due to massive stellar populations according to the Gaia observing strategy by considering (i) stellar-mass black holes, (ii) neutron stars, (iii) white dwarfs, and (iv) main-sequence stars as microlenses. The Gaia efficiency for detecting the binary signatures in binary astrometric microlensing events is ∼10%–20%. By calculating the optical depth duemore » to the mentioned stellar populations, the numbers of the binary astrometric microlensing events being observed with Gaia with detectable binary signatures, for the binary fraction of about 0.1, are estimated to be 6, 11, 77, and 1316, respectively. Consequently, Gaia can potentially specify the binary fractions of these massive stellar populations. However, the binary fraction of black holes measured with this method has a large uncertainty owing to a low number of the estimated events. Knowing the binary fractions in massive stellar populations helps with studying the gravitational waves. Moreover, we investigate the number of massive microlenses for which Gaia specifies masses through astrometric microlensing of single lenses toward the Galactic bulge. The resulting efficiencies of measuring the mass of mentioned populations are 9.8%, 2.9%, 1.2%, and 0.8%, respectively. The numbers of their astrometric microlensing events being observed in the Gaia era in which the lens mass can be inferred with the relative error less than 0.5 toward the Galactic bulge are estimated as 45, 34, 76, and 786, respectively. Hence, Gaia potentially gives us some information about the mass distribution of these massive stellar populations.« less

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

  10. Exact Calculation of the Thermodynamics of Biomacromolecules on Cubic Recursive Lattice.

    NASA Astrophysics Data System (ADS)

    Huang, Ran

    The thermodynamics of biomacromolecules featured as foldable polymer with inner-linkage of hydrogen bonds, e. g. protein, RNA and DNA, play an impressive role in either physical, biological, and polymer sciences. By treating the foldable chains to be the two-tolerate self-avoiding trails (2T polymer), abstract lattice modeling of these complex polymer systems to approach their thermodynamics and subsequent bio-functional properties have been developed for decades. Among these works, the calculations modeled on Bethe and Husimi lattice have shown the excellence of being exactly solvable. Our project extended this effort into the 3D situation, i.e. the cubic recursive lattice. The preliminary exploration basically confirmed others' previous findings on the planar structure, that we have three phases in the grand-canonical phase diagram, with a 1st order transition between non-polymerized and polymer phases, and a 2nd order transition between two distinguishable polymer phases. However the hydrogen bond energy J, stacking energy ɛ, and chain rigidity energy H play more vigorous effects on the thermal behaviors, and this is hypothesized to be due to the larger number of possible configurations provided by the complicated 3D model. By the so far progress, the calculation of biomacromolecules may be applied onto more complex recursive lattices, such as the inhomogeneous lattice to describe the cross-dimensional situations, and beside the thermal properties of the 2T polymers, we may infer some interesting insights of the mysterious folding problem itself. National Natural Science Foundation of China.

  11. KEPLER ECLIPSING BINARIES WITH STELLAR COMPANIONS

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

    Gies, D. R.; Matson, R. A.; Guo, Z.

    2015-12-15

    Many short-period binary stars have distant orbiting companions that have played a role in driving the binary components into close separation. Indirect detection of a tertiary star is possible by measuring apparent changes in eclipse times of eclipsing binaries as the binary orbits the common center of mass. Here we present an analysis of the eclipse timings of 41 eclipsing binaries observed throughout the NASA Kepler mission of long duration and precise photometry. This subset of binaries is characterized by relatively deep and frequent eclipses of both stellar components. We present preliminary orbital elements for seven probable triple stars amongmore » this sample, and we discuss apparent period changes in seven additional eclipsing binaries that may be related to motion about a tertiary in a long period orbit. The results will be used in ongoing investigations of the spectra and light curves of these binaries for further evidence of the presence of third stars.« less

  12. Adaptive modeling, identification, and control of dynamic structural systems. I. Theory

    USGS Publications Warehouse

    Safak, Erdal

    1989-01-01

    A concise review of the theory of adaptive modeling, identification, and control of dynamic structural systems based on discrete-time recordings is presented. Adaptive methods have four major advantages over the classical methods: (1) Removal of the noise from the signal is done over the whole frequency band; (2) time-varying characteristics of systems can be tracked; (3) systems with unknown characteristics can be controlled; and (4) a small segment of the data is needed during the computations. Included in the paper are the discrete-time representation of single-input single-output (SISO) systems, models for SISO systems with noise, the concept of stochastic approximation, recursive prediction error method (RPEM) for system identification, and the adaptive control. Guidelines for model selection and model validation and the computational aspects of the method are also discussed in the paper. The present paper is the first of two companion papers. The theory given in the paper is limited to that which is necessary to follow the examples for applications in structural dynamics presented in the second paper.

  13. Hydrodynamical processes in coalescing binary stars

    NASA Astrophysics Data System (ADS)

    Lai, Dong

    1994-01-01

    Coalescing neutron star binaries are considered to be the most promising sources of gravitational waves that could be detected by the planned laser-interferometer LIGO/VIRGO detectors. Extracting gravity wave signals from noisy data requires accurate theoretical waveforms in the frequency range 10-1000 Hz end detailed understanding of the dynamics of the binary orbits. We investigate the quasi-equilibrium and dynamical tidal interactions in coalescing binary stars, with particular focus on binary neutron stars. We develop a new formalism to study the equilibrium and dynamics of fluid stars in binary systems. The stars are modeled as compressible ellipsoids, and satisfy polytropic equation of state. The hydrodynamic equations are reduced to a set of ordinary differential equations for the evolution of the principal axes and other global quantities. The equilibrium binary structure is determined by a set of algebraic equations. We consider both synchronized and nonsynchronized systems, obtaining the generalizations to compressible fluid of the classical results for the ellipsoidal binary configurations. Our method can be applied to a wide variety of astrophysical binary systems containing neutron stars, white dwarfs, main-sequence stars and planets. We find that both secular and dynamical instabilities can develop in close binaries. The quasi-static (secular) orbital evolution, as well as the dynamical evolution of binaries driven by viscous dissipation and gravitational radiation reaction are studied. The development of the dynamical instability accelerates the binary coalescence at small separation, leading to appreciable radial infall velocity near contact. We also study resonant excitations of g-mode oscillations in coalescing binary neutron stars. A resonance occurs when the frequency of the tidal driving force equals one of the intrinsic g-mode frequencies. Using realistic microscopic nuclear equations of state, we determine the g-modes in a cold neutron atar

  14. Real time damage detection using recursive principal components and time varying auto-regressive modeling

    NASA Astrophysics Data System (ADS)

    Krishnan, M.; Bhowmik, B.; Hazra, B.; Pakrashi, V.

    2018-02-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 Time Varying Auto-Regressive Modeling (TVAR) is proposed. In this method, the acceleration data is used to obtain recursive proper orthogonal components online using rank-one perturbation method, followed by TVAR modeling of the first transformed response, to detect the change in the dynamic behavior of the vibrating system from its pristine state to contiguous linear/non-linear-states that indicate damage. Most of the works available in the literature deal with algorithms that require windowing of the gathered data owing to their data-driven nature which renders them ineffective for online implementation. Algorithms focussed on mathematically consistent recursive techniques in a rigorous theoretical framework of structural damage detection is missing, which motivates the development of the present framework that is amenable for online implementation which could be utilized along with suite experimental and numerical investigations. 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. TVAR modeling on the principal component explaining maximum variance is utilized and the damage is identified by tracking the TVAR coefficients. This eliminates the need for offline post processing and facilitates online damage detection especially when applied to streaming data without requiring any baseline data. Numerical simulations performed on a 5-dof nonlinear system under white noise excitation and El Centro (also known as 1940 Imperial Valley earthquake) excitation, for different damage scenarios, demonstrate the robustness of the proposed algorithm. The method is further validated on results obtained from case studies involving

  15. A novel noncommutative KdV-type equation, its recursion operator, and solitons

    NASA Astrophysics Data System (ADS)

    Carillo, Sandra; Lo Schiavo, Mauro; Porten, Egmont; Schiebold, Cornelia

    2018-04-01

    A noncommutative KdV-type equation is introduced extending the Bäcklund chart in Carillo et al. [Symmetry Integrability Geom.: Methods Appl. 12, 087 (2016)]. This equation, called meta-mKdV here, is linked by Cole-Hopf transformations to the two noncommutative versions of the mKdV equations listed in Olver and Sokolov [Commun. Math. Phys. 193, 245 (1998), Theorem 3.6]. For this meta-mKdV, and its mirror counterpart, recursion operators, hierarchies, and an explicit solution class are derived.

  16. Coevolution of Binaries and Circumbinary Gaseous Disks

    NASA Astrophysics Data System (ADS)

    Fleming, David; Quinn, Thomas R.

    2018-04-01

    The recent discoveries of circumbinary planets by Kepler raise questions for contemporary planet formation models. Understanding how these planets form requires characterizing their formation environment, the circumbinary protoplanetary disk, and how the disk and binary interact. The central binary excites resonances in the surrounding protoplanetary disk that drive evolution in both the binary orbital elements and in the disk. To probe how these interactions impact both binary eccentricity and disk structure evolution, we ran N-body smooth particle hydrodynamics (SPH) simulations of gaseous protoplanetary disks surrounding binaries based on Kepler 38 for 10^4 binary orbital periods for several initial binary eccentricities. We find that nearly circular binaries weakly couple to the disk via a parametric instability and excite disk eccentricity growth. Eccentric binaries strongly couple to the disk causing eccentricity growth for both the disk and binary. Disks around sufficiently eccentric binaries strongly couple to the disk and develop an m = 1 spiral wave launched from the 1:3 eccentric outer Lindblad resonance (EOLR). This wave corresponds to an alignment of gas particle longitude of periastrons. We find that in all simulations, the binary semi-major axis decays due to dissipation from the viscous disk.

  17. An on-line equivalent system identification scheme for adaptive control. Ph.D. Thesis - Stanford Univ.

    NASA Technical Reports Server (NTRS)

    Sliwa, S. M.

    1984-01-01

    A prime obstacle to the widespread use of adaptive control is the degradation of performance and possible instability resulting from the presence of unmodeled dynamics. The approach taken is to explicitly include the unstructured model uncertainty in the output error identification algorithm. The order of the compensator is successively increased by including identified modes. During this model building stage, heuristic rules are used to test for convergence prior to designing compensators. Additionally, the recursive identification algorithm as extended to multi-input, multi-output systems. Enhancements were also made to reduce the computational burden of an algorithm for obtaining minimal state space realizations from the inexact, multivariate transfer functions which result from the identification process. A number of potential adaptive control applications for this approach are illustrated using computer simulations. Results indicated that when speed of adaptation and plant stability are not critical, the proposed schemes converge to enhance system performance.

  18. Binaries in globular clusters

    NASA Technical Reports Server (NTRS)

    Hut, Piet; Mcmillan, Steve; Goodman, Jeremy; Mateo, Mario; Phinney, E. S.; Pryor, Carlton; Richer, Harvey B.; Verbunt, Frank; Weinberg, Martin

    1992-01-01

    Recent observations have shown that globular clusters contain a substantial number of binaries most of which are believed to be primordial. We discuss different successful optical search techniques, based on radial-velocity variables, photometric variables, and the positions of stars in the color-magnitude diagram. In addition, we review searches in other wavelengths, which have turned up low-mass X-ray binaries and more recently a variety of radio pulsars. On the theoretical side, we give an overview of the different physical mechanisms through which individual binaries evolve. We discuss the various simulation techniques which recently have been employed to study the effects of a primordial binary population, and the fascinating interplay between stellar evolution and stellar dynamics which drives globular-cluster evolution.

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

  20. Spectral properties of binary asteroids

    NASA Astrophysics Data System (ADS)

    Pajuelo, Myriam; Birlan, Mirel; Carry, Benoît; DeMeo, Francesca E.; Binzel, Richard P.; Berthier, Jérôme

    2018-04-01

    We present the first attempt to characterize the distribution of taxonomic class among the population of binary asteroids (15% of all small asteroids). For that, an analysis of 0.8-2.5{μ m} near-infrared spectra obtained with the SpeX instrument on the NASA/IRTF is presented. Taxonomic class and meteorite analog is determined for each target, increasing the sample of binary asteroids with known taxonomy by 21%. Most binary systems are bound in the S-, X-, and C- classes, followed by Q and V-types. The rate of binary systems in each taxonomic class agrees within uncertainty with the background population of small near-Earth objects and inner main belt asteroids, but for the C-types which are under-represented among binaries.

  1. A 3D dynamical model of the colliding winds in binary systems

    NASA Astrophysics Data System (ADS)

    Parkin, E. R.; Pittard, J. M.

    2008-08-01

    We present a three-dimensional (3D) dynamical model of the orbital-induced curvature of the wind-wind collision region in binary star systems. Momentum balance equations are used to determine the position and shape of the contact discontinuity between the stars, while further downstream the gas is assumed to behave ballistically. An Archimedean spiral structure is formed by the motion of the stars, with clear resemblance to high-resolution images of the so-called `pinwheel nebulae'. A key advantage of this approach over grid or smoothed particle hydrodynamic models is its significantly reduced computational cost, while it also allows the study of the structure obtained in an eccentric orbit. The model is relevant to symbiotic systems and γ-ray binaries, as well as systems with O-type and Wolf-Rayet stars. As an example application, we simulate the X-ray emission from hypothetical O+O and WR+O star binaries, and describe a method of ray tracing through the 3D spiral structure to account for absorption by the circumstellar material in the system. Such calculations may be easily adapted to study observations at wavelengths ranging from the radio to γ-ray.

  2. An Adaptively-Refined, Cartesian, Cell-Based Scheme for the Euler and Navier-Stokes Equations. Ph.D. Thesis - Michigan Univ.

    NASA Technical Reports Server (NTRS)

    Coirier, William John

    1994-01-01

    A Cartesian, cell-based scheme for solving the Euler and Navier-Stokes equations in two dimensions is developed and tested. Grids about geometrically complicated bodies are generated automatically, by recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, polygonal 'cut' cells are created. The geometry of the cut cells is computed using polygon-clipping algorithms. The grid is stored in a binary-tree data structure which provides a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive refinement. The Euler and Navier-Stokes equations are solved on the resulting grids using a finite-volume formulation. The convective terms are upwinded, with a limited linear reconstruction of the primitive variables used to provide input states to an approximate Riemann solver for computing the fluxes between neighboring cells. A multi-stage time-stepping scheme is used to reach a steady-state solution. Validation of the Euler solver with benchmark numerical and exact solutions is presented. An assessment of the accuracy of the approach is made by uniform and adaptive grid refinements for a steady, transonic, exact solution to the Euler equations. The error of the approach is directly compared to a structured solver formulation. A non smooth flow is also assessed for grid convergence, comparing uniform and adaptively refined results. Several formulations of the viscous terms are assessed analytically, both for accuracy and positivity. The two best formulations are used to compute adaptively refined solutions of the Navier-Stokes equations. These solutions are compared to each other, to experimental results and/or theory for a series of low and moderate Reynolds numbers flow fields. The most suitable viscous discretization is demonstrated for geometrically-complicated internal flows. For flows at high Reynolds numbers, both an altered grid-generation procedure and a

  3. Characterization of binary string statistics for syntactic landmine detection

    NASA Astrophysics Data System (ADS)

    Nasif, Ahmed O.; Mark, Brian L.; Hintz, Kenneth J.

    2011-06-01

    Syntactic landmine detection has been proposed to detect and classify non-metallic landmines using ground penetrating radar (GPR). In this approach, the GPR return is processed to extract characteristic binary strings for landmine and clutter discrimination. In our previous work, we discussed the preprocessing methodology by which the amplitude information of the GPR A-scan signal can be effectively converted into binary strings, which identify the impedance discontinuities in the signal. In this work, we study the statistical properties of the binary string space. In particular, we develop a Markov chain model to characterize the observed bit sequence of the binary strings. The state is defined as the number of consecutive zeros between two ones in the binarized A-scans. Since the strings are highly sparse (the number of zeros is much greater than the number of ones), defining the state this way leads to fewer number of states compared to the case where each bit is defined as a state. The number of total states is further reduced by quantizing the number of consecutive zeros. In order to identify the correct order of the Markov model, the mean square difference (MSD) between the transition matrices of mine strings and non-mine strings is calculated up to order four using training data. The results show that order one or two maximizes this MSD. The specification of the transition probabilities of the chain can be used to compute the likelihood of any given string. Such a model can be used to identify characteristic landmine strings during the training phase. These developments on modeling and characterizing the string statistics can potentially be part of a real-time landmine detection algorithm that identifies landmine and clutter in an adaptive fashion.

  4. Development of Fast Algorithms Using Recursion, Nesting and Iterations for Computational Electromagnetics

    NASA Technical Reports Server (NTRS)

    Chew, W. C.; Song, J. M.; Lu, C. C.; Weedon, W. H.

    1995-01-01

    In the first phase of our work, we have concentrated on laying the foundation to develop fast algorithms, including the use of recursive structure like the recursive aggregate interaction matrix algorithm (RAIMA), the nested equivalence principle algorithm (NEPAL), the ray-propagation fast multipole algorithm (RPFMA), and the multi-level fast multipole algorithm (MLFMA). We have also investigated the use of curvilinear patches to build a basic method of moments code where these acceleration techniques can be used later. In the second phase, which is mainly reported on here, we have concentrated on implementing three-dimensional NEPAL on a massively parallel machine, the Connection Machine CM-5, and have been able to obtain some 3D scattering results. In order to understand the parallelization of codes on the Connection Machine, we have also studied the parallelization of 3D finite-difference time-domain (FDTD) code with PML material absorbing boundary condition (ABC). We found that simple algorithms like the FDTD with material ABC can be parallelized very well allowing us to solve within a minute a problem of over a million nodes. In addition, we have studied the use of the fast multipole method and the ray-propagation fast multipole algorithm to expedite matrix-vector multiplication in a conjugate-gradient solution to integral equations of scattering. We find that these methods are faster than LU decomposition for one incident angle, but are slower than LU decomposition when many incident angles are needed as in the monostatic RCS calculations.

  5. Block recursive LU preconditioners for the thermally coupled incompressible inductionless MHD problem

    NASA Astrophysics Data System (ADS)

    Badia, Santiago; Martín, Alberto F.; Planas, Ramon

    2014-10-01

    The thermally coupled incompressible inductionless magnetohydrodynamics (MHD) problem models the flow of an electrically charged fluid under the influence of an external electromagnetic field with thermal coupling. This system of partial differential equations is strongly coupled and highly nonlinear for real cases of interest. Therefore, fully implicit time integration schemes are very desirable in order to capture the different physical scales of the problem at hand. However, solving the multiphysics linear systems of equations resulting from such algorithms is a very challenging task which requires efficient and scalable preconditioners. In this work, a new family of recursive block LU preconditioners is designed and tested for solving the thermally coupled inductionless MHD equations. These preconditioners are obtained after splitting the fully coupled matrix into one-physics problems for every variable (velocity, pressure, current density, electric potential and temperature) that can be optimally solved, e.g., using preconditioned domain decomposition algorithms. The main idea is to arrange the original matrix into an (arbitrary) 2 × 2 block matrix, and consider an LU preconditioner obtained by approximating the corresponding Schur complement. For every one of the diagonal blocks in the LU preconditioner, if it involves more than one type of unknowns, we proceed the same way in a recursive fashion. This approach is stated in an abstract way, and can be straightforwardly applied to other multiphysics problems. Further, we precisely explain a flexible and general software design for the code implementation of this type of preconditioners.

  6. Morphological decomposition of 2-D binary shapes into convex polygons: a heuristic algorithm.

    PubMed

    Xu, J

    2001-01-01

    In many morphological shape decomposition algorithms, either a shape can only be decomposed into shape components of extremely simple forms or a time consuming search process is employed to determine a decomposition. In this paper, we present a morphological shape decomposition algorithm that decomposes a two-dimensional (2-D) binary shape into a collection of convex polygonal components. A single convex polygonal approximation for a given image is first identified. This first component is determined incrementally by selecting a sequence of basic shape primitives. These shape primitives are chosen based on shape information extracted from the given shape at different scale levels. Additional shape components are identified recursively from the difference image between the given image and the first component. Simple operations are used to repair certain concavities caused by the set difference operation. The resulting hierarchical structure provides descriptions for the given shape at different detail levels. The experiments show that the decomposition results produced by the algorithm seem to be in good agreement with the natural structures of the given shapes. The computational cost of the algorithm is significantly lower than that of an earlier search-based convex decomposition algorithm. Compared to nonconvex decomposition algorithms, our algorithm allows accurate approximations for the given shapes at low coding costs.

  7. Implicit Learning of Recursive Context-Free Grammars

    PubMed Central

    Rohrmeier, Martin; Fu, Qiufang; Dienes, Zoltan

    2012-01-01

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

  8. Polar alignment of a protoplanetary disc around an eccentric binary II: Effect of binary and disc parameters

    NASA Astrophysics Data System (ADS)

    Martin, Rebecca G.; Lubow, Stephen H.

    2018-06-01

    In a recent paper Martin & Lubow showed that a circumbinary disc around an eccentric binary can undergo damped nodal oscillations that lead to the polar (perpendicular) alignment of the disc relative to the binary orbit. The disc angular momentum vector aligns to the eccentricity vector of the binary. We explore the robustness of this mechanism for a low mass disc (0.001 of the binary mass) and its dependence on system parameters by means of hydrodynamic disc simulations. We describe how the evolution depends upon the disc viscosity, temperature, size, binary mass ratio, orbital eccentricity and inclination. We compare results with predictions of linear theory. We show that polar alignment of a low mass disc may occur over a wide range of binary-disc parameters. We discuss the application of our results to the formation of planetary systems around eccentric binary stars.

  9. Spectral properties of binary asteroids

    NASA Astrophysics Data System (ADS)

    Pajuelo, Myriam; Birlan, Mirel; Carry, Benoît; DeMeo, Francesca E.; Binzel, Richard P.; Berthier, Jérôme

    2018-07-01

    We present the first attempt to characterize the distribution of taxonomic class among the population of binary asteroids (15 per cent of all small asteroids). For that, an analysis of 0.8-2.5 µm near-infrared spectra obtained with the SpeX instrument on the NASA/IRTF (Infrared Telescope Facility) is presented. Taxonomic class and meteorite analogue is determined for each target, increasing the sample of binary asteroids with known taxonomy by 21 per cent. Most binary systems are bound in the S, X, and C classes, followed by Q and V types. The rate of binary systems in each taxonomic class agrees within uncertainty with the background population of small near-Earth objects and inner main belt asteroids, but for the C types which are under-represented among binaries.

  10. Binary Cepheids: Separations and Mass Ratios in 5 M ⊙ Binaries

    NASA Astrophysics Data System (ADS)

    Evans, Nancy Evans; Bond, Howard E.; Schaefer, Gail H.; Mason, Brian D.; Karovska, Margarita; Tingle, Evan

    2013-10-01

    Deriving the distribution of binary parameters for a particular class of stars over the full range of orbital separations usually requires the combination of results from many different observing techniques (radial velocities, interferometry, astrometry, photometry, direct imaging), each with selection biases. However, Cepheids—cool, evolved stars of ~5 M ⊙—are a special case because ultraviolet (UV) spectra will immediately reveal any companion star hotter than early type A, regardless of the orbital separation. We have used International Ultraviolet Explorer UV spectra of a complete sample of all 76 Cepheids brighter than V = 8 to create a list of all 18 Cepheids with companions more massive than 2.0 M ⊙. Orbital periods of many of these binaries are available from radial-velocity studies, or can be estimated for longer-period systems from detected velocity variability. In an imaging survey with the Hubble Space Telescope Wide Field Camera 3, we resolved three of the companions (those of η Aql, S Nor, and V659 Cen), allowing us to make estimates of the periods out to the long-period end of the distribution. Combining these separations with orbital data in the literature, we derive an unbiased distribution of binary separations, orbital periods, and mass ratios. The distribution of orbital periods shows that the 5 M ⊙ binaries have systematically shorter periods than do 1 M ⊙ stars. Our data also suggest that the distribution of mass ratios depends on both binary separation and system multiplicity. The distribution of mass ratios as a function of orbital separation, however, does not depend on whether a system is a binary or a triple. Based in part on observations made with the NASA/ESA Hubble Space Telescope, obtained by the Space Telescope Science Institute. STScI is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS5-26555.

  11. Multiclass Classification by Adaptive Network of Dendritic Neurons with Binary Synapses Using Structural Plasticity

    PubMed Central

    Hussain, Shaista; Basu, Arindam

    2016-01-01

    The development of power-efficient neuromorphic devices presents the challenge of designing spike pattern classification algorithms which can be implemented on low-precision hardware and can also achieve state-of-the-art performance. In our pursuit of meeting this challenge, we present a pattern classification model which uses a sparse connection matrix and exploits the mechanism of nonlinear dendritic processing to achieve high classification accuracy. A rate-based structural learning rule for multiclass classification is proposed which modifies a connectivity matrix of binary synaptic connections by choosing the best “k” out of “d” inputs to make connections on every dendritic branch (k < < d). Because learning only modifies connectivity, the model is well suited for implementation in neuromorphic systems using address-event representation (AER). We develop an ensemble method which combines several dendritic classifiers to achieve enhanced generalization over individual classifiers. We have two major findings: (1) Our results demonstrate that an ensemble created with classifiers comprising moderate number of dendrites performs better than both ensembles of perceptrons and of complex dendritic trees. (2) In order to determine the moderate number of dendrites required for a specific classification problem, a two-step solution is proposed. First, an adaptive approach is proposed which scales the relative size of the dendritic trees of neurons for each class. It works by progressively adding dendrites with fixed number of synapses to the network, thereby allocating synaptic resources as per the complexity of the given problem. As a second step, theoretical capacity calculations are used to convert each neuronal dendritic tree to its optimal topology where dendrites of each class are assigned different number of synapses. The performance of the model is evaluated on classification of handwritten digits from the benchmark MNIST dataset and compared with other

  12. RLS Channel Estimation with Adaptive Forgetting Factor for DS-CDMA Frequency-Domain Equalization

    NASA Astrophysics Data System (ADS)

    Kojima, Yohei; Tomeba, Hiromichi; Takeda, Kazuaki; Adachi, Fumiyuki

    Frequency-domain equalization (FDE) based on the minimum mean square error (MMSE) criterion can increase the downlink bit error rate (BER) performance of DS-CDMA beyond that possible with conventional rake combining in a frequency-selective fading channel. FDE requires accurate channel estimation. Recently, we proposed a pilot-assisted channel estimation (CE) based on the MMSE criterion. Using MMSE-CE, the channel estimation accuracy is almost insensitive to the pilot chip sequence, and a good BER performance is achieved. In this paper, we propose a channel estimation scheme using one-tap recursive least square (RLS) algorithm, where the forgetting factor is adapted to the changing channel condition by the least mean square (LMS)algorithm, for DS-CDMA with FDE. We evaluate the BER performance using RLS-CE with adaptive forgetting factor in a frequency-selective fast Rayleigh fading channel by computer simulation.

  13. Planet Formation in Binaries

    NASA Astrophysics Data System (ADS)

    Thebault, P.; Haghighipour, N.

    Spurred by the discovery of numerous exoplanets in multiple systems, binaries have become in recent years one of the main topics in planet formation research. Numerous studies have investigated to what extent the presence of a stellar companion can affect the planet formation process. Such studies have implications that can reach beyond the sole context of binaries, as they allow to test certain aspects of the planet formation scenario by submitting them to extreme environments. We review here the current understanding on this complex problem. We show in particular how each of the different stages of the planet-formation process is affected differently by binary perturbations. We focus especially on the intermediate stage of kilometre-sized planetesimal accretion, which has proven to be the most sensitive to binarity and for which the presence of some exoplanets observed in tight binaries is difficult to explain by in-situ formation following the "standard" planet-formation scenario. Some tentative solutions to this apparent paradox are presented. The last part of our review presents a thorough description of the problem of planet habitability, for which the binary environment creates a complex situation because of the presence of two irradation sources of varying distance.

  14. Image defog algorithm based on open close filter and gradient domain recursive bilateral filter

    NASA Astrophysics Data System (ADS)

    Liu, Daqian; Liu, Wanjun; Zhao, Qingguo; Fei, Bowen

    2017-11-01

    To solve the problems of fuzzy details, color distortion, low brightness of the image obtained by the dark channel prior defog algorithm, an image defog algorithm based on open close filter and gradient domain recursive bilateral filter, referred to as OCRBF, was put forward. The algorithm named OCRBF firstly makes use of weighted quad tree to obtain more accurate the global atmospheric value, then exploits multiple-structure element morphological open and close filter towards the minimum channel map to obtain a rough scattering map by dark channel prior, makes use of variogram to correct the transmittance map,and uses gradient domain recursive bilateral filter for the smooth operation, finally gets recovery images by image degradation model, and makes contrast adjustment to get bright, clear and no fog image. A large number of experimental results show that the proposed defog method in this paper can be good to remove the fog , recover color and definition of the fog image containing close range image, image perspective, the image including the bright areas very well, compared with other image defog algorithms,obtain more clear and natural fog free images with details of higher visibility, what's more, the relationship between the time complexity of SIDA algorithm and the number of image pixels is a linear correlation.

  15. An adaptive mesh refinement-multiphase lattice Boltzmann flux solver for simulation of complex binary fluid flows

    NASA Astrophysics Data System (ADS)

    Yuan, H. Z.; Wang, Y.; Shu, C.

    2017-12-01

    This paper presents an adaptive mesh refinement-multiphase lattice Boltzmann flux solver (AMR-MLBFS) for effective simulation of complex binary fluid flows at large density ratios. In this method, an AMR algorithm is proposed by introducing a simple indicator on the root block for grid refinement and two possible statuses for each block. Unlike available block-structured AMR methods, which refine their mesh by spawning or removing four child blocks simultaneously, the present method is able to refine its mesh locally by spawning or removing one to four child blocks independently when the refinement indicator is triggered. As a result, the AMR mesh used in this work can be more focused on the flow region near the phase interface and its size is further reduced. In each block of mesh, the recently proposed MLBFS is applied for the solution of the flow field and the level-set method is used for capturing the fluid interface. As compared with existing AMR-lattice Boltzmann models, the present method avoids both spatial and temporal interpolations of density distribution functions so that converged solutions on different AMR meshes and uniform grids can be obtained. The proposed method has been successfully validated by simulating a static bubble immersed in another fluid, a falling droplet, instabilities of two-layered fluids, a bubble rising in a box, and a droplet splashing on a thin film with large density ratios and high Reynolds numbers. Good agreement with the theoretical solution, the uniform-grid result, and/or the published data has been achieved. Numerical results also show its effectiveness in saving computational time and virtual memory as compared with computations on uniform meshes.

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

    PubMed

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

    2015-01-01

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

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

    PubMed

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

    2017-07-20

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

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

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

  20. Adaptive angular-velocity Vold-Kalman filter order tracking - Theoretical basis, numerical implementation and parameter investigation

    NASA Astrophysics Data System (ADS)

    Pan, M.-Ch.; Chu, W.-Ch.; Le, Duc-Do

    2016-12-01

    The paper presents an alternative Vold-Kalman filter order tracking (VKF_OT) method, i.e. adaptive angular-velocity VKF_OT technique, to extract and characterize order components in an adaptive manner for the condition monitoring and fault diagnosis of rotary machinery. The order/spectral waveforms to be tracked can be recursively solved by using Kalman filter based on the one-step state prediction. The paper comprises theoretical derivation of computation scheme, numerical implementation, and parameter investigation. Comparisons of the adaptive VKF_OT scheme with two other ones are performed through processing synthetic signals of designated order components. Processing parameters such as the weighting factor and the correlation matrix of process noise, and data conditions like the sampling frequency, which influence tracking behavior, are explored. The merits such as adaptive processing nature and computation efficiency brought by the proposed scheme are addressed although the computation was performed in off-line conditions. The proposed scheme can simultaneously extract multiple spectral components, and effectively decouple close and crossing orders associated with multi-axial reference rotating speeds.

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

    PubMed

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

    2017-09-06

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

  2. DISTINGUISHING COMPACT BINARY POPULATION SYNTHESIS MODELS USING GRAVITATIONAL WAVE OBSERVATIONS OF COALESCING BINARY BLACK HOLES

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

    Stevenson, Simon; Ohme, Frank; Fairhurst, Stephen, E-mail: simon.stevenson@ligo.org

    2015-09-01

    The coalescence of compact binaries containing neutron stars or black holes is one of the most promising signals for advanced ground-based laser interferometer gravitational-wave (GW) detectors, with the first direct detections expected over the next few years. The rate of binary coalescences and the distribution of component masses is highly uncertain, and population synthesis models predict a wide range of plausible values. Poorly constrained parameters in population synthesis models correspond to poorly understood astrophysics at various stages in the evolution of massive binary stars, the progenitors of binary neutron star and binary black hole systems. These include effects such asmore » supernova kick velocities, parameters governing the energetics of common envelope evolution and the strength of stellar winds. Observing multiple binary black hole systems through GWs will allow us to infer details of the astrophysical mechanisms that lead to their formation. Here we simulate GW observations from a series of population synthesis models including the effects of known selection biases, measurement errors and cosmology. We compare the predictions arising from different models and show that we will be able to distinguish between them with observations (or the lack of them) from the early runs of the advanced LIGO and Virgo detectors. This will allow us to narrow down the large parameter space for binary evolution models.« less

  3. Gravitational radiation, inspiraling binaries, and cosmology

    NASA Technical Reports Server (NTRS)

    Chernoff, David F.; Finn, Lee S.

    1993-01-01

    We show how to measure cosmological parameters using observations of inspiraling binary neutron star or black hole systems in one or more gravitational wave detectors. To illustrate, we focus on the case of fixed mass binary systems observed in a single Laser Interferometer Gravitational-wave Observatory (LIGO)-like detector. Using realistic detector noise estimates, we characterize the rate of detections as a function of a threshold SNR Rho(0), H0, and the binary 'chirp' mass. For Rho(0) = 8, H0 = 100 km/s/Mpc, and 1.4 solar mass neutron star binaries, the sample has a median redshift of 0.22. Under the same assumptions but independent of H0, a conservative rate density of coalescing binaries implies LIGO will observe about 50/yr binary inspiral events. The precision with which H0 and the deceleration parameter q0 may be determined depends on the number of observed inspirals. For fixed mass binary systems, about 100 observations with Rho(0) = 10 in the LIGO will give H0 to 10 percent in an Einstein-DeSitter cosmology, and 3000 will give q0 to 20 percent. For the conservative rate density of coalescing binaries, 100 detections with Rho(0) = 10 will require about 4 yrs.

  4. Contact Binaries on Their Way Towards Merging

    NASA Astrophysics Data System (ADS)

    Gazeas, K.

    2015-07-01

    Contact binaries are the most frequently observed type of eclipsing star system. They are small, cool, low-mass binaries belonging to a relatively old stellar population. They follow certain empirical relationships that closely connect a number of physical parameters with each other, largely because of constraints coming from the Roche geometry. As a result, contact binaries provide an excellent test of stellar evolution, specifically for stellar merger scenarios. Observing campaigns by many authors have led to the cataloging of thousands of contact binaries and enabled statistical studies of many of their properties. A large number of contact binaries have been found to exhibit extraordinary behavior, requiring follow-up observations to study their peculiarities in detail. For example, a doubly-eclipsing quadruple system consisting of a contact binary and a detached binary is a highly constrained system offering an excellent laboratory to test evolutionary theories for binaries. A new observing project was initiated at the University of Athens in 2012 in order to investigate the possible lower limit for the orbital period of binary systems before coalescence, prior to merging.

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

  6. Recursive approach to the moment-based phase unwrapping method.

    PubMed

    Langley, Jason A; Brice, Robert G; Zhao, Qun

    2010-06-01

    The moment-based phase unwrapping algorithm approximates the phase map as a product of Gegenbauer polynomials, but the weight function for the Gegenbauer polynomials generates artificial singularities along the edge of the phase map. A method is presented to remove the singularities inherent to the moment-based phase unwrapping algorithm by approximating the phase map as a product of two one-dimensional Legendre polynomials and applying a recursive property of derivatives of Legendre polynomials. The proposed phase unwrapping algorithm is tested on simulated and experimental data sets. The results are then compared to those of PRELUDE 2D, a widely used phase unwrapping algorithm, and a Chebyshev-polynomial-based phase unwrapping algorithm. It was found that the proposed phase unwrapping algorithm provides results that are comparable to those obtained by using PRELUDE 2D and the Chebyshev phase unwrapping algorithm.

  7. Protoplanetary disk evolution and stellar parameters of T Tauri binaries in Chamaeleon I

    NASA Astrophysics Data System (ADS)

    Daemgen, S.; Petr-Gotzens, M. G.; Correia, S.; Teixeira, P. S.; Brandner, W.; Kley, W.; Zinnecker, H.

    2013-06-01

    Aims: This study aims to determine the impact of stellar binary companions on the lifetime and evolution of circumstellar disks in the Chamaeleon I (Cha I) star-forming region by measuring the frequency and strength of accretion and circumstellar dust signatures around the individual components of T Tauri binary stars. Methods: We used high-angular resolution adaptive optics JHKsL' -band photometry and 1.5-2.5 μm spectroscopy of 19 visual binary and 7 triple stars in Cha I - including one newly discovered tertiary component - with separations between ~25 and ~1000 AU. The data allowed us to infer stellar component masses and ages and, from the detection of near-infrared excess emission and the strength of Brackett-γ emission, the presence of ongoing accretion and hot circumstellar dust of the individual stellar components of each binary. Results: Of all the stellar components in close binaries with separations of 25-100 AU, 10+15-5% show signs of accretion. This is less than half of the accretor fraction found in wider binaries, which itself appears significantly reduced (~44%) compared with previous measurements of single stars in Cha I. Hot dust was found around 50+30-15% of the target components, a value that is indistinguishable from that of Cha I single stars. Only the closest binaries (<25 AU) were inferred to have a significantly reduced fraction (≲25%) of components that harbor hot dust. Accretors were exclusively found in binary systems with unequal component masses Msecondary/Mprimary < 0.8, implying that the detected accelerated disk dispersal is a function of mass-ratio. This agrees with the finding that only one accreting secondary star was found, which is also the weakest accretor in the sample. Conclusions: The results imply that disk dispersal is more accelerated the stronger the dynamical disk truncation, i.e., the smaller the inferred radius of the disk. Nonetheless, the overall measured mass accretion rates appear to be independent of the

  8. Virasoro constraints and polynomial recursion for the linear Hodge integrals

    NASA Astrophysics Data System (ADS)

    Guo, Shuai; Wang, Gehao

    2017-04-01

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

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

  10. Adaptive learning and control for MIMO system based on adaptive dynamic programming.

    PubMed

    Fu, Jian; He, Haibo; Zhou, Xinmin

    2011-07-01

    Adaptive dynamic programming (ADP) is a promising research field for design of intelligent controllers, which can both learn on-the-fly and exhibit optimal behavior. Over the past decades, several generations of ADP design have been proposed in the literature, which have demonstrated many successful applications in various benchmarks and industrial applications. While many of the existing researches focus on multiple-inputs-single-output system with steepest descent search, in this paper we investigate a generalized multiple-input-multiple-output (GMIMO) ADP design for online learning and control, which is more applicable to a wide range of practical real-world applications. Furthermore, an improved weight-updating algorithm based on recursive Levenberg-Marquardt methods is presented and embodied in the GMIMO approach to improve its performance. Finally, we test the performance of this approach based on a practical complex system, namely, the learning and control of the tension and height of the looper system in a hot strip mill. Experimental results demonstrate that the proposed approach can achieve effective and robust performance.

  11. Adaptive filtering of GOCE-derived gravity gradients of the disturbing potential in the context of the space-wise approach

    NASA Astrophysics Data System (ADS)

    Piretzidis, Dimitrios; Sideris, Michael G.

    2017-09-01

    connected to and employed in the first computational steps of the space-wise approach, where a time-wise Wiener filter is applied at the first stage of GOCE gravity gradient filtering. The results of this work can be extended to using other adaptive filtering algorithms, such as the recursive least-squares and recursive least-squares lattice filters.

  12. Tera-Op Reliable Intelligently Adaptive Processing System (TRIPS)

    DTIC Science & Technology

    2004-04-01

    flop creates a loadable FIFO queue, fifo pload. A prototype of the HML simulator is implemented using a functional language OCaml . The language type...Flow . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 7.1.2 Hardware Meta Language ...operates on the TRIPS Intermediate Language (TIL) produced by the Scale compiler. We also adapted the gnu binary utilities to implement an assembler and

  13. Binary Systems and the Initial Mass Function

    NASA Astrophysics Data System (ADS)

    Malkov, O. Yu.

    2017-07-01

    In the present paper we discuss advantages and disadvantages of binary stars, which are important for star formation history determination. We show that to make definite conclusions of the initial mass function shape, it is necessary to study binary population well enough to correct the luminosity function for unresolved binaries; to construct the mass-luminosity relation based on wide binaries data, and to separate observational mass functions of primaries, of secondaries, and of unresolved binaries.

  14. Accuracy of binary black hole waveform models for aligned-spin binaries

    NASA Astrophysics Data System (ADS)

    Kumar, Prayush; Chu, Tony; Fong, Heather; Pfeiffer, Harald P.; Boyle, Michael; Hemberger, Daniel A.; Kidder, Lawrence E.; Scheel, Mark A.; Szilagyi, Bela

    2016-05-01

    Coalescing binary black holes are among the primary science targets for second generation ground-based gravitational wave detectors. Reliable gravitational waveform models are central to detection of such systems and subsequent parameter estimation. This paper performs a comprehensive analysis of the accuracy of recent waveform models for binary black holes with aligned spins, utilizing a new set of 84 high-accuracy numerical relativity simulations. Our analysis covers comparable mass binaries (mass-ratio 1 ≤q ≤3 ), and samples independently both black hole spins up to a dimensionless spin magnitude of 0.9 for equal-mass binaries and 0.85 for unequal mass binaries. Furthermore, we focus on the high-mass regime (total mass ≳50 M⊙ ). The two most recent waveform models considered (PhenomD and SEOBNRv2) both perform very well for signal detection, losing less than 0.5% of the recoverable signal-to-noise ratio ρ , except that SEOBNRv2's efficiency drops slightly for both black hole spins aligned at large magnitude. For parameter estimation, modeling inaccuracies of the SEOBNRv2 model are found to be smaller than systematic uncertainties for moderately strong GW events up to roughly ρ ≲15 . PhenomD's modeling errors are found to be smaller than SEOBNRv2's, and are generally irrelevant for ρ ≲20 . Both models' accuracy deteriorates with increased mass ratio, and when at least one black hole spin is large and aligned. The SEOBNRv2 model shows a pronounced disagreement with the numerical relativity simulation in the merger phase, for unequal masses and simultaneously both black hole spins very large and aligned. Two older waveform models (PhenomC and SEOBNRv1) are found to be distinctly less accurate than the more recent PhenomD and SEOBNRv2 models. Finally, we quantify the bias expected from all four waveform models during parameter estimation for several recovered binary parameters: chirp mass, mass ratio, and effective spin.

  15. Radial Velocities of 41 Kepler Eclipsing Binaries

    NASA Astrophysics Data System (ADS)

    Matson, Rachel A.; Gies, Douglas R.; Guo, Zhao; Williams, Stephen J.

    2017-12-01

    Eclipsing binaries are vital for directly determining stellar parameters without reliance on models or scaling relations. Spectroscopically derived parameters of detached and semi-detached binaries allow us to determine component masses that can inform theories of stellar and binary evolution. Here we present moderate resolution ground-based spectra of stars in close binary systems with and without (detected) tertiary companions observed by NASA’s Kepler mission and analyzed for eclipse timing variations. We obtain radial velocities and spectroscopic orbits for five single-lined and 35 double-lined systems, and confirm one false positive eclipsing binary. For the double-lined spectroscopic binaries, we also determine individual component masses and examine the mass ratio {M}2/{M}1 distribution, which is dominated by binaries with like-mass pairs and semi-detached classical Algol systems that have undergone mass transfer. Finally, we constrain the mass of the tertiary component for five double-lined binaries with previously detected companions.

  16. Photometric detection of a candidate low-mass giant binary system at the Milky Way Galactic Center

    NASA Astrophysics Data System (ADS)

    Krishna Gautam, Abhimat; Do, Tuan; Ghez, Andrea; Sakai, Shoko; Morris, Mark; Lu, Jessica; Witzel, Gunther; Jia, Siyao; Becklin, Eric Eric; Matthews, Keith

    2018-01-01

    We present the discovery of a new periodic variable star at the Milky Way Galactic Center (GC). This study uses laser guide-star adaptive optics data collected with the W. M. Keck 10 m telescope in the K‧-band (2.2 µm) over 35 nights spanning an 11 year time baseline, and 5 nights of additional H-band (1.6 µm) data. We implemented an iterative photometric calibration and local correction technique, resulting in a photometric uncertainty of Δm_K‧ ∼ 0.03 to a magnitude of m_K‧ ∼ 16.The periodically variable star has a 39.42 day period. We find that the star is not consistent with known periodically variable star classes in this period range with its observed color and luminosity, nor with an eclipsing binary system. The star's color and luminosity are however consistent with an ellipsoidal binary system at the GC, consisting of a K-giant and a dwarf component with an orbital period of 78.84 days. If a binary system, it represents the first detection of a low-mass giant binary system in the central half parsec of the GC. Such long-period binary systems can easily evaporate in the dense environment of the GC due to interactions with other stars. The existence and properties of a low-mass, long-period binary system can thus place valuable constraints on dynamical models of the GC environment and probe the density of the hypothesized dark cusp of stellar remnants at the GC.

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

  18. Adaptive robust motion trajectory tracking control of pneumatic cylinders with LuGre model-based friction compensation

    NASA Astrophysics Data System (ADS)

    Meng, Deyuan; Tao, Guoliang; Liu, Hao; Zhu, Xiaocong

    2014-07-01

    Friction compensation is particularly important for motion trajectory tracking control of pneumatic cylinders at low speed movement. However, most of the existing model-based friction compensation schemes use simple classical models, which are not enough to address applications with high-accuracy position requirements. Furthermore, the friction force in the cylinder is time-varying, and there exist rather severe unmodelled dynamics and unknown disturbances in the pneumatic system. To deal with these problems effectively, an adaptive robust controller with LuGre model-based dynamic friction compensation is constructed. The proposed controller employs on-line recursive least squares estimation (RLSE) to reduce the extent of parametric uncertainties, and utilizes the sliding mode control method to attenuate the effects of parameter estimation errors, unmodelled dynamics and disturbances. In addition, in order to realize LuGre model-based friction compensation, the modified dual-observer structure for estimating immeasurable friction internal state is developed. Therefore, a prescribed motion tracking transient performance and final tracking accuracy can be guaranteed. Since the system model uncertainties are unmatched, the recursive backstepping design technology is applied. In order to solve the conflicts between the sliding mode control design and the adaptive control design, the projection mapping is used to condition the RLSE algorithm so that the parameter estimates are kept within a known bounded convex set. Finally, the proposed controller is tested for tracking sinusoidal trajectories and smooth square trajectory under different loads and sudden disturbance. The testing results demonstrate that the achievable performance of the proposed controller is excellent and is much better than most other studies in literature. Especially when a 0.5 Hz sinusoidal trajectory is tracked, the maximum tracking error is 0.96 mm and the average tracking error is 0.45 mm. This

  19. Eclipsing Stellar Binaries in the Galactic Center

    NASA Astrophysics Data System (ADS)

    Li, Gongjie; Ginsburg, Idan; Naoz, Smadar; Loeb, Abraham

    2017-12-01

    Compact stellar binaries are expected to survive in the dense environment of the Galactic center. The stable binaries may undergo Kozai–Lidov oscillations due to perturbations from the central supermassive black hole (Sgr A*), yet the general relativistic precession can suppress the Kozai–Lidov oscillations and keep the stellar binaries from merging. However, it is challenging to resolve the binary sources and distinguish them from single stars. The close separations of the stable binaries allow higher eclipse probabilities. Here, we consider the massive star SO-2 as an example and calculate the probability of detecting eclipses, assuming it is a binary. We find that the eclipse probability is ∼30%–50%, reaching higher values when the stellar binary is more eccentric or highly inclined relative to its orbit around Sgr A*.

  20. Theoretical studies of binaries in astrophysics

    NASA Astrophysics Data System (ADS)

    Dischler, Johann Sebastian

    This thesis introduces and summarizes four papers dealing with computer simulations of astrophysical processes involving binaries. The first part gives the rational and theoretical background to these papers. In paper I and II a statistical approach to studying eclipsing binaries is described. By using population synthesis models for binaries the probabilities for eclipses are calculated for different luminosity classes of binaries. These are compared with Hipparcos data and they agree well if one uses a standard input distribution for the orbit sizes. If one uses a random pairing model, where both companions are independently picked from an IMF, one finds too feclipsing binaries by an order of magnitude. In paper III we investigate a possible scenario for the origin of the stars observed close to the centre of our galaxy, called S stars. We propose that a cluster falls radially cowards the central black hole. The binaries within the cluster can then, if they have small impact parameters, be broken up by the black hole's tidal held and one of the components of the binary will be captured by the black hole. Paper IV investigates how the onset of mass transfer in eccentric binaries depends on the eccentricity. To do this we have developed a new two-phase SPH scheme where very light particles are at tire outer edge of our simulated star. This enables us to get a much better resolution of the very small mass that is transferred in close binaries. Our simulations show that the minimum required distance between the stars to have mass transfer decreases with the eccentricity.

  1. Embedded binaries and their dense cores

    NASA Astrophysics Data System (ADS)

    Sadavoy, Sarah I.; Stahler, Steven W.

    2017-08-01

    We explore the relationship between young, embedded binaries and their parent cores, using observations within the Perseus Molecular Cloud. We combine recently published Very Large Array observations of young stars with core properties obtained from Submillimetre Common-User Bolometer Array 2 observations at 850 μm. Most embedded binary systems are found towards the centres of their parent cores, although several systems have components closer to the core edge. Wide binaries, defined as those systems with physical separations greater than 500 au, show a tendency to be aligned with the long axes of their parent cores, whereas tight binaries show no preferred orientation. We test a number of simple, evolutionary models to account for the observed populations of Class 0 and I sources, both single and binary. In the model that best explains the observations, all stars form initially as wide binaries. These binaries either break up into separate stars or else shrink into tighter orbits. Under the assumption that both stars remain embedded following binary break-up, we find a total star formation rate of 168 Myr-1. Alternatively, one star may be ejected from the dense core due to binary break-up. This latter assumption results in a star formation rate of 247 Myr-1. Both production rates are in satisfactory agreement with current estimates from other studies of Perseus. Future observations should be able to distinguish between these two possibilities. If our model continues to provide a good fit to other star-forming regions, then the mass fraction of dense cores that becomes stars is double what is currently believed.

  2. Painlevé equations, topological type property and reconstruction by the topological recursion

    NASA Astrophysics Data System (ADS)

    Iwaki, K.; Marchal, O.; Saenz, A.

    2018-01-01

    In this article we prove that Lax pairs associated with ħ-dependent six Painlevé equations satisfy the topological type property proposed by Bergère, Borot and Eynard for any generic choice of the monodromy parameters. Consequently we show that one can reconstruct the formal ħ-expansion of the isomonodromic τ-function and of the determinantal formulas by applying the so-called topological recursion to the spectral curve attached to the Lax pair in all six Painlevé cases. Finally we illustrate the former results with the explicit computations of the first orders of the six τ-functions.

  3. Analytical recursive method to ascertain multisite entanglement in doped quantum spin ladders

    NASA Astrophysics Data System (ADS)

    Roy, Sudipto Singha; Dhar, Himadri Shekhar; Rakshit, Debraj; SenDe, Aditi; Sen, Ujjwal

    2017-08-01

    We formulate an analytical recursive method to generate the wave function of doped short-range resonating valence bond (RVB) states as a tool to efficiently estimate multisite entanglement as well as other physical quantities in doped quantum spin ladders. We prove that doped RVB ladder states are always genuine multipartite entangled. Importantly, our results show that within specific doping concentration and model parameter regimes, the doped RVB state essentially characterizes the trends of genuine multiparty entanglement in the exact ground states of the Hubbard model with large on-site interactions, in the limit that yields the t -J Hamiltonian.

  4. Asteroid Systems: Binaries, Triples, and Pairs

    NASA Astrophysics Data System (ADS)

    Margot, J.-L.; Pravec, P.; Taylor, P.; Carry, B.; Jacobson, S.

    In the past decade, the number of known binary near-Earth asteroids has more than quadrupled and the number of known large main-belt asteroids with satellites has doubled. Half a dozen triple asteroids have been discovered, and the previously unrecognized populations of asteroid pairs and small main-belt binaries have been identified. The current observational evidence confirms that small (≲20 km) binaries form by rotational fission and establishes that the Yarkovsky-O'Keefe-Radzievskii-Paddack (YORP) effect powers the spin-up process. A unifying paradigm based on rotational fission and post-fission dynamics can explain the formation of small binaries, triples, and pairs. Large (>~20 km) binaries with small satellites are most likely created during large collisions.

  5. Binary asteroid population. 2. Anisotropic distribution of orbit poles of small, inner main-belt binaries

    NASA Astrophysics Data System (ADS)

    Pravec, P.; Scheirich, P.; Vokrouhlický, D.; Harris, A. W.; Kušnirák, P.; Hornoch, K.; Pray, D. P.; Higgins, D.; Galád, A.; Világi, J.; Gajdoš, Š.; Kornoš, L.; Oey, J.; Husárik, M.; Cooney, W. R.; Gross, J.; Terrell, D.; Durkee, R.; Pollock, J.; Reichart, D. E.; Ivarsen, K.; Haislip, J.; LaCluyze, A.; Krugly, Yu. N.; Gaftonyuk, N.; Stephens, R. D.; Dyvig, R.; Reddy, V.; Chiorny, V.; Vaduvescu, O.; Longa-Peña, P.; Tudorica, A.; Warner, B. D.; Masi, G.; Brinsfield, J.; Gonçalves, R.; Brown, P.; Krzeminski, Z.; Gerashchenko, O.; Shevchenko, V.; Molotov, I.; Marchis, F.

    2012-03-01

    Our photometric observations of 18 main-belt binary systems in more than one apparition revealed a strikingly high number of 15 having positively re-observed mutual events in the return apparitions. Our simulations of the survey showed that it cannot be due to an observational selection effect and that the data strongly suggest that poles of mutual orbits between components of binary asteroids in the primary size range 3-8 km are not distributed randomly: The null hypothesis of an isotropic distribution of the orbit poles is rejected at a confidence level greater than 99.99%. Binary orbit poles concentrate at high ecliptic latitudes, within 30° of the poles of the ecliptic. We propose that the binary orbit poles oriented preferentially up/down-right are due to either of the two processes: (i) the YORP tilt of spin axes of their parent bodies toward the asymptotic states near obliquities 0° and 180° (pre-formation mechanism) or (ii) the YORP tilt of spin axes of the primary components of already formed binary systems toward the asymptotic states near obliquities 0° and 180° (post-formation mechanism). The alternative process of elimination of binaries with poles closer to the ecliptic by dynamical instability, such as the Kozai effect due to gravitational perturbations from the Sun, does not explain the observed orbit pole concentration. This is because for close binary asteroid systems, the gravitational effects of primary’s irregular shape dominate the solar-tide effect.

  6. From wide to close binaries?

    NASA Astrophysics Data System (ADS)

    Eggleton, Peter P.

    The mechanisms by which the periods of wide binaries (mass 8 solar mass or less and period 10-3000 d) are lengthened or shortened are discussed, synthesizing the results of recent theoretical investigations. A system of nomenclature involving seven evolutionary states, three geometrical states, and 10 types of orbital-period evolution is developed and applied; classifications of 71 binaries are presented in a table along with the basic observational parameters. Evolutionary processes in wide binaries (single-star-type winds, magnetic braking with tidal friction, and companion-reinforced attrition), late case B systems, low-mass X-ray binaries, and triple systems are examined in detail, and possible evolutionary paths are shown in diagrams.

  7. Subdwarf B Stars: Tracers Of Binary Evolution

    NASA Astrophysics Data System (ADS)

    Morales-Rueda, L.; Maxted, P. F. L.; Marsh, T. R.

    2007-08-01

    Subdwarf B stars are a superb stellar population to study binary evolution. In 2001, Maxted et al. (MNRAS, 326, 1391) found that 21 out of the 36 subdwarf B stars they studied were in short period binaries. These observations inspired new theoretical work that suggests that up to 90 per cent of subdwarf B stars are in binary systems with the remaining apparently single stars being the product of merging pairs. This high binary fraction added to the fact that they are detached binaries that have not changed significantly since they came out of the common envelope, make subdwarf B stars a perfect population to study binary evolution. By comparing the observed orbital period distribution of subdwarf B stars with that obtained from population synthesis calculations we can determine fundamental parameters of binary evolution such as the common envelope ejection efficiency. Here we give an overview of the fraction of short period binaries found from different surveys as well as the most up to date orbital period distribution determined observationally. We also present results from a recent search for subdwarf B stars in long period binaries.

  8. Survival of planets around shrinking stellar binaries

    PubMed Central

    Muñoz, Diego J.; Lai, Dong

    2015-01-01

    The discovery of transiting circumbinary planets by the Kepler mission suggests that planets can form efficiently around binary stars. None of the stellar binaries currently known to host planets has a period shorter than 7 d, despite the large number of eclipsing binaries found in the Kepler target list with periods shorter than a few days. These compact binaries are believed to have evolved from wider orbits into their current configurations via the so-called Lidov–Kozai migration mechanism, in which gravitational perturbations from a distant tertiary companion induce large-amplitude eccentricity oscillations in the binary, followed by orbital decay and circularization due to tidal dissipation in the stars. Here we explore the orbital evolution of planets around binaries undergoing orbital decay by this mechanism. We show that planets may survive and become misaligned from their host binary, or may develop erratic behavior in eccentricity, resulting in their consumption by the stars or ejection from the system as the binary decays. Our results suggest that circumbinary planets around compact binaries could still exist, and we offer predictions as to what their orbital configurations should be like. PMID:26159412

  9. Survival of planets around shrinking stellar binaries.

    PubMed

    Muñoz, Diego J; Lai, Dong

    2015-07-28

    The discovery of transiting circumbinary planets by the Kepler mission suggests that planets can form efficiently around binary stars. None of the stellar binaries currently known to host planets has a period shorter than 7 d, despite the large number of eclipsing binaries found in the Kepler target list with periods shorter than a few days. These compact binaries are believed to have evolved from wider orbits into their current configurations via the so-called Lidov-Kozai migration mechanism, in which gravitational perturbations from a distant tertiary companion induce large-amplitude eccentricity oscillations in the binary, followed by orbital decay and circularization due to tidal dissipation in the stars. Here we explore the orbital evolution of planets around binaries undergoing orbital decay by this mechanism. We show that planets may survive and become misaligned from their host binary, or may develop erratic behavior in eccentricity, resulting in their consumption by the stars or ejection from the system as the binary decays. Our results suggest that circumbinary planets around compact binaries could still exist, and we offer predictions as to what their orbital configurations should be like.

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

  11. Formation and Evolution of X-ray Binaries

    NASA Astrophysics Data System (ADS)

    Shao, Y.

    2017-07-01

    X-ray binaries are a class of binary systems, in which the accretor is a compact star (i.e., black hole, neutron star, or white dwarf). They are one of the most important objects in the universe, which can be used to study not only binary evolution but also accretion disks and compact stars. Statistical investigations of these binaries help to understand the formation and evolution of galaxies, and sometimes provide useful constraints on the cosmological models. The goal of this thesis is to investigate the formation and evolution processes of X-ray binaries including Be/X-ray binaries, low-mass X-ray binaries (LMXBs), ultraluminous X-ray sources (ULXs), and cataclysmic variables. In Chapter 1 we give a brief review on the basic knowledge of the binary evolution. In Chapter 2 we discuss the formation of Be stars through binary interaction. In this chapter we investigate the formation of Be stars resulting from mass transfer in binaries in the Galaxy. Using binary evolution and population synthesis calculations, we find that in Be/neutron star binaries the Be stars have a lower limit of mass ˜ 8 M⊙ if they are formed by a stable (i.e., without the occurrence of common envelope evolution) and nonconservative mass transfer. We demonstrate that the isolated Be stars may originate from both mergers of two main-sequence stars and disrupted Be binaries during the supernova explosions of the primary stars, but mergers seem to play a much more important role. Finally the fraction of Be stars produced by binary interactions in all B type stars can be as high as ˜ 13%-30% , implying that most of Be stars may result from binary interaction. In Chapter 3 we show the evolution of intermediate- and low-mass X-ray binaries (I/LMXBs) and the formation of millisecond pulsars. Comparing the calculated results with the observations of binary radio pulsars, we report the following results: (1) The allowed parameter space for forming binary pulsars in the initial orbital period

  12. Binary ferrihydrite catalysts

    DOEpatents

    Huffman, Gerald P.; Zhao, Jianmin; Feng, Zhen

    1996-01-01

    A method of preparing a catalyst precursor comprises dissolving an iron salt and a salt of an oxoanion forming agent, in water so that a solution of the iron salt and oxoanion forming agent salt has a ratio of oxoanion/Fe of between 0.0001:1 to 0.5:1. Next is increasing the pH of the solution to 10 by adding a strong base followed by collecting of precipitate having a binary ferrihydrite structure. A binary ferrihydrite catalyst precursor is also prepared by dissolving an iron salt in water. The solution is brought to a pH of substantially 10 to obtain ferrihydrite precipitate. The precipitate is then filtered and washed with distilled water and subsequently admixed with a hydroxy carboxylic acid solution. The admixture is mixed/agitated and the binary ferrihydrite precipitate is then filtered and recovered.

  13. Binary ferrihydrite catalysts

    DOEpatents

    Huffman, G.P.; Zhao, J.; Feng, Z.

    1996-12-03

    A method of preparing a catalyst precursor comprises dissolving an iron salt and a salt of an oxoanion forming agent, in water so that a solution of the iron salt and oxoanion forming agent salt has a ratio of oxoanion/Fe of between 0.0001:1 to 0.5:1. Next is increasing the pH of the solution to 10 by adding a strong base followed by collecting of precipitate having a binary ferrihydrite structure. A binary ferrihydrite catalyst precursor is also prepared by dissolving an iron salt in water. The solution is brought to a pH of substantially 10 to obtain ferrihydrite precipitate. The precipitate is then filtered and washed with distilled water and subsequently admixed with a hydroxy carboxylic acid solution. The admixture is mixed/agitated and the binary ferrihydrite precipitate is then filtered and recovered. 3 figs.

  14. X-ray binaries

    NASA Technical Reports Server (NTRS)

    1976-01-01

    Satellite X-ray experiments and ground-based programs aimed at observation of X-ray binaries are discussed. Experiments aboard OAO-3, OSO-8, Ariel 5, Uhuru, and Skylab are included along with rocket and ground-based observations. Major topics covered are: Her X-1, Cyg X-3, Cen X-3, Cyg X-1, the transient source A0620-00, other possible X-ray binaries, and plans and prospects for future observational programs.

  15. A wavelet approach to binary blackholes with asynchronous multitasking

    NASA Astrophysics Data System (ADS)

    Lim, Hyun; Hirschmann, Eric; Neilsen, David; Anderson, Matthew; Debuhr, Jackson; Zhang, Bo

    2016-03-01

    Highly accurate simulations of binary black holes and neutron stars are needed to address a variety of interesting problems in relativistic astrophysics. We present a new method for the solving the Einstein equations (BSSN formulation) using iterated interpolating wavelets. Wavelet coefficients provide a direct measure of the local approximation error for the solution and place collocation points that naturally adapt to features of the solution. Further, they exhibit exponential convergence on unevenly spaced collection points. The parallel implementation of the wavelet simulation framework presented here deviates from conventional practice in combining multi-threading with a form of message-driven computation sometimes referred to as asynchronous multitasking.

  16. The Evolution of Compact Binary Star Systems.

    PubMed

    Postnov, Konstantin A; Yungelson, Lev R

    2006-01-01

    We review the formation and evolution of compact binary stars consisting of white dwarfs (WDs), neutron stars (NSs), and black holes (BHs). Binary NSs and BHs are thought to be the primary astrophysical sources of gravitational waves (GWs) within the frequency band of ground-based detectors, while compact binaries of WDs are important sources of GWs at lower frequencies to be covered by space interferometers (LISA). Major uncertainties in the current understanding of properties of NSs and BHs most relevant to the GW studies are discussed, including the treatment of the natal kicks which compact stellar remnants acquire during the core collapse of massive stars and the common envelope phase of binary evolution. We discuss the coalescence rates of binary NSs and BHs and prospects for their detections, the formation and evolution of binary WDs and their observational manifestations. Special attention is given to AM CVn-stars - compact binaries in which the Roche lobe is filled by another WD or a low-mass partially degenerate helium-star, as these stars are thought to be the best LISA verification binary GW sources.

  17. The Evolution of Compact Binary Star Systems.

    PubMed

    Postnov, Konstantin A; Yungelson, Lev R

    2014-01-01

    We review the formation and evolution of compact binary stars consisting of white dwarfs (WDs), neutron stars (NSs), and black holes (BHs). Mergings of compact-star binaries are expected to be the most important sources for forthcoming gravitational-wave (GW) astronomy. In the first part of the review, we discuss observational manifestations of close binaries with NS and/or BH components and their merger rate, crucial points in the formation and evolution of compact stars in binary systems, including the treatment of the natal kicks, which NSs and BHs acquire during the core collapse of massive stars and the common envelope phase of binary evolution, which are most relevant to the merging rates of NS-NS, NS-BH and BH-BH binaries. The second part of the review is devoted mainly to the formation and evolution of binary WDs and their observational manifestations, including their role as progenitors of cosmologically-important thermonuclear SN Ia. We also consider AM CVn-stars, which are thought to be the best verification binary GW sources for future low-frequency GW space interferometers.

  18. System Simulation by Recursive Feedback: Coupling A Set of Stand-Alone Subsystem Simulations

    NASA Technical Reports Server (NTRS)

    Nixon, Douglas D.; Hanson, John M. (Technical Monitor)

    2002-01-01

    Recursive feedback is defined and discussed as a framework for development of specific algorithms and procedures that propagate the time-domain solution for a dynamical system simulation consisting of multiple numerically coupled self-contained stand-alone subsystem simulations. A satellite motion example containing three subsystems (other dynamics, attitude dynamics, and aerodynamics) has been defined and constructed using this approach. Conventional solution methods are used in the subsystem simulations. Centralized and distributed versions of coupling structure have been addressed. Numerical results are evaluated by direct comparison with a standard total-system simultaneous-solution approach.

  19. Recursive solution of number of reachable states of a simple subclass of FMS

    NASA Astrophysics Data System (ADS)

    Chao, Daniel Yuh

    2014-03-01

    This paper aims to compute the number of reachable (forbidden, live and deadlock) states for flexible manufacturing systems (FMS) without the construction of reachability graph. The problem is nontrivial and takes, in general, an exponential amount of time to solve. Hence, this paper focusses on a simple version of Systems of Simple Sequential Processes with Resources (S3PR), called kth-order system, where each resource place holds one token to be shared between two processes. The exact number of reachable (forbidden, live and deadlock) states can be computed recursively.

  20. Chandrasekhar-type algorithms for fast recursive estimation in linear systems with constant parameters

    NASA Technical Reports Server (NTRS)

    Choudhury, A. K.; Djalali, M.

    1975-01-01

    In this recursive method proposed, the gain matrix for the Kalman filter and the convariance of the state vector are computed not via the Riccati equation, but from certain other equations. These differential equations are of Chandrasekhar-type. The 'invariant imbedding' idea resulted in the reduction of the basic boundary value problem of transport theory to an equivalent initial value system, a significant computational advance. Initial value experience showed that there is some computational savings in the method and the loss of positive definiteness of the covariance matrix is less vulnerable.

  1. Recursive algorithms for bias and gain nonuniformity correction in infrared videos.

    PubMed

    Pipa, Daniel R; da Silva, Eduardo A B; Pagliari, Carla L; Diniz, Paulo S R

    2012-12-01

    Infrared focal-plane array (IRFPA) detectors suffer from fixed-pattern noise (FPN) that degrades image quality, which is also known as spatial nonuniformity. FPN is still a serious problem, despite recent advances in IRFPA technology. This paper proposes new scene-based correction algorithms for continuous compensation of bias and gain nonuniformity in FPA sensors. The proposed schemes use recursive least-square and affine projection techniques that jointly compensate for both the bias and gain of each image pixel, presenting rapid convergence and robustness to noise. The synthetic and real IRFPA videos experimentally show that the proposed solutions are competitive with the state-of-the-art in FPN reduction, by presenting recovered images with higher fidelity.

  2. Separation in 5 Msun Binaries

    NASA Astrophysics Data System (ADS)

    Evans, Nancy R.; Bond, H. E.; Schaefer, G.; Mason, B. D.; Karovska, M.; Tingle, E.

    2013-01-01

    Cepheids (5 Msun stars) provide an excellent sample for determining the binary properties of fairly massive stars. International Ultraviolet Explorer (IUE) observations of Cepheids brighter than 8th magnitude resulted in a list of ALL companions more massive than 2.0 Msun uniformly sensitive to all separations. Hubble Space Telescope Wide Field Camera 3 (WFC3) has resolved three of these binaries (Eta Aql, S Nor, and V659 Cen). Combining these separations with orbital data in the literature, we derive an unbiased distribution of binary separations for a sample of 18 Cepheids, and also a distribution of mass ratios. The distribution of orbital periods shows that the 5 Msun binaries prefer shorter periods than 1 Msun stars, reflecting differences in star formation processes.

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

    NASA Technical Reports Server (NTRS)

    Lin, Shu; Fossorier, Marc

    1998-01-01

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

  4. Research on the Orbital Period of Massive Binaries

    NASA Astrophysics Data System (ADS)

    Zhao, E.; Qain, S.

    2011-12-01

    Massive binary is the kind of binary, whose spectral type is earlier than B5. Research on massive binary plays an important role in the mass and angular momentum transfer or loss between the components, and the evolution of binary. Some massive binaries are observed and analyzed, including O-type binary LY Aur, B-type contact binary RZ Pyx and B-type semi-detached binary AI Cru. It is found that all of their periods have a long-term increasing, which indicates that the system is undergoing a Case A slow mass transfer stage on the nuclear time-scale of the secondary. Moreover, analysis show a cyclic change of orbital period, which can be explained by the light-travel effect time of the third body.

  5. A ROSAT Survey of Contact Binary Stars

    NASA Astrophysics Data System (ADS)

    Geske, M. T.; Gettel, S. J.; McKay, T. A.

    2006-01-01

    Contact binary stars are common variable stars that are all believed to emit relatively large fluxes of X-rays. In this work we combine a large new sample of contact binary stars derived from the ROTSE-I telescope with X-ray data from the ROSAT All Sky Survey (RASS) to estimate the X-ray volume emissivity of contact binary stars in the Galaxy. We obtained X-ray fluxes for 140 contact binaries from the RASS, as well as two additional stars observed by the XMM-Newton observatory. From these data we confirm the emission of X-rays from all contact binary systems, with typical luminosities of approximately 1.0×1030 ergs s-1. Combining calculated luminosities with an estimated contact binary space density, we find that contact binaries do not have strong enough X-ray emission to account for a significant portion of the Galactic X-ray background.

  6. Constraining Accreting Binary Populations in Normal Galaxies

    NASA Astrophysics Data System (ADS)

    Lehmer, Bret; Hornschemeier, A.; Basu-Zych, A.; Fragos, T.; Jenkins, L.; Kalogera, V.; Ptak, A.; Tzanavaris, P.; Zezas, A.

    2011-01-01

    X-ray emission from accreting binary systems (X-ray binaries) uniquely probe the binary phase of stellar evolution and the formation of compact objects such as neutron stars and black holes. A detailed understanding of X-ray binary systems is needed to provide physical insight into the formation and evolution of the stars involved, as well as the demographics of interesting binary remnants, such as millisecond pulsars and gravitational wave sources. Our program makes wide use of Chandra observations and complementary multiwavelength data sets (through, e.g., the Spitzer Infrared Nearby Galaxies Survey [SINGS] and the Great Observatories Origins Deep Survey [GOODS]), as well as super-computing facilities, to provide: (1) improved calibrations for correlations between X-ray binary emission and physical properties (e.g., star-formation rate and stellar mass) for galaxies in the local Universe; (2) new physical constraints on accreting binary processes (e.g., common-envelope phase and mass transfer) through the fitting of X-ray binary synthesis models to observed local galaxy X-ray binary luminosity functions; (3) observational and model constraints on the X-ray evolution of normal galaxies over the last 90% of cosmic history (since z 4) from the Chandra Deep Field surveys and accreting binary synthesis models; and (4) predictions for deeper observations from forthcoming generations of X-ray telesopes (e.g., IXO, WFXT, and Gen-X) to provide a science driver for these missions. In this talk, we highlight the details of our program and discuss recent results.

  7. Galaxy Rotation and Rapid Supermassive Binary Coalescence

    NASA Astrophysics Data System (ADS)

    Holley-Bockelmann, Kelly; Khan, Fazeel Mahmood

    2015-09-01

    Galaxy mergers usher the supermassive black hole (SMBH) in each galaxy to the center of the potential, where they form an SMBH binary. The binary orbit shrinks by ejecting stars via three-body scattering, but ample work has shown that in spherical galaxy models, the binary separation stalls after ejecting all the stars in its loss cone—this is the well-known final parsec problem. However, it has been shown that SMBH binaries in non-spherical galactic nuclei harden at a nearly constant rate until reaching the gravitational wave regime. Here we use a suite of direct N-body simulations to follow SMBH binary evolution in both corotating and counterrotating flattened galaxy models. For N > 500 K, we find that the evolution of the SMBH binary is convergent and is independent of the particle number. Rotation in general increases the hardening rate of SMBH binaries even more effectively than galaxy geometry alone. SMBH binary hardening rates are similar for co- and counterrotating galaxies. In the corotating case, the center of mass of the SMBH binary settles into an orbit that is in corotation resonance with the background rotating model, and the coalescence time is roughly a few 100 Myr faster than a non-rotating flattened model. We find that counterrotation drives SMBHs to coalesce on a nearly radial orbit promptly after forming a hard binary. We discuss the implications for gravitational wave astronomy, hypervelocity star production, and the effect on the structure of the host galaxy.

  8. Confirmation of the binary status of Chamaeleon Hα 2 - a very young low-mass binary in Chamaeleon

    NASA Astrophysics Data System (ADS)

    Schmidt, T. O. B.; Neuhäuser, R.; Vogt, N.; Seifahrt, A.; Roell, T.; Bedalov, A.

    2008-06-01

    Context: Neuhäuser & Comerón (1998, Science, 282, 83; 1999, A&A, 350, 612) presented direct imaging evidence, as well as first spectra, of several young stellar and sub-stellar M6- to M8-type objects in the Cha I dark cloud. One of these objects is Cha Hα 2, classified as brown dwarf candidate in several publications and suggested as possible binary in Neuhäuser et al. (2002, A&A, 384, 999). Aims: We have searched around Cha Hα 2 for close and faint companions with adaptive optics imaging. Methods: Two epochs of direct imaging data were taken with the Very Large Telescope (VLT) Adaptive Optics instrument NACO in February 2006 and March 2007 in Ks-band together with a Hipparcos binary for astrometric calibration. Moreover, we took a J-band image in March 2007 to get color information. We retrieved an earlier image from 2005 from the European Southern Observatory (ESO) Science Archive Facility, increasing the available time coverage. After confirmation of common proper motion, we deduce physical parameters of the objects by spectroscopy, like temperature and mass. Results: We find Cha Hα 2 to be a very close binary of 0.16 arcsec separation, having a flux ratio of 0.91, thus having almost equal brightness and indistinguishable spectral types within the errors. We show that the two tentative components of Cha Hα 2 form a common proper motion pair, and that neither component is a non-moving background object. We even find evidence for orbital motion. A combined spectrum of both stars spanning optical and near-infrared parts of the spectral energy distribution yields a temperature of 3000 ± 100 K, corresponding to a spectral type of M6 ± 1 and a surface gravity of log{g} = 4.0+0.75-0.5, both from a comparison with GAIA model atmospheres. Furthermore, we obtained an optical extinction of AV ≃ 4.3 mag from this comparison. Conclusions: We derive masses of 0.110 M⊙ (≥0.070 M⊙) and 0.124 M⊙ (≥0.077 M⊙) for the two components of Cha Hα 2, i

  9. Biclustering sparse binary genomic data.

    PubMed

    van Uitert, Miranda; Meuleman, Wouter; Wessels, Lodewyk

    2008-12-01

    Genomic datasets often consist of large, binary, sparse data matrices. In such a dataset, one is often interested in finding contiguous blocks that (mostly) contain ones. This is a biclustering problem, and while many algorithms have been proposed to deal with gene expression data, only two algorithms have been proposed that specifically deal with binary matrices. None of the gene expression biclustering algorithms can handle the large number of zeros in sparse binary matrices. The two proposed binary algorithms failed to produce meaningful results. In this article, we present a new algorithm that is able to extract biclusters from sparse, binary datasets. A powerful feature is that biclusters with different numbers of rows and columns can be detected, varying from many rows to few columns and few rows to many columns. It allows the user to guide the search towards biclusters of specific dimensions. When applying our algorithm to an input matrix derived from TRANSFAC, we find transcription factors with distinctly dissimilar binding motifs, but a clear set of common targets that are significantly enriched for GO categories.

  10. Hidden slow pulsars in binaries

    NASA Technical Reports Server (NTRS)

    Tavani, Marco; Brookshaw, Leigh

    1993-01-01

    The recent discovery of the binary containing the slow pulsar PSR 1718-19 orbiting around a low-mass companion star adds new light on the characteristics of binary pulsars. The properties of the radio eclipses of PSR 1718-19 are the most striking observational characteristics of this system. The surface of the companion star produces a mass outflow which leaves only a small 'window' in orbital phase for the detection of PSR 1718-19 around 400 MHz. At this observing frequency, PSR 1718-19 is clearly observable only for about 1 hr out of the total 6.2 hr orbital period. The aim of this Letter is twofold: (1) to model the hydrodynamical behavior of the eclipsing material from the companion star of PSR 1718-19 and (2) to argue that a population of binary slow pulsars might have escaped detection in pulsar surveys carried out at 400 MHz. The possible existence of a population of partially or totally hidden slow pulsars in binaries will have a strong impact on current theories of binary evolution of neutron stars.

  11. Eclipsing Binaries in Open Clusters

    NASA Astrophysics Data System (ADS)

    Southworth, John; Clausen, Jens Viggo

    2006-08-01

    The study of detached eclipsing binaries in open clusters can provide stringent tests of theoretical stellar evolutionary models, which must simultaneously fit the masses, radii, and luminosities of the eclipsing stars and the radiative properties of every other star in the cluster. We review recent progress in such studies and discuss two unusually interesting objects currently under analysis. GV Carinae is an A0 m + A8 m binary in the Southern open cluster NGC 3532; its eclipse depths have changed by 0.1 mag between 1990 and 2001, suggesting that its orbit is being perturbed by a relatively close third body. DW Carinae is a high-mass unevolved B1 V + B1 V binary in the very young open cluster Collinder 228, and displays double-peaked emission in the centre of the Hα line which is characteristic of Be stars. We conclude by pointing out that the great promise of eclipsing binaries in open clusters can only be satisfied when both the binaries and their parent clusters are well-observed, a situation which is less common than we would like.

  12. Tuning into Scorpius X-1: adapting a continuous gravitational-wave search for a known binary system

    NASA Astrophysics Data System (ADS)

    Meadors, Grant David; Goetz, Evan; Riles, Keith

    2016-05-01

    We describe how the TwoSpect data analysis method for continuous gravitational waves (GWs) has been tuned for directed sources such as the low-mass X-ray binary (LMXB), Scorpius X-1 (Sco X-1). A comparison of five search algorithms generated simulations of the orbital and GW parameters of Sco X-1. Whereas that comparison focused on relative performance, here the simulations help quantify the sensitivity enhancement and parameter estimation abilities of this directed method, derived from an all-sky search for unknown sources, using doubly Fourier-transformed data. Sensitivity is shown to be enhanced when the source sky location and period are known, because we can run a fully templated search, bypassing the all-sky hierarchical stage using an incoherent harmonic sum. The GW strain and frequency, as well as the projected semi-major axis of the binary system, are recovered and uncertainty estimated, for simulated signals that are detected. Upper limits for GW strain are set for undetected signals. Applications to future GW observatory data are discussed. Robust against spin-wandering and computationally tractable despite an unknown frequency, this directed search is an important new tool for finding gravitational signals from LMXBs.

  13. Dynamics and Adaptive Control for Stability Recovery of Damaged Aircraft

    NASA Technical Reports Server (NTRS)

    Nguyen, Nhan; Krishnakumar, Kalmanje; Kaneshige, John; Nespeca, Pascal

    2006-01-01

    This paper presents a recent study of a damaged generic transport model as part of a NASA research project to investigate adaptive control methods for stability recovery of damaged aircraft operating in off-nominal flight conditions under damage and or failures. Aerodynamic modeling of damage effects is performed using an aerodynamic code to assess changes in the stability and control derivatives of a generic transport aircraft. Certain types of damage such as damage to one of the wings or horizontal stabilizers can cause the aircraft to become asymmetric, thus resulting in a coupling between the longitudinal and lateral motions. Flight dynamics for a general asymmetric aircraft is derived to account for changes in the center of gravity that can compromise the stability of the damaged aircraft. An iterative trim analysis for the translational motion is developed to refine the trim procedure by accounting for the effects of the control surface deflection. A hybrid direct-indirect neural network, adaptive flight control is proposed as an adaptive law for stabilizing the rotational motion of the damaged aircraft. The indirect adaptation is designed to estimate the plant dynamics of the damaged aircraft in conjunction with the direct adaptation that computes the control augmentation. Two approaches are presented 1) an adaptive law derived from the Lyapunov stability theory to ensure that the signals are bounded, and 2) a recursive least-square method for parameter identification. A hardware-in-the-loop simulation is conducted and demonstrates the effectiveness of the direct neural network adaptive flight control in the stability recovery of the damaged aircraft. A preliminary simulation of the hybrid adaptive flight control has been performed and initial data have shown the effectiveness of the proposed hybrid approach. Future work will include further investigations and high-fidelity simulations of the proposed hybrid adaptive Bight control approach.

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

    PubMed

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

    2017-09-08

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

  15. Simulations of binary black hole mergers

    NASA Astrophysics Data System (ADS)

    Lovelace, Geoffrey

    2017-01-01

    Advanced LIGO's observations of merging binary black holes have inaugurated the era of gravitational wave astronomy. Accurate models of binary black holes and the gravitational waves they emit are helping Advanced LIGO to find as many gravitational waves as possible and to learn as much as possible about the waves' sources. These models require numerical-relativity simulations of binary black holes, because near the time when the black holes merge, all analytic approximations break down. Following breakthroughs in 2005, many research groups have built numerical-relativity codes capable of simulating binary black holes. In this talk, I will discuss current challenges in simulating binary black holes for gravitational-wave astronomy, and I will discuss the tremendous progress that has already enabled such simulations to become an essential tool for Advanced LIGO.

  16. An adaptive mesh-moving and refinement procedure for one-dimensional conservation laws

    NASA Technical Reports Server (NTRS)

    Biswas, Rupak; Flaherty, Joseph E.; Arney, David C.

    1993-01-01

    We examine the performance of an adaptive mesh-moving and /or local mesh refinement procedure for the finite difference solution of one-dimensional hyperbolic systems of conservation laws. Adaptive motion of a base mesh is designed to isolate spatially distinct phenomena, and recursive local refinement of the time step and cells of the stationary or moving base mesh is performed in regions where a refinement indicator exceeds a prescribed tolerance. These adaptive procedures are incorporated into a computer code that includes a MacCormack finite difference scheme wih Davis' artificial viscosity model and a discretization error estimate based on Richardson's extrapolation. Experiments are conducted on three problems in order to qualify the advantages of adaptive techniques relative to uniform mesh computations and the relative benefits of mesh moving and refinement. Key results indicate that local mesh refinement, with and without mesh moving, can provide reliable solutions at much lower computational cost than possible on uniform meshes; that mesh motion can be used to improve the results of uniform mesh solutions for a modest computational effort; that the cost of managing the tree data structure associated with refinement is small; and that a combination of mesh motion and refinement reliably produces solutions for the least cost per unit accuracy.

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

    PubMed

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

    2015-01-01

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

  18. Searching for Unresolved Binary Brown Dwarfs

    NASA Astrophysics Data System (ADS)

    Albretsen, Jacob; Stephens, Denise

    2007-10-01

    There are currently L and T brown dwarfs (BDs) with errors in their classification of +/- 1 to 2 spectra types. Metallicity and gravitational differences have accounted for some of these discrepancies, and recent studies have shown unresolved binary BDs may offer some explanation as well. However limitations in technology and resources often make it difficult to clearly resolve an object that may be binary in nature. Stephens and Noll (2006) identified statistically strong binary source candidates from Hubble Space Telescope (HST) images of Trans-Neptunian Objects (TNOs) that were apparently unresolved using model point-spread functions for single and binary sources. The HST archive contains numerous observations of BDs using the Near Infrared Camera and Multi-Object Spectrometer (NICMOS) that have never been rigorously analyzed for binary properties. Using methods developed by Stephens and Noll (2006), BD observations from the HST data archive are being analyzed for possible unresolved binaries. Preliminary results will be presented. This technique will identify potential candidates for future observations to determine orbital information.

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

    PubMed Central

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

    2013-01-01

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

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

    PubMed

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

    2013-01-01

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

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

  2. GALAXY ROTATION AND RAPID SUPERMASSIVE BINARY COALESCENCE

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

    Holley-Bockelmann, Kelly; Khan, Fazeel Mahmood, E-mail: k.holley@vanderbilt.edu

    2015-09-10

    Galaxy mergers usher the supermassive black hole (SMBH) in each galaxy to the center of the potential, where they form an SMBH binary. The binary orbit shrinks by ejecting stars via three-body scattering, but ample work has shown that in spherical galaxy models, the binary separation stalls after ejecting all the stars in its loss cone—this is the well-known final parsec problem. However, it has been shown that SMBH binaries in non-spherical galactic nuclei harden at a nearly constant rate until reaching the gravitational wave regime. Here we use a suite of direct N-body simulations to follow SMBH binary evolutionmore » in both corotating and counterrotating flattened galaxy models. For N > 500 K, we find that the evolution of the SMBH binary is convergent and is independent of the particle number. Rotation in general increases the hardening rate of SMBH binaries even more effectively than galaxy geometry alone. SMBH binary hardening rates are similar for co- and counterrotating galaxies. In the corotating case, the center of mass of the SMBH binary settles into an orbit that is in corotation resonance with the background rotating model, and the coalescence time is roughly a few 100 Myr faster than a non-rotating flattened model. We find that counterrotation drives SMBHs to coalesce on a nearly radial orbit promptly after forming a hard binary. We discuss the implications for gravitational wave astronomy, hypervelocity star production, and the effect on the structure of the host galaxy.« less

  3. Binary interaction dominates the evolution of massive stars.

    PubMed

    Sana, H; de Mink, S E; de Koter, A; Langer, N; Evans, C J; Gieles, M; Gosset, E; Izzard, R G; Le Bouquin, J-B; Schneider, F R N

    2012-07-27

    The presence of a nearby companion alters the evolution of massive stars in binary systems, leading to phenomena such as stellar mergers, x-ray binaries, and gamma-ray bursts. Unambiguous constraints on the fraction of massive stars affected by binary interaction were lacking. We simultaneously measured all relevant binary characteristics in a sample of Galactic massive O stars and quantified the frequency and nature of binary interactions. More than 70% of all massive stars will exchange mass with a companion, leading to a binary merger in one-third of the cases. These numbers greatly exceed previous estimates and imply that binary interaction dominates the evolution of massive stars, with implications for populations of massive stars and their supernovae.

  4. SECULAR EVOLUTION OF BINARIES NEAR MASSIVE BLACK HOLES: FORMATION OF COMPACT BINARIES, MERGER/COLLISION PRODUCTS AND G2-LIKE OBJECTS

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

    Prodan, Snezana; Antonini, Fabio; Perets, Hagai B., E-mail: sprodan@cita.utoronto.ca, E-mail: antonini@cita.utoronto.ca

    2015-02-01

    Here we discuss the evolution of binaries around massive black holes (MBHs) in nuclear stellar clusters. We focus on their secular evolution due to the perturbation by the MBHs, while simplistically accounting for their collisional evolution. Binaries with highly inclined orbits with respect to their orbits around MBHs are strongly affected by secular processes, which periodically change their eccentricities and inclinations (e.g., Kozai-Lidov cycles). During periapsis approach, dissipative processes such as tidal friction may become highly efficient, and may lead to shrinkage of a binary orbit and even to its merger. Binaries in this environment can therefore significantly change theirmore » orbital evolution due to the MBH third-body perturbative effects. Such orbital evolution may impinge on their later stellar evolution. Here we follow the secular dynamics of such binaries and its coupling to tidal evolution, as well as the stellar evolution of such binaries on longer timescales. We find that stellar binaries in the central parts of nuclear stellar clusters (NSCs) are highly likely to evolve into eccentric and/or short-period binaries, and become strongly interacting binaries either on the main sequence (at which point they may even merge), or through their later binary stellar evolution. The central parts of NSCs therefore catalyze the formation and evolution of strongly interacting binaries, and lead to the enhanced formation of blue stragglers, X-ray binaries, gravitational wave sources, and possible supernova progenitors. Induced mergers/collisions may also lead to the formation of G2-like cloud-like objects such as the one recently observed in the Galactic center.« less

  5. Characterization of the benchmark binary NLTT 33370 {sup ,}

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

    Schlieder, Joshua E.; Bonnefoy, Mickaël; Herbst, T. M.

    2014-03-01

    We confirm the binary nature of the nearby, very low mass (VLM) system NLTT 33370 with adaptive optics imaging and present resolved near-infrared photometry and integrated light optical and near-infrared spectroscopy to characterize the system. VLT-NaCo and LBTI-LMIRCam images show significant orbital motion between 2013 February and 2013 April. Optical spectra reveal weak, gravity-sensitive alkali lines and strong lithium 6708 Å absorption that indicate the system is younger than field age. VLT-SINFONI near-IR spectra also show weak, gravity-sensitive features and spectral morphology that is consistent with other young VLM dwarfs. We combine the constraints from all age diagnostics to estimatemore » a system age of ∼30-200 Myr. The 1.2-4.7 μm spectral energy distribution of the components point toward T {sub eff} = 3200 ± 500 K and T {sub eff} = 3100 ± 500 K for NLTT 33370 A and B, respectively. The observed spectra, derived temperatures, and estimated age combine to constrain the component spectral types to the range M6-M8. Evolutionary models predict masses of 97{sub −48}{sup +41} M{sub Jup} and 91{sub −44}{sup +41} M{sub Jup} from the estimated luminosities of the components. KPNO-Phoenix spectra allow us to estimate the systemic radial velocity of the binary. The Galactic kinematics of NLTT 33370AB are broadly consistent with other young stars in the solar neighborhood. However, definitive membership in a young, kinematic group cannot be assigned at this time and further follow-up observations are necessary to fully constrain the system's kinematics. The proximity, age, and late-spectral type of this binary make it very novel and an ideal target for rapid, complete orbit determination. The system is one of only a few model calibration benchmarks at young ages and VLMs.« less

  6. The Großschwabhausen binary survey

    NASA Astrophysics Data System (ADS)

    Mugrauer, M.; Buder, S.; Reum, F.; Birth, A.

    2017-01-01

    Background: Since 2009, the Großschwabhausen binary survey is being carried out at the University Observatory Jena. This new imaging survey uses available time slots during photometric monitoring campaigns, caused by nonphotometric weather conditions, which often exhibit good atmospheric seeing. The goal of the project is to obtain current relative astrometric measurements of the binary systems that are listed in the Washington Visual Double Star Catalog. Materials and Methods: For the survey we use the Refraktor-Teleskop-Kamera at the University Observatory Jena to take imaging data of selected visual binary systems. Results: In this paper, we characterize the target sample of the survey, describe the imaging observations and the astrometric measurements including the astrometric calibration, and present the relative astrometric measures of 352 binaries that could be obtained during the course of the Großschwabhausen binary survey, so far.

  7. COSMIC probes into compact binary formation and evolution

    NASA Astrophysics Data System (ADS)

    Breivik, Katelyn

    2018-01-01

    The population of compact binaries in the galaxy represents the final state of all binaries that have lived up to the present epoch. Compact binaries present a unique opportunity to probe binary evolution since many of the interactions binaries experience can be imprinted on the compact binary population. By combining binary evolution simulations with catalogs of observable compact binary systems, we can distill the dominant physical processes that govern binary star evolution, as well as predict the abundance and variety of their end products.The next decades herald a previously unseen opportunity to study compact binaries. Multi-messenger observations from telescopes across all wavelengths and gravitational-wave observatories spanning several decades of frequency will give an unprecedented view into the structure of these systems and the composition of their components. Observations will not always be coincident and in some cases may be separated by several years, providing an avenue for simulations to better constrain binary evolution models in preparation for future observations.I will present the results of three population synthesis studies of compact binary populations carried out with the Compact Object Synthesis and Monte Carlo Investigation Code (COSMIC). I will first show how binary-black-hole formation channels can be understood with LISA observations. I will then show how the population of double white dwarfs observed with LISA and Gaia could provide a detailed view of mass transfer and accretion. Finally, I will show that Gaia could discover thousands black holes in the Milky Way through astrometric observations, yielding view into black-hole astrophysics that is complementary to and independent from both X-ray and gravitational-wave astronomy.

  8. BD -22 5866: A Low-Mass, Quadruple-lined Spectroscopic and Eclipsing Binary

    NASA Astrophysics Data System (ADS)

    Shkolnik, Evgenya; Liu, Michael C.; Reid, I. Neill; Hebb, Leslie; Cameron, Andrew C.; Torres, Carlos A.; Wilson, David M.

    2008-08-01

    We report our discovery of an extremely rare, low-mass, quadruple-lined spectroscopic binary BD -22 5866 (=NLTT 53279, integrated spectral type = M0 V), found during an ongoing search for the youngest M dwarfs in the solar neighborhood. From the cross-correlation function, we are able to measure relative flux levels, estimate the spectral types of the components, and set upper limits on the orbital periods and separations. The resulting system is hierarchical, composed of a K7 + K7 binary and an M1 + M2 binary with semimajor axes of aAsin iA <= 0.06 and aBsin iB <= 0.30 AU. A subsequent search of the SuperWASP photometric database revealed that the K7 + K7 binary is eclipsing with a period of 2.21 days and at an inclination angle of 85°. Within uncertainties of 5%, the masses and radii of both components appear to be equal (0.59 M⊙, 0.61 R⊙). These two tightly orbiting stars (a = 0.035 AU) are in synchronous rotation, causing the observed excess Ca II, Hα, X-ray, and UV emission. The fact that the system was unresolved with published adaptive optics imaging, limits the projected physical separation of the two binaries at the time of the observation to dABlesssim 4.1 AU at the photometric distance of 51 pc. The maximum observed radial velocity difference between the A and B binaries limits the orbit to aABsin iAB <= 6.1 AU. As this tight configuration is difficult to reproduce with current formation models of multiple systems, we speculate that an early dynamical process reduced the size of the system, such as the interaction of the two binaries with a circumquadruple disk. Intensive photometric, spectroscopic, and interferometric monitoring, as well as a parallax measurement of this rare quadruple system, is certainly warranted. Based on observations collected at the W. M. Keck Observatory and the Canada-France-Hawaii Telescope (CFHT). The Keck Observatory is operated as a scientific partnership between the California Institute of Technology, the University

  9. Binary versus non-binary information in real time series: empirical results and maximum-entropy matrix models

    NASA Astrophysics Data System (ADS)

    Almog, Assaf; Garlaschelli, Diego

    2014-09-01

    The dynamics of complex systems, from financial markets to the brain, can be monitored in terms of multiple time series of activity of the constituent units, such as stocks or neurons, respectively. While the main focus of time series analysis is on the magnitude of temporal increments, a significant piece of information is encoded into the binary projection (i.e. the sign) of such increments. In this paper we provide further evidence of this by showing strong nonlinear relations between binary and non-binary properties of financial time series. These relations are a novel quantification of the fact that extreme price increments occur more often when most stocks move in the same direction. We then introduce an information-theoretic approach to the analysis of the binary signature of single and multiple time series. Through the definition of maximum-entropy ensembles of binary matrices and their mapping to spin models in statistical physics, we quantify the information encoded into the simplest binary properties of real time series and identify the most informative property given a set of measurements. Our formalism is able to accurately replicate, and mathematically characterize, the observed binary/non-binary relations. We also obtain a phase diagram allowing us to identify, based only on the instantaneous aggregate return of a set of multiple time series, a regime where the so-called ‘market mode’ has an optimal interpretation in terms of collective (endogenous) effects, a regime where it is parsimoniously explained by pure noise, and a regime where it can be regarded as a combination of endogenous and exogenous factors. Our approach allows us to connect spin models, simple stochastic processes, and ensembles of time series inferred from partial information.

  10. Theoretical Models of Protostellar Binary and Multiple Systems with AMR Simulations

    NASA Astrophysics Data System (ADS)

    Matsumoto, Tomoaki; Tokuda, Kazuki; Onishi, Toshikazu; Inutsuka, Shu-ichiro; Saigo, Kazuya; Takakuwa, Shigehisa

    2017-05-01

    We present theoretical models for protostellar binary and multiple systems based on the high-resolution numerical simulation with an adaptive mesh refinement (AMR) code, SFUMATO. The recent ALMA observations have revealed early phases of the binary and multiple star formation with high spatial resolutions. These observations should be compared with theoretical models with high spatial resolutions. We present two theoretical models for (1) a high density molecular cloud core, MC27/L1521F, and (2) a protobinary system, L1551 NE. For the model for MC27, we performed numerical simulations for gravitational collapse of a turbulent cloud core. The cloud core exhibits fragmentation during the collapse, and dynamical interaction between the fragments produces an arc-like structure, which is one of the prominent structures observed by ALMA. For the model for L1551 NE, we performed numerical simulations of gas accretion onto protobinary. The simulations exhibit asymmetry of a circumbinary disk. Such asymmetry has been also observed by ALMA in the circumbinary disk of L1551 NE.

  11. Improving geothermal power plants with a binary cycle

    NASA Astrophysics Data System (ADS)

    Tomarov, G. V.; Shipkov, A. A.; Sorokina, E. V.

    2015-12-01

    The recent development of binary geothermal technology is analyzed. General trends in the introduction of low-temperature geothermal sources are summarized. The use of single-phase low-temperature geothermal fluids in binary power plants proves possible and expedient. The benefits of power plants with a binary cycle in comparison with traditional systems are shown. The selection of the working fluid is considered, and the influence of the fluid's physicochemical properties on the design of the binary power plant is discussed. The design of binary power plants is based on the chemical composition and energy potential of the geothermal fluids and on the landscape and climatic conditions at the intended location. Experience in developing a prototype 2.5 MW Russian binary power unit at Pauzhetka geothermal power plant (Kamchatka) is outlined. Most binary systems are designed individually for a specific location. Means of improving the technology and equipment at binary geothermal power plants are identified. One option is the development of modular systems based on several binary systems that employ the heat from the working fluid at different temperatures.

  12. Fill-in binary loop pulse-torque quantizer

    NASA Technical Reports Server (NTRS)

    Lory, C. B.

    1975-01-01

    Fill-in binary (FIB) loop provides constant heating of torque generator, an advantage of binary current switching. At the same time, it avoids mode-related dead zone and data delay of binary, an advantage of ternary quantization.

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

  14. Binary to Octal and Octal to Binary Code Converter Using Mach-Zehnder Interferometer for High Speed Communication

    NASA Astrophysics Data System (ADS)

    Pal, Amrindra; Kumar, Santosh; Sharma, Sandeep

    2017-05-01

    Binary to octal and octal to binary code converter is a device that allows placing digital information from many inputs to many outputs. Any application of combinational logic circuit can be implemented by using external gates. In this paper, binary to octal and octal to binary code converter is proposed using electro-optic effect inside lithium-niobate based Mach-Zehnder interferometers (MZIs). The MZI structures have powerful capability to switching an optical input signal to a desired output port. The paper constitutes a mathematical description of the proposed device and thereafter simulation using MATLAB. The study is verified using beam propagation method (BPM).

  15. An improved catalog of halo wide binary candidates

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

    Allen, Christine; Monroy-Rodríguez, Miguel A., E-mail: chris@astro.unam.mx

    2014-08-01

    We present an improved catalog of halo wide binaries compiled from an extensive literature search. Most of our binaries stem from the common proper motion binary catalogs by Allen et al. and Chanamé and Gould, but we have also included binaries from the lists of Ryan and Zapatero-Osorio and Martín. All binaries were carefully checked and their distances and systemic radial velocities are included when available. Probable membership to the halo population was tested by means of reduced proper motion diagrams for 251 candidate halo binaries. After eliminating obvious disk binaries, we ended up with 211 probable halo binaries, 150more » of which have radial velocities available. We compute galactic orbits for these 150 binaries and calculate the time they spend within the galactic disk. Considering the full sample of 251 candidate halo binaries as well as several subsamples, we find that the distribution of angular separations (or expected major semiaxes) follows a power law f(a) ∼ a {sup –1} (Oepik's relation) up to different limits. For the 50 most disk-like binaries, those that spend their entire lives within z = ±500 pc, this limit is found to be 19,000 AU (0.09 pc), while for the 50 most halo-like binaries, those that spend on average only 18% of their lives within z = ±500 pc, the limit is 63,000 AU (0.31 pc). In a companion paper, we employ this catalog to establish limits on the masses of the halo massive perturbers (massive compact halo objects).« less

  16. Formation of wide binaries by turbulent fragmentation

    NASA Astrophysics Data System (ADS)

    Lee, Jeong-Eun; Lee, Seokho; Dunham, Michael M.; Tatematsu, Ken'ichi; Choi, Minho; Bergin, Edwin A.; Evans, Neal J.

    2017-08-01

    Understanding the formation of wide-binary systems of very low-mass stars (M ≤ 0.1 solar masses, M⊙) is challenging 1,2,3 . The most obvious route is through widely separated low-mass collapsing fragments produced by turbulent fragmentation of a molecular core4,5. However, close binaries or multiples from disk fragmentation can also evolve to wide binaries over a few initial crossing times of the stellar cluster through tidal evolution6. Finding an isolated low-mass wide-binary system in the earliest stage of formation, before tidal evolution could occur, would prove that turbulent fragmentation is a viable mechanism for (very) low-mass wide binaries. Here we report high-resolution ALMA observations of a known wide-separation protostellar binary, showing that each component has a circumstellar disk. The system is too young7 to have evolved from a close binary, and the disk axes are misaligned, providing strong support for the turbulent fragmentation model. Masses of both stars are derived from the Keplerian rotation of the disks; both are very low-mass stars.

  17. Terrestrial Planet Formation in Binary Star Systems

    NASA Technical Reports Server (NTRS)

    Lissauer, Jack J.; Quintana, Elisa V.; Chambers, John; Duncan, Martin J.; Adams, Fred

    2003-01-01

    Most stars reside in multiple star systems; however, virtually all models of planetary growth have assumed an isolated single star. Numerical simulations of the collapse of molecular cloud cores to form binary stars suggest that disks will form within such systems. Observations indirectly suggest disk material around one or both components within young binary star systems. If planets form at the right places within such circumstellar disks, they can remain in stable orbits within the binary star systems for eons. We are simulating the late stages of growth of terrestrial planets within binary star systems, using a new, ultrafast, symplectic integrator that we have developed for this purpose. We show that the late stages of terrestrial planet formation can indeed take place in a wide variety of binary systems and we have begun to delineate the range of parameter space for which this statement is true. Results of our initial simulations of planetary growth around each star in the alpha Centauri system and other 'wide' binary systems, as well as around both stars in very close binary systems, will be presented.

  18. Optimally cloned binary coherent states

    NASA Astrophysics Data System (ADS)

    Müller, C. R.; Leuchs, G.; Marquardt, Ch.; Andersen, U. L.

    2017-10-01

    Binary coherent state alphabets can be represented in a two-dimensional Hilbert space. We capitalize this formal connection between the otherwise distinct domains of qubits and continuous variable states to map binary phase-shift keyed coherent states onto the Bloch sphere and to derive their quantum-optimal clones. We analyze the Wigner function and the cumulants of the clones, and we conclude that optimal cloning of binary coherent states requires a nonlinearity above second order. We propose several practical and near-optimal cloning schemes and compare their cloning fidelity to the optimal cloner.

  19. Evolution of magnetic cataclysmic binaries

    NASA Technical Reports Server (NTRS)

    Lamb, Don Q.; Melia, F.

    1988-01-01

    The evolution of magnetic cataclysmic binaries is reviewed, with emphasis on the synchronization process by which DQ Herculis stars become AM Herculis stars. The various mechanisms that are thought to drive the evolution of cataclysmic binaries are discussed, and the criterion for stream versus disk accretion, the physics of the accretion and synchronization torques, and the conditions required for synchronization are described. The different physical regimes to which magnetic cataclysmic binaries belong are summarized, and how synchronization may be achieved, and how it may be broken, are considered.

  20. Envelopes in eclipsing binary stars

    NASA Technical Reports Server (NTRS)

    Huang, S.

    1972-01-01

    Theoretical research on eclipsing binaries is presented. The specific areas of investigation are the following: (1) the relevance of envelopes to the study of the light curves of eclipsing binaries, (2) the disk envelope, and (3) the spherical envelope.

  1. Learning moment-based fast local binary descriptor

    NASA Astrophysics Data System (ADS)

    Bellarbi, Abdelkader; Zenati, Nadia; Otmane, Samir; Belghit, Hayet

    2017-03-01

    Recently, binary descriptors have attracted significant attention due to their speed and low memory consumption; however, using intensity differences to calculate the binary descriptive vector is not efficient enough. We propose an approach to binary description called POLAR_MOBIL, in which we perform binary tests between geometrical and statistical information using moments in the patch instead of the classical intensity binary test. In addition, we introduce a learning technique used to select an optimized set of binary tests with low correlation and high variance. This approach offers high distinctiveness against affine transformations and appearance changes. An extensive evaluation on well-known benchmark datasets reveals the robustness and the effectiveness of the proposed descriptor, as well as its good performance in terms of low computation complexity when compared with state-of-the-art real-time local descriptors.

  2. Fast ℓ1-regularized space-time adaptive processing using alternating direction method of multipliers

    NASA Astrophysics Data System (ADS)

    Qin, Lilong; Wu, Manqing; Wang, Xuan; Dong, Zhen

    2017-04-01

    Motivated by the sparsity of filter coefficients in full-dimension space-time adaptive processing (STAP) algorithms, this paper proposes a fast ℓ1-regularized STAP algorithm based on the alternating direction method of multipliers to accelerate the convergence and reduce the calculations. The proposed algorithm uses a splitting variable to obtain an equivalent optimization formulation, which is addressed with an augmented Lagrangian method. Using the alternating recursive algorithm, the method can rapidly result in a low minimum mean-square error without a large number of calculations. Through theoretical analysis and experimental verification, we demonstrate that the proposed algorithm provides a better output signal-to-clutter-noise ratio performance than other algorithms.

  3. Binaries and triples among asteroid pairs

    NASA Astrophysics Data System (ADS)

    Pravec, Petr; Scheirich, Peter; Kušnirák, Peter; Hornoch, Kamil; Galád, Adrián

    2015-08-01

    Despite major achievements obtained during the past two decades, our knowledge of the population and properties of small binary and multiple asteroid systems is still far from advanced. There is a numerous indirect evidence for that most small asteroid systems were formed by rotational fission of cohesionless parent asteroids that were spun up to the critical frequency presumably by YORP, but details of the process are lacking. Furthermore, as we proceed with observations of more and more binary and paired asteroids, we reveal new facts that substantially refine and sometimes change our understanding of the asteroid systems. One significant new finding we have recently obtained is that primaries of many asteroid pairs are actually binary or triple systems. The first such case found is (3749) Balam (Vokrouhlický, ApJL 706, L37, 2009). We have found 9 more binary systems among asteroid pairs within our ongoing NEOSource photometric project since October 2012. They are (6369) 1983 UC, (8306) Shoko, (9783) Tensho-kan, (10123) Fideoja, (21436) Chaoyichi, (43008) 1999 UD31, (44620) 1999 RS43, (46829) 1998 OS14 and (80218) 1999 VO123. We will review their characteristics. These paired binaries as we call them are mostly similar to binaries in the general ("background") population (of unpaired asteroids), but there are a few trends. The paired binaries tend to have larger secondaries with D_2/D_1 = 0.3 to 0.5 and they also tend to be wider systems with 8 of the 10 having orbital periods between 30 and 81 hours, than average among binaries in the general population. There may be also a larger fraction of triples; (3749) Balam is a confirmed triple, having a larger close and a smaller distant satellite, and (8306) Shoko and (10123) Fideoja are suspect triples as they show additional rotational lightcurve components with periods of 61 and 38.8 h that differ from the orbital period of 36.2 and 56.5 h, respectively. The unbound secondaries tend to be of the same size or

  4. Two dimensional recursive digital filters for near real time image processing

    NASA Technical Reports Server (NTRS)

    Olson, D.; Sherrod, E.

    1980-01-01

    A program was designed toward the demonstration of the feasibility of using two dimensional recursive digital filters for subjective image processing applications that require rapid turn around. The concept of the use of a dedicated minicomputer for the processor for this application was demonstrated. The minicomputer used was the HP1000 series E with a RTE 2 disc operating system and 32K words of memory. A Grinnel 256 x 512 x 8 bit display system was used to display the images. Sample images were provided by NASA Goddard on a 800 BPI, 9 track tape. Four 512 x 512 images representing 4 spectral regions of the same scene were provided. These images were filtered with enhancement filters developed during this effort.

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

  6. Robust Speech Enhancement Using Two-Stage Filtered Minima Controlled Recursive Averaging

    NASA Astrophysics Data System (ADS)

    Ghourchian, Negar; Selouani, Sid-Ahmed; O'Shaughnessy, Douglas

    In this paper we propose an algorithm for estimating noise in highly non-stationary noisy environments, which is a challenging problem in speech enhancement. This method is based on minima-controlled recursive averaging (MCRA) whereby an accurate, robust and efficient noise power spectrum estimation is demonstrated. We propose a two-stage technique to prevent the appearance of musical noise after enhancement. This algorithm filters the noisy speech to achieve a robust signal with minimum distortion in the first stage. Subsequently, it estimates the residual noise using MCRA and removes it with spectral subtraction. The proposed Filtered MCRA (FMCRA) performance is evaluated using objective tests on the Aurora database under various noisy environments. These measures indicate the higher output SNR and lower output residual noise and distortion.

  7. A self-adaptive algorithm for traffic sign detection in motion image based on color and shape features

    NASA Astrophysics Data System (ADS)

    Zhang, Ka; Sheng, Yehua; Gong, Zhijun; Ye, Chun; Li, Yongqiang; Liang, Cheng

    2007-06-01

    As an important sub-system in intelligent transportation system (ITS), the detection and recognition of traffic signs from mobile images is becoming one of the hot spots in the international research field of ITS. Considering the problem of traffic sign automatic detection in motion images, a new self-adaptive algorithm for traffic sign detection based on color and shape features is proposed in this paper. Firstly, global statistical color features of different images are computed based on statistics theory. Secondly, some self-adaptive thresholds and special segmentation rules for image segmentation are designed according to these global color features. Then, for red, yellow and blue traffic signs, the color image is segmented to three binary images by these thresholds and rules. Thirdly, if the number of white pixels in the segmented binary image exceeds the filtering threshold, the binary image should be further filtered. Fourthly, the method of gray-value projection is used to confirm top, bottom, left and right boundaries for candidate regions of traffic signs in the segmented binary image. Lastly, if the shape feature of candidate region satisfies the need of real traffic sign, this candidate region is confirmed as the detected traffic sign region. The new algorithm is applied to actual motion images of natural scenes taken by a CCD camera of the mobile photogrammetry system in Nanjing at different time. The experimental results show that the algorithm is not only simple, robust and more adaptive to natural scene images, but also reliable and high-speed on real traffic sign detection.

  8. Confusing Binaries: The Role of Stellar Binaries in Biasing Disk Properties in the Galactic Center

    NASA Astrophysics Data System (ADS)

    Naoz, Smadar; Ghez, Andrea M.; Hees, Aurelien; Do, Tuan; Witzel, Gunther; Lu, Jessica R.

    2018-02-01

    The population of young stars near the supermassive black hole (SMBH) in the Galactic Center (GC) has presented an unexpected challenge to theories of star formation. Kinematic measurements of these stars have revealed a stellar disk structure (with an apparent 20% disk membership) that has provided important clues regarding the origin of these mysterious young stars. However, many of the apparent disk properties are difficult to explain, including the low disk membership fraction and the high eccentricities given the youth of this population. Thus far, all efforts to derive the properties of this disk have made the simplifying assumption that stars at the GC are single stars. Nevertheless, stellar binaries are prevalent in our Galaxy, and recent investigations suggested that they may also be abundant in the Galactic Center. Here, we show that binaries in the disk can largely alter the apparent orbital properties of the disk. The motion of binary members around each other adds a velocity component, which can be comparable to the magnitude of the velocity around the SMBH in the GC. Thus, neglecting the contribution of binaries can significantly vary the inferred stars’ orbital properties. While the disk orientation is unaffected, the apparent disk’s 2D width will be increased to about 11.°2, similar to the observed width. For a population of stars orbiting the SMBH with zero eccentricity, unaccounted for binaries will create a wide apparent eccentricity distribution with an average of 0.23. This is consistent with the observed average eccentricity of the stars’ in the disk. We suggest that this high eccentricity value, which poses a theoretical challenge, may be an artifact of binary stars. Finally, our results suggest that the actual disk membership might be significantly higher than the one inferred by observations that ignore the contribution of binaries, alleviating another theoretical challenge.

  9. Microlensing Signature of Binary Black Holes

    NASA Technical Reports Server (NTRS)

    Schnittman, Jeremy; Sahu, Kailash; Littenberg, Tyson

    2012-01-01

    We calculate the light curves of galactic bulge stars magnified via microlensing by stellar-mass binary black holes along the line-of-sight. We show the sensitivity to measuring various lens parameters for a range of survey cadences and photometric precision. Using public data from the OGLE collaboration, we identify two candidates for massive binary systems, and discuss implications for theories of star formation and binary evolution.

  10. Formation and Evolution of X-ray Binaries

    NASA Astrophysics Data System (ADS)

    Fragkos, Anastasios

    X-ray binaries - mass-transferring binary stellar systems with compact object accretors - are unique astrophysical laboratories. They carry information about many complex physical processes such as star formation, compact object formation, and evolution of interacting binaries. My thesis work involves the study of the formation and evolution of Galactic and extra-galacticX-ray binaries using both detailed and realistic simulation tools, and population synthesis techniques. I applied an innovative analysis method that allows the reconstruction of the full evolutionary history of known black hole X-ray binaries back to the time of compact object formation. This analysis takes into account all the available observationally determined properties of a system, and models in detail four of its evolutionary evolutionary phases: mass transfer through the ongoing X-ray phase, tidal evolution before the onset of Roche-lobe overflow, motion through the Galactic potential after the formation of the black hole, and binary orbital dynamics at the time of core collapse. Motivated by deep extra-galactic Chandra survey observations, I worked on population synthesis models of low-mass X-ray binaries in the two elliptical galaxies NGC3379 and NGC4278. These simulations were targeted at understanding the origin of the shape and normalization of the observed X-ray luminosity functions. In a follow up study, I proposed a physically motivated prescription for the modeling of transient neutron star low-mass X-ray binary properties, such as duty cycle, outburst duration and recurrence time. This prescription enabled the direct comparison of transient low-mass X-ray binary population synthesis models to the Chandra X-ray survey of the two ellipticals NGC3379 and NGC4278. Finally, I worked on population synthesismodels of black holeX-ray binaries in the MilkyWay. This work was motivated by recent developments in observational techniques for the measurement of black hole spin magnitudes in

  11. Threshold detection in an on-off binary communications channel with atmospheric scintillation

    NASA Technical Reports Server (NTRS)

    Webb, W. E.; Marino, J. T., Jr.

    1974-01-01

    The optimum detection threshold in an on-off binary optical communications system operating in the presence of atmospheric turbulence was investigated assuming a poisson detection process and log normal scintillation. The dependence of the probability of bit error on log amplitude variance and received signal strength was analyzed and semi-emperical relationships to predict the optimum detection threshold derived. On the basis of this analysis a piecewise linear model for an adaptive threshold detection system is presented. Bit error probabilities for non-optimum threshold detection system were also investigated.

  12. Threshold detection in an on-off binary communications channel with atmospheric scintillation

    NASA Technical Reports Server (NTRS)

    Webb, W. E.

    1975-01-01

    The optimum detection threshold in an on-off binary optical communications system operating in the presence of atmospheric turbulence was investigated assuming a poisson detection process and log normal scintillation. The dependence of the probability of bit error on log amplitude variance and received signal strength was analyzed and semi-empirical relationships to predict the optimum detection threshold derived. On the basis of this analysis a piecewise linear model for an adaptive threshold detection system is presented. The bit error probabilities for nonoptimum threshold detection systems were also investigated.

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

  14. Machine learning properties of binary wurtzite superlattices

    DOE PAGES

    Pilania, G.; Liu, X. -Y.

    2018-01-12

    The burgeoning paradigm of high-throughput computations and materials informatics brings new opportunities in terms of targeted materials design and discovery. The discovery process can be significantly accelerated and streamlined if one can learn effectively from available knowledge and past data to predict materials properties efficiently. Indeed, a very active area in materials science research is to develop machine learning based methods that can deliver automated and cross-validated predictive models using either already available materials data or new data generated in a targeted manner. In the present paper, we show that fast and accurate predictions of a wide range of propertiesmore » of binary wurtzite superlattices, formed by a diverse set of chemistries, can be made by employing state-of-the-art statistical learning methods trained on quantum mechanical computations in combination with a judiciously chosen numerical representation to encode materials’ similarity. These surrogate learning models then allow for efficient screening of vast chemical spaces by providing instant predictions of the targeted properties. Moreover, the models can be systematically improved in an adaptive manner, incorporate properties computed at different levels of fidelities and are naturally amenable to inverse materials design strategies. Finally, while the learning approach to make predictions for a wide range of properties (including structural, elastic and electronic properties) is demonstrated here for a specific example set containing more than 1200 binary wurtzite superlattices, the adopted framework is equally applicable to other classes of materials as well.« less

  15. Machine learning properties of binary wurtzite superlattices

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

    Pilania, G.; Liu, X. -Y.

    The burgeoning paradigm of high-throughput computations and materials informatics brings new opportunities in terms of targeted materials design and discovery. The discovery process can be significantly accelerated and streamlined if one can learn effectively from available knowledge and past data to predict materials properties efficiently. Indeed, a very active area in materials science research is to develop machine learning based methods that can deliver automated and cross-validated predictive models using either already available materials data or new data generated in a targeted manner. In the present paper, we show that fast and accurate predictions of a wide range of propertiesmore » of binary wurtzite superlattices, formed by a diverse set of chemistries, can be made by employing state-of-the-art statistical learning methods trained on quantum mechanical computations in combination with a judiciously chosen numerical representation to encode materials’ similarity. These surrogate learning models then allow for efficient screening of vast chemical spaces by providing instant predictions of the targeted properties. Moreover, the models can be systematically improved in an adaptive manner, incorporate properties computed at different levels of fidelities and are naturally amenable to inverse materials design strategies. Finally, while the learning approach to make predictions for a wide range of properties (including structural, elastic and electronic properties) is demonstrated here for a specific example set containing more than 1200 binary wurtzite superlattices, the adopted framework is equally applicable to other classes of materials as well.« less

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

  17. Rotational properties of the binary and non-binary populations in the trans-Neptunian belt

    NASA Astrophysics Data System (ADS)

    Thirouin, A.; Noll, K. S.; Ortiz, J. L.; Morales, N.

    2014-09-01

    We present results for the short-term variability of binary trans-Neptunian objects (BTNOs). We performed CCD photometric observations using the 3.58 m Telescopio Nazionale Galileo (TNG), the 1.5 m Sierra Nevada Observatory (OSN) telescope, and the 1.23 m Centro Astronómico Hispano Alemán (CAHA) telescope at Calar Alto Observatory. We present results based on five years of observations and report the short-term variability of six BTNOs. Our sample contains three classical objects: (174567) 2003 MW12, or Varda, (120347) 2004 SB60, or Salacia, and 2002 VT130; one detached disk object: (229762) 2007 UK126; and two resonant objects: (341520) 2007 TY430 and (38628) 2000 EB173, or Huya. For each target, possible rotational periods and/or photometric amplitudes are reported. We also derived some physical properties from their light curves, such as density, primary and secondary sizes, and albedo. We compiled and analyzed a vast light curve database for TNOs including centaurs to determine the light-curve amplitude and spin frequency distributions for the binary and non-binary populations. The mean rotational periods, from the Maxwellian fits to the frequency distributions, are 8.63 ± 0.52 h for the entire sample, 8.37 ± 0.58 h for the sample without the binary population, and 10.11 ± 1.19 h for the binary population alone. Because the centaurs are collisionally more evolved, their rotational periods might not be so primordial. We computed a mean rotational period, from the Maxwellian fit, of 8.86 ± 0.58 h for the sample without the centaur population, and of 8.64 ± 0.67 h considering a sample without the binary and the centaur populations. According to this analysis, regular TNOs spin faster than binaries, which is compatible with the tidal interaction of the binaries. Finally, we examined possible formation models for several systems studied in this work and by our team in previous papers. Appendix A is available in electronic form at http

  18. Terrestrial Planet Formation in Binary Star Systems

    NASA Technical Reports Server (NTRS)

    Lissauer, J. J.; Quintana, E. V.; Adams, F. C.; Chambers, J. E.

    2006-01-01

    Most stars reside in binary/multiple star systems; however, previous models of planet formation have studied growth of bodies orbiting an isolated single star. Disk material has been observed around one or both components of various young close binary star systems. If planets form at the right places within such disks, they can remain dynamically stable for very long times. We have simulated the late stages of growth of terrestrial planets in both circumbinary disks around 'close' binary star systems with stellar separations ($a_B$) in the range 0.05 AU $\\le a_B \\le$ 0.4 AU and binary eccentricities in the range $0 \\le e \\le 0.8$ and circumstellar disks around individual stars with binary separations of tens of AU. The initial disk of planetary embryos is the same as that used for simulating the late stages of terrestrial planet growth within our Solar System and around individual stars in the Alpha Centauri system (Quintana et al. 2002, A.J., 576, 982); giant planets analogous to Jupiter and Saturn are included if their orbits are stable. The planetary systems formed around close binaries with stellar apastron distances less than or equal to 0.2 AU with small stellar eccentricities are very similar to those formed in the Sun-Jupiter-Saturn, whereas planetary systems formed around binaries with larger maximum separations tend to be sparser, with fewer planets, especially interior to 1 AU. Likewise, when the binary periastron exceeds 10 AU, terrestrial planets can form over essentially the entire range of orbits allowed for single stars with Jupiter-like planets, although fewer terrestrial planets tend to form within high eccentricity binary systems. As the binary periastron decreases, the radial extent of the terrestrial planet systems is reduced accordingly. When the periastron is 5 AU, the formation of Earth-like planets near 1 AU is compromised.

  19. Contact binaries in the Trans-neptunian Belt

    NASA Astrophysics Data System (ADS)

    Thirouin, Audrey; Sheppard, Scott S.

    2017-10-01

    A contact binary is made up of two objects that are almost touching or in contact with each other. These systems have been found in the Near-Earth Object population, the main belt of asteroids, the Jupiter Trojans, the comet population and even in the Trans-neptunian belt.Several studies suggest that up to 30% of the Trans-Neptunian Objects (TNOs) could be contact binaries (Sheppard & Jewitt 2004, Lacerda 2011). Contact binaries are not resolvable with the Hubble Space Telescope because of the small separation between the system's components (Noll et al. 2008). Only lightcurves with a characteristic V-/U-shape at the minimum/maximum of brightness and a large amplitude can identify these contact binaries. Despite an expected high fraction of contact binaries, 2001 QG298 is the only confirmed contact binary in the Trans-Neptunian belt, and 2003 SQ317 is a candidate to this class of systems (Sheppard & Jewitt 2004, Lacerda et al. 2014).Recently, using the Lowell’s 4.3m Discovery Channel Telescope and the 6.5m Magellan Telescope, we started a search for contact binaries at the edge of our Solar System. So far, our survey focused on about 40 objects in different dynamical groups of the Trans-Neptunian belt for sparse or complete lightcurves. We report the discovery of 5 new potential contact binaries converting the current estimate of potential/confirmed contact binaries to 7 objects. With one epoch of observations per object, we are not able to model in detail the systems, but we derive estimate for basic information such as shape, size, density of both objects as well as the separation between the system’s components. In this work, we will present these new systems, their basic characteristics, and we will discuss the potential main reservoir of contact binaries in the Trans-neptunian belt.

  20. Mesoscopic model for binary fluids

    NASA Astrophysics Data System (ADS)

    Echeverria, C.; Tucci, K.; Alvarez-Llamoza, O.; Orozco-Guillén, E. E.; Morales, M.; Cosenza, M. G.

    2017-10-01

    We propose a model for studying binary fluids based on the mesoscopic molecular simulation technique known as multiparticle collision, where the space and state variables are continuous, and time is discrete. We include a repulsion rule to simulate segregation processes that does not require calculation of the interaction forces between particles, so binary fluids can be described on a mesoscopic scale. The model is conceptually simple and computationally efficient; it maintains Galilean invariance and conserves the mass and energy in the system at the micro- and macro-scale, whereas momentum is conserved globally. For a wide range of temperatures and densities, the model yields results in good agreement with the known properties of binary fluids, such as the density profile, interface width, phase separation, and phase growth. We also apply the model to the study of binary fluids in crowded environments with consistent results.

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

  2. Kepler eclipsing binary stars. IV. Precise eclipse times for close binaries and identification of candidate three-body systems

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

    Conroy, Kyle E.; Stassun, Keivan G.; Prša, Andrej

    2014-02-01

    We present a catalog of precise eclipse times and analysis of third-body signals among 1279 close binaries in the latest Kepler Eclipsing Binary Catalog. For these short-period binaries, Kepler's 30 minute exposure time causes significant smearing of light curves. In addition, common astrophysical phenomena such as chromospheric activity, as well as imperfections in the light curve detrending process, can create systematic artifacts that may produce fictitious signals in the eclipse timings. We present a method to measure precise eclipse times in the presence of distorted light curves, such as in contact and near-contact binaries which exhibit continuously changing light levelsmore » in and out of eclipse. We identify 236 systems for which we find a timing variation signal compatible with the presence of a third body. These are modeled for the light travel time effect and the basic properties of the third body are derived. This study complements J. A. Orosz et al. (in preparation), which focuses on eclipse timing variations of longer period binaries with flat out-of-eclipse regions. Together, these two papers provide comprehensive eclipse timings for all binaries in the Kepler Eclipsing Binary Catalog, as an ongoing resource freely accessible online to the community.« less

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

    PubMed Central

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

    2015-01-01

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

  4. Young and Waltzing Binary Stars

    NASA Astrophysics Data System (ADS)

    2001-10-01

    ADONIS Observes Low-mass Eclipsing System in Orion Summary A series of very detailed images of a binary system of two young stars have been combined into a movie . In merely 3 days, the stars swing around each other. As seen from the earth, they pass in front of each other twice during a full revolution, producing eclipses during which their combined brightness diminishes . A careful analysis of the orbital motions has now made it possible to deduce the masses of the two dancing stars . Both turn out to be about as heavy as our Sun. But while the Sun is about 4500 million years old, these two stars are still in their infancy. They are located some 1500 light-years away in the Orion star-forming region and they probably formed just 10 million years ago . This is the first time such an accurate determination of the stellar masses could be achieved for a young binary system of low-mass stars . The new result provides an important piece of information for our current understanding of how young stars evolve. The observations were obtained by a team of astronomers from Italy and ESO [1] using the ADaptive Optics Near Infrared System (ADONIS) on the 3.6-m telescope at the ESO La Silla Observatory. PR Photo 29a/01 : The RXJ 0529.4+0041 system before primary eclipse PR Photo 29b/01 : The RXJ 0529.4+0041 system at mid-primary eclipse PR Photo 29c/01 : The RXJ 0529.4+0041 system after primary eclipse PR Photo 29d/01 : The RXJ 0529.4+0041 system before secondary eclipse PR Photo 29e/01 : The RXJ 0529.4+0041 system at mid-secondary eclipse PR Photo 29f/01 : The RXJ 0529.4+0041 system after secondary eclipse PR Video Clip 06/01 : Video of the RXJ 0529.4+0041 system Binary stars and stellar masses Since some time, astronomers have noted that most stars seem to form in binary or multiple systems. This is quite fortunate, as the study of binary stars is the only way in which it is possible to measure directly one of the most fundamental quantities of a star, its mass. The mass of a

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

  6. The Michigan Binary Star Program

    NASA Astrophysics Data System (ADS)

    Lindner, Rudi P.

    2007-07-01

    At the end of the nineteenth century, William J. Hussey and Robert G. Aitken, both at Lick Observatory, began a systematic search for unrecorded binary stars with the aid of the 12" and 36" refracting telescopes at Lick Observatory. Aitken's work (and book on binary stars) are well known, Hussey's contributions less so. In 1905 Hussey, a Michigan engineering graduate, returned to direct the Ann Arbor astronomy program, and immediately he began to design new instrumentation for the study of binary stars and to train potential observers. For a time, he spent six months a year at the La Plata Observatory, where he discovered a number of new pairs and decided upon a major southern hemisphere campaign. He spent a decade obtaining the lenses for a large refractor, through the vicissitudes of war and depression. Finally, he obtained a site in South Africa, a 26" refractor, and a small corps of observers, but he died in London en route to fulfill his dream. His right hand man, Richard Rossiter, established the observatory and spent the next thirty years discovering and measuring binary stars: his personal total is a record for the field. This talk is an account of the methods, results, and utility of the extraordinary binary star factory in the veldt.

  7. Efficient algorithms for dilated mappings of binary trees

    NASA Technical Reports Server (NTRS)

    Iqbal, M. Ashraf

    1990-01-01

    The problem is addressed to find a 1-1 mapping of the vertices of a binary tree onto those of a target binary tree such that the son of a node on the first binary tree is mapped onto a descendent of the image of that node in the second binary tree. There are two natural measures of the cost of this mapping, namely the dilation cost, i.e., the maximum distance in the target binary tree between the images of vertices that are adjacent in the original tree. The other measure, expansion cost, is defined as the number of extra nodes/edges to be added to the target binary tree in order to ensure a 1-1 mapping. An efficient algorithm to find a mapping of one binary tree onto another is described. It is shown that it is possible to minimize one cost of mapping at the expense of the other. This problem arises when designing pipelined arithmetic logic units (ALU) for special purpose computers. The pipeline is composed of ALU chips connected in the form of a binary tree. The operands to the pipeline can be supplied to the leaf nodes of the binary tree which then process and pass the results up to their parents. The final result is available at the root. As each new application may require a distinct nesting of operations, it is useful to be able to find a good mapping of a new binary tree over existing ALU tree. Another problem arises if every distinct required binary tree is known beforehand. Here it is useful to hardwire the pipeline in the form of a minimal supertree that contains all required binary trees.

  8. Binary pulsar evolution: unveiled links and new species

    NASA Astrophysics Data System (ADS)

    Possenti, Andrea

    2013-03-01

    In the last years a series of blind and/or targeted pulsar searches led to almost triple the number of known binary pulsars in the galactic field with respect to a decade ago. The focus will be on few outliers, which are emerging from the average properties of the enlarged binary pulsar population. Some of them may represent the long sought missing links between two kinds of neutron star binaries, while others could represent the stereotype of new groups of binaries, resulting from an evolutionary path which is more exotic than those considered until recently. In particular, a new class of binaries, which can be dubbed Ultra Low Mass Binary Pulsars (ULMBPs), is emerging from recent data.

  9. Clostridium difficile binary toxin CDT

    PubMed Central

    Gerding, Dale N; Johnson, Stuart; Rupnik, Maja; Aktories, Klaus

    2014-01-01

    Binary toxin (CDT) is frequently observed in Clostridium difficile strains associated with increased severity of C. difficile infection (CDI). CDT belongs to the family of binary ADP-ribosylating toxins consisting of two separate toxin components: CDTa, the enzymatic ADP-ribosyltransferase which modifies actin, and CDTb which binds to host cells and translocates CDTa into the cytosol. CDTb is activated by serine proteases and binds to lipolysis stimulated lipoprotein receptor. ADP-ribosylation induces depolymerization of the actin cytoskeleton. Toxin-induced actin depolymerization also produces microtubule-based membrane protrusions which form a network on epithelial cells and increase bacterial adherence. Multiple clinical studies indicate an association between binary toxin genes in C. difficile and increased 30-d CDI mortality independent of PCR ribotype. Further studies including measures of binary toxin in stool, analyses of CDI mortality caused by CDT-producing strains, and examination of the relationship of CDT expression to TcdA and TcdB toxin variants and PCR ribotypes are needed. PMID:24253566

  10. Scattering from binary optics

    NASA Technical Reports Server (NTRS)

    Ricks, Douglas W.

    1993-01-01

    There are a number of sources of scattering in binary optics: etch depth errors, line edge errors, quantization errors, roughness, and the binary approximation to the ideal surface. These sources of scattering can be systematic (deterministic) or random. In this paper, scattering formulas for both systematic and random errors are derived using Fourier optics. These formulas can be used to explain the results of scattering measurements and computer simulations.

  11. Accretion dynamics in pre-main sequence binaries

    NASA Astrophysics Data System (ADS)

    Tofflemire, B.; Mathieu, R.; Herczeg, G.; Ardila, D.; Akeson, R.; Ciardi, D.; Johns-Krull, C.

    Binary stars are a common outcome of star formation. Orbital resonances, especially in short-period systems, are capable of reshaping the distribution and flows of circumstellar material. Simulations of the binary-disk interaction predict a dynamically cleared gap around the central binary, accompanied by periodic ``pulsed'' accretion events that are driven by orbital motion. To place observational constraints on the binary-disk interaction, we have conducted a long-term monitoring program tracing the time-variable accretion behavior of 9 short-period binaries. In this proceeding we present two results from our campaign: 1) the detection of periodic pulsed accretion events in DQ Tau and TWA 3A, and 2) evidence that the TWA 3A primary is the dominant accretor in the system.

  12. Planet Formation in Binary Star Systems

    NASA Astrophysics Data System (ADS)

    Martin, Rebecca

    About half of observed exoplanets are estimated to be in binary systems. Understanding planet formation and evolution in binaries is therefore essential for explaining observed exoplanet properties. Recently, we discovered that a highly misaligned circumstellar disk in a binary system can undergo global Kozai-Lidov (KL) oscillations of the disk inclination and eccentricity. These oscillations likely have a significant impact on the formation and orbital evolution of planets in binary star systems. Planet formation by core accretion cannot operate during KL oscillations of the disk. First, we propose to consider the process of disk mass transfer between the binary members. Secondly, we will investigate the possibility of planet formation by disk fragmentation. Disk self gravity can weaken or suppress the oscillations during the early disk evolution when the disk mass is relatively high for a narrow range of parameters. Thirdly, we will investigate the evolution of a planet whose orbit is initially aligned with respect to the disk, but misaligned with respect to the orbit of the binary. We will study how these processes relate to observations of star-spin and planet orbit misalignment and to observations of planets that appear to be undergoing KL oscillations. Finally, we will analyze the evolution of misaligned multi-planet systems. This theoretical work will involve a combination of analytic and numerical techniques. The aim of this research is to shed some light on the formation of planets in binary star systems and to contribute to NASA's goal of understanding of the origins of exoplanetary systems.

  13. Converting optical scanning holograms of real objects to binary Fourier holograms using an iterative direct binary search algorithm.

    PubMed

    Leportier, Thibault; Park, Min Chul; Kim, You Seok; Kim, Taegeun

    2015-02-09

    In this paper, we present a three-dimensional holographic imaging system. The proposed approach records a complex hologram of a real object using optical scanning holography, converts the complex form to binary data, and then reconstructs the recorded hologram using a spatial light modulator (SLM). The conversion from the recorded hologram to a binary hologram is achieved using a direct binary search algorithm. We present experimental results that verify the efficacy of our approach. To the best of our knowledge, this is the first time that a hologram of a real object has been reconstructed using a binary SLM.

  14. The evolution of photoevaporating viscous discs in binaries

    NASA Astrophysics Data System (ADS)

    Rosotti, Giovanni P.; Clarke, Cathie J.

    2018-02-01

    A large fraction of stars are in binary systems, yet the evolution of protoplanetary discs in binaries has been little explored from the theoretical side. In this paper, we investigate the evolution of the discs surrounding the primary and secondary components of binary systems on the assumption that this is driven by photoevaporation induced by X-rays from the respective star. We show how for close enough separations (20-30 au for average X-ray luminosities) the tidal torque of the companion changes the qualitative behaviour of disc dispersal from inside out to outside in. Fewer transition discs created by photoevaporation are thus expected in binaries. We also demonstrate that in close binaries the reduction in viscous time leads to accelerated disc clearing around both components, consistent with unresolved observations. When looking at the differential disc evolution around the two components, in close binaries discs around the secondary clear first due to the shorter viscous time-scale associated with the smaller outer radius. In wide binaries instead the difference in photoevaporation rate makes the secondaries longer lived, though this is somewhat dependent on the assumed scaling of viscosity with stellar mass. We find that our models are broadly compatible with the growing sample of resolved observations of discs in binaries. We also predict that binaries have higher accretion rates than single stars for the same disc mass. Thus, binaries probably contribute to the observed scatter in the relationship between disc mass and accretion rate in young stars.

  15. Learning Compact Binary Face Descriptor for Face Recognition.

    PubMed

    Lu, Jiwen; Liong, Venice Erin; Zhou, Xiuzhuang; Zhou, Jie

    2015-10-01

    Binary feature descriptors such as local binary patterns (LBP) and its variations have been widely used in many face recognition systems due to their excellent robustness and strong discriminative power. However, most existing binary face descriptors are hand-crafted, which require strong prior knowledge to engineer them by hand. In this paper, we propose a compact binary face descriptor (CBFD) feature learning method for face representation and recognition. Given each face image, we first extract pixel difference vectors (PDVs) in local patches by computing the difference between each pixel and its neighboring pixels. Then, we learn a feature mapping to project these pixel difference vectors into low-dimensional binary vectors in an unsupervised manner, where 1) the variance of all binary codes in the training set is maximized, 2) the loss between the original real-valued codes and the learned binary codes is minimized, and 3) binary codes evenly distribute at each learned bin, so that the redundancy information in PDVs is removed and compact binary codes are obtained. Lastly, we cluster and pool these binary codes into a histogram feature as the final representation for each face image. Moreover, we propose a coupled CBFD (C-CBFD) method by reducing the modality gap of heterogeneous faces at the feature level to make our method applicable to heterogeneous face recognition. Extensive experimental results on five widely used face datasets show that our methods outperform state-of-the-art face descriptors.

  16. Recursive least squares estimation and its application to shallow trench isolation

    NASA Astrophysics Data System (ADS)

    Wang, Jin; Qin, S. Joe; Bode, Christopher A.; Purdy, Matthew A.

    2003-06-01

    In recent years, run-to-run (R2R) control technology has received tremendous interest in semiconductor manufacturing. One class of widely used run-to-run controllers is based on the exponentially weighted moving average (EWMA) statistics to estimate process deviations. Using an EWMA filter to smooth the control action on a linear process has been shown to provide good results in a number of applications. However, for a process with severe drifts, the EWMA controller is insufficient even when large weights are used. This problem becomes more severe when there is measurement delay, which is almost inevitable in semiconductor industry. In order to control drifting processes, a predictor-corrector controller (PCC) and a double EWMA controller have been developed. Chen and Guo (2001) show that both PCC and double-EWMA controller are in effect Integral-double-Integral (I-II) controllers, which are able to control drifting processes. However, since offset is often within the noise of the process, the second integrator can actually cause jittering. Besides, tuning the second filter is not as intuitive as a single EWMA filter. In this work, we look at an alternative way Recursive Least Squares (RLS), to estimate and control the drifting process. EWMA and double-EWMA are shown to be the least squares estimate for locally constant mean model and locally constant linear trend model. Then the recursive least squares with exponential factor is applied to shallow trench isolation etch process to predict the future etch rate. The etch process, which is a critical process in the flash memory manufacturing, is known to suffer from significant etch rate drift due to chamber seasoning. In order to handle the metrology delay, we propose a new time update scheme. RLS with the new time update method gives very good result. The estimate error variance is smaller than that from EWMA, and mean square error decrease more than 10% compared to that from EWMA.

  17. A m-ary linear feedback shift register with binary logic

    NASA Technical Reports Server (NTRS)

    Perlman, M. (Inventor)

    1973-01-01

    A family of m-ary linear feedback shift registers with binary logic is disclosed. Each m-ary linear feedback shift register with binary logic generates a binary representation of a nonbinary recurring sequence, producible with a m-ary linear feedback shift register without binary logic in which m is greater than 2. The state table of a m-ary linear feedback shift register without binary logic, utilizing sum modulo m feedback, is first tubulated for a given initial state. The entries in the state table are coded in binary and the binary entries are used to set the initial states of the stages of a plurality of binary shift registers. A single feedback logic unit is employed which provides a separate feedback binary digit to each binary register as a function of the states of corresponding stages of the binary registers.

  18. EXTRASOLAR BINARY PLANETS. II. DETECTABILITY BY TRANSIT OBSERVATIONS

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

    Lewis, K. M.; Ida, S.; Ochiai, H.

    2015-05-20

    We discuss the detectability of gravitationally bound pairs of gas-giant planets (which we call “binary planets”) in extrasolar planetary systems that are formed through orbital instability followed by planet–planet dynamical tides during their close encounters, based on the results of N-body simulations by Ochiai et al. (Paper I). Paper I showed that the formation probability of a binary is as much as ∼10% for three giant planet systems that undergo orbital instability, and after post-capture long-term tidal evolution, the typical binary separation is three to five times the sum of the physical radii of the planets. The binary planets aremore » stable during the main-sequence lifetime of solar-type stars, if the stellarcentric semimajor axis of the binary is larger than 0.3 AU. We show that detecting modulations of transit light curves is the most promising observational method to detect binary planets. Since the likely binary separations are comparable to the stellar diameter, the shape of the transit light curve is different from transit to transit, depending on the phase of the binary’s orbit. The transit durations and depth for binary planet transits are generally longer and deeper than those for the single planet case. We point out that binary planets could exist among the known inflated gas-giant planets or objects classified as false positive detections at orbital radii ≳0.3 AU, propose a binary planet explanation for the CoRoT candidate SRc01 E2 1066, and show that binary planets are likely to be present in, and could be detected using, Kepler-quality data.« less

  19. Identifying risk profiles for childhood obesity using recursive partitioning based on individual, familial, and neighborhood environment factors.

    PubMed

    Van Hulst, Andraea; Roy-Gagnon, Marie-Hélène; Gauvin, Lise; Kestens, Yan; Henderson, Mélanie; Barnett, Tracie A

    2015-02-15

    Few studies consider how risk factors within multiple levels of influence operate synergistically to determine childhood obesity. We used recursive partitioning analysis to identify unique combinations of individual, familial, and neighborhood factors that best predict obesity in children, and tested whether these predict 2-year changes in body mass index (BMI). Data were collected in 2005-2008 and in 2008-2011 for 512 Quebec youth (8-10 years at baseline) with a history of parental obesity (QUALITY study). CDC age- and sex-specific BMI percentiles were computed and children were considered obese if their BMI was ≥95th percentile. Individual (physical activity and sugar-sweetened beverage intake), familial (household socioeconomic status and measures of parental obesity including both BMI and waist circumference), and neighborhood (disadvantage, prestige, and presence of parks, convenience stores, and fast food restaurants) factors were examined. Recursive partitioning, a method that generates a classification tree predicting obesity based on combined exposure to a series of variables, was used. Associations between resulting varying risk group membership and BMI percentile at baseline and 2-year follow up were examined using linear regression. Recursive partitioning yielded 7 subgroups with a prevalence of obesity equal to 8%, 11%, 26%, 28%, 41%, 60%, and 63%, respectively. The 2 highest risk subgroups comprised i) children not meeting physical activity guidelines, with at least one BMI-defined obese parent and 2 abdominally obese parents, living in disadvantaged neighborhoods without parks and, ii) children with these characteristics, except with access to ≥1 park and with access to ≥1 convenience store. Group membership was strongly associated with BMI at baseline, but did not systematically predict change in BMI. Findings support the notion that obesity is predicted by multiple factors in different settings and provide some indications of potentially

  20. Towards Interactive Construction of Topical Hierarchy: A Recursive Tensor Decomposition Approach.

    PubMed

    Wang, Chi; Liu, Xueqing; Song, Yanglei; Han, Jiawei

    2015-08-01

    Automatic construction of user-desired topical hierarchies over large volumes of text data is a highly desirable but challenging task. This study proposes to give users freedom to construct topical hierarchies via interactive operations such as expanding a branch and merging several branches. Existing hierarchical topic modeling techniques are inadequate for this purpose because (1) they cannot consistently preserve the topics when the hierarchy structure is modified; and (2) the slow inference prevents swift response to user requests. In this study, we propose a novel method, called STROD, that allows efficient and consistent modification of topic hierarchies, based on a recursive generative model and a scalable tensor decomposition inference algorithm with theoretical performance guarantee. Empirical evaluation shows that STROD reduces the runtime of construction by several orders of magnitude, while generating consistent and quality hierarchies.