Recursive adaptive frame integration limited
NASA Astrophysics Data System (ADS)
Rafailov, Michael K.
2006-05-01
Recursive Frame Integration Limited was proposed as a way to improve frame integration performance and mitigate issues related to high data rate needed for conventional frame integration. The technique applies two thresholds - one tuned for optimum probability of detection, the other to manage required false alarm rate - and allows a non-linear integration process that, along with Signal-to-Noise Ratio (SNR) gain, provides system designers more capability where cost, weight, or power considerations limit system data rate, processing, or memory capability. However, Recursive Frame Integration Limited may have performance issues when single frame SNR is really low. Recursive Adaptive Frame Integration Limited is proposed as a means to improve limited integration performance with really low single frame SNR. It combines the benefits of nonlinear recursive limited frame integration and adaptive thresholds with a kind of conventional frame integration.
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.
Recursive total-least-squares adaptive filtering
NASA Astrophysics Data System (ADS)
Dowling, Eric M.; DeGroat, Ronald D.
1991-12-01
In this paper a recursive total least squares (RTLS) adaptive filter is introduced and studied. The TLS approach is more appropriate and provides more accurate results than the LS approach when there is error on both sides of the adaptive filter equation; for example, linear prediction, AR modeling, and direction finding. The RTLS filter weights are updated in time O(mr) where m is the filter order and r is the dimension of the tracked subspace. In conventional adaptive filtering problems, r equals 1, so that updates can be performed with complexity O(m). The updates are performed by tracking an orthonormal basis for the smaller of the signal or noise subspaces using a computationally efficient subspace tracking algorithm. The filter is shown to outperform both LMS and RLS in terms of tracking and steady state tap weight error norms. It is also more versatile in that it can adapt its weight in the absence of persistent excitation, i.e., when the input data correlation matrix is near rank deficient. Through simulation, the convergence and tracking properties of the filter are presented and compared with LMS and RLS.
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.
Data rate management and real time operation: recursive adaptive frame integration of limited data
NASA Astrophysics Data System (ADS)
Rafailov, Michael K.
2006-08-01
Recursive Limited Frame Integration was proposed as a way to improve frame integration performance and mitigate issues related to high data rate needed to support conventional frame integration. The technique uses two thresholds -one tuned for optimum probability of detection, the other to manage required false alarm rate, and places integration process between those thresholds. This configuration allows a non-linear integration process that, along with Signal-to-Noise Ratio (SNR) gain, provides system designers more capability where cost, weight, or power considerations limit system data rate, processing, or memory capability. However, Recursive Frame Integration Limited may have performance issues when single-frame SNR is really low. Recursive Adaptive Limited Frame Integration was proposed as a means to improve limited integration performance with really low single-frame SNR. It combines the benefits of nonlinear recursive limited frame integration and adaptive thresholds with a kind of conventional frame integration. Adding the third threshold may help in managing real time operations. In the paper the Recursive Frame Integration is presented in form of multiple parallel recursive integration. Such an approach can help not only in data rate management but in mitigation of low single frame SNR issue for Recursive Integration as well as in real time operations with frame integration.
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.
NASA Technical Reports Server (NTRS)
Kelly, D. A.; Fermelia, A.; Lee, G. K. F.
1990-01-01
An adaptive Kalman filter design that utilizes recursive maximum likelihood parameter identification is discussed. At the center of this design is the Kalman filter itself, which has the responsibility for attitude determination. At the same time, the identification algorithm is continually identifying the system parameters. The approach is applicable to nonlinear, as well as linear systems. This adaptive Kalman filter design has much potential for real time implementation, especially considering the fast clock speeds, cache memory and internal RAM available today. The recursive maximum likelihood algorithm is discussed in detail, with special attention directed towards its unique matrix formulation. The procedure for using the algorithm is described along with comments on how this algorithm interacts with the Kalman filter.
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
NASA Astrophysics Data System (ADS)
Gao, Fang; Guo, Shuxu
2016-01-01
An efficient lossless compression scheme for hyperspectral images using conventional recursive least-squares (CRLS) predictor with adaptive prediction bands is proposed. The proposed scheme first calculates the preliminary estimates to form the input vector of the CRLS predictor. Then the number of bands used in prediction is adaptively selected by an exhaustive search for the number that minimizes the prediction residual. Finally, after prediction, the prediction residuals are sent to an adaptive arithmetic coder. Experiments on the newer airborne visible/infrared imaging spectrometer (AVIRIS) images in the consultative committee for space data systems (CCSDS) test set show that the proposed scheme yields an average compression performance of 3.29 (bits/pixel), 5.57 (bits/pixel), and 2.44 (bits/pixel) on the 16-bit calibrated images, the 16-bit uncalibrated images, and the 12-bit uncalibrated images, respectively. Experimental results demonstrate that the proposed scheme obtains compression results very close to clustered differential pulse code modulation-with-adaptive-prediction-length, which achieves best lossless compression performance for AVIRIS images in the CCSDS test set, and outperforms other current state-of-the-art schemes with relatively low computation complexity.
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.
Iterative version of the QRD for adaptive recursive least squares (RLS) filtering
NASA Astrophysics Data System (ADS)
Goetze, Juergen
1994-10-01
A modified version of the QR-decomposition (QRD) is presented. It uses approximate Givens rotations instead of exact Givens rotations, i.e., a matrix entry usually annihilated with an exact rotation by an angle (sigma) is only reduced by using an approximate rotation by an angle (sigma) . The approximation of the rotations is based on the idea of CORDIC. Evaluating a CORDIC-based approximate rotation is to determine the angle (sigma) equals (sigma) t equals arctan 2-t, which is closest to the exact rotation angle (sigma) . This angle (sigma) t is applied instead of (sigma) . Using approximate rotations for computing the QRD results in an iterative version of the original QRD. A recursive version of this QRD using CORDIC-based approximate rotations is applied to adaptive RLS filtering. Only a few angles of the CORDIC sequence, r say (r << b, where b is the word length), work as well as using exact rotations (r equals b, original CORDIC). The misadjustment error decreases as r increases. The convergence of the QRD-RLS algorithm, however, is insensitive to the value of r. Adapting the approximation accuracy during the course of the QRD-RLS algorithm is also discussed. Simulations (channel equalization) confirm the results.
NASA Astrophysics Data System (ADS)
Schneider, Martin; Kellermann, Walter
2016-01-01
Acoustic echo cancellation (AEC) is a well-known application of adaptive filters in communication acoustics. To implement AEC for multichannel reproduction systems, powerful adaptation algorithms like the generalized frequency-domain adaptive filtering (GFDAF) algorithm are required for satisfactory convergence behavior. In this paper, the GFDAF algorithm is rigorously derived as an approximation of the block recursive least-squares (RLS) algorithm. Thereby, the original formulation of the GFDAF algorithm is generalized while avoiding an error that has been in the original derivation. The presented algorithm formulation is applied to pruned transform-domain loudspeaker-enclosure-microphone models in a mathematically consistent manner. Such pruned models have recently been proposed to cope with the tremendous computational demands of massive multichannel AEC. Beyond its generalization, a regularization of the GFDAF is shown to have a close relation to the well-known block least-mean-squares algorithm.
Self-adaptive genetic algorithms with simulated binary crossover.
Deb, K; Beyer, H G
2001-01-01
Self-adaptation is an essential feature of natural evolution. However, in the context of function optimization, self-adaptation features of evolutionary search algorithms have been explored mainly with evolution strategy (ES) and evolutionary programming (EP). In this paper, we demonstrate the self-adaptive feature of real-parameter genetic algorithms (GAs) using a simulated binary crossover (SBX) operator and without any mutation operator. The connection between the working of self-adaptive ESs and real-parameter GAs with the SBX operator is also discussed. Thereafter, the self-adaptive behavior of real-parameter GAs is demonstrated on a number of test problems commonly used in the ES literature. The remarkable similarity in the working principle of real-parameter GAs and self-adaptive ESs shown in this study suggests the need for emphasizing further studies on self-adaptive GAs. PMID:11382356
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.
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.
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)
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).
Binary hologram generation based on shape adaptive sampling
NASA Astrophysics Data System (ADS)
Tsang, P. W. M.; Pan, Y.; Poon, T.-C.
2014-05-01
Past research has revealed that by down-sampling the projected intensity profile of a source object scene with a regular sampling lattice, a binary Fresnel hologram can be generated swiftly to preserve favorable quality on its reconstructed image. However, this method also results in a prominent textural pattern which is conflicting to the geometrical profile of the object scene, leading to an unnatural visual perception. In this paper, we shall overcome this problem with a down-sampling process that is adaptive to the geometry of the object. Experimental results demonstrate that by applying our proposed method to generate a binary hologram, the reconstructed image is rendered with a texture which abides with the shape of the three-dimensional object(s).
Watumull, Jeffrey; Hauser, Marc D; Roberts, Ian G; Hornstein, Norbert
2014-01-01
It is a truism that conceptual understanding of a hypothesis is required for its empirical investigation. However, the concept of recursion as articulated in the context of linguistic analysis has been perennially confused. Nowhere has this been more evident than in attempts to critique and extend Hauseretal's. (2002) articulation. These authors put forward the hypothesis that what is uniquely human and unique to the faculty of language-the faculty of language in the narrow sense (FLN)-is a recursive system that generates and maps syntactic objects to conceptual-intentional and sensory-motor systems. This thesis was based on the standard mathematical definition of recursion as understood by Gödel and Turing, and yet has commonly been interpreted in other ways, most notably and incorrectly as a thesis about the capacity for syntactic embedding. As we explain, the recursiveness of a function is defined independent of such output, whether infinite or finite, embedded or unembedded-existent or non-existent. And to the extent that embedding is a sufficient, though not necessary, diagnostic of recursion, it has not been established that the apparent restriction on embedding in some languages is of any theoretical import. Misunderstanding of these facts has generated research that is often irrelevant to the FLN thesis as well as to other theories of language competence that focus on its generative power of expression. This essay is an attempt to bring conceptual clarity to such discussions as well as to future empirical investigations by explaining three criterial properties of recursion: computability (i.e., rules in intension rather than lists in extension); definition by induction (i.e., rules strongly generative of structure); and mathematical induction (i.e., rules for the principled-and potentially unbounded-expansion of strongly generated structure). By these necessary and sufficient criteria, the grammars of all natural languages are recursive. PMID:24409164
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
AN ADAPTIVE OPTICS SURVEY FOR CLOSE PROTOSTELLAR BINARIES
Connelley, Michael S.; Reipurth, Bo; Tokunaga, Alan T.
2009-11-15
In order to test the hypothesis that Class I protostellar binary stars are a product of ejections during the dynamical decay of nonhierarchical multiple systems, we combined the results of new adaptive optics (AO) observations of Class I protostars with our previously published AO data to investigate whether Class I protostars with a widely separated companion (r > 200 AU) are more likely to also have a close companion (r < 200 AU). In total, we observed 47 embedded young stellar objects (YSOs) with either the Subaru natural guide star AO system or the Keck laser guide star AO system. We found that targets with a widely separated companion within 5000 AU are not more likely to have a close companion. However, targets with another YSO within a projected separation of 25,000 AU are much more likely to have a close companion. Most importantly, every target with a close companion has another YSO within a projected separation of 25,000 AU. We came to the same conclusions after considering a restricted sample of targets within 500 pc and close companions wider than 50 AU to minimize incompleteness effects. The Orion star-forming region was found to have an excess of both close binaries and YSOs within 25,000 AU compared to other star-forming regions. We interpret these observations as strong evidence that many close Class I binary stars form via ejections and that many of the ejected stars become unbound during the Class I phase.
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. PMID:25656756
Context adaptive binary arithmetic decoding on transport triggered architectures
NASA Astrophysics Data System (ADS)
Rouvinen, Joona; Jääskeläinen, Pekka; Rintaluoma, Tero; Silvén, Olli; Takala, Jarmo
2008-02-01
Video coding standards, such as MPEG-4, H.264, and VC1, define hybrid transform based block motion compensated techniques that employ almost the same coding tools. This observation has been a foundation for defining the MPEG Reconfigurable Multimedia Coding framework that targets to facilitate multi-format codec design. The idea is to send a description of the codec with the bit stream, and to reconfigure the coding tools accordingly on-the-fly. This kind of approach favors software solutions, and is a substantial challenge for the implementers of mobile multimedia devices that aim at high energy efficiency. In particularly as high definition formats are about to be required from mobile multimedia devices, variable length decoders are becoming a serious bottleneck. Even at current moderate mobile video bitrates software based variable length decoders swallow a major portion of the resources of a mobile processor. In this paper we present a Transport Triggered Architecture (TTA) based programmable implementation for Context Adaptive Binary Arithmetic de-Coding (CABAC) that is used e.g. in the main profile of H.264 and in JPEG2000. The solution can be used even for other variable length codes.
An Efficient Adaptive Binary Arithmetic Coder Based on Logarithmic Domain.
Yu, Quanhe; Yu, Wei; Yang, Ping; Zheng, Jianhua; Zheng, Xiaozhen; He, Yun
2015-11-01
This paper proposes an efficient adaptive binary arithmetic coder based on a logarithmic domain (LBAC) and a probability estimation based on the LBAC (P-LBAC). Both the LBAC and the P-LBAC achieve a high data-compression ratio with low complexity and a hardware-efficient structure. They introduce a mapping mechanism between the logarithmic domain and the original domain for both the coding process and the probability estimation. The proposed schemes have high accuracy and constitute an efficient BAC. The proposed LBAC and P-LBAC do not use either multiplication and division operations or lookup tables, and only addition and shifting operations are required. The proposed LBAC is designed to favor the coding of multiple symbols and has high throughput. The proposed P-LBAC achieves a good tradeoff between accuracy and speed in probability estimation through a single parameter. When the proposed algorithms are implemented on H.265/HEVC platforms, and they achieve a compression efficiency equivalent to that of CABAC. PMID:26241975
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.
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.
Measurements of Binary Stars with the Starfire Optical Range Adaptive Optics Systems
NASA Astrophysics Data System (ADS)
Barnaby, David; Spillar, Earl; Christou, Julian C.; Drummond, Jack D.
2000-01-01
To investigate the relative photometry produced by adaptive optics within the isoplanatic patch, we observed four binaries, 10 UMa, φ UMa, 81 Cnc, and κ UMa, with adaptive optics using natural guide stars on the 3.5 m telescope, as well as one binary, β Del, with adaptive optics using a laser guide star on the 1.5 m telescope at the Starfire Optical Range. Iterative blind deconvolution (IBD) and parametric blind deconvolution (PBD) techniques were used to postprocess the data, which produced consistent results for position angles, separations, and magnitude differences. We also conducted simulations that verify the agreement between IBD and PBD and compared their measurements to truth data. From the results of both observations and simulations, we conclude that adaptive optics is well suited for providing not only position angles and separations for close binaries, but also good relative magnitudes without quadrant ambiguity. From the observations, we find that the secondary of 81 Cnc (separation=0.12") appears to be 0.12 mag brighter than the primary at 0.85 μm and is, therefore, cooler. We also derive a new orbit for κ UMa (separation=0.067"). Our results for β Del (ADS 14073) have significantly improved precision compared with the 1998 analyses of the same data by ten Brummelaar and colleagues and by Roberts, ten Brummelaar, and Mason.
Sensitivity-based adaptive learning rules for binary feedforward neural networks.
Zhong, Shuiming; Zeng, Xiaoqin; Wu, Shengli; Han, Lixin
2012-03-01
This paper proposes a set of adaptive learning rules for binary feedforward neural networks (BFNNs) by means of the sensitivity measure that is established to investigate the effect of a BFNN's weight variation on its output. The rules are based on three basic adaptive learning principles: the benefit principle, the minimal disturbance principle, and the burden-sharing principle. In order to follow the benefit principle and the minimal disturbance principle, a neuron selection rule and a weight adaptation rule are developed. Besides, a learning control rule is developed to follow the burden-sharing principle. The advantage of the rules is that they can effectively guide the BFNN's learning to conduct constructive adaptations and avoid destructive ones. With these rules, a sensitivity-based adaptive learning (SBALR) algorithm for BFNNs is presented. Experimental results on a number of benchmark data demonstrate that the SBALR algorithm has better learning performance than the Madaline rule II and backpropagation algorithms. PMID:24808553
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…
Binary adaptive semi-global matching based on image edges
NASA Astrophysics Data System (ADS)
Hu, Han; Rzhanov, Yuri; Hatcher, Philip J.; Bergeron, R. D.
2015-07-01
Image-based modeling and rendering is currently one of the most challenging topics in Computer Vision and Photogrammetry. The key issue here is building a set of dense correspondence points between two images, namely dense matching or stereo matching. Among all dense matching algorithms, Semi-Global Matching (SGM) is arguably one of the most promising algorithms for real-time stereo vision. Compared with global matching algorithms, SGM aggregates matching cost from several (eight or sixteen) directions rather than only the epipolar line using Dynamic Programming (DP). Thus, SGM eliminates the classical "streaking problem" and greatly improves its accuracy and efficiency. In this paper, we aim at further improvement of SGM accuracy without increasing the computational cost. We propose setting the penalty parameters adaptively according to image edges extracted by edge detectors. We have carried out experiments on the standard Middlebury stereo dataset and evaluated the performance of our modified method with the ground truth. The results have shown a noticeable accuracy improvement compared with the results using fixed penalty parameters while the runtime computational cost was not increased.
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
Distinctive signatures of recursion
Martins, Maurício Dias
2012-01-01
Although recursion has been hypothesized to be a necessary capacity for the evolution of language, the multiplicity of definitions being used has undermined the broader interpretation of empirical results. I propose that only a definition focused on representational abilities allows the prediction of specific behavioural traits that enable us to distinguish recursion from non-recursive iteration and from hierarchical embedding: only subjects able to represent recursion, i.e. to represent different hierarchical dependencies (related by parenthood) with the same set of rules, are able to generalize and produce new levels of embedding beyond those specified a priori (in the algorithm or in the input). The ability to use such representations may be advantageous in several domains: action sequencing, problem-solving, spatial navigation, social navigation and for the emergence of conventionalized communication systems. The ability to represent contiguous hierarchical levels with the same rules may lead subjects to expect unknown levels and constituents to behave similarly, and this prior knowledge may bias learning positively. Finally, a new paradigm to test for recursion is presented. Preliminary results suggest that the ability to represent recursion in the spatial domain recruits both visual and verbal resources. Implications regarding language evolution are discussed. PMID:22688640
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 novel approach for SEMG signal classification with adaptive local binary patterns.
Ertuğrul, Ömer Faruk; Kaya, Yılmaz; Tekin, Ramazan
2016-07-01
Feature extraction plays a major role in the pattern recognition process, and this paper presents a novel feature extraction approach, adaptive local binary pattern (aLBP). aLBP is built on the local binary pattern (LBP), which is an image processing method, and one-dimensional local binary pattern (1D-LBP). In LBP, each pixel is compared with its neighbors. Similarly, in 1D-LBP, each data in the raw is judged against its neighbors. 1D-LBP extracts feature based on local changes in the signal. Therefore, it has high a potential to be employed in medical purposes. Since, each action or abnormality, which is recorded in SEMG signals, has its own pattern, and via the 1D-LBP these (hidden) patterns may be detected. But, the positions of the neighbors in 1D-LBP are constant depending on the position of the data in the raw. Also, both LBP and 1D-LBP are very sensitive to noise. Therefore, its capacity in detecting hidden patterns is limited. To overcome these drawbacks, aLBP was proposed. In aLBP, the positions of the neighbors and their values can be assigned adaptively via the down-sampling and the smoothing coefficients. Therefore, the potential to detect (hidden) patterns, which may express an illness or an action, is really increased. To validate the proposed feature extraction approach, two different datasets were employed. Achieved accuracies by the proposed approach were higher than obtained results by employed popular feature extraction approaches and the reported results in the literature. Obtained accuracy results were brought out that the proposed method can be employed to investigate SEMG signals. In summary, this work attempts to develop an adaptive feature extraction scheme that can be utilized for extracting features from local changes in different categories of time-varying signals. PMID:26718556
Recursive splicing in long vertebrate genes
Blazquez, Lorea; Faro, Ana; Haberman, Nejc; Briese, Michael; Trabzuni, Daniah; Ryten, Mina; Weale, Michael E; Hardy, John; Modic, Miha; Curk, Tomaž; Wilson, Stephen W; Plagnol, Vincent; Ule, Jernej
2015-01-01
It is generally believed that splicing removes introns as single units from pre-mRNA transcripts. However, some long D. melanogaster introns contain a cryptic site, called a recursive splice site (RS-site), that enables a multi-step process of intron removal termed recursive splicing1,2. The extent to which recursive splicing occurs in other species and its mechanistic basis remain unclear. Here we identify highly conserved RS-sites in genes expressed in the mammalian brain that encode proteins functioning in neuronal development. Moreover, the RS-sites are found in some of the longest introns across vertebrates. We find that vertebrate recursive splicing requires initial definition of a “RS-exon” that follows the RS-site. The RS-exon is then excluded from the dominant mRNA isoform due to competition with a reconstituted 5′ splice site formed at the RS-site after the first splicing step. Conversely, the RS-exon is included when preceded by cryptic exons or promoters that are prevalent in long introns, but which fail to reconstitute an efficient 5′ splice site. Most RS-exons contain a premature stop codon such that their inclusion may decrease mRNA stability. Thus, by establishing a binary splicing switch, RS-sites demarcate different mRNA isoforms emerging from long genes by coupling inclusion of cryptic elements with RS-exons. PMID:25970246
Recursive splicing in long vertebrate genes.
Sibley, Christopher R; Emmett, Warren; Blazquez, Lorea; Faro, Ana; Haberman, Nejc; Briese, Michael; Trabzuni, Daniah; Ryten, Mina; Weale, Michael E; Hardy, John; Modic, Miha; Curk, Tomaž; Wilson, Stephen W; Plagnol, Vincent; Ule, Jernej
2015-05-21
It is generally believed that splicing removes introns as single units from precursor messenger RNA transcripts. However, some long Drosophila melanogaster introns contain a cryptic site, known as a recursive splice site (RS-site), that enables a multi-step process of intron removal termed recursive splicing. The extent to which recursive splicing occurs in other species and its mechanistic basis have not been examined. Here we identify highly conserved RS-sites in genes expressed in the mammalian brain that encode proteins functioning in neuronal development. Moreover, the RS-sites are found in some of the longest introns across vertebrates. We find that vertebrate recursive splicing requires initial definition of an 'RS-exon' that follows the RS-site. The RS-exon is then excluded from the dominant mRNA isoform owing to competition with a reconstituted 5' splice site formed at the RS-site after the first splicing step. Conversely, the RS-exon is included when preceded by cryptic promoters or exons that fail to reconstitute an efficient 5' splice site. Most RS-exons contain a premature stop codon such that their inclusion can decrease mRNA stability. Thus, by establishing a binary splicing switch, RS-sites demarcate different mRNA isoforms emerging from long genes by coupling cryptic elements with inclusion of RS-exons. PMID:25970246
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 GeMS Multi-Conjugate Adaptive Optics System
NASA Astrophysics Data System (ADS)
Opitz, Daniela; Tinney, Chris
2015-01-01
The NASA Wide-field Infrared Survey Explorer (WISE) has delivered an exceptional harvest of new ultra-cool Y-type brown dwarfs. We present results from a diffraction-limited study of the binary status of a sample of Y dwarfs observed with the Gemini GeMS Multi-Conjugate Adaptive Optics System. We report no evidence of equal mass/luminosity binaries at separations larger than ˜ 0.5-2.0 AU for five Y dwarfs.
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.
Lewis, A.A.
1981-11-01
It is the purpose of the present study to indicate the means by which Kramer's results may be generalized to considerations of stronger computing devices than the finite state automata considered in Kramer's approach, and to domains of alternatives having the cardinality of the continuum. The means we employ in the approach makes use of the theory of recursive functions in the context of Church's Thesis. The result, which we consider as a preliminary result to a more general research program, shows that a choice function that is rational in the sense of Richter (not necessarily regular) when defined on a restricted family of subsets of a continuum of alternatives, when recursively represented by a partial predicate on equivalence classes of approximations by rational numbers, is recursively unsolvable. By way of Church's Thesis, therefore, such a function cannot be realized by means of a very general class of effectively computable procedures. An additional consequence that can be derived from the result of recursive unsolvability of rational choice in this setting is the placement of a minimal bound on the amount of computational complexity entailed by effective realizations of rational choice.
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
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…
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…
NASA Astrophysics Data System (ADS)
Kim, Mu J.; Hyde, Milo W.
2012-10-01
An improved binary material-classification algorithm using passive polarimetric imagery degraded by atmospheric turbulence is presented. The technique implements a modified version of an existing polarimetric blind-deconvolution algorithm in order to remove atmospheric distortion and correctly classify the unknown object. The classification decision, dielectric or metal in this case, is based on degree of linear polarization (DoLP) estimates provided by the blind-deconvolution algorithm augmented by two DoLP priors - one statistically modeling the polarization behavior of metals and the other statistically modeling the polarization behavior of dielectrics. The DoLP estimate which maximizes the log-likelihood function determines the image pixel's classification. The method presented here significantly improves upon a similar published polarimetric classification method by adaptively updating the DoLP priors as more information becomes available about the scene. This new adaptive method significantly extends the range of validity of the existing polarimetric classification technique to near-normal collection geometries where most polarimetric material classifiers perform poorly. In this paper, brief reviews of the polarimetric blind-deconvolution algorithm and the functional forms of the DoLP priors are provided. Also provided is the methodology for making the algorithm adaptive including three techniques for updating the DoLP priors using in-progress DoLP estimates. Lastly, the proposed technique is experimentally validated by comparing classification results of two dielectric and metallic samples obtained using the new method to those obtained using the existing technique.
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
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.
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
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.
Searching for Binary Y dwarfs with the Gemini Multi-Conjugate Adaptive Optics System (GeMS)
NASA Astrophysics Data System (ADS)
Opitz, Daniela; Tinney, Chris
2015-08-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 be closely separated and are more frequently detected in near-equal mass configurations. The binary status of Y- type brown dwarfs is still unclear and therefore, determining if Y-type primaries hold the same trend, is of considerable interest. 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 from a diffraction-limited study of a sample of five WISE Y dwarfs observed with the Gemini Multi-Conjugate Adaptive Optics System (GeMS). We find no evidence for binary companions in these data, which suggests these systems are not equal luminosity (or equivalently equal mass) binaries at separations larger than ~ 0.3-1.9 AU.
NASA Astrophysics Data System (ADS)
Geoffray, H.
1998-10-01
This thesis work provides a complete study of a 1-5 μm infrared camera designed to be used with the adaptive optics system installed at the European Southern Observatory (ESO) 3.6 m telescope, from the laboratory characterization of the IRCCD 128x128 HgCdTe Focal Plane Array, to astronomical results obtained on a sample of Pre-Main-Sequence binaries.
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.
NASA Astrophysics Data System (ADS)
Prsa, A.; Zwitter, T.
2005-01-01
Eclipsing binaries are extremely attractive objects because absolute physical parameters (masses, luminosities, radii) of both components may be determined from observations. Since most efforts to extract these parameters were based on dedicated observing programmes, existing modelling code is based on interactivity. Gaia will make a revolutionary advance in shear number of observed eclipsing binaries and new methods for automatic handling must be introduced and thoroughly tested. This paper focuses on Nelder & Mead's downhill simplex method applied to a synthetically created test binary as it will be observed by Gaia.
Recursion relations from soft theorems
NASA Astrophysics Data System (ADS)
Luo, Hui; Wen, Congkao
2016-03-01
We establish a set of new on-shell recursion relations for amplitudes satisfying soft theorems. The recursion relations can apply to those amplitudes whose additional physical inputs from soft theorems are enough to overcome the bad large- z behaviour. This work is a generalization of the recursion relations recently obtained by Cheung et al. for amplitudes in scalar effective field theories with enhanced vanishing soft behaviours, which can be regarded as a special case of those with non-vanishing soft limits. We apply the recursion relations to tree-level amplitudes in various theories, including amplitudes in the Akulov-Volkov theory and amplitudes containing dilatons of spontaneously-broken conformal symmetry.
Recursive Algorithm For Linear Regression
NASA Technical Reports Server (NTRS)
Varanasi, S. V.
1988-01-01
Order of model determined easily. Linear-regression algorithhm includes recursive equations for coefficients of model of increased order. Algorithm eliminates duplicative calculations, facilitates search for minimum order of linear-regression model fitting set of data satisfactory.
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
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
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.
Robust recursive impedance estimation for automotive lithium-ion batteries
NASA Astrophysics Data System (ADS)
Fridholm, Björn; Wik, Torsten; Nilsson, Magnus
2016-02-01
Recursive algorithms, such as recursive least squares (RLS) or Kalman filters, are commonly used in battery management systems to estimate the electrical impedance of the battery cell. However, these algorithms can in some cases run into problems with bias and even divergence of the estimates. This article illuminates problems that can arise in the online estimation using recursive methods, and lists modifications to handle these issues. An algorithm is also proposed that estimates the impedance by separating the problem in two parts; one estimating the ohmic resistance with an RLS approach, and another one where the dynamic effects are estimated using an adaptive Kalman filter (AKF) that is novel in the battery field. The algorithm produces robust estimates of ohmic resistance and time constant of the battery cell in closed loop with SoC estimation, as demonstrated by both in simulations and with experimental data from a lithium-ion battery cell.
Recursive computer architecture for VLSI
Treleaven, P.C.; Hopkins, R.P.
1982-01-01
A general-purpose computer architecture based on the concept of recursion and suitable for VLSI computer systems built from replicated (lego-like) computing elements is presented. The recursive computer architecture is defined by presenting a program organisation, a machine organisation and an experimental machine implementation oriented to VLSI. The experimental implementation is being restricted to simple, identical microcomputers each containing a memory, a processor and a communications capability. This future generation of lego-like computer systems are termed fifth generation computers by the Japanese. 30 references.
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.
Real-time motion-adaptive delivery (MAD) using binary MLC: I. Static beam (topotherapy) delivery
NASA Astrophysics Data System (ADS)
Lu, Weiguo
2008-11-01
Intra-fraction target motion hits the fundamental basis of IMRT where precise target positions are assumed. Real-time motion compensation is necessary to ensure that the same dose is delivered as planned. Strategies for conventional IMRT delivery for moving targets by dynamic multi-leaf collimators (MLC) tracking are well published. Binary MLC-based IMRT, such as TomoTherapy®, requires synchronized motion of MLC, the couch and the gantry, which suggests a unique motion management strategy. Thanks to its ultra-fast leaf response and fast projection rate, real-time motion compensation for binary MLC-based IMRT is feasible. Topotherapy is a new IMRT delivery technique, which can be implemented in commercial helical TomoTherapy® machines using only fixed gantry positions. In this paper, we present a novel approach for TopoTherapy delivery that adjusts for moving targets without additional hardware and control requirement. This technique uses the planned leaf sequence but rearranges the projection and leaf indices. It does not involve time-consuming operations, such as reoptimization. Unlike gating or breath-hold-based methods, this technique can achieve nearly a 100% duty cycle with little breath control. Unlike dynamic MLC-based tracking methods, this technique requires neither the whole target motion trajectory nor the velocity of target motion. Instead, it only requires instantaneous target positions, which greatly simplifies the system implementation. Extensive simulations, including the worst-case scenarios, validated the presented technique to be applicable to relatively regular or mild irregular respirations. The delivered dose conforms well to the target, and significant margin reduction can be achieved provided that accurate, real-time tumor localization is available.
Core Recursive Hierarchical Image Segmentation
NASA Technical Reports Server (NTRS)
Tilton, James
2011-01-01
The Recursive Hierarchical Image Segmentation (RHSEG) software has been repackaged to provide a version of the RHSEG software that is not subject to patent restrictions and that can be released to the general public through NASA GSFC's Open Source release process. Like the Core HSEG Software Package, this Core RHSEG Software Package also includes a visualization program called HSEGViewer along with a utility program HSEGReader. It also includes an additional utility program called HSEGExtract. The unique feature of the Core RHSEG package is that it is a repackaging of the RHSEG technology designed to specifically avoid the inclusion of the certain software technology. Unlike the Core HSEG package, it includes the recursive portions of the technology, but does not include processing window artifact elimination technology.
Recursive Abstractions for Parameterized Systems
NASA Astrophysics Data System (ADS)
Jaffar, Joxan; Santosa, Andrew E.
We consider a language of recursively defined formulas about arrays of variables, suitable for specifying safety properties of parameterized systems. We then present an abstract interpretation framework which translates a paramerized system as a symbolic transition system which propagates such formulas as abstractions of underlying concrete states. The main contribution is a proof method for implications between the formulas, which then provides for an implementation of this abstract interpreter.
Code division controlled-MAC in wireless sensor network by adaptive binary signature design
NASA Astrophysics Data System (ADS)
Wei, Lili; Batalama, Stella N.; Pados, Dimitris A.; Suter, Bruce
2007-04-01
We consider the problem of signature waveform design for code division medium-access-control (MAC) of wireless sensor networks (WSN). In contract to conventional randomly chosen orthogonal codes, an adaptive signature design strategy is developed under the maximum pre-detection SINR (signal to interference plus noise ratio) criterion. The proposed algorithm utilizes slowest descent cords of the optimization surface to move toward the optimum solution and exhibits, upon eigenvector decomposition, linear computational complexity with respect to signature length. Numerical and simulation studies demonstrate the performance of the proposed method and offer comparisons with conventional signature code sets.
Arabaci, Murat; Djordjevic, Ivan B; Saunders, Ross; Marcoccia, Roberto M
2010-02-01
In order to achieve high-speed transmission over optical transport networks (OTNs) and maximize its throughput, we propose using a rate-adaptive polarization-multiplexed coded multilevel modulation with coherent detection based on component non-binary quasi-cyclic (QC) LDPC codes. Compared to prior-art bit-interleaved LDPC-coded modulation (BI-LDPC-CM) scheme, the proposed non-binary LDPC-coded modulation (NB-LDPC-CM) scheme not only reduces latency due to symbol- instead of bit-level processing but also provides either impressive reduction in computational complexity or striking improvements in coding gain depending on the constellation size. As the paper presents, compared to its prior-art binary counterpart, the proposed NB-LDPC-CM scheme addresses the needs of future OTNs, which are achieving the target BER performance and providing maximum possible throughput both over the entire lifetime of the OTN, better. PMID:20174010
Recursive time-varying filter banks for subband image coding
NASA Technical Reports Server (NTRS)
Smith, Mark J. T.; Chung, Wilson C.
1992-01-01
Filter banks and wavelet decompositions that employ recursive filters have been considered previously and are recognized for their efficiency in partitioning the frequency spectrum. This paper presents an analysis of a new infinite impulse response (IIR) filter bank in which these computationally efficient filters may be changed adaptively in response to the input. The filter bank is presented and discussed in the context of finite-support signals with the intended application in subband image coding. In the absence of quantization errors, exact reconstruction can be achieved and by the proper choice of an adaptation scheme, it is shown that IIR time-varying filter banks can yield improvement over conventional ones.
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…
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.
Recursive Bayesian electromagnetic refractivity estimation from radar sea clutter
NASA Astrophysics Data System (ADS)
Vasudevan, Sathyanarayanan; Anderson, Richard H.; Kraut, Shawn; Gerstoft, Peter; Rogers, L. Ted; Krolik, Jeffrey L.
2007-04-01
Estimation of the range- and height-dependent index of refraction over the sea surface facilitates prediction of ducted microwave propagation loss. In this paper, refractivity estimation from radar clutter returns is performed using a Markov state space model for microwave propagation. Specifically, the parabolic approximation for numerical solution of the wave equation is used to formulate the refractivity from clutter (RFC) problem within a nonlinear recursive Bayesian state estimation framework. RFC under this nonlinear state space formulation is more efficient than global fitting of refractivity parameters when the total number of range-varying parameters exceeds the number of basis functions required to represent the height-dependent field at a given range. Moreover, the range-recursive nature of the estimator can be easily adapted to situations where the refractivity modeling changes at discrete ranges, such as at a shoreline. A fast range-recursive solution for obtaining range-varying refractivity is achieved by using sequential importance sampling extensions to state estimation techniques, namely, the forward and Viterbi algorithms. Simulation and real data results from radar clutter collected off Wallops Island, Virginia, are presented which demonstrate the ability of this method to produce propagation loss estimates that compare favorably with ground truth refractivity measurements.
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.
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
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
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.
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.
A Recursive Method for Calculating Certain Partition Functions.
ERIC Educational Resources Information Center
Woodrum, Luther; And Others
1978-01-01
Describes a simple recursive method for calculating the partition function and average energy of a system consisting of N electrons and L energy levels. Also, presents an efficient APL computer program to utilize the recursion relation. (Author/GA)
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,…
Boundary operators of BCFW recursion relation
NASA Astrophysics Data System (ADS)
Jin, Qingjun; Feng, Bo
2016-04-01
We show that boundary contributions of BCFW recursions can be interpreted as the form factors of some composite operators which we call `boundary operators'. The boundary operators can be extracted from the operator product expansion of deformed fields. We also present an algorithm to compute the boundary operators using path integral.
RECURSIVE PARAMETER ESTIMATION OF HYDROLOGIC MODELS
Proposed is a nonlinear filtering approach to recursive parameter estimation of conceptual watershed response models in state-space form. he conceptual model state is augmented by the vector of free parameters which are to be estimated from input-output data, and the extended Kal...
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.
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.
Adaptive Optics imaging of VHS 1256-1257: A Low Mass Companion to a Brown Dwarf Binary System
NASA Astrophysics Data System (ADS)
Stone, Jordan M.; Skemer, Andrew J.; Kratter, Kaitlin M.; Dupuy, Trent J.; Close, Laird M.; Eisner, Josh A.; Fortney, Jonathan J.; Hinz, Philip M.; Males, Jared R.; Morley, Caroline V.; Morzinski, Katie M.; Ward-Duong, Kimberly
2016-02-01
Recently, Gauza et al. reported the discovery of a companion to the late M-dwarf, VHS J125601.92-125723.9 (VHS 1256-1257). The companion’s absolute photometry suggests its mass and atmosphere are similar to the HR 8799 planets. However, as a wide companion to a late-type star, it is more accessible to spectroscopic characterization. We discovered that the primary of this system is an equal-magnitude binary. For an age ˜300 Myr the A and B components each have a mass of {64.6}-2.0+0.8 {M}{Jup}, and the b component has a mass of {11.2}-1.8+9.7, making VHS 1256-1257 only the third brown dwarf triple system. There exists some tension between the spectrophotometric distance of 17.2 ± 2.6 pc and the parallax distance of 12.7 ± 1.0 pc. At 12.7 pc VHS 1256-1257 A and B would be the faintest known M7.5 objects, and are even faint outliers among M8 types. If the larger spectrophotmetric distance is more accurate than the parallax, then the mass of each component increases. In particular, the mass of the b component increases well above the deuterium burning limit to ˜ 35 {M}{Jup} and the mass of each binary component increases to {73}-17+20 {M}{Jup}. At 17.1 pc, the UVW kinematics of the system are consistent with membership in the AB Dor moving group. The architecture of the system resembles a hierarchical stellar multiple suggesting it formed via an extension of the star formation process to low masses. Continued astrometric monitoring will resolve this distance uncertainty and will provide dynamical masses for a new benchmark system.
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.
BCFW recursion relations and string theory
NASA Astrophysics Data System (ADS)
Cheung, Clifford; O'Connell, Donal; Wecht, Brian
2010-09-01
We demonstrate that all tree-level string theory amplitudes can be computed using the BCFW recursion relations. Our proof utilizes the pomeron vertex operator introduced by Brower, Polchinski, Strassler, and Tan. Surprisingly, we find that in a particular large complex momentum limit, the asymptotic expansion of massless string amplitudes is identical in form to that of the corresponding field theory amplitudes. This observation makes manifest the fact that field-theoretic Yang-Mills and graviton amplitudes obey KLT-like relations. Moreover, we conjecture that in this large momentum limit certain string theory and field theory amplitudes are identical, and provide evidence for this conjecture. Additionally, we find a new recursion relation which relates tachyon amplitudes to lower-point tachyon amplitudes.
Acoustic multiple scattering using recursive algorithms
NASA Astrophysics Data System (ADS)
Amirkulova, Feruza A.; Norris, Andrew N.
2015-10-01
Acoustic multiple scattering by a cluster of cylinders in an acoustic medium is considered. A fast recursive technique is described which takes advantage of the multilevel Block Toeplitz structure of the linear system. A parallelization technique is described that enables efficient application of the proposed recursive algorithm for solving multilevel Block Toeplitz systems on high performance computer clusters. Numerical comparisons of CPU time and total elapsed time taken to solve the linear system using the direct LAPACK and TOEPLITZ libraries on Intel FORTRAN, show the advantage of the TOEPLITZ solver. Computations are optimized by multi-threading which displays improved efficiency of the TOEPLITZ solver with the increase of the number of scatterers and frequency.
Geomagnetic modeling by optimal recursive filtering
NASA Technical Reports Server (NTRS)
Gibbs, B. P.; Estes, R. H.
1981-01-01
The results of a preliminary study to determine the feasibility of using Kalman filter techniques for geomagnetic field modeling are given. Specifically, five separate field models were computed using observatory annual means, satellite, survey and airborne data for the years 1950 to 1976. Each of the individual field models used approximately five years of data. These five models were combined using a recursive information filter (a Kalman filter written in terms of information matrices rather than covariance matrices.) The resulting estimate of the geomagnetic field and its secular variation was propogated four years past the data to the time of the MAGSAT data. The accuracy with which this field model matched the MAGSAT data was evaluated by comparisons with predictions from other pre-MAGSAT field models. The field estimate obtained by recursive estimation was found to be superior to all other models.
Lauber, Chris; Kazem, Siamaque; Kravchenko, Alexander A.; Feltkamp, Mariet C.W.; Gorbalenya, Alexander E.
2015-01-01
It is common knowledge that conserved residues evolve slowly. We challenge generality of this central tenet of molecular biology by describing the fast evolution of a conserved nucleotide position that is located in the overlap of two open reading frames (ORFs) of polyomaviruses. The de novo ORF is expressed through either the ALTO protein or the Middle T antigen (MT/ALTO), while the ancestral ORF encodes the N-terminal domain of helicase-containing Large T (LT) antigen. In the latter domain the conserved Cys codon of the LXCXE pRB-binding motif constrains codon evolution in the overlapping MT/ALTO ORF to a binary choice between Val and Ala codons, termed here as codon-constrained Val-Ala (COCO-VA) toggling. We found the rate of COCO-VA toggling to approach the speciation rate and to be significantly accelerated compared to the baseline rate of chance substitution in a large monophyletic lineage including all viruses encoding MT/ALTO and three others. Importantly, the COCO-VA site is located in a short linear motif (SLiM) of an intrinsically disordered region, a typical characteristic of adaptive responders. These findings provide evidence that the COCO-VA toggling is under positive selection in many polyomaviruses, implying its critical role in interspecific adaptation, which is unprecedented for conserved residues. PMID:25904630
Broom, Donald M
2006-01-01
The term adaptation is used in biology in three different ways. It may refer to changes which occur at the cell and organ level, or at the individual level, or at the level of gene action and evolutionary processes. Adaptation by cells, especially nerve cells helps in: communication within the body, the distinguishing of stimuli, the avoidance of overload and the conservation of energy. The time course and complexity of these mechanisms varies. Adaptive characters of organisms, including adaptive behaviours, increase fitness so this adaptation is evolutionary. The major part of this paper concerns adaptation by individuals and its relationships to welfare. In complex animals, feed forward control is widely used. Individuals predict problems and adapt by acting before the environmental effect is substantial. Much of adaptation involves brain control and animals have a set of needs, located in the brain and acting largely via motivational mechanisms, to regulate life. Needs may be for resources but are also for actions and stimuli which are part of the mechanism which has evolved to obtain the resources. Hence pigs do not just need food but need to be able to carry out actions like rooting in earth or manipulating materials which are part of foraging behaviour. The welfare of an individual is its state as regards its attempts to cope with its environment. This state includes various adaptive mechanisms including feelings and those which cope with disease. The part of welfare which is concerned with coping with pathology is health. Disease, which implies some significant effect of pathology, always results in poor welfare. Welfare varies over a range from very good, when adaptation is effective and there are feelings of pleasure or contentment, to very poor. A key point concerning the concept of individual adaptation in relation to welfare is that welfare may be good or poor while adaptation is occurring. Some adaptation is very easy and energetically cheap and
Weighted Laplacians, cocycles and recursion relations
NASA Astrophysics Data System (ADS)
Krasnov, Kirill; Scarinci, Carlos
2013-11-01
Hodge's formula represents the gravitational MHV amplitude as the determinant of a minor of a certain matrix. When expanded, this determinant becomes a sum over weighted trees, which is the form of the MHV formula first obtained by Bern, Dixon, Perelstein, Rozowsky and rediscovered by Nguyen, Spradlin, Volovich and Wen. The gravity MHV amplitude satisfies the Britto, Cachazo, Feng and Witten recursion relation. The main building block of the MHV amplitude, the so-called half-soft function, satisfies a different, Berends-Giele-type recursion relation. We show that all these facts are illustrations to a more general story. We consider a weighted Laplacian for a complete graph of n vertices. The matrix tree theorem states that its diagonal minor determinants are all equal and given by a sum over spanning trees. We show that, for any choice of a cocycle on the graph, the minor determinants satisfy a Berends-Giele as well as Britto-Cachazo-Feng-Witten type recursion relation. Our proofs are purely combinatorial.
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
Ma, Yingliang; Saetzler, Kurt
2008-01-01
In this paper we describe a novel 3D subdivision strategy to extract the surface of binary image data. This iterative approach generates a series of surface meshes that capture different levels of detail of the underlying structure. At the highest level of detail, the resulting surface mesh generated by our approach uses only about 10% of the triangles in comparison to the marching cube algorithm (MC) even in settings were almost no image noise is present. Our approach also eliminates the so-called "staircase effect" which voxel based algorithms like the MC are likely to show, particularly if non-uniformly sampled images are processed. Finally, we show how the presented algorithm can be parallelized by subdividing 3D image space into rectilinear blocks of subimages. As the algorithm scales very well with an increasing number of processors in a multi-threaded setting, this approach is suited to process large image data sets of several gigabytes. Although the presented work is still computationally more expensive than simple voxel-based algorithms, it produces fewer surface triangles while capturing the same level of detail, is more robust towards image noise and eliminates the above-mentioned "staircase" effect in anisotropic settings. These properties make it particularly useful for biomedical applications, where these conditions are often encountered. PMID:17993710
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.
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
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
Elimination and recursions in the scattering equations
NASA Astrophysics Data System (ADS)
Cardona, Carlos; Kalousios, Chrysostomos
2016-05-01
We use the elimination theory to explicitly construct the (n - 3) ! order polynomial in one of the variables of the scattering equations. The answer can be given either in terms of a determinant of Sylvester type of dimension (n - 3) ! or a determinant of Bézout type of dimension (n - 4) !. We present a recursive formula for the Sylvester determinant. Expansion of the determinants yields expressions in terms of Plücker coordinates. Elimination of the rest of the variables of the scattering equations is also presented.
Modified Recursive Hierarchical Segmentation of Data
NASA Technical Reports Server (NTRS)
Tilton, James C.
2006-01-01
An algorithm and a computer program that implements the algorithm that performs recursive hierarchical segmentation (RHSEG) of data have been developed. While the current implementation is for two-dimensional data having spatial characteristics (e.g., image, spectral, or spectral-image data), the generalized algorithm also applies to three-dimensional or higher dimensional data and also to data with no spatial characteristics. The algorithm and software are modified versions of a prior RHSEG algorithm and software, the outputs of which often contain processing-window artifacts including, for example, spurious segmentation-image regions along the boundaries of processing-window edges.
Fast bilateral filtering using recursive moving sum
NASA Astrophysics Data System (ADS)
Igarashi, Masaki; Ikebe, Masayuki; Shimoyama, Sohsuke; Motohisa, Junichi
We propose a constant-time algorithm for a bilateral filter. Bilateral filter can be converted into the operation of three-dimensional (3D) convolution. By using recursive moving sum, we can reduce the number of calculations needed to construct a pseudo-Gaussian filter. Applying one-dimensional Gaussian filter to the 3D convolution, we achieved a constant-time bilateral filter. We used a 3-GHz CPU without SIMD instructions, or multi-thread operations. We confirmed our proposed bilateral filter to be processed in constant time. In practical conditions, high PSNR values over 40 dB are obtained.
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.
Recursive delay calculation unit for parametric beamformer
NASA Astrophysics Data System (ADS)
Nikolov, Svetoslav I.; Jensen, Jørgen A.; Tomov, Borislav
2006-03-01
This paper presents a recursive approach for parametric delay calculations for a beamformer. The suggested calculation procedure is capable of calculating the delays for any image line defined by an origin and arbitrary direction. It involves only add and shift operations making it suitable for hardware implementation. One delaycalculation unit (DCU) needs 4 parameters, and all operations can be implemented using fixed-point arithmetics. An N-channel system needs N+ 1 DCUs per line - one for the distance from the transmit origin to the image point and N for the distances from the image point to each of the receivers. Each DCU recursively calculates the square of the distance between a transducer element and a point on the beamformed line. Then it finds the approximate square root. The distance to point i is used as an initial guess for point i + 1. Using fixed-point calculations with 36-bit precision gives an error in the delay calculations on the order of 1/64 samples, at a sampling frequency of f s = 40 MHz. The circuit has been synthesized for a Virtex II Pro device speed grade 6 in two versions - a pipelined and a non-pipelined producing 150 and 30 million delays per second, respectively. The non-pipelined circuit occupies about 0.5 % of the FPGA resources and the pipelined one about 1 %. When the square root is found with a pipelined CORDIC processor, 2 % of the FPGA slices are used to deliver 150 million delays per second.
Improvement in Recursive Hierarchical Segmentation of Data
NASA Technical Reports Server (NTRS)
Tilton, James C.
2006-01-01
A further modification has been made in the algorithm and implementing software reported in Modified Recursive Hierarchical Segmentation of Data (GSC- 14681-1), NASA Tech Briefs, Vol. 30, No. 6 (June 2006), page 51. That software performs recursive hierarchical segmentation of data having spatial characteristics (e.g., spectral-image data). The output of a prior version of the software contained artifacts, including spurious segmentation-image regions bounded by processing-window edges. The modification for suppressing the artifacts, mentioned in the cited article, was addition of a subroutine that analyzes data in the vicinities of seams to find pairs of regions that tend to lie adjacent to each other on opposite sides of the seams. Within each such pair, pixels in one region that are more similar to pixels in the other region are reassigned to the other region. The present modification provides for a parameter ranging from 0 to 1 for controlling the relative priority of merges between spatially adjacent and spatially non-adjacent regions. At 1, spatially-adjacent-/spatially- non-adjacent-region merges have equal priority. At 0, only spatially-adjacent-region merges (no spectral clustering) are allowed. Between 0 and 1, spatially-adjacent- region merges have priority over spatially- non-adjacent ones.
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
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).
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,…
Post's program and incomplete recursively enumerable sets.
Harrington, L; Soare, R I
1991-01-01
A set A of nonnegative integers is recursively enumerable (r.e.) if A can be computably listed. It is shown that there is a first-order property, Q(X), definable in E, the lattice of r.e. sets under inclusion, such that (i) if A is any r.e. set satisfying Q(A) then A is nonrecursive and Turing incomplete and (ii) there exists an r.e. set A satisfying Q(A). This resolves a long open question stemming from Post's program of 1944, and it sheds light on the fundamental problem of the relationship between the algebraic structure of an r.e. set A and the (Turing) degree of information that A encodes. PMID:11607241
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.
Recursive SAM-based band selection for hyperspectral anomaly detection
NASA Astrophysics Data System (ADS)
He, Yuanlei; Liu, Daizhi; Yi, Shihua
2010-10-01
Band selection has been widely used in hyperspectral image processing for dimension reduction. In this paper, a recursive SAM-based band selection (RSAM-BBS) method is proposed. Once two initial bands are given, RSAM-BBS is performed in a sequential manner, and at each step the band that can best describe the spectral separation of two hyperspectral signatures is added to the bands already selected until the spectral angle reaches its maximum. In order to demonstrate the utility of the proposed band selection method, an anomaly detection algorithm is developed, which first extracts the anomalous target spectrum from the original image using automatic target detection and classification algorithm (ATDCA), followed by maximum spectral screening (MSS) to estimate the background average spectrum, then implements RSAM-BBS to select bands that participate in the subsequent adaptive cosine estimator (ACE) target detection. As shown in the experimental result on the AVIRIS dataset, less than five bands selected by the RSAM-BBS can achieve comparable detection performance using the full bands.
NASA Astrophysics Data System (ADS)
Noll, Keith S.
2015-08-01
The Pluto-Charon binary was the first trans-neptunian binary to be identified in 1978. Pluto-Charon is a true binary with both components orbiting a barycenter located between them. The Pluto system is also the first, and to date only, known binary with a satellite system consisting of four small satellites in near-resonant orbits around the common center of mass. Seven other Plutinos, objects in 3:2 mean motion resonance with Neptune, have orbital companions including 2004 KB19 reported here for the first time. Compared to the Cold Classical population, the Plutinos differ in the frequency of binaries, the relative sizes of the components, and their inclination distribution. These differences point to distinct dynamical histories and binary formation processes encountered by Plutinos.
Ward identity implies recursion relations in Yang-Mills theory
NASA Astrophysics Data System (ADS)
Chen, Gang
2012-07-01
The Ward identity in gauge theory constrains the behavior of the amplitudes. We discuss the Ward identity for amplitudes with a pair of shifted lines with complex momenta. This will induce a recursion relation identical to Britto-Cachazo-Feng-Witten recursion relations at the finite poles of the complexified amplitudes. Furthermore, according to the Ward identity, it is also possible to transform the boundary term into a simple form, which can be obtained by a new recursion relation. For the amplitude with one off-shell line in pure Yang-Mills theory, we find this technique is effective for obtaining the amplitude even when there are boundary contributions.
Recursive causality in evolution: a model for epigenetic mechanisms in cancer development.
Haslberger, A; Varga, F; Karlic, H
2006-01-01
Interactions between adaptative and selective processes are illustrated in the model of recursive causality as defined in Rupert Riedl's systems theory of evolution. One of the main features of this theory also termed as theory of evolving complexity is the centrality of the notion of 'recursive' or 'feedback' causality - 'the idea that every biological effect in living systems, in some way, feeds back to its own cause'. Our hypothesis is that "recursive" or "feedback" causality provides a model for explaining the consequences of interacting genetic and epigenetic mechanisms which are known to play a key role in development of cancer. Epigenetics includes any process that alters gene activity without changes of the DNA sequence. The most important epigenetic mechanisms are DNA-methylation and chromatin remodeling. Hypomethylation of so-called oncogenes and hypermethylation of tumor suppressor genes appear to be critical determinants of cancer. Folic acid, vitamin B12 and other nutrients influence the function of enzymes that participate in various methylation processes by affecting the supply of methyl groups into a variety of molecules which may be directly or indirectly associated with cancerogenesis. We present an example from our own studies by showing that vitamin D3 has the potential to de-methylate the osteocalcin-promoter in MG63 osteosarcoma cells. Consequently, a stimulation of osteocalcin synthesis can be observed. The above mentioned enzymes also play a role in development and differentiation of cells and organisms and thus illustrate the close association between evolutionary and developmental mechanisms. This enabled new ways to understand the interaction between the genome and environment and may improve biomedical concepts including environmental health aspects where epigenetic and genetic modifications are closely associated. Recent observations showed that methylated nucleotides in the gene promoter may serve as a target for solar UV
Statistical Error Analysis for Digital Recursive Filters
NASA Astrophysics Data System (ADS)
Wu, Kevin Chi-Rung
can see that floating-point arithmetic is less sensitive to maximum/minimum value of a matrix. Implementation of parallelism on complex-valued matrix can be justified in the sense of simpler hardware and higher speed. It will be illustrated that the more correlated inputs are present in the lattice filter, the SNR of the order-recursive filter will be degraded faster. Pipelining technique will be proved to be effective in speed upgradation, especially for the order-recursive lattice filter whose order is usually very high.
Recursive framework for joint inpainting and de-noising of photographic films.
Subrahmanyam, G R K S; Rajagopalan, A N; Aravind, R
2010-05-01
We address the problem of inpainting noisy photographs. We present a recursive image recovery scheme based on the unscented Kalman filter (UKF) to simultaneously inpaint identified damaged portions in an image and suppress film-grain noise. Inpainting of the missing observations is guided by a mask-dependent reconstruction of the image edges. Prediction within the UKF is based on a discontinuity-adaptive Markov random field prior that attempts to preserve edges while achieving noise reduction in uniform regions. We demonstrate the capability of the proposed method with many examples. PMID:20448776
Recursive frame integration of limited data: RAFAIL
NASA Astrophysics Data System (ADS)
Rafailov, Michael K.; Soli, Robert A.
2005-08-01
Real time infrared imaging and tracking usually requires a high probability of target detection along with a low false alarm rate, achievable only with a high "Signal-to-Noise Ratio" (SNR). Frame integration--summing of non-correlated frames--is commonly used to improve the SNR. But conventional frame integration requires significant processing to store full frames and integrate intermediate results, normalize frame data, etc. It may drive acquisition of highly specialized hardware, faster processors, dedicated frame integration circuit cards and extra memory cards. Non-stationary noise, low frequency noise correlation, non-ergodic noise, scene dynamics, or pointing accuracy may also limit performance. Recursive frame integration of limited data--RAFAIL, is proposed as a means to improve frame integration performance and mitigate the issues. The technique applies two thresholds--one tuned for optimum probability of detection, the other to manage required false alarm rate--and allows a non-linear integration process that, along with optimal noise management, provides system designers more capability where cost, weight, or power considerations limit system data rate, processing, or memory capability.
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.
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.
Recursive graphs with small-world scale-free properties
NASA Astrophysics Data System (ADS)
Comellas, Francesc; Fertin, Guillaume; Raspaud, André
2004-03-01
We discuss a category of graphs, recursive clique trees, which have small-world and scale-free properties and allow a fine tuning of the clustering and the power-law exponent of their discrete degree distribution. We determine relevant characteristics of those graphs: the diameter, degree distribution, and clustering parameter. The graphs have also an interesting recursive property, and generalize recent constructions with fixed degree distributions.
Recursion operators, conservation laws, and integrability conditions for difference equations
NASA Astrophysics Data System (ADS)
Mikhailov, A. V.; Wang, Jing Ping; Xenitidis, P.
2011-04-01
We attempt to propose an algebraic approach to the theory of integrable difference equations. We define the concept of a recursion operator for difference equations and show that it generates an infinite sequence of symmetries and canonical conservation laws for a difference equation. As in the case of partial differential equations, these canonical densities can serve as integrability conditions for difference equations. We obtain the recursion operators for the Viallet equation and all the Adler-Bobenko-Suris equations.
On-Shell Recursion Relations for Effective Field Theories.
Cheung, Clifford; Kampf, Karol; Novotny, Jiri; Shen, Chia-Hsien; Trnka, Jaroslav
2016-01-29
We derive the first ever on-shell recursion relations applicable to effective field theories. Based solely on factorization and the soft behavior of amplitudes, these recursion relations employ a new rescaling momentum shift to construct all tree-level scattering amplitudes in the nonlinear sigma model, Dirac-Born-Infeld theory, and the Galileon. Our results prove that all theories with enhanced soft behavior are on-shell constructible. PMID:26871321
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.
Recursive construction of perfect DNA molecules from imperfect oligonucleotides
Linshiz, Gregory; Yehezkel, Tuval Ben; Kaplan, Shai; Gronau, Ilan; Ravid, Sivan; Adar, Rivka; Shapiro, Ehud
2008-01-01
Making faultless complex objects from potentially faulty building blocks is a fundamental challenge in computer engineering, nanotechnology and synthetic biology. Here, we show for the first time how recursion can be used to address this challenge and demonstrate a recursive procedure that constructs error-free DNA molecules and their libraries from error-prone oligonucleotides. Divide and Conquer (D&C), the quintessential recursive problem-solving technique, is applied in silico to divide the target DNA sequence into overlapping oligonucleotides short enough to be synthesized directly, albeit with errors; error-prone oligonucleotides are recursively combined in vitro, forming error-prone DNA molecules; error-free fragments of these molecules are then identified, extracted and used as new, typically longer and more accurate, inputs to another iteration of the recursive construction procedure; the entire process repeats until an error-free target molecule is formed. Our recursive construction procedure surpasses existing methods for de novo DNA synthesis in speed, precision, amenability to automation, ease of combining synthetic and natural DNA fragments, and ability to construct designer DNA libraries. It thus provides a novel and robust foundation for the design and construction of synthetic biological molecules and organisms. PMID:18463615
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 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.
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
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
NASA Astrophysics Data System (ADS)
Harris, Alan W.; Pravec, P.
2006-06-01
There are now nearly 100 binary asteroids known. In the last year alone, 30 binary asteroids have been discovered, half of them by lightcurves showing eclipse events. Similar to eclipsing binary stars, such observations allow determination of orbit period and sizes and shapes of the primary and secondary relative to the orbital dimension. From these parameters one can estimate the mean density of the system, and a number of dynamical properties such as total specific angular momentum, tidal evolution time scales of spins and orbit, and precession frequencies of the orbit about the primary and of the solar induced "general precession" of the system. We have extracted parameters for all systems with enough observations to allow meaningful determinations. Some preliminary results include: (1) Binaries are roughly as prevalent among small main-belt asteroids as among Near-Earth Asteroids. (2) Most binaries are partially asynchronous, with the secondary synchronized to the orbit period, but the primary still spinning much faster. This is consistent with estimated tidal damping time scales. (3) Most systems have near the critical maximum angular momentum for a single "rubble pile" body, but not much more, and some less. Thus fission appears not to be a viable formation mechanism for all binaries, although near-critical spin rate seems to play a role. (4) Orbits of the secondaries are essentially in the equatorial plane of the primary. Since most primary spins are still fast, the satellites must have been formed into low inclination orbits. (5) Precession frequencies are in the range of the shorter resonance frequencies in the solar system (tens of thousands of years), thus resonance interactions can be expected to have altered spin orientations as systems evolved slowly by tidal friction or other processes. (6) Primaries are unusually spheroidal, which is probably necessary for stability of the binary once formed.
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.
Theory and applications of sampled analog recursive CTD comb filters
NASA Technical Reports Server (NTRS)
Tao, T. F.; Holmes, S. V.; Ejaz, A.; Piazza, F.; Saetre, L. T.; Freund, B.
1976-01-01
Sampled analog comb filter using a recursive filter implementation was studied. Charge transfer device delay lines were used as the delay elements. The similarities and differences between sampled analog recursive filter and digital recursive filter were pointed out. Both canceller type and integrator type comb filter using the first order or the second order canonical circuits were studied. Experimental results of frequency response are presented to show their difference from that of digital filters. A theoretical analysis was presented based essentially on the digital filter theory but modified to take into account the differences described above. The usefulness of this theory in analyzing the comb filter characteristics was discussed. Several applications of both the canceller type comb filter and the integrator type comb filter were demonstrated.
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.
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.
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.
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
Recursive dynamics algorithm for multibody systems with prescribed motion
NASA Technical Reports Server (NTRS)
Jain, Abhinandan; Rodriguez, Guillermo
1993-01-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.
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.
Koronis binaries and the role of families in binary frequency
NASA Astrophysics Data System (ADS)
Merline, W. J.; Tamblyn, P. M.; Nesvorny, D.; Durda, D. D.; Chapman, C. R.; Dumas, C.; Owen, W. M.; Storrs, A. D.; Close, L. M.; Menard, F.
2005-08-01
Our ground-based adaptive optics observations of many larger Koronis members show no binaries, while our HST survey of smaller Koronis members (say smaller than 10 km) shows a surprising 20% binary fraction. Admittedly, this is from small-number statistics, but we nonetheless calculate a 99% confidence that the binary fraction is different from the 2% we observe among the larger (over 20km) main belt asteroids as a whole. In addition, we estimate that among the two young families (Karin and Veritas) that we surveyed for binaries in our HST Cy 13 program, the binary fraction appears to be less than 5%. These young families both have significantly smaller progenitors than the Koronis family. We have speculated that progenitor size may be a more important factor than age in determination of binary frequency. But here we suggest an alternative idea, that the binary fraction may be more related to what part of the family's size distribution is sampled. Our HST program targeted objects of the same physical sizes, but was clearly sampling further down the size distribution (to smaller sizes, relative to the largest remnant) in the Koronis sample than was the case for Karin and Veritas, which we sampled mostly at the larger sizes, relatively. Our SPH collision models are estimating the typical size-frequency distributions to be expected from catastrophic and non-catastrophic impact events. But they are also appear to be showing that the largest fragments from a collision are less likely to form binaries (as co-orbiting ejecta pairs) than are the smaller fragments. Thus, it might be expected that we would have found fewer binaries among Karin and Veritas than among the Koronis sample. In fact, models of the Karin breakup show binary formation to be unlikely in the size range measured. It some might be tempted to tie the small end of the main-belt binary population to the binaries seen among the NEAs (also small and also showing about 20% fraction), given the 20% fraction
BINARIES AMONG DEBRIS DISK STARS
Rodriguez, David R.; Zuckerman, B.
2012-02-01
We have gathered a sample of 112 main-sequence stars with known debris disks. We collected published information and performed adaptive optics observations at Lick Observatory to determine if these debris disks are associated with binary or multiple stars. We discovered a previously unknown M-star companion to HD 1051 at a projected separation of 628 AU. We found that 25% {+-} 4% of our debris disk systems are binary or triple star systems, substantially less than the expected {approx}50%. The period distribution for these suggests a relative lack of systems with 1-100 AU separations. Only a few systems have blackbody disk radii comparable to the binary/triple separation. Together, these two characteristics suggest that binaries with intermediate separations of 1-100 AU readily clear out their disks. We find that the fractional disk luminosity, as a proxy for disk mass, is generally lower for multiple systems than for single stars at any given age. Hence, for a binary to possess a disk (or form planets) it must either be a very widely separated binary with disk particles orbiting a single star or it must be a small separation binary with a circumbinary disk.
New binary systems: beaming binaries
NASA Astrophysics Data System (ADS)
Morales, J. C.; Weingrill, J.; Mazeh, T.; Ribas, I.
2011-11-01
Exoplanet missions such as COROT and Kepler are providing precise photometric follow-up data of new kinds of variable stars undetected till now. Beaming binaries are among these objects. On these binary systems, the orbital motion of their components is fast enough to produce a detectable modulation on the received flux due to relativistic effects (Zucker et al. 2007). The great advantage of these systems is that it is possible to reconstruct the radial velocity curve of the system from this photometric modulation and thus, orbital parameters such as the mass ratio and the semi-major axis can be estimated from photometry without the necessity of spectroscopic follow-up. In this poster, we briefly introduce the analysis of this kind of binary systems and in particular, the eclipsing cases.
NASA Astrophysics Data System (ADS)
He, Yuanlei; Liu, Daizhi; Yi, Shihua
2011-01-01
Band selection has been widely used in hyperspectral image processing for dimension reduction. In this paper, a recursive spectral similarity measure-based band selection (RSSM-BBS) method is presented. Unlike most of the existing image-based band selection techniques, it is for two hyperspectral signatures with its main focus on their spectral separability. Furthermore, it is unsupervised and based on the recursive calculation of the spectral similarity measure with an additional band. In order to demonstrate the utility of the proposed method, an anomaly detection algorithm is developed, which first extracts the anomalous target spectrum from the image using the automatic target detection and classification algorithm (ATDCA), followed by the maximum spectral screening (MSS) to obtain a good estimate of the background, and then implements RSSM-BBS to select bands that participate in the subsequent adaptive cosine/coherence estimator (ACE) target detection. As shown in the experimental result on the AVIRIS dataset, the detection performance of the ACE has been improved greatly with the bands selected by RSSM-BBS over that using full bands.
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.
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…
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 ...
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…
A Scale-Invariant Treatment for Recursive Path Models.
ERIC Educational Resources Information Center
McDonald, Roderick P.; And Others
1993-01-01
A reparameterization is formulated that yields estimates of scale-invariant parameters in recursive path models with latent variables, and (asymptotically) correct standard errors, without the use of constrained optimization. The method is based on the logical structure of the reticular action model. (Author)
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…
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…
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…
Displacement properties of the product of two finite recursive matrices
NASA Astrophysics Data System (ADS)
Barnabei, Marilena; Montefusco, Laura B.
2002-12-01
We study the displacement properties, with respect to a suitable displacement operator, of the product of two finite sections of recursive matrices, and we give an explicit evaluation of the displacement rank of such a product in the case when the second matrix is a finite Toeplitz or Hankel matrix.
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,…
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.
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
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.
Encoding nondeterministic fuzzy tree automata into recursive neural networks.
Gori, Marco; Petrosino, Alfredo
2004-11-01
Fuzzy neural systems have been a subject of great interest in the last few years, due to their abilities to facilitate the exchange of information between symbolic and subsymbolic domains. However, the models in the literature are not able to deal with structured organization of information, that is typically required by symbolic processing. In many application domains, the patterns are not only structured, but a fuzziness degree is attached to each subsymbolic pattern primitive. The purpose of this paper is to show how recursive neural networks, properly conceived for dealing with structured information, can represent nondeterministic fuzzy frontier-to-root tree automata. Whereas available prior knowledge expressed in terms of fuzzy state transition rules are injected into a recursive network, unknown rules are supposed to be filled in by data-driven learning. We also prove the stability of the encoding algorithm, extending previous results on the injection of fuzzy finite-state dynamics in high-order recurrent networks. PMID:15565771
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.
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.
ROOM: A recursive object oriented method for information systems development
Thelliez, T.; Donahue, S.
1994-02-09
Although complementary for the development of complex systems, top-down structured design and object oriented approach are still opposed and not integrated. As the complexity of the systems are still growing, and the so-called software crisis still not solved, it is urgent to provide a framework mixing the two paradigms. This paper presents an elegant attempt in this direction through our Recursive Object-Oriented Method (ROOM) in which a top-down approach divides the complexity of the system and an object oriented method studies a given level of abstraction. Illustrating this recursive schema with a simple example, we demonstrate that we achieve the goal of creating loosely coupled and reusable components.
Topological recursion for Gaussian means and cohomological field theories
NASA Astrophysics Data System (ADS)
Andersen, J. E.; Chekhov, L. O.; Norbury, P.; Penner, R. C.
2015-12-01
We introduce explicit relations between genus-filtrated s-loop means of the Gaussian matrix model and terms of the genus expansion of the Kontsevich-Penner matrix model (KPMM), which is the generating function for volumes of discretized (open) moduli spaces M g,s disc (discrete volumes). Using these relations, we express Gaussian means in all orders of the genus expansion as polynomials in special times weighted by ancestor invariants of an underlying cohomological field theory. We translate the topological recursion of the Gaussian model into recurrence relations for the coefficients of this expansion, which allows proving that they are integers and positive. We find the coefficients in the first subleading order for M g,1 for all g in three ways: using the refined Harer-Zagier recursion, using the Givental-type decomposition of the KPMM, and counting diagrams explicitly.
Recursive utility in a Markov environment with stochastic growth.
Hansen, Lars Peter; Scheinkman, José A
2012-07-24
Recursive utility models that feature investor concerns about the intertemporal composition of risk are used extensively in applied research in macroeconomics and asset pricing. These models represent preferences as the solution to a nonlinear forward-looking difference equation with a terminal condition. In this paper we study infinite-horizon specifications of this difference equation in the context of a Markov environment. We establish a connection between the solution to this equation and to an arguably simpler Perron-Frobenius eigenvalue equation of the type that occurs in the study of large deviations for Markov processes. By exploiting this connection, we establish existence and uniqueness results. Moreover, we explore a substantive link between large deviation bounds for tail events for stochastic consumption growth and preferences induced by recursive utility. PMID:22778428
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.
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
Recursive Robot-Arm Dynamics via Filtering and Smoothing
NASA Technical Reports Server (NTRS)
Rodriguez, Guillermo
1987-01-01
Forward and inverse dynamics solved using Kalman filtering and Bryson-Frazier smoothing. Dynamics of serial-link robot arm solved by using recursive techniques from linear filtering and smoothing theory. Solutions of dynamical equations give forces, moments, and accelerations at joints between links, and multilink inertia matrix and its inverse. Theoretical developments lay foundation for use of filtering and smoothing techniques in design of robot controls.
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.
A fast recursive algorithm for molecular dynamics simulation
NASA Technical Reports Server (NTRS)
Jain, A.; Vaidehi, N.; Rodriguez, G.
1993-01-01
The present recursive algorithm for solving molecular systems' dynamical equations of motion employs internal variable models that reduce such simulations' computation time by an order of magnitude, relative to Cartesian models. Extensive use is made of spatial operator methods recently developed for analysis and simulation of the dynamics of multibody systems. A factor-of-450 speedup over the conventional O(N-cubed) algorithm is demonstrated for the case of a polypeptide molecule with 400 residues.
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.
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.
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.
Recursion relations for AdS/CFT correlators
Raju, Suvrat
2011-06-15
We expand on the results of our recent letter [Phys. Rev. Lett. 106, 091601 (2011)], where we presented new recursion relations for correlation functions of the stress-tensor and conserved currents in conformal field theories with an AdS{sub d+1} dual for d{>=}4. These recursion relations are derived by generalizing the Britto-Cachazo-Feng-Witten (BCFW) relations to amplitudes in anti-de Sitter space (AdS) that are dual to boundary correlators, and are usually computed perturbatively by Witten diagrams. Our results relate vacuum-correlation functions to integrated products of lower-point transition amplitudes, which correspond to correlators calculated between states dual to certain normalizable modes. We show that the set of ''polarization vectors'' for which amplitudes behave well under the BCFW extension is smaller than in flat-space. We describe how transition amplitudes for more general external polarizations can be constructed by combining answers obtained by different pairs of BCFW shifts. We then generalize these recursion relations to supersymmetric theories. In AdS, unlike flat-space, even maximal supersymmetry is insufficient to permit the computation of all correlators of operators in the same multiplet as a stress-tensor or conserved current. Finally, we work out some simple examples to verify our results.
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.
Phillips, Steven; Wilson, William H
2012-01-01
Human cognitive capacity includes recursively definable concepts, which are prevalent in domains involving lists, numbers, and languages. Cognitive science currently lacks a satisfactory explanation for the systematic nature of such capacities (i.e., why the capacity for some recursive cognitive abilities-e.g., finding the smallest number in a list-implies the capacity for certain others-finding the largest number, given knowledge of number order). The category-theoretic constructs of initial F-algebra, catamorphism, and their duals, final coalgebra and anamorphism provide a formal, systematic treatment of recursion in computer science. Here, we use this formalism to explain the systematicity of recursive cognitive capacities without ad hoc assumptions (i.e., to the same explanatory standard used in our account of systematicity for non-recursive capacities). The presence of an initial algebra/final coalgebra explains systematicity because all recursive cognitive capacities, in the domain of interest, factor through (are composed of) the same component process. Moreover, this factorization is unique, hence no further (ad hoc) assumptions are required to establish the intrinsic connection between members of a group of systematically-related capacities. This formulation also provides a new perspective on the relationship between recursive cognitive capacities. In particular, the link between number and language does not depend on recursion, as such, but on the underlying functor on which the group of recursive capacities is based. Thus, many species (and infants) can employ recursive processes without having a full-blown capacity for number and language. PMID:22514704
NASA Astrophysics Data System (ADS)
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.
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
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
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
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.
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.
Recursive partitioned inversion of large (1500 x 1500) symmetric matrices
NASA Technical Reports Server (NTRS)
Putney, B. H.; Brownd, J. E.; Gomez, R. A.
1976-01-01
A recursive algorithm was designed to invert large, dense, symmetric, positive definite matrices using small amounts of computer core, i.e., a small fraction of the core needed to store the complete matrix. The described algorithm is a generalized Gaussian elimination technique. Other algorithms are also discussed for the Cholesky decomposition and step inversion techniques. The purpose of the inversion algorithm is to solve large linear systems of normal equations generated by working geodetic problems. The algorithm was incorporated into a computer program called SOLVE. In the past the SOLVE program has been used in obtaining solutions published as the Goddard earth models.
Ladder operators and recursion relations for the associated Bessel polynomials
NASA Astrophysics Data System (ADS)
Fakhri, H.; Chenaghlou, A.
2006-10-01
Introducing the associated Bessel polynomials in terms of two non-negative integers, and under an integrability condition we simultaneously factorize their corresponding differential equation into a product of the ladder operators by four different ways as shape invariance symmetry equations. This procedure gives four different pairs of recursion relations on the associated Bessel polynomials. In spite of description of Bessel and Laguerre polynomials in terms of each other, we show that the associated Bessel differential equation is factorized in four different ways whereas for Laguerre one we have three different ways.
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
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.
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
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.
Recursions of Symmetry Orbits and Reduction without Reduction
NASA Astrophysics Data System (ADS)
Malykh, Andrei A.; Sheftel, Mikhail B.
2011-04-01
We consider a four-dimensional PDE possessing partner symmetries mainly on the example of complex Monge-Ampère equation (CMA). We use simultaneously two pairs of symmetries related by a recursion relation, which are mutually complex conjugate for CMA. For both pairs of partner symmetries, using Lie equations, we introduce explicitly group parameters as additional variables, replacing symmetry characteristics and their complex conjugates by derivatives of the unknown with respect to group parameters. We study the resulting system of six equations in the eight-dimensional space, that includes CMA, four equations of the recursion between partner symmetries and one integrability condition of this system. We use point symmetries of this extended system for performing its symmetry reduction with respect to group parameters that facilitates solving the extended system. This procedure does not imply a reduction in the number of physical variables and hence we end up with orbits of non-invariant solutions of CMA, generated by one partner symmetry, not used in the reduction. These solutions are determined by six linear equations with constant coefficients in the five-dimensional space which are obtained by a three-dimensional Legendre transformation of the reduced extended system. We present algebraic and exponential examples of such solutions that govern Legendre-transformed Ricci-flat Kähler metrics with no Killing vectors. A similar procedure is briefly outlined for Husain equation.
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
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.
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.
Using Heaps in Recursive Hierarchical Segmentation of Data
NASA Technical Reports Server (NTRS)
Tilton, James C.
2006-01-01
A modification to increase processing speed has been made in the algorithm and implementing software reported in Modified Recursive Hierarchical Segmentation of Data (GSC-14681-1), NASA Tech Briefs, Vol. 30, No. 6 (June 2006), page 51. That software performs recursive hierarchical segmentation of data having spatial characteristics (e.g., spectral-image data). The segmentation process includes an iterative subprocess, in each iteration of which it is necessary to determine a best pair of regions to merge [merges being justified by one or more measure(s) similarity of pixels in the regions]. In the previously reported version of the algorithm and software, the choice of a best pair of regions to merge involved the use of a fully sorted list of regions. That version was computationally inefficient because a fully sorted list is not needed: what is needed is only the identity of the pair of regions characterized by the smallest measure of dissimilarity. The present modification replaces the use of a fully sorted list with the use of data heaps, which are computationally more efficient for performing the required comparisons among dissimilarity measures. The modification includes the incorporation of standard and modified functions for creating and updating data heaps
A recursive least squares-based demodulator for electrical tomography
NASA Astrophysics Data System (ADS)
Xu, Lijun; Zhou, Haili; Cao, Zhang
2013-04-01
In this paper, a recursive least squares (RLS)-based demodulator is proposed for Electrical Tomography (ET) that employs sinusoidal excitation. The new demodulator can output preliminary demodulation results on amplitude and phase of a sinusoidal signal by processing the first two sampling data, and the demodulation precision and signal-to-noise ratio can be further improved by involving more sampling data in a recursive way. Thus trade-off between the speed and precision in demodulation of electrical parameters can be flexibly made according to specific requirement of an ET system. The RLS-based demodulator is suitable to be implemented in a field programmable gate array (FPGA). Numerical simulation was carried out to prove its feasibility and optimize the relevant parameters for hardware implementation, e.g., the precision of the fixed-point parameters, sampling rate, and resolution of the analog to digital convertor. A FPGA-based capacitance measurement circuit for electrical capacitance tomography was constructed to implement and validate the RLS-based demodulator. Both simulation and experimental results demonstrate that the proposed demodulator is valid and capable of making trade-off between demodulation speed and precision and brings more flexibility to the hardware design of ET systems.
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.
A new Bayesian recursive technique for parameter estimation
NASA Astrophysics Data System (ADS)
Kaheil, Yasir H.; Gill, M. Kashif; McKee, Mac; Bastidas, Luis
2006-08-01
The performance of any model depends on how well its associated parameters are estimated. In the current application, a localized Bayesian recursive estimation (LOBARE) approach is devised for parameter estimation. The LOBARE methodology is an extension of the Bayesian recursive estimation (BARE) method. It is applied in this paper on two different types of models: an artificial intelligence (AI) model in the form of a support vector machine (SVM) application for forecasting soil moisture and a conceptual rainfall-runoff (CRR) model represented by the Sacramento soil moisture accounting (SAC-SMA) model. Support vector machines, based on statistical learning theory (SLT), represent the modeling task as a quadratic optimization problem and have already been used in various applications in hydrology. They require estimation of three parameters. SAC-SMA is a very well known model that estimates runoff. It has a 13-dimensional parameter space. In the LOBARE approach presented here, Bayesian inference is used in an iterative fashion to estimate the parameter space that will most likely enclose a best parameter set. This is done by narrowing the sampling space through updating the "parent" bounds based on their fitness. These bounds are actually the parameter sets that were selected by BARE runs on subspaces of the initial parameter space. The new approach results in faster convergence toward the optimal parameter set using minimum training/calibration data and fewer sets of parameter values. The efficacy of the localized methodology is also compared with the previously used BARE algorithm.
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. (PsycINFO Database Record PMID:26913616
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.
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…
ERIC Educational Resources Information Center
Brown, John Seely; Rubinstein, Richard
Concepts in recursive functional programing form the basis of a course designed to introduce Humanities and Social Science students to computer programing. Unlike many introductory courses, recursion was taught prior to any mention of iteration or assigned operations. LOGO, a non-numeric language originally invented for use by children, was chosen…
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.
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
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.
RePAMO: Recursive Perturbation Approach for Multimodal Optimization
NASA Astrophysics Data System (ADS)
Dasgupta, Bhaskar; Divya, Kotha; Mehta, Vivek Kumar; Deb, Kalyanmoy
2013-09-01
In this article, a strategy is presented to exploit classical algorithms for multimodal optimization problems, which recursively applies any suitable local optimization method, in the present case Nelder and Mead's simplex search method, in the search domain. The proposed method follows a systematic way to restart the algorithm. The idea of climbing the hills and sliding down to the neighbouring valleys is utilized. The implementation of the algorithm finds local minima as well as maxima. The concept of perturbing the minimum/maximum in several directions and restarting the algorithm for maxima/minima is introduced. The method performs favourably in comparison to other global optimization methods. The results of this algorithm, named RePAMO, are compared with the GA-clearing and ASMAGO techniques in terms of the number of function evaluations. Based on the results, it has been found that the RePAMO outperforms GA clearing and ASMAGO by a significant margin.
A recursive model of economic well-being in retirement.
Leon, J
1985-07-01
Although investigators have identified some of the social and economic forces that influence levels of economic resources among elderly adults, little has been done to organize these factors into predictive lifespan models of economic well-being. Applying path analysis to data on retiring workers from the Panel Study of Income Dynamics, the present research offers a beginning recursive model. It traces the influences of demographic/family background, human capital, and work-related characteristics on economic position in retirement. Controlling for differences in labor force participation and other human capital measures, race and family background lose their direct significance, whereas sex remains directly significant in predicting economic resource levels for recently retired workers. In addition, the model estimates the direct and indirect effects played by industrial sector location and social class position. In total the structurally based capital attainment model explains 65% of the variance in a measure of economic well-being that includes retirement income and wealth. PMID:4008884
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.
Non-ionic surfactant phase diagram prediction by recursive partitioning.
Bell, Gordon
2016-07-28
A model has been designed to predict the phase which forms in water for a non-ionic surfactant, at a given concentration and temperature. The full phase diagram is generated by selecting enough data points to cover the region of interest. The model estimates the probability for each one of 10 possible phases and selects the one with the highest likelihood. The probabilities are based on the recursive partitioning of a dataset of 10 000 known observations. The model covers alkyl chain length and branching, ethoxylate head length and number, and end capping of one or more of the ethoxylate chains. The relationship between chemical structure, shape and phase behaviour is discussed.This article is part of the themed issue 'Soft interfacial materials: from fundamentals to formulation'. PMID:27298439
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.
Spreading speeds and traveling waves in competitive recursion systems.
Lin, Guo; Li, Wan-Tong; Ruan, Shigui
2011-02-01
This paper is concerned with the spreading speeds and traveling wave solutions of discrete time recursion systems, which describe the spatial propagation mode of two competitive invaders. We first establish the existence of traveling wave solutions when the wave speed is larger than a given threshold. Furthermore, we prove that the threshold is the spreading speed of one species while the spreading speed of the other species is distinctly slower compared to the case when the interspecific competition disappears. Our results also show that the interspecific competition does affect the spread of both species so that the eventual population densities at the coexistence domain are lower than the case when the competition vanishes. PMID:20186417
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.
Recursive starlight and bias estimation for high-contrast imaging with an extended Kalman filter
NASA Astrophysics Data System (ADS)
Riggs, A. J. Eldorado; Kasdin, N. Jeremy; Groff, Tyler D.
2016-01-01
For imaging faint exoplanets and disks, a coronagraph-equipped observatory needs focal plane wavefront correction to recover high contrast. The most efficient correction methods iteratively estimate the stellar electric field and suppress it with active optics. The estimation requires several images from the science camera per iteration. To maximize the science yield, it is desirable both to have fast wavefront correction and to utilize all the correction images for science target detection. Exoplanets and disks are incoherent with their stars, so a nonlinear estimator is required to estimate both the incoherent intensity and the stellar electric field. Such techniques assume a high level of stability found only on space-based observatories and possibly ground-based telescopes with extreme adaptive optics. In this paper, we implement a nonlinear estimator, the iterated extended Kalman filter (IEKF), to enable fast wavefront correction and a recursive, nearly-optimal estimate of the incoherent light. In Princeton's High Contrast Imaging Laboratory, we demonstrate that the IEKF allows wavefront correction at least as fast as with a Kalman filter and provides the most accurate detection of a faint companion. The nonlinear IEKF formalism allows us to pursue other strategies such as parameter estimation to improve wavefront correction.
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
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.
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.
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 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.
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
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.
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.
Kalman filtering, smoothing and recursive robot arm forward and inverse dynamics
NASA Technical Reports Server (NTRS)
Rodriguez, G.
1986-01-01
The inverse and forward dynamics problems for multi-link serial manipulators are solved by using recursive techniques from linear filtering and smoothing theory. The pivotal step is to cast the system dynamics and kinematics as a two-point boundary-value problem. Solution of this problem leads to filtering and smoothing techniques identical to the equations of Kalman filtering and Bryson-Frazier fixed time-interval smoothing. The solutions prescribe an inward filtering recursion to compute a sequence of constraint moments and forces followed by an outward recursion to determine a corresponding sequence of angular and linear accelerations. In addition to providing techniques to compute joint accelerations from applied joint moments (and vice versa), the report provides an approach to evaluate recursively the composite multi-link system inertia matrix and its inverse. The report lays the foundation for the potential use of filtering and smoothing techniques in robot inverse and forward dynamics and in robot control design.
Model-Based Recursive Partitioning for Subgroup Analyses.
Seibold, Heidi; Zeileis, Achim; Hothorn, Torsten
2016-05-01
The identification of patient subgroups with differential treatment effects is the first step towards individualised treatments. A current draft guideline by the EMA discusses potentials and problems in subgroup analyses and formulated challenges to the development of appropriate statistical procedures for the data-driven identification of patient subgroups. We introduce model-based recursive partitioning as a procedure for the automated detection of patient subgroups that are identifiable by predictive factors. The method starts with a model for the overall treatment effect as defined for the primary analysis in the study protocol and uses measures for detecting parameter instabilities in this treatment effect. The procedure produces a segmented model with differential treatment parameters corresponding to each patient subgroup. The subgroups are linked to predictive factors by means of a decision tree. The method is applied to the search for subgroups of patients suffering from amyotrophic lateral sclerosis that differ with respect to their Riluzole treatment effect, the only currently approved drug for this disease. PMID:27227717
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.
Implicit Learning of Recursive Context-Free Grammars
Rohrmeier, Martin; Fu, Qiufang; Dienes, Zoltan
2012-01-01
Context-free grammars are fundamental for the description of linguistic syntax. However, most artificial grammar learning experiments have explored learning of simpler finite-state grammars, while studies exploring context-free grammars have not assessed awareness and implicitness. This paper explores the implicit learning of context-free grammars employing features of hierarchical organization, recursive embedding and long-distance dependencies. The grammars also featured the distinction between left- and right-branching structures, as well as between centre- and tail-embedding, both distinctions found in natural languages. People acquired unconscious knowledge of relations between grammatical classes even for dependencies over long distances, in ways that went beyond learning simpler relations (e.g. n-grams) between individual words. The structural distinctions drawn from linguistics also proved important as performance was greater for tail-embedding than centre-embedding structures. The results suggest the plausibility of implicit learning of complex context-free structures, which model some features of natural languages. They support the relevance of artificial grammar learning for probing mechanisms of language learning and challenge existing theories and computational models of implicit learning. PMID:23094021
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.
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
Multi-Layer and Recursive Neural Networks for Metagenomic Classification.
Ditzler, Gregory; Polikar, Robi; Rosen, Gail
2015-09-01
Recent advances in machine learning, specifically in deep learning with neural networks, has made a profound impact on fields such as natural language processing, image classification, and language modeling; however, feasibility and potential benefits of the approaches to metagenomic data analysis has been largely under-explored. Deep learning exploits many layers of learning nonlinear feature representations, typically in an unsupervised fashion, and recent results have shown outstanding generalization performance on previously unseen data. Furthermore, some deep learning methods can also represent the structure in a data set. Consequently, deep learning and neural networks may prove to be an appropriate approach for metagenomic data. To determine whether such approaches are indeed appropriate for metagenomics, we experiment with two deep learning methods: i) a deep belief network, and ii) a recursive neural network, the latter of which provides a tree representing the structure of the data. We compare these approaches to the standard multi-layer perceptron, which has been well-established in the machine learning community as a powerful prediction algorithm, though its presence is largely missing in metagenomics literature. We find that traditional neural networks can be quite powerful classifiers on metagenomic data compared to baseline methods, such as random forests. On the other hand, while the deep learning approaches did not result in improvements to the classification accuracy, they do provide the ability to learn hierarchical representations of a data set that standard classification methods do not allow. Our goal in this effort is not to determine the best algorithm in terms accuracy-as that depends on the specific application-but rather to highlight the benefits and drawbacks of each of the approach we discuss and provide insight on how they can be improved for predictive metagenomic analysis. PMID:26316190
A fast recursive coordinate bisection tree for neighbour search and gravity
NASA Astrophysics Data System (ADS)
Gafton, Emanuel; Rosswog, Stephan
2011-12-01
We introduce our new binary tree code for neighbour search and gravitational force calculations in an N-particle system. The tree is built in a 'top-down' fashion by 'recursive coordinate bisection' where on each tree level we split the longest side of a cell through its centre of mass. This procedure continues until the average number of particles in the lowest tree level drops below a prescribed value. To calculate the forces on the particles in each lowest-level cell we split the gravitational interaction into a near- and a far-field. Since our main intended applications are smoothed particle hydrodynamic (SPH) simulations, we calculate the near-field by a direct, kernel-smoothed summation, while the far field is evaluated via a Cartesian Taylor expansion up to quadrupole order. Instead of applying the far-field approach for each particle separately, we use another Taylor expansion around the centre of mass of each lowest-level cell to determine the forces at the particle positions. Due to this 'cell-cell interaction' the code performance is close to ? where N is the number of used particles. We describe in detail various technicalities that ensure a low memory footprint and an efficient cache use. In a set of benchmark tests we scrutinize our new tree and compare it to the 'Press tree' that we have previously made ample use of. At a slightly higher force accuracy than the Press tree, our tree turns out to be substantially faster and increasingly more so for larger particle numbers. For four million particles our tree build is faster by a factor of 25 and the time for neighbour search and gravity is reduced by more than a factor of 6. In single processor tests with up to 108 particles we confirm experimentally that the scaling behaviour is close to ?. The current FORTRAN 90 code version is OpenMP-parallel and scales excellently with the processor number (=24) of our test machine.
Nelson, C A; Eggleton, P P
2001-03-28
We undertake a comparison of observed Algol-type binaries with a library of computed Case A binary evolution tracks. The library consists of 5500 binary tracks with various values of initial primary mass M{sub 10}, mass ratio q{sub 0}, and period P{sub 0}, designed to sample the phase-space of Case A binaries in the range -0.10 {le} log M{sub 10} {le} 1.7. Each binary is evolved using a standard code with the assumption that both total mass and orbital angular momentum are conserved. This code follows the evolution of both stars until the point where contact or reverse mass transfer occurs. The resulting binary tracks show a rich variety of behavior which we sort into several subclasses of Case A and Case B. We present the results of this classification, the final mass ratio and the fraction of time spent in Roche Lobe overflow for each binary system. The conservative assumption under which we created this library is expected to hold for a broad range of binaries, where both components have spectra in the range G0 to B1 and luminosity class III - V. We gather a list of relatively well-determined observed hot Algol-type binaries meeting this criterion, as well as a list of cooler Algol-type binaries where we expect significant dynamo-driven mass loss and angular momentum loss. We fit each observed binary to our library of tracks using a {chi}{sup 2}-minimizing procedure. We find that the hot Algols display overall acceptable {chi}{sup 2}, confirming the conservative assumption, while the cool Algols show much less acceptable {chi}{sup 2} suggesting the need for more free parameters, such as mass and angular momentum loss.
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.
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."
Binary stars in the Orion Nebula Cluster
NASA Astrophysics Data System (ADS)
Köhler, R.; Petr-Gotzens, M. G.; McCaughrean, M. J.; Bouvier, J.; Duchêne, G.; Quirrenbach, A.; Zinnecker, H.
2006-11-01
We report on a high-spatial-resolution survey for binary stars in the periphery of the Orion Nebula Cluster, at 5-15 arcmin (0.65-2 pc) from the cluster center. We observed 228 stars with adaptive optics systems, in order to find companions at separations of 0.13 arcsec-1.12 arcsec (60-500 AU), and detected 13 new binaries. Combined with the results of Petr (1998), we have a sample of 275 objects, about half of which have masses from the literature and high probabilities to be cluster members. We used an improved method to derive the completeness limits of the observations, which takes into account the elongated point spread function of stars at relatively large distances from the adaptive optics guide star. The multiplicity of stars with masses >2 M⊙ is found to be significantly larger than that of low-mass stars. The companion star frequency of low-mass stars is comparable to that of main-sequence M-dwarfs, less than half that of solar-type main-sequence stars, and 3.5 to 5 times lower than in the Taurus-Auriga and Scorpius-Centaurus star-forming regions. We find the binary frequency of low-mass stars in the periphery of the cluster to be the same or only slightly higher than for stars in the cluster core (<3 arcmin from θ^1C Ori). This is in contrast to the prediction of the theory that the low binary frequency in the cluster is caused by the disruption of binaries due to dynamical interactions. There are two ways out of this dilemma: Either the initial binary frequency in the Orion Nebula Cluster was lower than in Taurus-Auriga, or the Orion Nebula Cluster was originally much denser and dynamically more active.
Binary Stars in the Orion Nebula Cluster
NASA Astrophysics Data System (ADS)
Köhler, Rainer; Petr-Gotzens, Monika G.; McCaughrean, Mark J.; Bouvier, Jerome; Duchêne, Gaspard; Quirrenbach, Andreas; Zinnecker, Hans
2007-08-01
We report on a high-spatial-resolution survey for binary stars in the periphery of the Orion Nebula Cluster, at 5 - 15 arcmin (0.65 - 2 pc) from the cluster center. We observed 228 stars with adaptive optics systems, in order to find companions at separations of 0.13 - 1.12 arcsec (60 - 500 AU), and detected 13 new binaries. Combined with the results of Petr (1998), we have a sample of 275 objects, about half of which have masses from the literature and high probabilities to be cluster members. We used an improved method to derive the completeness limits of the observations, which takes into account the elongated point spread function of stars at relatively large distances from the adaptive optics guide star. The multiplicity of stars with masses >2 Msun is found to be significantly larger than that of low-mass stars. The companion star frequency of low-mass stars is comparable to that of main-sequence M-dwarfs, less than half that of solar-type main-sequence stars, and 3.5 to 5 times lower than in the Taurus-Auriga and Scorpius-Centaurus star-forming regions. We find the binary frequency of low-mass stars in the periphery of the cluster to be the same or only slightly higher than for stars in the cluster core (<3 arcmin from θ1C Ori). This is in contrast to the prediction of the theory that the low binary frequency in the cluster is caused by the disruption of binaries due to dynamical interactions. There are two ways out of this dilemma: Either the initial binary frequency in the Orion Nebula Cluster was lower than in Taurus-Auriga, or the Orion Nebula Cluster was originally much denser and dynamically more active.
Analytic Study of Periodic Chaos. II ---Recursion Relations for the Power Spectra---
NASA Astrophysics Data System (ADS)
Yoshida, T.
1985-02-01
On the basis of the analytic formulas for the correlation functions of nonperiodic orbits, the recursion relations are obtained which fully characterize the spectral structure of periodic chaos generated by continuous one-dimensional maps with a single maximum. The power spectrum at the mth band-splitting point consists of two parts, a line spectrum and a continuous spectrum, and each part is determined from the corresponding part at the (m-1)th band-splitting point through its own recursion relations, and thus the spectra near the chaotic critical point are completely determined. Moreover, it is shown that there exist the intrinsic relations between the intensities of the line and continuous spectra. The scaling law for the particlular orbits decisive of the correlation functions plays an essential role in deriving the recursion relations. The tent map has the exact recursion relations with the two rescaling factors dependent on m. The corresponding relations hold for the logistic map to an excellent approximation with the two rescaling factors replaced by α2 and -α, where α is Feigenbaum's rescaling factor. Universal aspects of the recursion relations are also discussed.
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
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.
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.
Dynamic State Estimation of Power Systems With Quantization Effects: A Recursive Filter Approach.
Hu, Liang; Wang, Zidong; Liu, Xiaohui
2016-08-01
In this paper, a recursive filter algorithm is developed to deal with the state estimation problem for power systems with quantized nonlinear measurements. The measurements from both the remote terminal units and the phasor measurement unit are subject to quantizations described by a logarithmic quantizer. Attention is focused on the design of a recursive filter such that, in the simultaneous presence of nonlinear measurements and quantization effects, an upper bound for the estimation error covariance is guaranteed and subsequently minimized. Instead of using the traditional approximation methods in nonlinear estimation that simply ignore the linearization errors, we treat both the linearization and quantization errors as norm-bounded uncertainties in the algorithm development so as to improve the performance of the estimator. For the power system with such kind of introduced uncertainties, a filter is designed in the framework of robust recursive estimation, and the developed filter algorithm is tested on the IEEE benchmark power system to demonstrate its effectiveness. PMID:25576579
New Positions and/or Orbits for Binary Stars Observed at the SOR
NASA Astrophysics Data System (ADS)
Drummond, J.
2012-09-01
Many binary stars observed at the SOR during adaptive optics calibration on the 3.5 m telescope turn out to be 'off orbit', especially those from the 'All Binaries' spreadsheet (as opposed to the 'Calibration Binaries' spreadsheet) that I made available at the AMOS Conference last year. In some cases new companions have been discovered. New positions and relative magnitudes will be reported, and for some, new orbits. At the separations available through AO, most binaries show motion, making the best calibrators those with derived orbits. The conclusion is that many new binary discoveries can be made by simply turning on AO in the IR.
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
Close binary systems before and after mass transfer. III - Spectroscopic binaries
NASA Astrophysics Data System (ADS)
Vansina, F.; De Greve, J. P.
1982-10-01
A method is presented, for the computation of absolute dimensions from spectroscopic data on binary systems, which has been adapted for use with the 7th Catalogue of Batten et al. (1978) and takes into account several results of close binary evolution, with emphasis on the phase of slow mass transfer during a case B mass transfer. Among the unevolved systems, the mass transfer case B is found to be the most abundant type of interaction. In the set of evolving systems, a subset of 18 interacting systems was found with mass ratio near unity, the first star being the mass loser as well as the brightest.
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.
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.
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.
Simplified recursive algorithm for Wigner 3j and 6j symbols
Luscombe, J.H.; Luban, M.
1998-06-01
We present a highly accurate, {ital ab initio} recursive algorithm for evaluating the Wigner 3j and 6j symbols. Our method makes use of two-term, nonlinear recurrence relations that are obtained from the standard three-term recurrence relations satisfied by these quantities. The use of two-term recurrence relations eliminates the need for rescaling of iterates to control numerical overflows and thereby simplifies the widely used recursive algorithm of Schulten and Gordon. {copyright} {ital 1998} {ital The American Physical Society}
Kalman filtering, smoothing, and recursive robot arm forward and inverse dynamics
NASA Technical Reports Server (NTRS)
Rodriguez, Guillermo
1987-01-01
The recursive difference equations of Kalman filtering and Bryson-Frazier fixed time-interval smoothing, arising in the state estimation theory for linear state space systems, are used here to solve problems of serial manipulator inverse and forward dynamics. The configuration analyzed is that of a joint connected N-link serial manipulator attached to an immobile base. The equivalence between the filtering and smoothing techniques from state estimation theory and recursive robot dynamics methods is demonstrated. Several areas for future research are suggested.
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 Technical Reports Server (NTRS)
Rogers, J. R., III
1980-01-01
Flexible simulator for trouble-shooting data transmission system uses binary synchronous communications protocol to produce error-free transmission of data between two points. Protocol may be used to replace display generator or be directly fed to display generator.
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.
Butel, Guillaume P; Smith, Greg A; Burge, James H
2014-02-10
Deflectometry is widely used to accurately calculate the slopes of any specular reflective surface, ranging from car bodies to nanometer-level mirrors. This paper presents a new deflectometry technique using binary patterns of increasing frequency to retrieve the surface slopes. Binary Pattern Deflectometry allows almost instant, simple, and accurate slope retrieval, which is required for applications using mobile devices. The paper details the theory of this deflectometry method and the challenges of its implementation. Furthermore, the binary pattern method can also be combined with a classic phase-shifting method to eliminate the need of a complex unwrapping algorithm and retrieve the absolute phase, especially in cases like segmented optics, where spatial algorithms have difficulties. Finally, whether it is used as a stand-alone or combined with phase-shifting, the binary patterns can, within seconds, calculate the slopes of any specular reflective surface. PMID:24663273
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 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 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.
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
Superresolution restoration of an image sequence: adaptive filtering approach.
Elad, M; Feuer, A
1999-01-01
This paper presents a new method based on adaptive filtering theory for superresolution restoration of continuous image sequences. The proposed methodology suggests least squares (LS) estimators which adapt in time, based on adaptive filters, least mean squares (LMS) or recursive least squares (RLS). The adaptation enables the treatment of linear space and time-variant blurring and arbitrary motion, both of them assumed known. The proposed new approach is shown to be of relatively low computational requirements. Simulations demonstrating the superresolution restoration algorithms are presented. PMID:18262881
An averaging analysis of discrete-time indirect adaptive control
NASA Technical Reports Server (NTRS)
Phillips, Stephen M.; Kosut, Robert L.; Franklin, Gene F.
1988-01-01
An averaging analysis of indirect, discrete-time, adaptive control systems is presented. The analysis results in a signal-dependent stability condition and accounts for unmodeled plant dynamics as well as exogenous disturbances. This analysis is applied to two discrete-time adaptive algorithms: an unnormalized gradient algorithm and a recursive least-squares (RLS) algorithm with resetting. Since linearization and averaging are used for the gradient analysis, a local stability result valid for small adaptation gains is found. For RLS with resetting, the assumption is that there is a long time between resets. The results for the two algorithms are virtually identical, emphasizing their similarities in adaptive control.
SIMULATING VENTILATION DISTRIBUTION IN HETEROGENOUS LUNG INJURY USING A BINARY TREE DATA STRUCTURE
Colletti, Ashley A.; Amini, Reza; Kaczka, David W.
2011-01-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. PMID:21872852
Efficient design of direct-binary-search computer-generated holograms
Jennison, B.K.; Allebach. J.P. ); Sweeney, D.W. )
1991-04-01
Computer-generated holograms (CGH's) synthesized by the iterative direct-binary-search (DBS) algorithm yield lower reconstruction error and higher diffraction efficiency than do CGH's designed by conventional methods, but the DBS algorithm is computationally intensive. A fast algorithm for DBS is developed that recursively computes the error measure to be minimized. For complex amplitude-based error, the required computation for an L-point and modifications are considered in order to make the algorithm more efficient. An acceleration technique that attempts to increase the rate of convergence of the DBS algorithm is also investigated.
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
Adaptive state estimation for control of flexible structures
NASA Technical Reports Server (NTRS)
Chen, Chung-Wen; Huang, Jen-Kuang
1990-01-01
This paper proposes a new approach of obtaining adaptive state estimation of a system in the presence of unknown system disturbances and measurement noise. In the beginning, a non-optimal Kalman filter with arbitrary initial guess for the process and measurement noises is implemented. At the same time, an adaptive transversal predictor (ATP) based on the recursive least-squares (RLS) algorithm is used to yield optimal one- to p- step-ahead output predictions using the previous input/output data. Referring to these optimal predictions the Kalman filter gain is updated and the performance of the state estimation is thus improved. If forgetting factor is implemented in the recursive least-squares algorithm, this method is also capable of dealing with the situation when the noise statistics are slowly time-varying. This feature makes this new approach especially suitable for the control of flexible structures. A numerical example demonstrates the feasibility of this real time adaptive state estimation method.
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.
The recursive maximum likelihood proportion estimator: User's guide and test results
NASA Technical Reports Server (NTRS)
Vanrooy, D. L.
1976-01-01
Implementation of the recursive maximum likelihood proportion estimator is described. A user's guide to programs as they currently exist on the IBM 360/67 at LARS, Purdue is included, and test results on LANDSAT data are described. On Hill County data, the algorithm yields results comparable to the standard maximum likelihood proportion estimator.
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...
X-ray resonant reflection from magnetic multilayers: Recursion matrix algorithm
Stepanov, S. A.; Sinha, S. K.
2000-06-01
Recursion equations for 2x2 scattering matrices have been derived to calculate resonant x-ray reflection from magnetic multilayers. The solution has been basically reduced to that found in Stepanov et al, Phys. Rev. B 57, 4829 (1998) for grazing incidence x-ray diffraction from crystalline multilayers. (c) 2000 The American Physical Society.
Recursive inverse kinematics for robot arms via Kalman filtering and Bryson-Frazier smoothing
NASA Technical Reports Server (NTRS)
Rodriguez, G.; Scheid, R. E., Jr.
1987-01-01
This paper applies linear filtering and smoothing theory to solve recursively the inverse kinematics problem for serial multilink manipulators. This problem is to find a set of joint angles that achieve a prescribed tip position and/or orientation. A widely applicable numerical search solution is presented. The approach finds the minimum of a generalized distance between the desired and the actual manipulator tip position and/or orientation. Both a first-order steepest-descent gradient search and a second-order Newton-Raphson search are developed. The optimal relaxation factor required for the steepest descent method is computed recursively using an outward/inward procedure similar to those used typically for recursive inverse dynamics calculations. The second-order search requires evaluation of a gradient and an approximate Hessian. A Gauss-Markov approach is used to approximate the Hessian matrix in terms of products of first-order derivatives. This matrix is inverted recursively using a two-stage process of inward Kalman filtering followed by outward smoothing. This two-stage process is analogous to that recently developed by the author to solve by means of spatial filtering and smoothing the forward dynamics problem for serial manipulators.
NASA 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.
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.
Mean-Field Analysis of Recursive Entropic Segmentation of Biological Sequences
NASA Astrophysics Data System (ADS)
Cheong, Siew-Ann; Stodghill, Paul; Schneider, David; Myers, Christopher
2007-03-01
Horizontal gene transfer in bacteria results in genomic sequences which are mosaic in nature. An important first step in the analysis of a bacterial genome would thus be to model the statistically nonstationary nucleotide or protein sequence with a collection of P stationary Markov chains, and partition the sequence of length N into M statistically stationary segments/domains. This can be done for Markov chains of order K = 0 using a recursive segmentation scheme based on the Jensen-Shannon divergence, where the unknown parameters P and M are estimated from a hypothesis testing/model selection process. In this talk, we describe how the Jensen-Shannon divergence can be generalized to Markov chains of order K > 0, as well as an algorithm optimizing the positions of a fixed number of domain walls. We then describe a mean field analysis of the generalized recursive Jensen-Shannon segmentation scheme, and show how most domain walls appear as local maxima in the divergence spectrum of the sequence, before highlighting the main problem associated with the recursive segmentation scheme, i.e. the strengths of the domain walls selected recursively do not decrease monotonically. This problem is especially severe in repetitive sequences, whose statistical signatures we will also discuss.
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 Astrophysics Data System (ADS)
Giménez, Alvaro; Rucinski, Slavek; Szkody, P.; Gies, D.; Kang, Y.-W.; Linsky, J.; Livio, M.; Morrell, N.; Hilditch, R.; Nordström, B.; Ribas, I.; Sion, E.; Vrielman, S.
2007-03-01
The triennial report from Commission 42 covers various topics like massive binaries, contact systems, cataclysmic variables and low-mass binary stars. We try in a number of sections to provide an update on the current status of the main research areas in the field of close binaries. It is not a formal review, even complete or comprehensive, but an attempt to bring the main topics on recent research to astronomers working in other fields. References are also not comprehensive and simply added to the text to help the reader looking for deeper information on the subject. For this reason, we have chosen to include references (sometimes incomplete for ongoing work) not in a list at the end but integrated with the main text body. Complete references and additional sources can be easily obtained through web access of ADS or SIMBAD. Furthermore, the summary of papers on close-binary research contained in the Bibliography of Close Binaries (BCB) can be accessed from the web site of Commission 42. I would like to express the gratitude of the commission for the careful work of Colin Scarfe as Editor-in-Chief of BCB and Andras Holl and Attila Sragli for maintaining the web pages of the Commission within the structure of Division V. Finally, K. Olah and J. Jurcsik are gratefully acknowledged for their continued support as editors of the Information Bulletin on Variable Stars (IBVS), also accessible through the commission web page.
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.
NASA Astrophysics Data System (ADS)
Kadam, Kundan; Clayton, Geoffrey C.; Frank, Juhan; Tohline, Joel E.; Staff, Jan E.; Motl, Patrick M.; Marcello, Dominic
2014-06-01
About one in every 150 stars is a contact binary system of WUMa type and it was thought for a long time that such a binary would naturally proceed towards merger, forming a single star. In September 2008 such a merger was observed in the eruption of a “red nova", V1309 Sco. We are developing a hydrodynamics simulation for contact binaries using Self Consistent Field (SCF) techniques, so that their formation, structural, and merger properties could be studied. This model can also be used to probe the stability criteria such as the large-scale equatorial circulations and the minimum mass ratio. We also plan to generate light curves from the simulation data in order to compare with the observed case of V1309 Sco. A comparison between observations and simulations will help us better understand the nova-like phenomena of stellar mergers.
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.
Component Properties of T Tauri Star Binaries
NASA Astrophysics Data System (ADS)
Muzzio, Ryan; L. Prato, T. Allen, N. Wright-Garba, L. Biddle, J. McLane (Lowell Observatory), G. Schaefer (GSU & CHARA)
2016-01-01
This poster describes our study of the properties of individual components of young T Tauri binary stars. We observed about 100 multi-star systems in the near-infrared, within the relatively close star forming regions Taurus and Ophiuchus. Here we specifically focus on four systems in the Taurus sample, IS Tau, UZ Tau B, IW Tau, and Haro 6- 37 A. Their spectra were taken with the Keck 2 telescope's NIRSPEC spectrograph and the imaging data with the Keck 2 NIRC2 camera, both with adaptive optics. Properties that we determined include spectral type, radial velocity, vsini, veiling, and near-infrared colors. On the basis of these data, we estimate stellar and circumstellar disk properties for the subset of binaries presented here.
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)
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.
Binary concatenated coding system
NASA Technical Reports Server (NTRS)
Monford, L. G., Jr.
1973-01-01
Coding, using 3-bit binary words, is applicable to any measurement having integer scale up to 100. System using 6-bit data words can be expanded to read from 1 to 10,000, and 9-bit data words can increase range to 1,000,000. Code may be ''read'' directly by observation after memorizing simple listing of 9's and 10's.
Binary primitive alternant codes
NASA Technical Reports Server (NTRS)
Helgert, H. J.
1975-01-01
In this note we investigate the properties of two classes of binary primitive alternant codes that are generalizations of the primitive BCH codes. For these codes we establish certain equivalence and invariance relations and obtain values of d and d*, the minimum distances of the prime and dual codes.
Interacting binaries. Lecture notes 1992.
NASA Astrophysics Data System (ADS)
Nussbaumer, H.; Orr, A.
These lecture notes represent a unique collection of information and references on current research on interacting binaries: S. N. Shore puts the emphasis on observations and their connection to relevant physics. He also discusses symbiotic stars. Cataclysmic variables are the subject of M. Livio's course, whereas E. P. J. van den Heuvel concentrates on more massive binaries and X-ray binaries.
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.
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
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.
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.
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)
Rodriguez, G.
1988-01-01
The inverse and forward dynamics problems for a set of rigid bodies connected by hinges to form a topological tree are solved by using recursive techniques from linear filtering and smoothing theory. An inward filtering sequence computes a set of constraint moments and forces. This is followed by an outward sequence to determine a corresponding set of angular and linear accelerations. An inward sequence begins at the tips of all of the terminal bodies of the tree and proceeds inwardly through all of the branches until it reaches the root. Similarly, an outward sequence begins at the root and propagates to all of the tree branches until it reaches the tips of the terminal bodies. The paper also provides an approach to evaluate recursively the composite multibody system inertia matrix and its inverse.
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.
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.
Recursive Double-Size Modular Multiplications from Euclidean and Montgomery Multipliers
NASA Astrophysics Data System (ADS)
Yoshino, Masayuki; Okeya, Katsuyuki; Vuillaume, Camille
A technique for computing the quotient (⌊ ab/n ⌋) of Euclidean divisions from the difference of two remainders (ab (mod n) - ab (mod n+1)) was proposed by Fischer and Seifert. The technique allows a 2l-bit modular multiplication to work on most l-bit modular multipliers. However, the cost of the quotient computation rises sharply when computing modular multiplications larger than 2l bits with a recursive approach. This paper addresses the computation cost and improves on previous 2l-bit modular multiplication algorithms to return not only the remainder but also the quotient, resulting in an higher performance in the recursive approach, which becomes twice faster in the quadrupling case and four times faster in the octupling case. In addition to Euclidean multiplication, this paper proposes a new 2l-bit Montgomery multiplication algorithm to return both of the remainder and the quotient.
Ö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.
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.
NASA Technical Reports Server (NTRS)
Nikravesh, Parviz E.; Gim, Gwanghum; Arabyan, Ara; Rein, Udo
1989-01-01
The formulation of a method known as the joint coordinate method for automatic generation of the equations of motion for multibody systems is summarized. For systems containing open or closed kinematic loops, the equations of motion can be reduced systematically to a minimum number of second order differential equations. The application of recursive and nonrecursive algorithms to this formulation, computational considerations and the feasibility of implementing this formulation on multiprocessor computers are discussed.
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.
Attitude estimation of earth orbiting satellites by decomposed linear recursive filters
NASA Technical Reports Server (NTRS)
Kou, S. R.
1975-01-01
Attitude estimation of earth orbiting satellites (including Large Space Telescope) subjected to environmental disturbances and noises was investigated. Modern control and estimation theory is used as a tool to design an efficient estimator for attitude estimation. Decomposed linear recursive filters for both continuous-time systems and discrete-time systems are derived. By using this accurate estimation of the attitude of spacecrafts, state variable feedback controller may be designed to achieve (or satisfy) high requirements of system performance.
Haydock’s recursive solution of self-adjoint problems. Discrete spectrum
Moroz, Alexander
2014-12-15
Haydock’s recursive solution is shown to underline a number of different concepts such as (i) quasi-exactly solvable models, (ii) exactly solvable models, (iii) three-term recurrence solutions based on Schweber’s quantization criterion in Hilbert spaces of entire analytic functions, and (iv) a discrete quantum mechanics of Odake and Sasaki. A recurrent theme of Haydock’s recursive solution is that the spectral properties of any self-adjoint problem can be mapped onto a corresponding sequence of polynomials (p{sub n}(E)) in energy variable E. The polynomials (p{sub n}(E)) are orthonormal with respect to the density of states n{sub 0}(E) and energy eigenstate |E〉 is the generating function of (p{sub n}(E)). The generality of Haydock’s recursive solution enables one to see the different concepts from a unified perspective and mutually benefiting from each other. Some results obtained within the particular framework of any of (i) to (iv) may have much broader significance.
NASA Astrophysics Data System (ADS)
Deano, Alfredo; Segura, Javier
2007-06-01
Three term recurrence relations y_{n+1}+b_n y_n+a_n y_{n-1}D0 can be used for computing recursively a great number of special functions. Depending on the asymptotic nature of the function to be computed, different recursion directions need to be considered: backward for minimal solutions and forward for dominant solutions. However, some solutions interchange their role for finite values of n with respect to their asymptotic behaviour and certain dominant solutions may transitorily behave as minimal. This phenomenon, related to Gautschi's anomalous convergence of the continued fraction for ratios of confluent hypergeometric functions, is shown to be a general situation which takes place for recurrences with a_n negative and b_n changing sign once. We analyze the anomalous convergence of the associated continued fractions for a number of different recurrence relations (modified Bessel functions, confluent and Gauss hypergeometric functions) and discuss the implication of such transitory behaviour on the numerical stability of recursion.
Recursive Hierarchical Image Segmentation by Region Growing and Constrained Spectral Clustering
NASA Technical Reports Server (NTRS)
Tilton, James C.
2002-01-01
This paper describes an algorithm for hierarchical image segmentation (referred to as HSEG) and its recursive formulation (referred to as RHSEG). The HSEG algorithm is a hybrid of region growing and constrained spectral clustering that produces a hierarchical set of image segmentations based on detected convergence points. In the main, HSEG employs the hierarchical stepwise optimization (HS WO) approach to region growing, which seeks to produce segmentations that are more optimized than those produced by more classic approaches to region growing. In addition, HSEG optionally interjects between HSWO region growing iterations merges between spatially non-adjacent regions (i.e., spectrally based merging or clustering) constrained by a threshold derived from the previous HSWO region growing iteration. While the addition of constrained spectral clustering improves the segmentation results, especially for larger images, it also significantly increases HSEG's computational requirements. To counteract this, a computationally efficient recursive, divide-and-conquer, implementation of HSEG (RHSEG) has been devised and is described herein. Included in this description is special code that is required to avoid processing artifacts caused by RHSEG s recursive subdivision of the image data. Implementations for single processor and for multiple processor computer systems are described. Results with Landsat TM data are included comparing HSEG with classic region growing. Finally, an application to image information mining and knowledge discovery is discussed.
A recursive model-reduction method for approximate inference in Gaussian Markov random fields.
Johnson, Jason K; Willsky, Alan S
2008-01-01
This paper presents recursive cavity modeling--a principled, tractable approach to approximate, near-optimal inference for large Gauss-Markov random fields. The main idea is to subdivide the random field into smaller subfields, constructing cavity models which approximate these subfields. Each cavity model is a concise, yet faithful, model for the surface of one subfield sufficient for near-optimal inference in adjacent subfields. This basic idea leads to a tree-structured algorithm which recursively builds a hierarchy of cavity models during an "upward pass" and then builds a complementary set of blanket models during a reverse "downward pass." The marginal statistics of individual variables can then be approximated using their blanket models. Model thinning plays an important role, allowing us to develop thinned cavity and blanket models thereby providing tractable approximate inference. We develop a maximum-entropy approach that exploits certain tractable representations of Fisher information on thin chordal graphs. Given the resulting set of thinned cavity models, we also develop a fast preconditioner, which provides a simple iterative method to compute optimal estimates. Thus, our overall approach combines recursive inference, variational learning and iterative estimation. We demonstrate the accuracy and scalability of this approach in several challenging, large-scale remote sensing problems. PMID:18229805
NASA Astrophysics Data System (ADS)
Hu, Jun; Wang, Zidong; Shen, Bo; Gao, Huijun
2013-04-01
This article is concerned with the recursive finite-horizon filtering problem for a class of nonlinear time-varying systems subject to multiplicative noises, missing measurements and quantisation effects. The missing measurements are modelled by a series of mutually independent random variables obeying Bernoulli distributions with possibly different occurrence probabilities. The quantisation phenomenon is described by using the logarithmic function and the multiplicative noises are considered to account for the stochastic disturbances on the system states. Attention is focused on the design of a recursive filter such that, for all multiplicative noises, missing measurements as well as quantisation effects, an upper bound for the filtering error covariance is guaranteed and such an upper bound is subsequently minimised by properly designing the filter parameters at each sampling instant. The desired filter parameters are obtained by solving two Riccati-like difference equations that are of a recursive form suitable for online applications. Finally, two simulation examples are exploited to demonstrate the effectiveness and applicability of the proposed filter design scheme.
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.
Microfluidic binary phase flow
NASA Astrophysics Data System (ADS)
Angelescu, Dan; Menetrier, Laure; Wong, Joyce; Tabeling, Patrick; Salamitou, Philippe
2004-03-01
We present a novel binary phase flow regime where the two phases differ substantially in both their wetting and viscous properties. Optical tracking particles are used in order to investigate the details of such multiphase flow inside capillary channels. We also describe microfluidic filters we have developed, capable of separating the two phases based on capillary pressure. The performance of the filters in separating oil-water emulsions is discussed. Binary phase flow has been previously used in microchannels in applications such as emulsion generation, enhancement of mixing and assembly of custom colloidal paticles. Such microfluidic systems are increasingly used in a number of applications spanning a diverse range of industries, such as biotech, pharmaceuticals and more recently the oil industry.
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.
NASA Astrophysics Data System (ADS)
Mochnacki, S. W.
1981-04-01
Densities, corrected primary colors, minimum periods, inferred masses, luminosities, and specific angular momenta are computed from data on 37 W Ursae Majoris systems. A-type systems, having lower densities and angular momenta than the W-type systems, are shown to be evolved, and a new class of contact binary is identified, the OO Aquilae systems, whose members have evolved into contact. Evolutionary grids based on the contact condition agree with observation, except in that the evolved A-type systems have lost more angular momentum than predicted by gravitational radiation alone. This is accounted for by stellar wind magnetic braking, which is shown to be effective on a shorter time scale and to be important in other kinds of binaries containing a cool, tidally coupled component.
Adaptive identification by systolic arrays. Master's thesis
Willis, P.A.
1987-12-01
This thesis is concerned with the implementation of an adaptive-identification algorithm using parallel processing and systolic arrays. In particular, discrete samples of input and output data of a system with uncertain characteristics are used to determine the parameters of its model. The identification algorithm is based on recursive least squares, QR decomposition, and block-processing techniques with covariance resetting. Along similar lines as previous approaches, the identification process is based on the use of Givens rotations. This approach uses the Cordic algorithm for improved numerical efficiency in performing the rotations. Additionally, floating-point and fixed-point arithmetic implementations are compared.
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.
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.
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.
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.
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.
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
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.
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.
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.
The Search for Trojan Binaries
NASA Astrophysics Data System (ADS)
Merline, William J.; Tamblyn, P. M.; Dumas, C.; Close, L. M.; Chapman, C. R.; Durda, D. D.; Levison, H. F.; Hamilton, D. P.; Nesvorny, D.; Storrs, A.; Enke, B.; Menard, F.
2007-10-01
We report on observations of Jupiter Trojan asteroids in search of binaries. We made observations using HST/ACS of 35 small (V = 17.5-19.5) objects in Cycle 14, without detecting any binaires. We have also observed a few dozen Trojans in our ground-based study of larger Trojans, discovering only one binary. The result is that the frequency of moderately-separated binaries among the Trojans seem rather low, likely less than 5%. Although we have only statistics of small numbers, it appears that the binary frequencies are more akin to the larger Main-Belt asteroids, than to the frequency in the TNO region, which probably exceeds 10%. The low frequency is inconsistent with the projections based on Trojan contact binaries by Mann et al. (2006, BAAS 38, 6509), although our work cannot detect very close or contact binaries. We discovered and characterized the orbit and density of the first Trojan binary, (617) Patroclus using the Gemini AO system (Merline et al. 2001 IAUC 7741). A second binary, (624) Hecktor, has now been reported by Marchis et al. (2006, IAUC 8732). In a broad survey of Main Belt asteroids, we found that, among the larger objects, the binary fraction is about 2%, while we are finding that the fraction is significantly higher among smaller asteroids (and this is even more apparent from lightcurve discoveries). Further, characteristics of these smaller systems indicate a distinctly different formation mechanism the the larger MB binaries. Because the Trojans have compositions that are more like the KBOs, while they live in a collisional environment much more like the Main Belt than the KBOs, these objects should hold vital clues to binary formation mechanics. And because there seems to be a distinct difference in larger and smaller main-belt binaries, we sought to detect such differences among the Trojans as well.
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.
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.
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.
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.
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
CAMORRA: A C++ library for recursive computation of particle scattering amplitudes
NASA Astrophysics Data System (ADS)
Kleiss, R.; van den Oord, G.
2011-02-01
We present a new Monte Carlo tool that computes full tree-level matrix elements in high-energy physics. The program accepts user-defined models and has no restrictions on the process multiplicity. To achieve acceptable performance, CAMORRA evaluates the matrix elements in a recursive way by combining off-shell currents. Furthermore, CAMORRA can be used to compute amplitudes involving continuous color and helicity final states. Program summaryProgram title: CAMORRA Catalogue identifier: AEHN_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEHN_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: GPL version 2 No. of lines in distributed program, including test data, etc.: 252 572 No. of bytes in distributed program, including test data, etc.: 1 711 469 Distribution format: tar.gz Programming language: C++ Computer: All Operating system: Tested on Linux and Mac OS, but should work on any system Classification: 4.4 Nature of problem: Current recursive matrix element computation programs are confined to standard model amplitudes, whereas many new physics signatures and backgrounds at hadron colliders are associated with multi-parton final states. Solution method: The library applies the Berends-Giele/Caravaglios-Moretti recursive algorithm in a generic way applicable to a wide range of quantum field theories. It allows the user to define a new physics model and consequently compute its predicted scattering amplitudes with exponential growth of the computing time with process multiplicity rather than factorial growth. Restrictions: There are no built-in restrictions on process complexity. Unusual features: CAMORRA can cope with Majorana fermions. Running time: A ten-gluon amplitude typically takes 9 ms per event.
Adaptive capture of expert knowledge
Barrett, C.L.; Jones, R.D.; Hand, Un Kyong |
1995-05-01
A method is introduced that can directly acquire knowledge-engineered, rule-based logic in an adaptive network. This adaptive representation of the rule system can then replace the rule system in simulated intelligent agents and thereby permit further performance-based adaptation of the rule system. The approach described provides both weight-fitting network adaptation and potentially powerful rule mutation and selection mechanisms. Nonlinear terms are generated implicitly in the mutation process through the emergent interaction of multiple linear terms. By this method it is possible to acquire nonlinear relations that exist in the training data without addition of hidden layers or imposition of explicit nonlinear terms in the network. We smoothed and captured a set of expert rules with an adaptive network. The motivation for this was to (1) realize a speed advantage over traditional rule-based simulations; (2) have variability in the intelligent objects not possible by rule-based systems but provided by adaptive systems: and (3) maintain the understandability of rule-based simulations. A set of binary rules was smoothed and converted into a simple set of arithmetic statements, where continuous, non-binary rules are permitted. A neural network, called the expert network, was developed to capture this rule set, which it was able to do with zero error. The expert network is also capable of learning a nonmonotonic term without a hidden layer. The trained network in feedforward operation is fast running, compact, and traceable to the rule base.
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.
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.
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.
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 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.
A 3-D nonlinear recursive digital filter for video image processing
NASA Technical Reports Server (NTRS)
Bauer, P. H.; Qian, W.
1991-01-01
This paper introduces a recursive 3-D nonlinear digital filter, which is capable of performing noise suppression without degrading important image information such as edges in space or time. It also has the property of unnoticeable bandwidth reduction immediately after a scene change, which makes the filter an attractive preprocessor to many interframe compression algorithms. The filter consists of a nonlinear 2-D spatial subfilter and a 1-D temporal filter. In order to achieve the required computational speed and increase the flexibility of the filter, all of the linear shift-variant filter modules are of the IIR type.
A recursive solution for a fading memory filter derived from Kalman filter theory
NASA Technical Reports Server (NTRS)
Statman, J. I.
1986-01-01
A simple recursive solution for a class of fading memory tracking filters is presented. A fading memory filter provides estimates of filter states based on past measurements, similar to a traditional Kalman filter. Unlike a Kalman filter, an exponentially decaying weight is applied to older measurements, discounting their effect on present state estimates. It is shown that Kalman filters and fading memory filters are closely related solutions to a general least squares estimator problem. Closed form filter transfer functions are derived for a time invariant, steady state, fading memory filter. These can be applied in loop filter implementation of the Deep Space Network (DSN) Advanced Receiver carrier phase locked loop (PLL).
NASA Astrophysics Data System (ADS)
Calcagnile, Lucio M.; Galatolo, Stefano; Menconi, Giulia
2010-12-01
We numerically test the method of non-sequential recursive pair substitutions to estimate the entropy of an ergodic source. We compare its performance with other classical methods to estimate the entropy (empirical frequencies, return times, and Lyapunov exponent). We have considered as a benchmark for the methods several systems with different statistical properties: renewal processes, dynamical systems provided and not provided with a Markov partition, and slow or fast decay of correlations. Most experiments are supported by rigorous mathematical results, which are explained in the paper.
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.
Generalized Recursion Relations for Correlators in the Gauge-Gravity Correspondence
Raju, Suvrat
2011-03-04
We show that a generalization of the Britto-Cachazo-Feng-Witten recursion relations gives a new and efficient method of computing correlation functions of the stress tensor or conserved currents in conformal field theories with an (d+1)-dimensional anti-de Sitter space dual, for d{>=}4, in the limit where the bulk theory is approximated by tree-level Yang-Mills theory or gravity. In supersymmetric theories, additional correlators of operators that live in the same multiplet as a conserved current or stress tensor can be computed by these means.
NASA Technical Reports Server (NTRS)
Sidar, M.
1976-01-01
The problem of identifying constant and variable parameters in multi-input, multi-output, linear and nonlinear systems is considered, using the maximum likelihood approach. An iterative algorithm, leading to recursive identification and tracking of the unknown parameters and the noise covariance matrix, is developed. Agile tracking and accurate and unbiased identified parameters are obtained. Necessary conditions for a globally asymptotically stable identification process are provided; the conditions proved to be useful and efficient. Among different cases studied, the stability derivatives of an aircraft were identified and some of the results are shown as examples.
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.
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.
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…
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
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.
NASA Astrophysics Data System (ADS)
Rieger, Samantha
2015-05-01
Recent observations have found that some contact binaries are oriented such that the secondary impacts with the primary at a high inclination. This research investigates the evolution of how such contact binaries came to exist. This process begins with an asteroid pair, where the secondary lies on the Laplace plane. The Laplace plane is a plane normal to the axis about which the pole of a satellites orbit precesses, causing a near constant inclination for such an orbit. For the study of the classical Laplace plane, the secondary asteroid is in circular orbit around an oblate primary with axial tilt. This system is also orbiting the Sun. Thus, there are two perturbations on the secondarys orbit: J2 and third body Sun perturbations. The Laplace surface is defined as the group of orbits that lie on the Laplace plane at varying distances from the primary. If the secondary is very close to the primary, the inclination of the Laplace plane will be near the equator of the asteroid, while further from the primary the inclination will be similar to the asteroid-Sun plane. The secondary will lie on the Laplace plane because near the asteroid the Laplace plane is stable to large deviations in motion, causing the asteroid to come to rest in this orbit. Assuming the secondary is asymmetrical in shape and the bodys rotation is synchronous with its orbit, the secondary will experience the BYORP effect. BYORP can cause secular motion such as the semi-major axis of the secondary expanding or contracting. Assuming the secondary expands due to BYORP, the secondary will eventually reach the unstable region of the Laplace plane. The unstable region exists if the primary has an obliquity of 68.875 degrees or greater. The unstable region exists at 0.9 Laplace radius to 1.25 Laplace radius, where the Laplace radius is defined as the distance from the central body where the inclination of the Laplace plane orbit is half the obliquity. In the unstable region, the eccentricity of the orbit
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.
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.
Recursive Random Lasso (RRLasso) for Identifying Anti-Cancer Drug Targets
Park, Heewon; Imoto, Seiya; Miyano, Satoru
2015-01-01
Uncovering driver genes is crucial for understanding heterogeneity in cancer. L1-type regularization approaches have been widely used for uncovering cancer driver genes based on genome-scale data. Although the existing methods have been widely applied in the field of bioinformatics, they possess several drawbacks: subset size limitations, erroneous estimation results, multicollinearity, and heavy time consumption. We introduce a novel statistical strategy, called a Recursive Random Lasso (RRLasso), for high dimensional genomic data analysis and investigation of driver genes. For time-effective analysis, we consider a recursive bootstrap procedure in line with the random lasso. Furthermore, we introduce a parametric statistical test for driver gene selection based on bootstrap regression modeling results. The proposed RRLasso is not only rapid but performs well for high dimensional genomic data analysis. Monte Carlo simulations and analysis of the “Sanger Genomics of Drug Sensitivity in Cancer dataset from the Cancer Genome Project” show that the proposed RRLasso is an effective tool for high dimensional genomic data analysis. The proposed methods provide reliable and biologically relevant results for cancer driver gene selection. PMID:26544691
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. PMID:26328719
de Maturana, Evangelina López; Wu, Xiao-Lin; Gianola, Daniel; Weigel, Kent A.; Rosa, Guilherme J. M.
2009-01-01
Structural equation models (SEMs) of a recursive type with heterogeneous structural coefficients were used to explore biological relationships between gestation length (GL), calving difficulty (CD), and perinatal mortality, also known as stillbirth (SB), in cattle, with the last two traits having categorical expression. An acyclic model was assumed, where recursive effects existed from the GL phenotype to the liabilities (latent variables) to CD and SB and from the liability to CD to that of SB considering four periods regarding GL. The data contained GL, CD, and SB records from 90,393 primiparous cows, sired by 1122 bulls, distributed over 935 herd-calving year classes. Low genetic correlations between GL and the other calving traits were found, whereas the liabilities to CD and SB were high and positively correlated, genetically. The model indicated that gestations of ∼274 days of length (3 days shorter than the average) would lead to the lowest CD and SB and confirmed the existence of an intermediate optimum of GL with respect to these traits. PMID:18984571
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).
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.
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
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
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.
Recursive forward dynamics for multiple robot arms moving a common task object
NASA Technical Reports Server (NTRS)
Rodriguez, Guillermo
1989-01-01
Recursive forward dynamics algorithms are developed and presented 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.
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
NASA Astrophysics Data System (ADS)
Badia, Santiago; Martín, Alberto F.; Planas, Ramon
2014-10-01
The thermally coupled incompressible inductionless magnetohydrodynamics (MHD) problem models the flow of an electrically charged fluid under the influence of an external electromagnetic field with thermal coupling. This system of partial differential equations is strongly coupled and highly nonlinear for real cases of interest. Therefore, fully implicit time integration schemes are very desirable in order to capture the different physical scales of the problem at hand. However, solving the multiphysics linear systems of equations resulting from such algorithms is a very challenging task which requires efficient and scalable preconditioners. In this work, a new family of recursive block LU preconditioners is designed and tested for solving the thermally coupled inductionless MHD equations. These preconditioners are obtained after splitting the fully coupled matrix into one-physics problems for every variable (velocity, pressure, current density, electric potential and temperature) that can be optimally solved, e.g., using preconditioned domain decomposition algorithms. The main idea is to arrange the original matrix into an (arbitrary) 2×2 block matrix, and consider an LU preconditioner obtained by approximating the corresponding Schur complement. For every one of the diagonal blocks in the LU preconditioner, if it involves more than one type of unknowns, we proceed the same way in a recursive fashion. This approach is stated in an abstract way, and can be straightforwardly applied to other multiphysics problems. Further, we precisely explain a flexible and general software design for the code implementation of this type of preconditioners.
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
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.
NASA Astrophysics Data System (ADS)
Pourbaix, D.; Arenou, F.; Halbwachs, J.-L.; Siopis, C.
2013-02-01
Gaia's five-year observation baseline might naively lead to the expectation that it will be possible to fit the parallax of any sufficiently nearby object with the default five-parameter model (position at a reference epoch, parallax and proper motion). However, simulated Gaia observations of a `model Universe' composed of nearly 107 objects, 50% of which turn out to be multiple stars, show that the single-star hypothesis can severely affect parallax estimation and that more sophisticated models must be adopted. In principle, screening these spurious single-star solutions is rather straightforward, for example by evaluating the quality of the fits. However, the simulated Gaia observations also reveal that some seemingly acceptable single-star solutions can nonetheless lead to erroneous distances. These solutions turn out to be binaries with an orbital period close to one year. Without auxiliary (e.g., spectroscopic) data, they will remain unnoticed.
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
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)
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).
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.
NASA Astrophysics Data System (ADS)
Dluzhnevskaya, O.; Kaygorodov, P.; Kovaleva, D.; Malkov, O.
2014-05-01
Description of the Binary star DataBase (BDB, http://bdb.inasan.ru), the world's principal database of binary and multiple systems of all observational types, is presented in the paper. BDB contains data on physical and positional parameters of 100,000 components of 40,000 systems of multiplicity 2 to 20, belonging to various observational types: visual, spectroscopic, eclipsing, etc. Information on these types of binaries is obtained from heterogeneous sources of data - astronomical and. Organization of the information is based on the careful cross-identification of the objects. BDB can be queried by star identifier, coordinates, and other parameters.
Modeling selective intergranular oxidation of binary alloys.
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. PMID:25573575
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
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.
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.
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...
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'. PMID:10963862
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.
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.
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.
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.
Ultraviolet spectroscopy of binary systems
NASA Technical Reports Server (NTRS)
Dupree, A. K.; Hartmann, L.; Raymond, J. C.
1980-01-01
Four typical binary systems that illustrate some of the major problems in the study of binary stars are discussed. Consideration is given to (1) high-luminosity X-ray sources typified by Cyg X-1 (HDE 226868) and Vela XR-1 (HD 77581), (2) low-luminosity X-ray sources (HZ Her), (3) late-type systems of W UMa and RS CVn type, and (4) cool supergiants with a hot companion (VV Cephei).
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…
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…
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…
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.
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.
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.
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 anisotropic 2-D Gaussian filtering based on a triple-axis decomposition.
Lam, Stanley Yiu Man; Shi, Bertram E
2007-07-01
We describe a recursive algorithm for anisotropic 2-D Gaussian filtering, based on separating the filter into the cascade of three, rather two, 1-D filters. The filters operate along axes obtained by integer horizontal and/or vertical pixel shifts. This eliminates interpolation, which removes spatial inhomogeneity in the filter, and produces more elliptically shaped kernels. It also results in a more regular filter structure, which facilitates implementation in DSP chips. Finally, it improves matching between filters with the same eccentricity and width, but different orientations. Our analysis and experiments indicate that the computational complexity is similar to an algorithm that operates along two axes (<11 ms for a 512 x 512 image using a 3.2-GHz Pentium 4 PC). On the other hand, given a limited set of basis filter axes, there is an orientation dependent lower bound on the achievable aspect ratios. PMID:17605390
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, ...)
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.
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.
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.
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.
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.
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.
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.
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.
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.
Panageas, Katherine S.; Reiner, Anne S.; Iwamoto, Fabio M.; Cloughesy, Timothy F.; Aldape, Kenneth D.; Rivera, Andreana L.; Eichler, April F.; Louis, David N.; Paleologos, Nina A.; Fisher, Barbara J.; Ashby, Lynn S.; Cairncross, J. Gregory; Roldán Urgoiti, Gloria B.; Wen, Patrick Y.; Ligon, Keith L.; Schiff, David; Robins, H. Ian; Rocque, Brandon G.; Chamberlain, Marc C.; Mason, Warren P.; Weaver, Susan A.; Green, Richard M.; Kamar, Francois G.; Abrey, Lauren E.; DeAngelis, Lisa M.; Jhanwar, Suresh C.; Rosenblum, Marc K.; Lassman, Andrew B.
2014-01-01
Background Anaplastic oligodendroglial tumors are rare, and median survival varies widely. Analysis of 1p19q deletion is performed commonly and is an important prognostic factor. However, age and other clinical variables also carry prognostic value, and it is unclear how to incorporate them into clinical decision making or to combine them for prognostication. Methods We compiled a retrospective database of 1013 patients with newly diagnosed anaplastic oligodendrogliomas or oligoastrocytomas and performed a recursive partitioning analysis to generate independent prognostic classes among 587 patients with informative 1p19q status. Variables included for survival classification were age (continuous), history of prior low-grade glioma, 1p19q deletion status, histology (presence or absence of an astrocytic component), tumor lobe, tumor hemisphere, gender, extent of resection, postresection treatment, and performance status at diagnosis. Results Recursive partitioning analysis identified 5 prognostic groups based on hazard similarity: class I (age <60 y, 1p19q codeleted), class II (age <43 y, not codeleted), class III (age 43–59 y, not codeleted, frontal lobe tumor or age ≥60 y, codeleted), class IV (age 43–59 y, not codeleted, not frontal lobe tumor or age 60–69 y, not codeleted), and class V (age ≥70 y, not codeleted). Survival differences were highly significant (P < .0001), with medians ranging from 9.3 years (95% CI: 8.4–16.0) for class I to 0.6 years (95% CI: 0.5–0.9) for class V. Conclusions These 5 distinct classification groups were defined using prognostic factors typically obtained during routine management of patients with anaplastic oligodendroglial tumors. Validation in a prospective clinical trial may better differentiate patients with respect to treatment outcome. PMID:24997140
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.
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.
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
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.
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.
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.
Orbits and Physical Properties of Four Binary Transneptunian Objects
NASA Astrophysics Data System (ADS)
Grundy, William
2014-10-01
Intriguing patterns are evident in both the orbits of transneptunian objects and in their observable external characteristics (colors, spectral features, etc.). Bulk physical properties are needed to make sense of the observations and to exploit them to constrain conditions in the protoplanetary disk where these objects formed. The key to obtaining bulk properties of transneptunian objects is that a sizeable proportion of them are binaries. Binary mutual orbits provide dynamical masses that can in turn be used to compute bulk densities. A statistical sample of binary orbits offers powerful constraints on formation mechanisms as well as subsequent evolution. This proposal seeks to continue a multi-year campaign to obtain orbits for as large of a sample of binary transneptunian objects as possible. We seek to make efficient use of HST by targeting four systems where we can obtain a dramatic improvement in orbital knowledge from relatively few, strategically timed visits, and where the secondary is too faint for reliable detection with ground-based near-IR adaptive optics techniques.
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
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.
Liquidus of Silicon Binary Systems
NASA Astrophysics Data System (ADS)
Safarian, Jafar; Kolbeinsen, Leiv; Tangstad, Merete
2011-08-01
Thermodynamic knowledge about liquid silicon is crucial for the production of solar-grade silicon feedstock from molten silicon. In the current study, liquidus for silicon binary alloys is formulated using a previously developed method in which the liquidus curve is calculated using two constants. The liquidus measurements for the silicon portion of the silicon alloys with Al, Ca, Mg, Fe, Ti, Zn, Cu, Ag, Au, Pt, Sn, Pb, Bi, Sb, Ga, In, Ni, Pd, Mn, and Rh are reviewed, and the consistent data were used to determine the liquidus constants. The liquidus curves for silicon binary systems are calculated and plotted. It is indicated that the calculated liquidus curves fit well with the experimental data. A correlation between the determined liquidus constants is also observed, which can be used to gain a better understanding of the thermodynamics of the silicon binary melts.
An electrically powered binary star?
NASA Astrophysics Data System (ADS)
Wu, Kinwah; Cropper, Mark; Ramsay, Gavin; Sekiguchi, Kazuhiro
2002-03-01
We propose a model for stellar binary systems consisting of a magnetic and a non-magnetic white dwarf pair which is powered principally by electrical energy. In our model the luminosity is caused by resistive heating of the stellar atmospheres arising from induced currents driven within the binary. This process is reminiscent of the Jupiter-Io system, but greatly increased in power because of the larger companion and stronger magnetic field of the primary. Electrical power is an alternative stellar luminosity source, following on from nuclear fusion and accretion. We find that this source of heating is sufficient to account for the observed X-ray luminosity of the 9.5-min binary RX J1914+24, and provides an explanation for its puzzling characteristics.
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.
The general rescue subsystem-adaptation and structure at sea
Skyttner, L.
1992-12-31
The existence of a general rescue subsystem in higher organisms, as part of the GLS theory and the GAS syndrome, is asserted. Working principle for the system and its existence throughout higher system levels are presented. Among important processes demonstrated are the adaptation of the system to special threats at sea and the storage of the system knowledge and organization in the sea-safety convention. Recursiveness of the rescue subsystem within all higher system levels was found to be a basic requisite for individual survival, especially at sea. Finally, the most serious threat to lives on board ships at sea, was found to be system morality failures. 12 refs.
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)
Heintz, W. D.
1981-04-01
Micrometer observations in 1979-1980 permitted the computation of substantially revised or new orbital elements for 15 visual pairs. They include the bright stars 52 Ari and 78 UMa (in the UMa cluster), four faint dK pairs, and the probable triple ADS 16185. Ephemerides for equator of data are listed in a table along with the orbital elements of the binaries. The measured positions and their residuals are listed in a second table. The considered binaries include ADS 896, 2336, 6315, 7054, 7629, 8092, 8555, 8739, 13987, 16185, Rst 1658, 3906, 3972, 4529, and Jsp 691.
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
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…
Rewarding imperfect motor performance reduces adaptive changes.
van der Kooij, K; Overvliet, K E
2016-06-01
Could a pat on the back affect motor adaptation? Recent studies indeed suggest that rewards can boost motor adaptation. However, the rewards used were typically reward gradients that carried quite detailed information about performance. We investigated whether simple binary rewards affected how participants learned to correct for a visual rotation of performance feedback in a 3D pointing task. To do so, we asked participants to align their unseen hand with virtual target cubes in alternating blocks with and without spatial performance feedback. Forty participants were assigned to one of two groups: a 'spatial only' group, in which the feedback consisted of showing the (perturbed) endpoint of the hand, or to a 'spatial & reward' group, in which a reward could be received in addition to the spatial feedback. In addition, six participants were tested in a 'reward only' group. Binary reward was given when the participants' hand landed in a virtual 'hit area' that was adapted to individual performance to reward about half the trials. The results show a typical pattern of adaptation in both the 'spatial only' and the 'spatial & reward' groups, whereas the 'reward only' group was unable to adapt. The rewards did not affect the overall pattern of adaptation in the 'spatial & reward' group. However, on a trial-by-trial basis, the rewards reduced adaptive changes to spatial errors. PMID:26758721
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.
Recent Minima of 193 Eclipsing Binary Stars
NASA Astrophysics Data System (ADS)
Samolyk, G.
2016-06-01
This paper continues the publication of times of minima for eclipsing binary stars from observations reported to the AAVSO Eclipsing Binary section. Times of minima from CCD observations received by the author from November 2015 through January 2016 are presented.
NASA Astrophysics Data System (ADS)
Huang, Ran; Zhang, Ling; Chen, Chong; Wu, Chengjie; Yan, Linyin
2015-07-01
The ferromagnetic Ising spins are modeled on a recursive lattice constructed from random-angled rhombus units with stochastic configurations, to study the magnetic properties of the bulk Fe-based metallic glass. The integration of spins on the structural glass model well represents the magnetic moments in the glassy metal. The model is exactly solved by the recursive calculation technique. The magnetization of the amorphous Ising spins, i.e. the glassy metallic magnet is investigated by our modeling and calculation on a theoretical base. The results show that the glassy metallic magnets have a lower Curie temperature, weaker magnetization, and higher entropy compared to the regular ferromagnet in crystal form. These findings can be understood with the randomness of the amorphous system, and agree well with other experimental observations.
Fisher, Serena L; Nelson, Douglas L
2006-03-01
In the present experiments, predictions of common path and recursive-reminding models of recognition (RG) and judgments of frequency (JOFs) were contrasted. The results indicated that each task is affected by study frequency, printed frequency, and associative connectivity. However, effect size analyses indicated that study frequency and item attributes show a double dissociation over tasks. Study frequency has a greater effect on JOFs than on RG, whereas printed frequency and associative connectivity have greater effects on RG than on JOFs. The recursive-reminding model predicts differential effects of study frequency, because it assumes that although both tasks are influenced by familiarity, JOF is more likely to be affected by recollective reminding as a procedure for encoding event frequency. Associative set size effects were absent in each task, suggesting that competitors play no role in either task. PMID:16752594
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.
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.
Studying populations of eclipsing binaries using large scale multi-epoch photometric surveys
NASA Astrophysics Data System (ADS)
Mowlavi, Nami; Barblan, Fabio; Holl, Berry; Rimoldini, Lorenzo; Lecoeur-Taïbi, Isabelle; Süveges, Maria; Eyer, Laurent; Guy, Leanne; Nienartowicz, Krzysztof; Ordonez, Diego; Charnas, Jonathan; Jévardat de Fombelle, Grégory
2015-08-01
Large scale multi-epoch photometric surveys provide unique opportunities to study populations of binary stars through the study of eclipsing binaries, provided the basic properties of binary systems can be derived from their light curves without the need to fully model the binary system. Those systems can then be classified into various types from, for example, close to wide systems, from circular to highly elliptical systems, or from systems with similar components to highly asymmetric systems. The challenge is to extract physically relevant information from the light curve geometry.In this contribution, we present the study of eclipsing binaries in the Large Magellanic Clouds (LMC) from the OGLE-III survey. The study is based on the analysis of the geometry of their light curves parameterized using a two-Gaussian model. We show what physical parameters could be extracted from such an analysis, and the results for the LMC eclipsing binaries. The method is very well adapted to process large-scale surveys containing millions of eclipsing binaries, such as is expected from the current Gaia mission or the future LSST survey.
Adaptive hybrid learning for neural networks.
Smithies, Rob; Salhi, Said; Queen, Nat
2004-01-01
A robust locally adaptive learning algorithm is developed via two enhancements of the Resilient Propagation (RPROP) method. Remaining drawbacks of the gradient-based approach are addressed by hybridization with gradient-independent Local Search. Finally, a global optimization method based on recursion of the hybrid is constructed, making use of tabu neighborhoods to accelerate the search for minima through diversification. Enhanced RPROP is shown to be faster and more accurate than the standard RPROP in solving classification tasks based on natural data sets taken from the UCI repository of machine learning databases. Furthermore, the use of Local Search is shown to improve Enhanced RPROP by solving the same classification tasks as part of the global optimization method. PMID:15006027
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.
NASA Astrophysics Data System (ADS)
Bardalez Gagliuffi, Daniella C.; Gelino, Christopher R.; Burgasser, Adam J.
2015-11-01
We present high resolution Laser Guide Star Adaptive Optics imaging of 43 late-M, L and T dwarf systems with Keck/NIRC2. These include 17 spectral binary candidates, systems whose spectra suggest the presence of a T dwarf secondary. We resolve three systems: 2MASS J1341-3052, SDSS J1511+0607 and SDSS J2052-1609 the first two are resolved for the first time. All three have projected separations <8 AU and estimated periods of 14-80 years. We also report a preliminary orbit determination for SDSS J2052-1609 based on six epochs of resolved astrometry between 2005 and 2010. Among the 14 unresolved spectral binaries, 5 systems were confirmed binaries but remained unresolved, implying a minimum binary fraction of {47}-11+12% for this sample. Our inability to resolve most of the spectral binaries, including the confirmed binaries, supports the hypothesis that a large fraction of very low mass systems have relatively small separations and are missed with direct imaging. Some of the data presented herein were obtained at the W.M. Keck Observatory, which is operated as a scientific partnership among the California Institute of Technology, the University of California, and the National Aeronautics and Space Administration. The Observatory was made possible by the generous financial support of the W.M. Keck Foundation.
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.
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.
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.'
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.
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. PMID:11008426
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
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.
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.
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
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
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 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
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.
Analytic Orbit Trajectory Prediction for J2-J6 Using Recursive Lagrange-Like Invariants
NASA Astrophysics Data System (ADS)
Turner, J.; Elgohary, T.
2013-09-01
Two new Lagrange-like invariants have been recently identified that allow exact arbitrary order time derivatives to be computed for the classical two-body problem, as well as the gravitational harmonic terms for J2 through J6. The recursively generated vector-valued time derivatives for the trajectory are used to develop a continuation series-based solution for propagating the position and velocity. The series-based approach is shown to provide a 75X performance boost over state-of-the-art RK12(10) numerical integration methods, while maintaining ~mm position error accuracy. A novel conjunction analysis algorithm is enabled by designing a data structure the retains all of the vector derivatives at each time evaluation point. With thousands of objects to be tracked a nearest-neighbor algorithm is presented that grids space into spatial cubes that are used to store space object identification numbers for investigating potential conjunction events. A cluster-based search algorithm is presented for managing 27 nearest-neighbor cubes for tracking objects in a cube, updating the membership lists, and performing conjunction analysis. The cluster algorithm eliminates global searching strategies for local cluster searching strategies, which has great potential for scaling up for handling potentially 100k objects.
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
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.
NASA Astrophysics Data System (ADS)
Zhao, Tong; Wachman, Elliot S.; Geyer, Stanley J.; Farkas, Daniel L.
2004-07-01
Efficient computer-aided cervical cancer detection can improve both the accuracy and the productivity of cytotechnologists and pathologists. Nuclear segmentation is essential to automated screening, and is still a challenge. We propose and demonstrate a novel approach to improving segmentation performance by multispectral imaging followed by unsupervised nuclear segmentation relying on selecting a useful subset of spectral or derived image features. In the absence of prior knowledge, feature selection can be negatively affected by the bias, present in most unsupervised segmentation, to erroneously segment out small objects, yielding ill-balanced class samples. To address this issue, we first introduce a new measurement, Criterion Vector (CV), measuring the distances between the segmentation result and the original data. This efficiently reduces the bias generated by feature selection. Second, we apply a novel recursive feature selection scheme, to generate a new feature subset based on the corresponding CV, ensuring that the correct part of the initial segmentation results is used to obtain better feature subsets. We studied the speed and accuracy of our two-step algorithm in analyzing a number of multispectral Pap smear image sets. The results show high accuracy of segmentation, as well as great reduction of spectral redundancy. The nuclear segmentation accuracy can reach over 90%, by selecting as few as 4 distinct spectra out of 30.
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 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.
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
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.
Natural product-like virtual libraries: recursive atom-based enumeration.
Yu, Melvin J
2011-03-28
A new molecular enumerator is described that allows chemically and architecturally diverse sets of natural product-like and drug-like structures to be generated from a core structure as simple as a single carbon atom or as complex as a polycyclic ring system. Integrated with a rudimentary machine-learning algorithm, the enumerator has the ability to assemble biased virtual libraries enriched in compounds predicted to meet target criteria. The ability to dynamically generate relatively small focused libraries in a recursive manner could reduce the computational time and infrastructure necessary to construct and manage extremely large static libraries. Depending on enumeration conditions, natural product-like structures can be produced with a wide range of heterocyclic and alicyclic ring assemblies. Because natural products represent a proven source of validated structures for identifying and designing new drug candidates, mimicking the structural and topological diversity found in nature with a dynamic set of virtual natural product-like compounds may facilitate the creation of new ideas for novel, biologically relevant lead structures in areas of uncharted chemical space. PMID:21388152
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
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 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.
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.
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.
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.
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…
Chemical Evolution of Binary Stars
NASA Astrophysics Data System (ADS)
Izzard, R. G.
2013-02-01
Energy generation by nuclear fusion is the fundamental process that prevents stars from collapsing under their own gravity. Fusion in the core of a star converts hydrogen to heavier elements from helium to uranium. The signature of this nucleosynthesis is often visible in a single star only for a very short time, for example while the star is a red giant or, in massive stars, when it explodes. Contrarily, in a binary system nuclear-processed matter can captured by a secondary star which remains chemically polluted long after its more massive companion star has evolved and died. By probing old, low-mass stars we gain vital insight into the complex nucleosynthesis that occurred when our Galaxy was much younger than it is today. Stellar evolution itself is also affected by the presence of a companion star. Thermonuclear novae and type Ia supernovae result from mass transfer in binary stars, but big questions still surround the nature of their progenitors. Stars may even merge and one of the challenges for the future of stellar astrophysics is to quantitatively understand what happens in such extreme systems. Binary stars offer unique insights into stellar, galactic and extragalactic astrophysics through their plethora of exciting phenomena. Understanding the chemical evolution of binary stars is thus of high priority in modern astrophysics.
NASA Astrophysics Data System (ADS)
Olevic, D.; Cvetkovic, Z.
2005-04-01
Preliminary orbital elements of binary systems WDS 03494-1956 = RST 2324, WDS 03513+2621 = A 1830, WDS 04093-2025 = RST 2333, WDS 06485-1226 = A 2935, WDS 07013-0906 = A 671, and WDS 18323-1439 = CHR 73 are presented. For all systems but WDS 18323-1439 the individual masses and dynamical parallaxes are derived.
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.
Taste responses to binary mixtures of amino acids in the sea catfish, Arius felis.
Kohbara, J; Caprio, J
1996-02-01
In vivo electrophysiological recordings in the sea catfish, Arius felis, showed that the magnitude of the integrated facial taste responses to binary mixtures of amino acids was predictable with knowledge obtained from previous cross-adaptation studies of the relative independence of the respective binding sites of the component stimuli. Each component from which equal aliquots were drawn to form the mixtures was adjusted in concentration to provide for approximately equal response magnitudes. The magnitude of the taste responses to binary mixtures whose component amino acids showed minimal cross-adaptation was significantly greater than that to binary mixtures whose components exhibited considerable cross-reactivity. There was no evidence for mixture suppression. The relative magnitude of the taste responses in the sea catfish to stimulus mixtures is similar to that previously reported for olfactory receptor responses in the freshwater channel catfish and chorda tympani taste responses in the hamster. PMID:8646491
NASA Astrophysics Data System (ADS)
Li, Dongxing; Zhao, Yan; Dong, Xu
2008-03-01
In general image restoration, the point spread function (PSF) of the imaging system, and the observation noise, are known a priori information. The aero-optics effect is yielded when the objects ( e.g, missile, aircraft etc.) are flying in high speed or ultrasonic speed. In this situation, the PSF and the observation noise are unknown a priori. The identification and the restoration of the turbulence degraded images is a challenging problem in the world. The algorithm based on the nonnegativity and support constraints recursive inverse filtering (NAS-RIF) is proposed in order to identify and restore the turbulence degraded images. The NAS-RIF technique applies to situations in which the scene consists of a finite support object against a uniformly black, grey, or white background. The restoration procedure of NAS-RIF involves recursive filtering of the blurred image to minimize a convex cost function. The algorithm proposed in this paper is that the turbulence degraded image is filtered before it passes the recursive filter. The conjugate gradient minimization routine was used for minimization of the NAS-RIF cost function. The algorithm based on the NAS-RIF is used to identify and restore the wind tunnel tested images. The experimental results show that the restoration effect is improved obviously.
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
A general catalogue of close binary systems
NASA Technical Reports Server (NTRS)
Webbink, Ronald F.
1994-01-01
A comprehensive catalog of close binary stars to be used for the study of the fundamental properties of stars and for the exploration and elucidation of evolutionary processes in those systems, is presented. Spectroscopic binaries, variable stars, suspected variable stars, and interacting binaries are included in the scope of the catalog.
A local adaptive image descriptor
NASA Astrophysics Data System (ADS)
Zahid Ishraque, S. M.; Shoyaib, Mohammad; Abdullah-Al-Wadud, M.; Monirul Hoque, Md; Chae, Oksam
2013-12-01
The local binary pattern (LBP) is a robust but computationally simple approach in texture analysis. However, LBP performs poorly in the presence of noise and large illumination variation. Thus, a local adaptive image descriptor termed as LAID is introduced in this proposal. It is a ternary pattern and is able to generate persistent codes to represent microtextures in a given image, especially in noisy conditions. It can also generate stable texture codes if the pixel intensities change abruptly due to the illumination changes. Experimental results also show the superiority of the proposed method over other state-of-the-art methods.
Gravity darkening in binary stars
NASA Astrophysics Data System (ADS)
Espinosa Lara, F.; Rieutord, M.
2012-11-01
Context. Interpretation of light curves of many types of binary stars requires the inclusion of the (cor)relation between surface brightness and local effective gravity. Until recently, this correlation has always been modeled by a power law relating the flux or the effective temperature and the effective gravity, namely Teff ∝ geffβ . Aims: We look for a simple model that can describe the variations of the flux at the surface of stars belonging to a binary system. Methods: This model assumes that the energy flux is a divergence-free vector anti-parallel to the effective gravity. The effective gravity is computed from the Roche model. Results: After explaining in a simple manner the old result of Lucy (1967, Z. Astrophys., 65, 89), which says that β ~ 0.08 for solar type stars, we first argue that one-dimensional models should no longer be used to evaluate gravity darkening laws. We compute the correlation between log Teff and log geff using a new approach that is valid for synchronous, weakly magnetized, weakly irradiated binaries. We show that this correlation is approximately linear, validating the use of a power law relation between effective temperature and effective gravity as a first approximation. We further show that the exponent β of this power law is a slowly varying function, which we tabulate, of the mass ratio of the binary star and the Roche lobe filling factor of the stars of the system. The exponent β remains mostly in the interval [0.20,0.25] if extreme mass ratios are eliminated. Conclusions: For binary stars that are synchronous, weakly magnetized and weakly irradiated, the gravity darkening exponent is well constrained and may be removed from the free parameters of the models.
JPEG 2000 coding of image data over adaptive refinement grids
NASA Astrophysics Data System (ADS)
Gamito, Manuel N.; Dias, Miguel S.
2003-06-01
An extension of the JPEG 2000 standard is presented for non-conventional images resulting from an adaptive subdivision process. Samples, generated through adaptive subdivision, can have different sizes, depending on the amount of subdivision that was locally introduced in each region of the image. The subdivision principle allows each individual sample to be recursively subdivided into sets of four progressively smaller samples. Image datasets generated through adaptive subdivision find application in Computational Physics where simulations of natural processes are often performed over adaptive grids. It is also found that compression gains can be achieved for non-natural imagery, like text or graphics, if they first undergo an adaptive subdivision process. The representation of adaptive subdivision images is performed by first coding the subdivision structure into the JPEG 2000 bitstream, ina lossless manner, followed by the entropy coded and quantized transform coefficients. Due to the irregular distribution of sample sizes across the image, the wavelet transform must be applied on irregular image subsets that are nested across all the resolution levels. Using the conventional JPEG 2000 coding standard, adaptive subdivision images would first have to be upsampled to the smallest sample size in order to attain a uniform resolution. The proposed method for coding adaptive subdivision images is shown to perform better than conventional JPEG 2000 for medium to high bitrates.
NASA Astrophysics Data System (ADS)
Huang, Ran
Two quasi 2-dimensional recursive lattices formed by planar elements have been designed to investigate the surface thermodynamics of monatomic Ising glass system with the aim to study the metastability of supercooled liquids and the ideal glass transition. Both lattices are constructed as hybrids of a Husimi lattice representing the bulk and lower dimensional recursive trees representing the surface. The coordination number, i.e. the number of neighbor sites surrounding one site, is designed to be 3 on the surface and 4 inside the bulk to mimic the 2D regular square lattice case. The recursive properties of recursive lattices were adopted to obtain exact thermodynamic calculations without approximation. The model has a strong anti-ferromagnetic interaction to give rise to an ordered phase identified as a crystal, and a metastable solution is also found to represent the amorphous phase. Interactions between particles farther away than the nearest neighbor distance are taken into consideration. The calculations were done with C/C++ programs. A recursive calculation technique was employed to approach an exact description of the system with the ratio of partial partition functions (PPF) on each site of the lattice. Thermal properties including free energy, energy density and entropy of the ideal crystal and supercooled liquid state of the model on the surface are calculated by the PPF. By analyzing the free energies and entropies of the crystal and supercooled liquid state, we are able to identify the melting transition and the second order ideal glass transition on the surface. The effects of different energy terms that produce competitions between crystallization and glass transition are studied. The results show that due to the coordination number change, the transition temperature on the surface decreases significantly compared to the transition temperature of the bulk system obtained in our previous research. Our theoretical calculation agrees with experiments and
X-ray binaries in globular clusters
NASA Technical Reports Server (NTRS)
Grindlay, Jonathan E.
1988-01-01
X-ray and optical studies of compact binaries and globular clusters are reviewed. Topics covered include, the formation of compact binaries by three-body interactions and by tidal capture, studies of the 11 minute binary in NGC 6624 and the 8.5 hour binary in M 15 (AC211), and an evolutionary model for compact binary formation. Optical searches for X-ray binaries in globular clusters are examined including CCD surveys and studies of NGC 6712. In addition, globular clusters with central cusps in their surface brightness profiles, questions concerning the blue color of binaries, diffuse line emission from CVs, and the possibility that X-ray burst sources in the galactic bulge were formed by tidal capture in globular clusters which have since been disrupted are discussed.
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.
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
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 {{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.
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.
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
Elizondo, David A; Birkenhead, Ralph; Góngora, Mario; Taillard, Eric; Luyima, Patrick
2007-12-01
The Recursive Deterministic Perceptron (RDP) feed-forward multilayer neural network is a generalisation of the single layer perceptron topology. This model is capable of solving any two-class classification problem as opposed to the single layer perceptron which can only solve classification problems dealing with linearly separable sets. For all classification problems, the construction of an RDP is done automatically and convergence is always guaranteed. Three methods for constructing RDP neural networks exist: Batch, Incremental, and Modular. The Batch method has been extensively tested and it has been shown to produce results comparable with those obtained with other neural network methods such as Back Propagation, Cascade Correlation, Rulex, and Ruleneg. However, no testing has been done before on the Incremental and Modular methods. Contrary to the Batch method, the complexity of these two methods is not NP-Complete. For the first time, a study on the three methods is presented. This study will allow the highlighting of the main advantages and disadvantages of each of these methods by comparing the results obtained while building RDP neural networks with the three methods in terms of the convergence time, the level of generalisation, and the topology size. The networks were trained and tested using the following standard benchmark classification datasets: IRIS, SOYBEAN, and Wisconsin Breast Cancer. The results obtained show the effectiveness of the Incremental and the Modular methods which are as good as that of the NP-Complete Batch method but with a much lower complexity level. The results obtained with the RDP are comparable to those obtained with the backpropagation and the Cascade Correlation algorithms. PMID:17904333
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.
Binary nucleation at low temperatures
NASA Technical Reports Server (NTRS)
Zahoransky, R. A.; Peters, F.
1985-01-01
The onset of homogeneous condensation of binary vapors in the supersaturated state is studied in ethanol/n-propanol and water/ethanol via their unsteady expansion in a shock tube at temperatures below 273 K. Ethanol/n-propanol forms a nearly ideal solution, whereas water/ethanol is an example of a strongly nonideal mixture. Vapor mixtures of various compositions are diluted in dry air at small mole fractions and expanded in the driver section from room temperature. The onset of homogeneous condensation is detected optically and the corresponding thermodynamic state is evaluated. The experimental results are compared with the binary nucleation theory, and the particular problems of theoretical evaluation at low temperatures are discussed.
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.
NASA Astrophysics Data System (ADS)
Couteau, P.
1987-12-01
Recent interferometric and visual observations have been used to compile orbital elements for the binaries COU 79, Phi 342, ADS 5726, COU 292, ADS 15487, and COU 542. The problematic binaries COU 79 and Phi 342 are discussed in detail. The results for COU 79 indicate a dynamic parallax of 0.0182 arcsec and absolute visual magnitudes of 2.5 and 2.8, values which are not consistent with the previously-determined spectral type of F6V. A parallax of 0.01420 arcsec is found for Phi 342, and the visual magnitudes of 2.74 and 3.13 are indicative of superluminous stars outside of the main sequence.
Robust adaptive transient damping in power systems
Pierre, D.A.; Sadighi, I.; Trudnowski, D.J.; Smith, J.R.; Nehrir, M.H. . Dept. of Electrical Engineering)
1992-09-01
This Volume 1 of the final report on RP2665-1 contains two parts. part 1 consists of the following: (1) a literature review of real-time parameter identification algorithms which may be used in self-tuning adaptive control; (2) a description of mathematical discrete-time models that are linear in the parameters and that are useful for self-tuning adaptive control; (3) detailed descriptions of several variations of recursive-least-squares algorithms (RLS algorithms) and a unified representation of some of these algorithms; (4) a new variation of RLS called Corrector Least Squares (CLS); (5) a set of practical issues that need to be addressed in the implementation of RLS-based algorithms; (6) a set of simulation examples that illustrate properties of the identification methods; and (7) appendices With FORTRAN listings of several identification codes. Part 2 of this volume addresses the problem of damping electromechanical oscillations in power systems using advanced control theory. Two control strategies are developed. Controllers are then applied to a power system as power system stabilizer (PSS) units. The primary strategy is a decentralized indirect adaptive control scheme where multiple self-tuning adaptive controllers are coordinated. This adaptive scheme is presented in a general format and the stabilizing properties are demonstrated using examples. Both the adaptive and the conventional strategies are applied to a 17-machine computer-simulated power system. PSS units are applied to four generators in the system. Detailed simulation results are presented that show the feasibility and properties of both control schemes. FORTRAN codes for the control simulations are given in appendices of Part 2, as also are FORTRAN codes for the Prony identification method.
Circularization time of binary galaxies
NASA Astrophysics Data System (ADS)
Junqueira, S.; de Freitas Pacheco, J. A.
1994-11-01
We report the results of numerical experiments performed to study the orbital circularization time of binary galaxies. We find that the time scale is quite long (larger than the Hubble time), confirming earlier calculations. The results depend on the initial conditions. From our simulations we obtained a fitting formula for the circularization time as a function of the initial orbital parameters like the pericentric distance, mass ratio, and eccentricity.
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).
Fidan, Barış; Umay, Ilknur
2015-01-01
Accurate signal-source and signal-reflector target localization tasks via mobile sensory units and wireless sensor networks (WSNs), including those for environmental monitoring via sensory UAVs, require precise knowledge of specific signal propagation properties of the environment, which are permittivity and path loss coefficients for the electromagnetic signal case. Thus, accurate estimation of these coefficients has significant importance for the accuracy of location estimates. In this paper, we propose a geometric cooperative technique to instantaneously estimate such coefficients, with details provided for received signal strength (RSS) and time-of-flight (TOF)-based range sensors. The proposed technique is integrated to a recursive least squares (RLS)-based adaptive localization scheme and an adaptive motion control law, to construct adaptive target localization and adaptive target tracking algorithms, respectively, that are robust to uncertainties in aforementioned environmental signal propagation coefficients. The efficiency of the proposed adaptive localization and tracking techniques are both mathematically analysed and verified via simulation experiments. PMID:26690441
Fidan, Barış; Umay, Ilknur
2015-01-01
Accurate signal-source and signal-reflector target localization tasks via mobile sensory units and wireless sensor networks (WSNs), including those for environmental monitoring via sensory UAVs, require precise knowledge of specific signal propagation properties of the environment, which are permittivity and path loss coefficients for the electromagnetic signal case. Thus, accurate estimation of these coefficients has significant importance for the accuracy of location estimates. In this paper, we propose a geometric cooperative technique to instantaneously estimate such coefficients, with details provided for received signal strength (RSS) and time-of-flight (TOF)-based range sensors. The proposed technique is integrated to a recursive least squares (RLS)-based adaptive localization scheme and an adaptive motion control law, to construct adaptive target localization and adaptive target tracking algorithms, respectively, that are robust to uncertainties in aforementioned environmental signal propagation coefficients. The efficiency of the proposed adaptive localization and tracking techniques are both mathematically analysed and verified via simulation experiments. PMID:26690441
Angular momentum of binary asteroids: Implications for their possible origin
NASA Astrophysics Data System (ADS)
Descamps, P.; Marchis, F.
2008-01-01
We describe in this work a thorough study of the physical and orbital characteristics of extensively observed main-belt and trojan binaries, mainly taken from the LAOSA (Large Adaptive Optics Survey of Asteroids [Marchis, F., Baek, M., Berthier, J., Descamps, P., Hestroffer, D., Kaasalainen, M., Vachier, F., 2006c. In: Workshop on Spacecraft Reconnaissance of Asteroid and Comet Interiors. Abstract #3042]) database, along with a selection of bifurcated objects. Dimensionless quantities, such as the specific angular momentum and the scaled primary spin rate, are computed and discussed for each system. They suggest that these asteroidal systems might be the outcome of rotational fission or mass shedding of a parent body presumably subjected to an external torque. One of the most striking features of separated binaries composed of a large primary ( R>100 km) with a much smaller secondary ( R<20 km) is that they all have total angular momentum of ˜0.27. This value is quite close to the Maclaurin-Jacobi bifurcation (0.308) of a spinning fluid body. Alternatively, contact binaries and tidally locked double asteroids, made of components of similar size, have an angular momentum larger than 0.48. They compare successfully with the fission equilibrium sequence of a rotating fluid mass. In conclusion, we find that total angular momentum is a useful proxy to assess the internal structure of such systems.
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.
NASA Technical Reports Server (NTRS)
2005-01-01
The goal of this research is to develop and demonstrate innovative adaptive seal technologies that can lead to dramatic improvements in engine performance, life, range, and emissions, and enhance operability for next generation gas turbine engines. This work is concentrated on the development of self-adaptive clearance control systems for gas turbine engines. Researchers have targeted the high-pressure turbine (HPT) blade tip seal location for following reasons: Current active clearance control (ACC) systems (e.g., thermal case-cooling schemes) cannot respond to blade tip clearance changes due to mechanical, thermal, and aerodynamic loads. As such they are prone to wear due to the required tight running clearances during operation. Blade tip seal wear (increased clearances) reduces engine efficiency, performance, and service life. Adaptive sealing technology research has inherent impact on all envisioned 21st century propulsion systems (e.g. distributed vectored, hybrid and electric drive propulsion concepts).
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.