Combining binary decision tree and geostatistical methods to estimate snow distribution in a mountain watershed

USGS Publications Warehouse

Balk, Benjamin; Elder, Kelly

2000-01-01

We model the spatial distribution of snow across a mountain basin using an approach that combines binary decision tree and geostatistical techniques. In April 1997 and 1998, intensive snow surveys were conducted in the 6.9‐km2 Loch Vale watershed (LVWS), Rocky Mountain National Park, Colorado. Binary decision trees were used to model the large‐scale variations in snow depth, while the small‐scale variations were modeled through kriging interpolation methods. Binary decision trees related depth to the physically based independent variables of net solar radiation, elevation, slope, and vegetation cover type. These decision tree models explained 54–65% of the observed variance in the depth measurements. The tree‐based modeled depths were then subtracted from the measured depths, and the resulting residuals were spatially distributed across LVWS through kriging techniques. The kriged estimates of the residuals were added to the tree‐based modeled depths to produce a combined depth model. The combined depth estimates explained 60–85% of the variance in the measured depths. Snow densities were mapped across LVWS using regression analysis. Snow‐covered area was determined from high‐resolution aerial photographs. Combining the modeled depths and densities with a snow cover map produced estimates of the spatial distribution of snow water equivalence (SWE). This modeling approach offers improvement over previous methods of estimating SWE distribution in mountain basins.

Two Upper Bounds for the Weighted Path Length of Binary Trees. Report No. UIUCDCS-R-73-565.

ERIC Educational Resources Information Center

Pradels, Jean Louis

Rooted binary trees with weighted nodes are structures encountered in many areas, such as coding theory, searching and sorting, information storage and retrieval. The path length is a meaningful quantity which gives indications about the expected time of a search or the length of a code, for example. In this paper, two sharp bounds for the total…

Binary Trees and Parallel Scheduling Algorithms.

DTIC Science & Technology

1980-09-01

been pro- cessed for p. time units. If a job does not complete by its due time, it is tardy. In a nonpreemptive schedule, job i is scheduled to process...the preemptive schedule obtained by the algorithm of section 2.1.2 also minimizes 5Ti, this problem is easily solved in parallel. When lci is to e...August 1978, pp. 657-661. 14. Horn, W. A., "Some simple scheduling algorithms," Naval Res. Logist . Qur., Vol. 21, pp. 177-185, 1974. i5. Hforowitz, E

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.

Classification and regression tree analysis vs. multivariable linear and logistic regression methods as statistical tools for studying haemophilia.

PubMed

Henrard, S; Speybroeck, N; Hermans, C

2015-11-01

Haemophilia is a rare genetic haemorrhagic disease characterized by partial or complete deficiency of coagulation factor VIII, for haemophilia A, or IX, for haemophilia B. As in any other medical research domain, the field of haemophilia research is increasingly concerned with finding factors associated with binary or continuous outcomes through multivariable models. Traditional models include multiple logistic regressions, for binary outcomes, and multiple linear regressions for continuous outcomes. Yet these regression models are at times difficult to implement, especially for non-statisticians, and can be difficult to interpret. The present paper sought to didactically explain how, why, and when to use classification and regression tree (CART) analysis for haemophilia research. The CART method is non-parametric and non-linear, based on the repeated partitioning of a sample into subgroups based on a certain criterion. Breiman developed this method in 1984. Classification trees (CTs) are used to analyse categorical outcomes and regression trees (RTs) to analyse continuous ones. The CART methodology has become increasingly popular in the medical field, yet only a few examples of studies using this methodology specifically in haemophilia have to date been published. Two examples using CART analysis and previously published in this field are didactically explained in details. There is increasing interest in using CART analysis in the health domain, primarily due to its ease of implementation, use, and interpretation, thus facilitating medical decision-making. This method should be promoted for analysing continuous or categorical outcomes in haemophilia, when applicable. © 2015 John Wiley & Sons Ltd.

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 point detection and descriptor extraction. It is empirically demonstrated that the localization speed is improved by an order of magnitude as compared with state-of-the-art methods, while comparable registration rate and localization accuracy are still maintained.

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.

Method and apparatus for detecting a desired behavior in digital image data

DOEpatents

Kegelmeyer, Jr., W. Philip

1997-01-01

A method for detecting stellate lesions in digitized mammographic image data includes the steps of prestoring a plurality of reference images, calculating a plurality of features for each of the pixels of the reference images, and creating a binary decision tree from features of randomly sampled pixels from each of the reference images. Once the binary decision tree has been created, a plurality of features, preferably including an ALOE feature (analysis of local oriented edges), are calculated for each of the pixels of the digitized mammographic data. Each of these plurality of features of each pixel are input into the binary decision tree and a probability is determined, for each of the pixels, corresponding to the likelihood of the presence of a stellate lesion, to create a probability image. Finally, the probability image is spatially filtered to enforce local consensus among neighboring pixels and the spatially filtered image is output.

Method and apparatus for detecting a desired behavior in digital image data

DOEpatents

Kegelmeyer, Jr., W. Philip

1997-01-01

A method for detecting stellate lesions in digitized mammographic image data includes the steps of prestoring a plurality of reference images, calculating a plurality of features for each of the pixels of the reference images, and creating a binary decision tree from features of randomly sampled pixels from each of the reference images. Once the binary decision tree has been created, a plurality of features, preferably including an ALOE feature (analysis of local oriented edges), are calculated for each of the pixels of the digitized mammographic data. Each of these plurality of features of each pixel are input into the binary decision tree and a probability is determined, for each of the pixels, corresponding to the likelihood of the presence of a stellate lesion, to create a probability image. Finally, the probability image is spacially filtered to enforce local consensus among neighboring pixels and the spacially filtered image is output.

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

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.

An Improved Binary Differential Evolution Algorithm to Infer Tumor Phylogenetic Trees.

PubMed

Liang, Ying; Liao, Bo; Zhu, Wen

2017-01-01

Tumourigenesis is a mutation accumulation process, which is likely to start with a mutated founder cell. The evolutionary nature of tumor development makes phylogenetic models suitable for inferring tumor evolution through genetic variation data. Copy number variation (CNV) is the major genetic marker of the genome with more genes, disease loci, and functional elements involved. Fluorescence in situ hybridization (FISH) accurately measures multiple gene copy number of hundreds of single cells. We propose an improved binary differential evolution algorithm, BDEP, to infer tumor phylogenetic tree based on FISH platform. The topology analysis of tumor progression tree shows that the pathway of tumor subcell expansion varies greatly during different stages of tumor formation. And the classification experiment shows that tree-based features are better than data-based features in distinguishing tumor. The constructed phylogenetic trees have great performance in characterizing tumor development process, which outperforms other similar algorithms.

Computing all hybridization networks for multiple binary phylogenetic input trees.

PubMed

Albrecht, Benjamin

2015-07-30

The computation of phylogenetic trees on the same set of species that are based on different orthologous genes can lead to incongruent trees. One possible explanation for this behavior are interspecific hybridization events recombining genes of different species. An important approach to analyze such events is the computation of hybridization networks. This work presents the first algorithm computing the hybridization number as well as a set of representative hybridization networks for multiple binary phylogenetic input trees on the same set of taxa. To improve its practical runtime, we show how this algorithm can be parallelized. Moreover, we demonstrate the efficiency of the software Hybroscale, containing an implementation of our algorithm, by comparing it to PIRNv2.0, which is so far the best available software computing the exact hybridization number for multiple binary phylogenetic trees on the same set of taxa. The algorithm is part of the software Hybroscale, which was developed specifically for the investigation of hybridization networks including their computation and visualization. Hybroscale is freely available(1) and runs on all three major operating systems. Our simulation study indicates that our approach is on average 100 times faster than PIRNv2.0. Moreover, we show how Hybroscale improves the interpretation of the reported hybridization networks by adding certain features to its graphical representation.

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…

Polynomial algorithms for the Maximal Pairing Problem: efficient phylogenetic targeting on arbitrary trees

PubMed Central

2010-01-01

Background The Maximal Pairing Problem (MPP) is the prototype of a class of combinatorial optimization problems that are of considerable interest in bioinformatics: Given an arbitrary phylogenetic tree T and weights ωxy for the paths between any two pairs of leaves (x, y), what is the collection of edge-disjoint paths between pairs of leaves that maximizes the total weight? Special cases of the MPP for binary trees and equal weights have been described previously; algorithms to solve the general MPP are still missing, however. Results We describe a relatively simple dynamic programming algorithm for the special case of binary trees. We then show that the general case of multifurcating trees can be treated by interleaving solutions to certain auxiliary Maximum Weighted Matching problems with an extension of this dynamic programming approach, resulting in an overall polynomial-time solution of complexity (n4 log n) w.r.t. the number n of leaves. The source code of a C implementation can be obtained under the GNU Public License from http://www.bioinf.uni-leipzig.de/Software/Targeting. For binary trees, we furthermore discuss several constrained variants of the MPP as well as a partition function approach to the probabilistic version of the MPP. Conclusions The algorithms introduced here make it possible to solve the MPP also for large trees with high-degree vertices. This has practical relevance in the field of comparative phylogenetics and, for example, in the context of phylogenetic targeting, i.e., data collection with resource limitations. PMID:20525185

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}/???i

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

A laid-back trip through the Hennigian Forests

PubMed Central

2017-01-01

Background This paper is a comment on the idea of matrix-free Cladistics. Demonstration of this idea’s efficiency is a major goal of the study. Within the proposed framework, the ordinary (phenetic) matrix is necessary only as “source” of Hennigian trees, not as a primary subject of the analysis. Switching from the matrix-based thinking to the matrix-free Cladistic approach clearly reveals that optimizations of the character-state changes are related not to the real processes, but to the form of the data representation. Methods We focused our study on the binary data. We wrote the simple ruby-based script FORESTER version 1.0 that helps represent a binary matrix as an array of the rooted trees (as a “Hennigian forest”). The binary representations of the genomic (DNA) data have been made by script 1001. The Average Consensus method as well as the standard Maximum Parsimony (MP) approach has been used to analyze the data. Principle findings The binary matrix may be easily re-written as a set of rooted trees (maximal relationships). The latter might be analyzed by the Average Consensus method. Paradoxically, this method, if applied to the Hennigian forests, in principle can help to identify clades despite the absence of the direct evidence from the primary data. Our approach may handle the clock- or non clock-like matrices, as well as the hypothetical, molecular or morphological data. Discussion Our proposal clearly differs from the numerous phenetic alignment-free techniques of the construction of the phylogenetic trees. Dealing with the relations, not with the actual “data” also distinguishes our approach from all optimization-based methods, if the optimization is defined as a way to reconstruct the sequences of the character-state changes on a tree, either the standard alignment-based techniques or the “direct” alignment-free procedure. We are not viewing our recent framework as an alternative to the three-taxon statement analysis (3TA), but there are two major differences between our recent proposal and the 3TA, as originally designed and implemented: (1) the 3TA deals with the three-taxon statements or minimal relationships. According to the logic of 3TA, the set of the minimal trees must be established as a binary matrix and used as an input for the parsimony program. In this paper, we operate directly with maximal relationships written just as trees, not as binary matrices, while also using the Average Consensus method instead of the MP analysis. The solely ‘reversal’-based groups can always be found by our method without the separate scoring of the putative reversals before analyses. PMID:28740753

On Tree-Based Phylogenetic Networks.

PubMed

Zhang, Louxin

2016-07-01

A large class of phylogenetic networks can be obtained from trees by the addition of horizontal edges between the tree edges. These networks are called tree-based networks. We present a simple necessary and sufficient condition for tree-based networks and prove that a universal tree-based network exists for any number of taxa that contains as its base every phylogenetic tree on the same set of taxa. This answers two problems posted by Francis and Steel recently. A byproduct is a computer program for generating random binary phylogenetic networks under the uniform distribution model.

A survival tree method for the analysis of discrete event times in clinical and epidemiological studies.

PubMed

Schmid, Matthias; Küchenhoff, Helmut; Hoerauf, Achim; Tutz, Gerhard

2016-02-28

Survival trees are a popular alternative to parametric survival modeling when there are interactions between the predictor variables or when the aim is to stratify patients into prognostic subgroups. A limitation of classical survival tree methodology is that most algorithms for tree construction are designed for continuous outcome variables. Hence, classical methods might not be appropriate if failure time data are measured on a discrete time scale (as is often the case in longitudinal studies where data are collected, e.g., quarterly or yearly). To address this issue, we develop a method for discrete survival tree construction. The proposed technique is based on the result that the likelihood of a discrete survival model is equivalent to the likelihood of a regression model for binary outcome data. Hence, we modify tree construction methods for binary outcomes such that they result in optimized partitions for the estimation of discrete hazard functions. By applying the proposed method to data from a randomized trial in patients with filarial lymphedema, we demonstrate how discrete survival trees can be used to identify clinically relevant patient groups with similar survival behavior. Copyright © 2015 John Wiley & Sons, Ltd.

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.

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…

Identifying messaging completion in a parallel computer by checking for change in message received and transmitted count at each node

DOEpatents

Archer, Charles J [Rochester, MN; Hardwick, Camesha R [Fayetteville, NC; McCarthy, Patrick J [Rochester, MN; Wallenfelt, Brian P [Eden Prairie, MN

2009-06-23

Methods, parallel computers, and products are provided for identifying messaging completion on a parallel computer. The parallel computer includes a plurality of compute nodes, the compute nodes coupled for data communications by at least two independent data communications networks including a binary tree data communications network optimal for collective operations that organizes the nodes as a tree and a torus data communications network optimal for point to point operations that organizes the nodes as a torus. Embodiments include reading all counters at each node of the torus data communications network; calculating at each node a current node value in dependence upon the values read from the counters at each node; and determining for all nodes whether the current node value for each node is the same as a previously calculated node value for each node. If the current node is the same as the previously calculated node value for all nodes of the torus data communications network, embodiments include determining that messaging is complete and if the current node is not the same as the previously calculated node value for all nodes of the torus data communications network, embodiments include determining that messaging is currently incomplete.

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.

All-optical conversion scheme from binary to its MTN form with the help of nonlinear material based tree-net architecture

NASA Astrophysics Data System (ADS)

Maiti, Anup Kumar; Nath Roy, Jitendra; Mukhopadhyay, Sourangshu

2007-08-01

In the field of optical computing and parallel information processing, several number systems have been used for different arithmetic and algebraic operations. Therefore an efficient conversion scheme from one number system to another is very important. Modified trinary number (MTN) has already taken a significant role towards carry and borrow free arithmetic operations. In this communication, we propose a tree-net architecture based all optical conversion scheme from binary number to its MTN form. Optical switch using nonlinear material (NLM) plays an important role.

Kernel and divergence techniques in high energy physics separations

NASA Astrophysics Data System (ADS)

Bouř, Petr; Kůs, Václav; Franc, Jiří

2017-10-01

Binary decision trees under the Bayesian decision technique are used for supervised classification of high-dimensional data. We present a great potential of adaptive kernel density estimation as the nested separation method of the supervised binary divergence decision tree. Also, we provide a proof of alternative computing approach for kernel estimates utilizing Fourier transform. Further, we apply our method to Monte Carlo data set from the particle accelerator Tevatron at DØ experiment in Fermilab and provide final top-antitop signal separation results. We have achieved up to 82 % AUC while using the restricted feature selection entering the signal separation procedure.

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 allocated to a carnivore species, but differentiation between brown bear and a canid species could not be made with certainty. Copyright © 2012 John Wiley & Sons, Ltd.

On the error probability of general tree and trellis codes with applications to sequential decoding

NASA Technical Reports Server (NTRS)

Johannesson, R.

1973-01-01

An upper bound on the average error probability for maximum-likelihood decoding of the ensemble of random binary tree codes is derived and shown to be independent of the length of the tree. An upper bound on the average error probability for maximum-likelihood decoding of the ensemble of random L-branch binary trellis codes of rate R = 1/n is derived which separates the effects of the tail length T and the memory length M of the code. It is shown that the bound is independent of the length L of the information sequence. This implication is investigated by computer simulations of sequential decoding utilizing the stack algorithm. These simulations confirm the implication and further suggest an empirical formula for the true undetected decoding error probability with sequential decoding.

Predicting tree species presence and basal area in Utah: A comparison of stochastic gradient boosting, generalized additive models, and tree-based methods

Treesearch

Gretchen G. Moisen; Elizabeth A. Freeman; Jock A. Blackard; Tracey S. Frescino; Niklaus E. Zimmermann; Thomas C. Edwards

2006-01-01

Many efforts are underway to produce broad-scale forest attribute maps by modelling forest class and structure variables collected in forest inventories as functions of satellite-based and biophysical information. Typically, variants of classification and regression trees implemented in Rulequest's© See5 and Cubist (for binary and continuous responses,...

Identifying hidden rate changes in the evolution of a binary morphological character: the evolution of plant habit in campanulid angiosperms.

PubMed

Beaulieu, Jeremy M; O'Meara, Brian C; Donoghue, Michael J

2013-09-01

The growth of phylogenetic trees in scope and in size is promising from the standpoint of understanding a wide variety of evolutionary patterns and processes. With trees comprised of larger, older, and globally distributed clades, it is likely that the lability of a binary character will differ significantly among lineages, which could lead to errors in estimating transition rates and the associated inference of ancestral states. Here we develop and implement a new method for identifying different rates of evolution in a binary character along different branches of a phylogeny. We illustrate this approach by exploring the evolution of growth habit in Campanulidae, a flowering plant clade containing some 35,000 species. The distribution of woody versus herbaceous species calls into question the use of traditional models of binary character evolution. The recognition and accommodation of changes in the rate of growth form evolution in different lineages demonstrates, for the first time, a robust picture of growth form evolution across a very large, very old, and very widespread flowering plant clade.

Novel ID-based anti-collision approach for RFID

NASA Astrophysics Data System (ADS)

Zhang, De-Gan; Li, Wen-Bin

2016-09-01

Novel correlation ID-based (CID) anti-collision approach for RFID under the banner of the Internet of Things (IOT) has been presented in this paper. The key insights are as follows: according to the deterministic algorithms which are based on the binary search tree, we propose a method to increase the association between tags so that tags can initiatively send their own ID under certain trigger conditions, at the same time, we present a multi-tree search method for querying. When the number of tags is small, by replacing the actual ID with the temporary ID, it can greatly reduce the number of times that the reader reads and writes to tag's ID. Active tags send data to the reader by the way of modulation binary pulses. When applying this method to the uncertain ALOHA algorithms, the reader can determine the locations of the empty slots according to the position of the binary pulse, so it can avoid the decrease in efficiency which is caused by reading empty slots when reading slots. Theory and experiment show that this method can greatly improve the recognition efficiency of the system when applied to either the search tree or the ALOHA anti-collision algorithms.

Decision and Game Theory for Security

NASA Astrophysics Data System (ADS)

Alpcan, Tansu; Buttyán, Levente; Baras, John S.

Attack--defense trees are used to describe security weaknesses of a system and possible countermeasures. In this paper, the connection between attack--defense trees and game theory is made explicit. We show that attack--defense trees and binary zero-sum two-player extensive form games have equivalent expressive power when considering satisfiability, in the sense that they can be converted into each other while preserving their outcome and their internal structure.

Canonical multi-valued input Reed-Muller trees and forms

NASA Technical Reports Server (NTRS)

Perkowski, M. A.; Johnson, P. D.

1991-01-01

There is recently an increased interest in logic synthesis using EXOR gates. The paper introduces the fundamental concept of Orthogonal Expansion, which generalizes the ring form of the Shannon expansion to the logic with multiple-valued (mv) inputs. Based on this concept we are able to define a family of canonical tree circuits. Such circuits can be considered for binary and multiple-valued input cases. They can be multi-level (trees and DAG's) or flattened to two-level AND-EXOR circuits. Input decoders similar to those used in Sum of Products (SOP) PLA's are used in realizations of multiple-valued input functions. In the case of the binary logic the family of flattened AND-EXOR circuits includes several forms discussed by Davio and Green. For the case of the logic with multiple-valued inputs, the family of the flattened mv AND-EXOR circuits includes three expansions known from literature and two new expansions.

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.

Encoding phylogenetic trees in terms of weighted quartets.

PubMed

Grünewald, Stefan; Huber, Katharina T; Moulton, Vincent; Semple, Charles

2008-04-01

One of the main problems in phylogenetics is to develop systematic methods for constructing evolutionary or phylogenetic trees. For a set of species X, an edge-weighted phylogenetic X-tree or phylogenetic tree is a (graph theoretical) tree with leaf set X and no degree 2 vertices, together with a map assigning a non-negative length to each edge of the tree. Within phylogenetics, several methods have been proposed for constructing such trees that work by trying to piece together quartet trees on X, i.e. phylogenetic trees each having four leaves in X. Hence, it is of interest to characterise when a collection of quartet trees corresponds to a (unique) phylogenetic tree. Recently, Dress and Erdös provided such a characterisation for binary phylogenetic trees, that is, phylogenetic trees all of whose internal vertices have degree 3. Here we provide a new characterisation for arbitrary phylogenetic trees.

Accurate reliability analysis method for quantum-dot cellular automata circuits

NASA Astrophysics Data System (ADS)

Cui, Huanqing; Cai, Li; Wang, Sen; Liu, Xiaoqiang; Yang, Xiaokuo

2015-10-01

Probabilistic transfer matrix (PTM) is a widely used model in the reliability research of circuits. However, PTM model cannot reflect the impact of input signals on reliability, so it does not completely conform to the mechanism of the novel field-coupled nanoelectronic device which is called quantum-dot cellular automata (QCA). It is difficult to get accurate results when PTM model is used to analyze the reliability of QCA circuits. To solve this problem, we present the fault tree models of QCA fundamental devices according to different input signals. After that, the binary decision diagram (BDD) is used to quantitatively investigate the reliability of two QCA XOR gates depending on the presented models. By employing the fault tree models, the impact of input signals on reliability can be identified clearly and the crucial components of a circuit can be found out precisely based on the importance values (IVs) of components. So this method is contributive to the construction of reliable QCA circuits.

Avalaunch

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

Moody, A. T.

2014-12-26

Avalaunch implements a tree-based process launcher. It first bootstraps itself on to a set of compute nodes by launching children processes, which immediately connect back to the parent process to acquire info needed t launch their own children. Once the tree is established, user processes are started by broadcasting commands and application binaries through the tree. All communication flows over high-performance network protocols via spawnnet. The goal is to start MPI jobs having hundreds of thousands of processes within seconds.

CSTutor: A Sketch-Based Tool for Visualizing Data Structures

ERIC Educational Resources Information Center

Buchanan, Sarah; Laviola, Joseph J., Jr.

2014-01-01

We present CSTutor, a sketch-based interface designed to help students understand data structures, specifically Linked Lists, Binary Search Trees, AVL Trees, and Heaps. CSTutor creates an environment that seamlessly combines a user's sketched diagram and code. In each of these data structure modes, the user can naturally sketch a data structure on…

Using classification tree analysis to predict oak wilt distribution in Minnesota and Texas

Treesearch

Marla c. Downing; Vernon L. Thomas; Jennifer Juzwik; David N. Appel; Robin M. Reich; Kim Camilli

2008-01-01

We developed a methodology and compared results for predicting the potential distribution of Ceratocystis fagacearum (causal agent of oak wilt), in both Anoka County, MN, and Fort Hood, TX. The Potential Distribution of Oak Wilt (PDOW) utilizes a binary classification tree statistical technique that incorporates: geographical information systems (GIS...

Peculiar spectral statistics of ensembles of trees and star-like graphs

NASA Astrophysics Data System (ADS)

Kovaleva, V.; Maximov, Yu; Nechaev, S.; Valba, O.

2017-07-01

In this paper we investigate the eigenvalue statistics of exponentially weighted ensembles of full binary trees and p-branching star graphs. We show that spectral densities of corresponding adjacency matrices demonstrate peculiar ultrametric structure inherent to sparse systems. In particular, the tails of the distribution for binary trees share the ‘Lifshitz singularity’ emerging in the one-dimensional localization, while the spectral statistics of p-branching star-like graphs is less universal, being strongly dependent on p. The hierarchical structure of spectra of adjacency matrices is interpreted as sets of resonance frequencies, that emerge in ensembles of fully branched tree-like systems, known as dendrimers. However, the relaxational spectrum is not determined by the cluster topology, but has rather the number-theoretic origin, reflecting the peculiarities of the rare-event statistics typical for one-dimensional systems with a quenched structural disorder. The similarity of spectral densities of an individual dendrimer and of an ensemble of linear chains with exponential distribution in lengths, demonstrates that dendrimers could be served as simple disorder-less toy models of one-dimensional systems with quenched disorder.

Universal features of dendrites through centripetal branch ordering

PubMed Central

Effenberger, Felix; Muellerleile, Julia

2017-01-01

Dendrites form predominantly binary trees that are exquisitely embedded in the networks of the brain. While neuronal computation is known to depend on the morphology of dendrites, their underlying topological blueprint remains unknown. Here, we used a centripetal branch ordering scheme originally developed to describe river networks—the Horton-Strahler order (SO)–to examine hierarchical relationships of branching statistics in reconstructed and model dendritic trees. We report on a number of universal topological relationships with SO that are true for all binary trees and distinguish those from SO-sorted metric measures that appear to be cell type-specific. The latter are therefore potential new candidates for categorising dendritic tree structures. Interestingly, we find a faithful correlation of branch diameters with centripetal branch orders, indicating a possible functional importance of SO for dendritic morphology and growth. Also, simulated local voltage responses to synaptic inputs are strongly correlated with SO. In summary, our study identifies important SO-dependent measures in dendritic morphology that are relevant for neural function while at the same time it describes other relationships that are universal for all dendrites. PMID:28671947

A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees.

PubMed

van Iersel, Leo; Kelk, Steven; Lekić, Nela; Scornavacca, Celine

2014-05-05

Reticulate events play an important role in determining evolutionary relationships. The problem of computing the minimum number of such events to explain discordance between two phylogenetic trees is a hard computational problem. Even for binary trees, exact solvers struggle to solve instances with reticulation number larger than 40-50. Here we present CycleKiller and NonbinaryCycleKiller, the first methods to produce solutions verifiably close to optimality for instances with hundreds or even thousands of reticulations. Using simulations, we demonstrate that these algorithms run quickly for large and difficult instances, producing solutions that are very close to optimality. As a spin-off from our simulations we also present TerminusEst, which is the fastest exact method currently available that can handle nonbinary trees: this is used to measure the accuracy of the NonbinaryCycleKiller algorithm. All three methods are based on extensions of previous theoretical work (SIDMA 26(4):1635-1656, TCBB 10(1):18-25, SIDMA 28(1):49-66) and are publicly available. We also apply our methods to real data.

Peculiar spectral statistics of ensembles of trees and star-like graphs

DOE PAGES

Kovaleva, V.; Maximov, Yu; Nechaev, S.; ...

2017-07-11

In this paper we investigate the eigenvalue statistics of exponentially weighted ensembles of full binary trees and p-branching star graphs. We show that spectral densities of corresponding adjacency matrices demonstrate peculiar ultrametric structure inherent to sparse systems. In particular, the tails of the distribution for binary trees share the \\Lifshitz singularity" emerging in the onedimensional localization, while the spectral statistics of p-branching star-like graphs is less universal, being strongly dependent on p. The hierarchical structure of spectra of adjacency matrices is interpreted as sets of resonance frequencies, that emerge in ensembles of fully branched tree-like systems, known as dendrimers. However,more » the relaxational spectrum is not determined by the cluster topology, but has rather the number-theoretic origin, re ecting the peculiarities of the rare-event statistics typical for one-dimensional systems with a quenched structural disorder. The similarity of spectral densities of an individual dendrimer and of ensemble of linear chains with exponential distribution in lengths, demonstrates that dendrimers could be served as simple disorder-less toy models of one-dimensional systems with quenched disorder.« less

Peculiar spectral statistics of ensembles of trees and star-like graphs

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

Kovaleva, V.; Maximov, Yu; Nechaev, S.

In this paper we investigate the eigenvalue statistics of exponentially weighted ensembles of full binary trees and p-branching star graphs. We show that spectral densities of corresponding adjacency matrices demonstrate peculiar ultrametric structure inherent to sparse systems. In particular, the tails of the distribution for binary trees share the \\Lifshitz singularity" emerging in the onedimensional localization, while the spectral statistics of p-branching star-like graphs is less universal, being strongly dependent on p. The hierarchical structure of spectra of adjacency matrices is interpreted as sets of resonance frequencies, that emerge in ensembles of fully branched tree-like systems, known as dendrimers. However,more » the relaxational spectrum is not determined by the cluster topology, but has rather the number-theoretic origin, re ecting the peculiarities of the rare-event statistics typical for one-dimensional systems with a quenched structural disorder. The similarity of spectral densities of an individual dendrimer and of ensemble of linear chains with exponential distribution in lengths, demonstrates that dendrimers could be served as simple disorder-less toy models of one-dimensional systems with quenched disorder.« less

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.

Classification of Different Degrees of Disability Following Intracerebral Hemorrhage: A Decision Tree Analysis from VISTA-ICH Collaboration.

PubMed

Phan, Thanh G; Chen, Jian; Beare, Richard; Ma, Henry; Clissold, Benjamin; Van Ly, John; Srikanth, Velandai

2017-01-01

Prognostication following intracerebral hemorrhage (ICH) has focused on poor outcome at the expense of lumping together mild and moderate disability. We aimed to develop a novel approach at classifying a range of disability following ICH. The Virtual International Stroke Trial Archive collaboration database was searched for patients with ICH and known volume of ICH on baseline CT scans. Disability was partitioned into mild [modified Rankin Scale (mRS) at 90 days of 0-2], moderate (mRS = 3-4), and severe disabilities (mRS = 5-6). We used binary and trichotomy decision tree methodology. The data were randomly divided into training (2/3 of data) and validation (1/3 data) datasets. The area under the receiver operating characteristic curve (AUC) was used to calculate the accuracy of the decision tree model. We identified 957 patients, age 65.9 ± 12.3 years, 63.7% males, and ICH volume 22.6 ± 22.1 ml. The binary tree showed that lower ICH volume (<13.7 ml), age (<66.5 years), serum glucose (<8.95 mmol/l), and systolic blood pressure (<170 mm Hg) discriminate between mild versus moderate-to-severe disabilities with AUC of 0.79 (95% CI 0.73-0.85). Large ICH volume (>27.9 ml), older age (>69.5 years), and low Glasgow Coma Scale (<15) classify severe disability with AUC of 0.80 (95% CI 0.75-0.86). The trichotomy tree showed that ICH volume, age, and serum glucose can separate mild, moderate, and severe disability groups with AUC 0.79 (95% CI 0.71-0.87). Both the binary and trichotomy methods provide equivalent discrimination of disability outcome after ICH. The trichotomy method can classify three categories at once, whereas this action was not possible with the binary method. The trichotomy method may be of use to clinicians and trialists for classifying a range of disability in ICH.

The coalescent of a sample from a binary branching process.

PubMed

Lambert, Amaury

2018-04-25

At time 0, start a time-continuous binary branching process, where particles give birth to a single particle independently (at a possibly time-dependent rate) and die independently (at a possibly time-dependent and age-dependent rate). A particular case is the classical birth-death process. Stop this process at time T>0. It is known that the tree spanned by the N tips alive at time T of the tree thus obtained (called a reduced tree or coalescent tree) is a coalescent point process (CPP), which basically means that the depths of interior nodes are independent and identically distributed (iid). Now select each of the N tips independently with probability y (Bernoulli sample). It is known that the tree generated by the selected tips, which we will call the Bernoulli sampled CPP, is again a CPP. Now instead, select exactly k tips uniformly at random among the N tips (a k-sample). We show that the tree generated by the selected tips is a mixture of Bernoulli sampled CPPs with the same parent CPP, over some explicit distribution of the sampling probability y. An immediate consequence is that the genealogy of a k-sample can be obtained by the realization of k random variables, first the random sampling probability Y and then the k-1 node depths which are iid conditional on Y=y. Copyright © 2018. Published by Elsevier Inc.

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…

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

PubMed

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

2017-03-01

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

Two Dimensional Path Planning with Obstacles and Shadows.

DTIC Science & Technology

1987-01-01

22060College Park, MD 20742 8la NAME OF FUNDING/SPONSORING Bb. OFFICE SYMBOL 9. PROCUREMENT INSTRUMENT IDENTIFICATION NUMBER •" " .N!ZATION f (If...quadtree is a tip node (if the tree . It represents a tinifirmly c(olored -Iq tiare region of the picture. A gray n()de ()f the (tii tree is a nd((e...Sight Algorithm traversal of the quadtree, they can be sorted using a binary tree by their relative location on the line of sight, given by the x or y

Study on the Secant Segmentation Algorithm of Rubber Tree

NASA Astrophysics Data System (ADS)

Li, Shute; Zhang, Jie; Zhang, Jian; Sun, Liang; Liu, Yongna

2018-04-01

Natural rubber is one of the most important materials in the national defense and industry, and the tapping panel dryness (TPD) of the rubber tree is one of the most serious diseases that affect the production of rubber. Although considerable progress has been made in the more than 100 years of research on the TPD, there are still many areas to be improved. At present, the method of artificial observation is widely used to identify TPD, but the diversity of rubber tree secant symptoms leads to the inaccurate judgement of the level of TPD. In this paper, image processing technology is used to separate the secant and latex, so that we can get rid of the interference factors, get the exact secant and latex binary image. By calculating the area ratio of the corresponding binary images, the grade of TPD can be classified accurately. and can also provide an objective basis for the accurate identification of the tapping panel dryness (TPD) level.

Binary-space-partitioned images for resolving image-based visibility.

PubMed

Fu, Chi-Wing; Wong, Tien-Tsin; Tong, Wai-Shun; Tang, Chi-Keung; Hanson, Andrew J

2004-01-01

We propose a novel 2D representation for 3D visibility sorting, the Binary-Space-Partitioned Image (BSPI), to accelerate real-time image-based rendering. BSPI is an efficient 2D realization of a 3D BSP tree, which is commonly used in computer graphics for time-critical visibility sorting. Since the overall structure of a BSP tree is encoded in a BSPI, traversing a BSPI is comparable to traversing the corresponding BSP tree. BSPI performs visibility sorting efficiently and accurately in the 2D image space by warping the reference image triangle-by-triangle instead of pixel-by-pixel. Multiple BSPIs can be combined to solve "disocclusion," when an occluded portion of the scene becomes visible at a novel viewpoint. Our method is highly automatic, including a tensor voting preprocessing step that generates candidate image partition lines for BSPIs, filters the noisy input data by rejecting outliers, and interpolates missing information. Our system has been applied to a variety of real data, including stereo, motion, and range images.

SVM-based tree-type neural networks as a critic in adaptive critic designs for control.

PubMed

Deb, Alok Kanti; Jayadeva; Gopal, Madan; Chandra, Suresh

2007-07-01

In this paper, we use the approach of adaptive critic design (ACD) for control, specifically, the action-dependent heuristic dynamic programming (ADHDP) method. A least squares support vector machine (SVM) regressor has been used for generating the control actions, while an SVM-based tree-type neural network (NN) is used as the critic. After a failure occurs, the critic and action are retrained in tandem using the failure data. Failure data is binary classification data, where the number of failure states are very few as compared to the number of no-failure states. The difficulty of conventional multilayer feedforward NNs in learning this type of classification data has been overcome by using the SVM-based tree-type NN, which due to its feature to add neurons to learn misclassified data, has the capability to learn any binary classification data without a priori choice of the number of neurons or the structure of the network. The capability of the trained controller to handle unforeseen situations is demonstrated.

Reconstructing Unrooted Phylogenetic Trees from Symbolic Ternary Metrics.

PubMed

Grünewald, Stefan; Long, Yangjing; Wu, Yaokun

2018-03-09

Böcker and Dress (Adv Math 138:105-125, 1998) presented a 1-to-1 correspondence between symbolically dated rooted trees and symbolic ultrametrics. We consider the corresponding problem for unrooted trees. More precisely, given a tree T with leaf set X and a proper vertex coloring of its interior vertices, we can map every triple of three different leaves to the color of its median vertex. We characterize all ternary maps that can be obtained in this way in terms of 4- and 5-point conditions, and we show that the corresponding tree and its coloring can be reconstructed from a ternary map that satisfies those conditions. Further, we give an additional condition that characterizes whether the tree is binary, and we describe an algorithm that reconstructs general trees in a bottom-up fashion.

Using Educational Games and Simulation Software in a Computer Science Course: Learning Achievements and Student Flow Experiences

ERIC Educational Resources Information Center

Liu, Tsung-Yu

2016-01-01

This study investigates how educational games impact on students' academic performance and multimedia flow experiences in a computer science course. A curriculum consists of five basic learning units, that is, the stack, queue, sort, tree traversal, and binary search tree, was conducted for 110 university students during one semester. Two groups…

Soft context clustering for F0 modeling in HMM-based speech synthesis

NASA Astrophysics Data System (ADS)

Khorram, Soheil; Sameti, Hossein; King, Simon

2015-12-01

This paper proposes the use of a new binary decision tree, which we call a soft decision tree, to improve generalization performance compared to the conventional `hard' decision tree method that is used to cluster context-dependent model parameters in statistical parametric speech synthesis. We apply the method to improve the modeling of fundamental frequency, which is an important factor in synthesizing natural-sounding high-quality speech. Conventionally, hard decision tree-clustered hidden Markov models (HMMs) are used, in which each model parameter is assigned to a single leaf node. However, this `divide-and-conquer' approach leads to data sparsity, with the consequence that it suffers from poor generalization, meaning that it is unable to accurately predict parameters for models of unseen contexts: the hard decision tree is a weak function approximator. To alleviate this, we propose the soft decision tree, which is a binary decision tree with soft decisions at the internal nodes. In this soft clustering method, internal nodes select both their children with certain membership degrees; therefore, each node can be viewed as a fuzzy set with a context-dependent membership function. The soft decision tree improves model generalization and provides a superior function approximator because it is able to assign each context to several overlapped leaves. In order to use such a soft decision tree to predict the parameters of the HMM output probability distribution, we derive the smoothest (maximum entropy) distribution which captures all partial first-order moments and a global second-order moment of the training samples. Employing such a soft decision tree architecture with maximum entropy distributions, a novel speech synthesis system is trained using maximum likelihood (ML) parameter re-estimation and synthesis is achieved via maximum output probability parameter generation. In addition, a soft decision tree construction algorithm optimizing a log-likelihood measure is developed. Both subjective and objective evaluations were conducted and indicate a considerable improvement over the conventional method.

The transmission process: A combinatorial stochastic process for the evolution of transmission trees over networks.

PubMed

Sainudiin, Raazesh; Welch, David

2016-12-07

We derive a combinatorial stochastic process for the evolution of the transmission tree over the infected vertices of a host contact network in a susceptible-infected (SI) model of an epidemic. Models of transmission trees are crucial to understanding the evolution of pathogen populations. We provide an explicit description of the transmission process on the product state space of (rooted planar ranked labelled) binary transmission trees and labelled host contact networks with SI-tags as a discrete-state continuous-time Markov chain. We give the exact probability of any transmission tree when the host contact network is a complete, star or path network - three illustrative examples. We then develop a biparametric Beta-splitting model that directly generates transmission trees with exact probabilities as a function of the model parameters, but without explicitly modelling the underlying contact network, and show that for specific values of the parameters we can recover the exact probabilities for our three example networks through the Markov chain construction that explicitly models the underlying contact network. We use the maximum likelihood estimator (MLE) to consistently infer the two parameters driving the transmission process based on observations of the transmission trees and use the exact MLE to characterize equivalence classes over the space of contact networks with a single initial infection. An exploratory simulation study of the MLEs from transmission trees sampled from three other deterministic and four random families of classical contact networks is conducted to shed light on the relation between the MLEs of these families with some implications for statistical inference along with pointers to further extensions of our models. The insights developed here are also applicable to the simplest models of "meme" evolution in online social media networks through transmission events that can be distilled from observable actions such as "likes", "mentions", "retweets" and "+1s" along with any concomitant comments. Copyright © 2016 The Authors. Published by Elsevier Ltd.. All rights reserved.

Redundancy management for efficient fault recovery in NASA's distributed computing system

NASA Technical Reports Server (NTRS)

Malek, Miroslaw; Pandya, Mihir; Yau, Kitty

1991-01-01

The management of redundancy in computer systems was studied and guidelines were provided for the development of NASA's fault-tolerant distributed systems. Fault recovery and reconfiguration mechanisms were examined. A theoretical foundation was laid for redundancy management by efficient reconfiguration methods and algorithmic diversity. Algorithms were developed to optimize the resources for embedding of computational graphs of tasks in the system architecture and reconfiguration of these tasks after a failure has occurred. The computational structure represented by a path and the complete binary tree was considered and the mesh and hypercube architectures were targeted for their embeddings. The innovative concept of Hybrid Algorithm Technique was introduced. This new technique provides a mechanism for obtaining fault tolerance while exhibiting improved performance.

Universal artifacts affect the branching of phylogenetic trees, not universal scaling laws.

PubMed

Altaba, Cristian R

2009-01-01

The superficial resemblance of phylogenetic trees to other branching structures allows searching for macroevolutionary patterns. However, such trees are just statistical inferences of particular historical events. Recent meta-analyses report finding regularities in the branching pattern of phylogenetic trees. But is this supported by evidence, or are such regularities just methodological artifacts? If so, is there any signal in a phylogeny? In order to evaluate the impact of polytomies and imbalance on tree shape, the distribution of all binary and polytomic trees of up to 7 taxa was assessed in tree-shape space. The relationship between the proportion of outgroups and the amount of imbalance introduced with them was assessed applying four different tree-building methods to 100 combinations from a set of 10 ingroup and 9 outgroup species, and performing covariance analyses. The relevance of this analysis was explored taking 61 published phylogenies, based on nucleic acid sequences and involving various taxa, taxonomic levels, and tree-building methods. All methods of phylogenetic inference are quite sensitive to the artifacts introduced by outgroups. However, published phylogenies appear to be subject to a rather effective, albeit rather intuitive control against such artifacts. The data and methods used to build phylogenetic trees are varied, so any meta-analysis is subject to pitfalls due to their uneven intrinsic merits, which translate into artifacts in tree shape. The binary branching pattern is an imposition of methods, and seldom reflects true relationships in intraspecific analyses, yielding artifactual polytomies in short trees. Above the species level, the departure of real trees from simplistic random models is caused at least by two natural factors--uneven speciation and extinction rates; and artifacts such as choice of taxa included in the analysis, and imbalance introduced by outgroups and basal paraphyletic taxa. This artifactual imbalance accounts for tree shape convergence of large trees. There is no evidence for any universal scaling in the tree of life. Instead, there is a need for improved methods of tree analysis that can be used to discriminate the noise due to outgroups from the phylogenetic signal within the taxon of interest, and to evaluate realistic models of evolution, correcting the retrospective perspective and explicitly recognizing extinction as a driving force. Artifacts are pervasive, and can only be overcome through understanding the structure and biological meaning of phylogenetic trees. Catalan Abstract in Translation S1.

Binary Classification using Decision Tree based Genetic Programming and Its Application to Analysis of Bio-mass Data

NASA Astrophysics Data System (ADS)

To, Cuong; Pham, Tuan D.

2010-01-01

In machine learning, pattern recognition may be the most popular task. "Similar" patterns identification is also very important in biology because first, it is useful for prediction of patterns associated with disease, for example cancer tissue (normal or tumor); second, similarity or dissimilarity of the kinetic patterns is used to identify coordinately controlled genes or proteins involved in the same regulatory process. Third, similar genes (proteins) share similar functions. In this paper, we present an algorithm which uses genetic programming to create decision tree for binary classification problem. The application of the algorithm was implemented on five real biological databases. Base on the results of comparisons with well-known methods, we see that the algorithm is outstanding in most of cases.

Genetic Algorithms and Classification Trees in Feature Discovery: Diabetes and the NHANES database

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

Heredia-Langner, Alejandro; Jarman, Kristin H.; Amidan, Brett G.

2013-09-01

This paper presents a feature selection methodology that can be applied to datasets containing a mixture of continuous and categorical variables. Using a Genetic Algorithm (GA), this method explores a dataset and selects a small set of features relevant for the prediction of a binary (1/0) response. Binary classification trees and an objective function based on conditional probabilities are used to measure the fitness of a given subset of features. The method is applied to health data in order to find factors useful for the prediction of diabetes. Results show that our algorithm is capable of narrowing down the setmore » of predictors to around 8 factors that can be validated using reputable medical and public health resources.« less

Multistage classification of multispectral Earth observational data: The design approach

NASA Technical Reports Server (NTRS)

Bauer, M. E. (Principal Investigator); Muasher, M. J.; Landgrebe, D. A.

1981-01-01

An algorithm is proposed which predicts the optimal features at every node in a binary tree procedure. The algorithm estimates the probability of error by approximating the area under the likelihood ratio function for two classes and taking into account the number of training samples used in estimating each of these two classes. Some results on feature selection techniques, particularly in the presence of a very limited set of training samples, are presented. Results comparing probabilities of error predicted by the proposed algorithm as a function of dimensionality as compared to experimental observations are shown for aircraft and LANDSAT data. Results are obtained for both real and simulated data. Finally, two binary tree examples which use the algorithm are presented to illustrate the usefulness of the procedure.

Permutation parity machines for neural cryptography.

PubMed

Reyes, Oscar Mauricio; Zimmermann, Karl-Heinz

2010-06-01

Recently, synchronization was proved for permutation parity machines, multilayer feed-forward neural networks proposed as a binary variant of the tree parity machines. This ability was already used in the case of tree parity machines to introduce a key-exchange protocol. In this paper, a protocol based on permutation parity machines is proposed and its performance against common attacks (simple, geometric, majority and genetic) is studied.

Permutation parity machines for neural cryptography

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

Reyes, Oscar Mauricio; Escuela de Ingenieria Electrica, Electronica y Telecomunicaciones, Universidad Industrial de Santander, Bucaramanga; Zimmermann, Karl-Heinz

2010-06-15

Recently, synchronization was proved for permutation parity machines, multilayer feed-forward neural networks proposed as a binary variant of the tree parity machines. This ability was already used in the case of tree parity machines to introduce a key-exchange protocol. In this paper, a protocol based on permutation parity machines is proposed and its performance against common attacks (simple, geometric, majority and genetic) is studied.

Nonbinary Tree-Based Phylogenetic Networks.

PubMed

Jetten, Laura; van Iersel, Leo

2018-01-01

Rooted phylogenetic networks are used to describe evolutionary histories that contain non-treelike evolutionary events such as hybridization and horizontal gene transfer. In some cases, such histories can be described by a phylogenetic base-tree with additional linking arcs, which can, for example, represent gene transfer events. Such phylogenetic networks are called tree-based. Here, we consider two possible generalizations of this concept to nonbinary networks, which we call tree-based and strictly-tree-based nonbinary phylogenetic networks. We give simple graph-theoretic characterizations of tree-based and strictly-tree-based nonbinary phylogenetic networks. Moreover, we show for each of these two classes that it can be decided in polynomial time whether a given network is contained in the class. Our approach also provides a new view on tree-based binary phylogenetic networks. Finally, we discuss two examples of nonbinary phylogenetic networks in biology and show how our results can be applied to them.

Spatial properties of snow cover in the Upper Merced River Basin: implications for a distributed snow measurement network

NASA Astrophysics Data System (ADS)

Bouffon, T.; Rice, R.; Bales, R.

2006-12-01

The spatial distributions of snow water equivalent (SWE) and snow depth within a 1, 4, and 16 km2 grid element around two automated snow pillows in a forested and open- forested region of the Upper Merced River Basin (2,800 km2) of Yosemite National Park were characterized using field observations and analyzed using binary regression trees. Snow surveys occurred at the forested site during the accumulation and ablation seasons, while at the open-forest site a survey was performed only during the accumulation season. An average of 130 snow depth and 7 snow density measurements were made on each survey, within the 4 km2 grid. Snow depth was distributed using binary regression trees and geostatistical methods using the physiographic parameters (e.g. elevation, slope, vegetation, aspect). Results in the forest region indicate that the snow pillow overestimated average SWE within the 1, 4, and 16 km2 areas by 34 percent during ablation, but during accumulation the snow pillow provides a good estimate of the modeled mean SWE grid value, however it is suspected that the snow pillow was underestimating SWE. However, at the open forest site, during accumulation, the snow pillow was 28 percent greater than the mean modeled grid element. In addition, the binary regression trees indicate that the independent variables of vegetation, slope, and aspect are the most influential parameters of snow depth distribution. The binary regression tree and multivariate linear regression models explain about 60 percent of the initial variance for snow depth and 80 percent for density, respectively. This short-term study provides motivation and direction for the installation of a distributed snow measurement network to fill the information gap in basin-wide SWE and snow depth measurements. Guided by these results, a distributed snow measurement network was installed in the Fall 2006 at Gin Flat in the Upper Merced River Basin with the specific objective of measuring accumulation and ablation across topographic variables with the aim of providing guidance for future larger scale observation network designs.

Decision tree modeling using R.

PubMed

Zhang, Zhongheng

2016-08-01

In machine learning field, decision tree learner is powerful and easy to interpret. It employs recursive binary partitioning algorithm that splits the sample in partitioning variable with the strongest association with the response variable. The process continues until some stopping criteria are met. In the example I focus on conditional inference tree, which incorporates tree-structured regression models into conditional inference procedures. While growing a single tree is subject to small changes in the training data, random forests procedure is introduced to address this problem. The sources of diversity for random forests come from the random sampling and restricted set of input variables to be selected. Finally, I introduce R functions to perform model based recursive partitioning. This method incorporates recursive partitioning into conventional parametric model building.

Efficient Decoding of Compressed Data.

ERIC Educational Resources Information Center

Bassiouni, Mostafa A.; Mukherjee, Amar

1995-01-01

Discusses the problem of enhancing the speed of Huffman decoding of compressed data. Topics addressed include the Huffman decoding tree; multibit decoding; binary string mapping problems; and algorithms for solving mapping problems. (22 references) (LRW)

Stereo-vision-based terrain mapping for off-road autonomous navigation

NASA Astrophysics Data System (ADS)

Rankin, Arturo L.; Huertas, Andres; Matthies, Larry H.

2009-05-01

Successful off-road autonomous navigation by an unmanned ground vehicle (UGV) requires reliable perception and representation of natural terrain. While perception algorithms are used to detect driving hazards, terrain mapping algorithms are used to represent the detected hazards in a world model a UGV can use to plan safe paths. There are two primary ways to detect driving hazards with perception sensors mounted to a UGV: binary obstacle detection and traversability cost analysis. Binary obstacle detectors label terrain as either traversable or non-traversable, whereas, traversability cost analysis assigns a cost to driving over a discrete patch of terrain. In uncluttered environments where the non-obstacle terrain is equally traversable, binary obstacle detection is sufficient. However, in cluttered environments, some form of traversability cost analysis is necessary. The Jet Propulsion Laboratory (JPL) has explored both approaches using stereo vision systems. A set of binary detectors has been implemented that detect positive obstacles, negative obstacles, tree trunks, tree lines, excessive slope, low overhangs, and water bodies. A compact terrain map is built from each frame of stereo images. The mapping algorithm labels cells that contain obstacles as nogo regions, and encodes terrain elevation, terrain classification, terrain roughness, traversability cost, and a confidence value. The single frame maps are merged into a world map where temporal filtering is applied. In previous papers, we have described our perception algorithms that perform binary obstacle detection. In this paper, we summarize the terrain mapping capabilities that JPL has implemented during several UGV programs over the last decade and discuss some challenges to building terrain maps with stereo range data.

Stereo Vision Based Terrain Mapping for Off-Road Autonomous Navigation

NASA Technical Reports Server (NTRS)

Rankin, Arturo L.; Huertas, Andres; Matthies, Larry H.

2009-01-01

Successful off-road autonomous navigation by an unmanned ground vehicle (UGV) requires reliable perception and representation of natural terrain. While perception algorithms are used to detect driving hazards, terrain mapping algorithms are used to represent the detected hazards in a world model a UGV can use to plan safe paths. There are two primary ways to detect driving hazards with perception sensors mounted to a UGV: binary obstacle detection and traversability cost analysis. Binary obstacle detectors label terrain as either traversable or non-traversable, whereas, traversability cost analysis assigns a cost to driving over a discrete patch of terrain. In uncluttered environments where the non-obstacle terrain is equally traversable, binary obstacle detection is sufficient. However, in cluttered environments, some form of traversability cost analysis is necessary. The Jet Propulsion Laboratory (JPL) has explored both approaches using stereo vision systems. A set of binary detectors has been implemented that detect positive obstacles, negative obstacles, tree trunks, tree lines, excessive slope, low overhangs, and water bodies. A compact terrain map is built from each frame of stereo images. The mapping algorithm labels cells that contain obstacles as no-go regions, and encodes terrain elevation, terrain classification, terrain roughness, traversability cost, and a confidence value. The single frame maps are merged into a world map where temporal filtering is applied. In previous papers, we have described our perception algorithms that perform binary obstacle detection. In this paper, we summarize the terrain mapping capabilities that JPL has implemented during several UGV programs over the last decade and discuss some challenges to building terrain maps with stereo range data.

A Sequence of Sorting Strategies.

ERIC Educational Resources Information Center

Duncan, David R.; Litwiller, Bonnie H.

1984-01-01

Describes eight increasingly sophisticated and efficient sorting algorithms including linear insertion, binary insertion, shellsort, bubble exchange, shakersort, quick sort, straight selection, and tree selection. Provides challenges for the reader and the student to program these efficiently. (JM)

Optimum Array Processing for Detecting Binary Signals Corrupted by Directional Interference.

DTIC Science & Technology

1972-12-01

specific cases. Two different series representations of a vector random process are discussed in Van Trees [3]. These two methods both require the... spaci ~ng d, etc.) its detection error represents a lower bound for the performance that might be obtained with other types of array processing (such...Middleton, Introduction to Statistical Communication Theory, New York: McGraw-Hill, 1960. 3. H.L. Van Trees , Detection, Estimation, and Modulation Theory

On the relationship between parallel computation and graph embedding

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

Gupta, A.K.

1989-01-01

The problem of efficiently simulating an algorithm designed for an n-processor parallel machine G on an m-processor parallel machine H with n > m arises when parallel algorithms designed for an ideal size machine are simulated on existing machines which are of a fixed size. The author studies this problem when every processor of H takes over the function of a number of processors in G, and he phrases the simulation problem as a graph embedding problem. New embeddings presented address relevant issues arising from the parallel computation environment. The main focus centers around embedding complete binary trees into smaller-sizedmore » binary trees, butterflies, and hypercubes. He also considers simultaneous embeddings of r source machines into a single hypercube. Constant factors play a crucial role in his embeddings since they are not only important in practice but also lead to interesting theoretical problems. All of his embeddings minimize dilation and load, which are the conventional cost measures in graph embeddings and determine the maximum amount of time required to simulate one step of G on H. His embeddings also optimize a new cost measure called ({alpha},{beta})-utilization which characterizes how evenly the processors of H are used by the processors of G. Ideally, the utilization should be balanced (i.e., every processor of H simulates at most (n/m) processors of G) and the ({alpha},{beta})-utilization measures how far off from a balanced utilization the embedding is. He presents embeddings for the situation when some processors of G have different capabilities (e.g. memory or I/O) than others and the processors with different capabilities are to be distributed uniformly among the processors of H. Placing such conditions on an embedding results in an increase in some of the cost measures.« less

Nodal distances for rooted phylogenetic trees.

PubMed

Cardona, Gabriel; Llabrés, Mercè; Rosselló, Francesc; Valiente, Gabriel

2010-08-01

Dissimilarity measures for (possibly weighted) phylogenetic trees based on the comparison of their vectors of path lengths between pairs of taxa, have been present in the systematics literature since the early seventies. For rooted phylogenetic trees, however, these vectors can only separate non-weighted binary trees, and therefore these dissimilarity measures are metrics only on this class of rooted phylogenetic trees. In this paper we overcome this problem, by splitting in a suitable way each path length between two taxa into two lengths. We prove that the resulting splitted path lengths matrices single out arbitrary rooted phylogenetic trees with nested taxa and arcs weighted in the set of positive real numbers. This allows the definition of metrics on this general class of rooted phylogenetic trees by comparing these matrices through metrics in spaces M(n)(R) of real-valued n x n matrices. We conclude this paper by establishing some basic facts about the metrics for non-weighted phylogenetic trees defined in this way using L(p) metrics on M(n)(R), with p [epsilon] R(>0).

An efficient indexing scheme for binary feature based biometric database

NASA Astrophysics Data System (ADS)

Gupta, P.; Sana, A.; Mehrotra, H.; Hwang, C. Jinshong

2007-04-01

The paper proposes an efficient indexing scheme for binary feature template using B+ tree. In this scheme the input image is decomposed into approximation, vertical, horizontal and diagonal coefficients using the discrete wavelet transform. The binarized approximation coefficient at second level is divided into four quadrants of equal size and Hamming distance (HD) for each quadrant with respect to sample template of all ones is measured. This HD value of each quadrant is used to generate upper and lower range values which are inserted into B+ tree. The nodes of tree at first level contain the lower and upper range values generated from HD of first quadrant. Similarly, lower and upper range values for the three quadrants are stored in the second, third and fourth level respectively. Finally leaf node contains the set of identifiers. At the time of identification, the test image is used to generate HD for four quadrants. Then the B+ tree is traversed based on the value of HD at every node and terminates to leaf nodes with set of identifiers. The feature vector for each identifier is retrieved from the particular bin of secondary memory and matched with test feature template to get top matches. The proposed scheme is implemented on ear biometric database collected at IIT Kanpur. The system is giving an overall accuracy of 95.8% at penetration rate of 34%.

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.

Root location in random trees: a polarity property of all sampling consistent phylogenetic models except one.

PubMed

Steel, Mike

2012-10-01

Neutral macroevolutionary models, such as the Yule model, give rise to a probability distribution on the set of discrete rooted binary trees over a given leaf set. Such models can provide a signal as to the approximate location of the root when only the unrooted phylogenetic tree is known, and this signal becomes relatively more significant as the number of leaves grows. In this short note, we show that among models that treat all taxa equally, and are sampling consistent (i.e. the distribution on trees is not affected by taxa yet to be included), all such models, except one (the so-called PDA model), convey some information as to the location of the ancestral root in an unrooted tree. Copyright © 2012 Elsevier Inc. All rights reserved.

A parallelized binary search tree

USDA-ARS?s Scientific Manuscript database

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

Minimum triplet covers of binary phylogenetic X-trees.

PubMed

Huber, K T; Moulton, V; Steel, M

2017-12-01

Trees with labelled leaves and with all other vertices of degree three play an important role in systematic biology and other areas of classification. A classical combinatorial result ensures that such trees can be uniquely reconstructed from the distances between the leaves (when the edges are given any strictly positive lengths). Moreover, a linear number of these pairwise distance values suffices to determine both the tree and its edge lengths. A natural set of pairs of leaves is provided by any 'triplet cover' of the tree (based on the fact that each non-leaf vertex is the median vertex of three leaves). In this paper we describe a number of new results concerning triplet covers of minimum size. In particular, we characterize such covers in terms of an associated graph being a 2-tree. Also, we show that minimum triplet covers are 'shellable' and thereby provide a set of pairs for which the inter-leaf distance values will uniquely determine the underlying tree and its associated branch lengths.

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.

Spectral analysis of white ash response to emerald ash borer infestations

NASA Astrophysics Data System (ADS)

Calandra, Laura

The emerald ash borer (EAB) (Agrilus planipennis Fairmaire) is an invasive insect that has killed over 50 million ash trees in the US. The goal of this research was to establish a method to identify ash trees infested with EAB using remote sensing techniques at the leaf-level and tree crown level. First, a field-based study at the leaf-level used the range of spectral bands from the WorldView-2 sensor to determine if there was a significant difference between EAB-infested white ash (Fraxinus americana) and healthy leaves. Binary logistic regression models were developed using individual and combinations of wavelengths; the most successful model included 545 and 950 nm bands. The second half of this research employed imagery to identify healthy and EAB-infested trees, comparing pixel- and object-based methods by applying an unsupervised classification approach and a tree crown delineation algorithm, respectively. The pixel-based models attained the highest overall accuracies.

Fast Construction of Near Parsimonious Hybridization Networks for Multiple Phylogenetic Trees.

PubMed

Mirzaei, Sajad; Wu, Yufeng

2016-01-01

Hybridization networks represent plausible evolutionary histories of species that are affected by reticulate evolutionary processes. An established computational problem on hybridization networks is constructing the most parsimonious hybridization network such that each of the given phylogenetic trees (called gene trees) is "displayed" in the network. There have been several previous approaches, including an exact method and several heuristics, for this NP-hard problem. However, the exact method is only applicable to a limited range of data, and heuristic methods can be less accurate and also slow sometimes. In this paper, we develop a new algorithm for constructing near parsimonious networks for multiple binary gene trees. This method is more efficient for large numbers of gene trees than previous heuristics. This new method also produces more parsimonious results on many simulated datasets as well as a real biological dataset than a previous method. We also show that our method produces topologically more accurate networks for many datasets.

Helium: lifting high-performance stencil kernels from stripped x86 binaries to halide DSL code

DOE PAGES

Mendis, Charith; Bosboom, Jeffrey; Wu, Kevin; ...

2015-06-03

Highly optimized programs are prone to bit rot, where performance quickly becomes suboptimal in the face of new hardware and compiler techniques. In this paper we show how to automatically lift performance-critical stencil kernels from a stripped x86 binary and generate the corresponding code in the high-level domain-specific language Halide. Using Halide's state-of-the-art optimizations targeting current hardware, we show that new optimized versions of these kernels can replace the originals to rejuvenate the application for newer hardware. The original optimized code for kernels in stripped binaries is nearly impossible to analyze statically. Instead, we rely on dynamic traces to regeneratemore » the kernels. We perform buffer structure reconstruction to identify input, intermediate and output buffer shapes. Here, we abstract from a forest of concrete dependency trees which contain absolute memory addresses to symbolic trees suitable for high-level code generation. This is done by canonicalizing trees, clustering them based on structure, inferring higher-dimensional buffer accesses and finally by solving a set of linear equations based on buffer accesses to lift them up to simple, high-level expressions. Helium can handle highly optimized, complex stencil kernels with input-dependent conditionals. We lift seven kernels from Adobe Photoshop giving a 75 % performance improvement, four kernels from Irfan View, leading to 4.97 x performance, and one stencil from the mini GMG multigrid benchmark netting a 4.25 x improvement in performance. We manually rejuvenated Photoshop by replacing eleven of Photoshop's filters with our lifted implementations, giving 1.12 x speedup without affecting the user experience.« less

Blooming Trees: Substructures and Surrounding Groups of Galaxy Clusters

NASA Astrophysics Data System (ADS)

Yu, Heng; Diaferio, Antonaldo; Serra, Ana Laura; Baldi, Marco

2018-06-01

We develop the Blooming Tree Algorithm, a new technique that uses spectroscopic redshift data alone to identify the substructures and the surrounding groups of galaxy clusters, along with their member galaxies. Based on the estimated binding energy of galaxy pairs, the algorithm builds a binary tree that hierarchically arranges all of the galaxies in the field of view. The algorithm searches for buds, corresponding to gravitational potential minima on the binary tree branches; for each bud, the algorithm combines the number of galaxies, their velocity dispersion, and their average pairwise distance into a parameter that discriminates between the buds that do not correspond to any substructure or group, and thus eventually die, and the buds that correspond to substructures and groups, and thus bloom into the identified structures. We test our new algorithm with a sample of 300 mock redshift surveys of clusters in different dynamical states; the clusters are extracted from a large cosmological N-body simulation of a ΛCDM model. We limit our analysis to substructures and surrounding groups identified in the simulation with mass larger than 1013 h ‑1 M ⊙. With mock redshift surveys with 200 galaxies within 6 h ‑1 Mpc from the cluster center, the technique recovers 80% of the real substructures and 60% of the surrounding groups; in 57% of the identified structures, at least 60% of the member galaxies of the substructures and groups belong to the same real structure. These results improve by roughly a factor of two the performance of the best substructure identification algorithm currently available, the σ plateau algorithm, and suggest that our Blooming Tree Algorithm can be an invaluable tool for detecting substructures of galaxy clusters and investigating their complex dynamics.

On the Number of Non-equivalent Ancestral Configurations for Matching Gene Trees and Species Trees.

PubMed

Disanto, Filippo; Rosenberg, Noah A

2017-09-14

An ancestral configuration is one of the combinatorially distinct sets of gene lineages that, for a given gene tree, can reach a given node of a specified species tree. Ancestral configurations have appeared in recursive algebraic computations of the conditional probability that a gene tree topology is produced under the multispecies coalescent model for a given species tree. For matching gene trees and species trees, we study the number of ancestral configurations, considered up to an equivalence relation introduced by Wu (Evolution 66:763-775, 2012) to reduce the complexity of the recursive probability computation. We examine the largest number of non-equivalent ancestral configurations possible for a given tree size n. Whereas the smallest number of non-equivalent ancestral configurations increases polynomially with n, we show that the largest number increases with [Formula: see text], where k is a constant that satisfies [Formula: see text]. Under a uniform distribution on the set of binary labeled trees with a given size n, the mean number of non-equivalent ancestral configurations grows exponentially with n. The results refine an earlier analysis of the number of ancestral configurations considered without applying the equivalence relation, showing that use of the equivalence relation does not alter the exponential nature of the increase with tree size.

Multiprocessor sparse L/U decomposition with controlled fill-in

NASA Technical Reports Server (NTRS)

Alaghband, G.; Jordan, H. F.

1985-01-01

Generation of the maximal compatibles of pivot elements for a class of small sparse matrices is studied. The algorithm involves a binary tree search and has a complexity exponential in the order of the matrix. Different strategies for selection of a set of compatible pivots based on the Markowitz criterion are investigated. The competing issues of parallelism and fill-in generation are studied and results are provided. A technque for obtaining an ordered compatible set directly from the ordered incompatible table is given. This technique generates a set of compatible pivots with the property of generating few fills. A new hueristic algorithm is then proposed that combines the idea of an ordered compatible set with a limited binary tree search to generate several sets of compatible pivots in linear time. Finally, an elimination set to reduce the matrix is selected. Parameters are suggested to obtain a balance between parallelism and fill-ins. Results of applying the proposed algorithms on several large application matrices are presented and analyzed.

SANDERLING Final Report: Parts A and B, A Research Study into KBS for Command and Control in Naval and TMD Applications

DTIC Science & Technology

1990-04-01

focus of attention ). The inherent local control in the FA/C model allows it to achieve just that, since it only requires a global goal to become...Computing Terms Agent Modelling : is concerned with modelling actor’s intentions and plans, and their modification in the light of information... model or program that is based on a mathematical system of logic. B-tree : or "binary-tree" is a self organising storage mechanism that works by taking

Assessment of various supervised learning algorithms using different performance metrics

NASA Astrophysics Data System (ADS)

Susheel Kumar, S. M.; Laxkar, Deepak; Adhikari, Sourav; Vijayarajan, V.

2017-11-01

Our work brings out comparison based on the performance of supervised machine learning algorithms on a binary classification task. The supervised machine learning algorithms which are taken into consideration in the following work are namely Support Vector Machine(SVM), Decision Tree(DT), K Nearest Neighbour (KNN), Naïve Bayes(NB) and Random Forest(RF). This paper mostly focuses on comparing the performance of above mentioned algorithms on one binary classification task by analysing the Metrics such as Accuracy, F-Measure, G-Measure, Precision, Misclassification Rate, False Positive Rate, True Positive Rate, Specificity, Prevalence.

On defining a unique phylogenetic tree with homoplastic characters.

PubMed

Goloboff, Pablo A; Wilkinson, Mark

2018-05-01

This paper discusses the problem of whether creating a matrix with all the character state combinations that have a fixed number of steps (or extra steps) on a given tree T, produces the same tree T when analyzed with maximum parsimony or maximum likelihood. Exhaustive enumeration of cases up to 20 taxa for binary characters, and up to 12 taxa for 4-state characters, shows that the same tree is recovered (as unique most likely or most parsimonious tree) as long as the number of extra steps is within 1/4 of the number of taxa. This dependence, 1/4 of the number of taxa, is discussed with a general argumentation, in terms of the spread of the character changes on the tree used to select character state distributions. The present finding allows creating matrices which have as much homoplasy as possible for the most parsimonious or likely tree to be predictable, and examination of these matrices with hill-climbing search algorithms provides additional evidence on the (lack of a) necessary relationship between homoplasy and the ability of search methods to find optimal trees. Copyright © 2018 Elsevier Inc. All rights reserved.

In Search of Speedier Searches.

ERIC Educational Resources Information Center

Peterson, Ivars

1984-01-01

Methods to make computer searching as simple and efficient as possible have led to the development of various data structures. Data structures specify the items involved in searching and what can be done to them. The nature and advantages of using "self-adjusting" data structures (self-adjusting binary search trees) are discussed. (JN)

A new algorithm to construct phylogenetic networks from trees.

PubMed

Wang, J

2014-03-06

Developing appropriate methods for constructing phylogenetic networks from tree sets is an important problem, and much research is currently being undertaken in this area. BIMLR is an algorithm that constructs phylogenetic networks from tree sets. The algorithm can construct a much simpler network than other available methods. Here, we introduce an improved version of the BIMLR algorithm, QuickCass. QuickCass changes the selection strategy of the labels of leaves below the reticulate nodes, i.e., the nodes with an indegree of at least 2 in BIMLR. We show that QuickCass can construct simpler phylogenetic networks than BIMLR. Furthermore, we show that QuickCass is a polynomial-time algorithm when the output network that is constructed by QuickCass is binary.

A spectrum synthesis program for binary stars

NASA Technical Reports Server (NTRS)

Linnell, Albert P.; Hubeny, Ivan

1994-01-01

A new program produces synthetic spectra of binary stars at arbitrary values of orbital longitude, including longitudes of partial or complete eclipse. The stellar components may be distorted, either tidally or rotationally, or both. Either or both components may be rotating nonsynchronously. We illustrate the program performance with two cases: EE Peg, an eclipsing binary with small distortion, and SX Aur, an eclipsing binary that is close to contact.

Improving children's affective decision making in the Children's Gambling Task.

PubMed

Andrews, Glenda; Moussaumai, Jennifer

2015-11-01

Affective decision making was examined in 108 children (3-, 4-, and 5-year-olds) using the Children's Gambling Task (CGT). Children completed the CGT and then responded to awareness questions. Children in the binary_experience and binary_experience+awareness (not control) conditions first completed two simpler versions. Children in the binary_experience+awareness condition also responded to questions about relational components of the simpler versions. Experience with simpler versions facilitated decision making in 4- and 5-year-olds, but 3-year-olds' advantageous choices declined across trial blocks in the binary_experience and control conditions. Responding to questions about relational components further benefited the 4- and 5-year-olds. The 3-year-olds' advantageous choices on the final block were at chance level in the binary_experience+awareness condition but were below chance level in the other conditions. Awareness following the CGT was strongly correlated with advantageous choices and with age. Awareness was demonstrated by 5-year-olds (all conditions) and 4-year-olds (binary_experience and binary_experience+awareness) but not by 3-year-olds. The findings demonstrate the importance of complexity and conscious awareness in cognitive development. Copyright © 2015 Elsevier Inc. All rights reserved.

Genders and Individual Treatment Progress in (Non-)Binary Trans Individuals.

PubMed

Koehler, Andreas; Eyssel, Jana; Nieder, Timo O

2018-01-01

Health care for transgender and transsexual (ie, trans) individuals has long been based on a binary understanding of gender (ie, feminine vs masculine). However, the existence of non-binary or genderqueer (NBGQ) genders is increasingly recognized by academic and/or health care professionals. To gain insight into the individual health care experiences and needs of binary and NBGQ individuals to improve their health care outcomes and experience. Data were collected using an online survey study on experiences with trans health care. The non-clinical sample consisted of 415 trans individuals. An individual treatment progress score was calculated to report and compare participants' individual progress toward treatment completion and consider the individual treatment needs and definitions of completed treatment (ie, amount and types of different treatments needed to complete one's medical transition). Main outcome measures were (i) general and trans-related sociodemographic data and (ii) received and planned treatments. Participants reported binary (81.7%) and different NBGQ (18.3%) genders. The 2 groups differed significantly in basic demographic data (eg, mean age; P < .05). NBGQ participants reported significantly fewer received treatments compared with binary participants. For planned treatments, binary participants reported more treatments related to primary sex characteristics only. Binary participants required more treatments for a completed treatment than NBGQ participants (6.0 vs 4.0). There were no differences with regard to individual treatment progress score. Because traditional binary-focused treatment practice could have hindered NBGQ individuals from accessing trans health care or sufficiently articulating their needs, health care professionals are encouraged to provide a holistic and individual treatment approach and acknowledge genders outside the gender binary to address their needs appropriately. Because the study was made inclusive for non-patients and individuals who decided against trans health care, bias from a participant-patient double role was prevented, which is the reason the results are likely to have a higher level of validity than a clinical sample. However, because of the anonymity of an online survey, it remains unclear whether NBGQ individuals live according to their gender identity in their everyday life. The study highlights the broad spectrum of genders in trans-individuals and associated health care needs and provides a novel approach to measure individual treatment progress in trans individuals. Koehler A, Eyssel J, Nieder TO. Genders and Individual Treatment Progress in (Non-)Binary Trans Individuals. J Sex Med 2018;15:102-113. Copyright © 2017 International Society for Sexual Medicine. Published by Elsevier Inc. All rights reserved.

Workshop on AI (Artificial Intelligence) and Simulation (2nd) Held in Seattle, Washington on 14 July 1987,

DTIC Science & Technology

1987-07-01

position of the camshaft (for example), the position of each other kinematic pair will have a definite computable value. Thus the only state variables needed...DF CONNROD _CON ROD DIF C OD WF CYL /N. D I T.~ UN ,BLO CT!L \\ CYL C"YL CYL Y I C BLO"cB BLO CYL BLO Figure 2 CSG Tree for Crank .Mechanism program...ships plate. The actual representation is a binary tree who-e - internal nodes are set operation, and rigid motions and The first step for kinematic

Retrieving and Indexing Spatial Data in the Cloud Computing Environment

NASA Astrophysics Data System (ADS)

Wang, Yonggang; Wang, Sheng; Zhou, Daliang

In order to solve the drawbacks of spatial data storage in common Cloud Computing platform, we design and present a framework for retrieving, indexing, accessing and managing spatial data in the Cloud environment. An interoperable spatial data object model is provided based on the Simple Feature Coding Rules from the OGC such as Well Known Binary (WKB) and Well Known Text (WKT). And the classic spatial indexing algorithms like Quad-Tree and R-Tree are re-designed in the Cloud Computing environment. In the last we develop a prototype software based on Google App Engine to implement the proposed model.

CytoSPADE: high-performance analysis and visualization of high-dimensional cytometry data

PubMed Central

Linderman, Michael D.; Simonds, Erin F.; Qiu, Peng; Bruggner, Robert V.; Sheode, Ketaki; Meng, Teresa H.; Plevritis, Sylvia K.; Nolan, Garry P.

2012-01-01

Motivation: Recent advances in flow cytometry enable simultaneous single-cell measurement of 30+ surface and intracellular proteins. CytoSPADE is a high-performance implementation of an interface for the Spanning-tree Progression Analysis of Density-normalized Events algorithm for tree-based analysis and visualization of this high-dimensional cytometry data. Availability: Source code and binaries are freely available at http://cytospade.org and via Bioconductor version 2.10 onwards for Linux, OSX and Windows. CytoSPADE is implemented in R, C++ and Java. Contact: michael.linderman@mssm.edu Supplementary Information: Additional documentation available at http://cytospade.org. PMID:22782546

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…

Lateral gene transfers have polished animal genomes: lessons from nematodes

PubMed Central

Danchin, Etienne G. J.; Rosso, Marie-Noëlle

2012-01-01

It is now accepted that lateral gene transfers (LGT), have significantly contributed to the composition of bacterial genomes. The amplitude of the phenomenon is considered so high in prokaryotes that it challenges the traditional view of a binary hierarchical tree of life to correctly represent the evolutionary history of species. Given the plethora of transfers between prokaryotes, it is currently impossible to infer the last common ancestral gene set for any extant species. For this ensemble of reasons, it has been proposed that the Darwinian binary tree of life may be inappropriate to correctly reflect the actual relations between species, at least in prokaryotes. In contrast, the contribution of LGT to the composition of animal genomes is less documented. In the light of recent analyses that reported series of LGT events in nematodes, we discuss the importance of this phenomenon in the evolutionary history and in the current composition of an animal genome. Far from being neutral, it appears that besides having contributed to nematode genome contents, LGT have favored the emergence of important traits such as plant-parasitism. PMID:22919619

A fast learning method for large scale and multi-class samples of SVM

NASA Astrophysics Data System (ADS)

Fan, Yu; Guo, Huiming

2017-06-01

A multi-class classification SVM(Support Vector Machine) fast learning method based on binary tree is presented to solve its low learning efficiency when SVM processing large scale multi-class samples. This paper adopts bottom-up method to set up binary tree hierarchy structure, according to achieved hierarchy structure, sub-classifier learns from corresponding samples of each node. During the learning, several class clusters are generated after the first clustering of the training samples. Firstly, central points are extracted from those class clusters which just have one type of samples. For those which have two types of samples, cluster numbers of their positive and negative samples are set respectively according to their mixture degree, secondary clustering undertaken afterwards, after which, central points are extracted from achieved sub-class clusters. By learning from the reduced samples formed by the integration of extracted central points above, sub-classifiers are obtained. Simulation experiment shows that, this fast learning method, which is based on multi-level clustering, can guarantee higher classification accuracy, greatly reduce sample numbers and effectively improve learning efficiency.

Data fusion with artificial neural networks (ANN) for classification of earth surface from microwave satellite measurements

NASA Technical Reports Server (NTRS)

Lure, Y. M. Fleming; Grody, Norman C.; Chiou, Y. S. Peter; Yeh, H. Y. Michael

1993-01-01

A data fusion system with artificial neural networks (ANN) is used for fast and accurate classification of five earth surface conditions and surface changes, based on seven SSMI multichannel microwave satellite measurements. The measurements include brightness temperatures at 19, 22, 37, and 85 GHz at both H and V polarizations (only V at 22 GHz). The seven channel measurements are processed through a convolution computation such that all measurements are located at same grid. Five surface classes including non-scattering surface, precipitation over land, over ocean, snow, and desert are identified from ground-truth observations. The system processes sensory data in three consecutive phases: (1) pre-processing to extract feature vectors and enhance separability among detected classes; (2) preliminary classification of Earth surface patterns using two separate and parallely acting classifiers: back-propagation neural network and binary decision tree classifiers; and (3) data fusion of results from preliminary classifiers to obtain the optimal performance in overall classification. Both the binary decision tree classifier and the fusion processing centers are implemented by neural network architectures. The fusion system configuration is a hierarchical neural network architecture, in which each functional neural net will handle different processing phases in a pipelined fashion. There is a total of around 13,500 samples for this analysis, of which 4 percent are used as the training set and 96 percent as the testing set. After training, this classification system is able to bring up the detection accuracy to 94 percent compared with 88 percent for back-propagation artificial neural networks and 80 percent for binary decision tree classifiers. The neural network data fusion classification is currently under progress to be integrated in an image processing system at NOAA and to be implemented in a prototype of a massively parallel and dynamically reconfigurable Modular Neural Ring (MNR).

DLRS: gene tree evolution in light of a species tree.

PubMed

Sjöstrand, Joel; Sennblad, Bengt; Arvestad, Lars; Lagergren, Jens

2012-11-15

PrIME-DLRS (or colloquially: 'Delirious') is a phylogenetic software tool to simultaneously infer and reconcile a gene tree given a species tree. It accounts for duplication and loss events, a relaxed molecular clock and is intended for the study of homologous gene families, for example in a comparative genomics setting involving multiple species. PrIME-DLRS uses a Bayesian MCMC framework, where the input is a known species tree with divergence times and a multiple sequence alignment, and the output is a posterior distribution over gene trees and model parameters. PrIME-DLRS is available for Java SE 6+ under the New BSD License, and JAR files and source code can be downloaded from http://code.google.com/p/jprime/. There is also a slightly older C++ version available as a binary package for Ubuntu, with download instructions at http://prime.sbc.su.se. The C++ source code is available upon request. joel.sjostrand@scilifelab.se or jens.lagergren@scilifelab.se. PrIME-DLRS is based on a sound probabilistic model (Åkerborg et al., 2009) and has been thoroughly validated on synthetic and biological datasets (Supplementary Material online).

iNJclust: Iterative Neighbor-Joining Tree Clustering Framework for Inferring Population Structure.

PubMed

Limpiti, Tulaya; Amornbunchornvej, Chainarong; Intarapanich, Apichart; Assawamakin, Anunchai; Tongsima, Sissades

2014-01-01

Understanding genetic differences among populations is one of the most important issues in population genetics. Genetic variations, e.g., single nucleotide polymorphisms, are used to characterize commonality and difference of individuals from various populations. This paper presents an efficient graph-based clustering framework which operates iteratively on the Neighbor-Joining (NJ) tree called the iNJclust algorithm. The framework uses well-known genetic measurements, namely the allele-sharing distance, the neighbor-joining tree, and the fixation index. The behavior of the fixation index is utilized in the algorithm's stopping criterion. The algorithm provides an estimated number of populations, individual assignments, and relationships between populations as outputs. The clustering result is reported in the form of a binary tree, whose terminal nodes represent the final inferred populations and the tree structure preserves the genetic relationships among them. The clustering performance and the robustness of the proposed algorithm are tested extensively using simulated and real data sets from bovine, sheep, and human populations. The result indicates that the number of populations within each data set is reasonably estimated, the individual assignment is robust, and the structure of the inferred population tree corresponds to the intrinsic relationships among populations within the data.

Many local pattern texture features: which is better for image-based multilabel human protein subcellular localization classification?

PubMed

Yang, Fan; Xu, Ying-Ying; Shen, Hong-Bin

2014-01-01

Human protein subcellular location prediction can provide critical knowledge for understanding a protein's function. Since significant progress has been made on digital microscopy, automated image-based protein subcellular location classification is urgently needed. In this paper, we aim to investigate more representative image features that can be effectively used for dealing with the multilabel subcellular image samples. We prepared a large multilabel immunohistochemistry (IHC) image benchmark from the Human Protein Atlas database and tested the performance of different local texture features, including completed local binary pattern, local tetra pattern, and the standard local binary pattern feature. According to our experimental results from binary relevance multilabel machine learning models, the completed local binary pattern, and local tetra pattern are more discriminative for describing IHC images when compared to the traditional local binary pattern descriptor. The combination of these two novel local pattern features and the conventional global texture features is also studied. The enhanced performance of final binary relevance classification model trained on the combined feature space demonstrates that different features are complementary to each other and thus capable of improving the accuracy of classification.

An information-based network approach for protein classification

PubMed Central

Wan, Xiaogeng; Zhao, Xin; Yau, Stephen S. T.

2017-01-01

Protein classification is one of the critical problems in bioinformatics. Early studies used geometric distances and polygenetic-tree to classify proteins. These methods use binary trees to present protein classification. In this paper, we propose a new protein classification method, whereby theories of information and networks are used to classify the multivariate relationships of proteins. In this study, protein universe is modeled as an undirected network, where proteins are classified according to their connections. Our method is unsupervised, multivariate, and alignment-free. It can be applied to the classification of both protein sequences and structures. Nine examples are used to demonstrate the efficiency of our new method. PMID:28350835

TreSpEx—Detection of Misleading Signal in Phylogenetic Reconstructions Based on Tree Information

PubMed Central

Struck, Torsten H

2014-01-01

Phylogenies of species or genes are commonplace nowadays in many areas of comparative biological studies. However, for phylogenetic reconstructions one must refer to artificial signals such as paralogy, long-branch attraction, saturation, or conflict between different datasets. These signals might eventually mislead the reconstruction even in phylogenomic studies employing hundreds of genes. Unfortunately, there has been no program allowing the detection of such effects in combination with an implementation into automatic process pipelines. TreSpEx (Tree Space Explorer) now combines different approaches (including statistical tests), which utilize tree-based information like nodal support or patristic distances (PDs) to identify misleading signals. The program enables the parallel analysis of hundreds of trees and/or predefined gene partitions, and being command-line driven, it can be integrated into automatic process pipelines. TreSpEx is implemented in Perl and supported on Linux, Mac OS X, and MS Windows. Source code, binaries, and additional material are freely available at http://www.annelida.de/research/bioinformatics/software.html. PMID:24701118

The complete chloroplast genome sequence of tung tree (Vernicia fordii): Organization and phylogenetic relationships with other angiosperms

USDA-ARS?s Scientific Manuscript database

Tung tree (Vernicia fordii) is an economically important plant widely cultivated for industrial oil production in China. To better understand the molecular basis of tung tree chloroplasts, we sequenced and characterized the complete chloroplast genome. The chloroplast genome was 161,524 bp in length...

An object-based approach for tree species extraction from digital orthophoto maps

NASA Astrophysics Data System (ADS)

Jamil, Akhtar; Bayram, Bulent

2018-05-01

Tree segmentation is an active and ongoing research area in the field of photogrammetry and remote sensing. It is more challenging due to both intra-class and inter-class similarities among various tree species. In this study, we exploited various statistical features for extraction of hazelnut trees from 1 : 5000 scaled digital orthophoto maps. Initially, the non-vegetation areas were eliminated using traditional normalized difference vegetation index (NDVI) followed by application of mean shift segmentation for transforming the pixels into meaningful homogeneous objects. In order to eliminate false positives, morphological opening and closing was employed on candidate objects. A number of heuristics were also derived to eliminate unwanted effects such as shadow and bounding box aspect ratios, before passing them into the classification stage. Finally, a knowledge based decision tree was constructed to distinguish the hazelnut trees from rest of objects which include manmade objects and other type of vegetation. We evaluated the proposed methodology on 10 sample orthophoto maps obtained from Giresun province in Turkey. The manually digitized hazelnut tree boundaries were taken as reference data for accuracy assessment. Both manually digitized and segmented tree borders were converted into binary images and the differences were calculated. According to the obtained results, the proposed methodology obtained an overall accuracy of more than 85 % for all sample images.

A biclustering algorithm for extracting bit-patterns from binary datasets.

PubMed

Rodriguez-Baena, Domingo S; Perez-Pulido, Antonio J; Aguilar-Ruiz, Jesus S

2011-10-01

Binary datasets represent a compact and simple way to store data about the relationships between a group of objects and their possible properties. In the last few years, different biclustering algorithms have been specially developed to be applied to binary datasets. Several approaches based on matrix factorization, suffix trees or divide-and-conquer techniques have been proposed to extract useful biclusters from binary data, and these approaches provide information about the distribution of patterns and intrinsic correlations. A novel approach to extracting biclusters from binary datasets, BiBit, is introduced here. The results obtained from different experiments with synthetic data reveal the excellent performance and the robustness of BiBit to density and size of input data. Also, BiBit is applied to a central nervous system embryonic tumor gene expression dataset to test the quality of the results. A novel gene expression preprocessing methodology, based on expression level layers, and the selective search performed by BiBit, based on a very fast bit-pattern processing technique, provide very satisfactory results in quality and computational cost. The power of biclustering in finding genes involved simultaneously in different cancer processes is also shown. Finally, a comparison with Bimax, one of the most cited binary biclustering algorithms, shows that BiBit is faster while providing essentially the same results. The source and binary codes, the datasets used in the experiments and the results can be found at: http://www.upo.es/eps/bigs/BiBit.html dsrodbae@upo.es Supplementary data are available at Bioinformatics online.

Close binary systems among very low-mass stars and brown dwarfs

NASA Astrophysics Data System (ADS)

Jeffries, R. D.; Maxted, P. F. L.

2005-12-01

Using Monte Carlo simulations and published radial velocity surveys we have constrained the frequency and separation (a) distribution of very low-mass star (VLM) and brown dwarf (BD) binary systems. We find that simple Gaussian extensions of the observed wide binary distribution, with a peak at 4 AU and 0.6<\\sigma_{\\log(a/AU)}<1.0, correctly reproduce the observed number of close binary systems, implying a close (a<2.6 AU) binary frequency of 17-30 % and overall frequency of 32-45 %. N-body models of the dynamical decay of unstable protostellar multiple systems are excluded with high confidence because they do not produce enough close binary VLMs/BDs. The large number of close binaries and high overall binary frequency are also completely inconsistent with published smoothed particle hydrodynamical modelling and argue against a dynamical origin for VLMs/BDs.

High Fill-out, Extreme Mass Ratio Overcontact Binary Systems. X. The Newly Discovered Binary XY Leonis Minoris

NASA Astrophysics Data System (ADS)

Qian, S.-B.; Liu, L.; Zhu, L.-Y.; He, J.-J.; Yang, Y.-G.; Bernasconi, L.

2011-05-01

The newly discovered short-period close binary star, XY LMi, has been monitored photometrically since 2006. Its light curves are typical EW-type light curves and show complete eclipses with durations of about 80 minutes. Photometric solutions were determined through an analysis of the complete B, V, R, and I light curves using the 2003 version of the Wilson-Devinney code. XY LMi is a high fill-out, extreme mass ratio overcontact binary system with a mass ratio of q = 0.148 and a fill-out factor of f = 74.1%, suggesting that it is in the late evolutionary stage of late-type tidal-locked binary stars. As observed in other overcontact binary stars, evidence for the presence of two dark spots on both components is given. Based on our 19 epochs of eclipse times, we found that the orbital period of the overcontact binary is decreasing continuously at a rate of dP/dt = -1.67 × 10-7 days yr-1, which may be caused by mass transfer from the primary to the secondary and/or angular momentum loss via magnetic stellar wind. The decrease of the orbital period may result in the increase of the fill-out, and finally, it will evolve into a single rapid-rotation star when the fluid surface reaches the outer critical Roche lobe.

swot: Super W Of Theta

NASA Astrophysics Data System (ADS)

Coupon, Jean; Leauthaud, Alexie; Kilbinger, Martin; Medezinski, Elinor

2017-07-01

SWOT (Super W Of Theta) computes two-point statistics for very large data sets, based on “divide and conquer” algorithms, mainly, but not limited to data storage in binary trees, approximation at large scale, parellelization (open MPI), and bootstrap and jackknife resampling methods “on the fly”. It currently supports projected and 3D galaxy auto and cross correlations, galaxy-galaxy lensing, and weighted histograms.

Physicochemical characterization of lignin recovered from microwave-assisted delignified lignocellulosic biomass for use in biobased materials

Treesearch

Jiulong Xie; Chung-Yun Hse; Todd F. Shupe; Tingxing Hu

2015-01-01

Lignocellulosic biomass (Moso Bamboo, Chinese tallow tree wood, switchgrass, and pine wood) was subjected to a novel delignification process using microwave energy in a binary glycerol/methanol solvent. The physicochemical properties of the recovered lignin were analyzed prior to its application in the fabrication of polylactic acid (PLA)–lignin composites. The results...

Extracting the information of coastline shape and its multiple representations

NASA Astrophysics Data System (ADS)

Liu, Ying; Li, Shujun; Tian, Zhen; Chen, Huirong

2007-06-01

According to studying the coastline, a new way of multiple representations is put forward in the paper. That is stimulating human thinking way when they generalized, building the appropriate math model and describing the coastline with graphics, extracting all kinds of the coastline shape information. The coastline automatic generalization will be finished based on the knowledge rules and arithmetic operators. Showing the information of coastline shape by building the curve Douglas binary tree, it can reveal the shape character of coastline not only microcosmically but also macroscopically. Extracting the information of coastline concludes the local characteristic point and its orientation, the curve structure and the topology trait. The curve structure can be divided the single curve and the curve cluster. By confirming the knowledge rules of the coastline generalization, the generalized scale and its shape parameter, the coastline automatic generalization model is established finally. The method of the multiple scale representation of coastline in this paper has some strong points. It is human's thinking mode and can keep the nature character of the curve prototype. The binary tree structure can control the coastline comparability, avoid the self-intersect phenomenon and hold the unanimous topology relationship.

Precision of Times-of-Minima and the Detection of Low-Mass Third Bodies Orbiting Eclipsing Binaries

NASA Astrophysics Data System (ADS)

Genet, R. M.; Smith, T. C.

2004-12-01

Low-mass third bodies orbiting eclipsing binaries are difficult to detect by way of periodic shifts in photometric times-of-minima because the observational precision of these timings are of the same order as the expected effects of any low-mass companions. We are implementing three approaches to increasing the precision of our times-of-minima. First, we are obtaining many times-of-minima by utilizing relatively low-cost, dedicated telescopes and CCD cameras (10- and 14-inch Meade LX-200 telescopes and SBIG ST7-XE cameras). Operating in a semiautomatic mode, we select an eclipsing binary system, based on its placement in the sky, and observe it all night long - usually many nights in a row. We choose binaries with short enough periods to assure us of obtaining a complete light curve (and hence an eclipse) every night we observe. Second, we are striving to increase the photometric precision of each observation through the use of multiple comparison stars (ensemble photometry). We are also, in conjunction with California Polytechnic State University, investigating other ways of increasing the photometric precision of these low-cost systems (see E. Sturm this conference). Finally, we are utilizing complete, as opposed to partial, light curves in our analysis. Information outside primary eclipses is gathered as a matter of course, and its use can improve precision. A total of 186 complete light curves were obtained at the Dark Ridge and Orion Observatories during the 2004 observing season on six eclipsing binaries (TZ Boo, V523 Cas, RW Com, V1191 Cyg, GM Dra, and V400 Lyr). Please see T. Smith and R. Genet (this conference) for preliminary results on V523 Cas (30+ complete light curves).

[Comparison of Discriminant Analysis and Decision Trees for the Detection of Subclinical Keratoconus].

PubMed

Kleinhans, Sonja; Herrmann, Eva; Kohnen, Thomas; Bühren, Jens

2017-08-15

Background Iatrogenic keratectasia is one of the most dreaded complications of refractive surgery. In most cases, keratectasia develops after refractive surgery of eyes suffering from subclinical stages of keratoconus with few or no signs. Unfortunately, there has been no reliable procedure for the early detection of keratoconus. In this study, we used binary decision trees (recursive partitioning) to assess their suitability for discrimination between normal eyes and eyes with subclinical keratoconus. Patients and Methods The method of decision tree analysis was compared with discriminant analysis which has shown good results in previous studies. Input data were 32 eyes of 32 patients with newly diagnosed keratoconus in the contralateral eye and preoperative data of 10 eyes of 5 patients with keratectasia after laser in-situ keratomileusis (LASIK). The control group was made up of 245 normal eyes after LASIK and 12-month follow-up without any signs of iatrogenic keratectasia. Results Decision trees gave better accuracy and specificity than did discriminant analysis. The sensitivity of decision trees was lower than the sensitivity of discriminant analysis. Conclusion On the basis of the patient population of this study, decision trees did not prove to be superior to linear discriminant analysis for the detection of subclinical keratoconus. Georg Thieme Verlag KG Stuttgart · New York.

Regression trees for predicting mortality in patients with cardiovascular disease: What improvement is achieved by using ensemble-based methods?

PubMed Central

Austin, Peter C; Lee, Douglas S; Steyerberg, Ewout W; Tu, Jack V

2012-01-01

In biomedical research, the logistic regression model is the most commonly used method for predicting the probability of a binary outcome. While many clinical researchers have expressed an enthusiasm for regression trees, this method may have limited accuracy for predicting health outcomes. We aimed to evaluate the improvement that is achieved by using ensemble-based methods, including bootstrap aggregation (bagging) of regression trees, random forests, and boosted regression trees. We analyzed 30-day mortality in two large cohorts of patients hospitalized with either acute myocardial infarction (N = 16,230) or congestive heart failure (N = 15,848) in two distinct eras (1999–2001 and 2004–2005). We found that both the in-sample and out-of-sample prediction of ensemble methods offered substantial improvement in predicting cardiovascular mortality compared to conventional regression trees. However, conventional logistic regression models that incorporated restricted cubic smoothing splines had even better performance. We conclude that ensemble methods from the data mining and machine learning literature increase the predictive performance of regression trees, but may not lead to clear advantages over conventional logistic regression models for predicting short-term mortality in population-based samples of subjects with cardiovascular disease. PMID:22777999

Diversity Dynamics in Nymphalidae Butterflies: Effect of Phylogenetic Uncertainty on Diversification Rate Shift Estimates

PubMed Central

Peña, Carlos; Espeland, Marianne

2015-01-01

The species rich butterfly family Nymphalidae has been used to study evolutionary interactions between plants and insects. Theories of insect-hostplant dynamics predict accelerated diversification due to key innovations. In evolutionary biology, analysis of maximum credibility trees in the software MEDUSA (modelling evolutionary diversity using stepwise AIC) is a popular method for estimation of shifts in diversification rates. We investigated whether phylogenetic uncertainty can produce different results by extending the method across a random sample of trees from the posterior distribution of a Bayesian run. Using the MultiMEDUSA approach, we found that phylogenetic uncertainty greatly affects diversification rate estimates. Different trees produced diversification rates ranging from high values to almost zero for the same clade, and both significant rate increase and decrease in some clades. Only four out of 18 significant shifts found on the maximum clade credibility tree were consistent across most of the sampled trees. Among these, we found accelerated diversification for Ithomiini butterflies. We used the binary speciation and extinction model (BiSSE) and found that a hostplant shift to Solanaceae is correlated with increased net diversification rates in Ithomiini, congruent with the diffuse cospeciation hypothesis. Our results show that taking phylogenetic uncertainty into account when estimating net diversification rate shifts is of great importance, as very different results can be obtained when using the maximum clade credibility tree and other trees from the posterior distribution. PMID:25830910

Diversity dynamics in Nymphalidae butterflies: effect of phylogenetic uncertainty on diversification rate shift estimates.

PubMed

Peña, Carlos; Espeland, Marianne

2015-01-01

The species rich butterfly family Nymphalidae has been used to study evolutionary interactions between plants and insects. Theories of insect-hostplant dynamics predict accelerated diversification due to key innovations. In evolutionary biology, analysis of maximum credibility trees in the software MEDUSA (modelling evolutionary diversity using stepwise AIC) is a popular method for estimation of shifts in diversification rates. We investigated whether phylogenetic uncertainty can produce different results by extending the method across a random sample of trees from the posterior distribution of a Bayesian run. Using the MultiMEDUSA approach, we found that phylogenetic uncertainty greatly affects diversification rate estimates. Different trees produced diversification rates ranging from high values to almost zero for the same clade, and both significant rate increase and decrease in some clades. Only four out of 18 significant shifts found on the maximum clade credibility tree were consistent across most of the sampled trees. Among these, we found accelerated diversification for Ithomiini butterflies. We used the binary speciation and extinction model (BiSSE) and found that a hostplant shift to Solanaceae is correlated with increased net diversification rates in Ithomiini, congruent with the diffuse cospeciation hypothesis. Our results show that taking phylogenetic uncertainty into account when estimating net diversification rate shifts is of great importance, as very different results can be obtained when using the maximum clade credibility tree and other trees from the posterior distribution.

Adaptive segmentation of cerebrovascular tree in time-of-flight magnetic resonance angiography.

PubMed

Hao, J T; Li, M L; Tang, F L

2008-01-01

Accurate segmentation of the human vasculature is an important prerequisite for a number of clinical procedures, such as diagnosis, image-guided neurosurgery and pre-surgical planning. In this paper, an improved statistical approach to extracting whole cerebrovascular tree in time-of-flight magnetic resonance angiography is proposed. Firstly, in order to get a more accurate segmentation result, a localized observation model is proposed instead of defining the observation model over the entire dataset. Secondly, for the binary segmentation, an improved Iterative Conditional Model (ICM) algorithm is presented to accelerate the segmentation process. The experimental results showed that the proposed algorithm can obtain more satisfactory segmentation results and save more processing time than conventional approaches, simultaneously.

Analytic gravitational waveforms for generic precessing compact binaries

NASA Astrophysics Data System (ADS)

Chatziioannou, Katerina; Klein, Antoine; Cornish, Neil; Yunes, Nicolas

2017-01-01

Gravitational waves from compact binaries are subject to amplitude and phase modulations arising from interactions between the angular momenta of the system. Failure to account for such spin-precession effects in gravitational wave data analysis could hinder detection and completely ruin parameter estimation. In this talk I will describe the construction of closed-form, frequency-domain waveforms for fully-precessing, quasi-circular binary inspirals. The resulting waveforms can model spinning binaries of arbitrary spin magnitudes, spin orientations, and masses during the inspiral phase. I will also describe ongoing efforts to extend these inspiral waveforms to the merger and ringdown phases.

Goal-Directed Reading of Complex, Embedded Hypertexts: Effects of Goal and Interest on Search Strategies and Selective Attention.

ERIC Educational Resources Information Center

Gillingham, Mark G.

A study examined what happened when a group of adult students read a hypertext for the goal of answering specific questions. Subjects, 30 students enrolled in an upper-division psychology course at a state university in the northwestern United States, read a binary tree-structured hypertext to answer three two-part questions on the topic of…

Rough Set Based Splitting Criterion for Binary Decision Tree Classifiers

DTIC Science & Technology

2006-09-26

Alata O. Fernandez-Maloigne C., and Ferrie J.C. (2001). Unsupervised Algorithm for the Segmentation of Three-Dimensional Magnetic Resonance Brain ...instinctual and learned responses in the brain , causing it to make decisions based on patterns in the stimuli. Using this deceptively simple process...2001. [2] Bohn C. (1997). An Incremental Unsupervised Learning Scheme for Function Approximation. In: Proceedings of the 1997 IEEE International

Spatial and spatiotemporal pattern analysis of coconut lethal yellowing in Mozambique.

PubMed

Bonnot, F; de Franqueville, H; Lourenço, E

2010-04-01

Coconut lethal yellowing (LY) is caused by a phytoplasma and is a major threat for coconut production throughout its growing area. Incidence of LY was monitored visually on every coconut tree in six fields in Mozambique for 34 months. Disease progress curves were plotted and average monthly disease incidence was estimated. Spatial patterns of disease incidence were analyzed at six assessment times. Aggregation was tested by the coefficient of spatial autocorrelation of the beta-binomial distribution of diseased trees in quadrats. The binary power law was used as an assessment of overdispersion across the six fields. Spatial autocorrelation between symptomatic trees was measured by the BB join count statistic based on the number of pairs of diseased trees separated by a specific distance and orientation, and tested using permutation methods. Aggregation of symptomatic trees was detected in every field in both cumulative and new cases. Spatiotemporal patterns were analyzed with two methods. The proximity of symptomatic trees at two assessment times was investigated using the spatiotemporal BB join count statistic based on the number of pairs of trees separated by a specific distance and orientation and exhibiting the first symptoms of LY at the two times. The semivariogram of times of appearance of LY was calculated to characterize how the lag between times of appearance of LY was related to the distance between symptomatic trees. Both statistics were tested using permutation methods. A tendency for new cases to appear in the proximity of previously diseased trees and a spatially structured pattern of times of appearance of LY within clusters of diseased trees were detected, suggesting secondary spread of the disease.

Comprehensive decision tree models in bioinformatics.

PubMed

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

2012-01-01

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. 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. 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. 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 attributes and a high number of possibly redundant attributes that are very common in bioinformatics.

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 attributes and a high number of possibly redundant attributes that are very common in bioinformatics. PMID:22479449

Suppression of leopard moth (Lepidoptera: Cossidae) populations in olive trees in Egypt through mating disruption.

PubMed

Hegazi, E M; Khafagi, W E; Konstantopoulou, M A; Schlyter, F; Raptopoulos, D; Shweil, S; Abd El-Rahman, S; Atwa, A; Ali, S E; Tawfik, H

2010-10-01

The leopard moth, Zeuzera pyrina (L.) (Lepidoptera: Cossidae), is a damaging pest for many fruit trees (e.g., apple [Malus spp.], pear [Pyrus spp.] peach [Prunus spp.], and olive [Olea]). Recently, it caused serious yield losses in newly established olive orchards in Egypt, including the death of young trees. Chemical and biological control have shown limited efficiency against this pest. Field tests were conducted in 2005 and 2006 to evaluate mating disruption (MD) for the control of the leopard moth, on heavily infested, densely planted olive plots (336 trees per ha). The binary blend of the pheromone components (E,Z)-2,13-octadecenyl acetate and (E,Z)-3,13-octadecenyl acetate (95:5) was dispensed from polyethylene vials. Efficacy was measured considering reduction of catches in pheromone traps, reduction of active galleries of leopard moth per tree and fruit yield in the pheromone-treated plots (MD) compared with control plots (CO). Male captures in MD plots were reduced by 89.3% in 2005 and 82.9% in 2006, during a trapping period of 14 and 13 wk, respectively. Application of MD over two consecutive years progressively reduced the number of active galleries per tree in the third year where no sex pheromone was applied. In all years, larval galleries outnumbered moth captures. Fruit yield from trees where sex pheromone had been applied in 2005 and 2006 increased significantly in 2006 (98.8 +/- 2.9 kg per tree) and 2007 (23 +/- 1.3 kg per tree) compared with control ones (61.0 +/- 3.9 and 10.0 +/- 0.6 kg per tree, respectively). Mating disruption shows promising for suppressing leopard moth infestation in olives.

Luminous Binary Supersoft X-Ray Sources

NASA Technical Reports Server (NTRS)

DiStefano, Rosanne; Oliversen, Ronald J. (Technical Monitor)

2002-01-01

This grant was for the study of Luminous Supersoft X-Ray Sources (SSSs). During the first year a number of projects were completed and new projects were started. The projects include: 1) Time variability of SSSs 2) SSSs in M31; 3) Binary evolution scenarios; and 4) Acquiring new data.

Comparing methods for estimation of heterogeneous treatment effects using observational data from health care databases.

PubMed

Wendling, T; Jung, K; Callahan, A; Schuler, A; Shah, N H; Gallego, B

2018-06-03

There is growing interest in using routinely collected data from health care databases to study the safety and effectiveness of therapies in "real-world" conditions, as it can provide complementary evidence to that of randomized controlled trials. Causal inference from health care databases is challenging because the data are typically noisy, high dimensional, and most importantly, observational. It requires methods that can estimate heterogeneous treatment effects while controlling for confounding in high dimensions. Bayesian additive regression trees, causal forests, causal boosting, and causal multivariate adaptive regression splines are off-the-shelf methods that have shown good performance for estimation of heterogeneous treatment effects in observational studies of continuous outcomes. However, it is not clear how these methods would perform in health care database studies where outcomes are often binary and rare and data structures are complex. In this study, we evaluate these methods in simulation studies that recapitulate key characteristics of comparative effectiveness studies. We focus on the conditional average effect of a binary treatment on a binary outcome using the conditional risk difference as an estimand. To emulate health care database studies, we propose a simulation design where real covariate and treatment assignment data are used and only outcomes are simulated based on nonparametric models of the real outcomes. We apply this design to 4 published observational studies that used records from 2 major health care databases in the United States. Our results suggest that Bayesian additive regression trees and causal boosting consistently provide low bias in conditional risk difference estimates in the context of health care database studies. Copyright © 2018 John Wiley & Sons, Ltd.

Active learning strategies for the deduplication of electronic patient data using classification trees.

PubMed

Sariyar, M; Borg, A; Pommerening, K

2012-10-01

Supervised record linkage methods often require a clerical review to gain informative training data. Active learning means to actively prompt the user to label data with special characteristics in order to minimise the review costs. We conducted an empirical evaluation to investigate whether a simple active learning strategy using binary comparison patterns is sufficient or if string metrics together with a more sophisticated algorithm are necessary to achieve high accuracies with a small training set. Based on medical registry data with different numbers of attributes, we used active learning to acquire training sets for classification trees, which were then used to classify the remaining data. Active learning for binary patterns means that every distinct comparison pattern represents a stratum from which one item is sampled. Active learning for patterns consisting of the Levenshtein string metric values uses an iterative process where the most informative and representative examples are added to the training set. In this context, we extended the active learning strategy by Sarawagi and Bhamidipaty (2002). On the original data set, active learning based on binary comparison patterns leads to the best results. When dropping four or six attributes, using string metrics leads to better results. In both cases, not more than 200 manually reviewed training examples are necessary. In record linkage applications where only forename, name and birthday are available as attributes, we suggest the sophisticated active learning strategy based on string metrics in order to achieve highly accurate results. We recommend the simple strategy if more attributes are available, as in our study. In both cases, active learning significantly reduces the amount of manual involvement in training data selection compared to usual record linkage settings. Copyright © 2012 Elsevier Inc. All rights reserved.

Quantum computation with classical light: Implementation of the Deutsch-Jozsa algorithm

NASA Astrophysics Data System (ADS)

Perez-Garcia, Benjamin; McLaren, Melanie; Goyal, Sandeep K.; Hernandez-Aranda, Raul I.; Forbes, Andrew; Konrad, Thomas

2016-05-01

We propose an optical implementation of the Deutsch-Jozsa Algorithm using classical light in a binary decision-tree scheme. Our approach uses a ring cavity and linear optical devices in order to efficiently query the oracle functional values. In addition, we take advantage of the intrinsic Fourier transforming properties of a lens to read out whether the function given by the oracle is balanced or constant.

Tokunaga self-similarity arises naturally from time invariance

NASA Astrophysics Data System (ADS)

Kovchegov, Yevgeniy; Zaliapin, Ilya

2018-04-01

The Tokunaga condition is an algebraic rule that provides a detailed description of the branching structure in a self-similar tree. Despite a solid empirical validation and practical convenience, the Tokunaga condition lacks a theoretical justification. Such a justification is suggested in this work. We define a geometric branching process G (s ) that generates self-similar rooted trees. The main result establishes the equivalence between the invariance of G (s ) with respect to a time shift and a one-parametric version of the Tokunaga condition. In the parameter region where the process satisfies the Tokunaga condition (and hence is time invariant), G (s ) enjoys many of the symmetries observed in a critical binary Galton-Watson branching process and reproduces the latter for a particular parameter value.

Priority Queues for Computer Simulations

NASA Technical Reports Server (NTRS)

Steinman, Jeffrey S. (Inventor)

1998-01-01

The present invention is embodied in new priority queue data structures for event list management of computer simulations, and includes a new priority queue data structure and an improved event horizon applied to priority queue data structures. ne new priority queue data structure is a Qheap and is made out of linked lists for robust, fast, reliable, and stable event list management and uses a temporary unsorted list to store all items until one of the items is needed. Then the list is sorted, next, the highest priority item is removed, and then the rest of the list is inserted in the Qheap. Also, an event horizon is applied to binary tree and splay tree priority queue data structures to form the improved event horizon for event management.

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.

Binary Star Fractions from the LAMOST DR4

NASA Astrophysics Data System (ADS)

Tian, Zhi-Jia; Liu, Xiao-Wei; Yuan, Hai-Bo; Chen, Bing-Qiu; Xiang, Mao-Sheng; Huang, Yang; Wang, Chun; Zhang, Hua-Wei; Guo, Jin-Cheng; Ren, Juan-Juan; Huo, Zhi-Ying; Yang, Yong; Zhang, Meng; Bi, Shao-Lan; Yang, Wu-Ming; Liu, Kang; Zhang, Xian-Fei; Li, Tan-Da; Wu, Ya-Qian; Zhang, Jing-Hua

2018-05-01

Stellar systems composed of single, double, triple or higher-order systems are rightfully regarded as the fundamental building blocks of the Milky Way. Binary stars play an important role in formation and evolution of the Galaxy. Through comparing the radial velocity variations from multi-epoch observations, we analyze the binary fraction of dwarf stars observed with LAMOST. Effects of different model assumptions, such as orbital period distributions on the estimate of binary fractions, are investigated. The results based on log-normal distribution of orbital periods reproduce the previous complete analyses better than the power-law distribution. We find that the binary fraction increases with T eff and decreases with [Fe/H]. We first investigate the relation between α-elements and binary fraction in such a large sample as provided by LAMOST. The old stars with high [α/Fe] dominate with a higher binary fraction than young stars with low [α/Fe]. At the same mass, earlier forming stars possess a higher binary fraction than newly forming ones, which may be related with evolution of the Galaxy.

7 CFR 301.75-4 - Quarantined areas.

Code of Federal Regulations, 2010 CFR

2010-01-01

...) Grass, tree, and plant clippings may be moved intrastate from the quarantined area for disposal in a...)(1) of this section, (B) The grass, tree, or plant clippings are completely covered during the... regulated plant and regulated tree, except indoor houseplants and regulated plants and regulated trees at...

Node degree distribution in spanning trees

NASA Astrophysics Data System (ADS)

Pozrikidis, C.

2016-03-01

A method is presented for computing the number of spanning trees involving one link or a specified group of links, and excluding another link or a specified group of links, in a network described by a simple graph in terms of derivatives of the spanning-tree generating function defined with respect to the eigenvalues of the Kirchhoff (weighted Laplacian) matrix. The method is applied to deduce the node degree distribution in a complete or randomized set of spanning trees of an arbitrary network. An important feature of the proposed method is that the explicit construction of spanning trees is not required. It is shown that the node degree distribution in the spanning trees of the complete network is described by the binomial distribution. Numerical results are presented for the node degree distribution in square, triangular, and honeycomb lattices.

Determination of Orbital Parameters for Visual Binary Stars Using a Fourier-Series Approach

NASA Astrophysics Data System (ADS)

Brown, D. E.; Prager, J. R.; DeLeo, G. G.; McCluskey, G. E., Jr.

2001-12-01

We expand on the Fourier transform method of Monet (ApJ 234, 275, 1979) to infer the orbital parameters of visual binary stars, and we present results for several systems, both simulated and real. Although originally developed to address binary systems observed through at least one complete period, we have extended the method to deal explicitly with cases where the orbital data is less complete. This is especially useful in cases where the period is so long that only a fragment of the orbit has been recorded. We utilize Fourier-series fitting methods appropriate to data sets covering less than one period and containing random measurement errors. In so doing, we address issues of over-determination in fitting the data and the reduction of other deleterious Fourier-series artifacts. We developed our algorithm using the MAPLE mathematical software code, and tested it on numerous "synthetic" systems, and several real binaries, including Xi Boo, 24 Aqr, and Bu 738. This work was supported at Lehigh University by the Delaware Valley Space Grant Consortium and by NSF-REU grant PHY-9820301.

Reducing process delays for real-time earthquake parameter estimation - An application of KD tree to large databases for Earthquake Early Warning

NASA Astrophysics Data System (ADS)

Yin, Lucy; Andrews, Jennifer; Heaton, Thomas

2018-05-01

Earthquake parameter estimations using nearest neighbor searching among a large database of observations can lead to reliable prediction results. However, in the real-time application of Earthquake Early Warning (EEW) systems, the accurate prediction using a large database is penalized by a significant delay in the processing time. We propose to use a multidimensional binary search tree (KD tree) data structure to organize large seismic databases to reduce the processing time in nearest neighbor search for predictions. We evaluated the performance of KD tree on the Gutenberg Algorithm, a database-searching algorithm for EEW. We constructed an offline test to predict peak ground motions using a database with feature sets of waveform filter-bank characteristics, and compare the results with the observed seismic parameters. We concluded that large database provides more accurate predictions of the ground motion information, such as peak ground acceleration, velocity, and displacement (PGA, PGV, PGD), than source parameters, such as hypocenter distance. Application of the KD tree search to organize the database reduced the average searching process by 85% time cost of the exhaustive method, allowing the method to be feasible for real-time implementation. The algorithm is straightforward and the results will reduce the overall time of warning delivery for EEW.

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 obtained on Dystric Lithosol.

Sustainable development and use of ecosystems with non-forest trees

USDA-ARS?s Scientific Manuscript database

Non-forest trees are components of managed ecosystems including orchards and agroforestry systems and natural ecosystems such as savannas and riparian corridors. Each of these ecosystems includes trees but does not have a complete tree canopy or spatial extent necessary to create a true forest ecosy...

A Biosequence-based Approach to Software Characterization

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

Oehmen, Christopher S.; Peterson, Elena S.; Phillips, Aaron R.

For many applications, it is desirable to have some process for recognizing when software binaries are closely related without relying on them to be identical or have identical segments. Some examples include monitoring utilization of high performance computing centers or service clouds, detecting freeware in licensed code, and enforcing application whitelists. But doing so in a dynamic environment is a nontrivial task because most approaches to software similarity require extensive and time-consuming analysis of a binary, or they fail to recognize executables that are similar but nonidentical. Presented herein is a novel biosequence-based method for quantifying similarity of executable binaries.more » Using this method, it is shown in an example application on large-scale multi-author codes that 1) the biosequence-based method has a statistical performance in recognizing and distinguishing between a collection of real-world high performance computing applications better than 90% of ideal; and 2) an example of using family tree analysis to tune identification for a code subfamily can achieve better than 99% of ideal performance.« less

Crown Release Promotes Faster Diameter Growth of Pole-Size Black Walnut

Treesearch

Robert E. Phares; Robert D. Williams

1971-01-01

Complete crown release more than doubles the diameter growth of pole-size black walnut trees in southern Indiana over a 10-year period. Partially released trees gew about 50 percent more than unreleased trees. The faster growth of the released trees was directly related to increases in crown-area expansion. Most of the study trees produced bole sprouts; however, the...

Inside the black box: starting to uncover the underlying decision rules used in one-by-one expert assessment of occupational exposure in case-control studies

PubMed Central

Wheeler, David C.; Burstyn, Igor; Vermeulen, Roel; Yu, Kai; Shortreed, Susan M.; Pronk, Anjoeka; Stewart, Patricia A.; Colt, Joanne S.; Baris, Dalsu; Karagas, Margaret R.; Schwenn, Molly; Johnson, Alison; Silverman, Debra T.; Friesen, Melissa C.

2014-01-01

Objectives Evaluating occupational exposures in population-based case-control studies often requires exposure assessors to review each study participants' reported occupational information job-by-job to derive exposure estimates. Although such assessments likely have underlying decision rules, they usually lack transparency, are time-consuming and have uncertain reliability and validity. We aimed to identify the underlying rules to enable documentation, review, and future use of these expert-based exposure decisions. Methods Classification and regression trees (CART, predictions from a single tree) and random forests (predictions from many trees) were used to identify the underlying rules from the questionnaire responses and an expert's exposure assignments for occupational diesel exhaust exposure for several metrics: binary exposure probability and ordinal exposure probability, intensity, and frequency. Data were split into training (n=10,488 jobs), testing (n=2,247), and validation (n=2,248) data sets. Results The CART and random forest models' predictions agreed with 92–94% of the expert's binary probability assignments. For ordinal probability, intensity, and frequency metrics, the two models extracted decision rules more successfully for unexposed and highly exposed jobs (86–90% and 57–85%, respectively) than for low or medium exposed jobs (7–71%). Conclusions CART and random forest models extracted decision rules and accurately predicted an expert's exposure decisions for the majority of jobs and identified questionnaire response patterns that would require further expert review if the rules were applied to other jobs in the same or different study. This approach makes the exposure assessment process in case-control studies more transparent and creates a mechanism to efficiently replicate exposure decisions in future studies. PMID:23155187

Loops in hierarchical channel networks

NASA Astrophysics Data System (ADS)

Katifori, Eleni; Magnasco, Marcelo

2012-02-01

Nature provides us with many examples of planar distribution and structural networks having dense sets of closed loops. An archetype of this form of network organization is the vasculature of dicotyledonous leaves, which showcases a hierarchically-nested architecture. Although a number of methods have been proposed to measure aspects of the structure of such networks, a robust metric to quantify their hierarchical organization is still lacking. We present an algorithmic framework that allows mapping loopy networks to binary trees, preserving in the connectivity of the trees the architecture of the original graph. We apply this framework to investigate computer generated and natural graphs extracted from digitized images of dicotyledonous leaves and animal vasculature. We calculate various metrics on the corresponding trees and discuss the relationship of these quantities to the architectural organization of the original graphs. This algorithmic framework decouples the geometric information from the metric topology (connectivity and edge weight) and it ultimately allows us to perform a quantitative statistical comparison between predictions of theoretical models and naturally occurring loopy graphs.

Augmenting computer networks

NASA Technical Reports Server (NTRS)

Bokhari, S. H.; Raza, A. D.

1984-01-01

Three methods of augmenting computer networks by adding at most one link per processor are discussed: (1) A tree of N nodes may be augmented such that the resulting graph has diameter no greater than 4log sub 2((N+2)/3)-2. Thi O(N(3)) algorithm can be applied to any spanning tree of a connected graph to reduce the diameter of that graph to O(log N); (2) Given a binary tree T and a chain C of N nodes each, C may be augmented to produce C so that T is a subgraph of C. This algorithm is O(N) and may be used to produce augmented chains or rings that have diameter no greater than 2log sub 2((N+2)/3) and are planar; (3) Any rectangular two-dimensional 4 (8) nearest neighbor array of size N = 2(k) may be augmented so that it can emulate a single step shuffle-exchange network of size N/2 in 3(t) time steps.

Parallel VLSI architecture emulation and the organization of APSA/MPP

NASA Technical Reports Server (NTRS)

Odonnell, John T.

1987-01-01

The Applicative Programming System Architecture (APSA) combines an applicative language interpreter with a novel parallel computer architecture that is well suited for Very Large Scale Integration (VLSI) implementation. The Massively Parallel Processor (MPP) can simulate VLSI circuits by allocating one processing element in its square array to an area on a square VLSI chip. As long as there are not too many long data paths, the MPP can simulate a VLSI clock cycle very rapidly. The APSA circuit contains a binary tree with a few long paths and many short ones. A skewed H-tree layout allows every processing element to simulate a leaf cell and up to four tree nodes, with no loss in parallelism. Emulation of a key APSA algorithm on the MPP resulted in performance 16,000 times faster than a Vax. This speed will make it possible for the APSA language interpreter to run fast enough to support research in parallel list processing algorithms.

"One-sample concept" micro-combinatory for high throughput TEM of binary films.

PubMed

Sáfrán, György

2018-04-01

Phases of thin films may remarkably differ from that of bulk. Unlike to the comprehensive data files of Binary Phase Diagrams [1] available for bulk, complete phase maps for thin binary layers do not exist. This is due to both the diverse metastable, non-equilibrium or instable phases feasible in thin films and the required volume of characterization work with analytical techniques like TEM, SAED and EDS. The aim of the present work was to develop a method that remarkably facilitates the TEM study of the diverse binary phases of thin films, or the creation of phase maps. A micro-combinatorial method was worked out that enables both preparation and study of a gradient two-component film within a single TEM specimen. For a demonstration of the technique thin Mn x Al 1- x binary samples with evolving concentration from x = 0 to x = 1 have been prepared so that the transition from pure Mn to pure Al covers a 1.5 mm long track within the 3 mm diameter TEM grid. The proposed method enables the preparation and study of thin combinatorial samples including all feasible phases as a function of composition or other deposition parameters. Contrary to known "combinatorial chemistry", in which a series of different samples are deposited in one run, and investigated, one at a time, the present micro-combinatorial method produces a single specimen condensing a complete library of a binary system that can be studied, efficiently, within a single TEM session. That provides extremely high throughput for TEM characterization of composition-dependent phases, exploration of new materials, or the construction of phase diagrams of binary films. Copyright © 2018 Elsevier B.V. All rights reserved.

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.

TreeGenes and CartograTree: Enabling visualization and analysis in forest tree genomics

Treesearch

E.S. Grau; S.A. Demurjian; H.A. Vasquez-Gross; D.G. Gessler; D.B. Neale; J.L. Wegrzyn

2017-01-01

Association studies integrating environmental, phenotypic, and genetic data are key in understanding forest tree resilience to climate change and disease. As genomic resources increase, both in terms of complete reference sequences and magnitude of individuals genotyped, researchers are better equipped to identify correlations between genetic variation and adaptive or...

Toward Complete Statistics of Massive Binary Stars: Penultimate Results from the Cygnus OB2 Radial Velocity Survey

NASA Astrophysics Data System (ADS)

Kobulnicky, Henry A.; Kiminki, Daniel C.; Lundquist, Michael J.; Burke, Jamison; Chapman, James; Keller, Erica; Lester, Kathryn; Rolen, Emily K.; Topel, Eric; Bhattacharjee, Anirban; Smullen, Rachel A.; Vargas Álvarez, Carlos A.; Runnoe, Jessie C.; Dale, Daniel A.; Brotherton, Michael M.

2014-08-01

We analyze orbital solutions for 48 massive multiple-star systems in the Cygnus OB2 association, 23 of which are newly presented here, to find that the observed distribution of orbital periods is approximately uniform in log P for P < 45 days, but it is not scale-free. Inflections in the cumulative distribution near 6 days, 14 days, and 45 days suggest key physical scales of sime0.2, sime0.4, and sime1 A.U. where yet-to-be-identified phenomena create distinct features. No single power law provides a statistically compelling prescription, but if features are ignored, a power law with exponent β ~= -0.22 provides a crude approximation over P = 1.4-2000 days, as does a piece-wise linear function with a break near 45 days. The cumulative period distribution flattens at P > 45 days, even after correction for completeness, indicating either a lower binary fraction or a shift toward low-mass companions. A high degree of similarity (91% likelihood) between the Cyg OB2 period distribution and that of other surveys suggests that the binary properties at P <~ 25 days are determined by local physics of disk/clump fragmentation and are relatively insensitive to environmental and evolutionary factors. Fully 30% of the unbiased parent sample is a binary with period P < 45 days. Completeness corrections imply a binary fraction near 55% for P < 5000 days. The observed distribution of mass ratios 0.2 < q < 1 is consistent with uniform, while the observed distribution of eccentricities 0.1 < e < 0.6 is consistent with uniform plus an excess of e ~= 0 systems. We identify six stars, all supergiants, that exhibit aperiodic velocity variations of ~30 km s-1 attributed to atmospheric fluctuations.

Enthalpy and phase behavior of coal derived liquid mixtures. Technical progress report, April-June 1986

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

Yesavage, V.F.; Kidnay, A.J.

Enthalpy measurements for the m-cresol/tetralin binary system, and the quinoline/tertralin binary system have been completed and are included. A calibration check on the calorimeter was performed and is presented in Appendix C. Vapor liquid equilibria measurements for the quinoline/tetralin system have been completed for four isotherms; 250, 275, 300, and 325/sup 0/C. These results and a summary of progress to date for the VLE apparatus are in the appendix at the end of this report. Also, preliminary work has begun on the quinoline/m-cresol/tetralin ternary system. Correlational work has consisted of the development of mathematical expressions for fugacity and enthalpy usingmore » various combinations of mixing rules and equations of state discussed in earlier reports. Also maximum likelihood routines has been written to determine the necessary parameters for binary data obtained in this investigation.« less

Characterization of apple stem grooving virus and apple chlorotic leaf spot virus identified in a crab apple tree.

PubMed

Li, Yongqiang; Deng, Congliang; Bian, Yong; Zhao, Xiaoli; Zhou, Qi

2017-04-01

Apple stem grooving virus (ASGV), apple chlorotic leaf spot virus (ACLSV), and prunus necrotic ringspot virus (PNRSV) were identified in a crab apple tree by small RNA deep sequencing. The complete genome sequence of ACLSV isolate BJ (ACLSV-BJ) was 7554 nucleotides and shared 67.0%-83.0% nucleotide sequence identity with other ACLSV isolates. A phylogenetic tree based on the complete genome sequence of all available ACLSV isolates showed that ACLSV-BJ clustered with the isolates SY01 from hawthorn, MO5 from apple, and JB, KMS and YH from pear. The complete nucleotide sequence of ASGV-BJ was 6509 nucleotides (nt) long and shared 78.2%-80.7% nucleotide sequence identity with other isolates. ASGV-BJ and the isolate ASGV_kfp clustered together in the phylogenetic tree as an independent clade. Recombination analysis showed that isolate ASGV-BJ was a naturally occurring recombinant.

Exploring the cosmic evolution of habitability with galaxy merger trees

NASA Astrophysics Data System (ADS)

Stanway, E. R.; Hoskin, M. J.; Lane, M. A.; Brown, G. C.; Childs, H. J. T.; Greis, S. M. L.; Levan, A. J.

2018-04-01

We combine inferred galaxy properties from a semi-analytic galaxy evolution model incorporating dark matter halo merger trees with new estimates of supernova and gamma-ray burst rates as a function of metallicity from stellar population synthesis models incorporating binary interactions. We use these to explore the stellar-mass fraction of galaxies irradiated by energetic astrophysical transients and its evolution over cosmic time, and thus the fraction which is potentially habitable by life like our own. We find that 18 per cent of the stellar mass in the Universe is likely to have been irradiated within the last 260 Myr, with GRBs dominating that fraction. We do not see a strong dependence of irradiated stellar-mass fraction on stellar mass or richness of the galaxy environment. We consider a representative merger tree as a Local Group analogue, and find that there are galaxies at all masses which have retained a high habitable fraction (>40 per cent) over the last 6 Gyr, but also that there are galaxies at all masses where the merger history and associated star formation have rendered galaxies effectively uninhabitable. This illustrates the need to consider detailed merger trees when evaluating the cosmic evolution of habitability.

SuperWASP J015100.23-100524.2: A SPOTTED SHALLOW-CONTACT BINARY BELOW THE PERIOD LIMIT

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

Qian, S. B.; Zhang, B.; He, J. J.

2015-10-15

SuperWASP J015100.23-100524.2 (hereafter J015100) is an eclipsing binary with an orbital period of 0.d2145 that is below the short-period limit of contact binary stars. Complete light curves of J015100 in B, V, R, and I bands are presented and are analyzed with the Wilson–Devinney method. It has been discovered that J015100 is a shallow-contact binary (f = 14.6(±2.7)%) with a mass ratio of 3.128. It is a W-type contact binary where the less massive component is about 130 K hotter than the more massive one. The asymmetries of light curves are explained as one dark spot on the more massivemore » component. The detection of J015100 as a contact binary below the period limit suggests that contact binaries below this limit are not rapidly destroyed. This shallow-contact system may be formed from a detached short-period binary similar to DV Psc (Sp. = K4/K5; P = 0.d30855) via orbital shrinkage due to angular momentum loss through magnetic stellar wind.« less

Measuring the Number of M Dwarfs per M Dwarf Using Kepler Eclipsing Binaries

NASA Astrophysics Data System (ADS)

Shan, Yutong; Johnson, John A.; Morton, Timothy D.

2015-11-01

We measure the binarity of detached M dwarfs in the Kepler field with orbital periods in the range of 1-90 days. Kepler’s photometric precision and nearly continuous monitoring of stellar targets over time baselines ranging from 3 months to 4 years make its detection efficiency for eclipsing binaries nearly complete over this period range and for all radius ratios. Our investigation employs a statistical framework akin to that used for inferring planetary occurrence rates from planetary transits. The obvious simplification is that eclipsing binaries have a vastly improved detection efficiency that is limited chiefly by their geometric probabilities to eclipse. For the M-dwarf sample observed by the Kepler Mission, the fractional incidence of eclipsing binaries implies that there are {0.11}-0.04+0.02 close stellar companions per apparently single M dwarf. Our measured binarity is higher than previous inferences of the occurrence rate of close binaries via radial velocity techniques, at roughly the 2σ level. This study represents the first use of eclipsing binary detections from a high quality transiting planet mission to infer binary statistics. Application of this statistical framework to the eclipsing binaries discovered by future transit surveys will establish better constraints on short-period M+M binary rate, as well as binarity measurements for stars of other spectral types.

Comparison of rule induction, decision trees and formal concept analysis approaches for classification

NASA Astrophysics Data System (ADS)

Kotelnikov, E. V.; Milov, V. R.

2018-05-01

Rule-based learning algorithms have higher transparency and easiness to interpret in comparison with neural networks and deep learning algorithms. These properties make it possible to effectively use such algorithms to solve descriptive tasks of data mining. The choice of an algorithm depends also on its ability to solve predictive tasks. The article compares the quality of the solution of the problems with binary and multiclass classification based on the experiments with six datasets from the UCI Machine Learning Repository. The authors investigate three algorithms: Ripper (rule induction), C4.5 (decision trees), In-Close (formal concept analysis). The results of the experiments show that In-Close demonstrates the best quality of classification in comparison with Ripper and C4.5, however the latter two generate more compact rule sets.

Image Segmentation Using Minimum Spanning Tree

NASA Astrophysics Data System (ADS)

Dewi, M. P.; Armiati, A.; Alvini, S.

2018-04-01

This research aim to segmented the digital image. The process of segmentation is to separate the object from the background. So the main object can be processed for the other purposes. Along with the development of technology in digital image processing application, the segmentation process becomes increasingly necessary. The segmented image which is the result of the segmentation process should accurate due to the next process need the interpretation of the information on the image. This article discussed the application of minimum spanning tree on graph in segmentation process of digital image. This method is able to separate an object from the background and the image will change to be the binary images. In this case, the object that being the focus is set in white, while the background is black or otherwise.

Topological numbering of features on a mesh

NASA Technical Reports Server (NTRS)

Atallah, Mikhail J.; Hambrusch, Susanne E.; Tewinkel, Lynn E.

1988-01-01

Assume a nxn binary image is given containing horizontally convex features; i.e., for each feature, each of its row's pixels form an interval on that row. The problem of assigning topological numbers to such features is considered; i.e., assign a number to every feature f so that all features to the left of f have a smaller number assigned to them. This problem arises in solutions to the stereo matching problem. A parallel algorithm to solve the topological numbering problem in O(n) time on an nxn mesh of processors is presented. The key idea of the solution is to create a tree from which the topological numbers can be obtained even though the tree does not uniquely represent the to the left of relationship of the features.

Genomic and physiological approaches to advancing forest tree improvement

Treesearch

C. Dana Nelson; Kurt H. Johnsen

2008-01-01

Summary The recent completion of a draft sequence of the poplar (Populus trichocarpa Torr. & Gray ex Brayshaw) genome has advanced forest tree genetics to an unprecedented level. A "parts list" for a forest tree has been produced, opening up new opportunities for dissecting the interworkings of tree growth and development. In the relatively near future we...

Determinants of farmers' tree planting investment decision as a degraded landscape management strategy in the central highlands of Ethiopia

NASA Astrophysics Data System (ADS)

Gessesse, B.; Bewket, W.; Bräuning, A.

2015-11-01

Land degradation due to lack of sustainable land management practices are one of the critical challenges in many developing countries including Ethiopia. This study explores the major determinants of farm level tree planting decision as a land management strategy in a typical framing and degraded landscape of the Modjo watershed, Ethiopia. The main data were generated from household surveys and analysed using descriptive statistics and binary logistic regression model. The model significantly predicted farmers' tree planting decision (Chi-square = 37.29, df = 15, P<0.001). Besides, the computed significant value of the model suggests that all the considered predictor variables jointly influenced the farmers' decision to plant trees as a land management strategy. In this regard, the finding of the study show that local land-users' willingness to adopt tree growing decision is a function of a wide range of biophysical, institutional, socioeconomic and household level factors, however, the likelihood of household size, productive labour force availability, the disparity of schooling age, level of perception of the process of deforestation and the current land tenure system have positively and significantly influence on tree growing investment decisions in the study watershed. Eventually, the processes of land use conversion and land degradation are serious which in turn have had adverse effects on agricultural productivity, local food security and poverty trap nexus. Hence, devising sustainable and integrated land management policy options and implementing them would enhance ecological restoration and livelihood sustainability in the study watershed.

Determinants of farmers' tree-planting investment decisions as a degraded landscape management strategy in the central highlands of Ethiopia

NASA Astrophysics Data System (ADS)

Gessesse, Berhan; Bewket, Woldeamlak; Bräuning, Achim

2016-04-01

Land degradation due to lack of sustainable land management practices is one of the critical challenges in many developing countries including Ethiopia. This study explored the major determinants of farm-level tree-planting decisions as a land management strategy in a typical farming and degraded landscape of the Modjo watershed, Ethiopia. The main data were generated from household surveys and analysed using descriptive statistics and a binary logistic regression model. The model significantly predicted farmers' tree-planting decisions (χ2 = 37.29, df = 15, P < 0.001). Besides, the computed significant value of the model revealed that all the considered predictor variables jointly influenced the farmers' decisions to plant trees as a land management strategy. The findings of the study demonstrated that the adoption of tree-growing decisions by local land users was a function of a wide range of biophysical, institutional, socioeconomic and household-level factors. In this regard, the likelihood of household size, productive labour force availability, the disparity of schooling age, level of perception of the process of deforestation and the current land tenure system had a critical influence on tree-growing investment decisions in the study watershed. Eventually, the processes of land-use conversion and land degradation were serious, which in turn have had adverse effects on agricultural productivity, local food security and poverty trap nexus. Hence, the study recommended that devising and implementing sustainable land management policy options would enhance ecological restoration and livelihood sustainability in the study watershed.

Scoring-and-unfolding trimmed tree assembler: concepts, constructs and comparisons.

PubMed

Narzisi, Giuseppe; Mishra, Bud

2011-01-15

Mired by its connection to a well-known -complete combinatorial optimization problem-namely, the Shortest Common Superstring Problem (SCSP)-historically, the whole-genome sequence assembly (WGSA) problem has been assumed to be amenable only to greedy and heuristic methods. By placing efficiency as their first priority, these methods opted to rely only on local searches, and are thus inherently approximate, ambiguous or error prone, especially, for genomes with complex structures. Furthermore, since choice of the best heuristics depended critically on the properties of (e.g. errors in) the input data and the available long range information, these approaches hindered designing an error free WGSA pipeline. We dispense with the idea of limiting the solutions to just the approximated ones, and instead favor an approach that could potentially lead to an exhaustive (exponential-time) search of all possible layouts. Its computational complexity thus must be tamed through a constrained search (Branch-and-Bound) and quick identification and pruning of implausible overlays. For his purpose, such a method necessarily relies on a set of score functions (oracles) that can combine different structural properties (e.g. transitivity, coverage, physical maps, etc.). We give a detailed description of this novel assembly framework, referred to as Scoring-and-Unfolding Trimmed Tree Assembler (SUTTA), and present experimental results on several bacterial genomes using next-generation sequencing technology data. We also report experimental evidence that the assembly quality strongly depends on the choice of the minimum overlap parameter k. SUTTA's binaries are freely available to non-profit institutions for research and educational purposes at http://www.bioinformatics.nyu.edu.

Information Encoding on a Pseudo Random Noise Radar Waveform

DTIC Science & Technology

2013-03-01

quadrature mirror filter bank (QMFB) tree diagram [18] . . . . . . . . . . . 18 2.7 QMFB layer 3 contour plot for 7-bit barker code binary phase shift...test signal . . . . . . . . 20 2.9 Block diagram of the FFT accumulation method (FAM) time smoothing method to estimate the spectral correlation ... Samples A m pl itu de (b) Correlator output for an WGN pulse in a AWGN channel Figure 2.2: Effectiveness of correlation for SNR = -10 dB 10 2.3 Radar

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.

Effective description of general extensions of the Standard Model: the complete tree-level dictionary

NASA Astrophysics Data System (ADS)

de Blas, J.; Criado, J. C.; Pérez-Victoria, M.; Santiago, J.

2018-03-01

We compute all the tree-level contributions to the Wilson coefficients of the dimension-six Standard-Model effective theory in ultraviolet completions with general scalar, spinor and vector field content and arbitrary interactions. No assumption about the renormalizability of the high-energy theory is made. This provides a complete ultraviolet/infrared dictionary at the classical level, which can be used to study the low-energy implications of any model of interest, and also to look for explicit completions consistent with low-energy data.

Applying an Ensemble Classification Tree Approach to the Prediction of Completion of a 12-Step Facilitation Intervention with Stimulant Abusers

PubMed Central

Doyle, Suzanne R.; Donovan, Dennis M.

2014-01-01

Aims The purpose of this study was to explore the selection of predictor variables in the evaluation of drug treatment completion using an ensemble approach with classification trees. The basic methodology is reviewed and the subagging procedure of random subsampling is applied. Methods Among 234 individuals with stimulant use disorders randomized to a 12-Step facilitative intervention shown to increase stimulant use abstinence, 67.52% were classified as treatment completers. A total of 122 baseline variables were used to identify factors associated with completion. Findings The number of types of self-help activity involvement prior to treatment was the predominant predictor. Other effective predictors included better coping self-efficacy for substance use in high-risk situations, more days of prior meeting attendance, greater acceptance of the Disease model, higher confidence for not resuming use following discharge, lower ASI Drug and Alcohol composite scores, negative urine screens for cocaine or marijuana, and fewer employment problems. Conclusions The application of an ensemble subsampling regression tree method utilizes the fact that classification trees are unstable but, on average, produce an improved prediction of the completion of drug abuse treatment. The results support the notion there are early indicators of treatment completion that may allow for modification of approaches more tailored to fitting the needs of individuals and potentially provide more successful treatment engagement and improved outcomes. PMID:25134038

Fundamental studies in X-ray astrophysics

NASA Technical Reports Server (NTRS)

Lamb, D. Q.; Lightman, A. P.

1982-01-01

An analytical model calculation of the ionization structure of matter accreting onto a degenerate dwarf was carried out. Self-consistent values of the various parameters are used. The possibility of nuclear burning of the accreting matter is included. We find the blackbody radiation emitted from the stellar surface keeps hydrogen and helium ionized out to distances much larger than a typical binary separation. Except for low mass stars or high accretion rates, the assumption of complete ionization of the elements heavier than helium is a good first approximation. For low mass stars or high accretion rates the validity of assuming complete ionization depends sensitivity on the distribution of matter in the binary system.

An approach for combining airborne LiDAR and high-resolution aerial color imagery using Gaussian processes

NASA Astrophysics Data System (ADS)

Liu, Yansong; Monteiro, Sildomar T.; Saber, Eli

2015-10-01

Changes in vegetation cover, building construction, road network and traffic conditions caused by urban expansion affect the human habitat as well as the natural environment in rapidly developing cities. It is crucial to assess these changes and respond accordingly by identifying man-made and natural structures with accurate classification algorithms. With the increase in use of multi-sensor remote sensing systems, researchers are able to obtain a more complete description of the scene of interest. By utilizing multi-sensor data, the accuracy of classification algorithms can be improved. In this paper, we propose a method for combining 3D LiDAR point clouds and high-resolution color images to classify urban areas using Gaussian processes (GP). GP classification is a powerful non-parametric classification method that yields probabilistic classification results. It makes predictions in a way that addresses the uncertainty of real world. In this paper, we attempt to identify man-made and natural objects in urban areas including buildings, roads, trees, grass, water and vehicles. LiDAR features are derived from the 3D point clouds and the spatial and color features are extracted from RGB images. For classification, we use the Laplacian approximation for GP binary classification on the new combined feature space. The multiclass classification has been implemented by using one-vs-all binary classification strategy. The result of applying support vector machines (SVMs) and logistic regression (LR) classifier is also provided for comparison. Our experiments show a clear improvement of classification results by using the two sensors combined instead of each sensor separately. Also we found the advantage of applying GP approach to handle the uncertainty in classification result without compromising accuracy compared to SVM, which is considered as the state-of-the-art classification method.

[A strategy for assessing environmental influence on airway allergy using a regression binary tree-based method].

PubMed

Yoshioka, Fumi; Azuma, Emiko; Nakajima, Takae; Hashimoto, Masafumi; Toyoshima, Kyoichiro; Komachi, Yoshio

2004-08-01

To clarify the living environment factors that increase the risk of allergic sensitization to house dust mites, we applied a regression binary tree-based method (CART, Classification & Regression Trees) to an epidemiological study on airway allergy. The utility of the tree map in personal sanitary guidance for preventing allergic sensitization was examined with respect to feasibility and validity. A questionnaire was given to 386 healthy adult women, asking them about their individual living environments. Also, blood samples were collected to measure Dermatophagoides pteronyssinus (Dp)-specific IgE, the presence/absence of Dp-sensitization being expressed as positive/negative. The questionnaire consisted of nine items on (1) home ventilation by keeping windows open, (2) personal or family smoking habits, (3) use of air conditioners in hot weather, (4) type of flooring (tatami/wooden/carpet) in the living room, (5) visible mold proliferation in the kitchen, (6) type of housing (concrete/wooden), (7) residential area (heavy or light traffic area) (8) heating system (use of unventilated combustion appliances), and (9) frequency of cleaning (every day or less often). There also were queries on the past history of airway allergic diseases, such as bronchial asthma and allergic rhinitis. CART and a multivariate logistic regression analysis (MLRA) were performed. The subjects were first classified into two groups, with and without a history of airway allergic diseases (Groups WPH and WOPH). In each group, the involvement of living environment factors in Dp-sensitization was examined using CART and MLRA. In the MLRA study, individual living environment factors showed promotional or suppressive effects on Dp-sensitization with differences between the two groups. With respect to the CART results, the two groups were first split by the factor that had the most significant odds ratio for MLRA. In Group WPH, which had a Dp-sensitization risk of 19.5%, the first split was by the factor of visible mold proliferation in the kitchen into the factor-present group with a risk value of 45.5% and the factor-absent group with 13.5%. The mold proliferation group was split with reference to frequent cleaning, and the risk rose to 75% in the factor-absent group and to 100% when family smoking habits were reported. Group WOPH (the risk: 10.8%) was first split into two groups according to the use of air conditioners in hot weather for more than 6 hours a day or less, which showed risk values of 16.7% and 6.9%, respectively. The risk of the group that intensively used air conditioners fell to 8.3% with tatami as flooring in the living room, and, if others, rose to 20.8%. The risk of the factor-lacking group fell to 4.0% without wooden flooring. CART analysis enables us to express complex relationships between living environment factors and Dp-sensitization simply by a binary regression tree, pointing to preventive strategies that can be flexibly changed according to the individual living environments of the subjects.

Low-Frequency Gravitational Radiation from Coalescing Massive Black Hole Binaries in Hierarchical Cosmologies

NASA Astrophysics Data System (ADS)

Sesana, Alberto; Haardt, Francesco; Madau, Piero; Volonteri, Marta

2004-08-01

We compute the expected low-frequency gravitational wave signal from coalescing massive black hole (MBH) binaries at the center of galaxies in a hierarchical structure formation scenario in which seed holes of intermediate mass form far up in the dark halo ``merger tree.'' The merger history of dark matter halos and associated MBHs is followed via cosmological Monte Carlo realizations of the merger hierarchy from redshift z=20 to the present in a ΛCDM cosmology. MBHs get incorporated through halo mergers into larger and larger structures, sink to the center because of dynamical friction against the dark matter background, accrete cold material in the merger remnant, and form MBH binary systems. Stellar dynamical (three-body) interactions cause the hardening of the binary at large separations, while gravitational wave emission takes over at small radii and leads to the final coalescence of the pair. A simple scheme is applied in which the ``loss cone'' is constantly refilled and a constant stellar density core forms because of the ejection of stars by the shrinking binary. The integrated emission from inspiraling MBH binaries at all redshifts is computed in the quadrupole approximation and results in a gravitational wave background (GWB) with a well-defined shape that reflects the different mechanisms driving the late orbital evolution. The characteristic strain spectrum has the standard hc(f)~f-2/3 behavior only in the range f=10-9to10-6 Hz. At lower frequencies the orbital decay of MBH binaries is driven by the ejection of background stars (``gravitational slingshot''), and the strain amplitude increases with frequency, hc(f)~f. In this range the GWB is dominated by 109-1010 Msolar MBH pairs coalescing at 0<~z<~2. At higher frequencies, f>10-6Hz, the strain amplitude, as steep as hc(f)~f-1.3, is shaped by the convolution of last stable circular orbit emission by lighter binaries (102-107 Msolar) populating galaxy halos at all redshifts. We discuss the observability of inspiraling MBH binaries by a low-frequency gravitational wave experiment such as the planned Laser Interferometer Space Antenna (LISA). Over a 3 yr observing period LISA should resolve this GWB into discrete sources, detecting ~60 (~250) individual events above an S/N=5 (S/N=1) confidence level.

Photometric Analysis and Modeling of Five Mass-Transferring Binary Systems

NASA Astrophysics Data System (ADS)

Geist, Emily; Beaky, Matthew; Jamison, Kate

2018-01-01

In overcontact eclipsing binary systems, both stellar components have overfilled their Roche lobes, resulting in a dumbbell-shaped shared envelope. Mass transfer is common in overcontact binaries, which can be observed as a slow change on the rotation period of the system.We studied five overcontact eclipsing binary systems with evidence of period change, and thus likely mass transfer between the components, identified by Nelson (2014): V0579 Lyr, KN Vul, V0406 Lyr, V2240 Cyg, and MS Her. We used the 31-inch NURO telescope at Lowell Observatory in Flagstaff, Arizona to obtain images in B,V,R, and I filters for V0579 Lyr, and the 16-inch Meade LX200GPS telescope with attached SBIG ST-8XME CCD camera at Juniata College in Huntingdon, Pennsylvania to image KN Vul, V0406 Lyr, V2240 Cyg, and MS Her, also in B,V,R, and I.After data reduction, we created light curves for each of the systems and modeled the eclipsing binaries using the BinaryMaker3 and PHOEBE programs to determine their fundamental physical parameters for the first time. Complete light curves and preliminary models for each of these neglected eclipsing binary systems will be presented.

Research in astrophysical processes

NASA Technical Reports Server (NTRS)

Ruderman, Malvin A.

1994-01-01

Work completed under this grant is summarized in the following areas:(1) radio pulsar turn on and evaporation of companions in very low mass x-ray binaries and in binary radio pulsar systems; (2) effects of magnetospheric pair production on the radiation from gamma-ray pulsars; (3) radiation transfer in the atmosphere of an illuminated companion star; (4) evaporation of millisecond pulsar companions;(5) formation of planets around pulsars; (6) gamma-ray bursts; (7) quasi-periodic oscillations in low mass x-ray binaries; (8) origin of high mass x-ray binaries, runaway OB stars, and the lower mass cutoff for core collapse supernovae; (9) dynamics of planetary atmospheres; (10) two point closure modeling of stationary, forced turbulence; (11) models for the general circulation of Saturn; and (12) compressible convection in stellar interiors.

The Solar-Type Hard-Binary Frequency and Distributions of Orbital Parameters in the Open Cluster M37

NASA Astrophysics Data System (ADS)

Geller, Aaron M.; Meibom, Soren; Barnes, Sydney A.; Mathieu, Robert D.

2014-02-01

Binary stars, and particularly the short-period ``hard'' binaries, govern the dynamical evolution of star clusters and determine the formation rates and mechanisms for exotic stars like blue stragglers and X-ray sources. Understanding the near-primordial hard-binary population of star clusters is of primary importance for dynamical models of star clusters, which have the potential to greatly advance our understanding of star cluster evolution. Yet the binary frequencies and distributions of binary orbital parameters (period, eccentricity, etc.) for young coeval stellar populations are poorly known, due to a lack of necessary observations. The young (~540 Myr) open cluster M37 hosts a rich binary population that can be used to empirically define these initial conditions. Importantly, this cluster has been the target of a comprehensive WIYN/Hydra radial-velocity (RV) survey, from which we have already identified a nearly complete sample of 329 solar-type (1.5 <=M [M_⊙] <=1.0) members in M37. Of these stars, 82 show significant RV variability, indicative of a binary companion. We propose to build upon these data with a multi-epoch RV survey using WIYN/Hydra to derive kinematic orbital solutions for these 82 binaries in M37. This project was granted time in 2013B and scheduled for later this year. We anticipate that about half of the detected binaries in M37 will acquire enough RV measurements (>=10) in 2013B to begin searching for orbital solutions. With this proposal and perhaps one additional semester we should achieve >=10 RV measurements for the remaining binaries.

UV Chromospheric Activity in Cool, Short-Period Contact Binaries

NASA Technical Reports Server (NTRS)

Hrivnak, Bruce J.

2000-01-01

We have completed our analysis of the IUE spectra of the short-period contact binary OO Aql. OO Aql is a rare W UMa-type eclipsing binary in which the two solar-type stars may have only recently evolved into contact. The binary has an unusually high mass ratio (0.84), and a relatively long orbital period (0.506 d) for its spectral type (mid-G). Twelve ultraviolet spectra of OO Aql were obtained in 1988 with the IUE satellite, including a series of consecutive observations that cover nearly a complete orbital cycle. Chromospheric activity is studied by means of the Mg II h+k emission at 2800 A. The Mg II emission is found to vary, even when the emission is normalized to the adjacent continuum flux. This variation may be correlated with orbital phase in the 1988 observations. It also appears that the normalized Mg H emission varies with time, as seen in spectra obtained at two different epochs in 1988 and when compared with two spectra obtained several years earlier. The level of chromospheric activity in OO Aql is less than that of other W UMa-type binaries of similar colors, but this is attributed to its early stage of contact binary evolution. Ultraviolet light curves were composed from measurements of the ultraviolet continuum in the spectra. These were analyzed along with visible light curves of OO Aql to determine the system parameters. The large wavelength range in the light curves enabled a well-constrained fit to a cool spot in the system. A paper on these results is scheduled for publication in the February 2001 issue of the Astronomical Journal.

Tree Testing of Hierarchical Menu Structures for Health Applications

PubMed Central

Le, Thai; Chaudhuri, Shomir; Chung, Jane; Thompson, Hilaire J; Demiris, George

2014-01-01

To address the need for greater evidence-based evaluation of Health Information Technology (HIT) systems we introduce a method of usability testing termed tree testing. In a tree test, participants are presented with an abstract hierarchical tree of the system taxonomy and asked to navigate through the tree in completing representative tasks. We apply tree testing to a commercially available health application, demonstrating a use case and providing a comparison with more traditional in-person usability testing methods. Online tree tests (N=54) and in-person usability tests (N=15) were conducted from August to September 2013. Tree testing provided a method to quantitatively evaluate the information structure of a system using various navigational metrics including completion time, task accuracy, and path length. The results of the analyses compared favorably to the results seen from the traditional usability test. Tree testing provides a flexible, evidence-based approach for researchers to evaluate the information structure of HITs. In addition, remote tree testing provides a quick, flexible, and high volume method of acquiring feedback in a structured format that allows for quantitative comparisons. With the diverse nature and often large quantities of health information available, addressing issues of terminology and concept classifications during the early development process of a health information system will improve navigation through the system and save future resources. Tree testing is a usability method that can be used to quickly and easily assess information hierarchy of health information systems. PMID:24582924

Complete Genome Sequence of Spiroplasma floricola 23-6T (ATCC 29989), a Bacterium Isolated from a Tulip Tree (Liriodendron tulipifera L.).

PubMed

Tsai, Yi-Ming; Wu, Pei-Shan; Lo, Wen-Sui; Kuo, Chih-Horng

2018-04-19

Spiroplasma floricola 23-6 T (ATCC 29989) was isolated from the flower surface of a tulip tree ( Liriodendron tulipifera L.). Here, we report the complete genome sequence of this bacterium to facilitate the investigation of its biology and the comparative genomics among Spiroplasma species. Copyright © 2018 Tsai et al.

Molecular Characterization of the Meyer Lemon Isolate of Citrus Tatter Leaf Virus: Complete Genome Sequence and Development of Biologically Active In Vitro Transcripts

USDA-ARS?s Scientific Manuscript database

Citrus tatter leaf virus isolated from Meyer lemon trees (CTLV-ML) from California and Florida induces bud union incompatibility of citrus trees grafted on the widely used trifoliate and trifoliate hybrid rootstocks. The complete genome sequence of CTLV-ML was determined to be 6,495 nucleotides (nts...

7 CFR 1416.703 - Application process.

Code of Federal Regulations, 2010 CFR

2010-01-01

... PROGRAMS 2005 Hurricane Tree Assistance Program § 1416.703 Application process. (a) A complete application... geographic location and number of acres in the disaster-affected stand of claimed trees, bushes, and vines according to part 718 of this title; (3) A written estimate of the number of acres of trees, bushes or vines...

Social Studies: It's a Family Affair.

ERIC Educational Resources Information Center

Melendez, Ruth

1999-01-01

Describes an elementary-level family tree project for social studies classes that teaches students about their personal history and the country's diverse culture. Children complete a family tree chart, then the class creates visual presentations using a world map and bar graph. Finally, students write summary statements based on the family trees,…

Water Transport in Trees--An Artificial Laboratory Tree

ERIC Educational Resources Information Center

Susman, K.; Razpet, N.; Cepic, M.

2011-01-01

Water transport in tall trees is an everyday phenomenon, seldom noticed and not completely understood even by scientists. As a topic of current research in plant physiology it has several advantages for presentation within school physics lectures: it is interdisciplinary and clearly shows the connection between physics and biology; the…

GSHR-Tree: a spatial index tree based on dynamic spatial slot and hash table in grid environments

NASA Astrophysics Data System (ADS)

Chen, Zhanlong; Wu, Xin-cai; Wu, Liang

2008-12-01

Computation Grids enable the coordinated sharing of large-scale distributed heterogeneous computing resources that can be used to solve computationally intensive problems in science, engineering, and commerce. Grid spatial applications are made possible by high-speed networks and a new generation of Grid middleware that resides between networks and traditional GIS applications. The integration of the multi-sources and heterogeneous spatial information and the management of the distributed spatial resources and the sharing and cooperative of the spatial data and Grid services are the key problems to resolve in the development of the Grid GIS. The performance of the spatial index mechanism is the key technology of the Grid GIS and spatial database affects the holistic performance of the GIS in Grid Environments. In order to improve the efficiency of parallel processing of a spatial mass data under the distributed parallel computing grid environment, this paper presents a new grid slot hash parallel spatial index GSHR-Tree structure established in the parallel spatial indexing mechanism. Based on the hash table and dynamic spatial slot, this paper has improved the structure of the classical parallel R tree index. The GSHR-Tree index makes full use of the good qualities of R-Tree and hash data structure. This paper has constructed a new parallel spatial index that can meet the needs of parallel grid computing about the magnanimous spatial data in the distributed network. This arithmetic splits space in to multi-slots by multiplying and reverting and maps these slots to sites in distributed and parallel system. Each sites constructs the spatial objects in its spatial slot into an R tree. On the basis of this tree structure, the index data was distributed among multiple nodes in the grid networks by using large node R-tree method. The unbalance during process can be quickly adjusted by means of a dynamical adjusting algorithm. This tree structure has considered the distributed operation, reduplication operation transfer operation of spatial index in the grid environment. The design of GSHR-Tree has ensured the performance of the load balance in the parallel computation. This tree structure is fit for the parallel process of the spatial information in the distributed network environments. Instead of spatial object's recursive comparison where original R tree has been used, the algorithm builds the spatial index by applying binary code operation in which computer runs more efficiently, and extended dynamic hash code for bit comparison. In GSHR-Tree, a new server is assigned to the network whenever a split of a full node is required. We describe a more flexible allocation protocol which copes with a temporary shortage of storage resources. It uses a distributed balanced binary spatial tree that scales with insertions to potentially any number of storage servers through splits of the overloaded ones. The application manipulates the GSHR-Tree structure from a node in the grid environment. The node addresses the tree through its image that the splits can make outdated. This may generate addressing errors, solved by the forwarding among the servers. In this paper, a spatial index data distribution algorithm that limits the number of servers has been proposed. We improve the storage utilization at the cost of additional messages. The structure of GSHR-Tree is believed that the scheme of this grid spatial index should fit the needs of new applications using endlessly larger sets of spatial data. Our proposal constitutes a flexible storage allocation method for a distributed spatial index. The insertion policy can be tuned dynamically to cope with periods of storage shortage. In such cases storage balancing should be favored for better space utilization, at the price of extra message exchanges between servers. This structure makes a compromise in the updating of the duplicated index and the transformation of the spatial index data. Meeting the needs of the grid computing, GSHRTree has a flexible structure in order to satisfy new needs in the future. The GSHR-Tree provides the R-tree capabilities for large spatial datasets stored over interconnected servers. The analysis, including the experiments, confirmed the efficiency of our design choices. The scheme should fit the needs of new applications of spatial data, using endlessly larger datasets. Using the system response time of the parallel processing of spatial scope query algorithm as the performance evaluation factor, According to the result of the simulated the experiments, GSHR-Tree is performed to prove the reasonable design and the high performance of the indexing structure that the paper presented.

LDFT-based watermarking resilient to local desynchronization attacks.

PubMed

Tian, Huawei; Zhao, Yao; Ni, Rongrong; Qin, Lunming; Li, Xuelong

2013-12-01

Up to now, a watermarking scheme that is robust against desynchronization attacks (DAs) is still a grand challenge. Most image watermarking resynchronization schemes in literature can survive individual global DAs (e.g., rotation, scaling, translation, and other affine transforms), but few are resilient to challenging cropping and local DAs. The main reason is that robust features for watermark synchronization are only globally invariable rather than locally invariable. In this paper, we present a blind image watermarking resynchronization scheme against local transform attacks. First, we propose a new feature transform named local daisy feature transform (LDFT), which is not only globally but also locally invariable. Then, the binary space partitioning (BSP) tree is used to partition the geometrically invariant LDFT space. In the BSP tree, the location of each pixel is fixed under global transform, local transform, and cropping. Lastly, the watermarking sequence is embedded bit by bit into each leaf node of the BSP tree by using the logarithmic quantization index modulation watermarking embedding method. Simulation results show that the proposed watermarking scheme can survive numerous kinds of distortions, including common image-processing attacks, local and global DAs, and noninvertible cropping.

Testing the impact of morphological rate heterogeneity on ancestral state reconstruction of five floral traits in angiosperms.

PubMed

Reyes, Elisabeth; Nadot, Sophie; von Balthazar, Maria; Schönenberger, Jürg; Sauquet, Hervé

2018-06-21

Ancestral state reconstruction is an important tool to study morphological evolution and often involves estimating transition rates among character states. However, various factors, including taxonomic scale and sampling density, may impact transition rate estimation and indirectly also the probability of the state at a given node. Here, we test the influence of rate heterogeneity using maximum likelihood methods on five binary perianth characters, optimized on a phylogenetic tree of angiosperms including 1230 species sampled from all families. We compare the states reconstructed by an equal-rate (Mk1) and a two-rate model (Mk2) fitted either with a single set of rates for the whole tree or as a partitioned model, allowing for different rates on five partitions of the tree. We find strong signal for rate heterogeneity among the five subdivisions for all five characters, but little overall impact of the choice of model on reconstructed ancestral states, which indicates that most of our inferred ancestral states are the same whether heterogeneity is accounted for or not.

Ensemble of trees approaches to risk adjustment for evaluating a hospital's performance.

PubMed

Liu, Yang; Traskin, Mikhail; Lorch, Scott A; George, Edward I; Small, Dylan

2015-03-01

A commonly used method for evaluating a hospital's performance on an outcome is to compare the hospital's observed outcome rate to the hospital's expected outcome rate given its patient (case) mix and service. The process of calculating the hospital's expected outcome rate given its patient mix and service is called risk adjustment (Iezzoni 1997). Risk adjustment is critical for accurately evaluating and comparing hospitals' performances since we would not want to unfairly penalize a hospital just because it treats sicker patients. The key to risk adjustment is accurately estimating the probability of an Outcome given patient characteristics. For cases with binary outcomes, the method that is commonly used in risk adjustment is logistic regression. In this paper, we consider ensemble of trees methods as alternatives for risk adjustment, including random forests and Bayesian additive regression trees (BART). Both random forests and BART are modern machine learning methods that have been shown recently to have excellent performance for prediction of outcomes in many settings. We apply these methods to carry out risk adjustment for the performance of neonatal intensive care units (NICU). We show that these ensemble of trees methods outperform logistic regression in predicting mortality among babies treated in NICU, and provide a superior method of risk adjustment compared to logistic regression.

The range and valence of a real Smirnov function

NASA Astrophysics Data System (ADS)

Ferguson, Timothy; Ross, William T.

2018-02-01

We give a complete description of the possible ranges of real Smirnov functions (quotients of two bounded analytic functions on the open unit disk where the denominator is outer and such that the radial boundary values are real almost everywhere on the unit circle). Our techniques use the theory of unbounded symmetric Toeplitz operators, some general theory of unbounded symmetric operators, classical Hardy spaces, and an application of the uniformization theorem. In addition, we completely characterize the possible valences for these real Smirnov functions when the valence is finite. To do so we construct Riemann surfaces we call disk trees by welding together copies of the unit disk and its complement in the Riemann sphere. We also make use of certain trees we call valence trees that mirror the structure of disk trees.

Likelihoods for fixed rank nomination networks

PubMed Central

HOFF, PETER; FOSDICK, BAILEY; VOLFOVSKY, ALEX; STOVEL, KATHERINE

2014-01-01

Many studies that gather social network data use survey methods that lead to censored, missing, or otherwise incomplete information. For example, the popular fixed rank nomination (FRN) scheme, often used in studies of schools and businesses, asks study participants to nominate and rank at most a small number of contacts or friends, leaving the existence of other relations uncertain. However, most statistical models are formulated in terms of completely observed binary networks. Statistical analyses of FRN data with such models ignore the censored and ranked nature of the data and could potentially result in misleading statistical inference. To investigate this possibility, we compare Bayesian parameter estimates obtained from a likelihood for complete binary networks with those obtained from likelihoods that are derived from the FRN scheme, and therefore accommodate the ranked and censored nature of the data. We show analytically and via simulation that the binary likelihood can provide misleading inference, particularly for certain model parameters that relate network ties to characteristics of individuals and pairs of individuals. We also compare these different likelihoods in a data analysis of several adolescent social networks. For some of these networks, the parameter estimates from the binary and FRN likelihoods lead to different conclusions, indicating the importance of analyzing FRN data with a method that accounts for the FRN survey design. PMID:25110586

Flip-flopping binary black holes.

PubMed

Lousto, Carlos O; Healy, James

2015-04-10

We study binary spinning black holes to display the long term individual spin dynamics. We perform a full numerical simulation starting at an initial proper separation of d≈25M between equal mass holes and evolve them down to merger for nearly 48 orbits, 3 precession cycles, and half of a flip-flop cycle. The simulation lasts for t=20 000M and displays a total change in the orientation of the spin of one of the black holes from an initial alignment with the orbital angular momentum to a complete antialignment after half of a flip-flop cycle. We compare this evolution with an integration of the 3.5 post-Newtonian equations of motion and spin evolution to show that this process continuously flip flops the spin during the lifetime of the binary until merger. We also provide lower order analytic expressions for the maximum flip-flop angle and frequency. We discuss the effects this dynamics may have on spin growth in accreting binaries and on the observational consequences for galactic and supermassive binary black holes.

Using Pipe Cleaners to Bring the Tree of Life to Life

ERIC Educational Resources Information Center

Halverson, Kristy L.

2010-01-01

Phylogenetic trees, such as the "Tree of Life," are commonly found in biology textbooks and are often used in teaching. Because students often struggle to understand these diagrams, I developed a simple, inexpensive classroom model. Made of pipe cleaners, it is easily manipulated to rotate branches, compare topologies, map complete lineages,…

7 CFR 1410.22 - CRP conservation plan.

Code of Federal Regulations, 2010 CFR

2010-01-01

.... (c) If applicable, a tree planting plan shall be developed and included in the CRP conservation plan. Such tree planting plan may allow up to 3 years to complete plantings if 10 or more acres of hardwood trees are to be established. (d) If applicable, the CRP conservation plan shall address the goals...

7 CFR 783.5 - Application.

Code of Federal Regulations, 2010 CFR

2010-01-01

... SPECIAL PROGRAMS TREE ASSISTANCE PROGRAM § 783.5 Application. (a) A complete application for TAP benefits... written estimate of the number of trees, bushes or vines lost or damaged which is prepared by the owner or... the number of acres involved by on-site visual inspection of the land and trees, bushes or vines. (3...

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

Zhuang Quntao; Gao Xun; Yu Qingjuan, E-mail: yuqj@pku.edu.cn

In this paper, we study possible signatures of binary planets or exomoons on the Rossiter-McLaughlin (R-M) effect. Our analyses show that the R-M effect for a binary planet or an exomoon during its complete transit phase can be divided into two parts. The first is the conventional one similar to the R-M effect from the transit of a single planet, of which the mass and the projected area are the combinations of the binary components; the second is caused by the orbital rotation of the binary components, which may add a sine- or linear-mode deviation to the stellar radial velocitymore » curve. We find that the latter effect can be up to several ten m s{sup -1}. Our numerical simulations as well as analyses illustrate that the distribution and dispersion of the latter effects obtained from multiple transit events can be used to constrain the dynamical configuration of the binary planet, such as how the inner orbit of the binary planet is inclined to its orbit rotating around the central star. We find that the signatures caused by the orbital rotation of the binary components are more likely to be revealed if the two components of a binary planet have different masses and mass densities, especially if the heavy one has a high mass density and the light one has a low density. Similar signatures on the R-M effect may also be revealed in a hierarchical triple star system containing a dark compact binary and a tertiary star.« less

Assisted stellar suicide in V617 Sagittarii

NASA Astrophysics Data System (ADS)

Steiner, J. E.; Oliveira, A. S.; Cieslinski, D.; Ricci, T. V.

2006-02-01

Context: .V617 Sgr is a V Sagittae star - a group of binaries thought to be the galactic counterparts of the Compact Binary Supersoft X-ray Sources - CBSS. Aims: .To check this hypothesis, we measured the time derivative of its orbital period. Methods: .Observed timings of eclipse minima spanning over 30 000 orbital cycles are presented. Results: .We found that the orbital period evolves quite rapidly: P/dot{P} = 1.1×106 years. This is consistent with the idea that V617 Sgr is a wind driven accretion supersoft source. As the binary system evolves with a time-scale of about one million years, which is extremely short for a low mass evolved binary, it is likely that the system will soon end either by having its secondary completely evaporated or by the primary exploding as a supernova of type Ia. Conclusions: .

The Young Visual Binary Survey

NASA Astrophysics Data System (ADS)

Prato, Lisa; Avilez, Ian; Lindstrom, Kyle; Graham, Sean; Sullivan, Kendall; Biddle, Lauren; Skiff, Brian; Nofi, Larissa; Schaefer, Gail; Simon, Michal

2018-01-01

Differences in the stellar and circumstellar properties of the components of young binaries provide key information about star and disk formation and evolution processes. Because objects with separations of a few to a few hundred astronomical units share a common environment and composition, multiple systems allow us to control for some of the factors which play into star formation. We are completing analysis of a rich sample of about 100 pre-main sequence binaries and higher order multiples, primarily located in the Taurus and Ophiuchus star forming regions. This poster will highlight some of out recent, exciting results. All reduced spectra and the results of our analysis will be publicly available to the community at http://jumar.lowell.edu/BinaryStars/. Support for this research was provided in part by NSF award AST-1313399 and by NASA Keck KPDA funding.

Contact binaries in the Trans-neptunian Belt

NASA Astrophysics Data System (ADS)

Thirouin, Audrey; Sheppard, Scott S.

2017-10-01

A contact binary is made up of two objects that are almost touching or in contact with each other. These systems have been found in the Near-Earth Object population, the main belt of asteroids, the Jupiter Trojans, the comet population and even in the Trans-neptunian belt.Several studies suggest that up to 30% of the Trans-Neptunian Objects (TNOs) could be contact binaries (Sheppard & Jewitt 2004, Lacerda 2011). Contact binaries are not resolvable with the Hubble Space Telescope because of the small separation between the system's components (Noll et al. 2008). Only lightcurves with a characteristic V-/U-shape at the minimum/maximum of brightness and a large amplitude can identify these contact binaries. Despite an expected high fraction of contact binaries, 2001 QG298 is the only confirmed contact binary in the Trans-Neptunian belt, and 2003 SQ317 is a candidate to this class of systems (Sheppard & Jewitt 2004, Lacerda et al. 2014).Recently, using the Lowell’s 4.3m Discovery Channel Telescope and the 6.5m Magellan Telescope, we started a search for contact binaries at the edge of our Solar System. So far, our survey focused on about 40 objects in different dynamical groups of the Trans-Neptunian belt for sparse or complete lightcurves. We report the discovery of 5 new potential contact binaries converting the current estimate of potential/confirmed contact binaries to 7 objects. With one epoch of observations per object, we are not able to model in detail the systems, but we derive estimate for basic information such as shape, size, density of both objects as well as the separation between the system’s components. In this work, we will present these new systems, their basic characteristics, and we will discuss the potential main reservoir of contact binaries in the Trans-neptunian belt.

VESGEN Software for Mapping and Quantification of Vascular Regulators

NASA Technical Reports Server (NTRS)

Parsons-Wingerter, Patricia A.; Vickerman, Mary B.; Keith, Patricia A.

2012-01-01

VESsel GENeration (VESGEN) Analysis is an automated software that maps and quantifies effects of vascular regulators on vascular morphology by analyzing important vessel parameters. Quantification parameters include vessel diameter, length, branch points, density, and fractal dimension. For vascular trees, measurements are reported as dependent functions of vessel branching generation. VESGEN maps and quantifies vascular morphological events according to fractal-based vascular branching generation. It also relies on careful imaging of branching and networked vascular form. It was developed as a plug-in for ImageJ (National Institutes of Health, USA). VESGEN uses image-processing concepts of 8-neighbor pixel connectivity, skeleton, and distance map to analyze 2D, black-and-white (binary) images of vascular trees, networks, and tree-network composites. VESGEN maps typically 5 to 12 (or more) generations of vascular branching, starting from a single parent vessel. These generations are tracked and measured for critical vascular parameters that include vessel diameter, length, density and number, and tortuosity per branching generation. The effects of vascular therapeutics and regulators on vascular morphology and branching tested in human clinical or laboratory animal experimental studies are quantified by comparing vascular parameters with control groups. VESGEN provides a user interface to both guide and allow control over the users vascular analysis process. An option is provided to select a morphological tissue type of vascular trees, network or tree-network composites, which determines the general collections of algorithms, intermediate images, and output images and measurements that will be produced.

The algebra of the general Markov model on phylogenetic trees and networks.

PubMed

Sumner, J G; Holland, B R; Jarvis, P D

2012-04-01

It is known that the Kimura 3ST model of sequence evolution on phylogenetic trees can be extended quite naturally to arbitrary split systems. However, this extension relies heavily on mathematical peculiarities of the associated Hadamard transformation, and providing an analogous augmentation of the general Markov model has thus far been elusive. In this paper, we rectify this shortcoming by showing how to extend the general Markov model on trees to include incompatible edges; and even further to more general network models. This is achieved by exploring the algebra of the generators of the continuous-time Markov chain together with the “splitting” operator that generates the branching process on phylogenetic trees. For simplicity, we proceed by discussing the two state case and then show that our results are easily extended to more states with little complication. Intriguingly, upon restriction of the two state general Markov model to the parameter space of the binary symmetric model, our extension is indistinguishable from the Hadamard approach only on trees; as soon as any incompatible splits are introduced the two approaches give rise to differing probability distributions with disparate structure. Through exploration of a simple example, we give an argument that our extension to more general networks has desirable properties that the previous approaches do not share. In particular, our construction allows for convergent evolution of previously divergent lineages; a property that is of significant interest for biological applications.

Assessing herbivore foraging behavior with GPS collars in a semiarid grassland.

PubMed

Augustine, David J; Derner, Justin D

2013-03-15

Advances in global positioning system (GPS) technology have dramatically enhanced the ability to track and study distributions of free-ranging livestock. Understanding factors controlling the distribution of free-ranging livestock requires the ability to assess when and where they are foraging. For four years (2008-2011), we periodically collected GPS and activity sensor data together with direct observations of collared cattle grazing semiarid rangeland in eastern Colorado. From these data, we developed classification tree models that allowed us to discriminate between grazing and non-grazing activities. We evaluated: (1) which activity sensor measurements from the GPS collars were most valuable in predicting cattle foraging behavior, (2) the accuracy of binary (grazing, non-grazing) activity models vs. models with multiple activity categories (grazing, resting, traveling, mixed), and (3) the accuracy of models that are robust across years vs. models specific to a given year. A binary classification tree correctly removed 86.5% of the non-grazing locations, while correctly retaining 87.8% of the locations where the animal was grazing, for an overall misclassification rate of 12.9%. A classification tree that separated activity into four different categories yielded a greater misclassification rate of 16.0%. Distance travelled in a 5 minute interval and the proportion of the interval with the sensor indicating a head down position were the two most important variables predicting grazing activity. Fitting annual models of cattle foraging activity did not improve model accuracy compared to a single model based on all four years combined. This suggests that increased sample size was more valuable than accounting for interannual variation in foraging behavior associated with variation in forage production. Our models differ from previous assessments in semiarid rangeland of Israel and mesic pastures in the United States in terms of the value of different activity sensor measurements for identifying grazing activity, suggesting that the use of GPS collars to classify cattle grazing behavior will require calibrations specific to the environment and vegetation being studied.

A New Orbit for the Eclipsing Binary V577 Oph

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

Jeffery, Elizabeth J.; Barnes, Thomas G. III; Montemayor, Thomas J.

Pulsating stars in eclipsing binary systems are unique objects for providing constraints on stellar models. To fully leverage the information available from the binary system, full orbital radial velocity curves must be obtained. We report 23 radial velocities for components of the eclipsing binary V577 Oph, whose primary star is a δ Sct variable. The velocities cover a nearly complete orbit and a time base of 20 years. We computed orbital elements for the binary and compared them to the ephemeris computed by Creevey et al. The comparison shows marginally different results. In particular, a change in the systemic velocitymore » by −2 km s{sup −1} is suggested by our results. We compare this systemic velocity difference to that expected due to reflex motion of the binary in response to the third body in the system. The systemic velocity difference is consistent with reflex motion, given our mass determination for the eclipsing binary and the orbital parameters determined by Volkov and Volkova for the three-body orbit. We see no evidence for the third body in our spectra, but we do see strong interstellar Na D lines that are consistent in strength with the direction and expected distance of V577 Oph.« less

Gaia Assorted Mass Binaries Long Excluded from SLoWPoKES (GAMBLES): Identifying Ultra-wide Binary Pairs with Components of Diverse Mass

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

Oelkers, Ryan J.; Stassun, Keivan G.; Dhital, Saurav, E-mail: ryan.j.oelkers@vanderbilt.edu

The formation and evolution of binary star systems are some of the remaining key questions in modern astronomy. Wide binary pairs (separations >10{sup 3} au) are particularly intriguing because their low binding energies make it difficult for the stars to stay gravitationally bound over extended timescales, and thus to probe the dynamics of binary formation and dissolution. Our previous SLoWPoKES catalogs, I and II, provided the largest and most complete sample of wide-binary pairs of low masses. Here we present an extension of these catalogs to a broad range of stellar masses: the Gaia Assorted Mass Binaries Long Excluded frommore » SloWPoKES (GAMBLES), comprising 8660 statistically significant wide pairs that we make available in a living online database. Within this catalog we identify a subset of 543 long-lived (dissipation timescale >1.5 Gyr) candidate binary pairs, of assorted mass, with typical separations between 10{sup 3} and 10{sup 5.5} au (0.002–1.5 pc), using the published distances and proper motions from the Tycho -Gaia Astrometric Solution and Sloan Digital Sky Survey photometry. Each pair has at most a false positive probability of 0.05; the total expectation is 2.44 false binaries in our sample. Among these, we find 22 systems with 3 components, 1 system with 4 components, and 15 pairs consisting of at least 1 possible red giant. We find the largest long-lived binary separation to be nearly 3.2 pc; even so, >76% of GAMBLES long-lived binaries have large binding energies and dissipation lifetimes longer than 1.5 Gyr. Finally, we find that the distribution of binary separations is clearly bimodal, corroborating the findings from SloWPoKES and suggesting multiple pathways for the formation and dissipation of the widest binaries in the Galaxy.« less

Gaia Assorted Mass Binaries Long Excluded from SLoWPoKES (GAMBLES): Identifying Ultra-wide Binary Pairs with Components of Diverse Mass

NASA Astrophysics Data System (ADS)

Oelkers, Ryan J.; Stassun, Keivan G.; Dhital, Saurav

2017-06-01

The formation and evolution of binary star systems are some of the remaining key questions in modern astronomy. Wide binary pairs (separations >103 au) are particularly intriguing because their low binding energies make it difficult for the stars to stay gravitationally bound over extended timescales, and thus to probe the dynamics of binary formation and dissolution. Our previous SLoWPoKES catalogs, I and II, provided the largest and most complete sample of wide-binary pairs of low masses. Here we present an extension of these catalogs to a broad range of stellar masses: the Gaia Assorted Mass Binaries Long Excluded from SloWPoKES (GAMBLES), comprising 8660 statistically significant wide pairs that we make available in a living online database. Within this catalog we identify a subset of 543 long-lived (dissipation timescale >1.5 Gyr) candidate binary pairs, of assorted mass, with typical separations between 103 and 105.5 au (0.002-1.5 pc), using the published distances and proper motions from the Tycho-Gaia Astrometric Solution and Sloan Digital Sky Survey photometry. Each pair has at most a false positive probability of 0.05; the total expectation is 2.44 false binaries in our sample. Among these, we find 22 systems with 3 components, 1 system with 4 components, and 15 pairs consisting of at least 1 possible red giant. We find the largest long-lived binary separation to be nearly 3.2 pc even so, >76% of GAMBLES long-lived binaries have large binding energies and dissipation lifetimes longer than 1.5 Gyr. Finally, we find that the distribution of binary separations is clearly bimodal, corroborating the findings from SloWPoKES and suggesting multiple pathways for the formation and dissipation of the widest binaries in the Galaxy.

Adaptation of Chain Event Graphs for use with Case-Control Studies in Epidemiology.

PubMed

Keeble, Claire; Thwaites, Peter Adam; Barber, Stuart; Law, Graham Richard; Baxter, Paul David

2017-09-26

Case-control studies are used in epidemiology to try to uncover the causes of diseases, but are a retrospective study design known to suffer from non-participation and recall bias, which may explain their decreased popularity in recent years. Traditional analyses report usually only the odds ratio for given exposures and the binary disease status. Chain event graphs are a graphical representation of a statistical model derived from event trees which have been developed in artificial intelligence and statistics, and only recently introduced to the epidemiology literature. They are a modern Bayesian technique which enable prior knowledge to be incorporated into the data analysis using the agglomerative hierarchical clustering algorithm, used to form a suitable chain event graph. Additionally, they can account for missing data and be used to explore missingness mechanisms. Here we adapt the chain event graph framework to suit scenarios often encountered in case-control studies, to strengthen this study design which is time and financially efficient. We demonstrate eight adaptations to the graphs, which consist of two suitable for full case-control study analysis, four which can be used in interim analyses to explore biases, and two which aim to improve the ease and accuracy of analyses. The adaptations are illustrated with complete, reproducible, fully-interpreted examples, including the event tree and chain event graph. Chain event graphs are used here for the first time to summarise non-participation, data collection techniques, data reliability, and disease severity in case-control studies. We demonstrate how these features of a case-control study can be incorporated into the analysis to provide further insight, which can help to identify potential biases and lead to more accurate study results.

Breakthrough in orbit determination of a binary. - In expectation of astrometric observations with high precision such as VERA and JASMINE -

NASA Astrophysics Data System (ADS)

Asada, Hideki

2006-11-01

There exists a very classical inverse problem regarding orbit determination of a binary system: "when an orbital plane of two bodies is inclined with respect to the line of sight, observables are their positions projected onto a celestial sphere. How do we determine the orbital elements from observations?" A "complete exact solution" has been found. It is reviewed with some related topics.

A New Catalog of Contact Binary Stars from ROTSE-I Sky Patrols

NASA Astrophysics Data System (ADS)

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

2005-05-01

Over 65,000 variable stars have been detected in the data from the ROTSE-I Sky Patrols. Using period-color and light curve selection techniques, about 5000 objects have been identified as contact binaries. This selection is tested for completeness against EW objects in the GCVS. By utilizing infrared color data from 2MASS, we fit a period-color-luminosity relation to these stars and estimate their distances.

Missing Data in Alcohol Clinical Trials with Binary Outcomes

PubMed Central

Hallgren, Kevin A.; Witkiewitz, Katie; Kranzler, Henry R.; Falk, Daniel E.; Litten, Raye Z.; O’Malley, Stephanie S.; Anton, Raymond F.

2017-01-01

Background Missing data are common in alcohol clinical trials for both continuous and binary endpoints. Approaches to handle missing data have been explored for continuous outcomes, yet no studies have compared missing data approaches for binary outcomes (e.g., abstinence, no heavy drinking days). The present study compares approaches to modeling binary outcomes with missing data in the COMBINE study. Method We included participants in the COMBINE Study who had complete drinking data during treatment and who were assigned to active medication or placebo conditions (N=1146). Using simulation methods, missing data were introduced under common scenarios with varying sample sizes and amounts of missing data. Logistic regression was used to estimate the effect of naltrexone (vs. placebo) in predicting any drinking and any heavy drinking outcomes at the end of treatment using four analytic approaches: complete case analysis (CCA), last observation carried forward (LOCF), the worst-case scenario of missing equals any drinking or heavy drinking (WCS), and multiple imputation (MI). In separate analyses, these approaches were compared when drinking data were manually deleted for those participants who discontinued treatment but continued to provide drinking data. Results WCS produced the greatest amount of bias in treatment effect estimates. MI usually yielded less biased estimates than WCS and CCA in the simulated data, and performed considerably better than LOCF when estimating treatment effects among individuals who discontinued treatment. Conclusions Missing data can introduce bias in treatment effect estimates in alcohol clinical trials. Researchers should utilize modern missing data methods, including MI, and avoid WCS and CCA when analyzing binary alcohol clinical trial outcomes. PMID:27254113

Missing Data in Alcohol Clinical Trials with Binary Outcomes.

PubMed

Hallgren, Kevin A; Witkiewitz, Katie; Kranzler, Henry R; Falk, Daniel E; Litten, Raye Z; O'Malley, Stephanie S; Anton, Raymond F

2016-07-01

Missing data are common in alcohol clinical trials for both continuous and binary end points. Approaches to handle missing data have been explored for continuous outcomes, yet no studies have compared missing data approaches for binary outcomes (e.g., abstinence, no heavy drinking days). This study compares approaches to modeling binary outcomes with missing data in the COMBINE study. We included participants in the COMBINE study who had complete drinking data during treatment and who were assigned to active medication or placebo conditions (N = 1,146). Using simulation methods, missing data were introduced under common scenarios with varying sample sizes and amounts of missing data. Logistic regression was used to estimate the effect of naltrexone (vs. placebo) in predicting any drinking and any heavy drinking outcomes at the end of treatment using 4 analytic approaches: complete case analysis (CCA), last observation carried forward (LOCF), the worst case scenario (WCS) of missing equals any drinking or heavy drinking, and multiple imputation (MI). In separate analyses, these approaches were compared when drinking data were manually deleted for those participants who discontinued treatment but continued to provide drinking data. WCS produced the greatest amount of bias in treatment effect estimates. MI usually yielded less biased estimates than WCS and CCA in the simulated data and performed considerably better than LOCF when estimating treatment effects among individuals who discontinued treatment. Missing data can introduce bias in treatment effect estimates in alcohol clinical trials. Researchers should utilize modern missing data methods, including MI, and avoid WCS and CCA when analyzing binary alcohol clinical trial outcomes. Copyright © 2016 by the Research Society on Alcoholism.

Ecological Technologies for Small-Diameter Tree Harvesting

Treesearch

Bryce J. Stokes; John F. Klepac

1997-01-01

Production, costs, and merchantable chip recovery values were developed for a tree-length, flail/chip, and cut-to-length system. The systems were evaluated for three representative stands: early thinning, late thinning, and a clearcut. A sensitivity analysis was completed for the three systems over a range of tree diameters. Recovery was affected by stand type and...

Modeling percent tree canopy cover: a pilot study

Treesearch

John W. Coulston; Gretchen G. Moisen; Barry T. Wilson; Mark V. Finco; Warren B. Cohen; C. Kenneth Brewer

2012-01-01

Tree canopy cover is a fundamental component of the landscape, and the amount of cover influences fire behavior, air pollution mitigation, and carbon storage. As such, efforts to empirically model percent tree canopy cover across the United States are a critical area of research. The 2001 national-scale canopy cover modeling and mapping effort was completed in 2006,...

Where are the Black Walnut Trees in Missouri? 1995.

Treesearch

J. Michael Vasievich; Neal P. Kingsley

1995-01-01

Walnut trees are well distributed and relatively abundant in Missouri according to the most recent forest inventory completed in 1989. The forest inventory (Hahn 1991) reports that 7.3 billion trees were found on Missouri timberlands and that 1 in 100 were black walnuts. Digging into the Eastwide Forest Inventory Data Base (Hansen et al. 1992) provides more...

Predicting Chemically Induced Duodenal Ulcer and Adrenal Necrosis with Classification Trees

NASA Astrophysics Data System (ADS)

Giampaolo, Casimiro; Gray, Andrew T.; Olshen, Richard A.; Szabo, Sandor

1991-07-01

Binary tree-structured statistical classification algorithms and properties of 56 model alkyl nucleophiles were brought to bear on two problems of experimental pharmacology and toxicology. Each rat of a learning sample of 745 was administered one compound and autopsied to determine the presence of duodenal ulcer or adrenal hemorrhagic necrosis. The cited statistical classification schemes were then applied to these outcomes and 67 features of the compounds to ascertain those characteristics that are associated with biologic activity. For predicting duodenal ulceration, dipole moment, melting point, and solubility in octanol are particularly important, while for predicting adrenal necrosis, important features include the number of sulfhydryl groups and double bonds. These methods may constitute inexpensive but powerful ways to screen untested compounds for possible organ-specific toxicity. Mechanisms for the etiology and pathogenesis of the duodenal and adrenal lesions are suggested, as are additional avenues for drug design.

An effective method on pornographic images realtime recognition

NASA Astrophysics Data System (ADS)

Wang, Baosong; Lv, Xueqiang; Wang, Tao; Wang, Chengrui

2013-03-01

In this paper, skin detection, texture filtering and face detection are used to extract feature on an image library, training them with the decision tree arithmetic to create some rules as a decision tree classifier to distinguish an unknown image. Experiment based on more than twenty thousand images, the precision rate can get 76.21% when testing on 13025 pornographic images and elapsed time is less than 0.2s. This experiment shows it has a good popularity. Among the steps mentioned above, proposing a new skin detection model which called irregular polygon region skin detection model based on YCbCr color space. This skin detection model can lower the false detection rate on skin detection. A new method called sequence region labeling on binary connected area can calculate features on connected area, it is faster and needs less memory than other recursive methods.

Personalization algorithm for real-time activity recognition using PDA, wireless motion bands, and binary decision tree.

PubMed

Pärkkä, Juha; Cluitmans, Luc; Ermes, Miikka

2010-09-01

Inactive and sedentary lifestyle is a major problem in many industrialized countries today. Automatic recognition of type of physical activity can be used to show the user the distribution of his daily activities and to motivate him into more active lifestyle. In this study, an automatic activity-recognition system consisting of wireless motion bands and a PDA is evaluated. The system classifies raw sensor data into activity types online. It uses a decision tree classifier, which has low computational cost and low battery consumption. The classifier parameters can be personalized online by performing a short bout of an activity and by telling the system which activity is being performed. Data were collected with seven volunteers during five everyday activities: lying, sitting/standing, walking, running, and cycling. The online system can detect these activities with overall 86.6% accuracy and with 94.0% accuracy after classifier personalization.

Satisfiability modulo theory and binary puzzle

NASA Astrophysics Data System (ADS)

Utomo, Putranto

2017-06-01

The binary puzzle is a sudoku-like puzzle with values in each cell taken from the set {0, 1}. We look at the mathematical theory behind it. A solved binary puzzle is an n × n binary array where n is even that satisfies the following conditions: (1) No three consecutive ones and no three consecutive zeros in each row and each column, (2) Every row and column is balanced, that is the number of ones and zeros must be equal in each row and in each column, (3) Every two rows and every two columns must be distinct. The binary puzzle had been proven to be an NP-complete problem [5]. Research concerning the satisfiability of formulas with respect to some background theory is called satisfiability modulo theory (SMT). An SMT solver is an extension of a satisfiability (SAT) solver. The notion of SMT can be used for solving various problem in mathematics and industries such as formula verification and operation research [1, 7]. In this paper we apply SMT to solve binary puzzles. In addition, we do an experiment in solving different sizes and different number of blanks. We also made comparison with two other approaches, namely by a SAT solver and exhaustive search.

Using Photometric Variability to Detect Binarity in the Central Stars of Four Planetary Nebulae, A 43, A 74, NGC 6720, and NGC 6853

NASA Astrophysics Data System (ADS)

Smith, Alexander; De Marco, O.

2007-12-01

Recent observational evidence and theoretical models are challenging the classical paradigm of single star planetary nebula (PN) evolution, suggesting instead that binary stars play a significant role in the process of PN formation. In order to shape the 90% of PN that are non-spherical, the central star must be rotating and have a magnetic field; the most-likely source of the angular momentum needed to sustain magnetic fields is a binary companion. More observational evidence is needed to confirm that the fraction of PN with close binary central stars is indeed higher than the currently known value of 10-15%. As part of an international effort to detect binary central stars (PLAN-B - Panetary Nebula Binaries), we are carrying out a new photometric survey to look for close binary central stars of PN. Here we present the findings for 4 objects: A 43, A 74, NGC 6720, and NGC 6853. NGC 6720 and NGC 6853 show evidence of periodic variability, the former of which might even show one eclipse. Once completed, the survey will assess the binarity of about 100 central stars of PN.

A Metric on Phylogenetic Tree Shapes

PubMed Central

Plazzotta, G.

2018-01-01

Abstract The shapes of evolutionary trees are influenced by the nature of the evolutionary process but comparisons of trees from different processes are hindered by the challenge of completely describing tree shape. We present a full characterization of the shapes of rooted branching trees in a form that lends itself to natural tree comparisons. We use this characterization to define a metric, in the sense of a true distance function, on tree shapes. The metric distinguishes trees from random models known to produce different tree shapes. It separates trees derived from tropical versus USA influenza A sequences, which reflect the differing epidemiology of tropical and seasonal flu. We describe several metrics based on the same core characterization, and illustrate how to extend the metric to incorporate trees’ branch lengths or other features such as overall imbalance. Our approach allows us to construct addition and multiplication on trees, and to create a convex metric on tree shapes which formally allows computation of average tree shapes. PMID:28472435

Massive binaries in R136 using Hubble

NASA Astrophysics Data System (ADS)

Caballero-Nieves, Saida; Crowther, Paul; Bostroem, K. Azalee; Maíz Apellániz, Jesus

2014-09-01

We have undertaken a complete HST/STIS spectroscopic survey of R136, the young, central dense starburst cluster of the LMC 30 Doradus nebula, which hosts the most massive stars currently known. Our CCD datasets, comprising 17 adjacent 0.2"×52" long slits, were split across Cycles 19 and 20 to allow us to search for spectroscopic binaries. We will present the results of our survey, including a comparison with the massive-star population in the wider 30 Doradus region from the VLT Flames Tarantula survey. We will also describe upcoming HST/FGS observations, which will probe intermediate-separation binaries in R136, and discuss this cluster in the context of unresolved young extragalactic star clusters.

From YY Boo (eclipsing binary) via J1407 (ringed companion) to WD 1145+017 (white dwarf with debris disk) (Abstract)

NASA Astrophysics Data System (ADS)

Hambsch, F.-J.

2018-06-01

(Abstract only) Several years ago by accident I observed YY Boo outside of an eclipse and was very surprised to see a short term periodic variation of about 0.1 mag. That was completely unexpected and it initiated an international campaign by amateurs to identify the cause of these variations. It turned out that YY Boo showed a pulsation period of about 88 min in addition to being an Algol type eclipsing binary. Hence it turned out that YY Boo has become a new member of a class of pulsating eclipsing binary systems with, at that time, the second largest amplitude after BO Her.

Dormancy release of Norway spruce under climatic warming: testing ecophysiological models of bud burst with a whole-tree chamber experiment.

PubMed

Hänninen, Heikki; Slaney, Michelle; Linder, Sune

2007-02-01

Ecophysiological models predicting timing of bud burst were tested with data gathered from 40-year-old Norway spruce (Picea abies (L.) Karst.) trees growing in northern Sweden in whole-tree chambers under climatic conditions predicted to prevail in 2100. Norway spruce trees, with heights between 5 and 7 m, were enclosed in individual chambers that provided a factorial combination of ambient (365 micromol mol-1) or elevated (700 micromol mol-1) atmospheric CO2 concentration, [CO2], and ambient or elevated air temperature. Temperature elevation above ambient ranged from +2.8 degrees C in summer to +5.6 degrees C in winter. Compared with control trees, elevated air temperature hastened bud burst by 2 to 3 weeks, whereas elevated [CO2] had no effect on the timing of bud burst. A simple model based on the assumption that bud rest completion takes place on a fixed calendar day predicted timing of bud burst more accurately than two more complicated models in which bud rest completion is caused by accumulated chilling. Together with some recent studies, the results suggest that, in adult trees, some additional environmental cues besides chilling are required for bud rest completion. Although it appears that these additional factors will protect trees under predicted climatic warming conditions, increased risk of frost damage associated with earlier bud burst cannot be ruled out. Inconsistent and partially anomalous results obtained in the model fitting show that, in addition to phenological data gathered under field conditions, more specific data from growth chamber and greenhouse experiments are needed for further development and testing of the models.

An Examination of Master's Student Retention & Completion

ERIC Educational Resources Information Center

Barry, Melissa; Mathies, Charles

2011-01-01

This study was conducted at a research-extensive public university in the southeastern United States. It examined the retention and completion of master's degree students across numerous disciplines. Results were derived from a series of descriptive statistics, T-tests, and a series of binary logistic regression models. The findings from binary…

Randomizing world trade. II. A weighted network analysis

NASA Astrophysics Data System (ADS)

Squartini, Tiziano; Fagiolo, Giorgio; Garlaschelli, Diego

2011-10-01

Based on the misleading expectation that weighted network properties always offer a more complete description than purely topological ones, current economic models of the International Trade Network (ITN) generally aim at explaining local weighted properties, not local binary ones. Here we complement our analysis of the binary projections of the ITN by considering its weighted representations. We show that, unlike the binary case, all possible weighted representations of the ITN (directed and undirected, aggregated and disaggregated) cannot be traced back to local country-specific properties, which are therefore of limited informativeness. Our two papers show that traditional macroeconomic approaches systematically fail to capture the key properties of the ITN. In the binary case, they do not focus on the degree sequence and hence cannot characterize or replicate higher-order properties. In the weighted case, they generally focus on the strength sequence, but the knowledge of the latter is not enough in order to understand or reproduce indirect effects.

Improving Predictions of Multiple Binary Models in ILP

PubMed Central

2014-01-01

Despite the success of ILP systems in learning first-order rules from small number of examples and complexly structured data in various domains, they struggle in dealing with multiclass problems. In most cases they boil down a multiclass problem into multiple black-box binary problems following the one-versus-one or one-versus-rest binarisation techniques and learn a theory for each one. When evaluating the learned theories of multiple class problems in one-versus-rest paradigm particularly, there is a bias caused by the default rule toward the negative classes leading to an unrealistic high performance beside the lack of prediction integrity between the theories. Here we discuss the problem of using one-versus-rest binarisation technique when it comes to evaluating multiclass data and propose several methods to remedy this problem. We also illustrate the methods and highlight their link to binary tree and Formal Concept Analysis (FCA). Our methods allow learning of a simple, consistent, and reliable multiclass theory by combining the rules of the multiple one-versus-rest theories into one rule list or rule set theory. Empirical evaluation over a number of data sets shows that our proposed methods produce coherent and accurate rule models from the rules learned by the ILP system of Aleph. PMID:24696657

The ability of adults and children to visually identify peanuts and tree nuts.

PubMed

Hostetler, Todd L; Hostetler, Sarah G; Phillips, Gary; Martin, Bryan L

2012-01-01

Peanuts and tree nuts are common food allergens and are the leading cause of fatalities from food-induced anaphylaxis. Dietary avoidance is the primary management of these allergies and requires the ability to identify peanuts or tree nuts. To investigate the ability of adults and children to visually identify peanuts and tree nuts. A nut display was assembled that held peanuts and 9 tree nuts in a total of 19 different forms. Persons 6 years or older completed a worksheet to name the items. One-thousand one-hundred five subjects completed the study. The mean number of peanuts and tree nuts identified by all subjects was 8.4 (44.2%) out of a possible 19. The mean for children ages 6 to 18 was 4.6 (24.2%), compared with 11.1 (58.4%) for adults older than 18 (P < .001). The most commonly identified items were peanut in the shell and without the shell. The least identified was hazelnut (filbert) in the shell and without the shell. No difference was seen in the performance of peanut- or tree nut-allergic subjects compared with nonallergic subjects. Fifty percent of subjects with a peanut or tree nut allergy correctly identified all forms of peanuts or tree nuts to which they are allergic. Parents of peanut- or tree nut-allergic children did no better than parents of children without such allergy. Overall, both children and adults are unreliable at visually identifying most nuts. Treatment of nut allergies with dietary avoidance should include education for both adults and children on identification of peanuts and tree nuts. Copyright © 2012 American College of Allergy, Asthma & Immunology. Published by Elsevier Inc. All rights reserved.

VizieR Online Data Catalog: WDMS from LAMOST DR1 (Ren+, 2014)

NASA Astrophysics Data System (ADS)

Ren, J. J.; Rebassa-Mansergas, A.; Luo, A. L.; Zhao, Y. H.; Xiang, M. S.; Liu, X. W.; Zhao, G.; Jin, G.; Zhang, Y.

2014-08-01

The ascii data of all LAMOST DR1 DA/M binary spectra are presented. The complete table of stellar parameters, magnitudes, radial velocities of the LAMOST DA/M binaries are also provided. The stellar parameters table includes the white dwarf stellar parameters (effective temperature, surface gravity and mass), spectral type of the companions and distance when available, however only those with a S/N higher 12 (second column) are considered in the analysis of the paper. Spectral types of -1 imply that no values are available. For completeness, the table also include 181 systems that are not considered by us as DA/M binaries but that show blue and red components in their spectra. These are flagged as 1 in the last column. The magnitudes table includes the SDSS or Xuyi magnitudes (when available) and coordinates. The radial velocities includes the NaI 8183.27,8194.81 absorption doublet and Halpha emission radial velocities and errors, as well as the Heliocentric Julian dates and the telescope used for obtaining the spectra (either LAMOST or SDSS). (4 data files).

Cellular and molecular actions of binary toxins possessing ADP-ribosyltransferase activity.

PubMed

Considine, R V; Simpson, L L

1991-01-01

Clostridial organisms produce a number of binary toxins. Thus far, three complete toxins (botulinum, perfringens and spiroforme) and one incomplete toxin (difficile) have been identified. In the case of complete toxins, there is a heavy chain component (Mr approximately 100,000) that binds to target cells and helps create a docking site for the light chain component (Mr approximately 50,000). The latter is an enzyme that possesses mono(ADP-ribosyl)transferase activity. The toxins appear to proceed through a three step sequence to exert their effects, including a binding step, an internalization step and an intracellular poisoning step. The substrate for the toxins is G-actin. By virtue of ADP-ribosylating monomeric actin, the toxins prevent polymerization as well as promoting depolymerization. The most characteristic cellular effect of the toxins is alteration of the cytoskeleton, which leads directly to changes in cellular morphology and indirectly to changes in cell function (e.g. release of chemical mediators). Binary toxins capable of modifying actin are likely to be useful tools in the study of cell biology.

Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams

DTIC Science & Technology

1992-07-01

memories , where careful attention has been given to programming the memory management routines [Brace et al 19901. To extract maximum performance, it...OBDDs) represent Boolean functions as directed acyclic graphs. They form a canonical representation, making testing of functional properties such as...indicated 3 X X2 X3 f 000 0 0 01 0X22 0 10 0 0 11 1 d 1 0 0 0 X3 X 3X 1 01 1 1 10 0 - i"o11 10o 1 1 Figure 1: Truth Table and Decison Tree Repremmtatios

Dynamics of surviving ash (Fraxinus spp.) populations in areas long infested by emerald ash borer (Agrilus planipennis)

Treesearch

Kathleen S. Knight; Daniel Herms; Reid Plumb; Eileen Sawyer; Daniel Spalink; Elizabeth Pisarczyk; Bernadette Wiggin; Rachel Kappler; Emily Ziegler; Karen Menard

2012-01-01

Emerald ash borer (EAB) (Agrilus planipennis), an introduced wood-boring insect, has killed millions of ash (Fraxinus spp.) trees in the Midwest region of the United States and Canada. However, in some areas where EAB has caused almost complete mortality of mature ash trees, a small number of healthy ash trees intermingled with...

Content addressable memory project

NASA Technical Reports Server (NTRS)

Hall, J. Storrs; Levy, Saul; Smith, Donald E.; Miyake, Keith M.

1992-01-01

A parameterized version of the tree processor was designed and tested (by simulation). The leaf processor design is 90 percent complete. We expect to complete and test a combination of tree and leaf cell designs in the next period. Work is proceeding on algorithms for the computer aided manufacturing (CAM), and once the design is complete we will begin simulating algorithms for large problems. The following topics are covered: (1) the practical implementation of content addressable memory; (2) design of a LEAF cell for the Rutgers CAM architecture; (3) a circuit design tool user's manual; and (4) design and analysis of efficient hierarchical interconnection networks.

7 CFR 81.9 - Inspection and certification of diversion.

Code of Federal Regulations, 2010 CFR

2010-01-01

... diversion. When the removal of the prune-plum trees is complete, the producer(s) will notify the Committee on a form provided by the Committee. The Committee will certify that the trees approved for removal...

7 CFR 81.9 - Inspection and certification of diversion.

Code of Federal Regulations, 2011 CFR

2011-01-01

... diversion. When the removal of the prune-plum trees is complete, the producer(s) will notify the Committee on a form provided by the Committee. The Committee will certify that the trees approved for removal...

A Robust Semi-Parametric Test for Detecting Trait-Dependent Diversification.

PubMed

Rabosky, Daniel L; Huang, Huateng

2016-03-01

Rates of species diversification vary widely across the tree of life and there is considerable interest in identifying organismal traits that correlate with rates of speciation and extinction. However, it has been challenging to develop methodological frameworks for testing hypotheses about trait-dependent diversification that are robust to phylogenetic pseudoreplication and to directionally biased rates of character change. We describe a semi-parametric test for trait-dependent diversification that explicitly requires replicated associations between character states and diversification rates to detect effects. To use the method, diversification rates are reconstructed across a phylogenetic tree with no consideration of character states. A test statistic is then computed to measure the association between species-level traits and the corresponding diversification rate estimates at the tips of the tree. The empirical value of the test statistic is compared to a null distribution that is generated by structured permutations of evolutionary rates across the phylogeny. The test is applicable to binary discrete characters as well as continuous-valued traits and can accommodate extremely sparse sampling of character states at the tips of the tree. We apply the test to several empirical data sets and demonstrate that the method has acceptable Type I error rates. © The Author(s) 2015. Published by Oxford University Press, on behalf of the Society of Systematic Biologists. All rights reserved. For Permissions, please email: journals.permissions@oup.com.

A Metric on Phylogenetic Tree Shapes.

PubMed

Colijn, C; Plazzotta, G

2018-01-01

The shapes of evolutionary trees are influenced by the nature of the evolutionary process but comparisons of trees from different processes are hindered by the challenge of completely describing tree shape. We present a full characterization of the shapes of rooted branching trees in a form that lends itself to natural tree comparisons. We use this characterization to define a metric, in the sense of a true distance function, on tree shapes. The metric distinguishes trees from random models known to produce different tree shapes. It separates trees derived from tropical versus USA influenza A sequences, which reflect the differing epidemiology of tropical and seasonal flu. We describe several metrics based on the same core characterization, and illustrate how to extend the metric to incorporate trees' branch lengths or other features such as overall imbalance. Our approach allows us to construct addition and multiplication on trees, and to create a convex metric on tree shapes which formally allows computation of average tree shapes. © The Author(s) 2017. Published by Oxford University Press, on behalf of the Society of Systematic Biologists.

Interactions between multiple supermassive black holes in galactic nuclei: a solution to the final parsec problem

NASA Astrophysics Data System (ADS)

Ryu, Taeho; Perna, Rosalba; Haiman, Zoltán; Ostriker, Jeremiah P.; Stone, Nicholas C.

2018-01-01

Using few-body simulations, we investigate the evolution of supermassive black holes (SMBHs) in galaxies (M* = 1010-1012 M⊙ at z = 0) at 0 < z < 4. Following galaxy merger trees from the Millennium simulation, we model BH mergers with two extreme binary decay scenarios for the 'hard binary' stage: a full or an empty loss cone. These two models should bracket the true evolution, and allow us to separately explore the role of dynamical friction and that of multibody BH interactions on BH mergers. Using the computed merger rates, we infer the stochastic gravitational wave background (GWB). Our dynamical approach is a first attempt to study the dynamical evolution of multiple SMBHs in the host galaxies undergoing mergers with various mass ratios (10-4 < q* < 1). Our main result demonstrates that SMBH binaries are able to merge in both scenarios. In the empty loss cone case, we find that BHs merge via multibody interactions, avoiding the 'final parsec' problem, and entering the pulsar timing arrays band with substantial orbital eccentricity. Our full loss cone treatment, albeit more approximate, suggests that the eccentricity becomes even higher when GWs become dominant, leading to rapid coalescences (binary lifetime ≲1 Gyr). Despite the lower merger rates in the empty loss cone case, due to their higher mass ratios and lower redshifts, the GWB in the full/empty loss cone models are comparable (0.70 × 10-15 and 0.53 × 10-15 at a frequency of 1 yr-1, respectively). Finally, we compute the effects of high eccentricities on the GWB spectrum.

Bayesian inference on multiscale models for poisson intensity estimation: applications to photon-limited image denoising.

PubMed

Lefkimmiatis, Stamatios; Maragos, Petros; Papandreou, George

2009-08-01

We present an improved statistical model for analyzing Poisson processes, with applications to photon-limited imaging. We build on previous work, adopting a multiscale representation of the Poisson process in which the ratios of the underlying Poisson intensities (rates) in adjacent scales are modeled as mixtures of conjugate parametric distributions. Our main contributions include: 1) a rigorous and robust regularized expectation-maximization (EM) algorithm for maximum-likelihood estimation of the rate-ratio density parameters directly from the noisy observed Poisson data (counts); 2) extension of the method to work under a multiscale hidden Markov tree model (HMT) which couples the mixture label assignments in consecutive scales, thus modeling interscale coefficient dependencies in the vicinity of image edges; 3) exploration of a 2-D recursive quad-tree image representation, involving Dirichlet-mixture rate-ratio densities, instead of the conventional separable binary-tree image representation involving beta-mixture rate-ratio densities; and 4) a novel multiscale image representation, which we term Poisson-Haar decomposition, that better models the image edge structure, thus yielding improved performance. Experimental results on standard images with artificially simulated Poisson noise and on real photon-limited images demonstrate the effectiveness of the proposed techniques.

BigWig and BigBed: enabling browsing of large distributed datasets.

PubMed

Kent, W J; Zweig, A S; Barber, G; Hinrichs, A S; Karolchik, D

2010-09-01

BigWig and BigBed files are compressed binary indexed files containing data at several resolutions that allow the high-performance display of next-generation sequencing experiment results in the UCSC Genome Browser. The visualization is implemented using a multi-layered software approach that takes advantage of specific capabilities of web-based protocols and Linux and UNIX operating systems files, R trees and various indexing and compression tricks. As a result, only the data needed to support the current browser view is transmitted rather than the entire file, enabling fast remote access to large distributed data sets. Binaries for the BigWig and BigBed creation and parsing utilities may be downloaded at http://hgdownload.cse.ucsc.edu/admin/exe/linux.x86_64/. Source code for the creation and visualization software is freely available for non-commercial use at http://hgdownload.cse.ucsc.edu/admin/jksrc.zip, implemented in C and supported on Linux. The UCSC Genome Browser is available at http://genome.ucsc.edu.

Frequent statistics of link-layer bit stream data based on AC-IM algorithm

NASA Astrophysics Data System (ADS)

Cao, Chenghong; Lei, Yingke; Xu, Yiming

2017-08-01

At present, there are many relevant researches on data processing using classical pattern matching and its improved algorithm, but few researches on statistical data of link-layer bit stream. This paper adopts a frequent statistical method of link-layer bit stream data based on AC-IM algorithm for classical multi-pattern matching algorithms such as AC algorithm has high computational complexity, low efficiency and it cannot be applied to binary bit stream data. The method's maximum jump distance of the mode tree is length of the shortest mode string plus 3 in case of no missing? In this paper, theoretical analysis is made on the principle of algorithm construction firstly, and then the experimental results show that the algorithm can adapt to the binary bit stream data environment and extract the frequent sequence more accurately, the effect is obvious. Meanwhile, comparing with the classical AC algorithm and other improved algorithms, AC-IM algorithm has a greater maximum jump distance and less time-consuming.

Tests with VHR images for the identification of olive trees and other fruit trees in the European Union

NASA Astrophysics Data System (ADS)

Masson, Josiane; Soille, Pierre; Mueller, Rick

2004-10-01

In the context of the Common Agricultural Policy (CAP) there is a strong interest of the European Commission for counting and individually locating fruit trees. An automatic counting algorithm developed by the JRC (OLICOUNT) was used in the past for olive trees only, on 1m black and white orthophotos but with limits in case of young trees or irregular groves. This study investigates the improvement of fruit tree identification using VHR images on a large set of data in three test sites, one in Creta (Greece; one in the south-east of France with a majority of olive trees and associated fruit trees, and the last one in Florida on citrus trees. OLICOUNT was compared with two other automatic tree counting, applications, one using the CRISP software on citrus trees and the other completely automatic based on regional minima (morphological image analysis). Additional investigation was undertaken to refine the methods. This paper describes the automatic methods and presents the results derived from the tests.

7 CFR 82.9 - Inspection and certification of diversion.

Code of Federal Regulations, 2010 CFR

2010-01-01

... diversion. When the removal of the clingstone peach trees is complete, the grower will notify the CCPA on a form provided by the CCPA. The CCPA will certify that the trees approved for removal from the acreage...

7 CFR 82.9 - Inspection and certification of diversion.

Code of Federal Regulations, 2011 CFR

2011-01-01

... diversion. When the removal of the clingstone peach trees is complete, the grower will notify the CCPA on a form provided by the CCPA. The CCPA will certify that the trees approved for removal from the acreage...

WIYN OPEN CLUSTER STUDY. XLVIII. THE HARD-BINARY POPULATION OF NGC 188

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

Geller, Aaron M.; Mathieu, Robert D., E-mail: a-geller@northwestern.edu, E-mail: mathieu@astro.wisc.edu

2012-08-15

We present an in-depth study of the hard-binary population of the old (7 Gyr) open cluster NGC 188. Utilizing 85 spectroscopic binary orbits out of a complete sample of 129 detected binary members, we study the cluster binary frequency and the distributions of binary orbital elements among the main-sequence (MS), giant, and blue straggler (BS) populations. The results are derived from our ongoing radial velocity survey of the cluster, which spans in magnitude from the brightest stars in the cluster to V = 16.5 (about 1.1-0.9 M{sub Sun} ), and extends to a projected radius of 17 pc ({approx}13 coremore » radii). Our detectable binaries have periods ranging from a few days to of order 10{sup 4} days, and thus are hard binaries that dynamically power the cluster. The MS solar-type hard binaries in NGC 188 are nearly indistinguishable from similar binaries in the Galactic field. We observe a global solar-type MS hard-binary frequency in NGC 188 of 23% {+-} 2%, which when corrected for incompleteness results in a frequency of 29% {+-} 3% for binaries with periods less than 10{sup 4} days. For MS hard binaries in the cluster, we observe a log-period distribution that rises toward our detection limit, a roughly Gaussian eccentricity distribution centered on e = 0.35 (for binaries with periods longer than the circularization period), and a secondary-mass distribution that rises toward lower-mass companions. Importantly, the NGC 188 BS binaries show significantly different characteristics than the solar-type MS binaries in NGC 188. We observe a BS hard-binary frequency of 76% {+-} 19%, three times that of the MS. The excess of this binary frequency over the normal MS binary frequency is valid at the >99% confidence level. Furthermore, the BS binary eccentricity-log-period distribution is distinct from that of the MS at the 99% confidence level, with the majority of the BS binaries having periods of order 1000 days and lower eccentricities. The secondary-mass distribution for these long-period BS binaries is narrow and peaked with a mean value of about 0.5 M{sub Sun }. Predictions for mass-transfer products are most closely consistent with the binary properties of these NGC 188 BSs, which comprise two-thirds of the BS population. Additionally, we compare the NGC 188 binaries to those evolved within the sophisticated Hurley et al. (2005) N-body open cluster simulation. The MS hard-binary population predicted by the simulation is significantly different from the MS hard-binary population observed in NGC 188, in frequency and distributions of period and eccentricity. Many of these differences result from the adopted initial binary population, while others reflect on the physics used in the simulation (e.g., tidal circularization). Additional simulations with initial conditions that are better motivated by observations are necessary to properly investigate the dynamical evolution of a rich binary population in open clusters like NGC 188.« less

Effect of stirring on the safety of flammable liquid mixtures.

PubMed

Liaw, Horng-Jang; Gerbaud, Vincent; Chen, Chan-Cheng; Shu, Chi-Min

2010-05-15

Flash point is the most important variable employed to characterize fire and explosion hazard of liquids. The models developed for predicting the flash point of partially miscible mixtures in the literature to date are all based on the assumption of liquid-liquid equilibrium. In real-world environments, however, the liquid-liquid equilibrium assumption does not always hold, such as the collection or accumulation of waste solvents without stirring, where complete stirring for a period of time is usually used to ensure the liquid phases being in equilibrium. This study investigated the effect of stirring on the flash-point behavior of binary partially miscible mixtures. Two series of partially miscible binary mixtures were employed to elucidate the effect of stirring. The first series was aqueous-organic mixtures, including water+1-butanol, water+2-butanol, water+isobutanol, water+1-pentanol, and water+octane; the second series was the mixtures of two flammable solvents, which included methanol+decane, methanol+2,2,4-trimethylpentane, and methanol+octane. Results reveal that for binary aqueous-organic solutions the flash-point values of unstirred mixtures were located between those of the completely stirred mixtures and those of the flammable component. Therefore, risk assessment could be done based on the flammable component flash-point value. However, for the assurance of safety, it is suggested to completely stir those mixtures before handling to reduce the risk. Copyright (c) 2010 Elsevier B.V. All rights reserved.

Phylogeny Reconstruction with Alignment-Free Method That Corrects for Horizontal Gene Transfer.

PubMed

Bromberg, Raquel; Grishin, Nick V; Otwinowski, Zbyszek

2016-06-01

Advances in sequencing have generated a large number of complete genomes. Traditionally, phylogenetic analysis relies on alignments of orthologs, but defining orthologs and separating them from paralogs is a complex task that may not always be suited to the large datasets of the future. An alternative to traditional, alignment-based approaches are whole-genome, alignment-free methods. These methods are scalable and require minimal manual intervention. We developed SlopeTree, a new alignment-free method that estimates evolutionary distances by measuring the decay of exact substring matches as a function of match length. SlopeTree corrects for horizontal gene transfer, for composition variation and low complexity sequences, and for branch-length nonlinearity caused by multiple mutations at the same site. We tested SlopeTree on 495 bacteria, 73 archaea, and 72 strains of Escherichia coli and Shigella. We compared our trees to the NCBI taxonomy, to trees based on concatenated alignments, and to trees produced by other alignment-free methods. The results were consistent with current knowledge about prokaryotic evolution. We assessed differences in tree topology over different methods and settings and found that the majority of bacteria and archaea have a core set of proteins that evolves by descent. In trees built from complete genomes rather than sets of core genes, we observed some grouping by phenotype rather than phylogeny, for instance with a cluster of sulfur-reducing thermophilic bacteria coming together irrespective of their phyla. The source-code for SlopeTree is available at: http://prodata.swmed.edu/download/pub/slopetree_v1/slopetree.tar.gz.

Phylogeny Reconstruction with Alignment-Free Method That Corrects for Horizontal Gene Transfer

PubMed Central

Grishin, Nick V.; Otwinowski, Zbyszek

2016-01-01

Advances in sequencing have generated a large number of complete genomes. Traditionally, phylogenetic analysis relies on alignments of orthologs, but defining orthologs and separating them from paralogs is a complex task that may not always be suited to the large datasets of the future. An alternative to traditional, alignment-based approaches are whole-genome, alignment-free methods. These methods are scalable and require minimal manual intervention. We developed SlopeTree, a new alignment-free method that estimates evolutionary distances by measuring the decay of exact substring matches as a function of match length. SlopeTree corrects for horizontal gene transfer, for composition variation and low complexity sequences, and for branch-length nonlinearity caused by multiple mutations at the same site. We tested SlopeTree on 495 bacteria, 73 archaea, and 72 strains of Escherichia coli and Shigella. We compared our trees to the NCBI taxonomy, to trees based on concatenated alignments, and to trees produced by other alignment-free methods. The results were consistent with current knowledge about prokaryotic evolution. We assessed differences in tree topology over different methods and settings and found that the majority of bacteria and archaea have a core set of proteins that evolves by descent. In trees built from complete genomes rather than sets of core genes, we observed some grouping by phenotype rather than phylogeny, for instance with a cluster of sulfur-reducing thermophilic bacteria coming together irrespective of their phyla. The source-code for SlopeTree is available at: http://prodata.swmed.edu/download/pub/slopetree_v1/slopetree.tar.gz. PMID:27336403

Accurate Phylogenetic Tree Reconstruction from Quartets: A Heuristic Approach

PubMed Central

Reaz, Rezwana; Bayzid, Md. Shamsuzzoha; Rahman, M. Sohel

2014-01-01

Supertree methods construct trees on a set of taxa (species) combining many smaller trees on the overlapping subsets of the entire set of taxa. A ‘quartet’ is an unrooted tree over taxa, hence the quartet-based supertree methods combine many -taxon unrooted trees into a single and coherent tree over the complete set of taxa. Quartet-based phylogeny reconstruction methods have been receiving considerable attentions in the recent years. An accurate and efficient quartet-based method might be competitive with the current best phylogenetic tree reconstruction methods (such as maximum likelihood or Bayesian MCMC analyses), without being as computationally intensive. In this paper, we present a novel and highly accurate quartet-based phylogenetic tree reconstruction method. We performed an extensive experimental study to evaluate the accuracy and scalability of our approach on both simulated and biological datasets. PMID:25117474

The KOI 425 Multi-star System

NASA Astrophysics Data System (ADS)

Hughes, Anna; Boley, Aaron C.

2017-10-01

Kepler Object of Interest 425 (KOI 425) is an eclipsing binary with periodic features in addition to the known primary and secondary transits. This KOI has been observed by Saterne et al. 2012 with SOPHIE, who found its phase variance to be indicative of a diluted eclipsing binary, likely produced by a multi-star system. We analyze the complete set of Kepler archival data for this system along with the published SOPHIE results to assess the multiplicity and the dynamics of the system.

Colliding Winds in Massive Binaries

NASA Astrophysics Data System (ADS)

Thaller, M. L.

1998-12-01

In close binary systems of massive stars, the individual stellar winds will collide and form a bow shock between the stars, which may have significant impact on the mass-loss and evolution of the system. The existence of such a shock can be established through orbital-phase related variations in the UV resonance lines and optical emission lines. High density regions near the shock will produce Hα and Helium I emission which can be used to map the mass-flow structure of the system. The shock front between the stars may influence the balance of mass-loss versus mass-transfer in massive binary evolution, as matter lost to one star due to Roche lobe overflow may hit the shock and be deflected before it can accrete onto the surface of the other star. I have completed a high-resolution spectroscopic survey of 37 massive binaries, and compared the incidence and strength of emission to an independent survey of single massive stars. Binary stars show a statistically significant overabundance of optical emission, especially when one of the binary stars is in either a giant or supergiant phase of evolution. Seven systems in my survey exhibited clear signs of orbital phase related emission, and for three of the stars (HD 149404, HD 152248, and HD 163181), I present qualitative models of the mass-flow dynamics of the systems.

Binary adsorption of copper(II) and cadmium(II) from aqueous solutions by biomass of marine alga Durvillaea potatorum

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

Yu, Q.; Kaewsarn, P.

1999-06-01

Much work on the biosorption of heavy metals by low-cost, natural biomass has been on the uptake of single metals. In practice, wastewaters often contain multiple heavy metal ions. In this paper the binary adsorption of copper(II) and cadmium(II) by a pretreated biomass of the marine alga Durvillaea potatorum from aqueous solutions was studied. The results showed that the uptake capacities for each heavy metal of the binary system were lower when compared with the single metal biosorption for copper and cadmium, respectively, but the total capacities for the binary system were similar to those obtained for single metal biosorption.more » The uptake capacities for copper and cadmium increased as the equilibrium pH increased and reached a plateau at a pH around 5.0. The uptake process was relatively fast, with 90% of the adsorption completed within 10 minutes for copper and 30 minutes for cadmium, and equilibrium reached after about 60 minutes of stirring. The biosorption isotherms of binary systems were not significantly affected by equilibrium temperature. The presence of light metal ions in solution also did not affect adsorption significantly. The binary adsorption was successfully predicted by the extended Langmuir model, using parameters and capacities obtained from single component systems.« less

Reconstructing population histories from single nucleotide polymorphism data.

PubMed

Sirén, Jukka; Marttinen, Pekka; Corander, Jukka

2011-01-01

Population genetics encompasses a strong theoretical and applied research tradition on the multiple demographic processes that shape genetic variation present within a species. When several distinct populations exist in the current generation, it is often natural to consider the pattern of their divergence from a single ancestral population in terms of a binary tree structure. Inference about such population histories based on molecular data has been an intensive research topic in the recent years. The most common approach uses coalescent theory to model genealogies of individuals sampled from the current populations. Such methods are able to compare several different evolutionary scenarios and to estimate demographic parameters. However, their major limitation is the enormous computational complexity associated with the indirect modeling of the demographies, which limits the application to small data sets. Here, we propose a novel Bayesian method for inferring population histories from unlinked single nucleotide polymorphisms, which is applicable also to data sets harboring large numbers of individuals from distinct populations. We use an approximation to the neutral Wright-Fisher diffusion to model random fluctuations in allele frequencies. The population histories are modeled as binary rooted trees that represent the historical order of divergence of the different populations. A combination of analytical, numerical, and Monte Carlo integration techniques are utilized for the inferences. A particularly important feature of our approach is that it provides intuitive measures of statistical uncertainty related with the estimates computed, which may be entirely lacking for the alternative methods in this context. The potential of our approach is illustrated by analyses of both simulated and real data sets.

Comparing performance of centerline algorithms for quantitative assessment of brain vascular anatomy.

PubMed

Diedrich, Karl T; Roberts, John A; Schmidt, Richard H; Parker, Dennis L

2012-12-01

Attributes like length, diameter, and tortuosity of tubular anatomical structures such as blood vessels in medical images can be measured from centerlines. This study develops methods for comparing the accuracy and stability of centerline algorithms. Sample data included numeric phantoms simulating arteries and clinical human brain artery images. Centerlines were calculated from segmented phantoms and arteries with shortest paths centerline algorithms developed with different cost functions. The cost functions were the inverse modified distance from edge (MDFE(i) ), the center of mass (COM), the binary-thinned (BT)-MDFE(i) , and the BT-COM. The accuracy of the centerline algorithms were measured by the root mean square error from known centerlines of phantoms. The stability of the centerlines was measured by starting the centerline tree from different points and measuring the differences between trees. The accuracy and stability of the centerlines were visualized by overlaying centerlines on vasculature images. The BT-COM cost function centerline was the most stable in numeric phantoms and human brain arteries. The MDFE(i) -based centerline was most accurate in the numeric phantoms. The COM-based centerline correctly handled the "kissing" artery in 16 of 16 arteries in eight subjects whereas the BT-COM was correct in 10 of 16 and MDFE(i) was correct in 6 of 16. The COM-based centerline algorithm was selected for future use based on the ability to handle arteries where the initial binary vessels segmentation exhibits closed loops. The selected COM centerline was found to measure numerical phantoms to within 2% of the known length. Copyright © 2012 Wiley Periodicals, Inc.

Teaching Tree-Thinking to Undergraduate Biology Students.

PubMed

Meisel, Richard P

2010-07-27

Evolution is the unifying principle of all biology, and understanding how evolutionary relationships are represented is critical for a complete understanding of evolution. Phylogenetic trees are the most conventional tool for displaying evolutionary relationships, and "tree-thinking" has been coined as a term to describe the ability to conceptualize evolutionary relationships. Students often lack tree-thinking skills, and developing those skills should be a priority of biology curricula. Many common student misconceptions have been described, and a successful instructor needs a suite of tools for correcting those misconceptions. I review the literature on teaching tree-thinking to undergraduate students and suggest how this material can be presented within an inquiry-based framework.

Photometric investigation of the totally eclipsing contact binary V12 in the intermediate-age open cluster NGC 7789

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

Qian, S.-B.; Wang, J.-J.; Liu, L.

2015-02-01

NGC 7789 is an intermediate-age open cluster with an age similar to the mean age of contact binary stars. V12 is a bright W UMa-type binary star with an orbital period of 0.3917 days. The first complete light curves of V12 in the V, R, and I bands are presented and analyzed with the Wilson–Devinney (W-D) method. The results show that V12 is an intermediate-contact binary (f=43.0(±2.2)%) with a mass ratio of 3.848, and it is a W-type contact binary where the less massive component is slightly hotter than the more massive one. The asymmetry of the light curves ismore » explained by the presence of a dark spot on the more massive component. The derived orbital inclination (i=83{sub .}{sup ∘}6) indicates that it is a totally eclipsing binary, which suggests that the determined parameters are reliable. The orbital period may show a long-term increase at a rate of P-dot =+2.48(±0.17)×10{sup −6} days yr{sup −1} that reveals a rapid mass transfer from the less massive component to the more massive one. However, more observations are needed to confirm this conclusion. The presence of an intermediate-contact binary in an intermediate-age open cluster may suggest that some contact binaries have a very short pre-contact timescale. The presence of a third body and/or stellar collision may help to shorten the pre-contact evolution.« less

Simulations of black-hole binaries with unequal masses or nonprecessing spins: Accuracy, physical properties, and comparison with post-Newtonian results

NASA Astrophysics Data System (ADS)

Hannam, Mark; Husa, Sascha; Ohme, Frank; Müller, Doreen; Brügmann, Bernd

2010-12-01

We present gravitational waveforms for the last orbits and merger of black-hole-binary systems along two branches of the black-hole-binary parameter space: equal-mass binaries with equal nonprecessing spins, and nonspinning unequal-mass binaries. The waveforms are calculated from numerical solutions of Einstein’s equations for black-hole binaries that complete between six and ten orbits before merger. Along the equal-mass spinning branch, the spin parameter of each black hole is χi=Si/Mi2∈[-0.85,0.85], and along the unequal-mass branch the mass ratio is q=M2/M1∈[1,4]. We discuss the construction of low-eccentricity puncture initial data for these cases, the properties of the final merged black hole, and compare the last 8-10 gravitational-wave cycles up to Mω=0.1 with the phase and amplitude predicted by standard post-Newtonian (PN) approximants. As in previous studies, we find that the phase from the 3.5PN TaylorT4 approximant is most accurate for nonspinning binaries. For equal-mass spinning binaries the 3.5PN TaylorT1 approximant (including spin terms up to only 2.5PN order) gives the most robust performance, but it is possible to treat TaylorT4 in such a way that it gives the best accuracy for spins χi>-0.75. When high-order amplitude corrections are included, the PN amplitude of the (ℓ=2,m=±2) modes is larger than the numerical relativity amplitude by between 2-4%.

Characterization of a new apple luteovirus identified by high-throughput sequencing.

PubMed

Liu, Huawei; Wu, Liping; Nikolaeva, Ekaterina; Peter, Kari; Liu, Zongrang; Mollov, Dimitre; Cao, Mengji; Li, Ruhui

2018-05-15

'Rapid Apple Decline' (RAD) is a newly emerging problem of young, dwarf apple trees in the Northeastern USA. The affected trees show trunk necrosis, cracking and canker before collapse in summer. In this study, we discovered and characterized a new luteovirus from apple trees in RAD-affected orchards using high-throughput sequencing (HTS) technology and subsequent Sanger sequencing. Illumina NextSeq sequencing was applied to total RNAs prepared from three diseased apple trees. Sequence reads were de novo assembled, and contigs were annotated by BLASTx. RT-PCR and 5'/3' RACE sequencing were used to obtain the complete genome of a new virus. RT-PCR was used to detect the virus. Three common apple viruses and a new luteovirus were identified from the diseased trees by HTS and RT-PCR. Sequence analyses of the complete genome of the new virus show that it is a new species of the genus Luteovirus in the family Luteoviridae. The virus is graft transmissible and detected by RT-PCR in apple trees in a couple of orchards. A new luteovirus and/or three known viruses were found to be associated with RAD. Molecular characterization of the new luteovirus provides important information for further investigation of its distribution and etiological role.

Matching asteroid population characteristics with a model constructed from the YORP-induced rotational fission hypothesis

NASA Astrophysics Data System (ADS)

Jacobson, Seth A.; Marzari, Francesco; Rossi, Alessandro; Scheeres, Daniel J.

2016-10-01

From the results of a comprehensive asteroid population evolution model, we conclude that the YORP-induced rotational fission hypothesis is consistent with the observed population statistics of small asteroids in the main belt including binaries and contact binaries. These conclusions rest on the asteroid rotation model of Marzari et al. ([2011]Icarus, 214, 622-631), which incorporates both the YORP effect and collisional evolution. This work adds to that model the rotational fission hypothesis, described in detail within, and the binary evolution model of Jacobson et al. ([2011a] Icarus, 214, 161-178) and Jacobson et al. ([2011b] The Astrophysical Journal Letters, 736, L19). Our complete asteroid population evolution model is highly constrained by these and other previous works, and therefore it has only two significant free parameters: the ratio of low to high mass ratio binaries formed after rotational fission events and the mean strength of the binary YORP (BYORP) effect. We successfully reproduce characteristic statistics of the small asteroid population: the binary fraction, the fast binary fraction, steady-state mass ratio fraction and the contact binary fraction. We find that in order for the model to best match observations, rotational fission produces high mass ratio (> 0.2) binary components with four to eight times the frequency as low mass ratio (<0.2) components, where the mass ratio is the mass of the secondary component divided by the mass of the primary component. This is consistent with post-rotational fission binary system mass ratio being drawn from either a flat or a positive and shallow distribution, since the high mass ratio bin is four times the size of the low mass ratio bin; this is in contrast to the observed steady-state binary mass ratio, which has a negative and steep distribution. This can be understood in the context of the BYORP-tidal equilibrium hypothesis, which predicts that low mass ratio binaries survive for a significantly longer period of time than high mass ratio systems. We also find that the mean of the log-normal BYORP coefficient distribution μB ≳10-2 , which is consistent with estimates from shape modeling (McMahon and Scheeres, 2012a).

Discovery of a 3.6-hr Eclipsing Luminous X-Ray Binary in the Galaxy NGC 4214

NASA Technical Reports Server (NTRS)

Ghosh, Kajal K.; Rappaport, Saul; Tennant, Allyn F.; Swartz, Douglas A.; Pooley, David; Madhusudhan, N.

2006-01-01

We report the discovery of an eclipsing X-ray binary with a 3.62-hr period within 24 arcsec of the center of the dwarf starburst galaxy NGC 4214. The orbital period places interesting constraints on the nature of the binary, and allows for a few very different interpretations. The most likely possibility is that the source lies within NGC 4214 and has an X-ray luminosity of up to 7e38. In this case the binary may well be comprised of a naked He-burning donor star with a neutron-star accretor, though a stellar-mass black-hole accretor cannot be completely excluded. There is no obvious evidence for a strong stellar wind in the X-ray orbital light curve that would be expected from a massive He star; thus, the mass of the He star should be <3-4 solar masses. If correct, this would represent a new class of very luminous X-ray binary----perhaps related to Cyg X-3. Other less likely possibilities include a conventional low-mass X-ray binary that somehow manages to produce such a high X-ray luminosity and is apparently persistent over an interval of years; or a foreground AM Her binary of much lower luminosity that fortuitously lies in the direction of NGC 4214. Any model for this system must accommodate the lack of an optical counterpart down to a limiting magnitude of 22.6 in the visible.

Biases in Planet Occurrence Caused by Unresolved Binaries in Transit Surveys

NASA Astrophysics Data System (ADS)

Bouma, L. G.; Masuda, Kento; Winn, Joshua N.

2018-06-01

Wide-field surveys for transiting planets, such as the NASA Kepler and TESS missions, are usually conducted without knowing which stars have binary companions. Unresolved and unrecognized binaries give rise to systematic errors in planet occurrence rates, including misclassified planets and mistakes in completeness corrections. The individual errors can have different signs, making it difficult to anticipate the net effect on inferred occurrence rates. Here, we use simplified models of signal-to-noise limited transit surveys to try and clarify the situation. We derive a formula for the apparent occurrence rate density measured by an observer who falsely assumes all stars are single. The formula depends on the binary fraction, the mass function of the secondary stars, and the true occurrence of planets around primaries, secondaries, and single stars. It also takes into account the Malmquist bias by which binaries are over-represented in flux-limited samples. Application of the formula to an idealized Kepler-like survey shows that for planets larger than 2 R ⊕, the net systematic error is of order 5%. In particular, unrecognized binaries are unlikely to be the reason for the apparent discrepancies between hot-Jupiter occurrence rates measured in different surveys. For smaller planets the errors are potentially larger: the occurrence of Earth-sized planets could be overestimated by as much as 50%. We also show that whenever high-resolution imaging reveals a transit host star to be a binary, the planet is usually more likely to orbit the primary star than the secondary star.

Quick probabilistic binary image matching: changing the rules of the game

NASA Astrophysics Data System (ADS)

Mustafa, Adnan A. Y.

2016-09-01

A Probabilistic Matching Model for Binary Images (PMMBI) is presented that predicts the probability of matching binary images with any level of similarity. The model relates the number of mappings, the amount of similarity between the images and the detection confidence. We show the advantage of using a probabilistic approach to matching in similarity space as opposed to a linear search in size space. With PMMBI a complete model is available to predict the quick detection of dissimilar binary images. Furthermore, the similarity between the images can be measured to a good degree if the images are highly similar. PMMBI shows that only a few pixels need to be compared to detect dissimilarity between images, as low as two pixels in some cases. PMMBI is image size invariant; images of any size can be matched at the same quick speed. Near-duplicate images can also be detected without much difficulty. We present tests on real images that show the prediction accuracy of the model.

Continued Kinematic and Photometric Investigations of Hierarchical Solar-type Multiple Star Systems

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

Roberts, Lewis C. Jr.; Marinan, Anne D.; Tokovinin, Andrei

2017-03-01

We observed 15 of the solar-type binaries within 67 pc of the Sun previously observed by the Robo-AO system in the visible, with the PHARO near-infrared camera and the PALM-3000 adaptive optics system on the 5 m Hale telescope. The physical status of the binaries is confirmed through common proper motion and detection of orbital motion. In the process, we detected a new candidate companion to HIP 95309. We also resolved the primary of HIP 110626 into a close binary, making that system a triple. These detections increase the completeness of the multiplicity survey of the solar-type stars within 67more » pc of the Sun. Combining our observations of HIP 103455 with archival astrometric measurements and RV measurements, we are able to compute the first orbit of HIP 103455, showing that the binary has a 68 year period. We place the components on a color–magnitude diagram and discuss each multiple system individually.« less

Respecting variations in embodiment as well as gender: Beyond the presumed 'binary' of sex.

PubMed

Saewyc, Elizabeth M

2017-01-01

Although societies and health care systems are increasingly recognizing gender outside traditional binary categories, the notion persists of two, and only two sexes, 'naturally' aligned between chromosomes and phenotypic body. Yet there are more than a dozen documented genetic or phenotypic variations that do not completely fit the two simplistic categories, and together, they may comprise 1%-2% of the population worldwide. In this commentary, I consider how adherence to binary notions of sex has created and maintained social and health care structures that perpetuate health care inequities, and may well violate our nursing codes of ethics. I provide some current examples in law and health care systems that create difficulties for people with variations in sex development. I describe our responsibility to challenge the societally promoted but scientifically inaccurate perspective of sex as a binary. I conclude by briefly suggesting a few implications for action within nursing research, nursing education, nursing practice, and in advocacy as a profession. © 2017 John Wiley & Sons Ltd.

A simplified approach to construct infectious cDNA clones of a tobamovirus in a binary vector.

PubMed

Junqueira, Bruna Rayane Teodoro; Nicolini, Cícero; Lucinda, Natalia; Orílio, Anelise Franco; Nagata, Tatsuya

2014-03-01

Infectious cDNA clones of RNA viruses are important tools to study molecular processes such as replication and host-virus interactions. However, the cloning steps necessary for construction of cDNAs of viral RNA genomes in binary vectors are generally laborious. In this study, a simplified method of producing an agro-infectious Pepper mild mottle virus (PMMoV) clone is described in detail. Initially, the complete genome of PMMoV was amplified by a single-step RT-PCR, cloned, and subcloned into a small plasmid vector under the T7 RNA polymerase promoter to confirm the infectivity of the cDNA clone through transcript inoculation. The complete genome was then transferred to a binary vector using a single-step, overlap-extension PCR. The selected clones were agro-infiltrated to Nicotiana benthamiana plants and showed to be infectious, causing typical PMMoV symptoms. No differences in host responses were observed when the wild-type PMMoV isolate, the T7 RNA polymerase-derived transcripts and the agroinfiltration-derived viruses were inoculated to N. benthamiana, Capsicum chinense PI 159236 and Capsicum annuum plants. Copyright © 2013 Elsevier B.V. All rights reserved.

Exploring the Effects of Stellar Multiplicity on Exoplanet Occurrence Rates

NASA Astrophysics Data System (ADS)

Barclay, Thomas; Shabram, Megan

2017-06-01

Determining the frequency of habitable worlds is a key goal of the Kepler mission. During Kepler's four year investigation it detected thousands of transiting exoplanets with sizes varying from smaller than Mercury to larger than Jupiter. Finding planets was just the first step to determining frequency, and for the past few years the mission team has been modeling the reliability and completeness of the Kepler planet sample. One effect that has not typically been built into occurrence rate statistics is that of stellar multiplicity. If a planet orbits the primary star in a binary or triple star system then the transit depth will be somewhat diluted resulting in a modest underestimation in the planet size. However, if a detected planet orbits a fainter star then the error in measured planet radius can be very significant. We have taken a hypothetical star and planet population and passed that through a Kepler detection model. From this we have derived completeness corrections for a realistic case of a Universe with binary stars and compared that with a model Universe where all stars are single. We report on the impact that binaries have on exoplanet population statistics.

Mathematical model for the growth of phases in binary multiphase systems upon isothermic annealing

NASA Astrophysics Data System (ADS)

Molokhina, L. A.; Rogalin, V. E.; Filin, S. A.; Kaplunov, I. A.

2017-09-01

A phenomenological mathematical model of the formation and growth of phases in a binary multiphase system with allowance for factors influencing the process of diffusion in a binary system is presented. It is shown that phases can grow for a certain time at different ratios between diffusion parameters according to a parabolic law that depends on the duration of isothermic annealing. They then slow their growth after successor phases appear at their interface with one component and can completely disappear from a diffusion layer or begin to grow again, but only at a rate slower than during their initial formation. The dependence of the thickness of each phase layer in a multiphase diffusion zone on the duration of isothermic annealing and the ratio between the diffusion parameters in neighboring phases is obtained. It is established that a certain ratio between the phase growth and rates of dissolution with allowance for the coefficients of diffusion in each phase and the periods of incubation can result in the complete disappearance of one phase as early as the onset of the growth of phase nuclei and be interpreted as a process of reaction diffusion.

7 CFR 760.507 - Obligations of a participant.

Code of Federal Regulations, 2012 CFR

2012-01-01

... AGRICULTURE SPECIAL PROGRAMS INDEMNITY PAYMENT PROGRAMS Tree Assistance Program § 760.507 Obligations of a participant. (a) Eligible orchardists and nursery tree growers must execute all required documents and complete the TAP-funded practice within 12 months of application approval. (b) Eligible orchardist or...

7 CFR 760.507 - Obligations of a participant.

Code of Federal Regulations, 2014 CFR

2014-01-01

... AGRICULTURE SPECIAL PROGRAMS INDEMNITY PAYMENT PROGRAMS Tree Assistance Program § 760.507 Obligations of a participant. (a) Eligible orchardists and nursery tree growers must execute all required documents and complete the TAP-funded practice within 12 months of application approval. (b) Eligible orchardist or...

7 CFR 760.507 - Obligations of a participant.

Code of Federal Regulations, 2013 CFR

2013-01-01

... AGRICULTURE SPECIAL PROGRAMS INDEMNITY PAYMENT PROGRAMS Tree Assistance Program § 760.507 Obligations of a participant. (a) Eligible orchardists and nursery tree growers must execute all required documents and complete the TAP-funded practice within 12 months of application approval. (b) Eligible orchardist or...

7 CFR 760.507 - Obligations of a participant.

Code of Federal Regulations, 2011 CFR

2011-01-01

... AGRICULTURE SPECIAL PROGRAMS INDEMNITY PAYMENT PROGRAMS Tree Assistance Program § 760.507 Obligations of a participant. (a) Eligible orchardists and nursery tree growers must execute all required documents and complete the TAP-funded practice within 12 months of application approval. (b) Eligible orchardist or...

Ab initio atomistic thermodynamics study on the oxidation mechanism of binary and ternary alloy surfaces

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

Liu, Shi-Yu, E-mail: buaasyliu@gmail.com; Department of Mechanical and Biomedical Engineering, City University of Hong Kong, Kowloon, Hong Kong; Liu, Shiyang

Utilizing a combination of ab initio density-functional theory and thermodynamics formalism, we have established the microscopic mechanisms for oxidation of the binary and ternary alloy surfaces and provided a clear explanation for the experimental results of the oxidation. We construct three-dimensional surface phase diagrams (SPDs) for oxygen adsorption on three different Nb-X(110) (X = Ti, Al or Si) binary alloy surfaces. On the basis of the obtained SPDs, we conclude a general microscopic mechanism for the thermodynamic oxidation, that is, under O-rich conditions, a uniform single-phase SPD (type I) and a nonuniform double-phase SPD (type II) correspond to the sustainedmore » complete selective oxidation and the non-sustained partial selective oxidation by adding the X element, respectively. Furthermore, by revealing the framework of thermodynamics for the oxidation mechanism of ternary alloys through the comparison of the surface energies of two separated binary alloys, we provide an understanding for the selective oxidation behavior of the Nb ternary alloy surfaces. Using these general microscopic mechanisms, one could predict the oxidation behavior of any binary and multi-component alloy surfaces based on thermodynamics considerations.« less

Phase relations in the system NaCl-KCl-H2O: V. Thermodynamic-PTX analysis of solid-liquid equilibria at high temperatures and pressures

USGS Publications Warehouse

Sterner, S.M.; Chou, I.-Ming; Downs, R.T.; Pitzer, Kenneth S.

1992-01-01

The Gibbs energies of mixing for NaCl-KCl binary solids and liquids and solid-saturated NaCl-KCl-H2O ternary liquids were modeled using asymmetric Margules treatments. The coefficients of the expressions were calibrated using an extensive array of binary solvus and solidus data, and both binary and ternary liquidus data. Over the PTX range considered, the system exhibits complete liquid miscibility among all three components and extensive solid solution along the anhydrous binary. Solid-liquid and solid-solid phase equilibria were calculated by using the resulting equations and invoking the equality of chemical potentials of NaCl and KCl between appropriate phases at equilibrium. The equations reproduce the ternary liquidus and predict activity coefficients for NaCl and KCl components in the aqueous liquid under solid-saturation conditions between 673 and 1200 K from vapor saturation up to 5 kbar. In the NaCl-KCl anhydrous binary system, the equations describe phase equilibria and predict activity coefficients of the salt components for all stable compositions of solid and liquid phases between room temperature and 1200 K and from 1 bar to 5 kbar. ?? 1992.

Efficient common-envelope ejection through dust-driven winds

NASA Astrophysics Data System (ADS)

Glanz, Hila; Perets, Hagai B.

2018-04-01

Common-envelope evolution (CEE) is the short-lived phase in the life of an interacting binary-system during which two stars orbit inside a single shared envelope. Such evolution is thought to lead to the inspiral of the binary, the ejection of the extended envelope and the formation of a remnant short-period binary. However, detailed hydrodynamical models of CEE encounter major difficulties. They show that following the inspiral most of the envelope is not ejected; though it expands to larger separations, it remains bound to the binary. Here we propose that dust-driven winds can be produced following the CEE. These can evaporate the envelope following similar processes operating in the ejection of the envelopes of AGB stars. Pulsations in an AGB-star drives the expansion of its envelope, allowing the material to cool down to low temperatures thus enabling dust condensation. Radiation pressure on the dust accelerates it, and through its coupling to the gas it drives winds which eventually completely erode the envelope. We show that the inspiral phase in CE-binaries can effectively replace the role of stellar pulsation and drive the CE expansion to scales comparable with those of AGB stars, and give rise to efficient mass-loss through dust-driven winds.

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

Bryngelson, R.H.

Describes installation of 3 wet, diver-assist trees, in the Espoir field offshore Ivory Coast, as part of Phillips Petroleum's plans to use 5 satellite wells with downhole completion equipment and subsea production trees. Simplicity in design and attention to training has resulted in an installation time of about 3 weeks for one of the largest subsea trees in the industry. Presents diagram showing the converted jackup, Dan Duke drilling unit, which supports equipment to handle production from subsea wells.

The relationship between the emerald ash borer (Agrilus planipennis) and ash (Fraxinus spp.) tree decline: Using visual canopy condition assessments and leaf isotope measurements to assess pest damage

Treesearch

Charles E. Flower; Kathleen S. Knight; Joanne Rebbeck; Miquel A. Gonzalez-Meler

2013-01-01

Ash trees (Fraxinus spp.) in North America are being severely impacted by the invasive emerald ash borer (Agrilus planipennis Fairmaire) which was inadvertently introduced to the US in the 1990s from Asia. The emerald ash borer (EAB) is a phloem boring beetle which relies exclusively on ash trees to complete its life cycle. Larvae...

Range Condition Assessment Report for Naval Surface Warfare Center, Dahlgren Laboratory Ranges, Dahlgren, Virginia

DTIC Science & Technology

2010-09-01

following alternative: vegetative soil cap, offsite disposal of sediments, and phytoremediation to control groundwater levels beneath the landfill. The...cap. These issues include poor condition of the phytoremediation trees on the surface of the landfill cap and blockage of the pond outfall structure...to be completed in January 2009. Based on the poor condition of the phytoremediation trees on the landfill cap, a supplemental tree planting

Relation of Stem Diameter, Branch Basal Area, and Leaf Biomass in Rapidly Growing Loblolly Pine

Treesearch

Thomas M. Williams; Charles A. Gresham

2004-01-01

Twenty loblolly pines, growing in International Paper’s maximum growth experiment at Bainbridge GA, were destructively sampled at the end of the sixth growing season. Ten trees in the control and 10 in the maximum treatment were sampled. All trees were planted at a 2.4- by 3.6-m spacing and grown with complete competition control. The maximum trees also received...

Hydrochemical analysis of groundwater using a tree-based model

NASA Astrophysics Data System (ADS)

Litaor, M. Iggy; Brielmann, H.; Reichmann, O.; Shenker, M.

2010-06-01

SummaryHydrochemical indices are commonly used to ascertain aquifer characteristics, salinity problems, anthropogenic inputs and resource management, among others. This study was conducted to test the applicability of a binary decision tree model to aquifer evaluation using hydrochemical indices as input. The main advantage of the tree-based model compared to other commonly used statistical procedures such as cluster and factor analyses is the ability to classify groundwater samples with assigned probability and the reduction of a large data set into a few significant variables without creating new factors. We tested the model using data sets collected from headwater springs of the Jordan River, Israel. The model evaluation consisted of several levels of complexity, from simple separation between the calcium-magnesium-bicarbonate water type of karstic aquifers to the more challenging separation of calcium-sodium-bicarbonate water type flowing through perched and regional basaltic aquifers. In all cases, the model assigned measures for goodness of fit in the form of misclassification errors and singled out the most significant variable in the analysis. The model proceeded through a sequence of partitions providing insight into different possible pathways and changing lithology. The model results were extremely useful in constraining the interpretation of geological heterogeneity and constructing a conceptual flow model for a given aquifer. The tree model clearly identified the hydrochemical indices that were excluded from the analysis, thus providing information that can lead to a decrease in the number of routinely analyzed variables and a significant reduction in laboratory cost.

Speckle Imaging and Spectroscopy of Kepler Exo-planet Transit Candidate Stars

NASA Astrophysics Data System (ADS)

Howell, Steve B.; Sherry, William; Horch, Elliott; Doyle, Laurance

2010-02-01

The NASA Kepler mission was successfully launched on 6 March 2009 and has begun science operations. Commissioning tests done early on in the mission have shown that for the bright sources, 10-15 ppm relative photometry can be achieved. This level assures we will detect Earth- like transits if they are present. ``Hot Jupiter" and similar large planet candidates have already been discovered and will be discussed at the Jan. AAS meeting as well as in a special issue of Science magazine to appear near years end. The plethora of variability observed is astounding and includes a number of eclipsing binaries which appear to have Jupiter and smaller size objects as an orbiting their body. Our proposal consists of three highly related objectives: 1) To continue our highly successful speckle imaging program which is a major component of defense to weed out false positive candidate transiting planets found by Kepler and move the rest to probable or certain exo-planet detections; 2) To obtain low resolution ``discovery" type spectra for planet candidate stars in order to provide spectral type and luminosity class indicators as well as a first look triage to eliminate binaries and rapid rotators; and 3) to obtain ~1Aresolution time ordered spectra of eclipsing binaries that are exo-planet candidates in order to obtain the velocity solution for the binary star, allowing its signal to be modeled and removed from the Keck or HET exo-planet velocity search. As of this writing, Kepler has produced a list of 227 exo-planet candidates which require false positive decision tree observations. Our proposed effort performs much of the first line of defense for the mission.

Teaching Tree-Thinking to Undergraduate Biology Students

PubMed Central

2011-01-01

Evolution is the unifying principle of all biology, and understanding how evolutionary relationships are represented is critical for a complete understanding of evolution. Phylogenetic trees are the most conventional tool for displaying evolutionary relationships, and “tree-thinking” has been coined as a term to describe the ability to conceptualize evolutionary relationships. Students often lack tree-thinking skills, and developing those skills should be a priority of biology curricula. Many common student misconceptions have been described, and a successful instructor needs a suite of tools for correcting those misconceptions. I review the literature on teaching tree-thinking to undergraduate students and suggest how this material can be presented within an inquiry-based framework. PMID:21572571

A Predictive Model of Daily Seismic Activity Induced by Mining, Developed with Data Mining Methods

NASA Astrophysics Data System (ADS)

Jakubowski, Jacek

2014-12-01

The article presents the development and evaluation of a predictive classification model of daily seismic energy emissions induced by longwall mining in sector XVI of the Piast coal mine in Poland. The model uses data on tremor energy, basic characteristics of the longwall face and mined output in this sector over the period from July 1987 to March 2011. The predicted binary variable is the occurrence of a daily sum of tremor seismic energies in a longwall that is greater than or equal to the threshold value of 105 J. Three data mining analytical methods were applied: logistic regression,neural networks, and stochastic gradient boosted trees. The boosted trees model was chosen as the best for the purposes of the prediction. The validation sample results showed its good predictive capability, taking the complex nature of the phenomenon into account. This may indicate the applied model's suitability for a sequential, short-term prediction of mining induced seismic activity.

Approximate Genealogies Under Genetic Hitchhiking

PubMed Central

Pfaffelhuber, P.; Haubold, B.; Wakolbinger, A.

2006-01-01

The rapid fixation of an advantageous allele leads to a reduction in linked neutral variation around the target of selection. The genealogy at a neutral locus in such a selective sweep can be simulated by first generating a random path of the advantageous allele's frequency and then a structured coalescent in this background. Usually the frequency path is approximated by a logistic growth curve. We discuss an alternative method that approximates the genealogy by a random binary splitting tree, a so-called Yule tree that does not require first constructing a frequency path. Compared to the coalescent in a logistic background, this method gives a slightly better approximation for identity by descent during the selective phase and a much better approximation for the number of lineages that stem from the founder of the selective sweep. In applications such as the approximation of the distribution of Tajima's D, the two approximation methods perform equally well. For relevant parameter ranges, the Yule approximation is faster. PMID:17182733

A linear programming approach to max-sum problem: a review.

PubMed

Werner, Tomás

2007-07-01

The max-sum labeling problem, defined as maximizing a sum of binary (i.e., pairwise) functions of discrete variables, is a general NP-hard optimization problem with many applications, such as computing the MAP configuration of a Markov random field. We review a not widely known approach to the problem, developed by Ukrainian researchers Schlesinger et al. in 1976, and show how it contributes to recent results, most importantly, those on the convex combination of trees and tree-reweighted max-product. In particular, we review Schlesinger et al.'s upper bound on the max-sum criterion, its minimization by equivalent transformations, its relation to the constraint satisfaction problem, the fact that this minimization is dual to a linear programming relaxation of the original problem, and the three kinds of consistency necessary for optimality of the upper bound. We revisit problems with Boolean variables and supermodular problems. We describe two algorithms for decreasing the upper bound. We present an example application for structural image analysis.

Modification of the SAS4A Safety Analysis Code for Integration with the ADAPT Discrete Dynamic Event Tree Framework.

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

Jankovsky, Zachary Kyle; Denman, Matthew R.

It is difficult to assess the consequences of a transient in a sodium-cooled fast reactor (SFR) using traditional probabilistic risk assessment (PRA) methods, as numerous safety-related sys- tems have passive characteristics. Often there is significant dependence on the value of con- tinuous stochastic parameters rather than binary success/failure determinations. One form of dynamic PRA uses a system simulator to represent the progression of a transient, tracking events through time in a discrete dynamic event tree (DDET). In order to function in a DDET environment, a simulator must have characteristics that make it amenable to changing physical parameters midway through themore » analysis. The SAS4A SFR system analysis code did not have these characteristics as received. This report describes the code modifications made to allow dynamic operation as well as the linking to a Sandia DDET driver code. A test case is briefly described to demonstrate the utility of the changes.« less

Completion of the universal I-Love-Q relations in compact stars including the mass

NASA Astrophysics Data System (ADS)

Reina, Borja; Sanchis-Gual, Nicolas; Vera, Raül; Font, José A.

2017-09-01

In a recent paper, we applied a rigorous perturbed matching framework to show the amendment of the mass of rotating stars in Hartle's model. Here, we apply this framework to the tidal problem in binary systems. Our approach fully accounts for the correction to the Love numbers needed to obtain the universal I-Love-Q relations. We compute the corrected mass versus radius configurations of rotating quark stars, revisiting a classical paper on the subject. These corrections allow us to find a universal relation involving the second-order contribution to the mass δM. We thus complete the set of universal relations for the tidal problem in binary systems, involving four perturbation parameters, namely I, Love, Q and δM. These relations can be used to obtain the perturbation parameters directly from observational data.

Toward Predicting Social Support Needs in Online Health Social Networks.

PubMed

Choi, Min-Je; Kim, Sung-Hee; Lee, Sukwon; Kwon, Bum Chul; Yi, Ji Soo; Choo, Jaegul; Huh, Jina

2017-08-02

While online health social networks (OHSNs) serve as an effective platform for patients to fulfill their various social support needs, predicting the needs of users and providing tailored information remains a challenge. The objective of this study was to discriminate important features for identifying users' social support needs based on knowledge gathered from survey data. This study also provides guidelines for a technical framework, which can be used to predict users' social support needs based on raw data collected from OHSNs. We initially conducted a Web-based survey with 184 OHSN users. From this survey data, we extracted 34 features based on 5 categories: (1) demographics, (2) reading behavior, (3) posting behavior, (4) perceived roles in OHSNs, and (5) values sought in OHSNs. Features from the first 4 categories were used as variables for binary classification. For the prediction outcomes, we used features from the last category: the needs for emotional support, experience-based information, unconventional information, and medical facts. We compared 5 binary classifier algorithms: gradient boosting tree, random forest, decision tree, support vector machines, and logistic regression. We then calculated the scores of the area under the receiver operating characteristic (ROC) curve (AUC) to understand the comparative effectiveness of the used features. The best performance was AUC scores of 0.89 for predicting users seeking emotional support, 0.86 for experience-based information, 0.80 for unconventional information, and 0.83 for medical facts. With the gradient boosting tree as our best performing model, we analyzed the strength of individual features in predicting one's social support need. Among other discoveries, we found that users seeking emotional support tend to post more in OHSNs compared with others. We developed an initial framework for automatically predicting social support needs in OHSNs using survey data. Future work should involve nonsurvey data to evaluate the feasibility of the framework. Our study contributes to providing personalized social support in OHSNs. ©Min-Je Choi, Sung-Hee Kim, Sukwon Lee, Bum Chul Kwon, Ji Soo Yi, Jaegul Choo, Jina Huh. Originally published in the Journal of Medical Internet Research (http://www.jmir.org), 02.08.2017.

Developing a statistically powerful measure for quartet tree inference using phylogenetic identities and Markov invariants.

PubMed

Sumner, Jeremy G; Taylor, Amelia; Holland, Barbara R; Jarvis, Peter D

2017-12-01

Recently there has been renewed interest in phylogenetic inference methods based on phylogenetic invariants, alongside the related Markov invariants. Broadly speaking, both these approaches give rise to polynomial functions of sequence site patterns that, in expectation value, either vanish for particular evolutionary trees (in the case of phylogenetic invariants) or have well understood transformation properties (in the case of Markov invariants). While both approaches have been valued for their intrinsic mathematical interest, it is not clear how they relate to each other, and to what extent they can be used as practical tools for inference of phylogenetic trees. In this paper, by focusing on the special case of binary sequence data and quartets of taxa, we are able to view these two different polynomial-based approaches within a common framework. To motivate the discussion, we present three desirable statistical properties that we argue any invariant-based phylogenetic method should satisfy: (1) sensible behaviour under reordering of input sequences; (2) stability as the taxa evolve independently according to a Markov process; and (3) explicit dependence on the assumption of a continuous-time process. Motivated by these statistical properties, we develop and explore several new phylogenetic inference methods. In particular, we develop a statistically bias-corrected version of the Markov invariants approach which satisfies all three properties. We also extend previous work by showing that the phylogenetic invariants can be implemented in such a way as to satisfy property (3). A simulation study shows that, in comparison to other methods, our new proposed approach based on bias-corrected Markov invariants is extremely powerful for phylogenetic inference. The binary case is of particular theoretical interest as-in this case only-the Markov invariants can be expressed as linear combinations of the phylogenetic invariants. A wider implication of this is that, for models with more than two states-for example DNA sequence alignments with four-state models-we find that methods which rely on phylogenetic invariants are incapable of satisfying all three of the stated statistical properties. This is because in these cases the relevant Markov invariants belong to a class of polynomials independent from the phylogenetic invariants.

pplacer: linear time maximum-likelihood and Bayesian phylogenetic placement of sequences onto a fixed reference tree

PubMed Central

2010-01-01

Background Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-based phylogenetic methods cannot be applied to large volumes of short reads from next-generation sequencing due to computational complexity issues and lack of phylogenetic signal. "Phylogenetic placement," where a reference tree is fixed and the unknown query sequences are placed onto the tree via a reference alignment, is a way to bring the inferential power offered by likelihood-based approaches to large data sets. Results This paper introduces pplacer, a software package for phylogenetic placement and subsequent visualization. The algorithm can place twenty thousand short reads on a reference tree of one thousand taxa per hour per processor, has essentially linear time and memory complexity in the number of reference taxa, and is easy to run in parallel. Pplacer features calculation of the posterior probability of a placement on an edge, which is a statistically rigorous way of quantifying uncertainty on an edge-by-edge basis. It also can inform the user of the positional uncertainty for query sequences by calculating expected distance between placement locations, which is crucial in the estimation of uncertainty with a well-sampled reference tree. The software provides visualizations using branch thickness and color to represent number of placements and their uncertainty. A simulation study using reads generated from 631 COG alignments shows a high level of accuracy for phylogenetic placement over a wide range of alignment diversity, and the power of edge uncertainty estimates to measure placement confidence. Conclusions Pplacer enables efficient phylogenetic placement and subsequent visualization, making likelihood-based phylogenetics methodology practical for large collections of reads; it is freely available as source code, binaries, and a web service. PMID:21034504

Operational Tree Species Mapping in a Diverse Tropical Forest with Airborne Imaging Spectroscopy.

PubMed

Baldeck, Claire A; Asner, Gregory P; Martin, Robin E; Anderson, Christopher B; Knapp, David E; Kellner, James R; Wright, S Joseph

2015-01-01

Remote identification and mapping of canopy tree species can contribute valuable information towards our understanding of ecosystem biodiversity and function over large spatial scales. However, the extreme challenges posed by highly diverse, closed-canopy tropical forests have prevented automated remote species mapping of non-flowering tree crowns in these ecosystems. We set out to identify individuals of three focal canopy tree species amongst a diverse background of tree and liana species on Barro Colorado Island, Panama, using airborne imaging spectroscopy data. First, we compared two leading single-class classification methods--binary support vector machine (SVM) and biased SVM--for their performance in identifying pixels of a single focal species. From this comparison we determined that biased SVM was more precise and created a multi-species classification model by combining the three biased SVM models. This model was applied to the imagery to identify pixels belonging to the three focal species and the prediction results were then processed to create a map of focal species crown objects. Crown-level cross-validation of the training data indicated that the multi-species classification model had pixel-level producer's accuracies of 94-97% for the three focal species, and field validation of the predicted crown objects indicated that these had user's accuracies of 94-100%. Our results demonstrate the ability of high spatial and spectral resolution remote sensing to accurately detect non-flowering crowns of focal species within a diverse tropical forest. We attribute the success of our model to recent classification and mapping techniques adapted to species detection in diverse closed-canopy forests, which can pave the way for remote species mapping in a wider variety of ecosystems.

Operational Tree Species Mapping in a Diverse Tropical Forest with Airborne Imaging Spectroscopy

PubMed Central

Baldeck, Claire A.; Asner, Gregory P.; Martin, Robin E.; Anderson, Christopher B.; Knapp, David E.; Kellner, James R.; Wright, S. Joseph

2015-01-01

Remote identification and mapping of canopy tree species can contribute valuable information towards our understanding of ecosystem biodiversity and function over large spatial scales. However, the extreme challenges posed by highly diverse, closed-canopy tropical forests have prevented automated remote species mapping of non-flowering tree crowns in these ecosystems. We set out to identify individuals of three focal canopy tree species amongst a diverse background of tree and liana species on Barro Colorado Island, Panama, using airborne imaging spectroscopy data. First, we compared two leading single-class classification methods—binary support vector machine (SVM) and biased SVM—for their performance in identifying pixels of a single focal species. From this comparison we determined that biased SVM was more precise and created a multi-species classification model by combining the three biased SVM models. This model was applied to the imagery to identify pixels belonging to the three focal species and the prediction results were then processed to create a map of focal species crown objects. Crown-level cross-validation of the training data indicated that the multi-species classification model had pixel-level producer’s accuracies of 94–97% for the three focal species, and field validation of the predicted crown objects indicated that these had user’s accuracies of 94–100%. Our results demonstrate the ability of high spatial and spectral resolution remote sensing to accurately detect non-flowering crowns of focal species within a diverse tropical forest. We attribute the success of our model to recent classification and mapping techniques adapted to species detection in diverse closed-canopy forests, which can pave the way for remote species mapping in a wider variety of ecosystems. PMID:26153693

Dynamical masses of pms stars in the taurus star formation region

NASA Astrophysics Data System (ADS)

Simon, M.

2013-02-01

Our preliminary orbital parameters for DF Tau, T Tau Sa-Sb, ZZ Tau and the Pleaides binary are presented in the paper Orbital Motion in Pre-Main Sequence Binaries by G.H. Schaefer, L. Prato, M. Simon, & J. Patience (2013, in prep. for AJ). In the few pages available here I present an overview of our motivation for this work and of our results. The slides and complete references for my talk at the Leuven conference are available at http://www.astro.sunysb.edu/msimon/public.

Unary and binary multisystems; topologic classification of phase diagrams and relation to Euler's theorem on polyhedra.

USGS Publications Warehouse

Roseboom, E.H.; Zen, E.-A.

1982-01-01

A representation polyhedron summarizing the topology of a large number of possible nets previously devised by Zen (M.A. 18-167) is extended from n + 3 unary to n + 6 phase unary systems. A general way for constructing n + 4 phase nets is outlined. With the technique described, 62 multisystems are recognized, of which 26 contain all 16 possible divariant fields and represent the most nearly complete closed nets possible for a binary six-phase (n + 4) multisystem.-M.S.

Gravitational-wave astronomy: delivering on the promises

NASA Astrophysics Data System (ADS)

Schutz, B. F.

2018-05-01

Now that LIGO and Virgo have begun to detect gravitational-wave events with regularity, the field of gravitational-wave astronomy is beginning to realize its promise. Binary black holes and, very recently, binary neutron stars have been observed, and we are already learning much from them. The future, with improved sensitivity, more detectors and detectors like LISA in different frequency bands, has even more promise to open a completely hidden side of the Universe to our exploration. This article is part of a discussion meeting issue `The promises of gravitational-wave astronomy'.

LUT Reveals a New Mass-transferring Semi-detached Binary

NASA Astrophysics Data System (ADS)

Qian, S.-B.; Zhou, X.; Zhu, L.-Y.; Zejda, M.; Soonthornthum, B.; Zhao, E.-G.; Zhang, J.; Zhang, B.; Liao, W.-P.

2015-12-01

GQ Dra is a short-period eclipsing binary in a double stellar system that was discovered by Hipparcos. Complete light curves in the UV band were obtained with the Lunar-based Ultraviolet Telescope in 2014 November and December. Photometric solutions are determined using the W-D (Wilson and Devinney) method. It is discovered that GQ Dra is a classical Algol-type semi-detached binary where the secondary component is filling the critical Roche lobe. An analysis of all available times of minimum light suggests that the orbital period is increasing continuously at a rate of \\dot{P}=+3.48(+/- 0.23)× {10}-7 days yr-1. This could be explained by mass transfer from the secondary to the primary, which is in agreement with the semi-detached configuration with a lobe-filling secondary. By assuming a conservation of mass and angular momentum, the mass transfer rate is estimated as \\dot{m}=9.57(+/- 0.63)× {10}-8 {M}⊙ {{yr}}-1. All of these results reveal that GQ Dra is a mass-transferring semi-detached binary in a double system that was formed from an initially detached binary star. After the massive primary evolves to fill the critical Roche lobe, the mass transfer will be reversed and the binary will evolve into a contact configuration with two sub-giant or giant component stars.

LUT observations of the mass-transferring binary AI Dra

NASA Astrophysics Data System (ADS)

Liao, Wenping; Qian, Shengbang; Li, Linjia; Zhou, Xiao; Zhao, Ergang; Liu, Nianping

2016-06-01

Complete UV band light curve of the eclipsing binary AI Dra was observed with the Lunar-based Ultraviolet Telescope (LUT) in October 2014. It is very useful to adopt this continuous and uninterrupted light curve to determine physical and orbital parameters of the binary system. Photometric solutions of the spot model are obtained by using the W-D (Wilson and Devinney) method. It is confirmed that AI Dra is a semi-detached binary with secondary component filling its critical Roche lobe, which indicates that a mass transfer from the secondary component to the primary one should happen. Orbital period analysis based on all available eclipse times suggests a secular period increase and two cyclic variations. The secular period increase was interpreted by mass transfer from the secondary component to the primary one at a rate of 4.12 ×10^{-8}M_{⊙}/yr, which is in agreement with the photometric solutions. Two cyclic oscillations were due to light travel-time effect (LTTE) via the presence of two cool stellar companions in a near 2:1 mean-motion resonance. Both photometric solutions and orbital period analysis confirm that AI Dra is a mass-transferring binary, the massive primary is filling 69 % of its critical Roche lobe. After the primary evolves to fill the critical Roche lobe, the mass transfer will be reversed and the binary will evolve into a contact configuration.

Simulations of black-hole binaries with unequal masses or nonprecessing spins: Accuracy, physical properties, and comparison with post-Newtonian results

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

Hannam, Mark; School of Physics and Astronomy, Cardiff University, Cardiff, CF24 3AA; Husa, Sascha

We present gravitational waveforms for the last orbits and merger of black-hole-binary systems along two branches of the black-hole-binary parameter space: equal-mass binaries with equal nonprecessing spins, and nonspinning unequal-mass binaries. The waveforms are calculated from numerical solutions of Einstein's equations for black-hole binaries that complete between six and ten orbits before merger. Along the equal-mass spinning branch, the spin parameter of each black hole is {chi}{sub i}=S{sub i}/M{sub i}{sup 2}(set-membership sign)[-0.85,0.85], and along the unequal-mass branch the mass ratio is q=M{sub 2}/M{sub 1}(set-membership sign)[1,4]. We discuss the construction of low-eccentricity puncture initial data for these cases, the properties ofmore » the final merged black hole, and compare the last 8-10 gravitational-wave cycles up to M{omega}=0.1 with the phase and amplitude predicted by standard post-Newtonian (PN) approximants. As in previous studies, we find that the phase from the 3.5PN TaylorT4 approximant is most accurate for nonspinning binaries. For equal-mass spinning binaries the 3.5PN TaylorT1 approximant (including spin terms up to only 2.5PN order) gives the most robust performance, but it is possible to treat TaylorT4 in such a way that it gives the best accuracy for spins {chi}{sub i}>-0.75. When high-order amplitude corrections are included, the PN amplitude of the (l=2, m={+-}2) modes is larger than the numerical relativity amplitude by between 2-4%.« less

A dual growing method for the automatic extraction of individual trees from mobile laser scanning data

NASA Astrophysics Data System (ADS)

Li, Lin; Li, Dalin; Zhu, Haihong; Li, You

2016-10-01

Street trees interlaced with other objects in cluttered point clouds of urban scenes inhibit the automatic extraction of individual trees. This paper proposes a method for the automatic extraction of individual trees from mobile laser scanning data, according to the general constitution of trees. Two components of each individual tree - a trunk and a crown can be extracted by the dual growing method. This method consists of coarse classification, through which most of artifacts are removed; the automatic selection of appropriate seeds for individual trees, by which the common manual initial setting is avoided; a dual growing process that separates one tree from others by circumscribing a trunk in an adaptive growing radius and segmenting a crown in constrained growing regions; and a refining process that draws a singular trunk from the interlaced other objects. The method is verified by two datasets with over 98% completeness and over 96% correctness. The low mean absolute percentage errors in capturing the morphological parameters of individual trees indicate that this method can output individual trees with high precision.

A restricted Steiner tree problem is solved by Geometric Method II

NASA Astrophysics Data System (ADS)

Lin, Dazhi; Zhang, Youlin; Lu, Xiaoxu

2013-03-01

The minimum Steiner tree problem has wide application background, such as transportation system, communication network, pipeline design and VISL, etc. It is unfortunately that the computational complexity of the problem is NP-hard. People are common to find some special problems to consider. In this paper, we first put forward a restricted Steiner tree problem, which the fixed vertices are in the same side of one line L and we find a vertex on L such the length of the tree is minimal. By the definition and the complexity of the Steiner tree problem, we know that the complexity of this problem is also Np-complete. In the part one, we have considered there are two fixed vertices to find the restricted Steiner tree problem. Naturally, we consider there are three fixed vertices to find the restricted Steiner tree problem. And we also use the geometric method to solve such the problem.

Incorporating information on predicted solvent accessibility to the co-evolution-based study of protein interactions.

PubMed

Ochoa, David; García-Gutiérrez, Ponciano; Juan, David; Valencia, Alfonso; Pazos, Florencio

2013-01-27

A widespread family of methods for studying and predicting protein interactions using sequence information is based on co-evolution, quantified as similarity of phylogenetic trees. Part of the co-evolution observed between interacting proteins could be due to co-adaptation caused by inter-protein contacts. In this case, the co-evolution is expected to be more evident when evaluated on the surface of the proteins or the internal layers close to it. In this work we study the effect of incorporating information on predicted solvent accessibility to three methods for predicting protein interactions based on similarity of phylogenetic trees. We evaluate the performance of these methods in predicting different types of protein associations when trees based on positions with different characteristics of predicted accessibility are used as input. We found that predicted accessibility improves the results of two recent versions of the mirrortree methodology in predicting direct binary physical interactions, while it neither improves these methods, nor the original mirrortree method, in predicting other types of interactions. That improvement comes at no cost in terms of applicability since accessibility can be predicted for any sequence. We also found that predictions of protein-protein interactions are improved when multiple sequence alignments with a richer representation of sequences (including paralogs) are incorporated in the accessibility prediction.

A New Algorithm Using the Non-Dominated Tree to Improve Non-Dominated Sorting.

PubMed

Gustavsson, Patrik; Syberfeldt, Anna

2018-01-01

Non-dominated sorting is a technique often used in evolutionary algorithms to determine the quality of solutions in a population. The most common algorithm is the Fast Non-dominated Sort (FNS). This algorithm, however, has the drawback that its performance deteriorates when the population size grows. The same drawback applies also to other non-dominating sorting algorithms such as the Efficient Non-dominated Sort with Binary Strategy (ENS-BS). An algorithm suggested to overcome this drawback is the Divide-and-Conquer Non-dominated Sort (DCNS) which works well on a limited number of objectives but deteriorates when the number of objectives grows. This article presents a new, more efficient algorithm called the Efficient Non-dominated Sort with Non-Dominated Tree (ENS-NDT). ENS-NDT is an extension of the ENS-BS algorithm and uses a novel Non-Dominated Tree (NDTree) to speed up the non-dominated sorting. ENS-NDT is able to handle large population sizes and a large number of objectives more efficiently than existing algorithms for non-dominated sorting. In the article, it is shown that with ENS-NDT the runtime of multi-objective optimization algorithms such as the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) can be substantially reduced.

Quantifying loopy network architectures.

PubMed

Katifori, Eleni; Magnasco, Marcelo O

2012-01-01

Biology presents many examples of planar distribution and structural networks having dense sets of closed loops. An archetype of this form of network organization is the vasculature of dicotyledonous leaves, which showcases a hierarchically-nested architecture containing closed loops at many different levels. Although a number of approaches have been proposed to measure aspects of the structure of such networks, a robust metric to quantify their hierarchical organization is still lacking. We present an algorithmic framework, the hierarchical loop decomposition, that allows mapping loopy networks to binary trees, preserving in the connectivity of the trees the architecture of the original graph. We apply this framework to investigate computer generated graphs, such as artificial models and optimal distribution networks, as well as natural graphs extracted from digitized images of dicotyledonous leaves and vasculature of rat cerebral neocortex. We calculate various metrics based on the asymmetry, the cumulative size distribution and the Strahler bifurcation ratios of the corresponding trees and discuss the relationship of these quantities to the architectural organization of the original graphs. This algorithmic framework decouples the geometric information (exact location of edges and nodes) from the metric topology (connectivity and edge weight) and it ultimately allows us to perform a quantitative statistical comparison between predictions of theoretical models and naturally occurring loopy graphs.

Biomass of Four Hardwoods from Lower Piedmont Pine-Hardwood Stands in Alabama

Treesearch

Donald L. Sirois

1983-01-01

Biomass equations for complete tree, whole tree, and stemwood, with and without bark, both green and dry, are presented for four southern hardwoods - sweetgum (Liquidumbar styraciflua L.); hickory, both mockernut and pignut (Carya tomentosa (Poir.) Nutt. and C. glabra (Mill.) Sweet); red oak (Quercus...

Do remnant old-growth trees accelerate rates of succession in mature Douglas-fir forests?

Treesearch

William S. Keeton; Jerry F. Franklin

2005-01-01

Biological legacies left by natural disturbances provide ecological functions throughout forest stand development, but their influences on processes of ecological succession are not completely understood. We investigated the successional role of one type of biological legacy: remnant old-growth trees persisting in mature Pseudotsuga menziesii (...

Disease and spray coverage in pecan trees

USDA-ARS?s Scientific Manuscript database

Pecan scab (Fusicladium effusum G. Winter) is the major disease of pecan in the southeastern U.S., and severe epidemics on susceptible cultivars can result in complete yield loss. Anecdotal evidence indicates adequate scab control in the tops of tall trees in mature orchards is difficult, but no dat...

30 CFR 816.116 - Revegetation: Standards for success.

Code of Federal Regulations, 2014 CFR

2014-07-01

.... This final accounting may include volunteer trees and shrubs of approved species. Volunteer trees and shrubs of approved species shall be deemed equivalent to planted specimens two years of age or older and... for industrial, commercial, or residential use less than 2 years after regrading is completed, the...

30 CFR 817.116 - Revegetation: Standards for success.

Code of Federal Regulations, 2012 CFR

2012-07-01

.... This final accounting may include volunteer trees and shrubs of approved species. Volunteer trees and shrubs of approved species shall be deemed equivalent to planted specimens two years of age or older and... for industrial, commercial, or residential use less than 2 years after regrading is completed, the...

30 CFR 816.116 - Revegetation: Standards for success.

Code of Federal Regulations, 2013 CFR

2013-07-01

.... This final accounting may include volunteer trees and shrubs of approved species. Volunteer trees and shrubs of approved species shall be deemed equivalent to planted specimens two years of age or older and... for industrial, commercial, or residential use less than 2 years after regrading is completed, the...

30 CFR 817.116 - Revegetation: Standards for success.

Code of Federal Regulations, 2014 CFR

2014-07-01

.... This final accounting may include volunteer trees and shrubs of approved species. Volunteer trees and shrubs of approved species shall be deemed equivalent to planted specimens two years of age or older and... for industrial, commercial, or residential use less than 2 years after regrading is completed, the...

30 CFR 816.116 - Revegetation: Standards for success.

Code of Federal Regulations, 2012 CFR

2012-07-01

.... This final accounting may include volunteer trees and shrubs of approved species. Volunteer trees and shrubs of approved species shall be deemed equivalent to planted specimens two years of age or older and... for industrial, commercial, or residential use less than 2 years after regrading is completed, the...

30 CFR 817.116 - Revegetation: Standards for success.

Code of Federal Regulations, 2013 CFR

2013-07-01

.... This final accounting may include volunteer trees and shrubs of approved species. Volunteer trees and shrubs of approved species shall be deemed equivalent to planted specimens two years of age or older and... for industrial, commercial, or residential use less than 2 years after regrading is completed, the...

On the development and applications of automated searches for eclipsing binary stars

NASA Astrophysics Data System (ADS)

Devor, Jonathan

Eclipsing binary star systems provide the most accurate method of measuring both the masses and radii of stars. Moreover, they enable testing tidal synchronization and circularization theories, as well as constraining models of stellar structure and dynamics. With the recent availability of large-scale multi-epoch photometric datasets, we are able to study eclipsing binary stars en masse. In this thesis, we analyzed 185,445 light curves from ten TrES fields, and 218,699 light curves from the OGLE II bulge fields. In order to manage such large quantities of data, we developed a pipeline with which we systematically identified eclipsing binaries, solved for their geometric orientations, and then found their components' absolute properties. Following this analysis, we assembled catalogs of eclipsing binaries with their models, computed statistical distributions of their properties, and located rare cases for further follow-up. Of particular importance are low-mass eclipsing binaries, which are rare, yet critical for resolving the ongoing mass-radius discrepancy between theoretical models and observations. To this end, we have discovered over a dozen new low-mass eclipsing binary candidates, and spectroscopically confirmed the masses of five of them. One of these confirmed candidates, T-Lyr1-17236, is especially interesting because of its uniquely long orbital period. We examined T-Lyr1-17236 in detail and found that it is consistent with the magnetic disruption hypothesis for explaining the observed mass-radius discrepancy. Both the source code of our pipeline and the complete list of our candidates are freely available.

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.

Growing trees on completed sanitary landfills. [Nyssa sylvatica, Picea abies, Ginkgo biloba

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

Leone, I.A.; Gilman, E.F.; Flower, F.B.

1983-01-01

A 10-year old completed landfill in New Jersey consisting of 9 m (depth) of refuse covered with 15-25 cm of soil was cleared of debris and vegetation and covered with 30 cm of subsoil and 15-25 cm of topsoil. Nineteen coniferous and broadleaved species were planted on the landfill and on a control site in 1975, and trees were maintained and growth and condition monitored over 4 years. On the basis of shoot length and stem area increase, the most successful of the surviving trees were Nyssa sylvatica, Picea abies and Ginkgo biloba, in decreasing order of tolerance. Tolerance ofmore » landfill conditions appeared to be greatest in those species with low water requirements, a slow growth rate, high acid tolerance and a shallow root system. (Refs. 11).« less

A complete waveform model for compact binaries on eccentric orbits

NASA Astrophysics Data System (ADS)

George, Daniel; Huerta, Eliu; Kumar, Prayush; Agarwal, Bhanu; Schive, Hsi-Yu; Pfeiffer, Harald; Chu, Tony; Boyle, Michael; Hemberger, Daniel; Kidder, Lawrence; Scheel, Mark; Szilagyi, Bela

2017-01-01

We present a time domain waveform model that describes the inspiral, merger and ringdown of compact binary systems whose components are non-spinning, and which evolve on orbits with low to moderate eccentricity. We show that this inspiral-merger-ringdown waveform model reproduces the effective-one-body model for black hole binaries with mass-ratios between 1 to 15 in the zero eccentricity limit over a wide range of the parameter space under consideration. We use this model to show that the gravitational wave transients GW150914 and GW151226 can be effectively recovered with template banks of quasicircular, spin-aligned waveforms if the eccentricity e0 of these systems when they enter the aLIGO band at a gravitational wave frequency of 14 Hz satisfies e0GW 150914 <= 0 . 15 and e0GW 151226 <= 0 . 1 .

KCTF evolution of trans-neptunian binaries: Connecting formation to observation

NASA Astrophysics Data System (ADS)

Porter, Simon B.; Grundy, William M.

2012-08-01

Recent observational surveys of trans-neptunian binary (TNB) systems have dramatically increased the number of known mutual orbits. Our Kozai Cycle Tidal Friction (KCTF) simulations of synthetic trans-neptunian binaries show that tidal dissipation in these systems can completely reshape their original orbits. Specifically, solar torques should have dramatically accelerated the semimajor axis decay and circularization timescales of primordial (or recently excited) TNBs. As a result, our initially random distribution of TNBs in our simulations evolved to have a large population of tight circular orbits. This tight circular population appears for a range of TNO physical properties, though a strong gravitational quadrupole can prevent some from fully circularizing. We introduce a stability parameter to predict the effectiveness of KCTF on a TNB orbit, and show that a number of known TNBs must have a large gravitational quadrupole to be stable.

Riparian Vegetation, Natural Succession, and the Challenge of Maintaining Bare Sandbar Nesting Habitat for Least Terns and Piping Plovers

DTIC Science & Technology

2012-12-01

and eastern red cedar will become established through avian-dispersed seed. As soon as shrubs/ trees reach a height where they serve as perches for...effects of such disposal may be negligible compared to the annual load of allocthonous material provided to rivers by deciduous trees . If complete...Fowells, H.A. 1965. Silvics of forest trees of the United States. Agricultural Handbook No. 271. Washington , DC: U.S. Dept. Agriculture. Friedman

SWPhylo - A Novel Tool for Phylogenomic Inferences by Comparison of Oligonucleotide Patterns and Integration of Genome-Based and Gene-Based Phylogenetic Trees.

PubMed

Yu, Xiaoyu; Reva, Oleg N

2018-01-01

Modern phylogenetic studies may benefit from the analysis of complete genome sequences of various microorganisms. Evolutionary inferences based on genome-scale analysis are believed to be more accurate than the gene-based alternative. However, the computational complexity of current phylogenomic procedures, inappropriateness of standard phylogenetic tools to process genome-wide data, and lack of reliable substitution models which correlates with alignment-free phylogenomic approaches deter microbiologists from using these opportunities. For example, the super-matrix and super-tree approaches of phylogenomics use multiple integrated genomic loci or individual gene-based trees to infer an overall consensus tree. However, these approaches potentially multiply errors of gene annotation and sequence alignment not mentioning the computational complexity and laboriousness of the methods. In this article, we demonstrate that the annotation- and alignment-free comparison of genome-wide tetranucleotide frequencies, termed oligonucleotide usage patterns (OUPs), allowed a fast and reliable inference of phylogenetic trees. These were congruent to the corresponding whole genome super-matrix trees in terms of tree topology when compared with other known approaches including 16S ribosomal RNA and GyrA protein sequence comparison, complete genome-based MAUVE, and CVTree methods. A Web-based program to perform the alignment-free OUP-based phylogenomic inferences was implemented at http://swphylo.bi.up.ac.za/. Applicability of the tool was tested on different taxa from subspecies to intergeneric levels. Distinguishing between closely related taxonomic units may be enforced by providing the program with alignments of marker protein sequences, eg, GyrA.

Sensitivity of woody carbon stocks to bark investment strategy in Neotropical savannas and forests

NASA Astrophysics Data System (ADS)

Trugman, Anna T.; Medvigy, David; Hoffmann, William A.; Pellegrini, Adam F. A.

2018-01-01

Fire frequencies are changing in Neotropical savannas and forests as a result of forest fragmentation and increasing drought. Such changes in fire regime and climate are hypothesized to destabilize tropical carbon storage, but there has been little consideration of the widespread variability in tree fire tolerance strategies. To test how aboveground carbon stocks change with fire frequency and composition of plants with different fire tolerance strategies, we update the Ecosystem Demography model 2 (ED2) with (i) a fire survivorship module based on tree bark thickness (a key fire-tolerance trait across woody plants in savannas and forests), and (ii) plant functional types representative of trees in the region. With these updates, the model is better able to predict how fire frequency affects population demography and aboveground woody carbon. Simulations illustrate that the high survival rate of thick-barked, large trees reduces carbon losses with increasing fire frequency, with high investment in bark being particularly important in reducing losses in the wettest sites. Additionally, in landscapes that frequently burn, bark investment can broaden the range of climate and fire conditions under which savannas occur by reducing the range of conditions leading to either complete tree loss or complete grass loss. These results highlight that tropical vegetation dynamics depend not only on rainfall and changing fire frequencies but also on tree fire survival strategy. Further, our results indicate that fire survival strategy is fundamentally important in regulating tree size demography in ecosystems exposed to fire, which increases the preservation of aboveground carbon stocks and the coexistence of different plant functional groups.

SWPhylo – A Novel Tool for Phylogenomic Inferences by Comparison of Oligonucleotide Patterns and Integration of Genome-Based and Gene-Based Phylogenetic Trees

PubMed Central

Yu, Xiaoyu; Reva, Oleg N

2018-01-01

Modern phylogenetic studies may benefit from the analysis of complete genome sequences of various microorganisms. Evolutionary inferences based on genome-scale analysis are believed to be more accurate than the gene-based alternative. However, the computational complexity of current phylogenomic procedures, inappropriateness of standard phylogenetic tools to process genome-wide data, and lack of reliable substitution models which correlates with alignment-free phylogenomic approaches deter microbiologists from using these opportunities. For example, the super-matrix and super-tree approaches of phylogenomics use multiple integrated genomic loci or individual gene-based trees to infer an overall consensus tree. However, these approaches potentially multiply errors of gene annotation and sequence alignment not mentioning the computational complexity and laboriousness of the methods. In this article, we demonstrate that the annotation- and alignment-free comparison of genome-wide tetranucleotide frequencies, termed oligonucleotide usage patterns (OUPs), allowed a fast and reliable inference of phylogenetic trees. These were congruent to the corresponding whole genome super-matrix trees in terms of tree topology when compared with other known approaches including 16S ribosomal RNA and GyrA protein sequence comparison, complete genome-based MAUVE, and CVTree methods. A Web-based program to perform the alignment-free OUP-based phylogenomic inferences was implemented at http://swphylo.bi.up.ac.za/. Applicability of the tool was tested on different taxa from subspecies to intergeneric levels. Distinguishing between closely related taxonomic units may be enforced by providing the program with alignments of marker protein sequences, eg, GyrA. PMID:29511354

PLUTONIUM-CERIUM ALLOY

DOEpatents

Coffinberry, A.S.

1959-01-01

An alloy is presented for use as a reactor fuel. The binary alloy consists essentially of from about 5 to 90 atomic per cent cerium and the balance being plutonium. A complete phase diagram for the cerium--plutonium system is given.

Distributed Adaptive Binary Quantization for Fast Nearest Neighbor Search.

PubMed

Xianglong Liu; Zhujin Li; Cheng Deng; Dacheng Tao

2017-11-01

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

Thermodiffusion, molecular diffusion and Soret coefficient of binary and ternary mixtures of n-hexane, n-dodecane and toluene.

PubMed

Alonso de Mezquia, David; Wang, Zilin; Lapeira, Estela; Klein, Michael; Wiegand, Simone; Mounir Bou-Ali, M

2014-11-01

In this study, the thermodiffusion, molecular diffusion, and Soret coefficients of 12 binary mixtures composed of toluene, n-hexane and n-dodecane in the whole range of concentrations at atmospheric pressure and temperatures of 298.15 K and 308.15 K have been determined. The experimental measurements have been carried out using the Thermogravitational Column, the Sliding Symmetric Tubes and the Thermal Diffusion Forced Rayleigh Scattering techniques. The results obtained using the different techniques show a maximum deviation of 9% for the thermodiffusion coefficient, 8% for the molecular diffusion coefficient and 2% for the Soret coefficient. For the first time we report a decrease of the thermodiffusion coefficient with increasing ratio of the thermal expansion coefficient and viscosity for a binary mixture of an organic ring compound with a short n-alkane. This observation is discussed in terms of interactions between the different components. Additionally, the thermogravitational technique has been used to measure the thermodiffusion coefficients of four ternary mixtures consisting of toluene, n-hexane and n-dodecane at 298.15 K. In order to complete the study, the values obtained for the molecular diffusion coefficient in binary mixtures, and the thermodiffusion coefficient of binary and ternary mixtures have been compared with recently derived correlations.

Photometric Study of Fourteen Low-mass Binaries

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

Korda, D.; Zasche, P.; Wolf, M.

2017-07-01

New CCD photometric observations of fourteen short-period low-mass eclipsing binaries (LMBs) in the photometric filters I, R, and V were used for a light curve analysis. A discrepancy remains between observed radii and those derived from the theoretical modeling for LMBs, in general. Mass calibration of all observed LMBs was performed using only the photometric indices. The light curve modeling of these selected systems was completed, yielding the new derived masses and radii for both components. We compared these systems with the compilation of other known double-lined LMB systems with uncertainties of masses and radii less then 5%, which includesmore » 66 components of binaries where both spectroscopy and photometry were combined together. All of our systems are circular short-period binaries, and for some of them, the photospheric spots were also used. A purely photometric study of the light curves without spectroscopy seems unable to achieve high enough precision and accuracy in the masses and radii to act as meaningful test of the M–R relation for low-mass stars.« less

Dynamic mass exchange in doubly degenerate binaries. I - 0.9 and 1.2 solar mass stars

NASA Technical Reports Server (NTRS)

Benz, W.; Cameron, A. G. W.; Press, W. H.; Bowers, R. L.

1990-01-01

The dynamic mass exchange process in doubly degenerate binaries was investigated using a three-dimensional numerical simulation of the evolution of a doubly degenerate binary system in which the primary is a 1.2-solar-mass white dwarf and the Roche lobe filling secondary is a 0.9-solar-mass dwarf. The results show that, in a little more than two orbital periods, the secondary is completely destroyed and transformed into a thick disk orbiting about the primary. Since only a very small fraction of the mass (0.0063 solar mass) escapes the system, the evolution of the binary results in the formation of a massive object. This object is composed of three parts, the initial white dwarf primary, a very hot pressure-supported spherical envelope, and a rotationally supported outer disk. The evolution of the system can be understood in terms of a simple analytical model where it is shown that the angular momentum carried by the mass during the transfer and stored in the disk determines the evolution of the system.

Resistive switching memory devices composed of binary transition metal oxides using sol-gel chemistry.

PubMed

Lee, Chanwoo; Kim, Inpyo; Choi, Wonsup; Shin, Hyunjung; Cho, Jinhan

2009-04-21

We describe a novel and versatile approach for preparing resistive switching memory devices based on binary transition metal oxides (TMOs). Titanium isopropoxide (TIPP) was spin-coated onto platinum (Pt)-coated silicon substrates using a sol-gel process. The sol-gel-derived layer was converted into a TiO2 film by thermal annealing. A top electrode (Ag electrode) was then coated onto the TiO2 films to complete device fabrication. When an external bias was applied to the devices, a switching phenomenon independent of the voltage polarity (i.e., unipolar switching) was observed at low operating voltages (about 0.6 VRESET and 1.4 VSET). In addition, it was confirmed that the electrical properties (i.e., retention time, cycling test and switching speed) of the sol-gel-derived devices were comparable to those of vacuum deposited devices. This approach can be extended to a variety of binary TMOs such as niobium oxides. The reported approach offers new opportunities for preparing the binary TMO-based resistive switching memory devices allowing a facile solution processing.

Binary Black Holes, Gravitational Waves, and Numerical Relativity

NASA Technical Reports Server (NTRS)

Centrella, Joan

2007-01-01

Massive black hole (MBH) binaries are found at the centers of most galaxies. MBH mergers trace galaxy mergers and are strong sources of gravitational waves. Observing these sources with gravitational wave detectors requires that we know the radiation waveforms they emit. Since these mergers take place in regions of very strong gravitational fields, we need to solve Einstein's equations of general relativity on a computer in order to calculate these waveforms. For more than 30 years, scientists have tried to compute these waveforms using the methods of numerical relativity. The resulting computer codes have been plagued by instabilities. causing them to crash well before the black hole:, in the binary could complete even a single orbit. Recently this situation has changed dramatically, with a series of amazing breakthroughs. This presentation shows how a spacetime is constructed on a computer to build a simulation laboratory for binary black hole mergers. Focus is on the recent advances that that reveal these waveforms, and the potential for discoveries that arises when these sources are observed by LIGO and LISA.

THE ROLE OF TYLOSES IN CROWN HYDRAULIC FAILURE OF MATURE WALNUT TREES AFFLICTED WITH APOPLEXY DISORDER

USDA-ARS?s Scientific Manuscript database

In the Central Valley of California, mature walnut trees afflicted with apoplexy disorder exhibit rapid and complete canopy defoliation within a few weeks of symptom initiation. Symptoms are typically found throughout the entire canopy and are initially expressed as wilting and chlorosis followed b...

Oak Regeneration Using the Two-Age System

Treesearch

Jeffrey W. Stringer

2002-01-01

The two studies presented in this paper were completed in southeastern Kentucky and were designed to evaluate acorn production and development of advanced white oak reproduction from fully released white oak (Quercus alba) trees typical of reserve trees in the two age system. Twelve 2 acre 60- to 90-year-old white oak dominated stands were...

Meta-analysis of summer roosting characteristics of two species of Myotis bats

Treesearch

Michael Lacki; Daniel R. Cox; Matthew B. Dickinson

2009-01-01

We compared roost site characteristics of the Indiana bat (Myotis sodalis) and northern bat (M. septentrionalis), which form maternity colonies in cavities and beneath bark of dead (snags) and living trees in eastern North American forests. We used published data (n = 28 sources; n = 1145 roost trees) from studies completed where...

Insertional mutagenesis in Populus: relevance and feasibility

Treesearch

Victor Busov; Matthias Fladung; Andrew Groover; Steven Strauss

2005-01-01

The recent sequencing of the first tree genome, that of the black cottonwood (Populus trichocarpa), opens a new chapter in tree functional genomics. While the completion of the genome is a milestone, mobilizing this significant resource for better understanding the growth and development of woody perennials will be an even greater undertaking in the...

7 CFR 1410.22 - CRP conservation plan.

Code of Federal Regulations, 2011 CFR

2011-01-01

... may be waived by CCC. (b) The practices and management activities included in the CRP conservation.... (c) If applicable, a tree planting plan shall be developed and included in the CRP conservation plan. Such tree planting plan may allow up to 3 years to complete plantings if 10 or more acres of hardwood...

7 CFR 1410.22 - CRP conservation plan.

Code of Federal Regulations, 2013 CFR

2013-01-01

... may be waived by CCC. (b) The practices and management activities included in the CRP conservation.... (c) If applicable, a tree planting plan shall be developed and included in the CRP conservation plan. Such tree planting plan may allow up to 3 years to complete plantings if 10 or more acres of hardwood...

7 CFR 1410.22 - CRP conservation plan.

Code of Federal Regulations, 2012 CFR

2012-01-01

... may be waived by CCC. (b) The practices and management activities included in the CRP conservation.... (c) If applicable, a tree planting plan shall be developed and included in the CRP conservation plan. Such tree planting plan may allow up to 3 years to complete plantings if 10 or more acres of hardwood...

7 CFR 1410.22 - CRP conservation plan.

Code of Federal Regulations, 2014 CFR

2014-01-01

... may be waived by CCC. (b) The practices and management activities included in the CRP conservation.... (c) If applicable, a tree planting plan shall be developed and included in the CRP conservation plan. Such tree planting plan may allow up to 3 years to complete plantings if 10 or more acres of hardwood...

Fourier transform inequalities for phylogenetic trees.

PubMed

Matsen, Frederick A

2009-01-01

Phylogenetic invariants are not the only constraints on site-pattern frequency vectors for phylogenetic trees. A mutation matrix, by its definition, is the exponential of a matrix with non-negative off-diagonal entries; this positivity requirement implies non-trivial constraints on the site-pattern frequency vectors. We call these additional constraints "edge-parameter inequalities". In this paper, we first motivate the edge-parameter inequalities by considering a pathological site-pattern frequency vector corresponding to a quartet tree with a negative internal edge. This site-pattern frequency vector nevertheless satisfies all of the constraints described up to now in the literature. We next describe two complete sets of edge-parameter inequalities for the group-based models; these constraints are square-free monomial inequalities in the Fourier transformed coordinates. These inequalities, along with the phylogenetic invariants, form a complete description of the set of site-pattern frequency vectors corresponding to bona fide trees. Said in mathematical language, this paper explicitly presents two finite lists of inequalities in Fourier coordinates of the form "monomial < or = 1", each list characterizing the phylogenetically relevant semialgebraic subsets of the phylogenetic varieties.

From learning taxonomies to phylogenetic learning: integration of 16S rRNA gene data into FAME-based bacterial classification.

PubMed

Slabbinck, Bram; Waegeman, Willem; Dawyndt, Peter; De Vos, Paul; De Baets, Bernard

2010-01-30

Machine learning techniques have shown to improve bacterial species classification based on fatty acid methyl ester (FAME) data. Nonetheless, FAME analysis has a limited resolution for discrimination of bacteria at the species level. In this paper, we approach the species classification problem from a taxonomic point of view. Such a taxonomy or tree is typically obtained by applying clustering algorithms on FAME data or on 16S rRNA gene data. The knowledge gained from the tree can then be used to evaluate FAME-based classifiers, resulting in a novel framework for bacterial species classification. In view of learning in a taxonomic framework, we consider two types of trees. First, a FAME tree is constructed with a supervised divisive clustering algorithm. Subsequently, based on 16S rRNA gene sequence analysis, phylogenetic trees are inferred by the NJ and UPGMA methods. In this second approach, the species classification problem is based on the combination of two different types of data. Herein, 16S rRNA gene sequence data is used for phylogenetic tree inference and the corresponding binary tree splits are learned based on FAME data. We call this learning approach 'phylogenetic learning'. Supervised Random Forest models are developed to train the classification tasks in a stratified cross-validation setting. In this way, better classification results are obtained for species that are typically hard to distinguish by a single or flat multi-class classification model. FAME-based bacterial species classification is successfully evaluated in a taxonomic framework. Although the proposed approach does not improve the overall accuracy compared to flat multi-class classification, it has some distinct advantages. First, it has better capabilities for distinguishing species on which flat multi-class classification fails. Secondly, the hierarchical classification structure allows to easily evaluate and visualize the resolution of FAME data for the discrimination of bacterial species. Summarized, by phylogenetic learning we are able to situate and evaluate FAME-based bacterial species classification in a more informative context.

HEXT, a software supporting tree-based screens for hybrid taxa in multilocus data sets, and an evaluation of the homoplasy excess test.

PubMed

Schneider, Kevin; Koblmüller, Stephan; Sefc, Kristina M

2015-11-11

The homoplasy excess test (HET) is a tree-based screen for hybrid taxa in multilocus nuclear phylogenies. Homoplasy between a hybrid taxon and the clades containing the parental taxa reduces bootstrap support in the tree. The HET is based on the expectation that excluding the hybrid taxon from the data set increases the bootstrap support for the parental clades, whereas excluding non-hybrid taxa has little effect on statistical node support. To carry out a HET, bootstrap trees are calculated with taxon-jackknife data sets, that is excluding one taxon (species, population) at a time. Excess increase in bootstrap support for certain nodes upon exclusion of a particular taxon indicates the hybrid (the excluded taxon) and its parents (the clades with increased support).We introduce a new software program, hext, which generates the taxon-jackknife data sets, runs the bootstrap tree calculations, and identifies excess bootstrap increases as outlier values in boxplot graphs. hext is written in r language and accepts binary data (0/1; e.g. AFLP) as well as co-dominant SNP and genotype data.We demonstrate the usefulness of hext in large SNP data sets containing putative hybrids and their parents. For instance, using published data of the genus Vitis (~6,000 SNP loci), hext output supports V. × champinii as a hybrid between V. rupestris and V. mustangensis .With simulated SNP and AFLP data sets, excess increases in bootstrap support were not always connected with the hybrid taxon (false positives), whereas the expected bootstrap signal failed to appear on several occasions (false negatives). Potential causes for both types of spurious results are discussed.With both empirical and simulated data sets, the taxon-jackknife output generated by hext provided additional signatures of hybrid taxa, including changes in tree topology across trees, consistent effects of exclusions of the hybrid and the parent taxa, and moderate (rather than excessive) increases in bootstrap support. hext significantly facilitates the taxon-jackknife approach to hybrid taxon detection, even though the simple test for excess bootstrap increase may not reliably identify hybrid taxa in all applications.

From learning taxonomies to phylogenetic learning: Integration of 16S rRNA gene data into FAME-based bacterial classification

PubMed Central

2010-01-01

Background Machine learning techniques have shown to improve bacterial species classification based on fatty acid methyl ester (FAME) data. Nonetheless, FAME analysis has a limited resolution for discrimination of bacteria at the species level. In this paper, we approach the species classification problem from a taxonomic point of view. Such a taxonomy or tree is typically obtained by applying clustering algorithms on FAME data or on 16S rRNA gene data. The knowledge gained from the tree can then be used to evaluate FAME-based classifiers, resulting in a novel framework for bacterial species classification. Results In view of learning in a taxonomic framework, we consider two types of trees. First, a FAME tree is constructed with a supervised divisive clustering algorithm. Subsequently, based on 16S rRNA gene sequence analysis, phylogenetic trees are inferred by the NJ and UPGMA methods. In this second approach, the species classification problem is based on the combination of two different types of data. Herein, 16S rRNA gene sequence data is used for phylogenetic tree inference and the corresponding binary tree splits are learned based on FAME data. We call this learning approach 'phylogenetic learning'. Supervised Random Forest models are developed to train the classification tasks in a stratified cross-validation setting. In this way, better classification results are obtained for species that are typically hard to distinguish by a single or flat multi-class classification model. Conclusions FAME-based bacterial species classification is successfully evaluated in a taxonomic framework. Although the proposed approach does not improve the overall accuracy compared to flat multi-class classification, it has some distinct advantages. First, it has better capabilities for distinguishing species on which flat multi-class classification fails. Secondly, the hierarchical classification structure allows to easily evaluate and visualize the resolution of FAME data for the discrimination of bacterial species. Summarized, by phylogenetic learning we are able to situate and evaluate FAME-based bacterial species classification in a more informative context. PMID:20113515

Spatial and temporal analyses of citrus sudden death as a tool to generate hypotheses concerning its etiology.

PubMed

Bassanezi, Renato B; Bergamin Filho, Armando; Amorim, Lilian; Gimenes-Fernandes, Nelson; Gottwald, Tim R; Bové, Joseph M

2003-04-01

ABSTRACT Citrus sudden death (CSD), a new disease of unknown etiology that affects sweet orange grafted on Rangpur lime, was visually monitored for 14 months in 41 groves in Brazil. Ordinary runs analysis of CSD-symptomatic trees indicated a departure from randomness of symptomatic trees status among immediately adjacent trees mainly within rows. The binomial index of dispersion (D) and the intraclass correlation (k) for various quadrat sizes suggested aggregation of CSD-symptomatic trees for almost all plots within the quadrat sizes tested. Estimated parameters of the binary form of Taylor's power law provided an overall measure of aggregation of CSD-symptomatic trees for all quadrat sizes tested. Aggregation in each plot was dependent on disease incidence. Spatial autocorrelation analysis of proximity patterns suggested that aggregation often existed among quadrats of various sizes up to three lag distances; however, significant lag positions discontinuous from main proximity patterns were rare, indicating a lack of spatial association among discrete foci. Some asymmetry was also detected for some spatial autocorrelation proximity patterns, indicating that within-row versus across-row distributions are not necessarily equivalent. These results were interpreted to mean that the cause of the disease was most likely biotic and its dissemination was common within a local area of influence that extended to approximately six trees in all directions, including adjacent trees. Where asymmetry was indicated, this area of influence was somewhat elliptical. Longer-distance patterns were not detected within the confines of the plot sizes tested. Annual rates of CSD progress based on the Gompertz model ranged from 0.37 to 2.02. Numerous similarities were found between the spatial patterns of CSD and Citrus tristeza virus (CTV) described in the literature, both in the presence of the aphid vector, Toxoptera citricida. CSD differs from CTV in that symptoms occur in sweet orange grafted on Rangpur lime. Based on the symptoms of CSD and on its spatial and temporal patterns, our hypothesis is that CSD may be caused by a similar but undescribed pathogen such as a virus and probably vectored by insects such as aphids by similar spatial processes to those affecting CTV.

Protection of individual ash trees from emerald ash borer (Coleoptera: Buprestidae) with basal soil applications of imidacloprid.

PubMed

Smitley, D R; Rebek, E J; Royalty, R N; Davis, T W; Newhouse, K F

2010-02-01

We conducted field trials at five different locations over a period of 6 yr to investigate the efficacy of imidacloprid applied each spring as a basal soil drench for protection against emerald ash borer, Agrilus planipennis Fairmaire (Coleoptera: Buprestidae). Canopy thinning and emerald ash borer larval density were used to evaluate efficacy for 3-4 yr at each location while treatments continued. Test sites included small urban trees (5-15 cm diameter at breast height [dbh]), medium to large (15-65 cm dbh) trees at golf courses, and medium to large street trees. Annual basal drenches with imidacloprid gave complete protection of small ash trees for three years. At three sites where the size of trees ranged from 23 to 37 cm dbh, we successfully protected all ash trees beginning the test with <60% canopy thinning. Regression analysis of data from two sites reveals that tree size explains 46% of the variation in efficacy of imidacloprid drenches. The smallest trees (<30 cm dbh) remained in excellent condition for 3 yr, whereas most of the largest trees (>38 cm dbh) declined to a weakened state and undesirable appearance. The five-fold increase in trunk and branch surface area of ash trees as the tree dbh doubles may account for reduced efficacy on larger trees, and suggests a need to increase treatment rates for larger trees.

Automatic localization of bifurcations and vessel crossings in digital fundus photographs using location regression

NASA Astrophysics Data System (ADS)

Niemeijer, Meindert; Dumitrescu, Alina V.; van Ginneken, Bram; Abrámoff, Michael D.

2011-03-01

Parameters extracted from the vasculature on the retina are correlated with various conditions such as diabetic retinopathy and cardiovascular diseases such as stroke. Segmentation of the vasculature on the retina has been a topic that has received much attention in the literature over the past decade. Analysis of the segmentation result, however, has only received limited attention with most works describing methods to accurately measure the width of the vessels. Analyzing the connectedness of the vascular network is an important step towards the characterization of the complete vascular tree. The retinal vascular tree, from an image interpretation point of view, originates at the optic disc and spreads out over the retina. The tree bifurcates and the vessels also cross each other. The points where this happens form the key to determining the connectedness of the complete tree. We present a supervised method to detect the bifurcations and crossing points of the vasculature of the retina. The method uses features extracted from the vasculature as well as the image in a location regression approach to find those locations of the segmented vascular tree where the bifurcation or crossing occurs (from here, POI, points of interest). We evaluate the method on the publicly available DRIVE database in which an ophthalmologist has marked the POI.

Gene trees, species trees, and morphology converge on a similar phylogeny of living gars (Actinopterygii: Holostei: Lepisosteidae), an ancient clade of ray-finned fishes.

PubMed

Wright, Jeremy J; David, Solomon R; Near, Thomas J

2012-06-01

Extant gars represent the remaining members of a formerly diverse assemblage of ancient ray-finned fishes and have been the subject of multiple phylogenetic analyses using morphological data. Here, we present the first hypothesis of phylogenetic relationships among living gar species based on molecular data, through the examination of gene tree heterogeneity and coalescent species tree analyses of a portion of one mitochondrial (COI) and seven nuclear (ENC1, myh6, plagl2, S7 ribosomal protein intron 1, sreb2, tbr1, and zic1) genes. Individual gene trees displayed varying degrees of resolution with regards to species-level relationships, and the gene trees inferred from COI and the S7 intron were the only two that were completely resolved. Coalescent species tree analyses of nuclear genes resulted in a well-resolved and strongly supported phylogenetic tree of living gar species, for which Bayesian posterior node support was further improved by the inclusion of the mitochondrial gene. Species-level relationships among gars inferred from our molecular data set were highly congruent with previously published morphological phylogenies, with the exception of the placement of two species, Lepisosteus osseus and L. platostomus. Re-examination of the character coding used by previous authors provided partial resolution of this topological discordance, resulting in broad concordance in the phylogenies inferred from individual genes, the coalescent species tree analysis, and morphology. The completely resolved phylogeny inferred from the molecular data set with strong Bayesian posterior support at all nodes provided insights into the potential for introgressive hybridization and patterns of allopatric speciation in the evolutionary history of living gars, as well as a solid foundation for future examinations of functional diversification and evolutionary stasis in a "living fossil" lineage. Copyright © 2012 Elsevier Inc. All rights reserved.

[A review of the genomic and gene cloning studies in trees].

PubMed

Yin, Tong-Ming

2010-07-01

Supported by the Department of Energy (DOE) of U.S., the first tree genome, black cottonwood (Populus trichocarpa), has been completely sequenced and publicly release. This is the milestone that indicates the beginning of post-genome era for forest trees. Identification and cloning genes underlying important traits are one of the main tasks for the post-genome-era tree genomic studies. Recently, great achievements have been made in cloning genes coordinating important domestication traits in some crops, such as rice, tomato, maize and so on. Molecular breeding has been applied in the practical breeding programs for many crops. By contrast, molecular studies in trees are lagging behind. Trees possess some characteristics that make them as difficult organisms for studying on locating and cloning of genes. With the advances in techniques, given also the fast growth of tree genomic resources, great achievements are desirable in cloning unknown genes from trees, which will facilitate tree improvement programs by means of molecular breeding. In this paper, the author reviewed the progress in tree genomic and gene cloning studies, and prospected the future achievements in order to provide a useful reference for researchers working in this area.

PhyloTreePruner: A Phylogenetic Tree-Based Approach for Selection of Orthologous Sequences for Phylogenomics.

PubMed

Kocot, Kevin M; Citarella, Mathew R; Moroz, Leonid L; Halanych, Kenneth M

2013-01-01

Molecular phylogenetics relies on accurate identification of orthologous sequences among the taxa of interest. Most orthology inference programs available for use in phylogenomics rely on small sets of pre-defined orthologs from model organisms or phenetic approaches such as all-versus-all sequence comparisons followed by Markov graph-based clustering. Such approaches have high sensitivity but may erroneously include paralogous sequences. We developed PhyloTreePruner, a software utility that uses a phylogenetic approach to refine orthology inferences made using phenetic methods. PhyloTreePruner checks single-gene trees for evidence of paralogy and generates a new alignment for each group containing only sequences inferred to be orthologs. Importantly, PhyloTreePruner takes into account support values on the tree and avoids unnecessarily deleting sequences in cases where a weakly supported tree topology incorrectly indicates paralogy. A test of PhyloTreePruner on a dataset generated from 11 completely sequenced arthropod genomes identified 2,027 orthologous groups sampled for all taxa. Phylogenetic analysis of the concatenated supermatrix yielded a generally well-supported topology that was consistent with the current understanding of arthropod phylogeny. PhyloTreePruner is freely available from http://sourceforge.net/projects/phylotreepruner/.

Missing binary data extraction challenges from Cochrane reviews in mental health and Campbell reviews with implications for empirical research.

PubMed

Spineli, Loukia M

2017-12-01

Tο report challenges encountered during the extraction process from Cochrane reviews in mental health and Campbell reviews and to indicate their implications on the empirical performance of different methods to handle missingness. We used a collection of meta-analyses on binary outcomes collated from a previous work on missing outcome data. To evaluate the accuracy of their extraction, we developed specific criteria pertaining to the reporting of missing outcome data in systematic reviews. Using the most popular methods to handle missing binary outcome data, we investigated the implications of the accuracy of the extracted meta-analysis on the random-effects meta-analysis results. Of 113 meta-analyses from Cochrane reviews, 60 (53%) were judged as "unclearly" extracted (ie, no information on the outcome of completers but available information on how missing participants were handled) and 42 (37%) as "unacceptably" extracted (ie, no information on the outcome of completers as well as no information on how missing participants were handled). For the remaining meta-analyses, it was judged that data were "acceptably" extracted (ie, information on the completers' outcome was provided for all trials). Overall, "unclear" extraction overestimated the magnitude of the summary odds ratio and the between-study variance and additionally inflated the uncertainty of both meta-analytical parameters. The only eligible Campbell review was judged as "unclear." Depending on the extent of missingness, the reporting quality of the systematic reviews can greatly affect the accuracy of the extracted meta-analyses and by extent, the empirical performance of different methods to handle missingness. Copyright © 2017 John Wiley & Sons, Ltd.

Gravitational-wave astronomy: delivering on the promises.

PubMed

Schutz, B F

2018-05-28

Now that LIGO and Virgo have begun to detect gravitational-wave events with regularity, the field of gravitational-wave astronomy is beginning to realize its promise. Binary black holes and, very recently, binary neutron stars have been observed, and we are already learning much from them. The future, with improved sensitivity, more detectors and detectors like LISA in different frequency bands, has even more promise to open a completely hidden side of the Universe to our exploration.This article is part of a discussion meeting issue 'The promises of gravitational-wave astronomy'. © 2018 The Author(s).

Progressive video coding for noisy channels

NASA Astrophysics Data System (ADS)

Kim, Beong-Jo; Xiong, Zixiang; Pearlman, William A.

1998-10-01

We extend the work of Sherwood and Zeger to progressive video coding for noisy channels. By utilizing a 3D extension of the set partitioning in hierarchical trees (SPIHT) algorithm, we cascade the resulting 3D SPIHT video coder with a rate-compatible punctured convolutional channel coder for transmission of video over a binary symmetric channel. Progressive coding is achieved by increasing the target rate of the 3D embedded SPIHT video coder as the channel condition improves. The performance of our proposed coding system is acceptable at low transmission rate and bad channel conditions. Its low complexity makes it suitable for emerging applications such as video over wireless channels.

Path Planning Method in Multi-obstacle Marine Environment

NASA Astrophysics Data System (ADS)

Zhang, Jinpeng; Sun, Hanxv

2017-12-01

In this paper, an improved algorithm for particle swarm optimization is proposed for the application of underwater robot in the complex marine environment. Not only did consider to avoid obstacles when path planning, but also considered the current direction and the size effect on the performance of the robot dynamics. The algorithm uses the trunk binary tree structure to construct the path search space and A * heuristic search method is used in the search space to find a evaluation standard path. Then the particle swarm algorithm to optimize the path by adjusting evaluation function, which makes the underwater robot in the current navigation easier to control, and consume less energy.

Sequence-invariant state machines

NASA Technical Reports Server (NTRS)

Whitaker, Sterling R.; Manjunath, Shamanna K.; Maki, Gary K.

1991-01-01

A synthesis method and an MOS VLSI architecture are presented to realize sequential circuits that have the ability to implement any state machine having N states and m inputs, regardless of the actual sequence specified in the flow table. The design method utilizes binary tree structured (BTS) logic to implement regular and dense circuits. The desired state sequence can be hardwired with power supply connections or can be dynamically reallocated if stored in a register. This allows programmable VLSI controllers to be designed with a compact size and performance approaching that of dedicated logic. Results of ICV implementations are reported and an example sequence-invariant state machine is contrasted with implementations based on traditional methods.

Tropical geometry of statistical models.

PubMed

Pachter, Lior; Sturmfels, Bernd

2004-11-16

This article presents a unified mathematical framework for inference in graphical models, building on the observation that graphical models are algebraic varieties. From this geometric viewpoint, observations generated from a model are coordinates of a point in the variety, and the sum-product algorithm is an efficient tool for evaluating specific coordinates. Here, we address the question of how the solutions to various inference problems depend on the model parameters. The proposed answer is expressed in terms of tropical algebraic geometry. The Newton polytope of a statistical model plays a key role. Our results are applied to the hidden Markov model and the general Markov model on a binary tree.

Cascaded Mach-Zehnder wavelength filters in silicon photonics for low loss and flat pass-band WDM (de-)multiplexing.

PubMed

Horst, Folkert; Green, William M J; Assefa, Solomon; Shank, Steven M; Vlasov, Yurii A; Offrein, Bert Jan

2013-05-20

We present 1-to-8 wavelength (de-)multiplexer devices based on a binary tree of cascaded Mach-Zehnder-like lattice filters, and manufactured using a 90 nm CMOS-integrated silicon photonics technology. We demonstrate that these devices combine a flat pass-band over more than 50% of the channel spacing with low insertion loss of less than 1.6 dB, and have a small device size of approximately 500 × 400 µm. This makes this type of filters well suited for application as WDM (de-)multiplexer in silicon photonics transceivers for optical data communication in large scale computer systems.

A partitioning strategy for nonuniform problems on multiprocessors

NASA Technical Reports Server (NTRS)

Berger, M. J.; Bokhari, S.

1985-01-01

The partitioning of a problem on a domain with unequal work estimates in different subddomains is considered in a way that balances the work load across multiple processors. Such a problem arises for example in solving partial differential equations using an adaptive method that places extra grid points in certain subregions of the domain. A binary decomposition of the domain is used to partition it into rectangles requiring equal computational effort. The communication costs of mapping this partitioning onto different microprocessors: a mesh-connected array, a tree machine and a hypercube is then studied. The communication cost expressions can be used to determine the optimal depth of the above partitioning.

Bootstrapping on Undirected Binary Networks Via Statistical Mechanics

NASA Astrophysics Data System (ADS)

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 fine description of its geometric structure. We demonstrate the performance of this method on simulated as well as real data networks.

Classification and regression tree (CART) analysis of endometrial carcinoma: Seeing the forest for the trees.

PubMed

Barlin, Joyce N; Zhou, Qin; St Clair, Caryn M; Iasonos, Alexia; Soslow, Robert A; Alektiar, Kaled M; Hensley, Martee L; Leitao, Mario M; Barakat, Richard R; Abu-Rustum, Nadeem R

2013-09-01

The objectives of the study are to evaluate which clinicopathologic factors influenced overall survival (OS) in endometrial carcinoma and to determine if the surgical effort to assess para-aortic (PA) lymph nodes (LNs) at initial staging surgery impacts OS. All patients diagnosed with endometrial cancer from 1/1993-12/2011 who had LNs excised were included. PALN assessment was defined by the identification of one or more PALNs on final pathology. A multivariate analysis was performed to assess the effect of PALNs on OS. A form of recursive partitioning called classification and regression tree (CART) analysis was implemented. Variables included: age, stage, tumor subtype, grade, myometrial invasion, total LNs removed, evaluation of PALNs, and adjuvant chemotherapy. The cohort included 1920 patients, with a median age of 62 years. The median number of LNs removed was 16 (range, 1-99). The removal of PALNs was not associated with OS (P=0.450). Using the CART hierarchically, stage I vs. stages II-IV and grades 1-2 vs. grade 3 emerged as predictors of OS. If the tree was allowed to grow, further branching was based on age and myometrial invasion. Total number of LNs removed and assessment of PALNs as defined in this study were not predictive of OS. This innovative CART analysis emphasized the importance of proper stage assignment and a binary grading system in impacting OS. Notably, the total number of LNs removed and specific evaluation of PALNs as defined in this study were not important predictors of OS. Copyright © 2013 Elsevier Inc. All rights reserved.

Application of 2D graphic representation of protein sequence based on Huffman tree method.

PubMed

Qi, Zhao-Hui; Feng, Jun; Qi, Xiao-Qin; Li, Ling

2012-05-01

Based on Huffman tree method, we propose a new 2D graphic representation of protein sequence. This representation can completely avoid loss of information in the transfer of data from a protein sequence to its graphic representation. The method consists of two parts. One is about the 0-1 codes of 20 amino acids by Huffman tree with amino acid frequency. The amino acid frequency is defined as the statistical number of an amino acid in the analyzed protein sequences. The other is about the 2D graphic representation of protein sequence based on the 0-1 codes. Then the applications of the method on ten ND5 genes and seven Escherichia coli strains are presented in detail. The results show that the proposed model may provide us with some new sights to understand the evolution patterns determined from protein sequences and complete genomes. Copyright © 2012 Elsevier Ltd. All rights reserved.

High temperature plasma in beta Lyrae, observed from Copernicus

NASA Technical Reports Server (NTRS)

Kondo, Y.; Hack, M.; Hutchings, J. B.; Mccluskey, G. E., Jr.; Plavec, M.; Polidan, R. S.

1975-01-01

High-resolution UV spectrophotometry of the complex close binary system beta Lyrae was performed with a telescope spectrometer on board Copernicus. Observations were made at phases 0.0, 0.25, 0.5, and 0.75 with resolutions of 0.2 A (far-UV) and 0.4 A (mid-UV). The far-UV spectrum is completely dominated by emission lines indicating the existence of a high-temperature plasma in this binary. The spectrum of this object is unlike that of any other object observed from Copernicus. It is believed that this high-temperature plasma results from dynamic mass transfer taking place in the binary. The current results are compared with OAO-2 observations and other observational results. The possibility that the secondary component is a collapsed object is also discussed; the Copernicus observations are consistent with the hypothesis that the spectroscopically invisible secondary component is a black hole.

Observational constraints on the inter-binary stellar flare hypothesis for the gamma-ray bursts

NASA Astrophysics Data System (ADS)

Rao, A. R.; Vahia, M. N.

1994-01-01

The Gamma Ray Observatory/Burst and Transient Source Experiment (GRO/BATSE) results on the Gamma Ray Bursts (GRBs) have given an internally consistent set of observations of about 260 GRBs which have been released for analysis by the BATSE team. Using this database we investigate our earlier suggestion (Vahia and Rao, 1988) that GRBs are inter-binary stellar flares from a group of objects classified as Magnetically Active Stellar Systems (MASS) which includes flare stars, RS CVn binaries and cataclysmic variables. We show that there exists an observationally consistent parameter space for the number density, scale height and flare luminosity of MASS which explains the complete log(N) - log(P) distribution of GRBs as also the observed isotropic distribution. We further use this model to predict anisotropy in the GRB distribution at intermediate luminosities. We make definite predictions under the stellar flare hypothesis that can be tested in the near future.

Multi-band photometric study of the short-period eclipsing binary GR Boo

NASA Astrophysics Data System (ADS)

Wang, Daimei; Zhang, Liyun; Han, Xianming L.; Lu, Hongpeng

2017-05-01

We present BVRI light curves with complete phase coverage for the short-period (p = 0.377day) eclipsing binary star GR Boo. We carried out the observations using the SARA 90 cm telescope located at Kitt Peak National Observatory. We obtained six new light curve minimum times. By fitting all of the available O-C minimum times, we obtained an updated ephemeris that shows the orbital period of GR Boo is decreasing at a rate of P˙ = - 2.36 ×10-7 days/year. This decrease in its period can be explained by either mass transfer from the more massive component to the less massive one, or angular momentum exchange due to magnetic activities. We also obtained a set of revised orbital parameters using the Wilson & Devinney program. And finally, we concluded that GR Boo is a contact binary with a dark spot.

Sparse dynamical Boltzmann machine for reconstructing complex networks with binary dynamics

NASA Astrophysics Data System (ADS)

Chen, Yu-Zhong; Lai, Ying-Cheng

2018-03-01

Revealing the structure and dynamics of complex networked systems from observed data is a problem of current interest. Is it possible to develop a completely data-driven framework to decipher the network structure and different types of dynamical processes on complex networks? We develop a model named sparse dynamical Boltzmann machine (SDBM) as a structural estimator for complex networks that host binary dynamical processes. The SDBM attains its topology according to that of the original system and is capable of simulating the original binary dynamical process. We develop a fully automated method based on compressive sensing and a clustering algorithm to construct the SDBM. We demonstrate, for a variety of representative dynamical processes on model and real world complex networks, that the equivalent SDBM can recover the network structure of the original system and simulates its dynamical behavior with high precision.

Comparison between numerical-relativity and post-Newtonian waveforms from spinning binaries: The orbital hang-up case

NASA Astrophysics Data System (ADS)

Hannam, Mark; Husa, Sascha; Brügmann, Bernd; Gopakumar, Achamveedu

2008-11-01

We compare results from numerical simulations of spinning binaries in the “orbital hang-up” case, where the binary completes at least nine orbits before merger, with post-Newtonian results using the approximants Taylor T1, T4, and Et. We find that, over the ten cycles before the gravitational-wave frequency reaches Mω=0.1, the accumulated phase disagreement between numerical relativity (NR) and 2.5 post-Newtonian (PN) results is less than three radians, and is less than 2.5 radians when using 3.5PN results. The amplitude disagreement between NR and restricted PN results increases with the black holes’ spin, from about 6% in the equal-mass case to 12% when the black holes’ spins are Si/Mi2=0.85. Finally, our results suggest that the merger waveform will play an important role in estimating the spin from such inspiral waveforms.

A note about high blood pressure in childhood

NASA Astrophysics Data System (ADS)

Teodoro, M. Filomena; Simão, Carla

2017-06-01

In medical, behavioral and social sciences it is usual to get a binary outcome. In the present work is collected information where some of the outcomes are binary variables (1='yes'/ 0='no'). In [14] a preliminary study about the caregivers perception of pediatric hypertension was introduced. An experimental questionnaire was designed to be answered by the caregivers of routine pediatric consultation attendees in the Santa Maria's hospital (HSM). The collected data was statistically analyzed, where a descriptive analysis and a predictive model were performed. Significant relations between some socio-demographic variables and the assessed knowledge were obtained. In [14] can be found a statistical data analysis using partial questionnaire's information. The present article completes the statistical approach estimating a model for relevant remaining questions of questionnaire by Generalized Linear Models (GLM). Exploring the binary outcome issue, we intend to extend this approach using Generalized Linear Mixed Models (GLMM), but the process is still ongoing.

Sparse dynamical Boltzmann machine for reconstructing complex networks with binary dynamics.

PubMed

Chen, Yu-Zhong; Lai, Ying-Cheng

2018-03-01

Revealing the structure and dynamics of complex networked systems from observed data is a problem of current interest. Is it possible to develop a completely data-driven framework to decipher the network structure and different types of dynamical processes on complex networks? We develop a model named sparse dynamical Boltzmann machine (SDBM) as a structural estimator for complex networks that host binary dynamical processes. The SDBM attains its topology according to that of the original system and is capable of simulating the original binary dynamical process. We develop a fully automated method based on compressive sensing and a clustering algorithm to construct the SDBM. We demonstrate, for a variety of representative dynamical processes on model and real world complex networks, that the equivalent SDBM can recover the network structure of the original system and simulates its dynamical behavior with high precision.

Quasi-Periodic Oscillations in AM Herculis Binaries -- Cycle 3 Medium

NASA Astrophysics Data System (ADS)

Chanmugam, G.

1992-06-01

AM Her variables are close-binary systems in which a white dwarf with a magnetic field of 20-70 MG accretes matter from a companion star. Theoretical studies of magnetically channeled accretion flows in such systems predict that the shock formed near the white dwarf should oscillate with periods of order 0.1-1 sec. Optical high-speed photometry has indeed shown the existence of such rapid, quasi-periodic oscillations in some AM Her binaries, but not in others. We will use HST to obtain UV and optical high-speed photometry of several AM Her systems, in order to explore further the nature of the oscillations, and to extend the search into the UV. This proposal is a followup to an accepted Cycle 2 program. We are proposing it for Cycle 3 in order to complete our survey of the most suitable AM Her systems during this last opportunity for HSP observations.

Mergers of Black-Hole Binaries with Aligned Spins: Waveform Characteristics

NASA Technical Reports Server (NTRS)

Kelly, Bernard J.; Baker, John G.; vanMeter, James R.; Boggs, William D.; McWilliams, Sean T.; Centrella, Joan

2011-01-01

"We apply our gravitational-waveform analysis techniques, first presented in the context of nonspinning black holes of varying mass ratio [1], to the complementary case of equal-mass spinning black-hole binary systems. We find that, as with the nonspinning mergers, the dominant waveform modes phases evolve together in lock-step through inspiral and merger, supporting the previous model of the binary system as an adiabatically rigid rotator driving gravitational-wave emission - an implicit rotating source (IRS). We further apply the late-merger model for the rotational frequency introduced in [1], along with a new mode amplitude model appropriate for the dominant (2, plus or minus 2) modes. We demonstrate that this seven-parameter model performs well in matches with the original numerical waveform for system masses above - 150 solar mass, both when the parameters are freely fit, and when they are almost completely constrained by physical considerations."

Interactive tree of life (iTOL) v3: an online tool for the display and annotation of phylogenetic and other trees.

PubMed

Letunic, Ivica; Bork, Peer

2016-07-08

Interactive Tree Of Life (http://itol.embl.de) is a web-based tool for the display, manipulation and annotation of phylogenetic trees. It is freely available and open to everyone. The current version was completely redesigned and rewritten, utilizing current web technologies for speedy and streamlined processing. Numerous new features were introduced and several new data types are now supported. Trees with up to 100,000 leaves can now be efficiently displayed. Full interactive control over precise positioning of various annotation features and an unlimited number of datasets allow the easy creation of complex tree visualizations. iTOL 3 is the first tool which supports direct visualization of the recently proposed phylogenetic placements format. Finally, iTOL's account system has been redesigned to simplify the management of trees in user-defined workspaces and projects, as it is heavily used and currently handles already more than 500,000 trees from more than 10,000 individual users. © The Author(s) 2016. Published by Oxford University Press on behalf of Nucleic Acids Research.

Fostering 21st-Century Evolutionary Reasoning: Teaching Tree Thinking to Introductory Biology Students

PubMed Central

Novick, Laura R.; Catley, Kefyn M.

2016-01-01

The ability to interpret and reason from Tree of Life (ToL) diagrams has become a vital component of science literacy in the 21st century. This article reports on the effectiveness of a research-based curriculum, including an instructional booklet, laboratory, and lectures, to teach the fundamentals of such tree thinking in an introductory biology class for science majors. We present the results of a study involving 117 undergraduates who received either our new research-based tree-thinking curriculum or business-as-usual instruction. We found greater gains in tree-thinking abilities for the experimental instruction group than for the business-as-usual group, as measured by performance on our novel assessment instrument. This was a medium size effect. These gains were observed on an unannounced test that was administered ∼5–6 weeks after the primary instruction in tree thinking. The nature of students’ postinstruction difficulties with tree thinking suggests that the critical underlying concept for acquiring expert-level competence in this area is understanding that any specific phylogenetic tree is a subset of the complete, unimaginably large ToL. PMID:27881445

Red-cockaded woodpecker nesting success, forest structure, and southern flying squirrels in Texas

Treesearch

Richard N. Conner; D. Craig Rudolph; Daniel Saenz; Richard R. Schaefer

1996-01-01

For several decades general opinion has suggested that southern flying squirrels (Gluucomys volans) have a negative effect on Red-cockaded Woodpeckers (Picoides borealis) through competition for cavities and egg/nestling predation. Complete removal of hardwood trees from Red-cockaded Woodpecker cavity tree clusters has occurred on some forests because southern flying...

Landscape- vs gap-level controls on the abundance of a fire-sensitive, late-successional tree species.

Treesearch

Michael C. Wimberly; Thomas A. Spies

2002-01-01

Tsuga heterophylla (western hemlock), a fire-sensitive, late-successional tree species, is an important component of old-growth forests in the Pacific Northwest, USA. In the Oregon Coast Range, however, T. heterophylla occurs at low densities in or is completely absent from many conifer stands. We used a cellular automata-based...

Divergent carbon dynamics under climate change in forests with diverse soils, tree species, and land use histories

Treesearch

Robert M. Scheller; Alec M. Kretchun; Steve Van Tuyl; Kenneth L. Clark; Melissa S. Lucash; John Hom

2012-01-01

Accounting for both climate change and natural disturbances—which typically result in greenhouse gas emissions—is necessary to begin managing forest carbon sequestration. Gaining a complete understanding of forest carbon dynamics is, however, challenging in systems characterized by historic over-utilization, diverse soils and tree species, and...

Checklist of Micro-Organisms Associated With Tree Seeds in the World, 1985

Treesearch

Robert L. Anderson

1986-01-01

Listed alphabetically by host are the major micro-organisms associated with tree seeds. Included are the countries where the organism originated, whether the organism causes a disease of considerable economic importance, whether treatment is available, and where evidence of the seedborne nature of the organism is incomplete or contradictory. The complete reference for...

Impacts of tree height on leaf hydraulic architecture and stomatal control in Douglas-fir.

Treesearch

D.R. Woodruff; K.A. McCulloh; J.M. Warren; F.C. Meinzer; B.L. Gartner

2007-01-01

We investigated the mechanisms involved in the regulation of stomatal closure in Douglas-fir and evaluated the potential compensatory adjustments in response to increasing tree height. Stomatal closure was initiated at values of leaf water potential corresponding to nearly complete loss of leaf hydraulic conductance. Cryogenic scanning electron microscopic images...

Responses of an Insect Folivore and Its Parastoids to Multiyear Experimental Defoliation of Aspen

Treesearch

Dylan Parry; Daniel A. Herms; William J. Mattson

2003-01-01

Foliage quality may decline in deciduous trees following defoliation, thus affecting the insect generation responsible for the herbivory (rapid induced resistance, RIR), or future generations (delayed induced resistance, DIR). During outbreaks, trees often suffer partial or complete defoliation for two or more successive years, yet most studies have examined induced...

Genomic profiling of plastid DNA variation in the Mediterranean olive tree

PubMed Central

2011-01-01

Background Characterisation of plastid genome (or cpDNA) polymorphisms is commonly used for phylogeographic, population genetic and forensic analyses in plants, but detecting cpDNA variation is sometimes challenging, limiting the applications of such an approach. In the present study, we screened cpDNA polymorphism in the olive tree (Olea europaea L.) by sequencing the complete plastid genome of trees with a distinct cpDNA lineage. Our objective was to develop new markers for a rapid genomic profiling (by Multiplex PCRs) of cpDNA haplotypes in the Mediterranean olive tree. Results Eight complete cpDNA genomes of Olea were sequenced de novo. The nucleotide divergence between olive cpDNA lineages was low and not exceeding 0.07%. Based on these sequences, markers were developed for studying two single nucleotide substitutions and length polymorphism of 62 regions (with variable microsatellite motifs or other indels). They were then used to genotype the cpDNA variation in cultivated and wild Mediterranean olive trees (315 individuals). Forty polymorphic loci were detected on this sample, allowing the distinction of 22 haplotypes belonging to the three Mediterranean cpDNA lineages known as E1, E2 and E3. The discriminating power of cpDNA variation was particularly low for the cultivated olive tree with one predominating haplotype, but more diversity was detected in wild populations. Conclusions We propose a method for a rapid characterisation of the Mediterranean olive germplasm. The low variation in the cultivated olive tree indicated that the utility of cpDNA variation for forensic analyses is limited to rare haplotypes. In contrast, the high cpDNA variation in wild populations demonstrated that our markers may be useful for phylogeographic and populations genetic studies in O. europaea. PMID:21569271

The First Photometric and Period Investigation of the Total Eclipse Binary System V0474 Cam

NASA Astrophysics Data System (ADS)

Guo, D. F.; Li, K.; Hu, S. M.; Chen, X.

2018-06-01

Three complete multi-band light curves of the W UMa-type binary V0474 Cam, which display a total eclipse, were obtained on four nights during two observing seasons from 2016 February 9 to 2017 February 24. By analyzing all obtainable times of light minimum, including 8 newly calculated, a downward parabolic change was found to be overlaid with a possible cyclic oscillation. The secular period decrease is determined to be {dP}/{dt}=-9.42 × {10}-7 days yr‑1, which can be explained by the existence of angular momentum loss from the binary system via a magnetic stellar wind. The cyclic oscillation, with a 3.44-yr period and a 0.0015-days amplitude, could be explained more plausibly by the magnetic activity, although the light-travel time effect as result of the present of a third component cannot be excluded. According to the three complete light curves, the intrinsic variations are obvious, particularly in the deepness at primary minimum and in the phase around 0.75. The light curve of V0474 Cam is symmetric observed in February 2016, then it become asymmetric in December 2016 and February 2017. The W-D program was adopted to investigate the multi-band light curves and the results indicate V0474 Cam is a W-subtype binary (the less massive component is hotter). A mass ratio of q = 3.230 was derived by analyzing the symmetric light curves observed at February in 2016. After accepting the results derived from the symmetric light curves as the references, other two sets of asymmetrical light curves can be well resolved through adding a cool spot on the more massive component.

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

NASA Astrophysics Data System (ADS)

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

2013-10-01

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

Order No. 0020 for the establishment of methods of reforestation, 19 March 1987.

PubMed

1988-01-01

In light of the "Green Movement" policy and the development of the Colombia Major National Reforestation Plan, this Order establishes the following methods of promoting reforestation: 1) advice and guidance to those concerned with tree planting; 2) forestry planning for farms; and 3) grants of trees whenever possible in the proportions indicated in the Order. The Order classifies beneficiaries into small-size tree farmers (up to 20 hectares, and 80% of whose income derives from that activity); and medium- and large-scale tree farmers (more than 20 hectares). Other provisions of the Order deal with applications, dates of completion of requirements, and the actual methods of promoting reforestation. full text

Rate-distortion optimized tree-structured compression algorithms for piecewise polynomial images.

PubMed

Shukla, Rahul; Dragotti, Pier Luigi; Do, Minh N; Vetterli, Martin

2005-03-01

This paper presents novel coding algorithms based on tree-structured segmentation, which achieve the correct asymptotic rate-distortion (R-D) behavior for a simple class of signals, known as piecewise polynomials, by using an R-D based prune and join scheme. For the one-dimensional case, our scheme is based on binary-tree segmentation of the signal. This scheme approximates the signal segments using polynomial models and utilizes an R-D optimal bit allocation strategy among the different signal segments. The scheme further encodes similar neighbors jointly to achieve the correct exponentially decaying R-D behavior (D(R) - c(o)2(-c1R)), thus improving over classic wavelet schemes. We also prove that the computational complexity of the scheme is of O(N log N). We then show the extension of this scheme to the two-dimensional case using a quadtree. This quadtree-coding scheme also achieves an exponentially decaying R-D behavior, for the polygonal image model composed of a white polygon-shaped object against a uniform black background, with low computational cost of O(N log N). Again, the key is an R-D optimized prune and join strategy. Finally, we conclude with numerical results, which show that the proposed quadtree-coding scheme outperforms JPEG2000 by about 1 dB for real images, like cameraman, at low rates of around 0.15 bpp.

Modeling and experimental characterization of electromigration in interconnect trees

NASA Astrophysics Data System (ADS)

Thompson, C. V.; Hau-Riege, S. P.; Andleigh, V. K.

1999-11-01

Most modeling and experimental characterization of interconnect reliability is focussed on simple straight lines terminating at pads or vias. However, laid-out integrated circuits often have interconnects with junctions and wide-to-narrow transitions. In carrying out circuit-level reliability assessments it is important to be able to assess the reliability of these more complex shapes, generally referred to as `trees.' An interconnect tree consists of continuously connected high-conductivity metal within one layer of metallization. Trees terminate at diffusion barriers at vias and contacts, and, in the general case, can have more than one terminating branch when they include junctions. We have extended the understanding of `immortality' demonstrated and analyzed for straight stud-to-stud lines, to trees of arbitrary complexity. This leads to a hierarchical approach for identifying immortal trees for specific circuit layouts and models for operation. To complete a circuit-level-reliability analysis, it is also necessary to estimate the lifetimes of the mortal trees. We have developed simulation tools that allow modeling of stress evolution and failure in arbitrarily complex trees. We are testing our models and simulations through comparisons with experiments on simple trees, such as lines broken into two segments with different currents in each segment. Models, simulations and early experimental results on the reliability of interconnect trees are shown to be consistent.

The solar type deep low mass-ratio contact binary V658 Lyr: Photometric solution and preliminary elements

NASA Astrophysics Data System (ADS)

Martignoni, M.; Barani, C.; Acerbi, F.

2018-07-01

We present the first light curve analysis of the eclipsing binary V658 Lyr. B, V and Ic photometric observations made from 2014 to 2017 of this W UMa-type binary star are collected, the complete light curves were obtained in 2015 (4 nights) and 2016 (11 nights) and are used for a detailed photometric analysis to determine orbital and physical parameters using the Wilson-Devinney code. The results obtained indicates that V658 Lyr is an A-type overcontact binary system with both components of spectral type (G2 + G4). Based on our 17 ToM the short orbital period of the eclipsing binary was confirmed and revised to P = 0.3302577 days. The orbital period was found to show a cyclic variations and a decrease rate of dP/dt = - 2.97 × 10 -7 days yr-1 , which can be interpreted as a mass transfer from the more massive component to the less massive one. We have not found an asymmetry of the light curves. The mass of the primary and secondary stars are calculated to be M1 = 1.18M⊙( ± 0.08) and M2 = 0.21M⊙( ± 0.01) indicating the primary to be underluminous for its mass and the secondary to be overluminous for its mass.

Optical Neural Classification Of Binary Patterns

NASA Astrophysics Data System (ADS)

Gustafson, Steven C.; Little, Gordon R.

1988-05-01

Binary pattern classification that may be implemented using optical hardware and neural network algorithms is considered. Pattern classification problems that have no concise description (as in classifying handwritten characters) or no concise computation (as in NP-complete problems) are expected to be particularly amenable to this approach. For example, optical processors that efficiently classify binary patterns in accordance with their Boolean function complexity might be designed. As a candidate for such a design, an optical neural network model is discussed that is designed for binary pattern classification and that consists of an optical resonator with a dynamic multiplex-recorded reflection hologram and a phase conjugate mirror with thresholding and gain. In this model, learning or training examples of binary patterns may be recorded on the hologram such that one bit in each pattern marks the pattern class. Any input pattern, including one with an unknown class or marker bit, will be modified by a large number of parallel interactions with the reflection hologram and nonlinear mirror. After perhaps several seconds and 100 billion interactions, a steady-state pattern may develop with a marker bit that represents a minimum-Boolean-complexity classification of the input pattern. Computer simulations are presented that illustrate progress in understanding the behavior of this model and in developing a processor design that could have commanding and enduring performance advantages compared to current pattern classification techniques.

Kinematic Clues to OB Field Star Origins: Radial Velocities, Runaways, and Binaries

NASA Astrophysics Data System (ADS)

Januszewski, Helen; Castro, Norberto; Oey, Sally; Becker, Juliette; Kratter, Kaitlin M.; Mateo, Mario; Simón-Díaz, Sergio; Bjorkman, Jon E.; Bjorkman, Karen; Sigut, Aaron; Smullen, Rachel; M2FS Team

2018-01-01

Field OB stars are a crucial probe of star formation in extreme conditions. Properties of massive stars formed in relative isolation can distinguish between competing star formation theories, while the statistics of runaway stars allow an indirect test of the densest conditions in clusters. To address these questions, we have obtained multi-epoch, spectroscopic observations for a spatially complete sample of 48 OB field stars in the SMC Wing with the IMACS and M2FS multi-object spectrographs at the Magellan Telescopes. The observations span 3-6 epochs per star, with sampling frequency ranging from one day to about one year. From these spectra, we have calculated the radial velocities (RVs) and, in particular, the systemic velocities for binaries. Thus, we present the intrinsic RV distribution largely uncontaminated by binary motions. We estimate the runaway frequency, corresponding to the high velocity stars in our sample, and we also constrain the binary frequency. The binary frequency and fitted orbital parameters also place important constraints on star formation theories, as these properties drive the process of runaway ejection in clusters, and we discuss these properties as derived from our sample. This unique kinematic analysis of a high mass field star population thus provides a new look at the processes governing formation and interaction of stars in environments at extreme densities, from isolation to dense clusters.

1SWASP J200503.05-343726.5: A high mass ratio eclipsing binary near the period limit

NASA Astrophysics Data System (ADS)

Bin, Zhang; Shengbang, Qian; Zejda, Miloslav; Liying, Zhu; Nianping, Liu

2017-07-01

First CCD photometric light curves of the eclipsing binary system 1SWASP J200503.05-343726.5 are presented. Our complete light curves in V, R and I bands using the Bessell filter show an out-of-eclipsing distortion, which means that the components of the system may be active. The preliminary photometric solutions with a cool star-spot are derived by using the 2013 version of the Wilson-Devinney (W-D) code. The photometric solutions suggest that 1SWASP J200503.05-343726.5 is a shallow-contact eclipsing binary(f = 9.0 %) with a mass ratio of q = 1.0705 , which is very high for late-type binary systems near the period limit. The primary component is about 230 K hotter than the secondary component. Based on our new CCD eclipse times, the orbital period change was analyzed. According to O - C diagram, the orbital period of the 1SWASP J200503.05-343726.5 shows an increase at a rate of P˙ = + 5.43 ×10-8 days year-1. The period increase may be caused by mass transfer from the less massive component to the more massive one. This shallow-contact system may be formed from a detached short-period binary via orbital shrinkage because of dynamical interactions with a third component or by magnetic braking.

Genetic variation in growth, carbon isotope discrimination, and foliar N concentration in Picea mariana: analyses from a half-diallel mating design using field-grown trees

Treesearch

Kurt H. Johnsen; Lawrence B. Flanagan; Dudley A. Huber; John E. Major

1999-01-01

The authors performed genetic analyses of growth, carbon isotope discrimination (?13C), and foliar N concentration using a half-diallel subset of a 7 × 7 complete diallel planted on three sites ranging in water availability. Trees were 22 years old. Heritabilities; general and...

Assessing alternative measures of tree canopy cover: Photo-interpreted NAIP and ground-based estimates

Treesearch

Chris Toney; Greg Liknes; Andy Lister; Dacia Meneguzzo

2012-01-01

In preparation for the development of the National Land Cover Database (NLCD) 2011 tree canopy cover layer, a pilot project for research and method development was completed in 2010 by the USDA Forest Service Forest Inventory and Analysis (FIA) program and Remote Sensing Applications Center (RSAC).This paper explores one of several topics investigated during the NLCD...

Test Reviews: Euler, B. L. (2007). "Emotional Disturbance Decision Tree". Lutz, FL: Psychological Assessment Resources

ERIC Educational Resources Information Center

Tansy, Michael

2009-01-01

The Emotional Disturbance Decision Tree (EDDT) is a teacher-completed norm-referenced rating scale published by Psychological Assessment Resources, Inc., in Lutz, Florida. The 156-item EDDT was developed for use as part of a broader assessment process to screen and assist in the identification of 5- to 18-year-old children for the special…

Growth and refoliation of koa trees infested by the koa moth, Scotorythra Paludicola (Lepidoptera: Geometridae)

Treesearch

John D. Stein; Paul G. Scowcroft

1984-01-01

Since the early 1900s, four major infestations of the koa moth, Scotorythra paludicola (Butler), have defoliated koa (Acacia koa Gray) stands on the island of Maui. After trees on 7564 ha of the Makawao Forest Reserve were damaged in 1977, a study was begun to determine growth and refoliation response of completely defoliated...

Place-Based Education and Geographic Information Systems: Enhancing the Spatial Awareness of Middle School Students in Maine

ERIC Educational Resources Information Center

Perkins, Nancy; Hazelton, Eric; Erickson, Jeryl; Allan, Walter

2010-01-01

Spatial literacy is a new frontier in K-12 education. This article describes a place-based introductory GIS/GPS middle school curriculum unit in which students used measuring tools, GPS units, and My World GIS software to collect physical and spatial data of trees to create a schoolyard tree inventory. Maine students completed "memory…

Pulse-radiolysis studies on the interaction of one-electron reduced species with blue oxidases. Reduction of native and type-2-copper-depleted Vietnamese-lacquer-tree and Japanese-lacquer-tree laccases.

PubMed

O'Neill, P; Fielden, E M; Morpurgo, L; Agostinelli, E

1984-08-15

The interactions of one-electron reduced metronidazole (ArNO2.-) and O2.- with native and Type-2-copper-depleted Vietnamese- and Japanese-lacquer-tree laccases were studied in aqueous solution at pH 6.0 and 7.4 by using the technique of pulse radiolysis. On reaction with ArNO2.-, in the absence of O2, the holo- and the Type-2-copper-depleted proteins accept, with reduction of Type 1 copper, 2 and 1 reducing equivalents respectively. On reaction with O2.- of both holo- and Type-2-copper-depleted Vietnamese-lacquer-tree laccase, almost complete reduction of Type 1 copper was observed and, after completion of the reaction, some (less than 20%) reoxidation of Type 1 copper occurs. Reduction of Type 1 copper of the laccases by these one-electron donors occurs via a bimolecular step; however, the rate of reduction of Vietnamese-lacquer-tree laccase is over 10 times that of Japanese-lacquer-tree laccase. It is inferred that electrons enter the protein via Type 1 copper with, in the case of the holoprotein, subsequent rapid intramolecular transfer of 1 reducing equivalent within the protein. Furthermore it is suggested that intra-molecular electron transfer to Type 3 copper atoms is slow and, in the case of Type-2-copper-depleted protein, may not occur. This slow process may partially account for the variation of the catalytic activities of 'blue' oxidases.

PAM-4 Signaling over VCSELs with 0.13µm CMOS Chip Technology

NASA Astrophysics Data System (ADS)

Cunningham, J. E.; Beckman, D.; Zheng, Xuezhe; Huang, Dawei; Sze, T.; Krishnamoorthy, A. V.

2006-12-01

We present results for VCSEL based links operating PAM-4 signaling using a commercial 0.13µm CMOS technology. We perform a complete link analysis of the Bit Error Rate, Q factor, random and deterministic jitter by measuring waterfall curves versus margins in time and amplitude. We demonstrate that VCSEL based PAM 4 can match or even improve performance over binary signaling under conditions of a bandwidth limited, 100meter multi-mode optical link at 5Gbps. We present the first sensitivity measurements for optical PAM-4 and compare it with binary signaling. Measured benefits are reconciled with information theory predictions.

PAM-4 Signaling over VCSELs with 0.13microm CMOS Chip Technology.

PubMed

Cunningham, J E; Beckman, D; Zheng, Xuezhe; Huang, Dawei; Sze, T; Krishnamoorthy, A V

2006-12-11

We present results for VCSEL based links operating PAM-4 signaling using a commercial 0.13microm CMOS technology. We perform a complete link analysis of the Bit Error Rate, Q factor, random and deterministic jitter by measuring waterfall curves versus margins in time and amplitude. We demonstrate that VCSEL based PAM-4 can match or even improve performance over binary signaling under conditions of a bandwidth limited, 100meter multi-mode optical link at 5Gbps. We present the first sensitivity measurements for optical PAM-4 and compare it with binary signaling. Measured benefits are reconciled with information theory predictions.

A New Light Curve and Analysis of the Long Period Eclipsing Binary BF Draconis

NASA Astrophysics Data System (ADS)

Wolf, G. W.; Craig, L. E.; Caffey, J. F.

1999-01-01

The star BF Draconis was found to be an eclipsing binary by Strohmeier, Knigge and Ott (1962) and originally thought to be an Algol-type system with a period of 5.6 days. A spectrographic study by Imbert (1985) showed that the period was actually double this value and that the system consisted of two well-separated, almost-equal F-type stars in elliptical orbit. Diethelm, Wolf and Agerer (1993) later published a preliminary light curve of this system showing minima of unequal depth and width with a displaced secondary, confirming the elliptical orbit but disagreeing with Imbert on the specific orbital parameters. As a part of our long-term program of obtaining improved light curves of double-lined spectroscopic and eclipsing binaries, we have observed BF Draconis for the past four years using the 0.4 meter telescope at the Baker Observatory of Southwest Missouri State University. Complete light curves in the Cousins BVRI passbands have been obtained with our Photometrics CCD system, and a new model and orbital parameters for the binary have been determined using the Wilson-Devinney program. This research has been supported by NSF Grants AST-9315061 and AST-9605822 and NASA Grant NGT5-40060.

A comparison of multiple imputation methods for incomplete longitudinal binary data.

PubMed

Yamaguchi, Yusuke; Misumi, Toshihiro; Maruo, Kazushi

2018-01-01

Longitudinal binary data are commonly encountered in clinical trials. Multiple imputation is an approach for getting a valid estimation of treatment effects under an assumption of missing at random mechanism. Although there are a variety of multiple imputation methods for the longitudinal binary data, a limited number of researches have reported on relative performances of the methods. Moreover, when focusing on the treatment effect throughout a period that has often been used in clinical evaluations of specific disease areas, no definite investigations comparing the methods have been available. We conducted an extensive simulation study to examine comparative performances of six multiple imputation methods available in the SAS MI procedure for longitudinal binary data, where two endpoints of responder rates at a specified time point and throughout a period were assessed. The simulation study suggested that results from naive approaches of a single imputation with non-responders and a complete case analysis could be very sensitive against missing data. The multiple imputation methods using a monotone method and a full conditional specification with a logistic regression imputation model were recommended for obtaining unbiased and robust estimations of the treatment effect. The methods were illustrated with data from a mental health research.

Testing Ultracool Atmospheres with Mass Benchmarks

NASA Astrophysics Data System (ADS)

Dupuy, Trent J.; Liu, Michael C.

2011-08-01

After years of patient orbital monitoring, there is now a sample of ~10 very low-mass stars and brown dwarfs with precise (~5%) dynamical masses. These binaries represent the gold standard for testing substellar theoretical models. Work to date has identified problems with the model-predicted broad-band colors, effective temperatures, and possibly even luminosity evolution with age. However, our ability to test models is currently limited by how well the individual components of these highly prized binaries are characterized. To solve this problem, we propose to obtain narrow-band imaging with Keck/OSIRIS LGS to measure resolved SEDs for this first sizable sample of ultracool binaries with well-determined dynamical masses. This multi- band photometry will enable us to precisely estimate spectral types and effective temperatures of individual binary components, providing the strongest constraints to date on widely used evolutionary and atmospheric models. Our proposed Keck observations are much less daunting in comparison to the years of orbital monitoring needed to yield dynamical masses, but these data are equally vital for robust tests of theory. (Note: Our proposed time is intended to replace the 1 night awarded by NOAO to carry out this program in 2010B, which was completely lost due to weather.)

Infrared moving small target detection based on saliency extraction and image sparse representation

NASA Astrophysics Data System (ADS)

Zhang, Xiaomin; Ren, Kan; Gao, Jin; Li, Chaowei; Gu, Guohua; Wan, Minjie

2016-10-01

Moving small target detection in infrared image is a crucial technique of infrared search and tracking system. This paper present a novel small target detection technique based on frequency-domain saliency extraction and image sparse representation. First, we exploit the features of Fourier spectrum image and magnitude spectrum of Fourier transform to make a rough extract of saliency regions and use a threshold segmentation system to classify the regions which look salient from the background, which gives us a binary image as result. Second, a new patch-image model and over-complete dictionary were introduced to the detection system, then the infrared small target detection was converted into a problem solving and optimization process of patch-image information reconstruction based on sparse representation. More specifically, the test image and binary image can be decomposed into some image patches follow certain rules. We select the target potential area according to the binary patch-image which contains salient region information, then exploit the over-complete infrared small target dictionary to reconstruct the test image blocks which may contain targets. The coefficients of target image patch satisfy sparse features. Finally, for image sequence, Euclidean distance was used to reduce false alarm ratio and increase the detection accuracy of moving small targets in infrared images due to the target position correlation between frames.

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 models in terms of selected predictors and coefficients, as well as of dispersion of the estimated probabilities around the mean value for each mapped pixel. The difference in the behaviour could be interpreted as the result of overfitting effects, which heavily affect decision tree classification more than logistic regression techniques.

ETE: a python Environment for Tree Exploration.

PubMed

Huerta-Cepas, Jaime; Dopazo, Joaquín; Gabaldón, Toni

2010-01-13

Many bioinformatics analyses, ranging from gene clustering to phylogenetics, produce hierarchical trees as their main result. These are used to represent the relationships among different biological entities, thus facilitating their analysis and interpretation. A number of standalone programs are available that focus on tree visualization or that perform specific analyses on them. However, such applications are rarely suitable for large-scale surveys, in which a higher level of automation is required. Currently, many genome-wide analyses rely on tree-like data representation and hence there is a growing need for scalable tools to handle tree structures at large scale. Here we present the Environment for Tree Exploration (ETE), a python programming toolkit that assists in the automated manipulation, analysis and visualization of hierarchical trees. ETE libraries provide a broad set of tree handling options as well as specific methods to analyze phylogenetic and clustering trees. Among other features, ETE allows for the independent analysis of tree partitions, has support for the extended newick format, provides an integrated node annotation system and permits to link trees to external data such as multiple sequence alignments or numerical arrays. In addition, ETE implements a number of built-in analytical tools, including phylogeny-based orthology prediction and cluster validation techniques. Finally, ETE's programmable tree drawing engine can be used to automate the graphical rendering of trees with customized node-specific visualizations. ETE provides a complete set of methods to manipulate tree data structures that extends current functionality in other bioinformatic toolkits of a more general purpose. ETE is free software and can be downloaded from http://ete.cgenomics.org.

ETE: a python Environment for Tree Exploration

PubMed Central

2010-01-01

Background Many bioinformatics analyses, ranging from gene clustering to phylogenetics, produce hierarchical trees as their main result. These are used to represent the relationships among different biological entities, thus facilitating their analysis and interpretation. A number of standalone programs are available that focus on tree visualization or that perform specific analyses on them. However, such applications are rarely suitable for large-scale surveys, in which a higher level of automation is required. Currently, many genome-wide analyses rely on tree-like data representation and hence there is a growing need for scalable tools to handle tree structures at large scale. Results Here we present the Environment for Tree Exploration (ETE), a python programming toolkit that assists in the automated manipulation, analysis and visualization of hierarchical trees. ETE libraries provide a broad set of tree handling options as well as specific methods to analyze phylogenetic and clustering trees. Among other features, ETE allows for the independent analysis of tree partitions, has support for the extended newick format, provides an integrated node annotation system and permits to link trees to external data such as multiple sequence alignments or numerical arrays. In addition, ETE implements a number of built-in analytical tools, including phylogeny-based orthology prediction and cluster validation techniques. Finally, ETE's programmable tree drawing engine can be used to automate the graphical rendering of trees with customized node-specific visualizations. Conclusions ETE provides a complete set of methods to manipulate tree data structures that extends current functionality in other bioinformatic toolkits of a more general purpose. ETE is free software and can be downloaded from http://ete.cgenomics.org. PMID:20070885

Reconstructing the spatial pattern of trees from routine stand examination measurements

USGS Publications Warehouse

Hanus, M.L.; Hann, D.W.; Marshall, D.D.

1998-01-01

Reconstruction of the spatial pattern of trees is important for the accurate visual display of unmapped stands. The proposed process for generating the spatial pattern is a nonsimple sequential inhibition process, with the inhibition zone proportionate to the scaled maximum crown width of an open-grown tree of the same species and same diameter at breast height as the subject tree. The results of this coordinate generation procedure are compared with mapped stem data from nine natural stands of Douglas-fir at two ages by the use of a transformed Ripley's K(d) function. The results of this comparison indicate that the proposed method, based on complete tree lists, successfully replicated the spatial patterns of the trees in all nine stands at both ages and over the range of distances examined. On the basis of these findings and the procedure's ability to model effects through time, the nonsimple sequential inhibition process has been chosen to generate tree coordinates in the VIZ4ST computer program for displaying forest stand structure in naturally regenerated young Douglas-fir stands. For. Sci.

A binary genetic programing model for teleconnection identification between global sea surface temperature and local maximum monthly rainfall events

NASA Astrophysics Data System (ADS)

Danandeh Mehr, Ali; Nourani, Vahid; Hrnjica, Bahrudin; Molajou, Amir

2017-12-01

The effectiveness of genetic programming (GP) for solving regression problems in hydrology has been recognized in recent studies. However, its capability to solve classification problems has not been sufficiently explored so far. This study develops and applies a novel classification-forecasting model, namely Binary GP (BGP), for teleconnection studies between sea surface temperature (SST) variations and maximum monthly rainfall (MMR) events. The BGP integrates certain types of data pre-processing and post-processing methods with conventional GP engine to enhance its ability to solve both regression and classification problems simultaneously. The model was trained and tested using SST series of Black Sea, Mediterranean Sea, and Red Sea as potential predictors as well as classified MMR events at two locations in Iran as predictand. Skill of the model was measured in regard to different rainfall thresholds and SST lags and compared to that of the hybrid decision tree-association rule (DTAR) model available in the literature. The results indicated that the proposed model can identify potential teleconnection signals of surrounding seas beneficial to long-term forecasting of the occurrence of the classified MMR events.

An Integrative Object-Based Image Analysis Workflow for Uav Images

NASA Astrophysics Data System (ADS)

Yu, Huai; Yan, Tianheng; Yang, Wen; Zheng, Hong

2016-06-01

In this work, we propose an integrative framework to process UAV images. The overall process can be viewed as a pipeline consisting of the geometric and radiometric corrections, subsequent panoramic mosaicking and hierarchical image segmentation for later Object Based Image Analysis (OBIA). More precisely, we first introduce an efficient image stitching algorithm after the geometric calibration and radiometric correction, which employs a fast feature extraction and matching by combining the local difference binary descriptor and the local sensitive hashing. We then use a Binary Partition Tree (BPT) representation for the large mosaicked panoramic image, which starts by the definition of an initial partition obtained by an over-segmentation algorithm, i.e., the simple linear iterative clustering (SLIC). Finally, we build an object-based hierarchical structure by fully considering the spectral and spatial information of the super-pixels and their topological relationships. Moreover, an optimal segmentation is obtained by filtering the complex hierarchies into simpler ones according to some criterions, such as the uniform homogeneity and semantic consistency. Experimental results on processing the post-seismic UAV images of the 2013 Ya'an earthquake demonstrate the effectiveness and efficiency of our proposed method.

Spacecraft On-Board Information Extraction Computer (SOBIEC)

NASA Technical Reports Server (NTRS)

Eisenman, David; Decaro, Robert E.; Jurasek, David W.

1994-01-01

The Jet Propulsion Laboratory is the Technical Monitor on an SBIR Program issued for Irvine Sensors Corporation to develop a highly compact, dual use massively parallel processing node known as SOBIEC. SOBIEC couples 3D memory stacking technology provided by nCUBE. The node contains sufficient network Input/Output to implement up to an order-13 binary hypercube. The benefit of this network, is that it scales linearly as more processors are added, and it is a superset of other commonly used interconnect topologies such as: meshes, rings, toroids, and trees. In this manner, a distributed processing network can be easily devised and supported. The SOBIEC node has sufficient memory for most multi-computer applications, and also supports external memory expansion and DMA interfaces. The SOBIEC node is supported by a mature set of software development tools from nCUBE. The nCUBE operating system (OS) provides configuration and operational support for up to 8000 SOBIEC processors in an order-13 binary hypercube or any subset or partition(s) thereof. The OS is UNIX (USL SVR4) compatible, with C, C++, and FORTRAN compilers readily available. A stand-alone development system is also available to support SOBIEC test and integration.

The Effect of Single, Binary and Ternary Anions of Chloride, Carbonate and Phosphate on the Release of 2,4-Dichlorophenoxyacetate Intercalated into the Zn-Al-layered Double Hydroxide Nanohybrid

NASA Astrophysics Data System (ADS)

Hussein, Mohd Zobir; Jaafar, Adila Mohamad; Yahaya, Asmah Hj.; Zainal, Zulkarnain

2009-11-01

Intercalation of beneficial anion into inorganic host has lead to an opportunity to synthesize various combinations of new organic-inorganic nanohybrids with various potential applications; especially, for the controlled release formulation and storage purposes. Investigation on the release behavior of 2,4-dichlorophenoxyacetate (2,4-D) intercalated into the interlayer of Zn-Al-layered double hydroxide (ZAN) have been carried out using single, binary and ternary aqueous systems of chloride, carbonate and phosphate. The release behavior of the active agent 2,4-D from its double-layered hydroxide nanohybrid ZANDI was found to be of controlled manner governed by pseudo-second order kinetics. It was found that carbonate medium yielded the highest accumulated release of 2,4-D, while phosphate in combination with carbonate and/or nitrate speeds up the release rate of 2,4-D. These results indicate that it is possible to design and develop new delivery system of latex stimulant compound with controlled release property based on 2,4-D that is known as a substance to increase latex production of rubber tree, Hevea brasiliensis.

Investigating how students communicate tree-thinking

NASA Astrophysics Data System (ADS)

Boyce, Carrie Jo

Learning is often an active endeavor that requires students work at building conceptual understandings of complex topics. Personal experiences, ideas, and communication all play large roles in developing knowledge of and understanding complex topics. Sometimes these experiences can promote formation of scientifically inaccurate or incomplete ideas. Representations are tools used to help individuals understand complex topics. In biology, one way that educators help people understand evolutionary histories of organisms is by using representations called phylogenetic trees. In order to understand phylogenetics trees, individuals need to understand the conventions associated with phylogenies. My dissertation, supported by the Tree-Thinking Representational Competence and Word Association frameworks, is a mixed-methods study investigating the changes in students' tree-reading, representational competence and mental association of phylogenetic terminology after participation in varied instruction. Participants included 128 introductory biology majors from a mid-sized southern research university. Participants were enrolled in either Introductory Biology I, where they were not taught phylogenetics, or Introductory Biology II, where they were explicitly taught phylogenetics. I collected data using a pre- and post-assessment consisting of a word association task and tree-thinking diagnostic (n=128). Additionally, I recruited a subset of students from both courses (n=37) to complete a computer simulation designed to teach students about phylogenetic trees. I then conducted semi-structured interviews consisting of a word association exercise with card sort task, a retrospective pre-assessment discussion, a post-assessment discussion, and interview questions. I found that students who received explicit lecture instruction had a significantly higher increase in scores on a tree-thinking diagnostic than students who did not receive lecture instruction. Students who received both explicit lecture instruction and the computer simulation had a higher level of representational competence and were better able to understand abstract-style phylogenetic trees than students who only completed the simulation. Students who received explicit lecture instruction had a slightly more scientific association of phylogenetic terms than students who received did not receive lecture instruction. My findings suggest that technological instruction alone is not as beneficial as lecture instruction.

Microwave sensing of tree trunks

NASA Astrophysics Data System (ADS)

Jezova, Jana; Mertens, Laurence; Lambot, Sebastien

2015-04-01

The main subject of this research is the observation of the inner part of living tree trunks using ground-penetrating radar (GPR). Trees are everyday part of human life and therefore it is important to pay attention to the tree conditions. The most obvious consequence of the poor tree condition is dead or injury caused by falling tree. The trunk internal structure is divided into three main parts: heartwood, sapwood and bark, which make this medium highly anisotropic and heterogeneous. Furthermore, the properties of the wood are not only specie-dependent but also depend on genetic and on environmental conditions. In urban areas the main problem for the stability of the trees relies in the apparition of decays provoked by fungi, insect or birds. This results in cavities or decreasing of the support capacity of the tree. GPR has proved itself to be a very powerful electromagnetic tool for non-destructive detection of buried objects. Since the beginning of the 20th century it has been used in several different areas (archaeology, landmine detection, civil engineering, ...). GPR uses the principle of the scattering of the electromagnetic waves that are radiated from a transmitting antenna. Then the waves propagate through the medium and are reflected from the object and then they are received by a receiving antenna. The velocity of the scattered signal is determined primarily by the permittivity of the material. The optimal functionality of the GPR was investigated using the numerical simulation tool gprMax2D. This tool is based on a Finite-Difference Time-Domain (FDTD) numerical model. Subsequently, the GPR functionality was tested using the laboratory model of a decayed tree trunk. Afterwards, the results and lessons learnt in the simplified tests will be used in the processing of the real data and will help to achieve deeper understanding of them. The laboratory model of the tree trunk was made by plastic or carton pipes and filled by sand. Space inside the model 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".

Triamcinolone Acetonide Selectively Inhibits Angiogenesis in Small Blood Vessels and Decreases Vessel Diameter within the Vascular Tree

NASA Technical Reports Server (NTRS)

McKay, Terri L.; Gredeon, Dan J.; Vickerman, Mary B.; Hylton, alan G.; Ribita, Daniela; Olar, Harry H.; Kaiser, Peter K.; Parsons-Wingerter, Patricia

2007-01-01

The steroid triamcinolone acetonide (TA) is a potent anti-angiogenesis drug used to treat retinal vascular diseases that include diabetic retinopathy, vascular occlusions and choroidal neovascularization. To quantify the effects of TA on branching morphology within the angiogenic microvascular tree of the chorioallantoic membrane (CAM) of quail embryos. Increasing concentrations of TA (0-16 ng/ml) were applied topically on embryonic day 7 (E7) to the chorioallantoic membrane (CAM) of quail embryos cultured in Petri dishes, and incubated for an additional 24 or 48 hours until fixation. Binary (black/white) microscopic images of arterial end points were quantified by VESGEN software (for Generational Analysis of Vessel Branching) to obtain major vascular parameters that include vessel diameter (Dv), fractal dimension (Df), tortuosity (Tv) and densities of vessel area, length, number and branch point (Av, Lv, Nv and Brv). For assessment of specific changes in vascular morphology induced by TA, the VESGEN software automatically segmented the vascular tree into branching generations (G1...G10) according to changes in vessel diameter and branching. Vessel density decreased significantly up to 34% as the function of increasing concentration of TA according to Av, Lv, Brv, Nv and Df. TA selectively inhibited the growth of new, small vessels, because Lv decreased from 13.14plus or minus 0.61 cm/cm2 for controls to 8.012 plus or minus 0.82 cm/cm2 at 16 ng TA/ml in smaller branching generations (G7-G10), and for Nv from 473.83 plus or minus 29.85 cm(-)2 to 302.32 plus or minus 33.09 cm-()2. In contrast, vessel diameter (Dv) decreased throughout the vascular tree (G1-G10).

Snow distribution throughout small subalpine catchment post-insect infestation of spruce and pine beetle.

NASA Astrophysics Data System (ADS)

Beverly, D.; Ewers, B. E.; Hyde, K.; Ohara, N.; Speckman, H. N.

2015-12-01

High elevation watersheds of the Rocky Mountains region contribute over 70% of the streamflow needed for infrastructure, agriculture, and ecological processes. Snow-water yields are heterogeneous in space and time and are driven by a multitude of snow distribution processes, including snowpack evolution driven by physical and biological factors. Quantifying heterogeneity of snowpack is further complicated by vegetation perturbations; much of the Rocky Mountains have experienced significant tree mortality due to bark beetle outbreaks. Reduction of living crown area decreases canopy interception while increasing radiation to snow surfaces, which alters snowpack distribution throughout the catchment. We hypothesize that, in a complex watershed, topographic variation (i.e., slope and aspect) will have a greater effect on snowpack evolution and distribution than densities of canopy mortality due to beetle infestation. The 120 ha No Name watershed, located in southern Wyoming at 3000 m elevation was divided into twenty-one 175 m2 parcels, in which plots were randomly assigned within each parcel. Peak snow was measured in April; in the 50 m2 plots, depths were measured every 2 m along north-south and east-west transects. Twenty-one snow pits were excavated to quantify snow densities in 10 cm increments throughout the pit profile. Forest inventories occurred the following summer. Peak snowpack levels occurred in April with mean depth of 92.3 ­­± 2.4 cm and peak SWE of 34.0 ± 0.84 cm. Binary decision trees accounted for 63% of the variability after including topographic indices, beetle condition of the trees, LAI, and basal area. Snow depth showed a slight positive relationship with increased in beetle mortality on slopes less than 11 degrees. Overall, topographic indices are greater drivers for snow distributions compared to effects of tree mortality.

An O(log sup 2 N) parallel algorithm for computing the eigenvalues of a symmetric tridiagonal matrix

NASA Technical Reports Server (NTRS)

Swarztrauber, Paul N.

1989-01-01

An O(log sup 2 N) parallel algorithm is presented for computing the eigenvalues of a symmetric tridiagonal matrix using a parallel algorithm for computing the zeros of the characteristic polynomial. The method is based on a quadratic recurrence in which the characteristic polynomial is constructed on a binary tree from polynomials whose degree doubles at each level. Intervals that contain exactly one zero are determined by the zeros of polynomials at the previous level which ensures that different processors compute different zeros. The exact behavior of the polynomials at the interval endpoints is used to eliminate the usual problems induced by finite precision arithmetic.

Reasoning about Codata

NASA Astrophysics Data System (ADS)

Hinze, Ralf

Programmers happily use induction to prove properties of recursive programs. To show properties of corecursive programs they employ coinduction, but perhaps less enthusiastically. Coinduction is often considered a rather low-level proof method, in particular, as it departs quite radically from equational reasoning. Corecursive programs are conveniently defined using recursion equations. Suitably restricted, these equations possess unique solutions. Uniqueness gives rise to a simple and attractive proof technique, which essentially brings equational reasoning to the coworld. We illustrate the approach using two major examples: streams and infinite binary trees. Both coinductive types exhibit a rich structure: they are applicative functors or idioms, and they can be seen as memo-tables or tabulations. We show that definitions and calculations benefit immensely from this additional structure.

Applied Swarm-based medicine: collecting decision trees for patterns of algorithms analysis.

PubMed

Panje, Cédric M; Glatzer, Markus; von Rappard, Joscha; Rothermundt, Christian; Hundsberger, Thomas; Zumstein, Valentin; Plasswilm, Ludwig; Putora, Paul Martin

2017-08-16

The objective consensus methodology has recently been applied in consensus finding in several studies on medical decision-making among clinical experts or guidelines. The main advantages of this method are an automated analysis and comparison of treatment algorithms of the participating centers which can be performed anonymously. Based on the experience from completed consensus analyses, the main steps for the successful implementation of the objective consensus methodology were identified and discussed among the main investigators. The following steps for the successful collection and conversion of decision trees were identified and defined in detail: problem definition, population selection, draft input collection, tree conversion, criteria adaptation, problem re-evaluation, results distribution and refinement, tree finalisation, and analysis. This manuscript provides information on the main steps for successful collection of decision trees and summarizes important aspects at each point of the analysis.

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.

The relationship between measures of tree vigor and pear thrips damage in sugar maple

Treesearch

Gretchen Smith; Christina M. Petersen; Roy Van Driesche; Charles Burnham

1991-01-01

In this presentation I will address three points associated with pear thrips damage and sugar maple. First, I will describe the impact of pear thrips on sugar maple in Massachusetts, in both the sugarbush and the natural forest stand, based on root starch assays that were completed this fall (1988). Secondly, I will discuss the relationship between tree health and...

A retrospective assessment of partial cutting to reduce spruce beetle-caused mortality in the southern Rocky Mountains

Treesearch

E. Matthew Hansen; Jose F. Negron; A. Steven Munson; John A. Anhold

2010-01-01

Tree susceptibility to bark beetle-caused mortality has been linked to stand characteristics such as basal area (BA) and average tree size, factors that can be manipulated through partial cutting. There is no experimental evidence, however, demonstrating the efficacy of partial cutting in spruce type. Such experiments are very difficult to complete because of the...

Where are the Black Walnut Tres in Iowa? 1996

Treesearch

J. Michael Vasievich; Neal P. Kingsley

1996-01-01

The third measurement of Iowa?s forests was completed in 1990 by the North Central Forest Experiment Station and the Iowa Department of Natural Resources (Brand and Walkowiak 1991). The inventory found that black walnut trees are common in the forests of Iowa. Two out of every hundred trees in the State are black walnuts. To accomplish the inventory, more than 12,769...

Where are the Black Walnut Trees in Ohio? 1996.

Treesearch

J. Michael Vasievich; Neal P. Kingsley

1996-01-01

Production of high-quality hardwoods is important in Ohio and black walnut ranks as one of the most valuable tree species in the State along with cherry, white and red oak, and ash. Ohio has more walnut growing stock volume than any other state, according to the most recently completed forest inventories in the East. The fourth and most recent measurement of Ohio?s...

Leaf water relations and sapflow in eastern cottonwood (Populus deltoides Bartr.) trees planted for phytoremediation of a groundwater pollutant

Treesearch

James M. Vose; Wayne T. Swank; Gregory J. Harvey; Barton D. Clinton; Christine Sobek

2000-01-01

Plants that remediate groundwater pollutants may offer a feasible alternative to the traditional and more expensive practices. Because its success depends on water use, this approach requires a complete understanding of species-specific transpiration patterns. The objectives of this study were (1) to quantify tree and stand-level transpiration in two age classes (whips...

Constructing Artifical Red-Cockaded Woodpecker Cavities

Treesearch

David H. Allen

1991-01-01

A complete guide is provided for excavating red-cockaded woodpecker (Picoides borealis) cavities. A hole 4 inches wide by 10 inches high by 6 inches deep is cut from a live pine(Pinusspp.) tree with a chainsaw, and a prefabricated cavity is inserted. Cavities can be excavated in pines of any age, but the diameter of the tree at the height of insertion must be greater...

Effects of forest management on soil carbon: results of some long-term resampling studies

Treesearch

D.W. Johnson; Jennifer D. Knoepp; Wayne T. Swank; J. Shan; L.A. Morris; David H. D.H. van Lear; P.R. Kapeluck

2002-01-01

The effects of harvest intensity (sawlog, SAW; whole tree, WTH; and complete tree, CTH) on biomass and soil carbon (C) were studied in four forested sites in the Southeastern United States: (mixed deciduous forests at Oak Ridge, TN and Coweeta, NC; Pinus taeda at Clemson, SC; and P. eliottii at Bradford, FL). In general, harvesting had no lasting...

Moisture content and specific gravity of the four major southern pines under the same age and site conditions

Treesearch

Mark D. Gibson; Charles W. McMillin; Eugene Shoulders

1986-01-01

Slash, loblolly, longleaf, and shortleaf pines in northern Louisiana were examined for differences in moisture content (MC) and basic specific gravity (SG) of wood and bark in the complete tree, root, stem, and branches and differences in diameter at breast height (dbh), total height, and taproot length of trees in even-aged plantations under identical site conditions...

Combinatorics of least-squares trees.

PubMed

Mihaescu, Radu; Pachter, Lior

2008-09-09

A recurring theme in the least-squares approach to phylogenetics has been the discovery of elegant combinatorial formulas for the least-squares estimates of edge lengths. These formulas have proved useful for the development of efficient algorithms, and have also been important for understanding connections among popular phylogeny algorithms. For example, the selection criterion of the neighbor-joining algorithm is now understood in terms of the combinatorial formulas of Pauplin for estimating tree length. We highlight a phylogenetically desirable property that weighted least-squares methods should satisfy, and provide a complete characterization of methods that satisfy the property. The necessary and sufficient condition is a multiplicative four-point condition that the variance matrix needs to satisfy. The proof is based on the observation that the Lagrange multipliers in the proof of the Gauss-Markov theorem are tree-additive. Our results generalize and complete previous work on ordinary least squares, balanced minimum evolution, and the taxon-weighted variance model. They also provide a time-optimal algorithm for computation.

Inferred Eccentricity and Period Distributions of Kepler Eclipsing Binaries

NASA Astrophysics Data System (ADS)

Prsa, Andrej; Matijevic, G.

2014-01-01

Determining the underlying eccentricity and orbital period distributions from an observed sample of eclipsing binary stars is not a trivial task. Shen and Turner (2008) have shown that the commonly used maximum likelihood estimators are biased to larger eccentricities and they do not describe the underlying distribution correctly; orbital periods suffer from a similar bias. Hogg, Myers and Bovy (2010) proposed a hierarchical probabilistic method for inferring the true eccentricity distribution of exoplanet orbits that uses the likelihood functions for individual star eccentricities. The authors show that proper inference outperforms the simple histogramming of the best-fit eccentricity values. We apply this method to the complete sample of eclipsing binary stars observed by the Kepler mission (Prsa et al. 2011) to derive the unbiased underlying eccentricity and orbital period distributions. These distributions can be used for the studies of multiple star formation, dynamical evolution, and they can serve as a drop-in replacement to prior, ad-hoc distributions used in the exoplanet field for determining false positive occurrence rates.

Binary Black Hole Mergers, Gravitational Waves, and LISA

NASA Technical Reports Server (NTRS)

Centrella, Joan; Baker, J.; Boggs, W.; Kelly, B.; McWilliams, S.; vanMeter, J.

2008-01-01

The final merger of comparable mass binary black holes is expected to be the strongest source of gravitational waves for LISA. Since these mergers take place in regions of extreme gravity, we need to solve Einstein's equations of general relativity on a computer in order to calculate these waveforms. For more than 30 years, scientists have tried to compute black hole mergers using the methods of numerical relativity. The resulting computer codes have been plagued by instabilities, causing them to crash well before the black holes in the binary could complete even a single orbit. Within the past few years, however, this situation has changed dramatically, with a series of remarkable breakthroughs. We will present the results of new simulations of black hole mergers with unequal masses and spins, focusing on the gravitational waves emitted and the accompanying astrophysical "kicks." The magnitude of these kicks has bearing on the production and growth of supermassive black holes during the epoch of structure formation, and on the retention of black holes in stellar clusters.

Binary Black Holes, Gravitational Waves, and Numerical Relativity

NASA Technical Reports Server (NTRS)

Centrella, John

2007-01-01

The final merger of two black holes is expected to be the strongest gravitational wave source for ground-based interferometers such as LIGO, VIRGO, and GE0600, as well as the space-based interferometer LISA. Observing these sources with gravitational wave detectors requires that we know the radiation waveforms they emit. Since these mergers take place in regions of extreme gravity, we need to solve Einstein's equations of general relativity on a computer in order to calculate these waveforms. For more than 30 years, scientists have tried to compute black hole mergers using the methods of numerical relativity. The resulting computer codes have been plagued by instabilities, causing them to crash well before the black holes in the binary could complete even a single orbit. Within the past few years, however, this situation has changed dramatically, with a series of remarkable breakthroughs. This talk will focus on new simulations that are revealing the dynamics and waveforms of binary black hole mergers, and their applications in gravitational wave detection, data analysis, and astrophysics.

Binary Black Holes: Mergers, Dynamics, and Waveforms

NASA Astrophysics Data System (ADS)

Centrella, Joan

2007-04-01

The final merger of two black holes is expected to be the strongest gravitational wave source for ground-based interferometers such as LIGO, VIRGO, and GEO600, as well as the space-based interferometer LISA. Observing these sources with gravitational wave detectors requires that we know the radiation waveforms they emit. Since these mergers take place in regions of extreme gravity, we need to solve Einstein's equations of general relativity on a computer in order to calculate these waveforms. For more than 30 years, scientists have tried to compute black hole mergers using the methods of numerical relativity. The resulting computer codes have been plagued by instabilities, causing them to crash well before the black holes in the binary could complete even a single orbit. Within the past few years, however, this situation has changed dramatically, with a series of remarkable breakthroughs. This talk will focus on new simulations that are revealing the dynamics and waveforms of binary black hole mergers, and their applications in gravitational wave detection, data analysis, and astrophysics.

X-Ray Probes of Cosmic Star-Formation History

NASA Technical Reports Server (NTRS)

Ghosh, Pranab; White, Nicholas E.

2001-01-01

In a previous paper we point out that the X-ray luminosity L(sub x) of a galaxy is driven by the evolution of its X-ray binary population and that the profile of L(sub x) with redshift can both serve as a diagnostic probe of the Star Formation Rate (SFR) profile and constrain evolutionary models for X-ray binaries. We update our previous work using a suite of more recently developed SFR profiles that span the currently plausible range. The first Chandra deep imaging results on L(sub x)-evolution are beginning to probe the SFR profile of bright spirals and the early results are consistent with predictions based on current SFR models. Using these new SFR profiles the resolution of the "birthrate problem" of lowmass X-ray binaries (LMXBs) and recycled, millisecond pulsars in terms of an evolving global SFR is more complete. We also discuss the possible impact of the variations in the SFR profile of individual galaxies.

Formation of Low-Mass X-Ray Binaries. II. Common Envelope Evolution of Primordial Binaries with Extreme Mass Ratios

NASA Astrophysics Data System (ADS)

Kalogera, Vassiliki; Webbink, Ronald F.

1998-01-01

We study the formation of low-mass X-ray binaries (LMXBs) through helium star supernovae in binary systems that have each emerged from a common envelope phase. LMXB progenitors must satisfy a large number of evolutionary and structural constraints, including survival through common envelope evolution, through the post-common envelope phase, where the precursor of the neutron star becomes a Wolf-Rayet star, and survival through the supernova event. Furthermore, the binaries that survive the explosion must reach interaction within a Hubble time and must satisfy stability criteria for mass transfer. These constraints, imposed under the assumption of a symmetric supernova explosion, prohibit the formation of short-period LMXBs transferring mass at sub-Eddington rates through any channel in which the intermediate progenitor of the neutron star is not completely degenerate. Barring accretion-induced collapse, the existence of such systems therefore requires that natal kicks be imparted to neutron stars. We use an analytical method to synthesize the distribution of nascent LMXBs over donor masses and orbital periods and evaluate their birthrate and systemic velocity dispersion. Within the limitations imposed by observational incompleteness and selection effects, and our neglect of secular evolution in the LMXB state, we compare our results with observations. However, our principal objective is to evaluate how basic model parameters (common envelope ejection efficiency, rms kick velocity, primordial mass ratio distribution) influence these results. We conclude that the characteristics of newborn LMXBs are primarily determined by age and stability constraints and the efficiency of magnetic braking and are largely independent of the primordial binary population and the evolutionary history of LMXB progenitors (except for extreme values of the average kick magnitude or of the common envelope ejection efficiency). Theoretical estimates of total LMXB birthrates are not credible, since they strongly depend on the observationally indeterminate frequency of primordial binaries with extreme mass ratios in long-period orbits.

Evaluating Fast Maximum Likelihood-Based Phylogenetic Programs Using Empirical Phylogenomic Data Sets

PubMed Central

Zhou, Xiaofan; Shen, Xing-Xing; Hittinger, Chris Todd

2018-01-01

Abstract The sizes of the data matrices assembled to resolve branches of the tree of life have increased dramatically, motivating the development of programs for fast, yet accurate, inference. For example, several different fast programs have been developed in the very popular maximum likelihood framework, including RAxML/ExaML, PhyML, IQ-TREE, and FastTree. Although these programs are widely used, a systematic evaluation and comparison of their performance using empirical genome-scale data matrices has so far been lacking. To address this question, we evaluated these four programs on 19 empirical phylogenomic data sets with hundreds to thousands of genes and up to 200 taxa with respect to likelihood maximization, tree topology, and computational speed. For single-gene tree inference, we found that the more exhaustive and slower strategies (ten searches per alignment) outperformed faster strategies (one tree search per alignment) using RAxML, PhyML, or IQ-TREE. Interestingly, single-gene trees inferred by the three programs yielded comparable coalescent-based species tree estimations. For concatenation-based species tree inference, IQ-TREE consistently achieved the best-observed likelihoods for all data sets, and RAxML/ExaML was a close second. In contrast, PhyML often failed to complete concatenation-based analyses, whereas FastTree was the fastest but generated lower likelihood values and more dissimilar tree topologies in both types of analyses. Finally, data matrix properties, such as the number of taxa and the strength of phylogenetic signal, sometimes substantially influenced the programs’ relative performance. Our results provide real-world gene and species tree phylogenetic inference benchmarks to inform the design and execution of large-scale phylogenomic data analyses. PMID:29177474

Customized binary and multi-level HfO2-x-based memristors tuned by oxidation conditions.

PubMed

He, Weifan; Sun, Huajun; Zhou, Yaxiong; Lu, Ke; Xue, Kanhao; Miao, Xiangshui

2017-08-30

The memristor is a promising candidate for the next generation non-volatile memory, especially based on HfO 2-x , given its compatibility with advanced CMOS technologies. Although various resistive transitions were reported independently, customized binary and multi-level memristors in unified HfO 2-x material have not been studied. Here we report Pt/HfO 2-x /Ti memristors with double memristive modes, forming-free and low operation voltage, which were tuned by oxidation conditions of HfO 2-x films. As O/Hf ratios of HfO 2-x films increase, the forming voltages, SET voltages, and R off /R on windows increase regularly while their resistive transitions undergo from gradually to sharply in I/V sweep. Two memristors with typical resistive transitions were studied to customize binary and multi-level memristive modes, respectively. For binary mode, high-speed switching with 10 3 pulses (10 ns) and retention test at 85 °C (>10 4 s) were achieved. For multi-level mode, the 12-levels stable resistance states were confirmed by ongoing multi-window switching (ranging from 10 ns to 1 μs and completing 10 cycles of each pulse). Our customized binary and multi-level HfO 2-x -based memristors show high-speed switching, multi-level storage and excellent stability, which can be separately applied to logic computing and neuromorphic computing, further suitable for in-memory computing chip when deposition atmosphere may be fine-tuned.

The binary fraction of planetary nebula central stars - III. the promise of VPHAS+

NASA Astrophysics Data System (ADS)

Barker, Helen; Zijlstra, Albert; De Marco, Orsola; Frew, David J.; Drew, Janet E.; Corradi, Romano L. M.; Eislöffel, Jochen; Parker, Quentin A.

2018-04-01

The majority of planetary nebulae (PNe) are not spherical, and current single-star models cannot adequately explain all the morphologies we observe. This has led to the Binary Hypothesis, which states that PNe are preferentially formed by binary systems. This hypothesis can be corroborated or disproved by comparing the estimated binary fraction of all PNe central stars (CS) to that of the supposed progenitor population. One way to quantify the rate of CS binarity is to detect near infrared excess indicative of a low-mass main-sequence companion. In this paper, a sample of known PNe within data release 2 of the ongoing VPHAS+ is investigated. We give details of the method used to calibrate VPHAS+ photometry, and present the expected colours of CS and main-sequence stars within the survey. Objects were scrutinized to remove PN mimics from our sample and identify true CS. Within our final sample of seven CS, six had previously either not been identified or confirmed. We detected an i-band excess indicative of a low-mass companion star in three CS, including one known binary, leading us to conclude that VPHAS+ provides the precise photometry required for the IR excess method presented here, and will likely improve as the survey completes and the calibration process finalized. Given the promising results from this trial sample, the entire VPHAS+ catalogue should be used to study PNe and extend the IR excess-tested CS sample.

A Coordinated X-Ray and Optical Campaign of the Nearby Massive Binary Sigma Orionis Aa. II; X-Ray Variability

NASA Technical Reports Server (NTRS)

Nichols, J.; Huenemoerder, D. P.; Corcoran, M. F.; Waldron, W.; Naze, Y; Pollock, A. M. T.; Moffat, A. F. J.; Lauer, J.; Shenar, T.; Russell, C. M. P.;

A Wide-field Survey for Transiting Hot Jupiters and Eclipsing 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.; Lambas, Diego G.; Colazo, Carlos; Stringer, Katelyn

2016-09-01

The past two decades have seen a significant advancement in the detection, classification, and understanding of exoplanets and binaries. This is due, in large part, to the increase in use of small-aperture telescopes (<20 cm) to survey large areas of the sky to milli-mag precision with rapid cadence. The vast majority of the planetary and binary systems studied to date consists of main-sequence or evolved objects, leading to a dearth of knowledge of properties at early times (<50 Myr). Only a dozen binaries and one candidate transiting Hot Jupiter are known among pre-main-sequence objects, yet these are the systems that can provide the best constraints on stellar formation and planetary migration models. The deficiency in the number of well characterized systems is driven by the inherent and aperiodic variability found in pre-main-sequence objects, which can mask and mimic eclipse signals. Hence, a dramatic increase in the number of young systems with high-quality observations is highly desirable to guide further theoretical developments. We have recently completed a photometric survey of three nearby (<150 pc) and young (<50 Myr) moving groups with a small-aperture telescope. While our survey reached the requisite photometric precision, the temporal coverage was insufficient to detect Hot Jupiters. Nevertheless, we discovered 346 pre-main-sequence binary candidates, including 74 high-priority objects for further study. This paper includes data taken at The McDonald Observatory of The University of Texas at Austin.

Goal-Function Tree Modeling for Systems Engineering and Fault Management

NASA Technical Reports Server (NTRS)

Johnson, Stephen B.; Breckenridge, Jonathan T.

2013-01-01

This paper describes a new representation that enables rigorous definition and decomposition of both nominal and off-nominal system goals and functions: the Goal-Function Tree (GFT). GFTs extend the concept and process of functional decomposition, utilizing state variables as a key mechanism to ensure physical and logical consistency and completeness of the decomposition of goals (requirements) and functions, and enabling full and complete traceabilitiy to the design. The GFT also provides for means to define and represent off-nominal goals and functions that are activated when the system's nominal goals are not met. The physical accuracy of the GFT, and its ability to represent both nominal and off-nominal goals enable the GFT to be used for various analyses of the system, including assessments of the completeness and traceability of system goals and functions, the coverage of fault management failure detections, and definition of system failure scenarios.

Complete Sequence and Comparative Analysis of the Chloroplast Genome of Coconut Palm (Cocos nucifera)

PubMed Central

Huang, Ya-Yi; Matzke, Antonius J. M.; Matzke, Marjori

2013-01-01

Coconut, a member of the palm family (Arecaceae), is one of the most economically important trees used by mankind. Despite its diverse morphology, coconut is recognized taxonomically as only a single species (Cocos nucifera L.). There are two major coconut varieties, tall and dwarf, the latter of which displays traits resulting from selection by humans. We report here the complete chloroplast (cp) genome of a dwarf coconut plant, and describe the gene content and organization, inverted repeat fluctuations, repeated sequence structure, and occurrence of RNA editing. Phylogenetic relationships of monocots were inferred based on 47 chloroplast protein-coding genes. Potential nodes for events of gene duplication and pseudogenization related to inverted repeat fluctuation were mapped onto the tree using parsimony criteria. We compare our findings with those from other palm species for which complete cp genome sequences are available. PMID:24023703

Complete sequence and comparative analysis of the chloroplast genome of coconut palm (Cocos nucifera).

PubMed

Huang, Ya-Yi; Matzke, Antonius J M; Matzke, Marjori

2013-01-01

Coconut, a member of the palm family (Arecaceae), is one of the most economically important trees used by mankind. Despite its diverse morphology, coconut is recognized taxonomically as only a single species (Cocos nucifera L.). There are two major coconut varieties, tall and dwarf, the latter of which displays traits resulting from selection by humans. We report here the complete chloroplast (cp) genome of a dwarf coconut plant, and describe the gene content and organization, inverted repeat fluctuations, repeated sequence structure, and occurrence of RNA editing. Phylogenetic relationships of monocots were inferred based on 47 chloroplast protein-coding genes. Potential nodes for events of gene duplication and pseudogenization related to inverted repeat fluctuation were mapped onto the tree using parsimony criteria. We compare our findings with those from other palm species for which complete cp genome sequences are available.

Multiphase, multicomponent phase behavior prediction

NASA Astrophysics Data System (ADS)

Dadmohammadi, Younas

Accurate prediction of phase behavior of fluid mixtures in the chemical industry is essential for designing and operating a multitude of processes. Reliable generalized predictions of phase equilibrium properties, such as pressure, temperature, and phase compositions offer an attractive alternative to costly and time consuming experimental measurements. The main purpose of this work was to assess the efficacy of recently generalized activity coefficient models based on binary experimental data to (a) predict binary and ternary vapor-liquid equilibrium systems, and (b) characterize liquid-liquid equilibrium systems. These studies were completed using a diverse binary VLE database consisting of 916 binary and 86 ternary systems involving 140 compounds belonging to 31 chemical classes. Specifically the following tasks were undertaken: First, a comprehensive assessment of the two common approaches (gamma-phi (gamma-ϕ) and phi-phi (ϕ-ϕ)) used for determining the phase behavior of vapor-liquid equilibrium systems is presented. Both the representation and predictive capabilities of these two approaches were examined, as delineated form internal and external consistency tests of 916 binary systems. For the purpose, the universal quasi-chemical (UNIQUAC) model and the Peng-Robinson (PR) equation of state (EOS) were used in this assessment. Second, the efficacy of recently developed generalized UNIQUAC and the nonrandom two-liquid (NRTL) for predicting multicomponent VLE systems were investigated. Third, the abilities of recently modified NRTL model (mNRTL2 and mNRTL1) to characterize liquid-liquid equilibria (LLE) phase conditions and attributes, including phase stability, miscibility, and consolute point coordinates, were assessed. The results of this work indicate that the ϕ-ϕ approach represents the binary VLE systems considered within three times the error of the gamma-ϕ approach. A similar trend was observed for the for the generalized model predictions using quantitative structure-property parameter generalizations (QSPR). For ternary systems, where all three constituent binary systems were available, the NRTL-QSPR, UNIQUAC-QSPR, and UNIFAC-6 models produce comparable accuracy. For systems where at least one constituent binary is missing, the UNIFAC-6 model produces larger errors than the QSPR generalized models. In general, the LLE characterization results indicate the accuracy of the modified models in reproducing the findings of the original NRTL model.

Phase-field-crystal study of solute trapping

NASA Astrophysics Data System (ADS)

Humadi, Harith; Hoyt, Jeffrey J.; Provatas, Nikolas

2013-02-01

In this study we have incorporated two time scales into the phase-field-crystal model of a binary alloy to explore different solute trapping properties as a function of crystal-melt interface velocity. With only diffusive dynamics, we demonstrate that the segregation coefficient, K as a function of velocity for a binary alloy is consistent with the model of Kaplan and Aziz where K approaches unity in the limit of infinite velocity. However, with the introduction of wavelike dynamics in both the density and concentration fields, the trapping follows the kinetics proposed by Sobolev [Phys. Lett. A10.1016/0375-9601(95)00084-G 199, 383 (1995)], where complete trapping occurs at a finite velocity.

Selecting Power-Efficient Signal Features for a Low-Power Fall Detector.

PubMed

Wang, Changhong; Redmond, Stephen J; Lu, Wei; Stevens, Michael C; Lord, Stephen R; Lovell, Nigel H

2017-11-01

Falls are a serious threat to the health of older people. A wearable fall detector can automatically detect the occurrence of a fall and alert a caregiver or an emergency response service so they may deliver immediate assistance, improving the chances of recovering from fall-related injuries. One constraint of such a wearable technology is its limited battery life. Thus, minimization of power consumption is an important design concern, all the while maintaining satisfactory accuracy of the fall detection algorithms implemented on the wearable device. This paper proposes an approach for selecting power-efficient signal features such that the minimum desirable fall detection accuracy is assured. Using data collected in simulated falls, simulated activities of daily living, and real free-living trials, all using young volunteers, the proposed approach selects four features from a set of ten commonly used features, providing a power saving of 75.3%, while limiting the error rate of a binary classification decision tree fall detection algorithm to 7.1%.Falls are a serious threat to the health of older people. A wearable fall detector can automatically detect the occurrence of a fall and alert a caregiver or an emergency response service so they may deliver immediate assistance, improving the chances of recovering from fall-related injuries. One constraint of such a wearable technology is its limited battery life. Thus, minimization of power consumption is an important design concern, all the while maintaining satisfactory accuracy of the fall detection algorithms implemented on the wearable device. This paper proposes an approach for selecting power-efficient signal features such that the minimum desirable fall detection accuracy is assured. Using data collected in simulated falls, simulated activities of daily living, and real free-living trials, all using young volunteers, the proposed approach selects four features from a set of ten commonly used features, providing a power saving of 75.3%, while limiting the error rate of a binary classification decision tree fall detection algorithm to 7.1%.

Explaining evolution via constrained persistent perfect phylogeny

PubMed Central

2014-01-01

Background The perfect phylogeny is an often used model in phylogenetics since it provides an efficient basic procedure for representing the evolution of genomic binary characters in several frameworks, such as for example in haplotype inference. The model, which is conceptually the simplest, is based on the infinite sites assumption, that is no character can mutate more than once in the whole tree. A main open problem regarding the model is finding generalizations that retain the computational tractability of the original model but are more flexible in modeling biological data when the infinite site assumption is violated because of e.g. back mutations. A special case of back mutations that has been considered in the study of the evolution of protein domains (where a domain is acquired and then lost) is persistency, that is the fact that a character is allowed to return back to the ancestral state. In this model characters can be gained and lost at most once. In this paper we consider the computational problem of explaining binary data by the Persistent Perfect Phylogeny model (referred as PPP) and for this purpose we investigate the problem of reconstructing an evolution where some constraints are imposed on the paths of the tree. Results We define a natural generalization of the PPP problem obtained by requiring that for some pairs (character, species), neither the species nor any of its ancestors can have the character. In other words, some characters cannot be persistent for some species. This new problem is called Constrained PPP (CPPP). Based on a graph formulation of the CPPP problem, we are able to provide a polynomial time solution for the CPPP problem for matrices whose conflict graph has no edges. Using this result, we develop a parameterized algorithm for solving the CPPP problem where the parameter is the number of characters. Conclusions A preliminary experimental analysis shows that the constrained persistent perfect phylogeny model allows to explain efficiently data that do not conform with the classical perfect phylogeny model. PMID:25572381

Searching for American chestnut: the estimation of rare species attributes in a national forest inventory

Treesearch

Francis A. Roesch; William H. McWilliams

2007-01-01

American chestnut, once a dominant tree species in forests of the Northeastern United States, has become extremely rare. It is so rare, in fact, that on completion of 80 percent of the plot measurements of the U.S. Department of Agriculture Forest Service's most recent inventory in Pennsylvania, only 33 American chestnut trees with a diameter at breast height !Y 1...

Searching for American chestnut: the estimation of rare species attributes in a national forest inventory

Treesearch

Francis A. Roesch; William H. McWilliams

2005-01-01

American chestnut, once a dominant tree species in forests of the Northeastern United States, has become extremely rare. It is so rare, in fact, that on completion of 80 percent of the plot measurements of the U.S. Department of Agriculture Forest Service's most recent inventory in Pennsylvania, only 33 American chestnut trees with a diameter at breast height 2: 1...

A phloem sandwich allowing attack and colonization by bark beetles (Coleoptera: Scolytidae) and associates

Treesearch

Andrew D. Taylor; Jane L. Hayes; John C. Moser

1992-01-01

Much of the life cycles of bark beetles and their associates are spent under the bark of the host tree and are impossible to observe under completely natural conditions. To observe the behavior and development of insects in the phloem layer, phloem sandwiches have been developed, in which a piece of bark and phloem is removed from a live tree and pressed against a...

Temporal Subtraction of Digital Breast Tomosynthesis Images for Improved Mass Detection

DTIC Science & Technology

2009-11-01

imaging using two distinct methods7-15: mathematically based models defined by geometric primitives and voxelized models derived from real human...trees to complete them. We also plan to add further detail by defining the Cooper’s ligaments using geometrical NURBS surfaces. Realistic...generated model for the coronary arterial tree based on multislice CT and morphometric data," Medical Imaging 2006: Physics of Medical Imaging 6142

Predicting Teacher Commitment: The Impact of School Climate and Social-Emotional Learning

ERIC Educational Resources Information Center

Collie, Rebecca J.; Shapka, Jennifer D.; Perry, Nancy E.

2011-01-01

The aim of this study was to investigate whether school climate and social-emotional learning impact teacher commitment. The sample included 664 public schoolteachers from British Columbia and Ontario in Canada. Participants completed an online questionnaire about teacher commitment, school climate, and social-emotional learning. Binary logistic…

Graduate Unemployment in South Africa: Social Inequality Reproduced

ERIC Educational Resources Information Center

Baldry, Kim

2016-01-01

In this study, I examine the influence of demographic and educational characteristics of South African graduates on their employment/unemployment status. A sample of 1175 respondents who graduated between 2006 and 2012 completed an online survey. Using binary logistic regression, the strongest determinants of unemployment were the graduates' race,…

The Role of Materialism on Social, Emotional and Behavioural Difficulties for British Adolescents

ERIC Educational Resources Information Center

Maras, Pam; Moon, Amy; Gupta, Taveeshi; Gridley, Nicole

2015-01-01

The relationship between materialism and social-emotional behavioural difficulties (SEBDs) was assessed by comparing a sample of adolescents receiving in-school behavioural support with adolescents not receiving any support. All participants completed the Youth Materialism Scale and the Strengths and Difficulties Questionnaire. Binary logistic…

DIRECT N-BODY MODELING OF THE OLD OPEN CLUSTER NGC 188: A DETAILED COMPARISON OF THEORETICAL AND OBSERVED BINARY STAR AND BLUE STRAGGLER POPULATIONS

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

Geller, Aaron M.; Hurley, Jarrod R.; Mathieu, Robert D., E-mail: a-geller@northwestern.edu, E-mail: mathieu@astro.wisc.edu, E-mail: jhurley@astro.swin.edu.au

2013-01-01

Following on from a recently completed radial-velocity survey of the old (7 Gyr) open cluster NGC 188 in which we studied in detail the solar-type hard binaries and blue stragglers of the cluster, here we investigate the dynamical evolution of NGC 188 through a sophisticated N-body model. Importantly, we employ the observed binary properties of the young (180 Myr) open cluster M35, where possible, to guide our choices for parameters of the initial binary population. We apply pre-main-sequence tidal circularization and a substantial increase to the main-sequence tidal circularization rate, both of which are necessary to match the observed tidalmore » circularization periods in the literature, including that of NGC 188. At 7 Gyr the main-sequence solar-type hard-binary population in the model matches that of NGC 188 in both binary frequency and distributions of orbital parameters. This agreement between the model and observations is in a large part due to the similarities between the NGC 188 and M35 solar-type binaries. Indeed, among the 7 Gyr main-sequence binaries in the model, only those with P {approx}> 1000 days begin to show potentially observable evidence for modifications by dynamical encounters, even after 7 Gyr of evolution within the star cluster. This emphasizes the importance of defining accurate initial conditions for star cluster models, which we propose is best accomplished through comparisons with observations of young open clusters like M35. Furthermore, this finding suggests that observations of the present-day binaries in even old open clusters can provide valuable information on their primordial binary populations. However, despite the model's success at matching the observed solar-type main-sequence population, the model underproduces blue stragglers and produces an overabundance of long-period circular main-sequence-white-dwarf binaries as compared with the true cluster. We explore several potential solutions to the paucity of blue stragglers and conclude that the model dramatically underproduces blue stragglers through mass-transfer processes. We suggest that common-envelope evolution may have been incorrectly imposed on the progenitors of the spurious long-period circular main-sequence-white-dwarf binaries, which perhaps instead should have gone through stable mass transfer to create blue stragglers, thereby bringing both the number and binary frequency of the blue straggler population in the model into agreement with the true blue stragglers in NGC 188. Thus, improvements in the physics of mass transfer and common-envelope evolution employed in the model may in fact solve both discrepancies with the observations. This project highlights the unique accessibility of open clusters to both comprehensive observational surveys and full-scale N-body simulations, both of which have only recently matured sufficiently to enable such a project, and underscores the importance of open clusters to the study of star cluster dynamics.« less

Reducing urban diffuse pollution and surface water flooding using retrofit street trees

NASA Astrophysics Data System (ADS)

Rothwell, James; Stringer, Pete; Causer, Katherine; Ryan, Matt; Mangan, Steve; Appleton, Ian; Savage, Mike

2016-04-01

Nature-based solutions for the management of urban stormwater have been growing in popularity, but there is a lack of empirical performance data for field-scale installations, especially in a UK context. To address this deficiency, a novel retrofit street tree demonstration project was commissioned in the City of Salford, near Manchester (UK). Three fifteen year-old London Plane trees were planted within a large roadside tree trench on an urban residential street. The DeepRoot Silvia Cell modular suspended pavement system was used to maximise soil volume, avoid compaction and support large tree growth. Road runoff is directed to the tree trench via AKO Slot Kerbs. Water is then distributed evenly throughout the whole system via a perforated pipe. Excess water is conveyed out of the system via an underdrain, which is subsequently connected to the sewer network. The tree trench is lined with an impermeable membrane. Access chambers are positioned on the inflow and outflow of the tree trench to facilitate hydrological and water quality monitoring. Installation was completed in autumn 2015 and monitoring will be conducted over a three year period. This paper will provide an overview of the installation process and present initial results on the pollutant removal performance and hydrological functioning of the system.

A Computational Model for Path Loss in Wireless Sensor Networks in Orchard Environments

PubMed Central

Anastassiu, Hristos T.; Vougioukas, Stavros; Fronimos, Theodoros; Regen, Christian; Petrou, Loukas; Zude, Manuela; Käthner, Jana

2014-01-01

A computational model for radio wave propagation through tree orchards is presented. Trees are modeled as collections of branches, geometrically approximated by cylinders, whose dimensions are determined on the basis of measurements in a cherry orchard. Tree canopies are modeled as dielectric spheres of appropriate size. A single row of trees was modeled by creating copies of a representative tree model positioned on top of a rectangular, lossy dielectric slab that simulated the ground. The complete scattering model, including soil and trees, enhanced by periodicity conditions corresponding to the array, was characterized via a commercial computational software tool for simulating the wave propagation by means of the Finite Element Method. The attenuation of the simulated signal was compared to measurements taken in the cherry orchard, using two ZigBee receiver-transmitter modules. Near the top of the tree canopies (at 3 m), the predicted attenuation was close to the measured one—just slightly underestimated. However, at 1.5 m the solver underestimated the measured attenuation significantly, especially when leaves were present and, as distances grew longer. This suggests that the effects of scattering from neighboring tree rows need to be incorporated into the model. However, complex geometries result in ill conditioned linear systems that affect the solver's convergence. PMID:24625738

Comparing species tree estimation with large anchored phylogenomic and small Sanger-sequenced molecular datasets: an empirical study on Malagasy pseudoxyrhophiine snakes.

PubMed

Ruane, Sara; Raxworthy, Christopher J; Lemmon, Alan R; Lemmon, Emily Moriarty; Burbrink, Frank T

2015-10-12

Using molecular data generated by high throughput next generation sequencing (NGS) platforms to infer phylogeny is becoming common as costs go down and the ability to capture loci from across the genome goes up. While there is a general consensus that greater numbers of independent loci should result in more robust phylogenetic estimates, few studies have compared phylogenies resulting from smaller datasets for commonly used genetic markers with the large datasets captured using NGS. Here, we determine how a 5-locus Sanger dataset compares with a 377-locus anchored genomics dataset for understanding the evolutionary history of the pseudoxyrhophiine snake radiation centered in Madagascar. The Pseudoxyrhophiinae comprise ~86 % of Madagascar's serpent diversity, yet they are poorly known with respect to ecology, behavior, and systematics. Using the 377-locus NGS dataset and the summary statistics species-tree methods STAR and MP-EST, we estimated a well-supported species tree that provides new insights concerning intergeneric relationships for the pseudoxyrhophiines. We also compared how these and other methods performed with respect to estimating tree topology using datasets with varying numbers of loci. Using Sanger sequencing and an anchored phylogenomics approach, we sequenced datasets comprised of 5 and 377 loci, respectively, for 23 pseudoxyrhophiine taxa. For each dataset, we estimated phylogenies using both gene-tree (concatenation) and species-tree (STAR, MP-EST) approaches. We determined the similarity of resulting tree topologies from the different datasets using Robinson-Foulds distances. In addition, we examined how subsets of these data performed compared to the complete Sanger and anchored datasets for phylogenetic accuracy using the same tree inference methodologies, as well as the program *BEAST to determine if a full coalescent model for species tree estimation could generate robust results with fewer loci compared to the summary statistics species tree approaches. We also examined the individual gene trees in comparison to the 377-locus species tree using the program MetaTree. Using the full anchored dataset under a variety of methods gave us the same, well-supported phylogeny for pseudoxyrhophiines. The African pseudoxyrhophiine Duberria is the sister taxon to the Malagasy pseudoxyrhophiines genera, providing evidence for a monophyletic radiation in Madagascar. In addition, within Madagascar, the two major clades inferred correspond largely to the aglyphous and opisthoglyphous genera, suggesting that feeding specializations associated with tooth venom delivery may have played a major role in the early diversification of this radiation. The comparison of tree topologies from the concatenated and species-tree methods using different datasets indicated the 5-locus dataset cannot beused to infer a correct phylogeny for the pseudoxyrhophiines under any method tested here and that summary statistics methods require 50 or more loci to consistently recover the species-tree inferred using the complete anchored dataset. However, as few as 15 loci may infer the correct topology when using the full coalescent species tree method *BEAST. MetaTree analyses of each gene tree from the Sanger and anchored datasets found that none of the individual gene trees matched the 377-locus species tree, and that no gene trees were identical with respect to topology. Our results suggest that ≥50 loci may be necessary to confidently infer phylogenies when using summaryspecies-tree methods, but that the coalescent-based method *BEAST consistently recovers the same topology using only 15 loci. These results reinforce that datasets with small numbers of markers may result in misleading topologies, and further, that the method of inference used to generate a phylogeny also has a major influence on the number of loci necessary to infer robust species trees.

Accreting Binary Populations in the Earlier Universe

NASA Technical Reports Server (NTRS)

Hornschemeier, Ann

2010-01-01

It is now understood that X-ray binaries dominate the hard X-ray emission from normal star-forming galaxies. Thanks to the deepest (2-4 Ms) Chandra surveys, such galaxies are now being studied in X-rays out to z approximates 4. Interesting X-ray stacking results (based on 30+ galaxies per redshift bin) suggest that the mean rest-frame 2-10 keV luminosity from z=3-4 Lyman break galaxies (LBGs), is comparable to the most powerful starburst galaxies in the local Universe. This result possibly indicates a similar production mechanism for accreting binaries over large cosmological timescales. To understand and constrain better the production of X-ray binaries in high-redshift LBGs, we have utilized XMM-Newton observations of a small sample of z approximates 0.1 GALEX-selected Ultraviolet-Luminous Galaxies (UVLGs); local analogs to high-redshift LBGs. Our observations enable us to study the X-ray emission from LBG-like galaxies on an individual basis, thus allowing us to constrain object-to-object variances in this population. We supplement these results with X-ray stacking constraints using the new 3.2 Ms Chandra Deep Field-South (completed spring 2010) and LBG candidates selected from HST, Swift UVOT, and ground-based data. These measurements provide new X-ray constraints that sample well the entire z=0-4 baseline

Two W-subtype contact binaries: GQ Boo and V1367 Tau

NASA Astrophysics Data System (ADS)

Zhang, Jia; Qian, Sheng-Bang; Han, Zhong-Tao; Wu, Yue

2017-04-01

Two contact binaries, GQ Boo and V1367 Tau, were observed and analysed with a new method to obtain the absolute parameters. The light-curve analysis shows that both of them are obvious W-subtype contact binaries, with much more massive but apparently cooler components (M2/M1 ≃ 2 and 4, T2/T1 ≃ 0.95 and 0.94). The orbital periods were studied using the O-C diagrams, and it is thought that the minima timings were heavily affected by the longstanding magnetic activities on the star surface, so the minima timings cannot represent the real period changes. The mass-radius relationships were proposed by the light-curve analysis alone, which is equivalent to the mean density. The density and temperature can determine the other absolute parameters in most of the time. With the almost complete star parameter space provided by PARSEC, approximate masses and radii were obtained (0.52 ± 0.08 M⊙ and 1.01 ± 0.15 M⊙ for GQ Boo, and 0.22 ± 0.01 M⊙ and 0.92 ± 0.06 M⊙ for V1367 Tau). The mass-radius relationship is a neglected useful tool to calculate the mass and radius, especially for the detached binaries.

Using White Dwarf Companions of Blue Stragglers to Constrain Mass Transfer Physics

NASA Astrophysics Data System (ADS)

Gosnell, Natalie M.; Leiner, Emily; Geller, Aaron M.; Knigge, Christian; Mathieu, Robert D.; Sills, Alison; Leigh, Nathan

2018-06-01

Complete membership studies of old open clusters reveal that 25% of the evolved stars follow pathways in stellar evolution that are impacted by binary evolution. Recent studies show that the majority of blue straggler stars, traditionally defined to be stars brighter and bluer than the corresponding main sequence turnoff, are formed through mass transfer from a giant star onto a main sequence companion, resulting in a white dwarf in a binary system with a blue straggler. We will present constraints on the histories and mass transfer efficiencies for two blue straggler-white dwarf binaries in open cluster NGC 188. The constraints are a result of measuring white dwarf cooling temperatures and surface gravities with HST COS far-ultraviolet spectroscopy. This information sets both the timeline for mass transfer and the stellar masses in the pre-mass transfer binary, allowing us to constrain aspects of the mass transfer physics. One system is formed through Case C mass transfer, leaving a CO-core white dwarf, and provides an interesting test case for mass transfer from an asymptotic giant branch star in an eccentric system. The other system formed through Case B mass transfer, leaving a He-core white dwarf, and challenges our current understanding of the expected regimes for stable mass transfer from red giant branch stars.

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

Strauss, Steve; Shevchenko, Olga; Ma, Caiping

The overall goal of this project was to develop and validate sterility systems in poplar with the ultimate goal of fulfilling the basic requirements for commercial use. For this, sterility must be complete and stable over multiple growing seasons, cause no detrimental effects on vegetative growth, and successful transformation events must be identifiable via molecular tests when trees are still juvenile. Because of the inherent difficulties in achieving and demonstrating complete sterility in trees, our approach was to study alternate sterility systems in Arabidopsis and/or early-flowering tree systems. The public benefit from this work is the capacity for containment ofmore » genes or exotic forms of trees so they can be of benefit for industry for production of wood, energy, and renewable products, while having minimal impact on wild populations of trees. We tested three methods for engineering sterility: dominant negative mutant (DNM) proteins, floral tissue ablation, and RNA interference (RNAi) to suppress the expression of several floral regulatory genes. The ultimate goal of this work was to produce a number of transgenic poplars that could be outplanted to enable future assessments of the effectiveness of these transgenic sterility methods. Our attempts to produce ablation constructs that did not interfere with tree health were partially successful. Using the poplar LEAFY gene promoter and the barnase/barstar system, we were able to regenerate plants that grew well in the greenhouse, but they showed poor health in the field. Four of seven DNM genes tested were considered promising enough, based on results in Arabidopsis, to produce transgenic poplars. Single, double, and triple RNAi genes were produced and transformed into poplar. Over all, we produced 1,964 PCR-confirmed transgenic events with 19 different kinds of sterility genes and several kinds of control genes. We propagated 5,640, 6,820, and 7,055 trees for each of three test poplar genotypes, and field plantings were begun in Spring of 2003 and will be finished in Spring 2007. Continued field studies and monitoring will be required to establish if any of the approaches we have taken will prove to be safe for tree health, stable, and provide reliable containment.« less

Automated Mobile System for Accurate Outdoor Tree Crop Enumeration Using an Uncalibrated Camera.

PubMed

Nguyen, Thuy Tuong; Slaughter, David C; Hanson, Bradley D; Barber, Andrew; Freitas, Amy; Robles, Daniel; Whelan, Erin

2015-07-28

This paper demonstrates an automated computer vision system for outdoor tree crop enumeration in a seedling nursery. The complete system incorporates both hardware components (including an embedded microcontroller, an odometry encoder, and an uncalibrated digital color camera) and software algorithms (including microcontroller algorithms and the proposed algorithm for tree crop enumeration) required to obtain robust performance in a natural outdoor environment. The enumeration system uses a three-step image analysis process based upon: (1) an orthographic plant projection method integrating a perspective transform with automatic parameter estimation; (2) a plant counting method based on projection histograms; and (3) a double-counting avoidance method based on a homography transform. Experimental results demonstrate the ability to count large numbers of plants automatically with no human effort. Results show that, for tree seedlings having a height up to 40 cm and a within-row tree spacing of approximately 10 cm, the algorithms successfully estimated the number of plants with an average accuracy of 95.2% for trees within a single image and 98% for counting of the whole plant population in a large sequence of images.

Automated Mobile System for Accurate Outdoor Tree Crop Enumeration Using an Uncalibrated Camera

PubMed Central

Nguyen, Thuy Tuong; Slaughter, David C.; Hanson, Bradley D.; Barber, Andrew; Freitas, Amy; Robles, Daniel; Whelan, Erin

2015-01-01

This paper demonstrates an automated computer vision system for outdoor tree crop enumeration in a seedling nursery. The complete system incorporates both hardware components (including an embedded microcontroller, an odometry encoder, and an uncalibrated digital color camera) and software algorithms (including microcontroller algorithms and the proposed algorithm for tree crop enumeration) required to obtain robust performance in a natural outdoor environment. The enumeration system uses a three-step image analysis process based upon: (1) an orthographic plant projection method integrating a perspective transform with automatic parameter estimation; (2) a plant counting method based on projection histograms; and (3) a double-counting avoidance method based on a homography transform. Experimental results demonstrate the ability to count large numbers of plants automatically with no human effort. Results show that, for tree seedlings having a height up to 40 cm and a within-row tree spacing of approximately 10 cm, the algorithms successfully estimated the number of plants with an average accuracy of 95.2% for trees within a single image and 98% for counting of the whole plant population in a large sequence of images. PMID:26225982

Fels-Rand: an Xlisp-Stat program for the comparative analysis of data under phylogenetic uncertainty.

PubMed

Blomberg, S

2000-11-01

Currently available programs for the comparative analysis of phylogenetic data do not perform optimally when the phylogeny is not completely specified (i.e. the phylogeny contains polytomies). Recent literature suggests that a better way to analyse the data would be to create random trees from the known phylogeny that are fully-resolved but consistent with the known tree. A computer program is presented, Fels-Rand, that performs such analyses. A randomisation procedure is used to generate trees that are fully resolved but whose structure is consistent with the original tree. Statistics are then calculated on a large number of these randomly-generated trees. Fels-Rand uses the object-oriented features of Xlisp-Stat to manipulate internal tree representations. Xlisp-Stat's dynamic graphing features are used to provide heuristic tools to aid in analysis, particularly outlier analysis. The usefulness of Xlisp-Stat as a system for phylogenetic computation is discussed. Available from the author or at http://www.uq.edu.au/~ansblomb/Fels-Rand.sit.hqx. Xlisp-Stat is available from http://stat.umn.edu/~luke/xls/xlsinfo/xlsinfo.html. s.blomberg@abdn.ac.uk

Hydraulic Function in Australian Tree Species during Drought-Induced Mortality

NASA Astrophysics Data System (ADS)

Tissue, D.; Maier, C.; Creek, D.; Choat, B.

2016-12-01

Drought induced tree mortality and decline are key issues facing forest ecology and management. Here, we primarily investigated the hydraulic limitations underpinning drought-induced mortality in three Australian tree species. Using field-based large rainout shelters, three angiosperm species (Casuarina cunninghamiana, Eucalyptus sideroxylon, Eucalyptus tereticornis) were subjected to two successive drought and recovery cycles, prior to a subsequent long and extreme drought to mortality; total duration of experiment was 2.5 years. Leaf gas exchange, leaf and stem hydraulics, and carbon reserves were monitored during the experiment. Trees died as a result of failure in the hydraulic transport system, primarily related to water stress induced embolism. Stomatal closure occurred prior to the induction of significant embolism in the stem xylem of all species. Nonetheless, trees suffered a rapid decline in xylem water potential and increase in embolism during the severe drought treatment. Trees died at water potentials causing greater than 90% loss of hydraulic conductivity in the stem, providing support for the theory that lethal water potential is correlated with complete loss of hydraulic function in the stem xylem of angiosperms.

Galaxy simulations: Kinematics and mock observations

NASA Astrophysics Data System (ADS)

Moody, Christopher E.

2013-08-01

There are six topics to my thesis, which are: (1) slow rotator production in varied simulation schemes and kinematically decoupled cores and twists in those simulations, (2) the change in number of clumps in radiation pressure and no-radiation pressure simulations, (3) Sunrise experiments and failures including UVJ color-color dust experiments and UVbeta slopes, (4) the Sunrise image pipeline and algorithms. Cosmological simulations of have typically produced too many stars at early times. We find that the additional radiation pressure (RP) feedback suppresses star formation globally by a factor of ~ 3. Despite this reduction, the simulation still overproduces stars by a factor of ~ 2 with respect to the predictions provided by abundance matching methods. In simulations with RP the number of clumps falls dramatically. However, only clumps with masses Mclump/Mdisk ≤ 8% are impacted by the inclusion of RP, and clump counts above this range are comparable. Above this mass, the difference between and RP and no-RP contrast ratios diminishes. If we restrict our selection to galaxies hosting at least a single clump above this mass range then clump numbers, contrast ratios, survival fractions and total clump masses show little discrepancy between RP and no-RP simulations. By creating mock Hubble Space Telescope observations we find that the number of clumps is slightly reduced in simulations with RP. We demonstrate that clumps found in any single gas, stellar, or mock observation image are not necessarily clumps found in another map, and that there are few clumps common to multiple maps. New kinematic observations from ATLAS3D have highlighted the need to understand the evolutionary mechanism leading to a spectrum of fast-rotator and slow-rotators in early-type galaxies. We address the formation of slow and fast rotators through a series of controlled, comprehensive hydrodynamic simulations sampling idealized galaxy merger formation scenarios constructed from model spiral galaxies. We recreate minor and major binary mergers, binary merger trees with multiple progenitors, and multiple sequential mergers. Within each of these categories of formation history, we correlate progenitor gas fraction, mass ratio, orbital pericenter, orbital ellipticity, spin, and kinematically decoupled cores with remnant kinematic properties. We find that binary mergers nearly always form fast rotators, but slow rotators can be formed from zero initial angular momentum configurations and gas-poor mergers. Remnants of binary merger trees are triaxial slow rotators. Sequential mergers form round slow rotators that most resemble the ATLAS3D rotators. We investigate the failure of ART and Sunrise simulation to reproduce the observed distribution of galaxies in the UVJ color-color diagram. No simulated galaxies achieve a color with V-J >1.0 while still being in the blue sequence. I systematically study the underlying sub grid models present in Sunrise to diagnose the source of the discrepancy. The experiments were largely unsuccessful in directly isolating the root of the J-band excess attenuation; however, they are instructive and can guide the intuition in terms of understanding the interplay of stellar emission and dust. These experiments were aimed at understanding the role of the underlying sub grid dust and radiation models, varying the dust geometry, and performing numerical studies of the radiation transfer calculation. Finally, I detail the data pipeline responsible for the creation of galaxy mock observations. The pipeline can be broken into the ART simulation raw data, the dark matter merger tree backbone, the format translation using yt, simulation the radiation transfer in Sunrise, and post-processed image treatments resulting. At every step, I detail the execution of the algorithms, the format of the data, and useful scripts for straightforward analysis.

The future of large old trees in urban landscapes.

PubMed

Le Roux, Darren S; Ikin, Karen; Lindenmayer, David B; Manning, Adrian D; Gibbons, Philip

2014-01-01

Large old trees are disproportionate providers of structural elements (e.g. hollows, coarse woody debris), which are crucial habitat resources for many species. The decline of large old trees in modified landscapes is of global conservation concern. Once large old trees are removed, they are difficult to replace in the short term due to typically prolonged time periods needed for trees to mature (i.e. centuries). Few studies have investigated the decline of large old trees in urban landscapes. Using a simulation model, we predicted the future availability of native hollow-bearing trees (a surrogate for large old trees) in an expanding city in southeastern Australia. In urban greenspace, we predicted that the number of hollow-bearing trees is likely to decline by 87% over 300 years under existing management practices. Under a worst case scenario, hollow-bearing trees may be completely lost within 115 years. Conversely, we predicted that the number of hollow-bearing trees will likely remain stable in semi-natural nature reserves. Sensitivity analysis revealed that the number of hollow-bearing trees perpetuated in urban greenspace over the long term is most sensitive to the: (1) maximum standing life of trees; (2) number of regenerating seedlings ha(-1); and (3) rate of hollow formation. We tested the efficacy of alternative urban management strategies and found that the only way to arrest the decline of large old trees requires a collective management strategy that ensures: (1) trees remain standing for at least 40% longer than currently tolerated lifespans; (2) the number of seedlings established is increased by at least 60%; and (3) the formation of habitat structures provided by large old trees is accelerated by at least 30% (e.g. artificial structures) to compensate for short term deficits in habitat resources. Immediate implementation of these recommendations is needed to avert long term risk to urban biodiversity.

The Future of Large Old Trees in Urban Landscapes

PubMed Central

Le Roux, Darren S.; Ikin, Karen; Lindenmayer, David B.; Manning, Adrian D.; Gibbons, Philip

2014-01-01

Large old trees are disproportionate providers of structural elements (e.g. hollows, coarse woody debris), which are crucial habitat resources for many species. The decline of large old trees in modified landscapes is of global conservation concern. Once large old trees are removed, they are difficult to replace in the short term due to typically prolonged time periods needed for trees to mature (i.e. centuries). Few studies have investigated the decline of large old trees in urban landscapes. Using a simulation model, we predicted the future availability of native hollow-bearing trees (a surrogate for large old trees) in an expanding city in southeastern Australia. In urban greenspace, we predicted that the number of hollow-bearing trees is likely to decline by 87% over 300 years under existing management practices. Under a worst case scenario, hollow-bearing trees may be completely lost within 115 years. Conversely, we predicted that the number of hollow-bearing trees will likely remain stable in semi-natural nature reserves. Sensitivity analysis revealed that the number of hollow-bearing trees perpetuated in urban greenspace over the long term is most sensitive to the: (1) maximum standing life of trees; (2) number of regenerating seedlings ha−1; and (3) rate of hollow formation. We tested the efficacy of alternative urban management strategies and found that the only way to arrest the decline of large old trees requires a collective management strategy that ensures: (1) trees remain standing for at least 40% longer than currently tolerated lifespans; (2) the number of seedlings established is increased by at least 60%; and (3) the formation of habitat structures provided by large old trees is accelerated by at least 30% (e.g. artificial structures) to compensate for short term deficits in habitat resources. Immediate implementation of these recommendations is needed to avert long term risk to urban biodiversity. PMID:24941258

Implementing Connected Component Labeling as a User Defined Operator for SciDB

NASA Technical Reports Server (NTRS)

Oloso, Amidu; Kuo, Kwo-Sen; Clune, Thomas; Brown, Paul; Poliakov, Alex; Yu, Hongfeng

2016-01-01

We have implemented a flexible User Defined Operator (UDO) for labeling connected components of a binary mask expressed as an array in SciDB, a parallel distributed database management system based on the array data model. This UDO is able to process very large multidimensional arrays by exploiting SciDB's memory management mechanism that efficiently manipulates arrays whose memory requirements far exceed available physical memory. The UDO takes as primary inputs a binary mask array and a binary stencil array that specifies the connectivity of a given cell to its neighbors. The UDO returns an array of the same shape as the input mask array with each foreground cell containing the label of the component it belongs to. By default, dimensions are treated as non-periodic, but the UDO also accepts optional input parameters to specify periodicity in any of the array dimensions. The UDO requires four stages to completely label connected components. In the first stage, labels are computed for each subarray or chunk of the mask array in parallel across SciDB instances using the weighted quick union (WQU) with half-path compression algorithm. In the second stage, labels around chunk boundaries from the first stage are stored in a temporary SciDB array that is then replicated across all SciDB instances. Equivalences are resolved by again applying the WQU algorithm to these boundary labels. In the third stage, relabeling is done for each chunk using the resolved equivalences. In the fourth stage, the resolved labels, which so far are "flattened" coordinates of the original binary mask array, are renamed with sequential integers for legibility. The UDO is demonstrated on a 3-D mask of O(1011) elements, with O(108) foreground cells and O(106) connected components. The operator completes in 19 minutes using 84 SciDB instances.

Cesium sorption reversibility and kinetics on illite, montmorillonite, and kaolinite

DOE PAGES

Durrant, Chad B.; Begg, James D.; Kersting, Annie B.; ...

2017-08-17

Understanding sorption and desorption processes is essential to predicting the mobility of radionuclides in the environment. In this study, we investigate adsorption/desorption of cesium in both binary (Cs + one mineral) and ternary (Cs + two minerals) experiments to study component additivity and sorption reversibility over long time periods (500 days). Binary Cs sorption experiments were performed with illite, montmorillonite, and kaolinite in a 5 mM NaCl/0.7 mM NaHCO3 solution (pH 8) and Cs concentration range of 10 –3 to 10 –11 M. The binary sorption experiments were followed by batch desorption experiments. The sorption behavior was modeled with themore » FIT4FD code and the results used to predict desorption behavior. Sorption to montmorillonite and kaolinite was linear over the entire concentration range but sorption to illite was non-linear, indicating the presence of multiple sorption sites. Based on the 14 day batch desorption data, cesium sorption appeared irreversible at high surface loadings in the case of illite but reversible at all concentrations for montmorillonite and kaolinite. Additionally, a novel experimental approach, using a dialysis membrane, was adopted in the ternary experiments, allowing investigation of the effect of a second mineral on Cs desorption from the original mineral. Cs was first sorbed to illite, montmorillonite or kaolinite, then a 3.5–5 kDalton Float-A-Lyzer® dialysis bag with 0.3 g of illite was introduced to each experiment inducing desorption. Nearly complete Cs desorption from kaolinite and montmorillonite was observed over the experiment, consistent with our equilibrium model, indicating complete Cs desorption from these minerals. Results from the long-term ternary experiments show significantly greater Cs desorption compared to the binary desorption experiments. Approximately ~ 45% of Cs desorbed from illite. However, our equilibrium model predicted ~ 65% desorption. Importantly, the data imply that in some cases, slow desorption kinetics rather than permanent fixation may play an important role in apparent irreversible Cs sorption.« less

Vegetation Dynamics of a Permanent Pasture Plot in Puerto Rico

Treesearch

R. Myster

2003-01-01

I set up a 250 m2 plot and found after five years that (1) grass dominated by ferns and woody species was gradually increasing over time; (2) woody genera (Syzygium, Calophyllum, and Clidemia) common here have not been found elsewhere on the island and ‘‘successional’’ trees, such as Cecropia sp. and Shefflera sp., were completely absent; (3) smaller, earlier trees...

Bilayer segmentation of webcam videos using tree-based classifiers.

PubMed

Yin, Pei; Criminisi, Antonio; Winn, John; Essa, Irfan

2011-01-01

This paper presents an automatic segmentation algorithm for video frames captured by a (monocular) webcam that closely approximates depth segmentation from a stereo camera. The frames are segmented into foreground and background layers that comprise a subject (participant) and other objects and individuals. The algorithm produces correct segmentations even in the presence of large background motion with a nearly stationary foreground. This research makes three key contributions: First, we introduce a novel motion representation, referred to as "motons," inspired by research in object recognition. Second, we propose estimating the segmentation likelihood from the spatial context of motion. The estimation is efficiently learned by random forests. Third, we introduce a general taxonomy of tree-based classifiers that facilitates both theoretical and experimental comparisons of several known classification algorithms and generates new ones. In our bilayer segmentation algorithm, diverse visual cues such as motion, motion context, color, contrast, and spatial priors are fused by means of a conditional random field (CRF) model. Segmentation is then achieved by binary min-cut. Experiments on many sequences of our videochat application demonstrate that our algorithm, which requires no initialization, is effective in a variety of scenes, and the segmentation results are comparable to those obtained by stereo systems.

Flood predictions using the parallel version of distributed numerical physical rainfall-runoff model TOPKAPI

NASA Astrophysics Data System (ADS)

Boyko, Oleksiy; Zheleznyak, Mark

2015-04-01

The original numerical code TOPKAPI-IMMS of the distributed rainfall-runoff model TOPKAPI ( Todini et al, 1996-2014) is developed and implemented in Ukraine. The parallel version of the code has been developed recently to be used on multiprocessors systems - multicore/processors PC and clusters. Algorithm is based on binary-tree decomposition of the watershed for the balancing of the amount of computation for all processors/cores. Message passing interface (MPI) protocol is used as a parallel computing framework. The numerical efficiency of the parallelization algorithms is demonstrated for the case studies for the flood predictions of the mountain watersheds of the Ukrainian Carpathian regions. The modeling results is compared with the predictions based on the lumped parameters models.

A tree branch instead of a ligature: an unusual accidental hanging.

PubMed

Vadysinghe, Amal Nishantha; Sivasubramanium, Murugupillai; Jayasooriya, Rankothge Pemasiri

2017-12-01

A unique case of accidental hanging due to compression of the neck of an adult by the branches of a coffee tree is reported. The decedent was a 42-year-old male who was found dead in a semi prone position on a slope. His neck was lodged in a wedge formed by two branches of a coffee tree, with his legs angled downwards on the slope. Autopsy revealed two friction abrasions located horizontally on either side of the front of the neck, just above the larynx. The findings were compatible with compression of the neck by the branches of the tree, with the body weight of the decedent contributing to compression. Subsequent complete autopsy examination confirmed the cause of death as hanging. Following an inquest the death was ruled to be accidental.

Field-based evaluations of sampling techniques to support long-term monitoring of riparian ecosystems along wadeable streams on the Colorado Plateau

USGS Publications Warehouse

Scott, Michael L.; Reynolds, Elizabeth W.

2007-01-01

Compared to 5-m by 20-m tree quadrats, belt transects were shown to provide similar estimates of stand structure (stem density and stand basal area) in less than 30 percent of the time. Further, for the streams sampled, there were no statistically significant differences in stem density and basal area estimates between 10-m and 20-m belt transects and the smaller belts took approximately half the time to sample. There was, however, high variance associated with estimates of stand structure for infrequently occurring stems, such as large, relict or legacy riparian trees. Legacy riparian trees occurred in limited numbers at all sites sampled. A reachscale population census of these trees indicated that the 10-m belt transects tended to underestimate both stem density and basal area for these riparian forest elements and that a complete reach-scale census of legacy trees averaged less than one hour per site.

Lifemap: Exploring the Entire Tree of Life.

PubMed

de Vienne, Damien M

2016-12-01

The Tree of Life (ToL) is meant to be a unique representation of the evolutionary relationships between all species on earth. Huge efforts are made to assemble such a large tree, helped by the decrease of sequencing costs and improved methods to reconstruct and combine phylogenies, but no tool exists today to explore the ToL in its entirety in a satisfying manner. By combining methods used in modern cartography, such as OpenStreetMap, with a new way of representing tree-like structures, I created Lifemap, a tool allowing the exploration of a complete representation of the ToL (between 800,000 and 2.2 million species depending on the data source) in a zoomable interface. A server version of Lifemap also allows users to visualize their own trees. This should help researchers in ecology and evolutionary biology in their everyday work, but may also permit the diffusion to a broader audience of our current knowledge of the evolutionary relationships linking all organisms.

A multilocus perspective on the speciation history of a North American aridland toad (Anaxyrus punctatus).

PubMed

Bryson, Robert W; Jaeger, Jef R; Lemos-Espinal, Julio A; Lazcano, David

2012-09-01

Interpretations of phylogeographic patterns can change when analyses shift from single gene-tree to multilocus coalescent analyses. Using multilocus coalescent approaches, a species tree and divergence times can be estimated from a set of gene trees while accounting for gene-tree stochasticity. We utilized the conceptual strengths of a multilocus coalescent approach coupled with complete range-wide sampling to examine the speciation history of a broadly distributed, North American warm-desert toad, Anaxyrus punctatus. Phylogenetic analyses provided strong support for three major lineages within A. punctatus. Each lineage broadly corresponded to one of three desert regions. Early speciation in A. punctatus appeared linked to late Miocene-Pliocene development of the Baja California peninsula. This event was likely followed by a Pleistocene divergence associated with the separation of the Chihuahuan and Sonoran Deserts. Our multilocus coalescent-based reconstruction provides an informative contrast to previous single gene-tree estimates of the evolutionary history of A. punctatus. Copyright © 2012 Elsevier Inc. All rights reserved.

Time-Resolved Spectroscopy of Active Binary Stars

NASA Technical Reports Server (NTRS)

Brown, Alexander

2000-01-01

This NASA grant covered EUVE observing and data analysis programs during EUVE Cycle 5 GO observing. The research involved a single Guest Observer project 97-EUVE-061 "Time-Resolved Spectroscopy of Active Binary Stars". The grant provided funding that covered 1.25 months of the PI's salary. The activities undertaken included observation planning and data analysis (both temporal and spectral). This project was awarded 910 ksec of observing time to study seven active binary stars, all but one of which were actually observed. Lambda-And was observed on 1997 Jul 30 - Aug 3 and Aug 7-14 for a total of 297 ksec; these observations showed two large complex flares that were analyzed by Osten & Brown (1999). AR Psc, observed for 350 ksec on 1997 Aug 27 - Sep 13, showed only relatively small flares that were also discussed by Osten & Brown (1999). EUVE observations of El Eri were obtained on 1994 August 24-28, simultaneous with ASCA X-ray spectra. Four flares were detected by EUVE with one of these also observed simultaneously, by ASCA. The other three EUVE observations were of the stars BY Dra (1997 Sep 22-28), V478 Lyr (1998 May 18-27), and sigma Gem (1998 Dec 10-22). The first two stars showed a few small flares. The sigma Gem data shows a beautiful complete flare with a factor of ten peak brightness compared to quiescence. The flare rise and almost all the decay phase are observed. Unfortunately no observations in other spectral regions were obtained for these stars. Analysis of the lambda-And and AR Psc observations is complete and the results were published in Osten & Brown (1999). Analysis of the BY Dra, V478 Lyr and sigma Gem EUVE data is complete and will be published in Osten (2000, in prep.). The El Eri EUV analysis is also completed and the simultaneous EUV/X-ray study will be published in Osten et al. (2000, in prep.). Both these latter papers will be submitted in summer 2000. All these results will form part of Rachel Osten's PhD thesis.

Utility of galaxy catalogs for following up gravitational waves from binary neutron star mergers with wide-field telescopes

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

Hanna, Chad; Mandel, Ilya; Vousden, Will, E-mail: chad.hanna@ligo.org, E-mail: imandel@star.sr.bham.ac.uk, E-mail: will@star.sr.bham.ac.uk

The first detections of gravitational waves from binary neutron star mergers with advanced LIGO and Virgo observatories are anticipated in the next five years. These detections could pave the way for multi-messenger gravitational-wave (GW) and electromagnetic (EM) astronomy if GW triggers are successfully followed up with targeted EM observations. However, GW sky localization is relatively poor, with expected localization areas of ∼10-100 deg{sup 2}; this presents a challenge for following up GW signals from compact binary mergers. Even for wide-field instruments, tens or hundreds of pointings may be required. Prioritizing pointings based on the relative probability of successful imaging ismore » important since it may not be possible to tile the entire gravitational-wave localization region in a timely fashion. Galaxy catalogs were effective at narrowing down regions of the sky to search in initial attempts at joint GW/EM observations. The relatively limited range of initial GW instruments meant that few galaxies were present per pointing and galaxy catalogs were complete within the search volume. The next generation of GW detectors will have a 10-fold increase in range thereby increasing the expected number of galaxies per unit solid angle by a factor of ∼1000. As an additional complication, catalogs will be highly incomplete. Nevertheless, galaxy catalogs can still play an important role in prioritizing pointings for the next era of GW searches. We show how to quantify the advantages of using galaxy catalogs to prioritize wide-field follow-ups as a function of only two parameters: the three-dimensional volume within the field of view of a telescope after accounting for the GW distance measurement uncertainty, and the fraction of the GW sky localization uncertainty region that can be covered with telescope pointings. We find that the use of galaxy catalogs can improve the probability of successful imaging by ∼10% to ∼300% relative to follow-up strategies that do not utilize such catalogs for the scenarios we considered. We determine that catalogs with a 75% completeness perform comparably to complete catalogs in most cases, while 33%-complete catalogs can lead to lower follow-up success rates than complete catalogs for small fields of view, though still providing an advantage over strategies that do not use a catalog at all.« less

5. VIEW OF FRONT (WEST AND SOUTH SIDES) TO NORTHEAST. ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

5. VIEW OF FRONT (WEST AND SOUTH SIDES) TO NORTHEAST. VIEW TO NORTHEAST. NOTE THAT LARGE TREES PREVENT MORE COMPLETE VIEW FROM BETTER ANGLE. FOR MORE COMPLETE VIEW, SEE PHOTOGRAPHIC COPY OF 1916 PHOTO, NO. ID-17-C-35. - Boise Project, Boise Project Office, 214 Broadway, Boise, Ada County, ID

Predicting diabetes mellitus using SMOTE and ensemble machine learning approach: The Henry Ford ExercIse Testing (FIT) project.

PubMed

Alghamdi, Manal; Al-Mallah, Mouaz; Keteyian, Steven; Brawner, Clinton; Ehrman, Jonathan; Sakr, Sherif

2017-01-01

Machine learning is becoming a popular and important approach in the field of medical research. In this study, we investigate the relative performance of various machine learning methods such as Decision Tree, Naïve Bayes, Logistic Regression, Logistic Model Tree and Random Forests for predicting incident diabetes using medical records of cardiorespiratory fitness. In addition, we apply different techniques to uncover potential predictors of diabetes. This FIT project study used data of 32,555 patients who are free of any known coronary artery disease or heart failure who underwent clinician-referred exercise treadmill stress testing at Henry Ford Health Systems between 1991 and 2009 and had a complete 5-year follow-up. At the completion of the fifth year, 5,099 of those patients have developed diabetes. The dataset contained 62 attributes classified into four categories: demographic characteristics, disease history, medication use history, and stress test vital signs. We developed an Ensembling-based predictive model using 13 attributes that were selected based on their clinical importance, Multiple Linear Regression, and Information Gain Ranking methods. The negative effect of the imbalance class of the constructed model was handled by Synthetic Minority Oversampling Technique (SMOTE). The overall performance of the predictive model classifier was improved by the Ensemble machine learning approach using the Vote method with three Decision Trees (Naïve Bayes Tree, Random Forest, and Logistic Model Tree) and achieved high accuracy of prediction (AUC = 0.92). The study shows the potential of ensembling and SMOTE approaches for predicting incident diabetes using cardiorespiratory fitness data.

An evaluation of the completeness of drug-drug interaction-related information in package inserts.

PubMed

Ng, Giok Qin; Sklar, Grant Edward; Chng, Hui Ting

2017-02-01

The project aimed to evaluate the completeness of drug-drug interaction (DDI)-related information in package inserts (PIs) and develop a systematic approach to conduct the evaluation. DDI-related information in the branded PIs of statins, macrolides, protease inhibitors and selected drugs of narrow therapeutic index (DNTI) were evaluated against the criteria distilled from the Food and Drug Administration (FDA) labelling recommendation guidance document. Decision trees were crafted and employed in the evaluation process. Scores were computed to give each PI an overall completeness score and individual criterion completeness score. The Kruskal-Wallis test and Dunn's multiple comparison test were used to assess the differences in the completeness scores. The mean overall completeness score of the 21 PIs was 35.7 ± 13.4 % (range 12.2-62 %). Eight out of the 11 individual evaluation criterion had a mean completeness score below 50 %. A subclass analysis conducted revealed that PIs from the different drug classes differed in the type of DDI-related information, such that they are more complete or less complete. The completeness score of DDI-related information in the PIs varied extensively amongst and within drug classes. A consensus between the authorities and drug companies on the type and quality of DDI-related information to be included could improve their completeness in PIs and make PIs a valuable source of DDI reference. Decision trees, albeit not validated yet, lay the groundwork for a valuable tool to evaluate DDI-related or other drug information.

Optimizing Partial Credit Algorithms to Predict Student Performance

ERIC Educational Resources Information Center

Ostrow, Korinn; Donnelly, Chistopher; Heffernan, Neil

2015-01-01

As adaptive tutoring systems grow increasingly popular for the completion of classwork and homework, it is crucial to assess the manner in which students are scored within these platforms. The majority of systems, including ASSISTments, return the binary correctness of a student's first attempt at solving each problem. Yet for many teachers,…

High pressure cosmochemistry applied to major planetary interiors: Experimental studies

NASA Technical Reports Server (NTRS)

Nicol, M. F.; Johnson, M.; Koumvakalis, A. S.

1984-01-01

Progress is reported on a project to determine the properties and boundaries of high pressure phases of the H2-He-H2O-NH3-CH4 system that are needed to constrain theoretical models of the interiors of the major planets. This project is one of the first attempts to measure phase equilibria in binary fluid-solid systems in diamond anvil cells. Vibrational spectroscopy, direct visual observations, and X-ray diffraction crystallography of materials confined in externally heated cells are the primary experimental probes. Adiabats of these materials are also measured in order to constrain models of heat flow in these bodies and to detect phase transitions by thermal anomalies. Initial efforts involve the NH3-H2O binary. This system is especially relevant to models for surface reconstruction of the icy satellites of Jupiter and Saturn. Thermal analysis experiments were completed for the P-X space, p4GPa:0 or = 0.50, near room temperature. The cryostat, sample handling equipment, and optics needed to extend the optical P-T-X work below room temperature was completed.

Sky Localization of Complete Inspiral-Merger-Ringdown Signals for Nonspinning Black Hole Binaries with LISA

NASA Technical Reports Server (NTRS)

McWilliams, Sean T.; Lang, Ryan N.; Baker, John G.; Thorpe, James Ira

2011-01-01

We investigate the capability of LISA to measure the sky position of equal-mass, nonspinning black hole binaries, including for the first time the entire inspiral-merger-ringdown signal, the effect of the LISA orbits, and the complete three-channel LISA response. For an ensemble of systems near the peak of LISA's sensitivity band, with total rest mass of 2 x l0(exp 6) Stellar Mass at a redshift of z = 1 with random orientations and sky positions, we find median sky localization errors of approximately approx. 3 arcminutes. This is comparable to the field of view of powerful electromagnetic telescopes, such as the James Webb Space Telescope, that could be used to search for electromagnetic signals associated with merging black holes. We investigate the way in which parameter errors decrease with measurement time, focusing specifically on the additional information provided during the merger-ringdown segment of the signal. We find that this information improves all parameter estimates directly, rather than through diminishing correlations with any subset of well-determined parameters.

Adiabatic pipelining: a key to ternary computing with quantum dots.

PubMed

Pečar, P; Ramšak, A; Zimic, N; Mraz, M; Lebar Bajec, I

2008-12-10

The quantum-dot cellular automaton (QCA), a processing platform based on interacting quantum dots, was introduced by Lent in the mid-1990s. What followed was an exhilarating period with the development of the line, the functionally complete set of logic functions, as well as more complex processing structures, however all in the realm of binary logic. Regardless of these achievements, it has to be acknowledged that the use of binary logic is in computing systems mainly the end result of the technological limitations, which the designers had to cope with in the early days of their design. The first advancement of QCAs to multi-valued (ternary) processing was performed by Lebar Bajec et al, with the argument that processing platforms of the future should not disregard the clear advantages of multi-valued logic. Some of the elementary ternary QCAs, necessary for the construction of more complex processing entities, however, lead to a remarkable increase in size when compared to their binary counterparts. This somewhat negates the advantages gained by entering the ternary computing domain. As it turned out, even the binary QCA had its initial hiccups, which have been solved by the introduction of adiabatic switching and the application of adiabatic pipeline approaches. We present here a study that introduces adiabatic switching into the ternary QCA and employs the adiabatic pipeline approach to successfully solve the issues of elementary ternary QCAs. What is more, the ternary QCAs presented here are sizewise comparable to binary QCAs. This in our view might serve towards their faster adoption.

Modelling tree dynamics to assess the implementation of EU policies related to afforestation in SW Spain rangelands

NASA Astrophysics Data System (ADS)

Herguido, Estela; Pulido, Manuel; Francisco Lavado Contador, Joaquín; Schnabel, Susanne

2017-04-01

In Iberian dehesas and montados, the lack of tree recruitment compromises its long-term sustainability. However, in marginal areas of dehesas shrub encroachment facilitates tree recruitment while altering the distinctive physiognomic and cultural characteristics of the system. These are ongoing processes that should be considered when designing afforestation measures and policies. Based on spatial variables, we modeled the proneness of a piece of land to undergo tree recruitment and the results were related with the afforestation measures carried out under the UE First Afforestation Agricultural Land Program between 1992 and 2008. We analyzed the temporal tree population dynamics in 800 randomly selected plots of 100 m radius (2,510 ha in total) in dehesas and treeless pasturelands of Extremadura (hereafter rangelands). Tree changes were revealed by comparing aerial images taken in 1956 with orthophotographs and infrared ones from 2012. Spatial models that predict the areas prone either to lack tree recruitment or with recruitment were developed and based on three data mining algorithms: MARS (Multivariate Adaptive Regression Splines), Random Forest (RF) and Stochastic Gradient Boosting (Tree-Net, TN). Recruited-tree locations (1) vs. locations of places with no recruitment (0) (randomly selected from the study areas) were used as the binary dependent variable. A 5% of the data were used as test data set. As candidate explanatory variables we used 51 different topographic, climatic, bioclimatic, land cover-related and edaphic ones. The statistical models developed were extrapolated to the spatial context of the afforested areas in the region and also to the whole Extremenian rangelands, and the percentage of area modelled as prone to tree recruitment was calculated for each case. A total of 46,674.63 ha were afforested with holm oak (Quercus ilex) or cork oak (Quercus suber) in the studied rangelands under the UE First Afforestation Agricultural Land Program. In the sampled plots, 16,747 trees were detected as recruited, while 47,058 and 12,803 were present in both dates and lost during the studied period, respectively. Based on the Area Under the ROC Curve (AUC), all the data mining models considered showed a high fitness (MARS AUC= 0.86; TN AUC= 0.92; RF AUC= 0.95) and low misclassification rates. Correctly predicted test samples for absence and presence of tree recruitment accounted respectively to 78.3% and 76.8% when using MARS, 90.8% and 90.8% using TN and 88.9% and 89.1% using RF. The spatial patterns of the different models were similar. However, attending only the percentage of area prone to tree recruitment, outstanding differences were observed among models considering the total surface of rangelands (36.03% in MARS, 22.88% in TN and 6.72 % in RF). Despite these differences, when comparing the results with those of the afforested surfaces (31.73% in MARS, 20.70% in TN and 5.63 % in RF) the three algorithms pointed to similar conclusions, i.e. the afforestations performed in rangelands of Extremadura under UE First Afforestation Agricultural Land Program, barely discriminate between areas with or without natural regeneration. In conclusion, data mining technics are suitable to develop high-performance spatial models of vegetation dynamics. These models could be useful for policy and decision makers aimed at assessing the implementation of afforestation measures and the selection of more adequate locations.

Modeling the Complete Gravitational Wave Spectrum of Neutron Star Mergers.

PubMed

Bernuzzi, Sebastiano; Dietrich, Tim; Nagar, Alessandro

2015-08-28

In the context of neutron star mergers, we study the gravitational wave spectrum of the merger remnant using numerical relativity simulations. Postmerger spectra are characterized by a main peak frequency f2 related to the particular structure and dynamics of the remnant hot hypermassive neutron star. We show that f(2) is correlated with the tidal coupling constant κ(2)^T that characterizes the binary tidal interactions during the late-inspiral merger. The relation f(2)(κ(2)^T) depends very weakly on the binary total mass, mass ratio, equation of state, and thermal effects. This observation opens up the possibility of developing a model of the gravitational spectrum of every merger unifying the late-inspiral and postmerger descriptions.

A simple plug-in bagging ensemble based on threshold-moving for classifying binary and multiclass imbalanced data.

PubMed

Collell, Guillem; Prelec, Drazen; Patil, Kaustubh R

2018-01-31

Class imbalance presents a major hurdle in the application of classification methods. A commonly taken approach is to learn ensembles of classifiers using rebalanced data. Examples include bootstrap averaging (bagging) combined with either undersampling or oversampling of the minority class examples. However, rebalancing methods entail asymmetric changes to the examples of different classes, which in turn can introduce their own biases. Furthermore, these methods often require specifying the performance measure of interest a priori, i.e., before learning. An alternative is to employ the threshold moving technique, which applies a threshold to the continuous output of a model, offering the possibility to adapt to a performance measure a posteriori , i.e., a plug-in method. Surprisingly, little attention has been paid to this combination of a bagging ensemble and threshold-moving. In this paper, we study this combination and demonstrate its competitiveness. Contrary to the other resampling methods, we preserve the natural class distribution of the data resulting in well-calibrated posterior probabilities. Additionally, we extend the proposed method to handle multiclass data. We validated our method on binary and multiclass benchmark data sets by using both, decision trees and neural networks as base classifiers. We perform analyses that provide insights into the proposed method.

Coevolution study of mitochondria respiratory chain proteins: toward the understanding of protein--protein interaction.

PubMed

Yang, Ming; Ge, Yan; Wu, Jiayan; Xiao, Jingfa; Yu, Jun

2011-05-20

Coevolution can be seen as the interdependency between evolutionary histories. In the context of protein evolution, functional correlation proteins are ever-present coordinated evolutionary characters without disruption of organismal integrity. As to complex system, there are two forms of protein--protein interactions in vivo, which refer to inter-complex interaction and intra-complex interaction. In this paper, we studied the difference of coevolution characters between inter-complex interaction and intra-complex interaction using "Mirror tree" method on the respiratory chain (RC) proteins. We divided the correlation coefficients of every pairwise RC proteins into two groups corresponding to the binary protein--protein interaction in intra-complex and the binary protein--protein interaction in inter-complex, respectively. A dramatical discrepancy is detected between the coevolution characters of the two sets of protein interactions (Wilcoxon test, p-value = 4.4 × 10(-6)). Our finding reveals some critical information on coevolutionary study and assists the mechanical investigation of protein--protein interaction. Furthermore, the results also provide some unique clue for supramolecular organization of protein complexes in the mitochondrial inner membrane. More detailed binding sites map and genome information of nuclear encoded RC proteins will be extraordinary valuable for the further mitochondria dynamics study. Copyright © 2011. Published by Elsevier Ltd.

Minimizing effects of methodological decisions on interpretation and prediction in species distribution studies: An example with background selection

USGS Publications Warehouse

Jarnevich, Catherine S.; Talbert, Marian; Morisette, Jeffrey T.; Aldridge, Cameron L.; Brown, Cynthia; Kumar, Sunil; Manier, Daniel; Talbert, Colin; Holcombe, Tracy R.

2017-01-01

Evaluating the conditions where a species can persist is an important question in ecology both to understand tolerances of organisms and to predict distributions across landscapes. Presence data combined with background or pseudo-absence locations are commonly used with species distribution modeling to develop these relationships. However, there is not a standard method to generate background or pseudo-absence locations, and method choice affects model outcomes. We evaluated combinations of both model algorithms (simple and complex generalized linear models, multivariate adaptive regression splines, Maxent, boosted regression trees, and random forest) and background methods (random, minimum convex polygon, and continuous and binary kernel density estimator (KDE)) to assess the sensitivity of model outcomes to choices made. We evaluated six questions related to model results, including five beyond the common comparison of model accuracy assessment metrics (biological interpretability of response curves, cross-validation robustness, independent data accuracy and robustness, and prediction consistency). For our case study with cheatgrass in the western US, random forest was least sensitive to background choice and the binary KDE method was least sensitive to model algorithm choice. While this outcome may not hold for other locations or species, the methods we used can be implemented to help determine appropriate methodologies for particular research questions.

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

Petiteau, Antoine; Babak, Stanislav; Sesana, Alberto

Gravitational wave (GW) signals from coalescing massive black hole (MBH) binaries could be used as standard sirens to measure cosmological parameters. The future space-based GW observatory Laser Interferometer Space Antenna (LISA) will detect up to a hundred of those events, providing very accurate measurements of their luminosity distances. To constrain the cosmological parameters, we also need to measure the redshift of the galaxy (or cluster of galaxies) hosting the merger. This requires the identification of a distinctive electromagnetic event associated with the binary coalescence. However, putative electromagnetic signatures may be too weak to be observed. Instead, we study here themore » possibility of constraining the cosmological parameters by enforcing statistical consistency between all the possible hosts detected within the measurement error box of a few dozen of low-redshift (z < 3) events. We construct MBH populations using merger tree realizations of the dark matter hierarchy in a {Lambda}CDM universe, and we use data from the Millennium simulation to model the galaxy distribution in the LISA error box. We show that, assuming that all the other cosmological parameters are known, the parameter w describing the dark energy equation of state can be constrained to a 4%-8% level (2{sigma} error), competitive with current uncertainties obtained by type Ia supernovae measurements, providing an independent test of our cosmological model.« less

FleCSPH notes

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

Lim, Hyun; Loiseau, Julien

FleCSI is a compile-time con gurable framework designed to support multi-physics application development. As such, FleCSI provides a very general set of infrastructure design patterns that can be specialized and extended to suit the needs of a broad variety of solver and data requirements. FleCSI currently supports multi-dimensional mesh topology, geometry, and adjacency information, as well as n-dimensional hashed-tree data structures, graph partitioning interfaces, and dependency closures. FleCSI introduces a functional programming model with control, execution, and data abstractions that are consistent both with MPI and with state-of-the-art, task-based runtimes such as Legion and Charm++. The abstraction layer insulates developersmore » from the underlying runtime, while allowing support for multiple runtime systems including conventional models like asynchronous MPI. The intent is to provide developers with a concrete set of user-friendly programming tools that can be used now, while allowing exibility in choosing runtime implementations and optimization that can be applied to future architectures and runtimes. FleCSI's control and execution models provide formal nomenclature for describing poorly understood concepts such as kernels and tasks. FleCSI's data model provides a low-buy-in approach that makes it an attractive option for many application projects, as developers are not locked into particular layouts or data structure representations. FleCSI currently provides a parallel but not distributed implementation of Binary, Quad and Oct-tree topology. This implementation is base on space lling curves domain decomposition, the Morton order. The current FleCSI version requires the implementation of a driver and a specialization driver. The role of the specialization driver is to provide the data distribution. This feature is not complete in FleCSI code and we provide it. The next step will be to incorporate it directly from FleCSPH to FleCSI as we reach a good level of performance. Then the driver represent the general execution of the resolution without worrying of the data locality and communications. As FleCSI is an On-Development code the structure may change in the future and we keep track of these changes in FleCSPH.« less

Enumerating all maximal frequent subtrees in collections of phylogenetic trees

PubMed Central

2014-01-01

Background A common problem in phylogenetic analysis is to identify frequent patterns in a collection of phylogenetic trees. The goal is, roughly, to find a subset of the species (taxa) on which all or some significant subset of the trees agree. One popular method to do so is through maximum agreement subtrees (MASTs). MASTs are also used, among other things, as a metric for comparing phylogenetic trees, computing congruence indices and to identify horizontal gene transfer events. Results We give algorithms and experimental results for two approaches to identify common patterns in a collection of phylogenetic trees, one based on agreement subtrees, called maximal agreement subtrees, the other on frequent subtrees, called maximal frequent subtrees. These approaches can return subtrees on larger sets of taxa than MASTs, and can reveal new common phylogenetic relationships not present in either MASTs or the majority rule tree (a popular consensus method). Our current implementation is available on the web at https://code.google.com/p/mfst-miner/. Conclusions Our computational results confirm that maximal agreement subtrees and all maximal frequent subtrees can reveal a more complete phylogenetic picture of the common patterns in collections of phylogenetic trees than maximum agreement subtrees; they are also often more resolved than the majority rule tree. Further, our experiments show that enumerating maximal frequent subtrees is considerably more practical than enumerating ordinary (not necessarily maximal) frequent subtrees. PMID:25061474