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.
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.
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.
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.
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.
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.
Recursive dynamic programming for adaptive sequence and structure alignment
Thiele, R.; Zimmer, R.; Lengauer, T.
1995-12-31
We propose a new alignment procedure that is capable of aligning protein sequences and structures in a unified manner. Recursive dynamic programming (RDP) is a hierarchical method which, on each level of the hierarchy, identifies locally optimal solutions and assembles them into partial alignments of sequences and/or structures. In contrast to classical dynamic programming, RDP can also handle alignment problems that use objective functions not obeying the principle of prefix optimality, e.g. scoring schemes derived from energy potentials of mean force. For such alignment problems, RDP aims at computing solutions that are near-optimal with respect to the involved cost function and biologically meaningful at the same time. Towards this goal, RDP maintains a dynamic balance between different factors governing alignment fitness such as evolutionary relationships and structural preferences. As in the RDP method gaps are not scored explicitly, the problematic assignment of gap cost parameters is circumvented. In order to evaluate the RDP approach we analyse whether known and accepted multiple alignments based on structural information can be reproduced with the RDP method.
Real-Time Adaptive EEG Source Separation Using Online Recursive Independent Component Analysis.
Hsu, Sheng-Hsiou; Mullen, Tim R; Jung, Tzyy-Ping; Cauwenberghs, Gert
2016-03-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: 1) suitability for accurate and efficient source identification in high-density (64-channel) realistically-simulated EEG data; 2) capability to detect and adapt to nonstationarity in 64-ch simulated EEG data; and 3) 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
Adaptive Mesh Refinement Simulations of Relativistic Binaries
NASA Astrophysics Data System (ADS)
Motl, Patrick M.; Anderson, M.; Lehner, L.; Olabarrieta, I.; Tohline, J. E.; Liebling, S. L.; Rahman, T.; Hirschman, E.; Neilsen, D.
2006-09-01
We present recent results from our efforts to evolve relativistic binaries composed of compact objects. We simultaneously solve the general relativistic hydrodynamics equations to evolve the material components of the binary and Einstein's equations to evolve the space-time. These two codes are coupled through an adaptive mesh refinement driver (had). One of the ultimate goals of this project is to address the merger of a neutron star and black hole and assess the possible observational signature of such systems as gamma ray bursts. This work has been supported in part by NSF grants AST 04-07070 and PHY 03-26311 and in part through NASA's ATP program grant NAG5-13430. The computations were performed primarily at NCSA through grant MCA98N043 and at LSU's Center for Computation & Technology.
Adaptive Optics Photometry and Astrometry of Binary Stars
NASA Astrophysics Data System (ADS)
Roberts, Lewis C., Jr.; Turner, Nils H.; Bradford, L. William; ten Brummelaar, Theo A.; Oppenheimer, Ben R.; Kuhn, Jeff R.; Whitman, Kathryn; Perrin, Marshall D.; Graham, James R.
2005-11-01
We present astrometric and photometric measurements of 39 binary stars made with the adaptive optics system on the 3.6 m Advanced Electro-Optical System (AEOS) telescope, taken from 2002 November to 2003 March. The binaries have separations ranging from 0.08" to 5.11" and differential magnitudes ranging from 0.096 to 7.9. Also, we include a list of observations of 23 known binaries that we were unable to resolve. In the process of these measurements, we discovered three new companions to two previously known binary stars. We also discuss the effects of scintillation and anisoplanatism on measurements of binary star photometry in adaptive optics images. Suggestions on how to minimize these effects are then given. Based on observations made at the Maui Space Surveillance System operated by Detachment 15 of the US Air Force Research Laboratory's Directed Energy Directorate.
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.
Adaptive filters for detection of gravitational waves from coalescing binaries
Eleuteri, Antonio; Milano, Leopoldo; De Rosa, Rosario; Garufi, Fabio; Acernese, Fausto; Barone, Fabrizio; Giordano, Lara; Pardi, Silvio
2006-06-15
In this work we propose use of infinite impulse response adaptive line enhancer (IIR ALE) filters for detection of gravitational waves from coalescing binaries. We extend our previous work and define an adaptive matched filter structure. Filter performance is analyzed in terms of the tracking capability and determination of filter parameters. Furthermore, following the Neyman-Pearson strategy, receiver operating characteristics are derived, with closedform expressions for detection threshold, false alarm, and detection probability. Extensive tests demonstrate the effectiveness of adaptive filters both in terms of small computational cost and robustness.
Hopf algebras and topological recursion
NASA Astrophysics Data System (ADS)
Esteves, João N.
2015-11-01
We consider a model for topological recursion based on the Hopf algebra of planar binary trees defined by Loday and Ronco (1998 Adv. Math. 139 293-309 We show that extending this Hopf algebra by identifying pairs of nearest neighbor leaves, and thus producing graphs with loops, we obtain the full recursion formula discovered by Eynard and Orantin (2007 Commun. Number Theory Phys. 1 347-452).
ERIC Educational Resources Information Center
Olson, Alton T.
1989-01-01
Discusses the use of the recursive method to permutations of n objects and a problem making c cents in change using pennies and nickels when order is important. Presents a LOGO program for the examples. (YP)
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.
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
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.
NASA Astrophysics Data System (ADS)
Duong, Van-Huan; Bastawrous, Hany Ayad; Lim, KaiChin; See, Khay Wai; Zhang, Peng; Dou, Shi Xue
2015-11-01
This paper deals with the contradiction between simplicity and accuracy of the LiFePO4 battery states estimation in the electric vehicles (EVs) battery management system (BMS). State of charge (SOC) and state of health (SOH) are normally obtained from estimating the open circuit voltage (OCV) and the internal resistance of the equivalent electrical circuit model of the battery, respectively. The difficulties of the parameters estimation arise from their complicated variations and different dynamics which require sophisticated algorithms to simultaneously estimate multiple parameters. This, however, demands heavy computation resources. In this paper, we propose a novel technique which employs a simplified model and multiple adaptive forgetting factors recursive least-squares (MAFF-RLS) estimation to provide capability to accurately capture the real-time variations and the different dynamics of the parameters whilst the simplicity in computation is still retained. The validity of the proposed method is verified through two standard driving cycles, namely Urban Dynamometer Driving Schedule and the New European Driving Cycle. The proposed method yields experimental results that not only estimated the SOC with an absolute error of less than 2.8% but also characterized the battery model parameters accurately.
Adaptive allocation for binary outcomes using decreasingly informative priors.
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.
Discovery of a 66 mas Ultracool Binary with Laser Guide Star Adaptive Optics
Siegler, N; Close, L; Burgasser, A; Cruz, K; Marois, C; Macintosh, B; Barman, T
2007-02-02
We present the discovery of 2MASS J21321145+1341584AB as a closely separated (0.066'') very low-mass field dwarf binary resolved in the near-infrared by the Keck II Telescope using laser guide star adaptive optics. Physical association is deduced from the angular proximity of the components and constraints on their common proper motion. We have obtained a near-infrared spectrum of the binary and find that it is best described by an L5{+-}0.5 primary and an L7.5{+-}0.5 secondary. Model-dependent masses predict that the two components straddle the hydrogen burning limit threshold with the primary likely stellar and the secondary likely substellar. The properties of this sytem - close projected separation (1.8{+-}0.3AU) and near unity mass ratio - are consistent with previous results for very low-mass field binaries. The relatively short estimated orbital period of this system ({approx}7-12 yr) makes it a good target for dynamical mass measurements. Interestingly, the system's angular separation is the tightest yet for any very low-mass binary published from a ground-based telescope and is the tightest binary discovered with laser guide star adaptive optics to date.
Covariate-adjusted response-adaptive designs for binary response.
Rosenberger, W F; Vidyashankar, A N; Agarwal, D K
2001-11-01
An adaptive allocation design for phase III clinical trials that incorporates covariates is described. The allocation scheme maps the covariate-adjusted odds ratio from a logistic regression model onto [0, 1]. Simulations assume that both staggered entry and time to response are random and follow a known probability distribution that can depend on the treatment assigned, the patient's response, a covariate, or a time trend. Confidence intervals on the covariate-adjusted odds ratio is slightly anticonservative for the adaptive design under the null hypothesis, but power is similar to equal allocation under various alternatives for n = 200. For similar power, the net savings in terms of expected number of treatment failures is modest, but enough to make this design attractive for certain studies where known covariates are expected to be important and stratification is not desired, and treatment failures have a high ethical cost.
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. PMID:27058283
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.
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…
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.
Binary stars observed with adaptive optics at the starfire optical range
Drummond, Jack D.
2014-03-01
In reviewing observations taken of binary stars used as calibration objects for non-astronomical purposes with adaptive optics on the 3.5 m Starfire Optical Range telescope over the past 2 years, one-fifth of them were found to be off-orbit. In order to understand such a high number of discrepant position angles and separations, all previous observations in the Washington Double Star Catalog for these rogue binaries were obtained from the Naval Observatory. Adding our observations to these yields new orbits for all, resolving the discrepancies. We have detected both components of γ Gem for the first time, and we have shown that 7 Cam is an optical pair, not physically bound.
A recursive filter for despeckling SAR images.
Subrahmanyam, G R K S; Rajagopalan, A N; Aravind, R
2008-10-01
This correspondence proposes a recursive algorithm for noise reduction in synthetic aperture radar imagery. Excellent despeckling in conjunction with feature preservation is achieved by incorporating a discontinuity-adaptive Markov random field prior within the unscented Kalman filter framework through importance sampling. The performance of this method is demonstrated on both synthetic and real examples.
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.
Searching for Binary Y Dwarfs with the Gemini Multi-conjugate Adaptive Optics System (GeMS)
NASA Astrophysics Data System (ADS)
Opitz, Daniela; Tinney, C. G.; Faherty, Jacqueline K.; Sweet, Sarah; Gelino, Christopher R.; Kirkpatrick, J. Davy
2016-03-01
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 also 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., 1042 erg) are consistent with those observed in previous studies of hotter ultra-cool dwarfs.
ERIC Educational Resources Information Center
Banreti, Zoltan
2010-01-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…
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.
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…
A hardware architecture for a context-adaptive binary arithmetic coder
NASA Astrophysics Data System (ADS)
Sudharsanan, Subramania; Cohen, Adam
2005-03-01
The H.264 video compression standard uses a context-adaptive binary arithmetic coder (CABAC) as an entropy coding mechanism. While the coder provides excellent compression efficiency, it is computationally demanding. On typical general-purpose processors, it can take up to hundreds of cycles to encode a single bit. In this paper, we propose an architecture for a CABAC encoder that can easily be incorporated into system-on-chip designs for H.264 compression. The CABAC is inherently serial and we divide the problem into several stages to derive a design that can provide a throughput of two cycles per encoded bit. The engine proposed is capable of handling binarization of the syntactical elements and provides the coded bit-stream via a first-in first-out buffer. The design is implemented on an Altera FPGA platform that can run at 50 MHz enabling a 25 Mbps encoding rate.
Reconstruction based finger-knuckle-print verification with score level adaptive binary fusion.
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. PMID:24043391
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.
A scale- and orientation-adaptive extension of Local Binary Patterns for texture classification
Hegenbart, Sebastian; Uhl, Andreas
2015-01-01
Local Binary Patterns (LBPs) have been used in a wide range of texture classification scenarios and have proven to provide a highly discriminative feature representation. A major limitation of LBP is its sensitivity to affine transformations. In this work, we present a scale- and rotation-invariant computation of LBP. Rotation-invariance is achieved by explicit alignment of features at the extraction level, using a robust estimate of global orientation. Scale-adapted features are computed in reference to the estimated scale of an image, based on the distribution of scale normalized Laplacian responses in a scale-space representation. Intrinsic-scale-adaption is performed to compute features, independent of the intrinsic texture scale, leading to a significantly increased discriminative power for a large amount of texture classes. In a final step, the rotation- and scale-invariant features are combined in a multi-resolution representation, which improves the classification accuracy in texture classification scenarios with scaling and rotation significantly. PMID:26240440
Lucky Imaging Adaptive Optics of the brown dwarf binary GJ569Bab
NASA Astrophysics Data System (ADS)
Femenía, B.; Rebolo, R.; Pérez-Prieto, J. A.; Hildebrandt, S. R.; Labadie, L.; Pérez-Garrido, A.; Béjar, V. J. S.; Díaz-Sánchez, A.; Villó, I.; Oscoz, A.; López, R.; Rodríguez, L. F.; Piqueras, J.
2011-05-01
The potential of combining Adaptive Optics (AO) and Lucky Imaging (LI) to achieve high-precision astrometry and differential photometry in the optical is investigated by conducting observations of the close 0.1 arcsec brown dwarf binary GJ569Bab. We took 50 000 I-band images with our LI instrument FastCam attached to NAOMI, the 4.2-m William Herschel Telescope (WHT) AO facility. In order to extract the most of the astrometry and photometry of the GJ569Bab system we have resorted to a PSF fitting technique using the primary star GJ569A as a suitable PSF reference which exhibits an I-band magnitude of 7.78 ± 0.03. The AO+LI observations at WHT were able to resolve the binary system GJ569Bab located at 4.92 ± 0.05 arcsec from GJ569A. We measure a separation of 98.4 ± 1.1 mas and I-band magnitudes of 13.86 ± 0.03 and 14.48 ± 0.03 and I-J colours of 2.72 ± 0.08 and 2.83 ± 0.08 for the Ba and Bb components, respectively. Our study rules out the presence of any other companion to GJ569A down to magnitude I˜ 17 at distances larger than 1 arcsec. The I-J colours measured are consistent with M8.5-M9 spectral types for the Ba and Bb components. The available dynamical, photometric and spectroscopic data are consistent with a binary system with Ba being slightly (10-20 per cent) more massive than Bb. We obtain new orbital parameters which are in good agreement with those in the literature. Based on service observations made with the 4.2-m William Herschel Telescope (WHT) operated on the island of La Palma by the Isaac Newton Group and on observations made with the Nordic Optical Telescope (NOT), operated on the island of La Palma jointly by Denmark, Finland, Iceland, Norway and Sweden, in the Spanish Observatorio del Roque de los Muchachos of the Instituto de Astrofísica de Canarias.
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…
Recursive Feature Extraction in Graphs
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.
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.
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.
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
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 spike
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 spike
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.
Mizera, Mikołaj; Talaczyńska, Alicja; Zalewski, Przemysław; Skibiński, Robert; Cielecka-Piontek, Judyta
2015-05-01
A sensitive and fast HPLC method using ultraviolet diode-array detector (DAD)/electrospray ionization tandem mass spectrometry (Q-TOF-MS/MS) was developed for the determination of tebipenem pivoxyl and in the presence of degradation products formed during thermolysis. The chromatographic separations were performed on stationary phases produced in core-shell technology with particle diameter of 5.0 µm. The mobile phases consisted of formic acid (0.1%) and acetonitrile at different ratios. The flow rate was 0.8 mL/min while the wavelength was set at 331 nm. The stability characteristics of tebipenem pivoxyl were studied by performing stress tests in the solid state in dry air (RH=0%) and at an increased relative air humidity (RH=90%). The validation parameters such as selectivity, accuracy, precision and sensitivity were found to be satisfying. The satisfied selectivity and precision of determination were obtained for the separation of tebipenem pivoxyl from its degradation products using a stationary phase with 5.0 µm particles. The evaluation of the chemical structure of the 9 degradation products of tebipenem pivoxyl was conducted following separation based on the stationary phase with a 5.0 µm particle size by applying a Q-TOF-MS/MS detector. The main degradation products of tebipenem pivoxyl were identified: a product resulting from the condensation of the substituents of 1-(4,5-dihydro-1,3-thiazol-2-yl)-3-azetidinyl]sulfanyl and acid and ester forms of tebipenem with an open β-lactam ring in dry air at an increased temperature (RH=0%, T=393 K) as well as acid and ester forms of tebipenem with an open β-lactam ring at an increased relative air humidity and an elevated temperature (RH=90%, T=333 K). Retention times of tebipenem pivoxyl and its degradation products were used as training data set for predictive model of quantitative structure-retention relationship. An artificial neural network with adaptation protocol and extensive feature selection process
Recursion relations for conformal blocks
NASA Astrophysics Data System (ADS)
Penedones, João; Trevisani, Emilio; Yamazaki, Masahito
2016-09-01
In the context of conformal field theories in general space-time dimension, we find all the possible singularities of the conformal blocks as functions of the scaling dimension Δ of the exchanged operator. In particular, we argue, using representation theory of parabolic Verma modules, that in odd spacetime dimension the singularities are only simple poles. We discuss how to use this information to write recursion relations that determine the conformal blocks. We first recover the recursion relation introduced in [1] for conformal blocks of external scalar operators. We then generalize this recursion relation for the conformal blocks associated to the four point function of three scalar and one vector operator. Finally we specialize to the case in which the vector operator is a conserved current.
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 programming…
NASA Astrophysics Data System (ADS)
Karwowski, Damian; Domański, Marek
2016-01-01
An improved context-based adaptive binary arithmetic coding (CABAC) is presented. The idea for the improvement is to use a more accurate mechanism for estimation of symbol probabilities in the standard CABAC algorithm. The authors' proposal of such a mechanism is based on the context-tree weighting technique. In the framework of a high-efficiency video coding (HEVC) video encoder, the improved CABAC allows 0.7% to 4.5% bitrate saving compared to the original CABAC algorithm. The application of the proposed algorithm marginally affects the complexity of HEVC video encoder, but the complexity of video decoder increases by 32% to 38%. In order to decrease the complexity of video decoding, a new tool has been proposed for the improved CABAC that enables scaling of the decoder complexity. Experiments show that this tool gives 5% to 7.5% reduction of the decoding time while still maintaining high efficiency in the data compression.
NASA Astrophysics Data System (ADS)
Chakraborty, Shibalik; Boolchand, Punit
2014-03-01
Binary GexS100-x glasses reveal elastic and chemical phase transitions driven by network topology. With increasing Ge content x, well defined rigidity (xc(1) =19.3%) and stress(xc(2) =24.85%) transitions and associated optical elasticity power-laws are observed in Raman scattering. Calorimetric measurements reveal a square-well like minimum with window walls that coincide with the two elastic phase transitions. Molar volumes show a trapezoidal-like minimum with edges that nearly coincide with the reversibility window. These results are signatures of the isostatically rigid nature of the elastic phase formed between the rigidity and stress transitions. Complex Cp measurements show melt fragility index, m(x) to also show a global minimum in the reversibility window, underscoring that melt dynamics encode the elastic behavior of the glass formed at Tg. The strong nature of melts formed in the IP has an important practical consequence; they lead to slow homogenization of non-stoichiometric batch compositions reacted at high temperatures. Homogenization of chalcogenides melts/glasses over a scale of a few microns is a pre-requisite to observe the intrinsic physical properties of these materials. Supported by NSF Grant DMR 0853957.
Adaptive particle swarm optimization for optimal orbital elements of binary stars
NASA Astrophysics Data System (ADS)
Attia, Abdel-Fattah
2016-10-01
The paper presents an adaptive particle swarm optimization (APSO) as an alternative method to determine the optimal orbital elements of the star η Bootis of MK type G0 IV. The proposed algorithm transforms the problem of finding periodic orbits into the problem of detecting global minimizers as a function, to get a best fit of Keplerian and Phase curves. The experimental results demonstrate that the proposed approach of APSO generally more accurate than the standard particle swarm optimization (PSO) and other published optimization algorithms, in terms of solution accuracy, convergence speed and algorithm reliability.
Recursively minimally-deformed oscillators
NASA Astrophysics Data System (ADS)
Katriel, J.; Quesne, C.
1996-04-01
A recursive deformation of the boson commutation relation is introduced. Each step consists of a minimal deformation of a commutator [a,a°]=fk(... ;n̂) into [a,a°]qk+1=fk(... ;n̂), where ... stands for the set of deformation parameters that fk depends on, followed by a transformation into the commutator [a,a°]=fk+1(...,qk+1;n̂) to which the deformed commutator is equivalent within the Fock space. Starting from the harmonic oscillator commutation relation [a,a°]=1 we obtain the Arik-Coon and Macfarlane-Biedenharn oscillators at the first and second steps, respectively, followed by a sequence of multiparameter generalizations. Several other types of deformed commutation relations related to the treatment of integrable models and to parastatistics are also obtained. The ``generic'' form consists of a linear combination of exponentials of the number operator, and the various recursive families can be classified according to the number of free linear parameters involved, that depends on the form of the initial commutator.
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…
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)
Conjugate gradient algorithms using multiple recursions
Barth, T.; Manteuffel, T.
1996-12-31
Much is already known about when a conjugate gradient method can be implemented with short recursions for the direction vectors. The work done in 1984 by Faber and Manteuffel gave necessary and sufficient conditions on the iteration matrix A, in order for a conjugate gradient method to be implemented with a single recursion of a certain form. However, this form does not take into account all possible recursions. This became evident when Jagels and Reichel used an algorithm of Gragg for unitary matrices to demonstrate that the class of matrices for which a practical conjugate gradient algorithm exists can be extended to include unitary and shifted unitary matrices. The implementation uses short double recursions for the direction vectors. This motivates the study of multiple recursion algorithms.
Liu, Michael C.; Dupuy, Trent J.; Leggett, S. K.
2010-10-10
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 most 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
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.
Recursive retrospective revaluation of causal judgments.
Macho, Siegfried; Burkart, Judith
2002-11-01
Recursive causal evaluation is an iterative process in which the evaluation of a target cause, T, is based on the outcome of the evaluation of another cause, C, the evaluation of which itself depends on the evaluation of a 3rd cause, D. Retrospective revaluation consists of backward processing of information as indicated by the fact that the evaluation of T is influenced by subsequent information that is not concerned with T directly. Two experiments demonstrate recursive retrospective revaluation with contingency information presented in list format as well as with trial-by-trial acquisition. Existing associative models are unable to predict the results. The model of recursive causal disambiguation that conceptualizes the revaluation as a recursive process of disambiguation predicts the pattern of results correctly.
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.
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. PMID:24762973
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.
Automatic line detection in document images using recursive morphological transforms
NASA Astrophysics Data System (ADS)
Kong, Bin; Chen, Su S.; Haralick, Robert M.; Phillips, Ihsin T.
1995-03-01
In this paper, we describe a system that detects lines of various types, e.g., solid lines and dotted lines, on document images. The main techniques are based on the recursive morphological transforms, namely the recursive opening and closing transforms. The advantages of the transforms are that they can perform binary opening and closing with any sized structuring element simultaneously in constant time per pixel, and that they offer a solution to morphological image analysis problems where the sizes of the structuring elements have to be determined after the examination of the image itself. The system is evaluated on about 1,200 totally ground-truthed IRS tax form images of different qualities. The line detection output is compared with a set of hand-drawn groundtruth lines. The statistics like the number and rate of correct detection, miss detection, and false alarm are calculated. The performance of 32 algorithms for solid line detection are compared to find the best one. The optimal algorithm tuning parameter settings could be estimated on the fly using a regression tree.
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
NASA Astrophysics Data System (ADS)
Ni, Zhiyu; Mu, Ruinan; Xun, Guangbin; Wu, Zhigang
2016-01-01
The rotation of spacecraft flexible appendage may cause changes in modal parameters. For this time-varying system, the computation cost of the frequently-used singular value decomposition (SVD) identification method is high. Some control problems, such as the self-adaptive control, need the latest modal parameters to update the controller parameters in time. In this paper, the projection approximation subspace tracking (PAST) recursive algorithm is applied as an alternative method to identify the time-varying modal parameters. This method avoids the SVD by signal subspace projection and improves the computational efficiency. To verify the ability of this recursive algorithm in spacecraft modal parameters identification, a spacecraft model with rapid rotational appendage, Soil Moisture Active/Passive (SMAP) satellite, is established, and the time-varying modal parameters of the satellite are identified recursively by designing the input and output signals. The results illustrate that this recursive algorithm can obtain the modal parameters in the high signal noise ratio (SNR) and it has better computational efficiency than the SVD method. Moreover, to improve the identification precision of this recursive algorithm in the low SNR, the wavelet de-noising technology is used to decrease the effect of noises.
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.
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.
KSRQuerying: XML Keyword with Recursive Querying
NASA Astrophysics Data System (ADS)
Taha, Kamal; Elmasri, Ramez
We propose an XML search engine called KSRQuerying. The search engine employs recursive querying techniques, which allows a query to query the results of a previous application of itself or of another query. It answers recursive queries, keyword-based queries, and loosely structured queries. KSRQuerying uses a sort-merge algorithm, which selects subsets from the set of nodes containing keywords, where each subset contains the smallest number of nodes that: (1) are closely related to each other, and (2) contain at least one occurrence of each keyword. We experimentally evaluated the quality and efficiency of KSRQuerying and compared it with 3 systems: XSeek, Schema-Free XQuery, and XKSearch.
Yamamoto, Ken; Yamazaki, Yoshihiro
2008-08-01
The bifurcation ratio for the equiprobable binary tree model is formulated. We obtain the exact expression of the kth moment of the second-order streams. We also obtain a recursive equation between rth and (r+1)th order streams. Horton's law is confirmed numerically by calculating this recursive equation and asymptotic properties of the bifurcation ratio are discussed.
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.
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 given number of paces,…
Supporting the Learning of Recursive Problem Solving.
ERIC Educational Resources Information Center
Bhuiyan, Shawkat; And Others
1994-01-01
Presents the PETAL (Programming Environment Tool) learning environment, and discusses a study where one group of students used PETAL and another used a standard LISP environment to learn recursion. The PETAL group performed better during the learning period and on a written posttest. Theorizes why PETAL may be responsible for improved learning of…
Scheduling Topics for Improved Student Comprehension of Recursion
ERIC Educational Resources Information Center
Zmuda, Michael; Hatch, Melanie
2007-01-01
This paper presents the results of an experiment conducted to assess the affects of teaching recursion in two disjoint, non-consecutive units of instruction. One group of students was taught basic and advanced recursion topics in four consecutive class periods, while a second group was taught recursion in two two-period blocks that were separated…
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…
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.
An introduction to on-shell recursion relations
NASA Astrophysics Data System (ADS)
Feng, Bo; Luo, Mingxing
2012-10-01
This article provides an introduction to on-shell recursion relations for calculations of tree-level amplitudes. Starting with the basics, such as spinor notations and color decompositions, we expose analytic properties of gauge-boson amplitudes, BCFW-deformations, the large z-behavior of amplitudes, and on-shell recursion relations of gluons. We discuss further developments of on-shell recursion relations, including generalization to other quantum field theories, supersymmetric theories in particular, recursion relations for off-shell currents, recursion relation with nonzero boundary contributions, bonus relations, relations for rational parts of one-loop amplitudes, recursion relations in 3D and a proof of CSW rules. Finally, we present samples of applications, including solutions of split helicity amplitudes and of N = 4 SYM theories, consequences of consistent conditions under recursion relation, Kleiss-Kuijf (KK) and Bern-Carrasco-Johansson (BCJ) relations for color-ordered gluon tree amplitudes, Kawai-Lewellen-Tye (KLT) relations.
The recursion relation in Lagrangian perturbation theory
Rampf, Cornelius
2012-12-01
We derive a recursion relation in the framework of Lagrangian perturbation theory, appropriate for studying the inhomogeneities of the large scale structure of the universe. We use the fact that the perturbative expansion of the matter density contrast is in one-to-one correspondence with standard perturbation theory (SPT) at any order. This correspondence has been recently shown to be valid up to fourth order for a non-relativistic, irrotational and dust-like component. Assuming it to be valid at arbitrary (higher) order, we express the Lagrangian displacement field in terms of the perturbative kernels of SPT, which are itself given by their own and well-known recursion relation. We argue that the Lagrangian solution always contains more non-linear information in comparison with the SPT solution, (mainly) if the non-perturbative density contrast is restored after the displacement field is obtained.
Recursively indexed differential pulse code modulation
NASA Technical Reports Server (NTRS)
Sayood, Khalid; Na, Sangsin
1992-01-01
The performance of a differential pulse code modulation (DPCM) system with a recursively indexed quantizer (RIQ) under various conditions, with first order Gauss-Markov and Laplace-Markov sources as inputs, is studied. When the predictor is matched to the input, the proposed system performs at or close to the optimum entropy constrained DPCM system. If one is willing to accept a 5 percent increase in the rate, the system is very forgiving of predictor mismatch.
Gianola, Daniel; Sorensen, Daniel
2004-01-01
Multivariate models are of great importance in theoretical and applied quantitative genetics. We extend quantitative genetic theory to accommodate situations in which there is linear feedback or recursiveness between the phenotypes involved in a multivariate system, assuming an infinitesimal, additive, model of inheritance. It is shown that structural parameters defining a simultaneous or recursive system have a bearing on the interpretation of quantitative genetic parameter estimates (e.g., heritability, offspring-parent regression, genetic correlation) when such features are ignored. Matrix representations are given for treating a plethora of feedback-recursive situations. The likelihood function is derived, assuming multivariate normality, and results from econometric theory for parameter identification are adapted to a quantitative genetic setting. A Bayesian treatment with a Markov chain Monte Carlo implementation is suggested for inference and developed. When the system is fully recursive, all conditional posterior distributions are in closed form, so Gibbs sampling is straightforward. If there is feedback, a Metropolis step may be embedded for sampling the structural parameters, since their conditional distributions are unknown. Extensions of the model to discrete random variables and to nonlinear relationships between phenotypes are discussed. PMID:15280252
Fuzzy logic recursive change detection for tracking and denoising of video sequences
NASA Astrophysics Data System (ADS)
Zlokolica, Vladimir; De Geyter, Matthias; Schulte, Stefan; Pizurica, Aleksandra; Philips, Wilfried; Kerre, Etienne
2005-03-01
In this paper we propose a fuzzy logic recursive scheme for motion detection and temporal filtering that can deal with the Gaussian noise and unsteady illumination conditions both in temporal and spatial direction. Our focus is on applications concerning tracking and denoising of image sequences. We process an input noisy sequence with fuzzy logic motion detection in order to determine the degree of motion confidence. The proposed motion detector combines the membership degree appropriately using defined fuzzy rules, where the membership degree of motion for each pixel in a 2D-sliding-window is determined by the proposed membership function. Both fuzzy membership function and fuzzy rules are defined in such a way that the performance of the motion detector is optimized in terms of its robustness to noise and unsteady lighting conditions. We perform simultaneously tracking and recursive adaptive temporal filtering, where the amount of filtering is inversely proportional to the confidence with respect to the existence of motion. Finally, temporally filtered frames are further processed by the proposed spatial filter in order to obtain denoised image sequence. The main contribution of this paper is the robust novel fuzzy recursive scheme for motion detection and temporal filtering. We evaluate the proposed motion detection algorithm using two criteria: robustness to noise and changing illumination conditions and motion blur in temporal recursive denoising. Additionally, we make comparisons in terms of noise reduction with other state of the art video denoising techniques.
Recursive least square vehicle mass estimation based on acceleration partition
NASA Astrophysics Data System (ADS)
Feng, Yuan; Xiong, Lu; Yu, Zhuoping; Qu, Tong
2014-05-01
Vehicle mass is an important parameter in vehicle dynamics control systems. Although many algorithms have been developed for the estimation of mass, none of them have yet taken into account the different types of resistance that occur under different conditions. This paper proposes a vehicle mass estimator. The estimator incorporates road gradient information in the longitudinal accelerometer signal, and it removes the road grade from the longitudinal dynamics of the vehicle. Then, two different recursive least square method (RLSM) schemes are proposed to estimate the driving resistance and the mass independently based on the acceleration partition under different conditions. A 6 DOF dynamic model of four In-wheel Motor Vehicle is built to assist in the design of the algorithm and in the setting of the parameters. The acceleration limits are determined to not only reduce the estimated error but also ensure enough data for the resistance estimation and mass estimation in some critical situations. The modification of the algorithm is also discussed to improve the result of the mass estimation. Experiment data on a sphalt road, plastic runway, and gravel road and on sloping roads are used to validate the estimation algorithm. The adaptability of the algorithm is improved by using data collected under several critical operating conditions. The experimental results show the error of the estimation process to be within 2.6%, which indicates that the algorithm can estimate mass with great accuracy regardless of the road surface and gradient changes and that it may be valuable in engineering applications. This paper proposes a recursive least square vehicle mass estimation method based on acceleration partition.
Recursiveness, switching, and fluctuations in a replicating catalytic network
NASA Astrophysics Data System (ADS)
Kaneko, Kunihiko
2003-09-01
A protocell model consisting of mutually catalyzing molecules is studied, in order to investigate how chemical compositions are transferred recursively through cell divisions under replication errors. Depending on the numbers of molecules and species, and the path rate, three phases are found: fast switching state without recursive production, recursive production, and itinerancy between the above two states. The number distributions of the molecules in the recursive states are shown to be log-normal except for those species that form a core hypercycle, and are explained with the help of a heuristic argument.
Mao, Yong; Zhou, Xiaobo; Pi, Daoying; Sun, Youxian; Wong, Stephen T C
2005-06-30
We investigate the problems of multiclass cancer classification with gene selection from gene expression data. Two different constructed multiclass classifiers with gene selection are proposed, which are fuzzy support vector machine (FSVM) with gene selection and binary classification tree based on SVM with gene selection. Using F test and recursive feature elimination based on SVM as gene selection methods, binary classification tree based on SVM with F test, binary classification tree based on SVM with recursive feature elimination based on SVM, and FSVM with recursive feature elimination based on SVM are tested in our experiments. To accelerate computation, preselecting the strongest genes is also used. The proposed techniques are applied to analyze breast cancer data, small round blue-cell tumors, and acute leukemia data. Compared to existing multiclass cancer classifiers and binary classification tree based on SVM with F test or binary classification tree based on SVM with recursive feature elimination based on SVM mentioned in this paper, FSVM based on recursive feature elimination based on SVM can find most important genes that affect certain types of cancer with high recognition accuracy.
Recursive deconvolution of combinatorial chemical libraries.
Erb, E; Janda, K D; Brenner, S
1994-11-22
A recursive strategy that solves for the active members of a chemical library is presented. A pentapeptide library with an alphabet of Gly, Leu, Phe, and Tyr (1024 members) was constructed on a solid support by the method of split synthesis. One member of this library (NH2-Tyr-Gly-Gly-Phe-Leu) is a native binder to a beta-endorphin antibody. A variation of the split synthesis approach is used to build the combinatorial library. In four vials, a member of the library's alphabet is coupled to a solid support. After each coupling, a portion of the resin from each of the four reaction vials was set aside and catalogued. The solid support from each vial is then combined, mixed, and redivided. The steps of (i) coupling, (ii) saving and cataloging, and (iii) randomizing were repeated until a pentapeptide library was obtained. The four pentapeptide libraries where the N-terminal amino acid is defined were screened against the beta-endorphin antibody and quantitated via an ELISA. The amino acid of the four pools that demonstrated the most binding was then coupled to the four tetrapeptide partial libraries that had been set aside and catalogued during the split synthesis. This recursive deconvolution was repeated until the best binders were deduced. Besides the anticipated native binder, two other members of the library displayed significant binding. This recursive method of deconvolution does not use a molecular tag, requires only one split synthesis, and can be applied to the deconvolution of nonlinear small-molecule combinatorial libraries and linear oligomeric combinatorial libraries, since it is based only on the procedure of the synthesis. PMID:7972077
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).
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.
Tetramethyleneethane Equivalents: Recursive Reagents for Serialized Cycloadditions
2015-01-01
New reactions and reagents that allow for multiple bond-forming events per synthetic operation are required to achieve structural complexity and thus value with step-, time-, cost-, and waste-economy. Here we report a new class of reagents that function like tetramethyleneethane (TME), allowing for back-to-back [4 + 2] cycloadditions, thereby amplifying the complexity-increasing benefits of Diels–Alder and metal-catalyzed cycloadditions. The parent recursive reagent, 2,3-dimethylene-4-trimethylsilylbutan-1-ol (DMTB), is readily available from the metathesis of ethylene and THP-protected 4-trimethylsilylbutyn-1-ol. DMTB and related reagents engage diverse dienophiles in an initial Diels–Alder or metal-catalyzed [4 + 2] cycloaddition, triggering a subsequent vinylogous Peterson elimination that recursively generates a new diene for a second cycloaddition. Overall, this multicomponent catalytic cascade produces in one operation carbo- and heterobicyclic building blocks for the synthesis of a variety of natural products, therapeutic leads, imaging agents, and materials. Its application to the three step synthesis of a new solvatochromic fluorophore, N-ethyl(6-N,N-dimethylaminoanthracene-2,3-dicarboximide) (6-DMA), and the photophysical characterization of this fluorophore are described. PMID:25961416
NASA Astrophysics Data System (ADS)
Bargatze, L. F.
2015-12-01
Active Data Archive Product Tracking (ADAPT) is a collection of software routines that permits one to generate XML metadata files to describe and register data products in support of the NASA Heliophysics Virtual Observatory VxO effort. ADAPT is also a philosophy. The ADAPT concept is to use any and all available metadata associated with scientific data to produce XML metadata descriptions in a consistent, uniform, and organized fashion to provide blanket access to the full complement of data stored on a targeted data server. In this poster, we present an application of ADAPT to describe all of the data products that are stored by using the Common Data File (CDF) format served out by the CDAWEB and SPDF data servers hosted at the NASA Goddard Space Flight Center. These data servers are the primary repositories for NASA Heliophysics data. For this purpose, the ADAPT routines have been used to generate data resource descriptions by using an XML schema named Space Physics Archive, Search, and Extract (SPASE). SPASE is the designated standard for documenting Heliophysics data products, as adopted by the Heliophysics Data and Model Consortium. The set of SPASE XML resource descriptions produced by ADAPT includes high-level descriptions of numerical data products, display data products, or catalogs and also includes low-level "Granule" descriptions. A SPASE Granule is effectively a universal access metadata resource; a Granule associates an individual data file (e.g. a CDF file) with a "parent" high-level data resource description, assigns a resource identifier to the file, and lists the corresponding assess URL(s). The CDAWEB and SPDF file systems were queried to provide the input required by the ADAPT software to create an initial set of SPASE metadata resource descriptions. Then, the CDAWEB and SPDF data repositories were queried subsequently on a nightly basis and the CDF file lists were checked for any changes such as the occurrence of new, modified, or deleted
2-D impulse noise suppression by recursive gaussian maximum likelihood estimation.
Chen, Yang; Yang, Jian; Shu, Huazhong; Shi, Luyao; Wu, Jiasong; Luo, Limin; Coatrieux, Jean-Louis; Toumoulin, Christine
2014-01-01
An effective approach termed Recursive Gaussian Maximum Likelihood Estimation (RGMLE) is developed in this paper to suppress 2-D impulse noise. And two algorithms termed RGMLE-C and RGMLE-CS are derived by using spatially-adaptive variances, which are respectively estimated based on certainty and joint certainty & similarity information. To give reliable implementation of RGMLE-C and RGMLE-CS algorithms, a novel recursion stopping strategy is proposed by evaluating the estimation error of uncorrupted pixels. Numerical experiments on different noise densities show that the proposed two algorithms can lead to significantly better results than some typical median type filters. Efficient implementation is also realized via GPU (Graphic Processing Unit)-based parallelization techniques.
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,…
Detecting recursive and nonrecursive filters using chaos.
Carroll, T L
2010-03-01
Filtering a chaotic signal through a recursive [or infinite impulse response (IIR)] filter has been shown to increase the dimension of chaos under certain conditions. Filtering with a nonrecursive [or finite impulse response (FIR)] filter should not increase dimension, but it has been shown that if the FIR filter has a long tail, measurements of actual signals may appear to show a dimension increase. I simulate IIR and FIR filters that correspond to naturally occurring resonant objects, and I show that using dimension measurements, I can distinguish the filter type. These measurements could be used to detect resonances using radar, sonar, or laser signals, or to determine if a resonance is due to an IIR or an FIR filter.
Recursive Partitioning Method on Competing Risk Outcomes
Xu, Wei; Che, Jiahua; Kong, Qin
2016-01-01
In some cancer clinical studies, researchers have interests to explore the risk factors associated with competing risk outcomes such as recurrence-free survival. We develop a novel recursive partitioning framework on competing risk data for both prognostic and predictive model constructions. We define specific splitting rules, pruning algorithm, and final tree selection algorithm for the competing risk tree models. This methodology is quite flexible that it can corporate both semiparametric method using Cox proportional hazards model and parametric competing risk model. Both prognostic and predictive tree models are developed to adjust for potential confounding factors. Extensive simulations show that our methods have well-controlled type I error and robust power performance. Finally, we apply both Cox proportional hazards model and flexible parametric model for prognostic tree development on a retrospective clinical study on oropharyngeal cancer patients. PMID:27486300
Recursive Partitioning Method on Competing Risk Outcomes.
Xu, Wei; Che, Jiahua; Kong, Qin
2016-01-01
In some cancer clinical studies, researchers have interests to explore the risk factors associated with competing risk outcomes such as recurrence-free survival. We develop a novel recursive partitioning framework on competing risk data for both prognostic and predictive model constructions. We define specific splitting rules, pruning algorithm, and final tree selection algorithm for the competing risk tree models. This methodology is quite flexible that it can corporate both semiparametric method using Cox proportional hazards model and parametric competing risk model. Both prognostic and predictive tree models are developed to adjust for potential confounding factors. Extensive simulations show that our methods have well-controlled type I error and robust power performance. Finally, we apply both Cox proportional hazards model and flexible parametric model for prognostic tree development on a retrospective clinical study on oropharyngeal cancer patients. PMID:27486300
Direct Waveform Inversion: a New Recursive Scheme
NASA Astrophysics Data System (ADS)
Zheng, Y.
2015-12-01
The goal of the full-waveform inversion (FWI) is to find an Earth's model such that the synthetic waveforms computed using the model fit the observed ones. In practice, such a model is found in the context of the perturbation approach in an iterative fashion. Specifically, to find such a model, one starts from an initial global velocity model and perform model updating iteratively based on the Frechet derivative or single scattering by adjoint methods to minimize some cost function. However, this process often leads to local minima for the nonlinear cost function in the optimization and slow or no convergence when the starting model is far from the true model. To solve for the initial-model dependence and the convergence issue, we show a new direct waveform inversion (DWI) idea to directly invert the waveform data recursively by explicitly enforcing the causality principle. The DWI offers the advantage of assuming no global initial model and no iteration is needed for the model updating. Starting from the source-receiver region, the DWI builds the model outward recursively by fitting the earliest part of the reflection waveforms and the DWI process is always convergent. The DWI combines seismic imaging and velocity model building into one single process and this is in contrast to many industrial applications where seismic imaging/migration and velocity modeling building are done alternatively. The DWI idea is applicable to one-, two-, and three-dimensional spaces. We show numerical examples to support our idea using full waveform data including both free-surface and inter-bed multiples. Using reflection seismic data, we show that the DWI can invert for both velocity and density, separately.
NASA Technical Reports Server (NTRS)
Truong, Trieu-Kie (Inventor); Hsu, In-Shek (Inventor); Reed, Irving S. (Inventor)
1989-01-01
A pipeline binary updown counter is comprised of simple stages that may be readily replicated. Each stage is defined by the Boolean logic equation: A(sub n)(t) = A(sub n)(t - 1) exclusive OR (U AND P(sub n)) inclusive OR (D AND Q(sub n)), where A(sub n)(t) denotes the value of the nth bit at time t. The input to the counter has three values represented by two binary signals U and D such that if both are zero, the input is zero, if U = 0 and D = 1, the input is -1 and if U = 1 and D = 0, the input is +1. P(sub n) represents a product of A(sub k)'s for 1 is less than or equal to k is less than or equal to -1, while Q(sub n) represents the product of bar A's for 1 is less than or equal to K is less than or equal to n - 1, where bar A(sub k) is the complement of A(sub k) and P(sub n) and Q(sub n) are expressed as the following two equations: P(sub n) = A(sub n - 1) A(sub n - 2)...A(sub 1) and Q(sub n) = bar A(sub n - 1) bar A(sub n - 2)...bar A(sub 1), which can be written in recursive form as P(sub n) = P(sub n - 1) AND bar A(sub n - 1) and Q(sub n) = Q(sub n - 1) AND bar A(sub n - 1) with the initial values P(sub 1) = 1 and Q(sub 1) = 1.
COMPARISON OF RECURSIVE ESTIMATION TECHNIQUES FOR POSITION TRACKING RADIOACTIVE SOURCES
K. MUSKE; J. HOWSE
2000-09-01
This paper compares the performance of recursive state estimation techniques for tracking the physical location of a radioactive source within a room based on radiation measurements obtained from a series of detectors at fixed locations. Specifically, the extended Kalman filter, algebraic observer, and nonlinear least squares techniques are investigated. The results of this study indicate that recursive least squares estimation significantly outperforms the other techniques due to the severe model nonlinearity.
Recursion Operators for CBC system with reductions. Geometric theory
NASA Astrophysics Data System (ADS)
Yanovski, A.; Vilasi, G.
2016-09-01
We discuss some recent developments of the geometric theory of the Recursion Operators (Generating Operators) for Caudrey-Beals-Coifman systems (CBC systems) on semisimple Lie algebras. As is well known the essence of this interpretation is that the Recursion Operators could be considered as adjoint to Nijenhuis tensors on certain infinite-dimensional manifolds. In particular, we discuss the case when there are Zp reductions of Mikhailov type.
Paczynacuteski, B
1984-07-20
Most stars in the solar neighborhood are either double or multiple systems. They provide a unique opportunity to measure stellar masses and radii and to study many interesting and important phenomena. The best candidates for black holes are compact massive components of two x-ray binaries: Cygnus X-1 and LMC X-3. The binary radio pulsar PSR 1913 + 16 provides the best available evidence for gravitational radiation. Accretion disks and jets observed in close binaries offer a very good testing ground for models of active galactic nuclei and quasars.
Paczynacuteski, B
1984-07-20
Most stars in the solar neighborhood are either double or multiple systems. They provide a unique opportunity to measure stellar masses and radii and to study many interesting and important phenomena. The best candidates for black holes are compact massive components of two x-ray binaries: Cygnus X-1 and LMC X-3. The binary radio pulsar PSR 1913 + 16 provides the best available evidence for gravitational radiation. Accretion disks and jets observed in close binaries offer a very good testing ground for models of active galactic nuclei and quasars. PMID:17749544
Recursive Construction of Operator Product Expansion Coefficients
NASA Astrophysics Data System (ADS)
Holland, Jan; Hollands, Stefan
2015-06-01
We derive a novel formula for the derivative of operator product expansion (OPE) coefficients with respect to a coupling constant. The formula involves just the OPE coefficients themselves but no further input, and is in this sense self-consistent. Furthermore, unlike other formal identities of this general nature in quantum field theory (such as the formal expression for the Lagrangian perturbation of a correlation function), our formula requires no further UV-renormalization, i.e., it is completely well-defined from the start. This feature is a result of a cancelation of UV- and IR-divergences between various terms in our identity. Our proof, and an analysis of the features of the identity, is given for the example of massive, Euclidean theory in 4 dimensional Euclidean space. It relies on the renormalization group flow equation method and is valid to arbitrary, but finite orders in perturbation theory. The final formula, however, makes neither explicit reference to the renormalization group flow, nor to perturbation theory, and we conjecture that it also holds non-perturbatively. Our identity can be applied constructively because it gives a novel recursive algorithm for the computation of OPE coefficients to arbitrary (finite) perturbation order in terms of the zeroth order coefficients corresponding to the underlying free field theory, which in turn are trivial to obtain. We briefly illustrate the relation of this method to more standard methods for computing the OPE in some simple examples.
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.
Recursion to food plants by free-ranging Bornean elephant.
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
Recursion to food plants by free-ranging Bornean elephant
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
NASA Astrophysics Data System (ADS)
Li, Lei; Yang, Kecheng; Li, Wei; Wang, Wanyan; Guo, Wenping; Xia, Min
2016-07-01
Conventional regularization methods have been widely used for estimating particle size distribution (PSD) in single-angle dynamic light scattering, but they could not be used directly in multiangle dynamic light scattering (MDLS) measurements for lack of accurate angular weighting coefficients, which greatly affects the PSD determination and none of the regularization methods perform well for both unimodal and multimodal distributions. In this paper, we propose a recursive regularization method-Recursion Nonnegative Tikhonov-Phillips-Twomey (RNNT-PT) algorithm for estimating the weighting coefficients and PSD from MDLS data. This is a self-adaptive algorithm which distinguishes characteristics of PSDs and chooses the optimal inversion method from Nonnegative Tikhonov (NNT) and Nonnegative Phillips-Twomey (NNPT) regularization algorithm efficiently and automatically. In simulations, the proposed algorithm was able to estimate the PSDs more accurately than the classical regularization methods and performed stably against random noise and adaptable to both unimodal and multimodal distributions. Furthermore, we found that the six-angle analysis in the 30-130° range is an optimal angle set for both unimodal and multimodal PSDs.
The redundancy of recursion and infinity for natural language.
Luuk, Erkki; Luuk, Hendrik
2011-02-01
An influential line of thought claims that natural language and arithmetic processing require recursion, a putative hallmark of human cognitive processing (Chomsky in Evolution of human language: biolinguistic perspectives. Cambridge University Press, Cambridge, pp 45-61, 2010; Fitch et al. in Cognition 97(2):179-210, 2005; Hauser et al. in Science 298(5598):1569-1579, 2002). First, we question the need for recursion in human cognitive processing by arguing that a generally simpler and less resource demanding process--iteration--is sufficient to account for human natural language and arithmetic performance. We argue that the only motivation for recursion, the infinity in natural language and arithmetic competence, is equally approachable by iteration and recursion. Second, we submit that the infinity in natural language and arithmetic competence reduces to imagining infinite embedding or concatenation, which is completely independent from the ability to implement infinite processing, and thus, independent from both recursion and iteration. Furthermore, we claim that a property of natural language is physically uncountable finity and not discrete infinity. PMID:20652723
The redundancy of recursion and infinity for natural language.
Luuk, Erkki; Luuk, Hendrik
2011-02-01
An influential line of thought claims that natural language and arithmetic processing require recursion, a putative hallmark of human cognitive processing (Chomsky in Evolution of human language: biolinguistic perspectives. Cambridge University Press, Cambridge, pp 45-61, 2010; Fitch et al. in Cognition 97(2):179-210, 2005; Hauser et al. in Science 298(5598):1569-1579, 2002). First, we question the need for recursion in human cognitive processing by arguing that a generally simpler and less resource demanding process--iteration--is sufficient to account for human natural language and arithmetic performance. We argue that the only motivation for recursion, the infinity in natural language and arithmetic competence, is equally approachable by iteration and recursion. Second, we submit that the infinity in natural language and arithmetic competence reduces to imagining infinite embedding or concatenation, which is completely independent from the ability to implement infinite processing, and thus, independent from both recursion and iteration. Furthermore, we claim that a property of natural language is physically uncountable finity and not discrete infinity.
Knot Invariants from Topological Recursion on Augmentation Varieties
NASA Astrophysics Data System (ADS)
Gu, Jie; Jockers, Hans; Klemm, Albrecht; Soroush, Masoud
2015-06-01
Using the duality between Wilson loop expectation values of SU( N) Chern-Simons theory on S 3 and topological open-string amplitudes on the local mirror of the resolved conifold, we study knots on S 3 and their invariants encoded in colored HOMFLY polynomials by means of topological recursion. In the context of the local mirror Calabi-Yau threefold of the resolved conifold, we generalize the topological recursion of the remodelled B-model in order to study branes beyond the class of toric Harvey-Lawson special Lagrangians—as required for analyzing non-trivial knots on S 3. The basic ingredients for the proposed recursion are the spectral curve, given by the augmentation variety of the knot, and the calibrated annulus kernel, encoding the topological annulus amplitudes associated to the knot. We present an explicit construction of the calibrated annulus kernel for torus knots and demonstrate the validity of the topological recursion. We further argue that—if an explicit form of the calibrated annulus kernel is provided for any other knot—the proposed topological recursion should still be applicable. We study the implications of our proposal for knot theory, which exhibit interesting consequences for colored HOMFLY polynomials of mutant knots.
On 2-D recursive LMS algorithms using ARMA prediction for ADPCM encoding of images.
Chung, Y S; Kanefsky, M
1992-01-01
A two-dimensional (2D) linear predictor which has an autoregressive moving average (ARMA) representation well as a bias term is adapted for adaptive differential pulse code modulation (ADPCM) encoding of nonnegative images. The predictor coefficients are updated by using a 2D recursive LMS (TRLMS) algorithm. A constraint on optimum values for the convergence factors and an updating algorithm based on the constraint are developed. The coefficient updating algorithm can be modified with a stability control factor. This realization can operate in real time and in the spatial domain. A comparison of three different types of predictors is made for real images. ARMA predictors show improved performance relative to an AR algorithm. PMID:18296174
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.
Spin-1 Ising model on tetrahedron recursive lattices: Exact results
NASA Astrophysics Data System (ADS)
Jurčišinová, E.; Jurčišin, M.
2016-11-01
We investigate the ferromagnetic spin-1 Ising model on the tetrahedron recursive lattices. An exact solution of the model is found in the framework of which it is shown that the critical temperatures of the second order phase transitions of the model are driven by a single equation simultaneously on all such lattices. It is also shown that this general equation for the critical temperatures is equivalent to the corresponding polynomial equation for the model on the tetrahedron recursive lattice with arbitrary given value of the coordination number. The explicit form of these polynomial equations is shown for the lattices with the coordination numbers z = 6, 9, and 12. In addition, it is shown that the thermodynamic properties of all possible physical phases of the model are also completely driven by the corresponding single equations simultaneously on all tetrahedron recursive lattices. In this respect, the spontaneous magnetization, the free energy, the entropy, and the specific heat of the model are studied in detail.
Recursive Query Facilities in Relational Databases: A Survey
NASA Astrophysics Data System (ADS)
Przymus, Piotr; Boniewicz, Aleksandra; Burzańska, Marta; Stencel, Krzysztof
The relational model is the basis for most modern databases, while SQL is the most commonly used query language. However, there are data structures and computational problems that cannot be expressed using SQL-92 queries. Among them are those concerned with the bill-of-material and corporate hierarchies. A newer standard, called the SQL-99, introduced recursive queries which can be used to solve such tasks. Yet, only recently recursive queries have been implemented in most of the leading relational databases. In this paper we have reviewed and compared implementations of the recursive queries defined by SQL:1999 through SQL:2008 and offered by leading vendors of DBMSs. Our comparison concerns features, syntax and performance.
The limits on combining recursive horn rules with description logics
Levy, A.Y.; Rousset, M.C.
1996-12-31
Horn rule languages have formed the basis for many Artificial Intelligence application languages, but are not expressive enough to model domains with a rich hierarchical structure. Description logics have been designed especially to model rich hierarchies. Several applications would significantly benefit from combining the expressive power of both formalisms. This paper focuses on combining recursive function-free Horn rules with the expressive description logic ALCNR, and shows exactly when a hybrid language with decidable inference can be obtained. First, we show that several of the core constructors of description logics lead by themselves to undecidability of inference when combined with recursive function-free Horn rules. We then show that without these constructors we obtain a maximal subset of ALCNRR that yields a decidable hybrid language. Finally, we describe a restriction on the Horn rules that guarantees decidable inference when combined with all of ALCNR, and covers many of the common usages of recursive rules.
Elucidating the stop bands of structurally colored systems through recursion
NASA Astrophysics Data System (ADS)
Amir, Ariel; Vukusic, Peter
2013-04-01
Interference is the source of some of the spectacular colors of animals and plants in nature. In some of these systems, the physical structure consists of an ordered array of layers with alternating high and low refractive indices. This periodicity leads to an optical band structure that is analogous to the electronic band structure encountered in semiconductor physics: specific bands of wavelengths (the stop bands) are perfectly reflected. Here, we present a minimal model for optical band structure in a periodic multilayer structure and solve it using recursion relations. The stop bands emerge in the limit of an infinite number of layers by finding the fixed point of the recursion. We compare to experimental data for various beetles, whose optical structure resembles the proposed model. Thus, using only the phenomenon of interference and the idea of recursion, we are able to elucidate the concept of band structure in the context of the experimentally observed high reflectance and iridescent appearance of structurally colored beetles.
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.
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
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.
Recursive multibody dynamics and discrete-time optimal control
NASA Technical Reports Server (NTRS)
Deleuterio, G. M. T.; Damaren, C. J.
1989-01-01
A recursive algorithm is developed for the solution of the simulation dynamics problem for a chain of rigid bodies. Arbitrary joint constraints are permitted, that is, joints may allow translational and/or rotational degrees of freedom. The recursive procedure is shown to be identical to that encountered in a discrete-time optimal control problem. For each relevant quantity in the multibody dynamics problem, there exists an analog in the context of optimal control. The performance index that is minimized in the control problem is identified as Gibbs' function for the chain of bodies.
Recursive dynamics algorithm for multibody systems with prescribed motion
NASA Astrophysics Data System (ADS)
Jain, Abhinandan; Rodriguez, Guillermo
1993-10-01
This paper uses spatial operator techniques to develop a new algorithm for the dynamics of multibody systems with hinges undergoing prescribed motion. This algorithm is spatially recursive, and its computational complexity grows only linearly with the number of degrees of freedom in the system. Its structure is a hybrid of known recursive forward and inverse dynamics algorithms for regular multibody systems. Changes to the prescribed/nonprescribed nature of hinges can be implemented during run time since they are handled with very low overhead in the algorithm.
Efficient Scheduling of Recursive Control Flow on GPUs
Huo, Xin; Krishnamoorthy, Sriram; Agrawal, Gagan
2013-06-10
Graphics processing units (GPUs) have rapidly emerged as a very significant player in high performance computing. Single instruction multiple thread (SIMT) pipelines are typically used in GPUs to exploit parallelism and maximize performance. Although support for unstructured control flow has been included in GPUs, efficiently managing thread divergence for arbitrary parallel programs remains a critical challenge. In this paper, we focus on the problem of supporting recursion in modern GPUs. We design and comparatively evaluate various algorithms to manage thread divergence encountered in recursive programs. The results improve upon traditional post-dominator based reconvergence mechanisms designed to handle thread divergence due to control flow within a procedure.
NASA Astrophysics Data System (ADS)
Ryan, Keegan; Nakajima, Miki; Stevenson, David J.
2014-11-01
Can a bound pair of similar mass terrestrial planets exist? We are interested here in bodies with a mass ratio of ~ 3:1 or less (so Pluto/Charon or Earth/Moon do not qualify) and we do not regard the absence of any such discoveries in the Kepler data set to be significant since the tidal decay and merger of a close binary is prohibitively fast well inside of 1AU. SPH simulations of equal mass “Earths” were carried out to seek an answer to this question, assuming encounters that were only slightly more energetic than parabolic (zero energy). We were interested in whether the collision or near collision of two similar mass bodies would lead to a binary in which the two bodies remain largely intact, effectively a tidal capture hypothesis though with the tidal distortion being very large. Necessarily, the angular momentum of such an encounter will lead to bodies separated by only a few planetary radii if capture occurs. Consistent with previous work, mostly by Canup, we find that most impacts are disruptive, leading to a dominant mass body surrounded by a disk from which a secondary forms whose mass is small compared to the primary, hence not a binary planet by our adopted definition. However, larger impact parameter “kissing” collisions were found to produce binaries because the dissipation upon first encounter was sufficient to provide a bound orbit that was then rung down by tides to an end state where the planets are only a few planetary radii apart. The long computational times for these simulation make it difficult to fully map the phase space of encounters for which this outcome is likely but the indications are that the probability is not vanishingly small and since planetary encounters are a plausible part of planet formation, we expect binary planets to exist and be a non-negligible fraction of the larger orbital radius exoplanets awaiting discovery.
Recursive single-layer nets for output error dynamic models.
Berger, C S
1995-01-01
An algorithm for training recursive single-layer nets that has been shown to exhibit rapid convergence is presented. Convergence is not guaranteed, but a sufficient condition is given to justify the method. The method is demonstrated on a difficult modeling problem from bioengineering.
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…
Experimental verification of a recursive method to calculate evapotranspiration
Technology Transfer Automated Retrieval System (TEKTRAN)
Recently, a recursive combination method (RCM) to calculate potential and crop evapotranspiration (ET) was given by Lascano and Van Bavel (Agron. J. 2007, 99:585–590). The RCM differs from the Penman-Monteith (PM) method, the main difference being that the assumptions made regarding the temperature ...
Exploring the Recursive Nature of Food and Family Communication
ERIC Educational Resources Information Center
Manning, Linda D.
2006-01-01
Family meals act as a barometer to signify the changing nature of family life. The primary objective of this activity is to allow students to experience the many ways in which a recursive relationship exists between the food families eat and the patterns of communication families enact. Through this activity, students experience how food and…
Recursive least-squares learning algorithms for neural networks
Lewis, P.S. ); Hwang, Jenq-Neng . Dept. of Electrical Engineering)
1990-01-01
This paper presents the development of a pair of recursive least squares (RLS) 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 in the order of (N{sup 2}), where N is the number of network parameters. This is due to the estimation of the N {times} N inverse Hessian matrix. Less computationally intensive approximations of the RLS 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 (6331). 14 refs., 3 figs.
Recursive Frame Analysis: A Practitioner's Tool for Mapping Therapeutic Conversation
ERIC Educational Resources Information Center
Keeney, Hillary; Keeney, Bradford; Chenail, Ronald J.
2012-01-01
Recursive frame analysis (RFA), both a practical therapeutic tool and an advanced qualitative research method that maps the structure of therapeutic conversation, is introduced with a clinical case vignette. We present and illustrate a means of mapping metaphorical themes that contextualize the performance taking place in the room, recursively…
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 tested by…
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…
A Further Investigation of Children's Understanding of Recursive Thinking.
ERIC Educational Resources Information Center
Eliot, John; And Others
1979-01-01
Forty children of different ages responded individually to cartoon drawing in one of two orders of presentation in order to investigate children's understanding of recursive thinking. Five boys and five girls in each of the age ranges five to six, six to seven, seven to eight, and eight to nine served as subjects. (MP)
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.
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,…
Recursion method for deriving an energy-independent effective interaction
NASA Astrophysics Data System (ADS)
Suzuki, Kenji; Kumagai, Hiroo; Okamoto, Ryoji; Matsuzaki, Masayuki
2014-04-01
The effective-interaction theory has been one of the useful and practical methods for solving nuclear many-body problems based on the shell model. Various approaches have been proposed which are constructed in terms of the so-called Q̂ box and its energy derivatives introduced by Kuo et al. In order to find out a method of calculating them we make a decomposition of a full Hilbert space into subspaces (the Krylov subspaces) and transform a Hamiltonian to a block-tridiagonal form. This transformation brings about much simplification of the calculation of the Q̂ box. In the previous work a recursion method was derived for calculating the Q̂ box analytically on the basis of such transformation of the Hamiltonian. In the present study, by extending the recursion method for the Q̂ box, we derive another recursion relation to calculate the derivatives of the Q̂ box of arbitrary order. With the Q̂ box and its derivatives thus determined we apply them to the calculation of the E-independent effective interaction given in the so-called Lee-Suzuki (LS) method for a system with a degenerate unperturbed energy. We show that the recursion method can also be applied to the generalized LS scheme for a system with nondegenerate unperturbed energies. If the Hilbert space is taken to be sufficiently large, the theory provides an exact way of calculating the Q̂ box and its derivatives. This approach enables us to perform recursive calculations for the effective interaction to arbitrary order for both systems with degenerate and nondegenerate unperturbed energies.
An investigation of a manipulative simulation in the learning of recursive programming
NASA Astrophysics Data System (ADS)
Bower, Randall Wayne
Recursion is a fundamentally important topic in computer science. Even so, it is often omitted in introductory courses, or discussed only briefly. This is likely due, at least in part, to the fact that teaching recursion has been difficult. Perhaps the biggest problem in teaching recursion is that there are few, if any, naturally existing examples of recursion in our lives. However, successful simulations have shown that the computer may hold the key to solving this problem. A simulation of recursion presented to students before formal classroom instruction can provide a foundation of concrete experiences to build upon. The challenge is to develop an appropriate simulation and lesson plan for introducing recursion to students early in their programming experience. This research reviews previous attempts at teaching recursion, including detailed lesson plans, mental models of recursion, and other simulations. Then, a new simulation and lesson plan for its use are described. The effectiveness of the simulation is studied using two groups of students enrolled in a college-level, introductory programming course. Results indicate that students who used the simulation as their first exposure to recursion gained a deeper understanding of recursion than students receiving a lecture-based introduction to recursion. Specifically, students who used the simulation required fewer attempts to complete a set of recursive programming exercises and performed better on a follow-up exam given six weeks after the experiment. This research concludes with a discussion of two important questions: How should students think about recursion and how do they think about recursion. The simulation's strengths and shortcomings in fostering effective ways of thinking about recursion are also discussed.
NASA Astrophysics Data System (ADS)
Chen, Yi-nan; Jin, Wei-qi; Zhao, Lei; Zhao, Lin; Wang, Tan
2008-02-01
A scene-based nonuiformity correction occurred in the operation of recursive reconstruction for high resolution extracted from subpixel microscan imaging (SMI) sequence are presented and analyzed. The reconstruction algorithm in terms of block-by-block method recursive from the prescient boundary to centre in uniform 2×2 SMI, is updated to the two-dimensional focus plane array (FPA) considering the arbitrary scan translation not equivalent to the accurate halfpixel. In this paper, the focus is concentrated to the nonuniform SMI model with fixed pattern noise (FPN), which corrupts the image by the gain and offset from the individual cell-detector. Then, we firstly demonstrate that once our backward recursive reconstruction implements to the undersampled sequence with FPN, the dramatic impact to the majority pixels is the elimination of the offset due to the quits efficiency by inverse iterative function in each 2×2 region belonging to the high resolution lattice. The final achievement is the nonuiformity correction (NUC) synchronously concomitant with the higher resolution, so our method fully takes account of the potential information of the scanned inter-frames. Application of proposed algorithm to the simulated SMI procedure has the obvious superiority, including the much better image quality indexes from the cleaned FPN, time-consumed saving within one scan period (4 frames), no requirements of statistical assumption so as to the avoidance of ghost artifact, and the inter-frames adaptive property.
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.
EEG and MEG source localization using recursively applied (RAP) MUSIC
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 uses 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.
Berends-Giele recursion for double-color-ordered amplitudes
NASA Astrophysics Data System (ADS)
Mafra, Carlos R.
2016-07-01
Tree-level double-color-ordered amplitudes are computed using Berends-Giele recursion relations applied to the bi-adjoint cubic scalar theory. The standard notion of Berends-Giele currents is generalized to double-currents and their recursions are derived from a perturbiner expansion of linearized fields that solve the non-linear field equations. Two applications are given. Firstly, we prove that the entries of the inverse KLT matrix are equal to Berends-Giele double-currents (and are therefore easy to compute). And secondly, a simple formula to generate tree-level BCJ-satisfying numerators for arbitrary multiplicity is proposed by evaluating the field-theory limit of tree-level string amplitudes for various color orderings using double-color-ordered amplitudes.
An algorithm for protein engineering: simulations of recursive ensemble mutagenesis.
Arkin, A P; Youvan, D C
1992-01-01
An algorithm for protein engineering, termed recursive ensemble mutagenesis, has been developed to produce diverse populations of phenotypically related mutants whose members differ in amino acid sequence. This method uses a feedback mechanism to control successive rounds of combinatorial cassette mutagenesis. Starting from partially randomized "wild-type" DNA sequences, a highly parallel search of sequence space for peptides fitting an experimenter's criteria is performed. Each iteration uses information gained from the previous rounds to search the space more efficiently. Simulations of the technique indicate that, under a variety of conditions, the algorithm can rapidly produce a diverse population of proteins fitting specific criteria. In the experimental analog, genetic selection or screening applied during recursive ensemble mutagenesis should force the evolution of an ensemble of mutants to a targeted cluster of related phenotypes. Images PMID:1502200
On Recursion Operator of the q-KP Hierarchy
NASA Astrophysics Data System (ADS)
Tian, Ke-Lei; Zhu, Xiao-Ming; He, Jing-Song
2016-09-01
It is the aim of the present article to give a general expression of flow equations of the q-KP hierarchy. The distinct difference between the q-KP hierarchy and the KP hierarchy is due to q-binomial and the action of q-shift operator θ, which originates from the Leibnitz rule of the quantum calculus. We further show that the n-reduction leads to a recursive scheme for these flow equations. The recursion operator for the flow equations of the q-KP hierarchy under the n-reduction is also derived. Supported by the National Natural Science Foundation of China under Grant Nos. 11271210 and 11201451, and Anhui Province Natural Science Foundation under Grant No. 1608085MA04
Development of a recursion RNG-based turbulence model
NASA Technical Reports Server (NTRS)
Zhou, YE; Vahala, George; Thangam, S.
1993-01-01
Reynolds stress closure models based on the recursion renormalization group theory are developed for the prediction of turbulent separated flows. The proposed model uses a finite wavenumber truncation scheme to account for the spectral distribution of energy. In particular, the model incorporates effects of both local and nonlocal interactions. The nonlocal interactions are shown to yield a contribution identical to that from the epsilon-renormalization group (RNG), while the local interactions introduce higher order dispersive effects. A formal analysis of the model is presented and its ability to accurately predict separated flows is analyzed from a combined theoretical and computational stand point. Turbulent flow past a backward facing step is chosen as a test case and the results obtained based on detailed computations demonstrate that the proposed recursion -RNG model with finite cut-off wavenumber can yield very good predictions for the backstep problem.
A Precision Recursive Estimate for Ephemeris Refinement (PREFER)
NASA Technical Reports Server (NTRS)
Gibbs, B.
1980-01-01
A recursive filter/smoother orbit determination program was developed to refine the ephemerides produced by a batch orbit determination program (e.g., CELEST, GEODYN). The program PREFER can handle a variety of ground and satellite to satellite tracking types as well as satellite altimetry. It was tested on simulated data which contained significant modeling errors and the results clearly demonstrate the superiority of the program compared to batch estimation.
An Accelerated Recursive Doubling Algorithm for Block Tridiagonal Systems
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 multiple 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.
Recursive linear optical networks for realizing quantum algorithms
NASA Astrophysics Data System (ADS)
Tabia, Gelo Noel
Linear optics has played a leading role in the development of practical quantum technologies. In recent years, advances in integrated quantum photonics have significantly improved the functionality and scalability of linear optical devices. In this talk, I present recursive schemes for implementing quantum Fourier transforms and inversion about the mean in Grover's algorithm with photonic integrated circuits. By recursive, I mean that two copies of a d-dimensional unitary operation is used to build the corresponding unitary operation on 2 d modes. The linear optical networks operate on path-encoded qudits and realize d-dimensional unitary operations using O (d2) elements. To demonstrate that the recursive circuits are viable in practice, I conducted simulations of proof-of-principle experiments using a fabrication model of realistic errors in silicon-based photonic integrated devices. The results indicate high-fidelity performance in the circuits for 2-qubit and 3-qubit quantum Fourier transforms, and for quantum search on 4-item and 8-item databases. This work was funded by institutional research grant IUT2-1 from the Estonian Research Council and by the European Union through the European Regional Development Fund.
Dynamics of deformable multibody systems using recursive projection methods
NASA Astrophysics Data System (ADS)
Shabana, A. A.
1992-12-01
In this investigation, generalized Newton-Euler equations are developed for deformable bodies that undergo large translational and rotational displacements. The configuration of the deformable body is identified using coupled sets of reference and elastic variables. The nonlinear generalized Newton-Euler equations are formulated in terms of a set of time invariant scalars and matrices that depend on the spatial coordinates as well as the assumed displacement field. These time-invariant quantities appear in the nonlinear terms that represent the dynamic coupling between the rigid body modes and the elastic deformation. A set of recursive kinematic equations, in which the absolute accelerations are expressed in terms of the joint and elastic accelerations are developed for several joint types. The recursive kinematic equations and the joint reaction relationships are combined with the generalized Newton-Euler equations in order to obtain a system of loosely coupled equations which have sparse matrix structure. Using matrix partitioning and recursive projection techniques based on optimal block factorization an order n solution for the system equations is obtained.
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.
Parallelizable approximate solvers for recursions arising in preconditioning
Shapira, Y.
1996-12-31
For the recursions used in the Modified Incomplete LU (MILU) preconditioner, namely, the incomplete decomposition, forward elimination and back substitution processes, a parallelizable approximate solver is presented. The present analysis shows that the solutions of the recursions depend only weakly on their initial conditions and may be interpreted to indicate that the inexact solution is close, in some sense, to the exact one. The method is based on a domain decomposition approach, suitable for parallel implementations with message passing architectures. It requires a fixed number of communication steps per preconditioned iteration, independently of the number of subdomains or the size of the problem. The overlapping subdomains are either cubes (suitable for mesh-connected arrays of processors) or constructed by the data-flow rule of the recursions (suitable for line-connected arrays with possibly SIMD or vector processors). Numerical examples show that, in both cases, the overhead in the number of iterations required for convergence of the preconditioned iteration is small relatively to the speed-up gained.
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.
Tan, Zhi-Zhong
2015-05-01
We develop a general recursion-transform (R-T) method for a two-dimensional resistor network with a zero resistor boundary. As applications of the R-T method, we consider a significant example to illuminate the usefulness for calculating resistance of a rectangular m×n resistor network with a null resistor and three arbitrary boundaries, a problem never solved before, since Green's function techniques and Laplacian matrix approaches are invalid in this case. Looking for the exact calculation of the resistance of a binary resistor network is important but difficult in the case of an arbitrary boundary since the boundary is like a wall or trap which affects the behavior of finite network. In this paper we obtain several general formulas of resistance between any two nodes in a nonregular m×n resistor network in both finite and infinite cases. In particular, 12 special cases are given by reducing one of the general formulas to understand its applications and meanings, and an integral identity is found when we compare the equivalent resistance of two different structures of the same problem in a resistor network. PMID:26066134
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.
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.
Binary tree eigen solver in finite element analysis
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. 5 refs.
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
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
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
Absence of the Kosterlitz-Thouless fixed points in the Migdal-Kadanoff recursion formulas
Ito, K.R.
1985-06-03
It is shown that the Migdal approximate-renormalization recursion formulas always bring the initial state into the high-temperature region for the U(1)-invariant models at the critical dimensions. This means that the Migdal recursion formulas fail to exhibit the Kosterlitz-Thouless transitions. This is also the case for the recursion formulas of Kadanoff type. The method developed here is extended to non-Abelian systems by some additional tricks.
Kontogiannis, Tom; Malakis, Stathis
2012-09-01
A recursive model of accident investigation is proposed by exploiting earlier work in systems thinking. Safety analysts can understand better the underlying causes of decision or action flaws by probing into the patterns of breakdown in the organization of safety. For this deeper analysis, a cybernetic model of organizational factors and a control model of human processes have been integrated in this article (i.e., the viable system model and the extended control model). The joint VSM-ECOM framework has been applied to a case study to help safety practitioners with the analysis of patterns of breakdown with regard to how operators and organizations manage goal conflicts, monitor work progress, recognize weak signals, align goals across teams, and adapt plans on the fly. The recursive accident representation brings together several organizational issues (e.g., the dilemma of autonomy versus compliance, or the interaction between structure and strategy) and addresses how operators adapt to challenges in their environment by adjusting their modes of functioning and recovery. Finally, it facilitates the transfer of knowledge from diverse incidents and near misses within similar domains of practice.
Genome-wide Identification of Zero Nucleotide Recursive Splicing in Drosophila
Duff, Michael O.; Olson, Sara; Wei, Xintao; Garrett, Sandra C.; Osman, Ahmad; Bolisetty, Mohan; Plocik, Alex; Celniker, Susan; Graveley, Brenton R.
2015-01-01
Recursive splicing is a process in which large introns are removed in multiple steps by resplicing at ratchet points - 5′ splice sites recreated after splicing1. Recursive splicing was first identified in the Drosophila Ultrabithorax (Ubx) gene1 and only three additional Drosophila genes have since been experimentally shown to undergo recursive splicing2,3. Here, we identify 197 zero nucleotide exon ratchet points in 130 introns of 115 Drosophila genes from total RNA sequencing data generated from developmental time points, dissected tissues, and cultured cells. The sequential nature of recursive splicing was confirmed by identification of lariat introns generated by splicing to and from the ratchet points. We also show that recursive splicing is a constitutive process, that depletion of U2AF inhibits recursive splicing, and that the sequence and function of ratchet points are evolutionarily conserved in Drosophila. Finally, we identified four recursively spliced human genes, one of which is also recursively spliced in Drosophila. Together these results indicate that recursive splicing is commonly used in Drosophila, occurs in human and provides insight into the mechanisms by which some large introns are removed. PMID:25970244
The Abelian Sandpile Model on a Random Binary Tree
NASA Astrophysics Data System (ADS)
Redig, F.; Ruszel, W. M.; Saada, E.
2012-06-01
We study the abelian sandpile model on a random binary tree. Using a transfer matrix approach introduced by Dhar and Majumdar, we prove exponential decay of correlations, and in a small supercritical region (i.e., where the branching process survives with positive probability) exponential decay of avalanche sizes. This shows a phase transition phenomenon between exponential decay and power law decay of avalanche sizes. Our main technical tools are: (1) A recursion for the ratio between the numbers of weakly and strongly allowed configurations which is proved to have a well-defined stochastic solution; (2) quenched and annealed estimates of the eigenvalues of a product of n random transfer matrices.
Design of a recursive vector processor using polynomial splines
NASA Technical Reports Server (NTRS)
Kim, C. S.; Shen, C. N.
1980-01-01
The problem of obtaining smoothed estimates of function values, particularly their derivatives, from a finite set of inaccurate measurements is considered. A recursive two-dimensional vector processor is introduced as an approximation to the nonrecursive constrained least-squares estimation. Here, piecewise bicubic Hermite polynomials are extensively used as approximating functions, and the smoothing integral is converted to a discrete quadratic form. This makes it possible to convert the problem of fitting an approximating function to one of estimating the function values and derivatives at the nodes.
Random recursive trees and the elephant random walk
NASA Astrophysics Data System (ADS)
Kürsten, Rüdiger
2016-03-01
One class of random walks with infinite memory, so-called elephant random walks, are simple models describing anomalous diffusion. We present a surprising connection between these models and bond percolation on random recursive trees. We use a coupling between the two models to translate results from elephant random walks to the percolation process. We calculate, besides other quantities, exact expressions for the first and the second moment of the root cluster size and of the number of nodes in child clusters of the first generation. We further introduce another model, the skew elephant random walk, and calculate the first and second moment of this process.
Vision-based recursive estimation of rotorcraft obstacle locations
NASA Technical Reports Server (NTRS)
Leblanc, D. J.; Mcclamroch, N. H.
1992-01-01
The authors address vision-based passive ranging during nap-of-the-earth (NOE) rotorcraft flight. They consider the problem of estimating the relative location of identifiable features on nearby obstacles, assuming a sequence of noisy camera images and imperfect measurements of the camera's translation and rotation. An iterated extended Kalman filter is used to provide recursive range estimation. The correspondence problem is simplified by predicting and tracking each feature's image within the Kalman filter framework. Simulation results are presented which show convergent estimates and generally successful feature point tracking. Estimation performance degrades for features near the optical axis and for accelerating motions. Image tracking is also sensitive to angular rate.
Random recursive trees and the elephant random walk.
Kürsten, Rüdiger
2016-03-01
One class of random walks with infinite memory, so-called elephant random walks, are simple models describing anomalous diffusion. We present a surprising connection between these models and bond percolation on random recursive trees. We use a coupling between the two models to translate results from elephant random walks to the percolation process. We calculate, besides other quantities, exact expressions for the first and the second moment of the root cluster size and of the number of nodes in child clusters of the first generation. We further introduce another model, the skew elephant random walk, and calculate the first and second moment of this process. PMID:27078296
2010-01-01
Background The use of structural equation models for the analysis of recursive and simultaneous relationships between phenotypes has become more popular recently. The aim of this paper is to illustrate how these models can be applied in animal breeding to achieve parameterizations of different levels of complexity and, more specifically, to model phenotypic recursion between three calving traits: gestation length (GL), calving difficulty (CD) and stillbirth (SB). All recursive models considered here postulate heterogeneous recursive relationships between GL and liabilities to CD and SB, and between liability to CD and liability to SB, depending on categories of GL phenotype. Methods Four models were compared in terms of goodness of fit and predictive ability: 1) standard mixed model (SMM), a model with unstructured (co)variance matrices; 2) recursive mixed model 1 (RMM1), assuming that residual correlations are due to the recursive relationships between phenotypes; 3) RMM2, assuming that correlations between residuals and contemporary groups are due to recursive relationships between phenotypes; and 4) RMM3, postulating that the correlations between genetic effects, contemporary groups and residuals are due to recursive relationships between phenotypes. Results For all the RMM considered, the estimates of the structural coefficients were similar. Results revealed a nonlinear relationship between GL and the liabilities both to CD and to SB, and a linear relationship between the liabilities to CD and SB. Differences in terms of goodness of fit and predictive ability of the models considered were negligible, suggesting that RMM3 is plausible. Conclusions The applications examined in this study suggest the plausibility of a nonlinear recursive effect from GL onto CD and SB. Also, the fact that the most restrictive model RMM3, which assumes that the only cause of correlation is phenotypic recursion, performs as well as the others indicates that the phenotypic recursion
Parsimonious extreme learning machine using recursive orthogonal least squares.
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. PMID:25291736
Grid Based Nonlinear Filtering Revisited: Recursive Estimation & Asymptotic Optimality
NASA Astrophysics Data System (ADS)
Kalogerias, Dionysios S.; Petropulu, Athina P.
2016-08-01
We revisit the development of grid based recursive approximate filtering of general Markov processes in discrete time, partially observed in conditionally Gaussian noise. The grid based filters considered rely on two types of state quantization: The \\textit{Markovian} type and the \\textit{marginal} type. We propose a set of novel, relaxed sufficient conditions, ensuring strong and fully characterized pathwise convergence of these filters to the respective MMSE state estimator. In particular, for marginal state quantizations, we introduce the notion of \\textit{conditional regularity of stochastic kernels}, which, to the best of our knowledge, constitutes the most relaxed condition proposed, under which asymptotic optimality of the respective grid based filters is guaranteed. Further, we extend our convergence results, including filtering of bounded and continuous functionals of the state, as well as recursive approximate state prediction. For both Markovian and marginal quantizations, the whole development of the respective grid based filters relies more on linear-algebraic techniques and less on measure theoretic arguments, making the presentation considerably shorter and technically simpler.
Change-point detection for recursive Bayesian geoacoustic inversions.
Tan, Bien Aik; Gerstoft, Peter; Yardim, Caglar; Hodgkiss, William S
2015-04-01
In order to carry out geoacoustic inversion in low signal-to-noise ratio (SNR) conditions, extended duration observations coupled with source and/or receiver motion may be necessary. As a result, change in the underlying model parameters due to time or space is anticipated. In this paper, an inversion method is proposed for cases when the model parameters change abruptly or slowly. A model parameter change-point detection method is developed to detect the change in the model parameters using the importance samples and corresponding weights that are already available from the recursive Bayesian inversion. If the model parameters change abruptly, a change-point will be detected and the inversion will restart with the pulse measurement after the change-point. If the model parameters change gradually, the inversion (based on constant model parameters) may proceed until the accumulated model parameter mismatch is significant and triggers the detection of a change-point. These change-point detections form the heuristics for controlling the coherent integration time in recursive Bayesian inversion. The method is demonstrated in simulation with parameters corresponding to the low SNR, 100-900 Hz linear frequency modulation pulses observed in the Shallow Water 2006 experiment [Tan, Gerstoft, Yardim, and Hodgkiss, J. Acoust. Soc. Am. 136, 1187-1198 (2014)].
Efficient routing and broadcasting in recursive interconnection networks
Fernandes, R.; Friesen, D.K.; Kanevsky, A.
1994-12-31
The WK-Recursive Network (WKRN) is a hierarchical interconnection network that is recursively defined and has excellent properties for scalable message-passing multicomputer systems. In this paper, we present efficient routing and broadcasting schemes in a WKRN. For efficient routing, we define the MP-graph between the source and destination nodes of the message. For efficient broadcasting, we define the EDHP-graph and the NDST-graph. The MP-graph can also be used for message routing in the presence of faulty nodes. Similarly, the EDHP-graph (the NDST-graph) can be used for message broadcast in the presence of faulty links (nodes). Fault-tolerance communication schemes using these graphs have the advantage that no information about the presence or location of faulty components is required. Moreover, the MP-graph and the NDST-graph can be used under different fault models. We analyze the communication delays for message routing (broadcast) along MP-graphs (EDHP-graphs and NDST-graphs) under fault-free and faulty conditions.
Fine tuning points of generating function construction for linear recursions
NASA Astrophysics Data System (ADS)
Yolcu, Bahar; Demiralp, Metin
2014-10-01
Recursions are quite important mathematical tools since many systems are mathematically modelled to ultimately take us to these equations because of their rather easy algebraic natures. They fit computer programming needs quite well in many circumstances to produce solutions. However, it is generally desired to find the asymptotic behaviour of the general term in the relevant sequence for convergence and therefore practicality issues. One of the general tendencies to find the general term asymptotic behaviour, when its ordering number grows unboundedly, is the integral representation over a generating function which does not depend on individual sequence elements. This is tried to be done almost for all types of recursions, even though the linear cases gain more importance than the others because they can be more effectively investigated by using many linear algebraic tools. Despite this may seem somehow to be rather trivial, there are a lot of theoretical fine tuning issues in the construction of true integral representations over true intervals on real axis or paths in complex domains. This work is devoted to focus on this issue starting from scratch for better understanding of the matter. The example cases are chosen to best illuminate the situations to get information for future generalization even though the work can be considered at somehow introductory level.
Recursive mentalizing and common knowledge in the bystander effect.
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.
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.
Efficient Execution of Recursive Programs on Commodity Vector Hardware
Ren, Bin; Jo, Youngjoon; Krishnamoorthy, Sriram; Agrawal, Kunal; Kulkarni, Milind
2015-06-13
The pursuit of computational efficiency has led to the proliferation of throughput-oriented hardware, from GPUs to increasingly-wide vector units on commodity processors and accelerators. This hardware is designed to efficiently execute data-parallel computations in a vectorized manner. However, many algorithms are more naturally expressed as divide-and-conquer, recursive, task-parallel computations; in the absence of data parallelism, it seems that such algorithms are not well-suited to throughput-oriented architectures. This paper presents a set of novel code transformations that expose the data-parallelism latent in recursive, task-parallel programs. These transformations facilitate straightforward vectorization of task-parallel programs on commodity hardware. We also present scheduling policies that maintain high utilization of vector resources while limiting space usage. Across several task-parallel benchmarks, we demonstrate both efficient vector resource utilization and substantial speedup on chips using Intel's SSE4.2 vector units as well as accelerators using Intel's AVX512 units.
Recursive mentalizing and common knowledge in the bystander effect.
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. PMID:26913616
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.
Spectral Investigation of Binary Asteroids
NASA Astrophysics Data System (ADS)
Birlan, Mirel; Nedelcu, D.; Descamps, P.; Berthier, J.; Marchis, F.; Merouane, S.
2008-09-01
The number of binary asteroids increased in a significant manner during the last years. Multiple types of observations obtained in adaptive optics, photometry, and radar, allow the rethinking not only the dynamics of the asteroids, but also their physics. The spectroscopy of a binary system can play a key role for establish the mineralogical composition of components, and implicitly the range of their density. By the application of these considerations to the physical and dynamical models, the physical parameters such as the macro-porosity or the "rubble pile” structures could be derived. Observations of binary asteroid (854) Frostia, and binary candidates (1333) Cevenola, and (3632) Chaplin were carried out in the 0.8-2.5 µm spectral range using SpeX/IRTF in LowRes mode. The asteroids present features in both 1 and 2 µm regions, suggesting the presence of silicates in the surface composition. The analysis of slopes, band strengths, and the most probable mineralogical models will be presented.
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.
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…
NASA Technical Reports Server (NTRS)
Verhaegen, M. H.
1987-01-01
The numerical robustness of four generally applicable, recursive, least-squares-estimation schemes is analyzed by means of a theoretical round-off propagation study. This study highlights a number of practical, interesting insights of widely used recursive least-squares schemes. These insights have been confirmed in an experimental study as well.
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.
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
Recursive Subsystems in Aphasia and Alzheimer's Disease: Case Studies in Syntax and Theory of Mind.
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
Using recursion to compute the inverse of the genomic relationship matrix.
Misztal, I; Legarra, A; Aguilar, I
2014-01-01
Computing the inverse of the genomic relationship matrix using recursion was investigated. A traditional algorithm to invert the numerator relationship matrix is based on the observation that the conditional expectation for an additive effect of 1 animal given the effects of all other animals depends on the effects of its sire and dam only, each with a coefficient of 0.5. With genomic relationships, such an expectation depends on all other genotyped animals, and the coefficients do not have any set value. For each animal, the coefficients plus the conditional variance can be called a genomic recursion. If such recursions are known, the mixed model equations can be solved without explicitly creating the inverse of the genomic relationship matrix. Several algorithms were developed to create genomic recursions. In an algorithm with sequential updates, genomic recursions are created animal by animal. That algorithm can also be used to update a known inverse of a genomic relationship matrix for additional genotypes. In an algorithm with forward updates, a newly computed recursion is immediately applied to update recursions for remaining animals. The computing costs for both algorithms depend on the sparsity pattern of the genomic recursions, but are lower or equal than for regular inversion. An algorithm for proven and young animals assumes that the genomic recursions for young animals contain coefficients only for proven animals. Such an algorithm generates exact genomic EBV in genomic BLUP and is an approximation in single-step genomic BLUP. That algorithm has a cubic cost for the number of proven animals and a linear cost for the number of young animals. The genomic recursions can provide new insight into genomic evaluation and possibly reduce costs of genetic predictions with extremely large numbers of genotypes.
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.
Source localization using recursively applied and projected (RAP) MUSIC
Mosher, J.C.; Leahy, R.M.
1998-03-01
A new method for source localization is described that is based on a modification of the well known multiple signal classification (MUSIC) algorithm. In classical MUSIC, the array manifold vector is projected onto an estimate of the signal subspace, but errors in the estimate can make location of multiple sources difficult. Recursively applied and projected (RAP) MUSIC uses each successively located source to form an intermediate array gain matrix, and projects both the array manifold and the signal subspace estimate into its orthogonal complement. The MUSIC projection is then performed in this reduced subspace. Using the metric of principal angles, the authors describe a general form of the RAP-MUSIC algorithm for the case of diversely polarized sources. Through a uniform linear array simulation, the authors demonstrate the improved Monte Carlo performance of RAP-MUSIC relative to MUSIC and two other sequential subspace methods, S and IES-MUSIC.
Recursive approach to the moment-based phase unwrapping method.
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. PMID:20517381
Lanczos and Recursion Techniques for Multiscale Kinetic Monte Carlo Simulations
Rudd, R E; Mason, D R; Sutton, A P
2006-03-13
We review an approach to the simulation of the class of microstructural and morphological evolution involving both relatively short-ranged chemical and interfacial interactions and long-ranged elastic interactions. The calculation of the anharmonic elastic energy is facilitated with Lanczos recursion. The elastic energy changes affect the rate of vacancy hopping, and hence the rate of microstructural evolution due to vacancy mediated diffusion. The elastically informed hopping rates are used to construct the event catalog for kinetic Monte Carlo simulation. The simulation is accelerated using a second order residence time algorithm. The effect of elasticity on the microstructural development has been assessed. This article is related to a talk given in honor of David Pettifor at the DGP60 Workshop in Oxford.
Recursive Estimation for the Tracking of Radioactive Sources
Howse, J.W.; Muske, K.R.; Ticknor, L.O.
1999-02-01
This paper describes a recursive estimation algorithm used for tracking the physical location of radioactive sources in real-time as they are moved around in a facility. The al- gorithm is a nonlinear least squares estimation that mini- mizes the change in, the source location and the deviation between measurements and model predictions simultane- ously. The measurements used to estimate position consist of four count rates reported by four different gamma ray de tectors. There is an uncertainty in the source location due to the variance of the detected count rate. This work repre- sents part of a suite of tools which will partially automate security and safety assessments, allow some assessments to be done remotely, and provide additional sensor modalities with which to make assessments.
Recursive estimation for the tracking of radioactive sources
Howse, J.W.; Ticknor, L.O.; Muske, K.R.
1998-12-31
This paper describes a recursive estimation algorithm used for tracking the physical location of radioactive sources in real-time as they are moved around in a facility. The algorithm is related to a nonlinear least squares estimation that minimizes the change in the source location and the deviation between measurements and model predictions simultaneously. The measurements used to estimate position consist of four count rates reported by four different gamma ray detectors. There is an uncertainty in the source location due to the large variance of the detected count rate. This work represents part of a suite of tools which will partially automate security and safety assessments, allow some assessments to be done remotely, and provide additional sensor modalities with which to make assessments.
Chaotic spin-spin entanglement on a recursive lattice.
Chakhmakhchyan, Levon; Guérin, Stéphane; Leroy, Claude
2015-08-01
We propose an exactly solvable multisite interaction spin-1/2 Ising-Heisenberg model on a triangulated Husimi lattice for the rigorous studies of chaotic entanglement. By making use of the generalized star-triangle transformation, we map the initial model onto an effective Ising one on a Husimi lattice, which we solve then exactly by applying the recursive method. Expressing the entanglement of the Heisenberg spins, that we quantify by means of the concurrence, in terms of the magnetic quantities of the system, we demonstrate its bifurcation and chaotic behavior. Furthermore, we show that the underlying chaos may slightly enhance the amount of the entanglement and present on the phase diagram the transition lines from the uniform to periodic and from the periodic to chaotic regimes.
Structure damage detection based on random forest recursive feature elimination
NASA Astrophysics Data System (ADS)
Zhou, Qifeng; Zhou, Hao; Zhou, Qingqing; Yang, Fan; Luo, Linkai
2014-05-01
Feature extraction is a key former step in structural damage detection. In this paper, a structural damage detection method based on wavelet packet decomposition (WPD) and random forest recursive feature elimination (RF-RFE) is proposed. In order to gain the most effective feature subset and to improve the identification accuracy a two-stage feature selection method is adopted after WPD. First, the damage features are sorted according to original random forest variable importance analysis. Second, using RF-RFE to eliminate the least important feature and reorder the feature list each time, then get the new feature importance sequence. Finally, k-nearest neighbor (KNN) algorithm, as a benchmark classifier, is used to evaluate the extracted feature subset. A four-storey steel shear building model is chosen as an example in method verification. The experimental results show that using the fewer features got from proposed method can achieve higher identification accuracy and reduce the detection time cost.
A class of recursion operators on a tangent bundle
NASA Astrophysics Data System (ADS)
Vermeire, F.; Sarlet, W.; Crampin, M.
2006-06-01
We generalize the construction of a class of type (1, 1) tensor fields R on a tangent bundle which was introduced in a preceding paper. The generalization comes from the fact that, apart from a given Lagrangian, the further data consist of a type (1, 1) tensor J along the tangent bundle projection τ: TQ →Q, rather than a tensor on Q. The main features under investigation are two kinds of recursion properties of R, namely its potential invariance under the flow of the given dynamics and the property of having vanishing Nijenhuis torsion. The theory is applied, in particular, to the case of second-order dynamics coming from a Finsler metric.
Food-web formation with recursive evolutionary branching.
Ito, Hiroshi C; Ikegami, Takashi
2006-01-01
A reaction-diffusion model describing the evolutionary dynamics of a food-web was constructed. In this model, predator-prey relationships among organisms were determined by their position in a two-dimensional phenotype space defined by two traits: as prey and as predator. The mutation process is expressed with a diffusion process of biomass in the phenotype space. Numerical simulation of this model showed co-evolutionary dynamics of isolated phenotypic clusters, including various types of evolutionary branching, which were classified into branching as prey, branching as predators, and co-evolutionary branching of both prey and predators. A complex food-web develops with recursive evolutionary branching from a single phenotypic cluster. Biodiversity peaks at the medium strength of the predator-prey interaction, where the food-web is maintained at medium biomass by a balanced frequency between evolutionary branching and extinction.
Multiangle dynamic light scattering analysis using an improved recursion algorithm
NASA Astrophysics Data System (ADS)
Li, Lei; Li, Wei; Wang, Wanyan; Zeng, Xianjiang; Chen, Junyao; Du, Peng; Yang, Kecheng
2015-10-01
Multiangle dynamic light scattering (MDLS) compensates for the low information in a single-angle dynamic light scattering (DLS) measurement by combining the light intensity autocorrelation functions from a number of measurement angles. Reliable estimation of PSD from MDLS measurements requires accurate determination of the weighting coefficients and an appropriate inversion method. We propose the Recursion Nonnegative Phillips-Twomey (RNNPT) algorithm, which is insensitive to the noise of correlation function data, for PSD reconstruction from MDLS measurements. The procedure includes two main steps: 1) the calculation of the weighting coefficients by the recursion method, and 2) the PSD estimation through the RNNPT algorithm. And we obtained suitable regularization parameters for the algorithm by using MR-L-curve since the overall computational cost of this method is sensibly less than that of the L-curve for large problems. Furthermore, convergence behavior of the MR-L-curve method is in general superior to that of the L-curve method and the error of MR-L-curve method is monotone decreasing. First, the method was evaluated on simulated unimodal lognormal PSDs and multimodal lognormal PSDs. For comparison, reconstruction results got by a classical regularization method were included. Then, to further study the stability and sensitivity of the proposed method, all examples were analyzed using correlation function data with different levels of noise. The simulated results proved that RNNPT method yields more accurate results in the determination of PSDs from MDLS than those obtained with the classical regulation method for both unimodal and multimodal PSDs.
Binary mask programmable hologram.
Tsang, P W M; Poon, T-C; Zhou, Changhe; Cheung, K W K
2012-11-19
We report, for the first time, the concept and generation of a novel Fresnel hologram called the digital binary mask programmable hologram (BMPH). A BMPH is comprised of a static, high resolution binary grating that is overlaid with a lower resolution binary mask. The reconstructed image of the BMPH can be programmed to approximate a target image (including both intensity and depth information) by configuring the pattern of the binary mask with a simple genetic algorithm (SGA). As the low resolution binary mask can be realized with less stringent display technology, our method enables the development of simple and economical holographic video display.
NASA Astrophysics Data System (ADS)
Noll, Keith S.; Grundy, W. M.; Ryan, E. L.; Benecchi, S. D.
2015-11-01
We have reexamined 41 Trojan asteroids observed with the Hubble Space Telescope (HST) to search for unresolved binaries. We have identified one candidate binary with a separation of 53 milliarcsec, about the width of the diffraction limited point-spread function (PSF). Sub-resolution-element detection of binaries is possible with HST because of the high signal-to-noise ratio of the observations and the stability of the PSF. Identification and confirmation of binary Trojans is important because a Trojan Tour is one of five possible New Frontiers missions. A binary could constitute a potentially high value target because of the opportunity to study two objects and to test models of the primordial nature of binaries. The potential to derive mass-based physical information from the binary orbit could yield more clues to the origin of Trojans.
On the convergence improvement in the metadynamics simulations: a Wang-Landau recursion approach.
Min, Donghong; Liu, Yusong; Carbone, Irina; Yang, Wei
2007-05-21
As a popular tool in exploring free energy landscapes, the metadynamics method has been widely applied to elucidate various chemical or biochemical processes. As deeply discussed by Laio et al. [J. Phys. Chem. B 109, 6714 (2005)], the size of the updating Gaussian function is pivotal to the free energy convergence toward the target free energy surface. For instance, a greater Gaussian height can facilitate the quick visit of a conformation region of interest; however, it may lead to a larger error of the calculated free energy surface. In contrast, a lower Gaussian height can guarantee a better resolution of the calculated free energy surface; however, it will take longer time for such a simulation to navigate through the defined conformational region. In order to reconcile such confliction, the authors present a method by implementing the Wang-Landau recursion scheme in the metadynamics simulations to adaptively update the height of the unit Gaussian function. As demonstrated in their model studies on both a toy system, and a realistic molecular system treated with the hybrid quantum mechanical and molecular mechanical (QMMM) potential, the present approach can quickly result in more decently converged free energy surfaces, compared with the classical metadynamics simulations employing the fixed Gaussian heights.
Valle, Annalisa; Massaro, Davide; Castelli, Ilaria; Marchetti, Antonella
2015-02-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
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
PHOEBE: PHysics Of Eclipsing BinariEs
NASA Astrophysics Data System (ADS)
Prsa, Andrej; Matijevic, Gal; Latkovic, Olivera; Vilardell, Francesc; Wils, Patrick
2011-06-01
PHOEBE (PHysics Of Eclipsing BinariEs) is a modeling package for eclipsing binary stars, built on top of the widely used WD program (Wilson & Devinney 1971). This introductory paper overviews most important scientific extensions (incorporating observational spectra of eclipsing binaries into the solution-seeking process, extracting individual temperatures from observed color indices, main-sequence constraining and proper treatment of the reddening), numerical innovations (suggested improvements to WD's Differential Corrections method, the new Nelder & Mead's downhill Simplex method) and technical aspects (back-end scripter structure, graphical user interface). While PHOEBE retains 100% WD compatibility, its add-ons are a powerful way to enhance WD by encompassing even more physics and solution reliability.
Efficient design of two-dimensional recursive digital filters. Final report
Twogood, R.E.; Mitra, S.K.
1980-01-01
This report outlines the research progress during the period August 1978 to July 1979. This work can be divided into seven basic project areas. Project 1 deals with a comparative study of 2-D recursive and nonrecursive digital filters. The second project addresses a new design technique for 2-D half-plane recursive filters, and Projects 3 thru 5 deal with implementation issues. The sixth project presents our recent study of the applicability of array processors to 2-D digital signal processing. The final project involves our investigation into techniques for incorporating symmetry constraints on 2-D recursive filters in order to yield more efficient implementations.
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.
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.
Low power proton exchange membrane fuel cell system identification and adaptive control
NASA Astrophysics Data System (ADS)
Yang, Yee-Pien; Wang, Fu-Cheng; Chang, Hsin-Ping; Ma, Ying-Wei; Weng, Biing-Jyh
This paper proposes a systematic method of system identification and control of a proton exchange membrane (PEM) fuel cell. This fuel cell can be used for low-power communication devices involving complex electrochemical reactions of nonlinear and time-varying dynamic properties. From a system point of view, the dynamic model of PEM fuel cell is reduced to a configuration of two inputs, hydrogen and air flow rates, and two outputs, cell voltage and current. The corresponding transfer functions describe linearized subsystem dynamics with finite orders and time-varying parameters, which are expressed as discrete-time auto-regression moving-average with auxiliary input models for system identification by the recursive least square algorithm. In the experiments, a pseudo-random binary sequence of hydrogen or air flow rate is fed to a single fuel cell device to excite its dynamics. By measuring the corresponding output signals, each subsystem transfer function of reduced order is identified, while the unmodeled, higher-order dynamics and disturbances are described by the auxiliary input term. This provides a basis of adaptive control strategy to improve the fuel cell performance in terms of efficiency, as well as transient and steady state specifications. Simulation shows that adaptive controller is robust to the variation of fuel cell system dynamics, and it has proved promising from the experimental results.
Multi-Resolution Seismic Tomography Based on Recursive Tessellation Hierarchy
Simmons, N A; Myers, S C; Ramirez, A
2009-07-01
A 3-D global tomographic model that reconstructs velocity structure at multiple scales and incorporates laterally variable seismic discontinuities is currently being developed. The model parameterization is node-based where nodes are placed along vertices defined by triangular tessellations of a spheroidal surface. The triangular tessellation framework is hierarchical. Starting with a tetrahexahedron representing the whole globe (1st level of the hierarchy, 24 faces), they divide each triangle of the tessellation into daughter triangles. The collection of all daughter triangles comprises the 2nd level of the tessellation hierarchy and further recursion produces an arbitrary number of tessellation levels and arbitrarily fine node-spacing. They have developed an inversion procedure that takes advantage of the recursive properties of the tessellation hierarchies by progressively solving for shorter wavelength heterogeneities. In this procedure, we first perform the tomographic inversion using a tessellation level with coarse node spacing. They find that a coarse node spacing of approximately 8{sup o} is adequate to capture bulk regional properties. They then conduct the tomographic inversion on a 4{sup o} tessellation level using the residuals and inversion results from the 8{sup o} run. In practice they find that the progressive tomography approach is robust, providing an intrinsic regularization for inversion stability and avoids the issue of predefining resolution levels. Further, determining average regional properties with coarser tessellation levels enables long-wavelength heterogeneities to account for sparsely sampled regions (or regions of the mantle where longer wavelength patterns of heterogeneity suffice) while allowing shorter length-scale heterogeneities to emerge where necessary. They demonstrate the inversion approach with a set of synthetic test cases that mimic the complex nature of data arrangements (mixed-determined inversion) common to most
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.
All optical binary delta-sigma modulator
NASA Astrophysics Data System (ADS)
Sayeh, Mohammad R.; Siahmakoun, Azad
2005-09-01
This paper describes a novel A/D converter called "Binary Delta-Sigma Modulator" (BDSM) which operates only with nonnegative signal with positive feedback and binary threshold. This important modification to the conventional delta-sigma modulator makes the high-speed (>100GHz) all-optical implementation possible. It has also the capability to modify its own sampling frequency as well as its input dynamic range. This adaptive feature helps designers to optimize the system performance under highly noisy environment and also manage the power consumption of the A/D converters.
Semantics boosts syntax in artificial grammar learning tasks with recursion.
Fedor, Anna; Varga, Máté; Szathmáry, Eörs
2012-05-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 tested by means of artificial grammar learning (AGL) tasks, during which participants have to infer the rule from a set of artificial sentences. One of the surprising results of previous AGL experiments is that learning CER is not as easy as had been thought. We hypothesized that because artificial sentences lack semantic content, semantics could help humans learn the syntax of center-embedded sentences. To test this, we composed sentences from 4 vocabularies of different degrees of semantic content due to 3 factors (familiarity, meaning of words, and semantic relationship between words). According to our results, these factors have no effect one by one but they make learning significantly faster when combined. This leads to the assumption that there were different mechanisms at work when CER was parsed in natural and in artificial languages. This finding questions the suitability of AGL tasks with artificial vocabularies for studying the learning and processing of linguistic CER.
Recursive recovery of Markov transition probabilities from boundary value data
Patch, S.K.
1994-04-01
In an effort to mathematically describe the anisotropic diffusion of infrared radiation in biological tissue Gruenbaum posed an anisotropic diffusion boundary value problem in 1989. In order to accommodate anisotropy, he discretized the temporal as well as the spatial domain. The probabilistic interpretation of the diffusion equation is retained; radiation is assumed to travel according to a random walk (of sorts). In this random walk the probabilities with which photons change direction depend upon their previous as well as present location. The forward problem gives boundary value data as a function of the Markov transition probabilities. The inverse problem requires finding the transition probabilities from boundary value data. Problems in the plane are studied carefully in this thesis. Consistency conditions amongst the data are derived. These conditions have two effects: they prohibit inversion of the forward map but permit smoothing of noisy data. Next, a recursive algorithm which yields a family of solutions to the inverse problem is detailed. This algorithm takes advantage of all independent data and generates a system of highly nonlinear algebraic equations. Pluecker-Grassmann relations are instrumental in simplifying the equations. The algorithm is used to solve the 4 {times} 4 problem. Finally, the smallest nontrivial problem in three dimensions, the 2 {times} 2 {times} 2 problem, is solved.
Hybrid black-hole binary initial data
NASA Astrophysics Data System (ADS)
Mundim, Bruno; Kelly, Bernard; Zlochower, Yosef; Nakano, Hiroyuki; Campanelli, Manuela
2011-04-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.Quant.Grav.27:114005,2010], a new binary black-hole initial data with radiation contents derived in the post-Newtonian (PN) calculation 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. Thanks NSF and NASA for support.
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."
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.…
Recursive Subsystems in Aphasia and Alzheimer's Disease: Case Studies in Syntax and Theory of Mind
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
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.
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
Orbital motion in pre-main sequence binaries
Schaefer, G. H.; Prato, L.; Simon, M.; Patience, J.
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 other 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.
Mining IP to Domain Name Interactions to Detect DNS Flood Attacks on Recursive DNS Servers.
Alonso, Roberto; Monroy, Raúl; Trejo, Luis A
2016-08-17
The Domain Name System (DNS) is a critical infrastructure of any network, and, not surprisingly a common target of cybercrime. There are numerous works that analyse higher level DNS traffic to detect anomalies in the DNS or any other network service. By contrast, few efforts have been made to study and protect the recursive DNS level. In this paper, we introduce a novel abstraction of the recursive DNS traffic to detect a flooding attack, a kind of Distributed Denial of Service (DDoS). The crux of our abstraction lies on a simple observation: Recursive DNS queries, from IP addresses to domain names, form social groups; hence, a DDoS attack should result in drastic changes on DNS social structure. We have built an anomaly-based detection mechanism, which, given a time window of DNS usage, makes use of features that attempt to capture the DNS social structure, including a heuristic that estimates group composition. Our detection mechanism has been successfully validated (in a simulated and controlled setting) and with it the suitability of our abstraction to detect flooding attacks. To the best of our knowledge, this is the first time that work is successful in using this abstraction to detect these kinds of attacks at the recursive level. Before concluding the paper, we motivate further research directions considering this new abstraction, so we have designed and tested two additional experiments which exhibit promising results to detect other types of anomalies in recursive DNS servers.
Mining IP to Domain Name Interactions to Detect DNS Flood Attacks on Recursive DNS Servers.
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
The language faculty that wasn't: a usage-based account of natural language recursion
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
Mining IP to Domain Name Interactions to Detect DNS Flood Attacks on Recursive DNS Servers
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
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.
NASA Astrophysics Data System (ADS)
Sprows, David
2015-04-01
This note uses material involving perfect numbers and Zeno's paradoxes to show that although most students prefer to use base 10 when working with mathematical concepts there are times when the binary system is best.
Double Degenerate Binary Systems
Yakut, K.
2011-09-21
In this study, angular momentum loss via gravitational radiation in double degenerate binary (DDB)systems (NS + NS, NS + WD, WD + WD, and AM CVn) is studied. Energy loss by gravitational waves has been estimated for each type of systems.
Mutual Orbits of Transneptunian Binaries
NASA Astrophysics Data System (ADS)
Grundy, William M.; Noll, K. S.; Roe, H. G.; Porter, S. B.; Trujillo, C. A.; Benecchi, S. D.; Buie, M. W.
2012-10-01
We report the latest results from a program of high spatial resolution imaging to resolve the individual components of binary transneptunian objects. These observations use Hubble Space Telescope and also laser guide star adaptive optics systems on Keck and Gemini telescopes on Mauna Kea. From relative astrometry over multiple epochs, we determine the mutual orbits of the components, and thus the total masses of the systems. Accurate masses anchor subsequent detailed investigations into the physical characteristics of these systems. For instance, dynamical masses enable computation of bulk densities for systems where the component sizes can be estimated from other measurements. Additionally, patterns in the ensemble characteristics of binary orbits offer clues to circumstances in the protoplanetary nebula when these systems formed, as well as carrying imprints of various subsequent dynamical evolution processes. The growing ensemble of known orbits shows intriguing patterns that can shed light on the evolution of this population of distant objects. This work has been supported by an NSF Planetary Astronomy grant and by several Hubble Space Telescope and NASA Keck data analysis grants. The research makes use of data from the Gemini Observatory obtained through NOAO survey program 11A-0017, from a large number of Hubble Space Telescope programs, and from several NASA Keck programs.
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.
NASA Technical Reports Server (NTRS)
Lopez, Hiram
1987-01-01
Transmission errors for zeros and ones tabulated separately. Binary-symmetry detector employs psuedo-random data pattern used as test message coming through channel. Message then modulo-2 added to locally generated and synchronized version of test data pattern in same manner found in manufactured test sets of today. Binary symmetrical channel shows nearly 50-percent ones to 50-percent zeroes correspondence. Degree of asymmetry represents imbalances due to either modulation, transmission, or demodulation processes of system when perturbed by noise.
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.
NASA Astrophysics Data System (ADS)
Batten, A.; Murdin, P.
2000-11-01
Historically, spectroscopic binary stars were binary systems whose nature was discovered by the changing DOPPLER EFFECT or shift of the spectral lines of one or both of the component stars. The observed Doppler shift is a combination of that produced by the constant RADIAL VELOCITY (i.e. line-of-sight velocity) of the center of mass of the whole system, and the variable shift resulting from the o...
NASA Astrophysics Data System (ADS)
Olevic, D.; Cvetkovic, Z.
In this paper the orbits of binaries WDS 10093+2020 = A 2145, WDS 21074-0814 = BU 368 AB and WDS 22288-0001 = STF 2909 AB are recalculated because of significant deviations of more recent observations from the ephemerides. For binaries WDS 22384-0754 = A 2695, WDS 23474-7118 = FIN 375 Aa and WDS 23578+2508 = McA 76 the orbital elements are calculated for the first time.
NASA Astrophysics Data System (ADS)
Maneta, M. P.; Kimball, J. S.; Jencso, K. G.
2015-12-01
Managing the impact of climatic cycles on agricultural production, on land allocation, and on the state of active and projected water sources is challenging. This is because in addition to the uncertainties associated with climate projections, it is difficult to anticipate how farmers will respond to climatic change or to economic and policy incentives. Some sophisticated decision support systems available to water managers consider farmers' adaptive behavior but they are data intensive and difficult to apply operationally over large regions. Satellite-based observational technologies, in conjunction with models and assimilation methods, create an opportunity for new, cost-effective analysis tools to support policy and decision-making over large spatial extents at seasonal scales.We present an integrated modeling framework that can be driven by satellite remote sensing to enable robust regional assessment and prediction of climatic and policy impacts on agricultural production, water resources, and management decisions. The core of this framework is a widely used model of agricultural production and resource allocation adapted to be used in conjunction with remote sensing inputs to quantify the amount of land and water farmers allocate for each crop they choose to grow on a seasonal basis in response to reduced or enhanced access to water due to climatic or policy restrictions. A recursive Bayesian update method is used to adjust the model parameters by assimilating information on crop acreage, production, and crop evapotranspiration as a proxy for water use that can be estimated from high spatial resolution satellite remote sensing. The data assimilation framework blends new and old information to avoid over-calibration to the specific conditions of a single year and permits the updating of parameters to track gradual changes in the agricultural system.This integrated framework provides an operational means of monitoring and forecasting what crops will be grown
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.
Exploring the Birth of Binary Stars
NASA Astrophysics Data System (ADS)
Kohler, Susanna
2016-08-01
More than half of all stars are thought to be in binary or multiple star systems. But how do these systems form? The misaligned spins of some binary protostars might provide a clue.Two Formation ModelsIts hard to tell how multiple-star systems form, since these systems are difficult to observe in their early stages. But based on numerical simulations, there are two proposed models for the formation of stellar binaries:Turbulent fragmentationTurbulence within a single core leads to multiple dense clumps. These clumps independently collapse to form stars that orbit each other.Disk fragmentationGravitational instabilities in a massive accretion disk cause the formation of a smaller, secondary disk within the first, resulting in two stars that orbit each other.Log column density for one of the authors simulated binary systems, just after the formation of two protostars. Diamonds indicate the protostar positions. [Adapted from Offner et al. 2016]Outflows as CluesHow can we differentiate between these formation mechanisms? Led by Stella Offner (University of Massachusetts), a team of scientists has suggested that the key isto examine the alignment of the stars protostellar outflows jets that are often emitted from the poles of young, newly forming stars.Naively, wed expect that disk fragmentation would produce binary stars with common angular momentum. As the stars spins would be aligned, they would therefore also launch protostellar jets that were aligned with each other. Turbulent fragmentation, on the other hand, would cause the stars to have independent angular momentum. This would lead to randomly oriented spins, so the protostellar jets would be misaligned.Snapshots from the authors simulations. Left panel of each pair: column density; green arrows giveprotostellar spin directions. Right panel: synthetic observations produced from the simulations; cyan arrows giveprotostellar outflow directions. [Offner et al. 2016]Simulations of FragmentationIn order to better
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
Simulating ventilation distribution in heterogenous lung injury using a binary tree data structure.
Colletti, Ashley A; Amini, Reza; Kaczka, David W
2011-10-01
To determine the impact of mechanical heterogeneity on the distribution of regional flows and pressures in the injured lung, we developed an anatomic model of the canine lung comprised of an asymmetric branching airway network, which can be stored as binary tree data structure. The entire tree can be traversed using a recursive flow divider algorithm, allowing for efficient computation of acinar flow and pressure distributions in a mechanically heterogeneous lung. These distributions were found to be highly dependent on ventilation frequency and the heterogeneity of tissue elastances, reflecting the preferential distribution of ventilation to areas of lower regional impedance.
Methods for assessing movement path recursion with application to African buffalo in South Africa
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.
Karstadt, Lyn; Thomas, Keith Robert; Abed, Shaymaa N
2016-01-01
In nurse education typically, information is presented to students within the classroom and then applied within a clinical situation. Acquisition of the knowledge required to inform the student's early practice is the focus of this research. This paper centres upon the construction of a cognitive model that is recursive in nature, and forms an integral part of a qualitative research study. The primary study investigated how first year student nurses use the information received in the classroom to underpin their early practice. Data were collected from 10 students and 4 of their lecturers, via blogs and interviews and used iteratively to create a model that is recursive in nature. Recursion is a process of repeatedly revisiting the same thing, in this case the data, which are considered in an iterative or progressive way. Recursion thus facilitated the development of a model, which was seen to change and develop in sophistication as more data were considered and evaluated. Visual devices were used throughout to bring clarity during the construction of the model. This visual process was pivotal to the analysis. This paper chronicles the development of an analytical device through the medium of the study presented. Viable knowledge is represented as the synthesis of concepts, as presented in the classroom, and practice, as experienced within the clinical area. It illustrates how conceptual material delivered within the classroom has become embedded within an individual student's consciousness and is used during a clinical placement to make sense of a specific situation. The study identifies how students use information and makes recommendations as to how appropriate curricula integrate all the facets of the recursive model. The process of recursive modelling is thus offered as an analytical devise, which may be applied by researchers to other qualitative data. PMID:26586185
NASA Astrophysics Data System (ADS)
Wang, Lugen; Rokhlin, S. I.
2004-11-01
The differential equations governing transfer and stiffness matrices and acoustic impedance for a functionally graded generally anisotropic magneto-electro-elastic medium have been obtained. It is shown that the transfer matrix satisfies a linear 1st order matrix differential equation, while the stiffness matrix satisfies a nonlinear Riccati equation. For a thin nonhomogeneous layer, approximate solutions with different levels of accuracy have been formulated in the form of a transfer matrix using a geometrical integration in the form of a Magnus expansion. This integration method preserves qualitative features of the exact solution of the differential equation, in particular energy conservation. The wave propagation solution for a thick layer or a multilayered structure of inhomogeneous layers is obtained recursively from the thin layer solutions. Since the transfer matrix solution becomes computationally unstable with increase of frequency or layer thickness, we reformulate the solution in the form of a stable stiffness-matrix solution which is obtained from the relation of the stiffness matrices to the transfer matrices. Using an efficient recursive algorithm, the stiffness matrices of the thin nonhomogeneous layer are combined to obtain the total stiffness matrix for an arbitrary functionally graded multilayered system. It is shown that the round-off error for the stiffness-matrix recursive algorithm is higher than that for the transfer matrices. To optimize the recursive procedure, a computationally stable hybrid method is proposed which first starts the recursive computation with the transfer matrices and then, as the thickness increases, transits to the stiffness matrix recursive algorithm. Numerical results show this solution to be stable and efficient. As an application example, we calculate the surface wave velocity dispersion for a functionally graded coating on a semispace.
A new design for SLAM front-end based on recursive SOM
NASA Astrophysics Data System (ADS)
Yang, Xuesi; Xia, Shengping
2015-12-01
Aiming at the graph optimization-based monocular SLAM, a novel design for the front-end in single camera SLAM is proposed, based on the recursive SOM. Pixel intensities are directly used to achieve image registration and motion estimation, which can save time compared with the current appearance-based frameworks, usually including feature extraction and matching. Once a key-frame is identified, a recursive SOM is used to actualize loop-closure detecting, resulting a more precise location. The experiment on a public dataset validates our method on a computer with a quicker and effective result.
Recursive estimation techniques for detection of small objects in infrared image data
NASA Astrophysics Data System (ADS)
Zeidler, J. R.; Soni, T.; Ku, W. H.
1992-04-01
This paper describes a recursive detection scheme for point targets in infrared (IR) images. Estimation of the background noise is done using a weighted autocorrelation matrix update method and the detection statistic is calculated using a recursive technique. A weighting factor allows the algorithm to have finite memory and deal with nonstationary noise characteristics. The detection statistic is created by using a matched filter for colored noise, using the estimated noise autocorrelation matrix. The relationship between the weighting factor, the nonstationarity of the noise and the probability of detection is described. Some results on one- and two-dimensional infrared images are presented.
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.
NASA Astrophysics Data System (ADS)
Noll, Keith S.
The discovery of binaries in each of the major populations of minor bodies in the solar system is propelling a rapid growth of heretofore unattainable physical information. The availability of mass and density constraints for minor bodies opens the door to studies of internal structure, comparisons with meteorite samples, and correlations between bulk-physical and surface-spectral properties. The number of known binaries is now more than 70 and is growing rapidly. A smaller number have had the extensive followup observations needed to derive mass and albedo information, but this list is growing as well. It will soon be the case that we will know more about the physical parameters of objects in the Kuiper Belt than has been known about asteroids in the Main Belt for the last 200 years. Another important aspect of binaries is understanding the mechanisms that lead to their formation and survival. The relative sizes and separations of binaries in the different minor body populations point to more than one mechanism for forming bound pairs. Collisions appear to play a major role in the Main Belt. Rotational and/or tidal fission may be important in the Near Earth population. For the Kuiper Belt, capture in multi-body interactions may be the preferred formation mechanism. However, all of these conclusions remain tentative and limited by observational and theoretical incompleteness. Observational techniques for identifying binaries are equally varied. High angular resolution observations from space and from the ground are critical for detection of the relatively distant binaries in the Main Belt and the Kuiper Belt. Radar has been the most productive method for detection of Near Earth binaries. Lightcurve analysis is an independent technique that is capable of exploring phase space inaccessible to direct observations. Finally, spacecraft flybys have played a crucial paradigm-changing role with discoveries that unlocked this now-burgeoning field.
Student Monks--Teaching Recursion in an IS or CS Programming Course Using the Towers of Hanoi
ERIC Educational Resources Information Center
Benander, Alan C.; Benander, Barbara A.
2008-01-01
Educators have been using the Towers of Hanoi problem for many years as an example of a problem that has a very elegant recursive solution. However, the elegance and conciseness of this solution can make it difficult for students to understand the amount of computer time required in the execution of this solution. And, like many recursive computer…
Walsh, Ian; Baù, Davide; Martin, Alberto JM; Mooney, Catherine; Vullo, Alessandro; Pollastri, Gianluca
2009-01-01
Background Prediction of protein structures from their sequences is still one of the open grand challenges of computational biology. Some approaches to protein structure prediction, especially ab initio ones, rely to some extent on the prediction of residue contact maps. Residue contact map predictions have been assessed at the CASP competition for several years now. Although it has been shown that exact contact maps generally yield correct three-dimensional structures, this is true only at a relatively low resolution (3–4 Å from the native structure). Another known weakness of contact maps is that they are generally predicted ab initio, that is not exploiting information about potential homologues of known structure. Results We introduce a new class of distance restraints for protein structures: multi-class distance maps. We show that Cα trace reconstructions based on 4-class native maps are significantly better than those from residue contact maps. We then build two predictors of 4-class maps based on recursive neural networks: one ab initio, or relying on the sequence and on evolutionary information; one template-based, or in which homology information to known structures is provided as a further input. We show that virtually any level of sequence similarity to structural templates (down to less than 10%) yields more accurate 4-class maps than the ab initio predictor. We show that template-based predictions by recursive neural networks are consistently better than the best template and than a number of combinations of the best available templates. We also extract binary residue contact maps at an 8 Å threshold (as per CASP assessment) from the 4-class predictors and show that the template-based version is also more accurate than the best template and consistently better than the ab initio one, down to very low levels of sequence identity to structural templates. Furthermore, we test both ab-initio and template-based 8 Å predictions on the CASP7 targets
Kepler's Cool Eclipsing Binaries
NASA Astrophysics Data System (ADS)
Swift, Jonathan; Muirhead, P. S.; Johnson, J. A.; Gonzales, A.; Shporer, A.; Plavchan, P.; Lockwood, A.; Morton, T.
2014-01-01
Some of the most exciting exoplanet results to date have come from the smallest and coolest sample of stars in the Kepler field—the M dwarfs. These cool stars represent the largest stellar population in the Galaxy which in turn harbors one of the largest known exoplanet populations. However, an accurate understanding of their physical properties currently eludes us. Detached, M dwarf eclipsing binary systems provide an accurate and precise, model-independent means of measuring the fundamental properties of low-mass stars shedding light on the rich physics embodied by this spectral class and refining our knowledge of their exoplanets. We have undertaken an observational campaign to obtain masses, radii, and effective temperatures of the Kepler eclipsing binaries having an M dwarf primary with periods between 1 and 60 days. These data will allow detailed comparisons between stellar properties, binary period, rotation, metallicity and activity levels.
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.
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.
Binary Oscillatory Crossflow Electrophoresis
NASA Technical Reports Server (NTRS)
Molloy, Richard F.; Gallagher, Christopher T.; Leighton, David T., Jr.
1996-01-01
We present preliminary results of our implementation of a novel electrophoresis separation technique: Binary Oscillatory Cross flow Electrophoresis (BOCE). The technique utilizes the interaction of two driving forces, an oscillatory electric field and an oscillatory shear flow, to create an active binary filter for the separation of charged species. Analytical and numerical studies have indicated that this technique is capable of separating proteins with electrophoretic mobilities differing by less than 10%. With an experimental device containing a separation chamber 20 cm long, 5 cm wide, and 1 mm thick, an order of magnitude increase in throughput over commercially available electrophoresis devices is theoretically possible.
Identification list of binaries
NASA Astrophysics Data System (ADS)
Malkov,, O.; Karchevsky,, A.; Kaygorodov, P.; Kovaleva, D.
The Identification List of Binaries (ILB) is a star catalogue constructed to facilitate cross-referencing between different catalogues of binary stars. As of 2015, it comprises designations for approximately 120,000 double/multiple systems. ILB contains star coordinates and cross-references to the Bayer/Flemsteed, DM (BD/CD/CPD), HD, HIP, ADS, WDS, CCDM, TDSC, GCVS, SBC9, IGR (and some other X-ray catalogues), PSR designations, as well as identifications in the recently developed BSDB system. ILB eventually became a part of the BDB stellar database.
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.
Recursive Frame Analysis: Reflections on the Development of a Qualitative Research Method
ERIC Educational Resources Information Center
Keeney, Hillary; Keeney, Bradford
2012-01-01
The origin of recursive frame analysis (RFA) is revisited and discussed as a postmodern alternative to modernist therapeutic models and research methods that foster hegemony of a preferred therapeutic metaphor, narrative, or strategy. It encourages improvisational performance while enabling a means of scoring the change and movement of the…
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.
On recursive edit distance kernels with application to time series classification.
Marteau, Pierre-Francois; Gibet, Sylvie
2015-06-01
This paper proposes some extensions to the work on kernels dedicated to string or time series global alignment based on the aggregation of scores obtained by local alignments. The extensions that we propose allow us to construct, from classical recursive definition of elastic distances, recursive edit distance (or time-warp) kernels that are positive definite if some sufficient conditions are satisfied. The sufficient conditions we end up with are original and weaker than those proposed in earlier works, although a recursive regularizing term is required to get proof of the positive definiteness as a direct consequence of the Haussler's convolution theorem. Furthermore, the positive definiteness is maintained when a symmetric corridor is used to reduce the search space, and thus the algorithmic complexity, which is quadratic in the worst case. The classification experiment we conducted on three classical time-warp distances (two of which are metrics), using support vector machine classifier, leads to the conclusion that when the pairwise distance matrix obtained from the training data is far from definiteness, the positive definite recursive elastic kernels outperform in general the distance substituting kernels for several classical elastic distances we have tested.
Evapotranspiration: Measured with a lysimeter vs. calculated with a recursive method
Technology Transfer Automated Retrieval System (TEKTRAN)
Recently, a recursive combination method (RCM) to calculate potential and crop evapotranspiration (ET) was given by Lascano and Van Bavel (Agron. J. 2007, 99:585-590) that differs from the Penman-Monteith (PM) method. The main difference between the two methods is that the assumptions made regarding...
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…
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.
Analysis of litter size and average litter weight in pigs using a recursive model.
Varona, Luis; Sorensen, Daniel; Thompson, Robin
2007-11-01
An analysis of litter size and average piglet weight at birth in Landrace and Yorkshire using a standard two-trait mixed model (SMM) and a recursive mixed model (RMM) is presented. The RMM establishes a one-way link from litter size to average piglet weight. It is shown that there is a one-to-one correspondence between the parameters of SMM and RMM and that they generate equivalent likelihoods. As parameterized in this work, the RMM tests for the presence of a recursive relationship between additive genetic values, permanent environmental effects, and specific environmental effects of litter size, on average piglet weight. The equivalent standard mixed model tests whether or not the covariance matrices of the random effects have a diagonal structure. In Landrace, posterior predictive model checking supports a model without any form of recursion or, alternatively, a SMM with diagonal covariance matrices of the three random effects. In Yorkshire, the same criterion favors a model with recursion at the level of specific environmental effects only, or, in terms of the SMM, the association between traits is shown to be exclusively due to an environmental (negative) correlation. It is argued that the choice between a SMM or a RMM should be guided by the availability of software, by ease of interpretation, or by the need to test a particular theory or hypothesis that may best be formulated under one parameterization and not the other.
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…
Binary coding for hyperspectral imagery
NASA Astrophysics Data System (ADS)
Wang, Jing; Chang, Chein-I.; Chang, Chein-Chi; Lin, Chinsu
2004-10-01
Binary coding is one of simplest ways to characterize spectral features. One commonly used method is a binary coding-based image software system, called Spectral Analysis Manager (SPAM) for remotely sensed imagery developed by Mazer et al. For a given spectral signature, the SPAM calculates its spectral mean and inter-band spectral difference and uses them as thresholds to generate a binary code word for this particular spectral signature. Such coding scheme is generally effective and also very simple to implement. This paper revisits the SPAM and further develops three new SPAM-based binary coding methods, called equal probability partition (EPP) binary coding, halfway partition (HP) binary coding and median partition (MP) binary coding. These three binary coding methods along with the SPAM well be evaluated for spectral discrimination and identification. In doing so, a new criterion, called a posteriori discrimination probability (APDP) is also introduced for performance measure.
NASA Technical Reports Server (NTRS)
Tcheng, Ping
1989-01-01
Binary resistors in series tailored to precise value of resistance. Desired value of resistance obtained by cutting appropriate traces across resistors. Multibit, binary-based, adjustable resistor with high resolution used in many applications where precise resistance required.
Binary stars - Formation by fragmentation
NASA Technical Reports Server (NTRS)
Boss, Alan P.
1988-01-01
Theories of binary star formation by capture, separate nuclei, fission and fragmentation are compared, assessing the success of theoretical attempts to explain the observed properties of main-sequence binary stars. The theory of formation by fragmentation is examined, discussing the prospects for checking the theory against observations of binary premain-sequence stars. It is concluded that formation by fragmentation is successful at explaining many of the key properties of main-sequence binary stars.
Characterizing the Eclipsing Binary KOI 1120
NASA Astrophysics Data System (ADS)
Gonzales, Alexandria; Swift, J.; Shporer, A.; Sanchis Ojeda, R.; Johnson, J. A.
2014-01-01
Because the NASA Kepler Mission is primarily a search for exoplanetary objects, its exquisite photometric precision has also opened scientific frontiers in stellar astrophysics. As part of the cool Kepler eclipsing binary program, we present a case study of a particularly interesting KOI false positive—KOI-1120. This K giant/G dwarf eclipsing binary pair reveals a deep secondary eclipse of 16% and a 7% primary eclipse depth with multiple star spot crossing events over the Kepler time baseline. Kepler data supplemented with Keck/HIRES radial velocity measurements, Keck/NIRC2 adaptive optics imaging, and Palomar/TripleSpec near infrared spectra enable precise and accurate modeling of the system. Characterizing this distinctive system will provide important insights into stellar astrophysics and stellar evolution.
NASA Technical Reports Server (NTRS)
Frazier, D. O.; Facemire, B. R.; Kaukler, W. F.; Witherow, W. K.; Fanning, U.
1986-01-01
Studies of monotectic alloys and alloy analogs reviewed. Report surveys research on liquid/liquid and solid/liquid separation in binary monotectic alloys. Emphasizes separation processes in low gravity, such as in outer space or in free fall in drop towers. Advances in methods of controlling separation in experiments highlighted.
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.
Hierarchical colorant-based direct binary search halftoning.
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.
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
Massive Black Hole Binary Evolution
NASA Astrophysics Data System (ADS)
Merritt, David; Milosavljević, Milos
2005-11-01
Coalescence of binary supermassive black holes (SBHs) would constitute the strongest sources of gravitational waves to be observed by LISA. While the formation of binary SBHs during galaxy mergers is almost inevitable, coalescence requires that the separation between binary components first drop by a few orders of magnitude, due presumably to interaction of the binary with stars and gas in a galactic nucleus. This article reviews the observational evidence for binary SBHs and discusses how they would evolve. No completely convincing case of a bound, binary SBH has yet been found, although a handful of systems (e.g. interacting galaxies; remnants of galaxy mergers) are now believed to contain two SBHs at projected separations of <~ 1kpc. N-body studies of binary evolution in gas-free galaxies have reached large enough particle numbers to reproduce the slow, "diffusive" refilling of the binary's loss cone that is believed to characterize binary evolution in real galactic nuclei. While some of the results of these simulations - e.g. the binary hardening rate and eccentricity evolution - are strongly N-dependent, others - e.g. the "damage" inflicted by the binary on the nucleus - are not. Luminous early-type galaxies often exhibit depleted cores with masses of ~ 1-2 times the mass of their nuclear SBHs, consistent with the predictions of the binary model. Studies of the interaction of massive binaries with gas are still in their infancy, although much progress is expected in the near future. Binary coalescence has a large influence on the spins of SBHs, even for mass ratios as extreme as 10:1, and evidence of spin-flips may have been observed.
NASA Astrophysics Data System (ADS)
Yagi, Kent; Yunes, Nicolás
2016-07-01
When in a tight binary, the mutual tidal deformations of neutron stars get imprinted onto observables, encoding information about their internal structure at supranuclear densities and gravity in the extreme-gravity regime. Gravitational wave (GW) observations of their late binary inspiral may serve as a tool to extract the individual tidal deformabilities, but this is made difficult by degeneracies between them in the GW model. We here resolve this problem by discovering approximately equation-of-state (EoS)-insensitive relations between dimensionless combinations of the individual tidal deformabilities. We show that these relations break degeneracies in the GW model, allowing for the accurate extraction of both deformabilities. Such measurements can be used to better differentiate between EoS models, and improve tests of general relativity and cosmology.
Dark Matter from Binary Tetrahedral Flavor Symmetry
NASA Astrophysics Data System (ADS)
Eby, David; Frampton, Paul
2012-03-01
Binary Tetrahedral Flavor Symmetry, originally developed as a quark family symmetry and later adapted to leptons, has proved both resilient and versatile over the past decade. In 2008 a minimal T' model was developed to accommodate quark and lepton masses and mixings using a family symmetry of (T'xZ2). We examine an expansion of this earlier model using an additional Z2 group that facilitates predictions of WIMP dark matter, the Cabibbo angle, and deviations from Tribimaximal Mixing, while giving hints at the nature of leptogenesis.
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.
Recursive bias estimation for high dimensional regression smoothers
Hengartner, Nicolas W; Cornillon, Pierre - Andre; Matzner - Lober, Eric
2009-01-01
In multivariate nonparametric analysis, sparseness of the covariates also called curse of dimensionality, forces one to use large smoothing parameters. This leads to biased smoother. Instead of focusing on optimally selecting the smoothing parameter, we fix it to some reasonably large value to ensure an over-smoothing of the data. The resulting smoother has a small variance but a substantial bias. In this paper, we propose to iteratively correct of the bias initial estimator by an estimate of the latter obtained by smoothing the residuals. We examine in details the convergence of the iterated procedure for classical smoothers and relate our procedure to L{sub 2}-Boosting, For multivariate thin plate spline smoother, we proved that our procedure adapts to the correct and unknown order of smoothness for estimating an unknown function m belonging to H({nu}) (Sobolev space where m should be bigger than d/2). We apply our method to simulated and real data and show that our method compares favorably with existing procedures.
NASA Technical Reports Server (NTRS)
Bokhari, Shahid H.; Crockett, Thomas W.; Nicol, David M.
1993-01-01
Binary dissection is widely used to partition non-uniform domains over parallel computers. This algorithm does not consider the perimeter, surface area, or aspect ratio of the regions being generated and can yield decompositions that have poor communication to computation ratio. Parametric Binary Dissection (PBD) is a new algorithm in which each cut is chosen to minimize load + lambda x(shape). In a 2 (or 3) dimensional problem, load is the amount of computation to be performed in a subregion and shape could refer to the perimeter (respectively surface) of that subregion. Shape is a measure of communication overhead and the parameter permits us to trade off load imbalance against communication overhead. When A is zero, the algorithm reduces to plain binary dissection. This algorithm can be used to partition graphs embedded in 2 or 3-d. Load is the number of nodes in a subregion, shape the number of edges that leave that subregion, and lambda the ratio of time to communicate over an edge to the time to compute at a node. An algorithm is presented that finds the depth d parametric dissection of an embedded graph with n vertices and e edges in O(max(n log n, de)) time, which is an improvement over the O(dn log n) time of plain binary dissection. Parallel versions of this algorithm are also presented; the best of these requires O((n/p) log(sup 3)p) time on a p processor hypercube, assuming graphs of bounded degree. How PBD is applied to 3-d unstructured meshes and yields partitions that are better than those obtained by plain dissection is described. Its application to the color image quantization problem is also discussed, in which samples in a high-resolution color space are mapped onto a lower resolution space in a way that minimizes the color error.
1996-04-02
This software is a set of tools for the design and analysis of binary optics. It consists of a series of stand-alone programs written in C and some scripts written in an application-specific language interpreted by a CAD program called DW2000. This software can be used to optimize the design and placement of a complex lens array from input to output and produce contours, mask designs, and data exported for diffractive optic analysis.
Separated Fringe Packet Binaries
NASA Astrophysics Data System (ADS)
Bagnuolo, W. G.; Taylor, S. F.; McAlister, H. A.; ten Brummelaar, T.; Sturmann, L.; Sturmann, J.; Turner, N. H.; Berger, D.; Ridgway, S. T.; CenterHigh Angular Resolution Astronomy (CHARA)
2004-12-01
Individually resolved packets are produced by scans from the CHARA Interferometer Array for binary stars with separations from 10 to 100 milli-arcsec (mas) in the K' band. We have used this data for astrometry of the binary with the goal of improving the visual orbits for these systems. About 12 data sets of 400 scans each can be collected for a star within an hour. The intrinsic accuracy with simple linear/quadratic fits to the time-separation curve yields accuracies of 0.15 mas. But, for systems with separations less than 80 mas, the measured separation is modulated periodically by the secondary star's packet riding over the sidelobes of the primary which provides a phase reference. This "sidelobe verniering" can improve the precision to better than 50 micro-arcsec. These techniques, represents 1-2 orders of magnitude improvement in astrometic accuracy over speckle interferometry techniques. Visual orbits can then be refined via a maximum liklihood technique, which leads to revisions in the stellar masses. We present the results for several binaries that have been observed at the CHARA Array, starting in 2001.
Evolutionary models of binaries
NASA Astrophysics Data System (ADS)
van Rensbergen, Walter; Mennekens, Nicki; de Greve, Jean-Pierre; Jansen, Kim; de Loore, Bert
2011-07-01
We have put on CDS a catalog containing 561 evolutionary models of binaries: J/A+A/487/1129 (Van Rensbergen+, 2008). The catalog covers a grid of binaries with a B-type primary at birth, different values for the initial mass ratio and a wide range of initial orbital periods. The evolution was calculated with the Brussels code in which we introduced the spinning up and the creation of a hot spot on the gainer or its accretion disk, caused by impacting mass coming from the donor. When the kinetic energy of fast rotation added to the radiative energy of the hot spot exceeds the binding energy, a fraction of the transferred matter leaves the system: the evolution is liberal during a short lasting era of rapid mass transfer. The spin-up of the gainer was modulated using both strong and weak tides. The catalog shows the results for both types. For comparison, we included the evolutionary tracks calculated with the conservative assumption. Binaries with an initial primary below 6 Msolar show hardly any mass loss from the system and thus evolve conservatively. Above this limit differences between liberal and conservative evolution grow with increasing initial mass of the primary star.
Recursive neural networks for processing graphs with labelled edges: theory and applications.
Bianchini, M; Maggini, M; Sarti, L; Scarselli, F
2005-10-01
In this paper, we introduce a new recursive neural network model able to process directed acyclic graphs with labelled edges. The model uses a state transition function which considers the edge labels and is independent both from the number and the order of the children of each node. The computational capabilities of the new recursive architecture are assessed. Moreover, in order to test the proposed architecture on a practical challenging application, the problem of object detection in images is also addressed. In fact, the localization of target objects is a preliminary step in any recognition system. The proposed technique is general and can be applied in different detection systems, since it does not exploit any a priori knowledge on the particular problem. Some experiments on face detection, carried out on scenes acquired by an indoor camera, are reported, showing very promising results. PMID:16181770
Berends-Giele recursions and the BCJ duality in superspace and components
NASA Astrophysics Data System (ADS)
Mafra, Carlos R.; Schlotterer, Oliver
2016-03-01
The recursive method of Berends and Giele to compute tree-level gluon amplitudes is revisited using the framework of ten-dimensional super Yang-Mills. First, we prove that the pure spinor formula to compute SYM tree amplitudes derived in 2010 reduces to the standard Berends-Giele formula from the 80s when restricted to gluon amplitudes and additionally determine the fermionic completion. Second, using BRST cohomology manipulations in superspace, alternative representations of the component amplitudes are explored and the Bern-Carrasco-Johansson relations among partial tree amplitudes are derived in a novel way. Finally, it is shown how the supersymmetric components of manifestly local BCJ-satisfying tree-level numerators can be computed in a recursive fashion.
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.
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.
A recursive vesicle-based model protocell with a primitive model cell cycle
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
NASA Astrophysics Data System (ADS)
Gan, Qifeng; Seoud, Lama; Ben Tahar, Houssem; Langlois, J. M. Pierre
2016-04-01
Spatial Averaging Filters (SAF) are extensively used in image processing for image smoothing and denoising. Their latest implementations have already achieved constant time computational complexity regardless of kernel size. However, all the existing O(1) algorithms require additional memory for temporary data storage. In order to minimize memory usage in embedded systems, we introduce a new two-dimensional recursive SAF. It uses previous resultant pixel values along both rows and columns to calculate the current one. It can achieve constant time computational complexity without using any additional memory usage. Experimental comparisons with previous SAF implementations shows that the proposed 2D-Recursive SAF does not require any additional memory while offering a computational time similar to the most efficient existing SAF algorithm. These features make it especially suitable for embedded systems with limited memory capacity.
Parsing recursive sentences with a connectionist model including a neural stack and synaptic gating.
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.
A recursive vesicle-based model protocell with a primitive model cell cycle.
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
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.
NASA Technical Reports Server (NTRS)
Griebeler, Elmer L.
2011-01-01
Binary communication through long cables, opto-isolators, isolating transformers, or repeaters can become distorted in characteristic ways. The usual solution is to slow the communication rate, change to a different method, or improve the communication media. It would help if the characteristic distortions could be accommodated at the receiving end to ease the communication problem. The distortions come from loss of the high-frequency content, which adds slopes to the transitions from ones to zeroes and zeroes to ones. This weakens the definition of the ones and zeroes in the time domain. The other major distortion is the reduction of low frequency, which causes the voltage that defines the ones or zeroes to drift out of recognizable range. This development describes a method for recovering a binary data stream from a signal that has been subjected to a loss of both higher-frequency content and low-frequency content that is essential to define the difference between ones and zeroes. The method makes use of the frequency structure of the waveform created by the data stream, and then enhances the characteristics related to the data to reconstruct the binary switching pattern. A major issue is simplicity. The approach taken here is to take the first derivative of the signal and then feed it to a hysteresis switch. This is equivalent in practice to using a non-resonant band pass filter feeding a Schmitt trigger. Obviously, the derivative signal needs to be offset to halfway between the thresholds of the hysteresis switch, and amplified so that the derivatives reliably exceed the thresholds. A transition from a zero to a one is the most substantial, fastest plus movement of voltage, and therefore will create the largest plus first derivative pulse. Since the quiet state of the derivative is sitting between the hysteresis thresholds, the plus pulse exceeds the plus threshold, switching the hysteresis switch plus, which re-establishes the data zero to one transition
Closed-form recursive formula for an optimal tracker with terminal constraints
NASA Technical Reports Server (NTRS)
Juang, J. N.; Turner, J. D.; Chun, H. M.
1986-01-01
Feedback control laws are derived for a class of optimal finite time tracking problems with terminal constraints. Analytical solutions are obtained for the feedback gain and the closed-loop response trajectory. Such formulations are expressed in recursive forms so that a real-time computer implementation becomes feasible. An example involving the feedback slewing of a flexible spacecraft is given to illustrate the validity and usefulness of the formulations.
Recursive Estimation of the Stein Center of SPD Matrices & its Applications*
Salehian, Hesamoddin; Cheng, Guang; Ho, Jeffrey
2014-01-01
Symmetric positive-definite (SPD) matrices are ubiquitous in Computer Vision, Machine Learning and Medical Image Analysis. Finding the center/average of a population of such matrices is a common theme in many algorithms such as clustering, segmentation, principal geodesic analysis, etc. The center of a population of such matrices can be defined using a variety of distance/divergence measures as the minimizer of the sum of squared distances/divergences from the unknown center to the members of the population. It is well known that the computation of the Karcher mean for the space of SPD matrices which is a negatively-curved Riemannian manifold is computationally expensive. Recently, the LogDet divergence-based center was shown to be a computationally attractive alternative. However, the LogDet-based mean of more than two matrices can not be computed in closed form, which makes it computationally less attractive for large populations. In this paper we present a novel recursive estimator for center based on the Stein distance – which is the square root of the LogDet divergence – that is significantly faster than the batch mode computation of this center. The key theoretical contribution is a closed-form solution for the weighted Stein center of two SPD matrices, which is used in the recursive computation of the Stein center for a population of SPD matrices. Additionally, we show experimental evidence of the convergence of our recursive Stein center estimator to the batch mode Stein center. We present applications of our recursive estimator to K-means clustering and image indexing depicting significant time gains over corresponding algorithms that use the batch mode computations. For the latter application, we develop novel hashing functions using the Stein distance and apply it to publicly available data sets, and experimental results have shown favorable comparisons to other competing methods. PMID:25350135
Constraint on the Multi-Component CKP Hierarchy and Recursion Operators
NASA Astrophysics Data System (ADS)
Song, Tao; Li, Chuanzhong; He, Jingsong
2016-06-01
In this article, we give the definition of the multi-component constrained CKP (McCKP) and two-component constrained CKP (cCKP) hierarchies (under the condition N=2). Then we give recursion operators for the two-component cCKP hierarchy. At last, we give the constrained condition from the two-component cCKP hierarchies to cCKP hierarchy.
Inferring relationships between health and fertility in Norwegian Red cows using recursive models.
Heringstad, B; Wu, X-L; Gianola, D
2009-04-01
Health and fertility are complex traits, and the phenotype for one trait may affect the phenotype of one or more other traits. For instance, disease in early lactation may impair a cow's ability to show estrus and to conceive after insemination. The objectives of the present study were to explore phenotypic and genetic relationships among health and fertility traits in Norwegian Red cows using a recursive effects model, which allows disentangling causal effects of phenotypes from the genetic and environmental correlations among traits. Records of interval from calving to first insemination (CFI), nonreturn rate within 56 d after first insemination (NR56), clinical mastitis (CM), ketosis (KET), and retained placenta from 55,568 first-lactation daughters of 1,577 Norwegian Red sires were analyzed. Trivariate recursive Gaussian-threshold models were used to analyze the 2 fertility traits (CFI and NR56) together with 1 disease trait in each analysis. The estimated structural coefficients of the recursive models imply that presence of KET or retained placenta lengthened CFI, whereas causal effects from CM to fertility were negligible. Recursive effects of disease on NR56, and of CFI on NR56, were all close to zero. Genetic correlations between health and fertility traits were low or moderate. The strongest genetic correlation was between KET and CFI (0.29), whereas genetic correlations between CM and NR56 and between CFI and NR56 were nil. In general, selection against disease is expected to slightly improve fertility (shorter CFI and higher NR56) as a correlated response and vice versa. The present results suggest that the use of structural-equation models, such as the one used here, may enhance our understanding of complex relationships among traits.
Özdemir, Semra Bayat; Demiralp, Metin
2015-12-31
The determination of the energy states is highly studied issue in the quantum mechanics. Based on expectation values dynamics, energy states can be observed. But conditions and calculations vary depending on the created system. In this work, a symmetric exponential anharmonic oscillator is considered and development of a recursive approximation method is studied to find its ground energy state. The use of majorant values facilitates the approximate calculation of expectation values.
Tanadini, Lorenzo G; Steeves, John D; Hothorn, Torsten; Abel, Rainer; Maier, Doris; Schubert, Martin; Weidner, Norbert; Rupp, Rüdiger; Curt, Armin
2014-07-01
Background The reliable stratification of homogeneous subgroups and the prediction of future clinical outcomes within heterogeneous neurological disorders is a particularly challenging task. Nonetheless, it is essential for the implementation of targeted care and effective therapeutic interventions. Objective This study was designed to assess the value of a recently developed regression tool from the family of unbiased recursive partitioning methods in comparison to established statistical approaches (eg, linear and logistic regression) for predicting clinical endpoints and for prospective patients' stratification for clinical trials. Methods A retrospective, longitudinal analysis of prospectively collected neurological data from the European Multicenter study about Spinal Cord Injury (EMSCI) network was undertaken on C4-C6 cervical sensorimotor complete subjects. Predictors were based on a broad set of early (<2 weeks) clinical assessments. Endpoints were based on later clinical examinations of upper extremity motor scores and recovery of motor levels, at 6 and 12 months, respectively. Prediction accuracy for each statistical analysis was quantified by resampling techniques. Results For all settings, overlapping confidence intervals indicated similar prediction accuracy of unbiased recursive partitioning to established statistical approaches. In addition, unbiased recursive partitioning provided a direct way of identification of more homogeneous subgroups. The partitioning is carried out in a data-driven manner, independently from a priori decisions or predefined thresholds. Conclusion Unbiased recursive partitioning techniques may improve prediction of future clinical endpoints and the planning of future SCI clinical trials by providing easily implementable, data-driven rationales for early patient stratification based on simple decision rules and clinical read-outs.
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.
Modeling Selective Intergranular Oxidation of Binary Alloys
Xu, Zhijie; Li, Dongsheng; Schreiber, Daniel K.; Rosso, Kevin M.; Bruemmer, Stephen M.
2015-01-07
Intergranular attack of alloys under hydrothermal conditions is a complex problem that depends on metal and oxygen transport kinetics via solid-state and channel-like pathways to an advancing oxidation front. Experiments reveal very different rates of intergranular attack and minor element depletion distances ahead of the oxidation front for nickel-based binary alloys depending on the minor element. For example, a significant Cr depletion up to 9 µm ahead of grain boundary crack tips were documented for Ni-5Cr binary alloy, in contrast to relatively moderate Al depletion for Ni-5Al (~100s of nm). We present a mathematical kinetics model that adapts Wagner’s model for thick film growth to intergranular attack of binary alloys. The transport coefficients of elements O, Ni, Cr, and Al in bulk alloys and along grain boundaries were estimated from the literature. For planar surface oxidation, a critical concentration of the minor element can be determined from the model where the oxide of minor element becomes dominant over the major element. This generic model for simple grain boundary oxidation can predict oxidation penetration velocities and minor element depletion distances ahead of the advancing front that are comparable to experimental data. The significant distance of depletion of Cr in Ni-5Cr in contrast to the localized Al depletion in Ni-5Al can be explained by the model due to the combination of the relatively faster diffusion of Cr along the grain boundary and slower diffusion in bulk grains, relative to Al.
Modeling selective intergranular oxidation of binary alloys
NASA Astrophysics Data System (ADS)
Xu, Zhijie; Li, Dongsheng; Schreiber, Daniel K.; Rosso, Kevin M.; Bruemmer, Stephen M.
2015-01-01
Intergranular attack of alloys under hydrothermal conditions is a complex problem that depends on metal and oxygen transport kinetics via solid-state and channel-like pathways to an advancing oxidation front. Experiments reveal very different rates of intergranular attack and minor element depletion distances ahead of the oxidation front for nickel-based binary alloys depending on the minor element. For example, a significant Cr depletion up to 9 μm ahead of grain boundary crack tips was documented for Ni-5Cr binary alloy, in contrast to relatively moderate Al depletion for Ni-5Al (˜100 s of nm). We present a mathematical kinetics model that adapts Wagner's model for thick film growth to intergranular attack of binary alloys. The transport coefficients of elements O, Ni, Cr, and Al in bulk alloys and along grain boundaries were estimated from the literature. For planar surface oxidation, a critical concentration of the minor element can be determined from the model where the oxide of minor element becomes dominant over the major element. This generic model for simple grain boundary oxidation can predict oxidation penetration velocities and minor element depletion distances ahead of the advancing front that are comparable to experimental data. The significant distance of depletion of Cr in Ni-5Cr in contrast to the localized Al depletion in Ni-5Al can be explained by the model due to the combination of the relatively faster diffusion of Cr along the grain boundary and slower diffusion in bulk grains, relative to Al.
Active Attenuation of Acoustic Noise Using Adaptive Armax Control.
NASA Astrophysics Data System (ADS)
Swanson, David Carl
An adaptive auxiliary input autoregressive moving average (ARMAX) control system using the recursive least -squares lattice for system identification is developed for active control of dynamic systems. The closed-loop adaptive ARMAX control system is applied to active acoustic noise reduction in three-dimensional spaces. The structure of the ARMAX system is compared to that for duct cancellation systems, model-reference control systems, and the general field solution and is seen as a reasonable approach for active field control in the general case. The ARMAX system is derived for multiple inputs and outputs where the measured outputs are to be driven to desired waveforms with least -squares error using a multi-channel ARMAX lattice for recursive system identification. A significant reduction in complexity is obtained by neglecting the ARMAX zeros for the special case of active attenuation of non-dispersive acoustic waves. It is shown that using the least-squares lattice requires fewer multiplies, divides, additions, and subtractions than the recursive least-squares algorithm which is based on the matrix inversion lemma. Computational complexity is seen as an important issue in the application of adaptive ARMAX systems to active field control because the system must control relatively higher numbers of modes and frequencies in real time than are seen in industrial process plants for which the adaptive ARMAX systems were first developed using recursive least squares. Convergence requirements using the lattice system identification algorithm are the same as that for the recursive least squares algorithm in adaptive ARMAX system and are verified in numerical simulations using known ARMAX parameters. A real-time simulation of active attenuation of acoustic noise is presented using the blade-excited harmonics from a small axial flow fan. The adaptive ARMAX controller provides active attenuation for correlated spectral peaks but not for uncorrelated noise from turbulence
From binaries to multiples. II. Hierarchical multiplicity of F and G dwarfs
Tokovinin, Andrei
2014-04-01
Statistics of hierarchical multiplicity among solar-type dwarfs are studied using the distance-limited sample of 4847 targets presented in the accompanying Paper I. Known facts about binaries (multiplicity fraction 0.46, lognormal period distribution with median period 100 yr and logarithmic dispersion 2.4, and nearly uniform mass-ratio distribution independent of the period) are confirmed with a high statistical significance. The fraction of hierarchies with three or more components is 0.13 ± 0.01, and the fractions of targets with n = 1, 2, 3, ... components are 54:33:8:4:1. Subsystems in the secondary components are almost as frequent as in the primary components, but in half of such cases both inner pairs are present. The high frequency of those 2+2 hierarchies (4%) suggests that both inner pairs were formed by a common process. The statistics of hierarchies can be reproduced by simulations, assuming that the field is a mixture coming from binary-rich and binary-poor environments. Periods of the outer and inner binaries are selected recursively from the same lognormal distribution, subject to the stability constraint and accounting for the correlation between inner subsystems. The simulator can be used to evaluate the frequency of multiple systems with specified parameters. However, it does not reproduce the observed excess of inner periods shorter than 10 days, caused by tidal evolution.
A quintuple star system containing two eclipsing binaries
NASA Astrophysics Data System (ADS)
Rappaport, S.; Lehmann, H.; Kalomeni, B.; Borkovits, T.; Latham, D.; Bieryla, A.; Ngo, H.; Mawet, D.; Howell, S.; Horch, E.; Jacobs, T. L.; LaCourse, D.; Sódor, Á.; Vanderburg, A.; Pavlovski, K.
2016-10-01
We present a quintuple star system that contains two eclipsing binaries. The unusual architecture includes two stellar images separated by 11 arcsec on the sky: EPIC 212651213 and EPIC 212651234. The more easterly image (212651213) actually hosts both eclipsing binaries which are resolved within that image at 0.09 arcsec, while the westerly image (212651234) appears to be single in adaptive optics (AO), speckle imaging, and radial velocity (RV) studies. The `A' binary is circular with a 5.1-d period, while the `B' binary is eccentric with a 13.1-d period. The γ velocities of the A and B binaries are different by ˜10 km s-1. That, coupled with their resolved projected separation of 0.09 arcsec, indicates that the orbital period and separation of the `C' binary (consisting of A orbiting B) are ≃65 yr and ≃25 au, respectively, under the simplifying assumption of a circular orbit. Motion within the C orbit should be discernible via future RV, AO, and speckle imaging studies within a couple of years. The C system (i.e. 212651213) has an RV and proper motion that differ from that of 212651234 by only ˜1.4 km s-1 and ˜3 mas yr-1. This set of similar space velocities in three dimensions strongly implies that these two objects are also physically bound, making this at least a quintuple star system.
On-line Supervised Adaptive Training Using Radial Basis Function Networks.
Luo, Wan; Billings, Steve A.; Fung, Chi F.
1996-12-01
A new recursive supervised training algorithm is derived for the radial basis neural network architecture. The new algorithm combines the procedures of on-line candidate regressor selection with the conventional Givens QR based recursive parameter estimator to provide efficient adaptive supervised network training. A new concise on-line correlation based performance monitoring scheme is also introduced as an auxiliary device to detect structural changes in temporal data processing applications. Practical and simulated examples are included to demonstrate the effectiveness of the new procedures. Copyright 1996 Elsevier Science Ltd.
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.
Binary optics: Trends and limitations
NASA Astrophysics Data System (ADS)
Farn, Michael W.; Veldkamp, Wilfrid B.
1993-08-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.
Binary Stars in Globular Clusters
NASA Astrophysics Data System (ADS)
Mateo, M.; Murdin, P.
2000-11-01
Globular clusters have long been known to be among the richest stellar groupings within our Galaxy, but for many years they were believed to be largely devoid of the most minimal stellar group: binary stars (see BINARY STARS: OVERVIEW). For many years, the only evidence that any binaries existed in these clusters came from the presence of BLUE STRAGGLERS—stars that appear to be significantly you...
Evolution of Close Binary Systems
Yakut, K; Eggleton, P
2005-01-24
We collected data on the masses, radii, etc. of three classes of close binary stars: low-temperature contact binaries (LTCBs), near-contact binaries (NCBs), and detached close binaries (DCBs). They restrict themselves to systems where (1) both components are, at least arguably, near the Main Sequence, (2) the periods are less than a day, and (3) there is both spectroscopic and photometric analysis leading to reasonably reliable data. They discuss the possible evolutionary connections between these three classes, emphasizing the roles played by mass loss and angular momentum loss in rapidly-rotating cool stars.
KIC 7177553: A Quadruple System of Two Close Binaries
NASA Astrophysics Data System (ADS)
Lehmann, H.; Borkovits, T.; Rappaport, S. A.; Ngo, H.; Mawet, D.; Csizmadia, Sz.; Forgács-Dajka, E.
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. From 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.
Low autocorrelation binary sequences
NASA Astrophysics Data System (ADS)
Packebusch, Tom; Mertens, Stephan
2016-04-01
Binary sequences with minimal autocorrelations have applications in communication engineering, mathematics and computer science. In statistical physics they appear as groundstates of the Bernasconi model. Finding these sequences is a notoriously hard problem, that so far can be solved only by exhaustive search. We review recent algorithms and present a new algorithm that finds optimal sequences of length N in time O(N {1.73}N). We computed all optimal sequences for N≤slant 66 and all optimal skewsymmetric sequences for N≤slant 119.
NASA Astrophysics Data System (ADS)
Griffin, R. Elizabeth; Ake, Thomas B.
This opening chapter provides a brief historical overview of the ζ Aur stars, with a focus on what K.O. Wright, his predecessors and colleagues at the Dominion Astrophysical Observatory, and his contemporaries further afield, achieved during the era of pre-electronic data. It places the topic within the framework of modern observing, data management and computing, outlines the principal features of the chromospheric-eclipse phenomena which single out the ζ Aur binaries for special study, and describes the considerable potential which this remarkable yet very select group of stars offers for increasing our understanding of stellar physics.
NASA Astrophysics Data System (ADS)
Carey, Michael Richard
Binary porous convection falls into the larger category of pattern formation---a symmetry breaking instability which creates a spatially periodic structure within a homogeneous system. The experiments and model presented in this dissertation indicate that an essential piece of physics is missing from the standard Darcian picture used to describe pattern formation in a porous medium convection system. Present theory predicts a bifurcation to an oscillatory state at onset for a binary mixture in a porous media over a wide range of experimental parameters (Brand and Steinberg, Physics Letters 93A 333 (1983)). This theory is inadequate in explaining the predominant large amplitude, backward, stationary overturning convection state observed in our experiments after transients have decayed. Convection experiments were visualized with magnetic resonance imaging and performed with a foam medium in slot and cylindrical geometries as well as a rectangular, packed bead system with water-ethanol mixtures. We explore the possibility that the difference between theory and experiment is due to enhanced solutal mixing not included in previous theories. The enhanced mixing of the fluid produces an effective diffusion coefficient that largely suppresses gradients in the concentration field, resulting in single-fluid like behavior. We model the experimental system with a Lorenz truncation of the binary Darcy equations with enhanced mixing. This model predicts results qualitatively similar to experiments: a forward bifurcation to small amplitude oscillations with a secondary backward bifurcation to large amplitude stationary convection. We have also developed an experimental nuclear magnetic resonance technique that measures the effective diffusion coefficient, D = D(v), as a function of velocity, v, for the individual species of the binary mixture simultaneously. However, the mixing effect measured in plug flow experiments is roughly two to three orders of magnitude too small to have
New Approach for IIR Adaptive Lattice Filter Structure Using Simultaneous Perturbation Algorithm
NASA Astrophysics Data System (ADS)
Martinez, Jorge Ivan Medina; Nakano, Kazushi; Higuchi, Kohji
Adaptive infinite impulse response (IIR), or recursive, filters are less attractive mainly because of the stability and the difficulties associated with their adaptive algorithms. Therefore, in this paper the adaptive IIR lattice filters are studied in order to devise algorithms that preserve the stability of the corresponding direct-form schemes. We analyze the local properties of stationary points, a transformation achieving this goal is suggested, which gives algorithms that can be efficiently implemented. Application to the Steiglitz-McBride (SM) and Simple Hyperstable Adaptive Recursive Filter (SHARF) algorithms is presented. Also a modified version of Simultaneous Perturbation Stochastic Approximation (SPSA) is presented in order to get the coefficients in a lattice form more efficiently and with a lower computational cost and complexity. The results are compared with previous lattice versions of these algorithms. These previous lattice versions may fail to preserve the stability of stationary points.
Role of Inverse-Cone-Shape Lipids in Temperature-Controlled Self-Reproduction of Binary Vesicles.
Jimbo, Takehiro; Sakuma, Yuka; Urakami, Naohito; Ziherl, Primož; Imai, Masayuki
2016-04-12
We investigate a temperature-driven recursive division of binary giant unilamellar vesicles (GUVs). During the heating step of the heating-cooling cycle, the spherical mother vesicle deforms to a budded limiting shape using up the excess area produced by the chain melting of the lipids and then splits off into two daughter vesicles. Upon cooling, the daughter vesicle opens a pore and recovers the spherical shape of the mother vesicle. Our GUVs are composed of DLPE (1,2-dilauroyl-sn-glycero-3-phosphoethanolamine) and DPPC (1,2-dipalmitoyl-sn-glycero-3-phosphocholine). During each cycle, vesicle deformation is monitored by a fast confocal microscope and the images are analyzed to obtain the time evolution of reduced volume and reduced monolayer area difference as the key geometric parameters that quantify vesicle shape. By interpreting the deformation pathway using the area-difference elasticity theory, we conclude that vesicle division relies on (1) a tiny asymmetric distribution of DLPE within the bilayer, which controls the observed deformation from the sphere to the budded shape; and (2) redistribution of DLPE during the deformation-division stage, which ensures that the process is recursive. The spontaneous coupling between membrane curvature and PE lipid distribution is responsible for the observed recursive division of GUVs. These results shed light on the mechanisms of vesicle self-reproduction. PMID:27074680
Muterspaugh, Matthew W.; O'Connell, J.; Hartkopf, William I.; Lane, Benjamin F.; Williamson, M.; Kulkarni, S. R.; Konacki, Maciej; Burke, Bernard F.; Colavita, M. M.; Shao, M.; Wiktorowicz, Sloane J. E-mail: wih@usno.navy.mi E-mail: maciej@ncac.torun.p
2010-12-15
Differential astrometry measurements from the Palomar High-precision Astrometric Search for Exoplanet Systems have been combined with lower precision single-aperture measurements covering a much longer timespan (from eyepiece measurements, speckle interferometry, and adaptive optics) to determine improved visual orbits for 20 binary stars. In some cases, radial velocity observations exist to constrain the full three-dimensional orbit and determine component masses. The visual orbit of one of these binaries-{alpha} Com (HD 114378)-shows that the system is likely to have eclipses, despite its very long period of 26 years. The next eclipse is predicted to be within a week of 2015 January 24.
NASA Astrophysics Data System (ADS)
Park, Conner; Read, Jocelyn; Flynn, Eric; Lockett-Ruiz, Veronica
2016-03-01
Gravitational waves, predicted by Einstein's Theory of Relativity, are a new frontier in astronomical observation we can use to observe phenomena in the universe. Laser Interferometer Gravitational wave Observatory (LIGO) is currently searching for gravitational wave signals, and requires accurate predictions in order to best extract astronomical signals from all other sources of fluctuations. The focus of my research is in increasing the accuracy of Post-Newtonian models of binary neutron star coalescence to match the computationally expensive Numerical models. Numerical simulations can take months to compute a couple of milliseconds of signal whereas the Post-Newtonian can generate similar signals in seconds. However the Post-Newtonian model is an approximation, e.g. the Taylor T4 Post-Newtonian model assumes that the two bodies in the binary neutron star system are point charges. To increase the effectiveness of the approximation, I added in tidal effects, resonance frequencies, and a windowing function. Using these observed effects from simulations significantly increases the Post-Newtonian model's similarity to the Numerical signal.
Multilevel Models for Binary Data
ERIC Educational Resources Information Center
Powers, Daniel A.
2012-01-01
The methods and models for categorical data analysis cover considerable ground, ranging from regression-type models for binary and binomial data, count data, to ordered and unordered polytomous variables, as well as regression models that mix qualitative and continuous data. This article focuses on methods for binary or binomial data, which are…
Signature Visualization of Software Binaries
Panas, T
2008-07-01
In this paper we present work on the visualization of software binaries. In particular, we utilize ROSE, an open source compiler infrastructure, to pre-process software binaries, and we apply a landscape metaphor to visualize the signature of each binary (malware). We define the signature of a binary as a metric-based layout of the functions contained in the binary. In our initial experiment, we visualize the signatures of a series of computer worms that all originate from the same line. These visualizations are useful for a number of reasons. First, the images reveal how the archetype has evolved over a series of versions of one worm. Second, one can see the distinct changes between version. This allows the viewer to form conclusions about the development cycle of a particular worm.
BINARY ASTROMETRIC MICROLENSING WITH GAIA
Sajadian, Sedighe
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 due 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.
Evolution of Small Binary Asteroids with the Binary YORP Effect
NASA Astrophysics Data System (ADS)
Frouard, Julien
2013-05-01
Abstract (2,250 Maximum Characters): Small, Near-Earth binaries are believed to be created following the fission of an asteroid spun up by the YORP effect. It is then believed that the YORP effect acting on the secondary (Binary YORP) increases or decreases the binary mutual distance on 10^5 yr timescales. How long this mechanism can apply is not yet fully understood. We investigate the binary orbital and rotational dynamics by using non-averaged, direct numerical simulations, taking into account the relative motion of two ellipsoids (primary and secondary) and the solar perturbation. We add the YORP force and torque on the orbital and rotational motion of the secondary. As a check of our code we obtain a ~ 7.2 cm/yr drift in semi-major axis for 1999 KW4 beta, consistent with the values obtained with former analytical studies. The synchronous rotation of the secondary is required for the Binary YORP to be effective. We investigate the synchronous lock of the secondary in function of different parameters ; mutual distance, shape of the secondary, and heliocentric orbit. For example we show that the secondary of 1999 KW4 can be synchronous only up to 7 Rp (primary radius), where the resonance becomes completely chaotic even for very small eccentricities. We use Gaussian Random Spheres to obtain various secondary shapes, and check the evolution of the binaries with the Binary YORP effect.
Bayesian recursive mixed linear model for gene expression analyses with continuous covariates.
Casellas, J; Ibáñez-Escriche, N
2012-01-01
The analysis of microarray gene expression data has experienced a remarkable growth in scientific research over the last few years and is helping to decipher the genetic background of several productive traits. Nevertheless, most analytical approaches have relied on the comparison of 2 (or a few) well-defined groups of biological conditions where the continuous covariates have no sense (e.g., healthy vs. cancerous cells). Continuous effects could be of special interest when analyzing gene expression in animal production-oriented studies (e.g., birth weight), although very few studies address this peculiarity in the animal science framework. Within this context, we have developed a recursive linear mixed model where not only are linear covariates accounted for during gene expression analyses but also hierarchized and the effects of their genetic, environmental, and residual components on differential gene expression inferred independently. This parameterization allows a step forward in the inference of differential gene expression linked to a given quantitative trait such as birth weight. The statistical performance of this recursive model was exemplified under simulation by accounting for different sample sizes (n), heritabilities for the quantitative trait (h(2)), and magnitudes of differential gene expression (λ). It is important to highlight that statistical power increased with n, h(2), and λ, and the recursive model exceeded the standard linear mixed model with linear (nonrecursive) covariates in the majority of scenarios. This new parameterization would provide new insights about gene expression in the animal science framework, opening a new research scenario where within-covariate sources of differential gene expression could be individualized and estimated. The source code of the program accommodating these analytical developments and additional information about practical aspects on running the program are freely available by request to the corresponding
Recursive Focal Plane Wavefront and Bias Estimation for the Direct Imaging of Exoplanets
NASA Astrophysics Data System (ADS)
Eldorado Riggs, A. J.; Kasdin, N. Jeremy; Groff, Tyler Dean
2016-01-01
To image the reflected light from exoplanets and disks, an instrument must suppress diffracted starlight by about nine orders of magnitude. A coronagraph alters the stellar PSF to create regions of high contrast, but it is extremely sensitive to wavefront aberrations. Deformable mirrors (DMs) are necessary to mitigate these quasi-static aberrations and recover high-contrast. To avoid non-common path aberrations, the science camera must be used as the primary wavefront sensor. Focal plane wavefront correction is an iterative process, and obtaining sufficient signal in the dark holes requires long exposure times. The fastest coronagraphic wavefront correction techniques require estimates of the stellar electric field. The main challenge of coronagraphy is thus to perform complex wavefront estimation quickly and efficiently using intensity images from the camera. The most widely applicable and tested technique is DM Diversity, in which a DM modulates the focal plane intensity and several images are used to reconstruct the stellar electric field in a batch process. At the High Contrast Imaging Lab (HCIL) at Princeton, we have developed an iterative extended Kalman filter (IEKF) to improve upon this technique. The IEKF enables recursive starlight estimation and can utilize fewer images per iteration, thereby speeding up wavefront correction. This IEKF formulation also estimates the bias in the images recursively. Since exoplanets and disks are embedded in the incoherent bias signal, the IEKF enables detection of science targets during wavefront correction. Here we present simulated and experimental results from Princeton's HCIL demonstrating the effectiveness of the IEKF for recursive electric field estimation and exoplanet detection.
Use of the recursion formula of the Gompertz survival function to evaluate life-table data.
Bassukas, I D
1996-08-29
The recursion formula of the Gompertz function is an established method for the analysis of growth processes. In the present study the recursion formula of the Gompertz survival function 1n S(t + s) = a + b x ln S(t) is introduced for the analysis of survival data, where S(t) is the survival fraction at age 1, s is the constant age increment between two consecutive measurements of the survival fraction and a and b are parameters. With the help of this method--and provided stroboscopial measurements of rates of survival are available--the Gompertz survival function, instead of the corresponding mortality function, can be determined directly using linear regression analysis. The application of the present algorithm is demonstrated by analysing two sets of data taken from the literature (survival of Drosophila imagoes and of female centenarians) using linear regression analysis to fit survival or mortality rates to the corresponding models. In both cases the quality of fit was superior by using the algorithm presently introduced. Moreover, survival functions calculated from the fits to the mortality law only poorly predict the survival data. On the contrary, the results of the present method not only fit to the measurements, but, for both sets of data the mortality parameters calculated by the present method are essentially identical to those obtained by a corresponding application of a non-linear Marquardt-Levenberg algorithm to fit the same sets of data to the explicit form of the Gompertz survival function. Taking into consideration the advantages of using a linear fit (goodness-of-fit test and efficient statistical comparison of survival patterns) the method of the recursion formula of the Gompertz survival function is the most preferable method to fit survival data to the Gompertz function.
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.
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.
System Simulation by Recursive Feedback: Coupling a Set of Stand-Alone Subsystem Simulations
NASA Technical Reports Server (NTRS)
Nixon, Douglas D.; Ryan, Stephen G. (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 (orbit 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.
Recursive Recovery of Sparse Signal Sequences From Compressive Measurements: A Review
NASA Astrophysics Data System (ADS)
Vaswani, Namrata; Zhan, Jinchun
2016-07-01
In this article, we review the literature on design and analysis of recursive algorithms for reconstructing a time sequence of sparse signals from compressive measurements. The signals are assumed to be sparse in some transform domain or in some dictionary. Their sparsity patterns can change with time, although, in many practical applications, the changes are gradual. An important class of applications where this problem occurs is dynamic projection imaging, e.g., dynamic magnetic resonance imaging (MRI) for real-time medical applications such as interventional radiology, or dynamic computed tomography.
Gauge amplitude identities by on-shell recursion relation in S-matrix program
NASA Astrophysics Data System (ADS)
Feng, Bo; Huang, Rijun; Jia, Yin
2011-01-01
Using only the Britto-Cachazo-Feng-Witten (BCFW) on-shell recursion relation we prove color-order reversed relation, U(1)-decoupling relation, Kleiss-Kuijf (KK) relation and Bern-Carrasco-Johansson (BCJ) relation for color-ordered gauge amplitude in the framework of S-matrix program without relying on Lagrangian description. Our derivation is the first pure field theory proof of the new discovered BCJ identity, which substantially reduces the color-ordered basis from (n-2)! to (n-3)!. Our proof gives also its physical interpretation as the mysterious bonus relation with 1/z behavior under suitable on-shell deformation for no adjacent pair.
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.
NASA Technical Reports Server (NTRS)
Painter, J. H.; Gupta, S. C.
1973-01-01
This paper presents the derivation of the recursive algorithms necessary for real-time digital detection of M-ary known signals that are subject to independent multiplicative and additive Gaussian noises. The motivating application is minimum probability of error detection of digital data-link messages aboard civil aircraft in the earth reflection multipath environment. For each known signal, the detector contains one Kalman filter and one probability computer. The filters estimate the multipath disturbance. The estimates and the received signal drive the probability computers. Outputs of all the computers are compared in amplitude to give the signal decision. The practicality and usefulness of the detector are extensively discussed.
Cyclic period-3 window in antiferromagnetic potts and Ising models on recursive lattices
NASA Astrophysics Data System (ADS)
Ananikian, N. S.; Ananikyan, L. N.; Chakhmakhchyan, L. A.
2011-09-01
The magnetic properties of the antiferromagnetic Potts model with two-site interaction and the antiferromagnetic Ising model with three-site interaction on recursive lattices have been studied. A cyclic period-3 window has been revealed by the recurrence relation method in the antiferromagnetic Q-state Potts model on the Bethe lattice (at Q < 2) and in the antiferromagnetic Ising model with three-site interaction on the Husimi cactus. The Lyapunov exponents have been calculated, modulated phases and a chaotic regime in the cyclic period-3 window have been found for one-dimensional rational mappings determined the properties of these systems.
A convolutional recursive modified Self Organizing Map for handwritten digits recognition.
Mohebi, Ehsan; Bagirov, Adil
2014-12-01
It is well known that the handwritten digits recognition is a challenging problem. Different classification algorithms have been applied to solve it. Among them, the Self Organizing Maps (SOM) produced promising results. In this paper, first we introduce a Modified SOM for the vector quantization problem with improved initialization process and topology preservation. Then we develop a Convolutional Recursive Modified SOM and apply it to the problem of handwritten digits recognition. The computational results obtained using the well known MNIST dataset demonstrate the superiority of the proposed algorithm over the existing SOM-based algorithms.
Recursive polarization of nuclear spins in diamond at arbitrary magnetic fields
Pagliero, Daniela; Laraoui, Abdelghani; Henshaw, Jacob D.; Meriles, Carlos A.
2014-12-15
We introduce an alternate route to dynamically polarize the nuclear spin host of nitrogen-vacancy (NV) centers in diamond. Our approach articulates optical, microwave, and radio-frequency pulses to recursively transfer spin polarization from the NV electronic spin. Using two complementary variants of the same underlying principle, we demonstrate nitrogen nuclear spin initialization approaching 80% at room temperature both in ensemble and single NV centers. Unlike existing schemes, our approach does not rely on level anti-crossings and is thus applicable at arbitrary magnetic fields. This versatility should prove useful in applications ranging from nanoscale metrology to sensitivity-enhanced NMR.
Recursive encoding and decoding of the noiseless subsystem and decoherence-free subspace
Li, Chi-Kwong; Nakahara, Mikio; Poon, Yiu-Tung; Sze, Nung-Sing; Tomita, Hiroyuki
2011-10-15
When an environmental disturbance to a quantum system has a wavelength much larger than the system size, all qubits in the system are under the action of the same error operator. The noiseless subsystem and decoherence-free subspace are immune to such collective noise. We construct simple quantum circuits that implement these error-avoiding codes for a small number n of physical qubits. A single logical qubit is encoded with n=3 and 4, while two and three logical qubits are encoded with n=5 and 7, respectively. Recursive relations among subspaces employed in these codes play essential roles in our implementation.
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.
Blankers, Matthijs; Frijns, Tom; Belackova, Vendula; Rossi, Carla; Svensson, Bengt; Trautmann, Franz; van Laar, Margriet
2014-01-01
Introduction 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. Methods 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. Results 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). Conclusion 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
ROTATIONAL VELOCITIES OF INDIVIDUAL COMPONENTS IN VERY LOW MASS BINARIES
Konopacky, Q. M.; Macintosh, B. A.; Ghez, A. M.; Fabrycky, D. C.; White, R. J.; Barman, T. S.; Rice, E. L.; Hallinan, G.; Duchene, G. E-mail: konopacky@di.utoronto.ca E-mail: fabrycky@ucolick.org E-mail: barman@lowell.edu E-mail: gh@astro.caltech.edu
2012-05-01
We present rotational velocities for individual components of 11 very low mass (VLM) binaries with spectral types between M7 and L7.5. These results are based on observations taken with the near-infrared spectrograph, NIRSPEC, and the Keck II laser guide star adaptive optics system. We find that the observed sources tend to be rapid rotators (v sin i > 10 km s{sup -1}), consistent with previous seeing-limited measurements of VLM objects. The two sources with the largest v sin i, LP 349-25B and HD 130948C, are rotating at {approx}30% of their break-up speed, and are among the most rapidly rotating VLM objects known. Furthermore, five binary systems, all with orbital semimajor axes {approx}<3.5 AU, have component v sin i values that differ by greater than 3{sigma}. To bring the binary components with discrepant rotational velocities into agreement would require the rotational axes to be inclined with respect to each other, and that at least one component is inclined with respect to the orbital plane. Alternatively, each component could be rotating at a different rate, even though they have similar spectral types. Both differing rotational velocities and inclinations have implications for binary star formation and evolution. We also investigate possible dynamical evolution in the triple system HD 130948A-BC. The close binary brown dwarfs B and C have significantly different v sin i values. We demonstrate that components B and C could have been torqued into misalignment by the primary star, A, via orbital precession. Such a scenario can also be applied to another triple system in our sample, GJ 569A-Bab. Interactions such as these may play an important role in the dynamical evolution of VLM binaries. Finally, we note that two of the binaries with large differences in component v sin i, LP 349-25AB and 2MASS 0746+20AB, are also known radio sources.
ERIC Educational Resources Information Center
Smith, Scott G.
2015-01-01
In this article, Scott Smith presents an innocent problem (Problem 12 of the May 2001 Calendar from "Mathematics Teacher" ("MT" May 2001, vol. 94, no. 5, p. 384) that was transformed by several timely "what if?" questions into a rewarding investigation of some interesting mathematics. These investigations led to two…
A general framework for adaptive processing of data structures.
Frasconi, P; Gori, M; Sperduti, A
1998-01-01
A structured organization of information is typically required by symbolic processing. On the other hand, most connectionist models assume that data are organized according to relatively poor structures, like arrays or sequences. The framework described in this paper is an attempt to unify adaptive models like artificial neural nets and belief nets for the problem of processing structured information. In particular, relations between data variables are expressed by directed acyclic graphs, where both numerical and categorical values coexist. The general framework proposed in this paper can be regarded as an extension of both recurrent neural networks and hidden Markov models to the case of acyclic graphs. In particular we study the supervised learning problem as the problem of learning transductions from an input structured space to an output structured space, where transductions are assumed to admit a recursive hidden statespace representation. We introduce a graphical formalism for representing this class of adaptive transductions by means of recursive networks, i.e., cyclic graphs where nodes are labeled by variables and edges are labeled by generalized delay elements. This representation makes it possible to incorporate the symbolic and subsymbolic nature of data. Structures are processed by unfolding the recursive network into an acyclic graph called encoding network. In so doing, inference and learning algorithms can be easily inherited from the corresponding algorithms for artificial neural networks or probabilistic graphical model.
NASA Astrophysics Data System (ADS)
Kraus, Adam L.; Ireland, Michael J.; Huber, Daniel; Mann, Andrew W.; Dupuy, Trent J.
2016-07-01
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 382 Kepler Objects of Interest (KOIs) obtained using adaptive-optics imaging and nonredundant aperture-mask interferometry on the Keck II telescope. Among the full sample of 506 candidate binary companions to KOIs, we super-resolve some binary systems to projected separations of <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. For a field binary population, we should have found 58 binary companions with projected separation ρ < 50 au and mass ratio q > 0.4 we instead only found 23 companions (a 4.6σ deficit), many of which must be wider pairs that are only close in projection. 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 {a}{cut}={47}-23+59 au, the planet occurrence rate in binary systems is only {S}{bin}={0.34}-0.15+0.14 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.
Content identification: binary content fingerprinting versus binary content encoding
NASA Astrophysics Data System (ADS)
Ferdowsi, Sohrab; Voloshynovskiy, Svyatoslav; Kostadinov, Dimche
2014-02-01
In this work, we address the problem of content identification. We consider content identification as a special case of multiclass classification. The conventional approach towards identification is based on content fingerprinting where a short binary content description known as a fingerprint is extracted from the content. We propose an alternative solution based on elements of machine learning theory and digital communications. Similar to binary content fingerprinting, binary content representation is generated based on a set of trained binary classifiers. We consider several training/encoding strategies and demonstrate that the proposed system can achieve the upper theoretical performance limits of content identification. The experimental results were carried out both on a synthetic dataset with different parameters and the FAMOS dataset of microstructures from consumer packages.
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.
Binary Oscillatory Crossflow Electrophoresis
NASA Technical Reports Server (NTRS)
Molloy, Richard F.; Gallagher, Christopher T.; Leighton, David T., Jr.
1997-01-01
Electrophoresis has long been recognized as an effective analytic technique for the separation of proteins and other charged species, however attempts at scaling up to accommodate commercial volumes have met with limited success. In this report we describe a novel electrophoretic separation technique - Binary Oscillatory Crossflow Electrophoresis (BOCE). Numerical simulations indicate that the technique has the potential for preparative scale throughputs with high resolution, while simultaneously avoiding many problems common to conventional electrophoresis. The technique utilizes the interaction of an oscillatory electric field and a transverse oscillatory shear flow to create an active binary filter for the separation of charged protein species. An oscillatory electric field is applied across the narrow gap of a rectangular channel inducing a periodic motion of charged protein species. The amplitude of this motion depends on the dimensionless electrophoretic mobility, alpha = E(sub o)mu/(omega)d, where E(sub o) is the amplitude of the electric field oscillations, mu is the dimensional mobility, omega is the angular frequency of oscillation and d is the channel gap width. An oscillatory shear flow is induced along the length of the channel resulting in the separation of species with different mobilities. We present a model that predicts the oscillatory behavior of charged species and allows estimation of both the magnitude of the induced convective velocity and the effective diffusivity as a function of a in infinitely long channels. Numerical results indicate that in addition to the mobility dependence, the steady state behavior of solute species may be strongly affected by oscillating fluid into and out of the active electric field region at the ends of the cell. The effect is most pronounced using time dependent shear flows of the same frequency (cos((omega)t)) flow mode) as the electric field oscillations. Under such conditions, experiments indicate that
Kernel Recursive Least-Squares Temporal Difference Algorithms with Sparsification and Regularization
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) L2 and L1 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 L1 regularization easy to implement. Finally, simulation results on two 50-state chain problems demonstrate the effectiveness of our algorithms. PMID:27436996
Online recursive independent component analysis for real-time source separation of high-density EEG.
Hsu, Sheng-Hsiou; Mullen, Tim; Jung, Tzyy-Ping; Cauwenberghs, Gert
2014-01-01
Online Independent Component Analysis (ICA) algorithms have recently seen increasing development and application across a range of fields, including communications, biosignal processing, and brain-computer interfaces. However, prior work in this domain has primarily focused on algorithmic proofs of convergence, with application limited to small `toy' examples or to relatively low channel density EEG datasets. Furthermore, there is limited availability of computationally efficient online ICA implementations, suitable for real-time application. This study describes an optimized online recursive ICA algorithm (ORICA), with online recursive least squares (RLS) whitening, for blind source separation of high-density EEG data. It is implemented as an online-capable plugin within the open-source BCILAB (EEGLAB) framework. We further derive and evaluate a block-update modification to the ORICA learning rule. We demonstrate the algorithm's suitability for accurate and efficient source identification in high density (64-channel) realistically-simulated EEG data, as well as real 61-channel EEG data recorded by a dry and wearable EEG system in a cognitive experiment. PMID:25570830
A recursive genetic framework for evolutionary decision-making in problems with high dynamism
NASA Astrophysics Data System (ADS)
Pashaei, Kaveh; Taghiyareh, Fattaneh; Badie, Kambiz
2015-11-01
Communication and coordination are the main cores for reaching a constructive agreement among multi-agent systems (MASs). Dividing the overall performance of MAS to individual agents may lead to group learning as opposed to individual learning, which is one of the weak points of MASs. This paper proposes a recursive genetic framework for solving problems with high dynamism. In this framework, a combination of genetic algorithm and multi-agent capabilities is utilised to accelerate team learning and accurate credit assignment. The argumentation feature is used to accomplish agent learning and the negotiation features of MASs are used to achieve a credit assignment. The proposed framework is quite general and its recursive hierarchical structure could be extended. We have dedicated one special controlling module for increasing convergence time. Due to the complexity of blackjack, we have applied it as a possible test bed to evaluate the system's performance. The learning rate of agents is measured as well as their credit assignment. The analysis of the obtained results led us to believe that our robust framework with the proposed negotiation operator is a promising methodology to solve similar problems in other areas with high dynamism.
Kastening
2000-04-01
The free energy of a multicomponent scalar field theory is considered as a functional W[G,J] of the free correlation function G and an external current J. It obeys nonlinear functional differential equations which are turned into recursion relations for the connected Green's functions in a loop expansion. These relations amount to a simple proof that W[G,J] generates only connected graphs and can be used to find all such graphs with their combinatoric weights. A Legendre transformation with respect to the external current converts the functional differential equations for the free energy into those for the effective energy Gamma[G,Phi], which is considered as a functional of the free correlation function G and the field expectation Phi. These equations are turned into recursion relations for the one-particle irreducible Green's functions. These relations amount to a simple proof that Gamma[G,J] generates only one-particle irreducible graphs and can be used to find all such graphs with their combinatoric weights. The techniques used also allow for a systematic investigation into resummations of classes of graphs. Examples are given for resumming one-loop and multiloop tadpoles, both through all orders of perturbation theory. Since the functional differential equations derived are nonperturbative, they constitute also a convenient starting point for other expansions than those in numbers of loops or powers of coupling constants. We work with general interactions through four powers in the field.
Recursive forward dynamics for multiple robot arms moving a common task object
NASA Technical Reports Server (NTRS)
Rodriguez, G.
1988-01-01
Recursive forward dynamics algorithms are developed for an arbitrary number of robot arms moving a commonly held object. The multiarm forward dynamics problem is to find the angular accelerations at the joints and the contact forces that the arms impart to the task object. The problem also involves finding the acceleration of this object. The multiarm forward dynamics solutions provide a thorough physical and mathematical understanding of the way several arms behave in response to a set of applied joint moments. Such an understanding simplifies and guides the subsequent control design and experimentation process. The forward dynamics algorithms also provide the necessary analytical foundation for conducting analysis and simulation studies. The multiarm algorithms are based on the filtering and smoothing approach recently advanced for single-arm dynamics, and they can be built up modularly from the single-arm algorithms. The algorithms compute recursively the joint-angle accelerations, the contact forces, and the task-object accelerations. Algorithms are also developed to evaluate in closed form the linear transformations from the active joint moments to the joint-angle accelerations, to the task-object accelerations., and to the task-object contact forces. A possible computing architecture is presented as a precursor to a more complete investigation of the computational performance of the dynamics algorithms.
McDaniel, Jonathan R; Mackay, J Andrew; Quiroz, Felipe García; Chilkoti, Ashutosh
2010-04-12
This paper reports a new strategy, recursive directional ligation by plasmid reconstruction (PRe-RDL), to rapidly clone highly repetitive polypeptides of any sequence and specified length over a large range of molecular weights. In a single cycle of PRe-RDL, two halves of a parent plasmid, each containing a copy of an oligomer, are ligated together, thereby dimerizing the oligomer and reconstituting a functional plasmid. This process is carried out recursively to assemble an oligomeric gene with the desired number of repeats. PRe-RDL has several unique features that stem from the use of type IIs restriction endonucleases: first, PRe-RDL is a seamless cloning method that leaves no extraneous nucleotides at the ligation junction. Because it uses type IIs endonucleases to ligate the two halves of the plasmid, PRe-RDL also addresses the major limitation of RDL in that it abolishes any restriction on the gene sequence that can be oligomerized. The reconstitution of a functional plasmid only upon successful ligation in PRe-RDL also addresses two other limitations of RDL: the significant background from self-ligation of the vector observed in RDL, and the decreased efficiency of ligation due to nonproductive circularization of the insert. PRe-RDL can also be used to assemble genes that encode different sequences in a predetermined order to encode block copolymers or append leader and trailer peptide sequences to the oligomerized gene. PMID:20184309
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.
Lorber, A.A.; Carey, G.F.; Bova, S.W.; Harle, C.H.
1996-12-31
The connection between the solution of linear systems of equations by iterative methods and explicit time stepping techniques is used to accelerate to steady state the solution of ODE systems arising from discretized PDEs which may involve either physical or artificial transient terms. Specifically, a class of Runge-Kutta (RK) time integration schemes with extended stability domains has been used to develop recursion formulas which lead to accelerated iterative performance. The coefficients for the RK schemes are chosen based on the theory of Chebyshev iteration polynomials in conjunction with a local linear stability analysis. We refer to these schemes as Chebyshev Parameterized Runge Kutta (CPRK) methods. CPRK methods of one to four stages are derived as functions of the parameters which describe an ellipse {Epsilon} which the stability domain of the methods is known to contain. Of particular interest are two-stage, first-order CPRK and four-stage, first-order methods. It is found that the former method can be identified with any two-stage RK method through the correct choice of parameters. The latter method is found to have a wide range of stability domains, with a maximum extension of 32 along the real axis. Recursion performance results are presented below for a model linear convection-diffusion problem as well as non-linear fluid flow problems discretized by both finite-difference and finite-element methods.
Efficient O(N) recursive computation of the operational space inertial matrix
Lilly, K.W.; Orin, D.E.
1993-09-01
The operational space inertia matrix {Lambda} reflects the dynamic properties of a robot manipulator to its tip. In the control domain, it may be used to decouple force and/or motion control about the manipulator workspace axes. The matrix {Lambda} also plays an important role in the development of efficient algorithms for the dynamic simulation of closed-chain robotic mechanisms, including simple closed-chain mechanisms such as multiple manipulator systems and walking machines. The traditional approach used to compute {Lambda} has a computational complexity of O(N{sup 3}) for an N degree-of-freedom manipulator. This paper presents the development of a recursive algorithm for computing the operational space inertia matrix (OSIM) that reduces the computational complexity to O(N). This algorithm, the inertia propagation method, is based on a single recursion that begins at the base of the manipulator and progresses out to the last link. Also applicable to redundant systems and mechanisms with multiple-degree-of-freedom joints, the inertia propagation method is the most efficient method known for computing {Lambda} for N {>=} 6. The numerical accuracy of the algorithm is discussed for a PUMA 560 robot with a fixed base.
A generalized recursive convolution method for time-domain propagation in porous media.
Dragna, Didier; Pineau, Pierre; Blanc-Benon, Philippe
2015-08-01
An efficient numerical method, referred to as the auxiliary differential equation (ADE) method, is proposed to compute convolutions between relaxation functions and acoustic variables arising in sound propagation equations in porous media. For this purpose, the relaxation functions are approximated in the frequency domain by rational functions. The time variation of the convolution is thus governed by first-order differential equations which can be straightforwardly solved. The accuracy of the method is first investigated and compared to that of recursive convolution methods. It is shown that, while recursive convolution methods are first or second-order accurate in time, the ADE method does not introduce any additional error. The ADE method is then applied for outdoor sound propagation using the equations proposed by Wilson et al. in the ground [(2007). Appl. Acoust. 68, 173-200]. A first one-dimensional case is performed showing that only five poles are necessary to accurately approximate the relaxation functions for typical applications. Finally, the ADE method is used to compute sound propagation in a three-dimensional geometry over an absorbing ground. Results obtained with Wilson's equations are compared to those obtained with Zwikker and Kosten's equations and with an impedance surface for different flow resistivities.
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. PMID:27436996
Multi-fidelity modelling via recursive co-kriging and Gaussian–Markov random fields
Perdikaris, P.; Venturi, D.; Royset, J. O.; Karniadakis, G. E.
2015-01-01
We propose a new framework for design under uncertainty based on stochastic computer simulations and multi-level recursive co-kriging. The proposed methodology simultaneously takes into account multi-fidelity in models, such as direct numerical simulations versus empirical formulae, as well as multi-fidelity in the probability space (e.g. sparse grids versus tensor product multi-element probabilistic collocation). We are able to construct response surfaces of complex dynamical systems by blending multiple information sources via auto-regressive stochastic modelling. A computationally efficient machine learning framework is developed based on multi-level recursive co-kriging with sparse precision matrices of Gaussian–Markov random fields. The effectiveness of the new algorithms is demonstrated in numerical examples involving a prototype problem in risk-averse design, regression of random functions, as well as uncertainty quantification in fluid mechanics involving the evolution of a Burgers equation from a random initial state, and random laminar wakes behind circular cylinders. PMID:26345079
A small-world network derived from the deterministic uniform recursive tree by line graph operation
NASA Astrophysics Data System (ADS)
Hou, Pengfeng; Zhao, Haixing; Mao, Yaping; Wang, Zhao
2016-03-01
The deterministic uniform recursive tree ({DURT}) is one of the deterministic versions of the uniform recursive tree ({URT}). Zhang et al (2008 Eur. Phys. J. B 63 507-13) studied the properties of DURT, including its topological characteristics and spectral properties. Although DURT shows a logarithmic scaling with the size of the network, DURT is not a small-world network since its clustering coefficient is zero. Lu et al (2012 Physica A 391 87-92) proposed a deterministic small-world network by adding some edges with a simple rule in each DURT iteration. In this paper, we intoduce a method for constructing a new deterministic small-world network by the line graph operation in each DURT iteration. The line graph operation brings about cliques at each node of the previous given graph, and the resulting line graph possesses larger clustering coefficients. On the other hand, this operation can decrease the diameter at almost one, then giving the analytic solutions to several topological characteristics of the model proposed. Supported by The Ministry of Science and Technology 973 project (No. 2010C B334708); National Science Foundation of China (Nos. 61164005, 11161037, 11101232, 11461054, 11551001); The Ministry of education scholars and innovation team support plan of Yangtze River (No. IRT1068); Qinghai Province Nature Science Foundation Project (Nos. 2012-Z-943, 2014-ZJ-907).
NASA Astrophysics Data System (ADS)
Zhu, Binqi; Gao, Yesheng; Wang, Kaizhi; Liu, Xingzhao
2016-04-01
A computational method for suppressing clutter and generating clear microwave images of targets is proposed in this paper, which combines synthetic aperture radar (SAR) principles with recursive method and waveform design theory, and it is suitable for SAR for special applications. The nonlinear recursive model is introduced into the SAR operation principle, and the cubature Kalman filter algorithm is used to estimate target and clutter responses in each azimuth position based on their previous states, which are both assumed to be Gaussian distributions. NP criteria-based optimal waveforms are designed repeatedly as the sensor flies along its azimuth path and are used as the transmitting signals. A clutter suppression filter is then designed and added to suppress the clutter response while maintaining most of the target response. Thus, with fewer disturbances from the clutter response, we can generate the SAR image with traditional azimuth matched filters. Our simulations show that the clutter suppression filter significantly reduces the clutter response, and our algorithm greatly improves the SINR of the SAR image based on different clutter suppression filter parameters. As such, this algorithm may be preferable for special target imaging when prior information on the target is available.
Phase Response Design of Recursive All-Pass Digital Filters Using a Modified PSO Algorithm
Chang, Wei-Der
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
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.
Computing Binary Black Hole Initial Data with Discontinuous Galerkin Methods
NASA Astrophysics Data System (ADS)
Vincent, Trevor; Pfeiffer, Harald
2016-03-01
Discontinuous Galerkin (DG) finite element methods have been used to solve hyperbolic PDEs in relativistic simulations and offer advantages over traditional discretization methods. Comparatively little attention has been given towards using the DG method to solve the elliptic PDEs arising from the Einstein initial data equations. We describe how the DG method can be used to create a parallel, adaptive solver for initial data. We discuss the use of our dG code to compute puncture initial data for binary black holes.
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.
Cryptography with DNA binary strands.
Leier, A; Richter, C; Banzhaf, W; Rauhe, H
2000-06-01
Biotechnological methods can be used for cryptography. Here two different cryptographic approaches based on DNA binary strands are shown. The first approach shows how DNA binary strands can be used for steganography, a technique of encryption by information hiding, to provide rapid encryption and decryption. It is shown that DNA steganography based on DNA binary strands is secure under the assumption that an interceptor has the same technological capabilities as sender and receiver of encrypted messages. The second approach shown here is based on steganography and a method of graphical subtraction of binary gel-images. It can be used to constitute a molecular checksum and can be combined with the first approach to support encryption. DNA cryptography might become of practical relevance in the context of labelling organic and inorganic materials with DNA 'barcodes'.
CHAOTIC ZONES AROUND GRAVITATING BINARIES
Shevchenko, Ivan I.
2015-01-20
The extent of the continuous zone of chaotic orbits of a small-mass tertiary around a system of two gravitationally bound primaries of comparable masses (a binary star, a binary black hole, a binary asteroid, etc.) is estimated analytically, as a function of the tertiary's orbital eccentricity. The separatrix map theory is used to demonstrate that the central continuous chaos zone emerges (above a threshold in the primaries' mass ratio) due to overlapping of the orbital resonances corresponding to the integer ratios p:1 between the tertiary and the central binary periods. In this zone, the unlimited chaotic orbital diffusion of the tertiary takes place, up to its ejection from the system. The primaries' mass ratio, above which such a chaotic zone is universally present at all initial eccentricities of the tertiary, is estimated. The diversity of the observed orbital configurations of biplanetary and circumbinary exosystems is shown to be in accord with the existence of the primaries' mass parameter threshold.
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.
Simulating relativistic binaries with Whisky
NASA Astrophysics Data System (ADS)
Baiotti, L.
We report about our first tests and results in simulating the last phase of the coalescence and the merger of binary relativistic stars. The simulations were performed using our code Whisky and mesh refinement through the Carpet driver.
Exoplanets bouncing between binary stars
NASA Astrophysics Data System (ADS)
Moeckel, Nickolas; Veras, Dimitri
2012-05-01
Exoplanetary systems are found not only among single stars, but also among binaries of widely varying parameters. Binaries with separations of 100-1000 au are prevalent in the solar neighbourhood; at these separations, planet formation around a binary member may largely proceed as if around a single star. During the early dynamical evolution of a planetary system, planet-planet scattering can eject planets from a star's grasp. In a binary, the motion of a planet ejected from one star has effectively entered a restricted three-body system consisting of itself and the two stars, and the equations of motion of the three-body problem will apply as long as the ejected planet remains far from the remaining planets. Depending on its energy, escape from the binary as a whole may be impossible or delayed until the three-body approximation breaks down, and further close interactions with its planetary siblings boost its energy when it passes close to its parent star. Until then, this planet may be able to transition from the space around one star to the other, and chaotically 'bounce' back and forth. In this paper, we directly simulate scattering planetary systems that are around one member of a circular binary, and quantify the frequency of bouncing in scattered planets. We find that a great majority (70-85 per cent) of ejected planets will pass at least once through the space of it's host's binary companion, and depending on the binary parameters about 35-75 per cent will begin bouncing. The time spent bouncing is roughly lognormally distributed with a peak at about 104 yr, with only a small percentage bouncing for more than 1 Myr. This process may perturb and possibly incite instability among existing planets around the companion star. In rare cases, the presence of multiple planets orbiting both stars may cause post-bouncing capture or planetary swapping.
The indirect binary n-cube array
NASA Technical Reports Server (NTRS)
Pease, M. C.
1977-01-01
The array is built from a large number (hundreds or thousands) of microprocessors or microcomputers linked through a switching network into an indirect binary n-cube array. Control is two level, the array operating synchronously, or in lock step, at the higher level, and with the broadcast commands being locally interpreted into rewritable microinstruction streams in the microprocessors and in the switch control units. The key to the design is the switching array. By properly programming it, the array can be made into a wide variety of virtual arrays which are well adapted to a wide range of applications. It is believed that the flexibility of the switching array can be used to obtain fault avoidance, which appears necessary in any highly parallel design.
NASA Astrophysics Data System (ADS)
Raia, Federica; Deng, Mario C.
2011-12-01
We discuss Konstantinos Alexakos, Jayson Jones and Victor Rodriguez's hermeneutic study of formation and function of kinship-like relationships among inner city male students of color in a college physics classroom. From our Critical Complexity Science framework we first discuss the reading erlebnisse of students laughing at and with each other as something that immediately captured our attention in being transformative of the classroom. We continue by exploring their classroom and research experience as an emergent structure modifying their collective as well as their individual experiences. As we analyze both the classroom and the research space as a complex system, we reflect on the instructor/students interactions characterized by an asymmetrical "power" relationship. From our analysis we propose to consider the zone of proximal development as the constantly emerging and transforming person experience ( erlebnisse and erfahrung).
ERIC Educational Resources Information Center
Raia, Federica; Deng, Mario C.
2011-01-01
We discuss Konstantinos Alexakos, Jayson Jones and Victor Rodriguez's hermeneutic study of formation and function of kinship-like relationships among inner city male students of color in a college physics classroom. From our Critical Complexity Science framework we first discuss the reading "erlebnisse" of students laughing at and with each other…
NASA Astrophysics Data System (ADS)
Reig, Pablo
2011-03-01
The interest in X/ γ-ray Astronomy has grown enormously in the last decades thanks to the ability to send X-ray space missions above the Earth’s atmosphere. There are more than half a million X-ray sources detected and over a hundred missions (past and currently operational) devoted to the study of cosmic X/ γ rays. With the improved sensibilities of the currently active missions new detections occur almost on a daily basis. Among these, neutron-star X-ray binaries form an important group because they are among the brightest extra-solar objects in the sky and are characterized by dramatic variability in brightness on timescales ranging from milliseconds to months and years. Their main source of power is the gravitational energy released by matter accreted from a companion star and falling onto the neutron star in a relatively close binary system. Neutron-star X-ray binaries divide into high-mass and low-mass systems according to whether the mass of the donor star is above ˜8 or below ˜2 M⊙, respectively. Massive X-ray binaries divide further into supergiant X-ray binaries and Be/X-ray binaries depending on the evolutionary status of the optical companion. Virtually all Be/X-ray binaries show X-ray pulsations. Therefore, these systems can be used as unique natural laboratories to investigate the properties of matter under extreme conditions of gravity and magnetic field. The purpose of this work is to review the observational properties of Be/X-ray binaries. The open questions in Be/X-ray binaries include those related to the Be star companion, that is, the so-called “Be phenomenon”, such as, timescales associated to the formation and dissipation of the equatorial disc, mass-ejection mechanisms, V/ R variability, and rotation rates; those related to the neutron star, such as, mass determination, accretion physics, and spin period evolution; but also, those that result from the interaction of the two constituents, such as, disc truncation and mass
Unsupervised learning of binary vectors
NASA Astrophysics Data System (ADS)
Copelli Lopes da Silva, Mauro
In this thesis, unsupervised learning of binary vectors from data is studied using methods from Statistical Mechanics of disordered systems. In the model, data vectors are distributed according to a single symmetry-breaking direction. The aim of unsupervised learning is to provide a good approximation to this direction. The difference with respect to previous studies is the knowledge that this preferential direction has binary components. It is shown that sampling from the posterior distribution (Gibbs learning) leads, for general smooth distributions, to an exponentially fast approach to perfect learning in the asymptotic limit of large number of examples. If the distribution is non-smooth, then first order phase transitions to perfect learning are expected. In the limit of poor performance, a second order phase transition ("retarded learning") is predicted to occur if the data distribution is not biased. Using concepts from Bayesian inference, the center of mass of the Gibbs ensemble is shown to have maximal average (Bayes-optimal) performance. This upper bound for continuous vectors is extended to a discrete space, resulting in the clipped center of mass of the Gibbs ensemble having maximal average performance among the binary vectors. To calculate the performance of this best binary vector, the geometric properties of the center of mass of binary vectors are studied. The surprising result is found that the center of mass of infinite binary vectors which obey some simple constraints, is again a binary vector. When disorder is taken into account in the calculation, however, a vector with continuous components is obtained. The performance of the best binary vector is calculated and shown to always lie above that of Gibbs learning and below the Bayes-optimal performance. Making use of a variational approach under the replica symmetric ansatz, an optimal potential is constructed in the limits of zero temperature and mutual overlap 1. Minimization of this potential
Planets in Evolved Binary Systems
NASA Astrophysics Data System (ADS)
Perets, Hagai B.
2011-03-01
Exo-planets are typically thought to form in protoplanetary disks left over from protostellar disk of their newly formed host star. However, additional planetary formation and evolution routes may exist in old evolved binary systems. Here we discuss the implications of binary stellar evolution on planetary systems in such environments. In these binary systems stellar evolution could lead to the formation of symbiotic stars, where mass is lost from one star and could be transferred to its binary companion, and may form an accretion disk around it. This raises the possibility that such a disk could provide the necessary environment for the formation of a new, second generation of planets in both circumstellar or circumbinary configurations. Pre-existing first generation planets surviving the post-MS evolution of such systems would be dynamically effected by the mass loss in the systems and may also interact with the newly formed disk. Such planets and/or planetesimals may also serve as seeds for the formation of the second generation planets, and/or interact with them, possibly forming atypical planetary systems. Second generation planetary systems should be typically found in white dwarf binary systems, and may show various observational signatures. Most notably, second generation planets could form in environment which are inaccessible, or less favorable, for first generation planets. The orbital phase space available for the second generation planets could be forbidden (in terms of the system stability) to first generation planets in the pre-evolved progenitor binaries. In addition planets could form in metal poor environments such as globular clusters and/or in double compact object binaries. Observations of exo-planets in such forbidden or unfavorable regions could possibly serve to uniquely identify their second generation character. Finally, we point out a few observed candidate second generation planetary systems, including Gl 86, HD 27442 and all of the
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…
Safe, Mozhgan; Faradmal, Javad
2016-01-01
Background. Breast cancer which is the most common cause of women cancer death has an increasing incidence and mortality rates in Iran. A proper modeling would correctly detect the factors' effect on breast cancer, which may be the basis of health care planning. Therefore, this study aimed to practically develop two recently introduced statistical models in order to compare them as the survival prediction tools for breast cancer patients. Materials and Methods. For this retrospective cohort study, the 18-year follow-up information of 539 breast cancer patients was analyzed by “Parametric Mixture Cure Model” and “Model-Based Recursive Partitioning.” Furthermore, a simulation study was carried out to compare the performance of mentioned models for different situations. Results. “Model-Based Recursive Partitioning” was able to present a better description of dataset and provided a fine separation of individuals with different risk levels. Additionally the results of simulation study confirmed the superiority of this recursive partitioning for nonlinear model structures. Conclusion. “Model-Based Recursive Partitioning” seems to be a potential instrument for processing complex mixture cure models. Therefore, applying this model is recommended for long-term survival patients.
Safe, Mozhgan; Faradmal, Javad
2016-01-01
Background. Breast cancer which is the most common cause of women cancer death has an increasing incidence and mortality rates in Iran. A proper modeling would correctly detect the factors' effect on breast cancer, which may be the basis of health care planning. Therefore, this study aimed to practically develop two recently introduced statistical models in order to compare them as the survival prediction tools for breast cancer patients. Materials and Methods. For this retrospective cohort study, the 18-year follow-up information of 539 breast cancer patients was analyzed by “Parametric Mixture Cure Model” and “Model-Based Recursive Partitioning.” Furthermore, a simulation study was carried out to compare the performance of mentioned models for different situations. Results. “Model-Based Recursive Partitioning” was able to present a better description of dataset and provided a fine separation of individuals with different risk levels. Additionally the results of simulation study confirmed the superiority of this recursive partitioning for nonlinear model structures. Conclusion. “Model-Based Recursive Partitioning” seems to be a potential instrument for processing complex mixture cure models. Therefore, applying this model is recommended for long-term survival patients. PMID:27660647
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…
NASA Astrophysics Data System (ADS)
Igonin, Sergei; Marvan, Michal
2014-11-01
The Darboux-Egoroff system of PDEs with any number n≥3 of independent variables plays an essential role in the problems of describing n-dimensional flat diagonal metrics of Egoroff type and Frobenius manifolds. We construct a recursion operator and its inverse for symmetries of the Darboux-Egoroff system and describe some symmetries generated by these operators. The constructed recursion operators are not pseudodifferential, but are Bäcklund autotransformations for the linearized system whose solutions correspond to symmetries of the Darboux-Egoroff system. For some other PDEs, recursion operators of similar types were considered previously by Papachristou, Guthrie, Marvan, Pobořil, and Sergyeyev. In the structure of the obtained third and fifth order symmetries of the Darboux-Egoroff system, one finds the third and fifth order flows of an (n-1)-component vector modified KdV hierarchy. The constructed recursion operators generate also an infinite number of nonlocal symmetries. In particular, we obtain a simple construction of nonlocal symmetries that were studied by Buryak and Shadrin in the context of the infinitesimal version of the Givental-van de Leur twisted loop group action on the space of semisimple Frobenius manifolds. We obtain these results by means of rather general methods, using only the zero-curvature representation of the considered PDEs.
ERIC Educational Resources Information Center
Cotton, Jeffrey
2010-01-01
Recursive frame analysis (RFA) was used to conduct a single case investigation of Insoo Kim Berg's question utilization talk in a solution-focused brief therapy (SFBT) session. Due to the lack of process research that explores how SFBT questions facilitate change, the author investigated how Berg's solution language influenced a client to respond…
ERIC Educational Resources Information Center
Gruenewald, Tara L.; Mroczek, Daniel K.; Ryff, Carol D.; Singer, Burton H.
2008-01-01
Recursive partitioning is an analytic technique that is useful for identifying complex combinations of conditions that predict particular outcomes as well as for delineating multiple subgroup differences in how such factors work together. As such, the methodology is well suited to multidisciplinary, life course inquiry in which the goal is to…
On the Shock-Response-Spectrum Recursive Algorithm of Kelly and Richman
NASA Technical Reports Server (NTRS)
Martin, Justin N.; Sinclair, Andrew J.; Foster, Winfred A.
2010-01-01
The monograph Principles and Techniques of Shock Data Analysis written by Kelly and Richman in 1969 has become a seminal reference on the shock response spectrum (SRS) [1]. Because of its clear physical descriptions and mathematical presentation of the SRS, it has been cited in multiple handbooks on the subject [2, 3] and research articles [4 10]. Because of continued interest, two additional versions of the monograph have been published: a second edition by Scavuzzo and Pusey in 1996 [11] and a reprint of the original edition in 2008 [12]. The main purpose of this note is to correct several typographical errors in the manuscript's presentation of a recursive algorithm for SRS calculations. These errors are consistent across all three editions of the monograph. The secondary purpose of this note is to present a Matlab implementation of the corrected algorithm.
Management of Large-Scale Wireless Sensor Networks Utilizing Multi-Parent Recursive Area Hierarchies
Cree, Johnathan V.; Delgado-Frias, Jose
2013-04-19
Autonomously configuring and self-healing a largescale wireless sensor network requires a light-weight maintenance protocol that is scalable. Further, in a battery powered wireless sensor network duty-cycling a node’s radio can reduce the power consumption of a device and extend the lifetime of a network. With duty-cycled nodes the power consumption of a node’s radio depends on the amount of communication is must perform and by reducing the communication the power consumption can also be reduced. Multi-parent hierarchies can be used to reduce the communication cost when constructing a recursive area clustering hierarchy when compared to singleparent solutions that utilize inefficient communication methods such as flooding and information propagation via single-hop broadcasts. The multi-parent hierarchies remain scalable and provides a level of redundancy for the hierarchy.
NASA Astrophysics Data System (ADS)
Ding, Derui; Shen, Yuxuan; Song, Yan; Wang, Yongxiong
2016-07-01
This paper is concerned with the state estimation problem for a class of discrete time-varying stochastic nonlinear systems with randomly occurring deception attacks. The stochastic nonlinearity described by statistical means which covers several classes of well-studied nonlinearities as special cases is taken into discussion. The randomly occurring deception attacks are modelled by a set of random variables obeying Bernoulli distributions with given probabilities. The purpose of the addressed state estimation problem is to design an estimator with hope to minimize the upper bound for estimation error covariance at each sampling instant. Such an upper bound is minimized by properly designing the estimator gain. The proposed estimation scheme in the form of two Riccati-like difference equations is of a recursive form. Finally, a simulation example is exploited to demonstrate the effectiveness of the proposed scheme.
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.
Ndoye, Mandoye; Barker, Alan M; Krogmeier, James; Bullock, Darcy
2011-01-01
A signal processing approach is proposed to jointly filter and fuse spatially indexed measurements captured from many vehicles. It is assumed that these measurements are influenced by both sensor noise and measurement indexing uncertainties. Measurements from low-cost vehicle-mounted sensors (e.g., accelerometers and Global Positioning System (GPS) receivers) are properly combined to produce higher quality road roughness data for cost-effective road surface condition monitoring. The proposed algorithms are recursively implemented and thus require only moderate computational power and memory space. These algorithms are important for future road management systems, which will use on-road vehicles as a distributed network of sensing probes gathering spatially indexed measurements for condition monitoring, in addition to other applications, such as environmental sensing and/or traffic monitoring. Our method and the related signal processing algorithms have been successfully tested using field data.
Solution of the antiferromagnetic Ising model on a tetrahedron recursive lattice.
Jurčišinová, E; Jurčišin, M
2014-03-01
We consider the antiferromagnetic spin-1/2 Ising model on the recursive tetrahedron lattice on which two elementary tetrahedrons are connected at each site. The model represents the simplest approximation of the antiferromagnetic Ising model on the real three-dimensional tetrahedron lattice which takes into account effects of frustration. An exact analytical solution of the model is found and discussed. It is shown that the model exhibits neither the first-order nor the second-order phase transitions. A detailed analysis of the magnetization of the model in the presence of the external magnetic field is performed and the existence of the magnetization plateaus for low temperatures is shown. All possible ground states of the model are found and discussed. The existence of nontrivial singular ground states is proven and exact explicit expressions for them are found.
Towards Interactive Construction of Topical Hierarchy: A Recursive Tensor Decomposition Approach
Wang, Chi; Liu, Xueqing; Song, Yanglei; Han, Jiawei
2015-01-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. PMID:26705505
Cloud Computing Application for Hotspot Clustering Using Recursive Density Based Clustering (RDBC)
NASA Astrophysics Data System (ADS)
Santoso, Aries; Khiyarin Nisa, Karlina
2016-01-01
Indonesia has vast areas of tropical forest, but are often burned which causes extensive damage to property and human life. Monitoring hotspots can be one of the forest fire management. Each hotspot is recorded in dataset so that it can be processed and analyzed. This research aims to build a cloud computing application which visualizes hotspots clustering. This application uses the R programming language with Shiny web framework and implements Recursive Density Based Clustering (RDBC) algorithm. Clustering is done on hotspot dataset of the Kalimantan Island and South Sumatra Province to find the spread pattern of hotspots. The clustering results are evaluated using the Silhouette's Coefficient (SC) which yield best value 0.3220798 for Kalimantan dataset. Clustering pattern are displayed in the form of web pages so that it can be widely accessed and become the reference for fire occurrence prediction.
Weak coupling expansion of Yang-Mills theory on recursive infinite genus surfaces
NASA Astrophysics Data System (ADS)
Ghoshal, Debashis; Imbimbo, Camillo; Kumar, Dushyant
2014-10-01
We analyze the partition function of two dimensional Yang-Mills theory on a family of surfaces of infinite genus. These surfaces have a recursive structure, which was used by one of us to compute the partition function that results in a generalized Migdal formula. In this paper we study the `small area' (weak coupling) expansion of the partition function, by exploiting the fact that the generalized Migdal formula is analytic in the (complexification of the) Euler characteristic. The structure of the perturbative part of the weak coupling expansion suggests that the moduli space of flat connections (of the SU(2) and SO(3) theories) on these infinite genus surfaces are well defined, perhaps in an appropriate regularization.
NASA Technical Reports Server (NTRS)
Tilton, James C.; Plaza, Antonio J. (Editor); Chang, Chein-I. (Editor)
2008-01-01
The hierarchical image segmentation algorithm (referred to as HSEG) is a hybrid of hierarchical step-wise optimization (HSWO) and constrained spectral clustering that produces a hierarchical set of image segmentations. HSWO is an iterative approach to region grooving segmentation in which the optimal image segmentation is found at N(sub R) regions, given a segmentation at N(sub R+1) regions. HSEG's addition of constrained spectral clustering makes it a computationally intensive algorithm, for all but, the smallest of images. To counteract this, a computationally efficient recursive approximation of HSEG (called RHSEG) has been devised. Further improvements in processing speed are obtained through a parallel implementation of RHSEG. This chapter describes this parallel implementation and demonstrates its computational efficiency on a Landsat Thematic Mapper test scene.
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.
NASA Astrophysics Data System (ADS)
Amirouche, F. M. L.; Xie, M.
1993-01-01
The dynamic simulation of complex rigid/flexible multibody systems relies greatly on the presentation and development of the equations of motion. To achieve computational speed in the execution and to further develop the control algorithms, the expressions involved in the kinematics and the subsequent coefficients associated with the equations of motion must be clearly defined. The intention of this paper is to develop a recursive formulation based on finite element method where all terms are presented in a matrix form. The methodology permits one to identify the coupling between rigid and flexible body motion, and build the necessary arrays for the application at hand. The equations of motion are based on Kane's equation and the general matrix representation for n bodies of its partial velocities and partial angular velocities. The algorithm developed is applied to a single two-link robot manipulator and the subsequent explicit equations of motion are presented.
System Simulation by Recursive Feedback: Coupling a Set of Stand-Alone Subsystem Simulations
NASA Technical Reports Server (NTRS)
Nixon, D. D.
2001-01-01
Conventional construction of digital dynamic system simulations often involves collecting differential equations that model each subsystem, arran g them to a standard form, and obtaining their numerical gin solution as a single coupled, total-system simultaneous set. Simulation by numerical coupling of independent stand-alone subsimulations is a fundamentally different approach that is attractive because, among other things, the architecture naturally facilitates high fidelity, broad scope, and discipline independence. Recursive feedback is defined and discussed as a candidate approach to multidiscipline dynamic system simulation by numerical coupling of self-contained, single-discipline subsystem simulations. A satellite motion example containing three subsystems (orbit dynamics, attitude dynamics, and aerodynamics) has been defined and constructed using this approach. Conventional solution methods are used in the subsystem simulations. Distributed and centralized implementations of coupling have been considered. Numerical results are evaluated by direct comparison with a standard total-system, simultaneous-solution approach.
Topological recursion for chord diagrams, RNA complexes, and cells in moduli spaces
NASA Astrophysics Data System (ADS)
Andersen, Jørgen E.; Chekhov, Leonid O.; Penner, R. C.; Reidys, Christian M.; Sułkowski, Piotr
2013-01-01
We introduce and study the Hermitian matrix model with potential V(x)=x2/2-stx/(1-tx), which enumerates the number of linear chord diagrams with no isolated vertices of fixed genus with specified numbers of backbones generated by s and chords generated by t. For the one-cut solution, the partition function, correlators and free energies are convergent for small t and all s as a perturbation of the Gaussian potential, which arises for st=0. This perturbation is computed using the formalism of the topological recursion. The corresponding enumeration of chord diagrams gives at once the number of RNA complexes of a given topology as well as the number of cells in Riemann's moduli spaces for bordered surfaces. The free energies are computed here in principle for all genera and explicitly in genus less than four.
Recursive method to obtain the parametric representation of a generic Feynman diagram
Gonzalez, Ivan; Schmidt, Ivan
2005-11-15
A recursive algebraic method which allows one to obtain the Feynman or Schwinger parametric representation of a generic L-loops and (E+1) external lines diagram, in a scalar {phi}{sup 3}+{phi}{sup 4} theory, is presented. The representation is obtained starting from an initial parameters matrix, which relates the scalar products between internal and external momenta, and which appears directly when this parametrization is applied to the momentum space representation of the graph. The final product is an algebraic formula that shows explicitly the external momenta dependence and also an algorithm that can be easily programmed, either in a computer programming language (C/C++, Fortran, ...) or in a symbolic calculation package (Maple, Mathematica, ...)
Laplacian spectrum of a family of recursive trees and its applications in network coherence
NASA Astrophysics Data System (ADS)
Sun, Weigang; Xuan, Tengfei; Qin, Sen
2016-06-01
Many of the topological and dynamical properties of a network are related to its Laplacian spectrum; these properties include network diameter, Kirchhoff index, and mean first-passage time. This paper investigates consensus dynamics in a linear dynamical system with additive stochastic disturbances, which is characterized as network coherence by the Laplacian spectrum. We choose a family of uniform recursive trees as our model, and propose a method to calculate the first- and second-order network coherence. Using the tree structures, we identify a relationship between the Laplacian matrix and Laplacian eigenvalues. We then derive the exact solutions for the reciprocals and square reciprocals of all nonzero Laplacian eigenvalues. We also obtain the scalings of network coherence with network size. The scalings of network coherence of the studied trees are smaller than those of Vicsek fractals and are not related to its fractal dimension.
Recursive multiport schemes for implementing quantum algorithms with photonic integrated circuits
NASA Astrophysics Data System (ADS)
Tabia, Gelo Noel M.
2016-01-01
We present recursive multiport schemes for implementing quantum Fourier transforms and the inversion step in Grover's algorithm on an integrated linear optics device. In particular, each scheme shows how to execute a quantum operation on 2 d modes using a pair of circuits for the same operation on d modes. The circuits operate on path-encoded qudits and realize d -dimensional unitary transformations on these states using linear optical networks with O (d2) optical elements. To evaluate the schemes against realistic errors, we ran simulations of proof-of-principle experiments using a simple fabrication model of silicon-based photonic integrated devices that employ directional couplers and thermo-optic modulators for beam splitters and phase shifters, respectively. We find that high-fidelity performance is achievable with our multiport circuits for 2-qubit and 3-qubit quantum Fourier transforms, and for quantum search on four-item and eight-item databases.
Spatial join optimization among WFSs based on recursive partitioning and filtering rate estimation
NASA Astrophysics Data System (ADS)
Lan, Guiwen; Wu, Congcong; Shi, Guangyi; Chen, Qi; Yang, Zhao
2015-12-01
Spatial join among Web Feature Services (WFS) is time-consuming for most of non-candidate spatial objects may be encoded by GML and transferred to client side. In this paper, an optimization strategy is proposed to enhance performance of these joins by filtering non-candidate spatial objects as many as possible. By recursive partitioning, the data skew of sub-areas is facilitated to reduce data transmission using spatial semi-join. Moreover filtering rate is used to determine whether a spatial semi-join for a sub-area is profitable and choose a suitable execution plan for it. The experimental results show that the proposed strategy is feasible under most circumstances.
Parallel 2D and 3D Prestack Depth Migration Using Recursive Kirchhoff Wavefield Extrapolation
NASA Astrophysics Data System (ADS)
Geiger, H. D.; Margrave, G. F.; Liu, K.
2004-05-01
Recursive Kirchhoff wavefield extrapolation in the space-frequency domain can be thought of as a simple convolutional filter that calculates a single output point at depth z+dz using a weighted summation of all input points within the extrapolator aperture at depth z. The desired velocity values for the extrapolator are the ones that provide the best approximation of the true phase (propagation time) of the seismic wavefield between the input points and the output point. Recursive Kirchhoff extrapolators can be designed to handle lateral variations in velocity in a number of ways: a PSPI-type (phase shift plus interpolation) extrapolator uses only the velocity at the output point, a NSPS-type (nonstationary phase shift) extrapolator uses the velocities at the input points; a SNPS-type (symmetric nonstationary phase shift) extrapolator incorporates two extrapolation steps of dz/2 where the first step uses the velocities at the input points (NSPS-type) and the second step uses the velocity at the output point (PSPI-type); while the Weyl-type extrapolator uses an average of the velocities between each input point and the output point. Here, we introduce the PAVG-type (slowness averaged) extrapolator, which uses velocity values calculated by an average of slowness along straight raypaths between each input point and the output point. Parallel 2D and 3D prestack depth migration algorithms have been coded in both MATLAB and C and tested on a small Linux cluster. A simple synthetic with a lateral step in velocity shows that the PAVG Kirchhoff extrapolator is very close to the exact desired response. Tests using the 2D Marmousi synthetic data set suggest that the extrapolator behaviour is only one of many considerations that must be addressed for accurate depth imaging. Other important considerations include preprocessing, aperture size, taper width, extrapolator stability, and imaging condition.
Recursive adjustment approach for the inversion of the Euler-Liouville Equation
NASA Astrophysics Data System (ADS)
Kirschner, S.; Seitz, F.
2012-04-01
Earth rotation is physically described by the Euler-Liouville Equation that is based on the balance of angular momentum in the Earth system. The Earth orientation parameters (EOP), polar motion and length of day, are highly precise observed by geodetic methods over many decades. A sensitivity analysis showed that some weakly determined Earth parameters have a great influence on the numerical forward modeling of the EOP. Therefore we concentrate on the inversion of the Euler-Liouville Equation in order to estimate and improve such parameters. A recursive adjustment approach allows the inversion of the Euler-Liouville Equation to be efficient. Here we concentrate on the estimation of parameters related to period and damping of the free rotation of the Earth (Chandler oscillation). Before we apply the approach to the complex Earth system we demonstrate its concept on the simplified example of a spring mass damper system. The spring mass damper system is analogous to the damped Chandler oscillation and the results can directly be transferred. Also the differential equation describing the motion of the spring has the same structure as the Euler-Liouville Equation. Spring constant and damping coefficient describing the anelastic behavior of the system correspond to real and imaginary part of the Earth's pole tide Love number. Therefore the simplified model is ideal for studying various aspects, e.g. the influences of sampling rate, overall time frame, and the number of observations on the numerical results. It is shown that the recursive adjustment approach is an adequate method for the estimation of the spring parameters and therewith for the parameters describing the Earth's rheology. The study is carried out in the frame of the German research unit on Earth Rotation and Global Dynamic Processes.
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.
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.
Adaptive control of Hammerstein-Wiener nonlinear systems
NASA Astrophysics Data System (ADS)
Zhang, Bi; Hong, Hyokchan; Mao, Zhizhong
2016-07-01
The Hammerstein-Wiener model is a block-oriented model, having a linear dynamic block sandwiched by two static nonlinear blocks. This note develops an adaptive controller for a special form of Hammerstein-Wiener nonlinear systems which are parameterized by the key-term separation principle. The adaptive control law and recursive parameter estimation are updated by the use of internal variable estimations. By modeling the errors due to the estimation of internal variables, we establish convergence and stability properties. Theoretical results show that parameter estimation convergence and closed-loop system stability can be guaranteed under sufficient condition. From a qualitative analysis of the sufficient condition, we introduce an adaptive weighted factor to improve the performance of the adaptive controller. Numerical examples are given to confirm the results in this paper.
Adaptive management is an approach to natural resource management that emphasizes learning through management where knowledge is incomplete, and when, despite inherent uncertainty, managers and policymakers must act. Unlike a traditional trial and error approach, adaptive managem...
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.
Testing Atmosphere and Evolution Models with Brown Dwarf Binaries
NASA Astrophysics Data System (ADS)
Barman, Travis S.; Konopacky, Q. M.; Ghez, A. M.
2013-01-01
Precise dynamical masses are available for many brown dwarf binaries, covering late-M, L and T spectral types. With known masses and equal ages within a binary, the range of predicted luminosity, effective temperature, and surface gravity of each dwarf narrows significantly providing important tests for interior and evolution models. Furthermore, the consistency between the basic properties inferred from evolutionary cooling tracks and those inferred only from atmosphere model comparisons is best tested with brown dwarf binaries. Our recent Hubble Space Telescope program extends the spatially resolved photometric coverage of 11 binaries (all with dynamical masses measured to a precision of 10%, or better) into the optical, allowing precise effective temperatures and bolometric luminosities to be determined. By comparing these new data to models, limits are placed on the brown dwarf cooling evolution across a range of masses. In addition to photometry, ground-based spatially resolved near-IR spectroscopy (obtained with the laser guide star adaptive optics system on the W.M. Keck II telescope and the NIRSPAO spectrograph) is used to estimate surface gravities and further constrain the effective temperatures for a few systems.
Gravitational radiation from compact binaries in scalar-tensor gravity
NASA Astrophysics Data System (ADS)
Lang, R. N.
2015-05-01
General relativity (GR) has been extensively tested in the solar system and in binary pulsars, but never in the strong-field, dynamical regime. Soon, gravitational-wave (GW) detectors like Advanced LIGO and eLISA will be able to probe this regime by measuring GWs from inspiraling and merging compact binaries. One particularly interesting alternative to GR is scalar-tensor gravity. We present progress in the calculation of second post-Newtonian (2PN) gravitational waveforms for inspiraling compact binaries in a general class of scalar- tensor theories. The waveforms are constructed using a standard GR method known as “direct integration of the relaxed Einstein equations,” appropriately adapted to the scalar-tensor case. We find that differences from general relativity can be characterized by a reasonably small number of parameters. Among the differences are new hereditary terms which depend on the past history of the source. In one special case, binary black hole systems, we find that the waveform is indistinguishable from that of general relativity. In another, mixed black hole- neutron star systems, all differences from GR can be characterized by only a single parameter.
Gravitational radiation from compact binaries in scalar-tensor gravity
NASA Astrophysics Data System (ADS)
Lang, Ryan
2014-03-01
General relativity (GR) has been extensively tested in the solar system and in binary pulsars, but never in the strong-field, dynamical regime. Soon, gravitational-wave (GW) detectors like Advanced LIGO will be able to probe this regime by measuring GWs from inspiraling and merging compact binaries. One particularly interesting alternative to GR is scalar-tensor gravity. We present the calculation of second post-Newtonian (2PN) gravitational waveforms for inspiraling compact binaries in a general class of scalar-tensor theories. The waveforms are constructed using a standard GR method known as ``Direct Integration of the Relaxed Einstein equations,'' appropriately adapted to the scalar-tensor case. We find that differences from general relativity can be characterized by a reasonably small number of parameters. Among the differences are new hereditary terms which depend on the past history of the source. In one special case, mixed black hole-neutron star systems, all differences from GR can be characterized by only a single parameter. In another, binary black hole systems, we find that the waveform is indistinguishable from that of general relativity.
Experience with parametric binary dissection
NASA Technical Reports Server (NTRS)
Bokhari, Shahid H.
1993-01-01
Parametric Binary Dissection (PBD) is a new algorithm that can be used for partitioning graphs embedded in 2- or 3-dimensional space. It partitions explicitly on the basis of nodes + (lambda)x(edges cut), where lambda is the ratio of time to communicate over an edge to the time to compute at a node. The new algorithm is faster than the original binary dissection algorithm and attempts to obtain better partitions than the older algorithm, which only takes nodes into account. The performance of parametric dissection with plain binary dissection on 3 large unstructured 3-d meshes obtained from computational fluid dynamics and on 2 random graphs were compared. It was showm that the new algorithm can usually yield partitions that are substantially superior, but that its performance is heavily dependent on the input data.
Shipton, C; Clarkson, C; Pal, J N; Jones, S C; Roberts, R G; Harris, C; Gupta, M C; Ditchfield, P W; Petraglia, M D
2013-08-01
The Acheulean to Middle Palaeolithic transition is one of the most important technological changes that occurs over the course of human evolution. Here we examine stone artefact assemblages from Patpara and two other excavated sites in the Middle Son Valley, India, which show a mosaic of attributes associated with Acheulean and Middle Palaeolithic industries. The bifaces from these sites are very refined and generally small, but also highly variable in size. A strong relationship between flake scar density and biface size indicates extensive differential resharpening. There are relatively low proportions of bifaces at these sites, with more emphasis on small flake tools struck from recurrent Levallois cores. The eventual demise of large bifaces may be attributed to the curation of small prepared cores from which sharper, or more task-specific flakes were struck. Levallois technology appears to have arisen out of adapting aspects of handaxe knapping, including shaping of surfaces, the utilization of two inter-dependent surfaces, and the striking of invasive thinning flakes. The generativity, hierarchical organization of action, and recursion evident in recurrent Levallois technology may be attributed to improvements in working memory.
Arbitrary-level hanging nodes for adaptive hphp-FEM approximations in 3D
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.
Mental Effort in Binary Categorization Aided by Binary Cues
ERIC Educational Resources Information Center
Botzer, Assaf; Meyer, Joachim; Parmet, Yisrael
2013-01-01
Binary cueing systems assist in many tasks, often alerting people about potential hazards (such as alarms and alerts). We investigate whether cues, besides possibly improving decision accuracy, also affect the effort users invest in tasks and whether the required effort in tasks affects the responses to cues. We developed a novel experimental tool…
Terziev, Emil; Law, Nicholas M.; Arcavi, Iair; Baranec, Christoph; Bui, Khanh; Dekany, Richard G.; Kulkarni, S. R.; Riddle, Reed; Tendulkar, Shriharsh P.; Bloom, Joshua S.; Burse, Mahesh P.; Chorida, Pravin; Das, H. K.; Punnadi, Sujit; Ramaprakash, A. N.; Kraus, Adam L.; Nugent, Peter; Ofek, Eran O.; Sullivan, Mark
2013-06-01
The direct detection of binary systems in wide-field surveys is limited by the size of the stars' point-spread functions (PSFs). A search for elongated objects can find closer companions, but is limited by the precision to which the PSF shape can be calibrated for individual stars. Based on a technique from weak-lensing analysis, we have developed the BinaryFinder algorithm to search for close binaries by using precision measurements of PSF ellipticity across wide-field survey images. We show that the algorithm is capable of reliably detecting binary systems down to Almost-Equal-To 1/5 of the seeing limit, and can directly measure the systems' position angles, separations, and contrast ratios. To verify the algorithm's performance we evaluated 100,000 objects in Palomar Transient Factory (PTF) wide-field-survey data for signs of binarity, and then used the Robo-AO robotic laser adaptive optics system to verify the parameters of 44 high-confidence targets. We show that BinaryFinder correctly predicts the presence of close companions with a <11% false-positive rate, measures the detected binaries' position angles within 1 Degree-Sign to 4 Degree-Sign (depending on signal-to-noise ratio and separation), and separations within 25%, and weakly constrains their contrast ratios. When applied to the full PTF data set, we estimate that BinaryFinder will discover and characterize {approx}450,000 physically associated binary systems with separations <2 arcsec and magnitudes brighter than m{sub R} = 18. New wide-field synoptic surveys with high sensitivity and sub-arcsecond angular resolution, such as LSST, will allow BinaryFinder to reliably detect millions of very faint binary systems with separations as small as 0.1 arcsec.
NASA Astrophysics Data System (ADS)
Terziev, Emil; Law, Nicholas M.; Arcavi, Iair; Baranec, Christoph; Bloom, Joshua S.; Bui, Khanh; Burse, Mahesh P.; Chorida, Pravin; Das, H. K.; Dekany, Richard G.; Kraus, Adam L.; Kulkarni, S. R.; Nugent, Peter; Ofek, Eran O.; Punnadi, Sujit; Ramaprakash, A. N.; Riddle, Reed; Sullivan, Mark; Tendulkar, Shriharsh P.
2013-06-01
The direct detection of binary systems in wide-field surveys is limited by the size of the stars' point-spread functions (PSFs). A search for elongated objects can find closer companions, but is limited by the precision to which the PSF shape can be calibrated for individual stars. Based on a technique from weak-lensing analysis, we have developed the BinaryFinder algorithm to search for close binaries by using precision measurements of PSF ellipticity across wide-field survey images. We show that the algorithm is capable of reliably detecting binary systems down to ≈1/5 of the seeing limit, and can directly measure the systems' position angles, separations, and contrast ratios. To verify the algorithm's performance we evaluated 100,000 objects in Palomar Transient Factory (PTF) wide-field-survey data for signs of binarity, and then used the Robo-AO robotic laser adaptive optics system to verify the parameters of 44 high-confidence targets. We show that BinaryFinder correctly predicts the presence of close companions with a <11% false-positive rate, measures the detected binaries' position angles within 1° to 4° (depending on signal-to-noise ratio and separation), and separations within 25%, and weakly constrains their contrast ratios. When applied to the full PTF data set, we estimate that BinaryFinder will discover and characterize ~450,000 physically associated binary systems with separations <2 arcsec and magnitudes brighter than mR = 18. New wide-field synoptic surveys with high sensitivity and sub-arcsecond angular resolution, such as LSST, will allow BinaryFinder to reliably detect millions of very faint binary systems with separations as small as 0.1 arcsec.
BINARY YORP EFFECT AND EVOLUTION OF BINARY ASTEROIDS
Steinberg, Elad; Sari, Re'em
2011-02-15
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 {approx}10{sup 4}-10{sup 5} years for a D{sub p} = 2 km primary with a D{sub s} = 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{sub 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.
Hunt, R.L.
1983-12-27
An adapter is disclosed for use with a fireplace. The stove pipe of a stove standing in a room to be heated may be connected to the flue of the chimney so that products of combustion from the stove may be safely exhausted through the flue and outwardly of the chimney. The adapter may be easily installed within the fireplace by removing the damper plate and fitting the adapter to the damper frame. Each of a pair of bolts has a portion which hooks over a portion of the damper frame and a threaded end depending from the hook portion and extending through a hole in the adapter. Nuts are threaded on the bolts and are adapted to force the adapter into a tight fit with the adapter frame.
KEPLER ECLIPSING BINARIES WITH STELLAR COMPANIONS
Gies, D. R.; Matson, R. A.; Guo, Z.; Lester, K. V.; Orosz, J. A.; Peters, G. J. E-mail: rmatson@chara.gsu.edu E-mail: lester@chara.gsu.edu E-mail: gjpeters@mucen.usc.edu
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 among 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.
Observational Properties of Synthetic Visual Binary Catalog
NASA Astrophysics Data System (ADS)
Nurmi, P.
2004-08-01
Forthcoming astrometric missions will observe a huge number of new binaries from which a large fraction will be visual binaries. Detailed planning of optimal detection procedures requires pre-launch information about the observational properties of expected visual binaries. Hence, a synthetic binary catalog is created and analyzed for observational properties of visual binary stars. These results help to understand what kind of binaries we expect to find in the final output catalogs of astrometric missions. These results represent `true' binary distributions if all of them would be observed. All real observational projects or astrometric satellites sample only small fractions of these populations depending on the observational capabilities of the missions. In this study we consider only relative numbers with respect to the total number of binary stars assumed to exist in the sky down to the magnitude limit depending on the astrometric mission.
Blind binary masking for reverberation suppression in cochlear implants.
Hazrati, Oldooz; Lee, Jaewook; Loizou, Philipos C
2013-03-01
A monaural binary time-frequency (T-F) masking technique is proposed for suppressing reverberation. The mask is estimated for each T-F unit by extracting a variance-based feature from the reverberant signal and comparing it against an adaptive threshold. Performance of the estimated binary mask is evaluated in three moderate to relatively high reverberant conditions (T60 = 0.3, 0.6, and 0.8 s) using intelligibility listening tests with cochlear implant users. Results indicate that the proposed T-F masking technique yields significant improvements in intelligibility of reverberant speech even in relatively high reverberant conditions (T60 = 0.8 s). The improvement is hypothesized to result from the recovery of the vowel/consonant boundaries, which are severely smeared in reverberation. PMID:23464030
A Galactic Binary Detection Pipeline
NASA Technical Reports Server (NTRS)
Littenberg, Tyson B.
2011-01-01
The Galaxy is suspected to contain hundreds of millions of binary white dwarf systems, a large fraction of which will have sufficiently small orbital period to emit gravitational radiation in band for space-based gravitational wave detectors such as the Laser Interferometer Space Antenna (LISA). LISA's main science goal is the detection of cosmological events (supermassive black hole mergers, etc.) however the gravitational signal from the galaxy will be the dominant contribution to the data - including instrumental noise over approximately two decades in frequency. The catalogue of detectable binary systems will serve as an unparalleled means of studying the Galaxy. Furthermore, to maximize the scientific return from the mission, the data must be "cleansed" of the galactic foreground. We will present an algorithm that can accurately resolve and subtract 2:: 10000 of these sources from simulated data supplied by the Mock LISA Data Challenge Task Force. Using the time evolution of the gravitational wave frequency, we will reconstruct the position of the recovered binaries and show how LISA will sample the entire compact binary population in the Galaxy.
Discs in misaligned binary systems
NASA Astrophysics Data System (ADS)
Rawiraswattana, Krisada; Hubber, David A.; Goodwin, Simon P.
2016-08-01
We perform SPH simulations to study precession and changes in alignment between the circumprimary disc and the binary orbit in misaligned binary systems. We find that the precession process can be described by the rigid-disc approximation, where the disc is considered as a rigid body interacting with the binary companion only gravitationally. Precession also causes change in alignment between the rotational axis of the disc and the spin axis of the primary star. This type of alignment is of great important for explaining the origin of spin-orbit misaligned planetary systems. However, we find that the rigid-disc approximation fails to describe changes in alignment between the disc and the binary orbit. This is because the alignment process is a consequence of interactions that involve the fluidity of the disc, such as the tidal interaction and the encounter interaction. Furthermore, simulation results show that there are not only alignment processes, which bring the components towards alignment, but also anti-alignment processes, which tend to misalign the components. The alignment process dominates in systems with misalignment angle near 90°, while the anti-alignment process dominates in systems with the misalignment angle near 0° or 180°. This means that highly misaligned systems will become more aligned but slightly misaligned systems will become more misaligned.
Hydrodynamic Simulations of Contact Binaries
NASA Astrophysics Data System (ADS)
Kadam, Kundan; Clayton, Geoffrey C.; Frank, Juhan; Marcello, Dominic; Motl, Patrick M.; Staff, Jan E.
2015-01-01
The motivation for our project is the peculiar case of the 'red nova" V1309 Sco which erupted in September 2008. The progenitor was, in fact, a contact binary system. We are developing a simulation of contact binaries, so that their formation, structural, and merger properties could be studied using hydrodynamics codes. The observed transient event was the disruption of the secondary star by the primary, and their subsequent merger into one star; hence to replicate this behavior, we need a core-envelope structure for both the stars. We achieve this using a combination of Self Consistant Field (SCF) technique and composite polytropes, also known as bipolytropes. So far we have been able to generate close binaries with various mass ratios. Another consequence of using bipolytropes is that according to theoretical calculations, the radius of a star should expand when the core mass fraction exceeds a critical value, resulting in interesting consequences in a binary system. We present some initial results of these simulations.
Generating Constant Weight Binary Codes
ERIC Educational Resources Information Center
Knight, D.G.
2008-01-01
The determination of bounds for A(n, d, w), the maximum possible number of binary vectors of length n, weight w, and pairwise Hamming distance no less than d, is a classic problem in coding theory. Such sets of vectors have many applications. A description is given of how the problem can be used in a first-year undergraduate computational…
Recursive Ant Colony Global Optimization: a new technique for the inversion of geophysical data
NASA Astrophysics Data System (ADS)
Gupta, D. K.; Gupta, J. P.; Arora, Y.; Singh, U. K.
2011-12-01
We present a new method called Recursive Ant Colony Global Optimization (RACO) technique, a modified form of general ACO, which can be used to find the best solutions to inversion problems in geophysics. RACO simulates the social behaviour of ants to find the best path between the nest and the food source. A new term depth has been introduced, which controls the extent of recursion. A selective number of cities get qualified for the successive depth. The results of one depth are used to construct the models for the next depth and the range of values for each of the parameters is reduced without any change to the number of models. The three additional steps performed after each depth, are the pheromone tracking, pheromone updating and city selection. One of the advantages of RACO over ACO is that if a problem has multiple solutions, then pheromone accumulation will take place at more than one city thereby leading to formation of multiple nested ACO loops within the ACO loop of the previous depth. Also, while the convergence of ACO is almost linear, RACO shows exponential convergence and hence is faster than the ACO. RACO proves better over some other global optimization techniques, as it does not require any initial values to be assigned to the parameters function. The method has been tested on some mathematical functions, synthetic self-potential (SP) and synthetic gravity data. The obtained results reveal the efficiency and practicability of the method. The method is found to be efficient enough to solve the problems of SP and gravity anomalies due to a horizontal cylinder, a sphere, an inclined sheet and multiple idealized bodies buried inside the earth. These anomalies with and without noise were inverted using the RACO algorithm. The obtained results were compared with those obtained from the conventional methods and it was found that RACO results are more accurate. Finally this optimization technique was applied to real field data collected over the Surda
Adaptive modelling of structured molecular representations for toxicity prediction
NASA Astrophysics Data System (ADS)
Bertinetto, Carlo; Duce, Celia; Micheli, Alessio; Solaro, Roberto; Tiné, Maria Rosaria
2012-12-01
We investigated the possibility of modelling structure-toxicity relationships by direct treatment of the molecular structure (without using descriptors) through an adaptive model able to retain the appropriate structural information. With respect to traditional descriptor-based approaches, this provides a more general and flexible way to tackle prediction problems that is particularly suitable when little or no background knowledge is available. Our method employs a tree-structured molecular representation, which is processed by a recursive neural network (RNN). To explore the realization of RNN modelling in toxicological problems, we employed a data set containing growth impairment concentrations (IGC50) for Tetrahymena pyriformis.
Adaptive multiclass classification for brain computer interfaces.
Llera, A; Gómez, V; Kappen, H J
2014-06-01
We consider the problem of multiclass adaptive classification for brain-computer interfaces and propose the use of multiclass pooled mean linear discriminant analysis (MPMLDA), a multiclass generalization of the adaptation rule introduced by Vidaurre, Kawanabe, von Bünau, Blankertz, and Müller (2010) for the binary class setting. Using publicly available EEG data sets and tangent space mapping (Barachant, Bonnet, Congedo, & Jutten, 2012) as a feature extractor, we demonstrate that MPMLDA can significantly outperform state-of-the-art multiclass static and adaptive methods. Furthermore, efficient learning rates can be achieved using data from different subjects.
Barrett, Harrison H.; Furenlid, Lars R.; Freed, Melanie; Hesterman, Jacob Y.; Kupinski, Matthew A.; Clarkson, Eric; Whitaker, Meredith K.
2008-01-01
Adaptive imaging systems alter their data-acquisition configuration or protocol in response to the image information received. An adaptive pinhole single-photon emission computed tomography (SPECT) system might acquire an initial scout image to obtain preliminary information about the radiotracer distribution and then adjust the configuration or sizes of the pinholes, the magnifications, or the projection angles in order to improve performance. This paper briefly describes two small-animal SPECT systems that allow this flexibility and then presents a framework for evaluating adaptive systems in general, and adaptive SPECT systems in particular. The evaluation is in terms of the performance of linear observers on detection or estimation tasks. Expressions are derived for the ideal linear (Hotelling) observer and the ideal linear (Wiener) estimator with adaptive imaging. Detailed expressions for the performance figures of merit are given, and possible adaptation rules are discussed. PMID:18541485
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. PMID:27652035
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.
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.
Kleinert; Pelster; Kastening; Bachmann
2000-08-01
The free energy of a field theory can be considered as a functional of the free correlation function. As such it obeys a nonlinear functional differential equation that can be turned into a recursion relation. This is solved order by order in the coupling constant to find all connected vacuum diagrams with their proper multiplicities. The procedure is applied to a multicomponent scalar field theory with a straight phi(4) self-interaction and then to a theory of two scalar fields straight phi and A with an interaction straight phi2A. All Feynman diagrams with external lines are obtained from functional derivatives of the connected vacuum diagrams with respect to the free correlation function. Finally, the recursive graphical construction is automatized by computer algebra with the help of a unique matrix notation for the Feynman diagrams.
NASA Astrophysics Data System (ADS)
Ledesma, Ragnar; Bayo, Eduardo
1993-08-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 Lagrangian approach is used in formulating the equations of 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.
ERIC Educational Resources Information Center
Harrell, William
1999-01-01
Provides information on various adaptive technology resources available to people with disabilities. (Contains 19 references, an annotated list of 129 websites, and 12 additional print resources.) (JOW)
Anstis, Stuart
2013-01-01
It is known that adaptation to a disk that flickers between black and white at 3-8 Hz on a gray surround renders invisible a congruent gray test disk viewed afterwards. This is contrast adaptation. We now report that adapting simply to the flickering circular outline of the disk can have the same effect. We call this "contour adaptation." This adaptation does not transfer interocularly, and apparently applies only to luminance, not color. One can adapt selectively to only some of the contours in a display, making only these contours temporarily invisible. For instance, a plaid comprises a vertical grating superimposed on a horizontal grating. If one first adapts to appropriate flickering vertical lines, the vertical components of the plaid disappears and it looks like a horizontal grating. Also, we simulated a Cornsweet (1970) edge, and we selectively adapted out the subjective and objective contours of a Kanisza (1976) subjective square. By temporarily removing edges, contour adaptation offers a new technique to study the role of visual edges, and it demonstrates how brightness information is concentrated in edges and propagates from them as it fills in surfaces.
NASA Astrophysics Data System (ADS)
Yao, Susu; Rahardja, Susanto; Lin, Xiao; Lim, Keng Pang; Lu, Zhongkang
2003-06-01
In this paper, we propose a new method for removing coding artifacts appeared in JPEG 2000 coded images. The proposed method uses a fuzzy control model to control the weighting function for different image edges according to the gradient of pixels and membership functions. Regularized post-processing approach and recursive line algorithm are described in this paper. Experimental results demonstrate that the proposed algorithm can significantly improve image quality in terms of objective and subjective evaluation.
On the structural limitations of recursive digital filters for base flow estimation
NASA Astrophysics Data System (ADS)
Su, Chun-Hsu; Costelloe, Justin F.; Peterson, Tim J.; Western, Andrew W.
2016-06-01
Recursive digital filters (RDFs) are widely used for estimating base flow from streamflow hydrographs, and various forms of RDFs have been developed based on different physical models. Numerical experiments have been used to objectively evaluate their performance, but they have not been sufficiently comprehensive to assess a wide range of RDFs. This paper extends these studies to understand the limitations of a generalized RDF method as a pathway for future field calibration. Two formalisms are presented to generalize most existing RDFs, allowing systematic tuning of their complexity. The RDFs with variable complexity are evaluated collectively in a synthetic setting, using modeled daily base flow produced by Li et al. (2014) from a range of synthetic catchments simulated with HydroGeoSphere. Our evaluation reveals that there are optimal RDF complexities in reproducing base flow simulations but shows that there is an inherent physical inconsistency within the RDF construction. Even under the idealized setting where true base flow data are available to calibrate the RDFs, there is persistent disagreement between true and estimated base flow over catchments with small base flow components, low saturated hydraulic conductivity of the soil and larger surface runoff. The simplest explanation is that low base flow "signal" in the streamflow data is hard to distinguish, although more complex RDFs can improve upon the simpler Eckhardt filter at these catchments.
Lang, R.
1996-12-31
The requirement of a strict and fixed distinction between dependent variables and independent variables, together with the presence of missing data, typically imposes considerable problems for most standard statistical prediction procedures. This paper describes a solution of these problems through the {open_quotes}weighted effect{close_quotes} approach in which recursive neural nets are used to learn how to compensate for any main and interaction effects attributable to missing data through the use of an {open_quotes}effect set{close_quotes} in addition to the data of actual cases. Extensive simulations of the approach based on an existing psychological data base showed high predictive validity, and a graceful degradation in performance with an increase in the number of unknown predictor variables. Moreover, the method proved amenable to the use of two-parameter logistic curves to arrive at a three way {open_quotes}low,{close_quotes} {open_quotes}high,{close_quotes} and {open_quotes}undecided{close_quotes} decision scheme with a-priori known error rates.
Recursive, in-place algorithm for the hexagonal orthogonal oriented quadrature image pyramid
NASA Technical Reports Server (NTRS)
Watson, Andrew B.
1989-01-01
Pyramid image transforms have proven useful in image coding and pattern recognition. The hexagonal orthogonal oriented quadrature image pyramid (HOP), transforms an image into a set of orthogonal, oriented, odd and even bandpass subimages. It operates on a hexagonal input lattice and employs seven kernels, each of which occupies a neighborhood consisting of a point and a hexagon of six nearest neighbors. The kernels consist of one lowpass and six bandpass kernels that are orthogonal, self-similar, and localized in space, spatial frequency, orientation, and phase. The kernels are first applied to the image samples to create the first level of the pyramid, then to the lowpass coefficients to create the next level. The resulting pyramid is a compact, efficient image code. Here, a recursive, in-place algorithm for computation of the HOP transform is described. The transform may be regarded as a depth-first traversal of a tree structure. It is shown that the algorithm requires a number of operations that is on the order of the number of pixels.
Paired MEG data set source localization using recursively applied and projected (RAP) MUSIC.
Ermer, J J; Mosher, J C; Huang, M; Leahy, R M
2000-09-01
An important class of experiments in functional brain mapping involves collecting pairs of data corresponding to separate "Task" and "Control" conditions. The data are then analyzed to determine what activity occurs during the Task experiment but not in the Control. Here we describe a new method for processing paired magnetoencephalographic (MEG) data sets using our recursively applied and projected multiple signal classification (RAP-MUSIC) algorithm. In this method the signal subspace of the Task data is projected against the orthogonal complement of the Control data signal subspace to obtain a subspace which describes spatial activity unique to the Task. A RAP-MUSIC localization search is then performed on this projected data to localize the sources which are active in the Task but not in the Control data. In addition to dipolar sources, effective blocking of more complex sources, e.g., multiple synchronously activated dipoles or synchronously activated distributed source activity, is possible since these topographies are well-described by the Control data signal subspace. Unlike previously published methods, the proposed method is shown to be effective in situations where the time series associated with Control and Task activity possess significant cross correlation. The method also allows for straightforward determination of the estimated time series of the localized target sources. A multiepoch MEG simulation and a phantom experiment are presented to demonstrate the ability of this method to successfully identify sources and their time series in the Task data.
Magnetic Reconnection: Recursive Current Sheet Collapse Triggered by “Ideal” Tearing
NASA Astrophysics Data System (ADS)
Tenerani, Anna; Velli, Marco; Rappazzo, Antonio Franco; Pucci, Fulvia
2015-11-01
We study, by means of MHD simulations, the onset and evolution of fast reconnection via the “ideal” tearing mode within a collapsing current sheet at high Lundquist numbers (S\\gg {10}4). We first confirm that as the collapse proceeds, fast reconnection is triggered well before a Sweet–Parker-type configuration can form: during the linear stage, plasmoids rapidly grow in a few Alfvén times when the predicted “ideal” tearing threshold S‑1/3 is approached from above; after the linear phase of the initial instability, X-points collapse and reform nonlinearly. We show that these give rise to a hierarchy of tearing events repeating faster and faster on current sheets at ever smaller scales, corresponding to the triggering of “ideal” tearing at the renormalized Lundquist number. In resistive MHD, this process should end with the formation of sub-critical (S ≤ 104) Sweet–Parker sheets at microscopic scales. We present a simple model describing the nonlinear recursive evolution that explains the timescale of the disruption of the initial sheet.
Reumann, Matthias; Fitch, Blake G; Rayshubskiy, Aleksandr; Pitman, Michael C; Rice, John J
2011-06-01
We present the orthogonal recursive bisection algorithm that hierarchically segments the anatomical model structure into subvolumes that are distributed to cores. The anatomy is derived from the Visible Human Project, with electrophysiology based on the FitzHugh-Nagumo (FHN) and ten Tusscher (TT04) models with monodomain diffusion. Benchmark simulations with up to 16,384 and 32,768 cores on IBM Blue Gene/P and L supercomputers for both FHN and TT04 results show good load balancing with almost perfect speedup factors that are close to linear with the number of cores. Hence, strong scaling is demonstrated. With 32,768 cores, a 1000 ms simulation of full heart beat requires about 6.5 min of wall clock time for a simulation of the FHN model. For the largest machine partitions, the simulations execute at a rate of 0.548 s (BG/P) and 0.394 s (BG/L) of wall clock time per 1 ms of simulation time. To our knowledge, these simulations show strong scaling to substantially higher numbers of cores than reported previously for organ-level simulation of the heart, thus significantly reducing run times. The ability to reduce runtimes could play a critical role in enabling wider use of cardiac models in research and clinical applications. PMID:21657987
A landscape-based cluster analysis using recursive search instead of a threshold parameter.
Gladwin, Thomas E; Vink, Matthijs; Mars, Roger B
2016-01-01
Cluster-based analysis methods in neuroimaging provide control of whole-brain false positive rates without the need to conservatively correct for the number of voxels and the associated false negative results. The current method defines clusters based purely on shapes in the landscape of activation, instead of requiring the choice of a statistical threshold that may strongly affect results. Statistical significance is determined using permutation testing, combining both size and height of activation. A method is proposed for dealing with relatively small local peaks. Simulations confirm the method controls the false positive rate and correctly identifies regions of activation. The method is also illustrated using real data. •A landscape-based method to define clusters in neuroimaging data avoids the need to pre-specify a threshold to define clusters.•The implementation of the method works as expected, based on simulated and real data.•The recursive method used for defining clusters, the method used for combining clusters, and the definition of the "value" of a cluster may be of interest for future variations.
Negre, Christian F A; Mniszewski, Susan M; Cawkwell, Marc J; Bock, Nicolas; Wall, Michael E; Niklasson, Anders M N
2016-07-12
We present a reduced complexity algorithm to compute the inverse overlap factors required to solve the generalized eigenvalue problem in a quantum-based molecular dynamics (MD) simulation. Our method is based on the recursive, iterative refinement of an initial guess of Z (inverse square root of the overlap matrix S). The initial guess of Z is obtained beforehand by using either an approximate divide-and-conquer technique or dynamical methods, propagated within an extended Lagrangian dynamics from previous MD time steps. With this formulation, we achieve long-term stability and energy conservation even under the incomplete, approximate, iterative refinement of Z. Linear-scaling performance is obtained using numerically thresholded sparse matrix algebra based on the ELLPACK-R sparse matrix data format, which also enables efficient shared-memory parallelization. As we show in this article using self-consistent density-functional-based tight-binding MD, our approach is faster than conventional methods based on the diagonalization of overlap matrix S for systems as small as a few hundred atoms, substantially accelerating quantum-based simulations even for molecular structures of intermediate size. For a 4158-atom water-solvated polyalanine system, we find an average speedup factor of 122 for the computation of Z in each MD step. PMID:27267207
ECG compression using non-recursive wavelet transform with quality control
NASA Astrophysics Data System (ADS)
Liu, Je-Hung; Hung, King-Chu; Wu, Tsung-Ching
2016-09-01
While wavelet-based electrocardiogram (ECG) data compression using scalar quantisation (SQ) yields excellent compression performance, a wavelet's SQ scheme, however, must select a set of multilevel quantisers for each quantisation process. As a result of the properties of multiple-to-one mapping, however, this scheme is not conducive for reconstruction error control. In order to address this problem, this paper presents a single-variable control SQ scheme able to guarantee the reconstruction quality of wavelet-based ECG data compression. Based on the reversible round-off non-recursive discrete periodised wavelet transform (RRO-NRDPWT), the SQ scheme is derived with a three-stage design process that first uses genetic algorithm (GA) for high compression ratio (CR), followed by a quadratic curve fitting for linear distortion control, and the third uses a fuzzy decision-making for minimising data dependency effect and selecting the optimal SQ. The two databases, Physikalisch-Technische Bundesanstalt (PTB) and Massachusetts Institute of Technology (MIT) arrhythmia, are used to evaluate quality control performance. Experimental results show that the design method guarantees a high compression performance SQ scheme with statistically linear distortion. This property can be independent of training data and can facilitate rapid error control.
NASA Technical Reports Server (NTRS)
Willis, Jerry; Willis, Dee Anna; Walsh, Clare; Stephens, Elizabeth; Murphy, Timothy; Price, Jerry; Stevens, William; Jackson, Kevin; Villareal, James A.; Way, Bob
1994-01-01
An important part of NASA's mission involves the secondary application of its technologies in the public and private sectors. One current application under development is LiteraCity, a simulation-based instructional package for adults who do not have functional reading skills. Using fuzzy logic routines and other technologies developed by NASA's Information Systems Directorate and hypermedia sound, graphics, and animation technologies the project attempts to overcome the limited impact of adult literacy assessment and instruction by involving the adult in an interactive simulation of real-life literacy activities. The project uses a recursive instructional development model and authentic instruction theory. This paper describes one component of a project to design, develop, and produce a series of computer-based, multimedia instructional packages. The packages are being developed for use in adult literacy programs, particularly in correctional education centers. They use the concepts of authentic instruction and authentic assessment to guide development. All the packages to be developed are instructional simulations. The first is a simulation of 'finding a friend a job.'
Prognostic factors for survival of patients with glioblastoma: Recursive partitioning analysis1
Lamborn, Kathleen R.; Chang, Susan M.; Prados, Michael D.
2004-01-01
Survival for patients with glioblastoma multiforme is short, and current treatments provide limited benefit. Therefore, there is interest in conducting phase 2 trials of experimental treatments in newly diagnosed patients. However, this requires historical data with which to compare the experimental therapies. Knowledge of prognostic markers would also allow stratification into risk groups for phase 3 randomized trials. In this retrospective study of 832 glioblastoma multiforme patients enrolled into prospective clinical trials at the time of initial diagnosis, we evaluated several potential prognostic markers for survival to establish risk groups. Analyses were done using both Cox proportional hazards modeling and recursive partitioning analyses. Initially, patients from 8 clinical trials, 6 of which included adjuvant chemotherapy, were included. Subsequent analyses excluded trials with interstitial brachytherapy, and finally included only nonbrachytherapy trials with planned adjuvant chemotherapy. The initial analysis defined 4 risk groups. The 2 lower risk groups included patients under the age of 40, the lowest risk group being young patients with tumor in the frontal lobe only. An intermediate-risk group included patients with Karnofsky performance status (KPS) >70, subtotal or total resection, and age between 40 and 65. The highest risk group included all patients over 65 and patients between 40 and 65 with either KPS < 80 or biopsy only. Subgroup analyses indicated that inclusion of adjuvant chemotherapy provides an increase in survival, although that improvement tends to be minimal for patients over age 65, for patients over age 40 with KPS less than 80, and for those treated with brachytherapy. PMID:15279715
Prognostic factors for survival of patients with glioblastoma: recursive partitioning analysis.
Lamborn, Kathleen R; Chang, Susan M; Prados, Michael D
2004-07-01
Survival for patients with glioblastoma multiforme is short, and current treatments provide limited benefit. Therefore, there is interest in conducting phase 2 trials of experimental treatments in newly diagnosed patients. However, this requires historical data with which to compare the experimental therapies. Knowledge of prognostic markers would also allow stratification into risk groups for phase 3 randomized trials. In this retrospective study of 832 glioblastoma multiforme patients enrolled into prospective clinical trials at the time of initial diagnosis, we evaluated several potential prognostic markers for survival to establish risk groups. Analyses were done using both Cox proportional hazards modeling and recursive partitioning analyses. Initially, patients from 8 clinical trials, 6 of which included adjuvant chemotherapy, were included. Subsequent analyses excluded trials with interstitial brachytherapy, and finally included only nonbrachytherapy trials with planned adjuvant chemotherapy. The initial analysis defined 4 risk groups. The 2 lower risk groups included patients under the age of 40, the lowest risk group being young patients with tumor in the frontal lobe only. An intermediate-risk group included patients with Karnofsky performance status (KPS) >70, subtotal or total resection, and age between 40 and 65. The highest risk group included all patients over 65 and patients between 40 and 65 with either KPS<80 or biopsy only. Subgroup analyses indicated that inclusion of adjuvant chemotherapy provides an increase in survival, although that improvement tends to be minimal for patients over age 65, for patients over age 40 with KPS less than 80, and for those treated with brachytherapy.
Recursive Bayesian filtering framework for lithium-ion cell state estimation
NASA Astrophysics Data System (ADS)
Tagade, Piyush; Hariharan, Krishnan S.; Gambhire, Priya; Kolake, Subramanya Mayya; Song, Taewon; Oh, Dukjin; Yeo, Taejung; Doo, Seokgwang
2016-02-01
Robust battery management system is critical for a safe and reliable electric vehicle operation. One of the most important functions of the battery management system is to accurately estimate the battery state using minimal on-board instrumentation. This paper presents a recursive Bayesian filtering framework for on-board battery state estimation by assimilating measurables like cell voltage, current and temperature with physics-based reduced order model (ROM) predictions. The paper proposes an improved Particle filtering algorithm for implementation of the framework, and compares its performance against the unscented Kalman filter. Functionality of the proposed framework is demonstrated for a commercial NCA/C cell state estimation at different operating conditions including constant current discharge at room and low temperatures, hybrid power pulse characterization (HPPC) and urban driving schedule (UDDS) protocols. In addition to accurate voltage prediction, the electrochemical nature of ROM enables drawing of physical insights into the cell behavior. Advantages of using electrode concentrations over conventional Coulomb counting for accessible capacity estimation are discussed. In addition to the mean state estimation, the framework also provides estimation of the associated confidence bounds that are used to establish predictive capability of the proposed framework.
What contributes to perceived stress in later life? A recursive partitioning approach
Scott, Stacey B.; Jackson, Brenda R.; Bergeman, C. S.
2011-01-01
One possible explanation for the individual differences in outcomes of stress is the diversity of inputs that produce perceptions of being stressed. The current study examines how combinations of contextual features (e.g., social isolation, neighborhood quality, health problems, age discrimination, financial concerns, and recent life events) of later life contribute to overall feelings of stress. Recursive partitioning techniques (regression trees and random forests) were used to examine unique interrelations between predictors of perceived stress in a sample of 282 community-dwelling adults. Trees provided possible examples of equifinality (i.e., subsets of people with similar levels of perceived stress but different predictors) as well as for the identification both of contextual combinations that separated participants with very high and very low perceived stress. Random forest analyses aggregated across many trees based on permuted versions of the data and predictors; loneliness, financial strain, neighborhood strain, ageism, and to some extent life events emerged as important predictors. Interviews with a subsample of participants provided both thick description of the complex relationships identified in the trees, as well as additional risks not appearing in the survey results. Together, the analyses highlight what may be missed when stress is used as a simple unidimensional construct and can guide differential intervention efforts. PMID:21604885
A recursive method for solving haplotype frequencies with application to genetics.
Ng, Michael K; Fung, Eric S; Lee, Yiu-Fai; Ching, Wai-Ki
2006-12-01
Multiple loci analysis has become popular with the advanced developments in biological experiments. A lot of studies have been focused on the biological and the statistical properties of such multiple loci analysis. In this paper, we study one of the important computational problems: solving the probabilities of haplotype classes from a large linear system Ax = b derived from the recombination events in multiple loci analysis. Since the size of the recombination matrix A increases exponentially with respect to the number of loci, fast solvers are required to deal with a large number of loci in the analysis. By exploiting the nice structure of the matrix A, we develop an efficient recursive algorithm for solving such structured linear systems. In particular, the complexity of the proposed algorithm for the n loci problem is of O(n2(n)) operations and the memory requirement is of O(2(n)) locations for the 2(n)-by-2(n) matrix A. Numerical examples are given to demonstrate the effectiveness of our efficient solver. Finally, we apply our proposed method to analyze the haplotype classes for a set of single nucleotides polymorphisms (SNPs) from Hapmap data. PMID:17245814
Recursive pump-adding scheme for optical superchannel multicasting based on FWM
NASA Astrophysics Data System (ADS)
Zhu, Paikun; Li, Juhao; Wu, Zhongying; Chen, Xin; Xu, Yingying; Lin, Bangjiang; Chen, Zhangyuan; He, Yongqi
2015-07-01
Optical superchannel multicasting, whereby a superchannel is replicated simultaneously to multiple spectral locations in a single device, is potentially a promising functionality for future optical networks. Multiple-pump four-wave mixing (FWM) in highly nonlinear fiber (HNLF) is an effective approach to implement superchannel multicasting. However, if the frequencies of the pumps are not carefully configured, the generated replicas would be spectrally scattered, which would increase the difficulty of controlling replicas' performance and managing spectral resource. In this paper, we propose a recursive pump-adding (RPA) scheme, which makes the replicas more spectrally aggregated than our previous exponentially-growing-spaced (EGS) pump scheme. Such replica aggregation technique can reduce phase mismatching of replicas remote from the original channel, which is beneficial to replicas' performance. RPA scheme also provides an additional option of replica allocation for multicasting. Based on the RPA scheme, we have experimentally demonstrated 1-to-21 superchannel multicasting with 5 pumps. More than 2.3 dB Q-factor margin is achieved across all the replicas compared with the typical 7% forward error correction (FEC) threshold. The performance comparison between RPA and EGS pump scheme is also investigated.
Application of recursive manipulator dynamics to hybrid software/hardware simulation
NASA Technical Reports Server (NTRS)
Hill, Christopher J.; Hopping, Kenneth A.; Price, Charles R.
1989-01-01
Computer simulations of robotic mechanisms have traditionally solved the dynamic equations of motion for an N degree of freedom manipulator by formulating an N dimensional matrix equation combining the accelerations and torques (forces) for all joints. The use of an alternative formulation that is strictly recursive is described. The dynamic solution proceeds on a joint by joint basis, so it is possible to perform inverse dynamics at arbitrary joints. The dynamic formulation is generalized with respect to both rotational and translational joints, and it is also directly extendable to branched manipulator chains. A hardware substitution test is described in which a servo drive motor was integrated with a simulated manipulator arm. The form of the dynamic equation permits calculation of acceleration given torque or vice versa. Computing torque as a function of acceleration is required for the hybrid software/hardware simulation test described. For this test, a joint servo motor is controlled in conjunction with the simulation, and the dynamic torque on the servo motor is provided by a load motor on a common driveshaft.
A landscape-based cluster analysis using recursive search instead of a threshold parameter.
Gladwin, Thomas E; Vink, Matthijs; Mars, Roger B
2016-01-01
Cluster-based analysis methods in neuroimaging provide control of whole-brain false positive rates without the need to conservatively correct for the number of voxels and the associated false negative results. The current method defines clusters based purely on shapes in the landscape of activation, instead of requiring the choice of a statistical threshold that may strongly affect results. Statistical significance is determined using permutation testing, combining both size and height of activation. A method is proposed for dealing with relatively small local peaks. Simulations confirm the method controls the false positive rate and correctly identifies regions of activation. The method is also illustrated using real data. •A landscape-based method to define clusters in neuroimaging data avoids the need to pre-specify a threshold to define clusters.•The implementation of the method works as expected, based on simulated and real data.•The recursive method used for defining clusters, the method used for combining clusters, and the definition of the "value" of a cluster may be of interest for future variations. PMID:27489780
NASA Astrophysics Data System (ADS)
Chen, Tzikang J.; Shiao, Michael
2016-04-01
This paper verified a generic and efficient assessment concept for probabilistic fatigue life management. The concept is developed based on an integration of damage tolerance methodology, simulations methods1, 2, and a probabilistic algorithm RPI (recursive probability integration)3-9 considering maintenance for damage tolerance and risk-based fatigue life management. RPI is an efficient semi-analytical probabilistic method for risk assessment subjected to various uncertainties such as the variability in material properties including crack growth rate, initial flaw size, repair quality, random process modeling of flight loads for failure analysis, and inspection reliability represented by probability of detection (POD). In addition, unlike traditional Monte Carlo simulations (MCS) which requires a rerun of MCS when maintenance plan is changed, RPI can repeatedly use a small set of baseline random crack growth histories excluding maintenance related parameters from a single MCS for various maintenance plans. In order to fully appreciate the RPI method, a verification procedure was performed. In this study, MC simulations in the orders of several hundred billions were conducted for various flight conditions, material properties, and inspection scheduling, POD and repair/replacement strategies. Since the MC simulations are time-consuming methods, the simulations were conducted parallelly on DoD High Performance Computers (HPC) using a specialized random number generator for parallel computing. The study has shown that RPI method is several orders of magnitude more efficient than traditional Monte Carlo simulations.
Shehzad, Danish; Bozkuş, Zeki
2016-01-01
Increase in complexity of neuronal network models escalated the efforts to make NEURON simulation environment efficient. The computational neuroscientists divided the equations into subnets amongst multiple processors for achieving better hardware performance. On parallel machines for neuronal networks, interprocessor spikes exchange consumes large section of overall simulation time. In NEURON for communication between processors Message Passing Interface (MPI) is used. MPI_Allgather collective is exercised for spikes exchange after each interval across distributed memory systems. The increase in number of processors though results in achieving concurrency and better performance but it inversely affects MPI_Allgather which increases communication time between processors. This necessitates improving communication methodology to decrease the spikes exchange time over distributed memory systems. This work has improved MPI_Allgather method using Remote Memory Access (RMA) by moving two-sided communication to one-sided communication, and use of recursive doubling mechanism facilitates achieving efficient communication between the processors in precise steps. This approach enhanced communication concurrency and has improved overall runtime making NEURON more efficient for simulation of large neuronal network models. PMID:27413363
Bozkuş, Zeki
2016-01-01
Increase in complexity of neuronal network models escalated the efforts to make NEURON simulation environment efficient. The computational neuroscientists divided the equations into subnets amongst multiple processors for achieving better hardware performance. On parallel machines for neuronal networks, interprocessor spikes exchange consumes large section of overall simulation time. In NEURON for communication between processors Message Passing Interface (MPI) is used. MPI_Allgather collective is exercised for spikes exchange after each interval across distributed memory systems. The increase in number of processors though results in achieving concurrency and better performance but it inversely affects MPI_Allgather which increases communication time between processors. This necessitates improving communication methodology to decrease the spikes exchange time over distributed memory systems. This work has improved MPI_Allgather method using Remote Memory Access (RMA) by moving two-sided communication to one-sided communication, and use of recursive doubling mechanism facilitates achieving efficient communication between the processors in precise steps. This approach enhanced communication concurrency and has improved overall runtime making NEURON more efficient for simulation of large neuronal network models. PMID:27413363
Lu, Xiaobing; Yang, Yongzhe; Wu, Fengchun; Gao, Minjian; Xu, Yong; Zhang, Yue; Yao, Yongcheng; Du, Xin; Li, Chengwei; Wu, Lei; Zhong, Xiaomei; Zhou, Yanling; Fan, Ni; Zheng, Yingjun; Xiong, Dongsheng; Peng, Hongjun; Escudero, Javier; Huang, Biao; Li, Xiaobo; Ning, Yuping; Wu, Kai
2016-07-01
Structural abnormalities in schizophrenia (SZ) patients have been well documented with structural magnetic resonance imaging (MRI) data using voxel-based morphometry (VBM) and region of interest (ROI) analyses. However, these analyses can only detect group-wise differences and thus, have a poor predictive value for individuals. In the present study, we applied a machine learning method that combined support vector machine (SVM) with recursive feature elimination (RFE) to discriminate SZ patients from normal controls (NCs) using their structural MRI data. We first employed both VBM and ROI analyses to compare gray matter volume (GMV) and white matter volume (WMV) between 41 SZ patients and 42 age- and sex-matched NCs. The method of SVM combined with RFE was used to discriminate SZ patients from NCs using significant between-group differences in both GMV and WMV as input features. We found that SZ patients showed GM and WM abnormalities in several brain structures primarily involved in the emotion, memory, and visual systems. An SVM with a RFE classifier using the significant structural abnormalities identified by the VBM analysis as input features achieved the best performance (an accuracy of 88.4%, a sensitivity of 91.9%, and a specificity of 84.4%) in the discriminative analyses of SZ patients. These results suggested that distinct neuroanatomical profiles associated with SZ patients might provide a potential biomarker for disease diagnosis, and machine-learning methods can reveal neurobiological mechanisms in psychiatric diseases. PMID:27472673
A recursive method for updating apple firmness prediction models based on spectral scattering images
NASA Astrophysics Data System (ADS)
Peng, Yankun; Lu, Renfu
2007-09-01
Multispectral scattering is effective for nondestructive prediction of fruit firmness. However, the established prediction models for multispectral scattering are variety specific and may not perform appropriately for fruit harvested from different orchards or at different times. In this research, a recursive least squares method was proposed to update the existing prediction model by adding samples from a new population to assure good performance of the model for predicting fruit from the new population. Multispectral scattering images acquired by a multispectral imaging system from Golden Delicious apples that were harvested at the same time but had different postharvest storage time periods were used to develop the updating method. Radial scattering profiles were described by the modified Lorentzian distribution (MLD) function with four profile parameters for eight wavelengths. Multi-linear regression was performed on MLD parameters to establish prediction models for fruit firmness for each group. The prediction model established in the first group was then updated by using selected samples from the second group, and four different sampling methods were compared and validated with the rest apples. The prediction model corrected by the model-updating method gave good firmness predictions with the correlation coefficient (r) of 0.86 and the standard error of prediction (SEP) of 6.11 N. This model updating method is promising for implementing the spectral scattering technique for real-time prediction of apple fruit firmness.
NASA Astrophysics Data System (ADS)
Liu, X. Y.; Alfi, S.; Bruni, S.
2016-06-01
A model-based condition monitoring strategy for the railway vehicle suspension is proposed in this paper. This approach is based on recursive least square (RLS) algorithm focusing on the deterministic 'input-output' model. RLS has Kalman filtering feature and is able to identify the unknown parameters from a noisy dynamic system by memorising the correlation properties of variables. The identification of suspension parameter is achieved by machine learning of the relationship between excitation and response in a vehicle dynamic system. A fault detection method for the vertical primary suspension is illustrated as an instance of this condition monitoring scheme. Simulation results from the rail vehicle dynamics software 'ADTreS' are utilised as 'virtual measurements' considering a trailer car of Italian ETR500 high-speed train. The field test data from an E464 locomotive are also employed to validate the feasibility of this strategy for the real application. Results of the parameter identification performed indicate that estimated suspension parameters are consistent or approximate with the reference values. These results provide the supporting evidence that this fault diagnosis technique is capable of paving the way for the future vehicle condition monitoring system.
Recursive Techniques for Computing Gluon Scattering in Anti-de-Sitter Space
NASA Astrophysics Data System (ADS)
Shyaka, Claude; Kharel, Savan
2016-03-01
The anti-de Sitter/conformal field theory correspondence is a relationship between two kinds of physical theories. On one side of the duality are special type of quantum (conformal) field theories known as the Yang-Mills theory. These quantum field theories are known to be equivalent to theories of gravity in Anti-de Sitter (AdS) space. The physical observables in the theory are the correlation functions that live in the boundary of AdS space. In general correlation functions are computed using configuration space and the expressions are extremely complicated. Using momentum basis and recursive techniques developed by Raju, we extend tree level correlation functions for four and five-point correlation functions in Yang-Mills theory in Anti-de Sitter space. In addition, we show that for certain external helicity, the correlation functions have simple analytic structure. Finally, we discuss how one can generalize these results to n-point functions. Hendrix college odyssey Grant.
A recursive network approach can identify constitutive regulatory circuits in gene expression data
NASA Astrophysics Data System (ADS)
Blasi, Monica Francesca; Casorelli, Ida; Colosimo, Alfredo; Blasi, Francesco Simone; Bignami, Margherita; Giuliani, Alessandro
2005-03-01
The activity of the cell is often coordinated by the organisation of proteins into regulatory circuits that share a common function. Genome-wide expression profiles might contain important information on these circuits. Current approaches for the analysis of gene expression data include clustering the individual expression measurements and relating them to biological functions as well as modelling and simulation of gene regulation processes by additional computer tools. The identification of the regulative programmes from microarray experiments is limited, however, by the intrinsic difficulty of linear methods to detect low-variance signals and by the sensitivity of the different approaches. Here we face the problem of recognising invariant patterns of correlations among gene expression reminiscent of regulation circuits. We demonstrate that a recursive neural network approach can identify genetic regulation circuits from expression data for ribosomal and genome stability genes. The proposed method, by greatly enhancing the sensitivity of microarray studies, allows the identification of important aspects of genetic regulation networks and might be useful for the discrimination of the different players involved in regulation circuits. Our results suggest that the constitutive regulatory networks involved in the generic organisation of the cell display a high degree of clustering depending on a modular architecture.
NASA Astrophysics Data System (ADS)
Goto, Akifumi; Ishida, Mizuri; Sagawa, Koichi
2010-01-01
The purpose of this study is to derive quantitative assessment indicators of the human postural control ability. An inverted pendulum is applied to standing human body and is controlled by ankle joint torque according to PD control method in sagittal plane. Torque control parameters (KP: proportional gain, KD: derivative gain) and pole placements of postural control system are estimated with time from inclination angle variation using fixed trace method as recursive least square method. Eight young healthy volunteers are participated in the experiment, in which volunteers are asked to incline forward as far as and as fast as possible 10 times over 10 [s] stationary intervals with their neck joint, hip joint and knee joint fixed, and then return to initial upright posture. The inclination angle is measured by an optical motion capture system. Three conditions are introduced to simulate unstable standing posture; 1) eyes-opened posture for healthy condition, 2) eyes-closed posture for visual impaired and 3) one-legged posture for lower-extremity muscle weakness. The estimated parameters Kp, KD and pole placements are applied to multiple comparison test among all stability conditions. The test results indicate that Kp, KD and real pole reflect effect of lower-extremity muscle weakness and KD also represents effect of visual impairment. It is suggested that the proposed method is valid for quantitative assessment of standing postural control ability.
NASA Astrophysics Data System (ADS)
Goto, Akifumi; Ishida, Mizuri; Sagawa, Koichi
2009-12-01
The purpose of this study is to derive quantitative assessment indicators of the human postural control ability. An inverted pendulum is applied to standing human body and is controlled by ankle joint torque according to PD control method in sagittal plane. Torque control parameters (KP: proportional gain, KD: derivative gain) and pole placements of postural control system are estimated with time from inclination angle variation using fixed trace method as recursive least square method. Eight young healthy volunteers are participated in the experiment, in which volunteers are asked to incline forward as far as and as fast as possible 10 times over 10 [s] stationary intervals with their neck joint, hip joint and knee joint fixed, and then return to initial upright posture. The inclination angle is measured by an optical motion capture system. Three conditions are introduced to simulate unstable standing posture; 1) eyes-opened posture for healthy condition, 2) eyes-closed posture for visual impaired and 3) one-legged posture for lower-extremity muscle weakness. The estimated parameters Kp, KD and pole placements are applied to multiple comparison test among all stability conditions. The test results indicate that Kp, KD and real pole reflect effect of lower-extremity muscle weakness and KD also represents effect of visual impairment. It is suggested that the proposed method is valid for quantitative assessment of standing postural control ability.
Niwinska, Anna; Murawska, Magdalena
2012-04-01
Purpose: The aim of the study was to present a new breast cancer recursive partitioning analysis (RPA) prognostic index for patients with newly diagnosed brain metastases as a guide in clinical decision making. Methods and Materials: A prospectively collected group of 441 consecutive patients with breast cancer and brain metastases treated between the years 2003 and 2009 was assessed. Prognostic factors significant for univariate analysis were included into RPA. Results: Three prognostic classes of a new breast cancer RPA prognostic index were selected. The median survival of patients within prognostic Classes I, II, and III was 29, 9, and 2.4 months, respectively (p < 0.0001). Class I included patients with one or two brain metastases, without extracranial disease or with controlled extracranial disease, and with Karnofsky performance status (KPS) of 100. Class III included patients with multiple brain metastases with KPS of {<=}60. Class II included all other cases. Conclusions: The breast cancer RPA prognostic index is an easy and valuable tool for use in clinical practice. It can select patients who require aggressive treatment and those in whom whole-brain radiotherapy or symptomatic therapy is the most reasonable option. An individual approach is required for patients from prognostic Class II.
NASA Technical Reports Server (NTRS)
Molusis, J. A.
1982-01-01
An on line technique is presented for the identification of rotor blade modal damping and frequency from rotorcraft random response test data. The identification technique is based upon a recursive maximum likelihood (RML) algorithm, which is demonstrated to have excellent convergence characteristics in the presence of random measurement noise and random excitation. The RML technique requires virtually no user interaction, provides accurate confidence bands on the parameter estimates, and can be used for continuous monitoring of modal damping during wind tunnel or flight testing. Results are presented from simulation random response data which quantify the identified parameter convergence behavior for various levels of random excitation. The data length required for acceptable parameter accuracy is shown to depend upon the amplitude of random response and the modal damping level. Random response amplitudes of 1.25 degrees to .05 degrees are investigated. The RML technique is applied to hingeless rotor test data. The inplane lag regressing mode is identified at different rotor speeds. The identification from the test data is compared with the simulation results and with other available estimates of frequency and damping.
Sitzenstock, F; Ytournel, F; Simianer, H
2013-02-01
In many livestock breeding programmes, the development of inbreeding is of critical importance. Thus, the assessment of the expected development of inbreeding should be an essential element in the design of breeding programmes. We propose a new method to deterministically predict the rate of inbreeding based on the gene-flow method in well-defined complex and dynamic breeding programmes. In the suggested approach, a breeding programme has to be structured in homogeneous age-sex-groups, so called cohorts, with a defined origin of genes. Starting from an initial setup (usually an unrelated and non-inbred base population), transition rules to calculate the kinship within and between cohorts originating from reproduction or ageing, respectively, are defined. Using this approach recursively provides the expected development of kinship within and between all cohorts over time, which can be combined into average kinships for the whole population or defined subsets. From these quantities, relevant parameters like the inbreeding rate or the effective population size are easily derived. We illustrate the method with a simple static example breeding programme in sheep. Based on this reference breeding programme, we demonstrate the use of our approach for dynamic breeding programmes, in which cohort sizes or vectors of gene origin change over time: here, we model the situation of exponential population growth and a bottleneck situation, respectively. The suggested approach does not account for the effect of selection on the development of inbreeding, but ideas to overcome this limitation are discussed.
Nomura, Motoo; Shitara, Kohei; Kodaira, Takeshi; Kondoh, Chihiro; Takahari, Daisuke; Ura, Takashi; Kojima, Hiroyuki; Kamata, Minoru; Muro, Kei; Sawada, Satoshi
2012-11-01
Background: The 7th edition of the American Joint Committee on Cancer staging system does not include lymph node size in the guidelines for staging patients with esophageal cancer. The objectives of this study were to determine the prognostic impact of the maximum metastatic lymph node diameter (ND) on survival and to develop and validate a new staging system for patients with esophageal squamous cell cancer who were treated with definitive chemoradiotherapy (CRT). Methods: Information on 402 patients with esophageal cancer undergoing CRT at two institutions was reviewed. Univariate and multivariate analyses of data from one institution were used to assess the impact of clinical factors on survival, and recursive partitioning analysis was performed to develop the new staging classification. To assess its clinical utility, the new classification was validated using data from the second institution. Results: By multivariate analysis, gender, T, N, and ND stages were independently and significantly associated with survival (p < 0.05). The resulting new staging classification was based on the T and ND. The four new stages led to good separation of survival curves in both the developmental and validation datasets (p < 0.05). Conclusions: Our results showed that lymph node size is a strong independent prognostic factor and that the new staging system, which incorporated lymph node size, provided good prognostic power, and discriminated effectively for patients with esophageal cancer undergoing CRT.
Pathways to Early Coital Debut for Adolescent Girls: A Recursive Partitioning Analysis
Pearson, Matthew R.; Kholodkov, Tatyana; Henson, James M.; Impett, Emily A.
2011-01-01
The current study examined pathways to early coital debut among early to middle adolescent girls in the United States. In a two-year longitudinal study of 104 adolescent girls, we conducted Recursive Partitioning (RP) analyses to examine the specific factors that were related to engaging in first intercourse by the 10th grade among adolescent girls who had not yet engaged in sexual intercourse by the 8th grade. RP analyses identified subsamples of girls who had low, medium, and high likelihoods of engaging in early coital debut based on six variables (i.e., school aspirations, early physical intimacy experiences, depression, body objectification, body image, and relationship inauthenticity). For example, girls in the lowest likelihood group (3% had engaged in sex by the 10th grade) reported no prior experiences with being touched under their clothes, low body objectification, high aspirations to complete graduate education, and low depressive symptoms; girls in the highest likelihood group (75% had engaged in sex by the 10th grade) also reported no prior experiences with being touched under their clothes but had high levels of body objectification. The implications of these analyses for the development of female adolescent sexuality as well as for advances in quantitative methods are discussed. PMID:21512947
Jerebko, Anna K; Summers, Ronald M; Malley, James D; Franaszek, Marek; Johnson, C Daniel
2003-01-01
Detection of colonic polyps in CT colonography is problematic due to complexities of polyp shape and the surface of the normal colon. Published results indicate the feasibility of computer-aided detection of polyps but better classifiers are needed to improve specificity. In this paper we compare the classification results of two approaches: neural networks and recursive binary trees. As our starting point we collect surface geometry information from three-dimensional reconstruction of the colon, followed by a filter based on selected variables such as region density, Gaussian and average curvature and sphericity. The filter returns sites that are candidate polyps, based on earlier work using detection thresholds, to which the neural nets or the binary trees are applied. A data set of 39 polyps from 3 to 25 mm in size was used in our investigation. For both neural net and binary trees we use tenfold cross-validation to better estimate the true error rates. The backpropagation neural net with one hidden layer trained with Levenberg-Marquardt algorithm achieved the best results: sensitivity 90% and specificity 95% with 16 false positives per study.
Gruenewald, Tara L; Mroczek, Daniel K; Ryff, Carol D; Singer, Burton H
2008-03-01
Recursive partitioning is an analytic technique that is useful for identifying complex combinations of conditions that predict particular outcomes as well as for delineating multiple subgroup differences in how such factors work together. As such, the methodology is well suited to multidisciplinary, life course inquiry in which the goal is to integrate many interacting influences and understand subgroup variation. The authors conducted recursive partitioning analyses on a previously published study (D. K. Mroczek & C. M. Kolarz, 1998) that investigated life course profiles of positive and negative affect and incorporated various top-down (personality traits) and bottom-up (sociodemographic statuses, contextual influences) influences. The new analyses reveal multiway, nonlinear interactions among these variables in predicting affective experience and, importantly, life course differences in how these various factors combine. Included are details of how recursive partitioning trees are generated as well as descriptions of the software packages available for using such techniques. Overall, the methodology offers tractable strategies for discerning meaningful patterns in highly complex data sets. PMID:18331126
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.
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. PMID:26497067
Adaptive link selection algorithms for distributed estimation
NASA Astrophysics Data System (ADS)
Xu, Songcen; de Lamare, Rodrigo C.; Poor, H. Vincent
2015-12-01
This paper presents adaptive link selection algorithms for distributed estimation and considers their application to wireless sensor networks and smart grids. In particular, exhaustive search-based least mean squares (LMS) / recursive least squares (RLS) link selection algorithms and sparsity-inspired LMS / RLS link selection algorithms that can exploit the topology of networks with poor-quality links are considered. The proposed link selection algorithms are then analyzed in terms of their stability, steady-state, and tracking performance and computational complexity. In comparison with the existing centralized or distributed estimation strategies, the key features of the proposed algorithms are as follows: (1) more accurate estimates and faster convergence speed can be obtained and (2) the network is equipped with the ability of link selection that can circumvent link failures and improve the estimation performance. The performance of the proposed algorithms for distributed estimation is illustrated via simulations in applications of wireless sensor networks and smart grids.
Parameter adaptive estimation of random processes
NASA Technical Reports Server (NTRS)
Caglayan, A. K.; Vanlandingham, H. F.
1975-01-01
This paper is concerned with the parameter adaptive least squares estimation of random processes. The main result is a general representation theorem for the conditional expectation of a random variable on a product probability space. Using this theorem along with the general likelihood ratio expression, the least squares estimate of the process is found in terms of the parameter conditioned estimates. The stochastic differential for the a posteriori probability and the stochastic differential equation for the a posteriori density are found by using simple stochastic calculus on the representations obtained. The results are specialized to the case when the parameter has a discrete distribution. The results can be used to construct an implementable recursive estimator for certain types of nonlinear filtering problems. This is illustrated by some simple examples.
NASA Astrophysics Data System (ADS)
Kinzig, Ann P.
2015-03-01
This paper is intended as a brief introduction to climate adaptation in a conference devoted otherwise to the physics of sustainable energy. Whereas mitigation involves measures to reduce the probability of a potential event, such as climate change, adaptation refers to actions that lessen the impact of climate change. Mitigation and adaptation differ in other ways as well. Adaptation does not necessarily have to be implemented immediately to be effective; it only needs to be in place before the threat arrives. Also, adaptation does not necessarily require global, coordinated action; many effective adaptation actions can be local. Some urban communities, because of land-use change and the urban heat-island effect, currently face changes similar to some expected under climate change, such as changes in water availability, heat-related morbidity, or changes in disease patterns. Concern over those impacts might motivate the implementation of measures that would also help in climate adaptation, despite skepticism among some policy makers about anthropogenic global warming. Studies of ancient civilizations in the southwestern US lends some insight into factors that may or may not be important to successful adaptation.
NASA Astrophysics Data System (ADS)
Erastova, L. K.
2016-06-01
Thirty spectroscopic binary stars were found in the Second Byurakan Survey (SBS). They show composite spectra - WD(DA)+dM or dC (for example Liebert et al. 1994). They may have red color, if the radiation of the red star dominates, and blue one, if the blue star is brighter and have peculiar spectrum in our survey plate. We obtained slit spectra for most of such objects. But we often see the spectrum of one component, because our slit spectra did not cover all optical range. We examine by eye the slit spectra of all SBS stellar objects (˜700) in SDSS DR7, DR8 or DR9 independent on our observations. We confirmed or discovered the duplicity of 30 stars. Usually they are spectroscopic binaries, where one component is WD (DA) and the second one is a red star with or without emission. There also are other components combinations. Sometimes there are emission lines, probably, indicating variable ones.
Desktop setup for binary holograms
NASA Astrophysics Data System (ADS)
Ginter, Olaf; Rothe, Hendrik
1996-08-01
Binary gratings as holograms itself or as photographic masking tools for further fabrication steps can fulfill a lot of applications. The commonly used semiconductor technologies for direct writing of high resolution structures are often too expensive. On the other hand computer plots at a reasonable price with photographic reduction do not meet the needs of precision e.g. for interferometric inspection. The lack of cheap and reliable instruments for direct writing in an appropriate resolution is still a problem in fabricating synthetic holograms. Using off-the-shelf components a direct writing plotter for binary patterns can be built at moderate costs. Typical design rules as well as experimental results are given and the final setup is introduced.
Binary Inspiral in Quadratic Gravity
NASA Astrophysics Data System (ADS)
Yagi, Kent
2015-01-01
Quadratic gravity is a general class of quantum-gravity-inspired theories, where the Einstein-Hilbert action is extended through the addition of all terms quadratic in the curvature tensor coupled to a scalar field. In this article, we focus on the scalar Gauss- Bonnet (sGB) theory and consider the black hole binary inspiral in this theory. By applying the post-Newtonian (PN) formalism, we found that there is a scalar dipole radiation which leads to -1PN correction in the energy flux relative to gravitational radiation in general relativity. From the orbital decay rate of a low-mass X-ray binary A0600-20, we obtain the bound that is six orders of magnitude stronger than the current solar system bound. Furthermore, we show that the excess in the orbital decay rate of XTE J1118+480 can be explained by the scalar radiation in sGB theory.
Close supermassive binary black holes.
Gaskell, C Martin
2010-01-01
It has been proposed that when the peaks of the broad emission lines in active galactic nuclei (AGNs) are significantly blueshifted or redshifted from the systemic velocity of the host galaxy, this could be a consequence of orbital motion of a supermassive black-hole binary (SMBB). The AGN J1536+0441 ( = SDSS J153636.22+044127.0) has recently been proposed as an example of this phenomenon. It is proposed here instead that J1536+0441 is an example of line emission from a disk. If this is correct, the lack of clear optical spectral evidence for close SMBBs is significant, and argues either that the merging of close SMBBs is much faster than has generally been hitherto thought, or if the approach is slow, that when the separation of the binary is comparable to the size of the torus and broad-line region, the feeding of the black holes is disrupted. PMID:20054358
First Orbits for Five Binaries
NASA Astrophysics Data System (ADS)
Cvetković, Z.
2008-10-01
In this paper, new orbital elements are given for five binaries. For all of them—Washington Double Star (WDS) 00469+4339 = HDS 102, WDS 02186+4017 = EGG 2Aa, WDS 05542 - 2909 = FIN 382, WDS 06493- 0216 = FIN 322, and WDS 11495 - 4604 = FIN 366—the orbital elements are calculated for the first time. One of the five binaries, HDS 102, was discovered during the Hipparcos mission, whereas the remaining four were discovered between 1952 and 1965. All measured separations are less than 0farcs3 and most of the measures were done using the interferometric techniques. The orbital periods calculated are between 28 and 109 years. In addition to the orbital elements, the (O - C) residuals in θ and ρ, masses, dynamical parallaxes, absolute magnitudes, and ephemerides for the next five years are also given in this paper.
Close supermassive binary black holes
NASA Astrophysics Data System (ADS)
Gaskell, C. Martin
2010-01-01
It has been proposed that when the peaks of the broad emission lines in active galactic nuclei (AGNs) are significantly blueshifted or redshifted from the systemic velocity of the host galaxy, this could be a consequence of orbital motion of a supermassive blackhole binary (SMB). The AGN J1536+0441 (=SDSS J153636.22+044127.0) has recently been proposed as an example of this phenomenon. It is proposed here instead that 1536+044 is an example of line emission from a disc. If this is correct, the lack of clear optical spectral evidence for close SMBs is significant and argues either that the merging of close SMBs is much faster than has generally been hitherto thought, or if the approach is slow, that when the separation of the binary is comparable to the size of the torus and broad-line region, the feeding of the black holes is disrupted.
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.
Cool Star Binaries with ALEXIS
NASA Technical Reports Server (NTRS)
Stern, Robert A.
1998-01-01
We proposed to search for high-temperature, flare-produced Fe XXIII line emission from active cool star binary systems using the ALEXIS all-sky survey. Previous X-ray transient searches with ARIEL V and HEAO-1, and subsequent shorter duration monitoring with the GINGA and EXOSAT satellites demonstrated that active binaries can produce large (EM approximately equals 10(exp 55-56/cu cm) X-ray flares lasting several hours or longer. Hot plasma from these flares at temperatures of 10(exp 7)K or more should produce Fe XXIII line emission at lambda = 132.8 A, very near the peak response of ALEXIS telescopes 1A and 2A. Our primary goals were to estimate flare frequency for the largest flares in the active binary systems, and, if the data permitted, to derive a distribution of flare energy vs. frequency for the sample as a whole. After a long delay due to the initial problems with the ALEXIS attitude control, the heroic efforts on the part of the ALEXIS satellite team enabled us to carry out this survey. However, the combination of the higher than expected and variable background in the ALEXIS detectors, and the lower throughput of the ALEXIS telescopes resulted in no convincing detections of large flares from the active binary systems. In addition, vignetting-corrected effective exposure times from the ALEXIS aspect solution were not available prior to the end of this contract; therefore, we were unable to convert upper limits measured in ALEXIS counts to the equivalent L(sub EUV).
NASA Astrophysics Data System (ADS)
Tucker, Rebecca; Sowell, J. R.; Williamon, R. M.
2006-12-01
Differential UBV photoelectric photometry for the eclipsing binary MY Cyg is presented. The Wilson-Devinney program is used to solve simultaneously the three light curves together with previously published radial velocities. We determine absolute dimensions and estimate the age of the system. We compute color indices for the two stars and estimate color excesses. A comparison is made with the previous solution found with the Russell-Merrill method.
Binary stars in loose associations
NASA Astrophysics Data System (ADS)
Azulay, R.; Guirado, J. C.; Marcaide, J. M.; Martí-Vidal, I.
2013-05-01
Precise determinations of dynamical masses of pre-main-sequence (PMS) stars are necessary to calibrate PMS stellar evolutionary models, whose predictions are in disagreement with measurements for masses below 1.2 M_{⊙}. Binary stars in young, nearby loose associations (moving groups) are particularly good candidates, primarily because all members share a common age. Belonging to the AB Doradus moving group, we have observed the binary AB Dor Ba/Bb, 0.06" separation, with the Australian Long Baseline Array at 8.4 GHz. We have detected the two components Ba/Bb, which facilitates (i) a measurement of the relative orbital motion through subsequent radio maps, and (ii) an estimate of the orbital parameters, once combined the radio information with infrared relative astrometry. Our preliminary analysis shows that best-fit orbit corresponds to that with a period of 1.1 yr and semi major axis of 0.068". The sum of the masses AB Dor Ba/Bb is 0.3±0.1 M_{⊙}. The study of this binary, along with other stars of the same association, will constitute a benchmark for testing PMS models of low-mass stars.
The Long-Period Binary Frequency of the M67 Blue Stragglers and Binary-Binary Collisions
NASA Astrophysics Data System (ADS)
Leonard, P. J. T.
1993-12-01
The old open cluster M67 contains a dozen blue stragglers (BSs), one of which is a short-period spectroscopic binary, and thus is likely the result of binary mass transfer. A clue to the origin of the other BSs may be the fact that (>_ ~ ) 50% of them appear to be members of long-period (>10(3) days) binary systems (Milone et al. 1991, ASP Conference Series, 13, 424). If the majority of the M67 BSs are due to the slow coalescence of isolated binaries (Mateo et al. 1990, AJ, 100, 469), then there are two possible explanations for their anomalously high long-period binary frequency: 1) the frequency of triple star systems in M67 was initially similar to the binary frequency, and the inner components of some of these triple systems have merged to form BSs, or 2) the typical massive star in the core of M67 has suffered an exchange interaction with a binary star. The former solution requires a triple frequency that is vastly higher than in any other stellar population, and thus appears unlikely. The latter requires a rate of interactions involving binary stars in M67 so high that at least some of the BSs in the cluster must be the result of physical stellar collisions during binary-binary interactions. Consequently, one cannot accept the slow binary coalescence scenario for the M67 BSs without accepting that at least some of the M67 BSs have been produced via physical stellar collisions. Of course, the high long-period binary frequency of the M67 BSs can be naturally accounted for by the collisional hypothesis, since the majority of the merged stars produced by binary-binary collisions are expected to possess such companions (Leonard & Fahlman 1991, AJ, 102, 994; Leonard & Linnell 1992, AJ, 103, 1928). The high binary frequency observed in M67 (e.g., Montgomery et al. 1993, AJ, 106, 181) makes binary-binary interactions inevitable, and thus the collisional hypothesis appears to be quite a realistic possibility.
GALAXY ROTATION AND RAPID SUPERMASSIVE BINARY COALESCENCE
Holley-Bockelmann, Kelly; Khan, Fazeel Mahmood
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 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.
Pulsed Accretion onto Eccentric and Circular Binaries
NASA Astrophysics Data System (ADS)
Muñoz, Diego J.; Lai, Dong
2016-08-01
We present numerical simulations of circumbinary accretion onto eccentric and circular binaries using the moving-mesh code AREPO. This is the first set of simulations to tackle the problem of binary accretion using a finite-volume scheme on a freely moving mesh, which allows for accurate measurements of accretion onto individual stars for arbitrary binary eccentricity. While accretion onto a circular binary shows bursts with period of ˜ 5 times the binary period P b, accretion onto an eccentric binary is predominantly modulated at the period ˜ 1{P}{{b}}. For an equal-mass circular binary, the accretion rates onto individual stars are quite similar to each other, following the same variable pattern in time. By contrast, for eccentric binaries, one of the stars can accrete at a rate 10–20 times larger than its companion. This “symmetry breaking” between the stars, however, alternates over timescales of order 200P b and can be attributed to a slowly precessing, eccentric circumbinary disk. Over longer timescales, the net accretion rates onto individual stars are the same, reaching a quasi-steady state with the circumbinary disk. These results have important implications for the accretion behavior of binary T Tauri stars and supermassive binary black holes.
Pulsed Accretion onto Eccentric and Circular Binaries
NASA Astrophysics Data System (ADS)
Muñoz, Diego J.; Lai, Dong
2016-08-01
We present numerical simulations of circumbinary accretion onto eccentric and circular binaries using the moving-mesh code AREPO. This is the first set of simulations to tackle the problem of binary accretion using a finite-volume scheme on a freely moving mesh, which allows for accurate measurements of accretion onto individual stars for arbitrary binary eccentricity. While accretion onto a circular binary shows bursts with period of ˜ 5 times the binary period P b, accretion onto an eccentric binary is predominantly modulated at the period ˜ 1{P}{{b}}. For an equal-mass circular binary, the accretion rates onto individual stars are quite similar to each other, following the same variable pattern in time. By contrast, for eccentric binaries, one of the stars can accrete at a rate 10-20 times larger than its companion. This “symmetry breaking” between the stars, however, alternates over timescales of order 200P b and can be attributed to a slowly precessing, eccentric circumbinary disk. Over longer timescales, the net accretion rates onto individual stars are the same, reaching a quasi-steady state with the circumbinary disk. These results have important implications for the accretion behavior of binary T Tauri stars and supermassive binary black holes.
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.
DUST GRAIN EVOLUTION IN SPATIALLY RESOLVED T TAURI BINARIES
Skemer, Andrew J.; Close, Laird M.; Hinz, Philip M.; Hoffmann, William F.; Males, Jared R.; Greene, Thomas P.
2011-10-10
Core-accretion planet formation begins in protoplanetary disks with the growth of small, interstellar medium dust grains into larger particles. The progress of grain growth, which can be quantified using 10 {mu}m silicate spectroscopy, has broad implications for the final products of planet formation. Previous studies have attempted to correlate stellar and disk properties with the 10 {mu}m silicate feature in an effort to determine which stars are efficient at grain growth. Thus far there does not appear to be a dominant correlated parameter. In this paper, we use spatially resolved adaptive optics spectroscopy of nine T Tauri binaries as tight as 0.''25 to determine if basic properties shared between binary stars, such as age, composition, and formation history, have an effect on dust grain evolution. We find with 90%-95% confidence that the silicate feature equivalent widths of binaries are more similar than those of randomly paired single stars, implying that shared properties do play an important role in dust grain evolution. At lower statistical significance, we find with 82% confidence that the secondary has a more prominent silicate emission feature (i.e., smaller grains) than the primary. If confirmed by larger surveys, this would imply that spectral type and/or binarity are important factors in dust grain evolution.
Evolution of binary stars in multiple-population globular clusters - II. Compact binaries
NASA Astrophysics Data System (ADS)
Hong, Jongsuk; Vesperini, Enrico; Sollima, Antonio; McMillan, Stephen L. W.; D'Antona, Franca; D'Ercole, Annibale
2016-04-01
We present the results of a survey of N-body simulations aimed at exploring the evolution of compact binaries in multiple-population globular clusters. We show that as a consequence of the initial differences in the structural properties of the first-generation (FG) and the second-generation (SG) populations and the effects of dynamical processes on binary stars, the SG binary fraction decreases more rapidly than that of the FG population. The difference between the FG and SG binary fraction is qualitatively similar to but quantitatively smaller than that found for wider binaries in our previous investigations. The evolution of the radial variation of the binary fraction is driven by the interplay between binary segregation, ionization and ejection. Ionization and ejection counteract in part the effects of mass segregation but for compact binaries the effects of segregation dominate and the inner binary fraction increases during the cluster evolution. We explore the variation of the difference between the FG and the SG binary fraction with the distance from the cluster centre and its dependence on the binary binding energy and cluster structural parameters. The difference between the binary fraction in the FG and the SG populations found in our simulations is consistent with the results of observational studies finding a smaller binary fraction in the SG population.
Baresová, E; Grieszbach, G; Schack, B; Vilser, W; Bräuer-Burchardt, C; Senff, I
This study deals with methods focused on estimating blood velocity. The estimation of the linear trend function of a non-stationary signal based on the adaptive recursive estimation of the mean value function is used for the determination of the time delay of two indicator dilution curves. The filter property of this trend operator depends on the choice of a constant parameter c, the so-called adaptation factor. The functional connection between the filter property and the adaptation factor is considered in such a way that an objective calculation of arterial blood velocity in retinal vessels is possible.
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
Kotera, Masaaki; Tabei, Yasuo; Yamanishi, Yoshihiro; Muto, Ai; Moriya, Yuki; Tokimatsu, Toshiaki; Goto, Susumu
2014-01-01
Motivation: Metabolic pathway analysis is crucial not only in metabolic engineering but also in rational drug design. However, the biosynthetic/biodegradation pathways are known only for a small portion of metabolites, and a vast amount of pathways remain uncharacterized. Therefore, an important challenge in metabolomics is the de novo reconstruction of potential reaction networks on a metabolome-scale. Results: In this article, we develop a novel method to predict the multistep reaction sequences for de novo reconstruction of metabolic pathways in the reaction-filling framework. We propose a supervised approach to learn what we refer to as ‘multistep reaction sequence likeness’, i.e. whether a compound–compound pair is possibly converted to each other by a sequence of enzymatic reactions. In the algorithm, we propose a recursive procedure of using step-specific classifiers to predict the intermediate compounds in the multistep reaction sequences, based on chemical substructure fingerprints/descriptors of compounds. We further demonstrate the usefulness of our proposed method on the prediction of enzymatic reaction networks from a metabolome-scale compound set and discuss characteristic features of the extracted chemical substructure transformation patterns in multistep reaction sequences. Our comprehensively predicted reaction networks help to fill the metabolic gap and to infer new reaction sequences in metabolic pathways. Availability and implementation: Materials are available for free at http://web.kuicr.kyoto-u.ac.jp/supp/kot/ismb2014/ Contact: goto@kuicr.kyoto-u.ac.jp Supplementary information: Supplementary data are available at Bioinformatics online. PMID:24931980
NASA Astrophysics Data System (ADS)
Khristoforov, Mikhail; Kleptsyn, Victor; Triestino, Michele
2016-07-01
This paper is inspired by the problem of understanding in a mathematical sense the Liouville quantum gravity on surfaces. Here we show how to define a stationary random metric on self-similar spaces which are the limit of nice finite graphs: these are the so-called hierarchical graphs. They possess a well-defined level structure and any level is built using a simple recursion. Stopping the construction at any finite level, we have a discrete random metric space when we set the edges to have random length (using a multiplicative cascade with fixed law {m}). We introduce a tool, the cut-off process, by means of which one finds that renormalizing the sequence of metrics by an exponential factor, they converge in law to a non-trivial metric on the limit space. Such limit law is stationary, in the sense that glueing together a certain number of copies of the random limit space, according to the combinatorics of the brick graph, the obtained random metric has the same law when rescaled by a random factor of law {m} . In other words, the stationary random metric is the solution of a distributional equation. When the measure m has continuous positive density on {mathbf{R}+}, the stationary law is unique up to rescaling and any other distribution tends to a rescaled stationary law under the iterations of the hierarchical transformation. We also investigate topological and geometric properties of the random space when m is log-normal, detecting a phase transition influenced by the branching random walk associated to the multiplicative cascade.
2011-01-01
Background Evolution of the Brassica species has been recursively affected by polyploidy events, and comparison to their relative, Arabidopsis thaliana, provides means to explore their genomic complexity. Results A genome-wide physical map of a rapid-cycling strain of B. oleracea was constructed by integrating high-information-content fingerprinting (HICF) of Bacterial Artificial Chromosome (BAC) clones with hybridization to sequence-tagged probes. Using 2907 contigs of two or more BACs, we performed several lines of comparative genomic analysis. Interspecific DNA synteny is much better preserved in euchromatin than heterochromatin, showing the qualitative difference in evolution of these respective genomic domains. About 67% of contigs can be aligned to the Arabidopsis genome, with 96.5% corresponding to euchromatic regions, and 3.5% (shown to contain repetitive sequences) to pericentromeric regions. Overgo probe hybridization data showed that contigs aligned to Arabidopsis euchromatin contain ~80% of low-copy-number genes, while genes with high copy number are much more frequently associated with pericentromeric regions. We identified 39 interchromosomal breakpoints during the diversification of B. oleracea and Arabidopsis thaliana, a relatively high level of genomic change since their divergence. Comparison of the B. oleracea physical map with Arabidopsis and other available eudicot genomes showed appreciable 'shadowing' produced by more ancient polyploidies, resulting in a web of relatedness among contigs which increased genomic complexity. Conclusions A high-resolution genetically-anchored physical map sheds light on Brassica genome organization and advances positional cloning of specific genes, and may help to validate genome sequence assembly and alignment to chromosomes. All the physical mapping data is freely shared at a WebFPC site (http://lulu.pgml.uga.edu/fpc/WebAGCoL/brassica/WebFPC/; Temporarily password-protected: account: pgml; password: 123qwe123
Hybrid recursive active filters for duplexing in RF transmitter front-ends
NASA Astrophysics Data System (ADS)
Gottardo, Giuseppe; Donati, Giovanni; Musolff, Christian; Fischer, Georg; Felgentreff, Tilman
2016-08-01
Duplex filters in modern base transceiver stations shape the channel in order to perform common frequency division duplex operations. Usually, they are designed as cavity filters, which are expensive and have large dimensions. Thanks to the emerging digital technology and fast digital converters, it is possible to transfer the efforts of designing analog duplex filters into digital numeric algorithms applied to feedback structures, operating on power. This solution provides the shaping of the signal spectrum directly at the output of the radio frequency (RF) power amplifiers (PAs) relaxing the transmitter design especially in the duplexer and in the antenna sections. The design of a digital baseband feedback applied to the analog power RF amplifiers (hybrid filter) is presented and verified by measurements. A model to describe the hybrid system is investigated, and the relation between phase and resonance peaks of the resulting periodic band-pass transfer function is described. The stability condition of the system is analyzed using Nyquist criterion. A solution involving a number of digital feedback and forward branches is investigated defining the parameters of the recursive structure. This solution allows the closed loop system to show a periodic band pass with up to 500 kHz bandwidth at the output of the RF amplifier. The band-pass magnitude reaches up to 17 dB selectivity. The rejection of the PA noise in the out-of-band frequencies is verified by measurements. The filter is tested with a modulated LTE (Long Term Evolution) signal showing an ACPR (Adjacent Channel Power Ratio) enhancement of 10 dB of the transmitted signal.
Li Jing; Wang Meihua; Won, Minhee; Shaw, Edward G.; Coughlin, Christopher; Curran, Walter J.; Mehta, Minesh P.
2011-11-01
Purpose: Previous recursive partitioning analysis (RPA) of patients with malignant glioma (glioblastoma multiforme [GBM] and anaplastic astrocytoma [AA]) produced six prognostic groups (I-VI) classified by six factors. We sought here to determine whether the classification for GBM could be improved by using an updated Radiation Therapy Oncology Group (RTOG) GBM database excluding AA and by considering additional baseline variables. Methods and Materials: The new analysis considered 42 baseline variables and 1,672 GBM patients from the expanded RTOG glioma database. Patients receiving radiation only were excluded such that all patients received radiation+carmustine. 'Radiation dose received' was replaced with 'radiation dose assigned.' The new RPA models were compared with the original model by applying them to a test dataset comprising 488 patients from six other RTOG trials. Fitness of the original and new models was evaluated using explained variation. Results: The original RPA model explained more variations in survival in the test dataset than did the new models (20% vs. 15%) and was therefore chosen for further analysis. It was reduced by combining Classes V and VI to produce three prognostic classes (Classes III, IV, and V+VI), as Classes V and VI had indistinguishable survival in the test dataset. The simplified model did not further improve performance (explained variation 18% vs. 20%) but is easier to apply because it involves only four variables: age, performance status, extent of resection, and neurologic function. Applying this simplified model to the updated GBM database resulted in three distinct classes with median survival times of 17.1, 11.2, and 7.5 months for Classes III, IV, and V+VI, respectively. Conclusions: The final model, the simplified original RPA model combining Classes V and VI, resulted in three distinct prognostic groups defined by age, performance status, extent of resection, and neurologic function. This classification will be used
ERIC Educational Resources Information Center
Exceptional Parent, 1987
1987-01-01
Suggestions are presented for helping disabled individuals learn to use or adapt toothbrushes for proper dental care. A directory lists dental health instructional materials available from various organizations. (CB)
A multi-tiered wavefront sensor using binary optics
Neal, D.R.; Warren, M.E.; Gruetzner, J.K.; Smith, T.G.; Rosenthal, R.R.; McKechnie, T.S.
1994-05-01
Wavefront sensors have been used to make measurements in fluid- dynamics and for closed loop control of adaptive optics. In most common Shack-Hartmann wavefront wavefront sensors, the light is broken up into series of rectangular or hexagonal apertures that divide the light into a series of focal spots. The position of these focal spots is used to determine the wavefront slopes over each subaperture. Using binary optics technology, we have developed a hierarchical or fractal wavefront sensor that divides the subapertures up on a more optimal fashion. We have demonstrated this concept for up to four tiers and developed the wavefront reconstruction methods for both segmented adaptive optics and continous wavefront measurement.
A spectrum synthesis program for binary stars
NASA Technical Reports Server (NTRS)
Linnell, Albert P.; Hubeny, Ivan
1994-01-01
A new program produces synthetic spectra of binary stars at arbitrary values of orbital longitude, including longitudes of partial or complete eclipse. The stellar components may be distorted, either tidally or rotationally, or both. Either or both components may be rotating nonsynchronously. We illustrate the program performance with two cases: EE Peg, an eclipsing binary with small distortion, and SX Aur, an eclipsing binary that is close to contact.
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.
Close binary stars in globular clusters
NASA Technical Reports Server (NTRS)
Margon, Bruce
1991-01-01
Although close binary stars are thought theoretically to play a major role in globular cluster dynamics, virtually no non-degenerate close binaries are known in clusters. We review the status of observations in this area, and report on two new programs which are finally yielding candidate systems suitable for further study. One of the objects, a close eclipsing system in omega Cen, is also a big straggler, thus finally proving firm evidence that globular cluster blue stragglers really are binary stars.
Detecting Near-Extremal Binary Black Holes
NASA Astrophysics Data System (ADS)
Hemberger, Daniel
2014-03-01
There is an ongoing effort in the gravitational wave astronomy community to construct a template bank for Advanced LIGO that includes gravitational waveforms from binary black hole systems with high mass ratios and spins. Using numerical relativity simulations performed with the Spectral Einstein Code, we assess the prospects for detection and parameter estimation of binaries with spins above the expected template bank cutoff spin. This analysis is restricted to equal-mass, non-precessing binaries.
Shapes of binary asteroid primaries from photometric observations
NASA Astrophysics Data System (ADS)
Scheirich, Peter
2016-10-01
I will present results from a method which combine lightcurve inversion for single bodies and the method for inversion of lightcurves of occulting/eclipsing binary systems. A code developed by M. Kaasalainen and J. Durech for inversion of lightcurves of single bodies is adapted to fit our purposes. The original code uses a slightly elongated ellipsoid as an initial shape for optimization. We substituted this ellipsoid with a variety of shapes using Gaussian random spheres. This allowed the optimization algorithm to iterate to a range of final shapes.For each binary system, the short-period (rotational) component of its lightcurve is inverted using this code and a set of possible shapes of the primary are obtained. In the next step these shape models of the primary are, one by one, incorporated into the full model of the binary system and complete photometric data including the mutual events are fitted. Comparing synthetic lightcurves of the best-fit solutions with the observed data enables another narrowing of the selection of the possible shapes of the primary. This process is based on the times of phases of mutual events occurring on different geometries (i.e. the secondary passing in front of/behind the primary not only equator-on).We will also test a hypothesis that most of the primaries of the binary systems are similar in shape to each other. A figure resembling the shape of the primary of 1999 KW4, i.e., the top-shaped object with an equatorial ridge, will be used for the primary's shape. Its main characteristics – a polar flattening and width and height of the equatorial ridge, will be used as independent parameters. A variety of the shapes generated by a combination of these parameters will be used as an initial shapes for the optimization using the code described above.The work is supported by the Grant Agency of the Czech Republic, Grant 15-07193S.
Survival of planets around shrinking stellar binaries
NASA Astrophysics Data System (ADS)
Munoz, Diego Jose; Lai, Dong
2015-12-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 days, 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. We present new results (PNAS 112, 30, p 9264) on the orbital evolution of planets around binaries undergoing orbital decay by this "LK+tide" mechanism. From secular and N-body calculations, we show how 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. Either outcome can explain these planets' elusiveness to detection. Our results suggest that circumbinary planets around compact binaries could still exist, and we offer specific predictions as to what their orbital configurations should be like.
Survival of planets around shrinking stellar binaries.
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. PMID:26159412
Survival of planets around shrinking stellar binaries
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
Survival of planets around shrinking stellar binaries.
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.
Tomographic reconstruction of binary fields
NASA Astrophysics Data System (ADS)
Roux, Stéphane; Leclerc, Hugo; Hild, François
2012-09-01
A novel algorithm is proposed for reconstructing binary images from their projection along a set of different orientations. Based on a nonlinear transformation of the projection data, classical back-projection procedures can be used iteratively to converge to the sought image. A multiscale implementation allows for a faster convergence. The algorithm is tested on images up to 1 Mb definition, and an error free reconstruction is achieved with a very limited number of projection data, saving a factor of about 100 on the number of projections required for classical reconstruction algorithms.