Science.gov

Sample records for binary search tree

  1. Concurrent Manipulation of Binary Search Trees. Revision.

    DTIC Science & Technology

    1979-09-01

    trees (or often B*-trees; see Wedekind [23]) as the main data structure (e.g., Astrachan, et.aL[1]). These structures have the advantage that they are...Conference Proceedings 46 (1977), 637-644. 23. Wedekind . On the Selection of Access Paths in a Data Base System. In Data Base Management, North-Holland

  2. Pipeline synthetic aperture radar data compression utilizing systolic binary tree-searched architecture for vector quantization

    NASA Technical Reports Server (NTRS)

    Chang, Chi-Yung (Inventor); Fang, Wai-Chi (Inventor); Curlander, John C. (Inventor)

    1995-01-01

    A system for data compression utilizing systolic array architecture for Vector Quantization (VQ) is disclosed for both full-searched and tree-searched. For a tree-searched VQ, the special case of a Binary Tree-Search VQ (BTSVQ) is disclosed with identical Processing Elements (PE) in the array for both a Raw-Codebook VQ (RCVQ) and a Difference-Codebook VQ (DCVQ) algorithm. A fault tolerant system is disclosed which allows a PE that has developed a fault to be bypassed in the array and replaced by a spare at the end of the array, with codebook memory assignment shifted one PE past the faulty PE of the array.

  3. A Fast Framework for Abrupt Change Detection Based on Binary Search Trees and Kolmogorov Statistic.

    PubMed

    Qi, Jin-Peng; Qi, Jie; Zhang, Qing

    2016-01-01

    Change-Point (CP) detection has attracted considerable attention in the fields of data mining and statistics; it is very meaningful to discuss how to quickly and efficiently detect abrupt change from large-scale bioelectric signals. Currently, most of the existing methods, like Kolmogorov-Smirnov (KS) statistic and so forth, are time-consuming, especially for large-scale datasets. In this paper, we propose a fast framework for abrupt change detection based on binary search trees (BSTs) and a modified KS statistic, named BSTKS (binary search trees and Kolmogorov statistic). In this method, first, two binary search trees, termed as BSTcA and BSTcD, are constructed by multilevel Haar Wavelet Transform (HWT); second, three search criteria are introduced in terms of the statistic and variance fluctuations in the diagnosed time series; last, an optimal search path is detected from the root to leaf nodes of two BSTs. The studies on both the synthetic time series samples and the real electroencephalograph (EEG) recordings indicate that the proposed BSTKS can detect abrupt change more quickly and efficiently than KS, t-statistic (t), and Singular-Spectrum Analyses (SSA) methods, with the shortest computation time, the highest hit rate, the smallest error, and the highest accuracy out of four methods. This study suggests that the proposed BSTKS is very helpful for useful information inspection on all kinds of bioelectric time series signals.

  4. A Fast Framework for Abrupt Change Detection Based on Binary Search Trees and Kolmogorov Statistic

    PubMed Central

    Qi, Jin-Peng; Qi, Jie; Zhang, Qing

    2016-01-01

    Change-Point (CP) detection has attracted considerable attention in the fields of data mining and statistics; it is very meaningful to discuss how to quickly and efficiently detect abrupt change from large-scale bioelectric signals. Currently, most of the existing methods, like Kolmogorov-Smirnov (KS) statistic and so forth, are time-consuming, especially for large-scale datasets. In this paper, we propose a fast framework for abrupt change detection based on binary search trees (BSTs) and a modified KS statistic, named BSTKS (binary search trees and Kolmogorov statistic). In this method, first, two binary search trees, termed as BSTcA and BSTcD, are constructed by multilevel Haar Wavelet Transform (HWT); second, three search criteria are introduced in terms of the statistic and variance fluctuations in the diagnosed time series; last, an optimal search path is detected from the root to leaf nodes of two BSTs. The studies on both the synthetic time series samples and the real electroencephalograph (EEG) recordings indicate that the proposed BSTKS can detect abrupt change more quickly and efficiently than KS, t-statistic (t), and Singular-Spectrum Analyses (SSA) methods, with the shortest computation time, the highest hit rate, the smallest error, and the highest accuracy out of four methods. This study suggests that the proposed BSTKS is very helpful for useful information inspection on all kinds of bioelectric time series signals. PMID:27413364

  5. On Using Adaptive Binary Search Trees to Enhance Self Organizing Maps

    NASA Astrophysics Data System (ADS)

    Astudillo, César A.; Oommen, B. John

    We present a strategy by which a Self-Organizing Map (SOM) with an underlying Binary Search Tree (BST) structure can be adaptively re-structured using conditional rotations. These rotations on the nodes of the tree are local and are performed in constant time, guaranteeing a decrease in the Weighted Path Length (WPL) of the entire tree. As a result, the algorithm, referred to as the Tree-based Topology-Oriented SOM with Conditional Rotations (TTO-CONROT), converges in such a manner that the neurons are ultimately placed in the input space so as to represent its stochastic distribution, and additionally, the neighborhood properties of the neurons suit the best BST that represents the data.

  6. Silicon photonic chips for search on improved-glued-binary-tree based on continuous-time quantum walk

    NASA Astrophysics Data System (ADS)

    Qi, Fan; Ma, Qingyan; Wang, Yufei; Zheng, Wanhua

    2016-11-01

    Search on improved-glued-binary-trees is a representative example of quantum superiority, where exponential acceleration can be achieved using quantum walk with respect to any classical algorithms. Here we analyzed the evolution process of this quantum-walk-based algorithm. Several remarkable features of the process are revealed. Generation of the model by introducing tunable defect strength and double defects is also discussed and the effects of these generalization on evolution process, arrival probability and residual probability are discussed in details. Physical implementation with silicon ridge waveguide array is presented. The design of the array with FEM method are presented and light propagation simulation with FDTD method shows that this kind of structure is feasible for the task. Lastly, preliminary experimental demonstration with classical coherent light simulation are presented. Our results show that silicon photonic chips are suitable for such search problems and opening a route towards large-scale photonic quantum computation.

  7. Efficient Merge and Insert Operations for Binary Heaps and Trees

    NASA Technical Reports Server (NTRS)

    Kuszmaul, Christopher Lee; Woo, Alex C. (Technical Monitor)

    2000-01-01

    Binary heaps and binary search trees merge efficiently. We introduce a new amortized analysis that allows us to prove the cost of merging either binary heaps or balanced binary trees is O(l), in the amortized sense. The standard set of other operations (create, insert, delete, extract minimum, in the case of binary heaps, and balanced binary trees, as well as a search operation for balanced binary trees) remain with a cost of O(log n). For binary heaps implemented as arrays, we show a new merge algorithm that has a single operation cost for merging two heaps, a and b, of O(absolute value of a + min(log absolute value of b log log absolute value of b. log absolute value of a log absolute value of b). This is an improvement over O(absolute value of a + log absolute value of a log absolute value of b). The cost of the new merge is so low that it can be used in a new structure which we call shadow heaps. to implement the insert operation to a tunable efficiency. Shadow heaps support the insert operation for simple priority queues in an amortized time of O(f(n)) and other operations in time O((log n log log n)/f (n)), where 1 less than or equal to f (n) less than or equal to log log n. More generally, the results here show that any data structure with operations that change its size by at most one, with the exception of a merge (aka meld) operation, can efficiently amortize the cost of the merge under conditions that are true for most implementations of binary heaps and search trees.

  8. An efficient and comprehensive method for drainage network extraction from DEM with billions of pixels using a size-balanced binary search tree

    NASA Astrophysics Data System (ADS)

    Bai, Rui; Li, Tiejian; Huang, Yuefei; Li, Jiaye; Wang, Guangqian

    2015-06-01

    With the increasing resolution of digital elevation models (DEMs), computational efficiency problems have been encountered when extracting the drainage network of a large river basin at billion-pixel scales. The efficiency of the most time-consuming depression-filling pretreatment has been improved by using the O(NlogN) complexity least-cost path search method, but the complete extraction steps following this method have not been proposed and tested. In this paper, an improved O(NlogN) algorithm was proposed by introducing a size-balanced binary search tree (BST) to improve the efficiency of the depression-filling pretreatment further. The following extraction steps, including the flow direction determination and the upslope area accumulation, were also redesigned to benefit from this improvement. Therefore, an efficient and comprehensive method was developed. The method was tested to extract drainage networks of 31 river basins with areas greater than 500,000 km2 from the 30-m-resolution ASTER GDEM and two sub-basins with areas of approximately 1000 km2 from the 1-m-resolution airborne LiDAR DEM. Complete drainage networks with both vector features and topographic parameters were obtained with time consumptions in O(NlogN) complexity. The results indicate that the developed method can be used to extract entire drainage networks from DEMs with billions of pixels with high efficiency.

  9. Binary Encoded-Prototype Tree for Probabilistic Model Building GP

    NASA Astrophysics Data System (ADS)

    Yanase, Toshihiko; Hasegawa, Yoshihiko; Iba, Hitoshi

    In recent years, program evolution algorithms based on the estimation of distribution algorithm (EDA) have been proposed to improve search ability of genetic programming (GP) and to overcome GP-hard problems. One such method is the probabilistic prototype tree (PPT) based algorithm. The PPT based method explores the optimal tree structure by using the full tree whose number of child nodes is maximum among possible trees. This algorithm, however, suffers from problems arising from function nodes having different number of child nodes. These function nodes cause intron nodes, which do not affect the fitness function. Moreover, the function nodes having many child nodes increase the search space and the number of samples necessary for properly constructing the probabilistic model. In order to solve this problem, we propose binary encoding for PPT. In this article, we convert each function node to a subtree of binary nodes where the converted tree is correct in grammar. Our method reduces ineffectual search space, and the binary encoded tree is able to express the same tree structures as the original method. The effectiveness of the proposed method is demonstrated through the use of two computational experiments.

  10. A parallelized binary search tree

    Technology Transfer Automated Retrieval System (TEKTRAN)

    PTTRNFNDR is an unsupervised statistical learning algorithm that detects patterns in DNA sequences, protein sequences, or any natural language texts that can be decomposed into letters of a finite alphabet. PTTRNFNDR performs complex mathematical computations and its processing time increases when i...

  11. Binary space partitioning trees and their uses

    NASA Technical Reports Server (NTRS)

    Bell, Bradley N.

    1989-01-01

    Binary Space Partitioning (BSP) trees have some qualities that make them useful in solving many graphics related problems. The purpose is to describe what a BSP tree is, and how it can be used to solve the problem of hidden surface removal, and constructive solid geometry. The BSP tree is based on the idea that a plane acting as a divider subdivides space into two parts with one being on the positive side and the other on the negative. A polygonal solid is then represented as the volume defined by the collective interior half spaces of the solid's bounding surfaces. The nature of how the tree is organized lends itself well for sorting polygons relative to an arbitrary point in 3 space. The speed at which the tree can be traversed for depth sorting is fast enough to provide hidden surface removal at interactive speeds. The fact that a BSP tree actually represents a polygonal solid as a bounded volume also makes it quite useful in performing the boolean operations used in constructive solid geometry. Due to the nature of the BSP tree, polygons can be classified as they are subdivided. The ability to classify polygons as they are subdivided can enhance the simplicity of implementing constructive solid geometry.

  12. Efficient algorithms for dilated mappings of binary trees

    NASA Technical Reports Server (NTRS)

    Iqbal, M. Ashraf

    1990-01-01

    The problem is addressed to find a 1-1 mapping of the vertices of a binary tree onto those of a target binary tree such that the son of a node on the first binary tree is mapped onto a descendent of the image of that node in the second binary tree. There are two natural measures of the cost of this mapping, namely the dilation cost, i.e., the maximum distance in the target binary tree between the images of vertices that are adjacent in the original tree. The other measure, expansion cost, is defined as the number of extra nodes/edges to be added to the target binary tree in order to ensure a 1-1 mapping. An efficient algorithm to find a mapping of one binary tree onto another is described. It is shown that it is possible to minimize one cost of mapping at the expense of the other. This problem arises when designing pipelined arithmetic logic units (ALU) for special purpose computers. The pipeline is composed of ALU chips connected in the form of a binary tree. The operands to the pipeline can be supplied to the leaf nodes of the binary tree which then process and pass the results up to their parents. The final result is available at the root. As each new application may require a distinct nesting of operations, it is useful to be able to find a good mapping of a new binary tree over existing ALU tree. Another problem arises if every distinct required binary tree is known beforehand. Here it is useful to hardwire the pipeline in the form of a minimal supertree that contains all required binary trees.

  13. On implementing large binary tree architectures in VLSI and WSI

    SciTech Connect

    Youn, H.Y.; Singh, A.D.

    1989-04-01

    The complete binary tree is known to support the parallel execution of important algorithms, which has given rise to much interest in implementing such architectures in VLSI and WSI. For large trees, the classical H-tree layout approaches suffers from area inefficiency and long interconnects. Other proposed schemes are not well suited for the implementation of defect-tolerant designs. This paper presents an efficient scheme for the layout of large binary tree architectures by embedding the complete binary tree in a two-dimensional array of processing elements.

  14. On implementing large binary tree architectures in VLSI and WSI

    NASA Astrophysics Data System (ADS)

    Youn, Hee Yong; Singh, Adit D.

    1989-04-01

    An efficient scheme for the layout of large binary-tree architectures is presented. The method involves embedding the complete binary tree in a two-dimensional array of processing elements and utilizes virtually 100 percent of the processing elements in the array as computing elements; it also shows substantial improvements in propagation delay and maximum edge length over H-tree layouts. It is shown that the layouts obtained readily lend themselves to fault-tolerant designs for overcoming fabrication defects in large-area and wafer-scale implementations of binary-tree architectures.

  15. Supermassive Black Hole Binaries: The Search Continues

    NASA Astrophysics Data System (ADS)

    Bogdanović, Tamara

    Gravitationally bound supermassive black hole binaries (SBHBs) are thought to be a natural product of galactic mergers and growth of the large scale structure in the universe. They however remain observationally elusive, thus raising a question about characteristic observational signatures associated with these systems. In this conference proceeding I discuss current theoretical understanding and latest advances and prospects in observational searches for SBHBs.

  16. Forward estimation for game-tree search

    SciTech Connect

    Zhang, Weixiong

    1996-12-31

    It is known that bounds on the minimax values of nodes in a game tree can be used to reduce the computational complexity of minimax search for two-player games. We describe a very simple method to estimate bounds on the minimax values of interior nodes of a game tree, and use the bounds to improve minimax search. The new algorithm, called forward estimation, does not require additional domain knowledge other than a static node evaluation function, and has small constant overhead per node expansion. We also propose a variation of forward estimation, which provides a tradeoff between computational complexity and decision quality. Our experimental results show that forward estimation outperforms alpha-beta pruning on random game trees and the game of Othello.

  17. Searching game trees under memory constraints

    SciTech Connect

    Bhattacharya, S.; Bagchi, A.

    1996-12-31

    The best-first game-tree search algorithm SSS* has greater pruning power than the depth-first algorithm Alpha-Beta. Yet it is seldom used in practice because it is slow in execution and requires substantial memory. Variants of SSS* have been proposed in recent years that overcome some, but not all, of its limitations. The recursive controlled-memory best-first search scheme MemSSS* described here is a new derivative of SSS* that compares favourably with Alpha-Beta in respect of all three major performance measures, namely, pruning power, running time and memory needs. MemSSS* improves upon an earlier controlled-memory algorithm IterSSS* which has most of the desired properties but is slow in execution.

  18. Inverted Signature Trees and Text Searching on CD-ROMs.

    ERIC Educational Resources Information Center

    Cooper, Lorraine K. D.; Tharp, Alan L.

    1989-01-01

    Explores the new storage technology of optical data disks and introduces a data structure, the inverted signature tree, for storing data on optical data disks for efficient text searching. The inverted signature tree approach is compared to the use of text signatures and the B+ tree. (22 references) (Author/CLB)

  19. Searching for Binary Supermassive Black Holes via Variable Broad Emission Line Shifts: Low Binary Fraction

    NASA Astrophysics Data System (ADS)

    Wang, Lile; Greene, Jenny E.; Ju, Wenhua; Rafikov, Roman R.; Ruan, John J.; Schneider, Donald P.

    2017-01-01

    Supermassive black hole binaries (SMBHs) are expected to result from galaxy mergers, and thus are natural byproducts (and probes) of hierarchical structure formation in the universe. They are also the primary expected source of low-frequency gravitational wave emission. We search for binary BHs using time-variable velocity shifts in broad Mg ii emission lines of quasars with multi-epoch observations. First, we inspect velocity shifts of the binary SMBH candidates identified in Ju et al., using Sloan Digital Sky Survey spectra with an additional epoch of data that lengthens the typical baseline to ∼10 yr. We find variations in the line of sight velocity shifts over 10 yr that are comparable to the shifts observed over 1–2 yr, ruling out the binary model for the bulk of our candidates. We then analyze 1438 objects with eight-year median time baselines, from which we would expect to see velocity shifts >1000 {km} {{{s}}}-1 from sub-parsec binaries. We find only one object with an outlying velocity of 448 {km} {{{s}}}-1, indicating—based on our modeling—that ≲1% (the value varies with different assumptions) of SMBHs that are active as quasars reside in binaries with ∼0.1 pc separations. Binaries either sweep rapidly through these small separations or stall at larger radii.

  20. Binary Star Systems and Extrasolar Planets: The PHASES Search for Planets in Binaries

    NASA Astrophysics Data System (ADS)

    Muterspaugh, M. W.; PTI: Palomar Testbed Interferometer Collaboration; PHASES Team

    2005-12-01

    A new observing method has been developed to perform very high precision differential astrometry on bright binary stars with separations in the range of 0.1-1.0 arcseconds. Typical measurement precisions over an hour of integration are on the order of 10 micro-arcseconds, enabling one to look for perturbations to the Keplerian orbit that would indicate the presence of additional components to the system. This is used as the basis for a new program to find extrasolar planets. The Palomar High-precision Astrometric Search for Exoplanet Systems (PHASES) is a search for giant planets orbiting either star in 50 binary systems. The goal of this search is to detect or rule out planets in the systems observed and thus place limits on any enhancements of planet formation in binaries. It is also used to measure fundamental properties of the stars comprising the binary, such as masses and distances, useful for constraining stellar models at the 10-3 level. This work is funded in part by a Michelson Graduate Fellowship, the California Institute of Technology Astronomy Department, and the National Aeronautics and Space Administration under Grant No. NNG05GJ58G issued through the Terrestrial Planet Finder Foundation Science Program.

  1. New binary polymorphisms reshape and increase resolution of the human Y chromosomal haplogroup tree

    PubMed Central

    Karafet, Tatiana M.; Mendez, Fernando L.; Meilerman, Monica B.; Underhill, Peter A.; Zegura, Stephen L.; Hammer, Michael F.

    2008-01-01

    Markers on the non-recombining portion of the human Y chromosome continue to have applications in many fields including evolutionary biology, forensics, medical genetics, and genealogical reconstruction. In 2002, the Y Chromosome Consortium published a single parsimony tree showing the relationships among 153 haplogroups based on 243 binary markers and devised a standardized nomenclature system to name lineages nested within this tree. Here we present an extensively revised Y chromosome tree containing 311 distinct haplogroups, including two new major haplogroups (S and T), and incorporating approximately 600 binary markers. We describe major changes in the topology of the parsimony tree and provide names for new and rearranged lineages within the tree following the rules presented by the Y Chromosome Consortium in 2002. Several changes in the tree topology have important implications for studies of human ancestry. We also present demography-independent age estimates for 11 of the major clades in the new Y chromosome tree. PMID:18385274

  2. New binary polymorphisms reshape and increase resolution of the human Y chromosomal haplogroup tree.

    PubMed

    Karafet, Tatiana M; Mendez, Fernando L; Meilerman, Monica B; Underhill, Peter A; Zegura, Stephen L; Hammer, Michael F

    2008-05-01

    Markers on the non-recombining portion of the human Y chromosome continue to have applications in many fields including evolutionary biology, forensics, medical genetics, and genealogical reconstruction. In 2002, the Y Chromosome Consortium published a single parsimony tree showing the relationships among 153 haplogroups based on 243 binary markers and devised a standardized nomenclature system to name lineages nested within this tree. Here we present an extensively revised Y chromosome tree containing 311 distinct haplogroups, including two new major haplogroups (S and T), and incorporating approximately 600 binary markers. We describe major changes in the topology of the parsimony tree and provide names for new and rearranged lineages within the tree following the rules presented by the Y Chromosome Consortium in 2002. Several changes in the tree topology have important implications for studies of human ancestry. We also present demography-independent age estimates for 11 of the major clades in the new Y chromosome tree.

  3. Binary tree of posterior probability support vector machines for hyperspectral image classification

    NASA Astrophysics Data System (ADS)

    Wang, Dongli; Zhou, Yan; Zheng, Jianguo

    2011-01-01

    The problem of hyperspectral remote sensing images classification is revisited by posterior probability support vector machines (PPSVMs). To address the multiclass classification problem, PPSVMs are extended using binary tree structure and boosting with the Fisher ratio as class separability measure. The class pair with larger Fisher ratio separability measure is separated at upper nodes of the binary tree to optimize the structure of the tree and improve the classification accuracy. Two approaches are proposed to select the class pair and construct the binary tree. One is the so-called some-against-rest binary tree of PPSVMs (SBT), in which some classes are separated from the remaining classes at each node considering the Fisher ratio separability measure. For the other approach, named one-against-rest binary tree of PPSVMs (OBT), only one class is separated from the remaining classes at each node. Both approaches need only to train n - 1 (n is the number of classes) binary PPSVM classifiers, while the average convergence performance of SBT and OBT are O(log2n) and O[(n! - 1)/n], respectively. Experimental results show that both approaches obtain classification accuracy if not higher, at least comparable to other multiclass approaches, while using significantly fewer support vectors and reduced testing time.

  4. Multivariate classification with random forests for gravitational wave searches of black hole binary coalescence

    NASA Astrophysics Data System (ADS)

    Baker, Paul T.; Caudill, Sarah; Hodge, Kari A.; Talukder, Dipongkar; Capano, Collin; Cornish, Neil J.

    2015-03-01

    Searches for gravitational waves produced by coalescing black hole binaries with total masses ≳25 M⊙ use matched filtering with templates of short duration. Non-Gaussian noise bursts in gravitational wave detector data can mimic short signals and limit the sensitivity of these searches. Previous searches have relied on empirically designed statistics incorporating signal-to-noise ratio and signal-based vetoes to separate gravitational wave candidates from noise candidates. We report on sensitivity improvements achieved using a multivariate candidate ranking statistic derived from a supervised machine learning algorithm. We apply the random forest of bagged decision trees technique to two separate searches in the high mass (≳25 M⊙ ) parameter space. For a search which is sensitive to gravitational waves from the inspiral, merger, and ringdown of binary black holes with total mass between 25 M⊙ and 100 M⊙ , we find sensitive volume improvements as high as 70±13%-109±11% when compared to the previously used ranking statistic. For a ringdown-only search which is sensitive to gravitational waves from the resultant perturbed intermediate mass black hole with mass roughly between 10 M⊙ and 600 M⊙ , we find sensitive volume improvements as high as 61±4%-241±12% when compared to the previously used ranking statistic. We also report how sensitivity improvements can differ depending on mass regime, mass ratio, and available data quality information. Finally, we describe the techniques used to tune and train the random forest classifier that can be generalized to its use in other searches for gravitational waves.

  5. Compact binary coalescence searches with low latency: why and how

    NASA Astrophysics Data System (ADS)

    Fotopoulos, Nickolas; Cannon, Kipp; Frei, Melissa; Hanna, Chad; Keppel, Drew; Privitera, Stephen; Singer, Leo

    2011-04-01

    Low-latency gravitational-wave (GW) detection of a compact binary coalescence (CBC) will allow electromagnetic (EM) followups to observe earlier parts of the corresponding lightcurves, which are brighter, convey more information about the progenitor system, and allow a more confident association of GW and EM transients. Conventional matched filter banks, common in CBC searches, are computationally efficient, but incur a latency of many minutes. Searches with latencies of seconds and significantly increased throughput are achievable with techniques such as principal component analysis, to reduce the number of filtered templates, hierarchical detection with singular value decomposition by-products, and exploitation of the quasi-monochromatic structure of chirps to filter time-slices at different sample rates. We present an implementation of these ideas called LLOID, based on the LSC Algorithm Library and the GStreamer multimedia framework.

  6. Searching for Spectroscopic Binaries within Transition Disk Objects

    NASA Astrophysics Data System (ADS)

    Kohn, Saul A.; Shkolnik, Evgenya L.; Weinberger, Alycia J.; Carlberg, Joleen K.; Llama, Joe

    2016-03-01

    Transition disks (TDs) are intermediate stage circumstellar disks characterized by an inner gap within the disk structure. To test whether these gaps may have been formed by closely orbiting, previously undetected stellar companions, we collected high-resolution optical spectra of 31 TD objects to search for spectroscopic binaries (SBs). Twenty-four of these objects are in Ophiuchus and seven are within the Coronet, Corona Australis, and Chameleon I star-forming regions. We measured radial velocities for multiple epochs, obtaining a median precision of 400 ms-1. We identified double-lined SB SSTc2d J163154.7-250324 in Ophiuchus, which we determined to be composed of a K7(±0.5) and a K9(±0.5) star, with orbital limits of a < 0.6 au and P < 150 days. This results in an SB fraction of {0.04}-0.03+0.12 in Ophiuchus, which is consistent with other spectroscopic surveys of non-TD objects in the region. This similarity suggests that TDs are not preferentially sculpted by the presence of close binaries and that planet formation around close binaries may take place over similar timescales to that around single stars. This paper is based on data gathered with the 6.5 m Clay Telescope located at Las Campanas Observatory, Chile.

  7. Multiclass Cancer Classification by Using Fuzzy Support Vector Machine and Binary Decision Tree With Gene Selection

    PubMed Central

    2005-01-01

    We investigate the problems of multiclass cancer classification with gene selection from gene expression data. Two different constructed multiclass classifiers with gene selection are proposed, which are fuzzy support vector machine (FSVM) with gene selection and binary classification tree based on SVM with gene selection. Using F test and recursive feature elimination based on SVM as gene selection methods, binary classification tree based on SVM with F test, binary classification tree based on SVM with recursive feature elimination based on SVM, and FSVM with recursive feature elimination based on SVM are tested in our experiments. To accelerate computation, preselecting the strongest genes is also used. The proposed techniques are applied to analyze breast cancer data, small round blue-cell tumors, and acute leukemia data. Compared to existing multiclass cancer classifiers and binary classification tree based on SVM with F test or binary classification tree based on SVM with recursive feature elimination based on SVM mentioned in this paper, FSVM based on recursive feature elimination based on SVM can find most important genes that affect certain types of cancer with high recognition accuracy. PMID:16046822

  8. Bidirectional Search in a String with Wavelet Trees

    NASA Astrophysics Data System (ADS)

    Schnattinger, Thomas; Ohlebusch, Enno; Gog, Simon

    Searching for genes encoding microRNAs (miRNAs) is an important task in genome analysis. Because the secondary structure of miRNA (but not the sequence) is highly conserved, the genes encoding it can be determined by finding regions in a genomic DNA sequence that match the structure. It is known that algorithms using a bidirectional search on the DNA sequence for this task outperform algorithms based on unidirectional search. The data structures supporting a bidirectional search (affix trees and affix arrays), however, are rather complex and suffer from their large space consumption. Here, we present a new data structure called bidirectional wavelet index that supports bidirectional search with much less space. With this data structure, it is possible to search for RNA secondary structural patterns in large genomes, for example the human genome.

  9. Status of searches for compact binaries in aLIGO with PyCBC

    NASA Astrophysics Data System (ADS)

    Biwer, Christopher

    2016-03-01

    Advanced LIGO began its first observing in September 2015. Gravitational waves from binary neutron stars, binary black holes and neutron star-black hole binaries are an important science goal for Advanced LIGO. The PyCBC search uses match filtering to correlate LIGO data with a bank of templates to search for transient gravitational-wave from compact object binaries with a total mass between 2 and 100 solar masses with spin. In this talk, we describe results of the PyCBC search during the first aLIGO observing run. LIGO.

  10. Binary tree-based fault location algorithm for optical burst switching network

    NASA Astrophysics Data System (ADS)

    Wang, Ru-Yan; Liu, Dan; Peng, Huan-Jia; Lv, Ke-Wei

    2009-07-01

    This paper proposes an effective method of fault location based on a binary tree for optical burst switching (OBS) network. To minimize the monitoring cost, we divide the network into several monitor domains by introducing monitoring-cycle algorithms. In order to generate an exclusive code, we modify the monitoring cycle algorithm when two nodes have the same code. Through the binary tree algorithm, a pre-computation of faults in the OBS network can be achieved. When a fault happens, we can locate it immediately and accurately. Examples have proved that the algorithm has general applicability.

  11. PHASES: A Search for Planets in Binary Systems

    NASA Astrophysics Data System (ADS)

    Lane, Benjamin; Muterpspaugh, M.; Konacki, M.; Kulkarni, S.; Shao, M.; Colavita, M.; Burke, B.

    2006-12-01

    For the past three years we have used the Palomar Testbed Interferometer to undertake an astrometric search for planets in binary stellar systems. By using phase referencing and long-baseline near-IR interferometry we are able to obtain an astrometric precision of approximately 20 micro-arcseconds between pairs of stars with separations in the range 0.1-1 arcsecond. We have followed 40 systems intensively and to date have over 800 astrometric measurements. We will present results from the first comprehensive analysis of this data set, including strong limits on the occurrence of planets in our target systems. The PHASES program serves as an excellent precursor to the type of program we expect to undertake with the Space Interferometry Mission PlanetQuest.

  12. Tree and Hashing Data Structures to Speed up Chemical Searches: Analysis and Experiments.

    PubMed

    Nasr, Ramzi; Kristensen, Thomas; Baldi, Pierre

    2011-09-01

    In many large chemoinformatics database systems, molecules are represented by long binary fingerprint vectors whose components record the presence or absence of particular functional groups or combinatorial features. For a given query molecule, one is interested in retrieving all the molecules in the database with a similarity to the query above a certain threshold. Here we describe a method for speeding up chemical searches in these large databases of small molecules by combining previously developed tree and hashing data structures to prune the search space without any false negatives. More importantly, we provide a mathematical analysis that allows one to predict the level of pruning, and validate the quality of the predictions of the method through simulation experiments.

  13. Searches for all types of binary mergers in the first Advanced LIGO observing run

    NASA Astrophysics Data System (ADS)

    Read, Jocelyn

    2017-01-01

    The first observational run of the Advanced LIGO detectors covered September 12, 2015 to January 19, 2016. In that time, two definitive observations of merging binary black hole systems were made. In particular, the second observation, GW151226, relied on matched-filter searches targeting merging binaries. These searches were also capable of detecting binary mergers from binary neutron stars and from black-hole/neutron-star binaries. In this talk, I will give an overview of LIGO compact binary coalescence searches, in particular focusing on systems that contain neutron stars. I will discuss the sensitive volumes of the first observing run, the astrophysical implications of detections and non-detections, and prospects for future observations

  14. Efficient Globally Optimal Consensus Maximisation with Tree Search.

    PubMed

    Chin, Tat-Jun; Purkait, Pulak; Eriksson, Anders; Suter, David

    2017-04-01

    Maximum consensus is one of the most popular criteria for robust estimation in computer vision. Despite its widespread use, optimising the criterion is still customarily done by randomised sample-and-test techniques, which do not guarantee optimality of the result. Several globally optimal algorithms exist, but they are too slow to challenge the dominance of randomised methods. Our work aims to change this state of affairs by proposing an efficient algorithm for global maximisation of consensus. Under the framework of LP-type methods, we show how consensus maximisation for a wide variety of vision tasks can be posed as a tree search problem. This insight leads to a novel algorithm based on A* search. We propose efficient heuristic and support set updating routines that enable A* search to efficiently find globally optimal results. On common estimation problems, our algorithm is much faster than previous exact methods. Our work identifies a promising direction for globally optimal consensus maximisation.

  15. A stream-based offline search for detecting gravitational waves from compact binary coalescences

    NASA Astrophysics Data System (ADS)

    Caudill, Sarah; LIGO Scientific Collaboration Collaboration; Virgo Collaboration Collaboration

    2016-03-01

    We present various methods used in the offline GstLAL matched filtering search. We discuss the extension of our search parameter space to cover gravitational waves from coalescence of binary neutron stars, neutron star-black holes, and binary black holes up to a total mass of 100 solar masses, and component spins aligned with the angular momentum. We also present the use of a multidimensional likelihood ratio ranking statistic and our techniques for background estimation. Finally, we discuss the role of this search as an independent LIGO detection pipeline for compact binary coalescence.

  16. Resolution and reconciliation of non-binary gene trees with transfers, duplications and losses.

    PubMed

    Jacox, Edwin; Weller, Mathias; Tannier, Eric; Scornavacca, Celine

    2017-01-10

    Gene trees reconstructed from sequence alignments contain poorly supported branches when the phylogenetic signal in the sequences is insufficient to determine them all. When a species tree is available, the signal of gains and losses of genes can be used to correctly resolve the unsupported parts of the gene history. However finding a most parsimonious binary resolution of a non-binary tree obtained by contracting the unsupported branches is NP-hard if transfer events are considered as possible gene scale events, in addition to gene origination, duplication and loss. We propose an exact, parameterized algorithm to solve this problem in single-exponential time, where the parameter is the number of connected branches of the gene tree that show low support from the sequence alignment or, equivalently, the maximum number of children of any node of the gene tree once the low-support branches have been collapsed. This improves on the best known algorithm by an exponential factor. We propose a way to choose among optimal solutions based on the available information. We show the usability of this principle on several simulated and biological datasets. The results are comparable in quality to several other tested methods having similar goals, but our approach provides a lower running time and a guarantee that the produced solution is optimal.

  17. Axial segregation of horizontally vibrated binary granular mixtures in an offset-Christmas tree channel

    NASA Astrophysics Data System (ADS)

    Bhateja, Ashish; Sharma, Ishan; Singh, Jayant K.

    2013-06-01

    We investigate segregation in a horizontally vibrated binary granular mixture in a closed offset-Christmas tree channel. The segregation phenomenon occurs in two steps: vertical sorting followed by axial segregation. In the first step, sorting occurs via Brazil-nut effect or reverse Brazil-nut effect depending on the particles' size and density ratios. The two layers thus formed then separate axially towards opposite-ends of the channel with the top layer always moving towards root of the Christmas tree. We discuss the segregation mechanism responsible for axial segregation.

  18. SIMULATING VENTILATION DISTRIBUTION IN HETEROGENOUS LUNG INJURY USING A BINARY TREE DATA STRUCTURE

    PubMed Central

    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

  19. Binary-tree encryption strategy for optical multiple-image encryption.

    PubMed

    Yi, Jiawang; Tan, Guanzheng

    2016-07-10

    In traditional optical multiple-image encryption schemes, different images typically have almost the same encryption or decryption process. Provided that an attacker manages to correctly decrypt some image, the conventional attacks upon other images are much easier to be made. In this paper, a binary-tree encryption strategy for multiple images is proposed to resist the attacks in this case. The encryption schemes produced by this strategy can not only increase the security of multiple-image encryption, but also realize an authority management with high security among the users sharing a cipher image. For a simulation test, we devise a basic binary-tree encryption scheme, whose encryption nodes are based on an asymmetric double random phase encoding in the gyrator domain. The favorable simulation results about the tested scheme can testify to the feasibility of the strategy.

  20. The PyCBC search for binary black hole coalescences in Advanced LIGO's first observing run

    NASA Astrophysics Data System (ADS)

    Willis, Joshua; LIGO Scientific Collaboration

    2017-01-01

    Advanced LIGO's first observing run saw the first detections of binary black hole coalescences. We describe the PyCBC matched filter analysis, and the results of that search for binary systems with total mass up to 100 solar masses. This is a matched filter search for general-relativistic signals from binary black hole systems. Two signals, GW150914 and GW151226, were identified with very high significance, and a third possible signal, LVT151012, was found, though at much lower significance. Supported by NSF award PHY-1506254.

  1. SEARCH FOR SUPERMASSIVE BLACK HOLE BINARIES IN THE SLOAN DIGITAL SKY SURVEY SPECTROSCOPIC SAMPLE

    SciTech Connect

    Ju, Wenhua; Greene, Jenny E.; Rafikov, Roman R.; Bickerton, Steven J.; Badenes, Carles

    2013-11-01

    Supermassive black hole (SMBH) binaries are expected in a ΛCDM cosmology given that most (if not all) massive galaxies contain a massive black hole (BH) at their center. So far, however, direct evidence for such binaries has been elusive. We use cross-correlation to search for temporal velocity shifts in the Mg II broad emission lines of 0.36 < z < 2 quasars with multiple observations in the Sloan Digital Sky Survey. For ∼10{sup 9} M{sub ☉} BHs in SMBH binaries, we are sensitive to velocity drifts for binary separations of ∼0.1 pc with orbital periods of ∼100 yr. We find seven candidate sub-parsec-scale binaries with velocity shifts >3.4σ ∼ 280 km s{sup –1}, where σ is our systematic error. Comparing the detectability of SMBH binaries with the number of candidates (N ≤ 7), we can rule out that most 10{sup 9} M{sub ☉} BHs exist in ∼0.03-0.2 pc scale binaries, in a scenario where binaries stall at sub-parsec scales for a Hubble time. We further constrain that ≤16% (one-third) of quasars host SMBH binaries after considering gas-assisted sub-parsec evolution of SMBH binaries, although this result is very sensitive to the assumed size of the broad line region. We estimate the detectability of SMBH binaries with ongoing or next-generation surveys (e.g., Baryon Oscillation Spectroscopic Survey, Subaru Prime Focus Spectrograph), taking into account the evolution of the sub-parsec binary in circumbinary gas disks. These future observations will provide longer time baselines for searches similar to ours and may in turn constrain the evolutionary scenarios of SMBH binaries.

  2. Searching for Signals of Merging Primordial Black Hole Binaries

    NASA Astrophysics Data System (ADS)

    Cholis, Ilias; Ali-Haimoud, Yacine; Bird, Simeon; Kamionkowski, Marc; Kovetz, Ely; Mandic, Vuk; Munoz, Julian; Raccanelli, Alvise

    2017-01-01

    It was recently advocated that the interactions of 30 solar masses primordial black holes composing the dark matter could explain the first ever observed coalescence event of BHs by the LIGO interferometers. We will discuss potential probes for such a scenario. One probe is the measurement of the eccentricities of the inspiralling binary black holes. We will show that PBH binaries are formed on highly eccentric orbits and can then merge on timescales that in some cases are years or less, retaining some eccentricity in the last seconds before the merger, which can be detected by LIGO or future Einstein Telescope by the observation of high frequency gravitational wave modes. In contrast, in massive-stellar-binaries, globular-clusters, or other astrophysical environment of binary black holes, the orbits have very effectively circularized by the time the binary enters the observable LIGO window.Finally we will discuss the possibility of detecting a signal of PBH binaries in the stochastic gravitational wave background with future gravitational wave detectors.

  3. The PyCBC search for gravitational waves from compact binary coalescence

    NASA Astrophysics Data System (ADS)

    Usman, Samantha A.; Nitz, Alexander H.; Harry, Ian W.; Biwer, Christopher M.; Brown, Duncan A.; Cabero, Miriam; Capano, Collin D.; Dal Canton, Tito; Dent, Thomas; Fairhurst, Stephen; Kehl, Marcel S.; Keppel, Drew; Krishnan, Badri; Lenon, Amber; Lundgren, Andrew; Nielsen, Alex B.; Pekowsky, Larne P.; Pfeiffer, Harald P.; Saulson, Peter R.; West, Matthew; Willis, Joshua L.

    2016-11-01

    We describe the PyCBC search for gravitational waves from compact-object binary coalescences in advanced gravitational-wave detector data. The search was used in the first Advanced Laser Interferometer Gravitational-wave Observatory (LIGO) observing run and unambiguously identified two black hole binary mergers, GW150914 and GW151226. At its core, the PyCBC search performs a matched-filter search for binary merger signals using a bank of gravitational-wave template waveforms. We provide a complete description of the search pipeline including the steps used to mitigate the effects of noise transients in the data, identify candidate events and measure their statistical significance. The analysis is able to measure false-alarm rates as low as one per million years, required for confident detection of signals. Using data from initial LIGO's sixth science run, we show that the new analysis reduces the background noise in the search, giving a 30 % increase in sensitive volume for binary neutron star systems over previous searches.

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

    NASA Technical Reports Server (NTRS)

    Bolte, Michael

    1991-01-01

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

  5. Cross-indexing of binary SIFT codes for large-scale image search.

    PubMed

    Liu, Zhen; Li, Houqiang; Zhang, Liyan; Zhou, Wengang; Tian, Qi

    2014-05-01

    In recent years, there has been growing interest in mapping visual features into compact binary codes for applications on large-scale image collections. Encoding high-dimensional data as compact binary codes reduces the memory cost for storage. Besides, it benefits the computational efficiency since the computation of similarity can be efficiently measured by Hamming distance. In this paper, we propose a novel flexible scale invariant feature transform (SIFT) binarization (FSB) algorithm for large-scale image search. The FSB algorithm explores the magnitude patterns of SIFT descriptor. It is unsupervised and the generated binary codes are demonstrated to be dispreserving. Besides, we propose a new searching strategy to find target features based on the cross-indexing in the binary SIFT space and original SIFT space. We evaluate our approach on two publicly released data sets. The experiments on large-scale partial duplicate image retrieval system demonstrate the effectiveness and efficiency of the proposed algorithm.

  6. An All-Sky Search for Wide Binaries in the SUPERBLINK Proper Motion Catalog

    NASA Astrophysics Data System (ADS)

    Hartman, Zachary; Lepine, Sebastien

    2017-01-01

    We present initial results from an all-sky search for Common Proper Motion (CPM) binaries in the SUPERBLINK all-sky proper motion catalog of 2.8 million stars with proper motions greater than 40 mas/yr, which has been recently enhanced with data from the GAIA mission. We initially search the SUPERBLINK catalog for pairs of stars with angular separations up to 1 degree and proper motion difference less than 40 mas/yr. In order to determine which of these pairs are real binaries, we develop a Bayesian analysis to calculate probabilities of true companionship based on a combination of proper motion magnitude, angular separation, and proper motion differences. The analysis reveals that the SUPERBLINK catalog most likely contains ~40,000 genuine common proper motion binaries. We provide initial estimates of the distances and projected physical separations of these wide binaries.

  7. Search for gravitational waves from binary black hole inspiral, merger, and ringdown

    NASA Astrophysics Data System (ADS)

    Abadie, J.; Abbott, B. P.; Abbott, R.; Abernathy, M.; Accadia, T.; Acernese, F.; Adams, C.; Adhikari, R.; Ajith, P.; Allen, B.; Allen, G. S.; Amador Ceron, E.; Amin, R. S.; Anderson, S. B.; Anderson, W. G.; Antonucci, F.; Arain, M. A.; Araya, M. C.; Aronsson, M.; Aso, Y.; Aston, S. M.; Astone, P.; Atkinson, D.; Aufmuth, P.; Aulbert, C.; Babak, S.; Baker, P.; Ballardin, G.; Ballinger, T.; Ballmer, S.; Barker, D.; Barnum, S.; Barone, F.; Barr, B.; Barriga, P.; Barsotti, L.; Barsuglia, M.; Barton, M. A.; Bartos, I.; Bassiri, R.; Bastarrika, M.; Bauchrowitz, J.; Bauer, Th. S.; Behnke, B.; Beker, M. G.; Belletoile, A.; Benacquista, M.; Bertolini, A.; Betzwieser, J.; Beveridge, N.; Beyersdorf, P. T.; Bilenko, I. A.; Billingsley, G.; Birch, J.; Birindelli, S.; Biswas, R.; Bitossi, M.; Bizouard, M. A.; Black, E.; Blackburn, J. K.; Blackburn, L.; Blair, D.; Bland, B.; Blom, M.; Boccara, C.; Bock, O.; Bodiya, T. P.; Bondarescu, R.; Bondu, F.; Bonelli, L.; Bonnand, R.; Bork, R.; Born, M.; Boschi, V.; Bose, S.; Bosi, L.; Bouhou, B.; Boyle, M.; Braccini, S.; Bradaschia, C.; Brady, P. R.; Braginsky, V. B.; Brau, J. E.; Breyer, J.; Bridges, D. O.; Brillet, A.; Brinkmann, M.; Brisson, V.; Britzger, M.; Brooks, A. F.; Brown, D. A.; Budzyński, R.; Bulik, T.; Bulten, H. J.; Buonanno, A.; Burguet-Castell, J.; Burmeister, O.; Buskulic, D.; Buy, C.; Byer, R. L.; Cadonati, L.; Cagnoli, G.; Cain, J.; Calloni, E.; Camp, J. B.; Campagna, E.; Campsie, P.; Cannizzo, J.; Cannon, K.; Canuel, B.; Cao, J.; Capano, C.; Carbognani, F.; Caride, S.; Caudill, S.; Cavaglià, M.; Cavalier, F.; Cavalieri, R.; Cella, G.; Cepeda, C.; Cesarini, E.; Chaibi, O.; Chalermsongsak, T.; Chalkley, E.; Charlton, P.; Chassande-Mottin, E.; Chelkowski, S.; Chen, Y.; Chincarini, A.; Christensen, N.; Chua, S. S. Y.; Chung, C. T. Y.; Clark, D.; Clark, J.; Clayton, J. H.; Cleva, F.; Coccia, E.; Colacino, C. N.; Colas, J.; Colla, A.; Colombini, M.; Conte, R.; Cook, D.; Corbitt, T. R.; Cornish, N.; Corsi, A.; Costa, C. A.; Coulon, J.-P.; Coward, D. M.; Coyne, D. C.; Creighton, J. D. E.; Creighton, T. D.; Cruise, A. M.; Culter, R. M.; Cumming, A.; Cunningham, L.; Cuoco, E.; Dahl, K.; Danilishin, S. L.; Dannenberg, R.; D'Antonio, S.; Danzmann, K.; Das, K.; Dattilo, V.; Daudert, B.; Davier, M.; Davies, G.; Davis, A.; Daw, E. J.; Day, R.; Dayanga, T.; Derosa, R.; Debra, D.; Debreczeni, G.; Degallaix, J.; Del Prete, M.; Dergachev, V.; de Rosa, R.; Desalvo, R.; Devanka, P.; Dhurandhar, S.; di Fiore, L.; di Lieto, A.; di Palma, I.; di Paolo Emilio, M.; di Virgilio, A.; Díaz, M.; Dietz, A.; Donovan, F.; Dooley, K. L.; Doomes, E. E.; Dorsher, S.; Douglas, E. S. D.; Drago, M.; Drever, R. W. P.; Driggers, J. C.; Dueck, J.; Dumas, J.-C.; Eberle, T.; Edgar, M.; Edwards, M.; Effler, A.; Ehrens, P.; Ely, G.; Engel, R.; Etzel, T.; Evans, M.; Evans, T.; Fafone, V.; Fairhurst, S.; Fan, Y.; Farr, B. F.; Fazi, D.; Fehrmann, H.; Feldbaum, D.; Ferrante, I.; Fidecaro, F.; Finn, L. S.; Fiori, I.; Flaminio, R.; Flanigan, M.; Flasch, K.; Foley, S.; Forrest, C.; Forsi, E.; Forte, L. A.; Fotopoulos, N.; Fournier, J.-D.; Franc, J.; Frasca, S.; Frasconi, F.; Frede, M.; Frei, M.; Frei, Z.; Freise, A.; Frey, R.; Fricke, T. T.; Friedrich, D.; Fritschel, P.; Frolov, V. V.; Fulda, P.; Fyffe, M.; Galimberti, M.; Gammaitoni, L.; Garofoli, J. A.; Garufi, F.; Gáspár, M. E.; Gemme, G.; Genin, E.; Gennai, A.; Gholami, I.; Ghosh, S.; Giaime, J. A.; Giampanis, S.; Giardina, K. D.; Giazotto, A.; Gill, C.; Goetz, E.; Goggin, L. M.; González, G.; Gorodetsky, M. L.; Goßler, S.; Gouaty, R.; Graef, C.; Granata, M.; Grant, A.; Gras, S.; Gray, C.; Greenhalgh, R. J. S.; Gretarsson, A. M.; Greverie, C.; Grosso, R.; Grote, H.; Grunewald, S.; Guidi, G. M.; Gustafson, E. K.; Gustafson, R.; Hage, B.; Hall, P.; Hallam, J. M.; Hammer, D.; Hammond, G.; Hanks, J.; Hanna, C.; Hanson, J.; Harms, J.; Harry, G. M.; Harry, I. W.; Harstad, E. D.; Haughian, K.; Hayama, K.; Hayau, J.-F.; Hayler, T.; Heefner, J.; Heitmann, H.; Hello, P.; Heng, I. S.; Heptonstall, A. W.; Hewitson, M.; Hild, S.; Hirose, E.; Hoak, D.; Hodge, K. A.; Holt, K.; Hosken, D. J.; Hough, J.; Howell, E. J.; Hoyland, D.; Huet, D.; Hughey, B.; Husa, S.; Huttner, S. H.; Huynh-Dinh, T.; Ingram, D. R.; Inta, R.; Isogai, T.; Ivanov, A.; Jaranowski, P.; Johnson, W. W.; Jones, D. I.; Jones, G.; Jones, R.; Ju, L.; Kalmus, P.; Kalogera, V.; Kandhasamy, S.; Kanner, J. B.; Katsavounidis, E.; Kawabe, K.; Kawamura, S.; Kawazoe, F.; Kells, W.; Keppel, D. G.; Khalaidovski, A.; Khalili, F. Y.; Khazanov, E. A.; Kim, H.; King, P. J.; Kinzel, D. L.; Kissel, J. S.; Klimenko, S.; Kondrashov, V.; Kopparapu, R.; Koranda, S.; Kowalska, I.; Kozak, D.; Krause, T.; Kringel, V.; Krishnamurthy, S.; Krishnan, B.; Królak, A.; Kuehn, G.; Kullman, J.; Kumar, R.; Kwee, P.; Landry, M.; Lang, M.; Lantz, B.; Lastzka, N.; Lazzarini, A.; Leaci, P.; Leong, J.; Leonor, I.; Leroy, N.; Letendre, N.; Li, J.; Li, T. G. F.; Liguori, N.; Lin, H.; Lindquist, P. E.; Lockerbie, N. A.; Lodhia, D.; Lorenzini, M.; Loriette, V.; Lormand, M.; Losurdo, G.; Lu, P.; Luan, J.; Lubiński, M.; Lucianetti, A.; Lück, H.; Lundgren, A. D.; Machenschalk, B.; Macinnis, M.; Mageswaran, M.; Mailand, K.; Majorana, E.; Mak, C.; Maksimovic, I.; Man, N.; Mandel, I.; Mandic, V.; Mantovani, M.; Marchesoni, F.; Marion, F.; Márka, S.; Márka, Z.; Maros, E.; Marque, J.; Martelli, F.; Martin, I. W.; Martin, R. M.; Marx, J. N.; Mason, K.; Masserot, A.; Matichard, F.; Matone, L.; Matzner, R. A.; Mavalvala, N.; McCarthy, R.; McClelland, D. E.; McGuire, S. C.; McIntyre, G.; McIvor, G.; McKechan, D. J. A.; Meadors, G.; Mehmet, M.; Meier, T.; Melatos, A.; Melissinos, A. C.; Mendell, G.; Menéndez, D. F.; Mercer, R. A.; Merill, L.; Meshkov, S.; Messenger, C.; Meyer, M. S.; Miao, H.; Michel, C.; Milano, L.; Miller, J.; Minenkov, Y.; Mino, Y.; Mitra, S.; Mitrofanov, V. P.; Mitselmakher, G.; Mittleman, R.; Moe, B.; Mohan, M.; Mohanty, S. D.; Mohapatra, S. R. P.; Moraru, D.; Moreau, J.; Moreno, G.; Morgado, N.; Morgia, A.; Morioka, T.; Mors, K.; Mosca, S.; Moscatelli, V.; Mossavi, K.; Mours, B.; Mow-Lowry, C. M.; Mueller, G.; Mukherjee, S.; Mullavey, A.; Müller-Ebhardt, H.; Munch, J.; Murray, P. G.; Nash, T.; Nawrodt, R.; Nelson, J.; Neri, I.; Newton, G.; Nishizawa, A.; Nocera, F.; Nolting, D.; Ochsner, E.; O'Dell, J.; Ogin, G. H.; Oldenburg, R. G.; O'Reilly, B.; O'Shaughnessy, R.; Osthelder, C.; Ottaway, D. J.; Ottens, R. S.; Overmier, H.; Owen, B. J.; Page, A.; Pagliaroli, G.; Palladino, L.; Palomba, C.; Pan, Y.; Pankow, C.; Paoletti, F.; Papa, M. A.; Pardi, S.; Pareja, M.; Parisi, M.; Pasqualetti, A.; Passaquieti, R.; Passuello, D.; Patel, P.; Pathak, D.; Pedraza, M.; Pekowsky, L.; Penn, S.; Peralta, C.; Perreca, A.; Persichetti, G.; Pichot, M.; Pickenpack, M.; Piergiovanni, F.; Pietka, M.; Pinard, L.; Pinto, I. M.; Pitkin, M.; Pletsch, H. J.; Plissi, M. V.; Poggiani, R.; Postiglione, F.; Prato, M.; Predoi, V.; Price, L. R.; Prijatelj, M.; Principe, M.; Prix, R.; Prodi, G. A.; Prokhorov, L.; Puncken, O.; Punturo, M.; Puppo, P.; Quetschke, V.; Raab, F. J.; Rabeling, D. S.; Rácz, I.; Radke, T.; Radkins, H.; Raffai, P.; Rakhmanov, M.; Rankins, B.; Rapagnani, P.; Raymond, V.; Re, V.; Reed, C. M.; Reed, T.; Regimbau, T.; Reid, S.; Reitze, D. H.; Ricci, F.; Riesen, R.; Riles, K.; Roberts, P.; Robertson, N. A.; Robinet, F.; Robinson, C.; Robinson, E. L.; Rocchi, A.; Roddy, S.; Rolland, L.; Rollins, J.; Romano, J. D.; Romano, R.; Romie, J. H.; Rosińska, D.; Röver, C.; Rowan, S.; Rüdiger, A.; Ruggi, P.; Ryan, K.; Sakata, S.; Sakosky, M.; Salemi, F.; Sammut, L.; Sancho de La Jordana, L.; Sandberg, V.; Sannibale, V.; Santamaría, L.; Santostasi, G.; Saraf, S.; Sassolas, B.; Sathyaprakash, B. S.; Sato, S.; Satterthwaite, M.; Saulson, P. R.; Savage, R.; Schilling, R.; Schnabel, R.; Schofield, R. M. S.; Schulz, B.; Schutz, B. F.; Schwinberg, P.; Scott, J.; Scott, S. M.; Searle, A. C.; Seifert, F.; Sellers, D.; Sengupta, A. S.; Sentenac, D.; Sergeev, A.; Shaddock, D. A.; Shapiro, B.; Shawhan, P.; Shoemaker, D. H.; Sibley, A.; Siemens, X.; Sigg, D.; Singer, A.; Sintes, A. M.; Skelton, G.; Slagmolen, B. J. J.; Slutsky, J.; Smith, J. R.; Smith, M. R.; Smith, N. D.; Somiya, K.; Sorazu, B.; Speirits, F. C.; Sperandio, L.; Stein, A. J.; Stein, L. C.; Steinlechner, S.; Steplewski, S.; Stochino, A.; Stone, R.; Strain, K. A.; Strigin, S.; Stroeer, A. S.; Sturani, R.; Stuver, A. L.; Summerscales, T. Z.; Sung, M.; Susmithan, S.; Sutton, P. J.; Swinkels, B.; Szokoly, G. P.; Tacca, M.; Talukder, D.; Tanner, D. B.; Tarabrin, S. P.; Taylor, J. R.; Taylor, R.; Thomas, P.; Thorne, K. A.; Thorne, K. S.; Thrane, E.; Thüring, A.; Titsler, C.; Tokmakov, K. V.; Toncelli, A.; Tonelli, M.; Torre, O.; Torres, C.; Torrie, C. I.; Tournefier, E.; Travasso, F.; Traylor, G.; Trias, M.; Tseng, K.; Turner, L.; Ugolini, D.; Urbanek, K.; Vahlbruch, H.; Vaishnav, B.; Vajente, G.; Vallisneri, M.; van den Brand, J. F. J.; van den Broeck, C.; van der Putten, S.; van der Sluys, M. V.; van Veggel, A. A.; Vass, S.; Vasuth, M.; Vaulin, R.; Vavoulidis, M.; Vecchio, A.; Vedovato, G.; Veitch, J.; Veitch, P. J.; Veltkamp, C.; Verkindt, D.; Vetrano, F.; Viceré, A.; Villar, A. E.; Vinet, J.-Y.; Vocca, H.; Vorvick, C.; Vyachanin, S. P.; Waldman, S. J.; Wallace, L.; Wanner, A.; Ward, R. L.; Was, M.; Wei, P.; Weinert, M.; Weinstein, A. J.; Weiss, R.; Wen, L.; Wen, S.; Wessels, P.; West, M.; Westphal, T.; Wette, K.; Whelan, J. T.; Whitcomb, S. E.; White, D.; Whiting, B. F.; Wilkinson, C.; Willems, P. A.; Williams, L.; Willke, B.; Winkelmann, L.; Winkler, W.; Wipf, C. C.; Wiseman, A. G.; Woan, G.; Wooley, R.; Worden, J.; Yakushin, I.; Yamamoto, H.; Yamamoto, K.; Yeaton-Massey, D.; Yoshida, S.; Yu, P.; Yvert, M.; Zanolin, M.; Zhang, L.; Zhang, Z.; Zhao, C.; Zotov, N.; Zucker, M. E.; Zweizig, J.; LIGO Scientific Collaboration; Virgo Collaboration

    2011-06-01

    We present the first modeled search for gravitational waves using the complete binary black-hole gravitational waveform from inspiral through the merger and ringdown for binaries with negligible component spin. We searched approximately 2 years of LIGO data, taken between November 2005 and September 2007, for systems with component masses of 1-99M⊙ and total masses of 25-100M⊙. We did not detect any plausible gravitational-wave signals but we do place upper limits on the merger rate of binary black holes as a function of the component masses in this range. We constrain the rate of mergers for 19M⊙≤m1, m2≤28M⊙ binary black-hole systems with negligible spin to be no more than 2.0Mpc-3Myr-1 at 90% confidence.

  8. Framework for discrete-time quantum walks and a symmetric walk on a binary tree

    SciTech Connect

    Dimcovic, Zlatko; Rockwell, Daniel; Milligan, Ian; Burton, Robert M.; Kovchegov, Yevgeniy; Nguyen, Thinh

    2011-09-15

    We formulate a framework for discrete-time quantum walks, motivated by classical random walks with memory. We present a specific representation of the classical walk with memory 2, on which this is based. The framework has no need for coin spaces, it imposes no constraints on the evolution operator other than unitarity, and is unifying of other approaches. As an example we construct a symmetric discrete-time quantum walk on the semi-infinite binary tree. The generating function of the amplitude at the root is computed in closed form, as a function of time and the initial level n in the tree, and we find the asymptotic and a full numerical solution for the amplitude. It exhibits a sharp interference peak and a power-law tail, as opposed to the exponentially decaying tail of a broadly peaked distribution of the classical symmetric random walk on a binary tree. The probability peak is orders of magnitude larger than it is for the classical walk (already at small n). The quantum walk shows a polynomial algorithmic speedup in n over the classical walk, which we conjecture to be of the order 2/3, based on strong trends in data.

  9. A nomenclature system for the tree of human Y-chromosomal binary haplogroups.

    PubMed

    2002-02-01

    The Y chromosome contains the largest nonrecombining block in the human genome. By virtue of its many polymorphisms, it is now the most informative haplotyping system, with applications in evolutionary studies, forensics, medical genetics, and genealogical reconstruction. However, the emergence of several unrelated and nonsystematic nomenclatures for Y-chromosomal binary haplogroups is an increasing source of confusion. To resolve this issue, 245 markers were genotyped in a globally representative set of samples, 74 of which were males from the Y Chromosome Consortium cell line repository. A single most parsimonious phylogeny was constructed for the 153 binary haplogroups observed. A simple set of rules was developed to unambiguously label the different clades nested within this tree. This hierarchical nomenclature system supersedes and unifies past nomenclatures and allows the inclusion of additional mutations and haplogroups yet to be discovered.

  10. Hierarchical approximate policy iteration with binary-tree state space decomposition.

    PubMed

    Xu, Xin; Liu, Chunming; Yang, Simon X; Hu, Dewen

    2011-12-01

    In recent years, approximate policy iteration (API) has attracted increasing attention in reinforcement learning (RL), e.g., least-squares policy iteration (LSPI) and its kernelized version, the kernel-based LSPI algorithm. However, it remains difficult for API algorithms to obtain near-optimal policies for Markov decision processes (MDPs) with large or continuous state spaces. To address this problem, this paper presents a hierarchical API (HAPI) method with binary-tree state space decomposition for RL in a class of absorbing MDPs, which can be formulated as time-optimal learning control tasks. In the proposed method, after collecting samples adaptively in the state space of the original MDP, a learning-based decomposition strategy of sample sets was designed to implement the binary-tree state space decomposition process. Then, API algorithms were used on the sample subsets to approximate local optimal policies of sub-MDPs. The original MDP was decomposed into a binary-tree structure of absorbing sub-MDPs, constructed during the learning process, thus, local near-optimal policies were approximated by API algorithms with reduced complexity and higher precision. Furthermore, because of the improved quality of local policies, the combined global policy performed better than the near-optimal policy obtained by a single API algorithm in the original MDP. Three learning control problems, including path-tracking control of a real mobile robot, were studied to evaluate the performance of the HAPI method. With the same setting for basis function selection and sample collection, the proposed HAPI obtained better near-optimal policies than previous API methods such as LSPI and KLSPI.

  11. Template banks to search for compact binaries with spinning components in gravitational wave data

    SciTech Connect

    Van Den Broeck, Chris; Cokelaer, Thomas; Harry, Ian; Jones, Gareth; Sathyaprakash, B. S.; Brown, Duncan A.; Tagoshi, Hideyuki; Takahashi, Hirotaka

    2009-07-15

    Gravitational waves from coalescing compact binaries are one of the most promising sources for detectors such as LIGO, Virgo, and GEO600. If the components of the binary possess significant angular momentum (spin), as is likely to be the case if one component is a black hole, spin-induced precession of a binary's orbital plane causes modulation of the gravitational-wave amplitude and phase. If the templates used in a matched-filter search do not accurately model these effects then the sensitivity, and hence the detection rate, will be reduced. We investigate the ability of several search pipelines to detect gravitational waves from compact binaries with spin. We use the post-Newtonian approximation to model the inspiral phase of the signal and construct two new template banks using the phenomenological waveforms of Buonanno, Chen, and Vallisneri [A. Buonanno, Y. Chen, and M. Vallisneri, Phys. Rev. D 67, 104025 (2003)]. We compare the performance of these template banks to that of banks constructed using the stationary phase approximation to the nonspinning post-Newtonian inspiral waveform currently used by LIGO and Virgo in the search for compact binary coalescence. We find that, at the same false alarm rate, a search pipeline using phenomenological templates is no more effective than a pipeline which uses nonspinning templates. We recommend the continued use of the nonspinning stationary phase template bank until the false alarm rate associated with templates which include spin effects can be substantially reduced.

  12. A Markovian Growth Dynamics on Rooted Binary Trees Evolving According to the Gompertz Curve

    NASA Astrophysics Data System (ADS)

    Landim, C.; Portugal, R. D.; Svaiter, B. F.

    2012-08-01

    Inspired by biological dynamics, we consider a growth Markov process taking values on the space of rooted binary trees, similar to the Aldous-Shields (Probab. Theory Relat. Fields 79(4):509-542, 1988) model. Fix n≥1 and β>0. We start at time 0 with the tree composed of a root only. At any time, each node with no descendants, independently from the other nodes, produces two successors at rate β( n- k)/ n, where k is the distance from the node to the root. Denote by Z n ( t) the number of nodes with no descendants at time t and let T n = β -1 nln( n/ln4)+(ln2)/(2 β). We prove that 2- n Z n ( T n + nτ), τ∈ℝ, converges to the Gompertz curve exp(-(ln2) e - βτ ). We also prove a central limit theorem for the martingale associated to Z n ( t).

  13. A note on subtrees rooted along the primary path of a binary tree

    USGS Publications Warehouse

    Troutman, B.M.; Karlinger, M.R.

    1993-01-01

    Let Fn denote the set of rooted binary plane trees with n external nodes, for given T???Fn let ui(T) be the altitude i node along the primary path of T, and let ??i(T) denote the number of external nodes in the induced subtree rooted at ui(T). We set ??i(T) = 0 if i is greater than the length of the primary path of T. We prove limn?????? ???i???x/n En{??i}/???itrees T???Fn and where the distribution function G is determined by its moments, for which we present an explicit expression. ?? 1993.

  14. Searching Kepler Variable Stars with the Eclipsing Binary Factory Pipeline

    NASA Astrophysics Data System (ADS)

    Parvizi, Mahmoud; Paegert, M.

    2014-01-01

    Repositories of large survey data, such as the Mikulski Archive for Space Telescopes, provide an ideally sized sample from which to identify astrophysically interesting eclipsing binary systems (EBs). However, constraints on the rate of human analysis in solving for the characteristic parameters make mining this data using classical techniques prohibitive. The Kepler data set provides both the high precision simple aperture photometry necessary to detect EBs and a corresponding Kepler Eclipsing Binary Catalog - V3 (KEBC3) of 2,406 EBs in the Kepler filed of view (FoV) as a benchmark. We developed a fully automated end-to-end computational pipeline known as the Eclipsing Binary Factory (EBF) that employs pre-classification data processing modules, a feed-forward single layer perception neural network classifier (NNC), and a subsequent neural network solution estimator (NNSE). This paper focuses on the EBF component modules to include NNC, but excludes the NNSE, as a precursor to a fully automated pipeline that uses solution estimates of characteristic parameters to identify astrophysically interesting EBs. The EBF was found to recover ~94% of KEBC3 EBs contained in the Kepler “Q3” data release where the period is less than thirty days.

  15. Targeting highly eccentric black hole binaries with a gravitational wave burst search

    NASA Astrophysics Data System (ADS)

    Baker, Paul; Cornish, Neil; McWilliams, Sean; LIGO Scientific Collaboration

    2017-01-01

    Recent studies have suggested that a non-negligible fraction of coalescing binary black hole systems may enter the aLIGO band with large eccentricity. These systems are challenging to detect with template-based gravitational wave searches due to systematic modeling errors. Current gravitational wave burst searches may miss these signals, because their power can be spread across several time-separated bursts and a wider bandwidth than quasi-circular signals. We describe a new search method being developed for highly eccentric binary black hole systems. This search uses a fast wavelet denoising method that can increase signal-to-noise ratio by collecting several associated bursts. In the future we hope to implement this method to generate low latency triggers that can be further analyzed by the BayesWave burst parameter estimation pipeline.

  16. Block-Based Connected-Component Labeling Algorithm Using Binary Decision Trees

    PubMed Central

    Chang, Wan-Yu; Chiu, Chung-Cheng; Yang, Jia-Horng

    2015-01-01

    In this paper, we propose a fast labeling algorithm based on block-based concepts. Because the number of memory access points directly affects the time consumption of the labeling algorithms, the aim of the proposed algorithm is to minimize neighborhood operations. Our algorithm utilizes a block-based view and correlates a raster scan to select the necessary pixels generated by a block-based scan mask. We analyze the advantages of a sequential raster scan for the block-based scan mask, and integrate the block-connected relationships using two different procedures with binary decision trees to reduce unnecessary memory access. This greatly simplifies the pixel locations of the block-based scan mask. Furthermore, our algorithm significantly reduces the number of leaf nodes and depth levels required in the binary decision tree. We analyze the labeling performance of the proposed algorithm alongside that of other labeling algorithms using high-resolution images and foreground images. The experimental results from synthetic and real image datasets demonstrate that the proposed algorithm is faster than other methods. PMID:26393597

  17. Block-Based Connected-Component Labeling Algorithm Using Binary Decision Trees.

    PubMed

    Chang, Wan-Yu; Chiu, Chung-Cheng; Yang, Jia-Horng

    2015-09-18

    In this paper, we propose a fast labeling algorithm based on block-based concepts. Because the number of memory access points directly affects the time consumption of the labeling algorithms, the aim of the proposed algorithm is to minimize neighborhood operations. Our algorithm utilizes a block-based view and correlates a raster scan to select the necessary pixels generated by a block-based scan mask. We analyze the advantages of a sequential raster scan for the block-based scan mask, and integrate the block-connected relationships using two different procedures with binary decision trees to reduce unnecessary memory access. This greatly simplifies the pixel locations of the block-based scan mask. Furthermore, our algorithm significantly reduces the number of leaf nodes and depth levels required in the binary decision tree. We analyze the labeling performance of the proposed algorithm alongside that of other labeling algorithms using high-resolution images and foreground images. The experimental results from synthetic and real image datasets demonstrate that the proposed algorithm is faster than other methods.

  18. Fast optimization of binary clusters using a novel dynamic lattice searching method

    NASA Astrophysics Data System (ADS)

    Wu, Xia; Cheng, Wen

    2014-09-01

    Global optimization of binary clusters has been a difficult task despite of much effort and many efficient methods. Directing toward two types of elements (i.e., homotop problem) in binary clusters, two classes of virtual dynamic lattices are constructed and a modified dynamic lattice searching (DLS) method, i.e., binary DLS (BDLS) method, is developed. However, it was found that the BDLS can only be utilized for the optimization of binary clusters with small sizes because homotop problem is hard to be solved without atomic exchange operation. Therefore, the iterated local search (ILS) method is adopted to solve homotop problem and an efficient method based on the BDLS method and ILS, named as BDLS-ILS, is presented for global optimization of binary clusters. In order to assess the efficiency of the proposed method, binary Lennard-Jones clusters with up to 100 atoms are investigated. Results show that the method is proved to be efficient. Furthermore, the BDLS-ILS method is also adopted to study the geometrical structures of (AuPd)79 clusters with DFT-fit parameters of Gupta potential.

  19. Fast optimization of binary clusters using a novel dynamic lattice searching method.

    PubMed

    Wu, Xia; Cheng, Wen

    2014-09-28

    Global optimization of binary clusters has been a difficult task despite of much effort and many efficient methods. Directing toward two types of elements (i.e., homotop problem) in binary clusters, two classes of virtual dynamic lattices are constructed and a modified dynamic lattice searching (DLS) method, i.e., binary DLS (BDLS) method, is developed. However, it was found that the BDLS can only be utilized for the optimization of binary clusters with small sizes because homotop problem is hard to be solved without atomic exchange operation. Therefore, the iterated local search (ILS) method is adopted to solve homotop problem and an efficient method based on the BDLS method and ILS, named as BDLS-ILS, is presented for global optimization of binary clusters. In order to assess the efficiency of the proposed method, binary Lennard-Jones clusters with up to 100 atoms are investigated. Results show that the method is proved to be efficient. Furthermore, the BDLS-ILS method is also adopted to study the geometrical structures of (AuPd)79 clusters with DFT-fit parameters of Gupta potential.

  20. Fast optimization of binary clusters using a novel dynamic lattice searching method

    SciTech Connect

    Wu, Xia Cheng, Wen

    2014-09-28

    Global optimization of binary clusters has been a difficult task despite of much effort and many efficient methods. Directing toward two types of elements (i.e., homotop problem) in binary clusters, two classes of virtual dynamic lattices are constructed and a modified dynamic lattice searching (DLS) method, i.e., binary DLS (BDLS) method, is developed. However, it was found that the BDLS can only be utilized for the optimization of binary clusters with small sizes because homotop problem is hard to be solved without atomic exchange operation. Therefore, the iterated local search (ILS) method is adopted to solve homotop problem and an efficient method based on the BDLS method and ILS, named as BDLS-ILS, is presented for global optimization of binary clusters. In order to assess the efficiency of the proposed method, binary Lennard-Jones clusters with up to 100 atoms are investigated. Results show that the method is proved to be efficient. Furthermore, the BDLS-ILS method is also adopted to study the geometrical structures of (AuPd){sub 79} clusters with DFT-fit parameters of Gupta potential.

  1. Searching for GW signals from eccentric supermassive black-hole binaries with pulsar-timing arrays

    NASA Astrophysics Data System (ADS)

    Taylor, Stephen; Gair, Jonathan; Huerta, Eliu; McWilliams, Sean

    2015-04-01

    The mergers of massive galaxies leads to the formation of supermassive black-hole binaries in the common merger remnants. Various mechanisms have been proposed to harden these binaries into the adiabatic GW inspiral regime, from interactions with circumbinary disks to stellar scattering. It may be the case that these mechanisms leave the binary with a residual eccentricity, such that the deviation to the time-of-arrival of pulsar signals induced by the emitted GW passing between the Earth and a pulsar will contain a signature of this eccentricity. Current pulsar-timing search pipelines only probe circular binary systems, but much effort is now being devoted to considering the influence of the binary environment on GW signals. We will detail our efforts in constructing a generalised GW search pipeline to constrain the eccentricity of single systems with arrays of precisely-timed pulsars, which may shed light on the influence of various supermassive black-hole binary hardening mechanisms and illuminate the importance of environmental couplings.

  2. Monte-Carlo Tree Search in Settlers of Catan

    NASA Astrophysics Data System (ADS)

    Szita, István; Chaslot, Guillaume; Spronck, Pieter

    Games are considered important benchmark opportunities for artificial intelligence research. Modern strategic board games can typically be played by three or more people, which makes them suitable test beds for investigating multi-player strategic decision making. Monte-Carlo Tree Search (MCTS) is a recently published family of algorithms that achieved successful results with classical, two-player, perfect-information games such as Go. In this paper we apply MCTS to the multi-player, non-deterministic board game Settlers of Catan. We implemented an agent that is able to play against computer-controlled and human players. We show that MCTS can be adapted successfully to multi-agent environments, and present two approaches of providing the agent with a limited amount of domain knowledge. Our results show that the agent has a considerable playing strength when compared to game implementation with existing heuristics. So, we may conclude that MCTS is a suitable tool for achieving a strong Settlers of Catan player.

  3. Virtual Network Embedding via Monte Carlo Tree Search.

    PubMed

    Haeri, Soroush; Trajkovic, Ljiljana

    2017-02-20

    Network virtualization helps overcome shortcomings of the current Internet architecture. The virtualized network architecture enables coexistence of multiple virtual networks (VNs) on an existing physical infrastructure. VN embedding (VNE) problem, which deals with the embedding of VN components onto a physical network, is known to be NP-hard. In this paper, we propose two VNE algorithms: MaVEn-M and MaVEn-S. MaVEn-M employs the multicommodity flow algorithm for virtual link mapping while MaVEn-S uses the shortest-path algorithm. They formalize the virtual node mapping problem by using the Markov decision process (MDP) framework and devise action policies (node mappings) for the proposed MDP using the Monte Carlo tree search algorithm. Service providers may adjust the execution time of the MaVEn algorithms based on the traffic load of VN requests. The objective of the algorithms is to maximize the profit of infrastructure providers. We develop a discrete event VNE simulator to implement and evaluate performance of MaVEn-M, MaVEn-S, and several recently proposed VNE algorithms. We introduce profitability as a new performance metric that captures both acceptance and revenue to cost ratios. Simulation results show that the proposed algorithms find more profitable solutions than the existing algorithms. Given additional computation time, they further improve embedding solutions.

  4. Search for Gravitational Waves from Intermediate Mass Binary Black Holes

    NASA Technical Reports Server (NTRS)

    Blackburn, L.; Camp, J. B.; Cannizzo, J.; Stroeer, A. S.

    2012-01-01

    We present the results of a weakly modeled burst search for gravitational waves from mergers of non-spinning intermediate mass black holes (IMBH) in the total mass range 100-450 solar Mass and with the component mass ratios between 1:1 and 4:1. The search was conducted on data collected by the LIGO and Virgo detectors between November of 2005 and October of 2007. No plausible signals were observed by the search which constrains the astrophysical rates of the IMBH mergers as a function of the component masses. In the most efficiently detected bin centered on 88 + 88 solar Mass , for non-spinning sources, the rate density upper limit is 0.13 per Mpc(exp 3) per Myr at the 90% confidence level.

  5. A search technique for planets in nearby binary stars using a ground-based interferometer

    NASA Astrophysics Data System (ADS)

    Traub, W. A.; Carleton, N. P.; Porro, I. L.

    1996-04-01

    A search for Jovian-type planets in 100 nearby binary stars could be carried out with the existing ground-based infrared-optical telescope array (IOTA) interferometer. We would study binaries with sufficiently great separation (25-50 AU; typical separation around 0.4 arcsec) that such a planet could be in a stable orbit about one member of the pair. The method is to measure the angular separation of stars in each binary, with a single-measurement accuracy sufficient to detect the amplitude of a Uranus orbiting one of the stars. The technique is based on an auxiliary device, the pupil-splitting interferometer (PSI), which substantially reduces systematic and random errors by converting a measurement of angular separation into a measurement of the differential optical delay between the two components of the binary. The program would be relatively economical, and could begin soon.

  6. First all-sky search for continuous gravitational waves from unknown sources in binary systems

    NASA Astrophysics Data System (ADS)

    Aasi, J.; Abbott, B. P.; Abbott, R.; Abbott, T.; Abernathy, M. R.; Accadia, T.; Acernese, F.; Ackley, K.; Adams, C.; Adams, T.; Addesso, P.; Adhikari, R. X.; Affeldt, C.; Agathos, M.; Aggarwal, N.; Aguiar, O. D.; Ain, A.; Ajith, P.; Alemic, A.; Allen, B.; Allocca, A.; Amariutei, D.; Andersen, M.; Anderson, R.; Anderson, S. B.; Anderson, W. G.; Arai, K.; Araya, M. C.; Arceneaux, C.; Areeda, J.; Aston, S. M.; Astone, P.; Aufmuth, P.; Aulbert, C.; Austin, L.; Aylott, B. E.; Babak, S.; Baker, P. T.; Ballardin, G.; Ballmer, S. W.; Barayoga, J. C.; Barbet, M.; Barish, B. C.; Barker, D.; Barone, F.; Barr, B.; Barsotti, L.; Barsuglia, M.; Barton, M. A.; Bartos, I.; Bassiri, R.; Basti, A.; Batch, J. C.; Bauchrowitz, J.; Bauer, Th. S.; Behnke, B.; Bejger, M.; Beker, M. G.; Belczynski, C.; Bell, A. S.; Bell, C.; Bergmann, G.; Bersanetti, D.; Bertolini, A.; Betzwieser, J.; Beyersdorf, P. T.; Bilenko, I. A.; Billingsley, G.; Birch, J.; Biscans, S.; Bitossi, M.; Bizouard, M. A.; Black, E.; Blackburn, J. K.; Blackburn, L.; Blair, D.; Bloemen, S.; Blom, M.; Bock, O.; Bodiya, T. P.; Boer, M.; Bogaert, G.; Bogan, C.; Bond, C.; Bondu, F.; Bonelli, L.; Bonnand, R.; Bork, R.; Born, M.; Boschi, V.; Bose, Sukanta; Bosi, L.; Bradaschia, C.; Brady, P. R.; Braginsky, V. B.; Branchesi, M.; Brau, J. E.; Briant, T.; Bridges, D. O.; Brillet, A.; Brinkmann, M.; Brisson, V.; Brooks, A. F.; Brown, D. A.; Brown, D. D.; Brückner, F.; Buchman, S.; Bulik, T.; Bulten, H. J.; Buonanno, A.; Burman, R.; Buskulic, D.; Buy, C.; Cadonati, L.; Cagnoli, G.; Calderón Bustillo, J.; Calloni, E.; Camp, J. B.; Campsie, P.; Cannon, K. C.; Canuel, B.; Cao, J.; Capano, C. D.; Carbognani, F.; Carbone, L.; Caride, S.; Castiglia, A.; Caudill, S.; Cavaglià, M.; Cavalier, F.; Cavalieri, R.; Celerier, C.; Cella, G.; Cepeda, C.; Cesarini, E.; Chakraborty, R.; Chalermsongsak, T.; Chamberlin, S. J.; Chao, S.; Charlton, P.; Chassande-Mottin, E.; Chen, X.; Chen, Y.; Chincarini, A.; Chiummo, A.; Cho, H. S.; Chow, J.; Christensen, N.; Chu, Q.; Chua, S. S. Y.; Chung, S.; Ciani, G.; Clara, F.; Clark, J. A.; Cleva, F.; Coccia, E.; Cohadon, P.-F.; Colla, A.; Collette, C.; Colombini, M.; Cominsky, L.; Constancio, M.; Conte, A.; Cook, D.; Corbitt, T. R.; Cordier, M.; Cornish, N.; Corpuz, A.; Corsi, A.; Costa, C. A.; Coughlin, M. W.; Coughlin, S.; Coulon, J.-P.; Countryman, S.; Couvares, P.; Coward, D. M.; Cowart, M.; Coyne, D. C.; Coyne, R.; Craig, K.; Creighton, J. D. E.; Creighton, T. D.; Crowder, S. G.; Cumming, A.; Cunningham, L.; Cuoco, E.; Dahl, K.; Dal Canton, T.; Damjanic, M.; Danilishin, S. L.; D'Antonio, S.; Danzmann, K.; Dattilo, V.; Daveloza, H.; Davier, M.; Davies, G. S.; Daw, E. J.; Day, R.; Dayanga, T.; Debreczeni, G.; Degallaix, J.; Deléglise, S.; Del Pozzo, W.; Denker, T.; Dent, T.; Dereli, H.; Dergachev, V.; De Rosa, R.; DeRosa, R. T.; DeSalvo, R.; Dhurandhar, S.; Díaz, M.; Di Fiore, L.; Di Lieto, A.; Di Palma, I.; Di Virgilio, A.; Donath, A.; Donovan, F.; Dooley, K. L.; Doravari, S.; Dossa, S.; Douglas, R.; Downes, T. P.; Drago, M.; Drever, R. W. P.; Driggers, J. C.; Du, Z.; Dwyer, S.; Eberle, T.; Edo, T.; Edwards, M.; Effler, A.; Eggenstein, H.; Ehrens, P.; Eichholz, J.; Eikenberry, S. S.; Endrőczi, G.; Essick, R.; Etzel, T.; Evans, M.; Evans, T.; Factourovich, M.; Fafone, V.; Fairhurst, S.; Fang, Q.; Farinon, S.; Farr, B.; Farr, W. M.; Favata, M.; Fehrmann, H.; Fejer, M. M.; Feldbaum, D.; Feroz, F.; Ferrante, I.; Ferrini, F.; Fidecaro, F.; Finn, L. S.; Fiori, I.; Fisher, R. P.; Flaminio, R.; Fournier, J.-D.; Franco, S.; Frasca, S.; Frasconi, F.; Frede, M.; Frei, Z.; Freise, A.; Frey, R.; Fricke, T. T.; Fritschel, P.; Frolov, V. V.; Fulda, P.; Fyffe, M.; Gair, J.; Gammaitoni, L.; Gaonkar, S.; Garufi, F.; Gehrels, N.; Gemme, G.; Genin, E.; Gennai, A.; Ghosh, S.; Giaime, J. A.; Giardina, K. D.; Giazotto, A.; Gill, C.; Gleason, J.; Goetz, E.; Goetz, R.; Gondan, L.; González, G.; Gordon, N.; Gorodetsky, M. L.; Gossan, S.; Goßler, S.; Gouaty, R.; Gräf, C.; Graff, P. B.; Granata, M.; Grant, A.; Gras, S.; Gray, C.; Greenhalgh, R. J. S.; Gretarsson, A. M.; Groot, P.; Grote, H.; Grover, K.; Grunewald, S.; Guidi, G. M.; Guido, C.; Gushwa, K.; Gustafson, E. K.; Gustafson, R.; Hammer, D.; Hammond, G.; Hanke, M.; Hanks, J.; Hanna, C.; Hanson, J.; Harms, J.; Harry, G. M.; Harry, I. W.; Harstad, E. D.; Hart, M.; Hartman, M. T.; Haster, C.-J.; Haughian, K.; Heidmann, A.; Heintze, M.; Heitmann, H.; Hello, P.; Hemming, G.; Hendry, M.; Heng, I. S.; Heptonstall, A. W.; Heurs, M.; Hewitson, M.; Hild, S.; Hoak, D.; Hodge, K. A.; Holt, K.; Hooper, S.; Hopkins, P.; Hosken, D. J.; Hough, J.; Howell, E. J.; Hu, Y.; Huerta, E.; Hughey, B.; Husa, S.; Huttner, S. H.; Huynh, M.; Huynh-Dinh, T.; Ingram, D. R.; Inta, R.; Isogai, T.; Ivanov, A.; Iyer, B. R.; Izumi, K.; Jacobson, M.; James, E.; Jang, H.; Jaranowski, P.; Ji, Y.; Jiménez-Forteza, F.; Johnson, W. W.; Jones, D. I.; Jones, R.; Jonker, R. J. G.; Ju, L.; K, Haris; Kalmus, P.; Kalogera, V.; Kandhasamy, S.; Kang, G.; Kanner, J. B.; Karlen, J.; Kasprzack, M.; Katsavounidis, E.; Katzman, W.; Kaufer, H.; Kawabe, K.; Kawazoe, F.; Kéfélian, F.; Keiser, G. M.; Keitel, D.; Kelley, D. B.; Kells, W.; Khalaidovski, A.; Khalili, F. Y.; Khazanov, E. A.; Kim, C.; Kim, K.; Kim, N.; Kim, N. G.; Kim, Y.-M.; King, E. J.; King, P. J.; Kinzel, D. L.; Kissel, J. S.; Klimenko, S.; Kline, J.; Koehlenbeck, S.; Kokeyama, K.; Kondrashov, V.; Koranda, S.; Korth, W. Z.; Kowalska, I.; Kozak, D. B.; Kremin, A.; Kringel, V.; Krishnan, B.; Królak, A.; Kuehn, G.; Kumar, A.; Kumar, P.; Kumar, R.; Kuo, L.; Kutynia, A.; Kwee, P.; Landry, M.; Lantz, B.; Larson, S.; Lasky, P. D.; Lawrie, C.; Lazzarini, A.; Lazzaro, C.; Leaci, P.; Leavey, S.; Lebigot, E. O.; Lee, C.-H.; Lee, H. K.; Lee, H. M.; Lee, J.; Leonardi, M.; Leong, J. R.; Le Roux, A.; Leroy, N.; Letendre, N.; Levin, Y.; Levine, B.; Lewis, J.; Li, T. G. F.; Libbrecht, K.; Libson, A.; Lin, A. C.; Littenberg, T. B.; Litvine, V.; Lockerbie, N. A.; Lockett, V.; Lodhia, D.; Loew, K.; Logue, J.; Lombardi, A. L.; Lorenzini, M.; Loriette, V.; Lormand, M.; Losurdo, G.; Lough, J.; Lubinski, M. J.; Lück, H.; Luijten, E.; Lundgren, A. P.; Lynch, R.; Ma, Y.; Macarthur, J.; Macdonald, E. P.; MacDonald, T.; Machenschalk, B.; MacInnis, M.; Macleod, D. M.; Magana-Sandoval, F.; Mageswaran, M.; Maglione, C.; Mailand, K.; Majorana, E.; Maksimovic, I.; Malvezzi, V.; Man, N.; Manca, G. M.; Mandel, I.; Mandic, V.; Mangano, V.; Mangini, N.; Mantovani, M.; Marchesoni, F.; Marion, F.; Márka, S.; Márka, Z.; Markosyan, A.; Maros, E.; Marque, J.; Martelli, F.; Martin, I. W.; Martin, R. M.; Martinelli, L.; Martynov, D.; Marx, J. N.; Mason, K.; Masserot, A.; Massinger, T. J.; Matichard, F.; Matone, L.; Matzner, R. A.; Mavalvala, N.; Mazumder, N.; Mazzolo, G.; McCarthy, R.; McClelland, D. E.; McGuire, S. C.; McIntyre, G.; McIver, J.; McLin, K.; Meacher, D.; Meadors, G. D.; Mehmet, M.; Meidam, J.; Meinders, M.; Melatos, A.; Mendell, G.; Mercer, R. A.; Meshkov, S.; Messenger, C.; Meyers, P.; Miao, H.; Michel, C.; Mikhailov, E. E.; Milano, L.; Milde, S.; Miller, J.; Minenkov, Y.; Mingarelli, C. M. F.; Mishra, C.; Mitra, S.; Mitrofanov, V. P.; Mitselmakher, G.; Mittleman, R.; Moe, B.; Moesta, P.; Mohan, M.; Mohapatra, S. R. P.; Moraru, D.; Moreno, G.; Morgado, N.; Morriss, S. R.; Mossavi, K.; Mours, B.; Mow-Lowry, C. M.; Mueller, C. L.; Mueller, G.; Mukherjee, S.; Mullavey, A.; Munch, J.; Murphy, D.; Murray, P. G.; Mytidis, A.; Nagy, M. F.; Nanda Kumar, D.; Nardecchia, I.; Naticchioni, L.; Nayak, R. K.; Necula, V.; Nelemans, G.; Neri, I.; Neri, M.; Newton, G.; Nguyen, T.; Nitz, A.; Nocera, F.; Nolting, D.; Normandin, M. E. N.; Nuttall, L. K.; Ochsner, E.; O'Dell, J.; Oelker, E.; Oh, J. J.; Oh, S. H.; Ohme, F.; Oppermann, P.; O'Reilly, B.; O'Shaughnessy, R.; Osthelder, C.; Ottaway, D. J.; Ottens, R. S.; Overmier, H.; Owen, B. J.; Padilla, C.; Pai, A.; Palashov, O.; Palomba, C.; Pan, H.; Pan, Y.; Pankow, C.; Paoletti, F.; Paoletti, R.; Papa, M. A.; Paris, H.; Pasqualetti, A.; Passaquieti, R.; Passuello, D.; Pedraza, M.; Penn, S.; Perreca, A.; Phelps, M.; Pichot, M.; Pickenpack, M.; Piergiovanni, F.; Pierro, V.; Pinard, L.; Pinto, I. M.; Pitkin, M.; Poeld, J.; Poggiani, R.; Poteomkin, A.; Powell, J.; Prasad, J.; Premachandra, S.; Prestegard, T.; Price, L. R.; Prijatelj, M.; Privitera, S.; Prix, R.; Prodi, G. A.; Prokhorov, L.; Puncken, O.; Punturo, M.; Puppo, P.; Qin, J.; Quetschke, V.; Quintero, E.; Quiroga, G.; Quitzow-James, R.; Raab, F. J.; Rabeling, D. S.; Rácz, I.; Radkins, H.; Raffai, P.; Raja, S.; Rajalakshmi, G.; Rakhmanov, M.; Ramet, C.; Ramirez, K.; Rapagnani, P.; Raymond, V.; Re, V.; Read, J.; Reed, C. M.; Regimbau, T.; Reid, S.; Reitze, D. H.; Rhoades, E.; Ricci, F.; Riles, K.; Robertson, N. A.; Robinet, F.; Rocchi, A.; Rodruck, M.; Rolland, L.; Rollins, J. G.; Romano, R.; Romanov, G.; Romie, J. H.; Rosińska, D.; Rowan, S.; Rüdiger, A.; Ruggi, P.; Ryan, K.; Salemi, F.; Sammut, L.; Sandberg, V.; Sanders, J. R.; Sannibale, V.; Santiago-Prieto, I.; Saracco, E.; Sassolas, B.; Sathyaprakash, B. S.; Saulson, P. R.; Savage, R.; Scheuer, J.; Schilling, R.; Schnabel, R.; Schofield, R. M. S.; Schreiber, E.; Schuette, D.; Schutz, B. F.; Scott, J.; Scott, S. M.; Sellers, D.; Sengupta, A. S.; Sentenac, D.; Sequino, V.; Sergeev, A.; Shaddock, D.; Shah, S.; Shahriar, M. S.; Shaltev, M.; Shapiro, B.; Shawhan, P.; Shoemaker, D. H.; Sidery, T. L.; Siellez, K.; Siemens, X.; Sigg, D.; Simakov, D.; Singer, A.; Singer, L.; Singh, R.; Sintes, A. M.; Slagmolen, B. J. J.; Slutsky, J.; Smith, J. R.; Smith, M.; Smith, R. J. E.; Smith-Lefebvre, N. D.; Son, E. J.; Sorazu, B.; Souradeep, T.; Sperandio, L.; Staley, A.; Stebbins, J.; Steinlechner, J.; Steinlechner, S.; Stephens, B. C.; Steplewski, S.; Stevenson, S.; Stone, R.; Stops, D.; Strain, K. A.; Straniero, N.; Strigin, S.; Sturani, R.; Stuver, A. L.; Summerscales, T. Z.; Susmithan, S.; Sutton, P. J.; Swinkels, B.; Tacca, M.; Talukder, D.; Tanner, D. B.; Tarabrin, S. P.; Taylor, R.; ter Braack, A. P. M.; Thirugnanasambandam, M. P.; Thomas, M.; Thomas, P.; Thorne, K. A.; Thorne, K. S.; Thrane, E.; Tiwari, V.; Tokmakov, K. V.; Tomlinson, C.; Toncelli, A.; Tonelli, M.; Torre, O.; Torres, C. V.; Torrie, C. I.; Travasso, F.; Traylor, G.; Tse, M.; Ugolini, D.; Unnikrishnan, C. S.; Urban, A. L.; Urbanek, K.; Vahlbruch, H.; Vajente, G.; Valdes, G.; Vallisneri, M.; van den Brand, J. F. J.; Van Den Broeck, C.; van der Putten, S.; van der Sluys, M. V.; van Heijningen, J.; van Veggel, A. A.; Vass, S.; Vasúth, M.; Vaulin, R.; Vecchio, A.; Vedovato, G.; Veitch, J.; Veitch, P. J.; Venkateswara, K.; Verkindt, D.; Verma, S. S.; Vetrano, F.; Viceré, A.; Vincent-Finley, R.; Vinet, J.-Y.; Vitale, S.; Vo, T.; Vocca, H.; Vorvick, C.; Vousden, W. D.; Vyachanin, S. P.; Wade, A.; Wade, L.; Wade, M.; Walker, M.; Wallace, L.; Wang, M.; Wang, X.; Ward, R. L.; Was, M.; Weaver, B.; Wei, L.-W.; Weinert, M.; Weinstein, A. J.; Weiss, R.; Welborn, T.; Wen, L.; Wessels, P.; West, M.; Westphal, T.; Wette, K.; Whelan, J. T.; White, D. J.; Whiting, B. F.; Wiesner, K.; Wilkinson, C.; Williams, K.; Williams, L.; Williams, R.; Williams, T.; Williamson, A. R.; Willis, J. L.; Willke, B.; Wimmer, M.; Winkler, W.; Wipf, C. C.; Wiseman, A. G.; Wittel, H.; Woan, G.; Worden, J.; Yablon, J.; Yakushin, I.; Yamamoto, H.; Yancey, C. C.; Yang, H.; Yang, Z.; Yoshida, S.; Yvert, M.; ZadroŻny, A.; Zanolin, M.; Zendri, J.-P.; Zhang, Fan; Zhang, L.; Zhao, C.; Zhu, X. J.; Zucker, M. E.; Zuraw, S.; Zweizig, J.; LIGO Scientific Collaboration; Virgo Collaboration

    2014-09-01

    We present the first results of an all-sky search for continuous gravitational waves from unknown spinning neutron stars in binary systems using LIGO and Virgo data. Using a specially developed analysis program, the TwoSpect algorithm, the search was carried out on data from the sixth LIGO science run and the second and third Virgo science runs. The search covers a range of frequencies from 20 Hz to 520 Hz, a range of orbital periods from 2 to ˜2,254 h and a frequency- and period-dependent range of frequency modulation depths from 0.277 to 100 mHz. This corresponds to a range of projected semimajor axes of the orbit from ˜0.6×10-3 ls to ˜6,500 ls assuming the orbit of the binary is circular. While no plausible candidate gravitational wave events survive the pipeline, upper limits are set on the analyzed data. The most sensitive 95% confidence upper limit obtained on gravitational wave strain is 2.3×10-24 at 217 Hz, assuming the source waves are circularly polarized. Although this search has been optimized for circular binary orbits, the upper limits obtained remain valid for orbital eccentricities as large as 0.9. In addition, upper limits are placed on continuous gravitational wave emission from the low-mass x-ray binary Scorpius X-1 between 20 Hz and 57.25 Hz.

  7. Towards an Extended Binary Black Hole Search using Advanced LIGO: from Stellar to Intermediate-Mass

    NASA Astrophysics Data System (ADS)

    Mukherjee, Debnandini; LIGO Scientific Collaboration; Virgo Collaboration Collaboration

    2017-01-01

    Intermediate mass black hole (IMBH) binaries, make up the mass space between stellar-mass and super massive black holes, with their total mass in the range of about 100 to 100,000 solar masses. Detection of IMBH mergers would help us explore their formation channels. The IMBH search is currently sensitive to coalescences of black hole binaries covering a total mass range between 50-600 solar masses. Recent publications in astrophysics point to the physical importance of the IMBH search (they may shed light on certain supernova mechanisms). In light of the conclusion of the 1st Advanced LIGO search conducted between September 2015 and January 2016 (O1 run), I will provide an update on the IMBH search (software GstLAL based, using matched-filter) on this data and will discuss the feasibility of including the IMBH search with the stellar-mass black hole search space (total mass range 2-100 solar masses), thus achieving a combined search for future runs. NSF PHY-1607585.

  8. Searching for Solar System Wide Binaries with Pan-STARRS-1

    NASA Astrophysics Data System (ADS)

    Holman, Matthew J.; Protopapas, P.; Tholen, D. J.

    2007-10-01

    Roughly 60% of the observing time of the Pan-STARRS-1 (PS1) telescope will be dedicated to a "3pi steradian" survey with an observing cadence that is designed for the detection of near-Earth asteroids and slow-moving solar system bodies. Over this course of its 3.5 year cience mission, this unprecedented survey will discover nearly every asteroid, Trojan, Centaur, long-period comet, short-period comet, and trans-neptunian object (TNO) brighter than magnitude R=23. This census will be used to address a large number of questions regarding the physical and dynamical properties of the various small body populations of the solar system. Roughly 1-2% of TNOs are wide binaries with companions at separations greater than 1 arcsec and brightness differences less than 2 magnitudes (Kern & Elliot 2006; Noll et al 2007). These can be readily detected by PS1; we will carry out such a search with PS1 data. To do so, we will modify the Pan-STARRS Moving Object Processing System (MOPS) such that it will associate the components of resolved or marginally resolved binaries, link such pairs of detections obtained at different epochs, and the estimate the relative orbit of the binary. We will also determine the efficiency with which such binaries are detected as a function of the binary's relative orbit and the relative magnitudes of the components. Based on an estimated 7000 TNOs that PS1 will discover, we anticipate finding 70-140 wide binaries. The PS1 data, 60 epochs over three years, is naturally suited to determining the orbits of these objects. Our search will accurately determine the binary fraction for a variety of subclasses of TNOs.

  9. A three-sided rearrangeable switching network for a binary fat tree

    NASA Astrophysics Data System (ADS)

    Yen, Mao-Hsu; Yu, Chu; Shin, Haw-Yun; Chen, Sao-Jie

    2011-06-01

    A binary fat tree needs an internal node to interconnect the left-children, right-children and parent terminals to each other. In this article, we first propose a three-stage, 3-sided rearrangeable switching network for the implementation of a binary fat tree. The main component of this 3-sided switching network (3SSN) consists of a polygonal switch block (PSB) interconnected by crossbars. With the same size and the same number of switches as our 3SSN, a three-stage, 3-sided clique-based switching network is shown to be not rearrangeable. Also, the effects of the rearrangeable structure and the number of terminals on the network switch-efficiency are explored and a proper set of parameters has been determined to minimise the number of switches. We derive that a rearrangeable 3-sided switching network with switches proportional to N 3/2 is most suitable to interconnect N terminals. Moreover, we propose a new Polygonal Field Programmable Gate Array (PFPGA) that consists of logic blocks interconnected by our 3SSN, such that the logic blocks in this PFPGA can be grouped into clusters to implement different logic functions. Since the programmable switches usually have high resistance and capacitance and occupy a large area, we have to consider the effect of the 3SSN structure and the granularity of its cluster logic blocks on the switch efficiency of PFPGA. Experiments on benchmark circuits show that the switch and speed performances are significantly improved. Based on the experimental results, we can determine the parameters of PFPGA for the VLSI implementation.

  10. A search for binary candidates among the fundamental mode RR Lyrae stars observed by Kepler

    NASA Astrophysics Data System (ADS)

    Guggenberger, Elisabeth; Steixner, Jakob

    2015-09-01

    Although roughly half of all stars are considered to be part of binary or multiple systems, there are only two confirmed cases of RR Lyrae pulsators with companions. One of them is TU Uma [1] - a classical RR Lyrae star in a very eccentric orbit - and the other is OGLE-BLG-RRLYR-02792 [2]. Considering the wealth of well-studied RR Lyrae stars, this number is astoundingly low. Having more RR Lyrae stars in binary systems at hand would be extremely valuable to get independent measurements of the masses. The data from the Kepler mission with their unprecedented precision and the long time span of about four years offer a unique possibility to systematically search for the signatures of binarity in RR Lyrae stars. Using the pulsation as a clock, we studied the variations in the timing of maximum light to hunt for possible binary systems in the sample.

  11. The PyCBC search for compact binary mergers in the second run of Advanced LIGO

    NASA Astrophysics Data System (ADS)

    Dal Canton, Tito; PyCBC Team

    2017-01-01

    The PyCBC software implements a matched-filter search for gravitational-wave signals associated with mergers of compact binaries. During the first observing run of Advanced LIGO, it played a fundamental role in the discovery of the binary-black-hole merger signals GW150914, GW151226 and LVT151012. In preparation for Advanced LIGO's second run, PyCBC has been modified with the goal of increasing the sensitivity of the search, reducing its computational cost and expanding the explored parameter space. The ability to report signals with a latency of tens of seconds and to perform inference on the parameters of the detected signals has also been introduced. I will give an overview of PyCBC and present the new features and their impact.

  12. Searches for millisecond pulsations in low-mass X-ray binaries, 2

    NASA Technical Reports Server (NTRS)

    Vaughan, B. A.; Van Der Klis, M.; Wood, K. S.; Norris, J. P.; Hertz, P.; Michelson, P. F.; Paradijs, J. Van; Lewin, W. H. G.; Mitsuda, K.; Penninx, W.

    1994-01-01

    Coherent millisecond X-ray pulsations are expected from low-mass X-ray binaries (LMXBs), but remain undetected. Using the single-parameter Quadratic Coherence Recovery Technique (QCRT) to correct for unknown binary orbit motion, we have performed Fourier transform searches for coherent oscillations in all long, continuous segments of data obtained at 1 ms time resolution during Ginga observations of LMXB. We have searched the six known Z sources (GX 5-1, Cyg X-2, Sco X-1, GX 17+2, GX 340+0, and GX 349+2), seven of the 14 known atoll sources (GX 3+1. GX 9+1, GX 9+9, 1728-33. 1820-30, 1636-53 and 1608-52), the 'peculiar' source Cir X-1, and the high-mass binary Cyg X-3. We find no evidence for coherent pulsations in any of these sources, with 99% confidence limits on the pulsed fraction between 0.3% and 5.0% at frequencies below the Nyquist frequency of 512 Hz. A key assumption made in determining upper limits in previous searches is shown to be incorrect. We provide a recipe for correctly setting upper limits and detection thresholds. Finally we discuss and apply two strategies to improve sensitivity by utilizing multiple, independent, continuous segments of data with comparable count rates.

  13. Hierarchical Search Strategy for Detecting Gravitational waves from Inspiraling Compact Binaries with Multiple Interferometers

    NASA Astrophysics Data System (ADS)

    Seader, Shawn; Bose, Sukanta

    2004-05-01

    Perhaps the most promising gravitational-wave source for detection with Earth-based interferometers is the compact binary system, such as a binary neutron star. For these sources, the inspiral waveform is well-known in the sensitive frequency band of the interferometers. This allows one to match-filter the output of the interferometer with many different templates of the pre-calculated waveforms. While operating, each interferometer takes strain data at a rate of several gigabytes per day. Matched filtering the outputs from multiple detectors, such as in a multi-detector coherent search, becomes very demanding computationally not only due to the enormous amount of data, but also due to the size of the parameter space that is accessible to a network of detectors. Indeed, the non-spinning binary waveform depends on a total of nine parameters, namely, the luminosity distance to the source, the time of arrival, the initial phase, the orbital inclination, the polarization angle, the two sky-position angles, and the two binary masses. Fortunately, it is possible to maximize a network's matched-filter output analytically over the first five parameters. Thus, a GW astronomer need search numerically only over a four-dimensional parameter space for a signal in the data. A "brute force" implementation of such a search is still not practicable. A promising strategy to make the search computationally viable is to perform it in multiple relatively inexpensive steps, i.e., implement it hierarchically. In a two-step hierarchical search, the data is filtered first with a bank of templates that are spaced coarsely on the parameter space. If any of these templates find a signal at or above a pre-set threshold on the signal-to-noise ratio (SNR), then that part of the data is filtered a second time with a more finely spaced bank of templates, centered around the filter that recorded the high SNR in the first, coarse bank. In this work we show how by setting the detection thresholds and

  14. Algorithms for searching Fast radio bursts and pulsars in tight binary systems.

    NASA Astrophysics Data System (ADS)

    Zackay, Barak

    2017-01-01

    Fast radio bursts (FRB's) are an exciting, recently discovered, astrophysical transients which their origins are unknown.Currently, these bursts are believed to be coming from cosmological distances, allowing us to probe the electron content on cosmological length scales. Even though their precise localization is crucial for the determination of their origin, radio interferometers were not extensively employed in searching for them due to computational limitations.I will briefly present the Fast Dispersion Measure Transform (FDMT) algorithm,that allows to reduce the operation count in blind incoherent dedispersion by 2-3 orders of magnitude.In addition, FDMT enables to probe the unexplored domain of sub-microsecond astrophysical pulses.Pulsars in tight binary systems are among the most important astrophysical objects as they provide us our best tests of general relativity in the strong field regime.I will provide a preview to a novel algorithm that enables the detection of pulsars in short binary systems using observation times longer than an orbital period.Current pulsar search programs limit their searches for integration times shorter than a few percents of the orbital period.Until now, searching for pulsars in binary systems using observation times longer than an orbital period was considered impossible as one has to blindly enumerate all options for the Keplerian parameters, the pulsar rotation period, and the unknown DM.Using the current state of the art pulsar search techniques and all computers on the earth, such an enumeration would take longer than a Hubble time. I will demonstrate that using the new algorithm, it is possible to conduct such an enumeration on a laptop using real data of the double pulsar PSR J0737-3039.Among the other applications of this algorithm are:1) Searching for all pulsars on all sky positions in gamma ray observations of the Fermi LAT satellite.2) Blind searching for continuous gravitational wave sources emitted by pulsars with

  15. A Coincident Search for Radio and Gravitational Waves from Binary Neutron Star Mergers

    NASA Astrophysics Data System (ADS)

    Cardena, Brett

    2011-05-01

    The merger of neutron star-neutron star binary pairs may be accompanied by the prompt emission of a coherent low-frequency radio pulse. This radio transient is produced as synchrotron radiation caused by the spin and rotation of the surface charge density of a pulsar through the magnetosphere of a larger neutron star, usually referred to as a Magnetar . This type of merger event would also result in the release of a gravitational coalescence wave-form. We will discuss a coincident radio transient and gravitational wave search. This search is being conducted by two radio telescope arrays: The Long Wave Array (LWA) and the Eight-meter-wavelength Transient Array (ETA) in coordination with the Laser Interferometer Gravitational-Wave Observatory (LIGO). We will outline this ongoing coincident search and discuss some preliminary results.

  16. MINING PLANET SEARCH DATA FOR BINARY STARS: THE ψ{sup 1} DRACONIS SYSTEM

    SciTech Connect

    Gullikson, Kevin; Endl, Michael; Cochran, William D.; MacQueen, Phillip J.

    2015-12-10

    Several planet-search groups have acquired a great deal of data in the form of time-series spectra of several hundred nearby stars with time baselines of over a decade. While binary star detections are generally not the goal of these long-term monitoring efforts, the binary stars hiding in existing planet search data are precisely the type that are too close to the primary star to detect with imaging or interferometry techniques. We use a cross-correlation analysis to detect the spectral lines of a new low-mass companion to ψ{sup 1} Draconis A, which has a known roughly equal-mass companion at ∼680 AU. We measure the mass of ψ{sup 1} Draconis C as M{sub 2} = 0.70 ± 0.07M{sub ⊙}, with an orbital period of ∼20 years. This technique could be used to characterize binary companions to many stars that show large-amplitude modulation or linear trends in radial velocity data.

  17. Mining Planet Search Data for Binary Stars: The ψ1 Draconis system

    NASA Astrophysics Data System (ADS)

    Gullikson, Kevin; Endl, Michael; Cochran, William D.; MacQueen, Phillip J.

    2015-12-01

    Several planet-search groups have acquired a great deal of data in the form of time-series spectra of several hundred nearby stars with time baselines of over a decade. While binary star detections are generally not the goal of these long-term monitoring efforts, the binary stars hiding in existing planet search data are precisely the type that are too close to the primary star to detect with imaging or interferometry techniques. We use a cross-correlation analysis to detect the spectral lines of a new low-mass companion to ψ1 Draconis A, which has a known roughly equal-mass companion at ∼680 AU. We measure the mass of ψ1 Draconis C as M2 = 0.70 ± 0.07M⊙, with an orbital period of ∼20 years. This technique could be used to characterize binary companions to many stars that show large-amplitude modulation or linear trends in radial velocity data.

  18. Study of statistical properties of hybrid statistic in coherent multidetector compact binary coalescences search

    NASA Astrophysics Data System (ADS)

    Haris, K.; Pai, Archana

    2016-05-01

    In this article, we revisit the coherent gravitational wave search problem of compact binary coalescences with multidetector network consisting of advanced interferometers like LIGO-Virgo. Based on the loss of the optimal multidetector signal-to-noise ratio (SNR), we construct a hybrid statistic as a best of maximum-likelihood-ratio (MLR) statistic tuned for face-on and face-off binaries. The statistical properties of the hybrid statistic is studied. The performance of this hybrid statistic is compared with that of the coherent MLR statistic for generic inclination angles. Owing to the single synthetic data stream, the hybrid statistic gives few false alarms compared to the multidetector MLR statistic and small fractional loss in the optimum SNR for a large range of binary inclinations. We demonstrate that, for a LIGO-Virgo network and binary inclination ɛ <7 0 ° and ɛ >11 0 ° , the hybrid statistic captures more than 98% of the network optimum matched filter SNR with a low false alarm rate. The Monte Carlo exercise with two distributions of incoming inclination angles—namely, U [cos ɛ ] and a more realistic distribution proposed by B. F. Schutz [Classical Quantum Gravity 28, 125023 (2011)]—are performed with the hybrid statistic and give approximately 5% and 7% higher detection probabilities, respectively, compared to the two stream multidetector MLR statistic for a fixed false alarm probability of 1 0-5.

  19. A SYSTEMATIC SEARCH FOR MASSIVE BLACK HOLE BINARIES IN THE SLOAN DIGITAL SKY SURVEY SPECTROSCOPIC SAMPLE

    SciTech Connect

    Tsalmantza, P.; Decarli, R.; Hogg, David W.; Dotti, M. E-mail: decarli@mpia.de

    2011-09-01

    We present the results of a systematic search for massive black hole binaries in the Sloan Digital Sky Survey (SDSS) spectroscopic database. We focus on bound binaries, under the assumption that one of the black holes is active. In this framework, the broad lines associated with the accreting black hole are expected to show systematic velocity shifts with respect to the narrow lines, which trace the rest frame of the galaxy. For a sample of 54,586 quasars and 3929 galaxies at redshifts 0.1 < z < 1.5, we brute-force model each spectrum as a mixture of two quasars at two different redshifts. The spectral model is a data-driven dimensionality reduction of the SDSS quasar spectra based on a matrix factorization. We identified 32 objects with peculiar spectra. Nine of them can be interpreted as black hole binaries. This doubles the number of known black hole binary candidates. We also report on the discovery of a new class of extreme double-peaked emitters with exceptionally broad and faint Balmer lines. For all the interesting sources, we present detailed analysis of the spectra and discuss possible interpretations.

  20. Learning about Parallax and Proper Motion by Searching for Binary Stars

    NASA Astrophysics Data System (ADS)

    Pilachowski, Catherine A.; Hamper, R.; Morris, F.

    2010-01-01

    A new web-based, instructional module allows students to explore the Hipparcos catalog of stellar parallaxes and proper motions to determine whether close double stars are physical binaries or chance superpositions. Because the Hipparcos catalog spans the entire sky, the module guides students to manageable regions of sky. Students navigate to a constellation and grid within the constellation to search for possible binary stars systems. Students can then compare and assess proper motions, in terms of both speed and direction, as well as the distances of both stars, to determine whether the potential close pairs are true binary systems. Students must recognize that multiple lines of evidence (apparent proximity, similar distances, and similar proper motions) must converge to establish the reality of a binary pair. The module gives undergraduate students an opportunity to experience scientific research and discovery, engaging their critical thinking skills in the scientific process. The new module has been developed as part of a collaborative program between the University of Alaska at Anchorage and Indiana University to develop and study the effectiveness of research-based, educational (RBSE) curricula in astronomy for entry-level undergraduate courses. The program is funded through a CCLI award from the National Science Foundation. Further information and access to the web-based RBSE modules is available at www.astro.indiana.edu/catyp/rbseu.

  1. Search for A-F Spectral type pulsating components in Algol-type eclipsing binary systems

    NASA Astrophysics Data System (ADS)

    Kim, S.-L.; Lee, J. W.; Kwon, S.-G.; Youn, J.-H.; Mkrtichian, D. E.; Kim, C.

    2003-07-01

    We present the results of a systematic search for pulsating components in Algol-type eclipsing binary systems. A total number of 14 eclipsing binaries with A-F spectral type primary components were observed for 22 nights. We confirmed small-amplitude oscillating features of a recently detected pulsator TW Dra, which has a pulsating period of 0.053 day and a semi-amplitude of about 5 mmag in B-passband. We discovered new pulsating components in two eclipsing binaries of RX Hya and AB Per. The primary component of RX Hya is pulsating with a dominant period of 0.052 day and a semi-amplitude of about 7 mmag. AB Per has also a pulsating component with a period of 0.196 day and a semi-amplitude of about 10 mmag in B-passband. We suggest that these two new pulsators are members of the newly introduced group of mass-accreting pulsating stars in semi-detached Algol-type eclipsing binary systems. Table 4 is only available in electronic form at the CDS via anonymous ftp to cdsarc.u-strasbg.fr (130.79.128.5) or via http://cdsweb.u-strasbg.fr/cgi-bin/qcat?J/A+A/405/231

  2. Implementation of the frequency-modulated sideband search method for gravitational waves from low mass x-ray binaries

    NASA Astrophysics Data System (ADS)

    Sammut, L.; Messenger, C.; Melatos, A.; Owen, B. J.

    2014-02-01

    We describe the practical implementation of the sideband search, a search for periodic gravitational waves from neutron stars in binary systems. The orbital motion of the source in its binary system causes frequency modulation in the combination of matched filters known as the F-statistic. The sideband search is based on the incoherent summation of these frequency-modulated F-statistic sidebands. It provides a new detection statistic for sources in binary systems, called the C-statistic. The search is well suited to low-mass x-ray binaries, the brightest of which, called Sco X-1, is an ideal target candidate. For sources like Sco X-1, with well-constrained orbital parameters, a slight variation on the search is possible. The extra orbital information can be used to approximately demodulate the data from the binary orbital motion in the coherent stage, before incoherently summing the now reduced number of sidebands. We investigate this approach and show that it improves the sensitivity of the standard Sco X-1 directed sideband search. Prior information on the neutron star inclination and gravitational wave polarization can also be used to improve upper limit sensitivity. We estimate the sensitivity of a Sco X-1 directed sideband search on ten days of LIGO data and show that it can beat previous upper limits in current LIGO data, with a possibility of constraining theoretical upper limits using future advanced instruments.

  3. GW150914: First results from the search for binary black hole coalescence with Advanced LIGO

    NASA Astrophysics Data System (ADS)

    Abbott, B. P.; Abbott, R.; Abbott, T. D.; Abernathy, M. R.; Acernese, F.; Ackley, K.; Adams, C.; Adams, T.; Addesso, P.; Adhikari, R. X.; Adya, V. B.; Affeldt, C.; Agathos, M.; Agatsuma, K.; Aggarwal, N.; Aguiar, O. D.; Aiello, L.; Ain, A.; Ajith, P.; Allen, B.; Allocca, A.; Altin, P. A.; Anderson, S. B.; Anderson, W. G.; Arai, K.; Araya, M. C.; Arceneaux, C. C.; Areeda, J. S.; Arnaud, N.; Arun, K. G.; Ascenzi, S.; Ashton, G.; Ast, M.; Aston, S. M.; Astone, P.; Aufmuth, P.; Aulbert, C.; Babak, S.; Bacon, P.; Bader, M. K. M.; Baker, P. T.; Baldaccini, F.; Ballardin, G.; Ballmer, S. W.; Barayoga, J. C.; Barclay, S. E.; Barish, B. C.; Barker, D.; Barone, F.; Barr, B.; Barsotti, L.; Barsuglia, M.; Barta, D.; Bartlett, J.; Bartos, I.; Bassiri, R.; Basti, A.; Batch, J. C.; Baune, C.; Bavigadda, V.; Bazzan, M.; Behnke, B.; Bejger, M.; Bell, A. S.; Bell, C. J.; Berger, B. K.; Bergman, J.; Bergmann, G.; Berry, C. P. L.; Bersanetti, D.; Bertolini, A.; Betzwieser, J.; Bhagwat, S.; Bhandare, R.; Bilenko, I. A.; Billingsley, G.; Birch, J.; Birney, R.; Biscans, S.; Bisht, A.; Bitossi, M.; Biwer, C.; Bizouard, M. A.; Blackburn, J. K.; Blair, C. D.; Blair, D. G.; Blair, R. M.; Bloemen, S.; Bock, O.; Bodiya, T. P.; Boer, M.; Bogaert, G.; Bogan, C.; Bohe, A.; Bohémier, K.; Bojtos, P.; Bond, C.; Bondu, F.; Bonnand, R.; Boom, B. A.; Bork, R.; Boschi, V.; Bose, S.; Bouffanais, Y.; Bozzi, A.; Bradaschia, C.; Brady, P. R.; Braginsky, V. B.; Branchesi, M.; Brau, J. E.; Briant, T.; Brillet, A.; Brinkmann, M.; Brisson, V.; Brockill, P.; Brooks, A. F.; Brown, D. A.; Brown, D. D.; Brown, N. M.; Buchanan, C. C.; Buikema, A.; Bulik, T.; Bulten, H. J.; Buonanno, A.; Buskulic, D.; Buy, C.; Byer, R. L.; Cabero, M.; Cadonati, L.; Cagnoli, G.; Cahillane, C.; Calderón Bustillo, J.; Callister, T.; Calloni, E.; Camp, J. B.; Cannon, K. C.; Cao, J.; Capano, C. D.; Capocasa, E.; Carbognani, F.; Caride, S.; Casanueva Diaz, J.; Casentini, C.; Caudill, S.; Cavaglià, M.; Cavalier, F.; Cavalieri, R.; Cella, G.; Cepeda, C. B.; Cerboni Baiardi, L.; Cerretani, G.; Cesarini, E.; Chakraborty, R.; Chalermsongsak, T.; Chamberlin, S. J.; Chan, M.; Chao, S.; Charlton, P.; Chassande-Mottin, E.; Chen, H. Y.; Chen, Y.; Cheng, C.; Chincarini, A.; Chiummo, A.; Cho, H. S.; Cho, M.; Chow, J. H.; Christensen, N.; Chu, Q.; Chua, S.; Chung, S.; Ciani, G.; Clara, F.; Clark, J. A.; Clayton, J. H.; Cleva, F.; Coccia, E.; Cohadon, P.-F.; Cokelaer, T.; Colla, A.; Collette, C. G.; Cominsky, L.; Constancio, M.; Conte, A.; Conti, L.; Cook, D.; Corbitt, T. R.; Cornish, N.; Corsi, A.; Cortese, S.; Costa, C. A.; Coughlin, M. W.; Coughlin, S. B.; Coulon, J.-P.; Countryman, S. T.; Couvares, P.; Cowan, E. E.; Coward, D. M.; Cowart, M. J.; Coyne, D. C.; Coyne, R.; Craig, K.; Creighton, J. D. E.; Creighton, T. D.; Cripe, J.; Crowder, S. G.; Cumming, A.; Cunningham, L.; Cuoco, E.; Dal Canton, T.; Danilishin, S. L.; D'Antonio, S.; Danzmann, K.; Darman, N. S.; Dattilo, V.; Dave, I.; Daveloza, H. P.; Davier, M.; Davies, G. S.; Daw, E. J.; Day, R.; De, S.; DeBra, D.; Debreczeni, G.; Degallaix, J.; De Laurentis, M.; Deléglise, S.; Del Pozzo, W.; Denker, T.; Dent, T.; Dereli, H.; Dergachev, V.; DeRosa, R. T.; De Rosa, R.; DeSalvo, R.; Dhurandhar, S.; Díaz, M. C.; Dietz, A.; Di Fiore, L.; Di Giovanni, M.; Di Lieto, A.; Di Pace, S.; Di Palma, I.; Di Virgilio, A.; Dojcinoski, G.; Dolique, V.; Donovan, F.; Dooley, K. L.; Doravari, S.; Douglas, R.; Downes, T. P.; Drago, M.; Drever, R. W. P.; Driggers, J. C.; Du, Z.; Ducrot, M.; Dwyer, S. E.; Edo, T. B.; Edwards, M. C.; Effler, A.; Eggenstein, H.-B.; Ehrens, P.; Eichholz, J.; Eikenberry, S. S.; Engels, W.; Essick, R. C.; Etzel, T.; Evans, M.; Evans, T. M.; Everett, R.; Factourovich, M.; Fafone, V.; Fair, H.; Fairhurst, S.; Fan, X.; Fang, Q.; Farinon, S.; Farr, B.; Farr, W. M.; Favata, M.; Fays, M.; Fehrmann, H.; Fejer, M. M.; Ferrante, I.; Ferreira, E. C.; Ferrini, F.; Fidecaro, F.; Fiori, I.; Fiorucci, D.; Fisher, R. P.; Flaminio, R.; Fletcher, M.; Fotopoulos, N.; Fournier, J.-D.; Franco, S.; Frasca, S.; Frasconi, F.; Frei, M.; Frei, Z.; Freise, A.; Frey, R.; Frey, V.; Fricke, T. T.; Fritschel, P.; Frolov, V. V.; Fulda, P.; Fyffe, M.; Gabbard, H. A. G.; Gair, J. R.; Gammaitoni, L.; Gaonkar, S. G.; Garufi, F.; Gatto, A.; Gaur, G.; Gehrels, N.; Gemme, G.; Gendre, B.; Genin, E.; Gennai, A.; George, J.; Gergely, L.; Germain, V.; Ghosh, A.; Ghosh, S.; Giaime, J. A.; Giardina, K. D.; Giazotto, A.; Gill, K.; Glaefke, A.; Goetz, E.; Goetz, R.; Goggin, L. M.; Gondan, L.; González, G.; Gonzalez Castro, J. M.; Gopakumar, A.; Gordon, N. A.; Gorodetsky, M. L.; Gossan, S. E.; Gosselin, M.; Gouaty, R.; Graef, C.; Graff, P. B.; Granata, M.; Grant, A.; Gras, S.; Gray, C.; Greco, G.; Green, A. C.; Groot, P.; Grote, H.; Grunewald, S.; Guidi, G. M.; Guo, X.; Gupta, A.; Gupta, M. K.; Gushwa, K. E.; Gustafson, E. K.; Gustafson, R.; Hacker, J. J.; Hall, B. R.; Hall, E. D.; Hammond, G.; Haney, M.; Hanke, M. M.; Hanks, J.; Hanna, C.; Hannam, M. D.; Hanson, J.; Hardwick, T.; Harms, J.; Harry, G. M.; Harry, I. W.; Hart, M. J.; Hartman, M. T.; Haster, C.-J.; Haughian, K.; Heidmann, A.; Heintze, M. C.; Heitmann, H.; Hello, P.; Hemming, G.; Hendry, M.; Heng, I. S.; Hennig, J.; Heptonstall, A. W.; Heurs, M.; Hild, S.; Hoak, D.; Hodge, K. A.; Hofman, D.; Hollitt, S. E.; Holt, K.; Holz, D. E.; Hopkins, P.; Hosken, D. J.; Hough, J.; Houston, E. A.; Howell, E. J.; Hu, Y. M.; Huang, S.; Huerta, E. A.; Huet, D.; Hughey, B.; Husa, S.; Huttner, S. H.; Huynh-Dinh, T.; Idrisy, A.; Indik, N.; Ingram, D. R.; Inta, R.; Isa, H. N.; Isac, J.-M.; Isi, M.; Islas, G.; Isogai, T.; Iyer, B. R.; Izumi, K.; Jacqmin, T.; Jang, H.; Jani, K.; Jaranowski, P.; Jawahar, S.; Jiménez-Forteza, F.; Johnson, W. W.; Jones, D. I.; Jones, G.; Jones, R.; Jonker, R. J. G.; Ju, L.; Haris, K.; Kalaghatgi, C. V.; Kalogera, V.; Kandhasamy, S.; Kang, G.; Kanner, J. B.; Karki, S.; Kasprzack, M.; Katsavounidis, E.; Katzman, W.; Kaufer, S.; Kaur, T.; Kawabe, K.; Kawazoe, F.; Kéfélian, F.; Kehl, M. S.; Keitel, D.; Kelley, D. B.; Kells, W.; Keppel, D. G.; Kennedy, R.; Key, J. S.; Khalaidovski, A.; Khalili, F. Y.; Khan, I.; Khan, S.; Khan, Z.; Khazanov, E. A.; Kijbunchoo, N.; Kim, C.; Kim, J.; Kim, K.; Kim, Nam-Gyu; Kim, Namjun; Kim, Y.-M.; King, E. J.; King, P. J.; Kinzel, D. L.; Kissel, J. S.; Kleybolte, L.; Klimenko, S.; Koehlenbeck, S. M.; Kokeyama, K.; Koley, S.; Kondrashov, V.; Kontos, A.; Korobko, M.; Korth, W. Z.; Kowalska, I.; Kozak, D. B.; Kringel, V.; Krishnan, B.; Królak, A.; Krueger, C.; Kuehn, G.; Kumar, P.; Kuo, L.; Kutynia, A.; Lackey, B. D.; Landry, M.; Lange, J.; Lantz, B.; Lasky, P. D.; Lazzarini, A.; Lazzaro, C.; Leaci, P.; Leavey, S.; Lebigot, E. O.; Lee, C. H.; Lee, H. K.; Lee, H. M.; Lee, K.; Lenon, A.; Leonardi, M.; Leong, J. R.; Leroy, N.; Letendre, N.; Levin, Y.; Levine, B. M.; Li, T. G. F.; Libson, A.; Littenberg, T. B.; Lockerbie, N. A.; Logue, J.; Lombardi, A. L.; Lord, J. E.; Lorenzini, M.; Loriette, V.; Lormand, M.; Losurdo, G.; Lough, J. D.; Lück, H.; Lundgren, A. P.; Luo, J.; Lynch, R.; Ma, Y.; MacDonald, T.; Machenschalk, B.; MacInnis, M.; Macleod, D. M.; Magaña-Sandoval, F.; Magee, R. M.; Mageswaran, M.; Majorana, E.; Maksimovic, I.; Malvezzi, V.; Man, N.; Mandel, I.; Mandic, V.; Mangano, V.; Mansell, G. L.; Manske, M.; Mantovani, M.; Marchesoni, F.; Marion, F.; Márka, S.; Márka, Z.; Markosyan, A. S.; Maros, E.; Martelli, F.; Martellini, L.; Martin, I. W.; Martin, R. M.; Martynov, D. V.; Marx, J. N.; Mason, K.; Masserot, A.; Massinger, T. J.; Masso-Reid, M.; Matichard, F.; Matone, L.; Mavalvala, N.; Mazumder, N.; Mazzolo, G.; McCarthy, R.; McClelland, D. E.; McCormick, S.; McGuire, S. C.; McIntyre, G.; McIver, J.; McKechan, D. J. A.; McManus, D. J.; McWilliams, S. T.; Meacher, D.; Meadors, G. D.; Meidam, J.; Melatos, A.; Mendell, G.; Mendoza-Gandara, D.; Mercer, R. A.; Merilh, E.; Merzougui, M.; Meshkov, S.; Messaritaki, E.; Messenger, C.; Messick, C.; Meyers, P. M.; Mezzani, F.; Miao, H.; Michel, C.; Middleton, H.; Mikhailov, E. E.; Milano, L.; Miller, J.; Millhouse, M.; Minenkov, Y.; Ming, J.; Mirshekari, S.; Mishra, C.; Mitra, S.; Mitrofanov, V. P.; Mitselmakher, G.; Mittleman, R.; Moggi, A.; Mohan, M.; Mohapatra, S. R. P.; Montani, M.; Moore, B. C.; Moore, C. J.; Moraru, D.; Moreno, G.; Morriss, S. R.; Mossavi, K.; Mours, B.; Mow-Lowry, C. M.; Mueller, C. L.; Mueller, G.; Muir, A. W.; Mukherjee, Arunava; Mukherjee, D.; Mukherjee, S.; Mukund, N.; Mullavey, A.; Munch, J.; Murphy, D. J.; Murray, P. G.; Mytidis, A.; Nardecchia, I.; Naticchioni, L.; Nayak, R. K.; Necula, V.; Nedkova, K.; Nelemans, G.; Neri, M.; Neunzert, A.; Newton, G.; Nguyen, T. T.; Nielsen, A. B.; Nissanke, S.; Nitz, A.; Nocera, F.; Nolting, D.; Normandin, M. E.; Nuttall, L. K.; Oberling, J.; Ochsner, E.; O'Dell, J.; Oelker, E.; Ogin, G. H.; Oh, J. J.; Oh, S. H.; Ohme, F.; Oliver, M.; Oppermann, P.; Oram, Richard J.; O'Reilly, B.; O'Shaughnessy, R.; Ottaway, D. J.; Ottens, R. S.; Overmier, H.; Owen, B. J.; Pai, A.; Pai, S. A.; Palamos, J. R.; Palashov, O.; Palomba, C.; Pal-Singh, A.; Pan, H.; Pan, Y.; Pankow, C.; Pannarale, F.; Pant, B. C.; Paoletti, F.; Paoli, A.; Papa, M. A.; Paris, H. R.; Parker, W.; Pascucci, D.; Pasqualetti, A.; Passaquieti, R.; Passuello, D.; Patricelli, B.; Patrick, Z.; Pearlstone, B. L.; Pedraza, M.; Pedurand, R.; Pekowsky, L.; Pele, A.; Penn, S.; Perreca, A.; Phelps, M.; Piccinni, O.; Pichot, M.; Piergiovanni, F.; Pierro, V.; Pillant, G.; Pinard, L.; Pinto, I. M.; Pitkin, M.; Poggiani, R.; Popolizio, P.; Post, A.; Powell, J.; Prasad, J.; Predoi, V.; Premachandra, S. S.; Prestegard, T.; Price, L. R.; Prijatelj, M.; Principe, M.; Privitera, S.; Prodi, G. A.; Prokhorov, L.; Puncken, O.; Punturo, M.; Puppo, P.; Pürrer, M.; Qi, H.; Qin, J.; Quetschke, V.; Quintero, E. A.; Quitzow-James, R.; Raab, F. J.; Rabeling, D. S.; Radkins, H.; Raffai, P.; Raja, S.; Rakhmanov, M.; Rapagnani, P.; Raymond, V.; Razzano, M.; Re, V.; Read, J.; Reed, C. M.; Regimbau, T.; Rei, L.; Reid, S.; Reitze, D. H.; Rew, H.; Reyes, S. D.; Ricci, F.; Riles, K.; Robertson, N. A.; Robie, R.; Robinet, F.; Robinson, C.; Rocchi, A.; Rodriguez, A. C.; Rolland, L.; Rollins, J. G.; Roma, V. J.; Romano, R.; Romanov, G.; Romie, J. H.; Rosińska, D.; Rowan, S.; Rüdiger, A.; Ruggi, P.; Ryan, K.; Sachdev, S.; Sadecki, T.; Sadeghian, L.; Salconi, L.; Saleem, M.; Salemi, F.; Samajdar, A.; Sammut, L.; Sanchez, E. J.; Sandberg, V.; Sandeen, B.; Sanders, J. R.; Santamaría, L.; Sassolas, B.; Sathyaprakash, B. S.; Saulson, P. R.; Sauter, O.; Savage, R. L.; Sawadsky, A.; Schale, P.; Schilling, R.; Schmidt, J.; Schmidt, P.; Schnabel, R.; Schofield, R. M. S.; Schönbeck, A.; Schreiber, E.; Schuette, D.; Schutz, B. F.; Scott, J.; Scott, S. M.; Sellers, D.; Sengupta, A. S.; Sentenac, D.; Sequino, V.; Sergeev, A.; Serna, G.; Setyawati, Y.; Sevigny, A.; Shaddock, D. A.; Shah, S.; Shahriar, M. S.; Shaltev, M.; Shao, Z.; Shapiro, B.; Shawhan, P.; Sheperd, A.; Shoemaker, D. H.; Shoemaker, D. M.; Siellez, K.; Siemens, X.; Sigg, D.; Silva, A. D.; Simakov, D.; Singer, A.; Singer, L. P.; Singh, A.; Singh, R.; Singhal, A.; Sintes, A. M.; Slagmolen, B. J. J.; Smith, J. R.; Smith, N. D.; Smith, R. J. E.; Son, E. J.; Sorazu, B.; Sorrentino, F.; Souradeep, T.; Srivastava, A. K.; Staley, A.; Steinke, M.; Steinlechner, J.; Steinlechner, S.; Steinmeyer, D.; Stephens, B. C.; Stone, R.; Strain, K. A.; Straniero, N.; Stratta, G.; Strauss, N. A.; Strigin, S.; Sturani, R.; Stuver, A. L.; Summerscales, T. Z.; Sun, L.; Sutton, P. J.; Swinkels, B. L.; Szczepańczyk, M. J.; Tacca, M.; Talukder, D.; Tanner, D. B.; Tápai, M.; Tarabrin, S. P.; Taracchini, A.; Taylor, R.; Theeg, T.; Thirugnanasambandam, M. P.; Thomas, E. G.; Thomas, M.; Thomas, P.; Thorne, K. A.; Thorne, K. S.; Thrane, E.; Tiwari, S.; Tiwari, V.; Tokmakov, K. V.; Tomlinson, C.; Tonelli, M.; Torres, C. V.; Torrie, C. I.; Töyrä, D.; Travasso, F.; Traylor, G.; Trifirò, D.; Tringali, M. C.; Trozzo, L.; Tse, M.; Turconi, M.; Tuyenbayev, D.; Ugolini, D.; Unnikrishnan, C. S.; Urban, A. L.; Usman, S. A.; Vahlbruch, H.; Vajente, G.; Valdes, G.; van Bakel, N.; van Beuzekom, M.; van den Brand, J. F. J.; Van Den Broeck, C.; Vander-Hyde, D. C.; van der Schaaf, L.; van Heijningen, J. V.; van Veggel, A. A.; Vardaro, M.; Vass, S.; Vasúth, M.; Vaulin, R.; Vecchio, A.; Vedovato, G.; Veitch, J.; Veitch, P. J.; Venkateswara, K.; Verkindt, D.; Vetrano, F.; Viceré, A.; Vinciguerra, S.; Vine, D. J.; Vinet, J.-Y.; Vitale, S.; Vo, T.; Vocca, H.; Vorvick, C.; Voss, D.; Vousden, W. D.; Vyatchanin, S. P.; Wade, A. R.; Wade, L. E.; Wade, M.; Walker, M.; Wallace, L.; Walsh, S.; Wang, G.; Wang, H.; Wang, M.; Wang, X.; Wang, Y.; Ward, R. L.; Warner, J.; Was, M.; Weaver, B.; Wei, L.-W.; Weinert, M.; Weinstein, A. J.; Weiss, R.; Welborn, T.; Wen, L.; Weßels, P.; West, M.; Westphal, T.; Wette, K.; Whelan, J. T.; White, D. J.; Whiting, B. F.; Wiesner, K.; Williams, R. D.; Williamson, A. R.; Willis, J. L.; Willke, B.; Wimmer, M. H.; Winkler, W.; Wipf, C. C.; Wiseman, A. G.; Wittel, H.; Woan, G.; Worden, J.; Wright, J. L.; Wu, G.; Yablon, J.; Yam, W.; Yamamoto, H.; Yancey, C. C.; Yap, M. J.; Yu, H.; Yvert, M.; ZadroŻny, A.; Zangrando, L.; Zanolin, M.; Zendri, J.-P.; Zevin, M.; Zhang, F.; Zhang, L.; Zhang, M.; Zhang, Y.; Zhao, C.; Zhou, M.; Zhou, Z.; Zhu, X. J.; Zucker, M. E.; Zuraw, S. E.; Zweizig, J.; LIGO Scientific Collaboration; Virgo Collaboration

    2016-06-01

    On September 14, 2015, at 09∶50:45 UTC the two detectors of the Laser Interferometer Gravitational-Wave Observatory (LIGO) simultaneously observed the binary black hole merger GW150914. We report the results of a matched-filter search using relativistic models of compact-object binaries that recovered GW150914 as the most significant event during the coincident observations between the two LIGO detectors from September 12 to October 20, 2015 GW150914 was observed with a matched-filter signal-to-noise ratio of 24 and a false alarm rate estimated to be less than 1 event per 203000 years, equivalent to a significance greater than 5.1 σ .

  4. Hide and vanish: data sets where the most parsimonious tree is known but hard to find, and their implications for tree search methods.

    PubMed

    Goloboff, Pablo A

    2014-10-01

    Three different types of data sets, for which the uniquely most parsimonious tree can be known exactly but is hard to find with heuristic tree search methods, are studied. Tree searches are complicated more by the shape of the tree landscape (i.e. the distribution of homoplasy on different trees) than by the sheer abundance of homoplasy or character conflict. Data sets of Type 1 are those constructed by Radel et al. (2013). Data sets of Type 2 present a very rugged landscape, with narrow peaks and valleys, but relatively low amounts of homoplasy. For such a tree landscape, subjecting the trees to TBR and saving suboptimal trees produces much better results when the sequence of clipping for the tree branches is randomized instead of fixed. An unexpected finding for data sets of Types 1 and 2 is that starting a search from a random tree instead of a random addition sequence Wagner tree may increase the probability that the search finds the most parsimonious tree; a small artificial example where these probabilities can be calculated exactly is presented. Data sets of Type 3, the most difficult data sets studied here, comprise only congruent characters, and a single island with only one most parsimonious tree. Even if there is a single island, missing entries create a very flat landscape which is difficult to traverse with tree search algorithms because the number of equally parsimonious trees that need to be saved and swapped to effectively move around the plateaus is too large. Minor modifications of the parameters of tree drifting, ratchet, and sectorial searches allow travelling around these plateaus much more efficiently than saving and swapping large numbers of equally parsimonious trees with TBR. For these data sets, two new related criteria for selecting taxon addition sequences in Wagner trees (the "selected" and "informative" addition sequences) produce much better results than the standard random or closest addition sequences. These new methods for Wagner

  5. Steganography in clustered-dot halftones using orientation modulation and modification of direct binary search

    NASA Astrophysics Data System (ADS)

    Chen, Yung-Yao; Hong, Sheng-Yi; Chen, Kai-Wen

    2015-03-01

    This paper proposes a novel message-embedded halftoning scheme that is based on orientation modulation (OM) encoding. To achieve high image quality, we employ a human visual system (HVS)-based error metric between the continuous-tone image and a data-embedded halftone, and integrate a modified direct binary search (DBS) framework into the proposed message-embedded halftoning method. The modified DBS framework ensures that the resulting data-embedded halftones have optimal image quality from the viewpoint of the HVS.

  6. B-tree search reinforcement learning for model based intelligent agent

    NASA Astrophysics Data System (ADS)

    Bhuvaneswari, S.; Vignashwaran, R.

    2013-03-01

    Agents trained by learning techniques provide a powerful approximation of active solutions for naive approaches. In this study using B - Trees implying reinforced learning the data search for information retrieval is moderated to achieve accuracy with minimum search time. The impact of variables and tactics applied in training are determined using reinforcement learning. Agents based on these techniques perform satisfactory baseline and act as finite agents based on the predetermined model against competitors from the course.

  7. Search of S3 LIGO data for gravitational wave signals from spinning black hole and neutron star binary inspirals

    NASA Astrophysics Data System (ADS)

    Abbott, B.; Abbott, R.; Adhikari, R.; Agresti, J.; Ajith, P.; Allen, B.; Amin, R.; Anderson, S. B.; Anderson, W. G.; Arain, M.; Araya, M.; Armandula, H.; Ashley, M.; Aston, S.; Aufmuth, P.; Aulbert, C.; Babak, S.; Ballmer, S.; Bantilan, H.; Barish, B. C.; Barker, C.; Barker, D.; Barr, B.; Barriga, P.; Barton, M. A.; Bayer, K.; Betzwieser, J.; Beyersdorf, P. T.; Bhawal, B.; Bilenko, I. A.; Billingsley, G.; Biswas, R.; Black, E.; Blackburn, K.; Blackburn, L.; Blair, D.; Bland, B.; Bogenstahl, J.; Bogue, L.; Bork, R.; Boschi, V.; Bose, S.; Brady, P. R.; Braginsky, V. B.; Brau, J. E.; Brinkmann, M.; Brooks, A.; Brown, D. A.; Bullington, A.; Bunkowski, A.; Buonanno, A.; Burmeister, O.; Busby, D.; Byer, R. L.; Cadonati, L.; Cagnoli, G.; Camp, J. B.; Cannizzo, J.; Cannon, K.; Cantley, C. A.; Cao, J.; Cardenas, L.; Castaldi, G.; Cepeda, C.; Chalkley, E.; Charlton, P.; Chatterji, S.; Chelkowski, S.; Chen, Y.; Chiadini, F.; Christensen, N.; Clark, J.; Cochrane, P.; Cokelaer, T.; Coldwell, R.; Conte, R.; Cook, D.; Corbitt, T.; Coyne, D.; Creighton, J. D. E.; Croce, R. P.; Crooks, D. R. M.; Cruise, A. M.; Cumming, A.; Dalrymple, J.; D'Ambrosio, E.; Danzmann, K.; Davies, G.; Debra, D.; Degallaix, J.; Degree, M.; Demma, T.; Dergachev, V.; Desai, S.; Desalvo, R.; Dhurandhar, S.; Díaz, M.; Dickson, J.; di Credico, A.; Diederichs, G.; Dietz, A.; Doomes, E. E.; Drever, R. W. P.; Dumas, J.-C.; Dupuis, R. J.; Dwyer, J. G.; Ehrens, P.; Espinoza, E.; Etzel, T.; Evans, M.; Evans, T.; Fairhurst, S.; Fan, Y.; Fazi, D.; Fejer, M. M.; Finn, L. S.; Fiumara, V.; Fotopoulos, N.; Franzen, A.; Franzen, K. Y.; Freise, A.; Frey, R.; Fricke, T.; Fritschel, P.; Frolov, V. V.; Fyffe, M.; Galdi, V.; Garofoli, J.; Gholami, I.; Giaime, J. A.; Giampanis, S.; Giardina, K. D.; Goda, K.; Goetz, E.; Goggin, L. M.; González, G.; Gossler, S.; Grant, A.; Gras, S.; Gray, C.; Gray, M.; Greenhalgh, J.; Gretarsson, A. M.; Grosso, R.; Grote, H.; Grunewald, S.; Guenther, M.; Gustafson, R.; Hage, B.; Hammer, D.; Hanna, C.; Hanson, J.; Harms, J.; Harry, G.; Harstad, E.; Hayler, T.; Heefner, J.; Heng, I. S.; Heptonstall, A.; Heurs, M.; Hewitson, M.; Hild, S.; Hirose, E.; Hoak, D.; Hosken, D.; Hough, J.; Hoyland, D.; Huttner, S. H.; Ingram, D.; Innerhofer, E.; Ito, M.; Itoh, Y.; Ivanov, A.; Johnson, B.; Johnson, W. W.; Jones, D. I.; Jones, G.; Jones, R.; Ju, L.; Kalmus, P.; Kalogera, V.; Kasprzyk, D.; Katsavounidis, E.; Kawabe, K.; Kawamura, S.; Kawazoe, F.; Kells, W.; Keppel, D. G.; Khalili, F. Ya.; Kim, C.; King, P.; Kissel, J. S.; Klimenko, S.; Kokeyama, K.; Kondrashov, V.; Kopparapu, R. K.; Kozak, D.; Krishnan, B.; Kwee, P.; Lam, P. K.; Landry, M.; Lantz, B.; Lazzarini, A.; Lei, M.; Leiner, J.; Leonhardt, V.; Leonor, I.; Libbrecht, K.; Lindquist, P.; Lockerbie, N. A.; Longo, M.; Lormand, M.; Lubiński, M.; Lück, H.; Machenschalk, B.; Macinnis, M.; Mageswaran, M.; Mailand, K.; Malec, M.; Mandic, V.; Marano, S.; Márka, S.; Markowitz, J.; Maros, E.; Martin, I.; Marx, J. N.; Mason, K.; Matone, L.; Matta, V.; Mavalvala, N.; McCarthy, R.; McClelland, D. E.; McGuire, S. C.; McHugh, M.; McKenzie, K.; McWilliams, S.; Meier, T.; Melissinos, A.; Mendell, G.; Mercer, R. A.; Meshkov, S.; Messaritaki, E.; Messenger, C. J.; Meyers, D.; Mikhailov, E.; Mitra, S.; Mitrofanov, V. P.; Mitselmakher, G.; Mittleman, R.; Miyakawa, O.; Mohanty, S.; Moreno, G.; Mossavi, K.; Mowlowry, C.; Moylan, A.; Mudge, D.; Mueller, G.; Mukherjee, S.; Müller-Ebhardt, H.; Munch, J.; Murray, P.; Myers, E.; Myers, J.; Nash, T.; Newton, G.; Nishizawa, A.; Numata, K.; O'Reilly, B.; O'Shaughnessy, R.; Ottaway, D. J.; Overmier, H.; Owen, B. J.; Pan, Y.; Papa, M. A.; Parameshwaraiah, V.; Patel, P.; Pedraza, M.; Penn, S.; Pierro, V.; Pinto, I. M.; Pitkin, M.; Pletsch, H.; Plissi, M. V.; Postiglione, F.; Prix, R.; Quetschke, V.; Raab, F.; Rabeling, D.; Radkins, H.; Rahkola, R.; Rainer, N.; Rakhmanov, M.; Ramsunder, M.; Ray-Majumder, S.; Re, V.; Rehbein, H.; Reid, S.; Reitze, D. H.; Ribichini, L.; Riesen, R.; Riles, K.; Rivera, B.; Robertson, N. A.; Robinson, C.; Robinson, E. L.; Roddy, S.; Rodriguez, A.; Rogan, A. M.; Rollins, J.; Romano, J. D.; Romie, J.; Route, R.; Rowan, S.; Rüdiger, A.; Ruet, L.; Russell, P.; Ryan, K.; Sakata, S.; Samidi, M.; Sancho de La Jordana, L.; Sandberg, V.; Sannibale, V.; Saraf, S.; Sarin, P.; Sathyaprakash, B. S.; Sato, S.; Saulson, P. R.; Savage, R.; Savov, P.; Schediwy, S.; Schilling, R.; Schnabel, R.; Schofield, R.; Schutz, B. F.; Schwinberg, P.; Scott, S. M.; Searle, A. C.; Sears, B.; Seifert, F.; Sellers, D.; Sengupta, A. S.; Shawhan, P.; Shoemaker, D. H.; Sibley, A.; Sidles, J. A.; Siemens, X.; Sigg, D.; Sinha, S.; Sintes, A. M.; Slagmolen, B. J. J.; Slutsky, J.; Smith, J. R.; Smith, M. R.; Somiya, K.; Strain, K. A.; Strom, D. M.; Stuver, A.; Summerscales, T. Z.; Sun, K.-X.; Sung, M.; Sutton, P. J.; Takahashi, H.; Tanner, D. B.; Taylor, R.; Taylor, R.; Thacker, J.; Thorne, K. A.; Thorne, K. S.; Thüring, A.; Tokmakov, K. V.; Torres, C.; Torrie, C.; Traylor, G.; Trias, M.; Tyler, W.; Ugolini, D.; Urbanek, K.; Vahlbruch, H.; Vallisneri, M.; van den Broeck, C.; Varvella, M.; Vass, S.; Vecchio, A.; Veitch, J.; Veitch, P.; Villar, A.; Vorvick, C.; Vyachanin, S. P.; Waldman, S. J.; Wallace, L.; Ward, H.; Ward, R.; Watts, K.; Weidner, A.; Weinert, M.; Weinstein, A.; Weiss, R.; Wen, S.; Wette, K.; Whelan, J. T.; Whitcomb, S. E.; Whiting, B. F.; Wilkinson, C.; Willems, P. A.; Williams, L.; Willke, B.; Wilmut, I.; Winkler, W.; Wipf, C. C.; Wise, S.; Wiseman, A. G.; Woan, G.; Woods, D.; Wooley, R.; Worden, J.; Wu, W.; Yakushin, I.; Yamamoto, H.; Yan, Z.; Yoshida, S.; Yunes, N.; Zanolin, M.; Zhang, J.; Zhang, L.; Zhao, C.; Zotov, N.; Zucker, M.; Zur Mühlen, H.; Zweizig, J.

    2008-08-01

    We report on the methods and results of the first dedicated search for gravitational waves emitted during the inspiral of compact binaries with spinning component bodies. We analyze 788 hours of data collected during the third science run (S3) of the LIGO detectors. We searched for binary systems using a detection template family specially designed to capture the effects of the spin-induced precession of the orbital plane. We present details of the techniques developed to enable this search for spin-modulated gravitational waves, highlighting the differences between this and other recent searches for binaries with nonspinning components. The template bank we employed was found to yield high matches with our spin-modulated target waveform for binaries with masses in the asymmetric range 1.0M⊙search of S3 LIGO data has good sensitivity to binaries in the Milky Way and to a small fraction of binaries in M31 and M33 with masses in the range 1.0M⊙search. Assuming a binary population with spinning components and Gaussian distribution of masses representing a prototypical neutron star black hole system with m1≃1.35M⊙ and m2≃5M⊙, we calculate the 90%-confidence upper limit on the rate of coalescence of these systems to be 15.9yr-1L10-1, where L10 is 1010 times the blue light luminosity of the Sun.

  8. Improving the sensitivity of searches for gravitational waves from compact binary coalescences

    NASA Astrophysics Data System (ADS)

    MacLeod, Duncan

    The detection of gravitational waves from the coalescence of two compact objects has been brought to within touching distance by the construction and operation of a global network of laser-interferometer detectors. However, the amplitude of the radiation from these events is so low that direct detection will require the combined innovations of advanced interferometry and detector characterisation, along with powerful methods of extracting weak, but modelled, signals from the background detector noise. This work focuses on enhancing the probability of such detection through improved identification of noise artefacts in the instrumental data, and improved signal processing and extraction. We begin with a recap of the theory of gravitational waves as derived from Einstein's theory of gravity, and the mechanisms that allow propagation of this radiation away from a source. We also catalogue a number of promising astrophysical progenitors, with a focus on compact binary coalescences. We detail the interactions between gravitational waves and an observer, and describe the layout of the large-scale laser interferometers that have been built to enable direct detection. A description of the operation of these detectors during the last science run is given, focusing on their stability and sensitivity, isolating a number of key instrumental noise mechanisms and how they affected astrophysical searches over the data. Additionally, we illustrate a new method to improve the identification of seismic noise bursts, allowing their removal from search data, improving search sensitivity. The LIGO and Virgo gravitational-wave detectors operated as a network during the last joint science run. A summary is given of the analysis pipeline used to search for gravitational waves signals from compact binary coalescences using a coincidence-based method, including details of the results of that analysis. Details are also given of the pipeline used to search for gravitational waves associated

  9. D Nearest Neighbour Search Using a Clustered Hierarchical Tree Structure

    NASA Astrophysics Data System (ADS)

    Suhaibah, A.; Uznir, U.; Anton, F.; Mioc, D.; Rahman, A. A.

    2016-06-01

    Locating and analysing the location of new stores or outlets is one of the common issues facing retailers and franchisers. This is due to assure that new opening stores are at their strategic location to attract the highest possible number of customers. Spatial information is used to manage, maintain and analyse these store locations. However, since the business of franchising and chain stores in urban areas runs within high rise multi-level buildings, a three-dimensional (3D) method is prominently required in order to locate and identify the surrounding information such as at which level of the franchise unit will be located or is the franchise unit located is at the best level for visibility purposes. One of the common used analyses used for retrieving the surrounding information is Nearest Neighbour (NN) analysis. It uses a point location and identifies the surrounding neighbours. However, with the immense number of urban datasets, the retrieval and analysis of nearest neighbour information and their efficiency will become more complex and crucial. In this paper, we present a technique to retrieve nearest neighbour information in 3D space using a clustered hierarchical tree structure. Based on our findings, the proposed approach substantially showed an improvement of response time analysis compared to existing approaches of spatial access methods in databases. The query performance was tested using a dataset consisting of 500,000 point locations building and franchising unit. The results are presented in this paper. Another advantage of this structure is that it also offers a minimal overlap and coverage among nodes which can reduce repetitive data entry.

  10. Directed searches for continuous gravitational waves from spinning neutron stars in binary systems

    NASA Astrophysics Data System (ADS)

    Meadors, Grant David

    2014-09-01

    Gravitational wave detectors such as the Laser Interferometer Gravitational-wave Observatory (LIGO) seek to observe ripples in space predicted by General Relativity. Black holes, neutron stars, supernovae, the Big Bang and other sources can radiate gravitational waves. Original contributions to the LIGO effort are presented in this thesis: feedforward filtering, directed binary neutron star searches for continuous waves, and scientific outreach and education, as well as advances in quantum optical squeezing. Feedforward filtering removes extraneous noise from servo-controlled instruments. Filtering of the last science run, S6, improves LIGO's astrophysical range (+4.14% H1, +3.60% L1: +12% volume) after subtracting noise from auxiliary length control channels. This thesis shows how filtering enhances the scientific sensitivity of LIGO's data set during and after S6. Techniques for non-stationarity and verifying calibration and integrity may apply to Advanced LIGO. Squeezing is planned for future interferometers to exceed the standard quantum limit on noise from electromagnetic vacuum fluctuations; this thesis discusses the integration of a prototype squeezer at LIGO Hanford Observatory and impact on astrophysical sensitivity. Continuous gravitational waves may be emitted by neutron stars in low-mass X-ray binary systems such as Scorpius X-1. The TwoSpect directed binary search is designed to detect these waves. TwoSpect is the most sensitive of 4 methods in simulated data, projecting an upper limit of 4.23e-25 in strain, given a year-long data set at an Advanced LIGO design sensitivity of 4e-24 Hz. (-1/2). TwoSpect is also used on real S6 data to set 95% confidence upper limits (40 Hz to 2040 Hz) on strain from Scorpius X-1. A millisecond pulsar, X-ray transient J1751-305, is similarly considered. Search enhancements for Advanced LIGO are proposed. Advanced LIGO and fellow interferometers should detect gravitational waves in the coming decade. Methods in these

  11. A SEARCH FOR SEPARATED FRINGE PACKET BINARIES USING THE CHARA ARRAY

    SciTech Connect

    Raghavan, Deepak; McAlister, Harold A.; Farrington, Chris D.; Ten Brummelaar, Theo A.; Sturmann, Laszlo; Sturmann, Judit; Turner, Nils H.; Ridgway, Stephen T.

    2012-01-20

    We present the results of a comprehensive search for new companions to nearby solar-type stars using the separated fringe packet (SFP) technique at the Center for High Angular Resolution Astronomy (CHARA) Array. Our search included 636 observations of 186 stars, searching for companions with separations of approximately 8-80 mas and moderate brightness ratios ({Delta}K {approx}< 1.5). This survey was undertaken to support a comprehensive assessment of companions to solar-type stars within 25 pc. We detected separated fringe companions to two stars (HD 3196 and 79096) and found faint companion signatures to two more stars (HD 98231 and 137763). All of these companions are previously known by spectroscopic methods, and three of them have speckle interferometric observations as well. The faint companion seen to HD 98231 represents the first visual detection of this spectroscopic companion. Our null detection for new companions implies that the presumed gap between spectroscopic and visual techniques has largely been filled for nearby solar-type stars, thanks to systematic radial-velocity observations over multiple decades and a thorough coverage using visual techniques, especially speckle interferometric observations. We also generate simulated fringe packets to derive detection limits for SFP binaries using the CHARA Array.

  12. Hybrid Binary Imperialist Competition Algorithm and Tabu Search Approach for Feature Selection Using Gene Expression Data.

    PubMed

    Wang, Shuaiqun; Aorigele; Kong, Wei; Zeng, Weiming; Hong, Xiaomin

    2016-01-01

    Gene expression data composed of thousands of genes play an important role in classification platforms and disease diagnosis. Hence, it is vital to select a small subset of salient features over a large number of gene expression data. Lately, many researchers devote themselves to feature selection using diverse computational intelligence methods. However, in the progress of selecting informative genes, many computational methods face difficulties in selecting small subsets for cancer classification due to the huge number of genes (high dimension) compared to the small number of samples, noisy genes, and irrelevant genes. In this paper, we propose a new hybrid algorithm HICATS incorporating imperialist competition algorithm (ICA) which performs global search and tabu search (TS) that conducts fine-tuned search. In order to verify the performance of the proposed algorithm HICATS, we have tested it on 10 well-known benchmark gene expression classification datasets with dimensions varying from 2308 to 12600. The performance of our proposed method proved to be superior to other related works including the conventional version of binary optimization algorithm in terms of classification accuracy and the number of selected genes.

  13. Binary and nonbinary description of hypointensity for search and retrieval of brain MR images

    NASA Astrophysics Data System (ADS)

    Unay, Devrim; Chen, Xiaojing; Ercil, Aytul; Cetin, Mujdat; Jasinschi, Radu; van Buchem, Marc A.; Ekin, Ahmet

    2009-01-01

    Diagnosis accuracy in the medical field, is mainly affected by either lack of sufficient understanding of some diseases or the inter/intra-observer variability of the diagnoses. We believe that mining of large medical databases can help improve the current status of disease understanding and decision making. In a previous study based on binary description of hypointensity in the brain, it was shown that brain iron accumulation shape provides additional information to the shape-insensitive features, such as the total brain iron load, that are commonly used in clinics. This paper proposes a novel, nonbinary description of hypointensity in the brain based on principal component analysis. We compare the complementary and redundant information provided by the two descriptions using Kendall's rank correlation coefficient in order to better understand the individual descriptions of iron accumulation in the brain and obtain a more robust and accurate search and retrieval system.

  14. VR-BFDT: A variance reduction based binary fuzzy decision tree induction method for protein function prediction.

    PubMed

    Golzari, Fahimeh; Jalili, Saeed

    2015-07-21

    In protein function prediction (PFP) problem, the goal is to predict function of numerous well-sequenced known proteins whose function is not still known precisely. PFP is one of the special and complex problems in machine learning domain in which a protein (regarded as instance) may have more than one function simultaneously. Furthermore, the functions (regarded as classes) are dependent and also are organized in a hierarchical structure in the form of a tree or directed acyclic graph. One of the common learning methods proposed for solving this problem is decision trees in which, by partitioning data into sharp boundaries sets, small changes in the attribute values of a new instance may cause incorrect change in predicted label of the instance and finally misclassification. In this paper, a Variance Reduction based Binary Fuzzy Decision Tree (VR-BFDT) algorithm is proposed to predict functions of the proteins. This algorithm just fuzzifies the decision boundaries instead of converting the numeric attributes into fuzzy linguistic terms. It has the ability of assigning multiple functions to each protein simultaneously and preserves the hierarchy consistency between functional classes. It uses the label variance reduction as splitting criterion to select the best "attribute-value" at each node of the decision tree. The experimental results show that the overall performance of the proposed algorithm is promising.

  15. How tree shrews (Tupaia belangeri) perform in a searching task: evidence for strategy use.

    PubMed

    Bartolomucci, A; de Biurrun, G; Fuchs, E

    2001-12-01

    This study investigated how male tree shrews (Tupaia belangen) performed in a searching task while in their home cages and assessed whether different food distributions affected their performance. The animals were faced with a holeboard containing 9 food sources arranged in a 3 x 3 matrix or in 3 clusters, each containing 3 sources. Animals tended to start and end the trials from preferred locations, thereafter solving the task by strategically organizing the reward collection according to a minimum-distance principle. In the cluster configuration, they visited the sources hierarchically. Food distribution did not affect the performance. Comparison with data from mice and capuchin monkeys revealed that tree shrews and capuchins solved the task in a similar strategic way, whereas mice did not. These findings attract particular attention because of the phylogenetic position of tree shrews, which are regarded as closely related to primates.

  16. Grid search in stellar parameters: a software for spectrum analysis of single stars and binary systems

    NASA Astrophysics Data System (ADS)

    Tkachenko, A.

    2015-09-01

    Context. The currently operating space missions, as well as those that will be launched in the near future, will deliver high-quality data for millions of stellar objects. Since the majority of stellar astrophysical applications still (at least partly) rely on spectroscopic data, an efficient tool for the analysis of medium- to high-resolution spectroscopy is needed. Aims: We aim at developing an efficient software package for the analysis of medium- to high-resolution spectroscopy of single stars and those in binary systems. The major requirements are that the code should have a high performance, represent the state-of-the-art analysis tool, and provide accurate determinations of atmospheric parameters and chemical compositions for different types of stars. Methods: We use the method of atmosphere models and spectrum synthesis, which is one of the most commonly used approaches for the analysis of stellar spectra. Our Grid Search in Stellar Parameters (gssp) code makes use of the Message Passing Interface (OpenMPI) implementation, which makes it possible to run in parallel mode. The method is first tested on the simulated data and is then applied to the spectra of real stellar objects. Results: The majority of test runs on the simulated data were successful in that we were able to recover the initially assumed sets of atmospheric parameters. We experimentally find the limits in signal-to-noise ratios of the input spectra, below which the final set of parameters is significantly affected by the noise. Application of the gssp package to the spectra of three Kepler stars, KIC 11285625, KIC 6352430, and KIC 4931738, was also largely successful. We found an overall agreement of the final sets of the fundamental parameters with the original studies. For KIC 6352430, we found that dependence of the light dilution factor on wavelength cannot be ignored, as it has a significant impact on the determination of the atmospheric parameters of this binary system. Conclusions: The

  17. Breadth-first search approach to enumeration of tree-like chemical compounds.

    PubMed

    Zhao, Yang; Hayashida, Morihiro; Jindalertudomdee, Jira; Nagamochi, Hiroshi; Akutsu, Tatsuya

    2013-12-01

    Molecular enumeration plays a basic role in the design of drugs, which has been studied by mathematicians, computer scientists, and chemists for quite a long time. Although many researchers are involved in developing enumeration algorithms specific to drug design systems, molecular enumeration is still a hard problem to date due to its exponentially increasing large search space with larger number of atoms. To alleviate this defect, we propose efficient algorithms, BfsSimEnum and BfsMulEnum to enumerate tree-like molecules without and with multiple bonds, respectively, where chemical compounds are represented as molecular graphs. In order to reduce the large search space, we adjust some important concepts such as left-heavy, center-rooted, and normal form to molecular tree graphs. Different from many existing approaches, BfsSimEnum and BfsMulEnum firstly enumerate tree-like compounds by breadth-first search order. Computational experiments are performed to compare with several existing methods. The results suggest that our proposed methods are exact and more efficient.

  18. Sco X-1 in LIGO: directed searches for continuous gravitational waves from neutron stars in binary systems

    NASA Astrophysics Data System (ADS)

    Meadors, Grant; Goetz, Evan; Riles, Keith

    2014-03-01

    Scorpius X-1 and similar low-mass X-ray binary (LMXB) systems with neutron stars contain favorable conditions for the emission of continuous gravitational waves (GW). Companion star accretion is believed to recycle the neutron star, spinning it up to high rotational speeds. That accretion could also induce non-axisymmetries in the neutron star, leading to detectable GW emission. Advanced LIGO and other 2nd-generation interferometric observatories will permit searches for such gravitational waves using new algorithms, including the TwoSpect program, which was developed originally for all-sky binary searches. In this presentation we discuss an implementation of TwoSpect using fine templates in parameter space at the initial stage and optimized to search for LMXBs, such as Sco X-1, where some of the orbital parameters are known. Results from simulations will be shown.

  19. Search for Gravitational Waves from Compact Binary Coalescence in LIGO and Virgo Data from S5 and VSR1

    NASA Technical Reports Server (NTRS)

    Abadie, J.; Abbott, B. P.; Abbott, R.; Accadia, T.; Acernese, F.; Adams, C.; Adhikari, R.; Ajith, P.; Allen, B.; Allen, G.; Ceron, E. Amador; Amin, R. S.; Anderson, S. B.; Anderson, W. G.; Antonucci, F.; Arain, M. A.; Araya, M.; Aronsson, M.; Arun, K. G.; Aso, Y.; Aston, S.; Astone, P.; Atkinson, D. E.; Camp, J. B.; Cannizzo, J.

    2010-01-01

    We report the results of the first search for gravitational waves from compact binary coalescence using data from the Laser Interferometer Gravitational-wave Observatory (LIGO) and Virgo detectors. Five months of data were collected during the concurrent S5 (UGO) and VSRI (Virgo) science runs. The search focused on signals from binary mergers with a total mass between 2 and 35 Solar Mass. No gravitational waves are identified. The cumulative 90%-confidence upper limits on the rate of compact binary coalescence are calculated for non-spinning binary neutron stars, black hole-neutron star systems, and binary black holes to be 8.7 x 10(exp -3) / yr-1/L(sub 10) 2.2 x 10-3 yr-1L101, and 4.4 x 10(exp -4)3) / yr-1/L(sub 10) respectively, where L (sub 10) is 10(exp 10) times the blue solar luminosity. These upper limits are compared with astrophysical expectations.

  20. Search for gravitational waves from compact binary coalescence in LIGO and Virgo data from S5 and VSR1

    NASA Astrophysics Data System (ADS)

    Abadie, J.; Abbott, B. P.; Abbott, R.; Abernathy, M.; Accadia, T.; Acernese, F.; Adams, C.; Adhikari, R.; Ajith, P.; Allen, B.; Allen, G.; Amador Ceron, E.; Amin, R. S.; Anderson, S. B.; Anderson, W. G.; Antonucci, F.; Arain, M. A.; Araya, M.; Aronsson, M.; Arun, K. G.; Aso, Y.; Aston, S.; Astone, P.; Atkinson, D. E.; Aufmuth, P.; Aulbert, C.; Babak, S.; Baker, P.; Ballardin, G.; Ballinger, T.; Ballmer, S.; Barker, D.; Barnum, S.; Barone, F.; Barr, B.; Barriga, P.; Barsotti, L.; Barsuglia, M.; Barton, M. A.; Bartos, I.; Bassiri, R.; Bastarrika, M.; Bauchrowitz, J.; Bauer, Th. S.; Behnke, B.; Beker, M. G.; Belletoile, A.; Benacquista, M.; Bertolini, A.; Betzwieser, J.; Beveridge, N.; Beyersdorf, P. T.; Bigotta, S.; Bilenko, I. A.; Billingsley, G.; Birch, J.; Birindelli, S.; Biswas, R.; Bitossi, M.; Bizouard, M. A.; Black, E.; Blackburn, J. K.; Blackburn, L.; Blair, D.; Bland, B.; Blom, M.; Boccara, C.; Bock, O.; Bodiya, T. P.; Bondarescu, R.; Bondu, F.; Bonelli, L.; Bonnand, R.; Bork, R.; Born, M.; Bose, S.; Bosi, L.; Bouhou, B.; Boyle, M.; Braccini, S.; Bradaschia, C.; Brady, P. R.; Braginsky, V. B.; Brau, J. E.; Breyer, J.; Bridges, D. O.; Brillet, A.; Brinkmann, M.; Brisson, V.; Britzger, M.; Brooks, A. F.; Brown, D. A.; Budzyński, R.; Bulik, T.; Bulten, H. J.; Buonanno, A.; Burguet–Castell, J.; Burmeister, O.; Buskulic, D.; Buy, C.; Byer, R. L.; Cadonati, L.; Cagnoli, G.; Cain, J.; Calloni, E.; Camp, J. B.; Campagna, E.; Campsie, P.; Cannizzo, J.; Cannon, K. C.; Canuel, B.; Cao, J.; Capano, C.; Carbognani, F.; Caudill, S.; Cavaglià, M.; Cavalier, F.; Cavalieri, R.; Cella, G.; Cepeda, C.; Cesarini, E.; Chalermsongsak, T.; Chalkley, E.; Charlton, P.; Chassande-Mottin, E.; Chelkowski, S.; Chen, Y.; Chincarini, A.; Christensen, N.; Chua, S. S. Y.; Chung, C. T. Y.; Clark, D.; Clark, J.; Clayton, J. H.; Cleva, F.; Coccia, E.; Colacino, C. N.; Colas, J.; Colla, A.; Colombini, M.; Conte, R.; Cook, D.; Corbitt, T. R.; Cornish, N.; Corsi, A.; Costa, C. A.; Coulon, J.-P.; Coward, D.; Coyne, D. C.; Creighton, J. D. E.; Creighton, T. D.; Cruise, A. M.; Culter, R. M.; Cumming, A.; Cunningham, L.; Cuoco, E.; Dahl, K.; Danilishin, S. L.; Dannenberg, R.; D'Antonio, S.; Danzmann, K.; Das, K.; Dattilo, V.; Daudert, B.; Davier, M.; Davies, G.; Davis, A.; Daw, E. J.; Day, R.; Dayanga, T.; de Rosa, R.; Debra, D.; Degallaix, J.; Del Prete, M.; Dergachev, V.; Derosa, R.; Desalvo, R.; Devanka, P.; Dhurandhar, S.; di Fiore, L.; di Lieto, A.; di Palma, I.; di Paolo Emilio, M.; di Virgilio, A.; Díaz, M.; Dietz, A.; Donovan, F.; Dooley, K. L.; Doomes, E. E.; Dorsher, S.; Douglas, E. S. D.; Drago, M.; Drever, R. W. P.; Driggers, J. C.; Dueck, J.; Dumas, J.-C.; Eberle, T.; Edgar, M.; Edwards, M.; Effler, A.; Ehrens, P.; Ely, G.; Engel, R.; Etzel, T.; Evans, M.; Evans, T.; Fafone, V.; Fairhurst, S.; Fan, Y.; Farr, B. F.; Fazi, D.; Fehrmann, H.; Feldbaum, D.; Ferrante, I.; Fidecaro, F.; Finn, L. S.; Fiori, I.; Flaminio, R.; Flanigan, M.; Flasch, K.; Foley, S.; Forrest, C.; Forsi, E.; Fotopoulos, N.; Fournier, J.-D.; Franc, J.; Frasca, S.; Frasconi, F.; Frede, M.; Frei, M.; Frei, Z.; Freise, A.; Frey, R.; Fricke, T. T.; Friedrich, D.; Fritschel, P.; Frolov, V. V.; Fulda, P.; Fyffe, M.; Galimberti, M.; Gammaitoni, L.; Garofoli, J. A.; Garufi, F.; Gemme, G.; Genin, E.; Gennai, A.; Ghosh, S.; Giaime, J. A.; Giampanis, S.; Giardina, K. D.; Giazotto, A.; Gill, C.; Goetz, E.; Goggin, L. M.; González, G.; Goßler, S.; Gouaty, R.; Graef, C.; Granata, M.; Grant, A.; Gras, S.; Gray, C.; Greenhalgh, R. J. S.; Gretarsson, A. M.; Greverie, C.; Grosso, R.; Grote, H.; Grunewald, S.; Guidi, G. M.; Gustafson, E. K.; Gustafson, R.; Hage, B.; Hall, P.; Hallam, J. M.; Hammer, D.; Hammond, G.; Hanks, J.; Hanna, C.; Hanson, J.; Harms, J.; Harry, G. M.; Harry, I. W.; Harstad, E. D.; Haughian, K.; Hayama, K.; Hayau, J.-F.; Hayler, T.; Heefner, J.; Heitmann, H.; Hello, P.; Heng, I. S.; Heptonstall, A.; Hewitson, M.; Hild, S.; Hirose, E.; Hoak, D.; Hodge, K. A.; Holt, K.; Hosken, D. J.; Hough, J.; Howell, E.; Hoyland, D.; Huet, D.; Hughey, B.; Husa, S.; Huttner, S. H.; Huynh–Dinh, T.; Ingram, D. R.; Inta, R.; Isogai, T.; Ivanov, A.; Jaranowski, P.; Johnson, W. W.; Jones, D. I.; Jones, G.; Jones, R.; Ju, L.; Kalmus, P.; Kalogera, V.; Kandhasamy, S.; Kanner, J.; Katsavounidis, E.; Kawabe, K.; Kawamura, S.; Kawazoe, F.; Kells, W.; Keppel, D. G.; Khalaidovski, A.; Khalili, F. Y.; Khazanov, E. A.; Kim, H.; King, P. J.; Kinzel, D. L.; Kissel, J. S.; Klimenko, S.; Kondrashov, V.; Kopparapu, R.; Koranda, S.; Kowalska, I.; Kozak, D.; Krause, T.; Kringel, V.; Krishnamurthy, S.; Krishnan, B.; Królak, A.; Kuehn, G.; Kullman, J.; Kumar, R.; Kwee, P.; Landry, M.; Lang, M.; Lantz, B.; Lastzka, N.; Lazzarini, A.; Leaci, P.; Leong, J.; Leonor, I.; Leroy, N.; Letendre, N.; Li, J.; Li, T. G. F.; Lin, H.; Lindquist, P. E.; Lockerbie, N. A.; Lodhia, D.; Lorenzini, M.; Loriette, V.; Lormand, M.; Losurdo, G.; Lu, P.; Luan, J.; Lubiński, M.; Lucianetti, A.; Lück, H.; Lundgren, A.; Machenschalk, B.; Macinnis, M.; Mageswaran, M.; Mailand, K.; Majorana, E.; Mak, C.; Maksimovic, I.; Man, N.; Mandel, I.; Mandic, V.; Mantovani, M.; Marchesoni, F.; Marion, F.; Márka, S.; Márka, Z.; Maros, E.; Marque, J.; Martelli, F.; Martin, I. W.; Martin, R. M.; Marx, J. N.; Mason, K.; Masserot, A.; Matichard, F.; Matone, L.; Matzner, R. A.; Mavalvala, N.; McCarthy, R.; McClelland, D. E.; McGuire, S. C.; McIntyre, G.; McIvor, G.; McKechan, D. J. A.; Meadors, G.; Mehmet, M.; Meier, T.; Melatos, A.; Melissinos, A. C.; Mendell, G.; Menéndez, D. F.; Mercer, R. A.; Merill, L.; Meshkov, S.; Messenger, C.; Meyer, M. S.; Miao, H.; Michel, C.; Milano, L.; Miller, J.; Minenkov, Y.; Mino, Y.; Mitra, S.; Mitrofanov, V. P.; Mitselmakher, G.; Mittleman, R.; Moe, B.; Mohan, M.; Mohanty, S. D.; Mohapatra, S. R. P.; Moraru, D.; Moreau, J.; Moreno, G.; Morgado, N.; Morgia, A.; Mors, K.; Mosca, S.; Moscatelli, V.; Mossavi, K.; Mours, B.; Mowlowry, C.; Mueller, G.; Mukherjee, S.; Mullavey, A.; Müller-Ebhardt, H.; Munch, J.; Murray, P. G.; Nash, T.; Nawrodt, R.; Nelson, J.; Neri, I.; Newton, G.; Nishida, E.; Nishizawa, A.; Nocera, F.; Nolting, D.; Ochsner, E.; O'Dell, J.; Ogin, G. H.; Oldenburg, R. G.; O'Reilly, B.; O'Shaughnessy, R.; Osthelder, C.; Ottaway, D. J.; Ottens, R. S.; Overmier, H.; Owen, B. J.; Page, A.; Pagliaroli, G.; Palladino, L.; Palomba, C.; Pan, Y.; Pankow, C.; Paoletti, F.; Papa, M. A.; Pardi, S.; Pareja, M.; Parisi, M.; Pasqualetti, A.; Passaquieti, R.; Passuello, D.; Patel, P.; Pathak, D.; Pedraza, M.; Pekowsky, L.; Penn, S.; Peralta, C.; Perreca, A.; Persichetti, G.; Pichot, M.; Pickenpack, M.; Piergiovanni, F.; Pietka, M.; Pinard, L.; Pinto, I. M.; Pitkin, M.; Pletsch, H. J.; Plissi, M. V.; Poggiani, R.; Postiglione, F.; Prato, M.; Predoi, V.; Price, L. R.; Prijatelj, M.; Principe, M.; Prix, R.; Prodi, G. A.; Prokhorov, L.; Puncken, O.; Punturo, M.; Puppo, P.; Quetschke, V.; Raab, F. J.; Rabeling, D. S.; Radke, T.; Radkins, H.; Raffai, P.; Rakhmanov, M.; Rankins, B.; Rapagnani, P.; Raymond, V.; Re, V.; Reed, C. M.; Reed, T.; Regimbau, T.; Reid, S.; Reitze, D. H.; Ricci, F.; Riesen, R.; Riles, K.; Roberts, P.; Robertson, N. A.; Robinet, F.; Robinson, C.; Robinson, E. L.; Rocchi, A.; Roddy, S.; Röver, C.; Rolland, L.; Rollins, J.; Romano, J. D.; Romano, R.; Romie, J. H.; Rosińska, D.; Rowan, S.; Rüdiger, A.; Ruggi, P.; Ryan, K.; Sakata, S.; Sakosky, M.; Salemi, F.; Sammut, L.; Sancho de La Jordana, L.; Sandberg, V.; Sannibale, V.; Santamaría, L.; Santostasi, G.; Saraf, S.; Sassolas, B.; Sathyaprakash, B. S.; Sato, S.; Satterthwaite, M.; Saulson, P. R.; Savage, R.; Schilling, R.; Schnabel, R.; Schofield, R.; Schulz, B.; Schutz, B. F.; Schwinberg, P.; Scott, J.; Scott, S. M.; Searle, A. C.; Seifert, F.; Sellers, D.; Sengupta, A. S.; Sentenac, D.; Sergeev, A.; Shaddock, D.; Shapiro, B.; Shawhan, P.; Shoemaker, D. H.; Sibley, A.; Siemens, X.; Sigg, D.; Singer, A.; Sintes, A. M.; Skelton, G.; Slagmolen, B. J. J.; Slutsky, J.; Smith, J. R.; Smith, M. R.; Smith, N. D.; Somiya, K.; Sorazu, B.; Speirits, F. C.; Sperandio, L.; Stein, A. J.; Stein, L. C.; Steinlechner, S.; Steplewski, S.; Stochino, A.; Stone, R.; Strain, K. A.; Strigin, S.; Stroeer, A.; Sturani, R.; Stuver, A. L.; Summerscales, T. Z.; Sung, M.; Susmithan, S.; Sutton, P. J.; Swinkels, B.; Talukder, D.; Tanner, D. B.; Tarabrin, S. P.; Taylor, J. R.; Taylor, R.; Thomas, P.; Thorne, K. A.; Thorne, K. S.; Thrane, E.; Thüring, A.; Titsler, C.; Tokmakov, K. V.; Toncelli, A.; Tonelli, M.; Torre, O.; Torres, C.; Torrie, C. I.; Tournefier, E.; Travasso, F.; Traylor, G.; Trias, M.; Trummer, J.; Tseng, K.; Turner, L.; Ugolini, D.; Urbanek, K.; Vahlbruch, H.; Vaishnav, B.; Vajente, G.; Vallisneri, M.; van den Brand, J. F. J.; van den Broeck, C.; van der Putten, S.; van der Sluys, M. V.; van Veggel, A. A.; Vass, S.; Vaulin, R.; Vavoulidis, M.; Vecchio, A.; Vedovato, G.; Veitch, J.; Veitch, P. J.; Veltkamp, C.; Verkindt, D.; Vetrano, F.; Viceré, A.; Villar, A.; Vinet, J.-Y.; Vocca, H.; Vorvick, C.; Vyachanin, S. P.; Waldman, S. J.; Wallace, L.; Wanner, A.; Ward, R. L.; Was, M.; Wei, P.; Weinert, M.; Weinstein, A. J.; Weiss, R.; Wen, L.; Wen, S.; Wessels, P.; West, M.; Westphal, T.; Wette, K.; Whelan, J. T.; Whitcomb, S. E.; White, D. J.; Whiting, B. F.; Wilkinson, C.; Willems, P. A.; Williams, L.; Willke, B.; Winkelmann, L.; Winkler, W.; Wipf, C. C.; Wiseman, A. G.; Woan, G.; Wooley, R.; Worden, J.; Yakushin, I.; Yamamoto, H.; Yamamoto, K.; Yeaton-Massey, D.; Yoshida, S.; Yu, P. P.; Yvert, M.; Zanolin, M.; Zhang, L.; Zhang, Z.; Zhao, C.; Zotov, N.; Zucker, M. E.; Zweizig, J.

    2010-11-01

    We report the results of the first search for gravitational waves from compact binary coalescence using data from the Laser Interferometer Gravitational-Wave Observatory and Virgo detectors. Five months of data were collected during the Laser Interferometer Gravitational-Wave Observatory’s S5 and Virgo’s VSR1 science runs. The search focused on signals from binary mergers with a total mass between 2 and 35M⊙. No gravitational waves are identified. The cumulative 90%-confidence upper limits on the rate of compact binary coalescence are calculated for nonspinning binary neutron stars, black hole-neutron star systems, and binary black holes to be 8.7×10-3yr-1L10-1, 2.2×10-3yr-1L10-1, and 4.4×10-4yr-1L10-1, respectively, where L10 is 1010 times the blue solar luminosity. These upper limits are compared with astrophysical expectations.

  1. Expanding the Search for Spectroscopic Binaries in Proto-Planetary Nebulae

    NASA Astrophysics Data System (ADS)

    Hrivnak, B.; Bohlender, D.; Kerber, F.; Lu, W.; Seifahrt, A.; Van de Steene, G.; Van Winckel, H.

    2014-04-01

    Binaries are often invoked as a shaping mechanism for the asymmetrical shapes of planetary nebulae and proto-planetary nebulae (PPNe) - particularly those that are elliptical, bipolar, or point symmetric. To test this hypothesis, we have been carrying out radial velocity monitoring of a sample of PPNe. The results of an initial study of seven bright PPNe have been published, based primarily on our observations from 1991-1995 and 2007-2010 at the Dominion Astrophysical Observatory (Victoria, Canada). Six of the seven showed no long-term variations between the two time intervals while one, IRAS 22272+5435, gave evidence of a variation consistent with a P > 22 yr (Hrivnak et al. 2011, ApJ, 734, 25). All seven of these objects do show shorter-term pulsational variations, on the order of 35-130 day over a range of about 14 km/s (peak-to-peak). We have expanded this search in two ways. Firstly, we have increased the temporal baseline by continuing to monitor the bright seven objects in radial velocity and increased the sampling with the addition of observations from the Hermes spectrograph on the Mercator telescope (Canary Islands). This has resulted in a second object with possible long-term variability that may indicate a binary companion. Secondly, we have started to monitor three edge-on PPNe with near-infrared spectroscopy; the stars are hidden in visible light but seen in the near infrared. These should show the full orbital velocity if it exists. Observations were begun in 2010, primarily from the ESO-VLT. While the spectra are more complicated than expected, we have found tantalizing evidence for systematic velocity variations in one of these three. Preliminary results for both of these expanded studies were presented. The research is supported in part by a grant from the NSF to BJH (AST-1009974).

  2. Planets or Pretense?: The Search for Substellar Objects around Post Common Envelope Binaries

    NASA Astrophysics Data System (ADS)

    Hardy, Adam; Schreiber, Matthias R.; Parsons, Steven; Caceres, Claudio; Canovas, Hector

    2015-12-01

    Many believe post-common envelope binary systems (PCEBs), consisting of a white dwarf and a close main-sequence companion, host a unique class of planetary system. Given the well known age and history of the host binary stars, these systems have the potential to provide new insights into the evolution of planetary systems. However, the existence of the planets should be treated with some skepticism as their presence has so far been inferred only by the indirect method of eclipse timing variations. This method has proved somewhat flawed, as many of the claimed planetary systems have been found dynamically unstable, and others have dramatically failed when confronted with more recent high-precision times. It is therefore of the utmost importance that complementary observations be performed to test the planetary hypothesis, and we have recently performed two such pioneering observations:1. We use SPHERE on the VLT to image the PCEB V471 Tau. A circumbinary companion to this PCEB has been predicted for more than 30 years with eclipse timings, but only recently has a direct detection become technically possible.2. We use ALMA to search for dusty material around the young PCEB NN Ser. The planetary model for NN Ser is one of the most convincing, and these planets would likely be present alongside considerable dusty material, now detectable thanks to the sensitivity of ALMA.I will present the results of these two important observations and discuss their far-reaching implications for the existence and charactistics of planetary systems around PCEBs.

  3. Searching for twins of the V1309 Sco progenitor system: a selection of long-period contact binaries

    NASA Astrophysics Data System (ADS)

    Kurtenkov, Alexander

    2017-01-01

    The only well-studied red nova progenitor (V1309 Sco) was a contact binary with a 1.4-day period. The prospects for searching for similar systems, as well as stellar merger candidates in general, are explored in this work. The photospheric temperatures of 128 variables with periods P=1.1-1.8 d classified as W UMa-type binaries are calculated using their colors listed in the SDSS catalog. A selection of 15 contact binaries with similar temperatures and periods as the V1309 Sco progenitor is compiled. The Kepler Eclipsing Binary Catalog is used to analyse systems with eclipse timing variations (ETV) possibly caused by changes of the orbital period. Out of the 31 systems with parabolic ETV curves listed by Conroy et al. (2014, AJ, 147, 45) two could be contact binaries with a decreasing period and, therefore, potential stellar merger candidates. Out of the 569 contact binaries in the OGLE field analysed by Kubiak et al. (2006, AcA, 56, 253) 14 systems have periods longer than 0.8 d and a statistically significant period decrease.

  4. Search for gravitational waves from low mass binary coalescences in the first year of LIGO's S5 data

    SciTech Connect

    Abbott, B. P.; Abbott, R.; Adhikari, R.; Anderson, S. B.; Araya, M.; Armandula, H.; Aso, Y.; Ballmer, S.; Barton, M. A.; Betzwieser, J.; Billingsley, G.; Black, E.; Blackburn, J. K.; Bork, R.; Boschi, V.; Brooks, A. F.; Cannon, K. C.; Cardenas, L.; Cepeda, C.; Chalermsongsak, T.

    2009-06-15

    We have searched for gravitational waves from coalescing low mass compact binary systems with a total mass between 2M{sub {center_dot}} and 35M{sub {center_dot}} and a minimum component mass of 1M{sub {center_dot}} using data from the first year of the fifth science run of the three LIGO detectors, operating at design sensitivity. Depending on the mass, we are sensitive to coalescences as far as 150 Mpc from the Earth. No gravitational-wave signals were observed above the expected background. Assuming a population of compact binary objects with a Gaussian mass distribution representing binary neutron star systems, black hole-neutron star binary systems, and binary black hole systems, we calculate the 90% confidence upper limit on the rate of coalescences to be 3.9x10{sup -2} yr{sup -1}L{sub 10}{sup -1}, 1.1x10{sup -2} yr{sup -1}L{sub 10}{sup -1}, and 2.5x10{sup -3} yr{sup -1}L{sub 10}{sup -1}, respectively, where L{sub 10} is 10{sup 10} times the blue solar luminosity. We also set improved upper limits on the rate of compact binary coalescences per unit blue-light luminosity, as a function of mass.

  5. Results of the GstLAL Search for Compact Binary Mergers in Advanced LIGO's First Observing Run

    NASA Astrophysics Data System (ADS)

    Lang, Ryan; LIGO Scientific Collaboration; Virgo Collaboration Collaboration

    2017-01-01

    Advanced LIGO's first observing period ended in January 2016. We discuss the GstLAL matched-filter search over this data set for gravitational waves from compact binary objects with total mass up to 100 solar masses. In particular, we discuss the recovery of the unambiguous gravitational wave signals GW150914 and GW151226, as well as the possible third signal LVT151012. Additionally, we discuss the constraints we can place on binary-neutron-star and neutron-star-black-hole system merger rates.

  6. The binary fraction of planetary nebula central stars - II. A larger sample and improved technique for the infrared excess search

    NASA Astrophysics Data System (ADS)

    Douchin, Dimitri; De Marco, Orsola; Frew, D. J.; Jacoby, G. H.; Jasniewicz, G.; Fitzgerald, M.; Passy, Jean-Claude; Harmer, D.; Hillwig, Todd; Moe, Maxwell

    2015-04-01

    There is no conclusive explanation of why ˜80 per cent of planetary nebulae (PNe) are non-spherical. In the Binary Hypothesis, a binary interaction is a preferred channel to form a non-spherical PN. A fundamental step to corroborate or disprove the Binary Hypothesis is to estimate the binary fraction of central stars of PNe (CSPNe) and compare it with a prediction based on the binary fraction of the progenitor, main-sequence population. In this paper, the second in a series, we search for spatially unresolved I- and J-band flux excess in an extended sample of 34 CSPN by a refined measurement technique with a better quantification of the uncertainties. The detection rate of I- (J-)band flux excess is 32 ± 16 per cent (50 ± 24 per cent). This result is very close to what was obtained in Paper I with a smaller sample. We account conservatively for unobserved cool companions down to brown dwarf luminosities, increasing these fractions to 40 ± 20 per cent (62 ± 30 per cent). This step is very sensitive to the adopted brightness limit of our survey. Accounting for visual companions increases the binary fraction to 46 ± 23 per cent (71 ± 34 per cent). These figures are lower than in Paper I. The error bars are better quantified, but still unacceptably large. Taken at face value, the current CSPN binary fraction is in line with the main-sequence progenitor population binary fraction. However, including white dwarfs companions could increase this fraction by as much as 13 (21) per cent points.

  7. Implementing a search for gravitational waves from binary black holes with nonprecessing spin

    NASA Astrophysics Data System (ADS)

    Capano, Collin; Harry, Ian; Privitera, Stephen; Buonanno, Alessandra

    2016-06-01

    Searching for gravitational waves (GWs) from binary black holes (BBHs) with LIGO and Virgo involves matched-filtering data against a set of representative signal waveforms—a template bank—chosen to cover the full signal space of interest with as few template waveforms as possible. Although the component black holes may have significant angular momenta (spin), previous searches for BBHs have filtered LIGO and Virgo data using only waveforms where both component spins are zero. This leads to a loss of signal-to-noise ratio for signals where this is not the case. Combining the best available template placement techniques and waveform models, we construct a template bank of GW signals from BBHs with component spins χ1 ,2∈[-0.99 ,0.99 ] aligned with the orbital angular momentum, component masses m1 ,2∈[2 ,48 ]M⊙ , and total mass Mtotal≤50 M⊙ . Using effective-one-body waveforms with spin effects, we show that less than 3% of the maximum signal-to-noise ratio (SNR) of these signals is lost due to the discreetness of the bank, using the early Advanced LIGO noise curve. We use simulated Advanced LIGO noise to compare the sensitivity of this bank to a nonspinning bank covering the same parameter space. In doing so, we consider the competing effects between improved SNR and signal-based vetoes and the increase in the rate of false alarms of the aligned-spin bank due to covering a larger parameter space. We find that the aligned-spin bank can be a factor of 1.3-5 more sensitive than a nonspinning bank to BBHs with dimensionless spins >+0.6 and component masses ≳20 M⊙ . Even larger gains are obtained for systems with equally high spins but smaller component masses.

  8. Efficiency of nonspinning templates in gravitational wave searches for aligned-spin binary black holes

    NASA Astrophysics Data System (ADS)

    Cho, Hee-Suk

    2016-12-01

    We study the efficiency of nonspinning waveform templates in gravitational wave searches for aligned-spin binary black holes (BBHs). We use PhenomD, which is the most recent phenomenological waveform model designed to generate the full inspiral-merger-ringdown waveforms emitted from BBHs with the spins aligned with the orbital angular momentum. Here, we treat the effect of aligned-spins with a single spin parameter χ . We consider the BBH signals with moderately small spins in the range of -0.4 ≤χ ≤0.4 . Using nonspinning templates, we calculate fitting factors of the aligned-spin signals in a wide mass range up to ˜100 M⊙. We find that the range in spin over which the nonspinning bank has fitting factors exceeding the threshold of 0.965 for all signals in our mass range is very narrow, i.e., -0.3 ≤χ ≤0 . The signals with negative spins can have higher fitting factors than those with positive spins. If χ =0.3 , only the highly asymmetric-mass signals can have the fitting factors exceeding the threshold, while the fitting factors for all of the signals can be larger than the threshold if χ =-0.3 . We demonstrate that the discrepancy between the regions of a positive and a negative spin is due to the physical boundary (η ≤0.25 ) of the template parameter space. In conclusion, we emphasize the necessity of an aligned-spin template bank in the current Advanced LIGO searches for aligned-spin BBHs. We also show that the recovered mass parameters can be significantly biased from the true parameters.

  9. Mastering the game of Go with deep neural networks and tree search.

    PubMed

    Silver, David; Huang, Aja; Maddison, Chris J; Guez, Arthur; Sifre, Laurent; van den Driessche, George; Schrittwieser, Julian; Antonoglou, Ioannis; Panneershelvam, Veda; Lanctot, Marc; Dieleman, Sander; Grewe, Dominik; Nham, John; Kalchbrenner, Nal; Sutskever, Ilya; Lillicrap, Timothy; Leach, Madeleine; Kavukcuoglu, Koray; Graepel, Thore; Hassabis, Demis

    2016-01-28

    The game of Go has long been viewed as the most challenging of classic games for artificial intelligence owing to its enormous search space and the difficulty of evaluating board positions and moves. Here we introduce a new approach to computer Go that uses 'value networks' to evaluate board positions and 'policy networks' to select moves. These deep neural networks are trained by a novel combination of supervised learning from human expert games, and reinforcement learning from games of self-play. Without any lookahead search, the neural networks play Go at the level of state-of-the-art Monte Carlo tree search programs that simulate thousands of random games of self-play. We also introduce a new search algorithm that combines Monte Carlo simulation with value and policy networks. Using this search algorithm, our program AlphaGo achieved a 99.8% winning rate against other Go programs, and defeated the human European Go champion by 5 games to 0. This is the first time that a computer program has defeated a human professional player in the full-sized game of Go, a feat previously thought to be at least a decade away.

  10. Mastering the game of Go with deep neural networks and tree search

    NASA Astrophysics Data System (ADS)

    Silver, David; Huang, Aja; Maddison, Chris J.; Guez, Arthur; Sifre, Laurent; van den Driessche, George; Schrittwieser, Julian; Antonoglou, Ioannis; Panneershelvam, Veda; Lanctot, Marc; Dieleman, Sander; Grewe, Dominik; Nham, John; Kalchbrenner, Nal; Sutskever, Ilya; Lillicrap, Timothy; Leach, Madeleine; Kavukcuoglu, Koray; Graepel, Thore; Hassabis, Demis

    2016-01-01

    The game of Go has long been viewed as the most challenging of classic games for artificial intelligence owing to its enormous search space and the difficulty of evaluating board positions and moves. Here we introduce a new approach to computer Go that uses ‘value networks’ to evaluate board positions and ‘policy networks’ to select moves. These deep neural networks are trained by a novel combination of supervised learning from human expert games, and reinforcement learning from games of self-play. Without any lookahead search, the neural networks play Go at the level of state-of-the-art Monte Carlo tree search programs that simulate thousands of random games of self-play. We also introduce a new search algorithm that combines Monte Carlo simulation with value and policy networks. Using this search algorithm, our program AlphaGo achieved a 99.8% winning rate against other Go programs, and defeated the human European Go champion by 5 games to 0. This is the first time that a computer program has defeated a human professional player in the full-sized game of Go, a feat previously thought to be at least a decade away.

  11. A method of characterizing network topology based on the breadth-first search tree

    NASA Astrophysics Data System (ADS)

    Zhou, Bin; He, Zhe; Wang, Nianxin; Wang, Bing-Hong

    2016-05-01

    A method based on the breadth-first search tree is proposed in this paper to characterize the hierarchical structure of network. In this method, a similarity coefficient is defined to quantitatively distinguish networks, and quantitatively measure the topology stability of the network generated by a model. The applications of the method are discussed in ER random network, WS small-world network and BA scale-free network. The method will be helpful for deeply describing network topology and provide a starting point for researching the topology similarity and isomorphism of networks.

  12. Diagnostic Power of Broad Emission Line Profiles in Searches for Binary Supermassive Black Holes: Comparison of Models with Observations

    NASA Astrophysics Data System (ADS)

    Nguyen, Khai; Bogdanovic, Tamara; Eracleous, Michael; Runnoe, Jessie C.; Sigurdsson, Steinn

    2017-01-01

    Motivated by observational searches for sub-parsec supermassive black hole binaries (SBHBs) we develop a semi-analytic model to describe the spectral emission line signatures of these systems. We are particularly interested in modeling the profiles of the broad emission lines, which have been used as a tool to search for SBHBs. The goal of this work is to test one of the leading models of binary accretion flows in the literature: SBHB in a circumbinary disk. In this context, we model SBHB accretion flows as a set of three accretion disks: two mini-disks that are gravitationally bound to the individual black holes and a circumbinary disk that forms a common envelope about a gravitationally bound binary. Our first generation model shows that emission line profiles tend to have different statistical properties depending on the semi-major axis, mass ratio, eccentricity of the binary, and the alignment of the triple-disk system, and can in principle be used to constrain the statistical distribution of these parameters. We present the results of a second generation model, which improves upon the treatment of radiative transfer by taking into account the effect of line-driven winds on the properties of the model emission line profiles. This improvement allows a preliminary comparison of the model profiles with the observed SBHB candidates and AGN population in general.

  13. Searches for Periodic Neutrino Emission from Binary Systems with 22 and 40 Strings of IceCube

    NASA Technical Reports Server (NTRS)

    Abassi, R.; Abdou, Y.; Abu-Zayyad, T.; Ackermann, M.; Adams, J.; Aguilar, J. A.; Ahlers, M.; Allen, M. M.; Altmann, D.; Andeen, K.; Auffenberg, J.; Bai, X.; Baker, M.; Barwick, S. W.; Bay, R.; Bazo Alba, J. L.; Beattie, K.; Beatty, J. J.; Bechet, S.; Becker, J. K.; Becker, K.-H.; Benabderrahmane, M. L.; BenZvi, S.; Berdermann, J.; Berghaus, P.

    2011-01-01

    Recent observations of GeV /TeV photon emission from several X-ray binaries have sparked a renewed interest in these objects as galactic particle accelerators. In spite of the available multi-wavelength data, their acceleration mechanisms are not determined, and the nature of the accelerated particles (hadrons or leptons) is unknown. While much evidence favors leptonic emission, it is very likely that a hadronic component is also accelerated in the jets of these binary systems. The observation of neutrino emission would be clear evidence for the presence of a hadronic component in the outflow of these sources. In this paper we look for periodic neutrino emission from binary systems. Such modulation, observed in the photon flux, would be caused by the geometry of these systems. The results of two searches are presented that differ in the treatment of the spectral shape and phase of the emission. The 'generic' search allows parameters to vary freely and best fit values, in a 'model-dependent' search, predictions are used to constrain these parameters. We use the IceCube data taken from May 31, 2007 to April 5, 2008 with its 22-string configuration, and from April 5, 2008 and May 20, 2009 with its 40-string configuration. For the generic search and the 40 string sample, we find that the most significant source in the catalog of 7 binary stars is Cygnus X-3 with a 1.8% probability after trials (2.10" sigma one-sided) of being produced by statistical fluctuations of the background. The model-dependent method tested a range of system geometries - the inclination and the massive star's disk size - for LS I+61 deg 303, no significant excess was found.

  14. Using Boosting Decision Trees in Gravitational Wave Searches triggered by Gamma-ray Bursts

    NASA Astrophysics Data System (ADS)

    Zuraw, Sarah; LIGO Collaboration

    2015-04-01

    The search for gravitational wave bursts requires the ability to distinguish weak signals from background detector noise. Gravitational wave bursts are characterized by their transient nature, making them particularly difficult to detect as they are similar to non-Gaussian noise fluctuations in the detector. The Boosted Decision Tree method is a powerful machine learning algorithm which uses Multivariate Analysis techniques to explore high-dimensional data sets in order to distinguish between gravitational wave signal and background detector noise. It does so by training with known noise events and simulated gravitational wave events. The method is tested using waveform models and compared with the performance of the standard gravitational wave burst search pipeline for Gamma-ray Bursts. It is shown that the method is able to effectively distinguish between signal and background events under a variety of conditions and over multiple Gamma-ray Burst events. This example demonstrates the usefulness and robustness of the Boosted Decision Tree and Multivariate Analysis techniques as a detection method for gravitational wave bursts. LIGO, UMass, PREP, NEGAP.

  15. Incremental road discovery from aerial imagery using curvilinear spanning tree (CST) search

    NASA Astrophysics Data System (ADS)

    Wang, Guozhi; Huang, Yuchun; Xie, Rongchang; Zhang, Hongchang

    2016-10-01

    Robust detection of road network in aerial imagery is a challenging task since roads have different pavement texture, road-side surroundings, as well as grades. Roads of different grade have different curvilinear saliency in the aerial imagery. This paper is motivated to incrementally extract roads and construct the topology of the road network of aerial imagery from the higher-grade-first perspective. Inspired by the spanning tree technique, the proposed method starts from the robust extraction of the most salient road segment(s) of the road network, and incrementally connects segments of less saliency of curvilinear structure until all road segments in the network are extracted. The proposed algorithm includes: curvilinear path-based road morphological enhancement, extraction of road segments, and spanning tree search for the incremental road discovery. It is tested on a diverse set of aerial imagery acquired in the city and inter-city areas. Experimental results show that the proposed curvilinear spanning tree (CST) can detect roads efficiently and construct the topology of the road network effectively. It is promising for the change detection of the road network.

  16. Search for Gravitational Waves from Low Mass Compact Binary Coalescence in LIGO's Sixth Science Run and Virgo's Science Runs 2 and 3

    NASA Technical Reports Server (NTRS)

    Abadie, J.; Abbott, B. P.; Abbott, R.; Abbott, T. D.; Abernathy, M.; Accadia, T.; Acernese, F.; Adams, C.; Adhikari, R.; Affeldt, C.; Agathos, M.; Ajith, P.; Allen, B.; Allen, G. S.; Ceron, E. Amador; Amariutei, D.; Amin, R. S.; Anderson, S. B.; Anderson, W. G.; Arai, K.; Arain, M. A.; Araya, M. C.; Blackburn, L.; Camp, J. B.; Cannizzo, J.

    2012-01-01

    We report on a search for gravitational waves from coalescing compact binaries using LIGO and Virgo observations between July 7, 2009, and October 20. 2010. We searched for signals from binaries with total mass between 2 and 25 Stellar Mass; this includes binary neutron stars, binary black holes, and binaries consisting of a black hole and neutron star. The detectors were sensitive to systems up to 40 Mpc distant for binary neutron stars, and further for higher mass systems. No gravitational-wave signals were detected. We report upper limits on the rate of compact binary coalescence as a function of total mass. including the results from previous LIGO and Virgo observations. The cumulative 90% confidence rate upper limits of the binary coalescence of binary neutron star, neutron star-black hole, and binary black hole systems are 1.3 x 10(exp -4), 3.1 x 10(exp -5), and 6.4 x 10(exp -6)/cu Mpc/yr, respectively. These upper limits are up to a factor 1.4 lower than previously derived limits. We also report on results from a blind injection challenge.

  17. Searching for the Nearest Extragalactic Binary Black Hole: A Spectroscopic Study of NGC 4736

    NASA Astrophysics Data System (ADS)

    Gustafsson, Annika; Kwan, Teiler J.; Fisher, Robert Scott; Mason, Rachel

    2016-01-01

    In 1995 and 1996, Maoz et al. concluded that the nearby galaxy NGC 4736 (d=16 million light years) is in the late stages of a merger event. After further investigation, in 2005, Maoz et al. observed UV variability in the nuclear region of NGC 4736, revealing a second unknown source in the nucleus. Since late stage mergers are an ideal location to search for binary black holes (BBH), members of our team hypothesized that the second source could be a second black hole, making this a potential BBH system. This is important since observational evidence for their existence remains sparse, even though BBH are predicted by many theories and potentially play an important role in galaxy evolution. In January of 2008, NGC 4736 was observed with the GMOS-N instrument on Gemini North. Optical longslit spectra of the nuclear region were obtained with spatial resolution of 0.1454''/pixel and a spectral resolution of R~1700. At this resolution, the two nuclear sources are spatially resolved at a projected separation of 2.5''. As a result, we can classify the nature of the second source by looking at the optical line ratios following Ho et al. (1997). High signal-to-noise spectra of the unknown source displayed strong emission of [SII] and [NII], but an extremely weak [OIII] emission line. The unknown source has a calculated [NII]/[Hα] ratio of 1.37 and an upper limit of 0.6 for the [OIII]/[Hβ] ratio. Placing the unknown source on the BPT-NII diagram (Baldwin et al., 1981), we tentatively conclude that it is a low-luminosity second black hole potentially making NGC 4736 the nearest BBH system. The result will enable future high-spectral and spatial resolution observations of a low-luminosity system in extremely late stages of merging, which will be a significant step forward in validating models of galaxy mergers and AGN activity.

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

  19. Trees

    ERIC Educational Resources Information Center

    Al-Khaja, Nawal

    2007-01-01

    This is a thematic lesson plan for young learners about palm trees and the importance of taking care of them. The two part lesson teaches listening, reading and speaking skills. The lesson includes parts of a tree; the modal auxiliary, can; dialogues and a role play activity.

  20. The BlackGEM Array: Searching for Gravitational Wave Source Counterparts to Study Ultra-Compact Binaries

    NASA Astrophysics Data System (ADS)

    Bloemen, S.; Groot, P.; Nelemans, G.; Klein-Wolt, M.

    2015-07-01

    The rates and physics of ultra-compact binaries consisting of neutron stars and black holes are poorly known, mostly due to the lack of a good sample to study such systems. In two years from now, the LIGO and Virgo interferometers are expected to be able to directly detect the gravitational waves (GW) emitted by such binaries when they merge, opening up a completely new window on the sky to study ultra-compact binaries. The combination of a GW detection with electromagnetic observations would be especially powerful to characterize the systems and the merger events. Unfortunately, however, the electromagnetic counterparts will be hard to find. The sky localization of the GW detections will be rather poor, with typical error boxes spanning ˜100 square degrees, and the optical sources are expected to be faint (˜22nd magnitude) and not long lasting (˜1 day). In this contribution we discuss the possibilities of finding the electromagnetic counterparts of these binaries, thereby paying particular attention to the dedicated BlackGEM array of optical telescopes that will be deployed at the ESO site in La Silla (Chile) in 2015 and 2016. In the first phase, the array will consist of four 60-cm telescopes with a field of view of 2.7 square degrees each. Apart from going after GW triggers, the array will also perform a deep southern sky survey in Sloan u, g, r, i, and z filters, down to 23rd magnitude in the g band, and a survey to characterize the transient and variable sky on timescales of hours and days. The latter will be a valuable resource to search for variable stars across the sky, including eclipsing, reflecting, and beaming binary stars.

  1. THREE NEW ECLIPSING WHITE-DWARF-M-DWARF BINARIES DISCOVERED IN A SEARCH FOR TRANSITING PLANETS AROUND M-DWARFS

    SciTech Connect

    Law, Nicholas M.; Kraus, Adam L.; Street, Rachel; Fulton, Benjamin J.; Shporer, Avi; Lister, Tim; Hillenbrand, Lynne A.; Baranec, Christoph; Bui, Khanh; Davis, Jack T. C.; Dekany, Richard G.; Kulkarni, S. R.; Ofek, Eran O.; Bloom, Joshua S.; Cenko, S. Bradley; Filippenko, Alexei V.; Burse, Mahesh P.; Das, H. K.; Kasliwal, Mansi M.; Nugent, Peter; and others

    2012-10-01

    We present three new eclipsing white-dwarf/M-dwarf binary systems discovered during a search for transiting planets around M-dwarfs. Unlike most known eclipsing systems of this type, the optical and infrared emission is dominated by the M-dwarf components, and the systems have optical colors and discovery light curves consistent with being Jupiter-radius transiting planets around early M-dwarfs. We detail the PTF/M-dwarf transiting planet survey, part of the Palomar Transient Factory (PTF). We present a graphics processing unit (GPU)-based box-least-squares search for transits that runs approximately 8 Multiplication-Sign faster than similar algorithms implemented on general purpose systems. For the discovered systems, we decompose low-resolution spectra of the systems into white-dwarf and M-dwarf components, and use radial velocity measurements and cooling models to estimate masses and radii for the white dwarfs. The systems are compact, with periods between 0.35 and 0.45 days and semimajor axes of approximately 2 R{sub Sun} (0.01 AU). The M-dwarfs have masses of approximately 0.35 M{sub Sun }, and the white dwarfs have hydrogen-rich atmospheres with temperatures of around 8000 K and have masses of approximately 0.5 M{sub Sun }. We use the Robo-AO laser guide star adaptive optics system to tentatively identify one of the objects as a triple system. We also use high-cadence photometry to put an upper limit on the white-dwarf radius of 0.025 R{sub Sun} (95% confidence) in one of the systems. Accounting for our detection efficiency and geometric factors, we estimate that 0.08%{sub -0.05%}{sup +0.10%} (90% confidence) of M-dwarfs are in these short-period, post-common-envelope white-dwarf/M-dwarf binaries where the optical light is dominated by the M-dwarf. The lack of detections at shorter periods, despite near-100% detection efficiency for such systems, suggests that binaries including these relatively low-temperature white dwarfs are preferentially found at

  2. Three New Eclipsing White-dwarf-M-dwarf Binaries Discovered in a Search for Transiting Planets around M-dwarfs

    NASA Astrophysics Data System (ADS)

    Law, Nicholas M.; Kraus, Adam L.; Street, Rachel; Fulton, Benjamin J.; Hillenbrand, Lynne A.; Shporer, Avi; Lister, Tim; Baranec, Christoph; Bloom, Joshua S.; Bui, Khanh; Burse, Mahesh P.; Cenko, S. Bradley; Das, H. K.; Davis, Jack. T. C.; Dekany, Richard G.; Filippenko, Alexei V.; Kasliwal, Mansi M.; Kulkarni, S. R.; Nugent, Peter; Ofek, Eran O.; Poznanski, Dovi; Quimby, Robert M.; Ramaprakash, A. N.; Riddle, Reed; Silverman, Jeffrey M.; Sivanandam, Suresh; Tendulkar, Shriharsh P.

    2012-10-01

    We present three new eclipsing white-dwarf/M-dwarf binary systems discovered during a search for transiting planets around M-dwarfs. Unlike most known eclipsing systems of this type, the optical and infrared emission is dominated by the M-dwarf components, and the systems have optical colors and discovery light curves consistent with being Jupiter-radius transiting planets around early M-dwarfs. We detail the PTF/M-dwarf transiting planet survey, part of the Palomar Transient Factory (PTF). We present a graphics processing unit (GPU)-based box-least-squares search for transits that runs approximately 8 × faster than similar algorithms implemented on general purpose systems. For the discovered systems, we decompose low-resolution spectra of the systems into white-dwarf and M-dwarf components, and use radial velocity measurements and cooling models to estimate masses and radii for the white dwarfs. The systems are compact, with periods between 0.35 and 0.45 days and semimajor axes of approximately 2 R ⊙ (0.01 AU). The M-dwarfs have masses of approximately 0.35 M ⊙, and the white dwarfs have hydrogen-rich atmospheres with temperatures of around 8000 K and have masses of approximately 0.5 M ⊙. We use the Robo-AO laser guide star adaptive optics system to tentatively identify one of the objects as a triple system. We also use high-cadence photometry to put an upper limit on the white-dwarf radius of 0.025 R ⊙ (95% confidence) in one of the systems. Accounting for our detection efficiency and geometric factors, we estimate that 0.08%^{+0.10%}_{-0.05%} (90% confidence) of M-dwarfs are in these short-period, post-common-envelope white-dwarf/M-dwarf binaries where the optical light is dominated by the M-dwarf. The lack of detections at shorter periods, despite near-100% detection efficiency for such systems, suggests that binaries including these relatively low-temperature white dwarfs are preferentially found at relatively large orbital radii. Similar eclipsing

  3. Use of Binary Partition Tree and energy minimization for object-based classification of urban land cover

    NASA Astrophysics Data System (ADS)

    Li, Mengmeng; Bijker, Wietske; Stein, Alfred

    2015-04-01

    Two main challenges are faced when classifying urban land cover from very high resolution satellite images: obtaining an optimal image segmentation and distinguishing buildings from other man-made objects. For optimal segmentation, this work proposes a hierarchical representation of an image by means of a Binary Partition Tree (BPT) and an unsupervised evaluation of image segmentations by energy minimization. For building extraction, we apply fuzzy sets to create a fuzzy landscape of shadows which in turn involves a two-step procedure. The first step is a preliminarily image classification at a fine segmentation level to generate vegetation and shadow information. The second step models the directional relationship between building and shadow objects to extract building information at the optimal segmentation level. We conducted the experiments on two datasets of Pléiades images from Wuhan City, China. To demonstrate its performance, the proposed classification is compared at the optimal segmentation level with Maximum Likelihood Classification and Support Vector Machine classification. The results show that the proposed classification produced the highest overall accuracies and kappa coefficients, and the smallest over-classification and under-classification geometric errors. We conclude first that integrating BPT with energy minimization offers an effective means for image segmentation. Second, we conclude that the directional relationship between building and shadow objects represented by a fuzzy landscape is important for building extraction.

  4. Multinomial tree models for assessing the status of the reference in studies of the accuracy of tools for binary classification

    PubMed Central

    Botella, Juan; Huang, Huiling; Suero, Manuel

    2013-01-01

    Studies that evaluate the accuracy of binary classification tools are needed. Such studies provide 2 × 2 cross-classifications of test outcomes and the categories according to an unquestionable reference (or gold standard). However, sometimes a suboptimal reliability reference is employed. Several methods have been proposed to deal with studies where the observations are cross-classified with an imperfect reference. These methods require that the status of the reference, as a gold standard or as an imperfect reference, is known. In this paper a procedure for determining whether it is appropriate to maintain the assumption that the reference is a gold standard or an imperfect reference, is proposed. This procedure fits two nested multinomial tree models, and assesses and compares their absolute and incremental fit. Its implementation requires the availability of the results of several independent studies. These should be carried out using similar designs to provide frequencies of cross-classification between a test and the reference under investigation. The procedure is applied in two examples with real data. PMID:24106484

  5. Optimal processing for gel electrophoresis images: Applying Monte Carlo Tree Search in GelApp.

    PubMed

    Nguyen, Phi-Vu; Ghezal, Ali; Hsueh, Ya-Chih; Boudier, Thomas; Gan, Samuel Ken-En; Lee, Hwee Kuan

    2016-08-01

    In biomedical research, gel band size estimation in electrophoresis analysis is a routine process. To facilitate and automate this process, numerous software have been released, notably the GelApp mobile app. However, the band detection accuracy is limited due to a band detection algorithm that cannot adapt to the variations in input images. To address this, we used the Monte Carlo Tree Search with Upper Confidence Bound (MCTS-UCB) method to efficiently search for optimal image processing pipelines for the band detection task, thereby improving the segmentation algorithm. Incorporating this into GelApp, we report a significant enhancement of gel band detection accuracy by 55.9 ± 2.0% for protein polyacrylamide gels, and 35.9 ± 2.5% for DNA SYBR green agarose gels. This implementation is a proof-of-concept in demonstrating MCTS-UCB as a strategy to optimize general image segmentation. The improved version of GelApp-GelApp 2.0-is freely available on both Google Play Store (for Android platform), and Apple App Store (for iOS platform).

  6. In search of a signature of binary Kuiper Belt Objects in the Pluto-Charon crater population

    NASA Astrophysics Data System (ADS)

    Zangari, Amanda Marie; Parker, Alex; Singer, Kelsi N.; Stern, S. Alan; Young, Leslie; Olkin, Catherine B.; Ennico, Kimberly; Weaver, Harold A.; New Horizons Geology, Geophysics and Imaging Science Theme Team

    2016-10-01

    In July 2015, New Horizons flew by Pluto and Charon, allowing mapping of the encounter hemisphere at high enough resolution to produce crater counts from the surfaces of the pair. We investigate the distribution of craters in search of a signature of binary impactors. The Kuiper Belt -- especially the cold classical region -- has a large fraction of binary objects, many of which are close-in, equal-mass binaries. We will present results on how the distribution of craters seen on Pluto and Charon compares to a random distribution of single body impactors on the surfaces of each. Examining the surfaces of Pluto and Charon proves challenging due to resurfacing, and the presence of tectonic and other geographic features. For example, the informally-named Cthulhu region is among the oldest on Pluto, yet it abuts a craterless region millions of years young. On Charon, chastmata divide the surface into regions informally named Vulcan Planum and Oz terra. In our statistics, we pay careful attention to the boundaries of where craters may appear, and the dependence of our results on crater size. This work was supported by NASA's New Horizons project.

  7. Directed searches for continuous gravitational waves from binary systems: Parameter-space metrics and optimal Scorpius X-1 sensitivity

    NASA Astrophysics Data System (ADS)

    Leaci, Paola; Prix, Reinhard

    2015-05-01

    We derive simple analytic expressions for the (coherent and semicoherent) phase metrics of continuous-wave sources in low-eccentricity binary systems for the two regimes of long and short segments compared to the orbital period. The resulting expressions correct and extend previous results found in the literature. We present results of extensive Monte Carlo studies comparing metric mismatch predictions against the measured loss of detection statistics for binary parameter offsets. The agreement is generally found to be within ˜10 %- 30 % . For an application of the metric template expressions, we estimate the optimal achievable sensitivity of an Einstein@Home directed search for Scorpius X-1, under the assumption of sufficiently small spin wandering. We find that such a search, using data from the upcoming advanced detectors, would be able to beat the torque-balance level [R. V. Wagoner, Astrophys. J. 278, 345 (1984); L. Bildsten, Astrophys. J. 501, L89 (1998).] up to a frequency of ˜500 - 600 Hz , if orbital eccentricity is well constrained, and up to a frequency of ˜160 - 200 Hz for more conservative assumptions about the uncertainty on orbital eccentricity.

  8. A VLBA SEARCH FOR BINARY BLACK HOLES IN ACTIVE GALACTIC NUCLEI WITH DOUBLE-PEAKED OPTICAL EMISSION LINE SPECTRA

    SciTech Connect

    Tingay, S. J.; Wayth, R. B.

    2011-06-15

    We have examined a subset of 11 active galactic nuclei (AGNs) drawn from a sample of 87 objects that possess double-peaked optical emission line spectra, as put forward by Wang et al. and are detectable in the Faint Images of the Radio Sky at Twenty-centimeters (FIRST) survey at radio wavelengths. The double-peaked nature of the optical emission line spectra has been suggested as evidence for the existence of binary black holes in these AGNs, although this interpretation is controversial. We make a simple suggestion that direct evidence of binary black holes in these objects could be searched for in the form of dual sources of compact radio emission associated with the AGNs. To explore this idea, we have used the Very Long Baseline Array to observe these 11 objects from the Wang et al. sample. Of the 11 objects, we detect compact radio emission from two, SDSS J151709+335324 and SDSS J160024+264035. Both objects show single components of compact radio emission. The morphology of SDSS J151709+335324 is consistent with a recent comprehensive multi-wavelength study of this object by Rosario et al. Assuming that the entire sample consists of binary black holes, we would expect of order one double radio core to be detected, based on radio wavelength detection rates from FIRST and very long baseline interferometry surveys. We have not detected any double cores, thus this work does not substantially support the idea that AGNs with double-peaked optical emission lines contain binary black holes. However, the study of larger samples should be undertaken to provide a more secure statistical result, given the estimated detection rates.

  9. Searching for gravitational-waves from compact binary coalescences while dealing with challenges of real data and simulated waveforms

    NASA Astrophysics Data System (ADS)

    Dayanga, Waduthanthree Thilina

    Albert Einstein's general theory of relativity predicts the existence of gravitational waves (GWs). Direct detection of GWs will provide enormous amount of new information about physics, astronomy and cosmology. Scientists around the world are currently working towards the first direct detection of GWs. The global network of ground-based GW detectors are currently preparing for their first advanced detector Science runs. In this thesis we focus on detection of GWs from compact binary coalescence (CBC) systems. Ability to accurately model CBC GW waveforms makes them the most promising source for the first direct detection of GWs. In this thesis we try to address several challenges associated with detecting CBC signals buried in ground-based GW detector data for past and future searches. Data analysis techniques we employ to detect GW signals assume detector noise is Gaussian and stationary. However, in reality, detector data is neither Gaussian nor stationary. To estimate the performance loss due to these features, we compare the efficiencies of detecting CBC signals in simulated Gaussian and real data. Additionally, we also demonstrate the effectiveness of multi-detector signal based consistency tests such ad null-stream. Despite, non-Gaussian and non-stationary features of real detector data, with effective data quality studies and signal-based vetoes we can approach the performance of Gaussian and stationary data. As we are moving towards advanced detector era, it is important to be prepared for future CBC searches. In this thesis we investigate the performances of non-spinning binary black hole (BBH) searches in simulated Gaussian using advanced detector noise curves predicted for 2015--2016. In the same study, we analyze the GW detection probabilities of latest pN-NR hybrid waveforms submitted to second version of Numerical Injection Analysis (NINJA-2) project. The main motivation for this study is to understand the ability to detect realistic BBH signals of

  10. A Low Cost Key Agreement Protocol Based on Binary Tree for EPCglobal Class 1 Generation 2 RFID Protocol

    NASA Astrophysics Data System (ADS)

    Jeng, Albert; Chang, Li-Chung; Chen, Sheng-Hui

    There are many protocols proposed for protecting Radio Frequency Identification (RFID) system privacy and security. A number of these protocols are designed for protecting long-term security of RFID system using symmetric key or public key cryptosystem. Others are designed for protecting user anonymity and privacy. In practice, the use of RFID technology often has a short lifespan, such as commodity check out, supply chain management and so on. Furthermore, we know that designing a long-term security architecture to protect the security and privacy of RFID tags information requires a thorough consideration from many different aspects. However, any security enhancement on RFID technology will jack up its cost which may be detrimental to its widespread deployment. Due to the severe constraints of RFID tag resources (e. g., power source, computing power, communication bandwidth) and open air communication nature of RFID usage, it is a great challenge to secure a typical RFID system. For example, computational heavy public key and symmetric key cryptography algorithms (e. g., RSA and AES) may not be suitable or over-killed to protect RFID security or privacy. These factors motivate us to research an efficient and cost effective solution for RFID security and privacy protection. In this paper, we propose a new effective generic binary tree based key agreement protocol (called BKAP) and its variations, and show how it can be applied to secure the low cost and resource constraint RFID system. This BKAP is not a general purpose key agreement protocol rather it is a special purpose protocol to protect privacy, un-traceability and anonymity in a single RFID closed system domain.

  11. Investigating the effect of precession on searches for neutron-star-black-hole binaries with Advanced LIGO

    NASA Astrophysics Data System (ADS)

    Harry, Ian W.; Nitz, Alexander H.; Brown, Duncan A.; Lundgren, Andrew P.; Ochsner, Evan; Keppel, Drew

    2014-01-01

    The first direct detection of neutron-star- black-hole binaries will likely be made with gravitational-wave observatories. Advanced LIGO and Advanced Virgo will be able to observe neutron-star- black-hole mergers at a maximum distance of 900 Mpc. To achieve this sensitivity, gravitational-wave searches will rely on using a bank of filter waveforms that accurately model the expected gravitational-wave signal. The emitted signal will depend on the masses of the black hole and the neutron star and also the angular momentum of both components. The angular momentum of the black hole is expected to be comparable to the orbital angular momentum when the system is emitting gravitational waves in Advanced LIGO's and Advanced Virgo's sensitive band. This angular momentum will affect the dynamics of the inspiralling system and alter the phase evolution of the emitted gravitational-wave signal. In addition, if the black hole's angular momentum is not aligned with the orbital angular momentum, it will cause the orbital plane of the system to precess. In this work we demonstrate that if the effect of the black hole's angular momentum is neglected in the waveform models used in gravitational-wave searches, the detection rate of (10+1.4)M⊙ neutron-star- black-hole systems with isotropic spin distributions would be reduced by 33%-37% in comparison to a hypothetical perfect search at a fixed signal-to-noise ratio threshold. The error in this measurement is due to uncertainty in the post-Newtonian approximations that are used to model the gravitational-wave signal of neutron-star- black-hole inspiralling binaries. We describe a new method for creating a bank of filter waveforms where the black hole has nonzero angular momentum that is aligned with the orbital angular momentum. With this bank we find that the detection rate of (10+1.4)M⊙ neutron-star- black-hole systems would be reduced by 26%-33%. Systems that will not be detected are ones where the precession of the orbital

  12. Trees

    NASA Astrophysics Data System (ADS)

    Epstein, Henri

    2016-11-01

    An algebraic formalism, developed with V. Glaser and R. Stora for the study of the generalized retarded functions of quantum field theory, is used to prove a factorization theorem which provides a complete description of the generalized retarded functions associated with any tree graph. Integrating over the variables associated to internal vertices to obtain the perturbative generalized retarded functions for interacting fields arising from such graphs is shown to be possible for a large category of space-times.

  13. Novel phases of lithium-aluminum binaries from first-principles structural search

    SciTech Connect

    Sarmiento-Pérez, Rafael; Cerqueira, Tiago F. T.; Botti, Silvana; Marques, Miguel A. L.; Valencia-Jaime, Irais; Amsler, Maximilian; Goedecker, Stefan; Romero, Aldo H.

    2015-01-14

    Intermetallic Li–Al compounds are on the one hand key materials for light-weight engineering, and on the other hand, they have been proposed for high-capacity electrodes for Li batteries. We determine from first-principles the phase diagram of Li–Al binary crystals using the minima hopping structural prediction method. Beside reproducing the experimentally reported phases (LiAl, Li{sub 3}Al{sub 2}, Li{sub 9}Al{sub 4}, LiAl{sub 3}, and Li{sub 2}Al), we unveil a structural variety larger than expected by discovering six unreported binary phases likely to be thermodynamically stable. Finally, we discuss the behavior of the elastic constants and of the electric potential profile of all Li–Al stable compounds as a function of their stoichiometry.

  14. A Search for Very High Energy Gamma Rays from the Missing Link Binary Pulsar J1023+0038 with VERITAS

    NASA Astrophysics Data System (ADS)

    Aliu, E.; Archambault, S.; Archer, A.; Benbow, W.; Bird, R.; Biteau, J.; Buchovecky, M.; Buckley, J. H.; Bugaev, V.; Byrum, K.; Cardenzana, J. V.; Cerruti, M.; Chen, X.; Ciupik, L.; Connolly, M. P.; Cui, W.; Dickinson, H. J.; Eisch, J. D.; Falcone, A.; Feng, Q.; Finley, J. P.; Fleischhack, H.; Flinders, A.; Fortin, P.; Fortson, L.; Furniss, A.; Gillanders, G. H.; Griffin, S.; Grube, J.; Gyuk, G.; Hütten, M.; Håkansson, N.; Holder, J.; Humensky, T. B.; Johnson, C. A.; Kaaret, P.; Kar, P.; Kelley-Hoskins, N.; Kertzman, M.; Kieda, D.; Krause, M.; Lang, M. J.; Loo, A.; Maier, G.; McArthur, S.; McCann, A.; Meagher, K.; Moriarty, P.; Mukherjee, R.; Nguyen, T.; Nieto, D.; O'Faoláin de Bhróithe, A.; Ong, R. A.; Otte, A. N.; Pandel, D.; Park, N.; Pelassa, V.; Petrashyk, A.; Pohl, M.; Popkow, A.; Pueschel, E.; Quinn, J.; Ragan, K.; Reynolds, P. T.; Richards, G. T.; Roache, E.; Rulten, C.; Santander, M.; Sembroski, G. H.; Shahinyan, K.; Smith, A. W.; Staszak, D.; Telezhinsky, I.; Tucci, J. V.; Tyler, J.; Varlotta, A.; Vincent, S.; Wakely, S. P.; Weiner, O. M.; Weinstein, A.; Wilhelm, A.; Williams, D. A.; Zitzer, B.; Chernyakova, M.; Roberts, M. S. E.

    2016-11-01

    The binary millisecond radio pulsar PSR J1023+0038 exhibits many characteristics similar to the gamma-ray binary system PSR B1259-63/LS 2883, making it an ideal candidate for the study of high-energy nonthermal emission. It has been the subject of multiwavelength campaigns following the disappearance of the pulsed radio emission in 2013 June, which revealed the appearance of an accretion disk around the neutron star. We present the results of very high energy (VHE) gamma-ray observations carried out by the Very Energetic Radiation Imaging Telescope Array System before and after this change of state. Searches for steady and pulsed emission of both data sets yield no significant gamma-ray signal above 100 GeV, and upper limits are given for both a steady and pulsed gamma-ray flux. These upper limits are used to constrain the magnetic field strength in the shock region of the PSR J1023+0038 system. Assuming that VHE gamma rays are produced via an inverse Compton mechanism in the shock region, we constrain the shock magnetic field to be greater than ˜2 G before the disappearance of the radio pulsar and greater than ˜10 G afterward.

  15. Algorithms for Regular Tree Grammar Network Search and Their Application to Mining Human-viral Infection Patterns.

    PubMed

    Smoly, Ilan; Carmel, Amir; Shemer-Avni, Yonat; Yeger-Lotem, Esti; Ziv-Ukelson, Michal

    2016-03-01

    Network querying is a powerful approach to mine molecular interaction networks. Most state-of-the-art network querying tools either confine the search to a prespecified topology in the form of some template subnetwork, or do not specify any topological constraints at all. Another approach is grammar-based queries, which are more flexible and expressive as they allow for expressing the topology of the sought pattern according to some grammar-based logic. Previous grammar-based network querying tools were confined to the identification of paths. In this article, we extend the patterns identified by grammar-based query approaches from paths to trees. For this, we adopt a higher order query descriptor in the form of a regular tree grammar (RTG). We introduce a novel problem and propose an algorithm to search a given graph for the k highest scoring subgraphs matching a tree accepted by an RTG. Our algorithm is based on the combination of dynamic programming with color coding, and includes an extension of previous k-best parsing optimization approaches to avoid isomorphic trees in the output. We implement the new algorithm and exemplify its application to mining viral infection patterns within molecular interaction networks. Our code is available online.

  16. Template banks to search for low-mass binary black holes in advanced gravitational-wave detectors

    NASA Astrophysics Data System (ADS)

    Brown, Duncan A.; Kumar, Prayush; Nitz, Alexander H.

    2013-04-01

    Coalescing binary black holes (BBHs) are among the most likely sources for the Laser Interferometer Gravitational-Wave Observatory (LIGO) and its international partners Virgo and KAGRA. Optimal searches for BBHs require accurate waveforms for the signal model and effectual template banks that cover the mass space of interest. We investigate the ability of the second-order post-Newtonian TaylorF2 hexagonal template placement metric to construct an effectual template bank, if the template waveforms used are effective one-body waveforms tuned to numerical relativity (EOBNRv2). We find that by combining the existing TaylorF2 placement metric with EOBNRv2 waveforms, we can construct an effectual search for BBHs with component masses in the range 3M⊙≤m1, m2≤25M⊙. We also show that the (computationally less expensive) TaylorF2 post-Newtonian waveforms can be used in place of EOBNRv2 waveforms when M≲11.4M⊙. Finally, we investigate the effect of modes other than the dominant l=m=2 mode in BBH searches. We find that for systems with (m1/m2)≤1.68 or inclination angle ι≤0.31 or ι≥2.68 radians, there is no significant loss in the total possible signal-to-noise ratio due to neglecting modes other than l=m=2 in the template waveforms. For a source population uniformly distributed in spacial volume, over the entire sampled region of the component-mass space, the loss in detection rate (averaged over a uniform distribution of inclination angle and sky-location/polarization angles) remains below ˜11%. For binaries with high mass ratios and 0.31≤ι≤2.68, including higher-order modes could increase the signal-to-noise ratio by as much as 8% in Advanced LIGO. Our results can be used to construct matched-filter searches in Advanced LIGO and Advanced Virgo.

  17. An Infrared Search for Binary Companions to White Dwarfs with Hard X-Ray Emission

    NASA Astrophysics Data System (ADS)

    O'Dwyer, Ian J.; Gruendl, Robert; Chu, You-Hua; Guerrero, Martin A.

    2002-08-01

    A white dwarf (WD) can emit soft (≪ 0.4 keV) X-rays, if it is hot enough, i.e., T_eff > 30,000 K for a pure hydrogen atmosphere or T_eff > 100,000 K for a hydrogen and helium atmosphere. A WD can also emit harder (> 0.5 keV) X-rays, if it has a close binary companion and mass transfer takes place, e.g., dwarf novae, polars, and cataclysmic variables. We found a large number of hard X-ray emitting WDs by cross-correlating the McCook & Sion (1999) catalog of WDs with the ROSAT point source database. We have verified the position of the WD, analysed the ROSAT data and extracted X-ray spectra to confirm the hard X-ray component. Since the only current explanation for hard X-ray emission from a WD involves a stellar companion and only five of the ~40 WDs that exhibit hard X-ray emission are known binary systems, we wish to investigate whether hard X-ray emssion is a useful diagnostic for the presence of companions to WDs. We request KPNO 2.1m SQIID near infrared photometric observations of a sample of 34 WDs, 23 of which exhibit hard X-ray emission, to look for an infrared excess consistent with the presence of a stellar companion.

  18. The generalised k-Truncated Suffix Tree for time-and space-efficient searches in multiple DNA or protein sequences.

    PubMed

    Schulz, Marcel H; Bauer, Sebastian; Robinson, Peter N

    2008-01-01

    Efficient searching for specific subsequences in a set of longer sequences is an important component of many bioinformatics algorithms. Generalised suffix trees and suffix arrays allow searches for a pattern of length n in time proportional to n independent of the length of the sequences, and are thus attractive for a variety of applications. Here, we present an algorithm termed the generalised k-Truncated Suffix Tree (kTST), that represents an adaption of Ukkonen's linear-time suffix tree construction algorithm. The kTST algorithm creates a k-deep tree in linear time that allows rapid searches for short patterns of length of up to k characters. The kTST can offer advantages in computational time and memory usage for searches for short sequences in DNA or protein sequences compared to other suffix-based algorithms.

  19. The PyCBC search pipeline for detecting gravitational waves from compact binary mergers

    NASA Astrophysics Data System (ADS)

    Nitz, Alexander; LIGO Scientific Collaboration

    2016-03-01

    We present the matched-filtering based PyCBC offline pipeline used to analyze the first Advanced LIGO observing run. The search has been developed to find gravitational waves from the mergers of black holes and neutron stars with a total mass between 2 and 100 solar masses using a bank of templates. We describe the techniques used to extract signals, suppress non-Gaussian noise transients, and estimate the background of false alarms.

  20. Testing the validity of the phenomenological gravitational waveform models for nonspinning binary black hole searches at low masses

    NASA Astrophysics Data System (ADS)

    Cho, Hee-Suk

    2015-11-01

    The phenomenological gravitational waveform models, which we refer to as PhenomA, PhenomB, and PhenomC, generate full inspiral, merger, and ringdown (IMR) waveforms of coalescing binary back holes (BBHs). These models are defined in the Fourier domain, thus can be used for fast matched filtering in the gravitational wave search. PhenomA has been developed for nonspinning BBH waveforms, while PhenomB and PhenomC were designed to model the waveforms of BBH systems with nonprecessing (aligned) spins, but can also be used for nonspinning systems. In this work, we study the validity of the phenomenological models for nonspinning BBH searches at low masses, {m}{1,2}≥slant 4{M}⊙ and {m}1+{m}2\\equiv M≤slant 30{M}⊙ , with Advanced LIGO. As our complete signal waveform model, we adopt EOBNRv2, which is a time-domain IMR waveform model. To investigate the search efficiency of the phenomenological template models, we calculate fitting factors (FFs) by exploring overlap surfaces. We find that only PhenomC is valid to obtain FFs better than 0.97 in the mass range of M\\lt 15{M}⊙ . Above 15{M}⊙ , PhenomA is most efficient in symmetric mass region, PhenomB is most efficient in highly asymmetric mass region, and PhenomC is most efficient in the intermediate region. Specifically, we propose an effective phenomenological template family that can be constructed by employing the phenomenological models in four subregions individually. We find that FFs of the effective templates are better than 0.97 in our entire mass region and mostly greater than 0.99.

  1. A searching of past large Solar Proton Event by measuring carbon-14 content in tree-rings

    NASA Astrophysics Data System (ADS)

    Miyake, F.; Masuda, K.; Hakozaki, M.; Nakamura, T.; Kimura, K.

    2014-12-01

    Radiocarbon (14C) is produced by incoming cosmic rays to the Earth. The produced 14C becomes 14CO2 and is absorbed by trees by photosynthesis. If a large Solar Proton Event (SPE) had occurred in the past, tree-rings would record such an event as a sudden 14C increase within 1-year. Recently we found two signatures of large SPEs in AD 774-775 and AD 993-994 by the measurement of the 14C content in tree-rings. Some studies have estimated a scale of the AD 775 event as ten to dozens of times larger than the largest SPE on record. There is the possibility that a lot of such events are hidden in the periods when the 14C content has not been measured with a 1-year resolution. If we detect such events, we are able to discuss a detailed occurrence rate of the large SPE which is very important factor to prepare for future large SPEs. We are planning to search for the past large SPEs by the measurements of 14C content in Japanese trees for this 5000 years. In this thesis, we are going to explain the plan and problems.

  2. Search for gravitational radiation from intermediate mass black hole binaries in data from the second LIGO-Virgo joint science run

    NASA Astrophysics Data System (ADS)

    Aasi, J.; Abbott, B. P.; Abbott, R.; Abbott, T.; Abernathy, M. R.; Accadia, T.; Acernese, F.; Ackley, K.; Adams, C.; Adams, T.; Addesso, P.; Adhikari, R. X.; Affeldt, C.; Agathos, M.; Aggarwal, N.; Aguiar, O. D.; Ain, A.; Ajith, P.; Alemic, A.; Allen, B.; Allocca, A.; Amariutei, D.; Andersen, M.; Anderson, R.; Anderson, S. B.; Anderson, W. G.; Arai, K.; Araya, M. C.; Arceneaux, C.; Areeda, J.; Aston, S. M.; Astone, P.; Aufmuth, P.; Aulbert, C.; Austin, L.; Aylott, B. E.; Babak, S.; Baker, P. T.; Ballardin, G.; Ballmer, S. W.; Barayoga, J. C.; Barbet, M.; Barish, B. C.; Barker, D.; Barone, F.; Barr, B.; Barsotti, L.; Barsuglia, M.; Barton, M. A.; Bartos, I.; Bassiri, R.; Basti, A.; Batch, J. C.; Bauchrowitz, J.; Bauer, Th. S.; Bavigadda, V.; Behnke, B.; Bejger, M.; Beker, M. G.; Belczynski, C.; Bell, A. S.; Bell, C.; Bergmann, G.; Bersanetti, D.; Bertolini, A.; Betzwieser, J.; Beyersdorf, P. T.; Bilenko, I. A.; Billingsley, G.; Birch, J.; Biscans, S.; Bitossi, M.; Bizouard, M. A.; Black, E.; Blackburn, J. K.; Blackburn, L.; Blair, D.; Bloemen, S.; Blom, M.; Bock, O.; Bodiya, T. P.; Boer, M.; Bogaert, G.; Bogan, C.; Bond, C.; Bondu, F.; Bonelli, L.; Bonnand, R.; Bork, R.; Born, M.; Boschi, V.; Bose, Sukanta; Bosi, L.; Bradaschia, C.; Brady, P. R.; Braginsky, V. B.; Branchesi, M.; Brau, J. E.; Briant, T.; Bridges, D. O.; Brillet, A.; Brinkmann, M.; Brisson, V.; Brooks, A. F.; Brown, D. A.; Brown, D. D.; Brückner, F.; Buchman, S.; Bulik, T.; Bulten, H. J.; Buonanno, A.; Burman, R.; Buskulic, D.; Buy, C.; Cadonati, L.; Cagnoli, G.; Calderón Bustillo, J.; Calloni, E.; Camp, J. B.; Campsie, P.; Cannon, K. C.; Canuel, B.; Cao, J.; Capano, C. D.; Carbognani, F.; Carbone, L.; Caride, S.; Castiglia, A.; Caudill, S.; Cavaglià, M.; Cavalier, F.; Cavalieri, R.; Celerier, C.; Cella, G.; Cepeda, C.; Cesarini, E.; Chakraborty, R.; Chalermsongsak, T.; Chamberlin, S. J.; Chao, S.; Charlton, P.; Chassande-Mottin, E.; Chen, X.; Chen, Y.; Chincarini, A.; Chiummo, A.; Cho, H. S.; Chow, J.; Christensen, N.; Chu, Q.; Chua, S. S. Y.; Chung, S.; Ciani, G.; Clara, F.; Clark, J. A.; Cleva, F.; Coccia, E.; Cohadon, P.-F.; Colla, A.; Collette, C.; Colombini, M.; Cominsky, L.; Constancio, M.; Conte, A.; Cook, D.; Corbitt, T. R.; Cordier, M.; Cornish, N.; Corpuz, A.; Corsi, A.; Costa, C. A.; Coughlin, M. W.; Coughlin, S.; Coulon, J.-P.; Countryman, S.; Couvares, P.; Coward, D. M.; Cowart, M.; Coyne, D. C.; Coyne, R.; Craig, K.; Creighton, J. D. E.; Crowder, S. G.; Cumming, A.; Cunningham, L.; Cuoco, E.; Dahl, K.; Canton, T. Dal; Damjanic, M.; Danilishin, S. L.; D'Antonio, S.; Danzmann, K.; Dattilo, V.; Daveloza, H.; Davier, M.; Davies, G. S.; Daw, E. J.; Day, R.; Dayanga, T.; Debreczeni, G.; Degallaix, J.; Deléglise, S.; Del Pozzo, W.; Denker, T.; Dent, T.; Dereli, H.; Dergachev, V.; De Rosa, R.; DeRosa, R. T.; DeSalvo, R.; Dhurandhar, S.; Díaz, M.; Di Fiore, L.; Di Lieto, A.; Di Palma, I.; Di Virgilio, A.; Donath, A.; Donovan, F.; Dooley, K. L.; Doravari, S.; Dossa, S.; Douglas, R.; Downes, T. P.; Drago, M.; Drever, R. W. P.; Driggers, J. C.; Du, Z.; Ducrot, M.; Dwyer, S.; Eberle, T.; Edo, T.; Edwards, M.; Effler, A.; Eggenstein, H.; Ehrens, P.; Eichholz, J.; Eikenberry, S. S.; Endrőczi, G.; Essick, R.; Etzel, T.; Evans, M.; Evans, T.; Factourovich, M.; Fafone, V.; Fairhurst, S.; Fang, Q.; Farinon, S.; Farr, B.; Farr, W. M.; Favata, M.; Fehrmann, H.; Fejer, M. M.; Feldbaum, D.; Feroz, F.; Ferrante, I.; Ferrini, F.; Fidecaro, F.; Finn, L. S.; Fiori, I.; Fisher, R. P.; Flaminio, R.; Fournier, J.-D.; Franco, S.; Frasca, S.; Frasconi, F.; Frede, M.; Frei, Z.; Freise, A.; Frey, R.; Fricke, T. T.; Fritschel, P.; Frolov, V. V.; Fulda, P.; Fyffe, M.; Gair, J.; Gammaitoni, L.; Gaonkar, S.; Garufi, F.; Gehrels, N.; Gemme, G.; Genin, E.; Gennai, A.; Ghosh, S.; Giaime, J. A.; Giardina, K. D.; Giazotto, A.; Gill, C.; Gleason, J.; Goetz, E.; Goetz, R.; Gondan, L.; González, G.; Gordon, N.; Gorodetsky, M. L.; Gossan, S.; Goßler, S.; Gouaty, R.; Gräf, C.; Graff, P. B.; Granata, M.; Grant, A.; Gras, S.; Gray, C.; Greenhalgh, R. J. S.; Gretarsson, A. M.; Groot, P.; Grote, H.; Grover, K.; Grunewald, S.; Guidi, G. M.; Guido, C.; Gushwa, K.; Gustafson, E. K.; Gustafson, R.; Hammer, D.; Hammond, G.; Hanke, M.; Hanks, J.; Hanna, C.; Hanson, J.; Harms, J.; Harry, G. M.; Harry, I. W.; Harstad, E. D.; Hart, M.; Hartman, M. T.; Haster, C.-J.; Haughian, K.; Heidmann, A.; Heintze, M.; Heitmann, H.; Hello, P.; Hemming, G.; Hendry, M.; Heng, I. S.; Heptonstall, A. W.; Heurs, M.; Hewitson, M.; Hild, S.; Hoak, D.; Hodge, K. A.; Holt, K.; Hooper, S.; Hopkins, P.; Hosken, D. J.; Hough, J.; Howell, E. J.; Hu, Y.; Huerta, E.; Hughey, B.; Husa, S.; Huttner, S. H.; Huynh, M.; Huynh-Dinh, T.; Ingram, D. R.; Inta, R.; Isogai, T.; Ivanov, A.; Iyer, B. R.; Izumi, K.; Jacobson, M.; James, E.; Jang, H.; Jaranowski, P.; Ji, Y.; Jiménez-Forteza, F.; Johnson, W. W.; Jones, D. I.; Jones, R.; Jonker, R. J. G.; Ju, L.; K, Haris; Kalmus, P.; Kalogera, V.; Kandhasamy, S.; Kang, G.; Kanner, J. B.; Karlen, J.; Kasprzack, M.; Katsavounidis, E.; Katzman, W.; Kaufer, H.; Kawabe, K.; Kawazoe, F.; Kéfélian, F.; Keiser, G. M.; Keitel, D.; Kelley, D. B.; Kells, W.; Khalaidovski, A.; Khalili, F. Y.; Khazanov, E. A.; Kim, C.; Kim, K.; Kim, N. G.; Kim, N.; Kim, Y.-M.; King, E. J.; King, P. J.; Kinzel, D. L.; Kissel, J. S.; Klimenko, S.; Kline, J.; Koehlenbeck, S.; Kokeyama, K.; Kondrashov, V.; Koranda, S.; Korth, W. Z.; Kowalska, I.; Kozak, D. B.; Kremin, A.; Kringel, V.; Krishnan, B.; Królak, A.; Kuehn, G.; Kumar, A.; Kumar, P.; Kumar, R.; Kuo, L.; Kutynia, A.; Kwee, P.; Landry, M.; Lantz, B.; Larson, S.; Lasky, P. D.; Lawrie, C.; Lazzarini, A.; Lazzaro, C.; Leaci, P.; Leavey, S.; Lebigot, E. O.; Lee, C.-H.; Lee, H. K.; Lee, H. M.; Lee, J.; Leonardi, M.; Leong, J. R.; Le Roux, A.; Leroy, N.; Letendre, N.; Levin, Y.; Levine, B.; Lewis, J.; Li, T. G. F.; Libbrecht, K.; Libson, A.; Lin, A. C.; Littenberg, T. B.; Litvine, V.; Lockerbie, N. A.; Lockett, V.; Lodhia, D.; Loew, K.; Logue, J.; Lombardi, A. L.; Lorenzini, M.; Loriette, V.; Lormand, M.; Losurdo, G.; Lough, J.; Lubinski, M. J.; Lück, H.; Luijten, E.; Lundgren, A. P.; Lynch, R.; Ma, Y.; Macarthur, J.; Macdonald, E. P.; MacDonald, T.; Machenschalk, B.; MacInnis, M.; Macleod, D. M.; Magana-Sandoval, F.; Mageswaran, M.; Maglione, C.; Mailand, K.; Majorana, E.; Maksimovic, I.; Malvezzi, V.; Man, N.; Manca, G. M.; Mandel, I.; Mandic, V.; Mangano, V.; Mangini, N.; Mantovani, M.; Marchesoni, F.; Marion, F.; Márka, S.; Márka, Z.; Markosyan, A.; Maros, E.; Marque, J.; Martelli, F.; Martin, I. W.; Martin, R. M.; Martinelli, L.; Martynov, D.; Marx, J. N.; Mason, K.; Masserot, A.; Massinger, T. J.; Matichard, F.; Matone, L.; Matzner, R. A.; Mavalvala, N.; Mazumder, N.; Mazzolo, G.; McCarthy, R.; McClelland, D. E.; McGuire, S. C.; McIntyre, G.; McIver, J.; McLin, K.; Meacher, D.; Meadors, G. D.; Mehmet, M.; Meidam, J.; Meinders, M.; Melatos, A.; Mendell, G.; Mercer, R. A.; Meshkov, S.; Messenger, C.; Meyers, P.; Miao, H.; Michel, C.; Mikhailov, E. E.; Milano, L.; Milde, S.; Miller, J.; Minenkov, Y.; Mingarelli, C. M. F.; Mishra, C.; Mitra, S.; Mitrofanov, V. P.; Mitselmakher, G.; Mittleman, R.; Moe, B.; Moesta, P.; Moggi, A.; Mohan, M.; Mohapatra, S. R. P.; Moraru, D.; Moreno, G.; Morgado, N.; Morriss, S. R.; Mossavi, K.; Mours, B.; Mow-Lowry, C. M.; Mueller, C. L.; Mueller, G.; Mukherjee, S.; Mullavey, A.; Munch, J.; Murphy, D.; Murray, P. G.; Mytidis, A.; Nagy, M. F.; Nanda Kumar, D.; Nardecchia, I.; Naticchioni, L.; Nayak, R. K.; Necula, V.; Nelemans, G.; Neri, I.; Neri, M.; Newton, G.; Nguyen, T.; Nitz, A.; Nocera, F.; Nolting, D.; Normandin, M. E. N.; Nuttall, L. K.; Ochsner, E.; O'Dell, J.; Oelker, E.; Oh, J. J.; Oh, S. H.; Ohme, F.; Oppermann, P.; O'Reilly, B.; O'Shaughnessy, R.; Osthelder, C.; Ottaway, D. J.; Ottens, R. S.; Overmier, H.; Owen, B. J.; Padilla, C.; Pai, A.; Palashov, O.; Palomba, C.; Pan, H.; Pan, Y.; Pankow, C.; Paoletti, F.; Papa, M. A.; Paris, H.; Pasqualetti, A.; Passaquieti, R.; Passuello, D.; Pedraza, M.; Penn, S.; Perreca, A.; Phelps, M.; Pichot, M.; Pickenpack, M.; Piergiovanni, F.; Pierro, V.; Pinard, L.; Pinto, I. M.; Pitkin, M.; Poeld, J.; Poggiani, R.; Poteomkin, A.; Powell, J.; Prasad, J.; Premachandra, S.; Prestegard, T.; Price, L. R.; Prijatelj, M.; Privitera, S.; Prodi, G. A.; Prokhorov, L.; Puncken, O.; Punturo, M.; Puppo, P.; Qin, J.; Quetschke, V.; Quintero, E.; Quiroga, G.; Quitzow-James, R.; Raab, F. J.; Rabeling, D. S.; Rácz, I.; Radkins, H.; Raffai, P.; Raja, S.; Rajalakshmi, G.; Rakhmanov, M.; Ramet, C.; Ramirez, K.; Rapagnani, P.; Raymond, V.; Re, V.; Read, J.; Reed, C. M.; Regimbau, T.; Reid, S.; Reitze, D. H.; Rhoades, E.; Ricci, F.; Riles, K.; Robertson, N. A.; Robinet, F.; Rocchi, A.; Rodruck, M.; Rolland, L.; Rollins, J. G.; Romano, R.; Romanov, G.; Romie, J. H.; Rosińska, D.; Rowan, S.; Rüdiger, A.; Ruggi, P.; Ryan, K.; Salemi, F.; Sammut, L.; Sandberg, V.; Sanders, J. R.; Sannibale, V.; Santiago-Prieto, I.; Saracco, E.; Sassolas, B.; Sathyaprakash, B. S.; Saulson, P. R.; Savage, R.; Scheuer, J.; Schilling, R.; Schnabel, R.; Schofield, R. M. S.; Schreiber, E.; Schuette, D.; Schutz, B. F.; Scott, J.; Scott, S. M.; Sellers, D.; Sengupta, A. S.; Sentenac, D.; Sequino, V.; Sergeev, A.; Shaddock, D.; Shah, S.; Shahriar, M. S.; Shaltev, M.; Shapiro, B.; Shawhan, P.; Shoemaker, D. H.; Sidery, T. L.; Siellez, K.; Siemens, X.; Sigg, D.; Simakov, D.; Singer, A.; Singer, L.; Singh, R.; Sintes, A. M.; Slagmolen, B. J. J.; Slutsky, J.; Smith, J. R.; Smith, M.; Smith, R. J. E.; Smith-Lefebvre, N. D.; Son, E. J.; Sorazu, B.; Souradeep, T.; Staley, A.; Stebbins, J.; Steinlechner, J.; Steinlechner, S.; Stephens, B. C.; Steplewski, S.; Stevenson, S.; Stone, R.; Stops, D.; Strain, K. A.; Straniero, N.; Strigin, S.; Sturani, R.; Stuver, A. L.; Summerscales, T. Z.; Susmithan, S.; Sutton, P. J.; Swinkels, B.; Tacca, M.; Talukder, D.; Tanner, D. B.; Tarabrin, S. P.; Taylor, R.; ter Braack, A. P. M.; Thirugnanasambandam, M. P.; Thomas, M.; Thomas, P.; Thorne, K. A.; Thorne, K. S.; Thrane, E.; Tiwari, V.; Tokmakov, K. V.; Tomlinson, C.; Tonelli, M.; Torres, C. V.; Torrie, C. I.; Travasso, F.; Traylor, G.; Tse, M.; Ugolini, D.; Unnikrishnan, C. S.; Urban, A. L.; Urbanek, K.; Vahlbruch, H.; Vajente, G.; Valdes, G.; Vallisneri, M.; van Beuzekom, M.; van den Brand, J. F. J.; Van Den Broeck, C.; van der Putten, S.; van der Sluys, M. V.; van Heijningen, J.; van Veggel, A. A.; Vass, S.; Vasúth, M.; Vaulin, R.; Vecchio, A.; Vedovato, G.; Veitch, J.; Veitch, P. J.; Venkateswara, K.; Verkindt, D.; Verma, S. S.; Vetrano, F.; Viceré, A.; Vincent-Finley, R.; Vinet, J.-Y.; Vitale, S.; Vo, T.; Vocca, H.; Vorvick, C.; Vousden, W. D.; Vyachanin, S. P.; Wade, A.; Wade, L.; Wade, M.; Walker, M.; Wallace, L.; Wang, M.; Wang, X.; Ward, R. L.; Was, M.; Weaver, B.; Wei, L.-W.; Weinert, M.; Weinstein, A. J.; Weiss, R.; Welborn, T.; Wen, L.; Wessels, P.; West, M.; Westphal, T.; Wette, K.; Whelan, J. T.; White, D. J.; Whiting, B. F.; Wiesner, K.; Wilkinson, C.; Williams, K.; Williams, L.; Williams, R.; Williams, T.; Williamson, A. R.; Willis, J. L.; Willke, B.; Wimmer, M.; Winkler, W.; Wipf, C. C.; Wiseman, A. G.; Wittel, H.; Woan, G.; Worden, J.; Yablon, J.; Yakushin, I.; Yamamoto, H.; Yancey, C. C.; Yang, H.; Yang, Z.; Yoshida, S.; Yvert, M.; ZadroŻny, A.; Zanolin, M.; Zendri, J.-P.; Zhang, Fan; Zhang, L.; Zhao, C.; Zhu, X. J.; Zucker, M. E.; Zuraw, S.; Zweizig, J.; LIGO Scientific Collaboration; Virgo Collaboration

    2014-06-01

    This paper reports on an unmodeled, all-sky search for gravitational waves from merging intermediate mass black hole binaries (IMBHB). The search was performed on data from the second joint science run of the LIGO and Virgo detectors (July 2009-October 2010) and was sensitive to IMBHBs with a range up to ˜200 Mpc, averaged over the possible sky positions and inclinations of the binaries with respect to the line of sight. No significant candidate was found. Upper limits on the coalescence-rate density of nonspinning IMBHBs with total masses between 100 and 450 M⊙ and mass ratios between 0.25 and 1 were placed by combining this analysis with an analogous search performed on data from the first LIGO-Virgo joint science run (November 2005-October 2007). The most stringent limit was set for systems consisting of two 88 M⊙ black holes and is equal to 0.12 Mpc-3 Myr-1 at the 90% confidence level. This paper also presents the first estimate, for the case of an unmodeled analysis, of the impact on the search range of IMBHB spin configurations: the visible volume for IMBHBs with nonspinning components is roughly doubled for a population of IMBHBs with spins aligned with the binary's orbital angular momentum and uniformly distributed in the dimensionless spin parameter up to 0.8, whereas an analogous population with antialigned spins decreases the visible volume by ˜20%.

  3. A spectroscopic search for colliding stellar winds in O-type close binary systems. III - 29 UW Canis Majoris

    NASA Technical Reports Server (NTRS)

    Wiggs, Michael S.; Gies, Douglas R.

    1993-01-01

    The orbital-phase variations in the optical emission lines and UV P Cygni lines of the massive O-type binary 29 UW Canis Majoris are investigated in a search for evidence of colliding winds. High SNR spectra of the H-alpha and He I 6678-A emission lines are presented, and radial velocity curves for several features associated with the photosphere of the more luminous primary star are given. The H-alpha features consists of a P Cygni component that shares the motion of the primary, and which probably originates at the base of its wind, and a broad, stationary emission component. It is proposed that the broad emission forms in a plane midway between the stars where the winds collide. A simple geometric model is used to show that this placement of the broad component can explain the lack of orbital velocity shifts, the near-constancy of the emission strength throughout the orbit, the large velocities associated with the H-alpha wings, and the constancy of the velocity range observed.

  4. A spectroscopic search for colliding stellar winds in O-type close binary systems. III - 29 UW Canis Majoris

    NASA Astrophysics Data System (ADS)

    Wiggs, Michael S.; Gies, Douglas R.

    1993-04-01

    The orbital-phase variations in the optical emission lines and UV P Cygni lines of the massive O-type binary 29 UW Canis Majoris are investigated in a search for evidence of colliding winds. High SNR spectra of the H-alpha and He I 6678-A emission lines are presented, and radial velocity curves for several features associated with the photosphere of the more luminous primary star are given. The H-alpha features consists of a P Cygni component that shares the motion of the primary, and which probably originates at the base of its wind, and a broad, stationary emission component. It is proposed that the broad emission forms in a plane midway between the stars where the winds collide. A simple geometric model is used to show that this placement of the broad component can explain the lack of orbital velocity shifts, the near-constancy of the emission strength throughout the orbit, the large velocities associated with the H-alpha wings, and the constancy of the velocity range observed.

  5. A Search for Fine Wines: Discovering Close Red Dwarf-White Dwarf Binaries

    NASA Astrophysics Data System (ADS)

    Boyd, Mark; Finch, C. T.; Hambly, N. C.; Henry, T. J.; Jao, W.; Riedel, A. R.; Subasavage, J. P.; Winters, J. G.; RECONS

    2012-01-01

    Like fine wines, stars come in both red and white varieties. Here we present initial results of the Fine Wines Project that targets red dwarf-white dwarf pairs. The two scientific goals of Fine Wines are (1) to develop methods to estimate ages for red dwarfs based on the cooling ages of the white dwarfs, and (2) to identify suitable pairs for dynamical mass determinations of white dwarfs to probe their interior structures. Here we focus on the search for Fine Wines, including sample selection, elimination of false positives, and initial reconnaissance. The sample was extracted via color-color plots from a pool of more than 30,000 proper motion systems examined during the SuperCOSMOS-RECONS (SCR) and UCAC3 Proper Motion (UPM) surveys. The initial sample of 75 best candidates is being observed for BVRI photometry and 3500-9500 A spectroscopy to confirm whether or not the systems are red dwarf-white dwarf pairs. Early results indicate that roughly 50% of the candidates selected are indeed Fine Wine systems. This effort is supported by the NSF through grant AST 09-08402 and via observations made possible by the SMARTS Consortium.

  6. Energy-directed tree search: an efficient systematic algorithm for finding the lowest energy conformation of molecules.

    PubMed

    Izgorodina, Ekaterina I; Lin, Ching Yeh; Coote, Michelle L

    2007-05-28

    We present a new systematic algorithm, energy-directed tree search (EDTS), for exploring the conformational space of molecules. The algorithm has been designed to reliably locate the global minimum (or, in the worst case, a structure within 4 kJ mol(-1) of this species) at a fraction of the cost of a full conformational search, and in this way extend the range of chemical systems for which accurate thermochemistry can be studied. The algorithm is inspired by the build-up approach but is performed on the original molecule as a whole, and objectively determines the combinations of torsional angles to optimise using a learning process. The algorithm was tested for a set of 22 large molecules, including open- and closed-shell species, stable structures and transition structures, and neutral and charged species, incorporating a range of functional groups (such as phenyl rings, esters, thioesters and phosphines), and covering polymers, peptides, drugs, and natural products. For most of the species studied the global minimum energy structure was obtained; for the rest the EDTS algorithm found conformations whose total electronic energies are within chemical accuracy from the true global minima. When the conformational space is searched at a resolution of 120 degrees , the cost of the EDTS algorithm (in its worst-case scenario) scales as 2(N) for large N (where N is the number of rotatable bonds), compared with 3(N) for the corresponding systematic search.

  7. Astrometric search for Planets in the closest Brown Dwarf Binary system Luhman 16AB

    NASA Astrophysics Data System (ADS)

    Bedin, Luigi

    2014-10-01

    Located at 2.0 pc, the L8+T1 dwarfs system Luhman16AB is the third closest system known to Earth, making it a key benchmark for detailed investigation of brown dwarf atmospheric properties, thermal evolution, multiplicity and planet-hosting frequency. Indeed, a recent ground-based astrometric campaign suggested this system to host a 5-30 Jupiter masses exoplanet.We propose to use HST in spatial-scanning mode to obtain the most accurate annual parallax of any brown dwarf to date, achieving an unprecedented accuracy of 1 part in 10000 (50 micro-arcsecond) for each of the two components of Luh16, and to constrain their absolute space motions with similar accuracy. Most importantly, we will be able to confirm the giant planet candidate and to search for faint companions co-moving with the targets, either resolved or through astrometric perturbations of the A-B orbital motion, the latter probing down to few Earth-masses.Present-day ground-based direct imaging and AO facilities have fundamental limitations (field of view, PSF stability, differential chromatic effects, visibility) which introduce systematic and seasonal errors that are hard to quantify, and which have already resulted many times in clamorous false alarm in the recent past. This is particularly true for faint and red objects.Luhman 16A and B will be problematic for GAIA (faint, color, crowding, visibility), and the here proposed HST spatial-scanning mode observations will actually be an important complementary validation of the final GAIA catalog itself (expected 2020). Similarly, JWST is not expected to provide any better astrometry than HST because of its broader and irregular PSFs.

  8. Towards mitigating the effect of sine-Gaussian noise transients on searches for gravitational waves from compact binary coalescences

    NASA Astrophysics Data System (ADS)

    Bose, Sukanta; Dhurandhar, Sanjeev; Gupta, Anuradha; Lundgren, Andrew

    2016-12-01

    Gravitational wave signals were recently detected directly by LIGO from the coalescences of two stellar mass black hole pairs. These detections have strengthened our long held belief that compact binary coalescences (CBCs) are the most promising gravitational wave detection prospects accessible to ground-based interferometric detectors. For detecting CBC signals, it is of vital importance to characterize and identify non-Gaussian and nonstationary noise in these detectors. In this work, we model two important classes of transient artifacts that contribute to this noise and adversely affect the detector sensitivity to CBC signals. One of them is the sine-Gaussian "glitch," characterized by a central frequency f0 and a quality factor Q and the other is the chirping sine-Gaussian glitch, which is characterized by f0, Q as well as a chirp parameter. We study the response that a bank of compact binary inspiral templates has to these two families of glitches when they are used to match filter data containing any of these glitches. Two important characteristics of this response are the distributions of the signal-to-noise ratio and the time lag (i.e., how long after the occurrence of a glitch the signal-to-noise ratio of a trigger arises from its matched filtering by a template peaks) of individual templates. We show how these distributions differ from those when the detector data has a real CBC signal instead of a glitch. We argue that these distinctions can be utilized to develop useful signal-artifact discriminators that add negligibly to the computational cost of a CBC search. Specifically, we show how the central frequency of a glitch can be used to set adaptive time windows around it so that any template trigger occurring in that window can be quarantined for further vetting of its supposed astrophysical nature. Second, we recommend focusing efforts on reducing the incidence of glitches with low central-frequency values because they create CBC triggers with the

  9. Geographical characterization of greek virgin olive oils (cv. Koroneiki) using 1H and 31P NMR fingerprinting with canonical discriminant analysis and classification binary trees.

    PubMed

    Petrakis, Panos V; Agiomyrgianaki, Alexia; Christophoridou, Stella; Spyros, Apostolos; Dais, Photis

    2008-05-14

    This work deals with the prediction of the geographical origin of monovarietal virgin olive oil (cv. Koroneiki) samples from three regions of southern Greece, namely, Peloponnesus, Crete, and Zakynthos, and collected in five harvesting years (2001-2006). All samples were chemically analyzed by means of 1H and 31P NMR spectroscopy and characterized according to their content in fatty acids, phenolics, diacylglycerols, total free sterols, free acidity, and iodine number. Biostatistical analysis showed that the fruiting pattern of the olive tree complicates the geographical separation of oil samples and the selection of significant chemical compounds. In this way the inclusion of the harvesting year improved the classification of samples, but increased the dimensionality of the data. Discriminant analysis showed that the geographical prediction at the level of three regions is very high (87%) and becomes (74%) when we pass to the thinner level of six sites (Chania, Sitia, and Heraklion in Crete; Lakonia and Messinia in Peloponnesus; Zakynthos). The use of classification and binary trees made possible the construction of a geographical prediction algorithm for unknown samples in a self-improvement fashion, which can be readily extended to other varieties and areas.

  10. Efficient tree codes on SIMD computer architectures

    NASA Astrophysics Data System (ADS)

    Olson, Kevin M.

    1996-11-01

    This paper describes changes made to a previous implementation of an N -body tree code developed for a fine-grained, SIMD computer architecture. These changes include (1) switching from a balanced binary tree to a balanced oct tree, (2) addition of quadrupole corrections, and (3) having the particles search the tree in groups rather than individually. An algorithm for limiting errors is also discussed. In aggregate, these changes have led to a performance increase of over a factor of 10 compared to the previous code. For problems several times larger than the processor array, the code now achieves performance levels of ~ 1 Gflop on the Maspar MP-2 or roughly 20% of the quoted peak performance of this machine. This percentage is competitive with other parallel implementations of tree codes on MIMD architectures. This is significant, considering the low relative cost of SIMD architectures.

  11. AMS radiocarbon investigation of the African baobab: Searching for the oldest tree

    NASA Astrophysics Data System (ADS)

    Patrut, Adrian; von Reden, Karl F.; Mayne, Diana H.; Lowy, Daniel A.; Patrut, Roxana T.

    2013-01-01

    The Glencoe baobab, a very large specimen from South Africa, split twice in 2009. Several wood samples were collected from the eastern cavity, from the outer part of the main section and also from the largest broken segment which was connected to this section. These wood samples were processed and investigated by AMS radiocarbon dating. The radiocarbon date of the oldest sample was found to be 1838 ± 21 BP, which corresponds to a calibrated age of 1835 ± 40 years. Thus, the Glencoe baobab becomes the oldest dated baobab and also the oldest angiosperm tree with accurate dating results. The distribution of dating results revealed that the Glencoe baobab is a multi-generation tree, with several standing or collapsed and partially fused stems, showing different ages.

  12. Adaptive Optics Photometry and Astrometry of Binary Stars. III. A Faint Companion Search of O-Star Systems

    DTIC Science & Technology

    2008-08-01

    ejected (by close gravitational encounters or a supernova in a binary). The results of this exercise to discern the probable physical companions are...dense clusters and by supernova explosions in close binaries (Hoogerwerf et al. 2001), and their ejection velocities generally exceed the escape

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

    SciTech Connect

    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., 10{sup 42} erg) are consistent with those observed in previous studies of hotter ultra-cool dwarfs.

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

  15. How unique is Plaskett's star? A search for organized magnetic fields in short period, interacting or post-interaction massive binary systems★

    NASA Astrophysics Data System (ADS)

    Nazé, Yaël; Neiner, Coralie; Grunhut, Jason; Bagnulo, Stefano; Alecian, Evelyne; Rauw, Gregor; Wade, Gregg A.; BinaMIcS Collaboration

    2017-01-01

    Amongst O-type stars with detected magnetic fields, the fast rotator in the close binary called Plaskett's star shows a variety of unusual properties. Since strong binary interactions are believed to have occurred in this system, one may wonder about their potential role in generating magnetic fields. Stokes V spectra collected with the low-resolution FORS2 and high-resolution ESPaDOnS and Narval spectropolarimeters were therefore used to search for magnetic fields in 15 interacting or post-interaction massive binaries. No magnetic field was detected in any of them, with 0 G always being within 2σ of the derived values. For 17 out of 25 stars in the systems observed at high-resolution, the 90% upper limit on the individual dipolar fields is below the dipolar field strength of Plaskett's secondary; a similar result is found for five out of six systems observed at low resolution. If our sample is considered to form a group of stars sharing similar magnetic properties, a global statistical analysis results in a stringent upper limit of ˜200 G on the dipolar field strength. Moreover, the magnetic incidence rate in the full sample of interacting or post-interaction systems (our targets + Plaskett's star) is compatible with that measured from large surveys, showing that they are not significantly different from the general O-star population. These results suggest that binary interactions play no systematic role in the magnetism of such massive systems.

  16. Oldies but goldies: searching for Christmas trees within the nucleolar architecture.

    PubMed

    Raska, Ivan

    2003-10-01

    The nucleolus is the prominent nuclear organelle in which the biogenesis of ribosomal RNA and ribosomes takes place. Understanding of the molecular processes in the nucleolus is rapidly expanding; however, opinions and results on the precise localization of active ribosomal genes - in either of two nucleolar subcompartments, fibrillar centers and dense fibrillar components - are still divided. This review discusses the difficulties in studying the nucleolar structure using microscopy, and provides an overview of the published data, critically examining their relevance to the controversy. Additionally, evidence showing that the dense fibrillar components encompass the Christmas tree structures is discussed and ways to reconcile the controversy are proposed.

  17. Searching for the Oldest Baobab of Madagascar: Radiocarbon Investigation of Large Adansonia rubrostipa Trees

    PubMed Central

    Patrut, Adrian; von Reden, Karl F.; Danthu, Pascal; Leong Pock-Tsy, Jean-Michel; Patrut, Roxana T.; Lowy, Daniel A.

    2015-01-01

    We extended our research on the architecture, growth and age of trees belonging to the genus Adansonia, by starting to investigate large individuals of the most widespread Malagasy species. Our research also intends to identify the oldest baobabs of Madagascar. Here we present results of the radiocarbon investigation of the two most representative Adansonia rubrostipa (fony baobab) specimens, which are located in south-western Madagascar, in the Tsimanampetsotse National Park. We found that the fony baobab called “Grandmother” consists of 3 perfectly fused stems of different ages. The radiocarbon date of the oldest sample was found to be 1136 ± 16 BP. We estimated that the oldest part of this tree, which is mainly hollow, has an age close to 1,600 yr. This value is comparable to the age of the oldest Adansonia digitata (African baobab) specimens. By its age, the Grandmother is a major candidate for the oldest baobab of Madagascar. The second investigated specimen, called the “polygamous baobab”, consists of 6 partially fused stems of different ages. According to dating results, this fony baobab is 1,000 yr old. This research is the first investigation of the structure and age of Malagasy baobabs. PMID:25806967

  18. Searching for the oldest baobab of Madagascar: radiocarbon investigation of large Adansonia rubrostipa trees.

    PubMed

    Patrut, Adrian; von Reden, Karl F; Danthu, Pascal; Pock-Tsy, Jean-Michel Leong; Patrut, Roxana T; Lowy, Daniel A

    2015-01-01

    We extended our research on the architecture, growth and age of trees belonging to the genus Adansonia, by starting to investigate large individuals of the most widespread Malagasy species. Our research also intends to identify the oldest baobabs of Madagascar. Here we present results of the radiocarbon investigation of the two most representative Adansonia rubrostipa (fony baobab) specimens, which are located in south-western Madagascar, in the Tsimanampetsotse National Park. We found that the fony baobab called "Grandmother" consists of 3 perfectly fused stems of different ages. The radiocarbon date of the oldest sample was found to be 1136 ± 16 BP. We estimated that the oldest part of this tree, which is mainly hollow, has an age close to 1,600 yr. This value is comparable to the age of the oldest Adansonia digitata (African baobab) specimens. By its age, the Grandmother is a major candidate for the oldest baobab of Madagascar. The second investigated specimen, called the "polygamous baobab", consists of 6 partially fused stems of different ages. According to dating results, this fony baobab is 1,000 yr old. This research is the first investigation of the structure and age of Malagasy baobabs.

  19. A Wide Angle Search for Hot Jupiters and Pre-Main Sequence Binaries in Young Stellar Associations

    NASA Astrophysics Data System (ADS)

    Oelkers, Ryan J.; Macri, Lucas M.; Marshall, Jennifer L.; Depoy, Darren L.; Colazo, Carlos; Guzzo, Pablo; Lambas, Diego G.; Quiñones, Ceci; Stringer, Katelyn; Tapia, Luis; Wisdom, Colin

    2016-01-01

    The past two decades have seen a significant advancement in the detection, classification and understanding of exoplanets and binary star systems. The vast majority of these systems consist of stars on the main sequence or on the giant branch, leading to a dearth of knowledge of properties at early times (<50 Myr). Only one transiting planet candidate and a dozen eclipsing binaries are known among pre-main sequence objects, yet these are the systems that can provide the best constraints on stellar and planetary formation models. We have recently completed a photometric survey of 3 young (<50 Myr), nearby (D<150 pc) moving groups with a small-aperture instrument, nicknamed ``AggieCam''. We detected 7 candidate Hot Jupiters and over 200 likely pre-main sequence binaries, which are now being followed up photometrically and spectroscopically.

  20. A systematic search for close supermassive black hole binaries in the Catalina Real-time Transient Survey

    NASA Astrophysics Data System (ADS)

    Graham, Matthew J.; Djorgovski, S. G.; Stern, Daniel; Drake, Andrew J.; Mahabal, Ashish A.; Donalek, Ciro; Glikman, Eilat; Larson, Steve; Christensen, Eric

    2015-10-01

    Hierarchical assembly models predict a population of supermassive black hole (SMBH) binaries. These are not resolvable by direct imaging but may be detectable via periodic variability (or nanohertz frequency gravitational waves). Following our detection of a 5.2-year periodic signal in the quasar PG 1302-102, we present a novel analysis of the optical variability of 243 500 known spectroscopically confirmed quasars using data from the Catalina Real-time Transient Survey (CRTS) to look for close (<0.1 pc) SMBH systems. Looking for a strong Keplerian periodic signal with at least 1.5 cycles over a baseline of nine years, we find a sample of 111 candidate objects. This is in conservative agreement with theoretical predictions from models of binary SMBH populations. Simulated data sets, assuming stochastic variability, also produce no equivalent candidates implying a low likelihood of spurious detections. The periodicity seen is likely attributable to either jet precession, warped accretion discs or periodic accretion associated with a close SMBH binary system. We also consider how other SMBH binary candidates in the literature appear in CRTS data and show that none of these are equivalent to the identified objects. Finally, the distribution of objects found is consistent with that expected from a gravitational-wave-driven population. This implies that circumbinary gas is present at small orbital radii and is being perturbed by the black holes. None of the sources is expected to merge within at least the next century. This study opens a new unique window to study a population of close SMBH binaries that must exist according to our current understanding of galaxy and SMBH evolution.

  1. Method of particle trajectory recognition in particle flows of high particle concentration using a candidate trajectory tree process with variable search areas

    DOEpatents

    Shaffer, Franklin D.

    2013-03-12

    The application relates to particle trajectory recognition from a Centroid Population comprised of Centroids having an (x, y, t) or (x, y, f) coordinate. The method is applicable to visualization and measurement of particle flow fields of high particle. In one embodiment, the centroids are generated from particle images recorded on camera frames. The application encompasses digital computer systems and distribution mediums implementing the method disclosed and is particularly applicable to recognizing trajectories of particles in particle flows of high particle concentration. The method accomplishes trajectory recognition by forming Candidate Trajectory Trees and repeated searches at varying Search Velocities, such that initial search areas are set to a minimum size in order to recognize only the slowest, least accelerating particles which produce higher local concentrations. When a trajectory is recognized, the centroids in that trajectory are removed from consideration in future searches.

  2. A Search for Photo-ionized Absorbers in High Mass X-ray Binaries: 4U 1907+09

    NASA Astrophysics Data System (ADS)

    Balman, Solen

    2007-10-01

    In order to further our understanding of the emitting and absorbing material in high-mass X-ray binaries (HMXB) and the accretion states of the sources,we propose a total of 30 ksec XMM-Newton observation of 4U 1907+09 to be conducted as two 15 ksec observations at different binary phases.In two archival ASCA SIS spectra of 4U 1907+09,we found evidence for the presence of 6.9 keV Fe XXVI absorption features at around 2sigma confidence which will yield 5sigma detection with EPIC pn CCDs and the modelling will allow the properties of a photo-ionized absorber to be determined for the first time in a HMXB. Our proposed observation at the chosen phases will for the first time determine spectra at low count rate levels over a factor of 100 difference from the source.

  3. Partition search

    SciTech Connect

    Ginsberg, M.L.

    1996-12-31

    We introduce a new form of game search called partition search that incorporates dependency analysis, allowing substantial reductions in the portion of the tree that needs to be expanded. Both theoretical results and experimental data are presented. For the game of bridge, partition search provides approximately as much of an improvement over existing methods as {alpha}-{beta} pruning provides over minimax.

  4. Binaries in globular clusters

    NASA Technical Reports Server (NTRS)

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

    1992-01-01

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

  5. Fast Localization in Large-Scale Environments Using Supervised Indexing of Binary Features.

    PubMed

    Youji Feng; Lixin Fan; Yihong Wu

    2016-01-01

    The essence of image-based localization lies in matching 2D key points in the query image and 3D points in the database. State-of-the-art methods mostly employ sophisticated key point detectors and feature descriptors, e.g., Difference of Gaussian (DoG) and Scale Invariant Feature Transform (SIFT), to ensure robust matching. While a high registration rate is attained, the registration speed is impeded by the expensive key point detection and the descriptor extraction. In this paper, we propose to use efficient key point detectors along with binary feature descriptors, since the extraction of such binary features is extremely fast. The naive usage of binary features, however, does not lend itself to significant speedup of localization, since existing indexing approaches, such as hierarchical clustering trees and locality sensitive hashing, are not efficient enough in indexing binary features and matching binary features turns out to be much slower than matching SIFT features. To overcome this, we propose a much more efficient indexing approach for approximate nearest neighbor search of binary features. This approach resorts to randomized trees that are constructed in a supervised training process by exploiting the label information derived from that multiple features correspond to a common 3D point. In the tree construction process, node tests are selected in a way such that trees have uniform leaf sizes and low error rates, which are two desired properties for efficient approximate nearest neighbor search. To further improve the search efficiency, a probabilistic priority search strategy is adopted. Apart from the label information, this strategy also uses non-binary pixel intensity differences available in descriptor extraction. By using the proposed indexing approach, matching binary features is no longer much slower but slightly faster than matching SIFT features. Consequently, the overall localization speed is significantly improved due to the much faster key

  6. Search with UVES and X-Shooter for signatures of the low-mass secondary in the post common-envelope binary AA Doradus

    NASA Astrophysics Data System (ADS)

    Hoyer, D.; Rauch, T.; Werner, K.; Hauschildt, P. H.; Kruk, J. W.

    2015-06-01

    Context. AA Dor is a close, totally eclipsing, post common-envelope binary with an sdOB-type primary star and an extremely low-mass secondary star, located close to the mass limit of stable central hydrogen burning. Within error limits, it may either be a brown dwarf or a late M-type dwarf. Aims: We aim to extract the secondary's contribution to the phase-dependent composite spectra. The spectrum and identified lines of the secondary decide on its nature. Methods: In January 2014, we measured the phase-dependent spectrum of AA Dor with X-Shooter over one complete orbital period. Since the secondary's rotation is presumable synchronized with the orbital period, its surface strictly divides into a day and night side. Therefore, we may obtain the spectrum of its cool side during its transit and of its hot, irradiated side close to its occultation. We developed the Virtual Observatory (VO) tool TLISA to search for weak lines of a faint companion in a binary system. We successfully applied it to the observations of AA Dor. Results: We identified 53 spectral lines of the secondary in the ultraviolet-blue, visual, and near-infrared X-Shooter spectra that are strongest close to its occultation. We identified 57 (20 additional) lines in available Ultraviolet and Visual Echelle Spectrograph (UVES) spectra from 2001. The lines are mostly from C ii-iii and O ii, typical for a low-mass star that is irradiated and heated by the primary. We verified the orbital period of P = 22 597.033201 ± 0.00007 s and determined the orbital velocity K_sec = 232.9+16.6-6.5 km s-1 of the secondary. The mass of the secondary is M_sec = 0.081+0.018-0.010 M_⊙ and, hence, it is not possible to reliably determine a brown dwarf or an M-type dwarf nature. Conclusions: Although we identified many emission lines of the secondary's irradiated surface, the resolution and signal-to-noise ratio of our UVES and X-Shooter spectra are not good enough to extract a good spectrum of the secondary

  7. Binary optics: Trends and limitations

    NASA Astrophysics Data System (ADS)

    Farn, Michael W.; Veldkamp, Wilfrid B.

    1993-08-01

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

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

  9. Matrix-assisted laser desorption/ionization time-of-flight mass spectrometry combined with multidimensional scaling, binary hierarchical cluster tree and selected diagnostic masses improves species identification of Neolithic keratin sequences from furs of the Tyrolean Iceman Oetzi.

    PubMed

    Hollemeyer, Klaus; Altmeyer, Wolfgang; Heinzle, Elmar; Pitra, Christian

    2012-08-30

    The identification of fur origins from the 5300-year-old Tyrolean Iceman's accoutrement is not yet complete, although definite identification is essential for the socio-cultural context of his epoch. Neither have all potential samples been identified so far, nor there has a consensus been reached on the species identified using the classical methods. Archaeological hair often lacks analyzable hair scale patterns in microscopic analyses and polymer chain reaction (PCR)-based techniques are often inapplicable due to the lack of amplifiable ancient DNA. To overcome these drawbacks, a matrix-assisted laser desorption/ionization time-of-flight mass spectrometry (MALDI-TOF MS) method was used exclusively based on hair keratins. Thirteen fur specimens from his accoutrement were analyzed after tryptic digest of native hair. Peptide mass fingerprints (pmfs) from ancient samples and from reference species mostly occurring in the Alpine surroundings at his lifetime were compared to each other using multidimensional scaling and binary hierarchical cluster tree analysis. Both statistical methods highly reflect spectral similarities among pmfs as close zoological relationships. While multidimensional scaling was useful to discriminate specimens on the zoological order level, binary hierarchical cluster tree reached the family or subfamily level. Additionally, the presence and/or absence of order, family and/or species-specific diagnostic masses in their pmfs allowed the identification of mammals mostly down to single species level. Red deer was found in his shoe vamp, goat in the leggings, cattle in his shoe sole and at his quiver's closing flap as well as sheep and chamois in his coat. Canid species, like grey wolf, domestic dog or European red fox, were discovered in his leggings for the first time, but could not be differentiated to species level. This is widening the spectrum of processed fur-bearing species to at least one member of the Canidae family. His fur cap was

  10. Binary Plutinos

    NASA Astrophysics Data System (ADS)

    Noll, Keith S.

    2015-08-01

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

  11. Quantum decision tree classifier

    NASA Astrophysics Data System (ADS)

    Lu, Songfeng; Braunstein, Samuel L.

    2013-11-01

    We study the quantum version of a decision tree classifier to fill the gap between quantum computation and machine learning. The quantum entropy impurity criterion which is used to determine which node should be split is presented in the paper. By using the quantum fidelity measure between two quantum states, we cluster the training data into subclasses so that the quantum decision tree can manipulate quantum states. We also propose algorithms constructing the quantum decision tree and searching for a target class over the tree for a new quantum object.

  12. The search for low-luminosity high-mass X-ray binaries and the study of X-ray populations in the Galactic disk

    NASA Astrophysics Data System (ADS)

    Fornasini, Francesca; Tomsick, John; Bodaghee, Arash; Rahoui, Farid; Krivonos, Roman; Corral-Santana, Jesus; An, Hongjun; Bauer, Franz E.; Gotthelf, Eric V.; Stern, Daniel; NuSTAR Galactic Plane Survey Team

    2016-01-01

    High-mass X-ray binaries (HMXBs), which consist of a neutron star (NS) or black hole (BH) accreting material from a massive stellar companion, provide valuable insights into the evolution of massive stars and the merger rates of NS/NS, NS/BH, and BH/BH binaries whose gravitational wave signatures will soon be detectable by facilities such as Advanced-LIGO. INTEGRAL discoveries of new classes of lower-luminosity HMXBs, some highly obscured and some showing extreme transient activity, as well as the recent discovery of the very quiescent and only known Be-BH binary, have considerably changed our understanding of clumping in massive stellar winds and the relative importance of different binary evolutionary channels. In order to better characterize the low-luminosity HMXB population, we have performed a survey of a square degree region in the direction of the Norma spiral arm with Chandra and NuSTAR. These surveys, combined with optical and infrared spectroscopic follow-up of the counterparts of hard X-ray sources, have yielded three HMXB candidates to date. Future radial-velocity follow-up of these candidates, as well as other Be HMXB candidates from the NuSTAR serendipitous survey, will help determine whether these sources truly are HMXBs and, if so, constrain the mass of the compact object in these systems. If confirmed, these HMXB candidates could extend our measurement of the HMXB luminosity function by about two orders of magnitude and provide important constraints on massive binary evolutionary models. In addition, the colliding wind binaries and pulsar wind nebulae discovered in the Norma X-ray survey will help shed light on other aspects of massive stellar evolution and massive stellar remnants. Finally, these surveys provide the opportunity to compare the hard X-ray populations in the Galactic disk and the Galactic Center. While the dominant hard X-ray populations in both of these Galactic regions appear to be cataclysmic variables (CVs), those in the Norma

  13. Type I Error Control for Tree Classification

    PubMed Central

    Jung, Sin-Ho; Chen, Yong; Ahn, Hongshik

    2014-01-01

    Binary tree classification has been useful for classifying the whole population based on the levels of outcome variable that is associated with chosen predictors. Often we start a classification with a large number of candidate predictors, and each predictor takes a number of different cutoff values. Because of these types of multiplicity, binary tree classification method is subject to severe type I error probability. Nonetheless, there have not been many publications to address this issue. In this paper, we propose a binary tree classification method to control the probability to accept a predictor below certain level, say 5%. PMID:25452689

  14. Planet Hunters. X. Searching for Nearby Neighbors of 75 Planet and Eclipsing Binary Candidates from the K2 Kepler extended mission

    NASA Astrophysics Data System (ADS)

    Schmitt, Joseph R.; Tokovinin, Andrei; Wang, Ji; Fischer, Debra A.; Kristiansen, Martti H.; LaCourse, Daryll M.; Gagliano, Robert; Tan, Arvin Joseff V.; Schwengeler, Hans Martin; Omohundro, Mark R.; Venner, Alexander; Terentev, Ivan; Schmitt, Allan R.; Jacobs, Thomas L.; Winarski, Troy; Sejpka, Johann; Jek, Kian J.; Boyajian, Tabetha S.; Brewer, John M.; Ishikawa, Sascha T.; Lintott, Chris; Lynn, Stuart; Schawinski, Kevin; Schwamb, Megan E.; Weiksnar, Alex

    2016-06-01

    We present high-resolution observations of a sample of 75 K2 targets from Campaigns 1-3 using speckle interferometry on the Southern Astrophysical Research (SOAR) telescope and adaptive optics imaging at the Keck II telescope. The median SOAR I-band and Keck Ks-band detection limits at 1\\prime\\prime were {{Δ }}{m}I=4.4 mag and {{Δ }}{m}{Ks}=6.1 mag, respectively. This sample includes 37 stars likely to host planets, 32 targets likely to be eclipsing binaries (EBs), and 6 other targets previously labeled as likely planetary false positives. We find nine likely physically bound companion stars within 3\\prime\\prime of three candidate transiting exoplanet host stars and six likely EBs. Six of the nine detected companions are new discoveries. One of these new discoveries, EPIC 206061524, is associated with a planet candidate. Among the EB candidates, companions were only found near the shortest period ones (P\\lt 3 days), which is in line with previous results showing high multiplicity near short-period binary stars. This high-resolution data, including both the detected companions and the limits on potential unseen companions, will be useful in future planet vetting and stellar multiplicity rate studies for planets and binaries.

  15. Binary stars.

    PubMed

    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.

  16. Astrometric Binaries: White Dwarfs?

    NASA Astrophysics Data System (ADS)

    Oliversen, Nancy A.

    We propose to observe a selection of astrometric or spectroscopicastrometric binaries nearer than about 20 pc with unseen low mass companions. Systems of this type are important for determining the luminosity function of low mass stars (white dwarfs and very late main sequence M stars), and their contribution to the total mass of the galaxy. Systems of this type are also important because the low mass, invisible companions are potential candidates in the search for planets. Our target list is selected primarily from the list of 31 astrometric binaries near the sun by Lippincott (1978, Space Sci. Rev., 22, 153), with additional candidates from recent observations by Kamper. The elimination of stars with previous IUE observations, red companions resolved by infrared speckle interferometry, or primaries later than M1 (because if white dwarf companions are present they should have been detected in the visible region) reduces the list to 5 targets which need further information. IUE SWP low dispersion observations of these targets will show clearly whether the remaining unseen companions are white dwarfs, thus eliminating very cool main sequence stars or planets. This is also important in providing complete statistical information about the nearest stars. The discovery of a white dwarf in such a nearby system would provide important additional information about the masses of white dwarfs. Recent results by Greenstein (1986, A. J., 92, 859) from binary systems containing white dwarfs imply that 80% of such systems are as yet undetected. The preference of binaries for companions of approximately equal mass makes the Lippincott-Kamper list of A through K primaries with unseen companions a good one to use to search for white dwarfs. The mass and light dominance of the current primary over the white dwarf in the visible makes ultraviolet observations essential to obtain an accurate census of white dwarf binaries.

  17. Optimal Pruning for Tree-Structured Vector Quantization.

    ERIC Educational Resources Information Center

    Lin, Jianhua; And Others

    1992-01-01

    Analyzes the computational complexity of optimal binary tree pruning for tree-structured vector quantization. Topics discussed include the combinatorial nature of the optimization problem; the complexity of optimal tree pruning; and finding a minimal size pruned tree. (11 references) (LRW)

  18. Binary Logistic Regression Versus Boosted Regression Trees in Assessing Landslide Susceptibility for Multiple-Occurring Regional Landslide Events: Application to the 2009 Storm Event in Messina (Sicily, southern Italy).

    NASA Astrophysics Data System (ADS)

    Lombardo, L.; Cama, M.; Maerker, M.; Parisi, L.; Rotigliano, E.

    2014-12-01

    This study aims at comparing the performances of Binary Logistic Regression (BLR) and Boosted Regression Trees (BRT) methods in assessing landslide susceptibility for multiple-occurrence regional landslide events within the Mediterranean region. A test area was selected in the north-eastern sector of Sicily (southern Italy), corresponding to the catchments of the Briga and the Giampilieri streams both stretching for few kilometres from the Peloritan ridge (eastern Sicily, Italy) to the Ionian sea. This area was struck on the 1st October 2009 by an extreme climatic event resulting in thousands of rapid shallow landslides, mainly of debris flows and debris avalanches types involving the weathered layer of a low to high grade metamorphic bedrock. Exploiting the same set of predictors and the 2009 landslide archive, BLR- and BRT-based susceptibility models were obtained for the two catchments separately, adopting a random partition (RP) technique for validation; besides, the models trained in one of the two catchments (Briga) were tested in predicting the landslide distribution in the other (Giampilieri), adopting a spatial partition (SP) based validation procedure. All the validation procedures were based on multi-folds tests so to evaluate and compare the reliability of the fitting, the prediction skill, the coherence in the predictor selection and the precision of the susceptibility estimates. All the obtained models for the two methods produced very high predictive performances, with a general congruence between BLR and BRT in the predictor importance. In particular, the research highlighted that BRT-models reached a higher prediction performance with respect to BLR-models, for RP based modelling, whilst for the SP-based models the difference in predictive skills between the two methods dropped drastically, converging to an analogous excellent performance. However, when looking at the precision of the probability estimates, BLR demonstrated to produce more robust

  19. THE RADIAL VELOCITY TATOOINE SEARCH FOR CIRCUMBINARY PLANETS: PLANET DETECTION LIMITS FOR A SAMPLE OF DOUBLE-LINED BINARY STARS-INITIAL RESULTS FROM KECK I/HIRES, SHANE/CAT/HAMSPEC, AND TNG/SARG OBSERVATIONS

    SciTech Connect

    Konacki, Maciej; Helminiak, Krzysztof G.; Muterspaugh, Matthew W.; Kulkarni, Shrinivas R.

    2009-10-10

    We present preliminary results of the first and on-going radial velocity survey for circumbinary planets. With a novel radial velocity technique employing an iodine absorption cell, we achieve an unprecedented radial velocity (RV) precision of up to 2 m s{sup -1} for double-lined binary stars. The high-resolution spectra collected with the Keck I/Hires, TNG/Sarg, and Shane/CAT/Hamspec telescopes/spectrographs over the years 2003-2008 allow us to derive RVs and compute planet detection limits for 10 double-lined binary stars. For this initial sample of targets, we can rule out planets on dynamically stable orbits with masses as small as approx0.3 to 3 M {sub Jup} for the orbital periods of up to approx5.3 years. Even though the presented sample of stars is too small to make any strong conclusions, it is clear that the search for circumbinary planets is now technique-wise possible and eventually will provide new constraints for the planet formation theories.

  20. Top Quark Produced Through the Electroweak Force: Discovery Using the Matrix Element Analysis and Search for Heavy Gauge Bosons Using Boosted Decision Trees

    SciTech Connect

    Pangilinan, Monica

    2010-05-01

    The top quark produced through the electroweak channel provides a direct measurement of the Vtb element in the CKM matrix which can be viewed as a transition rate of a top quark to a bottom quark. This production channel of top quark is also sensitive to different theories beyond the Standard Model such as heavy charged gauged bosons termed W'. This thesis measures the cross section of the electroweak produced top quark using a technique based on using the matrix elements of the processes under consideration. The technique is applied to 2.3 fb-1 of data from the D0 detector. From a comparison of the matrix element discriminants between data and the signal and background model using Bayesian statistics, we measure the cross section of the top quark produced through the electroweak mechanism σ(p$\\bar{p}$ → tb + X, tqb + X) = 4.30-1.20+0.98 pb. The measured result corresponds to a 4.9σ Gaussian-equivalent significance. By combining this analysis with other analyses based on the Bayesian Neural Network (BNN) and Boosted Decision Tree (BDT) method, the measured cross section is 3.94 ± 0.88 pb with a significance of 5.0σ, resulting in the discovery of electroweak produced top quarks. Using this measured cross section and constraining |Vtb| < 1, the 95% confidence level (C.L.) lower limit is |Vtb| > 0.78. Additionally, a search is made for the production of W' using the same samples from the electroweak produced top quark. An analysis based on the BDT method is used to separate the signal from expected backgrounds. No significant excess is found and 95% C.L. upper limits on the production cross section are set for W' with masses within 600-950 GeV. For four general models of W{prime} boson production using decay channel W' → t$\\bar{p}$, the lower mass limits are the following: M(W'L with SM couplings) > 840 GeV; M(W'R) > 880 GeV or 890 GeV if the right-handed neutrino is

  1. Top quark produced through the electroweak force: Discovery using the matrix element analysis and search for heavy gauge bosons using boosted decision trees

    NASA Astrophysics Data System (ADS)

    Pangilinan, Monica

    The top quark produced through the electroweak channel provides a direct measurement of the Vtb element in the CKM matrix which can be viewed as a transition rate of a top quark to a bottom quark. This production channel of top quark is also sensitive to different theories beyond the Standard Model such as heavy charged gauged bosons termed W'. This thesis measures the cross section of the electroweak produced top quark using a technique based on using the matrix elements of the processes under consideration. The technique is applied to 2.3 fb--1 of data from the DO detector. From a comparison of the matrix element discriminants between data and the signal and background model using Bayesian statistics, we measure the cross section of the top quark produced through the electroweak mechanism spp¯→ tb+X,tqb+X=4.30+0.98-1.2 0pb The measured result corresponds to a 4.9sigma Gaussian-equivalent significance. By combining this analysis with other analyses based on the Bayesian Neural Network (BNN) and Boosted Decision Tree (BDT) method, the measured cross section is 3.94 +/- 0.88 pb with a significance of 5.0sigma, resulting in the discovery of electroweak produced top quarks. Using this measured cross section and constraining |Vtb| < 1, the 95% confidence level (C.L.) lower limit is |Vtb| > 0.78. Additionally, a search is made for the production of W' using the same samples from the electroweak produced top quark. An analysis based on the BDT method is used to separate the signal from expected backgrounds. No significant excess is found and 95% C.L. upper limits on the production cross section are set for W' with masses within 600--950 GeV. For four general models of W' boson production using decay channel W' → tb¯, the lower mass limits are the following: M( W'L with SM couplings) > 840 GeV; M( W'R ) > 880 GeV or 890 GeV if the right-handed neutrino is lighter or heavier than W'R ; and M( W'L+R ) > 915 GeV.

  2. Hitch-hiking: a parallel heuristic search strategy, applied to the phylogeny problem.

    PubMed

    Charleston, M A

    2001-01-01

    The article introduces a parallel heuristic search strategy ("Hitch-hiking") which can be used in conjunction with other random-walk heuristic search strategies. It is applied to an artificial phylogeny problem, in which character sequences are evolved using pseudo-random numbers from a hypothetical ancestral sequence. The objective function to be minimized is the minimum number of character-state changes required on a binary tree that could account for the sequences observed at the tips (leaves) of the tree -- the Maximum Parsimony criterion. The Hitch-hiking strategy is shown to be useful in that it is robust and that on average the solutions found using the strategy are better than those found without. Also the strategy can dynamically provide information on the characteristics of the landscape of the problem. I argue that Hitch-hiking as a scheme for parallelization of existing heuristic search strategies is of potentially very general use, in many areas of combinatorial optimization.

  3. Evolutionary tree reconstruction

    NASA Technical Reports Server (NTRS)

    Cheeseman, Peter; Kanefsky, Bob

    1990-01-01

    It is described how Minimum Description Length (MDL) can be applied to the problem of DNA and protein evolutionary tree reconstruction. If there is a set of mutations that transform a common ancestor into a set of the known sequences, and this description is shorter than the information to encode the known sequences directly, then strong evidence for an evolutionary relationship has been found. A heuristic algorithm is described that searches for the simplest tree (smallest MDL) that finds close to optimal trees on the test data. Various ways of extending the MDL theory to more complex evolutionary relationships are discussed.

  4. Solvation dynamics of tryptophan in water-dimethyl sulfoxide binary mixture: in search of molecular origin of composition dependent multiple anomalies.

    PubMed

    Roy, Susmita; Bagchi, Biman

    2013-07-21

    Experimental and simulation studies have uncovered at least two anomalous concentration regimes in water-dimethyl sulfoxide (DMSO) binary mixture whose precise origin has remained a subject of debate. In order to facilitate time domain experimental investigation of the dynamics of such binary mixtures, we explore strength or extent of influence of these anomalies in dipolar solvation dynamics by carrying out long molecular dynamics simulations over a wide range of DMSO concentration. The solvation time correlation function so calculated indeed displays strong composition dependent anomalies, reflected in pronounced non-exponential kinetics and non-monotonous composition dependence of the average solvation time constant. In particular, we find remarkable slow-down in the solvation dynamics around 10%-20% and 35%-50% mole percentage. We investigate microscopic origin of these two anomalies. The population distribution analyses of different structural morphology elucidate that these two slowing down are reflections of intriguing structural transformations in water-DMSO mixture. The structural transformations themselves can be explained in terms of a change in the relative coordination number of DMSO and water molecules, from 1DMSO:2H2O to 1H2O:1DMSO and 1H2O:2DMSO complex formation. Thus, while the emergence of first slow down (at 15% DMSO mole percentage) is due to the percolation among DMSO molecules supported by the water molecules (whose percolating network remains largely unaffected), the 2nd anomaly (centered on 40%-50%) is due to the formation of the network structure where the unit of 1DMSO:1H2O and 2DMSO:1H2O dominates to give rise to rich dynamical features. Through an analysis of partial solvation dynamics an interesting negative cross-correlation between water and DMSO is observed that makes an important contribution to relaxation at intermediate to longer times.

  5. A search for X-ray polarization in cosmic X-ray sources. [binary X-ray sources and supernovae remnants

    NASA Technical Reports Server (NTRS)

    Hughes, J. P.; Long, K. S.; Novick, R.

    1983-01-01

    Fifteen strong X-ray sources were observed by the X-ray polarimeters on board the OSO-8 satellite from 1975 to 1978. The final results of this search for X-ray polarization in cosmic sources are presented in the form of upper limits for the ten sources which are discussed elsewhere. These limits in all cases are consistent with a thermal origin for the X-ray emission.

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

  7. The Magellan PFS Planet Search Program: Radial Velocity and Stellar Abundance Analyses of the 360 au, Metal-poor Binary “Twins” HD 133131A & B

    NASA Astrophysics Data System (ADS)

    Teske, Johanna K.; Shectman, Stephen A.; Vogt, Steve S.; Díaz, Matías; Butler, R. Paul; Crane, Jeffrey D.; Thompson, Ian B.; Arriagada, Pamela

    2016-12-01

    We present a new precision radial velocity (RV) data set that reveals multiple planets orbiting the stars in the ˜360 au, G2+G2 “twin” binary HD 133131AB. Our six years of high-resolution echelle observations from MIKE and five years from the Planet Finder Spectrograph (PFS) on the Magellan telescopes indicate the presence of two eccentric planets around HD 133131A with minimum masses of 1.43 ± 0.03 and 0.63 ± 0.15 {{ M }}{{J}} at 1.44 ± 0.005 and 4.79 ± 0.92 au, respectively. Additional PFS observations of HD 133131B spanning five years indicate the presence of one eccentric planet of minimum mass 2.50 ± 0.05 {{ M }}{{J}} at 6.40 ± 0.59 au, making it one of the longest-period planets detected with RV to date. These planets are the first to be reported primarily based on data taken with the PFS on Magellan, demonstrating the instrument’s precision and the advantage of long-baseline RV observations. We perform a differential analysis between the Sun and each star, and between the stars themselves, to derive stellar parameters and measure a suite of 21 abundances across a wide range of condensation temperatures. The host stars are old (likely ˜9.5 Gyr) and metal-poor ([Fe/H] ˜ -0.30), and we detect a ˜0.03 dex depletion in refractory elements in HD 133131A versus B (with standard errors ˜0.017). This detection and analysis adds to a small but growing sample of binary “twin” exoplanet host stars with precise abundances measured, and represents the most metal-poor and likely oldest in that sample. Overall, the planets around HD 133131A and B fall in an unexpected regime in planet mass-host star metallicity space and will serve as an important benchmark for the study of long-period giant planets. This paper includes data gathered with the 6.5 m Magellan Telescopes located at Las Campanas Observatory, Chile.

  8. Search for a correlation between kHz quasi-periodic oscillation frequencies and accretion-related parameters in the ensemble of neutron star low-mass X-ray binaries

    NASA Astrophysics Data System (ADS)

    Çatmabacak, Önder; Erkut, M. Hakan; Catmabacak, Onur; Duran, Sivan

    2016-07-01

    The distribution of neutron star sources in the ensemble of low-mass X-ray binaries shows no evidence for a correlation between kHz quasi-periodic oscillation (QPO) frequencies and X-ray luminosity. Sources differing by orders of magnitude in luminosity can exhibit similar range of QPO frequencies. We study the possibility for the existence of a correlation between kHz QPO frequencies and accretion related parameters. The parameters such as the mass accretion rate and the size of the boundary region in the innermost disk are expected to be related to X-ray luminosity. Using the up-to-date data of neutron star low-mass X-ray binaries, we search for a possible correlation between lower kHz QPO frequencies and mass accretion rate through the mass and radius values predicted by different equations of state for the neutron star. The range of mass accretion rate for each source can be estimated if the accretion luminosity is assumed to be represented well by the X-ray luminosity of the source. Although we find no correlation between mass accretion rate and QPO frequencies, the source distribution seems to be in accordance with a correlation between kHz QPO frequencies and the parameter combining the neutron star magnetic field and the mas accretion rate. The model function we employ to descibe the correlation is able to account for the scattering of individual sources around a simple power law. The correlation argues disk-magnetosphere interaction as the origin of these millisecond oscillations.

  9. Machine Learning Through Signature Trees. Applications to Human Speech.

    ERIC Educational Resources Information Center

    White, George M.

    A signature tree is a binary decision tree used to classify unknown patterns. An attempt was made to develop a computer program for manipulating signature trees as a general research tool for exploring machine learning and pattern recognition. The program was applied to the problem of speech recognition to test its effectiveness for a specific…

  10. MARVELS-1: A Face-on Double-lined Binary Star Masquerading as a Resonant Planetary System and Consideration of Rare False Positives in Radial Velocity Planet Searches

    NASA Astrophysics Data System (ADS)

    Wright, Jason T.; Roy, Arpita; Mahadevan, Suvrath; Wang, Sharon X.; Ford, Eric B.; Payne, Matt; Lee, Brian L.; Wang, Ji; Crepp, Justin R.; Gaudi, B. Scott; Eastman, Jason; Pepper, Joshua; Ge, Jian; Fleming, Scott W.; Ghezzi, Luan; González-Hernández, Jonay I.; Cargile, Phillip; Stassun, Keivan G.; Wisniewski, John; Dutra-Ferreira, Leticia; Porto de Mello, Gustavo F.; Maia, Márcio A. G.; Nicolaci da Costa, Luiz; Ogando, Ricardo L. C.; Santiago, Basilio X.; Schneider, Donald P.; Hearty, Fred R.

    2013-06-01

    We have analyzed new and previously published radial velocity (RV) observations of MARVELS-1, known to have an ostensibly substellar companion in a ~6 day orbit. We find significant (~100 m s-1) residuals to the best-fit model for the companion, and these residuals are naïvely consistent with an interior giant planet with a P = 1.965 days in a nearly perfect 3:1 period commensurability (|Pb /Pc - 3| < 10-4). We have performed several tests for the reality of such a companion, including a dynamical analysis, a search for photometric variability, and a hunt for contaminating stellar spectra. We find many reasons to be critical of a planetary interpretation, including the fact that most of the three-body dynamical solutions are unstable. We find no evidence for transits, and no evidence of stellar photometric variability. We have discovered two apparent companions to MARVELS-1 with adaptive optics imaging at Keck; both are M dwarfs, one is likely bound, and the other is likely a foreground object. We explore false-alarm scenarios inspired by various curiosities in the data. Ultimately, a line profile and bisector analysis lead us to conclude that the ~100 m s-1 residuals are an artifact of spectral contamination from a stellar companion contributing ~15%-30% of the optical light in the system. We conclude that origin of this contamination is the previously detected RV companion to MARVELS-1, which is not, as previously reported, a brown dwarf, but in fact a G dwarf in a face-on orbit.

  11. Template bank for gravitational waveforms from coalescing binary black holes: Nonspinning binaries

    SciTech Connect

    Ajith, P.; Hewitson, M.; Babak, S.; Chen, Y.; Krishnan, B.; Whelan, J. T.; Dorband, N.; Pollney, D.; Rezzolla, L.; Sintes, A. M.; Bruegmann, B.; Hannam, M.; Husa, S.; Sperhake, U.; Diener, P.; Gonzalez, J.; Santamaria, L.; Thornburg, J.

    2008-05-15

    Gravitational waveforms from the inspiral and ring-down stages of the binary black-hole coalescences can be modeled accurately by approximation/perturbation techniques in general relativity. Recent progress in numerical relativity has enabled us to model also the nonperturbative merger phase of the binary black-hole coalescence problem. This enables us to coherently search for all three stages of the coalescence of nonspinning binary black holes using a single template bank. Taking our motivation from these results, we propose a family of template waveforms which can model the inspiral, merger, and ring-down stages of the coalescence of nonspinning binary black holes that follow quasicircular inspiral. This two-dimensional template family is explicitly parametrized by the physical parameters of the binary. We show that the template family is not only effectual in detecting the signals from black-hole coalescences, but also faithful in estimating the parameters of the binary. We compare the sensitivity of a search (in the context of different ground-based interferometers) using all three stages of the black-hole coalescence with other template-based searches which look for individual stages separately. We find that the proposed search is significantly more sensitive than other template-based searches for a substantial mass range, potentially bringing about remarkable improvement in the event rate of ground-based interferometers. As part of this work, we also prescribe a general procedure to construct interpolated template banks using nonspinning black-hole waveforms produced by numerical relativity.

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

  13. Bootstrapping on undirected binary networks via statistical mechanics.

    PubMed

    Fushing, Hsieh; Chen, Chen; Liu, Shan-Yu; Koehl, Patrice

    2014-09-01

    We propose a new method inspired from statistical mechanics for extracting geometric information from undirected binary networks and generating random networks that conform to this geometry. In this method an undirected binary network is perceived as a thermodynamic system with a collection of permuted adjacency matrices as its states. The task of extracting information from the network is then reformulated as a discrete combinatorial optimization problem of searching for its ground state. To solve this problem, we apply multiple ensembles of temperature regulated Markov chains to establish an ultrametric geometry on the network. This geometry is equipped with a tree hierarchy that captures the multiscale community structure of the network. We translate this geometry into a Parisi adjacency matrix, which has a relative low energy level and is in the vicinity of the ground state. The Parisi adjacency matrix is then further optimized by making block permutations subject to the ultrametric geometry. The optimal matrix corresponds to the macrostate of the original network. An ensemble of random networks is then generated such that each of these networks conforms to this macrostate; the corresponding algorithm also provides an estimate of the size of this ensemble. By repeating this procedure at different scales of the ultrametric geometry of the network, it is possible to compute its evolution entropy, i.e. to estimate the evolution of its complexity as we move from a coarse to a ne description of its geometric structure. We demonstrate the performance of this method on simulated as well as real data networks.

  14. Tree Topology Estimation

    PubMed Central

    Estrada, Rolando; Tomasi, Carlo; Schmidler, Scott C.; Farsiu, Sina

    2015-01-01

    Tree-like structures are fundamental in nature, and it is often useful to reconstruct the topology of a tree—what connects to what—from a two-dimensional image of it. However, the projected branches often cross in the image: the tree projects to a planar graph, and the inverse problem of reconstructing the topology of the tree from that of the graph is ill-posed. We regularize this problem with a generative, parametric tree-growth model. Under this model, reconstruction is possible in linear time if one knows the direction of each edge in the graph—which edge endpoint is closer to the root of the tree—but becomes NP-hard if the directions are not known. For the latter case, we present a heuristic search algorithm to estimate the most likely topology of a rooted, three-dimensional tree from a single two-dimensional image. Experimental results on retinal vessel, plant root, and synthetic tree datasets show that our methodology is both accurate and efficient. PMID:26353004

  15. SAGE III L2 Lunar Event Species Profiles (Binary)

    Atmospheric Science Data Center

    2016-06-14

    ... Search and Order:  Earthdata Search   FTP Access:  Data Pool Parameters:  Chlorine Dioxide Nitrogen Dioxide ... Search Additional Info:  Data Format: Big Endian/IEEE Binary; Avg Size in MB: 0.017 SCAR-B Block:  ...

  16. SAGE III L2 Solar Event Species Profiles (Binary)

    Atmospheric Science Data Center

    2016-06-14

    ... Search and Order:  Earthdata Search   FTP Access:  Data Pool V3  |  Data Pool V4 Parameters:  Aerosol ... Search Additional Info:  Data Format: Big Endian/IEEE Binary; Avg Size in MB: 0.044 SCAR-B Block:  ...

  17. The Phases Differential Astrometry Data Archive. 2. Updated Binary Star Orbits and a Long Period Eclipsing Binary

    DTIC Science & Technology

    2010-12-01

    measurements from the Palomar High-precision Astrometric Search for Exoplanet Systems have been combined with lower precision single-aperture...the Palomar High-precision Astrometric Search for Exoplanet Systems (PHASES) program during 2002–2008. PHASES science results included precision binary...ABSTRACT Differential astrometry measurements from the Palomar High-precision Astrometric Search for Exoplanet Systems have been combined with

  18. Reinforcement Learning Trees.

    PubMed

    Zhu, Ruoqing; Zeng, Donglin; Kosorok, Michael R

    In this paper, we introduce a new type of tree-based method, reinforcement learning trees (RLT), which exhibits significantly improved performance over traditional methods such as random forests (Breiman, 2001) under high-dimensional settings. The innovations are three-fold. First, the new method implements reinforcement learning at each selection of a splitting variable during the tree construction processes. By splitting on the variable that brings the greatest future improvement in later splits, rather than choosing the one with largest marginal effect from the immediate split, the constructed tree utilizes the available samples in a more efficient way. Moreover, such an approach enables linear combination cuts at little extra computational cost. Second, we propose a variable muting procedure that progressively eliminates noise variables during the construction of each individual tree. The muting procedure also takes advantage of reinforcement learning and prevents noise variables from being considered in the search for splitting rules, so that towards terminal nodes, where the sample size is small, the splitting rules are still constructed from only strong variables. Last, we investigate asymptotic properties of the proposed method under basic assumptions and discuss rationale in general settings.

  19. Reinforcement Learning Trees

    PubMed Central

    Zhu, Ruoqing; Zeng, Donglin; Kosorok, Michael R.

    2015-01-01

    In this paper, we introduce a new type of tree-based method, reinforcement learning trees (RLT), which exhibits significantly improved performance over traditional methods such as random forests (Breiman, 2001) under high-dimensional settings. The innovations are three-fold. First, the new method implements reinforcement learning at each selection of a splitting variable during the tree construction processes. By splitting on the variable that brings the greatest future improvement in later splits, rather than choosing the one with largest marginal effect from the immediate split, the constructed tree utilizes the available samples in a more efficient way. Moreover, such an approach enables linear combination cuts at little extra computational cost. Second, we propose a variable muting procedure that progressively eliminates noise variables during the construction of each individual tree. The muting procedure also takes advantage of reinforcement learning and prevents noise variables from being considered in the search for splitting rules, so that towards terminal nodes, where the sample size is small, the splitting rules are still constructed from only strong variables. Last, we investigate asymptotic properties of the proposed method under basic assumptions and discuss rationale in general settings. PMID:26903687

  20. Detectability of Gravitational Waves from High-Redshift Binaries.

    PubMed

    Rosado, Pablo A; Lasky, Paul D; Thrane, Eric; Zhu, Xingjiang; Mandel, Ilya; Sesana, Alberto

    2016-03-11

    Recent nondetection of gravitational-wave backgrounds from pulsar timing arrays casts further uncertainty on the evolution of supermassive black hole binaries. We study the capabilities of current gravitational-wave observatories to detect individual binaries and demonstrate that, contrary to conventional wisdom, some are, in principle, detectable throughout the Universe. In particular, a binary with rest-frame mass ≳10^{10}M_{⊙} can be detected by current timing arrays at arbitrarily high redshifts. The same claim will apply for less massive binaries with more sensitive future arrays. As a consequence, future searches for nanohertz gravitational waves could be expanded to target evolving high-redshift binaries. We calculate the maximum distance at which binaries can be observed with pulsar timing arrays and other detectors, properly accounting for redshift and using realistic binary waveforms.

  1. Detectability of Gravitational Waves from High-Redshift Binaries

    NASA Astrophysics Data System (ADS)

    Rosado, Pablo A.; Lasky, Paul D.; Thrane, Eric; Zhu, Xingjiang; Mandel, Ilya; Sesana, Alberto

    2016-03-01

    Recent nondetection of gravitational-wave backgrounds from pulsar timing arrays casts further uncertainty on the evolution of supermassive black hole binaries. We study the capabilities of current gravitational-wave observatories to detect individual binaries and demonstrate that, contrary to conventional wisdom, some are, in principle, detectable throughout the Universe. In particular, a binary with rest-frame mass ≳1010M⊙ can be detected by current timing arrays at arbitrarily high redshifts. The same claim will apply for less massive binaries with more sensitive future arrays. As a consequence, future searches for nanohertz gravitational waves could be expanded to target evolving high-redshift binaries. We calculate the maximum distance at which binaries can be observed with pulsar timing arrays and other detectors, properly accounting for redshift and using realistic binary waveforms.

  2. Talking Trees

    ERIC Educational Resources Information Center

    Tolman, Marvin

    2005-01-01

    Students love outdoor activities and will love them even more when they build confidence in their tree identification and measurement skills. Through these activities, students will learn to identify the major characteristics of trees and discover how the pace--a nonstandard measuring unit--can be used to estimate not only distances but also the…

  3. Efficient point cloud collision detection and analysis in a tunnel environment using kinematic laser scanning and K-D Tree search

    NASA Astrophysics Data System (ADS)

    Schauer, J.; Nüchter, A.

    2014-08-01

    Measuring the structure gauge of tunnels and other narrow passages has so far been the only way to evaluate whether large vehicles can pass through them. But especially for very long vehicles like train wagons and their cargo, the structure gauge is an insufficient measure because the center part of the vehicle between two bogies will inevitably leave the swept volume of its cross section when moving along any other trajectory than a straight line perpendicular to its cross section. In addition, the vehicle as well as the cargo must keep a minimum safety margin from the environment at all points of its trajectory. This paper explores an automated method to check for possible collisions of a model represented by a 3D point cloud moving through the 3D point cloud of an environment. We were given environment data of a train track through a narrow tunnel where simply relying on the structure gauge would indicate that a given wagon would pass through without any collision even though in reality, the train wagon would collide with the inner tunnel wall inside a sharp turn of the tracks. The k-d tree based collision detection method presented in this paper is able to correctly highlight these collisions and indicate the penetration depth of each colliding point of the environment into the model of the train wagon. It can be generalized for any setup where two static point clouds have to be tested for intersection along a trajectory.

  4. Active flows on trees

    NASA Astrophysics Data System (ADS)

    Forrow, Aden; Woodhouse, Francis G.; Dunkel, Jörn

    2016-11-01

    Coherent, large scale dynamics in many nonequilibrium physical, biological, or information transport networks are driven by small-scale local energy input. We introduce and explore a generic model for compressible active flows on tree networks. In contrast to thermally-driven systems, active friction selects discrete states with only a small number of oscillation modes activated at distinct fixed amplitudes. This state selection can interact with graph topology to produce different localized dynamical time scales in separate regions of large networks. Using perturbation theory, we systematically predict the stationary states of noisy networks. Our analytical predictions agree well with a Bayesian state estimation based on a hidden Markov model applied to simulated time series data on binary trees. While the number of stable states per tree scales exponentially with the number of edges, the mean number of activated modes in each state averages 1 / 4 the number of edges. More broadly, these results suggest that the macroscopic response of active networks, from actin-myosin networks in cells to flow networks in Physarum polycephalum, can be dominated by a few select modes.

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

  6. Generic physical protection logic trees

    SciTech Connect

    Paulus, W.K.

    1981-10-01

    Generic physical protection logic trees, designed for application to nuclear facilities and materials, are presented together with a method of qualitative evaluation of the trees for design and analysis of physical protection systems. One or more defense zones are defined where adversaries interact with the physical protection system. Logic trees that are needed to describe the possible scenarios within a defense zone are selected. Elements of a postulated or existing physical protection system are tagged to the primary events of the logic tree. The likelihood of adversary success in overcoming these elements is evaluated on a binary, yes/no basis. The effect of these evaluations is propagated through the logic of each tree to determine whether the adversary is likely to accomplish the end event of the tree. The physical protection system must be highly likely to overcome the adversary before he accomplishes his objective. The evaluation must be conducted for all significant states of the site. Deficiencies uncovered become inputs to redesign and further analysis, closing the loop on the design/analysis cycle.

  7. A dynamic fault tree model of a propulsion system

    NASA Technical Reports Server (NTRS)

    Xu, Hong; Dugan, Joanne Bechta; Meshkat, Leila

    2006-01-01

    We present a dynamic fault tree model of the benchmark propulsion system, and solve it using Galileo. Dynamic fault trees (DFT) extend traditional static fault trees with special gates to model spares and other sequence dependencies. Galileo solves DFT models using a judicious combination of automatically generated Markov and Binary Decision Diagram models. Galileo easily handles the complexities exhibited by the benchmark problem. In particular, Galileo is designed to model phased mission systems.

  8. Binary pulsar evolution: unveiled links and new species

    NASA Astrophysics Data System (ADS)

    Possenti, Andrea

    2013-03-01

    In the last years a series of blind and/or targeted pulsar searches led to almost triple the number of known binary pulsars in the galactic field with respect to a decade ago. The focus will be on few outliers, which are emerging from the average properties of the enlarged binary pulsar population. Some of them may represent the long sought missing links between two kinds of neutron star binaries, while others could represent the stereotype of new groups of binaries, resulting from an evolutionary path which is more exotic than those considered until recently. In particular, a new class of binaries, which can be dubbed Ultra Low Mass Binary Pulsars (ULMBPs), is emerging from recent data.

  9. The gene tree delusion.

    PubMed

    Springer, Mark S; Gatesy, John

    2016-01-01

    grossly misaligned, and numerous loci with >50% missing data for taxa that are misplaced in their gene trees. These problems were compounded by inadequate tree searches with nearest neighbor interchange branch swapping and inadvertent application of substitution models that did not account for among-site rate heterogeneity. Sixty-six gene trees imply unrealistic deep coalescences that exceed 100 million years (MY). Gene trees that were obtained with better justified models and search parameters show large increases in both likelihood scores and congruence. Coalescence analyses based on a curated set of 413 improved gene trees and a superior coalescence method (ASTRAL) support a Scandentia (treeshrews)+Glires (rabbits, rodents) clade, contradicting one of the three primary systematic conclusions of Song et al. (2012). Robust support for a Perissodactyla+Carnivora clade within Laurasiatheria is also lost, contradicting a second major conclusion of this study. Song et al.'s (2012) MP-EST species tree provided the basis for circular simulations that led these authors to conclude that the multispecies coalescent accounts for 77% of the gene tree conflicts in their dataset, but many internal branches of their MP-EST tree are stunted by an order of magnitude or more due to wholesale gene tree reconstruction errors. An independent assessment of branch lengths suggests the multispecies coalescent accounts for ⩽ 15% of the conflicts among Song et al.'s (2012) 447 gene trees. Unfortunately, Song et al.'s (2012) flawed phylogenomic dataset has been used as a model for additional simulation work that suggests the superiority of shortcut coalescence methods relative to concatenation. Investigator error was passed on to the subsequent simulation studies, which also incorporated further logical errors that should be avoided in future simulation studies. Illegitimate branch length switches in the simulation routines unfairly protected coalescence methods from their Achilles' heel, high

  10. Audubon Tree Study Program.

    ERIC Educational Resources Information Center

    National Audubon Society, New York, NY.

    Included are an illustrated student reader, "The Story of Trees," a leaders' guide, and a large tree chart with 37 colored pictures. The student reader reviews several aspects of trees: a definition of a tree; where and how trees grow; flowers, pollination and seed production; how trees make their food; how to recognize trees; seasonal changes;…

  11. Bootstrapping on undirected binary networks via statistical mechanics

    PubMed Central

    Fushing, Hsieh; Chen, Chen; Liu, Shan-Yu; Koehl, Patrice

    2014-01-01

    We propose a new method inspired from statistical mechanics for extracting geometric information from undirected binary networks and generating random networks that conform to this geometry. In this method an undirected binary network is perceived as a thermodynamic system with a collection of permuted adjacency matrices as its states. The task of extracting information from the network is then reformulated as a discrete combinatorial optimization problem of searching for its ground state. To solve this problem, we apply multiple ensembles of temperature regulated Markov chains to establish an ultrametric geometry on the network. This geometry is equipped with a tree hierarchy that captures the multiscale community structure of the network. We translate this geometry into a Parisi adjacency matrix, which has a relative low energy level and is in the vicinity of the ground state. The Parisi adjacency matrix is then further optimized by making block permutations subject to the ultrametric geometry. The optimal matrix corresponds to the macrostate of the original network. An ensemble of random networks is then generated such that each of these networks conforms to this macrostate; the corresponding algorithm also provides an estimate of the size of this ensemble. By repeating this procedure at different scales of the ultrametric geometry of the network, it is possible to compute its evolution entropy, i.e. to estimate the evolution of its complexity as we move from a coarse to a ne description of its geometric structure. We demonstrate the performance of this method on simulated as well as real data networks. PMID:25071295

  12. X-ray Binaries

    NASA Astrophysics Data System (ADS)

    Lewin, Walter H. G.; van Paradijs, Jan; van den Heuvel, Edward Peter Jacobus

    1997-01-01

    Preface; 1. The properties of X-ray binaries, N. E. White, F. Nagase and A. N. Parmar; 2. Optical and ultraviolet observations of X-ray binaries J. van Paradijs and J. E. McClintock; 3. Black-hole binaries Y. Tanaka and W. H. G. Lewin; 4. X-ray bursts Walter H. G. Lewin, Jan Van Paradijs and Ronald E. Taam; 5. Millisecond pulsars D. Bhattacharya; 6. Rapid aperiodic variability in binaries M. van der Klis; 7. Radio properties of X-ray binaries R. M. Hjellming and X. Han; 8. Cataclysmic variable stars France Anne-Dominic Córdova; 9. Normal galaxies and their X-ray binary populations G. Fabbiano; 10. Accretion in close binaries Andrew King; 11. Formation and evolution of neutron stars and black holes in binaries F. Verbunt and E. P. J. van den Heuvel; 12. The magnetic fields of neutron stars and their evolution D. Bhattacharya and G. Srinivasan; 13. Cosmic gamma-ray bursts K. Hurley; 14. A catalogue of X-ray binaries Jan van Paradijs; 15. A compilation of cataclysmic binaries with known or suspected orbital periods Hans Ritter and Ulrich Kolb; References; Index.

  13. Tree harvesting

    SciTech Connect

    Badger, P.C.

    1995-12-31

    Short rotation intensive culture tree plantations have been a major part of biomass energy concepts since the beginning. One aspect receiving less attention than it deserves is harvesting. This article describes an method of harvesting somewhere between agricultural mowing machines and huge feller-bunchers of the pulpwood and lumber industries.

  14. Compact binary hashing for music retrieval

    NASA Astrophysics Data System (ADS)

    Seo, Jin S.

    2014-03-01

    With the huge volume of music clips available for protection, browsing, and indexing, there is an increased attention to retrieve the information contents of the music archives. Music-similarity computation is an essential building block for browsing, retrieval, and indexing of digital music archives. In practice, as the number of songs available for searching and indexing is increased, so the storage cost in retrieval systems is becoming a serious problem. This paper deals with the storage problem by extending the supervector concept with the binary hashing. We utilize the similarity-preserving binary embedding in generating a hash code from the supervector of each music clip. Especially we compare the performance of the various binary hashing methods for music retrieval tasks on the widely-used genre dataset and the in-house singer dataset. Through the evaluation, we find an effective way of generating hash codes for music similarity estimation which improves the retrieval performance.

  15. Rapid Compact Binary Coalescence Parameter Estimation

    NASA Astrophysics Data System (ADS)

    Pankow, Chris; Brady, Patrick; O'Shaughnessy, Richard; Ochsner, Evan; Qi, Hong

    2016-03-01

    The first observation run with second generation gravitational-wave observatories will conclude at the beginning of 2016. Given their unprecedented and growing sensitivity, the benefit of prompt and accurate estimation of the orientation and physical parameters of binary coalescences is obvious in its coupling to electromagnetic astrophysics and observations. Popular Bayesian schemes to measure properties of compact object binaries use Markovian sampling to compute the posterior. While very successful, in some cases, convergence is delayed until well after the electromagnetic fluence has subsided thus diminishing the potential science return. With this in mind, we have developed a scheme which is also Bayesian and simply parallelizable across all available computing resources, drastically decreasing convergence time to a few tens of minutes. In this talk, I will emphasize the complementary use of results from low latency gravitational-wave searches to improve computational efficiency and demonstrate the capabilities of our parameter estimation framework with a simulated set of binary compact object coalescences.

  16. Anatomical modeling of the bronchial tree

    NASA Astrophysics Data System (ADS)

    Hentschel, Gerrit; Klinder, Tobias; Blaffert, Thomas; Bülow, Thomas; Wiemker, Rafael; Lorenz, Cristian

    2010-02-01

    The bronchial tree is of direct clinical importance in the context of respective diseases, such as chronic obstructive pulmonary disease (COPD). It furthermore constitutes a reference structure for object localization in the lungs and it finally provides access to lung tissue in, e.g., bronchoscope based procedures for diagnosis and therapy. This paper presents a comprehensive anatomical model for the bronchial tree, including statistics of position, relative and absolute orientation, length, and radius of 34 bronchial segments, going beyond previously published results. The model has been built from 16 manually annotated CT scans, covering several branching variants. The model is represented as a centerline/tree structure but can also be converted in a surface representation. Possible model applications are either to anatomically label extracted bronchial trees or to improve the tree extraction itself by identifying missing segments or sub-trees, e.g., if located beyond a bronchial stenosis. Bronchial tree labeling is achieved using a naïve Bayesian classifier based on the segment properties contained in the model in combination with tree matching. The tree matching step makes use of branching variations covered by the model. An evaluation of the model has been performed in a leaveone- out manner. In total, 87% of the branches resulting from preceding airway tree segmentation could be correctly labeled. The individualized model enables the detection of missing branches, allowing a targeted search, e.g., a local rerun of the tree-segmentation segmentation.

  17. Fast multiresolution search algorithm for optimal retrieval in large multimedia databases

    NASA Astrophysics Data System (ADS)

    Song, Byung C.; Kim, Myung J.; Ra, Jong Beom

    1999-12-01

    Most of the content-based image retrieval systems require a distance computation for each candidate image in the database. As a brute-force approach, the exhaustive search can be employed for this computation. However, this exhaustive search is time-consuming and limits the usefulness of such systems. Thus, there is a growing demand for a fast algorithm which provides the same retrieval results as the exhaustive search. In this paper, we prose a fast search algorithm based on a multi-resolution data structure. The proposed algorithm computes the lower bound of distance at each level and compares it with the latest minimum distance, starting from the low-resolution level. Once it is larger than the latest minimum distance, we can exclude the candidates without calculating the full- resolution distance. By doing this, we can dramatically reduce the total computational complexity. It is noticeable that the proposed fast algorithm provides not only the same retrieval results as the exhaustive search, but also a faster searching ability than existing fast algorithms. For additional performance improvement, we can easily combine the proposed algorithm with existing tree-based algorithms. The algorithm can also be used for the fast matching of various features such as luminance histograms, edge images, and local binary partition textures.

  18. Elucidating the True Binary Fraction of VLM Stars and Brown Dwarfs with Spectral Binaries

    NASA Astrophysics Data System (ADS)

    Bardalez Gagliuffi, Daniella; Burgasser, Adam J.; Gelino, Christopher R.; SAHLMANN, JOHANNES; Schmidt, Sarah J.; Gagne, Jonathan; Skrzypek, Nathalie

    2017-01-01

    The very lowest-mass (VLM) stars and brown dwarfs are found in abundance in nearly all Galactic environments, yet their formation mechanism(s) remain an open question. One means of testing current formation theories is to use multiplicity statistics. The majority of VLM binaries have been discovered through direct imaging, and current angular resolution limits (0.05”-0.1") are coincident with the 1-4 AU peak in the projected separation distribution of known systems, suggesting an observational bias. I have developed a separation-independent method to detect T dwarf companions to late-M/early-L dwarfs by identifying methane absorption in their unresolved, low-resolution, near-infrared spectra using spectral indices and template fitting. Over 60 spectral binary candidates have been identified with this and comparable methods. I discuss follow-up observations, including laser-guide star adaptive optics imaging with Keck/NIRC2, which have confirmed 9 systems; and radial velocity and astrometric monitoring observations that have confirmed 7 others. The direct imaging results indicate a resolved binary fraction of 18%, coincident with current estimates of the VLM binary fraction; however, our sample contained 5 previously confirmed binaries, raising its true binary fraction to 47%. To more accurately measure the true VLM binary fraction, I describe the construction of an unbiased, volume-limited, near-infrared spectral sample of M7-L5 dwarfs within 25 pc, of which 4 (1%) are found to be spectral binary candidates. I model the complex selection biases of this method through a population simulation, set constraints on the true binary fraction as traced by these systems, and compare to the predictions of current formation theories. I also describe how this method may be applied to conduct a separation-unbiased search for giant exoplanets orbiting young VLM stars and brown dwarfs.

  19. Case A Binary Evolution

    SciTech Connect

    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.

  20. Technical Tree Climbing.

    ERIC Educational Resources Information Center

    Jenkins, Peter

    Tree climbing offers a safe, inexpensive adventure sport that can be performed almost anywhere. Using standard procedures practiced in tree surgery or rock climbing, almost any tree can be climbed. Tree climbing provides challenge and adventure as well as a vigorous upper-body workout. Tree Climbers International classifies trees using a system…

  1. Exotic trees.

    PubMed

    Burda, Z; Erdmann, J; Petersson, B; Wattenberg, M

    2003-02-01

    We discuss the scaling properties of free branched polymers. The scaling behavior of the model is classified by the Hausdorff dimensions for the internal geometry, d(L) and d(H), and for the external one, D(L) and D(H). The dimensions d(H) and D(H) characterize the behavior for long distances, while d(L) and D(L) for short distances. We show that the internal Hausdorff dimension is d(L)=2 for generic and scale-free trees, contrary to d(H), which is known to be equal to 2 for generic trees and to vary between 2 and infinity for scale-free trees. We show that the external Hausdorff dimension D(H) is directly related to the internal one as D(H)=alphad(H), where alpha is the stability index of the embedding weights for the nearest-vertex interactions. The index is alpha=2 for weights from the Gaussian domain of attraction and 0

  2. Reconfigurable tree architectures using subtree oriented fault tolerance

    NASA Technical Reports Server (NTRS)

    Lowrie, Matthew B.

    1987-01-01

    An approach to the design of reconfigurable tree architecture is presented in which spare processors are allocated at the leaves. The approach is unique in that spares are associated with subtrees and sharing of spares between these subtrees can occur. The Subtree Oriented Fault Tolerance (SOFT) approach is more reliable than previous approaches capable of tolerating link and switch failures for both single chip and multichip tree implementations while reducing redundancy in terms of both spare processors and links. VLSI layout is 0(n) for binary trees and is directly extensible to N-ary trees and fault tolerance through performance degradation.

  3. Stacking Analysis of Binary Systems with HAWC

    NASA Astrophysics Data System (ADS)

    Brisbois, Chad; HAWC Collaboration

    2017-01-01

    Detecting binary systems at TeV energies is an important problem because only a handful of such systems are currently known. The nature of such systems is typically thought to be composed of a compact object and a massive star. The TeV emission from these systems does not obviously correspond to emission in GeV or X-ray, where many binary systems have previously been found. This study focuses on a stacking method to detect TeV emission from LS 5039, a known TeV binary, to test its efficacy in HAWC data. Stacking is a widely employed method for increasing signal to noise ratio in optical astronomy, but has never been attempted previously with HAWC. HAWC is an ideal instrument to search for TeV binaries, because of its wide field of view and high uptime. Applying this method to the entire sky may allow HAWC to detect binary sources of very short or very long periods not sensitive to current analyses. NSF, DOE, Los Alamos, Michigan Tech, CONACyt, UNAM, BUAP.

  4. BINARY CANDIDATES IN THE JOVIAN TROJAN AND HILDA POPULATIONS FROM NEOWISE LIGHT CURVES

    SciTech Connect

    Sonnett, S.; Mainzer, A.; Masiero, J.; Bauer, J.; Grav, T.

    2015-02-01

    Determining the binary fraction for a population of asteroids, particularly as a function of separation between the two components, helps describe the dynamical environment at the time the binaries formed, which in turn offers constraints on the dynamical evolution of the solar system. We searched the NEOWISE archival data set for close and contact binary Trojans and Hildas via their diagnostically large light curve amplitudes. We present 48 out of 554 Hilda and 34 out of 953 Trojan binary candidates in need of follow-up to confirm their large light curve amplitudes and subsequently constrain the binary orbit and component sizes. From these candidates, we calculate a preliminary estimate of the binary fraction without confirmation or debiasing of 14%-23% for Trojans larger than ∼12 km and 30%-51% for Hildas larger than ∼4 km. Once the binary candidates have been confirmed, it should be possible to infer the underlying, debiased binary fraction through estimation of survey biases.

  5. What Makes a Tree a Tree?

    ERIC Educational Resources Information Center

    NatureScope, 1986

    1986-01-01

    Provides: (1) background information on trees, focusing on the parts of trees and how they differ from other plants; (2) eight activities; and (3) ready-to-copy pages dealing with tree identification and tree rings. Activities include objective(s), recommended age level(s), subject area(s), list of materials needed, and procedures. (JN)

  6. An Improved Catalog of Halo Wide Binary Candidates

    NASA Astrophysics Data System (ADS)

    Allen, Christine; Monroy-Rodríguez, Miguel A.

    2014-08-01

    We present an improved catalog of halo wide binaries compiled from an extensive literature search. Most of our binaries stem from the common proper motion binary catalogs by Allen et al. and Chanamé & Gould, but we have also included binaries from the lists of Ryan and Zapatero-Osorio & Martín. All binaries were carefully checked and their distances and systemic radial velocities are included when available. Probable membership to the halo population was tested by means of reduced proper motion diagrams for 251 candidate halo binaries. After eliminating obvious disk binaries, we ended up with 211 probable halo binaries, 150 of which have radial velocities available. We compute galactic orbits for these 150 binaries and calculate the time they spend within the galactic disk. Considering the full sample of 251 candidate halo binaries as well as several subsamples, we find that the distribution of angular separations (or expected major semiaxes) follows a power law f(a) ~ a -1 (Oepik's relation) up to different limits. For the 50 most disk-like binaries, those that spend their entire lives within z = ±500 pc, this limit is found to be 19,000 AU (0.09 pc), while for the 50 most halo-like binaries, those that spend on average only 18% of their lives within z = ±500 pc, the limit is 63,000 AU (0.31 pc). In a companion paper, we employ this catalog to establish limits on the masses of the halo massive perturbers (massive compact halo objects).

  7. An improved catalog of halo wide binary candidates

    SciTech Connect

    Allen, Christine; Monroy-Rodríguez, Miguel A.

    2014-08-01

    We present an improved catalog of halo wide binaries compiled from an extensive literature search. Most of our binaries stem from the common proper motion binary catalogs by Allen et al. and Chanamé and Gould, but we have also included binaries from the lists of Ryan and Zapatero-Osorio and Martín. All binaries were carefully checked and their distances and systemic radial velocities are included when available. Probable membership to the halo population was tested by means of reduced proper motion diagrams for 251 candidate halo binaries. After eliminating obvious disk binaries, we ended up with 211 probable halo binaries, 150 of which have radial velocities available. We compute galactic orbits for these 150 binaries and calculate the time they spend within the galactic disk. Considering the full sample of 251 candidate halo binaries as well as several subsamples, we find that the distribution of angular separations (or expected major semiaxes) follows a power law f(a) ∼ a {sup –1} (Oepik's relation) up to different limits. For the 50 most disk-like binaries, those that spend their entire lives within z = ±500 pc, this limit is found to be 19,000 AU (0.09 pc), while for the 50 most halo-like binaries, those that spend on average only 18% of their lives within z = ±500 pc, the limit is 63,000 AU (0.31 pc). In a companion paper, we employ this catalog to establish limits on the masses of the halo massive perturbers (massive compact halo objects).

  8. Microwave sensing of tree trunks

    NASA Astrophysics Data System (ADS)

    Jezova, Jana; Mertens, Laurence; Lambot, Sebastien

    2015-04-01

    was divided into three sections to separate parts with different moisture (heartwood and sapwood) or empty space (decays). For easier manipulation with the antenna we developed a special ruler for measuring the distance along the scans. Instead of the surveying wheel we read the distance with a camera, which was fixed on the antenna and focused on the ruler with a binary pattern. Hence, during whole measurement and the data processing we were able to identify an accurate position on the tree in view of the scan. Some preliminary measurements on the trees were also conducted. They were performed using a GSSI 900 MHz antenna. Several tree species (beech, horse-chestnut, birch, ...) in Louvain-la-Neuve and Brussels, Belgium, have been investigated to see the internal structure of the tree decays. The measurements were carried out mainly by circumferential measurement around the trunk and also by vertical measurement along the trunk for approximate detection of the cavity. The comparison between the numerical simulations, simplified tree trunk model and real data from trees is presented. This research is funded by the Fonds de la Recherche Scientifique (FNRS, Belgium) and benefits from networking activities carried out within the EU COST Action TU1208 "Civil Engineering Applications of Ground Penetrating Radar".

  9. Encoding of multi-alphabet sources by binary arithmetic coding

    NASA Astrophysics Data System (ADS)

    Guo, Muling; Oka, Takahumi; Kato, Shigeo; Kajiwara, Hiroshi; Kawamura, Naoto

    1998-12-01

    In case of encoding a multi-alphabet source, the multi- alphabet symbol sequence can be encoded directly by a multi- alphabet arithmetic encoder, or the sequence can be first converted into several binary sequences and then each binary sequence is encoded by binary arithmetic encoder, such as the L-R arithmetic coder. Arithmetic coding, however, requires arithmetic operations for each symbol and is computationally heavy. In this paper, a binary representation method using Huffman tree is introduced to reduce the number of arithmetic operations, and a new probability approximation for L-R arithmetic coding is further proposed to improve the coding efficiency when the probability of LPS (Least Probable Symbol) is near 0.5. Simulation results show that our proposed scheme has high coding efficacy and can reduce the number of coding symbols.

  10. Taming the binaries

    NASA Astrophysics Data System (ADS)

    Pourbaix, D.

    2008-07-01

    Astrometric binaries are both a gold mine and a nightmare. They are a gold mine because they are sometimes the unique source of orbital inclination for spectroscopic binaries, thus making it possible for astrophysicists to get some clues about the mass of the often invisible secondary. However, this is an ideal situation in the sense that one benefits from the additional knowledge that it is a binary for which some orbital parameters are somehow secured (e.g. the orbital period). On the other hand, binaries are a nightmare, especially when their binary nature is not established yet. Indeed, in such cases, depending on the time interval covered by the observations compared to the orbital period, either the parallax or the proper motion can be severely biased if the successive positions of the binary are modelled assuming it is a single star. With large survey campaigns sometimes monitoring some stars for the first time ever, it is therefore crucial to design robust reduction pipelines in which such troublesome objects are quickly identified and either removed or processed accordingly. Finally, even if an object is known not to be a single star, the binary model might turn out not to be the most appropriate for describing the observations. These different situations will be covered.

  11. Accelerating protein classification using suffix trees.

    PubMed

    Dorohonceanu, B; Nevill-Manning, C G

    2000-01-01

    Position-specific scoring matrices have been used extensively to recognize highly conserved protein regions. We present a method for accelerating these searches using a suffix tree data structure computed from the sequences to be searched. Building on earlier work that allows evaluation of a scoring matrix to be stopped early, the suffix tree-based method excludes many protein segments from consideration at once by pruning entire subtrees. Although suffix trees are usually expensive in space, the fact that scoring matrix evaluation requires an in-order traversal allows nodes to be stored more compactly without loss of speed, and our implementation requires only 17 bytes of primary memory per input symbol. Searches are accelerated by up to a factor of ten.

  12. The Tree Worker's Manual.

    ERIC Educational Resources Information Center

    Smithyman, S. J.

    This manual is designed to prepare students for entry-level positions as tree care professionals. Addressed in the individual chapters of the guide are the following topics: the tree service industry; clothing, eqiupment, and tools; tree workers; basic tree anatomy; techniques of pruning; procedures for climbing and working in the tree; aerial…

  13. From Binaries to Triples

    NASA Astrophysics Data System (ADS)

    Freismuth, T.; Tokovinin, A.

    2002-12-01

    About 10% of all binary systems are close binaries (P<1000 days). Among those with P<10d, over 40% are known to belong to higher-multiplicity systems (triples, quadruples, etc.). Do ALL close systems have tertiary companions? For a selection of 12 nearby, and apparently "single" close binaries with solar-mass dwarf primary components from the 8-th catalogue of spectroscopic binary orbits, images in the B and R filters were taken at the CTIO 0.9m telescope and suitable tertiary candidates were be identified on color-magnitude diagrams (CMDs). Of the 12 SBs, four were found to have tertiary candidates: HD 67084, HD 120734, HD 93486, and VV Mon. However, none of these candidates were found to be common proper motion companions. Follow up observations using adaptive optics reveal a companion to HD 148704. Future observations are planned.

  14. Double Degenerate Binary Systems

    SciTech Connect

    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.

  15. Binary Minor Planets

    NASA Astrophysics Data System (ADS)

    Richardson, Derek C.; Walsh, Kevin J.

    2006-05-01

    A review of observations and theories regarding binary asteroids and binary trans-Neptunian objects [collectively, binary minor planets (BMPs)] is presented. To date, these objects have been discovered using a combination of direct imaging, lightcurve analysis, and radar. They are found throughout the Solar System, and present a challenge for theorists modeling their formation in the context of Solar System evolution. The most promising models invoke rotational disruption for the smallest, shortest-lived objects (the asteroids nearest to Earth), consistent with the observed fast rotation of these bodies; impacts for the larger, longer-lived asteroids in the main belt, consistent with the range of size ratios of their components and slower rotation rates; and mutual capture for the distant, icy, trans-Neptunian objects, consistent with their large component separations and near-equal sizes. Numerical simulations have successfully reproduced key features of the binaries in the first two categories; the third remains to be investigated in detail.

  16. Binary technetium halides

    NASA Astrophysics Data System (ADS)

    Johnstone, Erik Vaughan

    In this work, the synthetic and coordination chemistry as well as the physico-chemical properties of binary technetium (Tc) chlorides, bromides, and iodides were investigated. Resulting from these studies was the discovery of five new binary Tc halide phases: alpha/beta-TcCl3, alpha/beta-TcCl 2, and TcI3, and the reinvestigation of the chemistries of TcBr3 and TcX4 (X = Cl, Br). Prior to 2009, the chemistry of binary Tc halides was poorly studied and defined by only three compounds, i.e., TcF6, TcF5, and TcCl4. Today, ten phases are known (i.e., TcF6, TcF5, TcCl4, TcBr 4, TcBr3, TcI3, alpha/beta-TcCl3 and alpha/beta-TcCl2) making the binary halide system of Tc comparable to those of its neighboring elements. Technetium binary halides were synthesized using three methods: reactions of the elements in sealed tubes, reactions of flowing HX(g) (X = Cl, Br, and I) with Tc2(O2CCH3)4Cl2, and thermal decompositions of TcX4 (X = Cl, Br) and alpha-TcCl 3 in sealed tubes under vacuum. Binary Tc halides can be found in various dimensionalities such as molecular solids (TcF6), extended chains (TcF5, TcCl4, alpha/beta-TcCl2, TcBr 3, TcI3), infinite layers (beta-TcCl3), and bidimensional networks of clusters (alpha-TcCl3); eight structure-types with varying degrees of metal-metal interactions are now known. The coordination chemistry of Tc binary halides can resemble that of the adjacent elements: molybdenum and ruthenium (beta-TcCl3, TcBr3, TcI 3), rhenium (TcF5, alpha-TcCl3), platinum (TcCl 4, TcBr4), or can be unique (alpha-TcCl2 and beta-TcCl 2) in respect to other known transition metal binary halides. Technetium binary halides display a range of interesting physical properties that are manifested from their electronic and structural configurations. The thermochemistry of binary Tc halides is extensive. These compounds can selectively volatilize, decompose, disproportionate, or convert to other phases. Ultimately, binary Tc halides may find application in the nuclear fuel

  17. Searching with iterated maps

    PubMed Central

    Elser, V.; Rankenburg, I.; Thibault, P.

    2007-01-01

    In many problems that require extensive searching, the solution can be described as satisfying two competing constraints, where satisfying each independently does not pose a challenge. As an alternative to tree-based and stochastic searching, for these problems we propose using an iterated map built from the projections to the two constraint sets. Algorithms of this kind have been the method of choice in a large variety of signal-processing applications; we show here that the scope of these algorithms is surprisingly broad, with applications as diverse as protein folding and Sudoku. PMID:17202267

  18. Binary-Symmetry Detection

    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.

  19. X-ray binaries

    NASA Technical Reports Server (NTRS)

    1976-01-01

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

  20. Scattering from binary optics

    NASA Technical Reports Server (NTRS)

    Ricks, Douglas W.

    1993-01-01

    There are a number of sources of scattering in binary optics: etch depth errors, line edge errors, quantization errors, roughness, and the binary approximation to the ideal surface. These sources of scattering can be systematic (deterministic) or random. In this paper, scattering formulas for both systematic and random errors are derived using Fourier optics. These formulas can be used to explain the results of scattering measurements and computer simulations.

  1. Spectroscopic Binary Stars

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

  2. Deep Hashing for Scalable Image Search.

    PubMed

    Lu, Jiwen; Liong, Venice Erin; Zhou, Jie

    2017-03-03

    In this paper, we propose a new deep hashing (DH) approach to learn compact binary codes for scalable image search. Unlike most existing binary codes learning methods which usually seek a single linear projection to map each sample into a binary feature vector, we develop a deep neural network to seek multiple hierarchical non-linear transformations to learn these binary codes, so that the nonlinear relationship of samples can be well exploited. Our model is learned under three constraints at the top layer of the developed deep network: 1) the loss between the compact real-valued code and the learned binary vector is minimized, 2) the binary codes distribute evenly on each bit, and 3) different bits are as independent as possible. To further improve the discriminative power of the learned binary codes, we extend DH into supervised DH (SDH) and multi-label supervised DH (MSDH) by including a discriminative term into the objective function of DH which simultaneously maximizes the inter-class variations and minimizes the intra-class variations of the learned binary codes with the single-label and multilabel settings, respectively. Extensive experimental results on eight widely used image search datasets show that our proposed methods achieve very competitive results with the state-of-thearts.

  3. Algorithms for optimal dyadic decision trees

    SciTech Connect

    Hush, Don; Porter, Reid

    2009-01-01

    A new algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data sets. This paper enhances and extends this algorithm by: introducing an adaptive grid search for the regularization parameter that guarantees optimal solutions for all relevant trees sizes, revising the core tree-building algorithm so that its run time is substantially smaller for most regularization parameter values on the grid, and incorporating new data structures and data pre-processing steps that provide significant run time enhancement in practice.

  4. The Eclipsing Binary On-Line Atlas (EBOLA)

    NASA Astrophysics Data System (ADS)

    Bradstreet, D. H.; Steelman, D. P.; Sanders, S. J.; Hargis, J. R.

    2004-05-01

    In conjunction with the upcoming release of \\it Binary Maker 3.0, an extensive on-line database of eclipsing binaries is being made available. The purposes of the atlas are: \\begin {enumerate} Allow quick and easy access to information on published eclipsing binaries. Amass a consistent database of light and radial velocity curve solutions to aid in solving new systems. Provide invaluable querying capabilities on all of the parameters of the systems so that informative research can be quickly accomplished on a multitude of published results. Aid observers in establishing new observing programs based upon stars needing new light and/or radial velocity curves. Encourage workers to submit their published results so that others may have easy access to their work. Provide a vast but easily accessible storehouse of information on eclipsing binaries to accelerate the process of understanding analysis techniques and current work in the field. \\end {enumerate} The database will eventually consist of all published eclipsing binaries with light curve solutions. The following information and data will be supplied whenever available for each binary: original light curves in all bandpasses, original radial velocity observations, light curve parameters, RA and Dec, V-magnitudes, spectral types, color indices, periods, binary type, 3D representation of the system near quadrature, plots of the original light curves and synthetic models, plots of the radial velocity observations with theoretical models, and \\it Binary Maker 3.0 data files (parameter, light curve, radial velocity). The pertinent references for each star are also given with hyperlinks directly to the papers via the NASA Abstract website for downloading, if available. In addition the Atlas has extensive searching options so that workers can specifically search for binaries with specific characteristics. The website has more than 150 systems already uploaded. The URL for the site is http://ebola.eastern.edu/.

  5. Additive Similarity Trees

    ERIC Educational Resources Information Center

    Sattath, Shmuel; Tversky, Amos

    1977-01-01

    Tree representations of similarity data are investigated. Hierarchical clustering is critically examined, and a more general procedure, called the additive tree, is presented. The additive tree representation is then compared to multidimensional scaling. (Author/JKS)

  6. Training Tree Transducers

    DTIC Science & Technology

    2004-01-01

    trees (similar to the role played by the finite- state acceptor FSA for strings). We describe the version (equivalent to TSG ( Schabes , 1990)) where...strictly contained in tree sets of tree adjoining gram- mars (Joshi and Schabes , 1997). 4 Extended-LHS Tree Transducers (xR) Section 1 informally described...changes without modifying the training procedure, as long as we stick to tree automata. 10 Related Work Tree substitution grammars or TSG ( Schabes , 1990

  7. Solar System binaries

    NASA Astrophysics Data System (ADS)

    Noll, Keith S.

    The discovery of binaries in each of the major populations of minor bodies in the solar system is propelling a rapid growth of heretofore unattainable physical information. The availability of mass and density constraints for minor bodies opens the door to studies of internal structure, comparisons with meteorite samples, and correlations between bulk-physical and surface-spectral properties. The number of known binaries is now more than 70 and is growing rapidly. A smaller number have had the extensive followup observations needed to derive mass and albedo information, but this list is growing as well. It will soon be the case that we will know more about the physical parameters of objects in the Kuiper Belt than has been known about asteroids in the Main Belt for the last 200 years. Another important aspect of binaries is understanding the mechanisms that lead to their formation and survival. The relative sizes and separations of binaries in the different minor body populations point to more than one mechanism for forming bound pairs. Collisions appear to play a major role in the Main Belt. Rotational and/or tidal fission may be important in the Near Earth population. For the Kuiper Belt, capture in multi-body interactions may be the preferred formation mechanism. However, all of these conclusions remain tentative and limited by observational and theoretical incompleteness. Observational techniques for identifying binaries are equally varied. High angular resolution observations from space and from the ground are critical for detection of the relatively distant binaries in the Main Belt and the Kuiper Belt. Radar has been the most productive method for detection of Near Earth binaries. Lightcurve analysis is an independent technique that is capable of exploring phase space inaccessible to direct observations. Finally, spacecraft flybys have played a crucial paradigm-changing role with discoveries that unlocked this now-burgeoning field.

  8. Search Cloud

    MedlinePlus

    ... this page: https://medlineplus.gov/cloud.html Search Cloud To use the sharing features on this page, ... chest pa and lateral Share the MedlinePlus search cloud with your users by embedding our search cloud ...

  9. Comprehensive Decision Tree Models in Bioinformatics

    PubMed Central

    Stiglic, Gregor; Kocbek, Simon; Pernek, Igor; Kokol, Peter

    2012-01-01

    Purpose Classification is an important and widely used machine learning technique in bioinformatics. Researchers and other end-users of machine learning software often prefer to work with comprehensible models where knowledge extraction and explanation of reasoning behind the classification model are possible. Methods This paper presents an extension to an existing machine learning environment and a study on visual tuning of decision tree classifiers. The motivation for this research comes from the need to build effective and easily interpretable decision tree models by so called one-button data mining approach where no parameter tuning is needed. To avoid bias in classification, no classification performance measure is used during the tuning of the model that is constrained exclusively by the dimensions of the produced decision tree. Results The proposed visual tuning of decision trees was evaluated on 40 datasets containing classical machine learning problems and 31 datasets from the field of bioinformatics. Although we did not expected significant differences in classification performance, the results demonstrate a significant increase of accuracy in less complex visually tuned decision trees. In contrast to classical machine learning benchmarking datasets, we observe higher accuracy gains in bioinformatics datasets. Additionally, a user study was carried out to confirm the assumption that the tree tuning times are significantly lower for the proposed method in comparison to manual tuning of the decision tree. Conclusions The empirical results demonstrate that by building simple models constrained by predefined visual boundaries, one not only achieves good comprehensibility, but also very good classification performance that does not differ from usually more complex models built using default settings of the classical decision tree algorithm. In addition, our study demonstrates the suitability of visually tuned decision trees for datasets with binary class

  10. The k-d Tree: A Hierarchical Model for Human Cognition.

    ERIC Educational Resources Information Center

    Vandendorpe, Mary M.

    This paper discusses a model of information storage and retrieval, the k-d tree (Bentley, 1975), a binary, hierarchical tree with multiple associate terms, which has been explored in computer research, and it is suggested that this model could be useful for describing human cognition. Included are two models of human long-term memory--networks and…

  11. Studies of Long Period Eclipsing Binaries

    NASA Astrophysics Data System (ADS)

    Ratajczak, M.; Hełminiak, K. G.; Konacki, M.

    2015-07-01

    The survey of long period eclipsing binaries from the All Sky Automated Survey (ASAS) catalog aims at searching for and characterizing subgiants and red giants in double-lined detached binary systems. Absolute physical and orbital parameters are presented based on radial velocities from high-quality optical spectra obtained with the following telescope/instrument combinations: 8.2 m Subaru/HDS, ESO 3.6 m/HARPS, 1.9 m Radcliffe/GIRAFFE, CTIO 1.5 m/CHIRON, and 1.2 m Euler/CORALIE. Photometric data from ASAS, SuperWASP, and the Solaris Project were also used. We discuss the derived uncertainties for the individual masses and radii of the components (better than 3% for several systems), as well as results from the spectral analysis performed for components of systems whose spectra we disentangled.

  12. Binary tree models of high-Reynolds-number turbulence

    NASA Astrophysics Data System (ADS)

    Aurell, Erik; Dormy, Emmanuel; Frick, Peter

    1997-08-01

    We consider hierarchical models for turbulence, that are simple generalizations of the standard Gledzer-Ohkitani-Yamada shell models (E. B. Gledzer, Dokl, Akad. Nauk SSSR 209, 5 (1973) [Sov. Phys. Dokl. 18, 216 (1973)]; M. Yamada and K. Ohkitani, J. Phys. Soc. Jpn. 56, 4210 (1987)). The density of degrees of freedom is constant in wave-number space. Looking only at this behavior and at the quadratic invariants in the inviscid unforced limit, the models can be thought of as systems living naturally in one spatial dimension, but being qualitatively similar to hydrodynamics in two (2D) and three dimensions. We investigated cascade phenomena and intermittency in the different cases. We observed and studied a forward cascade of enstrophy in the 2D case.

  13. Binary tree-based low power state assignment algorithm

    NASA Astrophysics Data System (ADS)

    Kajstura, Krzysztof; Kania, Dariusz

    2016-12-01

    A new low power state assignment algorithm is proposed in this paper. The essence of new coding is dividing all the states into subsets, which are sequentially assigned to the individual bits of code. This type of decomposition encoding, in which the coding is done bit by bit, retains the flexibility of assigning code words from the beginning to the end of the encoding process. The results of the experiments confirm efficiency of the proposed algorithm in comparison with the state assignment algorithms that have already been developed.

  14. Binary Coded Web Access Pattern Tree in Education Domain

    ERIC Educational Resources Information Center

    Gomathi, C.; Moorthi, M.; Duraiswamy, K.

    2008-01-01

    Web Access Pattern (WAP), which is the sequence of accesses pursued by users frequently, is a kind of interesting and useful knowledge in practice. Sequential Pattern mining is the process of applying data mining techniques to a sequential database for the purposes of discovering the correlation relationships that exist among an ordered list of…

  15. Rough Set Based Splitting Criterion for Binary Decision Tree Classifiers

    DTIC Science & Technology

    2006-09-26

    k -folds... Mean of Mean Accuracy (MMA) for the Fold Mean 153 Table A.2 Mean of Mean Error Rate (MMER) for the Fold Mean 154 Table A.3 Mean of Mean ...Precision (MMP) for the Fold Mean 155 Table A.4 Mean of Mean Recall (MMR) for the Fold Mean 156 Table A.5 Mean of Mean F-Measure (MMFM) for the

  16. Properties OF M31. V. 298 eclipsing binaries from PAndromeda

    SciTech Connect

    Lee, C.-H.; Koppenhoefer, J.; Seitz, S.; Bender, R.; Riffeser, A.; Kodric, M.; Hopp, U.; Snigula, J.; Gössl, C.; Kudritzki, R.-P.; Burgett, W.; Chambers, K.; Hodapp, K.; Kaiser, N.; Waters, C.

    2014-12-10

    The goal of this work is to conduct a photometric study of eclipsing binaries in M31. We apply a modified box-fitting algorithm to search for eclipsing binary candidates and determine their period. We classify these candidates into detached, semi-detached, and contact systems using the Fourier decomposition method. We cross-match the position of our detached candidates with the photometry from Local Group Survey and select 13 candidates brighter than 20.5 mag in V. The relative physical parameters of these detached candidates are further characterized with the Detached Eclipsing Binary Light curve fitter (DEBiL) by Devor. We will follow up the detached eclipsing binaries spectroscopically and determine the distance to M31.

  17. Binary and Millisecond Pulsars.

    PubMed

    Lorimer, Duncan R

    2008-01-01

    We review the main properties, demographics and applications of binary and millisecond radio pulsars. Our knowledge of these exciting objects has greatly increased in recent years, mainly due to successful surveys which have brought the known pulsar population to over 1800. There are now 83 binary and millisecond pulsars associated with the disk of our Galaxy, and a further 140 pulsars in 26 of the Galactic globular clusters. Recent highlights include the discovery of the young relativistic binary system PSR J1906+0746, a rejuvination in globular cluster pulsar research including growing numbers of pulsars with masses in excess of 1.5 M⊙, a precise measurement of relativistic spin precession in the double pulsar system and a Galactic millisecond pulsar in an eccentric (e = 0.44) orbit around an unevolved companion.

  18. Binary ferrihydrite catalysts

    DOEpatents

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

    1996-12-03

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

  19. Binary ferrihydrite catalysts

    DOEpatents

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

    1996-01-01

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

  20. Optimal periodic binary codes of lengths 28 to 64

    NASA Technical Reports Server (NTRS)

    Tyler, S.; Keston, R.

    1980-01-01

    Results from computer searches performed to find repeated binary phase coded waveforms with optimal periodic autocorrelation functions are discussed. The best results for lengths 28 to 64 are given. The code features of major concern are where (1) the peak sidelobe in the autocorrelation function is small and (2) the sum of the squares of the sidelobes in the autocorrelation function is small.

  1. Categorizing ideas about trees: a tree of trees.

    PubMed

    Fisler, Marie; Lecointre, Guillaume

    2013-01-01

    The aim of this study is to explore whether matrices and MP trees used to produce systematic categories of organisms could be useful to produce categories of ideas in history of science. We study the history of the use of trees in systematics to represent the diversity of life from 1766 to 1991. We apply to those ideas a method inspired from coding homologous parts of organisms. We discretize conceptual parts of ideas, writings and drawings about trees contained in 41 main writings; we detect shared parts among authors and code them into a 91-characters matrix and use a tree representation to show who shares what with whom. In other words, we propose a hierarchical representation of the shared ideas about trees among authors: this produces a "tree of trees." Then, we categorize schools of tree-representations. Classical schools like "cladists" and "pheneticists" are recovered but others are not: "gradists" are separated into two blocks, one of them being called here "grade theoreticians." We propose new interesting categories like the "buffonian school," the "metaphoricians," and those using "strictly genealogical classifications." We consider that networks are not useful to represent shared ideas at the present step of the study. A cladogram is made for showing who is sharing what with whom, but also heterobathmy and homoplasy of characters. The present cladogram is not modelling processes of transmission of ideas about trees, and here it is mostly used to test for proximity of ideas of the same age and for categorization.

  2. Tree Tectonics

    NASA Astrophysics Data System (ADS)

    Vogt, Peter R.

    2004-09-01

    Nature often replicates her processes at different scales of space and time in differing media. Here a tree-trunk cross section I am preparing for a dendrochronological display at the Battle Creek Cypress Swamp Nature Sanctuary (Calvert County, Maryland) dried and cracked in a way that replicates practically all the planform features found along the Mid-Oceanic Ridge (see Figure 1). The left-lateral offset of saw marks, contrasting with the right-lateral ``rift'' offset, even illustrates the distinction between transcurrent (strike-slip) and transform faults, the latter only recognized as a geologic feature, by J. Tuzo Wilson, in 1965. However, wood cracking is but one of many examples of natural processes that replicate one or several elements of lithospheric plate tectonics. Many of these examples occur in everyday venues and thus make great teaching aids, ``teachable'' from primary school to university levels. Plate tectonics, the dominant process of Earth geology, also occurs in miniature on the surface of some lava lakes, and as ``ice plate tectonics'' on our frozen seas and lakes. Ice tectonics also happens at larger spatial and temporal scales on the Jovian moons Europa and perhaps Ganymede. Tabletop plate tectonics, in which a molten-paraffin ``asthenosphere'' is surfaced by a skin of congealing wax ``plates,'' first replicated Mid-Oceanic Ridge type seafloor spreading more than three decades ago. A seismologist (J. Brune, personal communication, 2004) discovered wax plate tectonics by casually and serendipitously pulling a stick across a container of molten wax his wife and daughters had used in making candles. Brune and his student D. Oldenburg followed up and mirabile dictu published the results in Science (178, 301-304).

  3. Configuring computation tree topologies on a distributed computing system

    SciTech Connect

    Woei Lin; Chuan-lin Wu

    1983-01-01

    The authors describe an approach to connecting hardware resources for high-performance computation. Two basic algorithms are designed for configuring binary tree topologies. The configuring command can be issued from any processing mode. The algorithms can select proper modes for connection while maintaining good utilization of processing nodes. 7 references.

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

  5. On Filtered Binary Processes.

    DTIC Science & Technology

    1984-11-01

    BINARY PROCESSES 12. PERSONAL AUTHOR(S) R.F. Pawula and S.O. Rice 13s. TYPE OF REPORT 13b. TIME COVERED.!14 DATE OF REPORT MY,, o.. Day) 15. PAGE COUNT...APR EDITION OF I JAN 73 IS OBSOLETE. UNCLASSIFIED SECURITY CLASSIFICATION OF THIS PAGE eO R.TR. 85-0055 On Filtered Binary Processes R . F. Pawula ...is authorized to reproduce and distribute reprints for governmental purposes notwithstanding any copyright notation ",."/ hereon. R. F. Pawula is with

  6. Binary and Millisecond Pulsars.

    PubMed

    Lorimer, Duncan R

    2005-01-01

    We review the main properties, demographics and applications of binary and millisecond radio pulsars. Our knowledge of these exciting objects has greatly increased in recent years, mainly due to successful surveys which have brought the known pulsar population to over 1700. There are now 80 binary and millisecond pulsars associated with the disk of our Galaxy, and a further 103 pulsars in 24 of the Galactic globular clusters. Recent highlights have been the discovery of the first ever double pulsar system and a recent flurry of discoveries in globular clusters, in particular Terzan 5.

  7. Binary Oscillatory Crossflow Electrophoresis

    NASA Technical Reports Server (NTRS)

    Molloy, Richard F.; Gallagher, Christopher T.; Leighton, David T., Jr.

    1996-01-01

    We present preliminary results of our implementation of a novel electrophoresis separation technique: Binary Oscillatory Cross flow Electrophoresis (BOCE). The technique utilizes the interaction of two driving forces, an oscillatory electric field and an oscillatory shear flow, to create an active binary filter for the separation of charged species. Analytical and numerical studies have indicated that this technique is capable of separating proteins with electrophoretic mobilities differing by less than 10%. With an experimental device containing a separation chamber 20 cm long, 5 cm wide, and 1 mm thick, an order of magnitude increase in throughput over commercially available electrophoresis devices is theoretically possible.

  8. The Needs of Trees

    ERIC Educational Resources Information Center

    Boyd, Amy E.; Cooper, Jim

    2004-01-01

    Tree rings can be used not only to look at plant growth, but also to make connections between plant growth and resource availability. In this lesson, students in 2nd-4th grades use role-play to become familiar with basic requirements of trees and how availability of those resources is related to tree ring sizes and tree growth. These concepts can…

  9. Hexagonal Pixels and Indexing Scheme for Binary Images

    NASA Technical Reports Server (NTRS)

    Johnson, Gordon G.

    2004-01-01

    A scheme for resampling binaryimage data from a rectangular grid to a regular hexagonal grid and an associated tree-structured pixel-indexing scheme keyed to the level of resolution have been devised. This scheme could be utilized in conjunction with appropriate image-data-processing algorithms to enable automated retrieval and/or recognition of images. For some purposes, this scheme is superior to a prior scheme that relies on rectangular pixels: one example of such a purpose is recognition of fingerprints, which can be approximated more closely by use of line segments along hexagonal axes than by line segments along rectangular axes. This scheme could also be combined with algorithms for query-image-based retrieval of images via the Internet. A binary image on a rectangular grid is generated by raster scanning or by sampling on a stationary grid of rectangular pixels. In either case, each pixel (each cell in the rectangular grid) is denoted as either bright or dark, depending on whether the light level in the pixel is above or below a prescribed threshold. The binary data on such an image are stored in a matrix form that lends itself readily to searches of line segments aligned with either or both of the perpendicular coordinate axes. The first step in resampling onto a regular hexagonal grid is to make the resolution of the hexagonal grid fine enough to capture all the binaryimage detail from the rectangular grid. In practice, this amounts to choosing a hexagonal-cell width equal to or less than a third of the rectangular- cell width. Once the data have been resampled onto the hexagonal grid, the image can readily be checked for line segments aligned with the hexagonal coordinate axes, which typically lie at angles of 30deg, 90deg, and 150deg with respect to say, the horizontal rectangular coordinate axis. Optionally, one can then rotate the rectangular image by 90deg, then again sample onto the hexagonal grid and check for line segments at angles of 0deg, 60deg

  10. Talent Searches.

    ERIC Educational Resources Information Center

    Silverman, Linda Kreger, Ed.

    1994-01-01

    Talent searches are discussed in this journal theme issue, with two feature articles and several recurring columns. "Talent Search: A Driving Force in Gifted Education," by Paula Olszewski-Kubilius, defines what a talent search is, how the Talent Search was developed by Dr. Julian Stanley at Johns Hopkins University in Maryland, the…

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

  12. Eclipsing Binary Update, No. 2.

    NASA Astrophysics Data System (ADS)

    Williams, D. B.

    1996-01-01

    Contents: 1. Wrong again! The elusive period of DHK 41. 2. Stars observed and not observed. 3. Eclipsing binary chart information. 4. Eclipsing binary news and notes. 5. A note on SS Arietis. 6. Featured star: TX Ursae Majoris.

  13. Tea tree oil.

    PubMed

    Hartford, Orville; Zug, Kathryn A

    2005-09-01

    Tea tree oil is a popular ingredient in many over-the-counter healthcare and cosmetic products. With the explosion of the natural and alternative medicine industry, more and more people are using products containing tea tree oil. This article reviews basic information about tea tree oil and contact allergy, including sources of tea tree oil, chemical composition, potential cross reactions, reported cases of allergic contact dermatitis, allergenic compounds in tea tree oil, practical patch testing information, and preventive measures.

  14. Binary stars - Formation by fragmentation

    NASA Technical Reports Server (NTRS)

    Boss, Alan P.

    1988-01-01

    Theories of binary star formation by capture, separate nuclei, fission and fragmentation are compared, assessing the success of theoretical attempts to explain the observed properties of main-sequence binary stars. The theory of formation by fragmentation is examined, discussing the prospects for checking the theory against observations of binary premain-sequence stars. It is concluded that formation by fragmentation is successful at explaining many of the key properties of main-sequence binary stars.

  15. Orbits For Sixteen Binaries

    NASA Astrophysics Data System (ADS)

    Cvetkovic, Z.; Novakovic, B.

    2006-12-01

    In this paper orbits for 13 binaries are recalculated and presented. The reason is that recent observations show higher residuals than the corresponding ephemerides calculated by using the orbital elements given in the Sixth Catalog of Orbits of Visual Binary Stars. The binaries studied were: WDS 00182+7257 = A 803, WDS 00335+4006 = HO 3, WDS 00583+2124 = BU 302, WDS 01011+6022 = A 926, WDS 01014+1155 = BU 867, WDS 01112+4113 = A 655, WDS 01361-2954 + HJ 3447, WDS 02333+5219 = STT 42 AB, WDS 04362+0814 = A 1840 AB, WDS 08017-0836 = A 1580, WDS 08277-0425 = A 550, WDS 17471+1742 = STF 2215 and WDS 18025+4414 = BU 1127 Aa-B. In addition, for three binaries - WDS 01532+1526 = BU 260, WDS 02563+7253 =STF 312 AB and WDS 05003+3924 = STT 92 AB - the orbital elements are calculated for the first time. In this paper the authors present not only the orbital elements, but the masses, dynamical parallaxes, absolute magnitudes and ephemerides for the next five years, as well.

  16. Separation in Binary Alloys

    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.

  17. Recognizing human gestures using a novel SVM tree

    NASA Astrophysics Data System (ADS)

    Jain, Hitesh; Chatterjee, Abhik; Kumar, Sanjeev; Raman, Balasubramanian

    2012-01-01

    In this paper, a novel support vector machine (SVM) tree is proposed for gesture recognition from the silhouette images. A skeleton based strategy is adopted to extract the features from a video sequence representing any human gesture. In our binary tree implementation of SVM, the number of binary classifiers required is reduced since, instead of grouping different classes together in order to train a global classifier, we select two classes for training at every node of the tree and use probability theory to classify the remaining points based on their similarities and differences to the two classes used for training. This process is carried on, randomly selecting two classes for training at a node, thus creating two child nodes and subsequently assigning the classes to the nodes derived. In the classification phase, we start out at the root node. At each node of the tree, a binary decision is made regarding the assignment of the input data point to either of the group represented by the left and right sub-tree of the node which may contain multiple classes. This is repeated recursively downward until we reach a leaf node that represents the class to which the input data point belonging. Finally, the proposed framework is tested on various data sets to check its efficiency. Encouraging results are achieved in terms of classification accuracy.

  18. Binary Cepheids From High-Angular Resolution

    NASA Astrophysics Data System (ADS)

    Gallenne, A.; Mérand, A.; Kervella, P.

    2015-12-01

    Optical interferometry is the only technique giving access to milli-arcsecond (mas) spatial resolution. This is a powerful and unique tool to detect the close orbiting companions of Cepheids, and offers an unique opportunity to make progress in resolving the Cepheid mass discrepancy. Our goal in studying binary Cepheids is to measure the astrometric position of the high-contrast companion, and then combine them with spectroscopic measurements to derive the orbital elements, distances, and dynamical masses. In the course of this program, we developed a new tool, CANDID, to search for high-contrast companions and set detection limits from interferometric observations

  19. Discriminating crop and other canopies by overlapping binary image layers

    NASA Astrophysics Data System (ADS)

    Doi, Ryoichi

    2013-02-01

    For optimal management of agricultural fields by remote sensing, discrimination of the crop canopy from weeds and other objects is essential. In a digital photograph, a rice canopy was discriminated from a variety of weed and tree canopies and other objects by overlapping binary image layers of red-green-blue and other color components indicating the pixels with target canopy-specific (intensity) values based on the ranges of means ±(3×) standard deviations. By overlapping and merging the binary image layers, the target canopy specificity improved to 0.0015 from 0.027 for the yellow 1× standard deviation binary image layer, which was the best among all combinations of color components and means ±(3×) standard deviations. The most target rice canopy-likely pixels were further identified by limiting the pixels at different luminosity values. The discriminatory power was also visually demonstrated in this manner.

  20. A tree-based model for homogeneous groupings of multinomials.

    PubMed

    Yang, Tae Young

    2005-11-30

    The motivation of this paper is to provide a tree-based method for grouping multinomial data according to their classification probability vectors. We produce an initial tree by binary recursive partitioning whereby multinomials are successively split into two subsets and the splits are determined by maximizing the likelihood function. If the number of multinomials k is too large, we propose to order the multinomials, and then build the initial tree based on a dramatically smaller number k-1 of possible splits. The tree is then pruned from the bottom up. The pruning process involves a sequence of hypothesis tests of a single homogeneous group against the alternative that there are two distinct, internally homogeneous groups. As pruning criteria, the Bayesian information criterion and the Wilcoxon rank-sum test are proposed. The tree-based model is illustrated on genetic sequence data. Homogeneous groupings of genetic sequences present new opportunities to understand and align these sequences.

  1. The identification of complex interactions in epidemiology and toxicology: a simulation study of boosted regression trees

    PubMed Central

    2014-01-01

    Background There is a need to evaluate complex interaction effects on human health, such as those induced by mixtures of environmental contaminants. The usual approach is to formulate an additive statistical model and check for departures using product terms between the variables of interest. In this paper, we present an approach to search for interaction effects among several variables using boosted regression trees. Methods We simulate a continuous outcome from real data on 27 environmental contaminants, some of which are correlated, and test the method’s ability to uncover the simulated interactions. The simulated outcome contains one four-way interaction, one non-linear effect and one interaction between a continuous variable and a binary variable. Four scenarios reflecting different strengths of association are simulated. We illustrate the method using real data. Results The method succeeded in identifying the true interactions in all scenarios except where the association was weakest. Some spurious interactions were also found, however. The method was also capable to identify interactions in the real data set. Conclusions We conclude that boosted regression trees can be used to uncover complex interaction effects in epidemiological studies. PMID:24993424

  2. Learning to assign binary weights to binary descriptor

    NASA Astrophysics Data System (ADS)

    Huang, Zhoudi; Wei, Zhenzhong; Zhang, Guangjun

    2016-10-01

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

  3. TRIPLE-STAR CANDIDATES AMONG THE KEPLER BINARIES

    SciTech Connect

    Rappaport, S.; Deck, K.; Sanchis-Ojeda, R.; Levine, A.; Borkovits, T.; Carter, J.; El Mellah, I.; Kalomeni, B. E-mail: kdeck@mit.edu E-mail: aml@space.mit.edu E-mail: jacarter@cfa.harvard.edu

    2013-05-01

    We present the results of a search through the photometric database of Kepler eclipsing binaries looking for evidence of hierarchical triple-star systems. The presence of a third star orbiting the binary can be inferred from eclipse timing variations. We apply a simple algorithm in an automated determination of the eclipse times for all 2157 binaries. The ''calculated'' eclipse times, based on a constant period model, are subtracted from those observed. The resulting O - C (observed minus calculated times) curves are then visually inspected for periodicities in order to find triple-star candidates. After eliminating false positives due to the beat frequency between the {approx}1/2 hr Kepler cadence and the binary period, 39 candidate triple systems were identified. The periodic O - C curves for these candidates were then fit for contributions from both the classical Roemer delay and so-called physical delay, in an attempt to extract a number of the system parameters of the triple. We discuss the limitations of the information that can be inferred from these O - C curves without further supplemental input, e.g., ground-based spectroscopy. Based on the limited range of orbital periods for the triple-star systems to which this search is sensitive, we can extrapolate to estimate that at least 20% of all close binaries have tertiary companions.

  4. IND - THE IND DECISION TREE PACKAGE

    NASA Technical Reports Server (NTRS)

    Buntine, W.

    1994-01-01

    A common approach to supervised classification and prediction in artificial intelligence and statistical pattern recognition is the use of decision trees. A tree is "grown" from data using a recursive partitioning algorithm to create a tree which has good prediction of classes on new data. Standard algorithms are CART (by Breiman Friedman, Olshen and Stone) and ID3 and its successor C4 (by Quinlan). As well as reimplementing parts of these algorithms and offering experimental control suites, IND also introduces Bayesian and MML methods and more sophisticated search in growing trees. These produce more accurate class probability estimates that are important in applications like diagnosis. IND is applicable to most data sets consisting of independent instances, each described by a fixed length vector of attribute values. An attribute value may be a number, one of a set of attribute specific symbols, or it may be omitted. One of the attributes is delegated the "target" and IND grows trees to predict the target. Prediction can then be done on new data or the decision tree printed out for inspection. IND provides a range of features and styles with convenience for the casual user as well as fine-tuning for the advanced user or those interested in research. IND can be operated in a CART-like mode (but without regression trees, surrogate splits or multivariate splits), and in a mode like the early version of C4. Advanced features allow more extensive search, interactive control and display of tree growing, and Bayesian and MML algorithms for tree pruning and smoothing. These often produce more accurate class probability estimates at the leaves. IND also comes with a comprehensive experimental control suite. IND consists of four basic kinds of routines: data manipulation routines, tree generation routines, tree testing routines, and tree display routines. The data manipulation routines are used to partition a single large data set into smaller training and test sets. The

  5. Fault-Tree Compiler

    NASA Technical Reports Server (NTRS)

    Butler, Ricky W.; Boerschlein, David P.

    1993-01-01

    Fault-Tree Compiler (FTC) program, is software tool used to calculate probability of top event in fault tree. Gates of five different types allowed in fault tree: AND, OR, EXCLUSIVE OR, INVERT, and M OF N. High-level input language easy to understand and use. In addition, program supports hierarchical fault-tree definition feature, which simplifies tree-description process and reduces execution time. Set of programs created forming basis for reliability-analysis workstation: SURE, ASSIST, PAWS/STEM, and FTC fault-tree tool (LAR-14586). Written in PASCAL, ANSI-compliant C language, and FORTRAN 77. Other versions available upon request.

  6. NEA rotations and binaries

    NASA Astrophysics Data System (ADS)

    Pravec, Petr; Harris, A. W.; Warner, B. D.

    2007-05-01

    Of nearly 3900 near-Earth asteroids known in June 2006, 325 have got estimated rotation periods. NEAs with sizes down to 10 meters have been sampled. Observed spin distribution shows a major changing point around D=200 m. Larger NEAs show a barrier against spin rates >11 d-1 (period P~2.2 h) that shifts to slower rates with increasing equatorial elongation. The spin barrier is interpreted as a critical spin rate for bodies held together by self-gravitation only, suggesting that NEAs larger than 200 m are mostly strenghtless bodies (i.e., with zero tensile strength), so called `rubble piles'. The barrier disappears at D<200 m where most objects rotate too fast to be held together by self-gravitation only, so a non-zero cohesion is implied in the smaller NEAs. The distribution of NEA spin rates in the `rubble pile' range (D>0.2 km) is non-Maxwellian, suggesting that other mechanisms than just collisions worked there. There is a pile up in front of the barrier (P of 2-3 h). It may be related to a spin up mechanism crowding asteroids to the barrier. An excess of slow rotators is seen at P>30 h. The spin-down mechanism has no clear lower limit on spin rate; periods as long as tens of days occur. Most NEAs appear to be in basic spin states with rotation around the principal axis. Excited rotations are present among and actually dominate in slow rotators with damping timescales >4.5 byr. A few tumblers observed among fast rotating coherent objects consistently appear to be more rigid or younger than the larger, rubble-pile tumblers. An abundant population of binary systems among NEAs has been found. The fraction of binaries among NEAs larger than 0.3 km has been estimated to be 15 +/-4%. Primaries of the binary systems concentrate at fast spin rates (periods 2-3 h) and low amplitudes, i.e., they lie just below the spin barrier. The total angular momentum content in the binary systems suggests that they formed at the critical spin rate, and that little or no angular

  7. Categorizing Ideas about Trees: A Tree of Trees

    PubMed Central

    Fisler, Marie; Lecointre, Guillaume

    2013-01-01

    The aim of this study is to explore whether matrices and MP trees used to produce systematic categories of organisms could be useful to produce categories of ideas in history of science. We study the history of the use of trees in systematics to represent the diversity of life from 1766 to 1991. We apply to those ideas a method inspired from coding homologous parts of organisms. We discretize conceptual parts of ideas, writings and drawings about trees contained in 41 main writings; we detect shared parts among authors and code them into a 91-characters matrix and use a tree representation to show who shares what with whom. In other words, we propose a hierarchical representation of the shared ideas about trees among authors: this produces a “tree of trees.” Then, we categorize schools of tree-representations. Classical schools like “cladists” and “pheneticists” are recovered but others are not: “gradists” are separated into two blocks, one of them being called here “grade theoreticians.” We propose new interesting categories like the “buffonian school,” the “metaphoricians,” and those using “strictly genealogical classifications.” We consider that networks are not useful to represent shared ideas at the present step of the study. A cladogram is made for showing who is sharing what with whom, but also heterobathmy and homoplasy of characters. The present cladogram is not modelling processes of transmission of ideas about trees, and here it is mostly used to test for proximity of ideas of the same age and for categorization. PMID:23950877

  8. A Beta-splitting model for evolutionary trees

    PubMed Central

    Sainudiin, Raazesh

    2016-01-01

    In this article, we construct a generalization of the Blum–François Beta-splitting model for evolutionary trees, which was itself inspired by Aldous' Beta-splitting model on cladograms. The novelty of our approach allows for asymmetric shares of diversification rates (or diversification ‘potential’) between two sister species in an evolutionarily interpretable manner, as well as the addition of extinction to the model in a natural way. We describe the incremental evolutionary construction of a tree with n leaves by splitting or freezing extant lineages through the generating, organizing and deleting processes. We then give the probability of any (binary rooted) tree under this model with no extinction, at several resolutions: ranked planar trees giving asymmetric roles to the first and second offspring species of a given species and keeping track of the order of the speciation events occurring during the creation of the tree, unranked planar trees, ranked non-planar trees and finally (unranked non-planar) trees. We also describe a continuous-time equivalent of the generating, organizing and deleting processes where tree topology and branch lengths are jointly modelled and provide code in SageMath/Python for these algorithms. PMID:27293780

  9. Confidential Searches.

    ERIC Educational Resources Information Center

    Kenney, Linda Chion

    2003-01-01

    Will the stealth superintendent hunt in Cincinnati become tomorrow's standard approach? Search consultants and superintendents offer their views on how far confidentiality should go. Also includes a search firm's process for shielding identities and a confidentiality pledge. (MLF)

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

  11. Processing Of Binary Images

    NASA Astrophysics Data System (ADS)

    Hou, H. S.

    1985-07-01

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

  12. Binary image classification

    NASA Technical Reports Server (NTRS)

    Morris, Carl N.

    1987-01-01

    Motivated by the LANDSAT problem of estimating the probability of crop or geological types based on multi-channel satellite imagery data, Morris and Kostal (1983), Hill, Hinkley, Kostal, and Morris (1984), and Morris, Hinkley, and Johnston (1985) developed an empirical Bayes approach to this problem. Here, researchers return to those developments, making certain improvements and extensions, but restricting attention to the binary case of only two attributes.

  13. Double Eclipsing Binary Fitting

    NASA Astrophysics Data System (ADS)

    Cagas, P.; Pejcha, O.

    2012-06-01

    The parameters of the mutual orbit of eclipsing binaries that are physically connected can be obtained by precision timing of minima over time through light travel time effect, apsidal motion or orbital precession. This, however, requires joint analysis of data from different sources obtained through various techniques and with insufficiently quantified uncertainties. In particular, photometric uncertainties are often underestimated, which yields too small uncertainties in minima timings if determined through analysis of a χ2 surface. The task is even more difficult for double eclipsing binaries, especially those with periods close to a resonance such as CzeV344, where minima get often blended with each other. This code solves the double binary parameters simultaneously and then uses these parameters to determine minima timings (or more specifically O-C values) for individual datasets. In both cases, the uncertainties (or more precisely confidence intervals) are determined through bootstrap resampling of the original data. This procedure to a large extent alleviates the common problem with underestimated photometric uncertainties and provides a check on possible degeneracies in the parameters and the stability of the results. While there are shortcomings to this method as well when compared to Markov Chain Monte Carlo methods, the ease of the implementation of bootstrapping is a significant advantage.

  14. Evolution of tree nutrition.

    PubMed

    Raven, John A; Andrews, Mitchell

    2010-09-01

    Using a broad definition of trees, the evolutionary origins of trees in a nutritional context is considered using data from the fossil record and molecular phylogeny. Trees are first known from the Late Devonian about 380 million years ago, originated polyphyletically at the pteridophyte grade of organization; the earliest gymnosperms were trees, and trees are polyphyletic in the angiosperms. Nutrient transporters, assimilatory pathways, homoiohydry (cuticle, intercellular gas spaces, stomata, endohydric water transport systems including xylem and phloem-like tissue) and arbuscular mycorrhizas preceded the origin of trees. Nutritional innovations that began uniquely in trees were the seed habit and, certainly (but not necessarily uniquely) in trees, ectomycorrhizas, cyanobacterial, actinorhizal and rhizobial (Parasponia, some legumes) diazotrophic symbioses and cluster roots.

  15. Tree Classification Software

    NASA Technical Reports Server (NTRS)

    Buntine, Wray

    1993-01-01

    This paper introduces the IND Tree Package to prospective users. IND does supervised learning using classification trees. This learning task is a basic tool used in the development of diagnosis, monitoring and expert systems. The IND Tree Package was developed as part of a NASA project to semi-automate the development of data analysis and modelling algorithms using artificial intelligence techniques. The IND Tree Package integrates features from CART and C4 with newer Bayesian and minimum encoding methods for growing classification trees and graphs. The IND Tree Package also provides an experimental control suite on top. The newer features give improved probability estimates often required in diagnostic and screening tasks. The package comes with a manual, Unix 'man' entries, and a guide to tree methods and research. The IND Tree Package is implemented in C under Unix and was beta-tested at university and commercial research laboratories in the United States.

  16. Suspicionless Searches.

    ERIC Educational Resources Information Center

    Zirkel, Perry A.

    2000-01-01

    In a federal case involving a vice-principal's pat-down search of middle-school students in a cafeteria (for a missing pizza knife), the court upheld the search, saying it was relatively unintrusive and met "TLO's" reasonable-suspicion standards. Principals need reasonable justification for searching a group. (Contains 18 references.)…

  17. DEVELOPMENT OF A MANAGEMENT SYSTEM OF ROADSIDE TREES USING RFID AND ONTOLOGY

    NASA Astrophysics Data System (ADS)

    Yabuki, Nobuyoshi; Kikushige, Yuki; Fukuda, Tomohiro; Ebashi, Yumeka

    It is necessary to make scientific and systematic diagnosis for roadside trees, which are essential for comfortable urban environment, in order to keep them in healthy conditions because they may not be planted adequately. Therefore, in this research, a Roadside Tree Diagnosis Support System (RTDSS) was developed using Radio Frequency IDentification (RFID) and Personal Digital Assistants (PDA) to facilitate diagnosis based on the Visual Tree Assessment (VTA) method. The system was used on a trial basis to real roadside trees by tree surgeons and was highly evaluated. Since governmental or municipal agencies, which develop and maintain the databases of roadside trees, tend to use different terminologies, units and tree registration systems, it is difficult to compare or combine two or more roadside tree databases. Thus, the ontology of roadside tree management was developed to compare and analyze various roadside tree databases. Two different databases were developed and testing of the developed ontology system successfully showed proper searching result over different terminologies.

  18. Support-vector-machine tree-based domain knowledge learning toward automated sports video classification

    NASA Astrophysics Data System (ADS)

    Xiao, Guoqiang; Jiang, Yang; Song, Gang; Jiang, Jianmin

    2010-12-01

    We propose a support-vector-machine (SVM) tree to hierarchically learn from domain knowledge represented by low-level features toward automatic classification of sports videos. The proposed SVM tree adopts a binary tree structure to exploit the nature of SVM's binary classification, where each internal node is a single SVM learning unit, and each external node represents the classified output type. Such a SVM tree presents a number of advantages, which include: 1. low computing cost; 2. integrated learning and classification while preserving individual SVM's learning strength; and 3. flexibility in both structure and learning modules, where different numbers of nodes and features can be added to address specific learning requirements, and various learning models can be added as individual nodes, such as neural networks, AdaBoost, hidden Markov models, dynamic Bayesian networks, etc. Experiments support that the proposed SVM tree achieves good performances in sports video classifications.

  19. Binary-Signal Recovery

    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

  20. THIRTY NEW LOW-MASS SPECTROSCOPIC BINARIES

    SciTech Connect

    Shkolnik, Evgenya L.; Hebb, Leslie; Cameron, Andrew C.; Liu, Michael C.; Neill Reid, I. E-mail: Andrew.Cameron@st-and.ac.u E-mail: mliu@ifa.hawaii.ed

    2010-06-20

    As part of our search for young M dwarfs within 25 pc, we acquired high-resolution spectra of 185 low-mass stars compiled by the NStars project that have strong X-ray emission. By cross-correlating these spectra with radial velocity standard stars, we are sensitive to finding multi-lined spectroscopic binaries. We find a low-mass spectroscopic binary fraction of 16% consisting of 27 SB2s, 2 SB3s, and 1 SB4, increasing the number of known low-mass spectroscopic binaries (SBs) by 50% and proving that strong X-ray emission is an extremely efficient way to find M-dwarf SBs. WASP photometry of 23 of these systems revealed two low-mass eclipsing binaries (EBs), bringing the count of known M-dwarf EBs to 15. BD-22 5866, the ESB4, was fully described in 2008 by Shkolnik et al. and CCDM J04404+3127 B consists of two mid-M stars orbiting each other every 2.048 days. WASP also provided rotation periods for 12 systems, and in the cases where the synchronization time scales are short, we used P{sub rot} to determine the true orbital parameters. For those with no P{sub rot}, we used differential radial velocities to set upper limits on orbital periods and semimajor axes. More than half of our sample has near-equal-mass components (q > 0.8). This is expected since our sample is biased toward tight orbits where saturated X-ray emission is due to tidal spin-up rather than stellar youth. Increasing the samples of M-dwarf SBs and EBs is extremely valuable in setting constraints on current theories of stellar multiplicity and evolution scenarios for low-mass multiple systems.

  1. THE PHASES DIFFERENTIAL ASTROMETRY DATA ARCHIVE. II. UPDATED BINARY STAR ORBITS AND A LONG PERIOD ECLIPSING BINARY

    SciTech Connect

    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.

  2. How eco-evolutionary principles can guide tree breeding and tree biotechnology for enhanced productivity.

    PubMed

    Franklin, Oskar; Palmroth, Sari; Näsholm, Torgny

    2014-11-01

    Tree breeding and biotechnology can enhance forest productivity and help alleviate the rising pressure on forests from climate change and human exploitation. While many physiological processes and genes are targeted in search of genetically improved tree productivity, an overarching principle to guide this search is missing. Here, we propose a method to identify the traits that can be modified to enhance productivity, based on the differences between trees shaped by natural selection and 'improved' trees with traits optimized for productivity. We developed a tractable model of plant growth and survival to explore such potential modifications under a range of environmental conditions, from non-water limited to severely drought-limited sites. We show how key traits are controlled by a trade-off between productivity and survival, and that productivity can be increased at the expense of long-term survival by reducing isohydric behavior (stomatal regulation of leaf water potential) and allocation to defense against pests compared with native trees. In contrast, at dry sites occupied by naturally drought-resistant trees, the model suggests a better strategy may be to select trees with slightly lower wood density than the native trees and to augment isohydric behavior and allocation to defense. Thus, which traits to modify, and in which direction, depend on the original tree species or genotype, the growth environment and wood-quality versus volume production preferences. In contrast to this need for customization of drought and pest resistances, consistent large gains in productivity for all genotypes can be obtained if root traits can be altered to reduce competition for water and nutrients. Our approach illustrates the potential of using eco-evolutionary theory and modeling to guide plant breeding and genetic technology in selecting target traits in the quest for higher forest productivity.

  3. Illumination Under Trees

    SciTech Connect

    Max, N

    2002-08-19

    This paper is a survey of the author's work on illumination and shadows under trees, including the effects of sky illumination, sun penumbras, scattering in a misty atmosphere below the trees, and multiple scattering and transmission between leaves. It also describes a hierarchical image-based rendering method for trees.

  4. The Wish Tree Project

    ERIC Educational Resources Information Center

    Brooks, Sarah DeWitt

    2010-01-01

    This article describes the author's experience in implementing a Wish Tree project in her school in an effort to bring the school community together with a positive art-making experience during a potentially stressful time. The concept of a wish tree is simple: plant a tree; provide tags and pencils for writing wishes; and encourage everyone to…

  5. Diary of a Tree.

    ERIC Educational Resources Information Center

    Srulowitz, Frances

    1992-01-01

    Describes an activity to develop students' skills of observation and recordkeeping by studying the growth of a tree's leaves during the spring. Children monitor the growth of 11 tress over a 2-month period, draw pictures of the tree at different stages of growth, and write diaries of the tree's growth. (MDH)

  6. Minnesota's Forest Trees. Revised.

    ERIC Educational Resources Information Center

    Miles, William R.; Fuller, Bruce L.

    This bulletin describes 46 of the more common trees found in Minnesota's forests and windbreaks. The bulletin contains two tree keys, a summer key and a winter key, to help the reader identify these trees. Besides the two keys, the bulletin includes an introduction, instructions for key use, illustrations of leaf characteristics and twig…

  7. Winter Birch Trees

    ERIC Educational Resources Information Center

    Sweeney, Debra; Rounds, Judy

    2011-01-01

    Trees are great inspiration for artists. Many art teachers find themselves inspired and maybe somewhat obsessed with the natural beauty and elegance of the lofty tree, and how it changes through the seasons. One such tree that grows in several regions and always looks magnificent, regardless of the time of year, is the birch. In this article, the…

  8. IQPNNI: moving fast through tree space and stopping in time.

    PubMed

    Vinh, Le Sy; Von Haeseler, Arndt

    2004-08-01

    An efficient tree reconstruction method (IQPNNI) is introduced to reconstruct a phylogenetic tree based on DNA or amino acid sequence data. Our approach combines various fast algorithms to generate a list of potential candidate trees. The key ingredient is the definition of so-called important quartets (IQs), which allow the computation of an intermediate tree in O(n(2)) time for n sequences. The resulting tree is then further optimized by applying the nearest neighbor interchange (NNI) operation. Subsequently a random fraction of the sequences is deleted from the best tree found so far. The deleted sequences are then re-inserted in the smaller tree using the important quartet puzzling (IQP) algorithm. These steps are repeated several times and the best tree, with respect to the likelihood criterion, is considered as the inferred phylogenetic tree. Moreover, we suggest a rule which indicates when to stop the search. Simulations show that IQPNNI gives a slightly better accuracy than other programs tested. Moreover, we applied the approach to 218 small subunit rRNA sequences and 500 rbcL sequences. We found trees with higher likelihood compared to the results by others. A program to reconstruct DNA or amino acid based phylogenetic trees is available online (http://www.bi.uni-duesseldorf.de/software/iqpnni).

  9. Visual binary stars: data to investigate formation of binaries

    NASA Astrophysics Data System (ADS)

    Kovaleva,, D.; Malkov,, O.; Yungelson, L.; Chulkov, D.

    Statistics of orbital parameters of binary stars as well as statistics of their physical characteristics bear traces of star formation history. However, statistical investigations of binaries are complicated by incomplete or missing observational data and by a number of observational selection effects. Visual binaries are the most common type of observed binary stars, with the number of pairs exceeding 130 000. The most complete list of presently known visual binary stars was compiled by cross-matching objects and combining data of the three largest catalogues of visual binaries. This list was supplemented by the data on parallaxes, multicolor photometry, and spectral characteristics taken from other catalogues. This allowed us to compensate partly for the lack of observational data for these objects. The combined data allowed us to check the validity of observational values and to investigate statistics of the orbital and physical parameters of visual binaries. Corrections for incompleteness of observational data are discussed. The datasets obtained, together with modern distributions of binary parameters, will be used to reconstruct the initial distributions and parameters of the function of star formation for binary systems.

  10. A survey of decision tree classifier methodology

    NASA Technical Reports Server (NTRS)

    Safavian, S. Rasoul; Landgrebe, David

    1990-01-01

    Decision Tree Classifiers (DTC's) are used successfully in many diverse areas such as radar signal classification, character recognition, remote sensing, medical diagnosis, expert systems, and speech recognition. Perhaps, the most important feature of DTC's is their capability to break down a complex decision-making process into a collection of simpler decisions, thus providing a solution which is often easier to interpret. A survey of current methods is presented for DTC designs and the various existing issue. After considering potential advantages of DTC's over single stage classifiers, subjects of tree structure design, feature selection at each internal node, and decision and search strategies are discussed.

  11. A survey of decision tree classifier methodology

    NASA Technical Reports Server (NTRS)

    Safavian, S. R.; Landgrebe, David

    1991-01-01

    Decision tree classifiers (DTCs) are used successfully in many diverse areas such as radar signal classification, character recognition, remote sensing, medical diagnosis, expert systems, and speech recognition. Perhaps the most important feature of DTCs is their capability to break down a complex decision-making process into a collection of simpler decisions, thus providing a solution which is often easier to interpret. A survey of current methods is presented for DTC designs and the various existing issues. After considering potential advantages of DTCs over single-state classifiers, subjects of tree structure design, feature selection at each internal node, and decision and search strategies are discussed.

  12. Distributed Contour Trees

    SciTech Connect

    Morozov, Dmitriy; Weber, Gunther H.

    2014-03-31

    Topological techniques provide robust tools for data analysis. They are used, for example, for feature extraction, for data de-noising, and for comparison of data sets. This chapter concerns contour trees, a topological descriptor that records the connectivity of the isosurfaces of scalar functions. These trees are fundamental to analysis and visualization of physical phenomena modeled by real-valued measurements. We study the parallel analysis of contour trees. After describing a particular representation of a contour tree, called local{global representation, we illustrate how di erent problems that rely on contour trees can be solved in parallel with minimal communication.

  13. Planetary Formation and Dynamics in Binary Systems

    NASA Astrophysics Data System (ADS)

    Xie, J. W.

    2013-01-01

    As of today, over 500 exoplanets have been detected since the first exoplanet was discovered around a solar-like star in 1995. The planets in binaries could be common as stars are usually born in binary or multiple star systems. Although current observations show that the planet host rate in multiple star systems is around 17%, this fraction should be considered as a lower limit because of noticeable selection effects against binaries in planet searches. Most of the current known planet-bearing binary systems are S-types, meaning the companion star acts as a distant satellite, typically orbiting the inner star-planet system over 100 AU away. Nevertheless, there are four systems with a smaller separation of 20 AU, including the Gamma Cephei, GJ 86, HD 41004, and HD 196885. In addition to the planets in circumprimary (S-type) orbits discussed above, planets in circumbinary (P-type) orbits have been found in only two systems. In this thesis, we mainly study the planet formation in the S-type binary systems. In chapter 1, we first summarize current observational facts of exoplanets both in single-star and binary systems, then review the theoretical models of planet formation, with special attention to the application in binary systems. Perturbative effects from stellar companions render the planet formation process in binary systems even more complex than that in single-star systems. The perturbations from a binary companion can excite planetesimal orbits, and increase their mutual impact velocities to the values that might exceed their escape velocity or even the critical velocity for the onset of eroding collisions. The intermediate stage of the formation process---from planetesimals to planetary embryos---is thus the most problematic. In the following chapters, we investigate whether and how the planet formation goes through such a problematic stage. In chapter 2, we study the effects of gas dissipation on the planetesimals' mutual accretion. We find that in a

  14. Growth of a Pine Tree

    ERIC Educational Resources Information Center

    Rollinson, Susan Wells

    2012-01-01

    The growth of a pine tree is examined by preparing "tree cookies" (cross-sectional disks) between whorls of branches. The use of Christmas trees allows the tree cookies to be obtained with inexpensive, commonly available tools. Students use the tree cookies to investigate the annual growth of the tree and how it corresponds to the number of whorls…

  15. morePhyML: improving the phylogenetic tree space exploration with PhyML 3.

    PubMed

    Criscuolo, Alexis

    2011-12-01

    PhyML is a widely used Maximum Likelihood (ML) phylogenetic tree inference software based on a standard hill-climbing method. Starting from an initial tree, the version 3 of PhyML explores the tree space by using "Nearest Neighbor Interchange" (NNI) or "Subtree Pruning and Regrafting" (SPR) tree swapping techniques in order to find the ML phylogenetic tree. NNI-based local searches are fast but can often get trapped in local optima, whereas it is expected that the larger (but slower to cover) SPR-based neighborhoods will lead to trees with higher likelihood. Here, I verify that PhyML infers more likely trees with SPRs than with NNIs in almost all cases. However, I also show that the SPR-based local search of PhyML often does not succeed at locating the ML tree. To improve the tree space exploration, I deliver a script, named morePhyML, which allows escaping from local optima by performing character reweighting. This ML tree search strategy, named ratchet, often leads to higher likelihood estimates. Based on the analysis of a large number of amino acid and nucleotide data, I show that morePhyML allows inferring more accurate phylogenetic trees than several other recently developed ML tree inference softwares in many cases.

  16. Workshop on Colliding Winds in Binary Stars to Honor Jorge Sahade

    NASA Astrophysics Data System (ADS)

    Niemela, Virpi; Morrell, Nidia; Pismis, Paris; Torres-Peimbert, Silvia

    1996-12-01

    Topics considered include: the beginning of the story; mass flow in and out of close binaries; winds of massive, main sequence close binaries; chromospheric activity, stellar winds and red stragglers; uv observations of mass transfer in algols; the circumstellar matter in pre-supernovae of type Ia; observations of colliding winds in O-type binaries; colliding winds in massive binaries involving Wolf-Rayet stars; episodic dust formation by Wolf-Rayet stars: smoke signals from colliding winds; x-ray emission from colliding wind binaries; colliding stellar winds: a new method of determining mass-loss rates via x-ray spectroscopy; sudden radiative braking in colliding hot-star winds; optical observations of colliding winds in gamma2 velorum; left overs for dinner; HD 5980: the Wolf-Rayet binary that became a luminous blue variable; the erupting Wolf-Rayet binary HD 5980 in the small magellanic cloud: spectral transition from B1.5Ia(+) to WN6 and the accompanying light curve; the elliptic orbit of the WR binary system CV serpentis; evidence for colliding winds in WR 146; is there wind-wind collision in WR 141 (HD 193928)?; search for interacting winds in the WN7 + O binary; line formation in CH Cyg: a symbiotic binary; period analysis of radial velocity of pleione; H(alpha) detection of colliding winds in O-type binaries; HD 5980 in the infrared; photometric and polarimetric observations of the Wolf-Rayet eclipsing binary HD 5980 in the small magellanic cloud, and analysis of linear polarization in two Wolf-Rayet binary systems.

  17. Evolution of Close Binary Systems

    SciTech Connect

    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.

  18. Classification of Automated Search Traffic

    NASA Astrophysics Data System (ADS)

    Buehrer, Greg; Stokes, Jack W.; Chellapilla, Kumar; Platt, John C.

    As web search providers seek to improve both relevance and response times, they are challenged by the ever-increasing tax of automated search query traffic. Third party systems interact with search engines for a variety of reasons, such as monitoring a web site’s rank, augmenting online games, or possibly to maliciously alter click-through rates. In this paper, we investigate automated traffic (sometimes referred to as bot traffic) in the query stream of a large search engine provider. We define automated traffic as any search query not generated by a human in real time. We first provide examples of different categories of query logs generated by automated means. We then develop many different features that distinguish between queries generated by people searching for information, and those generated by automated processes. We categorize these features into two classes, either an interpretation of the physical model of human interactions, or as behavioral patterns of automated interactions. Using the these detection features, we next classify the query stream using multiple binary classifiers. In addition, a multiclass classifier is then developed to identify subclasses of both normal and automated traffic. An active learning algorithm is used to suggest which user sessions to label to improve the accuracy of the multiclass classifier, while also seeking to discover new classes of automated traffic. Performance analysis are then provided. Finally, the multiclass classifier is used to predict the subclass distribution for the search query stream.

  19. Origin of the computational hardness for learning with binary synapses

    NASA Astrophysics Data System (ADS)

    Huang, Haiping; Kabashima, Yoshiyuki

    2014-11-01

    Through supervised learning in a binary perceptron one is able to classify an extensive number of random patterns by a proper assignment of binary synaptic weights. However, to find such assignments in practice is quite a nontrivial task. The relation between the weight space structure and the algorithmic hardness has not yet been fully understood. To this end, we analytically derive the Franz-Parisi potential for the binary perceptron problem by starting from an equilibrium solution of weights and exploring the weight space structure around it. Our result reveals the geometrical organization of the weight space; the weight space is composed of isolated solutions, rather than clusters of exponentially many close-by solutions. The pointlike clusters far apart from each other in the weight space explain the previously observed glassy behavior of stochastic local search heuristics.

  20. W-IQ-TREE: a fast online phylogenetic tool for maximum likelihood analysis.

    PubMed

    Trifinopoulos, Jana; Nguyen, Lam-Tung; von Haeseler, Arndt; Minh, Bui Quang

    2016-07-08

    This article presents W-IQ-TREE, an intuitive and user-friendly web interface and server for IQ-TREE, an efficient phylogenetic software for maximum likelihood analysis. W-IQ-TREE supports multiple sequence types (DNA, protein, codon, binary and morphology) in common alignment formats and a wide range of evolutionary models including mixture and partition models. W-IQ-TREE performs fast model selection, partition scheme finding, efficient tree reconstruction, ultrafast bootstrapping, branch tests, and tree topology tests. All computations are conducted on a dedicated computer cluster and the users receive the results via URL or email. W-IQ-TREE is available at http://iqtree.cibiv.univie.ac.at It is free and open to all users and there is no login requirement.

  1. BINARY STORAGE ELEMENT

    DOEpatents

    Chu, J.C.

    1958-06-10

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

  2. P-adic conformal invariance and the Bruhat—Tits tree

    NASA Astrophysics Data System (ADS)

    Lerner, E. Yu.; Missarov, M. D.

    1991-06-01

    It is shown that some Gaussian and non-Gaussian scaling invariant p-adic field theories are invariant under the group of transformations which conserve the p-adic norm of the cross-ratio of any four points. This group can be treated as a p-adic conformal group. It has a continuation on the Bruhat—Tits tree, being an automorphism group of that tree. The models also have tree continuation, in particular the binary correlation function of the tree model is a spherical function.

  3. Horton Law in Self-Similar Trees

    NASA Astrophysics Data System (ADS)

    Kovchegov, Yevgeniy; Zaliapin, Ilya

    2016-04-01

    Self-similarity of random trees is related to the operation of pruning. Pruning ℛ cuts the leaves and their parental edges and removes the resulting chains of degree-two nodes from a finite tree. A Horton-Strahler order of a vertex v and its parental edge is defined as the minimal number of prunings necessary to eliminate the subtree rooted at v. A branch is a group of neighboring vertices and edges of the same order. The Horton numbers 𝒩k[K] and 𝒩ij[K] are defined as the expected number of branches of order k, and the expected number of order-i branches that merged order-j branches, j > i, respectively, in a finite tree of order K. The Tokunaga coefficients are defined as Tij[K] = 𝒩ij[K]/𝒩j[K]. The pruning decreases the orders of tree vertices by unity. A rooted full binary tree is said to be mean-self-similar if its Tokunaga coefficients are invariant with respect to pruning: Tk := Ti,i+k[K]. We show that for self-similar trees, the condition limsupk→∞Tk1/k < ∞ is necessary and sufficient for the existence of the strong Horton law: 𝒩k[K]/𝒩1[K] → R1-k, as K →∞ for some R > 0 and every k ≥ 1. This work is a step toward providing rigorous foundations for the Horton law that, being omnipresent in natural branching systems, has escaped so far a formal explanation.

  4. Consequences of Common Topological Rearrangements for Partition Trees in Phylogenomic Inference

    PubMed Central

    Minh, Bui Quang; von Haeseler, Arndt

    2015-01-01

    Abstract In phylogenomic analysis the collection of trees with identical score (maximum likelihood or parsimony score) may hamper tree search algorithms. Such collections are coined phylogenetic terraces. For sparse supermatrices with a lot of missing data, the number of terraces and the number of trees on the terraces can be very large. If terraces are not taken into account, a lot of computation time might be unnecessarily spent to evaluate many trees that in fact have identical score. To save computation time during the tree search, it is worthwhile to quickly identify such cases. The score of a species tree is the sum of scores for all the so-called induced partition trees. Therefore, if the topological rearrangement applied to a species tree does not change the induced partition trees, the score of these partition trees is unchanged. Here, we provide the conditions under which the three most widely used topological rearrangements (nearest neighbor interchange, subtree pruning and regrafting, and tree bisection and reconnection) change the topologies of induced partition trees. During the tree search, these conditions allow us to quickly identify whether we can save computation time on the evaluation of newly encountered trees. We also introduce the concept of partial terraces and demonstrate that they occur more frequently than the original “full” terrace. Hence, partial terrace is the more important factor of timesaving compared to full terrace. Therefore, taking into account the above conditions and the partial terrace concept will help to speed up the tree search in phylogenomic inference. PMID:26448206

  5. Soil cover by natural trees in agroforestry systems

    NASA Astrophysics Data System (ADS)

    Diaz-Ambrona, C. G. H.; Almoguera Millán, C.; Tarquis Alfonso, A.

    2009-04-01

    The dehesa is common agroforestry system in the Iberian Peninsula. These open oak parklands with silvo-pastoral use cover about two million hectares. Traditionally annual pastures have been grazed by cows, sheep and also goats while acorns feed Iberian pig diet. Evergreen oak (Quercus ilex L.) has other uses as fuelwood collection and folder after tree pruning. The hypothesis of this work is that tree density and canopy depend on soil types. We using the spanish GIS called SIGPAC to download the images of dehesa in areas with different soil types. True colour images were restoring to a binary code, previously canopy colour range was selected. Soil cover by tree canopy was calculated and number of trees. Processing result was comparable to real data. With these data we have applied a dynamic simulation model Dehesa to determine evergreen oak acorn and annual pasture production. The model Dehesa is divided into five submodels: Climate, Soil, Evergreen oak, Pasture and Grazing. The first three require the inputs: (i) daily weather data (maximum and minimum temperatures, precipitation and solar radiation); (ii) the soil input parameters for three horizons (thickness, field capacity, permanent wilting point, and bulk density); and (iii) the tree characterization of the dehesa (tree density, canopy diameter and height, and diameter of the trunk). The influence of tree on pasture potential production is inversely proportional to the canopy cover. Acorn production increase with tree canopy cover until stabilizing itself, and will decrease if density becomes too high (more than 80% soil tree cover) at that point there is competition between the trees. Main driving force for dehesa productivity is soil type for pasture, and tree cover for acorn production. Highest pasture productivity was obtained on soil Dystric Planosol (Alfisol), Dystric Cambisol and Chromo-calcic-luvisol, these soils only cover 22.4% of southwest of the Iberian peninssula. Lowest productivity was

  6. Upper limits for gravitational radiation from supermassive coalescing binaries

    NASA Technical Reports Server (NTRS)

    Anderson, J. D.; Armstrong, J. W.; Lau, E. L.

    1993-01-01

    We report a search for waves from supermassive coalescing binaries using a 10.5 day Pioneer 10 data set taken in 1988. Depending on the time to coalescence, the initial frequency of the wave, and the length of the observing interval, a coalescing binary waveform appears in the tracking record either as a sinusoid, a 'chirp', or as a more complicated signal. We searched our data for coalescing binary waveforms in all three regimes. We successfully detected a (fortuitous) 'chirp' signal caused by the varying spin rate of the spacecraft; this nicely served as a calibration of the data quality and as a test of our analysis procedures on real data. We did not detect any signals of astronomical origin in the millihertz band to an upper limit of about 7 x 10 exp -15 (rms amplitude). This is the first time spacecraft Doppler data have been analyzed for coalescing binary waveforms, and the upper limits reported here are the best to date for any waveform in the millihertz band.

  7. Motif Yggdrasil: sampling sequence motifs from a tree mixture model.

    PubMed

    Andersson, Samuel A; Lagergren, Jens

    2007-06-01

    In phylogenetic foot-printing, putative regulatory elements are found in upstream regions of orthologous genes by searching for common motifs. Motifs in different upstream sequences are subject to mutations along the edges of the corresponding phylogenetic tree, consequently taking advantage of the tree in the motif search is an appealing idea. We describe the Motif Yggdrasil sampler; the first Gibbs sampler based on a general tree that uses unaligned sequences. Previous tree-based Gibbs samplers have assumed a star-shaped tree or partially aligned upstream regions. We give a probabilistic model (MY model) describing upstream sequences with regulatory elements and build a Gibbs sampler with respect to this model. The model allows toggling, i.e., the restriction of a position to a subset of nucleotides, but does not require aligned sequences nor edge lengths, which may be difficult to come by. We apply the collapsing technique to eliminate the need to sample nuisance parameters, and give a derivation of the predictive update formula. We show that the MY model improves the modeling of difficult motif instances and that the use of the tree achieves a substantial increase in nucleotide level correlation coefficient both for synthetic data and 37 bacterial lexA genes. We investigate the sensitivity to errors in the tree and show that using random trees MY sampler still has a performance similar to the original version.

  8. Relativistic Binaries in Globular Clusters.

    PubMed

    Benacquista, Matthew J; Downing, Jonathan M B

    2013-01-01

    Galactic globular clusters are old, dense star systems typically containing 10(4)-10(6) stars. As an old population of stars, globular clusters contain many collapsed and degenerate objects. As a dense population of stars, globular clusters are the scene of many interesting close dynamical interactions between stars. These dynamical interactions can alter the evolution of individual stars and can produce tight binary systems containing one or two compact objects. In this review, we discuss theoretical models of globular cluster evolution and binary evolution, techniques for simulating this evolution that leads to relativistic binaries, and current and possible future observational evidence for this population. Our discussion of globular cluster evolution will focus on the processes that boost the production of tight binary systems and the subsequent interaction of these binaries that can alter the properties of both bodies and can lead to exotic objects. Direct N-body integrations and Fokker-Planck simulations of the evolution of globular clusters that incorporate tidal interactions and lead to predictions of relativistic binary populations are also discussed. We discuss the current observational evidence for cataclysmic variables, millisecond pulsars, and low-mass X-ray binaries as well as possible future detection of relativistic binaries with gravitational radiation.

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

  10. PSR 1820-11 : A binary gamma-ray pulsar

    NASA Astrophysics Data System (ADS)

    Li, Ti-pei; Wu, Mei

    1990-09-01

    Significant pulsation structure in phase distribution in the 50-6000MeV gamma-rays from the direction of the binary radio pulsar PSR 1820-11 in the COS-B data was obtained using the folding algorithm. Besides the period search, a spatial analysis was Bade and a clear point-like gamma-ray image was found at the pulsar's position.

  11. Colliding stellar winds in O-type close binary systems

    NASA Technical Reports Server (NTRS)

    Gies, Douglas R.

    1991-01-01

    A study of the stellar wind properties of O-type close binary systems is presented. The main objective of this program was to search for colliding winds in four systems, AO Cas, iota Ori, Plaskett's star, and 29 UW CMa, through an examination of high dispersion UV spectra from IUE and optical spectra of the H alpha and He I lambda 6678 emission lines.

  12. Optimized multilevel codebook searching algorithm for vector quantization in image coding

    NASA Astrophysics Data System (ADS)

    Cao, Hugh Q.; Li, Weiping

    1996-02-01

    An optimized multi-level codebook searching algorithm (MCS) for vector quantization is presented in this paper. Although it belongs to the category of the fast nearest neighbor searching (FNNS) algorithms for vector quantization, the MCS algorithm is not a variation of any existing FNNS algorithms (such as k-d tree searching algorithm, partial-distance searching algorithm, triangle inequality searching algorithm...). A multi-level search theory has been introduced. The problem for the implementation of this theory has been solved by a specially defined irregular tree structure which can be built from a training set. This irregular tree structure is different from any tree structures used in TSVQ, prune tree VQ, quad tree VQ... Strictly speaking, it cannot be called tree structure since it allows one node has more than one set of parents, it is only a directed graph. This is the essential difference between MCS algorithm and other TSVQ algorithms which ensures its better performance. An efficient design procedure has been given to find the optimized irregular tree for practical source. The simulation results of applying MCS algorithm to image VQ show that this algorithm can reduce searching complexity to less than 3% of the exhaustive search vector quantization (ESVQ) (4096 codevectors and 16 dimension) while introducing negligible error (0.064 dB degradation from ESVQ). Simulation results also show that the searching complexity is close linearly increase with bitrate.

  13. Resonant Transneptunian Binaries: Evidence for Slow Migration of Neptune

    NASA Technical Reports Server (NTRS)

    Noll, Keith S.; Grundy, W. M.; Schlichting, H. E.; Murray-Clay, R. A.; Benecchi, S. B.

    2012-01-01

    As Neptune migrated, its mean-motion resonances preceded it into the planetesimal disk. The efficiency of capture into mean motion resonances depends on the smoothness of Neptune's migration and the local population available to be captured. The two strongest resonances, the 3:2 at 39.4 AU and 2:1 at 47.7 AU, straddle the core repository of the physically distinct and binary-rich Cold Classicals, providing a unique opportunity to test the details of Neptune's migration. Smooth migration should result in a measurable difference between the 3:2 and 2:1 resonant object properties, with low inclination 2:1s having a high fraction of red binaries, mirroring that of the Cold Classicals while the 3:2 will would have fewer binaries. Rapid migration would generate a more homogeneous result. Resonant objects observed with HST show a higher rate of binaries in the 2:1 relative to the 3:2, significant at the 2cr level. This suggests slow Neptune migration over a large enough distance that the 2:1 swept through the Cold Classical region. Colors are available for only a fraction of these targets but a prevalence of red objects in outer Resonances has been reported. We report here on ongoing observations with HST in cycle 19 targeting all unobserved Resonants with observations that will measure color and search for binary companions using the WFC3.

  14. Eclipsing Binaries From the CSTAR Project at Dome A, Antarctica

    NASA Astrophysics Data System (ADS)

    Yang, Ming; Zhang, Hui; Wang, Songhu; Zhou, Ji-Lin; Zhou, Xu; Wang, Lingzhi; Wang, Lifan; Wittenmyer, R. A.; Liu, Hui-Gen; Meng, Zeyang; Ashley, M. C. B.; Storey, J. W. V.; Bayliss, D.; Tinney, Chris; Wang, Ying; Wu, Donghong; Liang, Ensi; Yu, Zhouyi; Fan, Zhou; Feng, Long-Long; Gong, Xuefei; Lawrence, J. S.; Liu, Qiang; Luong-Van, D. M.; Ma, Jun; Wu, Zhenyu; Yan, Jun; Yang, Huigen; Yang, Ji; Yuan, Xiangyan; Zhang, Tianmeng; Zhu, Zhenxi; Zou, Hu

    2015-04-01

    The Chinese Small Telescope ARray (CSTAR) has observed an area around the Celestial South Pole at Dome A since 2008. About 20,000 light curves in the i band were obtained during the observation season lasting from 2008 March to July. The photometric precision achieves about 4 mmag at i = 7.5 and 20 mmag at i = 12 within a 30 s exposure time. These light curves are analyzed using Lomb-Scargle, Phase Dispersion Minimization, and Box Least Squares methods to search for periodic signals. False positives may appear as a variable signature caused by contaminating stars and the observation mode of CSTAR. Therefore, the period and position of each variable candidate are checked to eliminate false positives. Eclipsing binaries are removed by visual inspection, frequency spectrum analysis, and a locally linear embedding technique. We identify 53 eclipsing binaries in the field of view of CSTAR, containing 24 detached binaries, 8 semi-detached binaries, 18 contact binaries, and 3 ellipsoidal variables. To derive the parameters of these binaries, we use the Eclipsing Binaries via Artificial Intelligence method. The primary and secondary eclipse timing variations (ETVs) for semi-detached and contact systems are analyzed. Correlated primary and secondary ETVs confirmed by false alarm tests may indicate an unseen perturbing companion. Through ETV analysis, we identify two triple systems (CSTAR J084612.64-883342.9 and CSTAR J220502.55-895206.7). The orbital parameters of the third body in CSTAR J220502.55-895206.7 are derived using a simple dynamical model.

  15. USING KUIPER BELT BINARIES TO CONSTRAIN NEPTUNE'S MIGRATION HISTORY

    SciTech Connect

    Murray-Clay, Ruth A.; Schlichting, Hilke E.

    2011-04-01

    Approximately 10%-20% of all Kuiper Belt objects (KBOs) occupy mean-motion resonances with Neptune. This dynamical configuration likely resulted from resonance capture as Neptune migrated outward during the late stages of planet formation. The details of Neptune's planetesimal-driven migration, including its radial extent and the concurrent eccentricity evolution of the planet, are the subject of considerable debate. Two qualitatively different proposals for resonance capture have been proposed-migration-induced capture driven by smooth outward evolution of Neptune's orbit and chaotic capture driven by damping of the planet's eccentricity near its current semi-major axis. We demonstrate that the distribution of comparable-mass, wide-separation binaries occupying resonant orbits can differentiate between these two scenarios. If migration-induced capture occurred, this fraction records information about the formation locations of different populations of KBOs. Chaotic capture, in contrast, randomizes the orbits of bodies as they are placed in resonance. In particular, if KBO binaries are formed by dynamical capture in a protoplanetary disk with a surface mass density typical of observed extrasolar disks, then migration-induced capture produces the following signatures. The 2:1 resonance should contain a dynamically cold component, with inclinations less than 5{sup 0}-10{sup 0}, having a binary fraction comparable to that among cold classical KBOs. If the 3:2 resonance also hosts a cold component, its binary fraction should be 20%-30% lower than in the cold classical belt. Among cold 2:1 (and if present 3:2) KBOs, objects with eccentricities e < 0.2 should have a binary fraction {approx}20% larger than those with e>0.2. Other binary formation scenarios and disk surface density profiles can generate analogous signatures but produce quantitatively different results. Searches for cold components in the binary fractions of resonant KBOs are currently practical. The

  16. Polytomy refinement for the correction of dubious duplications in gene trees

    PubMed Central

    Lafond, Manuel; El-Mabrouk, Nadia

    2014-01-01

    Motivation: Large-scale methods for inferring gene trees are error-prone. Correcting gene trees for weakly supported features often results in non-binary trees, i.e. trees with polytomies, thus raising the natural question of refining such polytomies into binary trees. A feature pointing toward potential errors in gene trees are duplications that are not supported by the presence of multiple gene copies. Results: We introduce the problem of refining polytomies in a gene tree while minimizing the number of created non-apparent duplications in the resulting tree. We show that this problem can be described as a graph-theoretical optimization problem. We provide a bounded heuristic with guaranteed optimality for well-characterized instances. We apply our algorithm to a set of ray-finned fish gene trees from the Ensembl database to illustrate its ability to correct dubious duplications. Availability and implementation: The C++ source code for the algorithms and simulations described in the article are available at http://www-ens.iro.umontreal.ca/~lafonman/software.php. Contact: lafonman@iro.umontreal.ca or mabrouk@iro.umontreal.ca Supplementary information: Supplementary data are available at Bioinformatics online. PMID:25161242

  17. Signature Visualization of Software Binaries

    SciTech Connect

    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.

  18. Power Search.

    ERIC Educational Resources Information Center

    Haskin, David

    1997-01-01

    Compares six leading Web search engines (AltaVista, Excite, HotBot, Infoseek, Lycos, and Northern Light), looking at the breadth of their coverage, accuracy, and ease of use, and finds a clear favorite of the six. Includes tips that can improve search results. (AEF)

  19. Research of Search Template Based on Distributed Computing

    NASA Astrophysics Data System (ADS)

    Xiao, Yao; Huang, Long-Jun; Zuo, Yi

    Aiming at the problem of requirement identification in the field of search engine, we proposed a scheme that makes use of nature language template. In the help of map-reduce analyze of the user searching log, high frequency template can be obtained. Besides, based on tire tree we designed a algorithm that can make the search engine distinguish user requirements using the template. In that case, the search engine can offer different service according to the user requirements.

  20. Periodic Emission from the Gamma-Ray Binary 1FGL J1018.6-5856

    NASA Technical Reports Server (NTRS)

    2012-01-01

    Gamma-ray binaries are stellar systems containing a neutron star or black hole, with gamma-ray emission produced by an interaction between the components. These systems are rare, even though binary evolution models predict dozens in our Galaxy, A search for gamma-ray binaries with the Fermi Large Area Telescope (LAT) shows that 1FGL ]1018.6-5856 exhibits intensity and spectral modulation with a 16.6 day period. We identified a variable x-ray counterpart, which shows a sharp maximum coinciding with maximum gamma-ray emission, as well as an O6V((f)) star optical counterpart and a radio counterpart that is also apparently modulated on the orbital period. 1FGL ]1018.6-5856 is thus a gamma-ray binary, and its detection suggests the presence of other fainter binaries in the Galaxy.

  1. Periodic Emission from the Gamma-ray Binary 1FGL J1018.6-5856

    NASA Technical Reports Server (NTRS)

    Celic, O.; Corbet, R. H. D.; Donato, D.; Ferrara, E. C.; Gehrels, N.; Harding, A. K.; Hays, E.; McEnery, J. E.; Thompson, D. J.; Troja, E.

    2012-01-01

    Gamma-ray binaries are stellar systems containing a neutron star or black hole with gamma-ray emission produced by an interaction between the components. These systems are rare, even though binary evolution models predict dozens in our Galaxy. A search for gamma-ray binaries with the Fermi Large Area Telescope (LAT) shows that IFGL JI018.6-5856 exhibits intensity and spectral modulation with a 16.6 day period. We identified a variable X-ray counterpart, which shows a sharp maximum coinciding with maximum gamma-ray emission, as well as an 06V f) star optical counterpart and a radio counterpart that is also apparently modulated on the orbital period. IFGL J1018.6-5856 is thus a gamma-ray binary, and its detection suggests the presence of other fainter binaries in the Galaxy.

  2. BINARY ASTROMETRIC MICROLENSING WITH GAIA

    SciTech Connect

    Sajadian, Sedighe

    2015-04-15

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

  3. Fragmentation of random trees

    NASA Astrophysics Data System (ADS)

    Kalay, Ziya; Ben-Naim, Eli

    2015-03-01

    We investigate the fragmentation of a random recursive tree by repeated removal of nodes, resulting in a forest of disjoint trees. The initial tree is generated by sequentially attaching new nodes to randomly chosen existing nodes until the tree contains N nodes. As nodes are removed, one at a time, the tree dissolves into an ensemble of separate trees, namely a forest. We study the statistical properties of trees and nodes in this heterogeneous forest. In the limit N --> ∞ , we find that the system is characterized by a single parameter: the fraction of remaining nodes m. We obtain analytically the size density ϕs of trees of size s, which has a power-law tail ϕs ~s-α , with exponent α = 1 + 1 / m . Therefore, the tail becomes steeper as further nodes are removed, producing an unusual scaling exponent that increases continuously with time. Furthermore, we investigate the fragment size distribution in a growing tree, where nodes are added as well as removed, and find that the distribution for this case is much narrower.

  4. arb_tree_32

    SciTech Connect

    Bavykin, Sergey; Alferov, Oleg

    2006-08-01

    The purpose of this program is to generate probes specific for the group of sequences that belong to a given phylogenetic node. For each node of the input tree, this program selects probes that are positive for all sequences that belong to this node and negative for all that doesn't. The program uses condensed tree for probe representation to save computer memory. As a result of calculation, the program prints lists for each node from the tree. Input file formats: FASTA for sequence database and ARB tree for phylogenetic organization of nodes. Output file format: text file.

  5. On the Binary Fraction of Globular Cluster NGC 5053: the Method

    NASA Astrophysics Data System (ADS)

    Ji, Jun; Bregman, J. N.

    2010-01-01

    Binaries are thought to be the primary energy source in globular clusters, since they can heat the environmental stars in globular clusters by converting their binding energy to kinetic energy of the encounter stars through dynamical interactions. Even a small primordial binary fraction is sufficient to prevent globular clusters from core collapse for many relaxation times. So binary fraction is an essential parameter which can dramatically affect the evolution of globular clusters. Here we present a detailed analyzing method on the binary fraction of globular cluster NGC 5053, with the HST archival ACS data in the F606W and F814W bands. The PSF-fitting photometry is used with the DOLPHOT ACS module to obtain a high quality color-magnitude diagram. An aperture photometry is also performed for comparison. We find that both the PSF-fitting and aperture photometry obtain similar quality CMDs, but PSF photometry tends to recover more stars towards the cluster core. We also formulate the blending effect (or star superposition) to be the Poisson probability distribution function, which is confirmed by our Monte-Carlo simulations for blending. A minimum binary fraction is obtained by counting stars that are beyond 3-sigma photometric errors on the blue side. A global binary fraction is also obtained by comparing the residual color distribution profile of the Main Sequence stars to the one that is constructed by artificial stars with a known binary fraction. Chi-square test is then used to search the best-fit binary fraction value. We obtain a minimum binary fraction of 6.6% for NGC 5053, which does not depend on any assumption of the binary mass ratio distribution, and a model-dependent binary fraction range of 7% to 12%. Finally, we select 242 binary candidates that are beyond 3-sigma photometric errors, which could be later confirmed by spectroscopic observations from the ground.

  6. Evolution of Small Binary Asteroids with the Binary YORP Effect

    NASA Astrophysics Data System (ADS)

    Frouard, Julien

    2013-05-01

    Abstract (2,250 Maximum Characters): Small, Near-Earth binaries are believed to be created following the fission of an asteroid spun up by the YORP effect. It is then believed that the YORP effect acting on the secondary (Binary YORP) increases or decreases the binary mutual distance on 10^5 yr timescales. How long this mechanism can apply is not yet fully understood. We investigate the binary orbital and rotational dynamics by using non-averaged, direct numerical simulations, taking into account the relative motion of two ellipsoids (primary and secondary) and the solar perturbation. We add the YORP force and torque on the orbital and rotational motion of the secondary. As a check of our code we obtain a ~ 7.2 cm/yr drift in semi-major axis for 1999 KW4 beta, consistent with the values obtained with former analytical studies. The synchronous rotation of the secondary is required for the Binary YORP to be effective. We investigate the synchronous lock of the secondary in function of different parameters ; mutual distance, shape of the secondary, and heliocentric orbit. For example we show that the secondary of 1999 KW4 can be synchronous only up to 7 Rp (primary radius), where the resonance becomes completely chaotic even for very small eccentricities. We use Gaussian Random Spheres to obtain various secondary shapes, and check the evolution of the binaries with the Binary YORP effect.

  7. Hunting for continuous gravitational waves from unknown neutron stars in binary systems in Advanced LIGO data

    NASA Astrophysics Data System (ADS)

    Goetz, Evan; LIGO Scientific Collaboration; Virgo Collaboration

    2017-01-01

    Non-axisymmetric, rapidly rotating neutron stars are predicted to emit quasi-monochromatic gravitational waves. Accretion from a companion star may drive asymmetries of the neutron star causing it to emit gravitational waves, perhaps even after accretion has subsided. Searching for unknown sources in binary systems is a significant computational challenge. In this talk, I will describe a search method, called TwoSpect, that has been developed to search for unknown sources in binary systems; show results from the TwoSpect search of initial LIGO/Virgo data; describe recent improvements to TwoSpect and other semi-coherent methods; and provide an outlook on TwoSpect searches in the advanced detector era.

  8. precession: Dynamics of spinning black-hole binaries with python

    NASA Astrophysics Data System (ADS)

    Gerosa, Davide; Kesden, Michael

    2016-06-01

    We present the numerical code precession, a new open-source python module to study the dynamics of precessing black-hole binaries in the post-Newtonian regime. The code provides a comprehensive toolbox to (i) study the evolution of the black-hole spins along their precession cycles, (ii) perform gravitational-wave-driven binary inspirals using both orbit-averaged and precession-averaged integrations, and (iii) predict the properties of the merger remnant through fitting formulas obtained from numerical-relativity simulations. precession is a ready-to-use tool to add the black-hole spin dynamics to larger-scale numerical studies such as gravitational-wave parameter estimation codes, population synthesis models to predict gravitational-wave event rates, galaxy merger trees and cosmological simulations of structure formation. precession provides fast and reliable integration methods to propagate statistical samples of black-hole binaries from/to large separations where they form to/from small separations where they become detectable, thus linking gravitational-wave observations of spinning black-hole binaries to their astrophysical formation history. The code is also a useful tool to compute initial parameters for numerical-relativity simulations targeting specific precessing systems. precession can be installed from the python Package Index, and it is freely distributed under version control on github, where further documentation is provided.

  9. MILLIONS OF MULTIPLES: DETECTING AND CHARACTERIZING CLOSE-SEPARATION BINARY SYSTEMS IN SYNOPTIC SKY SURVEYS

    SciTech Connect

    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.

  10. Millions of Multiples: Detecting and Characterizing Close-separation Binary Systems in Synoptic Sky Surveys

    NASA Astrophysics Data System (ADS)

    Terziev, Emil; Law, Nicholas M.; Arcavi, Iair; Baranec, Christoph; Bloom, Joshua S.; Bui, Khanh; Burse, Mahesh P.; Chorida, Pravin; Das, H. K.; Dekany, Richard G.; Kraus, Adam L.; Kulkarni, S. R.; Nugent, Peter; Ofek, Eran O.; Punnadi, Sujit; Ramaprakash, A. N.; Riddle, Reed; Sullivan, Mark; Tendulkar, Shriharsh P.

    2013-06-01

    The direct detection of binary systems in wide-field surveys is limited by the size of the stars' point-spread functions (PSFs). A search for elongated objects can find closer companions, but is limited by the precision to which the PSF shape can be calibrated for individual stars. Based on a technique from weak-lensing analysis, we have developed the BinaryFinder algorithm to search for close binaries by using precision measurements of PSF ellipticity across wide-field survey images. We show that the algorithm is capable of reliably detecting binary systems down to ≈1/5 of the seeing limit, and can directly measure the systems' position angles, separations, and contrast ratios. To verify the algorithm's performance we evaluated 100,000 objects in Palomar Transient Factory (PTF) wide-field-survey data for signs of binarity, and then used the Robo-AO robotic laser adaptive optics system to verify the parameters of 44 high-confidence targets. We show that BinaryFinder correctly predicts the presence of close companions with a <11% false-positive rate, measures the detected binaries' position angles within 1° to 4° (depending on signal-to-noise ratio and separation), and separations within 25%, and weakly constrains their contrast ratios. When applied to the full PTF data set, we estimate that BinaryFinder will discover and characterize ~450,000 physically associated binary systems with separations <2 arcsec and magnitudes brighter than mR = 18. New wide-field synoptic surveys with high sensitivity and sub-arcsecond angular resolution, such as LSST, will allow BinaryFinder to reliably detect millions of very faint binary systems with separations as small as 0.1 arcsec.

  11. Observational signatures of binary supermassive black holes

    SciTech Connect

    Roedig, Constanze; Krolik, Julian H.; Miller, M. Coleman

    2014-04-20

    Observations indicate that most massive galaxies contain a supermassive black hole, and theoretical studies suggest that when such galaxies have a major merger, the central black holes will form a binary and eventually coalesce. Here we discuss two spectral signatures of such binaries that may help distinguish them from ordinary active galactic nuclei. These signatures are expected when the mass ratio between the holes is not extreme and the system is fed by a circumbinary disk. One such signature is a notch in the thermal continuum that has been predicted by other authors; we point out that it should be accompanied by a spectral revival at shorter wavelengths and also discuss its dependence on binary properties such as mass, mass ratio, and separation. In particular, we note that the wavelength λ {sub n} at which the notch occurs depends on these three parameters in such a way as to make the number of systems displaying these notches ∝λ{sub n}{sup 16/3}; longer wavelength searches are therefore strongly favored. A second signature, first discussed here, is hard X-ray emission with a Wien-like spectrum at a characteristic temperature ∼100 keV produced by Compton cooling of the shock generated when streams from the circumbinary disk hit the accretion disks around the individual black holes. We investigate the observability of both signatures. The hard X-ray signal may be particularly valuable as it can provide an indicator of black hole merger a few decades in advance of the event.

  12. Quantifying Mosaic Development: Towards an Evo-Devo Postmodern Synthesis of the Evolution of Development via Differentiation Trees of Embryos

    PubMed Central

    Alicea, Bradly; Gordon, Richard

    2016-01-01

    Embryonic development proceeds through a series of differentiation events. The mosaic version of this process (binary cell divisions) can be analyzed by comparing early development of Ciona intestinalis and Caenorhabditis elegans. To do this, we reorganize lineage trees into differentiation trees using the graph theory ordering of relative cell volume. Lineage and differentiation trees provide us with means to classify each cell using binary codes. Extracting data characterizing lineage tree position, cell volume, and nucleus position for each cell during early embryogenesis, we conduct several statistical analyses, both within and between taxa. We compare both cell volume distributions and cell volume across developmental time within and between single species and assess differences between lineage tree and differentiation tree orderings. This enhances our understanding of the differentiation events in a model of pure mosaic embryogenesis and its relationship to evolutionary conservation. We also contribute several new techniques for assessing both differences between lineage trees and differentiation trees, and differences between differentiation trees of different species. The results suggest that at the level of differentiation trees, there are broad similarities between distantly related mosaic embryos that might be essential to understanding evolutionary change and phylogeny reconstruction. Differentiation trees may therefore provide a basis for an Evo-Devo Postmodern Synthesis. PMID:27548240

  13. Progresses of Search for Gravitational Wave Events Using TAMA300 Data

    NASA Astrophysics Data System (ADS)

    Kanda, N.; Ando, M.; Nakano, H.; Soida, K.; Tagoshi, H.; Takahashi, H.; Tatsumi, D.; Tsunesada, Y.; TAMA Collaboration

    2003-07-01

    We implemented and evaluated the Gravitational wave event search in TAMA 300 data analysis. Our searches are for the inspiral gravitational wave from coalescing compact binary, Black Hole (BH) quasi-normal ringing, supernova bursts, and continuous wave from SN1987a remnant. Using TAMA's over 2000 hours of observation data, we have progresses of the searches and improved the upper limits.

  14. X-RAY EMISSION FROM THE BINARY CENTRAL STARS OF THE PLANETARY NEBULAE HFG 1, DS 1, AND LOTR 5

    SciTech Connect

    Montez, Rodolfo; Kastner, Joel H.; De Marco, Orsola; Chu, You-Hua

    2010-10-01

    Close binary systems undergoing mass transfer or common envelope interactions can account for the morphological properties of some planetary nebulae. The search for close binary companions in planetary nebulae is hindered by the difficulty of detecting cool, late-type, main-sequence companions in binary systems with hot pre-white-dwarf primaries. However, models of binary planetary nebula progenitor systems predict that mass accretion or tidal interactions can induce rapid rotation in the companion, leading to X-ray-emitting coronae. To test such models, we have searched for, and detected, X-ray emission from three binary central stars within planetary nebulae: the post-common envelope close binaries in HFG 1 and DS 1 consisting of O-type subdwarfs with late-type, main-sequence companions and the binary system in LoTr 5 consisting of O-type subdwarf and rapidly rotating, late-type giant companion. The X-ray emission in each case is best characterized by spectral models consisting of two optically thin thermal plasma components with characteristic temperatures of {approx}10 MK and 15-40 MK and total X-ray luminosities {approx}10{sup 30} erg s{sup -1}. We consider the possible origin of the X-ray emission from these binary systems and conclude that the most likely origin is, in each case, a corona around the late-type companion, as predicted by models of interacting binaries.

  15. MICROLENSING BINARIES WITH CANDIDATE BROWN DWARF COMPANIONS

    SciTech Connect

    Shin, I.-G.; Han, C.; Gould, A.; Skowron, J.; Udalski, A.; Szymanski, M. K.; Kubiak, M.; Soszynski, I.; Pietrzynski, G.; Poleski, R.; Ulaczyk, K.; Pietrukowicz, P.; Kozlowski, S.; Wyrzykowski, L.; Sumi, T.; Dominik, M.; Beaulieu, J.-P.; Tsapras, Y.; Bozza, V.; Abe, F.; Collaboration: OGLE Collaboration; MOA Collaboration; muFUN Collaboration; and others

    2012-12-01

    Brown dwarfs are important objects because they may provide a missing link between stars and planets, two populations that have dramatically different formation histories. In this paper, we present the candidate binaries with brown dwarf companions that are found by analyzing binary microlensing events discovered during the 2004-2011 observation seasons. Based on the low mass ratio criterion of q < 0.2, we found seven candidate events: OGLE-2004-BLG-035, OGLE-2004-BLG-039, OGLE-2007-BLG-006, OGLE-2007-BLG-399/MOA-2007-BLG-334, MOA-2011-BLG-104/OGLE-2011-BLG-0172, MOA-2011-BLG-149, and MOA-201-BLG-278/OGLE-2011-BLG-012N. Among them, we are able to confirm that the companions of the lenses of MOA-2011-BLG-104/OGLE-2011-BLG-0172 and MOA-2011-BLG-149 are brown dwarfs by determining the mass of the lens based on the simultaneous measurement of the Einstein radius and the lens parallax. The measured masses of the brown dwarf companions are 0.02 {+-} 0.01 M {sub Sun} and 0.019 {+-} 0.002 M {sub Sun} for MOA-2011-BLG-104/OGLE-2011-BLG-0172 and MOA-2011-BLG-149, respectively, and both companions are orbiting low-mass M dwarf host stars. More microlensing brown dwarfs are expected to be detected as the number of lensing events with well-covered light curves increases with new-generation searches.

  16. Matter effects on binary neutron star waveforms

    NASA Astrophysics Data System (ADS)

    Read, Jocelyn S.; Baiotti, Luca; Creighton, Jolien D. E.; Friedman, John L.; Giacomazzo, Bruno; Kyutoku, Koutarou; Markakis, Charalampos; Rezzolla, Luciano; Shibata, Masaru; Taniguchi, Keisuke

    2013-08-01

    Using an extended set of equations of state and a multiple-group multiple-code collaborative effort to generate waveforms, we improve numerical-relativity-based data-analysis estimates of the measurability of matter effects in neutron-star binaries. We vary two parameters of a parametrized piecewise-polytropic equation of state (EOS) to analyze the measurability of EOS properties, via a parameter Λ that characterizes the quadrupole deformability of an isolated neutron star. We find that, to within the accuracy of the simulations, the departure of the waveform from point-particle (or spinless double black-hole binary) inspiral increases monotonically with Λ and changes in the EOS that did not change Λ are not measurable. We estimate with two methods the minimal and expected measurability of Λ in second- and third-generation gravitational-wave detectors. The first estimate using numerical waveforms alone shows that two EOSs which vary in radius by 1.3 km are distinguishable in mergers at 100 Mpc. The second estimate relies on the construction of hybrid waveforms by matching to post-Newtonian inspiral and estimates that the same EOSs are distinguishable in mergers at 300 Mpc. We calculate systematic errors arising from numerical uncertainties and hybrid construction, and we estimate the frequency at which such effects would interfere with template-based searches.

  17. BINARIES AMONG DEBRIS DISK STARS

    SciTech Connect

    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.

  18. Conjugating binary systems for spacecraft thermal control

    NASA Technical Reports Server (NTRS)

    Grodzka, Philomena G.; Dean, William G.; Sisk, Lori A.; Karu, Zain S.

    1989-01-01

    The materials search was directed to liquid pairs which can form hydrogen bonds of just the right strength, i.e., strong enough to give a high heat of mixing, but weak enough to enable phase change to occur. The cursory studies performed in the area of additive effects indicate that Conjugating Binary (CB) performance can probably be fine-tuned by this means. The Fluid Loop Test Systems (FLTS) tests of candidate CBs indicate that the systems Triethylamine (TEA)/water and propionaldehyde/water show close to the ideal, reversible behavior, at least initially. The Quick Screening Tests QSTs and FLTS tests, however, both suffer from rather severe static due either to inadequate stirring or temperature control. Thus it is not possible to adequately evaluate less than ideal CB performers. Less than ideal performers, it should be noted, may have features that make them better practical CBs than ideal performers. Improvement of the evaluation instrumentation is thus indicated.

  19. Inhibition of acetylcholinesterase by Tea Tree oil.

    PubMed

    Mills, Clive; Cleary, Brian J; Gilmer, John F; Walsh, John J

    2004-03-01

    Pediculosis is a widespread condition reported in schoolchildren. Treatment most commonly involves the physical removal of nits using fine-toothcombs and the chemical treatment of adult lice and eggs with topical preparations. The active constituents of these preparations frequently exert their effects through inhibition of acetylcholinesterase (AChE, EC 3.1.1.7). Increasing resistance to many preparations has led to the search for more effective treatments. Tea Tree oil, otherwise known as Melaleuca oil, has been added to several preparations as an alternative treatment of head lice infestations. In this study two major constituents of Tea Tree oil, 1,8-cineole and terpinen-4-ol, were shown to inhibit acetylcholinesterase at IC50 values (inhibitor concentrations required to give 50% inhibition) of 0.04 and 10.30 mM, respectively. Four samples of Tea Tree oil tested (Tisserand, Body Treats, Main Camp and Irish Health Culture Association Pure Undiluted) showed anticholinesterase activity at IC50 values of 0.05, 0.10, 0.08 and 0.11 microL mL(-1), respectively. The results supported the hypothesis that the insecticidal activity of Tea Tree oil was attributable, in part, to the anticholinesterase activity of Tea Tree oil.

  20. Fault trees and imperfect coverage

    NASA Technical Reports Server (NTRS)

    Dugan, Joanne B.

    1989-01-01

    A new algorithm is presented for solving the fault tree. The algorithm includes the dynamic behavior of the fault/error handling model but obviates the need for the Markov chain solution. As the state space is expanded in a breadth-first search (the same is done in the conversion to a Markov chain), the state's contribution to each future state is calculated exactly. A dynamic state truncation technique is also presented; it produces bounds on the unreliability of the system by considering only part of the state space. Since the model is solved as the state space is generated, the process can be stopped as soon as the desired accuracy is reached.

  1. Tree nut oils

    Technology Transfer Automated Retrieval System (TEKTRAN)

    The major tree nuts include almonds, Brazil nuts, cashew nuts, hazelnuts, macadamia nuts, pecans, pine nuts, pistachio nuts, and walnuts. Tree nut oils are appreciated in food applications because of their flavors and are generally more expensive than other gourmet oils. Research during the last de...

  2. Trees Are Terrific!

    ERIC Educational Resources Information Center

    Braus, Judy, Ed.

    1992-01-01

    Ranger Rick's NatureScope is a creative education series dedicated to inspiring in children an understanding and appreciation of the natural world while developing the skills they will need to make responsible decisions about the environment. Contents are organized into the following sections: (1) "What Makes a Tree a Tree?," including…

  3. CSI for Trees

    ERIC Educational Resources Information Center

    Rubino, Darrin L.; Hanson, Deborah

    2009-01-01

    The circles and patterns in a tree's stem tell a story, but that story can be a mystery. Interpreting the story of tree rings provides a way to heighten the natural curiosity of students and help them gain insight into the interaction of elements in the environment. It also represents a wonderful opportunity to incorporate the nature of science.…

  4. The Flame Tree

    ERIC Educational Resources Information Center

    Lewis, Richard

    2004-01-01

    Lewis's own experiences living in Indonesia are fertile ground for telling "a ripping good story," one found in "The Flame Tree." He hopes people will enjoy the tale and appreciate the differences of an unfamiliar culture. The excerpt from "The Flame Tree" will reel readers in quickly.

  5. Fragmentation of random trees

    NASA Astrophysics Data System (ADS)

    Kalay, Z.; Ben-Naim, E.

    2015-01-01

    We study fragmentation of a random recursive tree into a forest by repeated removal of nodes. The initial tree consists of N nodes and it is generated by sequential addition of nodes with each new node attaching to a randomly-selected existing node. As nodes are removed from the tree, one at a time, the tree dissolves into an ensemble of separate trees, namely, a forest. We study statistical properties of trees and nodes in this heterogeneous forest, and find that the fraction of remaining nodes m characterizes the system in the limit N\\to ∞ . We obtain analytically the size density {{φ }s} of trees of size s. The size density has power-law tail {{φ }s}˜ {{s}-α } with exponent α =1+\\frac{1}{m}. Therefore, the tail becomes steeper as further nodes are removed, and the fragmentation process is unusual in that exponent α increases continuously with time. We also extend our analysis to the case where nodes are added as well as removed, and obtain the asymptotic size density for growing trees.

  6. Trees for Mother Earth.

    ERIC Educational Resources Information Center

    Greer, Sandy

    1993-01-01

    Describes Trees for Mother Earth, a program in which secondary students raise funds to buy fruit trees to plant during visits to the Navajo Reservation. Benefits include developing feelings of self-worth among participants, promoting cultural exchange and understanding, and encouraging self-sufficiency among the Navajo. (LP)

  7. Reclamation: what about trees

    SciTech Connect

    Kolar, C.A.; Ashby, W.C.

    1982-07-01

    A five-year research programme was started in 1978 in the Botany Department of Southern Illinois University to evaluate the effect of reclamation practices on tree survival and growth. The project was initiated as a direct result of reports from Illinois and Indiana of tree-planting failures on mined lands reclaimed to current regulation standards.

  8. Structural Equation Model Trees

    ERIC Educational Resources Information Center

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

    2013-01-01

    In the behavioral and social sciences, structural equation models (SEMs) have become widely accepted as a modeling tool for the relation between latent and observed variables. SEMs can be seen as a unification of several multivariate analysis techniques. SEM Trees combine the strengths of SEMs and the decision tree paradigm by building tree…

  9. Trees in Our Lives.

    ERIC Educational Resources Information Center

    NatureScope, 1986

    1986-01-01

    Provides: (1) background information on how trees have influenced human history and how trees affect people today; (2) four activities dealing with these topics; and (3) a ready-to-copy page related to paper and plastics. Activities include an objective, recommended age level(s), subject area(s), list of materials needed, and procedures. (JN)

  10. Dependency Tree Annotation Software

    DTIC Science & Technology

    2015-11-01

    Features 5 Distribution List 12 iv List of Figures Fig. 1 Manually created dependency tree for the sentence, “The little cat ate the pie...with a dependency relation label. Fig. 1 Manually created dependency tree for the sentence, “The little cat ate the pie” The user can easily

  11. Efficient Gene Tree Correction Guided by Genome Evolution

    PubMed Central

    Lafond, Manuel; Seguin, Jonathan; Boussau, Bastien; Guéguen, Laurent; El-Mabrouk, Nadia; Tannier, Eric

    2016-01-01

    Motivations Gene trees inferred solely from multiple alignments of homologous sequences often contain weakly supported and uncertain branches. Information for their full resolution may lie in the dependency between gene families and their genomic context. Integrative methods, using species tree information in addition to sequence information, often rely on a computationally intensive tree space search which forecloses an application to large genomic databases. Results We propose a new method, called ProfileNJ, that takes a gene tree with statistical supports on its branches, and corrects its weakly supported parts by using a combination of information from a species tree and a distance matrix. Its low running time enabled us to use it on the whole Ensembl Compara database, for which we propose an alternative, arguably more plausible set of gene trees. This allowed us to perform a genome-wide analysis of duplication and loss patterns on the history of 63 eukaryote species, and predict ancestral gene content and order for all ancestors along the phylogeny. Availability A web interface called RefineTree, including ProfileNJ as well as a other gene tree correction methods, which we also test on the Ensembl gene families, is available at: http://www-ens.iro.umontreal.ca/~adbit/polytomysolver.html. The code of ProfileNJ as well as the set of gene trees corrected by ProfileNJ from Ensembl Compara version 73 families are also made available. PMID:27513924

  12. Modified evolution of stellar binaries from supermassive black hole binaries

    NASA Astrophysics Data System (ADS)

    Liu, Bin; Wang, Yi-Han; Yuan, Ye-Fei

    2017-04-01

    The evolution of main-sequence binaries resided in the galactic centre is influenced a lot by the central supermassive black hole (SMBH). Due to this perturbation, the stars in a dense environment are likely to experience mergers or collisions through secular or non-secular interactions. In this work, we study the dynamics of the stellar binaries at galactic centre, perturbed by another distant SMBH. Geometrically, such a four-body system is supposed to be decomposed into the inner triple (SMBH-star-star) and the outer triple (SMBH-stellar binary-SMBH). We survey the parameter space and determine the criteria analytically for the stellar mergers and the tidal disruption events (TDEs). For a relative distant and equal masses SMBH binary, the stars have more opportunities to merge as a result from the Lidov-Kozai (LK) oscillations in the inner triple. With a sample of tight stellar binaries, our numerical experiments reveal that a significant fraction of the binaries, ∼70 per cent, experience merger eventually. Whereas the majority of the stellar TDEs are likely to occur at a close periapses to the SMBH, induced by the outer Kozai effect. The tidal disruptions are found numerically as many as ∼10 per cent for a close SMBH binary that is enhanced significantly than the one without the external SMBH. These effects require the outer perturber to have an inclined orbit (≥40°) relatively to the inner orbital plane and may lead to a burst of the extremely astronomical events associated with the detection of the SMBH binary.

  13. Rooting the eukaryote tree by using a derived gene fusion.

    PubMed

    Stechmann, Alexandra; Cavalier-Smith, Thomas

    2002-07-05

    Single-gene trees have failed to locate the root of the eukaryote tree because of systematic biases in sequence evolution. Structural genetic data should yield more reliable insights into deep phylogenetic relationships. We searched major protist groups for the presence or absence of a gene fusion in order to locate the root of the eukaryote tree. In striking contrast to previous molecular studies, we show that all eukaryote groups ancestrally with two cilia (bikonts) are evolutionarily derived. The root lies between bikonts and opisthokonts (animals, Fungi, Choanozoa). Amoebozoa either diverged even earlier or are sister of bikonts or (less likely) opisthokonts.

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

  15. Project Learning Tree (Corporate Propaganda Tree).

    ERIC Educational Resources Information Center

    Mayer, Mike

    This document contains a critical analysis of Project Learning Tree (PLT). PLT was developed and distributed in the mid-1970s. It consists of 2 activity guides, one for grades K-6 with 89 activities and another for grades 7-12 with 88 activities. The program also provides free workshops for teachers and others. The analysis of PLT includes the…

  16. Design quadrilateral apertures in binary computer-generated holograms of large space bandwidth product.

    PubMed

    Wang, Jing; Sheng, Yunlong

    2016-09-20

    A new approach for designing the binary computer-generated hologram (CGH) of a very large number of pixels is proposed. Diffraction of the CGH apertures is computed by the analytical Abbe transform and by considering the aperture edges as the basic diffracting elements. The computation cost is independent of the CGH size. The arbitrary-shaped polygonal apertures in the CGH consist of quadrilateral apertures, which are designed by assigning the binary phases using the parallel genetic algorithm with a local search, followed by optimizing the locations of the co-vertices with a direct search. The design results in high performance with low image reconstruction error.

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

  18. Binary star database: binaries discovered in non-optical bands

    NASA Astrophysics Data System (ADS)

    Malkov, Oleg Yu.; Tessema, Solomon B.; Kniazev, Alexei Yu.

    The Binary star Database (BDB) is the world's principal database of binary and multiple systems of all observational types. In particular, it should contain data on binaries discovered in non-optical bands, X-ray binaries (XRBs) and radio pulsars in binaries. The goal of the present study was to compile complete lists of such objects. Due to the lack of a unified identification system for XRBs, we had to select them from five principal catalogues of X-ray sources. After cross-identification and positional cross-matching, a general catalogue of 373 XRBs was constructed for the first time. It contains coordinates, indication of photometric and spectroscopic binarity, and extensive cross-identification. In the preparation of the catalogue, a number of XRB classification disagreements were resolved, some catalogued identifiers and coordinates were corrected, and duplicated entries in the original catalogues were found. We have also compiled a general list of 239 radio pulsars in binary systems. The list is supplied with indication of photometric, spectroscopic or X-ray binarity, and with cross-identification data.

  19. Binary black hole spectroscopy

    NASA Astrophysics Data System (ADS)

    Van Den Broeck, Chris; Sengupta, Anand S.

    2007-03-01

    We study parameter estimation with post-Newtonian (PN) gravitational waveforms for the quasi-circular, adiabatic inspiral of spinning binary compact objects. In particular, the performance of amplitude-corrected waveforms is compared with that of the more commonly used restricted waveforms, in Advanced LIGO and EGO. With restricted waveforms, the properties of the source can only be extracted from the phasing. In the case of amplitude-corrected waveforms, the spectrum encodes a wealth of additional information, which leads to dramatic improvements in parameter estimation. At distances of ~100 Mpc, the full PN waveforms allow for high-accuracy parameter extraction for total mass up to several hundred solar masses, while with the restricted ones the errors are steep functions of mass, and accurate parameter estimation is only possible for relatively light stellar mass binaries. At the low-mass end, the inclusion of amplitude corrections reduces the error on the time of coalescence by an order of magnitude in Advanced LIGO and a factor of 5 in EGO compared to the restricted waveforms; at higher masses these differences are much larger. The individual component masses, which are very poorly determined with restricted waveforms, become measurable with high accuracy if amplitude-corrected waveforms are used, with errors as low as a few per cent in Advanced LIGO and a few tenths of a per cent in EGO. The usual spin orbit parameter β is also poorly determined with restricted waveforms (except for low-mass systems in EGO), but the full waveforms give errors that are small compared to the largest possible value consistent with the Kerr bound. This suggests a way of finding out if one or both of the component objects violate this bound. On the other hand, we find that the spin spin parameter σ remains poorly determined even when the full waveform is used. Generally, all errors have but a weak dependence on the magnitudes and orientations of the spins. We also briefly

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

    PubMed

    Merkle, Edgar C; Shaffer, Victoria A

    2011-02-01

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

  1. Separation in 5 Msun Binaries

    NASA Astrophysics Data System (ADS)

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

    2013-01-01

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

  2. CHAOTIC ZONES AROUND GRAVITATING BINARIES

    SciTech Connect

    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.

  3. Cryptography with DNA binary strands.

    PubMed

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

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

  5. Searching with the Google Search Appliance (GSA)

    EPA Pesticide Factsheets

    Guidance and search help resource listing examples of common queries that can be used in the Google Search Appliance search request, including examples of special characters, or query term seperators that Google Search Appliance recognizes.

  6. The Prevalence of Tree Nut Allergy: A Systematic Review.

    PubMed

    McWilliam, Vicki; Koplin, Jennifer; Lodge, Caroline; Tang, Mimi; Dharmage, Shyamali; Allen, Katrina

    2015-09-01

    Tree nuts are one of the most common foods causing acute allergic reactions and nearly all tree nuts have been associated with fatal allergic reactions. Despite their clinical importance, tree nut allergy epidemiology remains understudied and the prevalence of tree nut allergy in different regions of the world has not yet been well characterised. We aimed to systematically review the population prevalence of tree nut allergy in children and adults. We searched three electronic databases (OVID MEDLINE, EMBASE and PubMed) from January 1996 to December 2014. Eligible studies were categorised by age, region and method of assessment of tree nut allergy. Of the 36 studies identified most were in children (n = 24) and from Europe (n = 18), UK (n = 8) or USA (n = 5). Challenge-confirmed IgE-mediated tree nut allergy prevalence was less than 2 % (although only seven studies used this gold standard) while probable tree nut allergy prevalence ranged from 0.05 to 4.9 %. Prevalence estimates that included oral allergy syndrome (OAS) reactions to tree nut were significantly higher (8-11.4 %) and were predominantly from Europe. Prevalence of individual tree nut allergies varied significantly by region with hazelnut the most common tree nut allergy in Europe, walnut and cashew in the USA and Brazil nut, almond and walnut most commonly reported in the UK. Monitoring time trends of tree nut allergy prevalence (both overall and by individual nuts) as well as the prevalence of OAS should be considered given the context of the overall recent rise in IgE-mediated food allergy prevalence in the developed world.

  7. Gravitational Wave Detection of Compact Binaries Through Multivariate Analysis

    NASA Astrophysics Data System (ADS)

    Atallah, Dany Victor; Dorrington, Iain; Sutton, Patrick

    2017-01-01

    The first detection of gravitational waves (GW), GW150914, as produced by a binary black hole merger, has ushered in the era of GW astronomy. The detection technique used to find GW150914 considered only a fraction of the information available describing the candidate event: mainly the detector signal to noise ratios and chi-squared values. In hopes of greatly increasing detection rates, we want to take advantage of all the information available about candidate events. We employ a technique called Multivariate Analysis (MVA) to improve LIGO sensitivity to GW signals. MVA techniques are efficient ways to scan high dimensional data spaces for signal/noise classification. Our goal is to use MVA to classify compact-object binary coalescence (CBC) events composed of any combination of black holes and neutron stars. CBC waveforms are modeled through numerical relativity. Templates of the modeled waveforms are used to search for CBCs and quantify candidate events. Different MVA pipelines are under investigation to look for CBC signals and un-modelled signals, with promising results. One such MVA pipeline used for the un-modelled search can theoretically analyze far more data than the MVA pipelines currently explored for CBCs, potentially making a more powerful classifier. In principle, this extra information could improve the sensitivity to GW signals. We will present the results from our efforts to adapt an MVA pipeline used in the un-modelled search to classify candidate events from the CBC search.

  8. Phylogenetic trees in bioinformatics

    SciTech Connect

    Burr, Tom L

    2008-01-01

    Genetic data is often used to infer evolutionary relationships among a collection of viruses, bacteria, animal or plant species, or other operational taxonomic units (OTU). A phylogenetic tree depicts such relationships and provides a visual representation of the estimated branching order of the OTUs. Tree estimation is unique for several reasons, including: the types of data used to represent each OTU; the use ofprobabilistic nucleotide substitution models; the inference goals involving both tree topology and branch length, and the huge number of possible trees for a given sample of a very modest number of OTUs, which implies that fmding the best tree(s) to describe the genetic data for each OTU is computationally demanding. Bioinformatics is too large a field to review here. We focus on that aspect of bioinformatics that includes study of similarities in genetic data from multiple OTUs. Although research questions are diverse, a common underlying challenge is to estimate the evolutionary history of the OTUs. Therefore, this paper reviews the role of phylogenetic tree estimation in bioinformatics, available methods and software, and identifies areas for additional research and development.

  9. Lazy decision trees

    SciTech Connect

    Friedman, J.H.; Yun, Yeogirl; Kohavi, R.

    1996-12-31

    Lazy learning algorithms, exemplified by nearest-neighbor algorithms, do not induce a concise hypothesis from a given training set; the inductive process is delayed until a test instance is given. Algorithms for constructing decision trees, such as C4.5, ID3, and CART create a single {open_quotes}best{close_quotes} decision tree during the training phase, and this tree is then used to classify test instances. The tests at the nodes of the constructed tree are good on average, but there may be better tests for classifying a specific instance. We propose a lazy decision tree algorithm-LazyDT-that conceptually constructs the {open_quotes}best{close_quote} decision tree for each test instance. In practice, only a path needs to be constructed, and a caching scheme makes the algorithm fast. The algorithm is robust with respect to missing values without resorting to the complicated methods usually seen in induction of decision trees. Experiments on real and artificial problems are presented.

  10. Symmetrical Hierarchical Stochastic Searching on the Line in Informative and Deceptive Environments.

    PubMed

    Zhang, Junqi; Wang, Yuheng; Wang, Cheng; Zhou, MengChu

    2016-03-08

    A stochastic point location (SPL) problem aims to find a target parameter on a 1-D line by operating a controlled random walk and receiving information from a stochastic environment (SE). If the target parameter changes randomly, we call the parameter dynamic; otherwise static. SE can be 1) informative (p > 0.5 where p represents the probability for an environment providing a correct suggestion) and 2) deceptive (p < 0.5). Up till now, hierarchical stochastic searching on the line (HSSL) is the most efficient algorithms to catch static or dynamic parameter in an informative environment, but unable to locate the target parameter in a deceptive environment and to recognize an environment's type (informative or deceptive). This paper presents a novel solution, named symmetrical HSSL, by extending an HSSL binary tree-based search structure to a symmetrical form. By means of this innovative way, the proposed learning mechanism is able to converge to a static or dynamic target parameter in the range of not only 0.618¹ < p < 1, but also 0 < p < 0.382. Finally, the experimental results show that our scheme is efficient and feasible to solve the SPL problem in any SE.

  11. Learning classification trees

    NASA Technical Reports Server (NTRS)

    Buntine, Wray

    1991-01-01

    Algorithms for learning classification trees have had successes in artificial intelligence and statistics over many years. How a tree learning algorithm can be derived from Bayesian decision theory is outlined. This introduces Bayesian techniques for splitting, smoothing, and tree averaging. The splitting rule turns out to be similar to Quinlan's information gain splitting rule, while smoothing and averaging replace pruning. Comparative experiments with reimplementations of a minimum encoding approach, Quinlan's C4 and Breiman et al. Cart show the full Bayesian algorithm is consistently as good, or more accurate than these other approaches though at a computational price.

  12. The gravity apple tree

    NASA Astrophysics Data System (ADS)

    Espinosa Aldama, Mariana

    2015-04-01

    The gravity apple tree is a genealogical tree of the gravitation theories developed during the past century. The graphic representation is full of information such as guides in heuristic principles, names of main proponents, dates and references for original articles (See under Supplementary Data for the graphic representation). This visual presentation and its particular classification allows a quick synthetic view for a plurality of theories, many of them well validated in the Solar System domain. Its diachronic structure organizes information in a shape of a tree following similarities through a formal concept analysis. It can be used for educational purposes or as a tool for philosophical discussion.

  13. Tree-structured supervised learning and the genetics of hypertension.

    PubMed

    Huang, Jing; Lin, Alfred; Narasimhan, Balasubramanian; Quertermous, Thomas; Hsiung, C Agnes; Ho, Low-Tone; Grove, John S; Olivier, Michael; Ranade, Koustubh; Risch, Neil J; Olshen, Richard A

    2004-07-20

    This paper is about an algorithm, FlexTree, for general supervised learning. It extends the binary tree-structured approach (Classification and Regression Trees, CART) although it differs greatly in its selection and combination of predictors. It is particularly applicable to assessing interactions: gene by gene and gene by environment as they bear on complex disease. One model for predisposition to complex disease involves many genes. Of them, most are pure noise; each of the values that is not the prevalent genotype for the minority of genes that contribute to the signal carries a "score." Scores add. Individuals with scores above an unknown threshold are predisposed to the disease. For the additive score problem and simulated data, FlexTree has cross-validated risk better than many cutting-edge technologies to which it was compared when small fractions of candidate genes carry the signal. For the model where only a precise list of aberrant genotypes is predisposing, there is not a systematic pattern of absolute superiority; however, overall, FlexTree seems better than the other technologies. We tried the algorithm on data from 563 Chinese women, 206 hypotensive, 357 hypertensive, with information on ethnicity, menopausal status, insulin-resistant status, and 21 loci. FlexTree and Logic Regression appear better than the others in terms of Bayes risk. However, the differences are not significant in the usual statistical sense.

  14. Trees of trees: an approach to comparing multiple alternative phylogenies.

    PubMed

    Nye, Tom M W

    2008-10-01

    Phylogenetic analysis very commonly produces several alternative trees for a given fixed set of taxa. For example, different sets of orthologous genes may be analyzed, or the analysis may sample from a distribution of probable trees. This article describes an approach to comparing and visualizing multiple alternative phylogenies via the idea of a "tree of trees" or "meta-tree." A meta-tree clusters phylogenies with similar topologies together in the same way that a phylogeny clusters species with similar DNA sequences. Leaf nodes on a meta-tree correspond to the original set of phylogenies given by some analysis, whereas interior nodes correspond to certain consensus topologies. The construction of meta-trees is motivated by analogy with construction of a most parsimonious tree for DNA data, but instead of using DNA letters, in a meta-tree the characters are partitions or splits of the set of taxa. An efficient algorithm for meta-tree construction is described that makes use of a known relationship between the majority consensus and parsimony in terms of gain and loss of splits. To illustrate these ideas meta-trees are constructed for two datasets: a set of gene trees for species of yeast and trees from a bootstrap analysis of a set of gene trees in ray-finned fish. A software tool for constructing meta-trees and comparing alternative phylogenies is available online, and the source code can be obtained from the author.

  15. Tree-bank grammars

    SciTech Connect

    Charniak, E.

    1996-12-31

    By a {open_quotes}tree-bank grammar{close_quotes} we mean a context-free grammar created by reading the production rules directly from hand-parsed sentences in a tree bank. Common wisdom has it that such grammars do not perform well, though we know of no published data on the issue. The primary purpose of this paper is to show that the common wisdom is wrong. In particular, we present results on a tree-bank grammar based on the Penn Wall Street Journal tree bank. To the best of our knowledge, this grammar outperforms all other non-word-based statistical parsers/grammars on this corpus. That is, it outperforms parsers that consider the input as a string of tags and ignore the actual words of the corpus.

  16. Leonardo's Tree Theory.

    ERIC Educational Resources Information Center

    Werner, Suzanne K.

    2003-01-01

    Describes a series of activities exploring Leonardo da Vinci's tree theory that are designed to strengthen 8th grade students' data collection and problem solving skills in physical science classes. (KHR)

  17. Tea tree oil.

    PubMed

    Larson, David; Jacob, Sharon E

    2012-01-01

    Tea tree oil is an increasingly popular ingredient in a variety of household and cosmetic products, including shampoos, massage oils, skin and nail creams, and laundry detergents. Known for its potential antiseptic properties, it has been shown to be active against a variety of bacteria, fungi, viruses, and mites. The oil is extracted from the leaves of the tea tree via steam distillation. This essential oil possesses a sharp camphoraceous odor followed by a menthol-like cooling sensation. Most commonly an ingredient in topical products, it is used at a concentration of 5% to 10%. Even at this concentration, it has been reported to induce contact sensitization and allergic contact dermatitis reactions. In 1999, tea tree oil was added to the North American Contact Dermatitis Group screening panel. The latest prevalence rates suggest that 1.4% of patients referred for patch testing had a positive reaction to tea tree oil.

  18. Generalized constructive tree weights

    SciTech Connect

    Rivasseau, Vincent E-mail: adrian.tanasa@ens-lyon.org; Tanasa, Adrian E-mail: adrian.tanasa@ens-lyon.org

    2014-04-15

    The Loop Vertex Expansion (LVE) is a quantum field theory (QFT) method which explicitly computes the Borel sum of Feynman perturbation series. This LVE relies in a crucial way on symmetric tree weights which define a measure on the set of spanning trees of any connected graph. In this paper we generalize this method by defining new tree weights. They depend on the choice of a partition of a set of vertices of the graph, and when the partition is non-trivial, they are no longer symmetric under permutation of vertices. Nevertheless we prove they have the required positivity property to lead to a convergent LVE; in fact we formulate this positivity property precisely for the first time. Our generalized tree weights are inspired by the Brydges-Battle-Federbush work on cluster expansions and could be particularly suited to the computation of connected functions in QFT. Several concrete examples are explicitly given.

  19. Incorporating opponent models into adversary search

    SciTech Connect

    Carmel, D.; Markovitch, S.

    1996-12-31

    This work presents a generalized theoretical framework that allows incorporation of opponent models into adversary search. We present the M* algorithm, a generalization of minimax that uses an arbitrary opponent model to simulate the opponent`s search. The opponent model is a recursive structure consisting of the opponent`s evaluation function and its model of the player. We demonstrate experimentally the potential benefit of using an opponent model. Pruning in M* is impossible in the general case. We prove a sufficient condition for pruning and present the {alpha}{beta}* algorithm which returns the M* value of a tree while searching only necessary branches.

  20. Detecting Eccentric Supermassive Black Hole Binaries with Pulsar Timing Arrays: Resolvable Source Strategies

    NASA Astrophysics Data System (ADS)

    Taylor, S. R.; Huerta, E. A.; Gair, J. R.; McWilliams, S. T.

    2016-01-01

    The couplings between supermassive black hole binaries (SMBHBs) and their environments within galactic nuclei have been well studied as part of the search for solutions to the final parsec problem. The scattering of stars by the binary or the interaction with a circumbinary disk may efficiently drive the system to sub-parsec separations, allowing the binary to enter a regime where the emission of gravitational waves can drive it to merger within a Hubble time. However, these interactions can also affect the orbital parameters of the binary. In particular, they may drive an increase in binary eccentricity which survives until the system’s gravitational-wave (GW) signal enters the pulsar-timing array (PTA) band. Therefore, if we can measure the eccentricity from observed signals, we can potentially deduce some of the properties of the binary environment. To this end, we build on previous techniques to present a general Bayesian pipeline with which we can detect and estimate the parameters of an eccentric SMBHB system with PTAs. Additionally, we generalize the PTA {{ F }}{{e}}-statistic to eccentric systems, and show that both this statistic and the Bayesian pipeline are robust when studying circular or arbitrarily eccentric systems. We explore how eccentricity influences the detection prospects of single GW sources, as well as the detection penalty incurred by employing a circular waveform template to search for eccentric signals, and conclude by identifying important avenues for future study.

  1. Binary Black Hole Mergers in the First Advanced LIGO Observing Run

    NASA Astrophysics Data System (ADS)

    Abbott, B. P.; Abbott, R.; Abbott, T. D.; Abernathy, M. R.; Acernese, F.; Ackley, K.; Adams, C.; Adams, T.; Addesso, P.; Adhikari, R. X.; Adya, V. B.; Affeldt, C.; Agathos, M.; Agatsuma, K.; Aggarwal, N.; Aguiar, O. D.; Aiello, L.; Ain, A.; Ajith, P.; Allen, B.; Allocca, A.; Altin, P. A.; Anderson, S. B.; Anderson, W. G.; Arai, K.; Araya, M. C.; Arceneaux, C. C.; Areeda, J. S.; Arnaud, N.; Arun, K. G.; Ascenzi, S.; Ashton, G.; Ast, M.; Aston, S. M.; Astone, P.; Aufmuth, P.; Aulbert, C.; Babak, S.; Bacon, P.; Bader, M. K. M.; Baker, P. T.; Baldaccini, F.; Ballardin, G.; Ballmer, S. W.; Barayoga, J. C.; Barclay, S. E.; Barish, B. C.; Barker, D.; Barone, F.; Barr, B.; Barsotti, L.; Barsuglia, M.; Barta, D.; Bartlett, J.; Bartos, I.; Bassiri, R.; Basti, A.; Batch, J. C.; Baune, C.; Bavigadda, V.; Bazzan, M.; Bejger, M.; Bell, A. S.; Berger, B. K.; Bergmann, G.; Berry, C. P. L.; Bersanetti, D.; Bertolini, A.; Betzwieser, J.; Bhagwat, S.; Bhandare, R.; Bilenko, I. A.; Billingsley, G.; Birch, J.; Birney, R.; Birnholtz, O.; Biscans, S.; Bisht, A.; Bitossi, M.; Biwer, C.; Bizouard, M. A.; Blackburn, J. K.; Blair, C. D.; Blair, D. G.; Blair, R. M.; Bloemen, S.; Bock, O.; Boer, M.; Bogaert, G.; Bogan, C.; Bohe, A.; Bond, C.; Bondu, F.; Bonnand, R.; Boom, B. A.; Bork, R.; Boschi, V.; Bose, S.; Bouffanais, Y.; Bozzi, A.; Bradaschia, C.; Brady, P. R.; Braginsky, V. B.; Branchesi, M.; Brau, J. E.; Briant, T.; Brillet, A.; Brinkmann, M.; Brisson, V.; Brockill, P.; Broida, J. E.; Brooks, A. F.; Brown, D. A.; Brown, D. D.; Brown, N. M.; Brunett, S.; Buchanan, C. C.; Buikema, A.; Bulik, T.; Bulten, H. J.; Buonanno, A.; Buskulic, D.; Buy, C.; Byer, R. L.; Cabero, M.; Cadonati, L.; Cagnoli, G.; Cahillane, C.; Calderón Bustillo, J.; Callister, T.; Calloni, E.; Camp, J. B.; Cannon, K. C.; Cao, J.; Capano, C. D.; Capocasa, E.; Carbognani, F.; Caride, S.; Casanueva Diaz, J.; Casentini, C.; Caudill, S.; Cavaglià, M.; Cavalier, F.; Cavalieri, R.; Cella, G.; Cepeda, C. B.; Cerboni Baiardi, L.; Cerretani, G.; Cesarini, E.; Chamberlin, S. J.; Chan, M.; Chao, S.; Charlton, P.; Chassande-Mottin, E.; Cheeseboro, B. D.; Chen, H. Y.; Chen, Y.; Cheng, C.; Chincarini, A.; Chiummo, A.; Cho, H. S.; Cho, M.; Chow, J. H.; Christensen, N.; Chu, Q.; Chua, S.; Chung, S.; Ciani, G.; Clara, F.; Clark, J. A.; Cleva, F.; Coccia, E.; Cohadon, P.-F.; Colla, A.; Collette, C. G.; Cominsky, L.; Constancio, M.; Conte, A.; Conti, L.; Cook, D.; Corbitt, T. R.; Cornish, N.; Corsi, A.; Cortese, S.; Costa, C. A.; Coughlin, M. W.; Coughlin, S. B.; Coulon, J.-P.; Countryman, S. T.; Couvares, P.; Cowan, E. E.; Coward, D. M.; Cowart, M. J.; Coyne, D. C.; Coyne, R.; Craig, K.; Creighton, J. D. E.; Cripe, J.; Crowder, S. G.; Cumming, A.; Cunningham, L.; Cuoco, E.; Dal Canton, T.; Danilishin, S. L.; D'Antonio, S.; Danzmann, K.; Darman, N. S.; Dasgupta, A.; Da Silva Costa, C. F.; Dattilo, V.; Dave, I.; Davier, M.; Davies, G. S.; Daw, E. J.; Day, R.; De, S.; DeBra, D.; Debreczeni, G.; Degallaix, J.; De Laurentis, M.; Deléglise, S.; Del Pozzo, W.; Denker, T.; Dent, T.; Dergachev, V.; De Rosa, R.; DeRosa, R. T.; DeSalvo, R.; Devine, R. C.; Dhurandhar, S.; Díaz, M. C.; Di Fiore, L.; Di Giovanni, M.; Di Girolamo, T.; Di Lieto, A.; Di Pace, S.; Di Palma, I.; Di Virgilio, A.; Dolique, V.; Donovan, F.; Dooley, K. L.; Doravari, S.; Douglas, R.; Downes, T. P.; Drago, M.; Drever, R. W. P.; Driggers, J. C.; Ducrot, M.; Dwyer, S. E.; Edo, T. B.; Edwards, M. C.; Effler, A.; Eggenstein, H.-B.; Ehrens, P.; Eichholz, J.; Eikenberry, S. S.; Engels, W.; Essick, R. C.; Etzel, T.; Evans, M.; Evans, T. M.; Everett, R.; Factourovich, M.; Fafone, V.; Fair, H.; Fairhurst, S.; Fan, X.; Fang, Q.; Farinon, S.; Farr, B.; Farr, W. M.; Favata, M.; Fays, M.; Fehrmann, H.; Fejer, M. M.; Fenyvesi, E.; Ferrante, I.; Ferreira, E. C.; Ferrini, F.; Fidecaro, F.; Fiori, I.; Fiorucci, D.; Fisher, R. P.; Flaminio, R.; Fletcher, M.; Fong, H.; Fournier, J.-D.; Frasca, S.; Frasconi, F.; Frei, Z.; Freise, A.; Frey, R.; Frey, V.; Fritschel, P.; Frolov, V. V.; Fulda, P.; Fyffe, M.; Gabbard, H. A. G.; Gaebel, S.; Gair, J. R.; Gammaitoni, L.; Gaonkar, S. G.; Garufi, F.; Gaur, G.; Gehrels, N.; Gemme, G.; Geng, P.; Genin, E.; Gennai, A.; George, J.; Gergely, L.; Germain, V.; Ghosh, Abhirup; Ghosh, Archisman; Ghosh, S.; Giaime, J. A.; Giardina, K. D.; Giazotto, A.; Gill, K.; Glaefke, A.; Goetz, E.; Goetz, R.; Gondan, L.; González, G.; Gonzalez Castro, J. M.; Gopakumar, A.; Gordon, N. A.; Gorodetsky, M. L.; Gossan, S. E.; Gosselin, M.; Gouaty, R.; Grado, A.; Graef, C.; Graff, P. B.; Granata, M.; Grant, A.; Gras, S.; Gray, C.; Greco, G.; Green, A. C.; Groot, P.; Grote, H.; Grunewald, S.; Guidi, G. M.; Guo, X.; Gupta, A.; Gupta, M. K.; Gushwa, K. E.; Gustafson, E. K.; Gustafson, R.; Hacker, J. J.; Hall, B. R.; Hall, E. D.; Hamilton, H.; Hammond, G.; Haney, M.; Hanke, M. M.; Hanks, J.; Hanna, C.; Hannam, M. D.; Hanson, J.; Hardwick, T.; Harms, J.; Harry, G. M.; Harry, I. W.; Hart, M. J.; Hartman, M. T.; Haster, C.-J.; Haughian, K.; Healy, J.; Heidmann, A.; Heintze, M. C.; Heitmann, H.; Hello, P.; Hemming, G.; Hendry, M.; Heng, I. S.; Hennig, J.; Henry, J.; Heptonstall, A. W.; Heurs, M.; Hild, S.; Hoak, D.; Hofman, D.; Holt, K.; Holz, D. E.; Hopkins, P.; Hough, J.; Houston, E. A.; Howell, E. J.; Hu, Y. M.; Huang, S.; Huerta, E. A.; Huet, D.; Hughey, B.; Husa, S.; Huttner, S. H.; Huynh-Dinh, T.; Indik, N.; Ingram, D. R.; Inta, R.; Isa, H. N.; Isac, J.-M.; Isi, M.; Isogai, T.; Iyer, B. R.; Izumi, K.; Jacqmin, T.; Jang, H.; Jani, K.; Jaranowski, P.; Jawahar, S.; Jian, L.; Jiménez-Forteza, F.; Johnson, W. W.; Johnson-McDaniel, N. K.; Jones, D. I.; Jones, R.; Jonker, R. J. G.; Ju, L.; K, Haris; Kalaghatgi, C. V.; Kalogera, V.; Kandhasamy, S.; Kang, G.; Kanner, J. B.; Kapadia, S. J.; Karki, S.; Karvinen, K. S.; Kasprzack, M.; Katsavounidis, E.; Katzman, W.; Kaufer, S.; Kaur, T.; Kawabe, K.; Kéfélian, F.; Kehl, M. S.; Keitel, D.; Kelley, D. B.; Kells, W.; Kennedy, R.; Key, J. S.; Khalili, F. Y.; Khan, I.; Khan, S.; Khan, Z.; Khazanov, E. A.; Kijbunchoo, N.; Kim, Chi-Woong; Kim, Chunglee; Kim, J.; Kim, K.; Kim, N.; Kim, W.; Kim, Y.-M.; Kimbrell, S. J.; King, E. J.; King, P. J.; Kissel, J. S.; Klein, B.; Kleybolte, L.; Klimenko, S.; Koehlenbeck, S. M.; Koley, S.; Kondrashov, V.; Kontos, A.; Korobko, M.; Korth, W. Z.; Kowalska, I.; Kozak, D. B.; Kringel, V.; Krishnan, B.; Królak, A.; Krueger, C.; Kuehn, G.; Kumar, P.; Kumar, R.; Kuo, L.; Kutynia, A.; Lackey, B. D.; Landry, M.; Lange, J.; Lantz, B.; Lasky, P. D.; Laxen, M.; Lazzarini, A.; Lazzaro, C.; Leaci, P.; Leavey, S.; Lebigot, E. O.; Lee, C. H.; Lee, H. K.; Lee, H. M.; Lee, K.; Lenon, A.; Leonardi, M.; Leong, J. R.; Leroy, N.; Letendre, N.; Levin, Y.; Lewis, J. B.; Li, T. G. F.; Libson, A.; Littenberg, T. B.; Lockerbie, N. A.; Lombardi, A. L.; London, L. T.; Lord, J. E.; Lorenzini, M.; Loriette, V.; Lormand, M.; Losurdo, G.; Lough, J. D.; Lousto, C.; Lück, H.; Lundgren, A. P.; Lynch, R.; Ma, Y.; Machenschalk, B.; MacInnis, M.; Macleod, D. M.; Magaña-Sandoval, F.; Magaña Zertuche, L.; Magee, R. M.; Majorana, E.; Maksimovic, I.; Malvezzi, V.; Man, N.; Mandel, I.; Mandic, V.; Mangano, V.; Mansell, G. L.; Manske, M.; Mantovani, M.; Marchesoni, F.; Marion, F.; Márka, S.; Márka, Z.; Markosyan, A. S.; Maros, E.; Martelli, F.; Martellini, L.; Martin, I. W.; Martynov, D. V.; Marx, J. N.; Mason, K.; Masserot, A.; Massinger, T. J.; Masso-Reid, M.; Mastrogiovanni, S.; Matichard, F.; Matone, L.; Mavalvala, N.; Mazumder, N.; McCarthy, R.; McClelland, D. E.; McCormick, S.; McGuire, S. C.; McIntyre, G.; McIver, J.; McManus, D. J.; McRae, T.; McWilliams, S. T.; Meacher, D.; Meadors, G. D.; Meidam, J.; Melatos, A.; Mendell, G.; Mercer, R. A.; Merilh, E. L.; Merzougui, M.; Meshkov, S.; Messenger, C.; Messick, C.; Metzdorff, R.; Meyers, P. M.; Mezzani, F.; Miao, H.; Michel, C.; Middleton, H.; Mikhailov, E. E.; Milano, L.; Miller, A. L.; Miller, A.; Miller, B. B.; Miller, J.; Millhouse, M.; Minenkov, Y.; Ming, J.; Mirshekari, S.; Mishra, C.; Mitra, S.; Mitrofanov, V. P.; Mitselmakher, G.; Mittleman, R.; Moggi, A.; Mohan, M.; Mohapatra, S. R. P.; Montani, M.; Moore, B. C.; Moore, C. J.; Moraru, D.; Moreno, G.; Morriss, S. R.; Mossavi, K.; Mours, B.; Mow-Lowry, C. M.; Mueller, G.; Muir, A. W.; Mukherjee, Arunava; Mukherjee, D.; Mukherjee, S.; Mukund, N.; Mullavey, A.; Munch, J.; Murphy, D. J.; Murray, P. G.; Mytidis, A.; Nardecchia, I.; Naticchioni, L.; Nayak, R. K.; Nedkova, K.; Nelemans, G.; Nelson, T. J. N.; Neri, M.; Neunzert, A.; Newton, G.; Nguyen, T. T.; Nielsen, A. B.; Nissanke, S.; Nitz, A.; Nocera, F.; Nolting, D.; Normandin, M. E. N.; Nuttall, L. K.; Oberling, J.; Ochsner, E.; O'Dell, J.; Oelker, E.; Ogin, G. H.; Oh, J. J.; Oh, S. H.; Ohme, F.; Oliver, M.; Oppermann, P.; Oram, Richard J.; O'Reilly, B.; O'Shaughnessy, R.; Ottaway, D. J.; Overmier, H.; Owen, B. J.; Pai, A.; Pai, S. A.; Palamos, J. R.; Palashov, O.; Palomba, C.; Pal-Singh, A.; Pan, H.; Pan, Y.; Pankow, C.; Pannarale, F.; Pant, B. C.; Paoletti, F.; Paoli, A.; Papa, M. A.; Paris, H. R.; Parker, W.; Pascucci, D.; Pasqualetti, A.; Passaquieti, R.; Passuello, D.; Patricelli, B.; Patrick, Z.; Pearlstone, B. L.; Pedraza, M.; Pedurand, R.; Pekowsky, L.; Pele, A.; Penn, S.; Perreca, A.; Perri, L. M.; Pfeiffer, H. P.; Phelps, M.; Piccinni, O. J.; Pichot, M.; Piergiovanni, F.; Pierro, V.; Pillant, G.; Pinard, L.; Pinto, I. M.; Pitkin, M.; Poe, M.; Poggiani, R.; Popolizio, P.; Porter, E.; Post, A.; Powell, J.; Prasad, J.; Predoi, V.; Prestegard, T.; Price, L. R.; Prijatelj, M.; Principe, M.; Privitera, S.; Prix, R.; Prodi, G. A.; Prokhorov, L.; Puncken, O.; Punturo, M.; Puppo, P.; Pürrer, M.; Qi, H.; Qin, J.; Qiu, S.; Quetschke, V.; Quintero, E. A.; Quitzow-James, R.; Raab, F. J.; Rabeling, D. S.; Radkins, H.; Raffai, P.; Raja, S.; Rajan, C.; Rakhmanov, M.; Rapagnani, P.; Raymond, V.; Razzano, M.; Re, V.; Read, J.; Reed, C. M.; Regimbau, T.; Rei, L.; Reid, S.; Reitze, D. H.; Rew, H.; Reyes, S. D.; Ricci, F.; Riles, K.; Rizzo, M.; Robertson, N. A.; Robie, R.; Robinet, F.; Rocchi, A.; Rolland, L.; Rollins, J. G.; Roma, V. J.; Romano, J. D.; Romano, R.; Romanov, G.; Romie, J. H.; Rosińska, D.; Rowan, S.; Rüdiger, A.; Ruggi, P.; Ryan, K.; Sachdev, S.; Sadecki, T.; Sadeghian, L.; Sakellariadou, M.; Salconi, L.; Saleem, M.; Salemi, F.; Samajdar, A.; Sammut, L.; Sanchez, E. J.; Sandberg, V.; Sandeen, B.; Sanders, J. R.; Sassolas, B.; Sathyaprakash, B. S.; Saulson, P. R.; Sauter, O. E. S.; Savage, R. L.; Sawadsky, A.; Schale, P.; Schilling, R.; Schmidt, J.; Schmidt, P.; Schnabel, R.; Schofield, R. M. S.; Schönbeck, A.; Schreiber, E.; Schuette, D.; Schutz, B. F.; Scott, J.; Scott, S. M.; Sellers, D.; Sengupta, A. S.; Sentenac, D.; Sequino, V.; Sergeev, A.; Setyawati, Y.; Shaddock, D. A.; Shaffer, T.; Shahriar, M. S.; Shaltev, M.; Shapiro, B.; Shawhan, P.; Sheperd, A.; Shoemaker, D. H.; Shoemaker, D. M.; Siellez, K.; Siemens, X.; Sieniawska, M.; Sigg, D.; Silva, A. D.; Singer, A.; Singer, L. P.; Singh, A.; Singh, R.; Singhal, A.; Sintes, A. M.; Slagmolen, B. J. J.; Smith, J. R.; Smith, N. D.; Smith, R. J. E.; Son, E. J.; Sorazu, B.; Sorrentino, F.; Souradeep, T.; Srivastava, A. K.; Staley, A.; Steinke, M.; Steinlechner, J.; Steinlechner, S.; Steinmeyer, D.; Stephens, B. C.; Stevenson, S.; Stone, R.; Strain, K. A.; Straniero, N.; Stratta, G.; Strauss, N. A.; Strigin, S.; Sturani, R.; Stuver, A. L.; Summerscales, T. Z.; Sun, L.; Sunil, S.; Sutton, P. J.; Swinkels, B. L.; Szczepańczyk, M. J.; Tacca, M.; Talukder, D.; Tanner, D. B.; Tápai, M.; Tarabrin, S. P.; Taracchini, A.; Taylor, R.; Theeg, T.; Thirugnanasambandam, M. P.; Thomas, E. G.; Thomas, M.; Thomas, P.; Thorne, K. A.; Thrane, E.; Tiwari, S.; Tiwari, V.; Tokmakov, K. V.; Toland, K.; Tomlinson, C.; Tonelli, M.; Tornasi, Z.; Torres, C. V.; Torrie, C. I.; Töyrä, D.; Travasso, F.; Traylor, G.; Trifirò, D.; Tringali, M. C.; Trozzo, L.; Tse, M.; Turconi, M.; Tuyenbayev, D.; Ugolini, D.; Unnikrishnan, C. S.; Urban, A. L.; Usman, S. A.; Vahlbruch, H.; Vajente, G.; Valdes, G.; Vallisneri, M.; van Bakel, N.; van Beuzekom, M.; van den Brand, J. F. J.; Van Den Broeck, C.; Vander-Hyde, D. C.; van der Schaaf, L.; van Heijningen, J. V.; van Veggel, A. A.; Vardaro, M.; Vass, S.; Vasúth, M.; Vaulin, R.; Vecchio, A.; Vedovato, G.; Veitch, J.; Veitch, P. J.; Venkateswara, K.; Verkindt, D.; Vetrano, F.; Viceré, A.; Vinciguerra, S.; Vine, D. J.; Vinet, J.-Y.; Vitale, S.; Vo, T.; Vocca, H.; Vorvick, C.; Voss, D. V.; Vousden, W. D.; Vyatchanin, S. P.; Wade, A. R.; Wade, L. E.; Wade, M.; Walker, M.; Wallace, L.; Walsh, S.; Wang, G.; Wang, H.; Wang, M.; Wang, X.; Wang, Y.; Ward, R. L.; Warner, J.; Was, M.; Weaver, B.; Wei, L.-W.; Weinert, M.; Weinstein, A. J.; Weiss, R.; Wen, L.; Weßels, P.; Westphal, T.; Wette, K.; Whelan, J. T.; Whitcomb, S. E.; Whiting, B. F.; Williams, R. D.; Williamson, A. R.; Willis, J. L.; Willke, B.; Wimmer, M. H.; Winkler, W.; Wipf, C. C.; Wittel, H.; Woan, G.; Woehler, J.; Worden, J.; Wright, J. L.; Wu, D. S.; Wu, G.; Yablon, J.; Yam, W.; Yamamoto, H.; Yancey, C. C.; Yu, H.; Yvert, M.; ZadroŻny, A.; Zangrando, L.; Zanolin, M.; Zendri, J.-P.; Zevin, M.; Zhang, L.; Zhang, M.; Zhang, Y.; Zhao, C.; Zhou, M.; Zhou, Z.; Zhu, X. J.; Zucker, M. E.; Zuraw, S. E.; Zweizig, J.; LIGO Scientific Collaboration; Virgo Collaboration

    2016-10-01

    The first observational run of the Advanced LIGO detectors, from September 12, 2015 to January 19, 2016, saw the first detections of gravitational waves from binary black hole mergers. In this paper, we present full results from a search for binary black hole merger signals with total masses up to 100 M⊙ and detailed implications from our observations of these systems. Our search, based on general-relativistic models of gravitational-wave signals from binary black hole systems, unambiguously identified two signals, GW150914 and GW151226, with a significance of greater than 5 σ over the observing period. It also identified a third possible signal, LVT151012, with substantially lower significance and with an 87% probability of being of astrophysical origin. We provide detailed estimates of the parameters of the observed systems. Both GW150914 and GW151226 provide an unprecedented opportunity to study the two-body motion of a compact-object binary in the large velocity, highly nonlinear regime. We do not observe any deviations from general relativity, and we place improved empirical bounds on several high-order post-Newtonian coefficients. From our observations, we infer stellar-mass binary black hole merger rates lying in the range 9 - 240 Gpc-3 yr-1 . These observations are beginning to inform astrophysical predictions of binary black hole formation rates and indicate that future observing runs of the Advanced detector network will yield many more gravitational-wave detections.

  2. Search for Kilonovae in Dark Energy Survey Supernova Fields

    NASA Astrophysics Data System (ADS)

    Doctor, Zoheyr; DES-GW Team; DES-SN Team

    2016-03-01

    The Dark Energy Camera on the Blanco 4-m Telescope is an ideal instrument for identifying rapid optical transients with its large field of view and four optical filters. We utilize two seasons of data from the Dark Energy Survey to search for kilonovae, an optical counterpart to gravitational waves from binary neutron star mergers. Kilonova lightcurves from Barnes and Kasen inform our analysis for removing background signals such as supernovae. We simulate DES observations of kilonovae with the SNANA software package to estimate our search efficiency and optimize cuts. Finally, we report rate limits for binary neutron star mergers and compare to existing rate estimates.

  3. Analysis of the Discourse of Power in Etel Adnan's Play "Like a Christmas Tree"

    ERIC Educational Resources Information Center

    Alashqar, Hossam Mahmoud

    2015-01-01

    This paper seeks to investigate the sources of power in the discourse of an Arab-American writer, Etel Adnan's one act play, "Like a Christmas Tree." The play represents a heated argument between two figures who stand for two different ideologies and who fall within the frame of "binary opposition," transcultural…

  4. Detecting compact galactic binaries using a hybrid swarm-based algorithm

    NASA Astrophysics Data System (ADS)

    Bouffanais, Yann; Porter, Edward K.

    2016-03-01

    Compact binaries in our galaxy are expected to be one of the main sources of gravitational waves for the future eLISA mission. During the mission lifetime, many thousands of galactic binaries should be individually resolved. However, the identification of the sources and the extraction of the signal parameters in a noisy environment are real challenges for data analysis. So far, stochastic searches have proven to be the most successful for this problem. In this work, we present the first application of a swarm-based algorithm combining Particle Swarm Optimization and Differential Evolution. These algorithms have been shown to converge faster to global solutions on complicated likelihood surfaces than other stochastic methods. We first demonstrate the effectiveness of the algorithm for the case of a single binary in a 1-mHz search bandwidth. This interesting problem gave the algorithm plenty of opportunity to fail, as it can be easier to find a strong noise peak rather than the signal itself. After a successful detection of a fictitious low-frequency source, as well as the verification binary RXJ 0806.3 +1527 , we then applied the algorithm to the detection of multiple binaries, over different search bandwidths, in the cases of low and mild source confusion. In all cases, we show that we can successfully identify the sources and recover the true parameters within a 99% credible interval.

  5. Precision Narrow-Angle Astrometry of Binary Stars with the Navy Prototype Optical Interferometer

    DTIC Science & Technology

    2004-01-01

    precision into accuracy. Keywords: Optical interferometry, interferometric imaging, NPOI, binary stars, extrasolar planets 1. MOTIVATION As Michelson realized...interferometry, are equivalent to using ≈ 0.5(d/r0)2 baselines, where d is the telescope diameter and r0 is the Fried parameter. Extrasolar planet searches of...Dubarry Ave., Lanham, MD 20706, USA; ABSTRACT The Navy Prototype Optical Interferometry (NPOI) group has started an astrometric search for planets in

  6. Anatomy of the Pythagoras' Tree

    ERIC Educational Resources Information Center

    Teia, Luis

    2016-01-01

    The architecture of nature can be seen at play in a tree: no two are alike. The Pythagoras' tree behaves just as a "tree" in that the root plus the same movement repeated over and over again grows from a seed, to a plant, to a tree. In human life, this movement is termed cell division. With triples, this movement is a geometrical and…

  7. How Trees Can Save Energy.

    ERIC Educational Resources Information Center

    Fazio, James R., Ed.

    1991-01-01

    This document might easily have been called "How To Use Trees To Save Energy". It presents the energy saving advantages of landscaping the home and community with trees. The discussion includes: (1) landscaping advice to obtain the benefits of tree shade; (2) the heat island phenomenon in cities; (3) how and where to properly plant trees for…

  8. State Trees and Arbor Days.

    ERIC Educational Resources Information Center

    Forest Service (USDA), Washington, DC.

    Provides information on state trees for each of the 50 states and the District of Columbia. Includes for each state: (1) year in which state tree was chosen; (2) common and scientific names of the tree; (3) arbor day observance; (4) address of state forester; and (5) drawings of the tree, leaf, and fruit or cone. (JN)

  9. Axion Searches

    NASA Astrophysics Data System (ADS)

    Sikivie, Pierre

    The following sections are included: * INTRODUCTION TO AXION PHYSICS * THE COSMOLOGICAL AXION ENERGY DENSITY * The contribution from initial vacuum misalignment * The contribution from cosmic axion strings * THE CAVITY DETECTOR OF GALACTIC HALO AXIONS * THE PHASE SPACE STRUCTURE OF COLD DARK MATTER HALOS * TELESCOPE SEARCH FOR THE 2γ DECAY OF RELIC AXIONS * A SOLAR AXION DETECTOR * ACKNOWLEDGEMENT * REFERENCES

  10. RADIO-SELECTED BINARY ACTIVE GALACTIC NUCLEI FROM THE VERY LARGE ARRAY STRIPE 82 SURVEY

    SciTech Connect

    Fu, Hai; Myers, A. D.; Djorgovski, S. G.; Yan, Lin; Wrobel, J. M.; Stockton, A.

    2015-01-20

    Galaxy mergers play an important role in the growth of galaxies and their supermassive black holes. Simulations suggest that tidal interactions could enhance black hole accretion, which can be tested by the fraction of binary active galactic nuclei (AGNs) among galaxy mergers. However, determining the fraction requires a statistical sample of binaries. We have identified kiloparsec-scale binary AGNs directly from high-resolution radio imaging. Inside the 92 deg{sup 2} covered by the high-resolution Very Large Array survey of the Sloan Digital Sky Survey (SDSS) Stripe 82 field, we identified 22 grade A and 30 grade B candidates of binary radio AGNs with angular separations less than 5'' (10 kpc at z = 0.1). Eight of the candidates have optical spectra for both components from the SDSS spectroscopic surveys and our Keck program. Two grade B candidates are projected pairs, but the remaining six candidates are all compelling cases of binary AGNs based on either emission line ratios or the excess in radio power compared to the Hα-traced star formation rate. Only two of the six binaries were previously discovered by an optical spectroscopic search. Based on these results, we estimate that ∼60% of our binary candidates would be confirmed once we obtain complete spectroscopic information. We conclude that wide-area high-resolution radio surveys offer an efficient method to identify large samples of binary AGNs. These radio-selected binary AGNs complement binaries identified at other wavelengths and are useful for understanding the triggering mechanisms of black hole accretion.

  11. Radio-selected Binary Active Galactic Nuclei from the Very Large Array Stripe 82 Survey

    NASA Astrophysics Data System (ADS)

    Fu, Hai; Myers, A. D.; Djorgovski, S. G.; Yan, Lin; Wrobel, J. M.; Stockton, A.

    2015-01-01

    Galaxy mergers play an important role in the growth of galaxies and their supermassive black holes. Simulations suggest that tidal interactions could enhance black hole accretion, which can be tested by the fraction of binary active galactic nuclei (AGNs) among galaxy mergers. However, determining the fraction requires a statistical sample of binaries. We have identified kiloparsec-scale binary AGNs directly from high-resolution radio imaging. Inside the 92 deg2 covered by the high-resolution Very Large Array survey of the Sloan Digital Sky Survey (SDSS) Stripe 82 field, we identified 22 grade A and 30 grade B candidates of binary radio AGNs with angular separations less than 5'' (10 kpc at z = 0.1). Eight of the candidates have optical spectra for both components from the SDSS spectroscopic surveys and our Keck program. Two grade B candidates are projected pairs, but the remaining six candidates are all compelling cases of binary AGNs based on either emission line ratios or the excess in radio power compared to the Hα-traced star formation rate. Only two of the six binaries were previously discovered by an optical spectroscopic search. Based on these results, we estimate that ~60% of our binary candidates would be confirmed once we obtain complete spectroscopic information. We conclude that wide-area high-resolution radio surveys offer an efficient method to identify large samples of binary AGNs. These radio-selected binary AGNs complement binaries identified at other wavelengths and are useful for understanding the triggering mechanisms of black hole accretion. 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.

  12. The Environment of X-Ray Binaries in the Dwarf Starburst Galaxy NGC 1569

    NASA Astrophysics Data System (ADS)

    Clark, David M.; Eikenberry, Stephen S.; Raines, Steven N.

    2008-05-01

    We use deep, J and Ks observations of NGC 1569 acquired with FLAMINGOS on the KPNO 4-m to search for star cluster counterparts to X-ray binaries identified in archived Chandra images of this dwarf starburst galaxy. Performing near-IR photometry on the star cluster counterparts, we determine their colors, luminosities and masses. Comparing these results to the properties for all clusters in this galaxy, we search for trends in clusters associated with X-ray sources. Combining this study with FISICA, near-IR spectral observations, we further characterize the surroundings to X-ray binaries in NGC 1569. Contrasting this work with findings from a similar study performed on the Antennae galaxies, a large, merging system, we investigate the differences in X-ray binary environments.

  13. On similarity of binary black hole gravitational-wave skymaps: to observe or to wait?

    NASA Astrophysics Data System (ADS)

    Vitale, Salvatore; Essick, Reed; Katsavounidis, Erik; Klimenko, Sergey; Vedovato, Gabriele

    2017-03-01

    Localization estimates for GW150914, the first binary black hole detected by the LIGO instruments, were shared with partner facilities for electromagnetic follow-up. While the source was a compact binary coalescence (CBC), it was first identified by algorithms that search for unmodelled signals, which produced the skymaps that directed electromagnetic observations. Later on, CBC-specific algorithms produced refined versions, which showed significant differences. In this Letter, we show that those differences were not accidental and that CBC and unmodelled skymaps for binary black holes will frequently be different; we thus provide a way to determine whether to observe electromagnetically as promptly as possible (following a gravitational-wave detection), or to wait until CBC skymaps become available, should they not be available in low latency. We also show that, unsurprisingly, CBC algorithms can yield much smaller searched areas.

  14. Pattern Matcher for Trees Constructed from Lists

    NASA Technical Reports Server (NTRS)

    James, Mark

    2007-01-01

    A software library has been developed that takes a high-level description of a pattern to be satisfied and applies it to a target. If the two match, it returns success; otherwise, it indicates a failure. The target is semantically a tree that is constructed from elements of terminal and non-terminal nodes represented through lists and symbols. Additionally, functionality is provided for finding the element in a set that satisfies a given pattern and doing a tree search, finding all occurrences of leaf nodes that match a given pattern. This process is valuable because it is a new algorithmic approach that significantly improves the productivity of the programmers and has the potential of making their resulting code more efficient by the introduction of a novel semantic representation language. This software has been used in many applications delivered to NASA and private industry, and the cost savings that have resulted from it are significant.

  15. Generation of binary holograms for deep scenes captured with a camera and a depth sensor

    NASA Astrophysics Data System (ADS)

    Leportier, Thibault; Park, Min-Chul

    2017-01-01

    This work presents binary hologram generation from images of a real object acquired from a Kinect sensor. Since hologram calculation from a point-cloud or polygon model presents a heavy computational burden, we adopted a depth-layer approach to generate the holograms. This method enables us to obtain holographic data of large scenes quickly. Our investigations focus on the performance of different methods, iterative and noniterative, to convert complex holograms into binary format. Comparisons were performed to examine the reconstruction of the binary holograms at different depths. We also propose to modify the direct binary search algorithm to take into account several reference image planes. Then, deep scenes featuring multiple planes of interest can be reconstructed with better efficiency.

  16. Constraining the Variability and Binary Fraction of Galactic Center Young Stars

    NASA Astrophysics Data System (ADS)

    Gautam, Abhimat K.; Do, Tuan; Ghez, Andrea M.; Lu, Jessica R.; Morris, Mark R.; Sakai, Shoko; Witzel, Gunther; Sitarski, Breann N.; Chappell, Samantha

    2017-01-01

    We present constraints on the variability and binarity of young stars in the central 10 arcseconds (~ 0.4 pc) of the Milky Way Galactic Center (GC) using Keck Adaptive Optics data over a 12 year baseline. Given our experiment's photometric uncertainties, at least 36% of our sample's known early-type stars are variable. We identified eclipsing binary systems by searching for periodic variability. In our sample of spectroscopically confirmed and likely early-type stars, we detected the two previously discovered GC eclipsing binary systems. We derived the likely binary fraction of main sequence, early-type stars at the GC via Monte Carlo simulations of eclipsing binary systems, and find that it is at least 32% with 90% confidence.

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

  18. Imposing Constraints from the Source Tree on ITG Constraints for SMT

    NASA Astrophysics Data System (ADS)

    Yamamoto, Hirofumi; Okuma, Hideo; Sumita, Eiichiro

    In the current statistical machine translation (SMT), erroneous word reordering is one of the most serious problems. To resolve this problem, many word-reordering constraint techniques have been proposed. Inversion transduction grammar (ITG) is one of these constraints. In ITG constraints, target-side word order is obtained by rotating nodes of the source-side binary tree. In these node rotations, the source binary tree instance is not considered. Therefore, stronger constraints for word reordering can be obtained by imposing further constraints derived from the source tree on the ITG constraints. For example, for the source word sequence { a b c d }, ITG constraints allow a total of twenty-two target word orderings. However, when the source binary tree instance ((a b) (c d)) is given, our proposed “imposing source tree on ITG” (IST-ITG) constraints allow only eight word orderings. The reduction in the number of word-order permutations by our proposed stronger constraints efficiently suppresses erroneous word orderings. In our experiments with IST-ITG using the NIST MT08 English-to-Chinese translation track's data, the proposed method resulted in a 1.8-points improvement in character BLEU-4 (35.2 to 37.0) and a 6.2% lower CER (74.1 to 67.9%) compared with our baseline condition.

  19. SIM Lite Detection of Habitable Planets in P-Type Binary-Planetary Systems

    NASA Technical Reports Server (NTRS)

    Pan, Xiaopei; Shao, Michael; Shaklan, Stuart; Goullioud, Renaud

    2010-01-01

    Close binary stars like spectroscopic binaries create a completely different environment than single stars for the evolution of a protoplanetary disk. Dynamical interactions between one star and protoplanets in such systems provide more challenges for theorists to model giant planet migration and formation of multiple planets. For habitable planets the majority of host stars are in binary star systems. So far only a small amount of Jupiter-size planets have been discovered in binary stars, whose minimum separations are 20 AU and the median value is about 1000 AU (because of difficulties in radial velocity measurements). The SIM Lite mission, a space-based astrometric observatory, has a unique capability to detect habitable planets in binary star systems. This work analyzed responses of the optical system to the field stop for companion stars and demonstrated that SIM Lite can observe exoplanets in visual binaries with small angular separations. In particular we investigated the issues for the search for terrestrial planets in P-type binary-planetary systems, where the planets move around both stars in a relatively distant orbit.

  20. Protocols for quantum binary voting

    NASA Astrophysics Data System (ADS)

    Thapliyal, Kishore; Sharma, Rishi Dutt; Pathak, Anirban

    Two new protocols for quantum binary voting are proposed. One of the proposed protocols is designed using a standard scheme for controlled deterministic secure quantum communication (CDSQC), and the other one is designed using the idea of quantum cryptographic switch, which uses a technique known as permutation of particles. A few possible alternative approaches to accomplish the same task (quantum binary voting) have also been discussed. Security of the proposed protocols is analyzed. Further, the efficiencies of the proposed protocols are computed, and are compared with that of the existing protocols. The comparison has established that the proposed protocols are more efficient than the existing protocols.

  1. Memetic algorithms for the unconstrained binary quadratic programming problem.

    PubMed

    Merz, Peter; Katayama, Kengo

    2004-12-01

    This paper presents a memetic algorithm, a highly effective evolutionary algorithm incorporating local search for solving the unconstrained binary quadratic programming problem (BQP). To justify the approach, a fitness landscape analysis is conducted experimentally for several instances of the BQP. The results of the analysis show that recombination-based variation operators are well suited for the evolutionary algorithms with local search. Therefore, the proposed approach includes--besides a highly effective randomized k-opt local search--a new variation operator that has been tailored specially for the application in the hybrid evolutionary framework. The operator is called innovative variation and is fundamentally different from traditional crossover operators, since new genetic material is included in the offspring which is not contained in one of the parents. The evolutionary heuristic is tested on 35 publicly available BQP instances, and it is shown experimentally that the algorithm is capable of finding best-known solutions to large BQPs in a short time and with a high frequency. In comparison to other approaches for the BQP, the approach appears to be much more effective, particularly for large instances of 1000 or 2500 binary variables.

  2. SpeX spectroscopy of unresolved very low mass binaries. II. Identification of 14 candidate binaries with late-M/early-L and T dwarf components

    SciTech Connect

    Bardalez Gagliuffi, Daniella C.; Burgasser, Adam J.; Nicholls, Christine P.; Gelino, Christopher R.; Looper, Dagny L.; Schmidt, Sarah J.; Cruz, Kelle; West, Andrew A.; Gizis, John E.; Metchev, Stanimir

    2014-10-20

    Multiplicity is a key statistic for understanding the formation of very low mass (VLM) stars and brown dwarfs. Currently, the separation distribution of VLM binaries remains poorly constrained at small separations (≤1 AU), leading to uncertainty in the overall binary fraction. We approach this problem by searching for late-M/early-L plus T dwarf spectral binaries whose combined light spectra exhibit distinct peculiarities, allowing for separation-independent identification. We define a set of spectral indices designed to identify these systems, and we use a spectral template fitting method to confirm and characterize spectral binary candidates from a library of 815 spectra from the SpeX Prism Spectral Libraries. We present 11 new binary candidates, confirm 3 previously reported candidates, and rule out 2 previously identified candidates, all with primary and secondary spectral types in the range M7-L7 and T1-T8, respectively. We find that subdwarfs and blue L dwarfs are the primary contaminants in our sample and propose a method for segregating these sources. If confirmed by follow-up observations, these systems may add to the growing list of tight separation binaries, whose orbital properties may yield further insight into brown dwarf formation scenarios.

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

  4. Higgs Searches

    SciTech Connect

    Peters, Krisztian

    2009-11-01

    We present the status and prospects of Higgs searches at the Tevatron and the LHC. Results from the Tevatron are using up to 5 fb{sup -} of data collected with the CDF and D0 detectors. The major contributing processes include associated production (WH {yields} l{nu}bb, ZH {yields} {nu}{nu}bb, ZH {yields} llbb) and gluon fusion (gg {yields} H {yields} WW{sup (*)}). Improvements across the full mass range resulting from the larger data sets, improved analyses techniques and increased signal acceptance are discussed. Recent results exclude the SM Higgs boson in a mass range of 160 < m{sub H} < 170 GeV. Searches for the neutral MSSM Higgs boson in the region 90 < m{sub A} < 200 GeV exclude tan {beta} values down to 30 for several benchmark scenarios.

  5. Longterm lightcurves of X-ray binaries

    NASA Astrophysics Data System (ADS)

    Clarkson, William

    The X-ray Binaries (XRB) consist of a compact object and a stellar companion, which undergoes large-scale mass-loss to the compact object by virtue of the tight ( P orb usually hours-days) orbit, producing an accretion disk surrounding the compact object. The liberation of gravitational potential energy powers exotic high-energy phenomena, indeed the resulting accretion/ outflow process is among the most efficient energy-conversion machines in the universe. The Burst And Transient Source Experiment (BATSE) and RXTE All Sky Monitor (ASM) have provided remarkable X-ray lightcurves above 1.3keV for the entire sky, at near-continuous coverage, for intervals of 9 and 7 years respectively (with ~3 years' overlap). With an order of magnitude increase in sensitivity compared to previous survey instruments, these instruments have provided new insight into the high-energy behaviour of XRBs on timescales of tens to thousands of binary orbits. This thesis describes detailed examination of the long-term X-ray lightcurves of the neutron star XRB X2127+119, SMC X-1, Her X- 1, LMC X-4, Cyg X-2 and the as yet unclassified Circinus X-1, and for Cir X-1, complementary observations in the IR band. Chapters 1 & 2 introduce X-ray Binaries in general and longterm periodicities in particular. Chapter 3 introduces the longterm datasets around which this work is based, and the chosen methods of analysis of these datasets. Chapter 4 examines the burst history of the XRB X2127+119, suggesting three possible interpretations of the apparently contradictory X-ray emission from this system, including a possible confusion of two spatially distinct sources (which was later vindicated by high-resolution imaging). Chapters 5 and 6 describe the characterisation of accretion disk warping, providing observational verification of the prevailing theoretical framework for such disk-warps. Chapters 7 & 8 examine the enigmatic XRB Circinus X-1 with high-resolution IR spectroscopy (chapter 7) and the RXTE

  6. Arc binary intensity modulated radiation therapy (AB IMRT)

    NASA Astrophysics Data System (ADS)

    Yang, Jun

    The state of the art Intensity Modulate Radiation Therapy (IMRT) has been one of the most significant breakthroughs in the cancer treatment in the past 30 years. There are two types of IMRT systems. The first system is the binary-based tomotherapy, represented by the Peacock (Nomos Corp) and Tomo unit (TomoTherapy Inc.), adopting specific binary collimator leafs to deliver intensity modulated radiation fields in a serial or helical fashion. The other uses the conventional dynamic multileaf collimator (MLC) to deliver intensity modulated fields through a number of gantry positions. The proposed Arc Binary IMRT attempts to deliver Tomo-like IMRT with conventional dynamic MLC and combines the advantages of the two types of IMRT techniques: (1) maximizing the number of pencil beams for better dose optimization, (2) enabling conventional linear accelerator with dynamic MLC to deliver Tomo-like IMRT. In order to deliver IMRT with conventional dynamic MLC in a binary fashion, the slice-by-slice treatment with limited slice thickness has been proposed in the thesis to accommodate the limited MLC traveling speed. Instead of moving the patient to subsequent treatment slices, the proposed method offsets MLC to carry out the whole treatment, slice by slice sequentially, thus avoid patient position error. By denoting one arc pencil beam set as a gene, genetic algorithm (GA) is used as the searching engine for the dose optimization process. The selection of GA parameters is a crucial step and has been studied in depth so that the optimization process will converge with reasonable speed. Several hypothetical and clinical cases have been tested with the proposed IMRT method. The comparison of the dose distribution with other commercially available IMRT systems demonstrates the clear advantage of the new method. The proposed Arc Binary Intensity Modulated Radiation Therapy is not only theoretically sound but practically feasible. The implementation of this method would expand the

  7. Finding Minimum-Power Broadcast Trees for Wireless Networks

    NASA Technical Reports Server (NTRS)

    Arabshahi, Payman; Gray, Andrew; Das, Arindam; El-Sharkawi, Mohamed; Marks, Robert, II

    2004-01-01

    Some algorithms have been devised for use in a method of constructing tree graphs that represent connections among the nodes of a wireless communication network. These algorithms provide for determining the viability of any given candidate connection tree and for generating an initial set of viable trees that can be used in any of a variety of search algorithms (e.g., a genetic algorithm) to find a tree that enables the network to broadcast from a source node to all other nodes while consuming the minimum amount of total power. The method yields solutions better than those of a prior algorithm known as the broadcast incremental power algorithm, albeit at a slightly greater computational cost.

  8. BINARY YORP EFFECT AND EVOLUTION OF BINARY ASTEROIDS

    SciTech Connect

    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.

  9. Tree nut allergens.

    PubMed

    Roux, Kenneth H; Teuber, Suzanne S; Sathe, Shridhar K

    2003-08-01

    Allergic reactions to tree nuts can be serious and life threatening. Considerable research has been conducted in recent years in an attempt to characterize those allergens that are most responsible for allergy sensitization and triggering. Both native and recombinant nut allergens have been identified and characterized and, for some, the IgE-reactive epitopes described. Some allergens, such as lipid transfer proteins, profilins, and members of the Bet v 1-related family, represent minor constituents in tree nuts. These allergens are frequently cross-reactive with other food and pollen homologues, and are considered panallergens. Others, such as legumins, vicilins, and 2S albumins, represent major seed storage protein constituents of the nuts. The allergenic tree nuts discussed in this review include those most commonly responsible for allergic reactions such as hazelnut, walnut, cashew, and almond as well as those less frequently associated with allergies including pecan, chestnut, Brazil nut, pine nut, macadamia nut, pistachio, coconut, Nangai nut, and acorn.

  10. KEPLER ECLIPSING BINARIES WITH STELLAR COMPANIONS

    SciTech Connect

    Gies, D. R.; Matson, R. A.; Guo, Z.; Lester, K. V.; Orosz, J. A.; Peters, G. J. E-mail: rmatson@chara.gsu.edu E-mail: lester@chara.gsu.edu E-mail: gjpeters@mucen.usc.edu

    2015-12-15

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

  11. [Research on living tree volume forecast based on PSO embedding SVM].

    PubMed

    Jiao, You-Quan; Feng, Zhong-Ke; Zhao, Li-Xi; Xu, Wei-Heng; Cao, Zhong

    2014-01-01

    In order to establish volume model,living trees have to be fallen and be divided into many sections, which is a kind of destructive experiment. So hundreds of thousands of trees have been fallen down each year in China. To solve this problem, a new method called living tree volume accurate measurement without falling tree was proposed in the present paper. In the method, new measuring methods and calculation ways are used by using photoelectric theodolite and auxiliary artificial measurement. The diameter at breast height and diameter at ground was measured manually, and diameters at other heights were obtained by photoelectric theodolite. Tree volume and height of each tree was calculated by a special software that was programmed by the authors. Zhonglin aspens No. 107 were selected as experiment object, and 400 data records were obtained. Based on these data, a nonlinear intelligent living tree volume prediction model with Particle Swarm Optimization algorithm based on support vector machines (PSO-SVM) was established. Three hundred data records including tree height and diameter at breast height were randomly selected form a total of 400 data records as input data, tree volume as output data, using PSO-SVM tool box of Matlab7.11, thus a tree volume model was obtained. One hundred data records were used to test the volume model. The results show that the complex correlation coefficient (R2) between predicted and measured values is 0. 91, which is 2% higher than the value calculated by classic Spurr binary volume model, and the mean absolute error rates were reduced by 0.44%. Compared with Spurr binary volume model, PSO-SVM model has self-learning and self-adaption ability,moreover, with the characteristics of high prediction accuracy, fast learning speed,and a small sample size requirement, PSO-SVM model with well prospect is worth popularization and application.

  12. Can electronic search engines optimize screening of search results in systematic reviews: an empirical study

    PubMed Central

    Sampson, Margaret; Barrowman, Nicholas J; Moher, David; Clifford, Tammy J; Platt, Robert W; Morrison, Andra; Klassen, Terry P; Zhang, Li

    2006-01-01

    Background Most electronic search efforts directed at identifying primary studies for inclusion in systematic reviews rely on the optimal Boolean search features of search interfaces such as DIALOG® and Ovid™. Our objective is to test the ability of an Ultraseek® search engine to rank MEDLINE® records of the included studies of Cochrane reviews within the top half of all the records retrieved by the Boolean MEDLINE search used by the reviewers. Methods Collections were created using the MEDLINE bibliographic records of included and excluded studies listed in the review and all records retrieved by the MEDLINE search. Records were converted to individual HTML files. Collections of records were indexed and searched through a statistical search engine, Ultraseek, using review-specific search terms. Our data sources, systematic reviews published in the Cochrane library, were included if they reported using at least one phase of the Cochrane Highly Sensitive Search Strategy (HSSS), provided citations for both included and excluded studies and conducted a meta-analysis using a binary outcome measure. Reviews were selected if they yielded between 1000–6000 records when the MEDLINE search strategy was replicated. Results Nine Cochrane reviews were included. Included studies within the Cochrane reviews were found within the first 500 retrieved studies more often than would be expected by chance. Across all reviews, recall of included studies into the top 500 was 0.70. There was no statistically significant difference in ranking when comparing included studies with just the subset of excluded studies listed as excluded in the published review. Conclusion The relevance ranking provided by the search engine was better than expected by chance and shows promise for the preliminary evaluation of large results from Boolean searches. A statistical search engine does not appear to be able to make fine discriminations concerning the relevance of bibliographic records that have

  13. A celestial Christmas tree

    NASA Astrophysics Data System (ADS)

    Moore, S.

    2006-12-01

    Having finished decorating your terrestrial Christmas tree this year, you may care to step outside and view a celestial one. Well placed in the December night sky in the often overlooked but very rewarding constellation of Monoceros, NGC 2264, called the Christmas Tree by the American astronomer and writer Leland S. Copeland, lies due south around 1 a.m. in mid-December at an altitude of 50°. The cluster lies amid a vast area of nebulosity, well captured in the image by Gordon Rogers on the cover of this Journal.

  14. Sequential binary collision ionization mechanisms

    NASA Astrophysics Data System (ADS)

    van Boeyen, R. W.; Watanabe, N.; Doering, J. P.; Moore, J. H.; Coplan, M. A.; Cooper, J. W.

    2004-03-01

    Fully differential cross sections for the electron-impact ionization of the magnesium 3s orbital have been measured in a high-momentum-transfer regime wherein the ionization mechanisms can be accurately described by simple binary collision models. Measurements where performed at incident-electron energies from 400 to 3000 eV, ejected-electron energies of 62 eV, scattering angle of 20 °, and momentum transfers of 2 to 5 a.u. In the out-of-plane geometry of the experiment the cross section is observed far off the Bethe ridge. Both first- and second-order processes can be clearly distinguished as previously observed by Murray et al [Ref. 1] and Schulz et al [Ref. 2]. Owing to the relatively large momentum of the ejected electron, the second order processes can be modeled as sequential binary collisions involving a binary elastic collision between the incident electron and ionic core and a binary knock-out collision between the incident electron and target electron. At low incident-electron energies the cross section for both first and second order processes are comparable, while at high incident energies second-order processes dominate. *Supported by NSF under grant PHY-99-87870. [1] A. J. Murray, M. B. J. Woolf, and F. H. Read J. Phys. B 25, 3021 (1992). [2] M. Schulz, R. Moshammer, D. Fischer, H. Kollmus, D. H. Madison. S. Jones and J. Ullrich, Nature 422, 48 (2003).

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

  16. Binary logic is rich enough

    SciTech Connect

    Zapatrin, R.R.

    1992-02-01

    Given a finite ortholattice L, the *-semigroup is explicitly built whose annihilator ortholattice is isomorphic to L. Thus, it is shown that any finite quantum logic is the additive part of a binary logic. Some areas of possible applications are outlined. 7 refs.

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

  18. Coevolution of binaries and circumbinary gaseous discs

    NASA Astrophysics Data System (ADS)

    Fleming, David P.; Quinn, Thomas R.

    2017-01-01

    The recent discoveries of circumbinary planets by Kepler raise questions for contemporary planet formation models. Understanding how these planets form requires characterizing their formation environment, the circumbinary protoplanetary disc and how the disc and binary interact and change as a result. The central binary excites resonances in the surrounding protoplanetary disc which drive evolution in both the binary orbital elements and in the disc. To probe how these interactions impact binary eccentricity and disc structure evolution, N-body smooth particle hydrodynamics simulations of gaseous protoplanetary discs surrounding binaries based on Kepler 38 were run for 104 binary periods for several initial binary eccentricities. We find that nearly circular binaries weakly couple to the disc via a parametric instability and excite disc eccentricity growth. Eccentric binaries strongly couple to the disc causing eccentricity growth for both the disc and binary. Discs around sufficiently eccentric binaries which strongly couple to the disc develop an m = 1 spiral wave launched from the 1:3 eccentric outer Lindblad resonance which corresponds to an alignment of gas particle longitude of periastrons. All systems display binary semimajor axis decay due to dissipation from the viscous disc.

  19. Image segmentation using neural tree networks

    NASA Astrophysics Data System (ADS)

    Samaddar, Sumitro; Mammone, Richard J.

    1993-06-01

    We present a technique for Image Segmentation using Neural Tree Networks (NTN). We also modify the NTN architecture to let is solve multi-class classification problems with only binary fan-out. We have used a realistic case study of segmenting the pole, coil and painted coil regions of light bulb filaments (LBF). The input to the network is a set of maximum, minimum and average of intensities in radial slices of a circular window around a pixel, taken from a front-lit and a back-lit image of an LBF. Training is done with a composite image drawn from images of many LBFs. Each node of the NTN is a multi-layer perceptron and has one output for each segment class. These outputs are treated as probabilities to compute a confidence value for the segmentation of that pixel. Segmentation results with high confidence values are deemed to be correct and not processed further, while those with moderate and low confidence values are deemed to be outliers by this node and passed down the tree to children nodes. These tend to be pixels in boundary of different regions. The results are favorably compared with a traditional segmentation technique applied to the LBF test case.

  20. Neural tree network method for image segmentation

    NASA Astrophysics Data System (ADS)

    Samaddar, Sumitro; Mammone, Richard J.

    1994-02-01

    We present an extension of the neural tree network (NTN) architecture to let it solve multi- class classification problems with only binary fan-out. We then demonstrate it's effectiveness by applying it in a method for image segmentation. Each node of the NTN is a multi-layer perceptron and has one output for each segment class. These outputs are treated as probabilities to compute a confidence value for the segmentation of that pixel. Segmentation results with high confidence values are deemed to be correct and not processed further, while those with moderate and low confidence values are deemed to be outliers by this node and passed down the tree to children nodes. These tend to be pixels in boundary of different regions. We have used a realistic case study of segmenting the pole, coil and painted coil regions of light bulb filaments (LBF). The input to the network is a set of maximum, minimum and average of intensities in radial slices of a circular window around a pixel, taken from a front-lit and a back-lit image of an LBF. Training is done with a composite image drawn from images of many LBFs. The results are favorably compared with a traditional segmentation technique applied to the LBF test case.

  1. Rates of tree throw in Appalachian shale landscapes

    NASA Astrophysics Data System (ADS)

    White, T. S.; Dere, A. L. D.

    2014-12-01

    Arborturbation, or tree throw, the upheaval of soil and sometimes bedrock in the root mass of a fallen tree, has been suggested to be a major process in the overturn and downslope transport of soil and shallow bedrock in mountainous regions. Reported here is a quantification of the effects of tree throw from six sites in the eastern U.S. from New York to Alabama. The study included field measurements of individual tree throws within a 120-meter diameter search area centered on ridge tops on the Silurian Rose Hill Formation shale and coeval strata of similar composition. The following observations were made for each tree throw at each study site: GPS location, tree girth, relative tree age, tree type, dimensions of pit, azimuth of fall, and slope and azimuth of maximum slope. These observations allowed quantification of the volume and distance of transport of sediment per event, and the number of events/area/time. The sediment fluxes reported here range from 1.8 X 10-5 m2/m/y to 2.1 X 10-4 m2/m/y. The observations double in number and verify formulations of sediment flux due to tree throw cited in the literature., and exceed by several orders of magnitude values for sediment flux rate by soil creep on slopes. Slope and prevailing wind direction, while important in places, did not control the majority of arborturbation events in this study. The total number of tree throws is observed to decrease while sediment flux by tree throw generally increases from north to south along the study transect. Larger trees evacuate larger pits, but interestingly there is no observed increase in the average girth of trees in the study area to account for the discrepancy between number of tree throws and sediment flux. However, the depth to a root limiting layer and the distance from the center of a root wad to the center of an excavated pit increases from north to south - deeper roots excavate more soil and deeper soils generally exist in warmer climates.

  2. The Inference of Gene Trees with Species Trees

    PubMed Central

    Szöllősi, Gergely J.; Tannier, Eric; Daubin, Vincent; Boussau, Bastien

    2015-01-01

    This article reviews the various models that have been used to describe the relationships between gene trees and species trees. Molecular phylogeny has focused mainly on improving models for the reconstruction of gene trees based on sequence alignments. Yet, most phylogeneticists seek to reveal the history of species. Although the histories of genes and species are tightly linked, they are seldom identical, because genes duplicate, are lost or horizontally transferred, and because alleles can coexist in populations for periods that may span several speciation events. Building models describing the relationship between gene and species trees can thus improve the reconstruction of gene trees when a species tree is known, and vice versa. Several approaches have been proposed to solve the problem in one direction or the other, but in general neither gene trees nor species trees are known. Only a few studies have attempted to jointly infer gene trees and species trees. These models account for gene duplication and loss, transfer or incomplete lineage sorting. Some of them consider several types of events together, but none exists currently that considers the full repertoire of processes that generate gene trees along the species tree. Simulations as well as empirical studies on genomic data show that combining gene tree–species tree models with models of sequence evolution improves gene tree reconstruction. In turn, these better gene trees provide a more reliable basis for studying genome evolution or reconstructing ancestral chromosomes and ancestral gene sequences. We predict that gene tree–species tree methods that can deal with genomic data sets will be instrumental to advancing our understanding of genomic evolution. PMID:25070970

  3. Hints for Hidden Planetary Companions to Hot Jupiters in Stellar Binaries

    NASA Astrophysics Data System (ADS)

    Hamers, Adrian S.

    2017-02-01

    Searches for stellar companions to hot Jupiters (HJs) have revealed that planetary systems hosting an HJ are approximately three times more likely to have a stellar companion with a semimajor axis between 50 and 2000 au, compared to field stars. This correlation suggests that HJ formation is affected by the stellar binary companion. A potential model is high-eccentricity migration, in which the binary companion induces high-eccentricity Lidov–Kozai (LK) oscillations in the proto-HJ orbit, triggering orbital migration driven by tides. A pitfall of this “binary-LK” model is that the observed stellar binaries hosting HJs are typically too wide to produce HJs in sufficient numbers because of suppression by short-range forces. We propose a modification to the binary-LK model in which there is a second giant planet orbiting the proto-HJ at a semimajor axis of several tens of au. Such companions are currently hidden to observations, but their presence could be manifested by a propagation of the perturbation of the stellar binary companion inward to the proto-HJ, thereby overcoming the barrier imposed by short-range forces. Our model does not require the planetary companion orbit to be eccentric and/or inclined with respect to the proto-HJ, but its semimajor axis should lie in a specific range given the planetary mass and binary semimajor axis, and the inclination with respect to the binary should be near 40° or 140°. Our prediction for planetary companions to HJs in stellar binaries should be testable by future observations.

  4. A Search for Collision Orbits in the Free-Fall Three-Body Problem. I. Numerical Procedure

    NASA Astrophysics Data System (ADS)

    Tanikawa, Kiyotaka; Umehara, Hiroaki; Abe, Hiroshi

    1995-12-01

    A numerical procedure is devised to find binary collision orbits in the free-fall three-body problem. Applying this procedure, families of binary collision orbits are found and a sequence of triple collision orbits are positioned. A property of sets of binary collision orbits which is convenient to search triple collision orbits is found. Important numerical results are formulated and summarized in the final section.

  5. Creating, Searching, and Deleting KD Trees Using C++

    DTIC Science & Technology

    2014-09-01

    to model the patterns of seeds in sunflowers . 1  m i Rri , (3)    ii 53 , (4) where R is the radius of a circle that contains all of the...MD): Army Research Laboratory (US); August 2013. Report No.: ARL-TN-559. 4. Vogel, H. A better way to construct the sunflower head. Mathematical

  6. Mission Command Analysis Using Monte Carlo Tree Search

    DTIC Science & Technology

    2013-06-14

    Modeling, Virtual Environments, and Simulation NPS Naval Postgraduate School TRAC Training and Doctrine Command Analysis Center TRAC- MRO Training and...Background In the fall of 2012, the Training and Doctrine Command Analysis Center (TRAC) Methods and Research Office (TRAC- MRO ) sponsored the Training and...Sponsor: Mr. Paul Works, TRAC Research Director, MRO . • Project Lead: MAJ Chris Marks (TRAC-MTRY). • Supporting Analyst: LTC John Alt (TRAC-MTRY

  7. Evidence integration in model-based tree search

    PubMed Central

    Solway, Alec; Botvinick, Matthew M.

    2015-01-01

    Research on the dynamics of reward-based, goal-directed decision making has largely focused on simple choice, where participants decide among a set of unitary, mutually exclusive options. Recent work suggests that the deliberation process underlying simple choice can be understood in terms of evidence integration: Noisy evidence in favor of each option accrues over time, until the evidence in favor of one option is significantly greater than the rest. However, real-life decisions often involve not one, but several steps of action, requiring a consideration of cumulative rewards and a sensitivity to recursive decision structure. We present results from two experiments that leveraged techniques previously applied to simple choice to shed light on the deliberation process underlying multistep choice. We interpret the results from these experiments in terms of a new computational model, which extends the evidence accumulation perspective to multiple steps of action. PMID:26324932

  8. Using Knowledge about the Opponent in Game-Tree Search.

    DTIC Science & Technology

    1992-09-01

    Futer , Computer analysis of a rook endgame, in Machine Intelligence 9, Hayes, Michie and Mikulich eds. Ellis Horwood Ltd., 1979. [8] E. B. Baum, Minimax...Komissarchik and A.L. Futer , Computer analysis of a queen endgame, The ICCA Journal, Vol. 9, no. 4, December 1986. [27] D. Kopec and T. Niblett, How hard is

  9. A Universal Phylogenetic Tree.

    ERIC Educational Resources Information Center

    Offner, Susan

    2001-01-01

    Presents a universal phylogenetic tree suitable for use in high school and college-level biology classrooms. Illustrates the antiquity of life and that all life is related, even if it dates back 3.5 billion years. Reflects important evolutionary relationships and provides an exciting way to learn about the history of life. (SAH)

  10. Tree-Ties.

    ERIC Educational Resources Information Center

    Gresczyk, Rick

    Created to help students understand how plants were used for food, for medicine, and for arts and crafts among the Ojibwe (Chippewa) Indians, the game Tree-Ties combines earth and social sciences within a specific culture. The game requires mutual respect, understanding, and agreement to succeed. Sounding like the word "treaties", the…

  11. Christmas Tree Category Manual.

    ERIC Educational Resources Information Center

    Bowman, James S.; Turmel, Jon P.

    This manual provides information needed to meet the standards for pesticide applicator certification. Pests and diseases of christmas tree plantations are identified and discussed. Section one deals with weeds and woody plants and the application, formulation and effects of herbicides in controlling them. Section two discusses specific diseases…

  12. Digging Deeper with Trees.

    ERIC Educational Resources Information Center

    Growing Ideas, 2001

    2001-01-01

    Describes hands-on science areas that focus on trees. A project on leaf pigmentation involves putting crushed leaves in a test tube with solvent acetone to dissolve pigment. In another project, students learn taxonomy by sorting and classifying leaves based on observable characteristics. Includes a language arts connection. (PVD)

  13. Phylogenics & Tree-Thinking

    ERIC Educational Resources Information Center

    Baum, David A.; Offner, Susan

    2008-01-01

    Phylogenetic trees, which are depictions of the inferred evolutionary relationships among a set of species, now permeate almost all branches of biology and are appearing in increasing numbers in biology textbooks. While few state standards explicitly require knowledge of phylogenetics, most require some knowledge of evolutionary biology, and many…

  14. The Sacred Tree.

    ERIC Educational Resources Information Center

    Lethbridge Univ. (Alberta).

    Designed as a text for high school students and adults, this illustrated book presents ethical concepts and teachings of Native societies throughout North America concerning the nature and possibilities of human existence. The final component of a course in self-discovery and development, the book begins with the legend of the "Sacred Tree"…

  15. Post-common envelope binaries from SDSS - VII. A catalogue of white dwarf-main sequence binaries

    NASA Astrophysics Data System (ADS)

    Rebassa-Mansergas, A.; Gänsicke, B. T.; Schreiber, M. R.; Koester, D.; Rodríguez-Gil, P.

    2010-02-01

    We present a catalogue of 1602 white-dwarf-main-sequence (WDMS) binaries from the spectroscopic Sloan Digital Sky Survey Data Release 6 (SDSS DR6). Among these, we identify 440 as new WDMS binaries. We select WDMS binary candidates by template fitting all 1.27 million DR6 spectra, using combined constraints in both χ2 and signal-to-noise ratio. In addition, we use Galaxy Evolution Explorer (GALEX) and UKIRT Infrared Sky Survey (UKIDSS) magnitudes to search for objects in which one of the two components dominates the SDSS spectrum. We use a decomposition/fitting technique to measure the effective temperatures, surface gravities, masses and distances to the white dwarfs, as well as the spectral types and distances to the companions in our catalogue. Distributions and density maps obtained from these stellar parameters are then used to study both the general properties and the selection effects of WDMS binaries in the SDSS. A comparison between the distances measured to the white dwarfs and the main-sequence companions shows dsec > dwd for approximately one-fifth of the systems, a tendency already found in our previous work. The hypothesis that magnetic activity raises the temperature of the inter-spot regions in active stars that are heavily covered by cool spots, leading to a bluer optical colour compared to inactive stars, remains the best explanation for this behaviour. We also make use of SDSS-GALEX-UKIDSS magnitudes to investigate the distribution of WDMS binaries, as well as their white-dwarf effective temperatures and companion star spectral types, in ultraviolet to infrared colour space. We show that WDMS binaries can be very efficiently separated from single main-sequence stars and white dwarfs when using a combined ultraviolet, optical and infrared colour selection. Finally, we also provide radial velocities for 1068 systems measured from the NaI λλ8183.27, 8194.81 absorption doublet and/or the Hα emission line. Among the systems with multiple SDSS

  16. Structure maps in the search for new intermetallics

    SciTech Connect

    Pettifor, D.G. . Dept. of Mathematics)

    1989-01-01

    The data base on the crystal structures of binary compounds may be ordered within two-dimensional structure maps using the recently proposed Mendeleev number which places all the elements in sequential order. This paper reviews the progress made and problems encountered in using the maps as a guide in the search for new pseudobinaries with a required crystal structure. 37 refs., 6 figs.

  17. Web Search Engines: Search Syntax and Features.

    ERIC Educational Resources Information Center

    Ojala, Marydee

    2002-01-01

    Presents a chart that explains the search syntax, features, and commands used by the 12 most widely used general Web search engines. Discusses Web standardization, expanded types of content searched, size of databases, and search engines that include both simple and advanced versions. (LRW)

  18. New Life From Dead Trees

    ERIC Educational Resources Information Center

    DeGraaf, Richard M.

    1978-01-01

    There are numerous bird species that will nest only in dead or dying trees. Current forestry practices include clearing forests of these snags, or dead trees. This practice is driving many species out of the forests. An illustrated example of bird succession in and on a tree is given. (MA)

  19. The Hopi Fruit Tree Book.

    ERIC Educational Resources Information Center

    Nyhuis, Jane

    Referring as often as possible to traditional Hopi practices and to materials readily available on the reservation, the illustrated booklet provides information on the care and maintenance of young fruit trees. An introduction to fruit trees explains the special characteristics of new trees, e.g., grafting, planting pits, and watering. The…

  20. Building up rhetorical structure trees

    SciTech Connect

    Marcu, D.

    1996-12-31

    I use the distinction between the nuclei and the satellites that pertain to discourse relations to introduce a compositionality criterion for discourse trees. I provide a first-order formalization of rhetorical structure trees and, on its basis, I derive an algorithm that constructs all the valid rhetorical trees that can be associated with a given discourse.

  1. The Tree Worker's Manual. [Revised.

    ERIC Educational Resources Information Center

    Lilly, S. J.

    This manual acquaints readers with the general operations of the tree care industry. The manual covers subjects important to a tree worker and serves as a training aid for workers at the entry level as tree care professionals. Each chapter begins with a set of objectives and may include figures, tables, and photographs. Ten chapters are included:…

  2. Our Air: Unfit for Trees.

    ERIC Educational Resources Information Center

    Dochinger, Leon S.

    To help urban, suburban, and rural tree owners know about air pollution's effects on trees and their tolerance and intolerance to pollutants, the USDA Forest Service has prepared this booklet. It answers the following questions about atmospheric pollution: Where does it come from? What can it do to trees? and What can we do about it? In addition,…

  3. TPMS: a set of utilities for querying collections of gene trees

    PubMed Central

    2013-01-01

    Background The information in large collections of phylogenetic trees is useful for many comparative genomic studies. Therefore, there is a need for flexible tools that allow exploration of such collections in order to retrieve relevant data as quickly as possible. Results In this paper, we present TPMS (Tree Pattern-Matching Suite), a set of programs for handling and retrieving gene trees according to different criteria. The programs from the suite include utilities for tree collection building, specific tree-pattern search strategies and tree rooting. Use of TPMS is illustrated through three examples: systematic search for incongruencies in a large tree collection, a short study on the Coelomata/Ecdysozoa controversy and an evaluation of the level of support for a recently published Mammal phylogeny. Conclusion TPMS is a powerful suite allowing to quickly retrieve sets of trees matching complex patterns in large collection or to root trees using more rigorous approaches than the classical midpoint method. As it is made of a set of command-line programs, it can be easily integrated in any sequence analysis pipeline for an automated use. PMID:23530580

  4. Data Mechanics and Coupling Geometry on Binary Bipartite Networks

    PubMed Central

    Fushing, Hsieh; Chen, Chen

    2014-01-01

    We quantify the notion of pattern and formalize the process of pattern discovery under the framework of binary bipartite networks. Patterns of particular focus are interrelated global interactions between clusters on its row and column axes. A binary bipartite network is built into a thermodynamic system embracing all up-and-down spin configurations defined by product-permutations on rows and columns. This system is equipped with its ferromagnetic energy ground state under Ising model potential. Such a ground state, also called a macrostate, is postulated to congregate all patterns of interest embedded within the network data in a multiscale fashion. A new computing paradigm for indirect searching for such a macrostate, called Data Mechanics, is devised by iteratively building a surrogate geometric system with a pair of nearly optimal marginal ultrametrics on row and column spaces. The coupling measure minimizing the Gromov-Wasserstein distance of these two marginal geometries is also seen to be in the vicinity of the macrostate. This resultant coupling geometry reveals multiscale block pattern information that characterizes multiple layers of interacting relationships between clusters on row and on column axes. It is the nonparametric information content of a binary bipartite network. This coupling geometry is then demonstrated to shed new light and bring resolution to interaction issues in community ecology and in gene-content-based phylogenetics. Its implied global inferences are expected to have high potential in many scientific areas. PMID:25170903

  5. Δ μ binaries among stars with large proper motions

    NASA Astrophysics Data System (ADS)

    Khovritchev, M. Yu.; Kulikova, A. M.

    2015-12-01

    Based on observations performed with the Pulkovo normal astrograph in 2008-2015 and data from sky surveys (DSS, 2MASS, SDSS DR12, WISE), we have investigated the motions of 1308 stars with proper motions larger than 300 mas yr-1 down to magnitude 17. The main idea of our search for binary stars based on this material is reduced to comparing the quasi-mean (POSS2-POSS1; an epoch difference of ≈50 yr) and quasi-instantaneous (2МASS, SDSS, WISE, Pulkovo; an epoch difference of ≈10 yr) proper motions. If the difference is statistically significant compared to the proper motion errors, then the object may be considered as a Δ μ-binary candidate. One hundred and twenty one stars from among those included in the observational program satisfy this requirement. Additional confirmations of binarity for a number of stars have been obtained by comparing the calculated proper motions with the data from several programs of stellar trigonometric parallax determinations and by analyzing the asymmetry of stellar images on sky-survey CCD frames. Analysis of the highly accurate SDSS photometric data for four stars (J0656+3827, J0838+3940, J1229+5332, J2330+4639) allows us to reach a conclusion about the probability that these Δ μ binaries are white dwarf +Mdwarf pairs.

  6. Observing Mergers of Nonspinning Black Hole Binaries with LISA

    NASA Technical Reports Server (NTRS)

    McWilliams S.; Baker, John G.; Boggs, William D.; Centrella, Joan; Kelly Bernard J.; Thorpe, J. Ira; vanMeter, James R.

    2008-01-01

    Recent advances in the field of numerical relativity now make it possible to calculate the final, most powerful merger phase of binary black hole coalescence. We present the application of nonspinning numerical relativity waveforms to the search for and precision measurement of black hole binary coalescences using LISA. In particular, we focus on the advances made in moving beyond the equal mass, nonspinning case into other regions of parameter space, focusing on the case of nonspinning holes with ever-increasing mass ratios. We analyze the available unequal mass merger waveforms from numerical relativity, and compare them to two models, both of which use an effective one body treatment of the inspiral, but which use fundamentally different approaches to the treatment of the merger-ringdown. We confirm the expected mass ratio scaling of the merger, and investigate the changes in waveform behavior and their observational impact with changing mass ratio. Finally, we investigate the potential contribution from the merger portion of the waveform to measurement uncertainties of the binary's parameters for the unequal mass case.

  7. The Planet in the HR 7162 Binary System Discovered by PHASES Astrometry

    NASA Astrophysics Data System (ADS)

    Muterspaugh, Matthew W.; Lane, B. F.; Konacki, M.; Burke, B. F.; Colavita, M. M.; Shao, M.; Hartkopf, W. I.; Boss, A. P.; O'Connell, J.; Fekel, F. C.; Wiktorowicz, S. J.

    2011-01-01

    The now-completed Palomar High-precision Astrometric Search for Exoplanet Systems (PHASES) used phase-referenced long-baseline interferometry to monitor 51 binary systems with 35 micro-arcsecond measurement precision, resulting in the high-confidence detection of a planet in the HR 7162 system. The 1.5 Jupiter mass planet is in a 2 AU orbit around one of the stars, whereas the binary itself has a separation of only 19 AU. Despite the close stellar companion, this configuration is expected to be stable, based on dynamic simulations. In the context of our solar system, this is analogous to a Jovian planet just outside of Mars' orbit, with a second star at the distance of Uranus. If this configuration were present during the period of planet formation, the complex gravitational environment created by the stars would seem to disrupt planet formation mechanisms that require long times to complete (thousands of years or more). While it is possible the arrangement resulted from the planet being formed in another environment (a single star or wider binary) after which the system reached its current state via dynamic interactions (star-planet exchange with a binary, or the binary orbit shrinking by interacting with a passing star), the frequency of such interactions is very low. Because the PHASES search only had the sensitivity to rule out Jovian mass companions in 11 of our 51 systems, yet one such system was found, the result indicates either extreme luck or that there is a high frequency of 20 AU binaries hosting planets. The latter interpretation is supported by previous detections of planets in 5-6 additional 20 AU binaries in other surveys (though with less control over the statistics for determining frequency of occurrence). Thus, there is observational support suggesting that a mechanism for rapid Jovian planet formation occurs in nature.

  8. Geometric tree kernels: classification of COPD from airway tree geometry.

    PubMed

    Feragen, Aasa; Petersen, Jens; Grimm, Dominik; Dirksen, Asger; Pedersen, Jesper Holst; Borgwardt, Karsten; de Bruijne, Marleen

    2013-01-01

    Methodological contributions: This paper introduces a family of kernels for analyzing (anatomical) trees endowed with vector valued measurements made along the tree. While state-of-the-art graph and tree kernels use combinatorial tree/graph structure with discrete node and edge labels, the kernels presented in this paper can include geometric information such as branch shape, branch radius or other vector valued properties. In addition to being flexible in their ability to model different types of attributes, the presented kernels are computationally efficient and some of them can easily be computed for large datasets (N - 10.000) of trees with 30 - 600 branches. Combining the kernels with standard machine learning tools enables us to analyze the relation between disease and anatomical tree structure and geometry. Experimental results: The kernels are used to compare airway trees segmented from low-dose CT, endowed with branch shape descriptors and airway wall area percentage measurements made along the tree. Using kernelized hypothesis testing we show that the geometric airway trees are significantly differently distributed in patients with Chronic Obstructive Pulmonary Disease (COPD) than in healthy individuals. The geometric tree kernels also give a significant increase in the classification accuracy of COPD from geometric tree structure endowed with airway wall thickness measurements in comparison with state-of-the-art methods, giving further insight into the relationship between airway wall thickness and COPD. Software: Software for computing kernels and statistical tests is available at http://image.diku.dk/aasa/software.php.

  9. tropiTree: An NGS-Based EST-SSR Resource for 24 Tropical Tree Species

    PubMed Central

    Russell, Joanne R.; Hedley, Peter E.; Cardle, Linda; Dancey, Siobhan; Morris, Jenny; Booth, Allan; Odee, David; Mwaura, Lucy; Omondi, William; Angaine, Peter; Machua, Joseph; Muchugi, Alice; Milne, Iain; Kindt, Roeland; Jamnadass, Ramni; Dawson, Ian K.

    2014-01-01

    The development of genetic tools for non-model organisms has been hampered by cost, but advances in next-generation sequencing (NGS) have created new opportunities. In ecological research, this raises the prospect for developing molecular markers to simultaneously study important genetic processes such as gene flow in multiple non-model plant species within complex natural and anthropogenic landscapes. Here, we report the use of bar-coded multiplexed paired-end Illumina NGS for the de novo development of expressed sequence tag-derived simple sequence repeat (EST-SSR) markers at low cost for a range of 24 tree species. Each chosen tree species is important in complex tropical agroforestry systems where little is currently known about many genetic processes. An average of more than 5,000 EST-SSRs was identified for each of the 24 sequenced species, whereas prior to analysis 20 of the species had fewer than 100 nucleotide sequence citations. To make results available to potential users in a suitable format, we have developed an open-access, interactive online database, tropiTree (http://bioinf.hutton.ac.uk/tropiTree), which has a range of visualisation and search facilities, and which is a model for the efficient presentation and application of NGS data. PMID:25025376

  10. Tree Colors: Color Schemes for Tree-Structured Data.

    PubMed

    Tennekes, Martijn; de Jonge, Edwin

    2014-12-01

    We present a method to map tree structures to colors from the Hue-Chroma-Luminance color model, which is known for its well balanced perceptual properties. The Tree Colors method can be tuned with several parameters, whose effect on the resulting color schemes is discussed in detail. We provide a free and open source implementation with sensible parameter defaults. Categorical data are very common in statistical graphics, and often these categories form a classification tree. We evaluate applying Tree Colors to tree structured data with a survey on a large group of users from a national statistical institute. Our user study suggests that Tree Colors are useful, not only for improving node-link diagrams, but also for unveiling tree structure in non-hierarchical visualizations.

  11. Enhancing our Search for Missing Intermediate Mass Black Holes Using Advanced LIGO

    NASA Astrophysics Data System (ADS)

    Jani, Karan; LIGO Scientific Collaboration; Virgo Collaboration Collaboration

    2017-01-01

    The current generation of ground-based gravitational-wave detectors are most sensitive to mergers of intermediate-mass black holes (IMBH), with search volume of cosmological distances of redshift 1 and detectable total-mass up to 1000M⊙ . Two independent searches for binary black holes, matched-filtering and transient burst, are specifically configured to look for IMBH binaries in Advanced LIGO. I summarize the results from both these searches during the first observing run of Advanced LIGO and narrate our plans to enhance detection volume and detectable total-mass.

  12. Searches for Continuous Gravitational Waves in LIGO and Virgo Data

    NASA Astrophysics Data System (ADS)

    Riles, Keith; LIGO Scientific Collaboration Collaboration; Virgo Collaboration Collaboration

    2017-01-01

    The LIGO Scientific Collaboration and Virgo Collaboration have carried out searches for periodic continuous gravitational waves. These analyses range from targeted searches for gravitational-wave signals from known pulsars, for which precise ephemerides from radio or X-ray observations are available, to all-sky searches for unknown neutron stars, including stars in unknown binary systems. Between these extremes lie directed searches for known stars of unknown spin frequency or for new unknown sources at specific locations. These different types of searches will be presented, including final results from the Initial LIGO and Virgo data runs and, where available, new results from searches of early Advanced LIGO data. This work is supported by the National Science Foundation grant PHY-1505932.

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

  14. Binary Stars in SBS Survey

    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.

  15. Mass transfer between binary stars

    NASA Technical Reports Server (NTRS)

    Modisette, J. L.; Kondo, Y.

    1980-01-01

    The transfer of mass from one component of a binary system to another by mass ejection is analyzed through a stellar wind mechanism, using a model which integrates the equations of motion, including the energy equation, with an initial static atmosphere and various temperature fluctuations imposed at the base of the star's corona. The model is applied to several situations and the energy flow is calculated along the line of centers between the two binary components, in the rotating frame of the system, thereby incorporating the centrifugal force. It is shown that relatively small disturbances in the lower chromosphere or photosphere can produce mass loss through a stellar wind mechanism, due to the amplification of the disturbance propagating into the thinner atmosphere. Since there are many possible sources of the disturbance, the model can be used to explain many mass ejection phenomena.

  16. Close supermassive binary black holes.

    PubMed

    Gaskell, C Martin

    2010-01-07

    It has been proposed that when the peaks of the broad emission lines in active galactic nuclei (AGNs) are significantly blueshifted or redshifted from the systemic velocity of the host galaxy, this could be a consequence of orbital motion of a supermassive black-hole binary (SMBB). The AGN J1536+0441 ( = SDSS J153636.22+044127.0) has recently been proposed as an example of this phenomenon. It is proposed here instead that J1536+0441 is an example of line emission from a disk. If this is correct, the lack of clear optical spectral evidence for close SMBBs is significant, and argues either that the merging of close SMBBs is much faster than has generally been hitherto thought, or if the approach is slow, that when the separation of the binary is comparable to the size of the torus and broad-line region, the feeding of the black holes is disrupted.

  17. Rate of tree carbon accumulation increases continuously with tree size.

    PubMed

    Stephenson, N L; Das, A J; Condit, R; Russo, S E; Baker, P J; Beckman, N G; Coomes, D A; Lines, E R; Morris, W K; Rüger, N; Alvarez, E; Blundo, C; Bunyavejchewin, S; Chuyong, G; Davies, S J; Duque, A; Ewango, C N; Flores, O; Franklin, J F; Grau, H R; Hao, Z; Harmon, M E; Hubbell, S P; Kenfack, D; Lin, Y; Makana, J-R; Malizia, A; Malizia, L R; Pabst, R J; Pongpattananurak, N; Su, S-H; Sun, I-F; Tan, S; Thomas, D; van Mantgem, P J; Wang, X; Wiser, S K; Zavala, M A

    2014-03-06

    Forests are major components of the global carbon cycle, providing substantial feedback to atmospheric greenhouse gas concentrations. Our ability to understand and predict changes in the forest carbon cycle--particularly net primary productivity and carbon storage--increasingly relies on models that represent biological processes across several scales of biological organization, from tree leaves to forest stands. Yet, despite advances in our understanding of productivity at the scales of leaves and stands, no consensus exists about the nature of productivity at the scale of the individual tree, in part because we lack a broad empirical assessment of whether rates of absolute tree mass growth (and thus carbon accumulation) decrease, remain constant, or increase as trees increase in size and age. Here we present a global analysis of 403 tropical and temperate tree species, showing that for most species mass growth rate increases continuously with tree size. Thus, large, old trees do not act simply as senescent carbon reservoirs but actively fix large amounts of carbon compared to smaller trees; at the extreme, a single big tree can add the same amount of carbon to the forest within a year as is contained in an entire mid-sized tree. The apparent paradoxes of individual tree growth increasing with tree size despite declining leaf-level and stand-level productivity can be explained, respectively, by increases in a tree's total leaf area that outpace declines in productivity per unit of leaf area and, among other factors, age-related reductions in population density. Our results resolve conflicting assumptions about the nature of tree growth, inform efforts to undertand and model forest carbon dynamics, and have additional implications for theories of resource allocation and plant senescence.

  18. Compact object mergers: observations of supermassive binary black holes and stellar tidal disruption events

    NASA Astrophysics Data System (ADS)

    Komossa, S.; Zensus, J. A.

    2016-02-01

    The capture and disruption of stars by supermassive black holes (SMBHs), and the formation and coalescence of binaries, are inevitable consequences of the presence of SMBHs at the cores of galaxies. Pairs of active galactic nuclei (AGN) and binary SMBHs are important stages in the evolution of galaxy mergers, and an intense search for these systems is currently ongoing. In the early and advanced stages of galaxy merging, observations of the triggering of accretion onto one or both BHs inform us about feedback processes and BH growth. Identification of the compact binary SMBHs at parsec and sub-parsec scales provides us with important constraints on the interaction processes that govern the shrinkage of the binary beyond the ``final parsec''. Coalescing binary SMBHs are among the most powerful sources of gravitational waves (GWs) in the universe. Stellar tidal disruption events (TDEs) appear as luminous, transient, accretion flares when part of the stellar material is accreted by the SMBH. About 30 events have been identified by multi-wavelength observations by now, and they will be detected in the thousands in future ground-based or space-based transient surveys. The study of TDEs provides us with a variety of new astrophysical tools and applications, related to fundamental physics or astrophysics. Here, we provide a review of the current status of observations of SMBH pairs and binaries, and TDEs, and discuss astrophysical implications.

  19. THE PHASES DIFFERENTIAL ASTROMETRY DATA ARCHIVE. V. CANDIDATE SUBSTELLAR COMPANIONS TO BINARY SYSTEMS

    SciTech Connect

    Muterspaugh, Matthew W.; Lane, Benjamin F.; Kulkarni, S. R.; Konacki, Maciej; Burke, Bernard F.; Colavita, M. M.; Shao, M.; Hartkopf, William I.; Boss, Alan P.; Williamson, M. E-mail: blane@draper.co

    2010-12-15

    The Palomar High-precision Astrometric Search for Exoplanet Systems monitored 51 subarcsecond binary systems to evaluate whether tertiary companions as small as Jovian planets orbited either the primary or secondary stars, perturbing their otherwise smooth Keplerian motions. Six binaries are presented that show evidence of substellar companions orbiting either the primary or secondary star. Of these six systems, the likelihoods of two of the detected perturbations to represent real objects are considered to be 'high confidence', while the remaining four systems are less certain and will require continued observations for confirmation.

  20. Fault-Tree Compiler Program

    NASA Technical Reports Server (NTRS)

    Butler, Ricky W.; Martensen, Anna L.

    1992-01-01

    FTC, Fault-Tree Compiler program, is reliability-analysis software tool used to calculate probability of top event of fault tree. Five different types of gates allowed in fault tree: AND, OR, EXCLUSIVE OR, INVERT, and M OF N. High-level input language of FTC easy to understand and use. Program supports hierarchical fault-tree-definition feature simplifying process of description of tree and reduces execution time. Solution technique implemented in FORTRAN, and user interface in Pascal. Written to run on DEC VAX computer operating under VMS operating system.

  1. Distributions of cherries for two models of trees.

    PubMed

    McKenzie, A; Steel, M

    2000-03-01

    Null models for generating binary phylogenetic trees are useful for testing evolutionary hypotheses and reconstructing phylogenies. We consider two such null models - the Yule and uniform models - and in particular the induced distribution they generate on the number C(n) of cherries in the tree, where a cherry is a pair of leaves each of which is adjacent to a common ancestor. By realizing the process of cherry formation in these two models by extended Polya urn models we show that C(n) is asymptotically normal. We also give exact formulas for the mean and standard deviation of the C(n) in these two models. This allows simple statistical tests for the Yule and uniform null hypotheses.

  2. Hunting for Optical Companions to Binary Msps in Globular Clusters

    NASA Astrophysics Data System (ADS)

    Ferraro, Francesco

    2009-07-01

    Here we present a proposal which exploits the re-newed potential of HST after the Service Mission 4 for probing the population of binary Millisecond Pulsars {MSPs} in Globular Clusters. In particular we intend to: {1} extend the search for optical counterparts in Terzan 5, by pushing the performance of the WFC3 IR channel to sample the entire MS extension down to M=0.1 Mo; {2} perform a deep multi-band search of MSP companions with the WFC3, in 3 clusters {namely NGC6440, M28 and M5}, where recent radio observations have found particularly interesting objects; {3} derive an accurate radial velocity {with STIS} of the puzzling optical companion COM6266B recently discovered by our group, to firmly assess its cluster membership.This program is the result of a large collaboration among the three major groups {lead by Freire, Ransom and Possenti} which are performing extensive MSP search in GCs in the radio bands, and our group which has a large experience in performing accurate stellar photometry in crowded environments. This collaboration has produced a number of outstanding discoveries. In fact, three of the 6 optical counterparts to binary MSP companions known to date in GCs have been discovered by our group. The observations here proposed would easily double/triple the existing sample of known MSP companions, allowing the first meaningful approach to the study of the formation, evolution and recycling process of pulsar in GCs. Moreover, since most of binary MSPs in GCs are thought to form via stellar interactions in the high density core regions, the determination of the nature of the companion and the incidence of this collisionally induced population has a significant impact on our knowledge of the cluster dynamics. Even more interesting, the study of the optical companions to NSs in GCs allows one to derive tighter constraints {than those obtainable for NS binaries in the Galactic field} on the system properties. This has, in turn, an intrisic importance for

  3. A Generalized Orienteering Problem for Optimal Search and Interdiction Planning

    DTIC Science & Technology

    2013-09-01

    exploit this resource trade-o through a specialized branch -and- bound algorithm that relies on partial path relaxation problems , which often yield tight...computing inexpensive upper bounds based on a binary knapsack problem . This is possible because the arc lengths and rewards are xed values...algorithm that relies on partial path relaxation problems , which often yield tight bounds and lead to substantial pruning in the enumeration tree. We

  4. Global Value Trees

    PubMed Central

    Zhu, Zhen; Puliga, Michelangelo; Cerina, Federica; Chessa, Alessandro; Riccaboni, Massimo

    2015-01-01

    The fragmentation of production across countries has become an important feature of the globalization in recent decades and is often conceptualized by the term “global value chains” (GVCs). When empirically investigating the GVCs, previous studies are mainly interested in knowing how global the GVCs are rather than how the GVCs look like. From a complex networks perspective, we use the World Input-Output Database (WIOD) to study the evolution of the global production system. We find that the industry-level GVCs are indeed not chain-like but are better characterized by the tree topology. Hence, we compute the global value trees (GVTs) for all the industries available in the WIOD. Moreover, we compute an industry importance measure based on the GVTs and compare it with other network centrality measures. Finally, we discuss some future applications of the GVTs. PMID:25978067

  5. Lessons from Darwin: Breeding the Best-fit Binary Star

    NASA Astrophysics Data System (ADS)

    Metcalfe, T. S.

    1998-12-01

    I have developed a procedure utilizing a Genetic-Algorithm-based optimization scheme to fit the observed light curves of an eclipsing binary star with a model produced by the Wilson-Devinney code. The principal advantages of this approach are the objectivity and the uniqueness of the final result. Although this method is more efficient than other comparably global search techniques, the computational requirements of the code are still considerable. I have applied this fitting procedure to my observations of the W UMa type eclipsing binary BH Cassiopeiae. An analysis of V--band CCD data obtained in 1994/95 from Steward Observatory and U-- and B--band photoelectric data obtained in 1996 from McDonald Observatory provided three complete light curves to constrain the fit. In addition, radial velocity curves obtained in 1997 from McDonald Observatory provided a direct measurement of the system mass ratio to restrict the search. The results of the GA-based fit are in excellent agreement with the final orbital solution obtained with the standard differential corrections procedure in the Wilson-Devinney code.

  6. Automated Method for Identification and Artery-Venous Classification of Vessel Trees in Retinal Vessel Networks

    PubMed Central

    Joshi, Vinayak S.; Reinhardt, Joseph M.; Garvin, Mona K.; Abramoff, Michael D.

    2014-01-01

    The separation of the retinal vessel network into distinct arterial and venous vessel trees is of high interest. We propose an automated method for identification and separation of retinal vessel trees in a retinal color image by converting a vessel segmentation image into a vessel segment map and identifying the individual vessel trees by graph search. Orientation, width, and intensity of each vessel segment are utilized to find the optimal graph of vessel segments. The separated vessel trees are labeled as primary vessel or branches. We utilize the separated vessel trees for arterial-venous (AV) classification, based on the color properties of the vessels in each tree graph. We applied our approach to a dataset of 50 fundus images from 50 subjects. The proposed method resulted in an accuracy of 91.44 correctly classified vessel pixels as either artery or vein. The accuracy of correctly classified major vessel segments was 96.42. PMID:24533066

  7. Tree Rings: Timekeepers of the Past.

    ERIC Educational Resources Information Center

    Phipps, R. L.; McGowan, J.

    One of a series of general interest publications on science issues, this booklet describes the uses of tree rings in historical and biological recordkeeping. Separate sections cover the following topics: dating of tree rings, dating with tree rings, tree ring formation, tree ring identification, sample collections, tree ring cross dating, tree…

  8. How To Write a Municipal Tree Ordinance.

    ERIC Educational Resources Information Center

    Fazio, James R., Ed.

    1990-01-01

    At the heart of the Tree City USA program are four basic requirements: The community must have the following: (1) a tree board or department; (2) an annual community forestry program with financial provisions for trees and tree care; (3) an annual Arbor Day proclamation and observance; and (4) a tree ordinance. Sections of a model tree ordinance…

  9. Insert tree completion system

    SciTech Connect

    Brands, K.W.; Ball, I.G.; Cegielski, E.J.; Gresham, J.S.; Saunders, D.N.

    1982-09-01

    This paper outlines the overall project for development and installation of a low-profile, caisson-installed subsea Christmas tree. After various design studies and laboratory and field tests of key components, a system for installation inside a 30-in. conductor was ordered in July 1978 from Cameron Iron Works Inc. The system is designed to have all critical-pressure-containing components below the mudline and, with the reduced profile (height) above seabed, provides for improved safety of satellite underwater wells from damage by anchors, trawl boards, and even icebergs. In addition to the innovative nature of the tree design, the completion includes improved 3 1/2-in. through flowline (TFL) pumpdown completion equipment with deep set safety valves and a dual detachable packer head for simplified workover capability. The all-hydraulic control system incorporates a new design of sequencing valve for both Christmas tree control and remote flowline connection. A semisubmersible drilling rig was used to initiate the first end flowline connection at the wellhead for subsequent tie-in to the prelaid, surface-towed, all-welded subsea pipeline bundle.

  10. Structural regression trees

    SciTech Connect

    Kramer, S.

    1996-12-31

    In many real-world domains the task of machine learning algorithms is to learn a theory for predicting numerical values. In particular several standard test domains used in Inductive Logic Programming (ILP) are concerned with predicting numerical values from examples and relational and mostly non-determinate background knowledge. However, so far no ILP algorithm except one can predict numbers and cope with nondeterminate background knowledge. (The only exception is a covering algorithm called FORS.) In this paper we present Structural Regression Trees (SRT), a new algorithm which can be applied to the above class of problems. SRT integrates the statistical method of regression trees into ILP. It constructs a tree containing a literal (an atomic formula or its negation) or a conjunction of literals in each node, and assigns a numerical value to each leaf. SRT provides more comprehensible results than purely statistical methods, and can be applied to a class of problems most other ILP systems cannot handle. Experiments in several real-world domains demonstrate that the approach is competitive with existing methods, indicating that the advantages are not at the expense of predictive accuracy.

  11. A squirrel searches for food at KSC

    NASA Technical Reports Server (NTRS)

    1999-01-01

    An Eastern gray squirrel pauses in its daily search for food in the Merritt Island National Wildlife Refuge, which shares a boundary with Kennedy Space Center. The Eastern gray squirrel is found in wooded, suburban, and urban areas statewide. It nests in tree hollows or leaf nests in treetops. It forages during the day, mainly early morning and late afternoon, both on the ground and in trees, living on a diet of acorns, nuts, fruits, berries, insects, and bird eggs. Food plants include cypress, buckeyes, elms, grapes, tulip trees, mulberries, and tupelo. It breeds in late winter or early spring and again in late spring or summer, bearing two to six young. The eastern gray squirrel chatters when disturbed. The 92,000-acre wildlife refuge is a habitat for more than 310 species of birds, 25 mammals, 117 fishes and 65 amphibians and reptiles.

  12. Epicormic Branches: a Growth Indicator for the Tropical Forest Tree, Dicorynia guianensis Amshoff (Caesalpiniaceae)

    PubMed Central

    NICOLINI, ERIC; CARAGLIO, YVES; PÉLISSIER, RAPHAËL; LEROY, CELINE; ROGGY, JEAN‐CHRISTOPHE

    2003-01-01

    Architectural analyses of temperate tree species using a chronological approach suggest that the expression of epicormic branches is closely related to low growth rates in the axes that make up the branching system. Therefore, sole consideration of epicormic criteria may be sufficient to identify trees with low secondary growth levels or with both low primary and secondary growth levels. In a tropical tree such as Dicorynia guianensis (basralocus), where chronological studies are difficult, this relationship could be very useful as an easily accessible indicator of growth potentials. A simple method of architectural tree description was used to characterize the global structure of more than 1650 basralocus trees and to evaluate their growth level. Measurements of simple growth characters [height, basal diameter, internode length of submittal part (top of the main axis of the tree)] and the observation of four structural binary descriptors on the main stem (presence of sequential branches and young epicormic branches, state of the submittal part, global orientation), indicated that epicormic branch formation is clearly related to a decrease in length of the successive growth units of the main stem. Analysis of height vs. diameter ratios among different tree subgroups, with and without epicormic branching, suggested that trees with epicormic branches generally have a low level of secondary growth compared with primary growth. PMID:12824071

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

  14. GALAXY ROTATION AND RAPID SUPERMASSIVE BINARY COALESCENCE

    SciTech Connect

    Holley-Bockelmann, Kelly; Khan, Fazeel Mahmood

    2015-09-10

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

  15. Aligning Metabolic Pathways Exploiting Binary Relation of Reactions

    PubMed Central

    Zhong, Cheng; Lin, Hai Xiang; Huang, Jing

    2016-01-01

    Metabolic pathway alignment has been widely used to find one-to-one and/or one-to-many reaction mappings to identify the alternative pathways that have similar functions through different sets of reactions, which has important applications in reconstructing phylogeny and understanding metabolic functions. The existing alignment methods exhaustively search reaction sets, which may become infeasible for large pathways. To address this problem, we present an effective alignment method for accurately extracting reaction mappings between two metabolic pathways. We show that connected relation between reactions can be formalized as binary relation of reactions in metabolic pathways, and the multiplications of zero-one matrices for binary relations of reactions can be accomplished in finite steps. By utilizing the multiplications of zero-one matrices for binary relation of reactions, we efficiently obtain reaction sets in a small number of steps without exhaustive search, and accurately uncover biologically relevant reaction mappings. Furthermore, we introduce a measure of topological similarity of nodes (reactions) by comparing the structural similarity of the k-neighborhood subgraphs of the nodes in aligning metabolic pathways. We employ this similarity metric to improve the accuracy of the alignments. The experimental results on the KEGG database show that when compared with other state-of-the-art methods, in most cases, our method obtains better performance in the node correctness and edge correctness, and the number of the edges of the largest common connected subgraph for one-to-one reaction mappings, and the number of correct one-to-many reaction mappings. Our method is scalable in finding more reaction mappings with better biological relevance in large metabolic pathways. PMID:27936108

  16. A MULTIWAVELENGTH STUDY OF BINARY QUASARS AND THEIR ENVIRONMENTS

    SciTech Connect

    Green, Paul J.; Aldcroft, Thomas L.; Trichas, Markos; Myers, Adam D.; Barkhouse, Wayne A.; Richards, Gordon T.; Ruiz, Angel; Hopkins, Philip F.

    2011-12-10

    We present Chandra X-ray imaging and spectroscopy for 14 quasars in spatially resolved pairs targeted as part of a complete sample of binary quasars with small transverse separations drawn from Sloan Digital Sky Survey (SDSSDR6) photometry. We measure the X-ray properties of all 14 QSOs, and study the distribution of X-ray and optical-to-X-ray power-law indices in these binary quasars. We find no significant difference when compared with large control samples of isolated quasars, true even for SDSS J1254+0846, discussed in detail in a companion paper, which clearly inhabits an ongoing, pre-coalescence galaxy merger showing obvious tidal tails. We present infrared photometry from our observations with SAO Wide-field InfraRed Camera at the MMT, and from the Wide-field Infrared Survey Explorer Preliminary Data Release, and fit simple spectral energy distributions to all 14 QSOs. We find preliminary evidence that substantial contributions from star formation are required, but possibly no more so than for isolated X-ray-detected QSOs. Sensitive searches of the X-ray images for extended emission and the optical images for optical galaxy excess show that these binary QSOs-expected to occur in strong peaks of the dark matter distribution-are not preferentially found in rich cluster environments. While larger binary QSO samples with richer far-IR and submillimeter multiwavelength data might better reveal signatures of merging and triggering, optical color selection of QSO pairs may be biased against such signatures. X-ray and/or variability selection of QSO pairs, while challenging, should be attempted. We present in an Appendix a primer on X-ray flux and luminosity calculations.

  17. The frequency of binary star interlopers amongst transitional discs

    NASA Astrophysics Data System (ADS)

    Ruíz-Rodríguez, D.; Ireland, M.; Cieza, L.; Kraus, A.

    2016-12-01

    Using Non-Redundant Mask interferometry (NRM), we searched for binary companions to objects previously classified as transitional discs (TD). These objects are thought to be an evolutionary stage between an optically thick disc and optically thin disc. We investigate the presence of a stellar companion as a possible mechanism of material depletion in the inner region of these discs, which would rule out an ongoing planetary formation process in distances comparable to the binary separation. For our detection limits, we implement a new method of completeness correction using a combination of randomly sampled binary orbits and Bayesian inference. The selected sample of 24 TDs belongs to the nearby and young star-forming regions: Ophiuchus (˜130 pc), Taurus-Auriga (˜140 pc) and IC348 (˜220 pc). These regions are suitable to resolve faint stellar companions with moderate to high confidence levels at distances as low as 2 au from the central star. With a total of 31 objects, including 11 known TDs and circumbinary discs from the literature, we have found that a fraction of 0.38 ± 0.09 of the SEDs of these objects are likely due to the tidal interaction between a close binary and its disc, while the remaining SEDs are likely the result of other internal processes such as photoevaporation, grain growth, planet-disc interactions. In addition, we detected four companions orbiting outside the area of the truncation radii and propose that the IR excesses of these systems are due to a disc orbiting a secondary companion.

  18. All Bright Cold Classical KBOs are Binary

    NASA Astrophysics Data System (ADS)

    Noll, Keith S.; Parker, Alex H.; Grundy, William M.

    2014-11-01

    When sorted by absolute magnitude as seen in ground based observations, an extremely high fraction of the brightest Cold Classical (CC) Kuiper Belt objects (KBO) are, in fact resolved as binaries when observed at higher angular resolution. Of the 22 CCs brighter than H=6.1 observed by HST, 16 have been found to be binary yielding a binary fraction of 73±10%. When low inclination interlopers from the hot population and close binaries are considered, this very high fraction is consistent with 100% of bright CCs being binary. At fainter absolute magnitudes, this fraction drops to ~20%. Such a situation is a natural outcome of a broken size distribution with a steep drop-off in the number of CCs with individual component diameters larger than 150 km (for an assumed albedo of 0.15). A sharp cutoff in the size distribution for CCs is consistent with formation models that suggest that most planetesimals form at a preferred modal size of order 100 km.The very high fraction of binaries among the largest CCs also serves to limit the separation distribution of KBO binaries. At most, 27% of the brightest CCs are possible unresolved binaries. The apparent power law distribution of binary separation must cut off near the current observational limits of HST ( 1800 km at 43 AU). It is worth noting, however, that this observation does not constrain how many components of resolved binaries may themselves be unresolved multiples like 47171 1999 TC36. Finally, it is important to point out that, when sorted by the size of the primary rather than absolute magnitude of the unresolved pair, the fraction of binaries is relatively constant with size (Nesvorny et al. 2011, AJ 141, 159) eliminating observational bias as cause of the pile up of binaries among the brightest Cold Classical Kuiper Belt objects.The very high fraction of binaries among the brightest CCs appears to be an effect of the underlying CC size distribution.

  19. Exact solutions for species tree inference from discordant gene trees.

    PubMed

    Chang, Wen-Chieh; Górecki, Paweł; Eulenstein, Oliver

    2013-10-01

    Phylogenetic analysis has to overcome the grant challenge of inferring accurate species trees from evolutionary histories of gene families (gene trees) that are discordant with the species tree along whose branches they have evolved. Two well studied approaches to cope with this challenge are to solve either biologically informed gene tree parsimony (GTP) problems under gene duplication, gene loss, and deep coalescence, or the classic RF supertree problem that does not rely on any biological model. Despite the potential of these problems to infer credible species trees, they are NP-hard. Therefore, these problems are addressed by heuristics that typically lack any provable accuracy and precision. We describe fast dynamic programming algorithms that solve the GTP problems and the RF supertree problem exactly, and demonstrate that our algorithms can solve instances with data sets consisting of as many as 22 taxa. Extensions of our algorithms can also report the number of all optimal species trees, as well as the trees themselves. To better asses the quality of the resulting species trees that best fit the given gene trees, we also compute the worst case species trees, their numbers, and optimization score for each of the computational problems. Finally, we demonstrate the performance of our exact algorithms using empirical and simulated data sets, and analyze the quality of heuristic solutions for the studied problems by contrasting them with our exact solutions.

  20. Rate of tree carbon accumulation increases continuously with tree size

    USGS Publications Warehouse

    Stephenson, N.L.; Das, A.J.; Condit, R.; Russo, S.E.; Baker, P.J.; Beckman, N.G.; Coomes, D.A.; Lines, E.R.; Morris, W.K.; Rüger, N.; Álvarez, E.; Blundo, C.; Bunyavejchewin, S.; Chuyong, G.; Davies, S.J.; Duque, Á.; Ewango, C.N.; Flores, O.; Franklin, J.F.; Grau, H.R.; Hao, Z.; Harmon, M.E.; Hubbell, S.P.; Kenfack, D.; Lin, Y.; Makana, J.-R.; Malizia, A.; Malizia, L.R.; Pabst, R.J.; Pongpattananurak, N.; Su, S.-H.; Sun, I-F.; Tan, S.; Thomas, D.; van Mantgem, P.J.; Wang, X.; Wiser, S.K.; Zavala, M.A.

    2014-01-01

    Forests are major components of the global carbon cycle, providing substantial feedback to atmospheric greenhouse gas concentrations. Our ability to understand and predict changes in the forest carbon cycle—particularly net primary productivity and carbon storage - increasingly relies on models that represent biological processes across several scales of biological organization, from tree leaves to forest stands. Yet, despite advances in our understanding of productivity at the scales of leaves and stands, no consensus exists about the nature of productivity at the scale of the individual tree, in part because we lack a broad empirical assessment of whether rates of absolute tree mass growth (and thus carbon accumulation) decrease, remain constant, or increase as trees increase in size and age. Here we present a global analysis of 403 tropical and temperate tree species, showing that for most species mass growth rate increases continuously with tree size. Thus, large, old trees do not act simply as senescent carbon reservoirs but actively fix large amounts of carbon compared to smaller trees; at the extreme, a single big tree can add the same amount of carbon to the forest within a year as is contained in an entire mid-sized tree. The apparent paradoxes of individual tree growth increasing with tree size despite declining leaf-level and stand-level productivity can be explained, respectively, by increases in a tree’s total leaf area that outpace declines in productivity per unit of leaf area and, among other factors, age-related reductions in population density. Our results resolve conflicting assumptions about the nature of tree growth, inform efforts to understand and model forest carbon dynamics, and have additional implications for theories of resource allocation and plant senescence.